utopia 2.13.4 → 2.14.0

data/docs/_components/jquery-syntax/jquery.syntax.brush.scala.js

@@ -1,44 +1,4 @@
-// brush: "scala" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.brushes.dependency('scala', 'xml');
-
-Syntax.register('scala', function(brush) {
-	var keywords = ["abstract", "do", "finally", "import", "object", "return", "trait", "var", "case", "catch", "class", "else", "extends", "for", "forSome", "if", "lazy", "match", "new", "override", "package", "private", "sealed", "super", "try", "type", "while", "with", "yield", "def", "final", "implicit", "protected", "throw", "val"];
-	brush.push(keywords, {klass: 'keyword'});
-	
-	var operators = ["_", ":", "=", "=>", "<-", "<:", "<%", ">:", "#", "@"];
-	brush.push(operators, {klass: 'operator'});
-	
-	var constants = ["this", "null", "true", "false"];
-	brush.push(constants, {klass: 'constant'});
-	
-	// Strings
-	brush.push({
-		pattern: /"""[\s\S]*?"""/g,
-		klass: 'string'
-	});
-	
-	brush.push(Syntax.lib.doubleQuotedString);
-	
-	// Functions
-	brush.push({
-		pattern: /(?:def\s+|\.)([a-z_][a-z0-9_]+)/gi, 
-		matches: Syntax.extractMatches({klass: 'function'})
-	});
-	
-	brush.push(Syntax.lib.camelCaseType);
-	
-	// Types
-	brush.push(Syntax.lib.cStyleFunction);
-	
-	// Comments
-	brush.push(Syntax.lib.cStyleComment);
-	brush.push(Syntax.lib.cppStyleComment);
-	
-	brush.derives('xml');
-});
-
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.brushes.dependency("scala","xml");
+Syntax.register("scala",function(a){a.push("abstract do finally import object return trait var case catch class else extends for forSome if lazy match new override package private sealed super try type while with yield def final implicit protected throw val".split(" "),{klass:"keyword"});a.push("_ : = => <- <: <% >: # @".split(" "),{klass:"operator"});a.push(["this","null","true","false"],{klass:"constant"});a.push({pattern:/"""[\s\S]*?"""/g,klass:"string"});a.push(Syntax.lib.doubleQuotedString);
+a.push({pattern:/(?:def\s+|\.)([a-z_][a-z0-9_]+)/gi,matches:Syntax.extractMatches({klass:"function"})});a.push(Syntax.lib.camelCaseType);a.push(Syntax.lib.cStyleFunction);a.push(Syntax.lib.cStyleComment);a.push(Syntax.lib.cppStyleComment);a.derives("xml")});

data/docs/_components/jquery-syntax/jquery.syntax.brush.smalltalk.js

@@ -1,29 +1,2 @@
-// brush: "smalltalk" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.register('smalltalk', function(brush) {
-	var operators = ["[", "]", "|", ":=", "."];
-	
-	var values = ["self", "super", "true", "false", "nil"];
-	
-	brush.push(values, {klass: 'constant'});
-	brush.push(operators, {klass: 'operator'});
-	
-	// Objective-C style functions
-	brush.push({pattern: /\w+:/g, klass: 'function'});
-	
-	// Camelcase Types
-	brush.push(Syntax.lib.camelCaseType);
-	
-	// Strings
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-	brush.push(Syntax.lib.stringEscape);
-	
-	// Numbers
-	brush.push(Syntax.lib.decimalNumber);
-	brush.push(Syntax.lib.hexNumber);
-});
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.register("smalltalk",function(a){a.push(["self","super","true","false","nil"],{klass:"constant"});a.push(["[","]","|",":=","."],{klass:"operator"});a.push({pattern:/\w+:/g,klass:"function"});a.push(Syntax.lib.camelCaseType);a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString);a.push(Syntax.lib.stringEscape);a.push(Syntax.lib.decimalNumber);a.push(Syntax.lib.hexNumber)});

data/docs/_components/jquery-syntax/jquery.syntax.brush.sql.js

