kallithea Changeset - c9bcfe2d2ade

 <!doctype html>
 <html>
   <head>
     <meta charset="utf-8">
     <title>CodeMirror: APL mode</title>
     <link rel="stylesheet" href="../../doc/docs.css">
     <link rel="stylesheet" href="../../lib/codemirror.css">
     <link rel="stylesheet" href="../../doc/docs.css">
     <link rel="stylesheet" href="../../lib/codemirror.css">
     <script src="../../lib/codemirror.js"></script>
     <script src="../../addon/edit/matchbrackets.js"></script>
     <script src="apl.js"></script>
     <style>
-	.CodeMirror { border: 2px inset #dee; }
+    .CodeMirror { border: 2px inset #dee; }
     </style>
   </head>
   <body>
     <h1>CodeMirror: APL mode</h1>
 <form><textarea id="code" name="code">

rhodecode/public/js/mode/asterisk/index.html

➞

Show inline comments

@@ @@ -49,72 +49,72 @@ include => default @@
 [demo]
 include => stdexten
+;
 ; We start with what to do when a call first comes in.
+;
 exten => s,1,Wait(1)			; Wait a second, just for fun
 same  => n,Answer			; Answer the line
 same  => n,Set(TIMEOUT(digit)=5)	; Set Digit Timeout to 5 seconds
 same  => n,Set(TIMEOUT(response)=10)	; Set Response Timeout to 10 seconds
 same  => n(restart),BackGround(demo-congrats)	; Play a congratulatory message
 same  => n(instruct),BackGround(demo-instruct)	; Play some instructions
 same  => n,WaitExten			; Wait for an extension to be dialed.
 exten => s,1,Wait(1)            ; Wait a second, just for fun
 same  => n,Answer           ; Answer the line
 same  => n,Set(TIMEOUT(digit)=5)    ; Set Digit Timeout to 5 seconds
 same  => n,Set(TIMEOUT(response)=10)    ; Set Response Timeout to 10 seconds
 same  => n(restart),BackGround(demo-congrats)   ; Play a congratulatory message
 same  => n(instruct),BackGround(demo-instruct)  ; Play some instructions
 same  => n,WaitExten            ; Wait for an extension to be dialed.
-exten => 2,1,BackGround(demo-moreinfo)	; Give some more information.
+exten => 2,1,BackGround(demo-moreinfo)  ; Give some more information.
 exten => 2,n,Goto(s,instruct)
 exten => 3,1,Set(LANGUAGE()=fr)		; Set language to french
 exten => 3,n,Goto(s,restart)		; Start with the congratulations
 exten => 3,1,Set(LANGUAGE()=fr)     ; Set language to french
 exten => 3,n,Goto(s,restart)        ; Start with the congratulations
 exten => 1000,1,Goto(default,s,1)
+;
 ; We also create an example user, 1234, who is on the console and has
 ; voicemail, etc.
+;
 exten => 1234,1,Playback(transfer,skip)		; "Please hold while..."
 					; (but skip if channel is not up)
 exten => 1234,1,Playback(transfer,skip)     ; "Please hold while..."
                     ; (but skip if channel is not up)
 exten => 1234,n,Gosub(${EXTEN},stdexten(${GLOBAL(CONSOLE)}))
-exten => 1234,n,Goto(default,s,1)		; exited Voicemail
+exten => 1234,n,Goto(default,s,1)       ; exited Voicemail
-exten => 1235,1,Voicemail(1234,u)		; Right to voicemail
+exten => 1235,1,Voicemail(1234,u)       ; Right to voicemail
 exten => 1236,1,Dial(Console/dsp)		; Ring forever
 exten => 1236,n,Voicemail(1234,b)		; Unless busy
 exten => 1236,1,Dial(Console/dsp)       ; Ring forever
 exten => 1236,n,Voicemail(1234,b)       ; Unless busy
+;
 ; # for when they're done with the demo
+;
 exten => #,1,Playback(demo-thanks)	; "Thanks for trying the demo"
 exten => #,n,Hangup			; Hang them up.
 exten => #,1,Playback(demo-thanks)  ; "Thanks for trying the demo"
 exten => #,n,Hangup         ; Hang them up.
+;
 ; A timeout and "invalid extension rule"
+;
 exten => t,1,Goto(#,1)			; If they take too long, give up
 exten => i,1,Playback(invalid)		; "That's not valid, try again"
 exten => t,1,Goto(#,1)          ; If they take too long, give up
 exten => i,1,Playback(invalid)      ; "That's not valid, try again"
+;
 ; Create an extension, 500, for dialing the
 ; Asterisk demo.
+;
 exten => 500,1,Playback(demo-abouttotry); Let them know what's going on
 exten => 500,n,Dial(IAX2/guest@pbx.digium.com/s@default)	; Call the Asterisk demo
 exten => 500,n,Playback(demo-nogo)	; Couldn't connect to the demo site
 exten => 500,n,Goto(s,6)		; Return to the start over message.
 exten => 500,n,Dial(IAX2/guest@pbx.digium.com/s@default)    ; Call the Asterisk demo
 exten => 500,n,Playback(demo-nogo)  ; Couldn't connect to the demo site
 exten => 500,n,Goto(s,6)        ; Return to the start over message.
+;
 ; Create an extension, 600, for evaluating echo latency.
+;
 exten => 600,1,Playback(demo-echotest)	; Let them know what's going on
 exten => 600,n,Echo			; Do the echo test
 exten => 600,n,Playback(demo-echodone)	; Let them know it's over
 exten => 600,n,Goto(s,6)		; Start over
 exten => 600,1,Playback(demo-echotest)  ; Let them know what's going on
 exten => 600,n,Echo         ; Do the echo test
 exten => 600,n,Playback(demo-echodone)  ; Let them know it's over
 exten => 600,n,Goto(s,6)        ; Start over
+;
-;	You can use the Macro Page to intercom a individual user
+;   You can use the Macro Page to intercom a individual user
 exten => 76245,1,Macro(page,SIP/Grandstream1)
 ; or if your peernames are the same as extensions
 exten => _7XXX,1,Macro(page,SIP/${EXTEN})
+;
+;
 ; System Wide Page at extension 7999

rhodecode/public/js/mode/clike/scala.html

➞

Show inline comments

@@ @@ -16,13 +16,13 @@ @@
         padding: 0;
         max-width:inherit;
         height: 100%;
+      }
       html, form, .CodeMirror, .CodeMirror-scroll
+      {
-        height: 100%;
         height: 100%;
+      }
     </style>
   </head>
   <body>
 <form>
 <textarea id="code" name="code">
@@ @@ -41,46 +41,46 @@ @@
   import mutable.{ Builder, ListBuffer }
   import annotation.{tailrec, migration, bridge}
   import annotation.unchecked.{ uncheckedVariance => uV }
   import parallel.ParIterable
   /** A template trait for traversable collections of type `Traversable[A]`.
+   *
+   *
    *  $traversableInfo
    *  @define mutability
    *  @define traversableInfo
    *  This is a base trait of all kinds of $mutability Scala collections. It
    *  implements the behavior common to all collections, in terms of a method
    *  `foreach` with signature:
    * {{{
    *     def foreach[U](f: Elem => U): Unit
    * }}}
-   *  Collection classes mixing in this trait provide a concrete
    *  Collection classes mixing in this trait provide a concrete
    *  `foreach` method which traverses all the
    *  elements contained in the collection, applying a given function to each.
    *  They also need to provide a method `newBuilder`
    *  which creates a builder for collections of the same kind.
+   *
+   *
    *  A traversable class might or might not have two properties: strictness
    *  and orderedness. Neither is represented as a type.
+   *
+   *
    *  The instances of a strict collection class have all their elements
    *  computed before they can be used as values. By contrast, instances of
    *  a non-strict collection class may defer computation of some of their
    *  elements until after the instance is available as a value.
    *  A typical example of a non-strict collection class is a
    *  <a href="../immutable/Stream.html" target="ContentFrame">
    *  `scala.collection.immutable.Stream`</a>.
    *  A more general class of examples are `TraversableViews`.
+   *
+   *
    *  If a collection is an instance of an ordered collection class, traversing
    *  its elements with `foreach` will always visit elements in the
    *  same order, even for different runs of the program. If the class is not
    *  ordered, `foreach` can visit elements in different orders for
    *  different runs (but it will keep the same order in the same run).'
+   *
+   *
    *  A typical example of a collection class which is not ordered is a
    *  `HashMap` of objects. The traversal order for hash maps will
    *  depend on the hash codes of its elements, and these hash codes might
    *  differ from one run to the next. By contrast, a `LinkedHashMap`
    *  is ordered because it's `foreach` method visits elements in the
    *  order they were inserted into the `HashMap`.
@@ @@ -91,13 +91,13 @@ @@
    *  @tparam A    the element type of the collection
    *  @tparam Repr the type of the actual collection containing the elements.
+   *
    *  @define Coll Traversable
    *  @define coll traversable collection
    */
-  trait TraversableLike[+A, +Repr] extends HasNewBuilder[A, Repr]
   trait TraversableLike[+A, +Repr] extends HasNewBuilder[A, Repr]
                                       with FilterMonadic[A, Repr]
                                       with TraversableOnce[A]
                                       with GenTraversableLike[A, Repr]
                                       with Parallelizable[A, ParIterable[A]]
+  {
     self =>
@@ @@ -128,21 +128,21 @@ @@
      */
     protected[this] def newBuilder: Builder[A, Repr]
     protected[this] def parCombiner = ParIterable.newCombiner[A]
     /** Applies a function `f` to all elements of this $coll.
+     *
+     *
      *    Note: this method underlies the implementation of most other bulk operations.
      *    It's important to implement this method in an efficient way.
+     *
+     *
+     *
      *  @param  f   the function that is applied for its side-effect to every element.
      *              The result of function `f` is discarded.
+     *
      *  @tparam  U  the type parameter describing the result of function `f`.
+     *
      *  @tparam  U  the type parameter describing the result of function `f`.
      *              This result will always be ignored. Typically `U` is `Unit`,
      *              but this is not necessary.
+     *
      *  @usecase def foreach(f: A => Unit): Unit
      */
     def foreach[U](f: A => U): Unit
@@ @@ -164,13 +164,13 @@ @@
     /** Tests whether this $coll is known to have a finite size.
      *  All strict collections are known to have finite size. For a non-strict collection
      *  such as `Stream`, the predicate returns `true` if all elements have been computed.
      *  It returns `false` if the stream is not yet evaluated to the end.
+     *
-     *  Note: many collection methods will not work on collections of infinite sizes.
      *  Note: many collection methods will not work on collections of infinite sizes.
+     *
      *  @return  `true` if this collection is known to have finite size, `false` otherwise.
      */
     def hasDefiniteSize = true
     def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
@@ @@ -185,22 +185,22 @@ @@
     def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That =
       ++(that: GenTraversableOnce[B])(bf)
     /** Concatenates this $coll with the elements of a traversable collection.
      *  It differs from ++ in that the right operand determines the type of the
      *  resulting collection rather than the left one.
+     *
+     *
      *  @param that   the traversable to append.
-     *  @tparam B     the element type of the returned collection.
      *  @tparam B     the element type of the returned collection.
      *  @tparam That  $thatinfo
      *  @param bf     $bfinfo
      *  @return       a new collection of type `That` which contains all elements
      *                of this $coll followed by all elements of `that`.
+     *
+     *
      *  @usecase def ++:[B](that: TraversableOnce[B]): $Coll[B]
+     *
+     *
      *  @return       a new $coll which contains all elements of this $coll
      *                followed by all elements of `that`.
      */
     def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
       val b = bf(repr)
       if (that.isInstanceOf[IndexedSeqLike[_, _]]) b.sizeHint(this, that.size)
@@ @@ -216,13 +216,13 @@ @@
      */
     def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That =
       (that ++ seq)(breakOut)
     def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = {
       val b = bf(repr)
-      b.sizeHint(this)
       b.sizeHint(this)
       for (x <- this) b += f(x)
       b.result
+    }
     def flatMap[B, That](f: A => GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
       val b = bf(repr)
@@ @@ -235,13 +235,13 @@ @@
      *  @param p     the predicate used to test elements.
      *  @return      a new $coll consisting of all elements of this $coll that satisfy the given
      *               predicate `p`. The order of the elements is preserved.
      */
     def filter(p: A => Boolean): Repr = {
       val b = newBuilder
-      for (x <- this)
       for (x <- this)
         if (p(x)) b += x
       b.result
+    }
     /** Selects all elements of this $coll which do not satisfy a predicate.
+     *
@@ @@ -266,32 +266,32 @@ @@
      *  @param bf     $bfinfo
      *  @return       a new collection of type `That` resulting from applying the option-valued function
      *                `f` to each element and collecting all defined results.
      *                The order of the elements is preserved.
+     *
      *  @usecase def filterMap[B](f: A => Option[B]): $Coll[B]
+     *
+     *
      *  @param pf     the partial function which filters and maps the $coll.
      *  @return       a new $coll resulting from applying the given option-valued function
      *                `f` to each element and collecting all defined results.
      *                The order of the elements is preserved.
     def filterMap[B, That](f: A => Option[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
       val b = bf(repr)
-      for (x <- this)
       for (x <- this)
         f(x) match {
           case Some(y) => b += y
           case _ =>
+        }
       b.result
+    }
      */
     /** Partitions this $coll in two ${coll}s according to a predicate.
+     *
      *  @param p the predicate on which to partition.
-     *  @return  a pair of ${coll}s: the first $coll consists of all elements that
      *  @return  a pair of ${coll}s: the first $coll consists of all elements that
      *           satisfy the predicate `p` and the second $coll consists of all elements
      *           that don't. The relative order of the elements in the resulting ${coll}s
      *           is the same as in the original $coll.
      */
     def partition(p: A => Boolean): (Repr, Repr) = {
       val l, r = newBuilder
@@ @@ -345,13 +345,13 @@ @@
           if (p(x)) { result = true; break }
+      }
       result
+    }
     /** Finds the first element of the $coll satisfying a predicate, if any.
+     *
+     *
      *  $mayNotTerminateInf
      *  $orderDependent
+     *
      *  @param p    the predicate used to test elements.
      *  @return     an option value containing the first element in the $coll
      *              that satisfies `p`, or `None` if none exists.
@@ @@ -416,13 +416,13 @@ @@
     /** Selects all elements except the first.
      *  $orderDependent
      *  @return  a $coll consisting of all elements of this $coll
      *           except the first one.
      *  @throws `UnsupportedOperationException` if the $coll is empty.
-     */
      */
     override def tail: Repr = {
       if (isEmpty) throw new UnsupportedOperationException("empty.tail")
       drop(1)
+    }
     /** Selects the last element.
@@ @@ -462,13 +462,13 @@ @@
+      }
       b.result
+    }
     def take(n: Int): Repr = slice(0, n)
-    def drop(n: Int): Repr =
     def drop(n: Int): Repr =
       if (n <= 0) {
         val b = newBuilder
         b.sizeHint(this)
         b ++= thisCollection result
+      }
       else sliceWithKnownDelta(n, Int.MaxValue, -n)
@@ @@ -498,13 +498,13 @@ @@
+    }
     // Precondition: from >= 0
     private[scala] def sliceWithKnownBound(from: Int, until: Int): Repr = {
       val b = newBuilder
       if (until <= from) b.result
       else {
-        b.sizeHintBounded(until - from, this)
         b.sizeHintBounded(until - from, this)
         sliceInternal(from, until, b)
+      }
+    }
     def takeWhile(p: A => Boolean): Repr = {
       val b = newBuilder
@@ @@ -552,13 +552,13 @@ @@
     /** Iterates over the tails of this $coll. The first value will be this
      *  $coll and the final one will be an empty $coll, with the intervening
      *  values the results of successive applications of `tail`.
+     *
      *  @return   an iterator over all the tails of this $coll
      *  @example  `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`
-     */
      */
     def tails: Iterator[Repr] = iterateUntilEmpty(_.tail)
     /** Iterates over the inits of this $coll. The first value will be this
      *  $coll and the final one will be an empty $coll, with the intervening
      *  values the results of successive applications of `init`.
+     *
@@ @@ -571,18 +571,18 @@ @@
      *  Fills the given array `xs` with at most `len` elements of
      *  this $coll, starting at position `start`.
      *  Copying will stop once either the end of the current $coll is reached,
      *  or the end of the array is reached, or `len` elements have been copied.
+     *
      *  $willNotTerminateInf
+     *
+     *
      *  @param  xs     the array to fill.
      *  @param  start  the starting index.
      *  @param  len    the maximal number of elements to copy.
      *  @tparam B      the type of the elements of the array.
+     *
      *  @tparam B      the type of the elements of the array.
+     *
+     *
      *  @usecase def copyToArray(xs: Array[A], start: Int, len: Int): Unit
      */
     def copyToArray[B >: A](xs: Array[B], start: Int, len: Int) {
       var i = start
       val end = (start + len) min xs.length
@@ @@ -620,28 +620,28 @@ @@
       val idx2 = string.indexOf('$')
       if (idx2 != -1) string = string.substring(0, idx2)
       string
+    }
     /** Creates a non-strict view of this $coll.
+     *
+     *
      *  @return a non-strict view of this $coll.
      */
     def view = new TraversableView[A, Repr] {
       protected lazy val underlying = self.repr
       override def foreach[U](f: A => U) = self foreach f
+    }
     /** Creates a non-strict view of a slice of this $coll.
+     *
      *  Note: the difference between `view` and `slice` is that `view` produces
      *        a view of the current $coll, whereas `slice` produces a new $coll.
+     *
+     *
      *  Note: `view(from, to)` is equivalent to `view.slice(from, to)`
      *  $orderDependent
+     *
+     *
      *  @param from   the index of the first element of the view
      *  @param until  the index of the element following the view
      *  @return a non-strict view of a slice of this $coll, starting at index `from`
      *  and extending up to (but not including) index `until`.
      */
     def view(from: Int, until: Int): TraversableView[A, Repr] = view.slice(from, until)
@@ @@ -650,13 +650,13 @@ @@
+     *
      *  Note: the difference between `c filter p` and `c withFilter p` is that
      *        the former creates a new collection, whereas the latter only
      *        restricts the domain of subsequent `map`, `flatMap`, `foreach`,
      *        and `withFilter` operations.
      *  $orderDependent
+     *
+     *
      *  @param p   the predicate used to test elements.
      *  @return    an object of class `WithFilter`, which supports
      *             `map`, `flatMap`, `foreach`, and `withFilter` operations.
      *             All these operations apply to those elements of this $coll which
      *             satisfy the predicate `p`.
      */
@@ @@ -675,75 +675,75 @@ @@
        *  @tparam That  $thatinfo
        *  @param bf     $bfinfo
        *  @return       a new collection of type `That` resulting from applying
        *                the given function `f` to each element of the outer $coll
        *                that satisfies predicate `p` and collecting the results.
+       *
        *  @usecase def map[B](f: A => B): $Coll[B]
+       *
        *  @usecase def map[B](f: A => B): $Coll[B]
+       *
        *  @return       a new $coll resulting from applying the given function
        *                `f` to each element of the outer $coll that satisfies
        *                predicate `p` and collecting the results.
        */
       def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = {
         val b = bf(repr)
-        for (x <- self)
         for (x <- self)
           if (p(x)) b += f(x)
         b.result
+      }
       /** Builds a new collection by applying a function to all elements of the
        *  outer $coll containing this `WithFilter` instance that satisfy
-       *  predicate `p` and concatenating the results.
        *  predicate `p` and concatenating the results.
+       *
        *  @param f      the function to apply to each element.
        *  @tparam B     the element type of the returned collection.
        *  @tparam That  $thatinfo
        *  @param bf     $bfinfo
        *  @return       a new collection of type `That` resulting from applying
        *                the given collection-valued function `f` to each element
        *                of the outer $coll that satisfies predicate `p` and
        *                concatenating the results.
+       *
        *  @usecase def flatMap[B](f: A => TraversableOnce[B]): $Coll[B]
+       *
+       *
        *  @return       a new $coll resulting from applying the given collection-valued function
        *                `f` to each element of the outer $coll that satisfies predicate `p` and concatenating the results.
        */
       def flatMap[B, That](f: A => GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = {
         val b = bf(repr)
-        for (x <- self)
         for (x <- self)
           if (p(x)) b ++= f(x).seq
         b.result
+      }
       /** Applies a function `f` to all elements of the outer $coll containing
        *  this `WithFilter` instance that satisfy predicate `p`.
+       *
        *  @param  f   the function that is applied for its side-effect to every element.
        *              The result of function `f` is discarded.
+       *
        *  @tparam  U  the type parameter describing the result of function `f`.
+       *
        *  @tparam  U  the type parameter describing the result of function `f`.
        *              This result will always be ignored. Typically `U` is `Unit`,
        *              but this is not necessary.
+       *
        *  @usecase def foreach(f: A => Unit): Unit
        */
       def foreach[U](f: A => U): Unit =
         for (x <- self)
        */
       def foreach[U](f: A => U): Unit =
         for (x <- self)
           if (p(x)) f(x)
       /** Further refines the filter for this $coll.
+       *
        *  @param q   the predicate used to test elements.
        *  @return    an object of class `WithFilter`, which supports
        *             `map`, `flatMap`, `foreach`, and `withFilter` operations.
        *             All these operations apply to those elements of this $coll which
        *             satisfy the predicate `q` in addition to the predicate `p`.
        */
-      def withFilter(q: A => Boolean): WithFilter =
       def withFilter(q: A => Boolean): WithFilter =
         new WithFilter(x => p(x) && q(x))
+    }
     // A helper for tails and inits.
     private def iterateUntilEmpty(f: Traversable[A @uV] => Traversable[A @uV]): Iterator[Repr] = {
       val it = Iterator.iterate(thisCollection)(f) takeWhile (x => !x.isEmpty)

rhodecode/public/js/mode/cobol/index.html

➞

Show inline comments

@@ @@ -80,13 +80,13 @@ @@
 </p>
 <textarea id="code" name="code">
 ---------1---------2---------3---------4---------5---------6---------7---------8
 12345678911234567892123456789312345678941234567895123456789612345678971234567898
 IDENTIFICATION DIVISION.                                        MODTGHERE
 PROGRAM-ID.       SAMPLE.
-AUTHOR.           TEST SAM.
 AUTHOR.           TEST SAM.
 DATE-WRITTEN.     5 February 2013
 * A sample program just to show the form.
 * The program copies its input to the output,
 * and counts the number of records.
 * At the end this number is printed.
@@ @@ -116,18 +116,18 @@ @@
 01  RECORDS-WRITTEN         PIC 99.
 01  DETAIL-LINE.
 05  FILLER              PIC X(7)      VALUE SPACES.
 05  RECORD-IMAGE        PIC X(43).
 05  FILLER              PIC X(30)     VALUE SPACES.
 01  SUMMARY-LINE.
 05  FILLER              PIC X(7)      VALUE SPACES.
 05  TOTAL-READ          PIC 99.
 05  FILLER              PIC X         VALUE SPACE.
-05  FILLER              PIC X(17)
 05  FILLER              PIC X(17)
 VALUE  'Records were read'.
 05  FILLER              PIC X(53)     VALUE SPACES.
 PROCEDURE DIVISION.
 PREPARE-SENIOR-REPORT.
@@ @@ -148,29 +148,29 @@ @@
 MOVE STUDENT-IN TO RECORD-IMAGE.
 MOVE DETAIL-LINE TO PRINT-LINE.
 WRITE PRINT-LINE.
 ADD 1 TO RECORDS-WRITTEN.
 READ STUDENT-FILE
 AT END MOVE 'NO' TO DATA-REMAINS-SWITCH
-END-READ.
 END-READ.
 PRINT-SUMMARY.
 MOVE RECORDS-WRITTEN TO TOTAL-READ.
 MOVE SUMMARY-LINE TO PRINT-LINE.
-WRITE PRINT-LINE.
 WRITE PRINT-LINE.
 </textarea>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,
         matchBrackets: true,
         mode: "text/x-cobol",
         theme : "twilight",
         styleActiveLine: true,
-        showCursorWhenSelecting : true,
         showCursorWhenSelecting : true,
       });
       function selectTheme() {
         var themeInput = document.getElementById("selectTheme");
         var theme = themeInput.options[themeInput.selectedIndex].innerHTML;
         editor.setOption("theme", theme);
+      }

rhodecode/public/js/mode/coffeescript/index.html

➞

Show inline comments

@@ @@ -13,16 +13,16 @@ @@
     <h1>CodeMirror: CoffeeScript mode</h1>
     <form><textarea id="code" name="code">
 # CoffeeScript mode for CodeMirror
 # Copyright (c) 2011 Jeff Pickhardt, released under
 # the MIT License.
+#
-# Modified from the Python CodeMirror mode, which also is
 # Modified from the Python CodeMirror mode, which also is
 # under the MIT License Copyright (c) 2010 Timothy Farrell.
+#
-# The following script, Underscore.coffee, is used to
 # The following script, Underscore.coffee, is used to
 # demonstrate CoffeeScript mode for CodeMirror.
+#
 # To download CoffeeScript mode for CodeMirror, go to:
 # https://github.com/pickhardt/coffeescript-codemirror-mode
 # **Underscore.coffee

rhodecode/public/js/mode/diff/index.html

➞

Show inline comments

@@ @@ -35,27 +35,27 @@ index c1d9156..7764744 100644 @@
 diff --git a/lib/codemirror.js b/lib/codemirror.js
 index 04646a9..9a39cc7 100644
 --- a/lib/codemirror.js
 +++ b/lib/codemirror.js
@@ -399,10 +399,16 @@ var CodeMirror = (function() {
+     }
      function onMouseDown(e) {
--      var start = posFromMouse(e), last = start;
 -      var start = posFromMouse(e), last = start;
 +      var start = posFromMouse(e), last = start, target = e.target();
        if (!start) return;
        setCursor(start.line, start.ch, false);
        if (e.button() != 1) return;
-+      if (target.parentNode == gutter) {
 +      if (target.parentNode == gutter) {
 +        if (options.onGutterClick)
 +          options.onGutterClick(indexOf(gutter.childNodes, target) + showingFrom);
 +        return;
 +      }
++
        if (!focused) onFocus();
        e.stop();
@@ -808,7 +814,7 @@ var CodeMirror = (function() {
        for (var i = showingFrom; i < showingTo; ++i) {
          var marker = lines[i].gutterMarker;
          if (marker) html.push('<div class="' + marker.style + '">' + htmlEscape(marker.text) + '</div>');
 -        else html.push("<div>" + (options.lineNumbers ? i + 1 : "\u00a0") + "</div>");
@@ @@ -75,13 +75,13 @@ index 04646a9..9a39cc7 100644 @@
 +        else options[option] = value;
        },
        cursorCoords: cursorCoords,
        undo: operation(undo),
@@ -1402,7 +1406,8 @@ var CodeMirror = (function() {
        replaceRange: operation(replaceRange),
        operation: function(f){return operation(f)();},
 -      refresh: function(){updateDisplay([{from: 0, to: lines.length}]);}
 +      refresh: function(){updateDisplay([{from: 0, to: lines.length}]);},
 +      getInputField: function(){return input;}
      };
      return instance;

rhodecode/public/js/mode/ecl/index.html

➞

Show inline comments

@@ @@ -16,13 +16,13 @@ sample useless code to demonstrate ecl s @@
 this is a multiline comment!
 */
 //  this is a singleline comment!
 import ut;
-r :=
 r :=
   record
    string22 s1 := '123';
    integer4 i1 := 123;
   end;
 #option('tmp', true);
 d := dataset('tmp::qb', r, thor);

rhodecode/public/js/mode/erlang/index.html

➞

Show inline comments

@@ @@ -29,13 +29,13 @@ @@
 -record(demo,{a="One",b="Two",c="Three",d="Four"}).
 rec_info(demo) -> record_info(fields,demo).
 demo() -> expand_recs(?MODULE,#demo{a="A",b="BB"}).
 expand_recs(M,List) when is_list(List) ->
   [expand_recs(M,L)||L<-List];
 expand_recs(M,Tup) when is_tuple(Tup) ->
   case tuple_size(Tup) of
     L when L < 1 -> Tup;
     L ->

rhodecode/public/js/mode/gas/index.html

➞

Show inline comments

@@ @@ -14,13 +14,13 @@ @@
         <form>
 <textarea id="code" name="code">
 .syntax unified
 .global main
-/*
 /*
  *  A
  *  multi-line
  *  comment.
  */
 @ A single line comment.

rhodecode/public/js/mode/gfm/index.html

➞

Show inline comments

@@ @@ -6,19 +6,19 @@ @@
     <link rel="stylesheet" href="../../lib/codemirror.css">
     <script src="../../lib/codemirror.js"></script>
     <script src="../../addon/mode/overlay.js"></script>
     <script src="../xml/xml.js"></script>
     <script src="../markdown/markdown.js"></script>
     <script src="gfm.js"></script>
     <!-- Code block highlighting modes -->
     <script src="../javascript/javascript.js"></script>
     <script src="../css/css.js"></script>
     <script src="../htmlmixed/htmlmixed.js"></script>
     <script src="../clike/clike.js"></script>
     <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
     <link rel="stylesheet" href="../../doc/docs.css">
   </head>
   <body>
     <h1>CodeMirror: GFM mode</h1>

rhodecode/public/js/mode/go/index.html

➞

Show inline comments

@@ @@ -22,42 +22,42 @@ @@
 package main
 import "fmt"
 // Send the sequence 2, 3, 4, ... to channel 'ch'.
 func generate(ch chan&lt;- int) {
 	for i := 2; ; i++ {
 		ch &lt;- i  // Send 'i' to channel 'ch'
+	}
     for i := 2; ; i++ {
         ch &lt;- i  // Send 'i' to channel 'ch'
+    }
+}
 // Copy the values from channel 'src' to channel 'dst',
 // removing those divisible by 'prime'.
 func filter(src &lt;-chan int, dst chan&lt;- int, prime int) {
 	for i := range src {    // Loop over values received from 'src'.
 		if i%prime != 0 {
 			dst &lt;- i  // Send 'i' to channel 'dst'.
+		}
+	}
     for i := range src {    // Loop over values received from 'src'.
         if i%prime != 0 {
             dst &lt;- i  // Send 'i' to channel 'dst'.
+        }
+    }
+}
 // The prime sieve: Daisy-chain filter processes together.
 func sieve() {
 	ch := make(chan int)  // Create a new channel.
 	go generate(ch)       // Start generate() as a subprocess.
 	for {
 		prime := &lt;-ch
 		fmt.Print(prime, "\n")
 		ch1 := make(chan int)
 		go filter(ch, ch1, prime)
 		ch = ch1
+	}
     ch := make(chan int)  // Create a new channel.
     go generate(ch)       // Start generate() as a subprocess.
     for {
         prime := &lt;-ch
         fmt.Print(prime, "\n")
         ch1 := make(chan int)
         go filter(ch, ch1, prime)
         ch = ch1
+    }
+}
 func main() {
-	sieve()
+    sieve()
+}
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         theme: "elegant",

rhodecode/public/js/mode/haskell/index.html

➞

Show inline comments

@@ @@ -41,13 +41,13 @@ permBag [] = [[]] @@
 permBag bs = concatMap (\(f,cs) -> map (f:) $ permBag cs) . oneOfEach $ bs
   where
     oneOfEach [] = []
     oneOfEach (an@(a,n):bs) =
         let bs' = if n == 1 then bs else (a,n-1):bs
         in (a,bs') : mapSnd (an:) (oneOfEach bs)
     apSnd f (a,b) = (a, f b)
     mapSnd = map . apSnd
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {

rhodecode/public/js/mode/haxe/index.html

➞

Show inline comments

@@ @@ -15,68 +15,68 @@ @@
 <div><textarea id="code" name="code">
 import one.two.Three;
 @attr("test")
 class Foo&lt;T&gt; extends Three
+{
 	public function new()
+	{
 		noFoo = 12;
+	}
 	public static inline function doFoo(obj:{k:Int, l:Float}):Int
+	{
 		for(i in 0...10)
+		{
 			obj.k++;
 			trace(i);
 			var var1 = new Array();
 			if(var1.length > 1)
 				throw "Error";
+		}
 		// The following line should not be colored, the variable is scoped out
 		var1;
 		/* Multi line
 		 * Comment test
 		 */
 		return obj.k;
+	}
 	private function bar():Void
+	{
 		#if flash
 		var t1:String = "1.21";
 		#end
 		try {
 			doFoo({k:3, l:1.2});
+		}
 		catch (e : String) {
 			trace(e);
+		}
 		var t2:Float = cast(3.2);
 		var t3:haxe.Timer = new haxe.Timer();
 		var t4 = {k:Std.int(t2), l:Std.parseFloat(t1)};
 		var t5 = ~/123+.*$/i;
 		doFoo(t4);
 		untyped t1 = 4;
 		bob = new Foo&lt;Int&gt;
+	}
 	public var okFoo(default, never):Float;
 	var noFoo(getFoo, null):Int;
 	function getFoo():Int {
 		return noFoo;
+	}
 	public var three:Int;
     public function new()
+    {
         noFoo = 12;
+    }
     public static inline function doFoo(obj:{k:Int, l:Float}):Int
+    {
         for(i in 0...10)
+        {
             obj.k++;
             trace(i);
             var var1 = new Array();
             if(var1.length > 1)
                 throw "Error";
+        }
         // The following line should not be colored, the variable is scoped out
         var1;
         /* Multi line
          * Comment test
          */
         return obj.k;
+    }
     private function bar():Void
+    {
         #if flash
         var t1:String = "1.21";
         #end
         try {
             doFoo({k:3, l:1.2});
+        }
         catch (e : String) {
             trace(e);
+        }
         var t2:Float = cast(3.2);
         var t3:haxe.Timer = new haxe.Timer();
         var t4 = {k:Std.int(t2), l:Std.parseFloat(t1)};
         var t5 = ~/123+.*$/i;
         doFoo(t4);
         untyped t1 = 4;
         bob = new Foo&lt;Int&gt;
+    }
     public var okFoo(default, never):Float;
     var noFoo(getFoo, null):Int;
     function getFoo():Int {
         return noFoo;
+    }
     public var three:Int;
+}
 enum Color
+{
 	red;
 	green;
 	blue;
 	grey( v : Int );
 	rgb (r:Int,g:Int,b:Int);
     red;
     green;
     blue;
     grey( v : Int );
     rgb (r:Int,g:Int,b:Int);
+}
 </textarea></div>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,

rhodecode/public/js/mode/htmlembedded/index.html

➞

Show inline comments

@@ @@ -16,19 +16,19 @@ @@
   <body>
     <h1>CodeMirror: Html Embedded Scripts mode</h1>
 <form><textarea id="code" name="code">
 <%
 function hello(who) {
-	return "Hello " + who;
+    return "Hello " + who;
+}
 %>
 This is an example of EJS (embedded javascript)
 <p>The program says <%= hello("world") %>.</p>
 <script>
-	alert("And here is some normal JS code"); // also colored
+    alert("And here is some normal JS code"); // also colored
 </script>
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,
@@ @@ -40,10 +40,10 @@ This is an example of EJS (embedded java @@
       });
     </script>
     <p>Mode for html embedded scripts like JSP and ASP.NET. Depends on HtmlMixed which in turn depends on
     JavaScript, CSS and XML.<br />Other dependancies include those of the scriping language chosen.</p>
-    <p><strong>MIME types defined:</strong> <code>application/x-aspx</code> (ASP.NET),
     <p><strong>MIME types defined:</strong> <code>application/x-aspx</code> (ASP.NET),
     <code>application/x-ejs</code> (Embedded Javascript), <code>application/x-jsp</code> (JavaServer Pages)</p>
   </body>
 </html>

rhodecode/public/js/mode/http/index.html

➞

Show inline comments

@@ @@ -14,13 +14,13 @@ @@
 <div><textarea id="code" name="code">
 POST /somewhere HTTP/1.1
 Host: example.com
 If-Modified-Since: Sat, 29 Oct 1994 19:43:31 GMT
 Content-Type: application/x-www-form-urlencoded;
-	charset=utf-8
+    charset=utf-8
 User-Agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/536.11 (KHTML, like Gecko) Ubuntu/12.04 Chromium/20.0.1132.47 Chrome/20.0.1132.47 Safari/536.11
 This is the request body!
 </textarea></div>
     <script>

rhodecode/public/js/mode/javascript/typescript.html

➞

Show inline comments

@@ @@ -11,27 +11,27 @@ @@
   </head>
   <body>
     <h1>CodeMirror: TypeScript mode</h1>
 <div><textarea id="code" name="code">
 class Greeter {
 	greeting: string;
 	constructor (message: string) {
 		this.greeting = message;
+	}
 	greet() {
 		return "Hello, " + this.greeting;
+	}
+}
     greeting: string;
     constructor (message: string) {
         this.greeting = message;
+    }
     greet() {
         return "Hello, " + this.greeting;
+    }
+}
 var greeter = new Greeter("world");
 var button = document.createElement('button')
 button.innerText = "Say Hello"
 button.onclick = function() {
-	alert(greeter.greet())
+    alert(greeter.greet())
+}
 document.body.appendChild(button)
 </textarea></div>

rhodecode/public/js/mode/less/index.html

➞

Show inline comments

@@ @@ -124,18 +124,18 @@ input::-moz-focus-inner { // Inner paddi @@
   // reset here as of 2.0.3 due to Recess property order
   border-color: #ccc;
   border-color: rgba(0,0,0,.1) rgba(0,0,0,.1) rgba(0,0,0,.25);
+}
 fieldset span button, fieldset span input[type="file"] {
   font-size:12px;
-	font-family:Arial, Helvetica, sans-serif;
+    font-family:Arial, Helvetica, sans-serif;
+}
 .el tr:nth-child(even):last-child td:first-child{
 	-moz-border-radius-bottomleft:3px;
 	-webkit-border-bottom-left-radius:3px;
 	border-bottom-left-radius:3px;
     -moz-border-radius-bottomleft:3px;
     -webkit-border-bottom-left-radius:3px;
     border-bottom-left-radius:3px;
+}
 /* Some LESS code */
 button {
     width:  32px;
@@ @@ -344,13 +344,13 @@ nav a, #dropdown li { @@
   padding: 0px 15px;
   text-shadow: -1px -1px 1px rgba(0, 0, 0, 0.5);
   text-decoration: none;
   border: 2px solid transparent;
   border-width: 0 2px;
   &:hover {
-    .dark-red;
     .dark-red;
     text-decoration: none;
+  }
+}
 .dark-red {
     @red: @medium;
     border: 2px solid darken(@red, 25%);
@@ @@ -397,25 +397,25 @@ nav a, #dropdown li { @@
     border: 2px solid darken(@medium, 25%);
     border-left-color: darken(@medium, 15%);
     border-right-color: darken(@medium, 15%);
     border-top-width: 0;
     background-color: darken(@medium, 10%);
     ul {
-      padding: 0px;
       padding: 0px;
+    }
     li {
       font-size: 14px;
       display: block;
       text-align: left;
       padding: 0;
       border: 0;
       a {
         display: block;
-        padding: 0px 15px;
         padding: 0px 15px;
         text-decoration: none;
-        color: white;
         color: white;
         &:hover {
           background-color: darken(@medium, 15%);
           text-decoration: none;
+        }
+      }
+    }
@@ @@ -447,19 +447,19 @@ nav a, #dropdown li { @@
     border-bottom: 0;
     border-top: 0;
     #download { color: transparent; border: 0; float: left; display: inline-block; margin: 15px 0 15px -5px; }
     #download img { display: inline-block}
     #download-info {
       code {
-        font-size: 13px;
         font-size: 13px;
+      }
       color: @blue + #333; display: inline; float: left; margin: 36px 0 0 15px }
+  }
   h2 {
     span {
-      color: @medium;
       color: @medium;
+    }
     color: @blue;
     margin: 20px 0;
     font-size: 24px;
     line-height: 1.2em;
+  }
@@ @@ -523,13 +523,13 @@ nav a, #dropdown li { @@
   margin: 0 auto;
   font-family: 'Georgia', serif;
   font-size: 18px;
   line-height: 26px;
   padding: 0 60px;
   code {
-    font-size: 16px;
     font-size: 16px;
+  }
   pre {
     border-width: 1px;
     border-style: dashed;
     padding: 15px;
     margin: 15px 0;
@@ @@ -596,24 +596,24 @@ nav a, #dropdown li { @@
+  }
   pre code                    { font-size: 15px  }
   p + h2, pre + h2, code + h2 { border-top-color: rgba(0, 0, 0, 0.1) }
+}
 td {
-  padding-right: 30px;
   padding-right: 30px;
+}
 #synopsis {
   .box-shadow(0, 5px, 5px, 0.2);
+}
 #synopsis, #about {
   h2 {
-    font-size: 30px;
     font-size: 30px;
     padding: 10px 0;
+  }
   h1 + h2 {
-      margin-top: 15px;
       margin-top: 15px;
+  }
   h3 { font-size: 22px }
   .code-example {
     border-spacing: 0;
     border-width: 1px;
@@ @@ -628,13 +628,13 @@ td { @@
       padding: 0;
+    }
     tr { padding: 0 }
+  }
   .css-output {
     td {
-      border-left: 0;
       border-left: 0;
+    }
+  }
   .less-example {
     //border-right: 1px dotted rgba(255, 255, 255, 0.5) !important;
+  }
   .css-output, .less-example {

rhodecode/public/js/mode/lua/index.html

➞

Show inline comments

@@ @@ -20,24 +20,24 @@ this is multiline comment @@
 ]]
 function blahblahblah(x)
   local table = {
     "asd" = 123,
-    "x" = 0.34,
     "x" = 0.34,
+  }
   if x ~= 3 then
     print( x )
   elseif x == "string"
     my_custom_function( 0x34 )
   else
     unknown_function( "some string" )
   end
   --single line comment
 end
 function blablabla3()
   for k,v in ipairs( table ) do
     --abcde..

rhodecode/public/js/mode/markdown/index.html

➞

Show inline comments

@@ @@ -68,52 +68,52 @@ HTML header level. @@
 Blockquotes are indicated using email-style '`&gt;`' angle brackets.
 Markdown:
     A First Level Header
     ====================
     A Second Level Header
     ---------------------
     Now is the time for all good men to come to
     the aid of their country. This is just a
     regular paragraph.
     The quick brown fox jumped over the lazy
     dog's back.
     ### Header 3
     &gt; This is a blockquote.
-    &gt;
     &gt;
     &gt; This is the second paragraph in the blockquote.
     &gt;
     &gt; ## This is an H2 in a blockquote
 Output:
     &lt;h1&gt;A First Level Header&lt;/h1&gt;
     &lt;h2&gt;A Second Level Header&lt;/h2&gt;
     &lt;p&gt;Now is the time for all good men to come to
     the aid of their country. This is just a
     regular paragraph.&lt;/p&gt;
     &lt;p&gt;The quick brown fox jumped over the lazy
     dog's back.&lt;/p&gt;
     &lt;h3&gt;Header 3&lt;/h3&gt;
     &lt;blockquote&gt;
         &lt;p&gt;This is a blockquote.&lt;/p&gt;
         &lt;p&gt;This is the second paragraph in the blockquote.&lt;/p&gt;
         &lt;h2&gt;This is an H2 in a blockquote&lt;/h2&gt;
     &lt;/blockquote&gt;
 ### Phrase Emphasis ###
@@ @@ -121,24 +121,24 @@ Output: @@
 Markdown uses asterisks and underscores to indicate spans of emphasis.
 Markdown:
     Some of these words *are emphasized*.
     Some of these words _are emphasized also_.
     Use two asterisks for **strong emphasis**.
     Or, if you prefer, __use two underscores instead__.
 Output:
     &lt;p&gt;Some of these words &lt;em&gt;are emphasized&lt;/em&gt;.
     Some of these words &lt;em&gt;are emphasized also&lt;/em&gt;.&lt;/p&gt;
     &lt;p&gt;Use two asterisks for &lt;strong&gt;strong emphasis&lt;/strong&gt;.
     Or, if you prefer, &lt;strong&gt;use two underscores instead&lt;/strong&gt;.&lt;/p&gt;
 ## Lists ##
 Unordered (bulleted) lists use asterisks, pluses, and hyphens (`*`,
 `+`, and `-`) as list markers. These three markers are
@@ @@ -185,25 +185,25 @@ Output: @@
 If you put blank lines between items, you'll get `&lt;p&gt;` tags for the
 list item text. You can create multi-paragraph list items by indenting
 the paragraphs by 4 spaces or 1 tab:
     *   A list item.
         With multiple paragraphs.
     *   Another item in the list.
 Output:
     &lt;ul&gt;
     &lt;li&gt;&lt;p&gt;A list item.&lt;/p&gt;
     &lt;p&gt;With multiple paragraphs.&lt;/p&gt;&lt;/li&gt;
     &lt;li&gt;&lt;p&gt;Another item in the list.&lt;/p&gt;&lt;/li&gt;
     &lt;/ul&gt;
 ### Links ###
 Markdown supports two styles for creating links: *inline* and
 *reference*. With both styles, you use square brackets to delimit the
@@ @@ -292,13 +292,13 @@ it easy to use Markdown to write about H @@
     instead of decimal-encoded entites like `&amp;#8212;`.
 Output:
     &lt;p&gt;I strongly recommend against using any
     &lt;code&gt;&amp;lt;blink&amp;gt;&lt;/code&gt; tags.&lt;/p&gt;
     &lt;p&gt;I wish SmartyPants used named entities like
     &lt;code&gt;&amp;amp;mdash;&lt;/code&gt; instead of decimal-encoded
     entites like &lt;code&gt;&amp;amp;#8212;&lt;/code&gt;.&lt;/p&gt;
 To specify an entire block of pre-formatted code, indent every line of
@@ @@ -315,13 +315,13 @@ Markdown: @@
         &lt;/blockquote&gt;
 Output:
     &lt;p&gt;If you want your page to validate under XHTML 1.0 Strict,
     you've got to put paragraph tags in your blockquotes:&lt;/p&gt;
     &lt;pre&gt;&lt;code&gt;&amp;lt;blockquote&amp;gt;
         &amp;lt;p&amp;gt;For example.&amp;lt;/p&amp;gt;
     &amp;lt;/blockquote&amp;gt;
     &lt;/code&gt;&lt;/pre&gt;
 </textarea></form>

rhodecode/public/js/mode/mirc/index.html

➞

Show inline comments

@@ @@ -132,15 +132,15 @@ Raw 315:*: { @@
+}
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         tabMode: "indent",
-		theme: "twilight",
+        theme: "twilight",
         lineNumbers: true,
-		matchBrackets: true,
+        matchBrackets: true,
         indentUnit: 4,
         mode: "text/mirc"
       });
     </script>
     <p><strong>MIME types defined:</strong> <code>text/mirc</code>.</p>

rhodecode/public/js/mode/ntriples/index.html

➞

Show inline comments

@@ @@ -8,18 +8,18 @@ @@
     <script src="ntriples.js"></script>
     <link rel="stylesheet" href="../../doc/docs.css">
     <style type="text/css">
       .CodeMirror {
         border: 1px solid #eee;
+      }
-    </style>
     </style>
   </head>
   <body>
     <h1>CodeMirror: NTriples mode</h1>
 <form>
-<textarea id="ntriples" name="ntriples">
 <textarea id="ntriples" name="ntriples">
 <http://Sub1>     <http://pred1>     <http://obj> .
 <http://Sub2>     <http://pred2#an2> "literal 1" .
 <http://Sub3#an3> <http://pred3>     _:bnode3 .
 _:bnode4          <http://pred4>     "literal 2"@lang .
 _:bnode5          <http://pred5>     "literal 3"^^<http://type> .
 </textarea>

rhodecode/public/js/mode/ocaml/index.html

➞

Show inline comments

@@ @@ -72,13 +72,13 @@ let l = 1 :: 2 :: 3 :: [];; @@
 let rec sort = function
   | [] -&gt; []
   | x :: l -&gt; insert x (sort l)
 and insert elem = function
   | [] -&gt; [elem]
-  | x :: l -&gt;
   | x :: l -&gt;
       if elem &lt; x then elem :: x :: l else x :: insert elem l;;
 (* Imperative features *)
 let add_polynom p1 p2 =
   let n1 = Array.length p1
   and n2 = Array.length p2 in

rhodecode/public/js/mode/pascal/index.html

➞

Show inline comments

@@ @@ -13,25 +13,25 @@ @@
     <h1>CodeMirror: Pascal mode</h1>
 <div><textarea id="code" name="code">
 (* Example Pascal code *)
 while a <> b do writeln('Waiting');
 if a > b then
 if a > b then
   writeln('Condition met')
-else
 else
   writeln('Condition not met');
 for i := 1 to 10 do
 for i := 1 to 10 do
   writeln('Iteration: ', i:1);
 repeat
   a := a + 1
 until a = 10;
 case i of
 : write('zero');
 : write('one');
 : write('two')
 end;
 </textarea></div>

rhodecode/public/js/mode/perl/index.html

➞

Show inline comments

@@ @@ -20,31 +20,31 @@ use Something qw(func1 func2); @@
 # strings
 my $s1 = qq'single line';
 our $s2 = q(multi-
               line);
 =item Something
-	Example.
+    Example.
 =cut
 my $html=<<'HTML'
 <html>
 <title>hi!</title>
 </html>
 HTML
 print "first,".join(',', 'second', qq~third~);
 if($s1 =~ m[(?<!\s)(l.ne)\z]o) {
 	$h->{$1}=$$.' predefined variables';
 	$s2 =~ s/\-line//ox;
 	$s1 =~ s[
 		  line ]
+		[
 		  block
 		]ox;
     $h->{$1}=$$.' predefined variables';
     $s2 =~ s/\-line//ox;
     $s1 =~ s[
           line ]
+        [
           block
         ]ox;
+}
 ; # numbers and comments
 __END__
 something...

rhodecode/public/js/mode/php/index.html

➞

Show inline comments

@@ @@ -18,18 +18,18 @@ @@
   <body>
     <h1>CodeMirror: PHP mode</h1>
 <form><textarea id="code" name="code">
 <?php
 function hello($who) {
-	return "Hello " . $who;
+    return "Hello " . $who;
+}
 ?>
 <p>The program says <?= hello("World") ?>.</p>
 <script>
-	alert("And here is some JS code"); // also colored
+    alert("And here is some JS code"); // also colored
 </script>
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,

rhodecode/public/js/mode/pig/index.html

➞

Show inline comments

@@ @@ -11,13 +11,13 @@ @@
   </head>
   <body>
     <h1>CodeMirror: Pig Latin mode</h1>
 <form><textarea id="code" name="code">
 -- Apache Pig (Pig Latin Language) Demo
-/*
 /*
 This is a multiline comment.
 */
 a = LOAD "\path\to\input" USING PigStorage('\t') AS (x:long, y:chararray, z:bytearray);
 b = GROUP a BY (x,y,3+4);
 c = FOREACH b GENERATE flatten(group) as (x,y), SUM(group.$2) as z;
 STORE c INTO "\path\to\output";

rhodecode/public/js/mode/python/LICENSE.txt

➞

Show inline comments

@@ @@ -15,7 +15,7 @@ all copies or substantial portions of th @@
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
@@ \ No newline at end of file @@
 THE SOFTWARE.

rhodecode/public/js/mode/python/index.html

➞

Show inline comments

@@ @@ -9,13 +9,13 @@ @@
     <script src="python.js"></script>
     <link rel="stylesheet" href="../../doc/docs.css">
     <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
   </head>
   <body>
     <h1>CodeMirror: Python mode</h1>
     <div><textarea id="code" name="code">
 # Literals
 .0e101
 .123
 b01010011100

rhodecode/public/js/mode/q/index.html

➞

Show inline comments

@@ @@ -12,29 +12,29 @@ @@
   </head>
   <body>
     <h1>CodeMirror: Q mode</h1>
 <div><textarea id="code" name="code">
 / utilities to quickly load a csv file - for more exhaustive analysis of the csv contents see csvguess.q
-/ 2009.09.20 - updated to match latest csvguess.q
 / 2009.09.20 - updated to match latest csvguess.q
 / .csv.colhdrs[file] - return a list of colhdrs from file
 / info:.csv.info[file] - return a table of information about the file
 / columns are:
 /	c - column name; ci - column index; t - load type; mw - max width;
 /	dchar - distinct characters in values; rule - rule that caught the type
 /	maybe - needs checking, _could_ be say a date, but perhaps just a float?
 / columns are:
 /   c - column name; ci - column index; t - load type; mw - max width;
 /   dchar - distinct characters in values; rule - rule that caught the type
 /   maybe - needs checking, _could_ be say a date, but perhaps just a float?
 / .csv.info0[file;onlycols] - like .csv.info except that it only analyses <onlycols>
 / example:
 /	info:.csv.info0[file;(.csv.colhdrs file)like"*price"]
 /	info:.csv.infolike[file;"*price"]
 /	show delete from info where t=" "
 /   info:.csv.info0[file;(.csv.colhdrs file)like"*price"]
 /   info:.csv.infolike[file;"*price"]
 /   show delete from info where t=" "
 / .csv.data[file;info] - use the info from .csv.info to read the data
 / .csv.data10[file;info] - like .csv.data but only returns the first 10 rows
 / bulkload[file;info] - bulk loads file into table DATA (which must be already defined :: DATA:() )
-/ .csv.read[file]/read10[file] - for when you don't care about checking/tweaking the <info> before reading
 / .csv.read[file]/read10[file] - for when you don't care about checking/tweaking the <info> before reading
 \d .csv
 DELIM:","
 ZAPHDRS:0b / lowercase and remove _ from colhdrs (junk characters are always removed)
 WIDTHHDR:25000 / number of characters read to get the header
 READLINES:222 / number of lines read and used to guess the types
@@ @@ -46,80 +46,80 @@ CHUNKSIZE:50000000 / used in fs2 (modifi @@
 k)nameltrim:{$[~@x;.z.s'x;~(*x)in aA:.Q.a,.Q.A;(+/&\~x in aA)_x;x]}
 k)fs2:{[f;s]((-7!s)>){[f;s;x]i:1+last@&0xa=r:1:(s;x;CHUNKSIZE);f@`\:i#r;x+i}[f;s]/0j}
 cleanhdrs:{{$[ZAPHDRS;lower x except"_";x]}x where x in DELIM,.Q.an}
 cancast:{nw:x$"";if[not x in"BXCS";nw:(min 0#;max 0#;::)@\:nw];$[not any nw in x$(11&count y)#y;$[11<count y;not any nw in x$y;1b];0b]}
 read:{[file]data[file;info[file]]}
 read10:{[file]data10[file;info[file]]}
 read:{[file]data[file;info[file]]}
 read10:{[file]data10[file;info[file]]}
 colhdrs:{[file]
-	`$nameltrim DELIM vs cleanhdrs first read0(file;0;1+first where 0xa=read1(file;0;WIDTHHDR))}
+    `$nameltrim DELIM vs cleanhdrs first read0(file;0;1+first where 0xa=read1(file;0;WIDTHHDR))}
 data:{[file;info]
-	(exec c from info where not t=" ")xcol(exec t from info;enlist DELIM)0:file}
+    (exec c from info where not t=" ")xcol(exec t from info;enlist DELIM)0:file}
 data10:{[file;info]
-	data[;info](file;0;1+last 11#where 0xa=read1(file;0;15*WIDTHHDR))}
+    data[;info](file;0;1+last 11#where 0xa=read1(file;0;15*WIDTHHDR))}
 info0:{[file;onlycols]
 	colhdrs:`$nameltrim DELIM vs cleanhdrs first head:read0(file;0;1+last where 0xa=read1(file;0;WIDTHHDR));
 	loadfmts:(count colhdrs)#"S";if[count onlycols;loadfmts[where not colhdrs in onlycols]:"C"];
 	breaks:where 0xa=read1(file;0;floor(10+READLINES)*WIDTHHDR%count head);
 	nas:count as:colhdrs xcol(loadfmts;enlist DELIM)0:(file;0;1+last((1+READLINES)&count breaks)#breaks);
 	info:([]c:key flip as;v:value flip as);as:();
 	reserved:key`.q;reserved,:.Q.res;reserved,:`i;
 	info:update res:c in reserved from info;
 	info:update ci:i,t:"?",ipa:0b,mdot:0,mw:0,rule:0,gr:0,ndv:0,maybe:0b,empty:0b,j10:0b,j12:0b from info;
 	info:update ci:`s#ci from info;
 	if[count onlycols;info:update t:" ",rule:10 from info where not c in onlycols];
 	info:update sdv:{string(distinct x)except`}peach v from info;
 	info:update ndv:count each sdv from info;
 	info:update gr:floor 0.5+100*ndv%nas,mw:{max count each x}peach sdv from info where 0<ndv;
 	info:update t:"*",rule:20 from info where mw>.csv.FORCECHARWIDTH; / long values
 	info:update t:"C "[.csv.DISCARDEMPTY],rule:30,empty:1b from info where t="?",mw=0; / empty columns
 	info:update dchar:{asc distinct raze x}peach sdv from info where t="?";
 	info:update mdot:{max sum each"."=x}peach sdv from info where t="?",{"."in x}each dchar;
 	info:update t:"n",rule:40 from info where t="?",{any x in"0123456789"}each dchar; / vaguely numeric..
 	info:update t:"I",rule:50,ipa:1b from info where t="n",mw within 7 15,mdot=3,{all x in".0123456789"}each dchar,.csv.cancast["I"]peach sdv; / ip-address
 	info:update t:"J",rule:60 from info where t="n",mdot=0,{all x in"+-0123456789"}each dchar,.csv.cancast["J"]peach sdv;
 	info:update t:"I",rule:70 from info where t="J",mw<12,.csv.cancast["I"]peach sdv;
 	info:update t:"H",rule:80 from info where t="I",mw<7,.csv.cancast["H"]peach sdv;
 	info:update t:"F",rule:90 from info where t="n",mdot<2,mw>1,.csv.cancast["F"]peach sdv;
 	info:update t:"E",rule:100,maybe:1b from info where t="F",mw<9;
 	info:update t:"M",rule:110,maybe:1b from info where t in"nIHEF",mdot<2,mw within 4 7,.csv.cancast["M"]peach sdv;
 	info:update t:"D",rule:120,maybe:1b from info where t in"nI",mdot in 0 2,mw within 6 11,.csv.cancast["D"]peach sdv;
 	info:update t:"V",rule:130,maybe:1b from info where t="I",mw in 5 6,7<count each dchar,{all x like"*[0-9][0-5][0-9][0-5][0-9]"}peach sdv,.csv.cancast["V"]peach sdv; / 235959 12345
 	info:update t:"U",rule:140,maybe:1b from info where t="H",mw in 3 4,7<count each dchar,{all x like"*[0-9][0-5][0-9]"}peach sdv,.csv.cancast["U"]peach sdv; /2359
 	info:update t:"U",rule:150,maybe:0b from info where t="n",mw in 4 5,mdot=0,{all x like"*[0-9]:[0-5][0-9]"}peach sdv,.csv.cancast["U"]peach sdv;
 	info:update t:"T",rule:160,maybe:0b from info where t="n",mw within 7 12,mdot<2,{all x like"*[0-9]:[0-5][0-9]:[0-5][0-9]*"}peach sdv,.csv.cancast["T"]peach sdv;
 	info:update t:"V",rule:170,maybe:0b from info where t="T",mw in 7 8,mdot=0,.csv.cancast["V"]peach sdv;
 	info:update t:"T",rule:180,maybe:1b from info where t in"EF",mw within 7 10,mdot=1,{all x like"*[0-9][0-5][0-9][0-5][0-9].*"}peach sdv,.csv.cancast["T"]peach sdv;
 	info:update t:"Z",rule:190,maybe:0b from info where t="n",mw within 11 24,mdot<4,.csv.cancast["Z"]peach sdv;
 	info:update t:"P",rule:200,maybe:1b from info where t="n",mw within 12 29,mdot<4,{all x like"[12]*"}peach sdv,.csv.cancast["P"]peach sdv;
 	info:update t:"N",rule:210,maybe:1b from info where t="n",mw within 3 28,mdot=1,.csv.cancast["N"]peach sdv;
 	info:update t:"?",rule:220,maybe:0b from info where t="n"; / reset remaining maybe numeric
 	info:update t:"C",rule:230,maybe:0b from info where t="?",mw=1; / char
 	info:update t:"B",rule:240,maybe:0b from info where t in"HC",mw=1,mdot=0,{$[all x in"01tTfFyYnN";(any"0fFnN"in x)and any"1tTyY"in x;0b]}each dchar; / boolean
 	info:update t:"B",rule:250,maybe:1b from info where t in"HC",mw=1,mdot=0,{all x in"01tTfFyYnN"}each dchar; / boolean
 	info:update t:"X",rule:260,maybe:0b from info where t="?",mw=2,{$[all x in"0123456789abcdefABCDEF";(any .Q.n in x)and any"abcdefABCDEF"in x;0b]}each dchar; /hex
 	info:update t:"S",rule:270,maybe:1b from info where t="?",mw<.csv.SYMMAXWIDTH,mw>1,gr<.csv.SYMMAXGR; / symbols (max width permitting)
 	info:update t:"*",rule:280,maybe:0b from info where t="?"; / the rest as strings
 	/ flag those S/* columns which could be encoded to integers (.Q.j10/x10/j12/x12) to avoid symbols
 	info:update j12:1b from info where t in"S*",mw<13,{all x in .Q.nA}each dchar;
 	info:update j10:1b from info where t in"S*",mw<11,{all x in .Q.b6}each dchar;
 	select c,ci,t,maybe,empty,res,j10,j12,ipa,mw,mdot,rule,gr,ndv,dchar from info}
     colhdrs:`$nameltrim DELIM vs cleanhdrs first head:read0(file;0;1+last where 0xa=read1(file;0;WIDTHHDR));
     loadfmts:(count colhdrs)#"S";if[count onlycols;loadfmts[where not colhdrs in onlycols]:"C"];
     breaks:where 0xa=read1(file;0;floor(10+READLINES)*WIDTHHDR%count head);
     nas:count as:colhdrs xcol(loadfmts;enlist DELIM)0:(file;0;1+last((1+READLINES)&count breaks)#breaks);
     info:([]c:key flip as;v:value flip as);as:();
     reserved:key`.q;reserved,:.Q.res;reserved,:`i;
     info:update res:c in reserved from info;
     info:update ci:i,t:"?",ipa:0b,mdot:0,mw:0,rule:0,gr:0,ndv:0,maybe:0b,empty:0b,j10:0b,j12:0b from info;
     info:update ci:`s#ci from info;
     if[count onlycols;info:update t:" ",rule:10 from info where not c in onlycols];
     info:update sdv:{string(distinct x)except`}peach v from info;
     info:update ndv:count each sdv from info;
     info:update gr:floor 0.5+100*ndv%nas,mw:{max count each x}peach sdv from info where 0<ndv;
     info:update t:"*",rule:20 from info where mw>.csv.FORCECHARWIDTH; / long values
     info:update t:"C "[.csv.DISCARDEMPTY],rule:30,empty:1b from info where t="?",mw=0; / empty columns
     info:update dchar:{asc distinct raze x}peach sdv from info where t="?";
     info:update mdot:{max sum each"."=x}peach sdv from info where t="?",{"."in x}each dchar;
     info:update t:"n",rule:40 from info where t="?",{any x in"0123456789"}each dchar; / vaguely numeric..
     info:update t:"I",rule:50,ipa:1b from info where t="n",mw within 7 15,mdot=3,{all x in".0123456789"}each dchar,.csv.cancast["I"]peach sdv; / ip-address
     info:update t:"J",rule:60 from info where t="n",mdot=0,{all x in"+-0123456789"}each dchar,.csv.cancast["J"]peach sdv;
     info:update t:"I",rule:70 from info where t="J",mw<12,.csv.cancast["I"]peach sdv;
     info:update t:"H",rule:80 from info where t="I",mw<7,.csv.cancast["H"]peach sdv;
     info:update t:"F",rule:90 from info where t="n",mdot<2,mw>1,.csv.cancast["F"]peach sdv;
     info:update t:"E",rule:100,maybe:1b from info where t="F",mw<9;
     info:update t:"M",rule:110,maybe:1b from info where t in"nIHEF",mdot<2,mw within 4 7,.csv.cancast["M"]peach sdv;
     info:update t:"D",rule:120,maybe:1b from info where t in"nI",mdot in 0 2,mw within 6 11,.csv.cancast["D"]peach sdv;
     info:update t:"V",rule:130,maybe:1b from info where t="I",mw in 5 6,7<count each dchar,{all x like"*[0-9][0-5][0-9][0-5][0-9]"}peach sdv,.csv.cancast["V"]peach sdv; / 235959 12345
     info:update t:"U",rule:140,maybe:1b from info where t="H",mw in 3 4,7<count each dchar,{all x like"*[0-9][0-5][0-9]"}peach sdv,.csv.cancast["U"]peach sdv; /2359
     info:update t:"U",rule:150,maybe:0b from info where t="n",mw in 4 5,mdot=0,{all x like"*[0-9]:[0-5][0-9]"}peach sdv,.csv.cancast["U"]peach sdv;
     info:update t:"T",rule:160,maybe:0b from info where t="n",mw within 7 12,mdot<2,{all x like"*[0-9]:[0-5][0-9]:[0-5][0-9]*"}peach sdv,.csv.cancast["T"]peach sdv;
     info:update t:"V",rule:170,maybe:0b from info where t="T",mw in 7 8,mdot=0,.csv.cancast["V"]peach sdv;
     info:update t:"T",rule:180,maybe:1b from info where t in"EF",mw within 7 10,mdot=1,{all x like"*[0-9][0-5][0-9][0-5][0-9].*"}peach sdv,.csv.cancast["T"]peach sdv;
     info:update t:"Z",rule:190,maybe:0b from info where t="n",mw within 11 24,mdot<4,.csv.cancast["Z"]peach sdv;
     info:update t:"P",rule:200,maybe:1b from info where t="n",mw within 12 29,mdot<4,{all x like"[12]*"}peach sdv,.csv.cancast["P"]peach sdv;
     info:update t:"N",rule:210,maybe:1b from info where t="n",mw within 3 28,mdot=1,.csv.cancast["N"]peach sdv;
     info:update t:"?",rule:220,maybe:0b from info where t="n"; / reset remaining maybe numeric
     info:update t:"C",rule:230,maybe:0b from info where t="?",mw=1; / char
     info:update t:"B",rule:240,maybe:0b from info where t in"HC",mw=1,mdot=0,{$[all x in"01tTfFyYnN";(any"0fFnN"in x)and any"1tTyY"in x;0b]}each dchar; / boolean
     info:update t:"B",rule:250,maybe:1b from info where t in"HC",mw=1,mdot=0,{all x in"01tTfFyYnN"}each dchar; / boolean
     info:update t:"X",rule:260,maybe:0b from info where t="?",mw=2,{$[all x in"0123456789abcdefABCDEF";(any .Q.n in x)and any"abcdefABCDEF"in x;0b]}each dchar; /hex
     info:update t:"S",rule:270,maybe:1b from info where t="?",mw<.csv.SYMMAXWIDTH,mw>1,gr<.csv.SYMMAXGR; / symbols (max width permitting)
     info:update t:"*",rule:280,maybe:0b from info where t="?"; / the rest as strings
     / flag those S/* columns which could be encoded to integers (.Q.j10/x10/j12/x12) to avoid symbols
     info:update j12:1b from info where t in"S*",mw<13,{all x in .Q.nA}each dchar;
     info:update j10:1b from info where t in"S*",mw<11,{all x in .Q.b6}each dchar;
     select c,ci,t,maybe,empty,res,j10,j12,ipa,mw,mdot,rule,gr,ndv,dchar from info}
 info:info0[;()] / by default don't restrict columns
 infolike:{[file;pattern] info0[file;{x where x like y}[lower colhdrs[file];pattern]]} / .csv.infolike[file;"*time"]
 \d .
 / DATA:()
 bulkload:{[file;info]
 	if[not`DATA in system"v";'`DATA.not.defined];
 	if[count DATA;'`DATA.not.empty];
 	loadhdrs:exec c from info where not t=" ";loadfmts:exec t from info;
 	.csv.fs2[{[file;loadhdrs;loadfmts] `DATA insert $[count DATA;flip loadhdrs!(loadfmts;.csv.DELIM)0:file;loadhdrs xcol(loadfmts;enlist .csv.DELIM)0:file]}[file;loadhdrs;loadfmts]];
 	count DATA}
 @[.:;"\\l csvutil.custom.q";::]; / save your custom settings in csvutil.custom.q to override those set at the beginning of the file
     if[not`DATA in system"v";'`DATA.not.defined];
     if[count DATA;'`DATA.not.empty];
     loadhdrs:exec c from info where not t=" ";loadfmts:exec t from info;
     .csv.fs2[{[file;loadhdrs;loadfmts] `DATA insert $[count DATA;flip loadhdrs!(loadfmts;.csv.DELIM)0:file;loadhdrs xcol(loadfmts;enlist .csv.DELIM)0:file]}[file;loadhdrs;loadfmts]];
     count DATA}
 @[.:;"\\l csvutil.custom.q";::]; / save your custom settings in csvutil.custom.q to override those set at the beginning of the file
 </textarea></div>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,
         matchBrackets: true

rhodecode/public/js/mode/rpm/changes/index.html

➞

Show inline comments

@@ @@ -8,13 +8,13 @@ @@
     <script src="changes.js"></script>
     <link rel="stylesheet" href="../../../doc/docs.css">
     <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
   </head>
   <body>
     <h1>CodeMirror: RPM changes mode</h1>
     <div><textarea id="code" name="code">
 -------------------------------------------------------------------
 Tue Oct 18 13:58:40 UTC 2011 - misterx@example.com
 - Update to r60.3
 - Fixes bug in the reflect package

rhodecode/public/js/mode/rpm/spec/index.html

➞

Show inline comments

@@ @@ -9,13 +9,13 @@ @@
     <link rel="stylesheet" href="spec.css">
     <link rel="stylesheet" href="../../../doc/docs.css">
     <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
   </head>
   <body>
     <h1>CodeMirror: RPM spec mode</h1>
     <div><textarea id="code" name="code">
+#
 # spec file for package minidlna
+#
 # Copyright (c) 2011, Sascha Peilicke <saschpe@gmx.de>
+#

rhodecode/public/js/mode/rst/LICENSE.txt

➞

Show inline comments

@@ @@ -15,7 +15,7 @@ all copies or substantial portions of th @@
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
@@ \ No newline at end of file @@
 THE SOFTWARE.

rhodecode/public/js/mode/rst/index.html

➞

Show inline comments

@@ @@ -518,7 +518,6 @@ There are some problems one commonly run @@
         blocks containing LaTex code.
     </p>
     <p><strong>MIME types defined:</strong> <code>text/x-rst</code>.</p>
   </body>
 </html>

rhodecode/public/js/mode/ruby/index.html

➞

Show inline comments

@@ @@ -47,13 +47,13 @@ end @@
 # converts it to an end-of-file exception
 def readints(prompt)
     # Read a line
     print prompt
     line = readline.chomp
     raise EOFError.new if line == 'quit' # You can also use a real EOF.
     # Go through each item on the line, converting each one and adding it
     # to retval.
     retval = [ ]
     for str in line.split(/\s+/)
         if str =~ /^\-?\d+$/
             retval.push(str.to_i)
@@ @@ -96,22 +96,22 @@ def polystr(p) @@
     # *** Now p is a non-empty list of [ coef, exponent ] pairs. ***
     # Convert the first term, preceded by a "-" if it's negative.
     result = (if p[0][0] < 0 then "-" else "" end) + term_to_str(*p[0])
     # Convert the rest of the terms, in each case adding the appropriate
-    # + or - separating them.
     # + or - separating them.
     for term in p[1...p.length]
         # Add the separator then the rep. of the term.
-        result += (if term[0] < 0 then " - " else " + " end) +
         result += (if term[0] < 0 then " - " else " + " end) +
                 term_to_str(*term)
     end
     return result
 end
+#
 # Run until some kind of endfile.
 begin
     # Repeat until an exception or quit gets us out.
     while true
         # Read a poly until it works.  An EOF will except out of the

rhodecode/public/js/mode/scheme/index.html

➞

Show inline comments

@@ @@ -12,51 +12,51 @@ @@
   <body>
     <h1>CodeMirror: Scheme mode</h1>
     <form><textarea id="code" name="code">
 ; See if the input starts with a given symbol.
 (define (match-symbol input pattern)
   (cond ((null? (remain input)) #f)
 	((eqv? (car (remain input)) pattern) (r-cdr input))
 	(else #f)))
     ((eqv? (car (remain input)) pattern) (r-cdr input))
     (else #f)))
 ; Allow the input to start with one of a list of patterns.
 (define (match-or input pattern)
   (cond ((null? pattern) #f)
 	((match-pattern input (car pattern)))
 	(else (match-or input (cdr pattern)))))
     ((match-pattern input (car pattern)))
     (else (match-or input (cdr pattern)))))
 ; Allow a sequence of patterns.
 (define (match-seq input pattern)
   (if (null? pattern)
       input
       (let ((match (match-pattern input (car pattern))))
-	(if match (match-seq match (cdr pattern)) #f))))
+    (if match (match-seq match (cdr pattern)) #f))))
 ; Match with the pattern but no problem if it does not match.
 (define (match-opt input pattern)
   (let ((match (match-pattern input (car pattern))))
     (if match match input)))
 ; Match anything (other than '()), until pattern is found. The rather
 ; clumsy form of requiring an ending pattern is needed to decide where
 ; the end of the match is. If none is given, this will match the rest
 ; of the sentence.
 (define (match-any input pattern)
   (cond ((null? (remain input)) #f)
 	((null? pattern) (f-cons (remain input) (clear-remain input)))
 	(else
 	 (let ((accum-any (collector)))
 	   (define (match-pattern-any input pattern)
 	     (cond ((null? (remain input)) #f)
 		   (else (accum-any (car (remain input)))
 			 (cond ((match-pattern (r-cdr input) pattern))
 			       (else (match-pattern-any (r-cdr input) pattern))))))
 	   (let ((retval (match-pattern-any input (car pattern))))
 	     (if retval
 		 (f-cons (accum-any) retval)
 		 #f))))))
     ((null? pattern) (f-cons (remain input) (clear-remain input)))
     (else
      (let ((accum-any (collector)))
        (define (match-pattern-any input pattern)
          (cond ((null? (remain input)) #f)
            (else (accum-any (car (remain input)))
              (cond ((match-pattern (r-cdr input) pattern))
                    (else (match-pattern-any (r-cdr input) pattern))))))
        (let ((retval (match-pattern-any input (car pattern))))
          (if retval
          (f-cons (accum-any) retval)
          #f))))))
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {});
     </script>
     <p><strong>MIME types defined:</strong> <code>text/x-scheme</code>.</p>

rhodecode/public/js/mode/smalltalk/index.html

➞

Show inline comments

@@ @@ -15,13 +15,13 @@ @@
     </style>
   </head>
   <body>
     <h1>CodeMirror: Smalltalk mode</h1>
 <form><textarea id="code" name="code">
+"
+"
     This is a test of the Smalltalk code
+"
 Seaside.WAComponent subclass: #MyCounter [
     | count |
     MyCounter class &gt;&gt; canBeRoot [ ^true ]

rhodecode/public/js/mode/smarty/index.html

➞

Show inline comments

@@ @@ -9,13 +9,13 @@ @@
     <style type="text/css">.CodeMirror {border-top: 1px solid black; border-bottom: 1px solid black;}</style>
     <link rel="stylesheet" href="../../doc/docs.css">
   </head>
   <body>
     <h1>CodeMirror: Smarty mode</h1>
-	<h3>Default settings (Smarty 2, <b>{</b> and <b>}</b> delimiters)</h3>
+    <h3>Default settings (Smarty 2, <b>{</b> and <b>}</b> delimiters)</h3>
     <form><textarea id="code" name="code">
 {extends file="parent.tpl"}
 {include file="template.tpl"}
 {* some example Smarty content *}
 {if isset($name) && $name == 'Blog'}
@@ @@ -41,13 +41,13 @@ @@
         mode: "smarty"
       });
     </script>
     <br />
-	<h3>Smarty 2, custom delimiters</h3>
+    <h3>Smarty 2, custom delimiters</h3>
     <form><textarea id="code2" name="code2">
 {--extends file="parent.tpl"--}
 {--include file="template.tpl"--}
 {--* some example Smarty content *--}
 {--if isset($name) && $name == 'Blog'--}
@@ @@ -75,22 +75,22 @@ @@
           leftDelimiter: "{--",
           rightDelimiter: "--}"
+        }
       });
     </script>
-	<br />
+    <br />
-	<h3>Smarty 3</h3>
+    <h3>Smarty 3</h3>
-	<textarea id="code3" name="code3">
+    <textarea id="code3" name="code3">
 Nested tags {$foo={counter one=1 two={inception}}+3} are now valid in Smarty 3.
 <script>
 function test() {
-	console.log("Smarty 3 permits single curly braces followed by whitespace to NOT slip into Smarty mode.");
+    console.log("Smarty 3 permits single curly braces followed by whitespace to NOT slip into Smarty mode.");
+}
 </script>
 {assign var=foo value=[1,2,3]}
 {assign var=foo value=['y'=>'yellow','b'=>'blue']}
 {assign var=foo value=[1,[9,8],3]}
@@ @@ -107,19 +107,19 @@ Smarty "dot" syntax (note: embedded {} a @@
 {$foo.a.$b.c}     => $foo['a'][$b]['c']
 {$foo.a.{$b+4}.c} => $foo['a'][$b+4]['c']
 {$foo.a.{$b.c}}   => $foo['a'][$b['c']]
 {$object->method1($x)->method2($y)}</textarea>
 	<script>
 		var editor = CodeMirror.fromTextArea(document.getElementById("code3"), {
 			lineNumbers: true,
 			mode: "smarty",
 			smartyVersion: 3
 		});
 	</script>
     <script>
         var editor = CodeMirror.fromTextArea(document.getElementById("code3"), {
             lineNumbers: true,
             mode: "smarty",
             smartyVersion: 3
         });
     </script>
     <p>A plain text/Smarty version 2 or 3 mode, which allows for custom delimiter tags.</p>
     <p><strong>MIME types defined:</strong> <code>text/x-smarty</code></p>
   </body>

rhodecode/public/js/mode/sql/index.html

➞

Show inline comments

@@ @@ -35,27 +35,27 @@ var init = function() { @@
     </head>
     <body onload="init();">
         <h1>SQL Mode for CodeMirror</h1>
         <form>
             <textarea id="code" name="code">-- SQL Mode for CodeMirror
 SELECT SQL_NO_CACHE DISTINCT
 		@var1 AS `val1`, @'val2', @global.'sql_mode',
 .1 AS `float_val`, .14 AS `another_float`, 0.09e3 AS `int_with_esp`,
 xFA5 AS `hex`, x'fa5' AS `hex2`, 0b101 AS `bin`, b'101' AS `bin2`,
 		DATE '1994-01-01' AS `sql_date`, { T "1994-01-01" } AS `odbc_date`,
 		'my string', _utf8'your string', N'her string',
         @var1 AS `val1`, @'val2', @global.'sql_mode',
 .1 AS `float_val`, .14 AS `another_float`, 0.09e3 AS `int_with_esp`,
 xFA5 AS `hex`, x'fa5' AS `hex2`, 0b101 AS `bin`, b'101' AS `bin2`,
         DATE '1994-01-01' AS `sql_date`, { T "1994-01-01" } AS `odbc_date`,
         'my string', _utf8'your string', N'her string',
         TRUE, FALSE, UNKNOWN
 	FROM DUAL
 	-- space needed after '--'
 	# 1 line comment
 	/* multiline
 	comment! */
 	LIMIT 1 OFFSET 0;
     FROM DUAL
     -- space needed after '--'
     # 1 line comment
     /* multiline
     comment! */
     LIMIT 1 OFFSET 0;
 </textarea>
             </form>
-            <p><strong>MIME types defined:</strong>
             <p><strong>MIME types defined:</strong>
             <code><a href="?mime=text/x-sql">text/x-sql</a></code>,
             <code><a href="?mime=text/x-mysql">text/x-mysql</a></code>,
             <code><a href="?mime=text/x-mariadb">text/x-mariadb</a></code>,
             <code><a href="?mime=text/x-cassandra">text/x-cassandra</a></code>,
             <code><a href="?mime=text/x-plsql">text/x-plsql</a></code>.
         </p>

rhodecode/public/js/mode/stex/index.html

➞

Show inline comments

@@ @@ -17,17 +17,17 @@ @@
 \importmodule[\KWARCslides{dmath/en/cardinality}]{cardinality}
 \begin{frame}
   \frametitle{Size Lemma for Balanced Trees}
   \begin{itemize}
   \item
     \begin{assertion}[id=size-lemma,type=lemma]
     Let $G=\tup{V,E}$ be a \termref[cd=binary-trees]{balanced binary tree}
     \begin{assertion}[id=size-lemma,type=lemma]
     Let $G=\tup{V,E}$ be a \termref[cd=binary-trees]{balanced binary tree}
     of \termref[cd=graph-depth,name=vertex-depth]{depth}$n>i$, then the set
      $\defeq{\livar{V}i}{\setst{\inset{v}{V}}{\gdepth{v} = i}}$ of
-    \termref[cd=graphs-intro,name=node]{nodes} at
     \termref[cd=graphs-intro,name=node]{nodes} at
     \termref[cd=graph-depth,name=vertex-depth]{depth} $i$ has
     \termref[cd=cardinality,name=cardinality]{cardinality} $\power2i$.
    \end{assertion}
   \item
     \begin{sproof}[id=size-lemma-pf,proofend=,for=size-lemma]{via induction over the depth $i$.}
       \begin{spfcases}{We have to consider two cases}
@@ @@ -36,13 +36,13 @@ @@
             then $\livar{V}i=\set{\livar{v}r}$, where $\livar{v}r$ is the root, so
             $\eq{\card{\livar{V}0},\card{\set{\livar{v}r}},1,\power20}$.
           \end{spfstep}
         \end{spfcase}
         \begin{spfcase}{$i>0$}
           \begin{spfstep}[display=flow]
-           then $\livar{V}{i-1}$ contains $\power2{i-1}$ vertexes
            then $\livar{V}{i-1}$ contains $\power2{i-1}$ vertexes
            \begin{justification}[method=byIH](IH)\end{justification}
           \end{spfstep}
           \begin{spfstep}
            By the \begin{justification}[method=byDef]definition of a binary
               tree\end{justification}, each $\inset{v}{\livar{V}{i-1}}$ is a leaf or has
             two children that are at depth $i$.
@@ @@ -54,14 +54,14 @@ @@
           \begin{spfstep}[type=conclusion]
            Thus $\eq{\card{\livar{V}i},{\atimes[cdot]{2,\card{\livar{V}{i-1}}}},{\atimes[cdot]{2,\power2{i-1}}},\power2i}$.
           \end{spfstep}
         \end{spfcase}
       \end{spfcases}
     \end{sproof}
   \item
     \begin{assertion}[id=fbbt,type=corollary]
   \item
     \begin{assertion}[id=fbbt,type=corollary]
       A fully balanced tree of depth $d$ has $\power2{d+1}-1$ nodes.
     \end{assertion}
   \item
       \begin{sproof}[for=fbbt,id=fbbt-pf]{}
         \begin{spfstep}
           Let $\defeq{G}{\tup{V,E}}$ be a fully balanced tree
@@ @@ -78,13 +78,13 @@ @@
     this is that they are very shallow (and this compute very fast), which is the essence of
     the next result.
   \end{omtext}
 \end{note}
 \end{module}
-%%% Local Variables:
 %%% Local Variables:
 %%% mode: LaTeX
 %%% TeX-master: "all"
 %%% End: \end{document}
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {});

rhodecode/public/js/mode/tcl/index.html

➞

Show inline comments

@@ @@ -60,19 +60,19 @@ namespace eval whois { @@
   bind raw -|- "318" whois::318
   bind raw -|- "307" whois::307
+}
 proc whois::311 {from key text} {
   if {[regexp -- {^[^\s]+\s(.+?)\s(.+?)\s(.+?)\s\*\s\:(.+)$} $text wholematch nick ident host realname]} {
     putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Host:${whois::textf} \
-	$nick \(${ident}@${host}\) ${whois::tagf}Realname:${whois::textf} $realname"
+    $nick \(${ident}@${host}\) ${whois::tagf}Realname:${whois::textf} $realname"
+  }
+}
 proc whois::multi {from key text} {
   if {[regexp {\:(.*)$} $text match $key]} {
     putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Note:${whois::textf} [subst $$key]"
-	return 1
+    return 1
+  }
+}
 proc whois::312 {from key text} {
   regexp {([^\s]+)\s\:} $text match server
   putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Server:${whois::textf} $server"
+}
@@ @@ -81,45 +81,45 @@ proc whois::319 {from key text} { @@
     putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Channels:${whois::textf} $channels"
+  }
+}
 proc whois::317 {from key text} {
   if {[regexp -- {.*\s(\d+)\s(\d+)\s\:} $text wholematch idle signon]} {
     putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Connected:${whois::textf} \
-	[ctime $signon] ${whois::tagf}Idle:${whois::textf} [duration $idle]"
+    [ctime $signon] ${whois::tagf}Idle:${whois::textf} [duration $idle]"
+  }
+}
 proc whois::301 {from key text} {
   if {[regexp {^.+\s[^\s]+\s\:(.*)$} $text match awaymsg]} {
     putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Away:${whois::textf} $awaymsg"
+  }
+}
 proc whois::318 {from key text} {
   namespace eval whois {
-	variable channel ""
+    variable channel ""
+  }
   variable whois::channel ""
+}
 proc whois::307 {from key text} {
   putserv "PRIVMSG $whois::channel :${whois::logo} ${whois::tagf}Services:${whois::textf} Registered Nick"
+}
 proc whois::list {nick host hand chan text} {
   if {[lsearch -exact [channel info $chan] "+${whois::command}"] != -1} {
     namespace eval whois {
 	  variable channel ""
+	}
       variable channel ""
+    }
     variable whois::channel $chan
     putserv "WHOIS $text"
+  }
+}
 putlog "\002*Loaded* \017\00304\002\[\00306W\003hois\00304\]\017 \002by \
 Ford_Lawnmower irc.GeekShed.net #Script-Help"
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         tabMode: "indent",
-		theme: "night",
+        theme: "night",
         lineNumbers: true,
         indentUnit: 2,
         mode: "text/x-tcl"
       });
     </script>

rhodecode/public/js/mode/tiddlywiki/index.html

➞

Show inline comments

@@ @@ -125,13 +125,13 @@ cf. [[TiddlyWiki.com|http://www.tiddlywi @@
 * To hide text within a tiddler so that it is not displayed, it can be wrapped in {{{/%}}} and {{{%/}}}.<br/>This can be a useful trick for hiding drafts or annotating complex markup.
 * To prevent wiki markup from taking effect for a particular section, that section can be enclosed in three double quotes: e.g. {{{"""WikiWord"""}}}.
 </textarea></div>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
-        mode: 'tiddlywiki',
         mode: 'tiddlywiki',
         lineNumbers: true,
         enterMode: 'keep',
         matchBrackets: true
       });
     </script>

rhodecode/public/js/mode/tiki/index.html

➞

Show inline comments

@@ @@ -68,14 +68,14 @@ Plugin Body @@
 Plugin (inline):
 {plugin attr="my attr"}
 </textarea></div>
 <script type="text/javascript">
 	var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         mode: 'tiki',
     var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         mode: 'tiki',
         lineNumbers: true
     });
 </script>
 </body>
 </html>

