diff --git a/rhodecode/public/js/mode/apl/index.html b/rhodecode/public/js/mode/apl/index.html --- a/rhodecode/public/js/mode/apl/index.html +++ b/rhodecode/public/js/mode/apl/index.html @@ -3,13 +3,13 @@ CodeMirror: APL mode - - + + diff --git a/rhodecode/public/js/mode/asterisk/index.html b/rhodecode/public/js/mode/asterisk/index.html --- a/rhodecode/public/js/mode/asterisk/index.html +++ b/rhodecode/public/js/mode/asterisk/index.html @@ -52,66 +52,66 @@ 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}) diff --git a/rhodecode/public/js/mode/clike/scala.html b/rhodecode/public/js/mode/clike/scala.html --- a/rhodecode/public/js/mode/clike/scala.html +++ b/rhodecode/public/js/mode/clike/scala.html @@ -19,7 +19,7 @@ } html, form, .CodeMirror, .CodeMirror-scroll { - height: 100%; + height: 100%; } @@ -44,7 +44,7 @@ import parallel.ParIterable /** A template trait for traversable collections of type `Traversable[A]`. - * + * * $traversableInfo * @define mutability * @define traversableInfo @@ -54,15 +54,15 @@ * {{{ * 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 @@ -71,13 +71,13 @@ * * `scala.collection.immutable.Stream`. * 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 @@ -94,7 +94,7 @@ * @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] @@ -131,15 +131,15 @@ 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. * @@ -167,7 +167,7 @@ * 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. */ @@ -188,16 +188,16 @@ /** 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`. */ @@ -219,7 +219,7 @@ 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 } @@ -238,7 +238,7 @@ */ def filter(p: A => Boolean): Repr = { val b = newBuilder - for (x <- this) + for (x <- this) if (p(x)) b += x b.result } @@ -269,14 +269,14 @@ * 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 _ => @@ -288,7 +288,7 @@ /** 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. @@ -348,7 +348,7 @@ } /** Finds the first element of the $coll satisfying a predicate, if any. - * + * * $mayNotTerminateInf * $orderDependent * @@ -419,7 +419,7 @@ * @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) @@ -465,7 +465,7 @@ 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) @@ -501,7 +501,7 @@ val b = newBuilder if (until <= from) b.result else { - b.sizeHintBounded(until - from, this) + b.sizeHintBounded(until - from, this) sliceInternal(from, until, b) } } @@ -555,7 +555,7 @@ * * @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 @@ -574,12 +574,12 @@ * 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 */ @@ -623,7 +623,7 @@ } /** Creates a non-strict view of this $coll. - * + * * @return a non-strict view of this $coll. */ def view = new TraversableView[A, Repr] { @@ -635,10 +635,10 @@ * * 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` @@ -653,7 +653,7 @@ * 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. @@ -678,22 +678,22 @@ * 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. @@ -705,13 +705,13 @@ * 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 } @@ -721,15 +721,15 @@ * * @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. @@ -740,7 +740,7 @@ * 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)) } diff --git a/rhodecode/public/js/mode/cobol/index.html b/rhodecode/public/js/mode/cobol/index.html --- a/rhodecode/public/js/mode/cobol/index.html +++ b/rhodecode/public/js/mode/cobol/index.html @@ -83,7 +83,7 @@ 12345678911234567892123456789312345678941234567895123456789612345678971234567898 000010 IDENTIFICATION DIVISION. MODTGHERE 000020 PROGRAM-ID. SAMPLE. -000030 AUTHOR. TEST SAM. +000030 AUTHOR. TEST SAM. 000040 DATE-WRITTEN. 5 February 2013 000041 000042* A sample program just to show the form. @@ -119,12 +119,12 @@ 000280 01 DETAIL-LINE. 000290 05 FILLER PIC X(7) VALUE SPACES. 000300 05 RECORD-IMAGE PIC X(43). 000310 05 FILLER PIC X(30) VALUE SPACES. -000311 +000311 000312 01 SUMMARY-LINE. 000313 05 FILLER PIC X(7) VALUE SPACES. 000314 05 TOTAL-READ PIC 99. 000315 05 FILLER PIC X VALUE SPACE. -000316 05 FILLER PIC X(17) +000316 05 FILLER PIC X(17) 000317 VALUE 'Records were read'. 000318 05 FILLER PIC X(53) VALUE SPACES. 000319 @@ -151,12 +151,12 @@ 000490 WRITE PRINT-LINE. 000500 ADD 1 TO RECORDS-WRITTEN. 000510 READ STUDENT-FILE 000520 AT END MOVE 'NO' TO DATA-REMAINS-SWITCH -000530 END-READ. +000530 END-READ. 000540 000550 PRINT-SUMMARY. 000560 MOVE RECORDS-WRITTEN TO TOTAL-READ. 000570 MOVE SUMMARY-LINE TO PRINT-LINE. -000571 WRITE PRINT-LINE. +000571 WRITE PRINT-LINE. 000572 000580 @@ -167,7 +167,7 @@ 000580 mode: "text/x-cobol", theme : "twilight", styleActiveLine: true, - showCursorWhenSelecting : true, + showCursorWhenSelecting : true, }); function selectTheme() { var themeInput = document.getElementById("selectTheme"); diff --git a/rhodecode/public/js/mode/coffeescript/index.html b/rhodecode/public/js/mode/coffeescript/index.html --- a/rhodecode/public/js/mode/coffeescript/index.html +++ b/rhodecode/public/js/mode/coffeescript/index.html @@ -16,10 +16,10 @@ # 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: diff --git a/rhodecode/public/js/mode/diff/index.html b/rhodecode/public/js/mode/diff/index.html --- a/rhodecode/public/js/mode/diff/index.html +++ b/rhodecode/public/js/mode/diff/index.html @@ -38,21 +38,21 @@ index 04646a9..9a39cc7 100644 +++ 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) { @@ -78,7 +78,7 @@ index 04646a9..9a39cc7 100644 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}]);}, diff --git a/rhodecode/public/js/mode/ecl/index.html b/rhodecode/public/js/mode/ecl/index.html --- a/rhodecode/public/js/mode/ecl/index.html +++ b/rhodecode/public/js/mode/ecl/index.html @@ -19,7 +19,7 @@ this is a multiline comment! // this is a singleline comment! import ut; -r := +r := record string22 s1 := '123'; integer4 i1 := 123; diff --git a/rhodecode/public/js/mode/erlang/index.html b/rhodecode/public/js/mode/erlang/index.html --- a/rhodecode/public/js/mode/erlang/index.html +++ b/rhodecode/public/js/mode/erlang/index.html @@ -32,7 +32,7 @@ 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) -> diff --git a/rhodecode/public/js/mode/gas/index.html b/rhodecode/public/js/mode/gas/index.html --- a/rhodecode/public/js/mode/gas/index.html +++ b/rhodecode/public/js/mode/gas/index.html @@ -17,7 +17,7 @@ .syntax unified .global main -/* +/* * A * multi-line * comment. diff --git a/rhodecode/public/js/mode/gfm/index.html b/rhodecode/public/js/mode/gfm/index.html --- a/rhodecode/public/js/mode/gfm/index.html +++ b/rhodecode/public/js/mode/gfm/index.html @@ -9,13 +9,13 @@ - + - + diff --git a/rhodecode/public/js/mode/go/index.html b/rhodecode/public/js/mode/go/index.html --- a/rhodecode/public/js/mode/go/index.html +++ b/rhodecode/public/js/mode/go/index.html @@ -25,36 +25,36 @@ import "fmt" // Send the sequence 2, 3, 4, ... to channel 'ch'. func generate(ch chan<- int) { - for i := 2; ; i++ { - ch <- i // Send 'i' to channel 'ch' - } + for i := 2; ; i++ { + ch <- i // Send 'i' to channel 'ch' + } } // Copy the values from channel 'src' to channel 'dst', // removing those divisible by 'prime'. func filter(src <-chan int, dst chan<- int, prime int) { - for i := range src { // Loop over values received from 'src'. - if i%prime != 0 { - dst <- i // Send 'i' to channel 'dst'. - } - } + for i := range src { // Loop over values received from 'src'. + if i%prime != 0 { + dst <- 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 := <-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 := <-ch + fmt.Print(prime, "\n") + ch1 := make(chan int) + go filter(ch, ch1, prime) + ch = ch1 + } } func main() { - sieve() + sieve() } diff --git a/rhodecode/public/js/mode/haskell/index.html b/rhodecode/public/js/mode/haskell/index.html --- a/rhodecode/public/js/mode/haskell/index.html +++ b/rhodecode/public/js/mode/haskell/index.html @@ -44,7 +44,7 @@ permBag bs = concatMap (\(f,cs) -> map ( 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 diff --git a/rhodecode/public/js/mode/haxe/index.html b/rhodecode/public/js/mode/haxe/index.html --- a/rhodecode/public/js/mode/haxe/index.html +++ b/rhodecode/public/js/mode/haxe/index.html @@ -18,62 +18,62 @@ import one.two.Three; @attr("test") class Foo<T> 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<Int> - } - 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<Int> + } + 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); } diff --git a/rhodecode/public/js/mode/htmlembedded/index.html b/rhodecode/public/js/mode/htmlembedded/index.html --- a/rhodecode/public/js/mode/htmlembedded/index.html +++ b/rhodecode/public/js/mode/htmlembedded/index.html @@ -19,13 +19,13 @@
@@ -43,7 +43,7 @@ This is an example of EJS (embedded java

Mode for html embedded scripts like JSP and ASP.NET. Depends on HtmlMixed which in turn depends on JavaScript, CSS and XML.
Other dependancies include those of the scriping language chosen.

-

MIME types defined: application/x-aspx (ASP.NET), +

MIME types defined: application/x-aspx (ASP.NET), application/x-ejs (Embedded Javascript), application/x-jsp (JavaServer Pages)

diff --git a/rhodecode/public/js/mode/http/index.html b/rhodecode/public/js/mode/http/index.html --- a/rhodecode/public/js/mode/http/index.html +++ b/rhodecode/public/js/mode/http/index.html @@ -17,7 +17,7 @@ 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! diff --git a/rhodecode/public/js/mode/javascript/typescript.html b/rhodecode/public/js/mode/javascript/typescript.html --- a/rhodecode/public/js/mode/javascript/typescript.html +++ b/rhodecode/public/js/mode/javascript/typescript.html @@ -14,21 +14,21 @@
diff --git a/rhodecode/public/js/mode/pig/index.html b/rhodecode/public/js/mode/pig/index.html --- a/rhodecode/public/js/mode/pig/index.html +++ b/rhodecode/public/js/mode/pig/index.html @@ -14,7 +14,7 @@
-
+
-

Smarty 3

+

Smarty 3

- - +

A plain text/Smarty version 2 or 3 mode, which allows for custom delimiter tags.

diff --git a/rhodecode/public/js/mode/sql/index.html b/rhodecode/public/js/mode/sql/index.html --- a/rhodecode/public/js/mode/sql/index.html +++ b/rhodecode/public/js/mode/sql/index.html @@ -38,21 +38,21 @@ var init = function() { -

MIME types defined: +

MIME types defined: text/x-sql, text/x-mysql, text/x-mariadb, diff --git a/rhodecode/public/js/mode/stex/index.html b/rhodecode/public/js/mode/stex/index.html --- a/rhodecode/public/js/mode/stex/index.html +++ b/rhodecode/public/js/mode/stex/index.html @@ -20,11 +20,11 @@ \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} @@ -39,7 +39,7 @@ \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} @@ -57,8 +57,8 @@ \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 @@ -81,7 +81,7 @@ \end{note} \end{module} -%%% Local Variables: +%%% Local Variables: %%% mode: LaTeX %%% TeX-master: "all" %%% End: \end{document} diff --git a/rhodecode/public/js/mode/tcl/index.html b/rhodecode/public/js/mode/tcl/index.html --- a/rhodecode/public/js/mode/tcl/index.html +++ b/rhodecode/public/js/mode/tcl/index.html @@ -63,13 +63,13 @@ namespace eval whois { 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} { @@ -84,7 +84,7 @@ proc whois::319 {from key text} { 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} { @@ -94,7 +94,7 @@ proc whois::301 {from key text} { } proc whois::318 {from key text} { namespace eval whois { - variable channel "" + variable channel "" } variable whois::channel "" } @@ -104,8 +104,8 @@ proc whois::307 {from key text} { 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" } @@ -116,7 +116,7 @@ Ford_Lawnmower irc.GeekShed.net #Script- diff --git a/rhodecode/public/js/mode/tiki/tiki.css b/rhodecode/public/js/mode/tiki/tiki.css --- a/rhodecode/public/js/mode/tiki/tiki.css +++ b/rhodecode/public/js/mode/tiki/tiki.css @@ -1,26 +1,26 @@ .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; +} diff --git a/rhodecode/public/js/mode/turtle/index.html b/rhodecode/public/js/mode/turtle/index.html --- a/rhodecode/public/js/mode/turtle/index.html +++ b/rhodecode/public/js/mode/turtle/index.html @@ -16,7 +16,7 @@ @prefix geo: . @prefix rdf: . - + a foaf:Person; foaf:interest ; foaf:based_near [ diff --git a/rhodecode/public/js/mode/vb/index.html b/rhodecode/public/js/mode/vb/index.html --- a/rhodecode/public/js/mode/vb/index.html +++ b/rhodecode/public/js/mode/vb/index.html @@ -11,7 +11,7 @@ .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} - + @@ -21,7 +21,7 @@ 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); @@ -29,7 +29,7 @@ function test(golden, text) { } i++; } - CodeMirror.runMode(text, "text/x-vb",callback); + CodeMirror.runMode(text, "text/x-vb",callback); if (ok) return "Tests OK"; } @@ -72,9 +72,9 @@ function init() { runTest(); } function runTest() { - document.getElementById('testresult').innerHTML = testAll(); + document.getElementById('testresult').innerHTML = testAll(); initText(editor); - + } diff --git a/rhodecode/public/js/mode/vbscript/index.html b/rhodecode/public/js/mode/vbscript/index.html --- a/rhodecode/public/js/mode/vbscript/index.html +++ b/rhodecode/public/js/mode/vbscript/index.html @@ -23,10 +23,10 @@ Const ForReading = 1, ForWriting = 2, Fo 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 @@ -39,4 +39,3 @@ End If

MIME types defined: text/vbscript.

- diff --git a/rhodecode/public/js/mode/verilog/index.html b/rhodecode/public/js/mode/verilog/index.html --- a/rhodecode/public/js/mode/verilog/index.html +++ b/rhodecode/public/js/mode/verilog/index.html @@ -72,7 +72,7 @@ module butterfly 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), @@ -101,7 +101,7 @@ module butterfly end end end - + endmodule diff --git a/rhodecode/public/js/mode/xquery/index.html b/rhodecode/public/js/mode/xquery/index.html --- a/rhodecode/public/js/mode/xquery/index.html +++ b/rhodecode/public/js/mode/xquery/index.html @@ -1,5 +1,5 @@ - - + + - + - CodeMirror: XQuery mode - - - - - + CodeMirror: XQuery mode + + + + + - - -

CodeMirror: XQuery mode

- -
- -
- - - -

MIME types defined: application/xquery.

- -

Development of the CodeMirror XQuery mode was sponsored by - MarkLogic and developed by + + +

MIME types defined: application/xquery.

+ +

Development of the CodeMirror XQuery mode was sponsored by + MarkLogic and developed by Mike Brevoort.

- - + +