// Copyright (C) 2006 Google Inc. // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License.
// CAVEAT: this does not properly handle the case where a regular // expression immediately follows another since a regular expression may // have flags for case-sensitivity and the like. Having regexp tokens // adjacent is not valid in any language I'm aware of, so I'm punting. // TODO: maybe style special characters inside a regexp as punctuation.
/** *Givenagroupof{@linkRegExp}s,returnsa{@codeRegExp}thatglobally *matchestheunionofthesetsofstringsmatchedbytheinputRegExp. *Sinceitmatchesglobally,iftheinputstringshaveastart-of-input *anchor(/^.../),itisignoredforthepurposesofunioning. *@param{Array.<RegExp>}regexsnonmultiline,non-globalregexs. *@return{RegExp}aglobalregex.
*/ function combinePrefixPatterns(regexs) { var capturedGroupIndex = 0;
var needToFoldCase = false; var ignoreCase = false; for (var i = 0, n = regexs.length; i < n; ++i) { var regex = regexs[i]; if (regex.ignoreCase) {
ignoreCase = true;
} elseif (/[a-z]/i.test(regex.source.replace(
/\\u[0-9a-f]{4}|\\x[0-9a-f]{2}|\\[^ux]/gi, ''))) {
needToFoldCase = true;
ignoreCase = false; break;
}
}
function caseFoldCharset(charSet) { var charsetParts = charSet.substring(1, charSet.length - 1).match( new RegExp( '\\\\u[0-9A-Fa-f]{4}'
+ '|\\\\x[0-9A-Fa-f]{2}'
+ '|\\\\[0-3][0-7]{0,2}'
+ '|\\\\[0-7]{1,2}'
+ '|\\\\[\\s\\S]'
+ '|-'
+ '|[^-\\\\]', 'g')); var ranges = []; var inverse = charsetParts[0] === '^';
var out = ['[']; if (inverse) { out.push('^'); }
for (var i = inverse ? 1 : 0, n = charsetParts.length; i < n; ++i) { var p = charsetParts[i]; if (/\\[bdsw]/i.test(p)) { // Don't muck with named groups.
out.push(p);
} else { var start = decodeEscape(p); var end; if (i + 2 < n && '-' === charsetParts[i + 1]) {
end = decodeEscape(charsetParts[i + 2]);
i += 2;
} else {
end = start;
}
ranges.push([start, end]); // If the range might intersect letters, then expand it. // This case handling is too simplistic. // It does not deal with non-latin case folding. // It works for latin source code identifiers though. if (!(end < 65 || start > 122)) { if (!(end < 65 || start > 90)) {
ranges.push([Math.max(65, start) | 32, Math.min(end, 90) | 32]);
} if (!(end < 97 || start > 122)) {
ranges.push([Math.max(97, start) & ~32, Math.min(end, 122) & ~32]);
}
}
}
}
// [[1, 10], [3, 4], [8, 12], [14, 14], [16, 16], [17, 17]] // -> [[1, 12], [14, 14], [16, 17]]
ranges.sort(function (a, b) { return (a[0] - b[0]) || (b[1] - a[1]); }); var consolidatedRanges = []; var lastRange = []; for (var i = 0; i < ranges.length; ++i) { var range = ranges[i]; if (range[0] <= lastRange[1] + 1) {
lastRange[1] = Math.max(lastRange[1], range[1]);
} else {
consolidatedRanges.push(lastRange = range);
}
}
for (var i = 0; i < consolidatedRanges.length; ++i) { var range = consolidatedRanges[i];
out.push(encodeEscape(range[0])); if (range[1] > range[0]) { if (range[1] + 1 > range[0]) { out.push('-'); }
out.push(encodeEscape(range[1]));
}
}
out.push(']'); return out.join('');
}
function allowAnywhereFoldCaseAndRenumberGroups(regex) { // Split into character sets, escape sequences, punctuation strings // like ('(', '(?:', ')', '^'), and runs of characters that do not // include any of the above. var parts = regex.source.match( new RegExp( '(?:'
+ '\\[(?:[^\\x5C\\x5D]|\\\\[\\s\\S])*\\]'// a character set
+ '|\\\\u[A-Fa-f0-9]{4}'// a unicode escape
+ '|\\\\x[A-Fa-f0-9]{2}'// a hex escape
+ '|\\\\[0-9]+'// a back-reference or octal escape
+ '|\\\\[^ux0-9]'// other escape sequence
+ '|\\(\\?[:!=]'// start of a non-capturing group
+ '|[\\(\\)\\^]'// start/end of a group, or line start
+ '|[^\\x5B\\x5C\\(\\)\\^]+'// run of other characters
+ ')', 'g')); var n = parts.length;
// Maps captured group numbers to the number they will occupy in // the output or to -1 if that has not been determined, or to // undefined if they need not be capturing in the output. var capturedGroups = [];
// Walk over and identify back references to build the capturedGroups // mapping. for (var i = 0, groupIndex = 0; i < n; ++i) { var p = parts[i]; if (p === '(') { // groups are 1-indexed, so max group index is count of '('
++groupIndex;
} elseif ('\\' === p.charAt(0)) { var decimalValue = +p.substring(1); if (decimalValue) { if (decimalValue <= groupIndex) {
capturedGroups[decimalValue] = -1;
} else { // Replace with an unambiguous escape sequence so that // an octal escape sequence does not turn into a backreference // to a capturing group from an earlier regex.
parts[i] = encodeEscape(decimalValue);
}
}
}
}
// Renumber groups and reduce capturing groups to non-capturing groups // where possible. for (var i = 1; i < capturedGroups.length; ++i) { if (-1 === capturedGroups[i]) {
capturedGroups[i] = ++capturedGroupIndex;
}
} for (var i = 0, groupIndex = 0; i < n; ++i) { var p = parts[i]; if (p === '(') {
++groupIndex; if (!capturedGroups[groupIndex]) {
parts[i] = '(?:';
}
} elseif ('\\' === p.charAt(0)) { var decimalValue = +p.substring(1); if (decimalValue && decimalValue <= groupIndex) {
parts[i] = '\\' + capturedGroups[decimalValue];
}
}
}
// Remove any prefix anchors so that the output will match anywhere. // ^^ really does mean an anchored match though. for (var i = 0; i < n; ++i) { if ('^' === parts[i] && '^' !== parts[i + 1]) { parts[i] = ''; }
}
// Expand letters to groups to handle mixing of case-sensitive and // case-insensitive patterns if necessary. if (regex.ignoreCase && needToFoldCase) { for (var i = 0; i < n; ++i) { var p = parts[i]; var ch0 = p.charAt(0); if (p.length >= 2 && ch0 === '[') {
parts[i] = caseFoldCharset(p);
} elseif (ch0 !== '\\') { // TODO: handle letters in numeric escapes.
parts[i] = p.replace(
/[a-zA-Z]/g, function (ch) { var cc = ch.charCodeAt(0); return'[' + String.fromCharCode(cc & ~32, cc | 32) + ']';
});
}
}
}
return parts.join('');
}
var rewritten = []; for (var i = 0, n = regexs.length; i < n; ++i) { var regex = regexs[i]; if (regex.global || regex.multiline) { thrownew Error('' + regex); }
rewritten.push( '(?:' + allowAnywhereFoldCaseAndRenumberGroups(regex) + ')');
}
/** *ApplythegivenlanguagehandlertosourceCodeandaddtheresulting *decorationstoout. *@param{number}basePostheindexofsourceCodewithinthechunkofsource *whosedecorationsarealreadypresentonout.
*/ function appendDecorations(basePos, sourceCode, langHandler, out) { if (!sourceCode) { return; } var job = {
sourceCode: sourceCode,
basePos: basePos
};
langHandler(job);
out.push.apply(out, job.decorations);
}
var notWs = /\S/;
/** *Givenanelement,ifitcontainsonlyonechildelementandanytextnodes *itcontainscontainonlyspacecharacters,returnthesolechildelement. *Otherwisereturnsundefined. *<p> *ThisismeanttoreturntheCODEelementin{@code<pre><code...>}when *thereisasinglechildelementthatcontainsallthenon-spacetextual *content,butnottoreturnanythingwheretherearemultiplechildelements *asin{@code<pre><code>...</code><code>...</code></pre>}orwhenthere *istextualcontent.
*/ function childContentWrapper(element) { var wrapper = undefined; for (var c = element.firstChild; c; c = c.nextSibling) { var type = c.nodeType;
wrapper = (type === 1) // Element Node
? (wrapper ? element : c)
: (type === 3) // Text Node
? (notWs.test(c.nodeValue) ? element : wrapper)
: wrapper;
} return wrapper === element ? undefined : wrapper;
}
/** Given triples of [style, pattern, context] returns a lexing function, *Thelexingfunctioninterpretsthepatternstofindtokenboundariesand *returnsadecorationlistoftheform *[index_0,style_0,index_1,style_1,...,index_n,style_n] *whereindex_nisanindexintothesourceCode,andstyle_nisastyle *constantlikePR_PLAIN.index_n-1<=index_n,andstyle_n-1appliesto *allcharactersinsourceCode[index_n-1:index_n]. * *ThestylePatternsisalistwhoseelementshavetheform *[style:string,pattern:RegExp,DEPRECATED,shortcut:string]. * *StyleisastyleconstantlikePR_PLAIN,orcanbeastringofthe *form'lang-FOO',whereFOOisalanguageextensiondescribingthe *languageoftheportionofthetokenin$1afterpatternexecutes. *E.g.,ifstyleis'lang-lisp',andgroup1containsthetext *'(hello(world))',thenthatportionofthetokenwillbepassedtothe *registeredlisphandlerforformatting. *Thetextbeforeandaftergroup1willberestyledusingthisdecorator *sodecoratorsshouldtakecarethatthisdoesn'tresultininfinite *recursion.Forexample,theHTMLlexerruleforSCRIPTelementslooks *somethinglike['lang-js',/<[s]cript>(.+?)<\/script>/].Thismaymatch *'<script>foo()<\/script>',whichwouldcausethecurrentdecoratorto *becalledwith'<script>'whichwouldnotmatchthesamerulesince *group1mustnotbeempty,soitwouldbeinsteadstyledasPR_TAGby *thegenerictagrule.Thehandlerregisteredforthe'js'extensionwould *thenbecalledwith'foo()',andfinally,thecurrentdecoratorwould *becalledwith'<\/script>'whichwouldnotmatchtheoriginalruleand *sothegenerictagrulewouldidentifyitasatag. * *Patternmustonlymatchprefixes,andifitmatchesaprefix,thenthat *matchisconsideredatokenwiththesamestyle. * *Contextisappliedtothelastnon-whitespace,non-commenttoken *recognized. * *Shortcutisanoptionalstringofcharacters,anyofwhich,ifthefirst *character,guaranteethatthispatternandonlythispatternmatches. * *@param{Array}shortcutStylePatternspatternsthatalwaysstartwith *aknowncharacter.Musthaveashortcutstring. *@param{Array}fallthroughStylePatternspatternsthatwillbetriedin *orderiftheshortcutonesfail.Mayhaveshortcuts. * *@return{function(Object)}a *functionthattakessourcecodeandreturnsalistofdecorations.
*/ function createSimpleLexer(shortcutStylePatterns, fallthroughStylePatterns) { var shortcuts = {}; var tokenizer;
(function () { var allPatterns = shortcutStylePatterns.concat(fallthroughStylePatterns); var allRegexs = []; var regexKeys = {}; for (var i = 0, n = allPatterns.length; i < n; ++i) { var patternParts = allPatterns[i]; var shortcutChars = patternParts[3]; if (shortcutChars) { for (var c = shortcutChars.length; --c >= 0;) {
shortcuts[shortcutChars.charAt(c)] = patternParts;
}
} var regex = patternParts[1]; var k = '' + regex; if (!regexKeys.hasOwnProperty(k)) {
allRegexs.push(regex);
regexKeys[k] = null;
}
}
allRegexs.push(/[\0-\uffff]/);
tokenizer = combinePrefixPatterns(allRegexs);
})();
var nPatterns = fallthroughStylePatterns.length;
/** *Lexesjob.sourceCodeandproducesanoutputarrayjob.decorationsof *styleclassesprecededbythepositionatwhichtheystartin *job.sourceCodeinorder. * *@param{Object}jobanobjectlike<pre>{ *sourceCode:{string}sourceTextplaintext, *basePos:{int}positionofjob.sourceCodeinthelargerchunkof *sourceCode. *}</pre>
*/ var decorate = function (job) { var sourceCode = job.sourceCode, basePos = job.basePos; /** Even entries are positions in source in ascending order. Odd enties *arestylemarkers(e.g.,PR_COMMENT)thatrunfromthatpositionuntil *theend. *@type{Array.<number|string>}
*/ var decorations = [basePos, PR_PLAIN]; var pos = 0; // index into sourceCode var tokens = sourceCode.match(tokenizer) || []; var styleCache = {};
for (var ti = 0, nTokens = tokens.length; ti < nTokens; ++ti) { var token = tokens[ti]; var style = styleCache[token]; var match = void0;
var isEmbedded; if (typeof style === 'string') {
isEmbedded = false;
} else { var patternParts = shortcuts[token.charAt(0)]; if (patternParts) {
match = token.match(patternParts[1]);
style = patternParts[0];
} else { for (var i = 0; i < nPatterns; ++i) {
patternParts = fallthroughStylePatterns[i];
match = token.match(patternParts[1]); if (match) {
style = patternParts[0]; break;
}
}
if (!match) { // make sure that we make progress
style = PR_PLAIN;
}
}
if (!isEmbedded) {
decorations.push(basePos + tokenStart, style);
} else { // Treat group 1 as an embedded block of source code. var embeddedSource = match[1]; var embeddedSourceStart = token.indexOf(embeddedSource); var embeddedSourceEnd = embeddedSourceStart + embeddedSource.length; if (match[2]) { // If embeddedSource can be blank, then it would match at the // beginning which would cause us to infinitely recurse on the // entire token, so we catch the right context in match[2].
embeddedSourceEnd = token.length - match[2].length;
embeddedSourceStart = embeddedSourceEnd - embeddedSource.length;
} var lang = style.substring(5); // Decorate the left of the embedded source
appendDecorations(
basePos + tokenStart,
token.substring(0, embeddedSourceStart),
decorate, decorations); // Decorate the embedded source
appendDecorations(
basePos + tokenStart + embeddedSourceStart,
embeddedSource,
langHandlerForExtension(lang, embeddedSource),
decorations); // Decorate the right of the embedded section
appendDecorations(
basePos + tokenStart + embeddedSourceEnd,
token.substring(embeddedSourceEnd),
decorate, decorations);
}
}
job.decorations = decorations;
}; return decorate;
}
/** returns a function that produces a list of decorations from source text. * *Thiscodetreats",',and`asstringdelimiters,and\asastring *escape.Itdoesnotrecognizeperl'sqq()stylestrings. *Ithasnospecialhandlingfordoubledelimiterescapesasinbasic,or *thetripleddelimitersusedinpython,butshouldworkonthoseregardless *althoughinthosecasesasinglestringliteralmaybebrokenupinto *multipleadjacentstringliterals. * *ItrecognizesC,C++,andshellstylecomments. * *@param{Object}optionsasetofoptionalparameters. *@return{function(Object)}afunctionthatexaminesthesourcecode *intheinputjobandbuildsthedecorationlist.
*/ function sourceDecorator(options) { var shortcutStylePatterns = [], fallthroughStylePatterns = []; if (options['tripleQuotedStrings']) { // '''multi-line-string''', 'single-line-string', and double-quoted
shortcutStylePatterns.push(
[PR_STRING, /^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/, null, '\'"']);
} elseif (options['multiLineStrings']) { // 'multi-line-string', "multi-line-string"
shortcutStylePatterns.push(
[PR_STRING, /^(?:\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$)|\`(?:[^\\\`]|\\[\s\S])*(?:\`|$))/, null, '\'"`']);
} else { // 'single-line-string', "single-line-string"
shortcutStylePatterns.push(
[PR_STRING,
/^(?:\'(?:[^\\\'\r\n]|\\.)*(?:\'|$)|\"(?:[^\\\"\r\n]|\\.)*(?:\"|$))/, null, '"\'']);
} if (options['verbatimStrings']) { // verbatim-string-literal production from the C# grammar. See issue 93.
fallthroughStylePatterns.push(
[PR_STRING, /^@\"(?:[^\"]|\"\")*(?:\"|$)/, null]);
} var hc = options['hashComments']; if (hc) { if (options['cStyleComments']) { if (hc > 1) { // multiline hash comments
shortcutStylePatterns.push(
[PR_COMMENT, /^#(?:##(?:[^#]|#(?!##))*(?:###|$)|.*)/, null, '#']);
} else { // Stop C preprocessor declarations at an unclosed open comment
shortcutStylePatterns.push(
[PR_COMMENT, /^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\r\n]*)/, null, '#']);
} // #include <stdio.h>
fallthroughStylePatterns.push(
[PR_STRING,
/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h(?:h|pp|\+\+)?|[a-z]\w*)>/, null]);
} else {
shortcutStylePatterns.push([PR_COMMENT, /^#[^\r\n]*/, null, '#']);
}
} if (options['cStyleComments']) {
fallthroughStylePatterns.push([PR_COMMENT, /^\/\/[^\r\n]*/, null]);
fallthroughStylePatterns.push(
[PR_COMMENT, /^\/\*[\s\S]*?(?:\*\/|$)/, null]);
} if (options['regexLiterals']) { /** *@const
*/ var REGEX_LITERAL = ( // A regular expression literal starts with a slash that is // not followed by * or / so that it is not confused with // comments. '/(?=[^/*])' // and then contains any number of raw characters,
+ '(?:[^/\\x5B\\x5C]' // escape sequences (\x5C),
+ '|\\x5C[\\s\\S]' // or non-nesting character sets (\x5B\x5D);
+ '|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+' // finally closed by a /.
+ '/');
fallthroughStylePatterns.push(
['lang-regex', new RegExp('^' + REGEXP_PRECEDER_PATTERN + '(' + REGEX_LITERAL + ')')
]);
}
var types = options['types']; if (types) {
fallthroughStylePatterns.push([PR_TYPE, types]);
}
if (options['strings']) { var strings = ("" + options['strings']).replace(/^ | $/g, '').replace(/-/g, '\\-');
fallthroughStylePatterns.push(
[PR_STRING, new RegExp('(?:' + strings.replace(/[\s,]+/g, '|') + ')'),
, null]
);
}
var keywords = ("" + options['keywords']).replace(/^ | $/g, ''); if (keywords.length) {
fallthroughStylePatterns.push(
[PR_KEYWORD, new RegExp('^(?:' + keywords.replace(/[\s,]+/g, '|') + ')\\b'), null]);
}
/** *GivenaDOMsubtree,wrapsitinalist,andputseachlineintoitsown *listitem. * *@param{Node}nodemodifiedinplace.Itscontentispulledintoan *HTMLOListElement,andeachlineismovedintoaseparatelistitem. *Thisrequirescloningelements,sotheinputmightnothaveunique *IDsafternumbering. *@param{boolean}isPreformattedtrueiffwhite-spaceintextnodesshould *betreatedassignificant.
*/ function numberLines(node, opt_startLineNum, isPreformatted) { var nocode = /(?:^|\s)nocode(?:\s|$)/; var lineBreak = /\r\n?|\n/;
var document = node.ownerDocument;
var li = document.createElement('li'); while (node.firstChild) {
li.appendChild(node.firstChild);
} // An array of lines. We split below, so this is initialized to one // un-split line. var listItems = [li];
function walk(node) { switch (node.nodeType) { case1: // Element if (nocode.test(node.className)) { break; } if ('br' === node.nodeName) {
breakAfter(node); // Discard the <BR> since it is now flush against a </LI>. if (node.parentNode) {
node.parentNode.removeChild(node);
}
} else { for (var child = node.firstChild; child; child = child.nextSibling) {
walk(child);
}
} break; case3: case4: // Text if (isPreformatted) { var text = node.nodeValue; var match = text.match(lineBreak); if (match) { var firstLine = text.substring(0, match.index);
node.nodeValue = firstLine; var tail = text.substring(match.index + match[0].length); if (tail) { var parent = node.parentNode;
parent.insertBefore(
document.createTextNode(tail), node.nextSibling);
}
breakAfter(node); if (!firstLine) { // Don't leave blank text nodes in the DOM.
node.parentNode.removeChild(node);
}
}
} break;
}
}
// Split a line after the given node. function breakAfter(lineEndNode) { // If there's nothing to the right, then we can skip ending the line // here, and move root-wards since splitting just before an end-tag // would require us to create a bunch of empty copies. while (!lineEndNode.nextSibling) {
lineEndNode = lineEndNode.parentNode; if (!lineEndNode) { return; }
}
function breakLeftOf(limit, copy) { // Clone shallowly if this node needs to be on both sides of the break. var rightSide = copy ? limit.cloneNode(false) : limit; var parent = limit.parentNode; if (parent) { // We clone the parent chain. // This helps us resurrect important styling elements that cross lines. // E.g. in <i>Foo<br>Bar</i> // should be rewritten to <li><i>Foo</i></li><li><i>Bar</i></li>. var parentClone = breakLeftOf(parent, 1); // Move the clone and everything to the right of the original // onto the cloned parent. var next = limit.nextSibling;
parentClone.appendChild(rightSide); for (var sibling = next; sibling; sibling = next) {
next = sibling.nextSibling;
parentClone.appendChild(sibling);
}
} return rightSide;
}
var copiedListItem = breakLeftOf(lineEndNode.nextSibling, 0);
// Walk the parent chain until we reach an unattached LI. for (var parent; // Check nodeType since IE invents document fragments.
(parent = copiedListItem.parentNode) && parent.nodeType === 1;) {
copiedListItem = parent;
} // Put it on the list of lines for later processing.
listItems.push(copiedListItem);
}
// Split lines while there are lines left to split. for (var i = 0; // Number of lines that have been split so far.
i < listItems.length; // length updated by breakAfter calls.
++i) {
walk(listItems[i]);
}
// Make sure numeric indices show correctly. if (opt_startLineNum === (opt_startLineNum|0)) {
listItems[0].setAttribute('value', opt_startLineNum);
}
var ol = document.createElement('ol');
ol.className = 'linenums'; var offset = Math.max(0, ((opt_startLineNum - 1/* zero index */)) | 0) || 0; for (var i = 0, n = listItems.length; i < n; ++i) {
li = listItems[i]; // Stick a class on the LIs so that stylesheets can // color odd/even rows, or any other row pattern that // is co-prime with 10.
li.className = 'L' + ((i + offset) % 1); if (!li.firstChild) {
li.appendChild(document.createTextNode('\xA0'));
}
ol.appendChild(li);
}
var source = job.sourceCode; var sourceLength = source.length; // Index into source after the last code-unit recombined. var sourceIndex = 0;
var spans = job.spans; var nSpans = spans.length; // Index into spans after the last span which ends at or before sourceIndex. var spanIndex = 0;
var decorations = job.decorations; var nDecorations = decorations.length; // Index into decorations after the last decoration which ends at or before // sourceIndex. var decorationIndex = 0;
// Remove all zero-length decorations.
decorations[nDecorations] = sourceLength; var decPos, i; for (i = decPos = 0; i < nDecorations;) { if (decorations[i] !== decorations[i + 2]) {
decorations[decPos++] = decorations[i++];
decorations[decPos++] = decorations[i++];
} else {
i += 2;
}
}
nDecorations = decPos;
// Simplify decorations. for (i = decPos = 0; i < nDecorations;) { var startPos = decorations[i]; // Conflate all adjacent decorations that use the same style. var startDec = decorations[i + 1]; var end = i + 2; while (end + 2 <= nDecorations && decorations[end + 1] === startDec) {
end += 2;
}
decorations[decPos++] = startPos;
decorations[decPos++] = startDec;
i = end;
}
nDecorations = decorations.length = decPos;
var sourceNode = job.sourceNode; var oldDisplay; if (sourceNode) {
oldDisplay = sourceNode.style.display;
sourceNode.style.display = 'none';
} try { var decoration = null; var X = 0; while (spanIndex < nSpans) {
X = X + 1; if (X > 5000) { break; } var spanStart = spans[spanIndex]; var spanEnd = spans[spanIndex + 2] || sourceLength;
var decEnd = decorations[decorationIndex + 2] || sourceLength;
var end = Math.min(spanEnd, decEnd);
var textNode = spans[spanIndex + 1]; var styledText; if (textNode.nodeType !== 1// Don't muck with <BR>s or <LI>s // Don't introduce spans around empty text nodes.
&& (styledText = source.substring(sourceIndex, end))) { // This may seem bizarre, and it is. Emitting LF on IE causes the // code to display with spaces instead of line breaks. // Emitting Windows standard issue linebreaks (CRLF) causes a blank // space to appear at the beginning of every line but the first. // Emitting an old Mac OS 9 line separator makes everything spiffy. if (isIE8OrEarlier) {
styledText = styledText.replace(newlineRe, '\r');
}
textNode.nodeValue = styledText; var document = textNode.ownerDocument; var span = document.createElement('span');
span.className = decorations[decorationIndex + 1]; var parentNode = textNode.parentNode;
parentNode.replaceChild(span, textNode);
span.appendChild(textNode); if (sourceIndex < spanEnd) { // Split off a text node.
spans[spanIndex + 1] = textNode // TODO: Possibly optimize by using '' if there's no flicker.
= document.createTextNode(source.substring(end, spanEnd));
parentNode.insertBefore(textNode, span.nextSibling);
}
}
function applyDecorator(job) { var opt_langExtension = job.langExtension;
try { // Extract tags, and convert the source code to plain text. var sourceAndSpans = extractSourceSpans(job.sourceNode, job.pre); /** Plain text. @type {string} */ var source = sourceAndSpans.sourceCode;
job.sourceCode = source;
job.spans = sourceAndSpans.spans;
job.basePos = 0;
// Apply the appropriate language handler
langHandlerForExtension(opt_langExtension, source)(job);
// Integrate the decorations and tags back into the source code, // modifying the sourceNode in place.
recombineTagsAndDecorations(job);
} catch (e) { if (win['console']) {
console['log'](e && e['stack'] ? e['stack'] : e);
}
}
}
/** *@paramsourceCodeHtml{string}TheHTMLtoprettyprint. *@paramopt_langExtension{string}Thelanguagenametouse. *Typically,afilenameextensionlike'cpp'or'java'. *@paramopt_numberLines{number|boolean}Truetonumberlines, *orthe1-indexednumberofthefirstlineinsourceCodeHtml.
*/ function prettyPrintOne(sourceCodeHtml, opt_langExtension, opt_numberLines) { var container = document.createElement('pre'); // This could cause images to load and onload listeners to fire. // E.g. <img onerror="alert(1337)" src="nosuchimage.png">. // We assume that the inner HTML is from a trusted source.
container.innerHTML = sourceCodeHtml; if (opt_numberLines) {
numberLines(container, opt_numberLines, true);
}
function prettyPrint(opt_whenDone) { function byTagName(tn) { return document.getElementsByTagName(tn); } // fetch a list of nodes to rewrite var codeSegments = [byTagName('pre'), byTagName('code'), byTagName('xmp')]; var elements = []; for (var i = 0; i < codeSegments.length; ++i) { for (var j = 0, n = codeSegments[i].length; j < n; ++j) {
elements.push(codeSegments[i][j]);
}
}
codeSegments = null;
var clock = Date; if (!clock['now']) {
clock = { 'now': function () { return +(new Date); } };
}
// The loop is broken into a series of continuations to make sure that we // don't make the browser unresponsive when rewriting a large page. var k = 0; var prettyPrintingJob;
var langExtensionRe = /\blang(?:uage)?-([\w.]+)(?!\S)/; var prettyPrintRe = /\bprettyprint\b/; var prettyPrintedRe = /\bprettyprinted\b/; var preformattedTagNameRe = /pre|xmp/i; var codeRe = /^code$/i; var preCodeXmpRe = /^(?:pre|code|xmp)$/i;
function doWork() { var endTime = (win['PR_SHOULD_USE_CONTINUATION'] ?
clock['now']() + 250/* ms */ :
Infinity); for (; k < elements.length && clock['now']() < endTime; k++) { var cs = elements[k]; var className = cs.className; if (prettyPrintRe.test(className) // Don't redo this if we've already done it. // This allows recalling pretty print to just prettyprint elements // that have been added to the page since last call.
&& !prettyPrintedRe.test(className)) {
// make sure this is not nested in an already prettified element var nested = false; for (var p = cs.parentNode; p; p = p.parentNode) { var tn = p.tagName; if (preCodeXmpRe.test(tn)
&& p.className && prettyPrintRe.test(p.className)) {
nested = true; break;
}
} if (!nested) { // Mark done. If we fail to prettyprint for whatever reason, // we shouldn't try again.
cs.className += ' prettyprinted';
// If the classes includes a language extensions, use it. // Language extensions can be specified like // <pre class="prettyprint lang-cpp"> // the language extension "cpp" is used to find a language handler // as passed to PR.registerLangHandler. // HTML5 recommends that a language be specified using "language-" // as the prefix instead. Google Code Prettify supports both. // http://dev.w3.org/html5/spec-author-view/the-code-element.html var langExtension = className.match(langExtensionRe); // Support <pre class="prettyprint"><code class="language-c"> var wrapper; if (!langExtension && (wrapper = childContentWrapper(cs))
&& codeRe.test(wrapper.tagName)) {
langExtension = wrapper.className.match(langExtensionRe);
}
if (langExtension) { langExtension = langExtension[1]; }
// Look for a class like linenums or linenums:<n> where <n> is the // 1-indexed number of the first line. var lineNums = cs.className.match(/\blinenums\b(?::(\d+))?/);
lineNums = lineNums
? lineNums[1] && lineNums[1].length ? +lineNums[1] : true
: false; if (lineNums) { numberLines(cs, lineNums, preformatted); }
// do the pretty printing
prettyPrintingJob = {
langExtension: langExtension,
sourceNode: cs,
numberLines: lineNums,
pre: preformatted
};
applyDecorator(prettyPrintingJob);
}
}
} if (k < elements.length) { // finish up in a continuation
setTimeout(doWork, 250);
} elseif (opt_whenDone) {
opt_whenDone();
}
}
/* Register Lua syntaxes */
PR['registerLangHandler'](
PR['createSimpleLexer'](
[ // Whitespace
[PR['PR_PLAIN'], /^[\t\n\r \xA0]+/, null, '\t\n\r \xA0'], // A double or single quoted, possibly multi-line, string.
[PR['PR_STRING'], /^(?:\"(?:[^\"\\]|\\[\s\S])*(?:\"|$)|\'(?:[^\'\\]|\\[\s\S])*(?:\'|$))/, null, '"\'']
],
[ // A comment is either a line comment that starts with two dashes, or // two dashes preceding a long bracketed block.
[PR['PR_COMMENT'], /^--(?:\[(=*)\[[\s\S]*?(?:\]\1\]|$)|[^\r\n]*)/],
[PR['PR_TYPE'], /^nil|false|true/], // A long bracketed block not preceded by -- is a string.
[PR['PR_STRING'], /^\[(=*)\[[\s\S]*?(?:\]\1\]|$)/],
[PR['PR_KEYWORD'], /^(?:and|break|do|else|elseif|end|for|function|if|in|local|not|or|repeat|require|return|then|until|while)\b/, null], // A number is a hex integer literal, a decimal real literal, or in // scientific notation.
[PR['PR_LITERAL'],
/^[+-]?(?:0x[\da-f]+|(?:(?:\.\d+|\d+(?:\.\d*)?)(?:e[+\-]?\d+)?))/i], // An identifier
[PR['PR_PLAIN'], /^[a-z_]\w*/i], // A run of punctuation
[PR['PR_PUNCTUATION'], /^[^\w\t\n\r \xA0][^\w\t\n\r \xA0\"\'\-\+=]*/]
]),
['lua']);
// Make PR available via the Asynchronous Module Definition (AMD) API. // Per https://github.com/amdjs/amdjs-api/wiki/AMD: // The Asynchronous Module Definition (AMD) API specifies a // mechanism for defining modules such that the module and its // dependencies can be asynchronously loaded. // ... // To allow a clear indicator that a global define function (as // needed for script src browser loading) conforms to the AMD API, // any global define function SHOULD have a property called "amd" // whose value is an object. This helps avoid conflict with any // other existing JavaScript code that could have defined a define() // function that does not conform to the AMD API. if (typeof define === "function" && define['amd']) {
define("google-code-prettify", [], function () { return PR;
});
}
})();
Messung V0.5 in Prozent
¤ Dauer der Verarbeitung: 0.38 Sekunden
(vorverarbeitet am 2026-06-10)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.