rhodecode/public/js/mode/tiki/tiki.css

➞

Show inline comments

 .cm-tw-syntaxerror {
 	color: #FFF;
 	background-color: #900;
     color: #FFF;
     background-color: #900;
+}
 .cm-tw-deleted {
-	text-decoration: line-through;
+    text-decoration: line-through;
+}
 .cm-tw-header5 {
-	font-weight: bold;
+    font-weight: bold;
+}
 .cm-tw-listitem:first-child { /*Added first child to fix duplicate padding when highlighting*/
-	padding-left: 10px;
+    padding-left: 10px;
+}
 .cm-tw-box {
 	border-top-width: 0px ! important;
 	border-style: solid;
 	border-width: 1px;
 	border-color: inherit;
     border-top-width: 0px ! important;
     border-style: solid;
     border-width: 1px;
     border-color: inherit;
+}
 .cm-tw-underline {
 	text-decoration: underline;
+}
@@ \ No newline at end of file @@
     text-decoration: underline;
+}

rhodecode/public/js/mode/turtle/index.html

➞

Show inline comments

@@ @@ -13,13 +13,13 @@ @@
     <h1>CodeMirror: Turtle mode</h1>
     <form><textarea id="code" name="code">
 @prefix foaf: <http://xmlns.com/foaf/0.1/> .
 @prefix geo: <http://www.w3.org/2003/01/geo/wgs84_pos#> .
 @prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
