Vitaly Puzrin
10 years ago
13 changed files with 107 additions and 155 deletions
@ -1,87 +0,0 @@ |
|||
// Common functions for parsers
|
|||
|
|||
'use strict'; |
|||
|
|||
|
|||
// Check if line has zero length or contains spaces only
|
|||
function isEmpty(state, line) { |
|||
return state.bMarks[line] + state.tShift[line] >= state.eMarks[line]; |
|||
} |
|||
|
|||
// Scan lines from given one and return first not empty
|
|||
function skipEmptyLines(state, from) { |
|||
for (var max = state.lineMax; from < max; from++) { |
|||
if (state.bMarks[from] + state.tShift[from] < state.eMarks[from]) { |
|||
break; |
|||
} |
|||
} |
|||
return from; |
|||
} |
|||
|
|||
// Skip spaces from given position.
|
|||
function skipSpaces(state, pos) { |
|||
for (var max = state.src.length; pos < max; pos++) { |
|||
if (state.src.charCodeAt(pos) !== 0x20/* space */) { break; } |
|||
} |
|||
return pos; |
|||
} |
|||
|
|||
// Skip char codes from given position
|
|||
function skipChars(state, pos, code) { |
|||
for (var max = state.src.length; pos < max; pos++) { |
|||
if (state.src.charCodeAt(pos) !== code) { break; } |
|||
} |
|||
return pos; |
|||
} |
|||
|
|||
// Skip char codes reverse from given position - 1
|
|||
function skipCharsBack(state, pos, code, min) { |
|||
if (pos <= min) { return pos; } |
|||
|
|||
while (pos > min) { |
|||
if (code !== state.src.charCodeAt(--pos)) { return pos + 1; } |
|||
} |
|||
return pos; |
|||
} |
|||
|
|||
// cut lines range from source.
|
|||
function getLines(state, begin, end, indent, keepLastLF) { |
|||
var i, first, last, queue, |
|||
line = begin; |
|||
|
|||
if (begin >= end) { |
|||
return ''; |
|||
} |
|||
|
|||
// Opt: don't use push queue for single line;
|
|||
if (line + 1 === end) { |
|||
first = state.bMarks[line] + Math.min(state.tShift[line], indent); |
|||
last = keepLastLF ? state.bMarks[end] : state.eMarks[end - 1]; |
|||
return state.src.slice(first, last); |
|||
} |
|||
|
|||
queue = new Array(end - begin); |
|||
|
|||
for (i = 0; line < end; line++, i++) { |
|||
first = state.bMarks[line] + Math.min(state.tShift[line], indent); |
|||
|
|||
if (line + 1 < end || keepLastLF) { |
|||
// No need for bounds check because we have fake entry on tail.
|
|||
last = state.eMarks[line] + 1; |
|||
} else { |
|||
last = state.eMarks[line]; |
|||
} |
|||
|
|||
queue[i] = state.src.slice(first, last); |
|||
} |
|||
|
|||
return queue.join(''); |
|||
} |
|||
|
|||
|
|||
exports.isEmpty = isEmpty; |
|||
exports.skipEmptyLines = skipEmptyLines; |
|||
exports.skipSpaces = skipSpaces; |
|||
exports.skipChars = skipChars; |
|||
exports.getLines = getLines; |
|||
exports.skipCharsBack = skipCharsBack; |
|||
Loading…
Reference in new issue