@quick-game/cli
Version:
Command line interface for rapid qg development
316 lines • 12.3 kB
JavaScript
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
import * as Platform from '../../core/platform/platform.js';
import { SearchMatch, SearchMatchExact } from './ContentProvider.js';
import { Text } from './Text.js';
export const Utils = {
// TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
// eslint-disable-next-line @typescript-eslint/naming-convention
get _keyValueFilterRegex() {
return /(?:^|\s)(\-)?([\w\-]+):([^\s]+)/;
},
// TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
// eslint-disable-next-line @typescript-eslint/naming-convention
get _regexFilterRegex() {
return /(?:^|\s)(\-)?\/([^\/\\]+(\\.[^\/]+)*)\//;
},
// TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
// eslint-disable-next-line @typescript-eslint/naming-convention
get _textFilterRegex() {
return /(?:^|\s)(\-)?([^\s]+)/;
},
// TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
// eslint-disable-next-line @typescript-eslint/naming-convention
get _SpaceCharRegex() {
return /\s/;
},
isSpaceChar: function (char) {
return Utils._SpaceCharRegex.test(char);
},
lineIndent: function (line) {
let indentation = 0;
while (indentation < line.length && Utils.isSpaceChar(line.charAt(indentation))) {
++indentation;
}
return line.substr(0, indentation);
},
splitStringByRegexes(text, regexes) {
const matches = [];
const globalRegexes = [];
for (let i = 0; i < regexes.length; i++) {
const regex = regexes[i];
if (!regex.global) {
globalRegexes.push(new RegExp(regex.source, regex.flags ? regex.flags + 'g' : 'g'));
}
else {
globalRegexes.push(regex);
}
}
doSplit(text, 0, 0);
return matches;
function doSplit(text, regexIndex, startIndex) {
if (regexIndex >= globalRegexes.length) {
// Set regexIndex as -1 if text did not match with any regular expression
matches.push({ value: text, position: startIndex, regexIndex: -1, captureGroups: [] });
return;
}
const regex = globalRegexes[regexIndex];
let currentIndex = 0;
let result;
regex.lastIndex = 0;
while ((result = regex.exec(text)) !== null) {
const stringBeforeMatch = text.substring(currentIndex, result.index);
if (stringBeforeMatch) {
doSplit(stringBeforeMatch, regexIndex + 1, startIndex + currentIndex);
}
const match = result[0];
matches.push({
value: match,
position: startIndex + result.index,
regexIndex: regexIndex,
captureGroups: result.slice(1),
});
currentIndex = result.index + match.length;
}
const stringAfterMatches = text.substring(currentIndex);
if (stringAfterMatches) {
doSplit(stringAfterMatches, regexIndex + 1, startIndex + currentIndex);
}
}
},
};
export class FilterParser {
keys;
constructor(keys) {
this.keys = keys;
}
static cloneFilter(filter) {
return { key: filter.key, text: filter.text, regex: filter.regex, negative: filter.negative };
}
parse(query) {
const splitFilters = Utils.splitStringByRegexes(query, [Utils._keyValueFilterRegex, Utils._regexFilterRegex, Utils._textFilterRegex]);
const parsedFilters = [];
for (const { regexIndex, captureGroups } of splitFilters) {
if (regexIndex === -1) {
continue;
}
if (regexIndex === 0) {
const startsWithMinus = captureGroups[0];
const parsedKey = captureGroups[1];
const parsedValue = captureGroups[2];
if (this.keys.indexOf(parsedKey) !== -1) {
parsedFilters.push({
key: parsedKey,
regex: undefined,
text: parsedValue,
negative: Boolean(startsWithMinus),
});
}
else {
parsedFilters.push({
key: undefined,
regex: undefined,
text: `${parsedKey}:${parsedValue}`,
negative: Boolean(startsWithMinus),
});
}
}
else if (regexIndex === 1) {
const startsWithMinus = captureGroups[0];
const parsedRegex = captureGroups[1];
try {
parsedFilters.push({
key: undefined,
regex: new RegExp(parsedRegex, 'i'),
text: undefined,
negative: Boolean(startsWithMinus),
});
}
catch (e) {
parsedFilters.push({
key: undefined,
regex: undefined,
text: `/${parsedRegex}/`,
negative: Boolean(startsWithMinus),
});
}
}
else if (regexIndex === 2) {
const startsWithMinus = captureGroups[0];
const parsedText = captureGroups[1];
parsedFilters.push({
key: undefined,
regex: undefined,
text: parsedText,
negative: Boolean(startsWithMinus),
});
}
}
return parsedFilters;
}
}
export class BalancedJSONTokenizer {
callback;
index;
balance;
buffer;
findMultiple;
closingDoubleQuoteRegex;
lastBalancedIndex;
constructor(callback, findMultiple) {
this.callback = callback;
this.index = 0;
this.balance = 0;
this.buffer = '';
this.findMultiple = findMultiple || false;
this.closingDoubleQuoteRegex = /[^\\](?:\\\\)*"/g;
}
write(chunk) {
this.buffer += chunk;
const lastIndex = this.buffer.length;
const buffer = this.buffer;
let index;
for (index = this.index; index < lastIndex; ++index) {
const character = buffer[index];
if (character === '"') {
this.closingDoubleQuoteRegex.lastIndex = index;
if (!this.closingDoubleQuoteRegex.test(buffer)) {
break;
}
index = this.closingDoubleQuoteRegex.lastIndex - 1;
}
else if (character === '{') {
++this.balance;
}
else if (character === '}') {
--this.balance;
if (this.balance < 0) {
this.reportBalanced();
return false;
}
if (!this.balance) {
this.lastBalancedIndex = index + 1;
if (!this.findMultiple) {
break;
}
}
}
else if (character === ']' && !this.balance) {
this.reportBalanced();
return false;
}
}
this.index = index;
this.reportBalanced();
return true;
}
reportBalanced() {
if (!this.lastBalancedIndex) {
return;
}
this.callback(this.buffer.slice(0, this.lastBalancedIndex));
this.buffer = this.buffer.slice(this.lastBalancedIndex);
this.index -= this.lastBalancedIndex;
this.lastBalancedIndex = 0;
}
remainder() {
return this.buffer;
}
}
/**
* Heuristic to check whether a given text was likely minified. Intended to
* be used for HTML, CSS, and JavaScript inputs.
*
* A text is considered to be the result of minification if the average
* line length for the whole text is 80 characters or more.
*
* @param text The input text to check.
* @returns
*/
export const isMinified = function (text) {
let lineCount = 0;
for (let lastIndex = 0; lastIndex < text.length; ++lineCount) {
let eolIndex = text.indexOf('\n', lastIndex);
if (eolIndex < 0) {
eolIndex = text.length;
}
lastIndex = eolIndex + 1;
}
return (text.length - lineCount) / lineCount >= 80;
};
export const performSearchInContent = function (content, query, caseSensitive, isRegex) {
const regex = Platform.StringUtilities.createSearchRegex(query, caseSensitive, isRegex);
const text = new Text(content);
const result = [];
for (let i = 0; i < text.lineCount(); ++i) {
const lineContent = text.lineAt(i);
regex.lastIndex = 0;
const match = regex.exec(lineContent);
if (match) {
result.push(new SearchMatch(i, lineContent, match.index));
}
}
return result;
};
/**
* Similar to {@link performSearchInContent} but returns one entry per match,
* not per line.
*/
export const performExtendedSearchInContent = function (content, query, caseSensitive, isRegex) {
const regex = Platform.StringUtilities.createSearchRegex(query, caseSensitive, isRegex);
const text = new Text(content);
const result = [];
for (let i = 0; i < text.lineCount(); ++i) {
const lineContent = text.lineAt(i);
const matches = lineContent.matchAll(regex);
for (const match of matches) {
result.push(new SearchMatchExact(i, lineContent, match.index, match[0].length));
}
}
return result;
};
/**
* Similar to {@link performExtendedSearchInContent} but doesn't search in a whole text but rather
* finds the exact matches on a prelminiary search result (i.e. lines with known matches).
* @param matches is deliberatedly not typed as {@link SearchMatch} so we can also pass the
* CDP search result type.
*/
export const performExtendedSearchInSearchMatches = function (matches, query, caseSensitive, isRegex) {
const regex = Platform.StringUtilities.createSearchRegex(query, caseSensitive, isRegex);
const result = [];
for (const { lineNumber, lineContent } of matches) {
const matches = lineContent.matchAll(regex);
for (const match of matches) {
result.push(new SearchMatchExact(lineNumber, lineContent, match.index, match[0].length));
}
}
return result;
};
//# sourceMappingURL=TextUtils.js.map