-<http://purl.org/net/bsletten>
 <http://purl.org/net/bsletten>
     a foaf:Person;
     foaf:interest <http://www.w3.org/2000/01/sw/>;
     foaf:based_near [
         geo:lat "34.0736111" ;
         geo:lon "-118.3994444"
+   ]

rhodecode/public/js/mode/vb/index.html

➞

Show inline comments

@@ @@ -8,31 +8,31 @@ @@
     <link rel="stylesheet" href="../../doc/docs.css">
     <link href="http://fonts.googleapis.com/css?family=Inconsolata" rel="stylesheet" type="text/css">
     <style>
       .CodeMirror {border: 1px solid #aaa; height:210px; height: auto;}
       .CodeMirror-scroll { overflow-x: auto; overflow-y: hidden;}
       .CodeMirror pre { font-family: Inconsolata; font-size: 14px}
-    </style>
     </style>
     <script type="text/javascript" src="../../addon/runmode/runmode.js"></script>
   </head>
   <body onload="init()">
     <h1>CodeMirror: VB.NET mode</h1>
 <script type="text/javascript">
 function test(golden, text) {
   var ok = true;
   var i = 0;
   function callback(token, style, lineNo, pos){
-		//console.log(String(token) + " " + String(style) + " " + String(lineNo) + " " + String(pos));
+        //console.log(String(token) + " " + String(style) + " " + String(lineNo) + " " + String(pos));
     var result = [String(token), String(style)];
     if (golden[i][0] != result[0] || golden[i][1] != result[1]){
       return "Error, expected: " + String(golden[i]) + ", got: " + String(result);
       ok = false;
+    }
     i++;
+  }
-  CodeMirror.runMode(text, "text/x-vb",callback);
   CodeMirror.runMode(text, "text/x-vb",callback);
   if (ok) return "Tests OK";
+}
 function testTypes() {
   var golden = [['Integer','keyword'],[' ','null'],['Float','keyword']]
   var text =  "Integer Float";
@@ @@ -69,15 +69,15 @@ function init() { @@
         readOnly: false,
         tabMode: "shift"
     });
     runTest();
+}
 function runTest() {
-	document.getElementById('testresult').innerHTML = testAll();
+    document.getElementById('testresult').innerHTML = testAll();
   initText(editor);
+}
 </script>
   <div id="edit">
   <textarea style="width:95%;height:200px;padding:5px;" name="solution" id="solution" ></textarea>

