[#66] Replace Clojure brush for SH with new implementation.

This commit is contained in:
zkim 2011-11-25 01:22:23 -07:00
parent 54103496a4
commit 7e8bb8a63d
4 changed files with 908 additions and 183 deletions

1
.gitignore vendored
View file

@ -8,3 +8,4 @@ classes
out
webgen.cache
.lein-failures
.lein-deps-sum

View file

@ -1,190 +1,757 @@
/*!
* Copyright © 2010 Sattvik Software & Technology Resources, Ltd. Co.
* All rights reserved.
*
* sh-clojure may be used under the terms of either the GNU Lesser General Public
* License (LGPL) or the Eclipse Public License (EPL). As a recipient of
* sh-clojure, you may choose which license to receive the code under. See the
* LICENSE file distributed with sh-clojure for details.
*
* Written by Daniel Solano Gómez
*
* Version 0.9.1 - 10 Apr 2010
*/
// (inc clojure-brush) ;; an improved SyntaxHighlighter brush for clojure
//
// Copyright (C) 2011 Andrew Brehaut
//
// Distributed under the Eclipse Public License, the same as Clojure.
//
// https://github.com/brehaut/inc-clojure-brush
//
// Written by Andrew Brehaut
// V0.9.1, November 2011
function ClojureRegExp(pattern) {
pattern = pattern + '(?=[[\\]{}(),\\s])';
this.regex = new RegExp(pattern, 'g');
this.lookBehind = /[\[\]{}(),\s]$/;
}
if (typeof net == "undefined") net = {};
if (!(net.brehaut)) net.brehaut = {};
ClojureRegExp.prototype.exec = function (str) {
var match, leftContext;
while (match=this.regex.exec(str)) {
leftContext = str.substring(0, match.index);
if (this.lookBehind.test(leftContext)) {
return match;
}
else {
this.regex.lastIndex = match.index + 1;
}
}
return null;
};
net.brehaut.ClojureTools = (function (SH) {
"use strict";
// utiliies
if (!Object.create) Object.create = function object(o) {
function F() {};
F.prototype = o;
return new F();
};
// data
function Token(value, index, tag, length) {
this.value = value;
this.index = index;
this.length = length || value.length;
this.tag = tag;
this.secondary_tags = {};
}
// null_token exists so that LispNodes that have not had a closing tag attached
// can have a dummy token to simplify annotation
var null_token = new Token("", -1, "null", -1);
/* LispNodes are aggregate nodes for sexpressions.
*
*/
function LispNode(tag, children, opening) {
this.tag = tag; // current metadata for syntax inference
this.parent = null; // the parent expression
this.list = children; // all the child forms in order
this.opening = opening; // the token that opens this form.
this.closing = null_token; // the token that closes this form.
this.meta = null; // metadata nodes will be attached here if they are found
}
SyntaxHighlighter.brushes.Clojure = function () {
var special_forms =
'. def do fn if let loop monitor-enter monitor-exit new quote recur set! ' +
'throw try var',
clojure_core =
'* *1 *2 *3 *agent* *allow-unresolved-vars* *assert* *clojure-version* ' +
'*command-line-args* *compile-files* *compile-path* *e *err* *file* ' +
'*flush-on-newline* *in* *macro-meta* *math-context* *ns* *out* ' +
'*print-dup* *print-length* *print-level* *print-meta* *print-readably* ' +
'*read-eval* *source-path* *use-context-classloader* ' +
'*warn-on-reflection* + - -> -&gt; ->> -&gt;&gt; .. / < &lt; <= &lt;= = ' +
'== > &gt; >= &gt;= accessor aclone ' +
'add-classpath add-watch agent agent-errors aget alength alias all-ns ' +
'alter alter-meta! alter-var-root amap ancestors and apply areduce ' +
'array-map aset aset-boolean aset-byte aset-char aset-double aset-float ' +
'aset-int aset-long aset-short assert assoc assoc! assoc-in associative? ' +
'atom await await-for await1 bases bean bigdec bigint binding bit-and ' +
'bit-and-not bit-clear bit-flip bit-not bit-or bit-set bit-shift-left ' +
'bit-shift-right bit-test bit-xor boolean boolean-array booleans ' +
'bound-fn bound-fn* butlast byte byte-array bytes cast char char-array ' +
'char-escape-string char-name-string char? chars chunk chunk-append ' +
'chunk-buffer chunk-cons chunk-first chunk-next chunk-rest chunked-seq? ' +
'class class? clear-agent-errors clojure-version coll? comment commute ' +
'comp comparator compare compare-and-set! compile complement concat cond ' +
'condp conj conj! cons constantly construct-proxy contains? count ' +
'counted? create-ns create-struct cycle dec decimal? declare definline ' +
'defmacro defmethod defmulti defn defn- defonce defstruct delay delay? ' +
'deliver deref derive descendants destructure disj disj! dissoc dissoc! ' +
'distinct distinct? doall doc dorun doseq dosync dotimes doto double ' +
'double-array doubles drop drop-last drop-while empty empty? ensure ' +
'enumeration-seq eval even? every? false? ffirst file-seq filter find ' +
'find-doc find-ns find-var first float float-array float? floats flush ' +
'fn fn? fnext for force format future future-call future-cancel ' +
'future-cancelled? future-done? future? gen-class gen-interface gensym ' +
'get get-in get-method get-proxy-class get-thread-bindings get-validator ' +
'hash hash-map hash-set identical? identity if-let if-not ifn? import ' +
'in-ns inc init-proxy instance? int int-array integer? interleave intern ' +
'interpose into into-array ints io! isa? iterate iterator-seq juxt key ' +
'keys keyword keyword? last lazy-cat lazy-seq let letfn line-seq list ' +
'list* list? load load-file load-reader load-string loaded-libs locking ' +
'long long-array longs loop macroexpand macroexpand-1 make-array ' +
'make-hierarchy map map? mapcat max max-key memfn memoize merge ' +
'merge-with meta method-sig methods min min-key mod name namespace neg? ' +
'newline next nfirst nil? nnext not not-any? not-empty not-every? not= ' +
' ns ns-aliases ns-imports ns-interns ns-map ns-name ns-publics ' +
'ns-refers ns-resolve ns-unalias ns-unmap nth nthnext num number? odd? ' +
'or parents partial partition pcalls peek persistent! pmap pop pop! ' +
'pop-thread-bindings pos? pr pr-str prefer-method prefers ' +
'primitives-classnames print print-ctor print-doc print-dup print-method ' +
'print-namespace-doc print-simple print-special-doc print-str printf ' +
'println println-str prn prn-str promise proxy proxy-call-with-super ' +
'proxy-mappings proxy-name proxy-super push-thread-bindings pvalues quot ' +
'rand rand-int range ratio? rational? rationalize re-find re-groups ' +
're-matcher re-matches re-pattern re-seq read read-line read-string ' +
'reduce ref ref-history-count ref-max-history ref-min-history ref-set ' +
'refer refer-clojure release-pending-sends rem remove remove-method ' +
'remove-ns remove-watch repeat repeatedly replace replicate require ' +
'reset! reset-meta! resolve rest resultset-seq reverse reversible? rseq ' +
'rsubseq second select-keys send send-off seq seq? seque sequence ' +
'sequential? set set-validator! set? short short-array shorts ' +
'shutdown-agents slurp some sort sort-by sorted-map sorted-map-by ' +
'sorted-set sorted-set-by sorted? special-form-anchor special-symbol? ' +
'split-at split-with str stream? string? struct struct-map subs subseq ' +
'subvec supers swap! symbol symbol? sync syntax-symbol-anchor take ' +
'take-last take-nth take-while test the-ns time to-array to-array-2d ' +
'trampoline transient tree-seq true? type unchecked-add unchecked-dec ' +
'unchecked-divide unchecked-inc unchecked-multiply unchecked-negate ' +
'unchecked-remainder unchecked-subtract underive unquote ' +
'unquote-splicing update-in update-proxy use val vals var-get var-set ' +
'var? vary-meta vec vector vector? when when-first when-let when-not ' +
'while with-bindings with-bindings* with-in-str with-loading-context ' +
'with-local-vars with-meta with-open with-out-str with-precision xml-seq ' +
'zero? zipmap ';
var null_lispnode = new LispNode("null", [], null_token);
this.getKeywords = function (keywordStr) {
// quote special characters
keywordStr = keywordStr.replace(/[\-\[\]{}()*+?.\\\^$|,#]/g, "\\$&");
// trim whitespace and convert to alternatives
keywordStr = keywordStr.replace(/^\s+|\s+$/g, '').replace(/\s+/g, '|');
// create pattern
return '(?:' + keywordStr + ')';
};
function PrefixNode(tag, token, attached_node) {
this.tag = tag;
this.token = token;
this.attached_node = attached_node;
this.parent = null;
}
this.regexList = [
// comments
{ regex: new RegExp(';.*$', 'gm'),
css: 'comments' },
// strings
{ regex: SyntaxHighlighter.regexLib.multiLineDoubleQuotedString,
css: 'string' },
// regular expressions
{ regex: /#"(?:\.|(\\\")|[^\""\n])*"/g,
css: 'string' },
// vectors
{ regex: /\[|\]/g,
css: 'keyword' },
// amperstands
{ regex: /&(amp;)?/g,
css: 'keyword' },
// sets and maps
{ regex: /#?\{|\}/g,
css: 'keyword' },
// metadata
{ regex: /#\^\{/g,
css: 'keyword' },
// anonymous fn syntactic sugar
{ regex: /#\(|%/g,
css: 'keyword' },
// deref reader macro
{ regex: /@/g,
css: 'keyword' },
// (un)quoted sexprs
{ regex: /(['`]|~@?)[\[({]/g,
css: 'keyword' },
// lists
{ regex: /\(|\)/g,
css: 'keyword' },
// character literals
{ regex: /\\.\b/g,
css: 'value' },
// hexadecimal literals
{ regex: /[+\-]?\b0x[0-9A-F]+\b/gi,
css: 'value' },
// integer/octal/float/bigdecimal literals
{ regex: new ClojureRegExp("[+-]?\\b\\d+(\\.\\d*)?([eE][+-]?\\d+|M)?\\b"),
css: 'value' },
{ regex: /^[+\-]?\b\d+(\.\d*)?([eE][+\-]?\d+|M)?\b/g,
css: 'value' },
// booleans+nil
{ regex: /\b(true|false|nil)\b/g,
css: 'value' },
// (un)quoted symbols
{ regex: /(`|#?'|~@?)[\w-.A-Za-z0-9_&lt;&gt;\-]+/g,
css: 'color1' },
// keywords
{ regex: /:[A-Za-z0-9_\-]+/g,
css: 'constants' },
// special forms
{ regex: new ClojureRegExp(this.getKeywords(special_forms)),
css: 'preprocessor' },
// type hints
{ regex: /\#\^[A-Za-z]\w*/g,
css: 'preprocessor' },
// clojure.core
{ regex: new ClojureRegExp(this.getKeywords(clojure_core)),
css: 'functions' },
{ regex: /[A-Za-z0-9_&lt;&gt;\-]+/g, css: 'plain'}
];
// tokenize
this.forHtmlScript(SyntaxHighlighter.regexLib.scriptScriptTags);
};
function tokenize(code) {
var tokens = [];
var tn = 0;
var zero = "0".charCodeAt(0);
var nine = "9".charCodeAt(0);
var lower_a = "a".charCodeAt(0);
var lower_f = "f".charCodeAt(0);
var upper_a = "A".charCodeAt(0);
var upper_f = "F".charCodeAt(0);
var dispatch = false; // have we just seen a # character?
// i tracks the start of the current window
// extent is the window for slicing
for (var i = 0,
extent = i,
j = code.length;
i < j && extent <= j;) {
var c = code[i];
// we care about capturing the whole token when dispatch is used, so back up the
// starting index by 1
if (dispatch) i--;
switch (c) {
// dispatch alters the value of the next thing read
case "#":
dispatch = true;
i++;
extent++;
continue;
case " ": // ignore whitespace
case "\t":
case "\n":
case "\r":
case ",":
extent++
break;
// simple terms
case "^":
case "`":
case ")":
case "[":
case "]":
case "}":
case "@":
tokens[tn++] = new Token(c, i, c, ++extent - i);
break;
case "'":
tokens[tn++] = new Token(code.slice(i, ++extent), i, dispatch ? "#'" : "'", extent - i);
break
case "(":
tokens[tn++] = new Token(code.slice(i, ++extent), i, "(", extent - i);
break;
case "{":
tokens[tn++] = new Token(code.slice(i, ++extent), i, dispatch ? "#{" : "{", extent - i);
break;
case "\\":
if (code.slice(i + 1, i + 8) === "newline") {
tokens[tn++] = new Token("\\newline", i, "value", 8);
extent = i + 9;
}
else if (code.slice(i + 1, i + 6) === "space") {
tokens[tn++] = new Token("\\space", i, "value", 6);
extent = i + 6;
}
else if (code.slice(i + 1, i + 4) === "tab") {
tokens[tn++] = new Token("\\tab", i, "value", 4);
extent = i + 5;
} // work around fun bug with &,>,< in character literals
else if (code.slice(i + 1, i + 6) === "&amp;") {
tokens[tn++] = new Token("\\&amp;", i, "value", 6);
extent = i + 6;
}
else if (code.slice(i + 1, i + 5) === "&lt;") {
tokens[tn++] = new Token("\\&lt;", i, "value", 5);
extent = i + 5;
}
else if (code.slice(i + 1, i + 5) === "&gt;") {
tokens[tn++] = new Token("\\&gt;", i, "value", 5);
extent = i + 5;
}
else {
extent += 2;
tokens[tn++] = new Token(code.slice(i, extent), i, "value", 2);
}
break;
case "~": // slice
if (code[i + 1] === "@") {
extent += 2;
tokens[tn++] = new Token(code.slice(i, extent), i, "splice", 2);
}
else {
tokens[tn++] = new Token(code.slice(i, ++extent), i, "unquote", 2);
}
break;
// complicated terms
case "\"": // strings and regexps
for (extent++; extent <= j; extent++) {
if (code[extent] === "\\") extent++;
else if (code[extent] === "\"") break;
}
tokens[tn++] = new Token(code.slice(i, ++extent), i, dispatch ? "regexp" : "string", extent - i);
break;
case ";":
for (; extent <= j && code[extent] !== "\n" && code[extent] !== "\r"; extent++);
tokens[tn++] = new Token(code.slice(i, ++extent), i, "comments", extent - i);
break;
case "+": // numbers; fall through to symbol for + and - not prefixing a number
case "-":
case "0":
case "1":
case "2":
case "3":
case "4":
case "5":
case "6":
case "7":
case "8":
case "9":
// todo: exponents, hex
// http://my.safaribooksonline.com/9781449310387/14?reader=pf&readerfullscreen=&readerleftmenu=1
var c2 = code.charCodeAt(i + 1);
if (((c === "+" || c === "-") && (c2 >= zero && c2 <= nine)) // prefixes
|| (c !== "+" && c !== "-")) {
if (c === "+" || c === "-") extent++;
for (; extent <= j; extent++) {
var charCode = code.charCodeAt(extent);
if (charCode < zero || charCode > nine) break;
}
c = code[extent];
c2 = code.charCodeAt(extent + 1);
if ((c === "r" || c === "R" || c === "/" || c === ".") // interstitial characters
&& (c2 >= zero && c2 <= nine)) {
for (extent++; extent <= j; extent++) {
var charCode = code.charCodeAt(extent);
if (charCode < zero || charCode > nine) break;
}
}
c = code[extent];
c2 = code.charCodeAt(extent + 1);
if ((c === "x" || c === "X") &&
((c2 >= zero && c2 <= nine)
|| (c2 >= lower_a && c2 <= lower_f)
|| (c2 >= upper_a && c2 <= upper_f))) {
for (extent++; extent <= j; extent++) {
var charCode = code.charCodeAt(extent);
if (((charCode >= zero && charCode <= nine)
|| (charCode >= lower_a && charCode <= lower_f)
|| (charCode >= upper_a && charCode <= upper_f))) continue;
break;
}
}
c = code[extent];
c2 = code.charCodeAt(extent + 1);
if ((c === "e" || c === "E")
&& (c2 >= zero && c2 <= nine)) {
for (extent++; extent <= j; extent++) {
var charCode = code.charCodeAt(extent);
if (charCode < zero || charCode > nine) break;
}
}
c = code[extent];
if (c === "N" || c === "M") extent++;
SyntaxHighlighter.brushes.Clojure.prototype = new SyntaxHighlighter.Highlighter();
SyntaxHighlighter.brushes.Clojure.aliases = ['clojure', 'Clojure', 'clj'];
tokens[tn++] = new Token(code.slice(i, extent), i, "value", extent - i);
break;
}
// vim: ts=2 sw=2 noet
case "_":
if (dispatch && c === "_") {
tokens[tn++] = new Token(code.slice(i, ++extent), i, "skip", extent - i);
break;
} // if not a skip, fall through to symbols
// Allow just about any other symbol as a symbol. This is far more permissive than
// clojure actually allows, but should catch any weirdo crap that accidentally gets
// into the code.
default:
for (extent++; extent <= j; extent++) {
switch (code[extent]) {
case " ":
case "\t":
case "\n":
case "\r":
case "\\":
case ",":
case "{":
case "}":
case "(":
case ")":
case "[":
case "]":
case "^":
case "`":
case "@":
break;
case ";":
// theres a weird bug via syntax highligher that gives us escaped entities.
// need to watch out for these
if (code.slice(extent-3, extent+1) === "&lt;"
||code.slice(extent-3, extent+1) === "&gt;"
||code.slice(extent-4, extent+1) === "&amp;") {
continue;
}
break;
default:
continue;
}
break;
}
var value = code.slice(i, extent);
var tag = "symbol";
if (value[0] == ":") {
tag = "keyword";
}
else if (value === "true" || value === "false" || value === "nil") {
tag = "value";
}
tokens[tn++] = new Token(value, i, tag, extent - i);
}
dispatch = false;
i = extent;
}
return tokens;
}
function build_tree(tokens) {
var toplevel = {
list: [],
tag: "toplevel",
parent: null,
opening: null,
closing: null,
depth: -1
};
// loop variables hoisted out as semi globals to track position in token stream
var i = -1;
var j = tokens.length;
function parse_one(t) {
// ignore special tokens and forms that dont belong in the tree
for (; t && (t.tag === "comments" || t.tag === "invalid" || t.tag == "skip") && i < j; ) {
if (t.tag === "skip") {
t.tag = "preprocessor";
annotate_comment(parse_one(tokens[++i]));
}
t = tokens[++i];
}
if (!t) return {}; // hackity hack
switch (t.tag) {
case "{":
return build_aggregate(new LispNode("map", [], t), "}");
case "(":
return build_aggregate(new LispNode("list", [], t), ")");
case "#{":
return build_aggregate(new LispNode("set", [], t), "}");
case "[":
return build_aggregate(new LispNode("vector", [], t), "]");
case "'":
return new PrefixNode("quote", t, parse_one(tokens[++i]));
case "#'":
return new PrefixNode("varquote", t, parse_one(tokens[++i]));
case "@":
return new PrefixNode("deref", t, parse_one(tokens[++i]));
case "`":
return new PrefixNode("quasiquote", t, parse_one(tokens[++i]));
case "unquote":
return new PrefixNode("unquote", t, parse_one(tokens[++i]));
case "splice":
return new PrefixNode("splice", t, parse_one(tokens[++i]));
case "^":
t.tag = "meta";
var meta = parse_one(tokens[++i]);
var next = parse_one(tokens[++i]);
next.meta = meta;
return next;
}
return t;
}
// build_aggregate collects to ether sub forms for one aggregate for.
function build_aggregate(current, expected_closing) {
for (i++; i < j; i++) {
var t = tokens[i];
if (t.tag === "}" || t.tag === ")" || t.tag === "]") {
if (t.tag !== expected_closing) t.tag = "invalid";
current.closing = t;
if (expected_closing) return current;
}
var node = parse_one(t);
node.parent = current;
current.list[current.list.length] = node;
}
return current;
}
build_aggregate(toplevel, null);
return toplevel;
}
// annotation rules to apply to a form based on its head
var show_locals = true; // HACK. would rather not use a (semi)-global.
/* annotate_comment is a special case annotation.
* in addition to its role in styling specific forms, it is called by parse_one to
* ignore any forms skipped with #_
*/
function annotate_comment(exp) {
exp.tag = "comments";
if (exp.list) {
exp.opening.tag = "comments";
exp.closing.tag = "comments";
for (var i = 0; i < exp.list.length; i++) {
var child = exp.list[i];
if (child.list) {
annotate_comment(child);
}
if (child.attached_node) {
annotate_comment(child.attached_node);
}
else {
child.tag = "comments";
}
}
}
}
/* custom annotation rules are stored here */
var annotation_rules = {};
// this function is exposed to allow ad hoc extension of the customisation rules
function register_annotation_rule(names, rule) {
for (var i = 0; i < names.length; i++) {
annotation_rules[names[i]] = rule;
}
}
function annotate_destructuring (exp, scope) {
if (exp.list) {
if (exp.tag === "vector") {
for (var i = 0; i < exp.list.length; i++) {
annotate_destructuring(exp.list[i], scope);
}
}
else if (exp.tag === "map") {
for (var i = 0; i < exp.list.length; i += 2) {
var key = exp.list[i];
var val = exp.list[i + 1];
if (key.tag === "keyword" && val.tag === "vector") {
for (var ii = 0, jj = val.list.length; ii < jj; ii++) {
if (val.list[ii].tag !== "symbol") continue;
val.list[ii].tag = "variable";
scope[val.list[ii].value] = true;
}
}
else {
annotate_destructuring(key, scope);
annotate_expressions(val, scope);
}
}
}
}
else if (exp.tag === "symbol" && (exp.value !== "&" && exp.value !== "&amp;")){
exp.tag = "variable";
scope[exp.value] = true;
}
}
function _annotate_binding_vector (exp, scope) {
if (exp.tag !== "vector") return;
var bindings = exp.list;
if (bindings.length % 2 === 1) return;
for (var i = 0; i < bindings.length; i += 2) {
annotate_destructuring(bindings[i], scope);
annotate_expressions(bindings[i + 1], scope);
}
}
function annotate_binding (exp, scope) {
var bindings = exp.list[1];
if (!show_locals) return; // HACK
if (bindings) {
scope = Object.create(scope);
_annotate_binding_vector(bindings, scope);
}
for (var i = 2; i < exp.list.length; i++) {
annotate_expressions(exp.list[i], scope);
}
}
function _annotate_function_body (exp, scope, start_idx) {
var argvec = exp.list[start_idx];
if (argvec.tag !== "vector") return;
scope = Object.create(scope);
for (var i = 0, j = argvec.list.length; i < j; i++) {
annotate_destructuring(argvec.list[i], scope);
}
for (var i = start_idx, j = exp.list.length; i < j; i++) {
annotate_expressions(exp.list[i], scope);
}
}
function annotate_function (exp, scope) {
for (var i = 1, j = exp.list.length; i < j; i++) {
var child = exp.list[i];
if (child.tag === "vector") {
_annotate_function_body (exp, scope, i);
return;
}
else if (child.tag === "list") {
_annotate_function_body(child, scope, 0)
}
}
}
function annotate_letfn (exp, scope) {
scope = Object.create(scope);
var bindings = exp.list[1];
var fn;
for (var i = 0, j = bindings.list.length; i < j; i++) {
fn = bindings.list[i];
if (!fn.list[0]) continue;
fn.list[0].tag = "variable";
scope[fn.list[0].value] = true;
}
for (i = 0, j = bindings.list.length; i < j; i++) {
var fn = bindings.list[i];
annotate_function(fn, scope);
}
for (i = 2, j = exp.list.length; i < j; i++) {
annotate_expressions(exp.list[i], scope);
}
}
register_annotation_rule(
["comment"],
annotate_comment
);
register_annotation_rule(
["let", "when-let", "if-let", "binding", "doseq", "for", "dotimes", "let*"],
annotate_binding
);
register_annotation_rule(
["defn", "defn-", "fn", "bound-fn", "defmacro", "fn*", "defmethod"],
annotate_function
);
register_annotation_rule(
["letfn"],
annotate_letfn
);
// standard annotations
function _annotate_metadata_recursive(meta, scope) {
if (!meta) return;
if (meta.list !== undefined && meta.list !== null) {
for (var i = 0, j = meta.list.length; i < j; i++) {
meta.opening.secondary_tags.meta = true
meta.closing.secondary_tags.meta = true
_annotate_metadata_recursive(meta.list[i], scope);
}
}
else if (meta.attached_node) {
meta.token.secondary_tags.meta = true;
_annotate_metadata_recursive(meta.attached_node, scope);
}
else {
meta.secondary_tags.meta = true;
}
}
function annotate_metadata(exp) {
if (!(exp && exp.meta)) return;
var meta = exp.meta;
annotate_expressions(meta, {});
_annotate_metadata_recursive(meta, {});
}
function annotate_quoted(exp, scope) {
if (!exp) return;
if (exp.list !== undefined && exp.list !== null) {
for (var i = 0, j = exp.list.length; i < j; i++) {
exp.opening.secondary_tags.quoted = true
exp.closing.secondary_tags.quoted = true
annotate_quoted(exp.list[i], scope);
}
}
else if (exp.attached_node) {
if (exp.tag === "unquote" || exp.tag === "splice") return;
exp.token.secondary_tags.quoted = true;
annotate_quoted(exp.attached_node, scope);
}
else {
exp.secondary_tags.quoted = true;
}
}
function annotate_expressions(exp, scope) {
annotate_metadata(exp);
switch (exp.tag) {
case "toplevel":
for (var i = 0; i < exp.list.length; i++) {
annotate_expressions(exp.list[i], scope);
}
break;
case "list": // functions, macros, special forms, comments
var head = exp.list[0];
if (head) {
if (head.tag === "list" || head.tag === "vector"
|| head.tag === "map" || head.tag === "set") {
annotate_expressions(head, scope);
}
else if (head.attached_node) {
annotate_expressions(head.attached_node, scope);
}
else {
head.tag = (head.value.match(/(^\.)|(\.$)|[A-Z].*\//)
? "method"
: "function");
}
// apply specific rules
if (annotation_rules.hasOwnProperty(head.value)) {
annotation_rules[head.value](exp, scope);
}
else {
for (var i = 1; i < exp.list.length; i++) {
annotate_expressions(exp.list[i], scope);
}
}
}
else { // empty list
exp.opening.tag = "value";
exp.closing.tag = "value";
}
break;
case "vector": // data
case "map":
case "set":
for (var i = 0; i < exp.list.length; i++) {
annotate_expressions(exp.list[i], scope);
}
break;
case "symbol":
if (exp.value.match(/[A-Z].*\/[A-Z_]+/)) {
exp.tag = "constant";
}
else if (show_locals && scope[exp.value]) {
exp.tag = "variable";
}
else if (exp.tag === "symbol" && exp.value.match(/([A-Z].*\/)?[A-Z_]+/)) {
exp.tag = "type";
}
break;
case "quote":
case "quasiquote":
annotate_quoted(exp.attached_node, scope);
default:
if (exp.attached_node) annotate_expressions(exp.attached_node, scope);
}
}
// translation of tag to css:
var css_translation = {
"constant": "constants",
"keyword": "constants",
"method": "color1",
"type": "color3",
"function": "functions",
"string": "string",
"regexp": "string",
"value": "value",
"comments": "comments",
"symbol": "symbol",
"variable": "variable",
"splice": "preprocessor",
"unquote": "preprocessor",
"preprocessor": "preprocessor",
"meta": "preprocessor",
"'": "preprocessor",
"#'": "preprocessor",
"(": "plain",
")": "plain",
"{": "keyword",
"}": "keyword",
"#{": "keyword",
"[": "keyword",
"]": "keyword",
"invalid": "invalid",
"@": "plain"
};
function translate_tags_to_css(tokens) {
for (var i = 0, j = tokens.length; i < j; i++) {
var token = tokens[i];
token.css = css_translation[token.tag];
for (var k in token.secondary_tags) if (token.secondary_tags.hasOwnProperty(k))
token.css += " " + k ;
};
}
// create the new brush
SH.brushes.Clojure = function () {};
SH.brushes.Clojure.prototype = new SyntaxHighlighter.Highlighter();
SH.brushes.Clojure.prototype.findMatches = function find_matches (regexpList, code) {
// this is a nasty global hack. need to resolve this
if (this.params && this.params.locals) {
show_locals = this.params.locals === true || this.params.locals === "true";
}
else {
show_locals = true;
}
var tokens = tokenize(code);
annotate_expressions(build_tree(tokens), {});
translate_tags_to_css(tokens);
return tokens;
};
SH.brushes.Clojure.aliases = ['clojure', 'Clojure', 'clj'];
SH.brushes.Clojure.register_annotation_rule = register_annotation_rule;
return {
tokenize: tokenize,
build_tree: build_tree
};
})(SyntaxHighlighter);

View file

@ -0,0 +1,157 @@
/**
* http://alexgorbatchev.com/SyntaxHighlighter/donate.html
*
* @version
* 3.0.83 (July 02 2010)
*
* @copyright
* Copyright (C) 2004-2010 Alex Gorbatchev.
*
* @license
* Dual licensed under the MIT and GPL licenses.
*/
.syntaxhighlighter {
background-color: transparent !important;
}
.syntaxhighlighter .line.alt1 {
background-color: transparent !important;
}
.syntaxhighlighter .line.alt2 {
background-color: transparent !important;
}
.syntaxhighlighter .line.highlighted.alt1, .syntaxhighlighter .line.highlighted.alt2 {
background-color: #c3defe !important;
}
.syntaxhighlighter .line.highlighted.number {
color: white !important;
}
.syntaxhighlighter table caption {
color: black !important;
}
.syntaxhighlighter .gutter {
color: #787878 !important;
}
.syntaxhighlighter .gutter .line {
border-right: 3px solid #d4d0c8 !important;
}
.syntaxhighlighter .gutter .line.highlighted {
background-color: #d4d0c8 !important;
color: white !important;
}
.syntaxhighlighter.printing .line .content {
border: none !important;
}
.syntaxhighlighter.collapsed {
overflow: visible !important;
}
.syntaxhighlighter.collapsed .toolbar {
color: #3f5fbf !important;
background: white !important;
border: 1px solid #d4d0c8 !important;
}
.syntaxhighlighter.collapsed .toolbar a {
color: #3f5fbf !important;
}
.syntaxhighlighter.collapsed .toolbar a:hover {
color: #aa7700 !important;
}
.syntaxhighlighter .toolbar {
color: #a0a0a0 !important;
background: #d4d0c8 !important;
border: none !important;
}
.syntaxhighlighter .toolbar a {
color: #a0a0a0 !important;
}
.syntaxhighlighter .toolbar a:hover {
color: red !important;
}
.syntaxhighlighter .plain, .syntaxhighlighter .plain a {
color: black !important;
}
.syntaxhighlighter .comments, .syntaxhighlighter .comments a {
color: #3f5fbf !important;
}
.syntaxhighlighter .string, .syntaxhighlighter .string a {
color: #2a00ff !important;
}
.syntaxhighlighter .keyword {
color: #7f0055 !important;
}
.syntaxhighlighter .preprocessor {
color: #646464 !important;
}
.syntaxhighlighter .variable {
color: #aa7700 !important;
}
.syntaxhighlighter .value {
color: #009900 !important;
}
.syntaxhighlighter .functions {
color: #ff1493 !important;
}
.syntaxhighlighter .constants {
color: #0066cc !important;
}
.syntaxhighlighter .script {
font-weight: bold !important;
color: #7f0055 !important;
background-color: none !important;
}
.syntaxhighlighter .color1, .syntaxhighlighter .color1 a {
color: gray !important;
}
.syntaxhighlighter .color2, .syntaxhighlighter .color2 a {
color: #ff1493 !important;
}
.syntaxhighlighter .color3, .syntaxhighlighter .color3 a {
color: red !important;
}
.syntaxhighlighter .xml .keyword {
color: #3f7f7f !important;
font-weight: normal !important;
}
.syntaxhighlighter .xml .color1, .syntaxhighlighter .xml .color1 a {
color: #7f007f !important;
}
.syntaxhighlighter .xml .string {
font-style: italic !important;
color: #2a00ff !important;
}
.clojure.syntaxhighlighter .invalid {
background-color: #FAA !important;
}
.clojure.syntaxhighlighter .quoted {
font-style: italic !important;
}
.syntaxhighlighter .clojure.variable,
.syntaxhighlighter .clojure.symbol,
.syntaxhighlighter .clojure.value
{
color: #006060 !important;
}
.syntaxhighlighter .clojure.string {
color: #55B !important;
}
.syntaxhighlighter .clojure.functions {
color: black !important;
}
.syntaxhighlighter .clojure.color1 {
color: #666 !important;
}
.syntaxhighlighter .clojure.color3 {
color: #900 !important;
}
.syntaxhighlighter .clojure.constants {
color: #1A734D !important;
}

View file

@ -356,7 +356,7 @@
(inline-css (str *resources* "shCore.css"))
(css
[:.syntaxhighlighter {:overflow "hidden !important"}])
(inline-css (str *resources* "shThemeEclipse.css"))
(inline-css (str *resources* "shThemeMarginalia.css"))
reset-css
header-css
floating-toc-css