diff options
Diffstat (limited to 'plugins/LocalFilesEditor/codemirror/mode/stex')
3 files changed, 283 insertions, 0 deletions
diff --git a/plugins/LocalFilesEditor/codemirror/mode/stex/index.html b/plugins/LocalFilesEditor/codemirror/mode/stex/index.html new file mode 100644 index 000000000..73b07ac13 --- /dev/null +++ b/plugins/LocalFilesEditor/codemirror/mode/stex/index.html @@ -0,0 +1,96 @@ +<!doctype html> +<html> + <head> + <title>CodeMirror 2: sTeX mode</title> + <link rel="stylesheet" href="../../lib/codemirror.css"> + <script src="../../lib/codemirror.js"></script> + <script src="stex.js"></script> + <link rel="stylesheet" href="stex.css"> + <style>.CodeMirror {background: #f8f8f8;}</style> + <link rel="stylesheet" href="../../css/docs.css"> + </head> + <body> + <h1>CodeMirror 2: sTeX mode</h1> + <form><textarea id="code" name="code"> +\begin{module}[id=bbt-size] +\importmodule[balanced-binary-trees]{balanced-binary-trees} +\importmodule[\KWARCslides{dmath/en/cardinality}]{cardinality} + +\begin{frame} + \frametitle{Size Lemma for Balanced Trees} + \begin{itemize} + \item + \begin{assertion}[id=size-lemma,type=lemma] + Let $G=\tup{V,E}$ be a \termref[cd=binary-trees]{balanced binary tree} + of \termref[cd=graph-depth,name=vertex-depth]{depth}$n>i$, then the set + $\defeq{\livar{V}i}{\setst{\inset{v}{V}}{\gdepth{v} = i}}$ of + \termref[cd=graphs-intro,name=node]{nodes} at + \termref[cd=graph-depth,name=vertex-depth]{depth} $i$ has + \termref[cd=cardinality,name=cardinality]{cardinality} $\power2i$. + \end{assertion} + \item + \begin{sproof}[id=size-lemma-pf,proofend=,for=size-lemma]{via induction over the depth $i$.} + \begin{spfcases}{We have to consider two cases} + \begin{spfcase}{$i=0$} + \begin{spfstep}[display=flow] + then $\livar{V}i=\set{\livar{v}r}$, where $\livar{v}r$ is the root, so + $\eq{\card{\livar{V}0},\card{\set{\livar{v}r}},1,\power20}$. + \end{spfstep} + \end{spfcase} + \begin{spfcase}{$i>0$} + \begin{spfstep}[display=flow] + then $\livar{V}{i-1}$ contains $\power2{i-1}$ vertexes + \begin{justification}[method=byIH](IH)\end{justification} + \end{spfstep} + \begin{spfstep} + By the \begin{justification}[method=byDef]definition of a binary + tree\end{justification}, each $\inset{v}{\livar{V}{i-1}}$ is a leaf or has + two children that are at depth $i$. + \end{spfstep} + \begin{spfstep} + As $G$ is \termref[cd=balanced-binary-trees,name=balanced-binary-tree]{balanced} and $\gdepth{G}=n>i$, $\livar{V}{i-1}$ cannot contain + leaves. + \end{spfstep} + \begin{spfstep}[type=conclusion] + Thus $\eq{\card{\livar{V}i},{\atimes[cdot]{2,\card{\livar{V}{i-1}}}},{\atimes[cdot]{2,\power2{i-1}}},\power2i}$. + \end{spfstep} + \end{spfcase} + \end{spfcases} + \end{sproof} + \item + \begin{assertion}[id=fbbt,type=corollary] + A fully balanced tree of depth $d$ has $\power2{d+1}-1$ nodes. + \end{assertion} + \item + \begin{sproof}[for=fbbt,id=fbbt-pf]{} + \begin{spfstep} + Let $\defeq{G}{\tup{V,E}}$ be a fully balanced tree + \end{spfstep} + \begin{spfstep} + Then $\card{V}=\Sumfromto{i}1d{\power2i}= \power2{d+1}-1$. + \end{spfstep} + \end{sproof} + \end{itemize} + \end{frame} +\begin{note} + \begin{omtext}[type=conclusion,for=binary-tree] + This shows that balanced binary trees grow in breadth very quickly, a consequence of + this is that they are very shallow (and this compute very fast), which is the essence of + the next result. + \end{omtext} +\end{note} +\end{module} + +%%% Local Variables: +%%% mode: LaTeX +%%% TeX-master: "all" +%%% End: \end{document} +</textarea></form> + <script> + var editor = CodeMirror.fromTextArea(document.getElementById("code"), {}); + </script> + + <p><strong>MIME types defined:</strong> <code>text/stex</code>.</p> + + </body> +</html> diff --git a/plugins/LocalFilesEditor/codemirror/mode/stex/stex.css b/plugins/LocalFilesEditor/codemirror/mode/stex/stex.css new file mode 100644 index 000000000..64b975e98 --- /dev/null +++ b/plugins/LocalFilesEditor/codemirror/mode/stex/stex.css @@ -0,0 +1,20 @@ +span.css-at {color: #708;} +span.css-unit {color: #281;} +span.css-value {color: #708;} +span.css-identifier {color: black;} +span.css-selector {color: #11B;} +span.css-important {color: #00F;} +span.css-colorcode {color: #299;} +span.css-comment {color: #A70;} +span.css-string {color: #A22;} + +span.stex-unit { color: #281; } +span.stex-identifier { color: black; } +span.stex-slash { color: #FAA; } +span.stex-command { color: #00F; } +span.stex-comment { color: #A70; } +span.stex-import { color: #00F; } +span.stex-filepath { color: #852626; } +span.stex-module { color: #852626; } +span.stex-error { text-decoration: underline; color: red; } +span.stex-string { color: #A22; } diff --git a/plugins/LocalFilesEditor/codemirror/mode/stex/stex.js b/plugins/LocalFilesEditor/codemirror/mode/stex/stex.js new file mode 100644 index 000000000..10e0d6cad --- /dev/null +++ b/plugins/LocalFilesEditor/codemirror/mode/stex/stex.js @@ -0,0 +1,167 @@ +/* + * Author: Constantin Jucovschi (c.jucovschi@jacobs-university.de) + * Licence: MIT + */ + +CodeMirror.defineMode("stex", function(cmCfg, modeCfg) +{ + function pushCommand(state, command) { + state.cmdState.push(command); + } + + function peekCommand(state) { + if (state.cmdState.length>0) + return state.cmdState[state.cmdState.length-1]; + else + return null; + } + + function popCommand(state) { + if (state.cmdState.length>0) { + var plug = state.cmdState.pop(); + plug.closeBracket(); + } + } + + function applyMostPowerful(state) { + context = state.cmdState; + for (var i = context.length - 1; i >= 0; i--) { + var plug = context[i]; + if (plug.name=="DEFAULT") + continue; + return plug.styleIdentifier(); + } + return "stex-identifier"; + } + + function addPluginPattern(pluginName, cmdStyle, brackets, styles) { + return function () { + this.name=pluginName; + this.bracketNo = 0; + this.style=cmdStyle; + this.styles = styles; + this.brackets = brackets; + + this.styleIdentifier = function(content) { + if (this.bracketNo<=this.styles.length) + return this.styles[this.bracketNo-1]; + else + return null; + }; + this.openBracket = function(content) { + this.bracketNo++; + return "stex-bracket"; + }; + this.closeBracket = function(content) { + }; + } + } + + var plugins = new Array(); + + plugins["importmodule"] = addPluginPattern("importmodule", "stex-command", "{[", ["stex-filepath", "stex-module"]); + plugins["documentclass"] = addPluginPattern("documentclass", "stex-command", "{[", ["", "stex-unit"]); + plugins["usepackage"] = addPluginPattern("documentclass", "stex-command", "[", ["stex-unit"]); + plugins["begin"] = addPluginPattern("documentclass", "stex-command", "[", ["stex-unit"]); + plugins["end"] = addPluginPattern("documentclass", "stex-command", "[", ["stex-unit"]); + + plugins["DEFAULT"] = function () { + this.name="DEFAULT"; + this.style="stex-command"; + + this.styleIdentifier = function(content) { + }; + this.openBracket = function(content) { + }; + this.closeBracket = function(content) { + }; + }; + + function setState(state, f) { + state.f = f; + } + + function normal(source, state) { + if (source.match(/^\\[a-z]+/)) { + cmdName = source.current(); + cmdName = cmdName.substr(1, cmdName.length-1); + var plug = plugins[cmdName]; + if (typeof(plug) == 'undefined') { + plug = plugins["DEFAULT"]; + } + plug = new plug(); + pushCommand(state, plug); + setState(state, beginParams); + return plug.style; + } + + var ch = source.next(); + if (ch == "%") { + setState(state, inCComment); + return "stex-comment"; + } + else if (ch=='}' || ch==']') { + plug = peekCommand(state); + if (plug) { + plug.closeBracket(ch); + setState(state, beginParams); + } else + return "stex-error"; + return "stex-bracket"; + } else if (ch=='{' || ch=='[') { + plug = plugins["DEFAULT"]; + plug = new plug(); + pushCommand(state, plug); + return "stex-bracket"; + } + else if (/\d/.test(ch)) { + source.eatWhile(/[\w.%]/); + return "stex-unit"; + } + else { + source.eatWhile(/[\w-_]/); + return applyMostPowerful(state); + } + } + + function inCComment(source, state) { + source.skipToEnd(); + setState(state, normal); + return "css-comment"; + } + + function beginParams(source, state) { + var ch = source.peek(); + if (ch == '{' || ch == '[') { + lastPlug = peekCommand(state); + style = lastPlug.openBracket(ch); + source.eat(ch); + setState(state, normal); + return "stex-bracket"; + } + if (/[ \t\r]/.test(ch)) { + source.eat(ch); + return null; + } + setState(state, normal); + lastPlug = peekCommand(state); + if (lastPlug) { + popCommand(state); + } + return normal(source, state); + } + + return { + startState: function() { return { f:normal, cmdState:[] }; }, + copyState: function(s) { return { f: s.f, cmdState: s.cmdState.slice(0, s.cmdState.length) }; }, + + token: function(stream, state) { + var t = state.f(stream, state); + var w = stream.current(); + return t; + } + }; +}); + + +CodeMirror.defineMIME("text/x-stex", "stex"); |