1/** 2 * SyntaxHighlighter 3 * http://alexgorbatchev.com/ 4 * 5 * SyntaxHighlighter is donationware. If you are using it, please donate. 6 * http://alexgorbatchev.com/wiki/SyntaxHighlighter:Donate 7 * 8 * @version 9 * 2.0.296 (March 01 2009) 10 * 11 * @copyright 12 * Copyright (C) 2004-2009 Alex Gorbatchev. 13 * 14 * @license 15 * This file is part of SyntaxHighlighter. 16 * 17 * SyntaxHighlighter is free software: you can redistribute it and/or modify 18 * it under the terms of the GNU General Public License as published by 19 * the Free Software Foundation, either version 3 of the License, or 20 * (at your option) any later version. 21 * 22 * SyntaxHighlighter is distributed in the hope that it will be useful, 23 * but WITHOUT ANY WARRANTY; without even the implied warranty of 24 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 25 * GNU General Public License for more details. 26 * 27 * You should have received a copy of the GNU General Public License 28 * along with SyntaxHighlighter. If not, see <http://www.gnu.org/licenses/>. 29 * 30 * 31 * Very simple Latex brush 32 * http://www.jorgemarsal.com/blog/ 33 */ 34 35 36 37SyntaxHighlighter.brushes.Latex = function() 38{ 39 var keywords = 'if fi then elif else for do done until while break continue case function return in eq ne gt lt ge le'; 40 //var commands = 'include usepackage begin end ref label includegraphics'; 41 42 this.regexList = [ 43 { regex: new RegExp('%.*','gm'), css: 'comments' }, // one line comments 44 { regex: SyntaxHighlighter.regexLib.doubleQuotedString, css: 'string' }, // double quoted strings 45 { regex: new RegExp('\\\\\\w*','gm'), css: 'keyword' }, // commands 46 { regex: new RegExp(this.getKeywords(keywords), 'gm'), css: 'function' }, // keywords 47 ]; 48} 49 50SyntaxHighlighter.brushes.Latex.prototype = new SyntaxHighlighter.Highlighter(); 51SyntaxHighlighter.brushes.Latex.aliases = ['latex', 'tex']; 52
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.