APL mode ⍝ Conway's game of life ⍝ This example was inspired by the impressive demo at ⍝ http://www.youtube.com/watch?v=a9xAKttWgP4 ⍝ Create a matrix: ⍝ 0 1 1 ⍝ 1 1 0 ⍝ 0 1 0 creature ← (3 3 ⍴ ⍳ 9) ∈ 1 2 3 4 7 ⍝ Original creature from demo creature ← (3 3 ⍴ ⍳ 9) ∈ 1 3 6 7 8 ⍝ Glider ⍝ Place the creature on a larger board, near the centre board ← ¯1 ⊖ ¯2 ⌽ 5 7 ↑ creature ⍝ A function to move from one generation to the next life ← {∨/ 1 ⍵ ∧ 3 4 = ⊂+/ +⌿ 1 0 ¯1 ∘.⊖ 1 0 ¯1 ⌽¨ ⊂⍵} ⍝ Compute n-th generation and format it as a ⍝ character matrix gen ← {' #'[(life ⍣ ⍵) board]} ⍝ Show first three generations (gen 1) (gen 2) (gen 3) Simple mode that tries to handle APL as well as it can. It attempts to label functions/operators based upon monadic/dyadic usage (but this is far from fully fleshed out). This means there are meaningful classnames so hover states can have popups etc. MIME types defined: text/apl (APL code)
Asterisk dialplan mode ; extensions.conf - the Asterisk dial plan ; [general] ; ; If static is set to no, or omitted, then the pbx_config will rewrite ; this file when extensions are modified. Remember that all comments ; made in the file will be lost when that happens. static=yes #include "/etc/asterisk/additional_general.conf [iaxprovider] switch => IAX2/user:[key]@myserver/mycontext [dynamic] #exec /usr/bin/dynamic-peers.pl [trunkint] ; ; International long distance through trunk ; exten => _9011.,1,Macro(dundi-e164,${EXTEN:4}) exten => _9011.,n,Dial(${GLOBAL(TRUNK)}/${FILTER(0-9,${EXTEN:${GLOBAL(TRUNKMSD)}})}) [local] ; ; Master context for local, toll-free, and iaxtel calls only ; ignorepat => 9 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 => 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 => 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,n,Gosub(${EXTEN},stdexten(${GLOBAL(CONSOLE)})) exten => 1234,n,Goto(default,s,1) ; exited 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 ; ; # for when they're done with the demo ; 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" ; ; 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. ; ; 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 ; ; 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 ; exten => 7999,1,Set(TIMEOUT(absolute)=60) exten => 7999,2,Page(Local/Grandstream1@page&Local/Xlite1@page&Local/1234@page/n,d) ; Give voicemail at extension 8500 ; exten => 8500,1,VoicemailMain exten => 8500,n,Goto(s,6) MIME types defined: text/x-asterisk.
C-like mode /* C demo code */ #include <zmq.h> #include <pthread.h> #include <semaphore.h> #include <time.h> #include <stdio.h> #include <fcntl.h> #include <malloc.h> typedef struct { void* arg_socket; zmq_msg_t* arg_msg; char* arg_string; unsigned long arg_len; int arg_int, arg_command; int signal_fd; int pad; void* context; sem_t sem; } acl_zmq_context; #define p(X) (context->arg_##X) void* zmq_thread(void* context_pointer) { acl_zmq_context* context = (acl_zmq_context*)context_pointer; char ok = 'K', err = 'X'; int res; while (1) { while ((res = sem_wait(&context->sem)) == EINTR); if (res) {write(context->signal_fd, &err, 1); goto cleanup;} switch(p(command)) { case 0: goto cleanup; case 1: p(socket) = zmq_socket(context->context, p(int)); break; case 2: p(int) = zmq_close(p(socket)); break; case 3: p(int) = zmq_bind(p(socket), p(string)); break; case 4: p(int) = zmq_connect(p(socket), p(string)); break; case 5: p(int) = zmq_getsockopt(p(socket), p(int), (void*)p(string), &p(len)); break; case 6: p(int) = zmq_setsockopt(p(socket), p(int), (void*)p(string), p(len)); break; case 7: p(int) = zmq_send(p(socket), p(msg), p(int)); break; case 8: p(int) = zmq_recv(p(socket), p(msg), p(int)); break; case 9: p(int) = zmq_poll(p(socket), p(int), p(len)); break; } p(command) = errno; write(context->signal_fd, &ok, 1); } cleanup: close(context->signal_fd); free(context_pointer); return 0; } void* zmq_thread_init(void* zmq_context, int signal_fd) { acl_zmq_context* context = malloc(sizeof(acl_zmq_context)); pthread_t thread; context->context = zmq_context; context->signal_fd = signal_fd; sem_init(&context->sem, 1, 0); pthread_create(&thread, 0, &zmq_thread, context); pthread_detach(thread); return context; } C++ example #include <iostream> #include "mystuff/util.h" namespace { enum Enum { VAL1, VAL2, VAL3 }; char32_t unicode_string = U"\U0010FFFF"; string raw_string = R"delim(anything you want)delim"; int Helper(const MyType& param) { return 0; } } // namespace class ForwardDec; template <class T, class V> class Class : public BaseClass { const MyType<T, V> member_; public: const MyType<T, V>& Method() const { return member_; } void Method2(MyType<T, V>* value); } template <class T, class V> void Class::Method2(MyType<T, V>* value) { std::out << 1 >> method(); value->Method3(member_); member_ = value; } Java example import com.demo.util.MyType; import com.demo.util.MyInterface; public enum Enum { VAL1, VAL2, VAL3 } public class Class<T, V> implements MyInterface { public static final MyType<T, V> member; private class InnerClass { public int zero() { return 0; } } @Override public MyType method() { return member; } public void method2(MyType<T, V> value) { method(); value.method3(); member = value; } } Scala example object FilterTest extends App { def filter(xs: List[Int], threshold: Int) = { def process(ys: List[Int]): List[Int] = if (ys.isEmpty) ys else if (ys.head < threshold) ys.head :: process(ys.tail) else process(ys.tail) process(xs) } println(filter(List(1, 9, 2, 8, 3, 7, 4), 5)) } Simple mode that tries to handle C-like languages as well as it can. Takes two configuration parameters: keywords, an object whose property names are the keywords in the language, and useCPP, which determines whether C preprocessor directives are recognized. MIME types defined: text/x-csrc (C), text/x-c++src (C++), text/x-java (Java), text/x-csharp (C#), text/x-scala (Scala), text/x-vertex and x-shader/x-fragment (shader programs).
Scala mode /* __ *\ ** ________ ___ / / ___ Scala API ** ** / __/ __// _ | / / / _ | (c) 2003-2011, LAMP/EPFL ** ** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ ** ** /____/\___/_/ |_/____/_/ | | ** ** |/ ** \* */ package scala.collection import generic._ 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 * `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`. * * @author Martin Odersky * @version 2.8 * @since 2.8 * @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] with FilterMonadic[A, Repr] with TraversableOnce[A] with GenTraversableLike[A, Repr] with Parallelizable[A, ParIterable[A]] { self => import Traversable.breaks._ /** The type implementing this traversable */ protected type Self = Repr /** The collection of type $coll underlying this `TraversableLike` object. * By default this is implemented as the `TraversableLike` object itself, * but this can be overridden. */ def repr: Repr = this.asInstanceOf[Repr] /** The underlying collection seen as an instance of `$Coll`. * By default this is implemented as the current collection object itself, * but this can be overridden. */ protected[this] def thisCollection: Traversable[A] = this.asInstanceOf[Traversable[A]] /** A conversion from collections of type `Repr` to `$Coll` objects. * By default this is implemented as just a cast, but this can be overridden. */ protected[this] def toCollection(repr: Repr): Traversable[A] = repr.asInstanceOf[Traversable[A]] /** Creates a new builder for this collection type. */ 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`. * 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 /** Tests whether this $coll is empty. * * @return `true` if the $coll contain no elements, `false` otherwise. */ def isEmpty: Boolean = { var result = true breakable { for (x <- this) { result = false break } } result } /** 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. * * @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 = { val b = bf(repr) if (that.isInstanceOf[IndexedSeqLike[_, _]]) b.sizeHint(this, that.seq.size) b ++= thisCollection b ++= that.seq b.result } @bridge 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 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) b ++= that b ++= thisCollection b.result } /** This overload exists because: for the implementation of ++: we should reuse * that of ++ because many collections override it with more efficient versions. * Since TraversableOnce has no '++' method, we have to implement that directly, * but Traversable and down can use the overload. */ 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) 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) for (x <- this) b ++= f(x).seq b.result } /** Selects all elements of this $coll which satisfy a predicate. * * @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) if (p(x)) b += x b.result } /** Selects all elements of this $coll which do not satisfy a predicate. * * @param p the predicate used to test elements. * @return a new $coll consisting of all elements of this $coll that do not satisfy the given * predicate `p`. The order of the elements is preserved. */ def filterNot(p: A => Boolean): Repr = filter(!p(_)) def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { val b = bf(repr) for (x <- this) if (pf.isDefinedAt(x)) b += pf(x) b.result } /** Builds a new collection by applying an option-valued function to all * elements of this $coll on which the function is defined. * * @param f the option-valued function which filters and maps the $coll. * @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 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) 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 * 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 for (x <- this) (if (p(x)) l else r) += x (l.result, r.result) } def groupBy[K](f: A => K): immutable.Map[K, Repr] = { val m = mutable.Map.empty[K, Builder[A, Repr]] for (elem <- this) { val key = f(elem) val bldr = m.getOrElseUpdate(key, newBuilder) bldr += elem } val b = immutable.Map.newBuilder[K, Repr] for ((k, v) <- m) b += ((k, v.result)) b.result } /** Tests whether a predicate holds for all elements of this $coll. * * $mayNotTerminateInf * * @param p the predicate used to test elements. * @return `true` if the given predicate `p` holds for all elements * of this $coll, otherwise `false`. */ def forall(p: A => Boolean): Boolean = { var result = true breakable { for (x <- this) if (!p(x)) { result = false; break } } result } /** Tests whether a predicate holds for some of the elements of this $coll. * * $mayNotTerminateInf * * @param p the predicate used to test elements. * @return `true` if the given predicate `p` holds for some of the * elements of this $coll, otherwise `false`. */ def exists(p: A => Boolean): Boolean = { var result = false breakable { for (x <- this) 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. */ def find(p: A => Boolean): Option[A] = { var result: Option[A] = None breakable { for (x <- this) if (p(x)) { result = Some(x); break } } result } def scan[B >: A, That](z: B)(op: (B, B) => B)(implicit cbf: CanBuildFrom[Repr, B, That]): That = scanLeft(z)(op) def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { val b = bf(repr) b.sizeHint(this, 1) var acc = z b += acc for (x <- this) { acc = op(acc, x); b += acc } b.result } @migration(2, 9, "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse." ) def scanRight[B, That](z: B)(op: (A, B) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { var scanned = List(z) var acc = z for (x <- reversed) { acc = op(x, acc) scanned ::= acc } val b = bf(repr) for (elem <- scanned) b += elem b.result } /** Selects the first element of this $coll. * $orderDependent * @return the first element of this $coll. * @throws `NoSuchElementException` if the $coll is empty. */ def head: A = { var result: () => A = () => throw new NoSuchElementException breakable { for (x <- this) { result = () => x break } } result() } /** Optionally selects the first element. * $orderDependent * @return the first element of this $coll if it is nonempty, `None` if it is empty. */ def headOption: Option[A] = if (isEmpty) None else Some(head) /** 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. * $orderDependent * @return The last element of this $coll. * @throws NoSuchElementException If the $coll is empty. */ def last: A = { var lst = head for (x <- this) lst = x lst } /** Optionally selects the last element. * $orderDependent * @return the last element of this $coll$ if it is nonempty, `None` if it is empty. */ def lastOption: Option[A] = if (isEmpty) None else Some(last) /** Selects all elements except the last. * $orderDependent * @return a $coll consisting of all elements of this $coll * except the last one. * @throws `UnsupportedOperationException` if the $coll is empty. */ def init: Repr = { if (isEmpty) throw new UnsupportedOperationException("empty.init") var lst = head var follow = false val b = newBuilder b.sizeHint(this, -1) for (x <- this.seq) { if (follow) b += lst else follow = true lst = x } b.result } def take(n: Int): Repr = slice(0, n) def drop(n: Int): Repr = if (n <= 0) { val b = newBuilder b.sizeHint(this) b ++= thisCollection result } else sliceWithKnownDelta(n, Int.MaxValue, -n) def slice(from: Int, until: Int): Repr = sliceWithKnownBound(math.max(from, 0), until) // Precondition: from >= 0, until > 0, builder already configured for building. private[this] def sliceInternal(from: Int, until: Int, b: Builder[A, Repr]): Repr = { var i = 0 breakable { for (x <- this.seq) { if (i >= from) b += x i += 1 if (i >= until) break } } b.result } // Precondition: from >= 0 private[scala] def sliceWithKnownDelta(from: Int, until: Int, delta: Int): Repr = { val b = newBuilder if (until <= from) b.result else { b.sizeHint(this, delta) sliceInternal(from, until, b) } } // 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) sliceInternal(from, until, b) } } def takeWhile(p: A => Boolean): Repr = { val b = newBuilder breakable { for (x <- this) { if (!p(x)) break b += x } } b.result } def dropWhile(p: A => Boolean): Repr = { val b = newBuilder var go = false for (x <- this) { if (!p(x)) go = true if (go) b += x } b.result } def span(p: A => Boolean): (Repr, Repr) = { val l, r = newBuilder var toLeft = true for (x <- this) { toLeft = toLeft && p(x) (if (toLeft) l else r) += x } (l.result, r.result) } def splitAt(n: Int): (Repr, Repr) = { val l, r = newBuilder l.sizeHintBounded(n, this) if (n >= 0) r.sizeHint(this, -n) var i = 0 for (x <- this) { (if (i < n) l else r) += x i += 1 } (l.result, r.result) } /** 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`. * * @return an iterator over all the inits of this $coll * @example `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)` */ def inits: Iterator[Repr] = iterateUntilEmpty(_.init) /** Copies elements of this $coll to an array. * 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. * * * @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 breakable { for (x <- this) { if (i >= end) break xs(i) = x i += 1 } } } def toTraversable: Traversable[A] = thisCollection def toIterator: Iterator[A] = toStream.iterator def toStream: Stream[A] = toBuffer.toStream /** Converts this $coll to a string. * * @return a string representation of this collection. By default this * string consists of the `stringPrefix` of this $coll, * followed by all elements separated by commas and enclosed in parentheses. */ override def toString = mkString(stringPrefix + "(", ", ", ")") /** Defines the prefix of this object's `toString` representation. * * @return a string representation which starts the result of `toString` * applied to this $coll. By default the string prefix is the * simple name of the collection class $coll. */ def stringPrefix : String = { var string = repr.asInstanceOf[AnyRef].getClass.getName val idx1 = string.lastIndexOf('.' : Int) if (idx1 != -1) string = string.substring(idx1 + 1) 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) /** Creates a non-strict filter of this $coll. * * 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`. */ def withFilter(p: A => Boolean): FilterMonadic[A, Repr] = new WithFilter(p) /** A class supporting filtered operations. Instances of this class are * returned by method `withFilter`. */ class WithFilter(p: A => Boolean) extends FilterMonadic[A, Repr] { /** Builds a new collection by applying a function to all elements of the * outer $coll containing this `WithFilter` instance that satisfy predicate `p`. * * @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 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] * * @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) 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. * * @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) 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`. * 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) 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 = 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) it ++ Iterator(Nil) map (newBuilder ++= _ result) } }
Clojure mode ; Conway's Game of Life, based on the work of: ;; Laurent Petit https://gist.github.com/1200343 ;; Christophe Grand http://clj-me.cgrand.net/2011/08/19/conways-game-of-life (ns ^{:doc "Conway's Game of Life."} game-of-life) ;; Core game of life's algorithm functions (defn neighbours "Given a cell's coordinates, returns the coordinates of its neighbours." [[x y]] (for [dx [-1 0 1] dy (if (zero? dx) [-1 1] [-1 0 1])] [(+ dx x) (+ dy y)])) (defn step "Given a set of living cells, computes the new set of living cells." [cells] (set (for [[cell n] (frequencies (mapcat neighbours cells)) :when (or (= n 3) (and (= n 2) (cells cell)))] cell))) ;; Utility methods for displaying game on a text terminal (defn print-board "Prints a board on *out*, representing a step in the game." [board w h] (doseq [x (range (inc w)) y (range (inc h))] (if (= y 0) (print "\n")) (print (if (board [x y]) "[X]" " . ")))) (defn display-grids "Prints a squence of boards on *out*, representing several steps." [grids w h] (doseq [board grids] (print-board board w h) (print "\n"))) ;; Launches an example board (def ^{:doc "board represents the initial set of living cells"} board #{[2 1] [2 2] [2 3]}) (display-grids (take 3 (iterate step board)) 5 5) ;; Let's play with characters (println \1 \a \# \\ \" \( \newline \} \" \space \tab \return \backspace \u1000 \uAaAa \u9F9F) MIME types defined: text/x-clojure.
COBOL mode Select Theme default ambiance blackboard cobalt eclipse elegant erlang-dark lesser-dark midnight monokai neat night rubyblue solarized dark solarized light twilight vibrant-ink xq-dark xq-light Select Font Size 13px 14px 16px 18px 20px 24px 26px 28px 30px 32px 34px 36px Read-only Insert Spaces on Tab ---------1---------2---------3---------4---------5---------6---------7---------8 12345678911234567892123456789312345678941234567895123456789612345678971234567898 000010 IDENTIFICATION DIVISION. MODTGHERE 000020 PROGRAM-ID. SAMPLE. 000030 AUTHOR. TEST SAM. 000040 DATE-WRITTEN. 5 February 2013 000041 000042* A sample program just to show the form. 000043* The program copies its input to the output, 000044* and counts the number of records. 000045* At the end this number is printed. 000046 000050 ENVIRONMENT DIVISION. 000060 INPUT-OUTPUT SECTION. 000070 FILE-CONTROL. 000080 SELECT STUDENT-FILE ASSIGN TO SYSIN 000090 ORGANIZATION IS LINE SEQUENTIAL. 000100 SELECT PRINT-FILE ASSIGN TO SYSOUT 000110 ORGANIZATION IS LINE SEQUENTIAL. 000120 000130 DATA DIVISION. 000140 FILE SECTION. 000150 FD STUDENT-FILE 000160 RECORD CONTAINS 43 CHARACTERS 000170 DATA RECORD IS STUDENT-IN. 000180 01 STUDENT-IN PIC X(43). 000190 000200 FD PRINT-FILE 000210 RECORD CONTAINS 80 CHARACTERS 000220 DATA RECORD IS PRINT-LINE. 000230 01 PRINT-LINE PIC X(80). 000240 000250 WORKING-STORAGE SECTION. 000260 01 DATA-REMAINS-SWITCH PIC X(2) VALUE SPACES. 000261 01 RECORDS-WRITTEN PIC 99. 000270 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 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) 000317 VALUE 'Records were read'. 000318 05 FILLER PIC X(53) VALUE SPACES. 000319 000320 PROCEDURE DIVISION. 000321 000330 PREPARE-SENIOR-REPORT. 000340 OPEN INPUT STUDENT-FILE 000350 OUTPUT PRINT-FILE. 000351 MOVE ZERO TO RECORDS-WRITTEN. 000360 READ STUDENT-FILE 000370 AT END MOVE 'NO' TO DATA-REMAINS-SWITCH 000380 END-READ. 000390 PERFORM PROCESS-RECORDS 000410 UNTIL DATA-REMAINS-SWITCH = 'NO'. 000411 PERFORM PRINT-SUMMARY. 000420 CLOSE STUDENT-FILE 000430 PRINT-FILE. 000440 STOP RUN. 000450 000460 PROCESS-RECORDS. 000470 MOVE STUDENT-IN TO RECORD-IMAGE. 000480 MOVE DETAIL-LINE TO PRINT-LINE. 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. 000540 000550 PRINT-SUMMARY. 000560 MOVE RECORDS-WRITTEN TO TOTAL-READ. 000570 MOVE SUMMARY-LINE TO PRINT-LINE. 000571 WRITE PRINT-LINE. 000572 000580
CoffeeScript mode # CoffeeScript mode for CodeMirror # Copyright (c) 2011 Jeff Pickhardt, released under # the MIT License. # # 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 # demonstrate CoffeeScript mode for CodeMirror. # # To download CoffeeScript mode for CodeMirror, go to: # https://github.com/pickhardt/coffeescript-codemirror-mode # **Underscore.coffee # (c) 2011 Jeremy Ashkenas, DocumentCloud Inc.** # Underscore is freely distributable under the terms of the # [MIT license](http://en.wikipedia.org/wiki/MIT_License). # Portions of Underscore are inspired by or borrowed from # [Prototype.js](http://prototypejs.org/api), Oliver Steele's # [Functional](http://osteele.com), and John Resig's # [Micro-Templating](http://ejohn.org). # For all details and documentation: # http://documentcloud.github.com/underscore/ # Baseline setup # -------------- # Establish the root object, `window` in the browser, or `global` on the server. root = this # Save the previous value of the `_` variable. previousUnderscore = root._ ### Multiline comment ### # Establish the object that gets thrown to break out of a loop iteration. # `StopIteration` is SOP on Mozilla. breaker = if typeof(StopIteration) is 'undefined' then '__break__' else StopIteration #### Docco style single line comment (title) # Helper function to escape **RegExp** contents, because JS doesn't have one. escapeRegExp = (string) -> string.replace(/([.*+?^${}()|[\]\/\\])/g, '\\$1') # Save bytes in the minified (but not gzipped) version: ArrayProto = Array.prototype ObjProto = Object.prototype # Create quick reference variables for speed access to core prototypes. slice = ArrayProto.slice unshift = ArrayProto.unshift toString = ObjProto.toString hasOwnProperty = ObjProto.hasOwnProperty propertyIsEnumerable = ObjProto.propertyIsEnumerable # All **ECMA5** native implementations we hope to use are declared here. nativeForEach = ArrayProto.forEach nativeMap = ArrayProto.map nativeReduce = ArrayProto.reduce nativeReduceRight = ArrayProto.reduceRight nativeFilter = ArrayProto.filter nativeEvery = ArrayProto.every nativeSome = ArrayProto.some nativeIndexOf = ArrayProto.indexOf nativeLastIndexOf = ArrayProto.lastIndexOf nativeIsArray = Array.isArray nativeKeys = Object.keys # Create a safe reference to the Underscore object for use below. _ = (obj) -> new wrapper(obj) # Export the Underscore object for **CommonJS**. if typeof(exports) != 'undefined' then exports._ = _ # Export Underscore to global scope. root._ = _ # Current version. _.VERSION = '1.1.0' # Collection Functions # -------------------- # The cornerstone, an **each** implementation. # Handles objects implementing **forEach**, arrays, and raw objects. _.each = (obj, iterator, context) -> try if nativeForEach and obj.forEach is nativeForEach obj.forEach iterator, context else if _.isNumber obj.length iterator.call context, obj[i], i, obj for i in [0...obj.length] else iterator.call context, val, key, obj for own key, val of obj catch e throw e if e isnt breaker obj # Return the results of applying the iterator to each element. Use JavaScript # 1.6's version of **map**, if possible. _.map = (obj, iterator, context) -> return obj.map(iterator, context) if nativeMap and obj.map is nativeMap results = [] _.each obj, (value, index, list) -> results.push iterator.call context, value, index, list results # **Reduce** builds up a single result from a list of values. Also known as # **inject**, or **foldl**. Uses JavaScript 1.8's version of **reduce**, if possible. _.reduce = (obj, iterator, memo, context) -> if nativeReduce and obj.reduce is nativeReduce iterator = _.bind iterator, context if context return obj.reduce iterator, memo _.each obj, (value, index, list) -> memo = iterator.call context, memo, value, index, list memo # The right-associative version of **reduce**, also known as **foldr**. Uses # JavaScript 1.8's version of **reduceRight**, if available. _.reduceRight = (obj, iterator, memo, context) -> if nativeReduceRight and obj.reduceRight is nativeReduceRight iterator = _.bind iterator, context if context return obj.reduceRight iterator, memo reversed = _.clone(_.toArray(obj)).reverse() _.reduce reversed, iterator, memo, context # Return the first value which passes a truth test. _.detect = (obj, iterator, context) -> result = null _.each obj, (value, index, list) -> if iterator.call context, value, index, list result = value _.breakLoop() result # Return all the elements that pass a truth test. Use JavaScript 1.6's # **filter**, if it exists. _.filter = (obj, iterator, context) -> return obj.filter iterator, context if nativeFilter and obj.filter is nativeFilter results = [] _.each obj, (value, index, list) -> results.push value if iterator.call context, value, index, list results # Return all the elements for which a truth test fails. _.reject = (obj, iterator, context) -> results = [] _.each obj, (value, index, list) -> results.push value if not iterator.call context, value, index, list results # Determine whether all of the elements match a truth test. Delegate to # JavaScript 1.6's **every**, if it is present. _.every = (obj, iterator, context) -> iterator ||= _.identity return obj.every iterator, context if nativeEvery and obj.every is nativeEvery result = true _.each obj, (value, index, list) -> _.breakLoop() unless (result = result and iterator.call(context, value, index, list)) result # Determine if at least one element in the object matches a truth test. Use # JavaScript 1.6's **some**, if it exists. _.some = (obj, iterator, context) -> iterator ||= _.identity return obj.some iterator, context if nativeSome and obj.some is nativeSome result = false _.each obj, (value, index, list) -> _.breakLoop() if (result = iterator.call(context, value, index, list)) result # Determine if a given value is included in the array or object, # based on `===`. _.include = (obj, target) -> return _.indexOf(obj, target) isnt -1 if nativeIndexOf and obj.indexOf is nativeIndexOf return true for own key, val of obj when val is target false # Invoke a method with arguments on every item in a collection. _.invoke = (obj, method) -> args = _.rest arguments, 2 (if method then val[method] else val).apply(val, args) for val in obj # Convenience version of a common use case of **map**: fetching a property. _.pluck = (obj, key) -> _.map(obj, (val) -> val[key]) # Return the maximum item or (item-based computation). _.max = (obj, iterator, context) -> return Math.max.apply(Math, obj) if not iterator and _.isArray(obj) result = computed: -Infinity _.each obj, (value, index, list) -> computed = if iterator then iterator.call(context, value, index, list) else value computed >= result.computed and (result = {value: value, computed: computed}) result.value # Return the minimum element (or element-based computation). _.min = (obj, iterator, context) -> return Math.min.apply(Math, obj) if not iterator and _.isArray(obj) result = computed: Infinity _.each obj, (value, index, list) -> computed = if iterator then iterator.call(context, value, index, list) else value computed < result.computed and (result = {value: value, computed: computed}) result.value # Sort the object's values by a criterion produced by an iterator. _.sortBy = (obj, iterator, context) -> _.pluck(((_.map obj, (value, index, list) -> {value: value, criteria: iterator.call(context, value, index, list)} ).sort((left, right) -> a = left.criteria; b = right.criteria if a < b then -1 else if a > b then 1 else 0 )), 'value') # Use a comparator function to figure out at what index an object should # be inserted so as to maintain order. Uses binary search. _.sortedIndex = (array, obj, iterator) -> iterator ||= _.identity low = 0 high = array.length while low < high mid = (low + high) >> 1 if iterator(array[mid]) < iterator(obj) then low = mid + 1 else high = mid low # Convert anything iterable into a real, live array. _.toArray = (iterable) -> return [] if (!iterable) return iterable.toArray() if (iterable.toArray) return iterable if (_.isArray(iterable)) return slice.call(iterable) if (_.isArguments(iterable)) _.values(iterable) # Return the number of elements in an object. _.size = (obj) -> _.toArray(obj).length # Array Functions # --------------- # Get the first element of an array. Passing `n` will return the first N # values in the array. Aliased as **head**. The `guard` check allows it to work # with **map**. _.first = (array, n, guard) -> if n and not guard then slice.call(array, 0, n) else array[0] # Returns everything but the first entry of the array. Aliased as **tail**. # Especially useful on the arguments object. Passing an `index` will return # the rest of the values in the array from that index onward. The `guard` # check allows it to work with **map**. _.rest = (array, index, guard) -> slice.call(array, if _.isUndefined(index) or guard then 1 else index) # Get the last element of an array. _.last = (array) -> array[array.length - 1] # Trim out all falsy values from an array. _.compact = (array) -> item for item in array when item # Return a completely flattened version of an array. _.flatten = (array) -> _.reduce array, (memo, value) -> return memo.concat(_.flatten(value)) if _.isArray value memo.push value memo , [] # Return a version of the array that does not contain the specified value(s). _.without = (array) -> values = _.rest arguments val for val in _.toArray(array) when not _.include values, val # Produce a duplicate-free version of the array. If the array has already # been sorted, you have the option of using a faster algorithm. _.uniq = (array, isSorted) -> memo = [] for el, i in _.toArray array memo.push el if i is 0 || (if isSorted is true then _.last(memo) isnt el else not _.include(memo, el)) memo # Produce an array that contains every item shared between all the # passed-in arrays. _.intersect = (array) -> rest = _.rest arguments _.select _.uniq(array), (item) -> _.all rest, (other) -> _.indexOf(other, item) >= 0 # Zip together multiple lists into a single array -- elements that share # an index go together. _.zip = -> length = _.max _.pluck arguments, 'length' results = new Array length for i in [0...length] results[i] = _.pluck arguments, String i results # If the browser doesn't supply us with **indexOf** (I'm looking at you, MSIE), # we need this function. Return the position of the first occurrence of an # item in an array, or -1 if the item is not included in the array. _.indexOf = (array, item) -> return array.indexOf item if nativeIndexOf and array.indexOf is nativeIndexOf i = 0; l = array.length while l - i if array[i] is item then return i else i++ -1 # Provide JavaScript 1.6's **lastIndexOf**, delegating to the native function, # if possible. _.lastIndexOf = (array, item) -> return array.lastIndexOf(item) if nativeLastIndexOf and array.lastIndexOf is nativeLastIndexOf i = array.length while i if array[i] is item then return i else i-- -1 # Generate an integer Array containing an arithmetic progression. A port of # [the native Python **range** function](http://docs.python.org/library/functions.html#range). _.range = (start, stop, step) -> a = arguments solo = a.length <= 1 i = start = if solo then 0 else a[0] stop = if solo then a[0] else a[1] step = a[2] or 1 len = Math.ceil((stop - start) / step) return [] if len <= 0 range = new Array len idx = 0 loop return range if (if step > 0 then i - stop else stop - i) >= 0 range[idx] = i idx++ i+= step # Function Functions # ------------------ # Create a function bound to a given object (assigning `this`, and arguments, # optionally). Binding with arguments is also known as **curry**. _.bind = (func, obj) -> args = _.rest arguments, 2 -> func.apply obj or root, args.concat arguments # Bind all of an object's methods to that object. Useful for ensuring that # all callbacks defined on an object belong to it. _.bindAll = (obj) -> funcs = if arguments.length > 1 then _.rest(arguments) else _.functions(obj) _.each funcs, (f) -> obj[f] = _.bind obj[f], obj obj # Delays a function for the given number of milliseconds, and then calls # it with the arguments supplied. _.delay = (func, wait) -> args = _.rest arguments, 2 setTimeout((-> func.apply(func, args)), wait) # Memoize an expensive function by storing its results. _.memoize = (func, hasher) -> memo = {} hasher or= _.identity -> key = hasher.apply this, arguments return memo[key] if key of memo memo[key] = func.apply this, arguments # Defers a function, scheduling it to run after the current call stack has # cleared. _.defer = (func) -> _.delay.apply _, [func, 1].concat _.rest arguments # Returns the first function passed as an argument to the second, # allowing you to adjust arguments, run code before and after, and # conditionally execute the original function. _.wrap = (func, wrapper) -> -> wrapper.apply wrapper, [func].concat arguments # Returns a function that is the composition of a list of functions, each # consuming the return value of the function that follows. _.compose = -> funcs = arguments -> args = arguments for i in [funcs.length - 1..0] by -1 args = [funcs[i].apply(this, args)] args[0] # Object Functions # ---------------- # Retrieve the names of an object's properties. _.keys = nativeKeys or (obj) -> return _.range 0, obj.length if _.isArray(obj) key for key, val of obj # Retrieve the values of an object's properties. _.values = (obj) -> _.map obj, _.identity # Return a sorted list of the function names available in Underscore. _.functions = (obj) -> _.filter(_.keys(obj), (key) -> _.isFunction(obj[key])).sort() # Extend a given object with all of the properties in a source object. _.extend = (obj) -> for source in _.rest(arguments) obj[key] = val for key, val of source obj # Create a (shallow-cloned) duplicate of an object. _.clone = (obj) -> return obj.slice 0 if _.isArray obj _.extend {}, obj # Invokes interceptor with the obj, and then returns obj. # The primary purpose of this method is to "tap into" a method chain, # in order to perform operations on intermediate results within the chain. _.tap = (obj, interceptor) -> interceptor obj obj # Perform a deep comparison to check if two objects are equal. _.isEqual = (a, b) -> # Check object identity. return true if a is b # Different types? atype = typeof(a); btype = typeof(b) return false if atype isnt btype # Basic equality test (watch out for coercions). return true if `a == b` # One is falsy and the other truthy. return false if (!a and b) or (a and !b) # One of them implements an `isEqual()`? return a.isEqual(b) if a.isEqual # Check dates' integer values. return a.getTime() is b.getTime() if _.isDate(a) and _.isDate(b) # Both are NaN? return false if _.isNaN(a) and _.isNaN(b) # Compare regular expressions. if _.isRegExp(a) and _.isRegExp(b) return a.source is b.source and a.global is b.global and a.ignoreCase is b.ignoreCase and a.multiline is b.multiline # If a is not an object by this point, we can't handle it. return false if atype isnt 'object' # Check for different array lengths before comparing contents. return false if a.length and (a.length isnt b.length) # Nothing else worked, deep compare the contents. aKeys = _.keys(a); bKeys = _.keys(b) # Different object sizes? return false if aKeys.length isnt bKeys.length # Recursive comparison of contents. return false for key, val of a when !(key of b) or !_.isEqual(val, b[key]) true # Is a given array or object empty? _.isEmpty = (obj) -> return obj.length is 0 if _.isArray(obj) or _.isString(obj) return false for own key of obj true # Is a given value a DOM element? _.isElement = (obj) -> obj and obj.nodeType is 1 # Is a given value an array? _.isArray = nativeIsArray or (obj) -> !!(obj and obj.concat and obj.unshift and not obj.callee) # Is a given variable an arguments object? _.isArguments = (obj) -> obj and obj.callee # Is the given value a function? _.isFunction = (obj) -> !!(obj and obj.constructor and obj.call and obj.apply) # Is the given value a string? _.isString = (obj) -> !!(obj is '' or (obj and obj.charCodeAt and obj.substr)) # Is a given value a number? _.isNumber = (obj) -> (obj is +obj) or toString.call(obj) is '[object Number]' # Is a given value a boolean? _.isBoolean = (obj) -> obj is true or obj is false # Is a given value a Date? _.isDate = (obj) -> !!(obj and obj.getTimezoneOffset and obj.setUTCFullYear) # Is the given value a regular expression? _.isRegExp = (obj) -> !!(obj and obj.exec and (obj.ignoreCase or obj.ignoreCase is false)) # Is the given value NaN -- this one is interesting. `NaN != NaN`, and # `isNaN(undefined) == true`, so we make sure it's a number first. _.isNaN = (obj) -> _.isNumber(obj) and window.isNaN(obj) # Is a given value equal to null? _.isNull = (obj) -> obj is null # Is a given variable undefined? _.isUndefined = (obj) -> typeof obj is 'undefined' # Utility Functions # ----------------- # Run Underscore.js in noConflict mode, returning the `_` variable to its # previous owner. Returns a reference to the Underscore object. _.noConflict = -> root._ = previousUnderscore this # Keep the identity function around for default iterators. _.identity = (value) -> value # Run a function `n` times. _.times = (n, iterator, context) -> iterator.call context, i for i in [0...n] # Break out of the middle of an iteration. _.breakLoop = -> throw breaker # Add your own custom functions to the Underscore object, ensuring that # they're correctly added to the OOP wrapper as well. _.mixin = (obj) -> for name in _.functions(obj) addToWrapper name, _[name] = obj[name] # Generate a unique integer id (unique within the entire client session). # Useful for temporary DOM ids. idCounter = 0 _.uniqueId = (prefix) -> (prefix or '') + idCounter++ # By default, Underscore uses **ERB**-style template delimiters, change the # following template settings to use alternative delimiters. _.templateSettings = { start: '<%' end: '%>' interpolate: /<%=(.+?)%>/g } # JavaScript templating a-la **ERB**, pilfered from John Resig's # *Secrets of the JavaScript Ninja*, page 83. # Single-quote fix from Rick Strahl. # With alterations for arbitrary delimiters, and to preserve whitespace. _.template = (str, data) -> c = _.templateSettings endMatch = new RegExp("'(?=[^"+c.end.substr(0, 1)+"]*"+escapeRegExp(c.end)+")","g") fn = new Function 'obj', 'var p=[],print=function(){p.push.apply(p,arguments);};' + 'with(obj||{}){p.push(\'' + str.replace(/\r/g, '\\r') .replace(/\n/g, '\\n') .replace(/\t/g, '\\t') .replace(endMatch,"���") .split("'").join("\\'") .split("���").join("'") .replace(c.interpolate, "',$1,'") .split(c.start).join("');") .split(c.end).join("p.push('") + "');}return p.join('');" if data then fn(data) else fn # Aliases # ------- _.forEach = _.each _.foldl = _.inject = _.reduce _.foldr = _.reduceRight _.select = _.filter _.all = _.every _.any = _.some _.contains = _.include _.head = _.first _.tail = _.rest _.methods = _.functions # Setup the OOP Wrapper # --------------------- # If Underscore is called as a function, it returns a wrapped object that # can be used OO-style. This wrapper holds altered versions of all the # underscore functions. Wrapped objects may be chained. wrapper = (obj) -> this._wrapped = obj this # Helper function to continue chaining intermediate results. result = (obj, chain) -> if chain then _(obj).chain() else obj # A method to easily add functions to the OOP wrapper. addToWrapper = (name, func) -> wrapper.prototype[name] = -> args = _.toArray arguments unshift.call args, this._wrapped result func.apply(_, args), this._chain # Add all ofthe Underscore functions to the wrapper object. _.mixin _ # Add all mutator Array functions to the wrapper. _.each ['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], (name) -> method = Array.prototype[name] wrapper.prototype[name] = -> method.apply(this._wrapped, arguments) result(this._wrapped, this._chain) # Add all accessor Array functions to the wrapper. _.each ['concat', 'join', 'slice'], (name) -> method = Array.prototype[name] wrapper.prototype[name] = -> result(method.apply(this._wrapped, arguments), this._chain) # Start chaining a wrapped Underscore object. wrapper::chain = -> this._chain = true this # Extracts the result from a wrapped and chained object. wrapper::value = -> this._wrapped MIME types defined: text/x-coffeescript. The CoffeeScript mode was written by Jeff Pickhardt.
Common Lisp mode (in-package :cl-postgres) ;; These are used to synthesize reader and writer names for integer ;; reading/writing functions when the amount of bytes and the ;; signedness is known. Both the macro that creates the functions and ;; some macros that use them create names this way. (eval-when (:compile-toplevel :load-toplevel :execute) (defun integer-reader-name (bytes signed) (intern (with-standard-io-syntax (format nil "~a~a~a~a" '#:read- (if signed "" '#:u) '#:int bytes)))) (defun integer-writer-name (bytes signed) (intern (with-standard-io-syntax (format nil "~a~a~a~a" '#:write- (if signed "" '#:u) '#:int bytes))))) (defmacro integer-reader (bytes) "Create a function to read integers from a binary stream." (let ((bits (* bytes 8))) (labels ((return-form (signed) (if signed `(if (logbitp ,(1- bits) result) (dpb result (byte ,(1- bits) 0) -1) result) `result)) (generate-reader (signed) `(defun ,(integer-reader-name bytes signed) (socket) (declare (type stream socket) #.*optimize*) ,(if (= bytes 1) `(let ((result (the (unsigned-byte 8) (read-byte socket)))) (declare (type (unsigned-byte 8) result)) ,(return-form signed)) `(let ((result 0)) (declare (type (unsigned-byte ,bits) result)) ,@(loop :for byte :from (1- bytes) :downto 0 :collect `(setf (ldb (byte 8 ,(* 8 byte)) result) (the (unsigned-byte 8) (read-byte socket)))) ,(return-form signed)))))) `(progn ;; This causes weird errors on SBCL in some circumstances. Disabled for now. ;; (declaim (inline ,(integer-reader-name bytes t) ;; ,(integer-reader-name bytes nil))) (declaim (ftype (function (t) (signed-byte ,bits)) ,(integer-reader-name bytes t))) ,(generate-reader t) (declaim (ftype (function (t) (unsigned-byte ,bits)) ,(integer-reader-name bytes nil))) ,(generate-reader nil))))) (defmacro integer-writer (bytes) "Create a function to write integers to a binary stream." (let ((bits (* 8 bytes))) `(progn (declaim (inline ,(integer-writer-name bytes t) ,(integer-writer-name bytes nil))) (defun ,(integer-writer-name bytes nil) (socket value) (declare (type stream socket) (type (unsigned-byte ,bits) value) #.*optimize*) ,@(if (= bytes 1) `((write-byte value socket)) (loop :for byte :from (1- bytes) :downto 0 :collect `(write-byte (ldb (byte 8 ,(* byte 8)) value) socket))) (values)) (defun ,(integer-writer-name bytes t) (socket value) (declare (type stream socket) (type (signed-byte ,bits) value) #.*optimize*) ,@(if (= bytes 1) `((write-byte (ldb (byte 8 0) value) socket)) (loop :for byte :from (1- bytes) :downto 0 :collect `(write-byte (ldb (byte 8 ,(* byte 8)) value) socket))) (values))))) ;; All the instances of the above that we need. (integer-reader 1) (integer-reader 2) (integer-reader 4) (integer-reader 8) (integer-writer 1) (integer-writer 2) (integer-writer 4) (defun write-bytes (socket bytes) "Write a byte-array to a stream." (declare (type stream socket) (type (simple-array (unsigned-byte 8)) bytes) #.*optimize*) (write-sequence bytes socket)) (defun write-str (socket string) "Write a null-terminated string to a stream \(encoding it when UTF-8 support is enabled.)." (declare (type stream socket) (type string string) #.*optimize*) (enc-write-string string socket) (write-uint1 socket 0)) (declaim (ftype (function (t unsigned-byte) (simple-array (unsigned-byte 8) (*))) read-bytes)) (defun read-bytes (socket length) "Read a byte array of the given length from a stream." (declare (type stream socket) (type fixnum length) #.*optimize*) (let ((result (make-array length :element-type '(unsigned-byte 8)))) (read-sequence result socket) result)) (declaim (ftype (function (t) string) read-str)) (defun read-str (socket) "Read a null-terminated string from a stream. Takes care of encoding when UTF-8 support is enabled." (declare (type stream socket) #.*optimize*) (enc-read-string socket :null-terminated t)) (defun skip-bytes (socket length) "Skip a given number of bytes in a binary stream." (declare (type stream socket) (type (unsigned-byte 32) length) #.*optimize*) (dotimes (i length) (read-byte socket))) (defun skip-str (socket) "Skip a null-terminated string." (declare (type stream socket) #.*optimize*) (loop :for char :of-type fixnum = (read-byte socket) :until (zerop char))) (defun ensure-socket-is-closed (socket &key abort) (when (open-stream-p socket) (handler-case (close socket :abort abort) (error (error) (warn "Ignoring the error which happened while trying to close PostgreSQL socket: ~A" error))))) MIME types defined: text/x-common-lisp.
CSS mode /* Some example CSS */ @import url("something.css"); body { margin: 0; padding: 3em 6em; font-family: tahoma, arial, sans-serif; color: #000; } #navigation a { font-weight: bold; text-decoration: none !important; } h1 { font-size: 2.5em; } h2 { font-size: 1.7em; } h1:before, h2:before { content: "::"; } code { font-family: courier, monospace; font-size: 80%; color: #418A8A; } MIME types defined: text/css, text/x-scss (demo), text/x-less (demo). Parsing/Highlighting Tests: normal, verbose.
LESS mode @media screen and (device-aspect-ratio: 16/9) { … } @media screen and (device-aspect-ratio: 1280/720) { … } @media screen and (device-aspect-ratio: 2560/1440) { … } html:lang(fr-be) tr:nth-child(2n+1) /* represents every odd row of an HTML table */ img:nth-of-type(2n+1) { float: right; } img:nth-of-type(2n) { float: left; } body > h2:not(:first-of-type):not(:last-of-type) html|*:not(:link):not(:visited) *|*:not(:hover) p::first-line { text-transform: uppercase } @namespace foo url(http://www.example.com); foo|h1 { color: blue } /* first rule */ span[hello="Ocean"][goodbye="Land"] E[foo]{ padding:65px; } input[type="search"]::-webkit-search-decoration, input[type="search"]::-webkit-search-cancel-button { -webkit-appearance: none; // Inner-padding issues in Chrome OSX, Safari 5 } button::-moz-focus-inner, input::-moz-focus-inner { // Inner padding and border oddities in FF3/4 padding: 0; border: 0; } .btn { // 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; } .rounded-corners (@radius: 5px) { border-radius: @radius; -webkit-border-radius: @radius; -moz-border-radius: @radius; } @import url("something.css"); @light-blue: hsl(190, 50%, 65%); #menu { position: absolute; width: 100%; z-index: 3; clear: both; display: block; background-color: @blue; height: 42px; border-top: 2px solid lighten(@alpha-blue, 20%); border-bottom: 2px solid darken(@alpha-blue, 25%); .box-shadow(0, 1px, 8px, 0.6); -moz-box-shadow: 0 0 0 #000; // Because firefox sucks. &.docked { background-color: hsla(210, 60%, 40%, 0.4); } &:hover { background-color: @blue; } #dropdown { margin: 0 0 0 117px; padding: 0; padding-top: 5px; display: none; width: 190px; border-top: 2px solid @medium; color: @highlight; 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; } li { font-size: 14px; display: block; text-align: left; padding: 0; border: 0; a { display: block; padding: 0px 15px; text-decoration: none; color: white; &:hover { background-color: darken(@medium, 15%); text-decoration: none; } } } .border-radius(5px, bottom); .box-shadow(0, 6px, 8px, 0.5); } } The LESS mode is a sub-mode of the CSS mode (defined in css.js. Parsing/Highlighting Tests: normal, verbose.
SCSS mode /* Some example SCSS */ @import "compass/css3"; $variable: #333; $blue: #3bbfce; $margin: 16px; .content-navigation { #nested { background-color: black; } border-color: $blue; color: darken($blue, 9%); } .border { padding: $margin / 2; margin: $margin / 2; border-color: $blue; } @mixin table-base { th { text-align: center; font-weight: bold; } td, th {padding: 2px} } table.hl { margin: 2em 0; td.ln { text-align: right; } } li { font: { family: serif; weight: bold; size: 1.2em; } } @mixin left($dist) { float: left; margin-left: $dist; } #data { @include left(10px); @include table-base; } .source { @include flow-into(target); border: 10px solid green; margin: 20px; width: 200px; } .new-container { @include flow-from(target); border: 10px solid red; margin: 20px; width: 200px; } body { margin: 0; padding: 3em 6em; font-family: tahoma, arial, sans-serif; color: #000; } @mixin yellow() { background: yellow; } .big { font-size: 14px; } .nested { @include border-radius(3px); @extend .big; p { background: whitesmoke; a { color: red; } } } #navigation a { font-weight: bold; text-decoration: none !important; } h1 { font-size: 2.5em; } h2 { font-size: 1.7em; } h1:before, h2:before { content: "::"; } code { font-family: courier, monospace; font-size: 80%; color: #418A8A; } The SCSS mode is a sub-mode of the CSS mode (defined in css.js. Parsing/Highlighting Tests: normal, verbose.
Cypher Mode for CodeMirror // Cypher Mode for CodeMirror, using the neo theme MATCH (joe { name: 'Joe' })-[:knows*2..2]-(friend_of_friend) WHERE NOT (joe)-[:knows]-(friend_of_friend) RETURN friend_of_friend.name, COUNT(*) ORDER BY COUNT(*) DESC , friend_of_friend.name MIME types defined: application/x-cypher-query
D mode /* D demo code // copied from phobos/sd/metastrings.d */ // Written in the D programming language. /** Templates with which to do compile-time manipulation of strings. Macros: WIKI = Phobos/StdMetastrings Copyright: Copyright Digital Mars 2007 - 2009. License: <a href="http://www.boost.org/LICENSE_1_0.txt">Boost License 1.0</a>. Authors: $(WEB digitalmars.com, Walter Bright), Don Clugston Source: $(PHOBOSSRC std/_metastrings.d) */ /* Copyright Digital Mars 2007 - 2009. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ module std.metastrings; /** Formats constants into a string at compile time. Analogous to $(XREF string,format). Parameters: A = tuple of constants, which can be strings, characters, or integral values. Formats: * The formats supported are %s for strings, and %% * for the % character. Example: --- import std.metastrings; import std.stdio; void main() { string s = Format!("Arg %s = %s", "foo", 27); writefln(s); // "Arg foo = 27" } * --- */ template Format(A...) { static if (A.length == 0) enum Format = ""; else static if (is(typeof(A[0]) : const(char)[])) enum Format = FormatString!(A[0], A[1..$]); else enum Format = toStringNow!(A[0]) ~ Format!(A[1..$]); } template FormatString(const(char)[] F, A...) { static if (F.length == 0) enum FormatString = Format!(A); else static if (F.length == 1) enum FormatString = F[0] ~ Format!(A); else static if (F[0..2] == "%s") enum FormatString = toStringNow!(A[0]) ~ FormatString!(F[2..$],A[1..$]); else static if (F[0..2] == "%%") enum FormatString = "%" ~ FormatString!(F[2..$],A); else { static assert(F[0] != '%', "unrecognized format %" ~ F[1]); enum FormatString = F[0] ~ FormatString!(F[1..$],A); } } unittest { auto s = Format!("hel%slo", "world", -138, 'c', true); assert(s == "helworldlo-138ctrue", "[" ~ s ~ "]"); } /** * Convert constant argument to a string. */ template toStringNow(ulong v) { static if (v < 10) enum toStringNow = "" ~ cast(char)(v + '0'); else enum toStringNow = toStringNow!(v / 10) ~ toStringNow!(v % 10); } unittest { static assert(toStringNow!(1uL << 62) == "4611686018427387904"); } /// ditto template toStringNow(long v) { static if (v < 0) enum toStringNow = "-" ~ toStringNow!(cast(ulong) -v); else enum toStringNow = toStringNow!(cast(ulong) v); } unittest { static assert(toStringNow!(0x100000000) == "4294967296"); static assert(toStringNow!(-138L) == "-138"); } /// ditto template toStringNow(uint U) { enum toStringNow = toStringNow!(cast(ulong)U); } /// ditto template toStringNow(int I) { enum toStringNow = toStringNow!(cast(long)I); } /// ditto template toStringNow(bool B) { enum toStringNow = B ? "true" : "false"; } /// ditto template toStringNow(string S) { enum toStringNow = S; } /// ditto template toStringNow(char C) { enum toStringNow = "" ~ C; } /******** * Parse unsigned integer literal from the start of string s. * returns: * .value = the integer literal as a string, * .rest = the string following the integer literal * Otherwise: * .value = null, * .rest = s */ template parseUinteger(const(char)[] s) { static if (s.length == 0) { enum value = ""; enum rest = ""; } else static if (s[0] >= '0' && s[0] <= '9') { enum value = s[0] ~ parseUinteger!(s[1..$]).value; enum rest = parseUinteger!(s[1..$]).rest; } else { enum value = ""; enum rest = s; } } /******** Parse integer literal optionally preceded by $(D '-') from the start of string $(D s). Returns: .value = the integer literal as a string, .rest = the string following the integer literal Otherwise: .value = null, .rest = s */ template parseInteger(const(char)[] s) { static if (s.length == 0) { enum value = ""; enum rest = ""; } else static if (s[0] >= '0' && s[0] <= '9') { enum value = s[0] ~ parseUinteger!(s[1..$]).value; enum rest = parseUinteger!(s[1..$]).rest; } else static if (s.length >= 2 && s[0] == '-' && s[1] >= '0' && s[1] <= '9') { enum value = s[0..2] ~ parseUinteger!(s[2..$]).value; enum rest = parseUinteger!(s[2..$]).rest; } else { enum value = ""; enum rest = s; } } unittest { assert(parseUinteger!("1234abc").value == "1234"); assert(parseUinteger!("1234abc").rest == "abc"); assert(parseInteger!("-1234abc").value == "-1234"); assert(parseInteger!("-1234abc").rest == "abc"); } /** Deprecated aliases held for backward compatibility. */ deprecated alias toStringNow ToString; /// Ditto deprecated alias parseUinteger ParseUinteger; /// Ditto deprecated alias parseUinteger ParseInteger; Simple mode that handle D-Syntax (DLang Homepage). MIME types defined: text/x-d .
Diff mode diff --git a/index.html b/index.html index c1d9156..7764744 100644 --- a/index.html +++ b/index.html @@ -95,7 +95,8 @@ StringStream.prototype = { <script> var editor = CodeMirror.fromTextArea(document.getElementById("code"), { lineNumbers: true, - autoMatchBrackets: true + autoMatchBrackets: true, + onGutterClick: function(x){console.log(x);} }); </script> </body> 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, target = e.target(); if (!start) return; setCursor(start.line, start.ch, false); if (e.button() != 1) return; + 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>"); + else html.push("<div>" + (options.lineNumbers ? i + options.firstLineNumber : "\u00a0") + "</div>"); } gutter.style.display = "none"; // TODO test whether this actually helps gutter.innerHTML = html.join(""); @@ -1371,10 +1377,8 @@ var CodeMirror = (function() { if (option == "parser") setParser(value); else if (option === "lineNumbers") setLineNumbers(value); else if (option === "gutter") setGutter(value); - else if (option === "readOnly") options.readOnly = value; - else if (option === "indentUnit") {options.indentUnit = indentUnit = value; setParser(options.parser);} - else if (/^(?:enterMode|tabMode|indentWithTabs|readOnly|autoMatchBrackets|undoDepth)$/.test(option)) options[option] = value; - else throw new Error("Can't set option " + option); + else if (option === "indentUnit") {options.indentUnit = value; setParser(options.parser);} + 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; } @@ -1420,6 +1425,7 @@ var CodeMirror = (function() { readOnly: false, onChange: null, onCursorActivity: null, + onGutterClick: null, autoMatchBrackets: false, workTime: 200, workDelay: 300, MIME types defined: text/x-diff.
Django template mode <!doctype html> <html> <head> <title>My Django web application</title> </head> <body> <h1> {{ page.title }} </h1> <ul class="my-list"> {% for item in items %} <li>{% item.name %}</li> {% empty %} <li>You have no items in your list.</li> {% endfor %} </ul> </body> </html> Mode for HTML with embedded Django template markup. MIME types defined: text/x-django
DTD mode <?xml version="1.0" encoding="UTF-8"?> <!ATTLIST title xmlns CDATA #FIXED "http://docbook.org/ns/docbook" role CDATA #IMPLIED %db.common.attributes; %db.common.linking.attributes; > <!-- Try: http://docbook.org/xml/5.0/dtd/docbook.dtd --> <!DOCTYPE xsl:stylesheet [ <!ENTITY nbsp " "> <!ENTITY copy "©"> <!ENTITY reg "®"> <!ENTITY trade "™"> <!ENTITY mdash "—"> <!ENTITY ldquo "“"> <!ENTITY rdquo "”"> <!ENTITY pound "£"> <!ENTITY yen "¥"> <!ENTITY euro "€"> <!ENTITY mathml "http://www.w3.org/1998/Math/MathML"> ] > <!ELEMENT title (#PCDATA|inlinemediaobject|remark|superscript|subscript|xref|link|olink|anchor|biblioref|alt|annotation|indexterm|abbrev|acronym|date|emphasis|footnote|footnoteref|foreignphrase|phrase|quote|wordasword|firstterm|glossterm|coref|trademark|productnumber|productname|database|application|hardware|citation|citerefentry|citetitle|citebiblioid|author|person|personname|org|orgname|editor|jobtitle|replaceable|package|parameter|termdef|nonterminal|systemitem|option|optional|property|inlineequation|tag|markup|token|symbol|literal|code|constant|email|uri|guiicon|guibutton|guimenuitem|guimenu|guisubmenu|guilabel|menuchoice|mousebutton|keycombo|keycap|keycode|keysym|shortcut|accel|prompt|envar|filename|command|computeroutput|userinput|function|varname|returnvalue|type|classname|exceptionname|interfacename|methodname|modifier|initializer|ooclass|ooexception|oointerface|errorcode|errortext|errorname|errortype)*> <!ENTITY % db.common.attributes " xml:id ID #IMPLIED version CDATA #IMPLIED xml:lang CDATA #IMPLIED xml:base CDATA #IMPLIED remap CDATA #IMPLIED xreflabel CDATA #IMPLIED revisionflag (changed|added|deleted|off) #IMPLIED dir (ltr|rtl|lro|rlo) #IMPLIED arch CDATA #IMPLIED audience CDATA #IMPLIED condition CDATA #IMPLIED conformance CDATA #IMPLIED os CDATA #IMPLIED revision CDATA #IMPLIED security CDATA #IMPLIED userlevel CDATA #IMPLIED vendor CDATA #IMPLIED wordsize CDATA #IMPLIED annotations CDATA #IMPLIED "> MIME types defined: application/xml-dtd.
Dylan mode Module: locators-internals Synopsis: Abstract modeling of locations Author: Andy Armstrong Copyright: Original Code is Copyright (c) 1995-2004 Functional Objects, Inc. All rights reserved. License: See License.txt in this distribution for details. Warranty: Distributed WITHOUT WARRANTY OF ANY KIND define open generic locator-server (locator :: <locator>) => (server :: false-or(<server-locator>)); define open generic locator-host (locator :: <locator>) => (host :: false-or(<string>)); define open generic locator-volume (locator :: <locator>) => (volume :: false-or(<string>)); define open generic locator-directory (locator :: <locator>) => (directory :: false-or(<directory-locator>)); define open generic locator-relative? (locator :: <locator>) => (relative? :: <boolean>); define open generic locator-path (locator :: <locator>) => (path :: <sequence>); define open generic locator-base (locator :: <locator>) => (base :: false-or(<string>)); define open generic locator-extension (locator :: <locator>) => (extension :: false-or(<string>)); /// Locator classes define open abstract class <directory-locator> (<physical-locator>) end class <directory-locator>; define open abstract class <file-locator> (<physical-locator>) end class <file-locator>; define method as (class == <directory-locator>, string :: <string>) => (locator :: <directory-locator>) as(<native-directory-locator>, string) end method as; define method make (class == <directory-locator>, #key server :: false-or(<server-locator>) = #f, path :: <sequence> = #[], relative? :: <boolean> = #f, name :: false-or(<string>) = #f) => (locator :: <directory-locator>) make(<native-directory-locator>, server: server, path: path, relative?: relative?, name: name) end method make; define method as (class == <file-locator>, string :: <string>) => (locator :: <file-locator>) as(<native-file-locator>, string) end method as; define method make (class == <file-locator>, #key directory :: false-or(<directory-locator>) = #f, base :: false-or(<string>) = #f, extension :: false-or(<string>) = #f, name :: false-or(<string>) = #f) => (locator :: <file-locator>) make(<native-file-locator>, directory: directory, base: base, extension: extension, name: name) end method make; /// Locator coercion //---*** andrewa: This caching scheme doesn't work yet, so disable it. define constant $cache-locators? = #f; define constant $cache-locator-strings? = #f; define constant $locator-to-string-cache = make(<object-table>, weak: #"key"); define constant $string-to-locator-cache = make(<string-table>, weak: #"value"); define open generic locator-as-string (class :: subclass(<string>), locator :: <locator>) => (string :: <string>); define open generic string-as-locator (class :: subclass(<locator>), string :: <string>) => (locator :: <locator>); define sealed sideways method as (class :: subclass(<string>), locator :: <locator>) => (string :: <string>) let string = element($locator-to-string-cache, locator, default: #f); if (string) as(class, string) else let string = locator-as-string(class, locator); if ($cache-locator-strings?) element($locator-to-string-cache, locator) := string; else string end end end method as; define sealed sideways method as (class :: subclass(<locator>), string :: <string>) => (locator :: <locator>) let locator = element($string-to-locator-cache, string, default: #f); if (instance?(locator, class)) locator else let locator = string-as-locator(class, string); if ($cache-locators?) element($string-to-locator-cache, string) := locator; else locator end end end method as; /// Locator conditions define class <locator-error> (<format-string-condition>, <error>) end class <locator-error>; define function locator-error (format-string :: <string>, #rest format-arguments) error(make(<locator-error>, format-string: format-string, format-arguments: format-arguments)) end function locator-error; /// Useful locator protocols define open generic locator-test (locator :: <directory-locator>) => (test :: <function>); define method locator-test (locator :: <directory-locator>) => (test :: <function>) \= end method locator-test; define open generic locator-might-have-links? (locator :: <directory-locator>) => (links? :: <boolean>); define method locator-might-have-links? (locator :: <directory-locator>) => (links? :: singleton(#f)) #f end method locator-might-have-links?; define method locator-relative? (locator :: <file-locator>) => (relative? :: <boolean>) let directory = locator.locator-directory; ~directory | directory.locator-relative? end method locator-relative?; define method current-directory-locator? (locator :: <directory-locator>) => (current-directory? :: <boolean>) locator.locator-relative? & locator.locator-path = #[#"self"] end method current-directory-locator?; define method locator-directory (locator :: <directory-locator>) => (parent :: false-or(<directory-locator>)) let path = locator.locator-path; unless (empty?(path)) make(object-class(locator), server: locator.locator-server, path: copy-sequence(path, end: path.size - 1), relative?: locator.locator-relative?) end end method locator-directory; /// Simplify locator define open generic simplify-locator (locator :: <physical-locator>) => (simplified-locator :: <physical-locator>); define method simplify-locator (locator :: <directory-locator>) => (simplified-locator :: <directory-locator>) let path = locator.locator-path; let relative? = locator.locator-relative?; let resolve-parent? = ~locator.locator-might-have-links?; let simplified-path = simplify-path(path, resolve-parent?: resolve-parent?, relative?: relative?); if (path ~= simplified-path) make(object-class(locator), server: locator.locator-server, path: simplified-path, relative?: locator.locator-relative?) else locator end end method simplify-locator; define method simplify-locator (locator :: <file-locator>) => (simplified-locator :: <file-locator>) let directory = locator.locator-directory; let simplified-directory = directory & simplify-locator(directory); if (directory ~= simplified-directory) make(object-class(locator), directory: simplified-directory, base: locator.locator-base, extension: locator.locator-extension) else locator end end method simplify-locator; /// Subdirectory locator define open generic subdirectory-locator (locator :: <directory-locator>, #rest sub-path) => (subdirectory :: <directory-locator>); define method subdirectory-locator (locator :: <directory-locator>, #rest sub-path) => (subdirectory :: <directory-locator>) let old-path = locator.locator-path; let new-path = concatenate-as(<simple-object-vector>, old-path, sub-path); make(object-class(locator), server: locator.locator-server, path: new-path, relative?: locator.locator-relative?) end method subdirectory-locator; /// Relative locator define open generic relative-locator (locator :: <physical-locator>, from-locator :: <physical-locator>) => (relative-locator :: <physical-locator>); define method relative-locator (locator :: <directory-locator>, from-locator :: <directory-locator>) => (relative-locator :: <directory-locator>) let path = locator.locator-path; let from-path = from-locator.locator-path; case ~locator.locator-relative? & from-locator.locator-relative? => locator-error ("Cannot find relative path of absolute locator %= from relative locator %=", locator, from-locator); locator.locator-server ~= from-locator.locator-server => locator; path = from-path => make(object-class(locator), path: vector(#"self"), relative?: #t); otherwise => make(object-class(locator), path: relative-path(path, from-path, test: locator.locator-test), relative?: #t); end end method relative-locator; define method relative-locator (locator :: <file-locator>, from-directory :: <directory-locator>) => (relative-locator :: <file-locator>) let directory = locator.locator-directory; let relative-directory = directory & relative-locator(directory, from-directory); if (relative-directory ~= directory) simplify-locator (make(object-class(locator), directory: relative-directory, base: locator.locator-base, extension: locator.locator-extension)) else locator end end method relative-locator; define method relative-locator (locator :: <physical-locator>, from-locator :: <file-locator>) => (relative-locator :: <physical-locator>) let from-directory = from-locator.locator-directory; case from-directory => relative-locator(locator, from-directory); ~locator.locator-relative? => locator-error ("Cannot find relative path of absolute locator %= from relative locator %=", locator, from-locator); otherwise => locator; end end method relative-locator; /// Merge locators define open generic merge-locators (locator :: <physical-locator>, from-locator :: <physical-locator>) => (merged-locator :: <physical-locator>); /// Merge locators define method merge-locators (locator :: <directory-locator>, from-locator :: <directory-locator>) => (merged-locator :: <directory-locator>) if (locator.locator-relative?) let path = concatenate(from-locator.locator-path, locator.locator-path); simplify-locator (make(object-class(locator), server: from-locator.locator-server, path: path, relative?: from-locator.locator-relative?)) else locator end end method merge-locators; define method merge-locators (locator :: <file-locator>, from-locator :: <directory-locator>) => (merged-locator :: <file-locator>) let directory = locator.locator-directory; let merged-directory = if (directory) merge-locators(directory, from-locator) else simplify-locator(from-locator) end; if (merged-directory ~= directory) make(object-class(locator), directory: merged-directory, base: locator.locator-base, extension: locator.locator-extension) else locator end end method merge-locators; define method merge-locators (locator :: <physical-locator>, from-locator :: <file-locator>) => (merged-locator :: <physical-locator>) let from-directory = from-locator.locator-directory; if (from-directory) merge-locators(locator, from-directory) else locator end end method merge-locators; /// Locator protocols define sideways method supports-open-locator? (locator :: <file-locator>) => (openable? :: <boolean>) ~locator.locator-relative? end method supports-open-locator?; define sideways method open-locator (locator :: <file-locator>, #rest keywords, #key, #all-keys) => (stream :: <stream>) apply(open-file-stream, locator, keywords) end method open-locator; MIME types defined: text/x-dylan.
ECL mode /* sample useless code to demonstrate ecl syntax highlighting this is a multiline comment! */ // this is a singleline comment! import ut; r := record string22 s1 := '123'; integer4 i1 := 123; end; #option('tmp', true); d := dataset('tmp::qb', r, thor); output(d); Based on CodeMirror's clike mode. For more information see HPCC Systems web site. MIME types defined: text/x-ecl.
Eiffel mode note description: "[ Project-wide universal properties. This class is an ancestor to all developer-written classes. ANY may be customized for individual projects or teams. ]" library: "Free implementation of ELKS library" status: "See notice at end of class." legal: "See notice at end of class." date: "$Date: 2013-01-25 11:49:00 -0800 (Fri, 25 Jan 2013) $" revision: "$Revision: 712 $" class ANY feature -- Customization feature -- Access generator: STRING -- Name of current object's generating class -- (base class of the type of which it is a direct instance) external "built_in" ensure generator_not_void: Result /= Void generator_not_empty: not Result.is_empty end generating_type: TYPE [detachable like Current] -- Type of current object -- (type of which it is a direct instance) do Result := {detachable like Current} ensure generating_type_not_void: Result /= Void end feature -- Status report conforms_to (other: ANY): BOOLEAN -- Does type of current object conform to type -- of `other' (as per Eiffel: The Language, chapter 13)? require other_not_void: other /= Void external "built_in" end same_type (other: ANY): BOOLEAN -- Is type of current object identical to type of `other'? require other_not_void: other /= Void external "built_in" ensure definition: Result = (conforms_to (other) and other.conforms_to (Current)) end feature -- Comparison is_equal (other: like Current): BOOLEAN -- Is `other' attached to an object considered -- equal to current object? require other_not_void: other /= Void external "built_in" ensure symmetric: Result implies other ~ Current consistent: standard_is_equal (other) implies Result end frozen standard_is_equal (other: like Current): BOOLEAN -- Is `other' attached to an object of the same type -- as current object, and field-by-field identical to it? require other_not_void: other /= Void external "built_in" ensure same_type: Result implies same_type (other) symmetric: Result implies other.standard_is_equal (Current) end frozen equal (a: detachable ANY; b: like a): BOOLEAN -- Are `a' and `b' either both void or attached -- to objects considered equal? do if a = Void then Result := b = Void else Result := b /= Void and then a.is_equal (b) end ensure definition: Result = (a = Void and b = Void) or else ((a /= Void and b /= Void) and then a.is_equal (b)) end frozen standard_equal (a: detachable ANY; b: like a): BOOLEAN -- Are `a' and `b' either both void or attached to -- field-by-field identical objects of the same type? -- Always uses default object comparison criterion. do if a = Void then Result := b = Void else Result := b /= Void and then a.standard_is_equal (b) end ensure definition: Result = (a = Void and b = Void) or else ((a /= Void and b /= Void) and then a.standard_is_equal (b)) end frozen is_deep_equal (other: like Current): BOOLEAN -- Are `Current' and `other' attached to isomorphic object structures? require other_not_void: other /= Void external "built_in" ensure shallow_implies_deep: standard_is_equal (other) implies Result same_type: Result implies same_type (other) symmetric: Result implies other.is_deep_equal (Current) end frozen deep_equal (a: detachable ANY; b: like a): BOOLEAN -- Are `a' and `b' either both void -- or attached to isomorphic object structures? do if a = Void then Result := b = Void else Result := b /= Void and then a.is_deep_equal (b) end ensure shallow_implies_deep: standard_equal (a, b) implies Result both_or_none_void: (a = Void) implies (Result = (b = Void)) same_type: (Result and (a /= Void)) implies (b /= Void and then a.same_type (b)) symmetric: Result implies deep_equal (b, a) end feature -- Duplication frozen twin: like Current -- New object equal to `Current' -- `twin' calls `copy'; to change copying/twinning semantics, redefine `copy'. external "built_in" ensure twin_not_void: Result /= Void is_equal: Result ~ Current end copy (other: like Current) -- Update current object using fields of object attached -- to `other', so as to yield equal objects. require other_not_void: other /= Void type_identity: same_type (other) external "built_in" ensure is_equal: Current ~ other end frozen standard_copy (other: like Current) -- Copy every field of `other' onto corresponding field -- of current object. require other_not_void: other /= Void type_identity: same_type (other) external "built_in" ensure is_standard_equal: standard_is_equal (other) end frozen clone (other: detachable ANY): like other -- Void if `other' is void; otherwise new object -- equal to `other' -- -- For non-void `other', `clone' calls `copy'; -- to change copying/cloning semantics, redefine `copy'. obsolete "Use `twin' instead." do if other /= Void then Result := other.twin end ensure equal: Result ~ other end frozen standard_clone (other: detachable ANY): like other -- Void if `other' is void; otherwise new object -- field-by-field identical to `other'. -- Always uses default copying semantics. obsolete "Use `standard_twin' instead." do if other /= Void then Result := other.standard_twin end ensure equal: standard_equal (Result, other) end frozen standard_twin: like Current -- New object field-by-field identical to `other'. -- Always uses default copying semantics. external "built_in" ensure standard_twin_not_void: Result /= Void equal: standard_equal (Result, Current) end frozen deep_twin: like Current -- New object structure recursively duplicated from Current. external "built_in" ensure deep_twin_not_void: Result /= Void deep_equal: deep_equal (Current, Result) end frozen deep_clone (other: detachable ANY): like other -- Void if `other' is void: otherwise, new object structure -- recursively duplicated from the one attached to `other' obsolete "Use `deep_twin' instead." do if other /= Void then Result := other.deep_twin end ensure deep_equal: deep_equal (other, Result) end frozen deep_copy (other: like Current) -- Effect equivalent to that of: -- `copy' (`other' . `deep_twin') require other_not_void: other /= Void do copy (other.deep_twin) ensure deep_equal: deep_equal (Current, other) end feature {NONE} -- Retrieval frozen internal_correct_mismatch -- Called from runtime to perform a proper dynamic dispatch on `correct_mismatch' -- from MISMATCH_CORRECTOR. local l_msg: STRING l_exc: EXCEPTIONS do if attached {MISMATCH_CORRECTOR} Current as l_corrector then l_corrector.correct_mismatch else create l_msg.make_from_string ("Mismatch: ") create l_exc l_msg.append (generating_type.name) l_exc.raise_retrieval_exception (l_msg) end end feature -- Output io: STD_FILES -- Handle to standard file setup once create Result Result.set_output_default ensure io_not_void: Result /= Void end out: STRING -- New string containing terse printable representation -- of current object do Result := tagged_out ensure out_not_void: Result /= Void end frozen tagged_out: STRING -- New string containing terse printable representation -- of current object external "built_in" ensure tagged_out_not_void: Result /= Void end print (o: detachable ANY) -- Write terse external representation of `o' -- on standard output. do if o /= Void then io.put_string (o.out) end end feature -- Platform Operating_environment: OPERATING_ENVIRONMENT -- Objects available from the operating system once create Result ensure operating_environment_not_void: Result /= Void end feature {NONE} -- Initialization default_create -- Process instances of classes with no creation clause. -- (Default: do nothing.) do end feature -- Basic operations default_rescue -- Process exception for routines with no Rescue clause. -- (Default: do nothing.) do end frozen do_nothing -- Execute a null action. do end frozen default: detachable like Current -- Default value of object's type do end frozen default_pointer: POINTER -- Default value of type `POINTER' -- (Avoid the need to write `p'.`default' for -- some `p' of type `POINTER'.) do ensure -- Result = Result.default end frozen as_attached: attached like Current -- Attached version of Current -- (Can be used during transitional period to convert -- non-void-safe classes to void-safe ones.) do Result := Current end invariant reflexive_equality: standard_is_equal (Current) reflexive_conformance: conforms_to (Current) note copyright: "Copyright (c) 1984-2012, Eiffel Software and others" license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)" source: "[ Eiffel Software 5949 Hollister Ave., Goleta, CA 93117 USA Telephone 805-685-1006, Fax 805-685-6869 Website http://www.eiffel.com Customer support http://support.eiffel.com ]" end MIME types defined: text/x-eiffel. Created by YNH.
Erlang mode %% -*- mode: erlang; erlang-indent-level: 2 -*- %%% Created : 7 May 2012 by mats cronqvist <masse@klarna.com> %% @doc %% Demonstrates how to print a record. %% @end -module('ex'). -author('mats cronqvist'). -export([demo/0, rec_info/1]). -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 -> try Fields = M:rec_info(element(1,Tup)), L = length(Fields)+1, lists:zip(Fields,expand_recs(M,tl(tuple_to_list(Tup)))) catch _:_ -> list_to_tuple(expand_recs(M,tuple_to_list(Tup))) end end; expand_recs(_,Term) -> Term. MIME types defined: text/x-erlang.
Fortran mode ! Example Fortran code program average ! Read in some numbers and take the average ! As written, if there are no data points, an average of zero is returned ! While this may not be desired behavior, it keeps this example simple implicit none real, dimension(:), allocatable :: points integer :: number_of_points real :: average_points=0., positive_average=0., negative_average=0. write (*,*) "Input number of points to average:" read (*,*) number_of_points allocate (points(number_of_points)) write (*,*) "Enter the points to average:" read (*,*) points ! Take the average by summing points and dividing by number_of_points if (number_of_points > 0) average_points = sum(points) / number_of_points ! Now form average over positive and negative points only if (count(points > 0.) > 0) then positive_average = sum(points, points > 0.) / count(points > 0.) end if if (count(points < 0.) > 0) then negative_average = sum(points, points < 0.) / count(points < 0.) end if deallocate (points) ! Print result to terminal write (*,'(a,g12.4)') 'Average = ', average_points write (*,'(a,g12.4)') 'Average of positive points = ', positive_average write (*,'(a,g12.4)') 'Average of negative points = ', negative_average end program average MIME types defined: text/x-Fortran.
Gas mode .syntax unified .global main /* * A * multi-line * comment. */ @ A single line comment. main: push {sp, lr} ldr r0, =message bl puts mov r0, #0 pop {sp, pc} message: .asciz "Hello world!<br />" Handles AT&T assembler syntax (more specifically this handles the GNU Assembler (gas) syntax.) It takes a single optional configuration parameter: architecture, which can be one of "ARM", "ARMv6" or "x86". Including the parameter adds syntax for the registers and special directives for the supplied architecture. MIME types defined: text/x-gas
GFM mode GitHub Flavored Markdown ======================== Everything from markdown plus GFM features: ## URL autolinking Underscores_are_allowed_between_words. ## Fenced code blocks (and syntax highlighting) ```javascript for (var i = 0; i < items.length; i++) { console.log(items[i], i); // log them } ``` ## Task Lists - [ ] Incomplete task list item - [x] **Completed** task list item ## A bit of GitHub spice * SHA: be6a8cc1c1ecfe9489fb51e4869af15a13fc2cd2 * User@SHA ref: mojombo@be6a8cc1c1ecfe9489fb51e4869af15a13fc2cd2 * User/Project@SHA: mojombo/god@be6a8cc1c1ecfe9489fb51e4869af15a13fc2cd2 * \#Num: #1 * User/#Num: mojombo#1 * User/Project#Num: mojombo/god#1 See http://github.github.com/github-flavored-markdown/. Optionally depends on other modes for properly highlighted code blocks. Parsing/Highlighting Tests: normal, verbose.
Gherkin mode Feature: Using Google Background: Something something Something else Scenario: Has a homepage When I navigate to the google home page Then the home page should contain the menu and the search form Scenario: Searching for a term When I navigate to the google home page When I search for Tofu Then the search results page is displayed Then the search results page contains 10 individual search results Then the search results contain a link to the wikipedia tofu page MIME types defined: text/x-feature.
Go mode // Prime Sieve in Go. // Taken from the Go specification. // Copyright © The Go Authors. package main 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' } } // 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'. } } } // 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 } } func main() { sieve() } MIME type: text/x-go
Groovy mode //Pattern for groovy script def p = ~/.*\.groovy/ new File( 'd:\\scripts' ).eachFileMatch(p) {f -> // imports list def imports = [] f.eachLine { // condition to detect an import instruction ln -> if ( ln =~ '^import .*' ) { imports << "${ln - 'import '}" } } // print thmen if ( ! imports.empty ) { println f imports.each{ println " $it" } } } /* Coin changer demo code from http://groovy.codehaus.org */ enum UsCoin { quarter(25), dime(10), nickel(5), penny(1) UsCoin(v) { value = v } final value } enum OzzieCoin { fifty(50), twenty(20), ten(10), five(5) OzzieCoin(v) { value = v } final value } def plural(word, count) { if (count == 1) return word word[-1] == 'y' ? word[0..-2] + "ies" : word + "s" } def change(currency, amount) { currency.values().inject([]){ list, coin -> int count = amount / coin.value amount = amount % coin.value list += "$count ${plural(coin.toString(), count)}" } } MIME types defined: text/x-groovy
HAML mode !!! #content .left.column(title="title"){:href => "/hello", :test => "#{hello}_#{world}"} <!-- This is a comment --> %h2 Welcome to our site! %p= puts "HAML MODE" .right.column = render :partial => "sidebar" .container .row .span8 %h1.title= @page_title %p.title= @page_title %p / The same as HTML comment Hello multiline comment -# haml comment This wont be displayed nor will this Date/Time: - now = DateTime.now %strong= now - if now > DateTime.parse("December 31, 2006") = "Happy new " + "year!" %title = @title \= @title <h1>Title</h1> <h1 title="HELLO"> Title </h1> MIME types defined: text/x-haml. Parsing/Highlighting Tests: normal, verbose.
Haskell mode module UniquePerms ( uniquePerms ) where -- | Find all unique permutations of a list where there might be duplicates. uniquePerms :: (Eq a) => [a] -> [[a]] uniquePerms = permBag . makeBag -- | An unordered collection where duplicate values are allowed, -- but represented with a single value and a count. type Bag a = [(a, Int)] makeBag :: (Eq a) => [a] -> Bag a makeBag [] = [] makeBag (a:as) = mix a $ makeBag as where mix a [] = [(a,1)] mix a (bn@(b,n):bs) | a == b = (b,n+1):bs | otherwise = bn : mix a bs permBag :: Bag a -> [[a]] 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 MIME types defined: text/x-haskell.
Haxe mode 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; } enum Color { red; green; blue; grey( v : Int ); rgb (r:Int,g:Int,b:Int); } Hxml mode: -cp test -js path/to/file.js #-remap nme:flash --next -D source-map-content -cmd 'test' -lib lime MIME types defined: text/x-haxe, text/x-hxml.
Html Embedded Scripts mode <% function 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 </script> 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), application/x-ejs (Embedded Javascript), application/x-jsp (JavaServer Pages)
HTML mixed mode <html style="color: green"> <!-- this is a comment --> <head> <title>Mixed HTML Example</title> <style type="text/css"> h1 {font-family: comic sans; color: #f0f;} div {background: yellow !important;} body { max-width: 50em; margin: 1em 2em 1em 5em; } </style> </head> <body> <h1>Mixed HTML Example</h1> <script> function jsFunc(arg1, arg2) { if (arg1 && arg2) document.body.innerHTML = "achoo"; } </script> </body> </html> The HTML mixed mode depends on the XML, JavaScript, and CSS modes. It takes an optional mode configuration option, scriptTypes, which can be used to add custom behavior for specific <script type="..."> tags. If given, it should hold an array of {matches, mode} objects, where matches is a string or regexp that matches the script type, and mode is either null, for script types that should stay in HTML mode, or a mode spec corresponding to the mode that should be used for the script. MIME types defined: text/html (redefined, only takes effect if you load this parser after the XML parser).
HTTP mode 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 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! MIME types defined: message/http.
Language modes This is a list of every mode in the distribution. Each mode lives in a subdirectory of the mode/ directory, and typically defines a single JavaScript file that implements the mode. Loading such file will make the language available to CodeMirror, through the mode option. APL Asterisk dialplan C, C++, C# Clojure COBOL CoffeeScript Common Lisp CSS Cypher Cython D Django (templating language) diff DTD Dylan ECL Eiffel Erlang Fortran F# Gas (AT&T-style assembly) Gherkin Go Groovy HAML Haskell Haxe HTML embedded scripts HTML mixed-mode HTTP Java Jade JavaScript Jinja2 Julia Kotlin LESS LiveScript Lua Markdown (GitHub-flavour) mIRC Modelica Nginx NTriples OCaml Octave (MATLAB) Pascal PEG.js Perl PHP Pig Latin Properties files Puppet Python Q R RPM reStructuredText Ruby Rust Sass Scala Scheme SCSS Shell Sieve Slim Smalltalk Smarty Smarty/HTML mixed Solr SQL (several dialects) SPARQL sTeX, LaTeX Tcl Textile Tiddlywiki Tiki wiki TOML Tornado (templating language) Turtle VB.NET VBScript Velocity Verilog/SystemVerilog XML/HTML XQuery YAML Z80
Jade Templating Mode doctype html html head title= "Jade Templating CodeMirror Mode Example" link(rel='stylesheet', href='/css/bootstrap.min.css') link(rel='stylesheet', href='/css/index.css') script(type='text/javascript', src='/js/jquery-1.9.1.min.js') script(type='text/javascript', src='/js/bootstrap.min.js') body div.header h1 Welcome to this Example div.spots if locals.spots each spot in spots div.spot.well div if spot.logo img.img-rounded.logo(src=spot.logo) else img.img-rounded.logo(src="img/placeholder.png") h3 a(href=spot.hash) ##{spot.hash} if spot.title span.title #{spot.title} if spot.desc div #{spot.desc} else h3 There are no spots currently available. The Jade Templating Mode Created by Forbes Lindesay. Managed as part of a Brackets extension at https://github.com/ForbesLindesay/jade-brackets. MIME type defined: text/x-jade.
JavaScript mode // Demo code (the actual new parser character stream implementation) function StringStream(string) { this.pos = 0; this.string = string; } StringStream.prototype = { done: function() {return this.pos >= this.string.length;}, peek: function() {return this.string.charAt(this.pos);}, next: function() { if (this.pos < this.string.length) return this.string.charAt(this.pos++); }, eat: function(match) { var ch = this.string.charAt(this.pos); if (typeof match == "string") var ok = ch == match; else var ok = ch && match.test ? match.test(ch) : match(ch); if (ok) {this.pos++; return ch;} }, eatWhile: function(match) { var start = this.pos; while (this.eat(match)); if (this.pos > start) return this.string.slice(start, this.pos); }, backUp: function(n) {this.pos -= n;}, column: function() {return this.pos;}, eatSpace: function() { var start = this.pos; while (/\s/.test(this.string.charAt(this.pos))) this.pos++; return this.pos - start; }, match: function(pattern, consume, caseInsensitive) { if (typeof pattern == "string") { function cased(str) {return caseInsensitive ? str.toLowerCase() : str;} if (cased(this.string).indexOf(cased(pattern), this.pos) == this.pos) { if (consume !== false) this.pos += str.length; return true; } } else { var match = this.string.slice(this.pos).match(pattern); if (match && consume !== false) this.pos += match[0].length; return match; } } }; JavaScript mode supports several configuration options: json which will set the mode to expect JSON data rather than a JavaScript program. jsonld which will set the mode to expect JSON-LD linked data rather than a JavaScript program (demo). typescript which will activate additional syntax highlighting and some other things for TypeScript code (demo). statementIndent which (given a number) will determine the amount of indentation to use for statements continued on a new line. wordCharacters, a regexp that indicates which characters should be considered part of an identifier. Defaults to /[\w$]/, which does not handle non-ASCII identifiers. Can be set to something more elaborate to improve Unicode support. MIME types defined: text/javascript, application/json, application/ld+json, text/typescript, application/typescript.
JSON-LD mode { "@context": { "name": "http://schema.org/name", "description": "http://schema.org/description", "image": { "@id": "http://schema.org/image", "@type": "@id" }, "geo": "http://schema.org/geo", "latitude": { "@id": "http://schema.org/latitude", "@type": "xsd:float" }, "longitude": { "@id": "http://schema.org/longitude", "@type": "xsd:float" }, "xsd": "http://www.w3.org/2001/XMLSchema#" }, "name": "The Empire State Building", "description": "The Empire State Building is a 102-story landmark in New York City.", "image": "http://www.civil.usherbrooke.ca/cours/gci215a/empire-state-building.jpg", "geo": { "latitude": "40.75", "longitude": "73.98" } } This is a specialization of the JavaScript mode.
TypeScript mode class Greeter { 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()) } document.body.appendChild(button) This is a specialization of the JavaScript mode.
Jinja2 mode {# this is a comment #} {%- for item in li -%} <li>{{ item.label }}</li> {% endfor -%} {{ item.sand == true and item.keyword == false ? 1 : 0 }} {{ app.get(55, 1.2, true) }} {% if app.get('_route') == ('_home') %}home{% endif %} {% if app.session.flashbag.has('message') %} {% for message in app.session.flashbag.get('message') %} {{ message.content }} {% endfor %} {% endif %} {{ path('_home', {'section': app.request.get('section')}) }} {{ path('_home', { 'section': app.request.get('section'), 'boolean': true, 'number': 55.33 }) }} {% include ('test.incl.html.twig') %}
Julia mode #numbers 1234 1234im .234 .234im 2.23im 2.3f3 23e2 0x234 #strings 'a' "asdf" r"regex" b"bytestring" """ multiline string """ #identifiers a as123 function_name! #unicode identifiers # a = x\ddot a⃗ = ẍ # a = v\dot a⃗ = v̇ #F\vec = m \cdotp a\vec F⃗ = m·a⃗ #literal identifier multiples 3x 4[1, 2, 3] #dicts and indexing x=[1, 2, 3] x[end-1] x={"julia"=>"language of technical computing"} #exception handling try f() catch @printf "Error" finally g() end #types immutable Color{T<:Number} r::T g::T b::T end #functions function change!(x::Vector{Float64}) for i = 1:length(x) x[i] *= 2 end end #function invocation f('b', (2, 3)...) #operators |= &= ^= \- %= *= += -= <= >= != == % * + - < > ! = | & ^ \ ? ~ : $ <: .< .> << <<= >> >>>> >>= >>>= <<= <<<= .<= .>= .== -> // in ... // := .//= .*= ./= .^= .%= .+= .-= \= \\= || === && |= .|= <: >: |> <| :: x ? y : z #macros @spawnat 2 1+1 @eval(:x) #keywords and operators if else elseif while for begin let end do try catch finally return break continue global local const export import importall using function macro module baremodule type immutable quote true false enumerate MIME types defined: text/x-julia.
Kotlin mode package org.wasabi.http import java.util.concurrent.Executors import java.net.InetSocketAddress import org.wasabi.app.AppConfiguration import io.netty.bootstrap.ServerBootstrap import io.netty.channel.nio.NioEventLoopGroup import io.netty.channel.socket.nio.NioServerSocketChannel import org.wasabi.app.AppServer public class HttpServer(private val appServer: AppServer) { val bootstrap: ServerBootstrap val primaryGroup: NioEventLoopGroup val workerGroup: NioEventLoopGroup { // Define worker groups primaryGroup = NioEventLoopGroup() workerGroup = NioEventLoopGroup() // Initialize bootstrap of server bootstrap = ServerBootstrap() bootstrap.group(primaryGroup, workerGroup) bootstrap.channel(javaClass<NioServerSocketChannel>()) bootstrap.childHandler(NettyPipelineInitializer(appServer)) } public fun start(wait: Boolean = true) { val channel = bootstrap.bind(appServer.configuration.port)?.sync()?.channel() if (wait) { channel?.closeFuture()?.sync() } } public fun stop() { // Shutdown all event loops primaryGroup.shutdownGracefully() workerGroup.shutdownGracefully() // Wait till all threads are terminated primaryGroup.terminationFuture().sync() workerGroup.terminationFuture().sync() } } Mode for Kotlin (http://kotlin.jetbrains.org/) Developed by Hadi Hariri (https://github.com/hhariri). MIME type defined: text/x-kotlin.
LiveScript mode # LiveScript mode for CodeMirror # The following script, prelude.ls, is used to # demonstrate LiveScript mode for CodeMirror. # https://github.com/gkz/prelude-ls export objToFunc = objToFunc = (obj) -> (key) -> obj[key] export each = (f, xs) --> if typeof! xs is \Object for , x of xs then f x else for x in xs then f x xs export map = (f, xs) --> f = objToFunc f if typeof! f isnt \Function type = typeof! xs if type is \Object {[key, f x] for key, x of xs} else result = [f x for x in xs] if type is \String then result * '' else result export filter = (f, xs) --> f = objToFunc f if typeof! f isnt \Function type = typeof! xs if type is \Object {[key, x] for key, x of xs when f x} else result = [x for x in xs when f x] if type is \String then result * '' else result export reject = (f, xs) --> f = objToFunc f if typeof! f isnt \Function type = typeof! xs if type is \Object {[key, x] for key, x of xs when not f x} else result = [x for x in xs when not f x] if type is \String then result * '' else result export partition = (f, xs) --> f = objToFunc f if typeof! f isnt \Function type = typeof! xs if type is \Object passed = {} failed = {} for key, x of xs (if f x then passed else failed)[key] = x else passed = [] failed = [] for x in xs (if f x then passed else failed)push x if type is \String passed *= '' failed *= '' [passed, failed] export find = (f, xs) --> f = objToFunc f if typeof! f isnt \Function if typeof! xs is \Object for , x of xs when f x then return x else for x in xs when f x then return x void export head = export first = (xs) -> return void if not xs.length xs.0 export tail = (xs) -> return void if not xs.length xs.slice 1 export last = (xs) -> return void if not xs.length xs[*-1] export initial = (xs) -> return void if not xs.length xs.slice 0 xs.length - 1 export empty = (xs) -> if typeof! xs is \Object for x of xs then return false return yes not xs.length export values = (obj) -> [x for , x of obj] export keys = (obj) -> [x for x of obj] export len = (xs) -> xs = values xs if typeof! xs is \Object xs.length export cons = (x, xs) --> if typeof! xs is \String then x + xs else [x] ++ xs export append = (xs, ys) --> if typeof! ys is \String then xs + ys else xs ++ ys export join = (sep, xs) --> xs = values xs if typeof! xs is \Object xs.join sep export reverse = (xs) -> if typeof! xs is \String then (xs / '')reverse! * '' else xs.slice!reverse! export fold = export foldl = (f, memo, xs) --> if typeof! xs is \Object for , x of xs then memo = f memo, x else for x in xs then memo = f memo, x memo export fold1 = export foldl1 = (f, xs) --> fold f, xs.0, xs.slice 1 export foldr = (f, memo, xs) --> fold f, memo, xs.slice!reverse! export foldr1 = (f, xs) --> xs.=slice!reverse! fold f, xs.0, xs.slice 1 export unfoldr = export unfold = (f, b) --> if (f b)? [that.0] ++ unfoldr f, that.1 else [] export andList = (xs) -> for x in xs when not x return false true export orList = (xs) -> for x in xs when x return true false export any = (f, xs) --> f = objToFunc f if typeof! f isnt \Function for x in xs when f x return yes no export all = (f, xs) --> f = objToFunc f if typeof! f isnt \Function for x in xs when not f x return no yes export unique = (xs) -> result = [] if typeof! xs is \Object for , x of xs when x not in result then result.push x else for x in xs when x not in result then result.push x if typeof! xs is \String then result * '' else result export sort = (xs) -> xs.concat!sort (x, y) -> | x > y => 1 | x < y => -1 | _ => 0 export sortBy = (f, xs) --> return [] unless xs.length xs.concat!sort f export compare = (f, x, y) --> | (f x) > (f y) => 1 | (f x) < (f y) => -1 | otherwise => 0 export sum = (xs) -> result = 0 if typeof! xs is \Object for , x of xs then result += x else for x in xs then result += x result export product = (xs) -> result = 1 if typeof! xs is \Object for , x of xs then result *= x else for x in xs then result *= x result export mean = export average = (xs) -> (sum xs) / len xs export concat = (xss) -> fold append, [], xss export concatMap = (f, xs) --> fold ((memo, x) -> append memo, f x), [], xs export listToObj = (xs) -> {[x.0, x.1] for x in xs} export maximum = (xs) -> fold1 (>?), xs export minimum = (xs) -> fold1 (<?), xs export scan = export scanl = (f, memo, xs) --> last = memo if typeof! xs is \Object then [memo] ++ [last = f last, x for , x of xs] else [memo] ++ [last = f last, x for x in xs] export scan1 = export scanl1 = (f, xs) --> scan f, xs.0, xs.slice 1 export scanr = (f, memo, xs) --> xs.=slice!reverse! scan f, memo, xs .reverse! export scanr1 = (f, xs) --> xs.=slice!reverse! scan f, xs.0, xs.slice 1 .reverse! export replicate = (n, x) --> result = [] i = 0 while i < n, ++i then result.push x result export take = (n, xs) --> | n <= 0 if typeof! xs is \String then '' else [] | not xs.length => xs | otherwise => xs.slice 0, n export drop = (n, xs) --> | n <= 0 => xs | not xs.length => xs | otherwise => xs.slice n export splitAt = (n, xs) --> [(take n, xs), (drop n, xs)] export takeWhile = (p, xs) --> return xs if not xs.length p = objToFunc p if typeof! p isnt \Function result = [] for x in xs break if not p x result.push x if typeof! xs is \String then result * '' else result export dropWhile = (p, xs) --> return xs if not xs.length p = objToFunc p if typeof! p isnt \Function i = 0 for x in xs break if not p x ++i drop i, xs export span = (p, xs) --> [(takeWhile p, xs), (dropWhile p, xs)] export breakIt = (p, xs) --> span (not) << p, xs export zip = (xs, ys) --> result = [] for zs, i in [xs, ys] for z, j in zs result.push [] if i is 0 result[j]?push z result export zipWith = (f,xs, ys) --> f = objToFunc f if typeof! f isnt \Function if not xs.length or not ys.length [] else [f.apply this, zs for zs in zip.call this, xs, ys] export zipAll = (...xss) -> result = [] for xs, i in xss for x, j in xs result.push [] if i is 0 result[j]?push x result export zipAllWith = (f, ...xss) -> f = objToFunc f if typeof! f isnt \Function if not xss.0.length or not xss.1.length [] else [f.apply this, xs for xs in zipAll.apply this, xss] export compose = (...funcs) -> -> args = arguments for f in funcs args = [f.apply this, args] args.0 export curry = (f) -> curry$ f # using util method curry$ from livescript export id = (x) -> x export flip = (f, x, y) --> f y, x export fix = (f) -> ( (g, x) -> -> f(g g) ...arguments ) do (g, x) -> -> f(g g) ...arguments export lines = (str) -> return [] if not str.length str / \\n export unlines = (strs) -> strs * \\n export words = (str) -> return [] if not str.length str / /[ ]+/ export unwords = (strs) -> strs * ' ' export max = (>?) export min = (<?) export negate = (x) -> -x export abs = Math.abs export signum = (x) -> | x < 0 => -1 | x > 0 => 1 | otherwise => 0 export quot = (x, y) --> ~~(x / y) export rem = (%) export div = (x, y) --> Math.floor x / y export mod = (%%) export recip = (1 /) export pi = Math.PI export tau = pi * 2 export exp = Math.exp export sqrt = Math.sqrt # changed from log as log is a # common function for logging things export ln = Math.log export pow = (^) export sin = Math.sin export tan = Math.tan export cos = Math.cos export asin = Math.asin export acos = Math.acos export atan = Math.atan export atan2 = (x, y) --> Math.atan2 x, y # sinh # tanh # cosh # asinh # atanh # acosh export truncate = (x) -> ~~x export round = Math.round export ceiling = Math.ceil export floor = Math.floor export isItNaN = (x) -> x isnt x export even = (x) -> x % 2 == 0 export odd = (x) -> x % 2 != 0 export gcd = (x, y) --> x = Math.abs x y = Math.abs y until y is 0 z = x % y x = y y = z x export lcm = (x, y) --> Math.abs Math.floor (x / (gcd x, y) * y) # meta export installPrelude = !(target) -> unless target.prelude?isInstalled target <<< out$ # using out$ generated by livescript target <<< target.prelude.isInstalled = true export prelude = out$ MIME types defined: text/x-livescript. The LiveScript mode was written by Kenneth Bentley.
Lua mode --[[ example useless code to show lua syntax highlighting this is multiline comment ]] function blahblahblah(x) local table = { "asd" = 123, "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.. y=[=[ x=[[ x is a multi line string ]] but its definition is iside a highest level string! ]=] print(" \"\" ") s = math.sin( x ) end end Loosely based on Franciszek Wawrzak's CodeMirror 1 mode. One configuration parameter is supported, specials, to which you can provide an array of strings to have those identifiers highlighted with the lua-special style. MIME types defined: text/x-lua.
Markdown mode Markdown: Basics ================ <ul id="ProjectSubmenu"> <li><a href="/projects/markdown/" title="Markdown Project Page">Main</a></li> <li><a class="selected" title="Markdown Basics">Basics</a></li> <li><a href="/projects/markdown/syntax" title="Markdown Syntax Documentation">Syntax</a></li> <li><a href="/projects/markdown/license" title="Pricing and License Information">License</a></li> <li><a href="/projects/markdown/dingus" title="Online Markdown Web Form">Dingus</a></li> </ul> Getting the Gist of Markdown's Formatting Syntax ------------------------------------------------ This page offers a brief overview of what it's like to use Markdown. The [syntax page] [s] provides complete, detailed documentation for every feature, but Markdown should be very easy to pick up simply by looking at a few examples of it in action. The examples on this page are written in a before/after style, showing example syntax and the HTML output produced by Markdown. It's also helpful to simply try Markdown out; the [Dingus] [d] is a web application that allows you type your own Markdown-formatted text and translate it to XHTML. **Note:** This document is itself written using Markdown; you can [see the source for it by adding '.text' to the URL] [src]. [s]: /projects/markdown/syntax "Markdown Syntax" [d]: /projects/markdown/dingus "Markdown Dingus" [src]: /projects/markdown/basics.text ## Paragraphs, Headers, Blockquotes ## A paragraph is simply one or more consecutive lines of text, separated by one or more blank lines. (A blank line is any line that looks like a blank line -- a line containing nothing but spaces or tabs is considered blank.) Normal paragraphs should not be indented with spaces or tabs. Markdown offers two styles of headers: *Setext* and *atx*. Setext-style headers for `<h1>` and `<h2>` are created by "underlining" with equal signs (`=`) and hyphens (`-`), respectively. To create an atx-style header, you put 1-6 hash marks (`#`) at the beginning of the line -- the number of hashes equals the resulting HTML header level. Blockquotes are indicated using email-style '`>`' 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 > This is a blockquote. > > This is the second paragraph in the blockquote. > > ## This is an H2 in a blockquote Output: <h1>A First Level Header</h1> <h2>A Second Level Header</h2> <p>Now is the time for all good men to come to the aid of their country. This is just a regular paragraph.</p> <p>The quick brown fox jumped over the lazy dog's back.</p> <h3>Header 3</h3> <blockquote> <p>This is a blockquote.</p> <p>This is the second paragraph in the blockquote.</p> <h2>This is an H2 in a blockquote</h2> </blockquote> ### Phrase Emphasis ### 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: <p>Some of these words <em>are emphasized</em>. Some of these words <em>are emphasized also</em>.</p> <p>Use two asterisks for <strong>strong emphasis</strong>. Or, if you prefer, <strong>use two underscores instead</strong>.</p> ## Lists ## Unordered (bulleted) lists use asterisks, pluses, and hyphens (`*`, `+`, and `-`) as list markers. These three markers are interchangable; this: * Candy. * Gum. * Booze. this: + Candy. + Gum. + Booze. and this: - Candy. - Gum. - Booze. all produce the same output: <ul> <li>Candy.</li> <li>Gum.</li> <li>Booze.</li> </ul> Ordered (numbered) lists use regular numbers, followed by periods, as list markers: 1. Red 2. Green 3. Blue Output: <ol> <li>Red</li> <li>Green</li> <li>Blue</li> </ol> If you put blank lines between items, you'll get `<p>` 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: <ul> <li><p>A list item.</p> <p>With multiple paragraphs.</p></li> <li><p>Another item in the list.</p></li> </ul> ### Links ### Markdown supports two styles for creating links: *inline* and *reference*. With both styles, you use square brackets to delimit the text you want to turn into a link. Inline-style links use parentheses immediately after the link text. For example: This is an [example link](http://example.com/). Output: <p>This is an <a href="http://example.com/"> example link</a>.</p> Optionally, you may include a title attribute in the parentheses: This is an [example link](http://example.com/ "With a Title"). Output: <p>This is an <a href="http://example.com/" title="With a Title"> example link</a>.</p> Reference-style links allow you to refer to your links by names, which you define elsewhere in your document: I get 10 times more traffic from [Google][1] than from [Yahoo][2] or [MSN][3]. [1]: http://google.com/ "Google" [2]: http://search.yahoo.com/ "Yahoo Search" [3]: http://search.msn.com/ "MSN Search" Output: <p>I get 10 times more traffic from <a href="http://google.com/" title="Google">Google</a> than from <a href="http://search.yahoo.com/" title="Yahoo Search">Yahoo</a> or <a href="http://search.msn.com/" title="MSN Search">MSN</a>.</p> The title attribute is optional. Link names may contain letters, numbers and spaces, but are *not* case sensitive: I start my morning with a cup of coffee and [The New York Times][NY Times]. [ny times]: http://www.nytimes.com/ Output: <p>I start my morning with a cup of coffee and <a href="http://www.nytimes.com/">The New York Times</a>.</p> ### Images ### Image syntax is very much like link syntax. Inline (titles are optional):  Reference-style: ![alt text][id] [id]: /path/to/img.jpg "Title" Both of the above examples produce the same output: <img src="/path/to/img.jpg" alt="alt text" title="Title" /> ### Code ### In a regular paragraph, you can create code span by wrapping text in backtick quotes. Any ampersands (`&`) and angle brackets (`<` or `>`) will automatically be translated into HTML entities. This makes it easy to use Markdown to write about HTML example code: I strongly recommend against using any `<blink>` tags. I wish SmartyPants used named entities like `—` instead of decimal-encoded entites like `—`. Output: <p>I strongly recommend against using any <code><blink></code> tags.</p> <p>I wish SmartyPants used named entities like <code>&mdash;</code> instead of decimal-encoded entites like <code>&#8212;</code>.</p> To specify an entire block of pre-formatted code, indent every line of the block by 4 spaces or 1 tab. Just like with code spans, `&`, `<`, and `>` characters will be escaped automatically. Markdown: If you want your page to validate under XHTML 1.0 Strict, you've got to put paragraph tags in your blockquotes: <blockquote> <p>For example.</p> </blockquote> Output: <p>If you want your page to validate under XHTML 1.0 Strict, you've got to put paragraph tags in your blockquotes:</p> <pre><code><blockquote> <p>For example.</p> </blockquote> </code></pre> Optionally depends on the XML mode for properly highlighted inline XML blocks. MIME types defined: text/x-markdown. Parsing/Highlighting Tests: normal, verbose.
mIRC mode ;AKA Nick Tracker by Ford_Lawnmower irc.GeekShed.net #Script-Help ;*****************************************************************************; ;**Start Setup ;Change JoinDisplay, below, for On Join AKA Display. On = 1 - Off = 0 alias -l JoinDisplay { return 1 } ;Change MaxNicks, below, to the number of nicknames you want to store for each hostmask. I wouldn't go over 400 with this ;/ alias -l MaxNicks { return 20 } ;Change AKALogo, below, To the text you want displayed before each AKA result. alias -l AKALogo { return 06 05A06K07A 06 } ;**End Setup ;*****************************************************************************; On *:Join:#: { if ($nick == $me) { .timer 1 1 ialupdateCheck $chan } NickNamesAdd $nick $+($network,$wildsite) if ($JoinDisplay) { .timerNickNames $+ $nick 1 2 NickNames.display $nick $chan $network $wildsite } } on *:Nick: { NickNamesAdd $newnick $+($network,$wildsite) $nick } alias -l NickNames.display { if ($gettok($hget(NickNames,$+($3,$4)),0,126) > 1) { echo -g $2 $AKALogo $+(09,$1) $AKALogo 07 $mid($replace($hget(NickNames,$+($3,$4)),$chr(126),$chr(44)),2,-1) } } alias -l NickNamesAdd { if ($hget(NickNames,$2)) { if (!$regex($hget(NickNames,$2),/~\Q $+ $replacecs($1,\E,\E\\E\Q) $+ \E~/i)) { if ($gettok($hget(NickNames,$2),0,126) <= $MaxNicks) { hadd NickNames $2 $+($hget(NickNames,$2),$1,~) } else { hadd NickNames $2 $+($mid($hget(NickNames,$2),$pos($hget(NickNames,$2),~,2)),$1,~) } } } else { hadd -m NickNames $2 $+(~,$1,~,$iif($3,$+($3,~))) } } alias -l Fix.All.MindUser { var %Fix.Count = $hfind(NickNames,/[^~]+[0-9]{4}~/,0,r).data while (%Fix.Count) { if ($Fix.MindUser($hget(NickNames,$hfind(NickNames,/[^~]+[0-9]{4}~/,%Fix.Count,r).data))) { echo -ag Record %Fix.Count - $v1 - Was Cleaned hadd NickNames $hfind(NickNames,/[^~]+[0-9]{4}~/,%Fix.Count,r).data $v1 } dec %Fix.Count } } alias -l Fix.MindUser { return $regsubex($1,/[^~]+[0-9]{4}~/g,$null) } menu nicklist,query { - .AKA ..Check $$1: { if ($gettok($hget(NickNames,$+($network,$address($1,2))),0,126) > 1) { NickNames.display $1 $active $network $address($1,2) } else { echo -ag $AKALogo $+(09,$1) 07has not been known by any other nicknames while I have been watching. } } ..Cleanup $$1:hadd NickNames $+($network,$address($1,2)) $fix.minduser($hget(NickNames,$+($network,$address($1,2)))) ..Clear $$1:hadd NickNames $+($network,$address($1,2)) $+(~,$1,~) ..AKA Search Dialog:dialog $iif($dialog(AKA_Search),-v,-m) AKA_Search AKA_Search - } menu status,channel { - .AKA ..AKA Search Dialog:dialog $iif($dialog(AKA_Search),-v,-m) AKA_Search AKA_Search ..Clean All Records:Fix.All.Minduser - } dialog AKA_Search { title "AKA Search Engine" size -1 -1 206 221 option dbu edit "", 1, 8 5 149 10, autohs button "Search", 2, 163 4 32 12 radio "Search HostMask", 4, 61 22 55 10 radio "Search Nicknames", 5, 123 22 56 10 list 6, 8 38 190 169, sort extsel vsbar button "Check Selected", 7, 67 206 40 12 button "Close", 8, 160 206 38 12, cancel box "Search Type", 3, 11 17 183 18 button "Copy to Clipboard", 9, 111 206 46 12 } On *:Dialog:Aka_Search:init:*: { did -c $dname 5 } On *:Dialog:Aka_Search:Sclick:2,7,9: { if ($did == 2) && ($did($dname,1)) { did -r $dname 6 var %search $+(*,$v1,*), %type $iif($did($dname,5).state,data,item), %matches = $hfind(NickNames,%search,0,w). [ $+ [ %type ] ] while (%matches) { did -a $dname 6 $hfind(NickNames,%search,%matches,w). [ $+ [ %type ] ] dec %matches } did -c $dname 6 1 } elseif ($did == 7) && ($did($dname,6).seltext) { echo -ga $AKALogo 07 $mid($replace($hget(NickNames,$v1),$chr(126),$chr(44)),2,-1) } elseif ($did == 9) && ($did($dname,6).seltext) { clipboard $mid($v1,$pos($v1,*,1)) } } On *:Start:{ if (!$hget(NickNames)) { hmake NickNames 10 } if ($isfile(NickNames.hsh)) { hload NickNames NickNames.hsh } } On *:Exit: { if ($hget(NickNames)) { hsave NickNames NickNames.hsh } } On *:Disconnect: { if ($hget(NickNames)) { hsave NickNames NickNames.hsh } } On *:Unload: { hfree NickNames } alias -l ialupdateCheck { inc -z $+(%,ialupdateCheck,$network) $calc($nick($1,0) / 4) ;If your ial is already being updated on join .who $1 out. ;If you are using /names to update ial you will still need this line. .who $1 } Raw 352:*: { if ($($+(%,ialupdateCheck,$network),2)) haltdef NickNamesAdd $6 $+($network,$address($6,2)) } Raw 315:*: { if ($($+(%,ialupdateCheck,$network),2)) haltdef } MIME types defined: text/mirc.
OCaml mode (* Summing a list of integers *) let rec sum xs = match xs with | [] -> 0 | x :: xs' -> x + sum xs' (* Quicksort *) let rec qsort = function | [] -> [] | pivot :: rest -> let is_less x = x < pivot in let left, right = List.partition is_less rest in qsort left @ [pivot] @ qsort right (* Fibonacci Sequence *) let rec fib_aux n a b = match n with | 0 -> a | _ -> fib_aux (n - 1) (a + b) a let fib n = fib_aux n 0 1 (* Birthday paradox *) let year_size = 365. let rec birthday_paradox prob people = let prob' = (year_size -. float people) /. year_size *. prob in if prob' < 0.5 then Printf.printf "answer = %d\n" (people+1) else birthday_paradox prob' (people+1) ;; birthday_paradox 1.0 1 (* Church numerals *) let zero f x = x let succ n f x = f (n f x) let one = succ zero let two = succ (succ zero) let add n1 n2 f x = n1 f (n2 f x) let to_string n = n (fun k -> "S" ^ k) "0" let _ = to_string (add (succ two) two) (* Elementary functions *) let square x = x * x;; let rec fact x = if x <= 1 then 1 else x * fact (x - 1);; (* Automatic memory management *) let l = 1 :: 2 :: 3 :: [];; [1; 2; 3];; 5 :: l;; (* Polymorphism: sorting lists *) let rec sort = function | [] -> [] | x :: l -> insert x (sort l) and insert elem = function | [] -> [elem] | x :: l -> if elem < 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 let result = Array.create (max n1 n2) 0 in for i = 0 to n1 - 1 do result.(i) <- p1.(i) done; for i = 0 to n2 - 1 do result.(i) <- result.(i) + p2.(i) done; result;; add_polynom [| 1; 2 |] [| 1; 2; 3 |];; (* We may redefine fact using a reference cell and a for loop *) let fact n = let result = ref 1 in for i = 2 to n do result := i * !result done; !result;; fact 5;; (* Triangle (graphics) *) let () = ignore( Glut.init Sys.argv ); Glut.initDisplayMode ~double_buffer:true (); ignore (Glut.createWindow ~title:"OpenGL Demo"); let angle t = 10. *. t *. t in let render () = GlClear.clear [ `color ]; GlMat.load_identity (); GlMat.rotate ~angle: (angle (Sys.time ())) ~z:1. (); GlDraw.begins `triangles; List.iter GlDraw.vertex2 [-1., -1.; 0., 1.; 1., -1.]; GlDraw.ends (); Glut.swapBuffers () in GlMat.mode `modelview; Glut.displayFunc ~cb:render; Glut.idleFunc ~cb:(Some Glut.postRedisplay); Glut.mainLoop () (* A Hundred Lines of Caml - http://caml.inria.fr/about/taste.en.html *) (* OCaml page on Wikipedia - http://en.wikipedia.org/wiki/OCaml *) F# mode module CodeMirror.FSharp let rec fib = function | 0 -> 0 | 1 -> 1 | n -> fib (n - 1) + fib (n - 2) type Point = { x : int y : int } type Color = | Red | Green | Blue [0 .. 10] |> List.map ((+) 2) |> List.fold (fun x y -> x + y) 0 |> printf "%i" MIME types defined: text/x-ocaml (OCaml) and text/x-fsharp (F#).
Modelica mode model BouncingBall parameter Real e = 0.7; parameter Real g = 9.81; Real h(start=1); Real v; Boolean flying(start=true); Boolean impact; Real v_new; equation impact = h <= 0.0; der(v) = if flying then -g else 0; der(h) = v; when {h <= 0.0 and v <= 0.0, impact} then v_new = if edge(impact) then -e*pre(v) else 0; flying = v_new > 0; reinit(v, v_new); end when; annotation (uses(Modelica(version="3.2"))); end BouncingBall; Simple mode that tries to handle Modelica as well as it can. MIME types defined: text/x-modelica (Modlica code).
NGINX mode server { listen 173.255.219.235:80; server_name website.com.au; rewrite / $scheme://www.$host$request_uri permanent; ## Forcibly prepend a www } server { listen 173.255.219.235:443; server_name website.com.au; rewrite / $scheme://www.$host$request_uri permanent; ## Forcibly prepend a www } server { listen 173.255.219.235:80; server_name www.website.com.au; root /data/www; index index.html index.php; location / { index index.html index.php; ## Allow a static html file to be shown first try_files $uri $uri/ @handler; ## If missing pass the URI to Magento's front handler expires 30d; ## Assume all files are cachable } ## These locations would be hidden by .htaccess normally location /app/ { deny all; } location /includes/ { deny all; } location /lib/ { deny all; } location /media/downloadable/ { deny all; } location /pkginfo/ { deny all; } location /report/config.xml { deny all; } location /var/ { deny all; } location /var/export/ { ## Allow admins only to view export folder auth_basic "Restricted"; ## Message shown in login window auth_basic_user_file /rs/passwords/testfile; ## See /etc/nginx/htpassword autoindex on; } location /. { ## Disable .htaccess and other hidden files return 404; } location @handler { ## Magento uses a common front handler rewrite / /index.php; } location ~ .php/ { ## Forward paths like /js/index.php/x.js to relevant handler rewrite ^/(.*.php)/ /$1 last; } location ~ \.php$ { if (!-e $request_filename) { rewrite / /index.php last; } ## Catch 404s that try_files miss fastcgi_pass 127.0.0.1:9000; fastcgi_index index.php; fastcgi_param PATH_INFO $fastcgi_script_name; fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name; include /rs/confs/nginx/fastcgi_params; } } server { listen 173.255.219.235:443; server_name website.com.au www.website.com.au; root /data/www; index index.html index.php; ssl on; ssl_certificate /rs/ssl/ssl.crt; ssl_certificate_key /rs/ssl/ssl.key; ssl_session_timeout 5m; ssl_protocols SSLv2 SSLv3 TLSv1; ssl_ciphers ALL:!ADH:!EXPORT56:RC4+RSA:+HIGH:+MEDIUM:+LOW:+SSLv2:+EXP; ssl_prefer_server_ciphers on; location / { index index.html index.php; ## Allow a static html file to be shown first try_files $uri $uri/ @handler; ## If missing pass the URI to Magento's front handler expires 30d; ## Assume all files are cachable } ## These locations would be hidden by .htaccess normally location /app/ { deny all; } location /includes/ { deny all; } location /lib/ { deny all; } location /media/downloadable/ { deny all; } location /pkginfo/ { deny all; } location /report/config.xml { deny all; } location /var/ { deny all; } location /var/export/ { ## Allow admins only to view export folder auth_basic "Restricted"; ## Message shown in login window auth_basic_user_file htpasswd; ## See /etc/nginx/htpassword autoindex on; } location /. { ## Disable .htaccess and other hidden files return 404; } location @handler { ## Magento uses a common front handler rewrite / /index.php; } location ~ .php/ { ## Forward paths like /js/index.php/x.js to relevant handler rewrite ^/(.*.php)/ /$1 last; } location ~ .php$ { ## Execute PHP scripts if (!-e $request_filename) { rewrite /index.php last; } ## Catch 404s that try_files miss fastcgi_pass 127.0.0.1:9000; fastcgi_index index.php; fastcgi_param PATH_INFO $fastcgi_script_name; fastcgi_param SCRIPT_FILENAME $document_root$fastcgi_script_name; include /rs/confs/nginx/fastcgi_params; fastcgi_param HTTPS on; } } MIME types defined: text/nginx.
NTriples mode <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> . MIME types defined: text/n-triples.
Octave mode %numbers [1234 1234i 1234j] [.234 .234j 2.23i] [23e2 12E1j 123D-4 0x234] %strings 'asda''a' "asda""a" %identifiers a + as123 - __asd__ %operators - + = == > < >= <= & ~ ... break zeros default margin round ones rand ceil floor size clear zeros eye mean std cov error eval function abs acos atan asin cos cosh exp log prod sum log10 max min sign sin sinh sqrt tan reshape return case switch else elseif end if otherwise do for while try catch classdef properties events methods global persistent %one line comment %{ multi line commment %} MIME types defined: text/x-octave.
Pascal mode (* Example Pascal code *) while a <> b do writeln('Waiting'); if a > b then writeln('Condition met') else writeln('Condition not met'); for i := 1 to 10 do writeln('Iteration: ', i:1); repeat a := a + 1 until a = 10; case i of 0: write('zero'); 1: write('one'); 2: write('two') end; MIME types defined: text/x-pascal.
PEG.js Mode /* * Classic example grammar, which recognizes simple arithmetic expressions like * "2*(3+4)". The parser generated from this grammar then computes their value. */ start = additive additive = left:multiplicative "+" right:additive { return left + right; } / multiplicative multiplicative = left:primary "*" right:multiplicative { return left * right; } / primary primary = integer / "(" additive:additive ")" { return additive; } integer "integer" = digits:[0-9]+ { return parseInt(digits.join(""), 10); } letter = [a-z]+ The PEG.js Mode Created by Forbes Lindesay.
Perl mode #!/usr/bin/perl use Something qw(func1 func2); # strings my $s1 = qq'single line'; our $s2 = q(multi- line); =item Something 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; } 1; # numbers and comments __END__ something... MIME types defined: text/x-perl.
PHP mode <?php $a = array('a' => 1, 'b' => 2, 3 => 'c'); echo "$a[a] ${a[3] /* } comment */} {$a[b]} \$a[a]"; function hello($who) { return "Hello $who!"; } ?> <p>The program says <?= hello("World") ?>.</p> <script> alert("And here is some JS code"); // also colored </script> Simple HTML/PHP mode based on the C-like mode. Depends on XML, JavaScript, CSS, HTMLMixed, and C-like modes. MIME types defined: application/x-httpd-php (HTML with PHP code), text/x-php (plain, non-wrapped PHP code).
Pig Latin mode -- 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"; -- Simple mode that handles Pig Latin language. MIME type defined: text/x-pig (PIG code)