@@ -1,31 +1,4 @@
-// brush: "sql" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.lib.sqlStyleComment = {pattern: /-- .*$/gm, klass: 'comment', allow: ['href']};
-
-Syntax.register('sql', function(brush) {
-	var keywords = ["A", "ABORT", "ABS", "ABSOLUTE", "ACCESS", "ACTION", "ADA", "ADD", "ADMIN", "AFTER", "AGGREGATE", "ALIAS", "ALL", "ALLOCATE", "ALSO", "ALTER", "ALWAYS", "ANALYSE", "ANALYZE", "AND", "ANY", "ARE", "ARRAY", "AS", "ASC", "ASENSITIVE", "ASSERTION", "ASSIGNMENT", "ASYMMETRIC", "AT", "ATOMIC", "ATTRIBUTE", "ATTRIBUTES", "AUDIT", "AUTHORIZATION", "AUTO_INCREMENT", "AVG", "AVG_ROW_LENGTH", "BACKUP", "BACKWARD", "BEFORE", "BEGIN", "BERNOULLI", "BETWEEN", "BIGINT", "BINARY", "BIT", "BIT_LENGTH", "BITVAR", "BLOB", "BOOL", "BOOLEAN", "BOTH", "BREADTH", "BREAK", "BROWSE", "BULK", "BY", "C", "CACHE", "CALL", "CALLED", "CARDINALITY", "CASCADE", "CASCADED", "CASE", "CAST", "CATALOG", "CATALOG_NAME", "CEIL", "CEILING", "CHAIN", "CHANGE", "CHAR", "CHAR_LENGTH", "CHARACTER", "CHARACTER_LENGTH", "CHARACTER_SET_CATALOG", "CHARACTER_SET_NAME", "CHARACTER_SET_SCHEMA", "CHARACTERISTICS", "CHARACTERS", "CHECK", "CHECKED", "CHECKPOINT", "CHECKSUM", "CLASS", "CLASS_ORIGIN", "CLOB", "CLOSE", "CLUSTER", "CLUSTERED", "COALESCE", "COBOL", "COLLATE", "COLLATION", "COLLATION_CATALOG", "COLLATION_NAME", "COLLATION_SCHEMA", "COLLECT", "COLUMN", "COLUMN_NAME", "COLUMNS", "COMMAND_FUNCTION", "COMMAND_FUNCTION_CODE", "COMMENT", "COMMIT", "COMMITTED", "COMPLETION", "COMPRESS", "COMPUTE", "CONDITION", "CONDITION_NUMBER", "CONNECT", "CONNECTION", "CONNECTION_NAME", "CONSTRAINT", "CONSTRAINT_CATALOG", "CONSTRAINT_NAME", "CONSTRAINT_SCHEMA", "CONSTRAINTS", "CONSTRUCTOR", "CONTAINS", "CONTAINSTABLE", "CONTINUE", "CONVERSION", "CONVERT", "COPY", "CORR", "CORRESPONDING", "COUNT", "COVAR_POP", "COVAR_SAMP", "CREATE", "CREATEDB", "CREATEROLE", "CREATEUSER", "CROSS", "CSV", "CUBE", "CUME_DIST", "CURRENT", "CURRENT_DATE", "CURRENT_DEFAULT_TRANSFORM_GROUP", "CURRENT_PATH", "CURRENT_ROLE", "CURRENT_TIME", "CURRENT_TIMESTAMP", "CURRENT_TRANSFORM_GROUP_FOR_TYPE", "CURRENT_USER", "CURSOR", "CURSOR_NAME", "CYCLE", "DATA", "DATABASE", "DATABASES", "DATE", "DATETIME", "DATETIME_INTERVAL_CODE", "DATETIME_INTERVAL_PRECISION", "DAY", "DAY_HOUR", "DAY_MICROSECOND", "DAY_MINUTE", "DAY_SECOND", "DAYOFMONTH", "DAYOFWEEK", "DAYOFYEAR", "DBCC", "DEALLOCATE", "DEC", "DECIMAL", "DECLARE", "DEFAULT", "DEFAULTS", "DEFERRABLE", "DEFERRED", "DEFINED", "DEFINER", "DEGREE", "DELAY_KEY_WRITE", "DELAYED", "DELETE", "DELIMITER", "DELIMITERS", "DENSE_RANK", "DENY", "DEPTH", "DEREF", "DERIVED", "DESC", "DESCRIBE", "DESCRIPTOR", "DESTROY", "DESTRUCTOR", "DETERMINISTIC", "DIAGNOSTICS", "DICTIONARY", "DISABLE", "DISCONNECT", "DISK", "DISPATCH", "DISTINCT", "DISTINCTROW", "DISTRIBUTED", "DIV", "DO", "DOMAIN", "DOUBLE", "DROP", "DUAL", "DUMMY", "DUMP", "DYNAMIC", "DYNAMIC_FUNCTION", "DYNAMIC_FUNCTION_CODE", "EACH", "ELEMENT", "ELSE", "ELSEIF", "ENABLE", "ENCLOSED", "ENCODING", "ENCRYPTED", "END", "END-EXEC", "ENUM", "EQUALS", "ERRLVL", "ESCAPE", "ESCAPED", "EVERY", "EXCEPT", "EXCEPTION", "EXCLUDE", "EXCLUDING", "EXCLUSIVE", "EXEC", "EXECUTE", "EXISTING", "EXISTS", "EXIT", "EXP", "EXPLAIN", "EXTERNAL", "EXTRACT", "FALSE", "FETCH", "FIELDS", "FILE", "FILLFACTOR", "FILTER", "FINAL", "FIRST", "FLOAT", "FLOAT4", "FLOAT8", "FLOOR", "FLUSH", "FOLLOWING", "FOR", "FORCE", "FOREIGN", "FORTRAN", "FORWARD", "FOUND", "FREE", "FREETEXT", "FREETEXTTABLE", "FREEZE", "FROM", "FULL", "FULLTEXT", "FUNCTION", "FUSION", "G", "GENERAL", "GENERATED", "GET", "GLOBAL", "GO", "GOTO", "GRANT", "GRANTED", "GRANTS", "GREATEST", "GROUP", "GROUPING", "HANDLER", "HAVING", "HEADER", "HEAP", "HIERARCHY", "HIGH_PRIORITY", "HOLD", "HOLDLOCK", "HOST", "HOSTS", "HOUR", "HOUR_MICROSECOND", "HOUR_MINUTE", "HOUR_SECOND", "IDENTIFIED", "IDENTITY", "IDENTITY_INSERT", "IDENTITYCOL", "IF", "IGNORE", "ILIKE", "IMMEDIATE", "IMMUTABLE", "IMPLEMENTATION", "IMPLICIT", "IN", "INCLUDE", "INCLUDING", "INCREMENT", "INDEX", "INDICATOR", "INFILE", "INFIX", "INHERIT", "INHERITS", "INITIAL", "INITIALIZE", "INITIALLY", "INNER", "INOUT", "INPUT", "INSENSITIVE", "INSERT", "INSERT_ID", "INSTANCE", "INSTANTIABLE", "INSTEAD", "INT", "INT1", "INT2", "INT3", "INT4", "INT8", "INTEGER", "INTERSECT", "INTERSECTION", "INTERVAL", "INTO", "INVOKER", "IS", "ISAM", "ISNULL", "ISOLATION", "ITERATE", "JOIN", "K", "KEY", "KEY_MEMBER", "KEY_TYPE", "KEYS", "KILL", "LANCOMPILER", "LANGUAGE", "LARGE", "LAST", "LAST_INSERT_ID", "LATERAL", "LEADING", "LEAST", "LEAVE", "LEFT", "LENGTH", "LESS", "LEVEL", "LIKE", "LIMIT", "LINENO", "LINES", "LISTEN", "LN", "LOAD", "LOCAL", "LOCALTIME", "LOCALTIMESTAMP", "LOCATION", "LOCATOR", "LOCK", "LOGIN", "LOGS", "LONG", "LONGBLOB", "LONGTEXT", "LOOP", "LOW_PRIORITY", "LOWER", "M", "MAP", "MATCH", "MATCHED", "MAX", "MAX_ROWS", "MAXEXTENTS", "MAXVALUE", "MEDIUMBLOB", "MEDIUMINT", "MEDIUMTEXT", "MEMBER", "MERGE", "MESSAGE_LENGTH", "MESSAGE_OCTET_LENGTH", "MESSAGE_TEXT", "METHOD", "MIDDLEINT", "MIN", "MIN_ROWS", "MINUS", "MINUTE", "MINUTE_MICROSECOND", "MINUTE_SECOND", "MINVALUE", "MLSLABEL", "MOD", "MODE", "MODIFIES", "MODIFY", "MODULE", "MONTH", "MONTHNAME", "MORE", "MOVE", "MULTISET", "MUMPS", "MYISAM", "NAMES", "NATIONAL", "NATURAL", "NCHAR", "NCLOB", "NESTING", "NEW", "NEXT", "NO", "NO_WRITE_TO_BINLOG", "NOAUDIT", "NOCHECK", "NOCOMPRESS", "NOCREATEDB", "NOCREATEROLE", "NOCREATEUSER", "NOINHERIT", "NOLOGIN", "NONCLUSTERED", "NONE", "NORMALIZE", "NORMALIZED", "NOSUPERUSER", "NOT", "NOTHING", "NOTIFY", "NOTNULL", "NOWAIT", "NULL", "NULLABLE", "NULLIF", "NULLS", "NUMBER", "NUMERIC", "OBJECT", "OCTET_LENGTH", "OCTETS", "OF", "OFF", "OFFLINE", "OFFSET", "OFFSETS", "OIDS", "OLD", "ON", "ONLINE", "ONLY", "OPEN", "OPENDATASOURCE", "OPENQUERY", "OPENROWSET", "OPENXML", "OPERATION", "OPERATOR", "OPTIMIZE", "OPTION", "OPTIONALLY", "OPTIONS", "OR", "ORDER", "ORDERING", "ORDINALITY", "OTHERS", "OUT", "OUTER", "OUTFILE", "OUTPUT", "OVER", "OVERLAPS", "OVERLAY", "OVERRIDING", "OWNER", "PACK_KEYS", "PAD", "PARAMETER", "PARAMETER_MODE", "PARAMETER_NAME", "PARAMETER_ORDINAL_POSITION", "PARAMETER_SPECIFIC_CATALOG", "PARAMETER_SPECIFIC_NAME", "PARAMETER_SPECIFIC_SCHEMA", "PARAMETERS", "PARTIAL", "PARTITION", "PASCAL", "PASSWORD", "PATH", "PCTFREE", "PERCENT", "PERCENT_RANK", "PERCENTILE_CONT", "PERCENTILE_DISC", "PLACING", "PLAN", "PLI", "POSITION", "POSTFIX", "POWER", "PRECEDING", "PRECISION", "PREFIX", "PREORDER", "PREPARE", "PREPARED", "PRESERVE", "PRIMARY", "PRINT", "PRIOR", "PRIVILEGES", "PROC", "PROCEDURAL", "PROCEDURE", "PROCESS", "PROCESSLIST", "PUBLIC", "PURGE", "QUOTE", "RAID0", "RAISERROR", "RANGE", "RANK", "RAW", "READ", "READS", "READTEXT", "REAL", "RECHECK", "RECONFIGURE", "RECURSIVE", "REF", "REFERENCES", "REFERENCING", "REGEXP", "REGR_AVGX", "REGR_AVGY", "REGR_COUNT", "REGR_INTERCEPT", "REGR_R2", "REGR_SLOPE", "REGR_SXX", "REGR_SXY", "REGR_SYY", "REINDEX", "RELATIVE", "RELEASE", "RELOAD", "RENAME", "REPEAT", "REPEATABLE", "REPLACE", "REPLICATION", "REQUIRE", "RESET", "RESIGNAL", "RESOURCE", "RESTART", "RESTORE", "RESTRICT", "RESULT", "RETURN", "RETURNED_CARDINALITY", "RETURNED_LENGTH", "RETURNED_OCTET_LENGTH", "RETURNED_SQLSTATE", "RETURNS", "REVOKE", "RIGHT", "RLIKE", "ROLE", "ROLLBACK", "ROLLUP", "ROUTINE", "ROUTINE_CATALOG", "ROUTINE_NAME", "ROUTINE_SCHEMA", "ROW", "ROW_COUNT", "ROW_NUMBER", "ROWCOUNT", "ROWGUIDCOL", "ROWID", "ROWNUM", "ROWS", "RULE", "SAVE", "SAVEPOINT", "SCALE", "SCHEMA", "SCHEMA_NAME", "SCHEMAS", "SCOPE", "SCOPE_CATALOG", "SCOPE_NAME", "SCOPE_SCHEMA", "SCROLL", "SEARCH", "SECOND", "SECOND_MICROSECOND", "SECTION", "SECURITY", "SELECT", "SELF", "SENSITIVE", "SEPARATOR", "SEQUENCE", "SERIALIZABLE", "SERVER_NAME", "SESSION", "SESSION_USER", "SET", "SETOF", "SETS", "SETUSER", "SHARE", "SHOW", "SHUTDOWN", "SIGNAL", "SIMILAR", "SIMPLE", "SIZE", "SMALLINT", "SOME", "SONAME", "SOURCE", "SPACE", "SPATIAL", "SPECIFIC", "SPECIFIC_NAME", "SPECIFICTYPE", "SQL", "SQL_BIG_RESULT", "SQL_BIG_SELECTS", "SQL_BIG_TABLES", "SQL_CALC_FOUND_ROWS", "SQL_LOG_OFF", "SQL_LOG_UPDATE", "SQL_LOW_PRIORITY_UPDATES", "SQL_SELECT_LIMIT", "SQL_SMALL_RESULT", "SQL_WARNINGS", "SQLCA", "SQLCODE", "SQLERROR", "SQLEXCEPTION", "SQLSTATE", "SQLWARNING", "SQRT", "SSL", "STABLE", "START", "STARTING", "STATE", "STATEMENT", "STATIC", "STATISTICS", "STATUS", "STDDEV_POP", "STDDEV_SAMP", "STDIN", "STDOUT", "STORAGE", "STRAIGHT_JOIN", "STRICT", "STRING", "STRUCTURE", "STYLE", "SUBCLASS_ORIGIN", "SUBLIST", "SUBMULTISET", "SUBSTRING", "SUCCESSFUL", "SUM", "SUPERUSER", "SYMMETRIC", "SYNONYM", "SYSDATE", "SYSID", "SYSTEM", "SYSTEM_USER", "TABLE", "TABLE_NAME", "TABLES", "TABLESAMPLE", "TABLESPACE", "TEMP", "TEMPLATE", "TEMPORARY", "TERMINATE", "TERMINATED", "TEXT", "TEXTSIZE", "THAN", "THEN", "TIES", "TIME", "TIMESTAMP", "TIMEZONE_HOUR", "TIMEZONE_MINUTE", "TINYBLOB", "TINYINT", "TINYTEXT", "TO", "TOAST", "TOP", "TOP_LEVEL_COUNT", "TRAILING", "TRAN", "TRANSACTION", "TRANSACTION_ACTIVE", "TRANSACTIONS_COMMITTED", "TRANSACTIONS_ROLLED_BACK", "TRANSFORM", "TRANSFORMS", "TRANSLATE", "TRANSLATION", "TREAT", "TRIGGER", "TRIGGER_CATALOG", "TRIGGER_NAME", "TRIGGER_SCHEMA", "TRIM", "TRUE", "TRUNCATE", "TRUSTED", "TSEQUAL", "TYPE", "UESCAPE", "UID", "UNBOUNDED", "UNCOMMITTED", "UNDER", "UNDO", "UNENCRYPTED", "UNION", "UNIQUE", "UNKNOWN", "UNLISTEN", "UNLOCK", "UNNAMED", "UNNEST", "UNSIGNED", "UNTIL", "UPDATE", "UPDATETEXT", "UPPER", "USAGE", "USE", "USER", "USER_DEFINED_TYPE_CATALOG", "USER_DEFINED_TYPE_CODE", "USER_DEFINED_TYPE_NAME", "USER_DEFINED_TYPE_SCHEMA", "USING", "UTC_DATE", "UTC_TIME", "UTC_TIMESTAMP", "VACUUM", "VALID", "VALIDATE", "VALIDATOR", "VALUE", "VALUES", "VAR_POP", "VAR_SAMP", "VARBINARY", "VARCHAR", "VARCHAR2", "VARCHARACTER", "VARIABLE", "VARIABLES", "VARYING", "VERBOSE", "VIEW", "VOLATILE", "WAITFOR", "WHEN", "WHENEVER", "WHERE", "WHILE", "WIDTH_BUCKET", "WINDOW", "WITH", "WITHIN", "WITHOUT", "WORK", "WRITE", "WRITETEXT", "X509", "XOR", "YEAR", "YEAR_MONTH", "ZEROFILL", "ZONE"];
-	
-	var operators = ["=", "!=", "<", ">", "<=", ">=", "+", "-", "*", "/", "%"];
-	
-	brush.push(operators, {klass: 'operator'});
-	
-	brush.push(Syntax.lib.sqlStyleComment);
-	
-	brush.push(keywords, {klass: 'keyword', options: 'gi'});
-	
-	// Strings
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-	brush.push(Syntax.lib.stringEscape);
-	
-	// Numbers
-	brush.push(Syntax.lib.decimalNumber);
-	brush.push(Syntax.lib.hexNumber);
-	
-	brush.push(Syntax.lib.webLink);
-});
-
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.lib.sqlStyleComment={pattern:/-- .*$/gm,klass:"comment",allow:["href"]};
+Syntax.register("sql",function(a){a.push("= != < > <= >= + - * / %".split(" "),{klass:"operator"});a.push(Syntax.lib.sqlStyleComment);a.push("A ABORT ABS ABSOLUTE ACCESS ACTION ADA ADD ADMIN AFTER AGGREGATE ALIAS ALL ALLOCATE ALSO ALTER ALWAYS ANALYSE ANALYZE AND ANY ARE ARRAY AS ASC ASENSITIVE ASSERTION ASSIGNMENT ASYMMETRIC AT ATOMIC ATTRIBUTE ATTRIBUTES AUDIT AUTHORIZATION AUTO_INCREMENT AVG AVG_ROW_LENGTH BACKUP BACKWARD BEFORE BEGIN BERNOULLI BETWEEN BIGINT BINARY BIT BIT_LENGTH BITVAR BLOB BOOL BOOLEAN BOTH BREADTH BREAK BROWSE BULK BY C CACHE CALL CALLED CARDINALITY CASCADE CASCADED CASE CAST CATALOG CATALOG_NAME CEIL CEILING CHAIN CHANGE CHAR CHAR_LENGTH CHARACTER CHARACTER_LENGTH CHARACTER_SET_CATALOG CHARACTER_SET_NAME CHARACTER_SET_SCHEMA CHARACTERISTICS CHARACTERS CHECK CHECKED CHECKPOINT CHECKSUM CLASS CLASS_ORIGIN CLOB CLOSE CLUSTER CLUSTERED COALESCE COBOL COLLATE COLLATION COLLATION_CATALOG COLLATION_NAME COLLATION_SCHEMA COLLECT COLUMN COLUMN_NAME COLUMNS COMMAND_FUNCTION COMMAND_FUNCTION_CODE COMMENT COMMIT COMMITTED COMPLETION COMPRESS COMPUTE CONDITION CONDITION_NUMBER CONNECT CONNECTION CONNECTION_NAME CONSTRAINT CONSTRAINT_CATALOG CONSTRAINT_NAME CONSTRAINT_SCHEMA CONSTRAINTS CONSTRUCTOR CONTAINS CONTAINSTABLE CONTINUE CONVERSION CONVERT COPY CORR CORRESPONDING COUNT COVAR_POP COVAR_SAMP CREATE CREATEDB CREATEROLE CREATEUSER CROSS CSV CUBE CUME_DIST CURRENT CURRENT_DATE CURRENT_DEFAULT_TRANSFORM_GROUP CURRENT_PATH CURRENT_ROLE CURRENT_TIME CURRENT_TIMESTAMP CURRENT_TRANSFORM_GROUP_FOR_TYPE CURRENT_USER CURSOR CURSOR_NAME CYCLE DATA DATABASE DATABASES DATE DATETIME DATETIME_INTERVAL_CODE DATETIME_INTERVAL_PRECISION DAY DAY_HOUR DAY_MICROSECOND DAY_MINUTE DAY_SECOND DAYOFMONTH DAYOFWEEK DAYOFYEAR DBCC DEALLOCATE DEC DECIMAL DECLARE DEFAULT DEFAULTS DEFERRABLE DEFERRED DEFINED DEFINER DEGREE DELAY_KEY_WRITE DELAYED DELETE DELIMITER DELIMITERS DENSE_RANK DENY DEPTH DEREF DERIVED DESC DESCRIBE DESCRIPTOR DESTROY DESTRUCTOR DETERMINISTIC DIAGNOSTICS DICTIONARY DISABLE DISCONNECT DISK DISPATCH DISTINCT DISTINCTROW DISTRIBUTED DIV DO DOMAIN DOUBLE DROP DUAL DUMMY DUMP DYNAMIC DYNAMIC_FUNCTION DYNAMIC_FUNCTION_CODE EACH ELEMENT ELSE ELSEIF ENABLE ENCLOSED ENCODING ENCRYPTED END END-EXEC ENUM EQUALS ERRLVL ESCAPE ESCAPED EVERY EXCEPT EXCEPTION EXCLUDE EXCLUDING EXCLUSIVE EXEC EXECUTE EXISTING EXISTS EXIT EXP EXPLAIN EXTERNAL EXTRACT FALSE FETCH FIELDS FILE FILLFACTOR FILTER FINAL FIRST FLOAT FLOAT4 FLOAT8 FLOOR FLUSH FOLLOWING FOR FORCE FOREIGN FORTRAN FORWARD FOUND FREE FREETEXT FREETEXTTABLE FREEZE FROM FULL FULLTEXT FUNCTION FUSION G GENERAL GENERATED GET GLOBAL GO GOTO GRANT GRANTED GRANTS GREATEST GROUP GROUPING HANDLER HAVING HEADER HEAP HIERARCHY HIGH_PRIORITY HOLD HOLDLOCK HOST HOSTS HOUR HOUR_MICROSECOND HOUR_MINUTE HOUR_SECOND IDENTIFIED IDENTITY IDENTITY_INSERT IDENTITYCOL IF IGNORE ILIKE IMMEDIATE IMMUTABLE IMPLEMENTATION IMPLICIT IN INCLUDE INCLUDING INCREMENT INDEX INDICATOR INFILE INFIX INHERIT INHERITS INITIAL INITIALIZE INITIALLY INNER INOUT INPUT INSENSITIVE INSERT INSERT_ID INSTANCE INSTANTIABLE INSTEAD INT INT1 INT2 INT3 INT4 INT8 INTEGER INTERSECT INTERSECTION INTERVAL INTO INVOKER IS ISAM ISNULL ISOLATION ITERATE JOIN K KEY KEY_MEMBER KEY_TYPE KEYS KILL LANCOMPILER LANGUAGE LARGE LAST LAST_INSERT_ID LATERAL LEADING LEAST LEAVE LEFT LENGTH LESS LEVEL LIKE LIMIT LINENO LINES LISTEN LN LOAD LOCAL LOCALTIME LOCALTIMESTAMP LOCATION LOCATOR LOCK LOGIN LOGS LONG LONGBLOB LONGTEXT LOOP LOW_PRIORITY LOWER M MAP MATCH MATCHED MAX MAX_ROWS MAXEXTENTS MAXVALUE MEDIUMBLOB MEDIUMINT MEDIUMTEXT MEMBER MERGE MESSAGE_LENGTH MESSAGE_OCTET_LENGTH MESSAGE_TEXT METHOD MIDDLEINT MIN MIN_ROWS MINUS MINUTE MINUTE_MICROSECOND MINUTE_SECOND MINVALUE MLSLABEL MOD MODE MODIFIES MODIFY MODULE MONTH MONTHNAME MORE MOVE MULTISET MUMPS MYISAM NAMES NATIONAL NATURAL NCHAR NCLOB NESTING NEW NEXT NO NO_WRITE_TO_BINLOG NOAUDIT NOCHECK NOCOMPRESS NOCREATEDB NOCREATEROLE NOCREATEUSER NOINHERIT NOLOGIN NONCLUSTERED NONE NORMALIZE NORMALIZED NOSUPERUSER NOT NOTHING NOTIFY NOTNULL NOWAIT NULL NULLABLE NULLIF NULLS NUMBER NUMERIC OBJECT OCTET_LENGTH OCTETS OF OFF OFFLINE OFFSET OFFSETS OIDS OLD ON ONLINE ONLY OPEN OPENDATASOURCE OPENQUERY OPENROWSET OPENXML OPERATION OPERATOR OPTIMIZE OPTION OPTIONALLY OPTIONS OR ORDER ORDERING ORDINALITY OTHERS OUT OUTER OUTFILE OUTPUT OVER OVERLAPS OVERLAY OVERRIDING OWNER PACK_KEYS PAD PARAMETER PARAMETER_MODE PARAMETER_NAME PARAMETER_ORDINAL_POSITION PARAMETER_SPECIFIC_CATALOG PARAMETER_SPECIFIC_NAME PARAMETER_SPECIFIC_SCHEMA PARAMETERS PARTIAL PARTITION PASCAL PASSWORD PATH PCTFREE PERCENT PERCENT_RANK PERCENTILE_CONT PERCENTILE_DISC PLACING PLAN PLI POSITION POSTFIX POWER PRECEDING PRECISION PREFIX PREORDER PREPARE PREPARED PRESERVE PRIMARY PRINT PRIOR PRIVILEGES PROC PROCEDURAL PROCEDURE PROCESS PROCESSLIST PUBLIC PURGE QUOTE RAID0 RAISERROR RANGE RANK RAW READ READS READTEXT REAL RECHECK RECONFIGURE RECURSIVE REF REFERENCES REFERENCING REGEXP REGR_AVGX REGR_AVGY REGR_COUNT REGR_INTERCEPT REGR_R2 REGR_SLOPE REGR_SXX REGR_SXY REGR_SYY REINDEX RELATIVE RELEASE RELOAD RENAME REPEAT REPEATABLE REPLACE REPLICATION REQUIRE RESET RESIGNAL RESOURCE RESTART RESTORE RESTRICT RESULT RETURN RETURNED_CARDINALITY RETURNED_LENGTH RETURNED_OCTET_LENGTH RETURNED_SQLSTATE RETURNS REVOKE RIGHT RLIKE ROLE ROLLBACK ROLLUP ROUTINE ROUTINE_CATALOG ROUTINE_NAME ROUTINE_SCHEMA ROW ROW_COUNT ROW_NUMBER ROWCOUNT ROWGUIDCOL ROWID ROWNUM ROWS RULE SAVE SAVEPOINT SCALE SCHEMA SCHEMA_NAME SCHEMAS SCOPE SCOPE_CATALOG SCOPE_NAME SCOPE_SCHEMA SCROLL SEARCH SECOND SECOND_MICROSECOND SECTION SECURITY SELECT SELF SENSITIVE SEPARATOR SEQUENCE SERIALIZABLE SERVER_NAME SESSION SESSION_USER SET SETOF SETS SETUSER SHARE SHOW SHUTDOWN SIGNAL SIMILAR SIMPLE SIZE SMALLINT SOME SONAME SOURCE SPACE SPATIAL SPECIFIC SPECIFIC_NAME SPECIFICTYPE SQL SQL_BIG_RESULT SQL_BIG_SELECTS SQL_BIG_TABLES SQL_CALC_FOUND_ROWS SQL_LOG_OFF SQL_LOG_UPDATE SQL_LOW_PRIORITY_UPDATES SQL_SELECT_LIMIT SQL_SMALL_RESULT SQL_WARNINGS SQLCA SQLCODE SQLERROR SQLEXCEPTION SQLSTATE SQLWARNING SQRT SSL STABLE START STARTING STATE STATEMENT STATIC STATISTICS STATUS STDDEV_POP STDDEV_SAMP STDIN STDOUT STORAGE STRAIGHT_JOIN STRICT STRING STRUCTURE STYLE SUBCLASS_ORIGIN SUBLIST SUBMULTISET SUBSTRING SUCCESSFUL SUM SUPERUSER SYMMETRIC SYNONYM SYSDATE SYSID SYSTEM SYSTEM_USER TABLE TABLE_NAME TABLES TABLESAMPLE TABLESPACE TEMP TEMPLATE TEMPORARY TERMINATE TERMINATED TEXT TEXTSIZE THAN THEN TIES TIME TIMESTAMP TIMEZONE_HOUR TIMEZONE_MINUTE TINYBLOB TINYINT TINYTEXT TO TOAST TOP TOP_LEVEL_COUNT TRAILING TRAN TRANSACTION TRANSACTION_ACTIVE TRANSACTIONS_COMMITTED TRANSACTIONS_ROLLED_BACK TRANSFORM TRANSFORMS TRANSLATE TRANSLATION TREAT TRIGGER TRIGGER_CATALOG TRIGGER_NAME TRIGGER_SCHEMA TRIM TRUE TRUNCATE TRUSTED TSEQUAL TYPE UESCAPE UID UNBOUNDED UNCOMMITTED UNDER UNDO UNENCRYPTED UNION UNIQUE UNKNOWN UNLISTEN UNLOCK UNNAMED UNNEST UNSIGNED UNTIL UPDATE UPDATETEXT UPPER USAGE USE USER USER_DEFINED_TYPE_CATALOG USER_DEFINED_TYPE_CODE USER_DEFINED_TYPE_NAME USER_DEFINED_TYPE_SCHEMA USING UTC_DATE UTC_TIME UTC_TIMESTAMP VACUUM VALID VALIDATE VALIDATOR VALUE VALUES VAR_POP VAR_SAMP VARBINARY VARCHAR VARCHAR2 VARCHARACTER VARIABLE VARIABLES VARYING VERBOSE VIEW VOLATILE WAITFOR WHEN WHENEVER WHERE WHILE WIDTH_BUCKET WINDOW WITH WITHIN WITHOUT WORK WRITE WRITETEXT X509 XOR YEAR YEAR_MONTH ZEROFILL ZONE".split(" "),{klass:"keyword",
+options:"gi"});a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString);a.push(Syntax.lib.stringEscape);a.push(Syntax.lib.decimalNumber);a.push(Syntax.lib.hexNumber);a.push(Syntax.lib.webLink)});