rhodecode/public/js/mode/vbscript/index.html

➞

Show inline comments

@@ @@ -20,23 +20,22 @@ @@
 Const ForReading = 1, ForWriting = 2, ForAppending = 8
 Call Sub020_PostBroadcastToUrbanAirship(strUserName, strPassword, intTransmitID, strResponse)
 If Not IsNull(strResponse) AND Len(strResponse) = 0 Then
-	boolTransmitOkYN = False
+    boolTransmitOkYN = False
 Else
 	' WScript.Echo "Oh Happy Day! Oh Happy DAY!"
 	boolTransmitOkYN = True
     ' WScript.Echo "Oh Happy Day! Oh Happy DAY!"
     boolTransmitOkYN = True
 End If
 </textarea></div>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true
       });
     </script>
     <p><strong>MIME types defined:</strong> <code>text/vbscript</code>.</p>
   </body>
 </html>

rhodecode/public/js/mode/verilog/index.html

➞

Show inline comments

@@ @@ -69,13 +69,13 @@ module butterfly @@
    // size of the twiddle factors.
    // If we do testing should catch it.
    assign ya_re = xa_re_z + xbw_re;
    assign ya_im = xa_im_z + xbw_im;
    assign yb_re = xa_re_z - xbw_re;
    assign yb_im = xa_im_z - xbw_im;
    // Create the multiply module.
    multiply_complex #(WIDTH) multiply_complex_0
      (.clk(clk),
       .rst_n(rst_n),
       .x(xb),
       .y(w),
@@ @@ -98,13 +98,13 @@ module butterfly @@
               begin
                  xa_re_z <= xa_re/2;
                  xa_im_z <= xa_im/2;
               end
          end
     end
 endmodule
 </textarea></form>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,

rhodecode/public/js/mode/xquery/index.html

➞

Show inline comments

 <!doctype html>
 <html>
 <!doctype html>
 <html>
 <!--
 /*
 Copyright (C) 2011 by MarkLogic Corporation
 Author: Mike Brevoort <mike@brevoort.com>
 Permission is hereby granted, free of charge, to any person obtaining a copy
@@ @@ -21,58 +21,58 @@ FITNESS FOR A PARTICULAR PURPOSE AND NON @@
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 THE SOFTWARE.
 */
 -->
-  <head>
   <head>
     <meta charset="utf-8">
     <title>CodeMirror: XQuery mode</title>
     <link rel="stylesheet" href="../../lib/codemirror.css">
     <script src="../../lib/codemirror.js"></script>
     <script src="xquery.js"></script>
     <link rel="stylesheet" href="../../doc/docs.css">
     <link rel="stylesheet" href="../../theme/xq-dark.css">
     <title>CodeMirror: XQuery mode</title>
     <link rel="stylesheet" href="../../lib/codemirror.css">
     <script src="../../lib/codemirror.js"></script>
     <script src="xquery.js"></script>
     <link rel="stylesheet" href="../../doc/docs.css">
     <link rel="stylesheet" href="../../theme/xq-dark.css">
     <style type="text/css">
 	.CodeMirror {
 	  border-top: 1px solid black; border-bottom: 1px solid black;
 	  height:400px;
+	}
     </style>
   </head>
   <body>
     <h1>CodeMirror: XQuery mode</h1>
 <div class="cm-s-default">
 	<textarea id="code" name="code">
     .CodeMirror {
       border-top: 1px solid black; border-bottom: 1px solid black;
       height:400px;
+    }
     </style>
   </head>
   <body>
     <h1>CodeMirror: XQuery mode</h1>
 <div class="cm-s-default">
     <textarea id="code" name="code">
 xquery version &quot;1.0-ml&quot;;
 (: this is
- : a
  : a
    "comment" :)
 let $let := &lt;x attr=&quot;value&quot;&gt;&quot;test&quot;&lt;func&gt;function() $var {function()} {$var}&lt;/func&gt;&lt;/x&gt;
 let $joe:=1
 return element element {
 	attribute attribute { 1 },
 	element test { &#39;a&#39; },
 	attribute foo { &quot;bar&quot; },
 	fn:doc()[ foo/@bar eq $let ],
 	//x }
     attribute attribute { 1 },
     element test { &#39;a&#39; },
     attribute foo { &quot;bar&quot; },
     fn:doc()[ foo/@bar eq $let ],
     //x }
 (: a more 'evil' test :)
 (: Modified Blakeley example (: with nested comment :) ... :)
 declare private function local:declare() {()};
 declare private function local:private() {()};
 declare private function local:function() {()};
 declare private function local:local() {()};
 let $let := &lt;let&gt;let $let := &quot;let&quot;&lt;/let&gt;
 return element element {
 	attribute attribute { try { xdmp:version() } catch($e) { xdmp:log($e) } },
 	attribute fn:doc { &quot;bar&quot; castable as xs:string },
 	element text { text { &quot;text&quot; } },
 	fn:doc()[ child::eq/(@bar | attribute::attribute) eq $let ],
 	//fn:doc
     attribute attribute { try { xdmp:version() } catch($e) { xdmp:log($e) } },
     attribute fn:doc { &quot;bar&quot; castable as xs:string },
     element text { text { &quot;text&quot; } },
     fn:doc()[ child::eq/(@bar | attribute::attribute) eq $let ],
     //fn:doc
+}
 xquery version &quot;1.0-ml&quot;;
@@ @@ -190,32 +190,32 @@ declare function json:print-name-value($ @@
   @param $x Element node to convert
   @return String holding JSON serialized representation of $x
   @author Jason Hunter
   @version 1.0.1
   Ported to xquery 1.0-ml; double escaped backslashes in json:escape
 :)
 declare function json:serialize($x as element())  as xs:string {
   string-join(('{', json:print-name-value($x), '}'), &quot;&quot;)
 };
   </textarea>
 </div>
     <script>
   </textarea>
 </div>
     <script>
       var editor = CodeMirror.fromTextArea(document.getElementById("code"), {
         lineNumbers: true,
         matchBrackets: true,
         theme: "xq-dark"
       });
     </script>
     <p><strong>MIME types defined:</strong> <code>application/xquery</code>.</p>
     <p>Development of the CodeMirror XQuery mode was sponsored by
       <a href="http://marklogic.com">MarkLogic</a> and developed by
     </script>
     <p><strong>MIME types defined:</strong> <code>application/xquery</code>.</p>
     <p>Development of the CodeMirror XQuery mode was sponsored by
       <a href="http://marklogic.com">MarkLogic</a> and developed by
       <a href="https://twitter.com/mbrevoort">Mike Brevoort</a>.
     </p>
   </body>
   </body>
 </html>

0 comments (0 inline, 0 general)