data/docs/_components/jquery-syntax/jquery.syntax.brush.super-collider.js

@@ -1,57 +1,3 @@
-// brush: "super-collider" aliases: ["sc"]
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.register('super-collider', function(brush) {
-	var keywords = ["const", "arg", "classvar", "var"];
-	brush.push(keywords, {klass: 'keyword'});
-	
-	var operators = ["`", "+", "@", ":", "*", "/", "-", "&", "|", "~", "!", "%", "<", "=", ">"];
-	brush.push(operators, {klass: 'operator'});
-	
-	var values = ["thisFunctionDef", "thisFunction", "thisMethod", "thisProcess", "thisThread", "this", "super", "true", "false", "nil", "inf"];
-	brush.push(values, {klass: 'constant'});
-	
-	brush.push(Syntax.lib.camelCaseType);
-	
-	// Single Characters
-	brush.push({
-		pattern: /\$(\\)?./g,
-		klass: "constant"
-	});
-	
-	// Symbols
-	brush.push({
-		pattern: /\\[a-z_][a-z0-9_]*/gi,
-		klass: "symbol"
-	});
-	
-	brush.push({
-		pattern: /'[^']+'/g,
-		klass: "symbol"
-	});
-	
-	// Comments
-	brush.push(Syntax.lib.cStyleComment);
-	brush.push(Syntax.lib.cppStyleComment);
-	brush.push(Syntax.lib.webLink);
-	
-	// Strings
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-	brush.push(Syntax.lib.stringEscape);
-	
-	// Numbers
-	brush.push(Syntax.lib.decimalNumber);
-	brush.push(Syntax.lib.hexNumber);
-	
-	// Functions
-	brush.push({
-		pattern: /(?:\.)([a-z_][a-z0-9_]*)/gi, 
-		matches: Syntax.extractMatches({klass: 'function'})
-	});
-	
-	brush.push(Syntax.lib.cStyleFunction);
-});
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.register("super-collider",function(a){a.push(["const","arg","classvar","var"],{klass:"keyword"});a.push("`+@:*/-&|~!%<=>".split(""),{klass:"operator"});a.push("thisFunctionDef thisFunction thisMethod thisProcess thisThread this super true false nil inf".split(" "),{klass:"constant"});a.push(Syntax.lib.camelCaseType);a.push({pattern:/\$(\\)?./g,klass:"constant"});a.push({pattern:/\\[a-z_][a-z0-9_]*/gi,klass:"symbol"});a.push({pattern:/'[^']+'/g,klass:"symbol"});a.push(Syntax.lib.cStyleComment);
+a.push(Syntax.lib.cppStyleComment);a.push(Syntax.lib.webLink);a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString);a.push(Syntax.lib.stringEscape);a.push(Syntax.lib.decimalNumber);a.push(Syntax.lib.hexNumber);a.push({pattern:/(?:\.)([a-z_][a-z0-9_]*)/gi,matches:Syntax.extractMatches({klass:"function"})});a.push(Syntax.lib.cStyleFunction)});

data/docs/_components/jquery-syntax/jquery.syntax.brush.swift.js

@@ -1,55 +1,3 @@
-// brush: "swift" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2016 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.register('swift', function(brush) {
-	var keywords = [
-		"associatedtype", "class", "deinit", "enum", "extension", "fileprivate", "func", "import", "init", "inout", "internal", "let", "operator", "private", "protocol", "static", "struct", "subscript", "typealias", "var", "break", "case", "continue", "default", "defer", "do", "else", "fallthrough", "for", "guard", "if", "in", "repeat", "return", "switch", "where", "while", "as", "catch", "is", "rethrows", "throw", "throws", "try", "_", "#available", "#colorLiteral", "#column", "#else", "#elseif", "#endif", "#file", "#fileLiteral", "#function", "#if", "#imageLiteral", "#line", "#selector", "#sourceLocation", "associativity", "convenience", "dynamic", "didSet", "final", "get", "infix", "indirect", "lazy", "left", "mutating", "none", "nonmutating", "optional", "override", "postfix", "precedence", "prefix", "Protocol", "required", "right", "set", "Type", "unowned", "weak", "willSet"];
-		
-	var operators = ["+", "*", "/", "-", "&", "|", "~", "!", "%", "<", "=", ">",
-		"(", ")", "{", "}", "[", "]", ".", ",", ":", ";", "=", "@", "#", "->", "`", "?", "!"];
-		
-	var values = ["self", "super", "true", "false", "nil"];
-	
-	var access = ["fileprivate", "open", "private", "public"];
-	
-	brush.push(access, {klass: 'access'});
-	brush.push(values, {klass: 'constant'});
-	
-	brush.push({
-		pattern: /`[^`]+`/g,
-		klass: 'identifier'
-	});
-	
-	brush.push({
-		pattern: /\\\(([^)]*)\)/g,
-		matches: Syntax.extractMatches({
-			brush: 'swift',
-			only: ['string']
-		})
-	});
-	
-	brush.push(Syntax.lib.camelCaseType);
-	brush.push(keywords, {klass: 'keyword'});
-	brush.push(operators, {klass: 'operator'});
-	
-	// Comments
-	brush.push(Syntax.lib.cStyleComment);
-	brush.push(Syntax.lib.cppStyleComment);
-	brush.push(Syntax.lib.webLink);
-	
-	// Strings
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-	brush.push(Syntax.lib.stringEscape);
-	
-	// Numbers
-	brush.push(Syntax.lib.decimalNumber);
-	brush.push(Syntax.lib.hexNumber);
-	
-	// Functions
-	brush.push(Syntax.lib.cStyleFunction);
-});
-
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.register("swift",function(a){a.push(["fileprivate","open","private","public"],{klass:"access"});a.push(["self","super","true","false","nil"],{klass:"constant"});a.push({pattern:/`[^`]+`/g,klass:"identifier"});a.push({pattern:/\\\(([^)]*)\)/g,matches:Syntax.extractMatches({brush:"swift",only:["string"]})});a.push(Syntax.lib.camelCaseType);a.push("associatedtype class deinit enum extension fileprivate func import init inout internal let operator private protocol static struct subscript typealias var break case continue default defer do else fallthrough for guard if in repeat return switch where while as catch is rethrows throw throws try _ #available #colorLiteral #column #else #elseif #endif #file #fileLiteral #function #if #imageLiteral #line #selector #sourceLocation associativity convenience dynamic didSet final get infix indirect lazy left mutating none nonmutating optional override postfix precedence prefix Protocol required right set Type unowned weak willSet".split(" "),
+{klass:"keyword"});a.push("+ * / - & | ~ ! % < = > ( ) { } [ ] . , : ; = @ # -> ` ? !".split(" "),{klass:"operator"});a.push(Syntax.lib.cStyleComment);a.push(Syntax.lib.cppStyleComment);a.push(Syntax.lib.webLink);a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString);a.push(Syntax.lib.stringEscape);a.push(Syntax.lib.decimalNumber);a.push(Syntax.lib.hexNumber);a.push(Syntax.lib.cStyleFunction)});

data/docs/_components/jquery-syntax/jquery.syntax.brush.trenni.js

@@ -1,35 +1,2 @@
-// brush: "html" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.brushes.dependency('trenni', 'xml');
-Syntax.brushes.dependency('trenni', 'ruby');
-
-Syntax.register('trenni', function(brush) {
-	brush.push({
-		pattern: /((<\?r)([\s\S]*?)(\?>))/gm,
-		matches: Syntax.extractMatches(
-			{klass: 'ruby-tag', allow: ['keyword', 'ruby']},
-			{klass: 'keyword'},
-			{brush: 'ruby'},
-			{klass: 'keyword'}
-		)
-	});
-	
-	brush.push({
-		pattern: /((#{)([\s\S]*?)(}))/gm,
-		matches: Syntax.extractMatches(
-			{klass: 'ruby-tag', allow: ['keyword', 'ruby']},
-			{klass: 'keyword'},
-			{brush: 'ruby'},
-			{klass: 'keyword'}
-		)
-	});
-	
-	// The position of this statement is important - it determines at what point the rules of the parent are processed.
-	// In this case, the rules for xml are processed after the rules for html.
-	brush.derives('xml');
-});
-
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.brushes.dependency("trenni","xml");Syntax.brushes.dependency("trenni","ruby");Syntax.register("trenni",function(a){a.push({pattern:/((<\?r)([\s\S]*?)(\?>))/gm,matches:Syntax.extractMatches({klass:"ruby-tag",allow:["keyword","ruby"]},{klass:"keyword"},{brush:"ruby"},{klass:"keyword"})});a.push({pattern:/((#{)([\s\S]*?)(}))/gm,matches:Syntax.extractMatches({klass:"ruby-tag",allow:["keyword","ruby"]},{klass:"keyword"},{brush:"ruby"},{klass:"keyword"})});a.derives("xml")});

data/docs/_components/jquery-syntax/jquery.syntax.brush.xml.js

@@ -1,50 +1,4 @@
-// brush: "xml" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.lib.xmlEntity = {pattern: /&\w+;/g, klass: 'entity'};
-Syntax.lib.xmlPercentEscape = {pattern: /(%[0-9a-f]{2})/gi, klass: 'percent-escape', only: ['string']};
-
-Syntax.register('xml-tag', function(brush) {
-	brush.push({
-		pattern: /<\/?((?:[^:\s>]+:)?)([^\s>]+)(\s[^>]*)?\/?>/g,
-		matches: Syntax.extractMatches({klass: 'namespace'}, {klass: 'tag-name'})
-	});
-	
-	brush.push({
-		pattern: /([^=\s]+)=(".*?"|'.*?'|[^\s>]+)/g,
-		matches: Syntax.extractMatches({klass: 'attribute', only: ['tag']}, {klass: 'string', only: ['tag']})
-	});
-	
-	brush.push(Syntax.lib.xmlEntity);
-	brush.push(Syntax.lib.xmlPercentEscape);
-	
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-});
-
-Syntax.register('xml', function(brush) {
-	brush.push({
-		pattern: /(<!(\[CDATA\[)([\s\S]*?)(\]\])>)/gm,
-		matches: Syntax.extractMatches(
-			{klass: 'cdata', allow: ['cdata-content', 'cdata-tag']},
-			{klass: 'cdata-tag'},
-			{klass: 'cdata-content'},
-			{klass: 'cdata-tag'}
-		)
-	});
-	
-	brush.push(Syntax.lib.xmlComment);
-	
-	brush.push({
-		pattern: /<[^>\-\s]([^>'"!\/;\?@\[\]^`\{\}\|]|"[^"]*"|'[^']')*[\/?]?>/g,
-		brush: 'xml-tag'
-	});
-	
-	brush.push(Syntax.lib.xmlEntity);
-	brush.push(Syntax.lib.xmlPercentEscape);
-	
-	brush.push(Syntax.lib.webLink);
-});
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.lib.xmlEntity={pattern:/&\w+;/g,klass:"entity"};Syntax.lib.xmlPercentEscape={pattern:/(%[0-9a-f]{2})/gi,klass:"percent-escape",only:["string"]};
+Syntax.register("xml-tag",function(a){a.push({pattern:/<\/?((?:[^:\s>]+:)?)([^\s>]+)(\s[^>]*)?\/?>/g,matches:Syntax.extractMatches({klass:"namespace"},{klass:"tag-name"})});a.push({pattern:/([^=\s]+)=(".*?"|'.*?'|[^\s>]+)/g,matches:Syntax.extractMatches({klass:"attribute",only:["tag"]},{klass:"string",only:["tag"]})});a.push(Syntax.lib.xmlEntity);a.push(Syntax.lib.xmlPercentEscape);a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString)});
+Syntax.register("xml",function(a){a.push({pattern:/(<!(\[CDATA\[)([\s\S]*?)(\]\])>)/gm,matches:Syntax.extractMatches({klass:"cdata",allow:["cdata-content","cdata-tag"]},{klass:"cdata-tag"},{klass:"cdata-content"},{klass:"cdata-tag"})});a.push(Syntax.lib.xmlComment);a.push({pattern:/<[^>\-\s]([^>'"!\/;\?@\[\]^`\{\}\|]|"[^"]*"|'[^']')*[\/?]?>/g,brush:"xml-tag"});a.push(Syntax.lib.xmlEntity);a.push(Syntax.lib.xmlPercentEscape);a.push(Syntax.lib.webLink)});

data/docs/_components/jquery-syntax/jquery.syntax.brush.yaml.js

@@ -1,29 +1,2 @@
-// brush: "yaml" aliases: []
-
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-Syntax.register('yaml', function(brush) {
-	brush.push({
-		pattern: /^\s*#.*$/gm,
-		klass: 'comment',
-		allow: ['href']
-	});
-	
-	brush.push(Syntax.lib.singleQuotedString);
-	brush.push(Syntax.lib.doubleQuotedString);
-	
-	brush.push({
-		pattern: /(&|\*)[a-z0-9]+/gi,
-		klass: 'constant'
-	});
-	
-	brush.push({
-		pattern: /(.*?):/gi,
-		matches: Syntax.extractMatches({klass: 'keyword'})
-	});
-	
-	brush.push(Syntax.lib.webLink);
-});
-
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.register("yaml",function(a){a.push({pattern:/^\s*#.*$/gm,klass:"comment",allow:["href"]});a.push(Syntax.lib.singleQuotedString);a.push(Syntax.lib.doubleQuotedString);a.push({pattern:/(&|\*)[a-z0-9]+/gi,klass:"constant"});a.push({pattern:/(.*?):/gi,matches:Syntax.extractMatches({klass:"keyword"})});a.push(Syntax.lib.webLink)});

data/docs/_components/jquery-syntax/jquery.syntax.cache.js

@@ -1,65 +1,7 @@
-// This file is automatically generated. Any changes may be lost.
-// The following declarations describes all resources that might be loaded dynamically.
-
-// Brush Aliases
-Syntax.alias("apache", []);
-Syntax.alias("applescript", []);
-Syntax.alias("assembly", ["asm"]);
-Syntax.alias("bash-script", []);
-Syntax.alias("bash", []);
-Syntax.alias("basic", ['vb']);
-Syntax.alias("clang", ["cpp", "c++", "c", "objective-c"]);
-Syntax.alias("csharp", ["c-sharp", "c#"]);
-Syntax.alias("css", []);
-Syntax.alias("diff", ["patch"]);
-Syntax.alias("go", []);
-Syntax.alias("haskell", []);
-Syntax.alias("html", []);
-Syntax.alias("io", []);
-Syntax.alias("java", []);
-Syntax.alias("javascript", ["js", "actionscript"]);
-Syntax.alias("kai", []);
-Syntax.alias("lisp", ['scheme', 'clojure']);
-Syntax.alias("lua", []);
-Syntax.alias("nginx", []);
-Syntax.alias("ocaml", ["ml", "sml", "fsharp"]);
-Syntax.alias("ooc", []);
-Syntax.alias("pascal", ["delphi"]);
-Syntax.alias("perl5", []);
-Syntax.alias("php-script", []);
-Syntax.alias("php", []);
-Syntax.alias("plain", ["text"]);
-Syntax.alias("protobuf", []);
-Syntax.alias("python", []);
-Syntax.alias("ruby", []);
-Syntax.alias("scala", []);
-Syntax.alias("smalltalk", []);
-Syntax.alias("sql", []);
-Syntax.alias("super-collider", ["sc"]);
-Syntax.alias("swift", []);
-Syntax.alias("html", []);
-Syntax.alias("xml", []);
-Syntax.alias("yaml", []);
-
-// CSS Extensions
-Syntax.styles["jquery.syntax.brush.apache"] = ["base/jquery.syntax.brush.apache.css"];
-Syntax.styles["jquery.syntax.brush.applescript"] = ["base/jquery.syntax.brush.applescript.css"];
-Syntax.styles["jquery.syntax.brush.assembly"] = ["base/jquery.syntax.brush.assembly.css"];
-Syntax.styles["jquery.syntax.brush.bash-script"] = ["base/jquery.syntax.brush.bash-script.css"];
-Syntax.styles["jquery.syntax.brush.bash"] = ["base/jquery.syntax.brush.bash.css"];
-Syntax.styles["jquery.syntax.brush.clang"] = ["base/jquery.syntax.brush.clang.css"];
-Syntax.styles["jquery.syntax.brush.css"] = ["base/jquery.syntax.brush.css.css"];
-Syntax.styles["jquery.syntax.brush.diff"] = ["base/jquery.syntax.brush.diff.css"];
-Syntax.styles["jquery.syntax.brush.html"] = ["base/jquery.syntax.brush.html.css"];
-Syntax.styles["jquery.syntax.brush.ocaml"] = ["base/jquery.syntax.brush.ocaml.css"];
-Syntax.styles["jquery.syntax.brush.protobuf"] = ["base/jquery.syntax.brush.protobuf.css"];
-Syntax.styles["jquery.syntax.brush.python"] = ["base/jquery.syntax.brush.python.css"];
-Syntax.styles["jquery.syntax.brush.ruby"] = ["base/jquery.syntax.brush.ruby.css"];
-Syntax.styles["jquery.syntax.brush.xml"] = ["base/jquery.syntax.brush.xml.css"];
-Syntax.styles["jquery.syntax.core"] = ["base/jquery.syntax.core.css", "bright/jquery.syntax.core.css", "paper/jquery.syntax.core.css"];
-Syntax.styles["jquery.syntax.editor"] = ["base/jquery.syntax.editor.css"];
-
-// Theme Configuration
-Syntax.themes["base"] = []
-Syntax.themes["bright"] = ["base"]
-Syntax.themes["paper"] = ["base"]
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+Syntax.alias("apache",[]);Syntax.alias("applescript",[]);Syntax.alias("assembly",["asm"]);Syntax.alias("bash-script",[]);Syntax.alias("bash",[]);Syntax.alias("basic",["vb"]);Syntax.alias("clang",["cpp","c++","c","objective-c"]);Syntax.alias("csharp",["c-sharp","c#"]);Syntax.alias("css",[]);Syntax.alias("diff",["patch"]);Syntax.alias("go",[]);Syntax.alias("haskell",[]);Syntax.alias("html",[]);Syntax.alias("io",[]);Syntax.alias("java",[]);Syntax.alias("javascript",["js","actionscript"]);
+Syntax.alias("kai",[]);Syntax.alias("lisp",["scheme","clojure"]);Syntax.alias("lua",[]);Syntax.alias("nginx",[]);Syntax.alias("ocaml",["ml","sml","fsharp"]);Syntax.alias("ooc",[]);Syntax.alias("pascal",["delphi"]);Syntax.alias("perl5",[]);Syntax.alias("php-script",[]);Syntax.alias("php",[]);Syntax.alias("plain",["text"]);Syntax.alias("protobuf",[]);Syntax.alias("python",[]);Syntax.alias("ruby",[]);Syntax.alias("scala",[]);Syntax.alias("smalltalk",[]);Syntax.alias("sql",[]);
+Syntax.alias("super-collider",["sc"]);Syntax.alias("swift",[]);Syntax.alias("html",[]);Syntax.alias("xml",[]);Syntax.alias("yaml",[]);Syntax.styles["jquery.syntax.brush.apache"]=["base/jquery.syntax.brush.apache.css"];Syntax.styles["jquery.syntax.brush.applescript"]=["base/jquery.syntax.brush.applescript.css"];Syntax.styles["jquery.syntax.brush.assembly"]=["base/jquery.syntax.brush.assembly.css"];Syntax.styles["jquery.syntax.brush.bash-script"]=["base/jquery.syntax.brush.bash-script.css"];
+Syntax.styles["jquery.syntax.brush.bash"]=["base/jquery.syntax.brush.bash.css"];Syntax.styles["jquery.syntax.brush.clang"]=["base/jquery.syntax.brush.clang.css"];Syntax.styles["jquery.syntax.brush.css"]=["base/jquery.syntax.brush.css.css"];Syntax.styles["jquery.syntax.brush.diff"]=["base/jquery.syntax.brush.diff.css"];Syntax.styles["jquery.syntax.brush.html"]=["base/jquery.syntax.brush.html.css"];Syntax.styles["jquery.syntax.brush.ocaml"]=["base/jquery.syntax.brush.ocaml.css"];
+Syntax.styles["jquery.syntax.brush.protobuf"]=["base/jquery.syntax.brush.protobuf.css"];Syntax.styles["jquery.syntax.brush.python"]=["base/jquery.syntax.brush.python.css"];Syntax.styles["jquery.syntax.brush.ruby"]=["base/jquery.syntax.brush.ruby.css"];Syntax.styles["jquery.syntax.brush.xml"]=["base/jquery.syntax.brush.xml.css"];Syntax.styles["jquery.syntax.core"]=["base/jquery.syntax.core.css","bright/jquery.syntax.core.css","paper/jquery.syntax.core.css"];Syntax.styles["jquery.syntax.editor"]=["base/jquery.syntax.editor.css"];
+Syntax.themes.base=[];Syntax.themes.bright=["base"];Syntax.themes.paper=["base"];

data/docs/_components/jquery-syntax/jquery.syntax.core.js

@@ -1,1098 +1,34 @@
-//	This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
-//	Copyright (c) 2011 Samuel G. D. Williams. <http://www.oriontransfer.co.nz>
-//	See <jquery.syntax.js> for licensing details.
-
-if (!RegExp.prototype.indexOf) {
-	RegExp.indexOf = function (match, index) {
-		return match[0].indexOf(match[index]) + match.index;
-	};
-}
-
-if (!RegExp.prototype.escape) {
-	RegExp.escape = function (pattern) {
-		return pattern.replace(/[\-\[\]{}()*+?.\\\^$|,#\s]/g, "\\$&");
-	};
-}
-
-if (!String.prototype.repeat) {
-	String.prototype.repeat = function(l) {
-		return new Array(l+1).join(this);
-	};
-}
-
-// Return the inner text of an element - must preserve whitespace.
-// Avoid returning \r characters.
-Syntax.innerText = function(element) {
-	var text;
-	
-	if (!element) {
-		return "";
-	}
-	
-	if (element.nodeName == 'BR') {
-		return '\n';
-	} else if (element.textContent) {
-		// W3C: FF, Safari, Chrome, etc.
-		text = element.textContent;
-	} else if (document.body.innerText) {
-		// IE, other older browsers.
-		text = element.innerText;
-	}
-	
-	return text.replace(/\r\n?/g, '\n');
-}
-
-// Convert to stack based implementation
-Syntax.extractElementMatches = function (elems, offset) {
-	var matches = [], current = [elems];
-	offset = offset || 0;
-	
-	(function (elems) {
-		for (var i = 0; elems[i]; i++) {
-			var text = null, elem = elems[i];
-			
-			if (elem.nodeType === 3 || elem.nodeType === 4) {
-				offset += elem.nodeValue.length;
-			
-			} else if (elem.nodeType === 1) {
-				var text = Syntax.innerText(elem);
-				
-				matches.push(new Syntax.Match(offset, text.length, {
-					klass: elem.className,
-					force: true,
-					element: elem,
-					allow: '*'
-				}, text));
-			}
-			
-			// Traverse everything, except comment nodes
-			if (elem.nodeType !== 8 && elem.children) {
-				arguments.callee(elem.childNodes, offset);
-			}
-		}
-	})(elems);
-	
-	// Remove the top level element, since this will be recreated based on the supplied configuration.
-	// Maybe there is a better way to achieve this?
-	matches.shift();
-	
-	return matches;
-}
-
-// A helper function which automatically matches expressions with capture groups from the regular expression match.
-// Each argument position corresponds to the same index regular expression group.
-// Or, override by providing rule.index
-Syntax.extractMatches = function() {
-	var rules = arguments;
-	
-	return function(match, expr) {
-		var matches = [];
-		
-		for (var i = 0; i < rules.length; i += 1) {
-			var rule = rules[i], index = i+1;
-			
-			if (rule == null) {
-				continue;
-			}
-			
-			if (typeof(rule.index) != 'undefined') {
-				index = rule.index;
-			}
-			
-			if (rule.debug) {
-				console.log("extractMatches", rule, index, match[index], match);
-			}
-			
-			if (match[index].length > 0) {
-				if (rule.brush) {
-					matches.push(Syntax.Brush.buildTree(rule, match[index], RegExp.indexOf(match, index)));
-				} else {
-					var expression = jQuery.extend({owner: expr.owner}, rule);
-					
-					matches.push(new Syntax.Match(RegExp.indexOf(match, index), match[index].length, expression, match[index]));
-				}
-			}
-		}
-		
-		return matches;
-	};
-};
-
-// Used to create processing functions that automatically link to remote documentation.
-Syntax.lib.webLinkProcess = function (queryURI, lucky) {
-	if (lucky) {
-		queryURI = "http://www.google.com/search?btnI=I&q=" + encodeURIComponent(queryURI + " ");
-	}
-	
-	return function (element, match, options) {
-		// Per-code block linkification control.
-		if (options.linkify === false)
-			return element;
-		
-		var a = document.createElement('a');
-		a.href = queryURI + encodeURIComponent(Syntax.innerText(element));
-		a.className = element.className;
-		
-		// Move children from <element> to <a>
-		while (element.childNodes.length > 0)
-			a.appendChild(element.childNodes[0]);
-		
-		return a;
-	};
-};
-
-// Global brush registration function.
-Syntax.register = function (name, callback) {
-	var brush = Syntax.brushes[name] = new Syntax.Brush();
-	brush.klass = name;
-	
-	callback(brush);
-};
-
-// Library of helper patterns
-Syntax.lib.cStyleComment = {pattern: /\/\*[\s\S]*?\*\//gm, klass: 'comment', allow: ['href']};
-Syntax.lib.cppStyleComment = {pattern: /\/\/.*$/gm, klass: 'comment', allow: ['href']};
-Syntax.lib.perlStyleComment = {pattern: /#.*$/gm, klass: 'comment', allow: ['href']};
-
-// A hackity hack:
-Syntax.lib.perlStyleRegularExpression = {pattern: /\B\/([^\\\/]|\\.)*\/[a-z]*(?=\s*($|[^\w\s'"\(]))/gm, klass: 'constant', incremental: true};
-Syntax.lib.rubyStyleRegularExpression = {pattern: /\B\/([^\\\/]|\\.)*\/[a-z]*(?=\s*($|[^\w\s'"\(]|do))/gm, klass: 'constant', incremental: true};
-
-Syntax.lib.cStyleFunction = {pattern: /([a-z_][a-z0-9_]*)\s*\(/gi, matches: Syntax.extractMatches({klass: 'function'})};
-Syntax.lib.camelCaseType = {pattern: /\b_*[A-Z][\w]*\b/g, klass: 'type'};
-Syntax.lib.cStyleType = {pattern: /\b[_a-z][_\w]*_t\b/gi, klass: 'type'};
-
-Syntax.lib.xmlComment = {pattern: /(&lt;|<)!--[\s\S]*?--(&gt;|>)/gm, klass: 'comment'};
-Syntax.lib.webLink = {pattern: /\w+:\/\/[\w\-.\/?%&=@:;#]*/g, klass: 'href'};
-
-Syntax.lib.hexNumber = {pattern: /\b0x[0-9a-fA-F]+/g, klass: 'constant'};
-Syntax.lib.decimalNumber = {pattern: /\b[-+]?[0-9]*\.?[0-9]+([eE][-+]?[0-9]+)?/g, klass: 'constant'};
-
-Syntax.lib.doubleQuotedString = {pattern: /"([^\\"\n]|\\.)*"/g, klass: 'string'};
-Syntax.lib.singleQuotedString = {pattern: /'([^\\'\n]|\\.)*'/g, klass: 'string'};
-Syntax.lib.multiLineDoubleQuotedString = {pattern: /"([^\\"]|\\.)*"/g, klass: 'string'};
-Syntax.lib.multiLineSingleQuotedString = {pattern: /'([^\\']|\\.)*'/g, klass: 'string'};
-Syntax.lib.stringEscape = {pattern: /\\./g, klass: 'escape', only: ['string']};
-
-// Main match constructor. Make sure value is the correct size.
-Syntax.Match = function (offset, length, expression, value) {
-	this.offset = offset;
-	this.endOffset = offset + length;
-	this.length = length;
-	this.expression = expression;
-	this.value = value;
-	this.children = [];
-	this.parent = null;
-	
-	// When a node is bisected, this points to the next part.
-	this.next = null;
-};
-
-// Shifts an entire tree forward or backwards.
-Syntax.Match.prototype.shift = function (offset, text) {
-	this.adjust(offset, null, text);
-	
-	for (var i = 0; i < this.children.length; i++) {
-		this.children[i].shift(offset, text)
-	}
-};
-
-// C the current match to have different offset and length.
-Syntax.Match.prototype.adjust = function (offset, length, text) {
-	this.offset += offset;
-	this.endOffset += offset;
-	
-	if (length) {
-		this.length = length;
-		this.endOffset = this.offset + length;
-	}
-	
-	if (text) {
-		this.value = text.substr(this.offset, this.length);
-	}
-};
-
-// Sort helper for sorting matches in forward order (e.g. same as the text that they were extracted from)
-Syntax.Match.sort = function (a,b) {
-	return (a.offset - b.offset) || (b.length - a.length);
-};
-
-// Is the given match contained in the range of the parent match?
-Syntax.Match.prototype.contains = function (match) {
-	return (match.offset >= this.offset) && (match.endOffset <= this.endOffset);
-};
-
-// Reduce a givent tree node into an html node.
-Syntax.Match.defaultReduceCallback = function (node, container) {
-	// We avoid using jQuery in this function since it is incredibly performance sensitive.
-	// Using jQuery jQuery.fn.append() can reduce performance by as much as 1/3rd.
-	if (typeof(node) === 'string') {
-		node = document.createTextNode(node);
-	}
-	
-	container.appendChild(node);
-};
-
-// Convert a tree of matches into some flat form (typically HTML nodes).
-Syntax.Match.prototype.reduce = function (append, process) {
-	var start = this.offset;
-	var container = document.createElement('span');
-	
-	append = append || Syntax.Match.defaultReduceCallback;
-	
-	if (this.expression && this.expression.klass) {
-		if (container.className.length > 0)
-			container.className += ' ';
-		
-		container.className += this.expression.klass;
-	}
-	
-	if (this.className) {
-		container.className += ' ';
-		container.className += this.className;
-	}
-	
-	for (var i = 0; i < this.children.length; i += 1) {
-		var child = this.children[i], end = child.offset;
-		
-		if (child.offset < this.offset) {
-			console.log("Syntax Warning: Offset of child", child, "is before offset of parent", this);
-		}
-		
-		var text = this.value.substr(start - this.offset, end - start);
-		
-		append(text, container);
-		append(child.reduce(append, process), container);
-		
-		start = child.endOffset;
-	}
-	
-	if (start === this.offset) {
-		append(this.value, container);
-	} else if (start < this.endOffset) {
-		append(this.value.substr(start - this.offset, this.endOffset - start), container);
-	} else if (start > this.endOffset) {
-		console.log("Syntax Warning: Start position " + start + " exceeds end of value " + this.endOffset);
-	}
-	
-	if (process) {
-		container = process(container, this);
-	}
-	
-	return container;
-};
-
-// Main nesting check - can a match contain the given match?
-Syntax.Match.prototype.canContain = function (match) {
-	// This is a special conditional for explicitly added ranges by the user.
-	// Since user added it, we honour it no matter what.
-	if (match.expression.force) {
-		return true;
-	}
-	
-	// Can't add anything into complete trees.
-	if (this.complete) {
-		return false;
-	}
-	
-	// match.expression.only will be checked on insertion using this.canHaveChild(match)
-	if (match.expression.only) {
-		return true;
-	}
-	
-	// If allow is undefined, default behaviour is no children.
-	if (typeof(this.expression.allow) === 'undefined') {
-		return false;
-	}
-	
-	// false if {disallow: [..., klass, ...]}
-	if (jQuery.isArray(this.expression.disallow) && jQuery.inArray(match.expression.klass, this.expression.disallow) !== -1) {
-		return false;
-	}
-	
-	// true if {allow: '*'}
-	if (this.expression.allow === '*') {
-		return true;
-	}
-	
-	// true if {allow: [..., klass, ...]}
-	if (jQuery.isArray(this.expression.allow) && jQuery.inArray(match.expression.klass, this.expression.allow) !== -1) {
-		return true;
-	}
-	
-	return false;
-};
-
-// Return true if the given match can be spliced in as a child.
-// Checked automatically when calling _splice.
-Syntax.Match.prototype.canHaveChild = function(match) {
-	var only = match.expression.only;
-	
-	// This condition is fairly slow
-	if (only) {
-		var cur = this;
-		
-		while (cur !== null) {
-			if (jQuery.inArray(cur.expression.klass, only) !== -1) {
-				return true;
-			}
-			
-			cur = cur.parent;
-			
-			// We don't traverse into other trees.
-			if (cur && cur.complete) {
-				break;
-			}
-		}
-		
-		return false;
-	}
-	
-	return true;
-};
-
-// Add a child into the list of children for a given match, if it is acceptable to do so.
-// Updates the owner of the match.
-// Returns null if splice failed.
-Syntax.Match.prototype._splice = function(i, match) {
-	if (this.canHaveChild(match)) {
-		this.children.splice(i, 0, match);
-		match.parent = this;
-		
-		// For matches added using tags.
-		if (!match.expression.owner) {
-			match.expression.owner = this.expression.owner;
-		}
-		
-		return this;
-	} else {
-		return null;
-	}
-};
-
-// This function implements a full insertion procedure, and will break up the match to fit.
-// This operation is potentially very expensive, but is used to insert custom ranges into
-// the tree, if they are specified by the user. A custom <span> may cover multiple leafs in
-// the tree, thus some parts of the tree may need to be split. This behavior is controlled
-// by whole - if true, the tree is split, if false, the match is split.
-// You should avoid using this function except in very specific cases.
-Syntax.Match.prototype.insert = function(match, whole) {
-	if (!this.contains(match))
-		return null;
-	
-	if (whole) {
-		var top = this, i = 0;
-		while (i < top.children.length) {
-			if (top.children[i].contains(match)) {
-				top = top.children[i];
-				i = 0;
-			} else {
-				i += 1;
-			}
-		}
-		
-		return top._insertWhole(match);
-	} else {
-		return this._insert(match);
-	}
-}
-
-Syntax.Match.prototype._insertWhole = function(match) {
-	var parts = this.bisectAtOffsets([match.offset, match.endOffset])
-	this.children = [];
-	
-	if (parts[0]) {
-		this.children = this.children.concat(parts[0].children);
-	}
-	
-	if (parts[1]) {
-		match.children = [];
-		
-		// Update the match's expression based on the current position in the tree:
-		if (this.expression && this.expression.owner) {
-			match.expression = this.expression.owner.getRuleForKlass(match.expression.klass) || match.expression;
-		}
-		
-		// This probably isn't ideal, it would be better to convert all children and children-of-children
-		// into a linear array and reinsert - it would be slightly more accurate in many cases.
-		for (var i = 0; i < parts[1].children.length; i += 1) {
-			var child = parts[1].children[i];
-			
-			if (match.canContain(child)) {
-				match.children.push(child);
-			}
-		}
-		
-		this.children.push(match);
-	}
-	
-	if (parts[2]) {
-		this.children = this.children.concat(parts[2].children);
-	}
-	
-	return this;
-}
-
-// This is not a general tree insertion function. It is optimised to run in almost constant
-// time, but data must be inserted in sorted order, otherwise you will have problems.
-// This function also ensures that matches won't be broken up unless absolutely necessary.
-Syntax.Match.prototype.insertAtEnd = function(match) {
-	if (!this.contains(match)) {
-		console.log("Syntax Error: Child is not contained in parent node!");
-		return null;
-	}
-	
-	if (!this.canContain(match)) {
-		return null;
-	}
-	
-	if (this.children.length > 0) {
-		var i = this.children.length-1;
-		var child = this.children[i];
-		
-		if (match.offset < child.offset) {
-			// Displacement: Before or LHS Overlap
-			// This means that the match has actually occurred before the last child.
-			// This is a bit of an unusual situation because the matches SHOULD be in
-			// sorted order.
-			// However, we are sure that the match is contained in this node. This situation
-			// sometimes occurs when sorting existing branches with matches that are supposed
-			// to be within that branch. When we insert the match into the branch, there are
-			// matches that technically should have been inserted afterwards.
-			// Normal usage should avoid this case, and this is best for performance.
-			if (match.force) {
-				return this._insert(match);
-			} else {
-				return null;
-			}
-		} else if (match.offset < child.endOffset) {
-			if (match.endOffset <= child.endOffset) { 
-				// Displacement: Contains
-				//console.log("displacement => contains");
-				var result = child.insertAtEnd(match);
-				return result;
-			} else {
-				// Displacement: RHS Overlap
-				if (match.force) {
-					return this._insert(match);
-				} else {
-					return null;
-				}
-			}
-		} else {
-			// Displacement: After
-			return this._splice(i+1, match);
-		}
-	} else {
-		// Displacement: Contains [but currently no children]
-		return this._splice(0, match);
-	}
-};
-
-// This insertion function is relatively complex because it is required to split the match over
-// several children. This function is used infrequently and is mostly for completeness. However,
-// it might be possible to remove it to reduce code.
-Syntax.Match.prototype._insert = function(match) {
-	if (this.children.length == 0)
-		return this._splice(0, match);
-	
-	for (var i = 0; i < this.children.length; i += 1) {
-		var child = this.children[i];
-		
-		// If the match ends before this child, it must be before it.
-		if (match.endOffset <= child.offset)
-			return this._splice(i, match);
-		
-		// If the match starts after this child, we continue.
-		if (match.offset >= child.endOffset)
-			continue;
-		
-		// There are four possibilities... 
-		// ... with the possibility of overlapping children on the RHS.
-		//           {------child------}   {---possibly some other child---}
-		//   |----------complete overlap---------|
-		//   |--lhs overlap--|
-		//             |--contains--|
-		//                       |--rhs overlap--|
-		
-		// First, the easiest case:
-		if (child.contains(match)) {
-			return child._insert(match);
-		}
-		
-		// console.log("Bisect at offsets", match, child.offset, child.endOffset);
-		var parts = match.bisectAtOffsets([child.offset, child.endOffset]);
-		// console.log("parts =", parts);
-		// We now have at most three parts
-		//           {------child------}   {---possibly some other child---}
-		//   |--[0]--|-------[1]-------|--[2]--|
-		
-		// console.log("parts", parts);
-		
-		if (parts[0]) {
-			this._splice(i, parts[0])
-		}
-		
-		if (parts[1]) {
-			child.insert(parts[1])
-		}
-		
-		// Continue insertion at this level with remainder.
-		if (parts[2]) {
-			match = parts[2]
-		} else {
-			return this;
-		}
-	}
-	
-	// If we got this far, the match wasn't [completely] inserted into the list of existing children, so it must be on the end.
-	this._splice(this.children.length, match);
-}
-
-// This algorithm recursively bisects the tree at a given offset, but it does this efficiently by folding multiple bisections
-// at a time.
-// Splits:            /                /                   /
-// Tree:       |-------------------------Top-------------------------|
-//             |------------A--------------------|  |------C-------|
-//                         |-------B----------|
-// Step (1):
-// Split Top into 4 parts:
-//             |------/----------------/-------------------/---------|
-// For each part, check if there are any children that cover this part.
-// If there is a child, recursively call bisect with all splits.
-// Step (1-1):
-// Split A into parts:
-//             |------/-----A----------/---------|
-// For each part, check if there are any children that cover this part.
-// If there is a child, recursively call bisect with all splits.
-// Step (1-1-1):
-// Split B into parts:
-//                         |-------B---/------|
-// No children covered by split. Return array of two parts, B1, B2.
-// Step (1-2):
-// Enumerate the results of splitting the child and merge piece-wise into own parts
-//             |------/-----A----------/---------|
-//                         |------B1---|--B2--|
-// Finished merging children, return array of three parts, A1, A2, A3
-// Step (2):
-// Enumerate the results of splitting the child and merge piece-wise into own parts.
-//             |------/----------------/-------------------/---------|
-//             |--A1--|-------A2-------|----A3---|
-//                         |------B1---|--B2--|
-// Continue by splitting next child, C.
-// Once all children have been split and merged, return all parts, T1, T2, T3, T4.
-// The new tree:
-//             |--T1--|-------T2-------|--------T3---------|---T4---|
-//             |--A1--|-------A2-------|----A3---|  |--C1--|---C2--|
-//                         |------B1---|--B2--|
-//
-// The new structure is as follows:
-//		T1 <-	A1
-//		T2 <-	A2	<- B1
-//		T3 <-	A3	<-	B2
-//		   \-	C1
-//		T4 <- C2
-//
-Syntax.Match.prototype.bisectAtOffsets = function(splits) {
-	var parts = [], start = this.offset, prev = null, children = jQuery.merge([], this.children);
-	
-	// Copy the array so we can modify it.
-	splits = splits.slice(0);
-	
-	// We need to split including the last part.
-	splits.push(this.endOffset);
-	
-	splits.sort(function (a,b) {
-		return a-b;
-	});
-	
-	// We build a set of top level matches by looking at each split point and
-	// creating a new match from the end of the previous match to the split point.
-	for (var i = 0; i < splits.length; i += 1) {
-		var offset = splits[i];
-		
-		// The split offset is past the end of the match, so there are no more possible
-		// splits.
-		if (offset > this.endOffset) {
-			break;
-		}
-		
-		// We keep track of null parts if the offset is less than the start
-		// so that things align up as expected with the requested splits.
-		if (
-			offset < this.offset // If the split point is less than the start of the match.
-			|| (offset - start) == 0 // If the match would have effectively zero length.
-		) {
-			parts.push(null); // Preserve alignment with splits.
-			start = offset;
-			continue;
-		}
-		
-		// Even if the previous split was out to the left, we align up the start
-		// to be at the start of the match we are bisecting.
-		if (start < this.offset)
-			start = this.offset;
-		
-		var match = new Syntax.Match(start, offset - start, this.expression);
-		match.value = this.value.substr(start - this.offset, match.length);
-		
-		if (prev) {
-			prev.next = match;
-		}
-		
-		prev = match;
-		
-		start = match.endOffset;
-		parts.push(match);
-	}
-	
-	// We only need to split to produce the number of parts we have.
-	splits.length = parts.length;
-	
-	for (var i = 0; i < parts.length; i += 1) {
-		if (parts[i] == null)
-			continue;
-		
-		var offset = splits[0];
-		
-		while (children.length > 0) {
-			if (children[0].endOffset <= parts[i].endOffset) {
-				parts[i].children.push(children.shift());
-			} else {
-				break;
-			}
-		}
-		
-		if (children.length) {
-			// We may have an intersection
-			if (children[0].offset < parts[i].endOffset) {
-				var children_parts = children.shift().bisectAtOffsets(splits), j = 0;
-			
-				// children_parts are the bisected children which need to be merged with parts
-				// in a linear fashion
-				for (; j < children_parts.length; j += 1) {
-					if (children_parts[j] == null) continue; // Preserve alignment with splits.
-					
-					parts[i+j].children.push(children_parts[j]);
-				}
-				
-				// Skip any parts which have been populated already
-				// (i is incremented at the start of the loop, splits shifted at the end)
-				i += (children_parts.length-2);
-				splits.splice(0, children_parts.length-2);
-			}
-		}
-		
-		splits.shift();
-	}
-	
-	if (children.length) {
-		console.log("Syntax Error: Children nodes not consumed", children.length, " remaining!");
-	}
-	
-	return parts;
-};
-
-// Split a match at points in the tree that match a specific regular expression pattern.
-// Uses the fast tree bisection algorithm, performance should be bounded O(S log N) where N is
-// the total number of matches and S is the number of splits (?).
-Syntax.Match.prototype.split = function(pattern) {
-	var splits = [], match;
-	
-	while ((match = pattern.exec(this.value)) !== null) {
-		splits.push(pattern.lastIndex);
-	}
-	
-	var matches = this.bisectAtOffsets(splits);
-	
-	// Remove any null placeholders.
-	return jQuery.grep(matches, function(n,i){
-		return n;
-	});
-};
-
-Syntax.Match.prototype.splitLines = function() {
-	var lines = this.split(/\n/g);
-	
-	for (var i = 0; i < lines.length; i += 1) {
-		var line = lines[i];
-		var indentOffset = line.value.search(/\S/);
-		
-		var top = new Syntax.Match(line.offset, line.length, line.expression, line.value);
-		
-		if (indentOffset > 0) {
-			var parts = line.bisectAtOffsets([line.offset + indentOffset]);
-			top.children = parts;
-			parts[0].expression = {klass: 'indent'};
-			parts[1].expression = {klass: 'text'};
-		} else {
-			line.expression = {klass: 'text'};
-			top.children = [line];
-		}
-		
-		lines[i] = top;
-	}
-	
-	return lines;
-}
-
-Syntax.Brush = function () {
-	// The primary class of this brush. Must be unique.
-	this.klass = null;
-	
-	// A sequential list of rules for extracting matches.
-	this.rules = [];
-	
-	// A list of all parents that this brush derives from.
-	this.parents = [];
-	
-	// A list of processes that may be run after extracting matches.
-	this.processes = {};
-};
-
-// Add a parent to the brush. This brush should be loaded as a dependency.
-Syntax.Brush.prototype.derives = function (name) {
-	this.parents.push(name);
-	this.rules.push({
-		apply: function(text, expr) {
-			return Syntax.brushes[name].getMatches(text);
-		}
-	});
-};
-
-// Return an array of all classes that the brush consists of.
-// A derivied brush is its own klass + the klass of any and all parents.
-Syntax.Brush.prototype.allKlasses = function () {
-	var klasses = [this.klass];
-	
-	for (var i = 0; i < this.parents.length; i += 1) {
-		klasses = klasses.concat(Syntax.brushes[this.parents[i]].allKlasses());
-	}
-	
-	return klasses;
-}
-
-Syntax.Brush.convertStringToTokenPattern = function (pattern, escape) {
-	var prefix = "\\b", postfix = "\\b";
-	
-	if (!pattern.match(/^\w/)) {
-		if (!pattern.match(/\w$/)) {
-			prefix = postfix = "";
-		} else {
-			prefix = "\\B";
-		}
-	} else {
-		if (!pattern.match(/\w$/)) {
-			postfix = "\\B";
-		}
-	}
-	
-	if (escape)
-		pattern = RegExp.escape(pattern)
-	
-	return prefix + pattern + postfix;
-}
-
-Syntax.Brush.MatchPattern = function (text, rule) {
-	if (!rule.pattern)
-		return [];
-	
-	// Duplicate the pattern so that the function is reentrant.
-	var matches = [], pattern = new RegExp;
-	pattern.compile(rule.pattern);
-	
-	while((match = pattern.exec(text)) !== null) {
-		if (rule.matches) {
-			matches = matches.concat(rule.matches(match, rule));
-		} else if (rule.brush) {
-			matches.push(Syntax.Brush.buildTree(rule, match[0], match.index));
-		} else {
-			matches.push(new Syntax.Match(match.index, match[0].length, rule, match[0]));
-		}
-		
-		if (rule.incremental) {
-			// Don't start scanning from the end of the match..
-			pattern.lastIndex = match.index + 1;
-		}
-	}
-	
-	return matches;
-}
-
-Syntax.Brush.prototype.push = function () {
-	if (jQuery.isArray(arguments[0])) {
-		var patterns = arguments[0], rule = arguments[1];
-		
-		var all = "(";
-		
-		for (var i = 0; i < patterns.length; i += 1) {
-			if (i > 0) all += "|";
-			
-			var p = patterns[i];
-			
-			if (p instanceof RegExp) {
-				all += p.source;
-			} else {
-				all += Syntax.Brush.convertStringToTokenPattern(p, true);
-			}
-		}
-		
-		all += ")";
-		
-		this.push(jQuery.extend({
-			pattern: new RegExp(all, rule.options || 'g')
-		}, rule));
-	} else {
-		var rule = arguments[0];
-		
-		if (typeof(rule.pattern) === 'string') {
-			rule.string = rule.pattern;
-			rule.pattern = new RegExp(Syntax.Brush.convertStringToTokenPattern(rule.string, true), rule.options || 'g')
-		}
-
-		if (typeof(XRegExp) !== 'undefined') {
-			rule.pattern = new XRegExp(rule.pattern);
-		}
-		
-		// Default pattern extraction algorithm
-		rule.apply = rule.apply || Syntax.Brush.MatchPattern;
-
-		if (rule.pattern && rule.pattern.global || typeof(rule.pattern) == 'undefined') {
-			this.rules.push(jQuery.extend({owner: this}, rule));
-		} else {
-			console.log("Syntax Error: Malformed rule: ", rule);
-		}
-	}
-};
-
-Syntax.Brush.prototype.getMatchesForRule = function (text, rule) {
-	var matches = [], match = null;
-	
-	// Short circuit (user defined) function:
-	if (typeof(rule.apply) != 'undefined') {
-		matches = rule.apply(text, rule);
-	}
-	
-	if (rule.debug) {
-		console.log("Syntax matches:", rule, text, matches);
-	}
-	
-	return matches;
-};
-
-Syntax.Brush.prototype.getRuleForKlass = function (klass) {
-	for (var i = 0; i < this.rules.length; i += 1) {
-		if (this.rules[i].klass == klass) {
-			return this.rules[i];
-		}
-	}
-	
-	return null;
-}
-
-// Get all matches from a given block of text.
-Syntax.Brush.prototype.getMatches = function(text) {
-	var matches = [];
-	
-	for (var i = 0; i < this.rules.length; i += 1) {
-		matches = matches.concat(this.getMatchesForRule(text, this.rules[i]));
-	}
-	
-	return matches;
-};
-
-// A helper function for building a tree from a specific rule.
-// Typically used where sub-trees are required, e.g. CSS brush in HTML brush.
-Syntax.Brush.buildTree = function(rule, text, offset, additionalMatches) {
-	var match = Syntax.brushes[rule.brush].buildTree(text, offset, additionalMatches);
-	
-	jQuery.extend(match.expression, rule);
-	
-	return match;
-}
-
-// This function builds a tree from a given block of text.
-// This is done by applying all rules to the text to get a complete list of matches,
-// sorting them in order, and inserting them into a syntax tree data structure.
-// Additional matches are forcefully inserted into the tree.
-// Provide an offset if the text is offset in a larger block of text. Matches
-// will be shifted along appropriately.
-Syntax.Brush.prototype.buildTree = function(text, offset, additionalMatches) {
-	offset = offset || 0;
-	
-	// Fixes code that uses \r\n for line endings. /$/ matches both \r\n, which is a problem..
-	text = text.replace(/\r/g, '');
-	
-	var matches = this.getMatches(text);
-	
-	// Shift matches if offset is provided.
-	if (offset && offset > 0) {
-		for (var i = 0; i < matches.length; i += 1) {
-			matches[i].shift(offset);
-		}
-	}
-	
-	var top = new Syntax.Match(offset, text.length, {klass: this.allKlasses().join(" "), allow: '*', owner: this}, text);
-
-	// This sort is absolutely key to the functioning of the tree insertion algorithm.
-	matches.sort(Syntax.Match.sort);
-
-	for (var i = 0; i < matches.length; i += 1) {
-		top.insertAtEnd(matches[i]);
-	}
-	
-	if (additionalMatches) {
-		for (var i = 0; i < additionalMatches.length; i += 1) {
-			top.insert(additionalMatches[i], true);
-		}
-	}
-	
-	top.complete = true;
-	
-	return top;
-};
-
-// This function builds a syntax tree from the given text and matches (optional).
-// The syntax tree is then flattened into html using a variety of functions.
-//
-// By default, you can't control reduction process through this function, but
-// it is possible to control the element conversion process by replace
-// .reduce(null, ...) with  .reduce(reduceCallback, ...)
-// See Syntax.Match.defaultReduceCallback for more details about interface.
-//
-// Matches is optional, and provides a set of pre-existing matches to add
-// to the tree.
-// Options are passed to element level processing functions.
-Syntax.Brush.prototype.process = function(text, matches, options) {
-	var top = this.buildTree(text, 0, matches);
-	
-	var lines = top.splitLines();
-	
-	var html = document.createElement('code');
-	html.className = 'syntax highlighted';
-	
-	for (var i = 0; i < lines.length; i += 1) {
-		var line = lines[i].reduce(null, function (container, match) {
-			if (match.expression) {
-				if (match.expression.process) {
-					container = match.expression.process(container, match, options);
-				}
-				
-				if (match.expression.owner) {
-					var process = match.expression.owner.processes[match.expression.klass];
-					if (process) {
-						container = process(container, match, options);
-					}
-				}
-			}
-			return container;
-		});
-		
-		html.appendChild(line);
-	}
-	
-	return html;
-};
-
-// Highlights a given block of text with a given set of options.
-// options.brush should specify the brush to use, either by direct reference
-// or name.
-// Callback will be called with (highlighted_html, brush_used, original_text, options)
-Syntax.highlightText = function(text, brush, matches, options, callback) {
-	brush = (brush || 'plain').toLowerCase();
-	brush = Syntax.aliases[brush] || brush;
-	
-	Syntax.brushes.get(brush, function(brush) {
-		var html = brush.process(text, matches, options);
-		
-		if (options.linkify) {
-			jQuery('span.href', html).each(function(){
-				jQuery(this).replaceWith(jQuery('<a>').attr('href', this.innerHTML).text(this.innerHTML));
-			});
-		}
-		
-		callback(html, brush, text, options);
-	});
-}
-
-Syntax.extractBrushName = function (className) {
-	// brush names are by default lower case - normalize so we can detect it.
-	className = className.toLowerCase();
-	
-	var match = className.match(/(brush|language)-([\S]+)/);
-	
-	if (match) {
-		return match[2];
-	} else {
-		var classes = className.split(/ /);
-		
-		if (jQuery.inArray("syntax", classes) !== -1) {
-			for (var i = 0; i < classes.length; i += 1) {
-				var name = Syntax.aliases[classes[i]];
-				
-				if (name) {
-					return name;
-				}
-			}
-		}
-	}
-	
-	return null;
-}
-
-Syntax.extractTextBrushName = function (text) {
-	var match = text.match(/-\*- mode: (.+?);(.*?)-\*-/i);
-	var endOfSecondLine = text.indexOf("\n", text.indexOf("\n") + 1);
-
-	if (match && match.index < endOfSecondLine) {
-		return brush;
-	}
-}
-
-// Highlight a given set of elements with a set of options.
-// Callback will be called once per element with (options, highlighted_html, original_container)
-Syntax.highlight = function (elements, options, callback) {
-	elements.each(function () {
-		var container = jQuery(this);
-		var brush = options.brush || Syntax.extractBrushName(this.className);
-		var text = Syntax.innerText(this);
-
-		// We can augment the plain text to extract existing annotations (e.g. <span class="foo">...</span>).
-		var matches = Syntax.extractElementMatches(container);
-		
-		if (options.matches) {
-			Array.prototype.push(matches, options.matches);
-		}
-		
-		Syntax.highlightText(text, brush, matches, options, function(html, brush/*, text, options*/) {
-			html = jQuery(html);
-
-			// If there is a theme specified, ensure it is added to the top level class.
-			if (options.theme) {
-				// Load dependencies
-				var themes = Syntax.themes[options.theme];
-				for (var i = 0; i < themes.length; i += 1) {
-					html.addClass("syntax-theme-" + themes[i]);
-				}
-
-				// Add the base theme
-				html.addClass("syntax-theme-" + options.theme);
-			}
-
-			if (brush.postprocess) {
-				html = brush.postprocess(options, html, container);
-			}
-
-			if (callback) {
-				html = callback(options, html, container);
-			}
-
-			if (html && options.replace === true) {
-				container.replaceWith(html);
-			}
-		});
-	});
-};
-
-// Register the file as being loaded
-Syntax.loader.core = true;
+// This file is part of the "jQuery.Syntax" project, and is distributed under the MIT License.
+RegExp.prototype.indexOf||(RegExp.indexOf=function(a,b){return a[0].indexOf(a[b])+a.index});RegExp.prototype.escape||(RegExp.escape=function(a){return a.replace(/[\-\[\]{}()*+?.\\\^$|,#\s]/g,"\\$&")});String.prototype.repeat||(String.prototype.repeat=function(a){return Array(a+1).join(this)});Syntax.innerText=function(a){var b;if(!a)return"";if("BR"==a.nodeName)return"\n";a.textContent?b=a.textContent:document.body.innerText&&(b=a.innerText);return b.replace(/\r\n?/g,"\n")};
+Syntax.extractTextFromSelection=function(a){for(var b="",c=0;c<a.rangeCount;c+=1)var d=a.getRangeAt(c).toString(),b=b+d;return b};Syntax.copyCode=function(a){var b=window.getSelection(),b=Syntax.extractTextFromSelection(b);a.clipboardData.setData("text/plain",b);return!1};
+Syntax.extractElementMatches=function(a,b){var c=[];b=b||0;(function(a){for(var e=0;a[e];e++){var f=null,g=a[e];3===g.nodeType||4===g.nodeType?b+=g.nodeValue.length:1===g.nodeType&&(f=Syntax.innerText(g),c.push(new Syntax.Match(b,f.length,{klass:g.className,force:!0,element:g,allow:"*"},f)));8!==g.nodeType&&g.children&&arguments.callee(g.childNodes,b)}})(a);c.shift();return c};
+Syntax.extractMatches=function(){var a=arguments;return function(b,c){for(var d=[],e=0;e<a.length;e+=1){var f=a[e],g=e+1;null!=f&&("undefined"!=typeof f.index&&(g=f.index),f.debug&&console.log("extractMatches",f,g,b[g],b),0<b[g].length&&(f.brush?d.push(Syntax.Brush.buildTree(f,b[g],RegExp.indexOf(b,g))):(f=jQuery.extend({owner:c.owner},f),d.push(new Syntax.Match(RegExp.indexOf(b,g),b[g].length,f,b[g])))))}return d}};
+Syntax.lib.webLinkProcess=function(a,b){b&&(a="http://www.google.com/search?btnI=I&q="+encodeURIComponent(a+" "));return function(b,d,e){if(!1===e.linkify)return b;d=document.createElement("a");d.href=a+encodeURIComponent(Syntax.innerText(b));for(d.className=b.className;0<b.childNodes.length;)d.appendChild(b.childNodes[0]);return d}};Syntax.register=function(a,b){var c=Syntax.brushes[a]=new Syntax.Brush;c.klass=a;b(c)};Syntax.lib.cStyleComment={pattern:/\/\*[\s\S]*?\*\//gm,klass:"comment",allow:["href"]};
+Syntax.lib.cppStyleComment={pattern:/\/\/.*$/gm,klass:"comment",allow:["href"]};Syntax.lib.perlStyleComment={pattern:/#.*$/gm,klass:"comment",allow:["href"]};Syntax.lib.perlStyleRegularExpression={pattern:/\B\/([^\\\/]|\\.)*\/[a-z]*(?=\s*($|[^\w\s'"\(]))/gm,klass:"constant",incremental:!0};Syntax.lib.rubyStyleRegularExpression={pattern:/\B\/([^\\\/]|\\.)*\/[a-z]*(?=\s*($|[^\w\s'"\(]|do))/gm,klass:"constant",incremental:!0};Syntax.lib.cStyleFunction={pattern:/([a-z_][a-z0-9_]*)\s*\(/gi,matches:Syntax.extractMatches({klass:"function"})};
+Syntax.lib.camelCaseType={pattern:/\b_*[A-Z][\w]*\b/g,klass:"type"};Syntax.lib.cStyleType={pattern:/\b[_a-z][_\w]*_t\b/gi,klass:"type"};Syntax.lib.xmlComment={pattern:/(&lt;|<)!--[\s\S]*?--(&gt;|>)/gm,klass:"comment"};Syntax.lib.webLink={pattern:/\w+:\/\/[\w\-.\/?%&=@:;#]*/g,klass:"href"};Syntax.lib.hexNumber={pattern:/\b0x[0-9a-fA-F]+/g,klass:"constant"};Syntax.lib.decimalNumber={pattern:/\b[-+]?[0-9]*\.?[0-9]+([eE][-+]?[0-9]+)?/g,klass:"constant"};
+Syntax.lib.doubleQuotedString={pattern:/"([^\\"\n]|\\.)*"/g,klass:"string"};Syntax.lib.singleQuotedString={pattern:/'([^\\'\n]|\\.)*'/g,klass:"string"};Syntax.lib.multiLineDoubleQuotedString={pattern:/"([^\\"]|\\.)*"/g,klass:"string"};Syntax.lib.multiLineSingleQuotedString={pattern:/'([^\\']|\\.)*'/g,klass:"string"};Syntax.lib.stringEscape={pattern:/\\./g,klass:"escape",only:["string"]};
+Syntax.Match=function(a,b,c,d){this.offset=a;this.endOffset=a+b;this.length=b;this.expression=c;this.value=d;this.children=[];this.next=this.parent=null};Syntax.Match.prototype.shift=function(a,b){this.adjust(a,null,b);for(var c=0;c<this.children.length;c++)this.children[c].shift(a,b)};Syntax.Match.prototype.adjust=function(a,b,c){this.offset+=a;this.endOffset+=a;b&&(this.length=b,this.endOffset=this.offset+b);c&&(this.value=c.substr(this.offset,this.length))};
+Syntax.Match.sort=function(a,b){return a.offset-b.offset||b.length-a.length};Syntax.Match.prototype.contains=function(a){return a.offset>=this.offset&&a.endOffset<=this.endOffset};Syntax.Match.defaultReduceCallback=function(a,b){"string"===typeof a&&(a=document.createTextNode(a));b.appendChild(a)};
+Syntax.Match.prototype.reduce=function(a,b){var c=this.offset,d=document.createElement("span");a=a||Syntax.Match.defaultReduceCallback;this.expression&&this.expression.klass&&(0<d.className.length&&(d.className+=" "),d.className+=this.expression.klass);this.className&&(d.className+=" ",d.className+=this.className);for(var e=0;e<this.children.length;e+=1){var f=this.children[e],g=f.offset;f.offset<this.offset&&console.log("Syntax Warning: Offset of child",f,"is before offset of parent",this);c=this.value.substr(c-
+this.offset,g-c);a(c,d);a(f.reduce(a,b),d);c=f.endOffset}c===this.offset?a(this.value,d):c<this.endOffset?a(this.value.substr(c-this.offset,this.endOffset-c),d):c>this.endOffset&&console.log("Syntax Warning: Start position "+c+" exceeds end of value "+this.endOffset);b&&(d=b(d,this));return d};
+Syntax.Match.prototype.canContain=function(a){return a.expression.force?!0:this.complete?!1:a.expression.only?!0:"undefined"===typeof this.expression.allow||jQuery.isArray(this.expression.disallow)&&-1!==jQuery.inArray(a.expression.klass,this.expression.disallow)?!1:"*"===this.expression.allow||jQuery.isArray(this.expression.allow)&&-1!==jQuery.inArray(a.expression.klass,this.expression.allow)?!0:!1};
+Syntax.Match.prototype.canHaveChild=function(a){if(a=a.expression.only){for(var b=this;null!==b;){if(-1!==jQuery.inArray(b.expression.klass,a))return!0;if((b=b.parent)&&b.complete)break}return!1}return!0};Syntax.Match.prototype._splice=function(a,b){return this.canHaveChild(b)?(this.children.splice(a,0,b),b.parent=this,b.expression.owner||(b.expression.owner=this.expression.owner),this):null};
+Syntax.Match.prototype.insert=function(a,b){if(!this.contains(a))return null;if(b){for(var c=this,d=0;d<c.children.length;)c.children[d].contains(a)?(c=c.children[d],d=0):d+=1;return c._insertWhole(a)}return this._insert(a)};
+Syntax.Match.prototype._insertWhole=function(a){var b=this.bisectAtOffsets([a.offset,a.endOffset]);this.children=[];b[0]&&(this.children=this.children.concat(b[0].children));if(b[1]){a.children=[];this.expression&&this.expression.owner&&(a.expression=this.expression.owner.getRuleForKlass(a.expression.klass)||a.expression);for(var c=0;c<b[1].children.length;c+=1){var d=b[1].children[c];a.canContain(d)&&a.children.push(d)}this.children.push(a)}b[2]&&(this.children=this.children.concat(b[2].children));
+return this};Syntax.Match.prototype.insertAtEnd=function(a){if(!this.contains(a))return console.log("Syntax Error: Child is not contained in parent node!"),null;if(!this.canContain(a))return null;if(0<this.children.length){var b=this.children.length-1,c=this.children[b];return a.offset<c.offset?a.force?this._insert(a):null:a.offset<c.endOffset?a.endOffset<=c.endOffset?c.insertAtEnd(a):a.force?this._insert(a):null:this._splice(b+1,a)}return this._splice(0,a)};
+Syntax.Match.prototype._insert=function(a){if(0==this.children.length)return this._splice(0,a);for(var b=0;b<this.children.length;b+=1){var c=this.children[b];if(a.endOffset<=c.offset)return this._splice(b,a);if(!(a.offset>=c.endOffset)){if(c.contains(a))return c._insert(a);a=a.bisectAtOffsets([c.offset,c.endOffset]);a[0]&&this._splice(b,a[0]);a[1]&&c.insert(a[1]);if(a[2])a=a[2];else return this}}this._splice(this.children.length,a)};
+Syntax.Match.prototype.bisectAtOffsets=function(a){var b=[],c=this.offset,d=null,e=jQuery.merge([],this.children);a=a.slice(0);a.push(this.endOffset);a.sort(function(a,b){return a-b});for(var f=0;f<a.length;f+=1){var g=a[f];if(g>this.endOffset)break;g<this.offset||0==g-c?(b.push(null),c=g):(c<this.offset&&(c=this.offset),g=new Syntax.Match(c,g-c,this.expression),g.value=this.value.substr(c-this.offset,g.length),d&&(d.next=g),d=g,c=g.endOffset,b.push(g))}a.length=b.length;for(f=0;f<b.length;f+=1)if(null!=
+b[f]){for(g=a[0];0<e.length;)if(e[0].endOffset<=b[f].endOffset)b[f].children.push(e.shift());else break;if(e.length&&e[0].offset<b[f].endOffset){c=e.shift().bisectAtOffsets(a);for(d=0;d<c.length;d+=1)null!=c[d]&&b[f+d].children.push(c[d]);f+=c.length-2;a.splice(0,c.length-2)}a.shift()}e.length&&console.log("Syntax Error: Children nodes not consumed",e.length," remaining!");return b};
+Syntax.Match.prototype.split=function(a){for(var b=[];null!==a.exec(this.value);)b.push(a.lastIndex);a=this.bisectAtOffsets(b);return jQuery.grep(a,function(a,b){return a})};
+Syntax.Match.prototype.splitLines=function(){for(var a=this.split(/\n/g),b=0;b<a.length;b+=1){var c=a[b],d=c.value.search(/\S/),e=new Syntax.Match(c.offset,c.length,c.expression,c.value);0<d?(c=c.bisectAtOffsets([c.offset+d]),e.children=c,c[0].expression={klass:"indent"},c[1].expression={klass:"text"}):(c.expression={klass:"text"},e.children=[c]);a[b]=e}return a};Syntax.Brush=function(){this.klass=null;this.rules=[];this.parents=[];this.processes={}};
+Syntax.Brush.prototype.derives=function(a){this.parents.push(a);this.rules.push({apply:function(b,c){return Syntax.brushes[a].getMatches(b)}})};Syntax.Brush.prototype.allKlasses=function(){for(var a=[this.klass],b=0;b<this.parents.length;b+=1)a=a.concat(Syntax.brushes[this.parents[b]].allKlasses());return a};Syntax.Brush.convertStringToTokenPattern=function(a,b){var c="\\b",d="\\b";a.match(/^\w/)?a.match(/\w$/)||(d="\\B"):c=a.match(/\w$/)?"\\B":d="";b&&(a=RegExp.escape(a));return c+a+d};
+Syntax.Brush.MatchPattern=function(a,b){if(!b.pattern)return[];var c=[],d=RegExp();for(d.compile(b.pattern);null!==(match=d.exec(a));)b.matches?c=c.concat(b.matches(match,b)):b.brush?c.push(Syntax.Brush.buildTree(b,match[0],match.index)):c.push(new Syntax.Match(match.index,match[0].length,b,match[0])),b.incremental&&(d.lastIndex=match.index+1);return c};
+Syntax.Brush.prototype.push=function(a,b){if(jQuery.isArray(a)){for(var c=b,d="(",e=0;e<a.length;e+=1){0<e&&(d+="|");var f=a[e],d=f instanceof RegExp?d+f.source:d+Syntax.Brush.convertStringToTokenPattern(f,!0)}this.push(jQuery.extend({pattern:RegExp(d+")",c.options||"g")},c))}else c=a,"string"===typeof c.pattern&&(c.string=c.pattern,c.pattern=RegExp(Syntax.Brush.convertStringToTokenPattern(c.string,!0),c.options||"g")),"undefined"!==typeof XRegExp&&(c.pattern=new XRegExp(c.pattern)),c.apply=c.apply||
+Syntax.Brush.MatchPattern,c.pattern&&c.pattern.global||"undefined"==typeof c.pattern?this.rules.push(jQuery.extend({owner:this},c)):console.log("Syntax Error: Malformed rule: ",c)};Syntax.Brush.prototype.getMatchesForRule=function(a,b){var c=[];"undefined"!=typeof b.apply&&(c=b.apply(a,b));b.debug&&console.log("Syntax matches:",b,a,c);return c};Syntax.Brush.prototype.getRuleForKlass=function(a){for(var b=0;b<this.rules.length;b+=1)if(this.rules[b].klass==a)return this.rules[b];return null};
+Syntax.Brush.prototype.getMatches=function(a){for(var b=[],c=0;c<this.rules.length;c+=1)b=b.concat(this.getMatchesForRule(a,this.rules[c]));return b};Syntax.Brush.buildTree=function(a,b,c,d){b=Syntax.brushes[a.brush].buildTree(b,c,d);jQuery.extend(b.expression,a);return b};
+Syntax.Brush.prototype.buildTree=function(a,b,c){b=b||0;a=a.replace(/\r/g,"");var d=this.getMatches(a);if(b&&0<b)for(var e=0;e<d.length;e+=1)d[e].shift(b);a=new Syntax.Match(b,a.length,{klass:this.allKlasses().join(" "),allow:"*",owner:this},a);d.sort(Syntax.Match.sort);for(e=0;e<d.length;e+=1)a.insertAtEnd(d[e]);if(c)for(e=0;e<c.length;e+=1)a.insert(c[e],!0);a.complete=!0;return a};
+Syntax.Brush.prototype.process=function(a,b,c){a=this.buildTree(a,0,b).splitLines();b=document.createElement("code");b.className="syntax highlighted";for(var d=0;d<a.length;d+=1){var e=a[d].reduce(null,function(a,b){if(b.expression&&(b.expression.process&&(a=b.expression.process(a,b,c)),b.expression.owner)){var d=b.expression.owner.processes[b.expression.klass];d&&(a=d(a,b,c))}return a});b.appendChild(e)}return b};
+Syntax.highlightText=function(a,b,c,d,e){b=(b||"plain").toLowerCase();b=Syntax.aliases[b]||b;Syntax.brushes.get(b,function(b){var g=b.process(a,c,d);d.linkify&&jQuery("span.href",g).each(function(){jQuery(this).replaceWith(jQuery("<a>").attr("href",this.innerHTML).text(this.innerHTML))});e(g,b,a,d)})};
+Syntax.extractBrushName=function(a){a=a.toLowerCase();var b=a.match(/(brush|language)-([\S]+)/);if(b)return b[2];a=a.split(/ /);if(-1!==jQuery.inArray("syntax",a))for(b=0;b<a.length;b+=1){var c=Syntax.aliases[a[b]];if(c)return c}return null};
+Syntax.highlight=function(a,b,c){a.each(function(){var a=jQuery(this),e=b.brush||Syntax.extractBrushName(this.className),f=Syntax.innerText(this),g=Syntax.extractElementMatches(a);b.matches&&Array.prototype.push(g,b.matches);Syntax.highlightText(f,e,g,b,function(e,f){e.oncopy=Syntax.copyCode;e=jQuery(e);if(b.theme){for(var g=Syntax.themes[b.theme],h=0;h<g.length;h+=1)e.addClass("syntax-theme-"+g[h]);e.addClass("syntax-theme-"+b.theme)}f.postprocess&&(e=f.postprocess(b,e,a));c&&(e=c(b,e,a));e&&!0===
+b.replace&&a.replaceWith(e)})})};Syntax.loader.core=!0;