[deps] Update 'eslint-plugin-jsdoc' to 46.10.1
This silences a warning because our Node engine is newer then the
package expects.
There are newer versions of the plugin by now, but the transitive
dependencies are younger than 1 week so the audit mirror blocks them.
46.10.1 seems like it was stable for a couple months so we use that.
[email protected]
Bug: None
Change-Id: Icf1c1276852e55dcad97d2ea2eeb6a8d7a9d82ae
Reviewed-on: https://chromium-review.googlesource.com/c/devtools/devtools-frontend/+/5660063
Commit-Queue: Simon Zünd <[email protected]>
Auto-Submit: Simon Zünd <[email protected]>
Commit-Queue: Alex Rudenko <[email protected]>
Reviewed-by: Alex Rudenko <[email protected]>
diff --git a/node_modules/esquery/dist/esquery.esm.js b/node_modules/esquery/dist/esquery.esm.js
index 7a62b8b..40a9f49 100644
--- a/node_modules/esquery/dist/esquery.esm.js
+++ b/node_modules/esquery/dist/esquery.esm.js
@@ -1,66 +1,54 @@
+function _iterableToArrayLimit(arr, i) {
+ var _i = null == arr ? null : "undefined" != typeof Symbol && arr[Symbol.iterator] || arr["@@iterator"];
+ if (null != _i) {
+ var _s,
+ _e,
+ _x,
+ _r,
+ _arr = [],
+ _n = !0,
+ _d = !1;
+ try {
+ if (_x = (_i = _i.call(arr)).next, 0 === i) {
+ if (Object(_i) !== _i) return;
+ _n = !1;
+ } else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0);
+ } catch (err) {
+ _d = !0, _e = err;
+ } finally {
+ try {
+ if (!_n && null != _i.return && (_r = _i.return(), Object(_r) !== _r)) return;
+ } finally {
+ if (_d) throw _e;
+ }
+ }
+ return _arr;
+ }
+}
function _typeof(obj) {
"@babel/helpers - typeof";
- if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") {
- _typeof = function (obj) {
- return typeof obj;
- };
- } else {
- _typeof = function (obj) {
- return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
- };
- }
-
- return _typeof(obj);
+ return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+ return typeof obj;
+ } : function (obj) {
+ return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+ }, _typeof(obj);
}
-
function _slicedToArray(arr, i) {
return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
}
-
function _toConsumableArray(arr) {
return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();
}
-
function _arrayWithoutHoles(arr) {
if (Array.isArray(arr)) return _arrayLikeToArray(arr);
}
-
function _arrayWithHoles(arr) {
if (Array.isArray(arr)) return arr;
}
-
function _iterableToArray(iter) {
- if (typeof Symbol !== "undefined" && Symbol.iterator in Object(iter)) return Array.from(iter);
+ if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
}
-
-function _iterableToArrayLimit(arr, i) {
- if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(arr))) return;
- var _arr = [];
- var _n = true;
- var _d = false;
- var _e = undefined;
-
- try {
- for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) {
- _arr.push(_s.value);
-
- if (i && _arr.length === i) break;
- }
- } catch (err) {
- _d = true;
- _e = err;
- } finally {
- try {
- if (!_n && _i["return"] != null) _i["return"]();
- } finally {
- if (_d) throw _e;
- }
- }
-
- return _arr;
-}
-
function _unsupportedIterableToArray(o, minLen) {
if (!o) return;
if (typeof o === "string") return _arrayLikeToArray(o, minLen);
@@ -69,80 +57,18 @@
if (n === "Map" || n === "Set") return Array.from(o);
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
}
-
function _arrayLikeToArray(arr, len) {
if (len == null || len > arr.length) len = arr.length;
-
for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
-
return arr2;
}
-
function _nonIterableSpread() {
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
}
-
function _nonIterableRest() {
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
}
-function _createForOfIteratorHelper(o, allowArrayLike) {
- var it;
-
- if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) {
- if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
- if (it) o = it;
- var i = 0;
-
- var F = function () {};
-
- return {
- s: F,
- n: function () {
- if (i >= o.length) return {
- done: true
- };
- return {
- done: false,
- value: o[i++]
- };
- },
- e: function (e) {
- throw e;
- },
- f: F
- };
- }
-
- throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
- }
-
- var normalCompletion = true,
- didErr = false,
- err;
- return {
- s: function () {
- it = o[Symbol.iterator]();
- },
- n: function () {
- var step = it.next();
- normalCompletion = step.done;
- return step;
- },
- e: function (e) {
- didErr = true;
- err = e;
- },
- f: function () {
- try {
- if (!normalCompletion && it.return != null) it.return();
- } finally {
- if (didErr) throw err;
- }
- }
- };
-}
-
var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
function createCommonjsModule(fn, module) {
@@ -174,25 +100,19 @@
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
-
/*jslint vars:false, bitwise:true*/
-
/*jshint indent:4*/
-
/*global exports:true*/
(function clone(exports) {
var Syntax, VisitorOption, VisitorKeys, BREAK, SKIP, REMOVE;
-
function deepCopy(obj) {
var ret = {},
- key,
- val;
-
+ key,
+ val;
for (key in obj) {
if (obj.hasOwnProperty(key)) {
val = obj[key];
-
if (typeof val === 'object' && val !== null) {
ret[key] = deepCopy(val);
} else {
@@ -200,21 +120,19 @@
}
}
}
-
return ret;
- } // based on LLVM libc++ upper_bound / lower_bound
- // MIT License
+ }
+ // based on LLVM libc++ upper_bound / lower_bound
+ // MIT License
function upperBound(array, func) {
var diff, len, i, current;
len = array.length;
i = 0;
-
while (len) {
diff = len >>> 1;
current = i + diff;
-
if (func(array[current])) {
len = diff;
} else {
@@ -222,10 +140,8 @@
len -= diff + 1;
}
}
-
return i;
}
-
Syntax = {
AssignmentExpression: 'AssignmentExpression',
AssignmentPattern: 'AssignmentPattern',
@@ -282,8 +198,10 @@
NewExpression: 'NewExpression',
ObjectExpression: 'ObjectExpression',
ObjectPattern: 'ObjectPattern',
+ PrivateIdentifier: 'PrivateIdentifier',
Program: 'Program',
Property: 'Property',
+ PropertyDefinition: 'PropertyDefinition',
RestElement: 'RestElement',
ReturnStatement: 'ReturnStatement',
SequenceExpression: 'SequenceExpression',
@@ -361,8 +279,10 @@
NewExpression: ['callee', 'arguments'],
ObjectExpression: ['properties'],
ObjectPattern: ['properties'],
+ PrivateIdentifier: [],
Program: ['body'],
Property: ['key', 'value'],
+ PropertyDefinition: ['key', 'value'],
RestElement: ['argument'],
ReturnStatement: ['argument'],
SequenceExpression: ['expressions'],
@@ -383,8 +303,9 @@
WhileStatement: ['test', 'body'],
WithStatement: ['object', 'body'],
YieldExpression: ['argument']
- }; // unique id
+ };
+ // unique id
BREAK = {};
SKIP = {};
REMOVE = {};
@@ -393,16 +314,13 @@
Skip: SKIP,
Remove: REMOVE
};
-
function Reference(parent, key) {
this.parent = parent;
this.key = key;
}
-
Reference.prototype.replace = function replace(node) {
this.parent[this.key] = node;
};
-
Reference.prototype.remove = function remove() {
if (Array.isArray(this.parent)) {
this.parent.splice(this.key, 1);
@@ -412,21 +330,18 @@
return false;
}
};
-
function Element(node, path, wrap, ref) {
this.node = node;
this.path = path;
this.wrap = wrap;
this.ref = ref;
}
+ function Controller() {}
- function Controller() {} // API:
+ // API:
// return property path array from root to current node
-
-
Controller.prototype.path = function path() {
var i, iz, j, jz, result, element;
-
function addToPath(result, path) {
if (Array.isArray(path)) {
for (j = 0, jz = path.length; j < jz; ++j) {
@@ -435,91 +350,84 @@
} else {
result.push(path);
}
- } // root node
+ }
-
+ // root node
if (!this.__current.path) {
return null;
- } // first node is sentinel, second node is root element
+ }
-
+ // first node is sentinel, second node is root element
result = [];
-
for (i = 2, iz = this.__leavelist.length; i < iz; ++i) {
element = this.__leavelist[i];
addToPath(result, element.path);
}
-
addToPath(result, this.__current.path);
return result;
- }; // API:
+ };
+
+ // API:
// return type of current node
-
-
Controller.prototype.type = function () {
var node = this.current();
return node.type || this.__current.wrap;
- }; // API:
+ };
+
+ // API:
// return array of parent elements
-
-
Controller.prototype.parents = function parents() {
- var i, iz, result; // first node is sentinel
+ var i, iz, result;
+ // first node is sentinel
result = [];
-
for (i = 1, iz = this.__leavelist.length; i < iz; ++i) {
result.push(this.__leavelist[i].node);
}
-
return result;
- }; // API:
+ };
+
+ // API:
// return current node
-
-
Controller.prototype.current = function current() {
return this.__current.node;
};
-
Controller.prototype.__execute = function __execute(callback, element) {
var previous, result;
result = undefined;
previous = this.__current;
this.__current = element;
this.__state = null;
-
if (callback) {
result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node);
}
-
this.__current = previous;
return result;
- }; // API:
+ };
+
+ // API:
// notify control skip / break
-
-
Controller.prototype.notify = function notify(flag) {
this.__state = flag;
- }; // API:
+ };
+
+ // API:
// skip child nodes of current node
-
-
Controller.prototype.skip = function () {
this.notify(SKIP);
- }; // API:
+ };
+
+ // API:
// break traversals
-
-
Controller.prototype['break'] = function () {
this.notify(BREAK);
- }; // API:
+ };
+
+ // API:
// remove node
-
-
Controller.prototype.remove = function () {
this.notify(REMOVE);
};
-
Controller.prototype.__initialize = function (root, visitor) {
this.visitor = visitor;
this.root = root;
@@ -528,87 +436,68 @@
this.__current = null;
this.__state = null;
this.__fallback = null;
-
if (visitor.fallback === 'iteration') {
this.__fallback = Object.keys;
} else if (typeof visitor.fallback === 'function') {
this.__fallback = visitor.fallback;
}
-
this.__keys = VisitorKeys;
-
if (visitor.keys) {
this.__keys = Object.assign(Object.create(this.__keys), visitor.keys);
}
};
-
function isNode(node) {
if (node == null) {
return false;
}
-
return typeof node === 'object' && typeof node.type === 'string';
}
-
function isProperty(nodeType, key) {
return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key;
}
-
function candidateExistsInLeaveList(leavelist, candidate) {
for (var i = leavelist.length - 1; i >= 0; --i) {
if (leavelist[i].node === candidate) {
return true;
}
}
-
return false;
}
-
Controller.prototype.traverse = function traverse(root, visitor) {
var worklist, leavelist, element, node, nodeType, ret, key, current, current2, candidates, candidate, sentinel;
-
this.__initialize(root, visitor);
+ sentinel = {};
- sentinel = {}; // reference
-
+ // reference
worklist = this.__worklist;
- leavelist = this.__leavelist; // initialize
+ leavelist = this.__leavelist;
+ // initialize
worklist.push(new Element(root, null, null, null));
leavelist.push(new Element(null, null, null, null));
-
while (worklist.length) {
element = worklist.pop();
-
if (element === sentinel) {
element = leavelist.pop();
ret = this.__execute(visitor.leave, element);
-
if (this.__state === BREAK || ret === BREAK) {
return;
}
-
continue;
}
-
if (element.node) {
ret = this.__execute(visitor.enter, element);
-
if (this.__state === BREAK || ret === BREAK) {
return;
}
-
worklist.push(sentinel);
leavelist.push(element);
-
if (this.__state === SKIP || ret === SKIP) {
continue;
}
-
node = element.node;
nodeType = node.type || element.wrap;
candidates = this.__keys[nodeType];
-
if (!candidates) {
if (this.__fallback) {
candidates = this.__fallback(node);
@@ -616,29 +505,22 @@
throw new Error('Unknown node type ' + nodeType + '.');
}
}
-
current = candidates.length;
-
while ((current -= 1) >= 0) {
key = candidates[current];
candidate = node[key];
-
if (!candidate) {
continue;
}
-
if (Array.isArray(candidate)) {
current2 = candidate.length;
-
while ((current2 -= 1) >= 0) {
if (!candidate[current2]) {
continue;
}
-
if (candidateExistsInLeaveList(leavelist, candidate[current2])) {
continue;
}
-
if (isProperty(nodeType, candidates[current])) {
element = new Element(candidate[current2], [key, current2], 'Property', null);
} else if (isNode(candidate[current2])) {
@@ -646,121 +528,103 @@
} else {
continue;
}
-
worklist.push(element);
}
} else if (isNode(candidate)) {
if (candidateExistsInLeaveList(leavelist, candidate)) {
continue;
}
-
worklist.push(new Element(candidate, key, null, null));
}
}
}
}
};
-
Controller.prototype.replace = function replace(root, visitor) {
var worklist, leavelist, node, nodeType, target, element, current, current2, candidates, candidate, sentinel, outer, key;
-
function removeElem(element) {
var i, key, nextElem, parent;
-
if (element.ref.remove()) {
// When the reference is an element of an array.
key = element.ref.key;
- parent = element.ref.parent; // If removed from array, then decrease following items' keys.
+ parent = element.ref.parent;
+ // If removed from array, then decrease following items' keys.
i = worklist.length;
-
while (i--) {
nextElem = worklist[i];
-
if (nextElem.ref && nextElem.ref.parent === parent) {
if (nextElem.ref.key < key) {
break;
}
-
--nextElem.ref.key;
}
}
}
}
-
this.__initialize(root, visitor);
+ sentinel = {};
- sentinel = {}; // reference
-
+ // reference
worklist = this.__worklist;
- leavelist = this.__leavelist; // initialize
+ leavelist = this.__leavelist;
+ // initialize
outer = {
root: root
};
element = new Element(root, null, null, new Reference(outer, 'root'));
worklist.push(element);
leavelist.push(element);
-
while (worklist.length) {
element = worklist.pop();
-
if (element === sentinel) {
element = leavelist.pop();
- target = this.__execute(visitor.leave, element); // node may be replaced with null,
- // so distinguish between undefined and null in this place
+ target = this.__execute(visitor.leave, element);
+ // node may be replaced with null,
+ // so distinguish between undefined and null in this place
if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
// replace
element.ref.replace(target);
}
-
if (this.__state === REMOVE || target === REMOVE) {
removeElem(element);
}
-
if (this.__state === BREAK || target === BREAK) {
return outer.root;
}
-
continue;
}
+ target = this.__execute(visitor.enter, element);
- target = this.__execute(visitor.enter, element); // node may be replaced with null,
+ // node may be replaced with null,
// so distinguish between undefined and null in this place
-
if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) {
// replace
element.ref.replace(target);
element.node = target;
}
-
if (this.__state === REMOVE || target === REMOVE) {
removeElem(element);
element.node = null;
}
-
if (this.__state === BREAK || target === BREAK) {
return outer.root;
- } // node may be null
+ }
-
+ // node may be null
node = element.node;
-
if (!node) {
continue;
}
-
worklist.push(sentinel);
leavelist.push(element);
-
if (this.__state === SKIP || target === SKIP) {
continue;
}
-
nodeType = node.type || element.wrap;
candidates = this.__keys[nodeType];
-
if (!candidates) {
if (this.__fallback) {
candidates = this.__fallback(node);
@@ -768,25 +632,19 @@
throw new Error('Unknown node type ' + nodeType + '.');
}
}
-
current = candidates.length;
-
while ((current -= 1) >= 0) {
key = candidates[current];
candidate = node[key];
-
if (!candidate) {
continue;
}
-
if (Array.isArray(candidate)) {
current2 = candidate.length;
-
while ((current2 -= 1) >= 0) {
if (!candidate[current2]) {
continue;
}
-
if (isProperty(nodeType, candidates[current])) {
element = new Element(candidate[current2], [key, current2], 'Property', new Reference(candidate, current2));
} else if (isNode(candidate[current2])) {
@@ -794,7 +652,6 @@
} else {
continue;
}
-
worklist.push(element);
}
} else if (isNode(candidate)) {
@@ -802,53 +659,43 @@
}
}
}
-
return outer.root;
};
-
function traverse(root, visitor) {
var controller = new Controller();
return controller.traverse(root, visitor);
}
-
function replace(root, visitor) {
var controller = new Controller();
return controller.replace(root, visitor);
}
-
function extendCommentRange(comment, tokens) {
var target;
target = upperBound(tokens, function search(token) {
return token.range[0] > comment.range[0];
});
comment.extendedRange = [comment.range[0], comment.range[1]];
-
if (target !== tokens.length) {
comment.extendedRange[1] = tokens[target].range[0];
}
-
target -= 1;
-
if (target >= 0) {
comment.extendedRange[0] = tokens[target].range[1];
}
-
return comment;
}
-
function attachComments(tree, providedComments, tokens) {
// At first, we should calculate extended comment ranges.
var comments = [],
- comment,
- len,
- i,
- cursor;
-
+ comment,
+ len,
+ i,
+ cursor;
if (!tree.range) {
throw new Error('attachComments needs range information');
- } // tokens array is empty, we attach comments to tree as 'leadingComments'
+ }
-
+ // tokens array is empty, we attach comments to tree as 'leadingComments'
if (!tokens.length) {
if (providedComments.length) {
for (i = 0, len = providedComments.length; i < len; i += 1) {
@@ -856,47 +703,39 @@
comment.extendedRange = [0, tree.range[0]];
comments.push(comment);
}
-
tree.leadingComments = comments;
}
-
return tree;
}
-
for (i = 0, len = providedComments.length; i < len; i += 1) {
comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens));
- } // This is based on John Freeman's implementation.
+ }
-
+ // This is based on John Freeman's implementation.
cursor = 0;
traverse(tree, {
enter: function (node) {
var comment;
-
while (cursor < comments.length) {
comment = comments[cursor];
-
if (comment.extendedRange[1] > node.range[0]) {
break;
}
-
if (comment.extendedRange[1] === node.range[0]) {
if (!node.leadingComments) {
node.leadingComments = [];
}
-
node.leadingComments.push(comment);
comments.splice(cursor, 1);
} else {
cursor += 1;
}
- } // already out of owned node
+ }
-
+ // already out of owned node
if (cursor === comments.length) {
return VisitorOption.Break;
}
-
if (comments[cursor].extendedRange[0] > node.range[1]) {
return VisitorOption.Skip;
}
@@ -906,31 +745,26 @@
traverse(tree, {
leave: function (node) {
var comment;
-
while (cursor < comments.length) {
comment = comments[cursor];
-
if (node.range[1] < comment.extendedRange[0]) {
break;
}
-
if (node.range[1] === comment.extendedRange[0]) {
if (!node.trailingComments) {
node.trailingComments = [];
}
-
node.trailingComments.push(comment);
comments.splice(cursor, 1);
} else {
cursor += 1;
}
- } // already out of owned node
+ }
-
+ // already out of owned node
if (cursor === comments.length) {
return VisitorOption.Break;
}
-
if (comments[cursor].extendedRange[0] > node.range[1]) {
return VisitorOption.Skip;
}
@@ -938,7 +772,6 @@
});
return tree;
}
-
exports.Syntax = Syntax;
exports.traverse = traverse;
exports.replace = replace;
@@ -946,15 +779,12 @@
exports.VisitorKeys = VisitorKeys;
exports.VisitorOption = VisitorOption;
exports.Controller = Controller;
-
exports.cloneEnvironment = function () {
return clone({});
};
-
return exports;
})(exports);
/* vim: set sw=4 ts=4 et tw=80 : */
-
});
var parser = createCommonjsModule(function (module) {
@@ -973,25 +803,20 @@
function ctor() {
this.constructor = child;
}
-
ctor.prototype = parent.prototype;
child.prototype = new ctor();
}
-
function peg$SyntaxError(message, expected, found, location) {
this.message = message;
this.expected = expected;
this.found = found;
this.location = location;
this.name = "SyntaxError";
-
if (typeof Error.captureStackTrace === "function") {
Error.captureStackTrace(this, peg$SyntaxError);
}
}
-
peg$subclass(peg$SyntaxError, Error);
-
peg$SyntaxError.buildMessage = function (expected, found) {
var DESCRIBE_EXPECTATION_FNS = {
literal: function literal(expectation) {
@@ -999,12 +824,10 @@
},
"class": function _class(expectation) {
var escapedParts = "",
- i;
-
+ i;
for (i = 0; i < expectation.parts.length; i++) {
escapedParts += expectation.parts[i] instanceof Array ? classEscape(expectation.parts[i][0]) + "-" + classEscape(expectation.parts[i][1]) : classEscape(expectation.parts[i]);
}
-
return "[" + (expectation.inverted ? "^" : "") + escapedParts + "]";
},
any: function any(expectation) {
@@ -1017,11 +840,9 @@
return expectation.description;
}
};
-
function hex(ch) {
return ch.charCodeAt(0).toString(16).toUpperCase();
}
-
function literalEscape(s) {
return s.replace(/\\/g, '\\\\').replace(/"/g, '\\"').replace(/\0/g, '\\0').replace(/\t/g, '\\t').replace(/\n/g, '\\n').replace(/\r/g, '\\r').replace(/[\x00-\x0F]/g, function (ch) {
return '\\x0' + hex(ch);
@@ -1029,7 +850,6 @@
return '\\x' + hex(ch);
});
}
-
function classEscape(s) {
return s.replace(/\\/g, '\\\\').replace(/\]/g, '\\]').replace(/\^/g, '\\^').replace(/-/g, '\\-').replace(/\0/g, '\\0').replace(/\t/g, '\\t').replace(/\n/g, '\\n').replace(/\r/g, '\\r').replace(/[\x00-\x0F]/g, function (ch) {
return '\\x0' + hex(ch);
@@ -1037,22 +857,17 @@
return '\\x' + hex(ch);
});
}
-
function describeExpectation(expectation) {
return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);
}
-
function describeExpected(expected) {
var descriptions = new Array(expected.length),
- i,
- j;
-
+ i,
+ j;
for (i = 0; i < expected.length; i++) {
descriptions[i] = describeExpectation(expected[i]);
}
-
descriptions.sort();
-
if (descriptions.length > 0) {
for (i = 1, j = 1; i < descriptions.length; i++) {
if (descriptions[i - 1] !== descriptions[i]) {
@@ -1060,296 +875,275 @@
j++;
}
}
-
descriptions.length = j;
}
-
switch (descriptions.length) {
case 1:
return descriptions[0];
-
case 2:
return descriptions[0] + " or " + descriptions[1];
-
default:
return descriptions.slice(0, -1).join(", ") + ", or " + descriptions[descriptions.length - 1];
}
}
-
function describeFound(found) {
return found ? "\"" + literalEscape(found) + "\"" : "end of input";
}
-
return "Expected " + describeExpected(expected) + " but " + describeFound(found) + " found.";
};
-
function peg$parse(input, options) {
options = options !== void 0 ? options : {};
-
var peg$FAILED = {},
- peg$startRuleFunctions = {
- start: peg$parsestart
- },
- peg$startRuleFunction = peg$parsestart,
- peg$c0 = function peg$c0(ss) {
- return ss.length === 1 ? ss[0] : {
- type: 'matches',
- selectors: ss
- };
- },
- peg$c1 = function peg$c1() {
- return void 0;
- },
- peg$c2 = " ",
- peg$c3 = peg$literalExpectation(" ", false),
- peg$c4 = /^[^ [\],():#!=><~+.]/,
- peg$c5 = peg$classExpectation([" ", "[", "]", ",", "(", ")", ":", "#", "!", "=", ">", "<", "~", "+", "."], true, false),
- peg$c6 = function peg$c6(i) {
- return i.join('');
- },
- peg$c7 = ">",
- peg$c8 = peg$literalExpectation(">", false),
- peg$c9 = function peg$c9() {
- return 'child';
- },
- peg$c10 = "~",
- peg$c11 = peg$literalExpectation("~", false),
- peg$c12 = function peg$c12() {
- return 'sibling';
- },
- peg$c13 = "+",
- peg$c14 = peg$literalExpectation("+", false),
- peg$c15 = function peg$c15() {
- return 'adjacent';
- },
- peg$c16 = function peg$c16() {
- return 'descendant';
- },
- peg$c17 = ",",
- peg$c18 = peg$literalExpectation(",", false),
- peg$c19 = function peg$c19(s, ss) {
- return [s].concat(ss.map(function (s) {
- return s[3];
- }));
- },
- peg$c20 = function peg$c20(a, ops) {
- return ops.reduce(function (memo, rhs) {
- return {
- type: rhs[0],
- left: memo,
- right: rhs[1]
+ peg$startRuleFunctions = {
+ start: peg$parsestart
+ },
+ peg$startRuleFunction = peg$parsestart,
+ peg$c0 = function peg$c0(ss) {
+ return ss.length === 1 ? ss[0] : {
+ type: 'matches',
+ selectors: ss
};
- }, a);
- },
- peg$c21 = "!",
- peg$c22 = peg$literalExpectation("!", false),
- peg$c23 = function peg$c23(subject, as) {
- var b = as.length === 1 ? as[0] : {
- type: 'compound',
- selectors: as
- };
- if (subject) b.subject = true;
- return b;
- },
- peg$c24 = "*",
- peg$c25 = peg$literalExpectation("*", false),
- peg$c26 = function peg$c26(a) {
- return {
- type: 'wildcard',
- value: a
- };
- },
- peg$c27 = "#",
- peg$c28 = peg$literalExpectation("#", false),
- peg$c29 = function peg$c29(i) {
- return {
- type: 'identifier',
- value: i
- };
- },
- peg$c30 = "[",
- peg$c31 = peg$literalExpectation("[", false),
- peg$c32 = "]",
- peg$c33 = peg$literalExpectation("]", false),
- peg$c34 = function peg$c34(v) {
- return v;
- },
- peg$c35 = /^[><!]/,
- peg$c36 = peg$classExpectation([">", "<", "!"], false, false),
- peg$c37 = "=",
- peg$c38 = peg$literalExpectation("=", false),
- peg$c39 = function peg$c39(a) {
- return (a || '') + '=';
- },
- peg$c40 = /^[><]/,
- peg$c41 = peg$classExpectation([">", "<"], false, false),
- peg$c42 = ".",
- peg$c43 = peg$literalExpectation(".", false),
- peg$c44 = function peg$c44(a, as) {
- return [].concat.apply([a], as).join('');
- },
- peg$c45 = function peg$c45(name, op, value) {
- return {
- type: 'attribute',
- name: name,
- operator: op,
- value: value
- };
- },
- peg$c46 = function peg$c46(name) {
- return {
- type: 'attribute',
- name: name
- };
- },
- peg$c47 = "\"",
- peg$c48 = peg$literalExpectation("\"", false),
- peg$c49 = /^[^\\"]/,
- peg$c50 = peg$classExpectation(["\\", "\""], true, false),
- peg$c51 = "\\",
- peg$c52 = peg$literalExpectation("\\", false),
- peg$c53 = peg$anyExpectation(),
- peg$c54 = function peg$c54(a, b) {
- return a + b;
- },
- peg$c55 = function peg$c55(d) {
- return {
- type: 'literal',
- value: strUnescape(d.join(''))
- };
- },
- peg$c56 = "'",
- peg$c57 = peg$literalExpectation("'", false),
- peg$c58 = /^[^\\']/,
- peg$c59 = peg$classExpectation(["\\", "'"], true, false),
- peg$c60 = /^[0-9]/,
- peg$c61 = peg$classExpectation([["0", "9"]], false, false),
- peg$c62 = function peg$c62(a, b) {
- // Can use `a.flat().join('')` once supported
- var leadingDecimals = a ? [].concat.apply([], a).join('') : '';
- return {
- type: 'literal',
- value: parseFloat(leadingDecimals + b.join(''))
- };
- },
- peg$c63 = function peg$c63(i) {
- return {
- type: 'literal',
- value: i
- };
- },
- peg$c64 = "type(",
- peg$c65 = peg$literalExpectation("type(", false),
- peg$c66 = /^[^ )]/,
- peg$c67 = peg$classExpectation([" ", ")"], true, false),
- peg$c68 = ")",
- peg$c69 = peg$literalExpectation(")", false),
- peg$c70 = function peg$c70(t) {
- return {
- type: 'type',
- value: t.join('')
- };
- },
- peg$c71 = /^[imsu]/,
- peg$c72 = peg$classExpectation(["i", "m", "s", "u"], false, false),
- peg$c73 = "/",
- peg$c74 = peg$literalExpectation("/", false),
- peg$c75 = /^[^\/]/,
- peg$c76 = peg$classExpectation(["/"], true, false),
- peg$c77 = function peg$c77(d, flgs) {
- return {
- type: 'regexp',
- value: new RegExp(d.join(''), flgs ? flgs.join('') : '')
- };
- },
- peg$c78 = function peg$c78(i, is) {
- return {
- type: 'field',
- name: is.reduce(function (memo, p) {
- return memo + p[0] + p[1];
- }, i)
- };
- },
- peg$c79 = ":not(",
- peg$c80 = peg$literalExpectation(":not(", false),
- peg$c81 = function peg$c81(ss) {
- return {
- type: 'not',
- selectors: ss
- };
- },
- peg$c82 = ":matches(",
- peg$c83 = peg$literalExpectation(":matches(", false),
- peg$c84 = function peg$c84(ss) {
- return {
- type: 'matches',
- selectors: ss
- };
- },
- peg$c85 = ":has(",
- peg$c86 = peg$literalExpectation(":has(", false),
- peg$c87 = function peg$c87(ss) {
- return {
- type: 'has',
- selectors: ss
- };
- },
- peg$c88 = ":first-child",
- peg$c89 = peg$literalExpectation(":first-child", false),
- peg$c90 = function peg$c90() {
- return nth(1);
- },
- peg$c91 = ":last-child",
- peg$c92 = peg$literalExpectation(":last-child", false),
- peg$c93 = function peg$c93() {
- return nthLast(1);
- },
- peg$c94 = ":nth-child(",
- peg$c95 = peg$literalExpectation(":nth-child(", false),
- peg$c96 = function peg$c96(n) {
- return nth(parseInt(n.join(''), 10));
- },
- peg$c97 = ":nth-last-child(",
- peg$c98 = peg$literalExpectation(":nth-last-child(", false),
- peg$c99 = function peg$c99(n) {
- return nthLast(parseInt(n.join(''), 10));
- },
- peg$c100 = ":",
- peg$c101 = peg$literalExpectation(":", false),
- peg$c102 = "statement",
- peg$c103 = peg$literalExpectation("statement", true),
- peg$c104 = "expression",
- peg$c105 = peg$literalExpectation("expression", true),
- peg$c106 = "declaration",
- peg$c107 = peg$literalExpectation("declaration", true),
- peg$c108 = "function",
- peg$c109 = peg$literalExpectation("function", true),
- peg$c110 = "pattern",
- peg$c111 = peg$literalExpectation("pattern", true),
- peg$c112 = function peg$c112(c) {
- return {
- type: 'class',
- name: c
- };
- },
- peg$currPos = 0,
- peg$posDetailsCache = [{
- line: 1,
- column: 1
- }],
- peg$maxFailPos = 0,
- peg$maxFailExpected = [],
- peg$resultsCache = {},
- peg$result;
-
+ },
+ peg$c1 = function peg$c1() {
+ return void 0;
+ },
+ peg$c2 = " ",
+ peg$c3 = peg$literalExpectation(" ", false),
+ peg$c4 = /^[^ [\],():#!=><~+.]/,
+ peg$c5 = peg$classExpectation([" ", "[", "]", ",", "(", ")", ":", "#", "!", "=", ">", "<", "~", "+", "."], true, false),
+ peg$c6 = function peg$c6(i) {
+ return i.join('');
+ },
+ peg$c7 = ">",
+ peg$c8 = peg$literalExpectation(">", false),
+ peg$c9 = function peg$c9() {
+ return 'child';
+ },
+ peg$c10 = "~",
+ peg$c11 = peg$literalExpectation("~", false),
+ peg$c12 = function peg$c12() {
+ return 'sibling';
+ },
+ peg$c13 = "+",
+ peg$c14 = peg$literalExpectation("+", false),
+ peg$c15 = function peg$c15() {
+ return 'adjacent';
+ },
+ peg$c16 = function peg$c16() {
+ return 'descendant';
+ },
+ peg$c17 = ",",
+ peg$c18 = peg$literalExpectation(",", false),
+ peg$c19 = function peg$c19(s, ss) {
+ return [s].concat(ss.map(function (s) {
+ return s[3];
+ }));
+ },
+ peg$c20 = function peg$c20(a, ops) {
+ return ops.reduce(function (memo, rhs) {
+ return {
+ type: rhs[0],
+ left: memo,
+ right: rhs[1]
+ };
+ }, a);
+ },
+ peg$c21 = "!",
+ peg$c22 = peg$literalExpectation("!", false),
+ peg$c23 = function peg$c23(subject, as) {
+ var b = as.length === 1 ? as[0] : {
+ type: 'compound',
+ selectors: as
+ };
+ if (subject) b.subject = true;
+ return b;
+ },
+ peg$c24 = "*",
+ peg$c25 = peg$literalExpectation("*", false),
+ peg$c26 = function peg$c26(a) {
+ return {
+ type: 'wildcard',
+ value: a
+ };
+ },
+ peg$c27 = "#",
+ peg$c28 = peg$literalExpectation("#", false),
+ peg$c29 = function peg$c29(i) {
+ return {
+ type: 'identifier',
+ value: i
+ };
+ },
+ peg$c30 = "[",
+ peg$c31 = peg$literalExpectation("[", false),
+ peg$c32 = "]",
+ peg$c33 = peg$literalExpectation("]", false),
+ peg$c34 = function peg$c34(v) {
+ return v;
+ },
+ peg$c35 = /^[><!]/,
+ peg$c36 = peg$classExpectation([">", "<", "!"], false, false),
+ peg$c37 = "=",
+ peg$c38 = peg$literalExpectation("=", false),
+ peg$c39 = function peg$c39(a) {
+ return (a || '') + '=';
+ },
+ peg$c40 = /^[><]/,
+ peg$c41 = peg$classExpectation([">", "<"], false, false),
+ peg$c42 = ".",
+ peg$c43 = peg$literalExpectation(".", false),
+ peg$c44 = function peg$c44(a, as) {
+ return [].concat.apply([a], as).join('');
+ },
+ peg$c45 = function peg$c45(name, op, value) {
+ return {
+ type: 'attribute',
+ name: name,
+ operator: op,
+ value: value
+ };
+ },
+ peg$c46 = function peg$c46(name) {
+ return {
+ type: 'attribute',
+ name: name
+ };
+ },
+ peg$c47 = "\"",
+ peg$c48 = peg$literalExpectation("\"", false),
+ peg$c49 = /^[^\\"]/,
+ peg$c50 = peg$classExpectation(["\\", "\""], true, false),
+ peg$c51 = "\\",
+ peg$c52 = peg$literalExpectation("\\", false),
+ peg$c53 = peg$anyExpectation(),
+ peg$c54 = function peg$c54(a, b) {
+ return a + b;
+ },
+ peg$c55 = function peg$c55(d) {
+ return {
+ type: 'literal',
+ value: strUnescape(d.join(''))
+ };
+ },
+ peg$c56 = "'",
+ peg$c57 = peg$literalExpectation("'", false),
+ peg$c58 = /^[^\\']/,
+ peg$c59 = peg$classExpectation(["\\", "'"], true, false),
+ peg$c60 = /^[0-9]/,
+ peg$c61 = peg$classExpectation([["0", "9"]], false, false),
+ peg$c62 = function peg$c62(a, b) {
+ // Can use `a.flat().join('')` once supported
+ var leadingDecimals = a ? [].concat.apply([], a).join('') : '';
+ return {
+ type: 'literal',
+ value: parseFloat(leadingDecimals + b.join(''))
+ };
+ },
+ peg$c63 = function peg$c63(i) {
+ return {
+ type: 'literal',
+ value: i
+ };
+ },
+ peg$c64 = "type(",
+ peg$c65 = peg$literalExpectation("type(", false),
+ peg$c66 = /^[^ )]/,
+ peg$c67 = peg$classExpectation([" ", ")"], true, false),
+ peg$c68 = ")",
+ peg$c69 = peg$literalExpectation(")", false),
+ peg$c70 = function peg$c70(t) {
+ return {
+ type: 'type',
+ value: t.join('')
+ };
+ },
+ peg$c71 = /^[imsu]/,
+ peg$c72 = peg$classExpectation(["i", "m", "s", "u"], false, false),
+ peg$c73 = "/",
+ peg$c74 = peg$literalExpectation("/", false),
+ peg$c75 = /^[^\/]/,
+ peg$c76 = peg$classExpectation(["/"], true, false),
+ peg$c77 = function peg$c77(d, flgs) {
+ return {
+ type: 'regexp',
+ value: new RegExp(d.join(''), flgs ? flgs.join('') : '')
+ };
+ },
+ peg$c78 = function peg$c78(i, is) {
+ return {
+ type: 'field',
+ name: is.reduce(function (memo, p) {
+ return memo + p[0] + p[1];
+ }, i)
+ };
+ },
+ peg$c79 = ":not(",
+ peg$c80 = peg$literalExpectation(":not(", false),
+ peg$c81 = function peg$c81(ss) {
+ return {
+ type: 'not',
+ selectors: ss
+ };
+ },
+ peg$c82 = ":matches(",
+ peg$c83 = peg$literalExpectation(":matches(", false),
+ peg$c84 = function peg$c84(ss) {
+ return {
+ type: 'matches',
+ selectors: ss
+ };
+ },
+ peg$c85 = ":has(",
+ peg$c86 = peg$literalExpectation(":has(", false),
+ peg$c87 = function peg$c87(ss) {
+ return {
+ type: 'has',
+ selectors: ss
+ };
+ },
+ peg$c88 = ":first-child",
+ peg$c89 = peg$literalExpectation(":first-child", false),
+ peg$c90 = function peg$c90() {
+ return nth(1);
+ },
+ peg$c91 = ":last-child",
+ peg$c92 = peg$literalExpectation(":last-child", false),
+ peg$c93 = function peg$c93() {
+ return nthLast(1);
+ },
+ peg$c94 = ":nth-child(",
+ peg$c95 = peg$literalExpectation(":nth-child(", false),
+ peg$c96 = function peg$c96(n) {
+ return nth(parseInt(n.join(''), 10));
+ },
+ peg$c97 = ":nth-last-child(",
+ peg$c98 = peg$literalExpectation(":nth-last-child(", false),
+ peg$c99 = function peg$c99(n) {
+ return nthLast(parseInt(n.join(''), 10));
+ },
+ peg$c100 = ":",
+ peg$c101 = peg$literalExpectation(":", false),
+ peg$c102 = function peg$c102(c) {
+ return {
+ type: 'class',
+ name: c
+ };
+ },
+ peg$currPos = 0,
+ peg$posDetailsCache = [{
+ line: 1,
+ column: 1
+ }],
+ peg$maxFailPos = 0,
+ peg$maxFailExpected = [],
+ peg$resultsCache = {},
+ peg$result;
if ("startRule" in options) {
if (!(options.startRule in peg$startRuleFunctions)) {
throw new Error("Can't start parsing from rule \"" + options.startRule + "\".");
}
-
peg$startRuleFunction = peg$startRuleFunctions[options.startRule];
}
-
function peg$literalExpectation(text, ignoreCase) {
return {
type: "literal",
@@ -1357,7 +1151,6 @@
ignoreCase: ignoreCase
};
}
-
function peg$classExpectation(parts, inverted, ignoreCase) {
return {
type: "class",
@@ -1366,38 +1159,31 @@
ignoreCase: ignoreCase
};
}
-
function peg$anyExpectation() {
return {
type: "any"
};
}
-
function peg$endExpectation() {
return {
type: "end"
};
}
-
function peg$computePosDetails(pos) {
var details = peg$posDetailsCache[pos],
- p;
-
+ p;
if (details) {
return details;
} else {
p = pos - 1;
-
while (!peg$posDetailsCache[p]) {
p--;
}
-
details = peg$posDetailsCache[p];
details = {
line: details.line,
column: details.column
};
-
while (p < pos) {
if (input.charCodeAt(p) === 10) {
details.line++;
@@ -1405,18 +1191,15 @@
} else {
details.column++;
}
-
p++;
}
-
peg$posDetailsCache[pos] = details;
return details;
}
}
-
function peg$computeLocation(startPos, endPos) {
var startPosDetails = peg$computePosDetails(startPos),
- endPosDetails = peg$computePosDetails(endPos);
+ endPosDetails = peg$computePosDetails(endPos);
return {
start: {
offset: startPos,
@@ -1430,43 +1213,33 @@
}
};
}
-
function peg$fail(expected) {
if (peg$currPos < peg$maxFailPos) {
return;
}
-
if (peg$currPos > peg$maxFailPos) {
peg$maxFailPos = peg$currPos;
peg$maxFailExpected = [];
}
-
peg$maxFailExpected.push(expected);
}
-
function peg$buildStructuredError(expected, found, location) {
return new peg$SyntaxError(peg$SyntaxError.buildMessage(expected, found), expected, found, location);
}
-
function peg$parsestart() {
var s0, s1, s2, s3;
var key = peg$currPos * 30 + 0,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parse_();
-
if (s1 !== peg$FAILED) {
s2 = peg$parseselectors();
-
if (s2 !== peg$FAILED) {
s3 = peg$parse_();
-
if (s3 !== peg$FAILED) {
s1 = peg$c0(s2);
s0 = s1;
@@ -1482,104 +1255,83 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
s1 = peg$parse_();
-
if (s1 !== peg$FAILED) {
s1 = peg$c1();
}
-
s0 = s1;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parse_() {
var s0, s1;
var key = peg$currPos * 30 + 1,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = [];
-
if (input.charCodeAt(peg$currPos) === 32) {
s1 = peg$c2;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c3);
}
}
-
while (s1 !== peg$FAILED) {
s0.push(s1);
-
if (input.charCodeAt(peg$currPos) === 32) {
s1 = peg$c2;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c3);
}
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseidentifierName() {
var s0, s1, s2;
var key = peg$currPos * 30 + 2,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = [];
-
if (peg$c4.test(input.charAt(peg$currPos))) {
s2 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c5);
}
}
-
if (s2 !== peg$FAILED) {
while (s2 !== peg$FAILED) {
s1.push(s2);
-
if (peg$c4.test(input.charAt(peg$currPos))) {
s2 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c5);
}
@@ -1588,11 +1340,9 @@
} else {
s1 = peg$FAILED;
}
-
if (s1 !== peg$FAILED) {
s1 = peg$c6(s1);
}
-
s0 = s1;
peg$resultsCache[key] = {
nextPos: peg$currPos,
@@ -1600,35 +1350,28 @@
};
return s0;
}
-
function peg$parsebinaryOp() {
var s0, s1, s2, s3;
var key = peg$currPos * 30 + 3,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parse_();
-
if (s1 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 62) {
s2 = peg$c7;
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c8);
}
}
-
if (s2 !== peg$FAILED) {
s3 = peg$parse_();
-
if (s3 !== peg$FAILED) {
s1 = peg$c9();
s0 = s1;
@@ -1644,26 +1387,21 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
s1 = peg$parse_();
-
if (s1 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 126) {
s2 = peg$c10;
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c11);
}
}
-
if (s2 !== peg$FAILED) {
s3 = peg$parse_();
-
if (s3 !== peg$FAILED) {
s1 = peg$c12();
s0 = s1;
@@ -1679,26 +1417,21 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
s1 = peg$parse_();
-
if (s1 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 43) {
s2 = peg$c13;
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c14);
}
}
-
if (s2 !== peg$FAILED) {
s3 = peg$parse_();
-
if (s3 !== peg$FAILED) {
s1 = peg$c15();
s0 = s1;
@@ -1714,24 +1447,19 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 32) {
s1 = peg$c2;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c3);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s1 = peg$c16();
s0 = s1;
@@ -1746,50 +1474,40 @@
}
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseselectors() {
var s0, s1, s2, s3, s4, s5, s6, s7;
var key = peg$currPos * 30 + 4,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parseselector();
-
if (s1 !== peg$FAILED) {
s2 = [];
s3 = peg$currPos;
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 44) {
s5 = peg$c17;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c18);
}
}
-
if (s5 !== peg$FAILED) {
s6 = peg$parse_();
-
if (s6 !== peg$FAILED) {
s7 = peg$parseselector();
-
if (s7 !== peg$FAILED) {
s4 = [s4, s5, s6, s7];
s3 = s4;
@@ -1809,30 +1527,24 @@
peg$currPos = s3;
s3 = peg$FAILED;
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
s3 = peg$currPos;
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 44) {
s5 = peg$c17;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c18);
}
}
-
if (s5 !== peg$FAILED) {
s6 = peg$parse_();
-
if (s6 !== peg$FAILED) {
s7 = peg$parseselector();
-
if (s7 !== peg$FAILED) {
s4 = [s4, s5, s6, s7];
s3 = s4;
@@ -1853,7 +1565,6 @@
s3 = peg$FAILED;
}
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c19(s1, s2);
s0 = s1;
@@ -1865,35 +1576,28 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseselector() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 5,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parsesequence();
-
if (s1 !== peg$FAILED) {
s2 = [];
s3 = peg$currPos;
s4 = peg$parsebinaryOp();
-
if (s4 !== peg$FAILED) {
s5 = peg$parsesequence();
-
if (s5 !== peg$FAILED) {
s4 = [s4, s5];
s3 = s4;
@@ -1905,15 +1609,12 @@
peg$currPos = s3;
s3 = peg$FAILED;
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
s3 = peg$currPos;
s4 = peg$parsebinaryOp();
-
if (s4 !== peg$FAILED) {
s5 = peg$parsesequence();
-
if (s5 !== peg$FAILED) {
s4 = [s4, s5];
s3 = s4;
@@ -1926,7 +1627,6 @@
s3 = peg$FAILED;
}
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c20(s1, s2);
s0 = s1;
@@ -1938,45 +1638,36 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsesequence() {
var s0, s1, s2, s3;
var key = peg$currPos * 30 + 6,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 33) {
s1 = peg$c21;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c22);
}
}
-
if (s1 === peg$FAILED) {
s1 = null;
}
-
if (s1 !== peg$FAILED) {
s2 = [];
s3 = peg$parseatom();
-
if (s3 !== peg$FAILED) {
while (s3 !== peg$FAILED) {
s2.push(s3);
@@ -1985,7 +1676,6 @@
} else {
s2 = peg$FAILED;
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c23(s1, s2);
s0 = s1;
@@ -1997,56 +1687,41 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseatom() {
var s0;
var key = peg$currPos * 30 + 7,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$parsewildcard();
-
if (s0 === peg$FAILED) {
s0 = peg$parseidentifier();
-
if (s0 === peg$FAILED) {
s0 = peg$parseattr();
-
if (s0 === peg$FAILED) {
s0 = peg$parsefield();
-
if (s0 === peg$FAILED) {
s0 = peg$parsenegation();
-
if (s0 === peg$FAILED) {
s0 = peg$parsematches();
-
if (s0 === peg$FAILED) {
s0 = peg$parsehas();
-
if (s0 === peg$FAILED) {
s0 = peg$parsefirstChild();
-
if (s0 === peg$FAILED) {
s0 = peg$parselastChild();
-
if (s0 === peg$FAILED) {
s0 = peg$parsenthChild();
-
if (s0 === peg$FAILED) {
s0 = peg$parsenthLastChild();
-
if (s0 === peg$FAILED) {
s0 = peg$parseclass();
}
@@ -2060,41 +1735,33 @@
}
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsewildcard() {
var s0, s1;
var key = peg$currPos * 30 + 8,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 42) {
s1 = peg$c24;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c25);
}
}
-
if (s1 !== peg$FAILED) {
s1 = peg$c26(s1);
}
-
s0 = s1;
peg$resultsCache[key] = {
nextPos: peg$currPos,
@@ -2102,37 +1769,29 @@
};
return s0;
}
-
function peg$parseidentifier() {
var s0, s1, s2;
var key = peg$currPos * 30 + 9,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 35) {
s1 = peg$c27;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c28);
}
}
-
if (s1 === peg$FAILED) {
s1 = null;
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parseidentifierName();
-
if (s2 !== peg$FAILED) {
s1 = peg$c29(s2);
s0 = s1;
@@ -2144,58 +1803,46 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseattr() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 10,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 91) {
s1 = peg$c30;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c31);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseattrValue();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 93) {
s5 = peg$c32;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c33);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c34(s3);
s0 = s1;
@@ -2219,53 +1866,43 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseattrOps() {
var s0, s1, s2;
var key = peg$currPos * 30 + 11,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (peg$c35.test(input.charAt(peg$currPos))) {
s1 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c36);
}
}
-
if (s1 === peg$FAILED) {
s1 = null;
}
-
if (s1 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 61) {
s2 = peg$c37;
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c38);
}
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c39(s1);
s0 = s1;
@@ -2277,66 +1914,54 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
if (peg$c40.test(input.charAt(peg$currPos))) {
s0 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s0 = peg$FAILED;
-
{
peg$fail(peg$c41);
}
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseattrEqOps() {
var s0, s1, s2;
var key = peg$currPos * 30 + 12,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 33) {
s1 = peg$c21;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c22);
}
}
-
if (s1 === peg$FAILED) {
s1 = null;
}
-
if (s1 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 61) {
s2 = peg$c37;
peg$currPos++;
} else {
s2 = peg$FAILED;
-
{
peg$fail(peg$c38);
}
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c39(s1);
s0 = s1;
@@ -2348,45 +1973,36 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseattrName() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 13,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parseidentifierName();
-
if (s1 !== peg$FAILED) {
s2 = [];
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 46) {
s4 = peg$c42;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s4 !== peg$FAILED) {
s5 = peg$parseidentifierName();
-
if (s5 !== peg$FAILED) {
s4 = [s4, s5];
s3 = s4;
@@ -2398,25 +2014,20 @@
peg$currPos = s3;
s3 = peg$FAILED;
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 46) {
s4 = peg$c42;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s4 !== peg$FAILED) {
s5 = peg$parseidentifierName();
-
if (s5 !== peg$FAILED) {
s4 = [s4, s5];
s3 = s4;
@@ -2429,7 +2040,6 @@
s3 = peg$FAILED;
}
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c44(s1, s2);
s0 = s1;
@@ -2441,43 +2051,33 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseattrValue() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 14,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parseattrName();
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseattrEqOps();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
s5 = peg$parsetype();
-
if (s5 === peg$FAILED) {
s5 = peg$parseregex();
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c45(s1, s3, s5);
s0 = s1;
@@ -2501,31 +2101,23 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
s1 = peg$parseattrName();
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseattrOps();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
s5 = peg$parsestring();
-
if (s5 === peg$FAILED) {
s5 = peg$parsenumber();
-
if (s5 === peg$FAILED) {
s5 = peg$parsepath();
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c45(s1, s3, s5);
s0 = s1;
@@ -2549,89 +2141,71 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
s1 = peg$parseattrName();
-
if (s1 !== peg$FAILED) {
s1 = peg$c46(s1);
}
-
s0 = s1;
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsestring() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 15,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 34) {
s1 = peg$c47;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c48);
}
}
-
if (s1 !== peg$FAILED) {
s2 = [];
-
if (peg$c49.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c50);
}
}
-
if (s3 === peg$FAILED) {
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 92) {
s4 = peg$c51;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c52);
}
}
-
if (s4 !== peg$FAILED) {
if (input.length > peg$currPos) {
s5 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c53);
}
}
-
if (s5 !== peg$FAILED) {
s4 = peg$c54(s4, s5);
s3 = s4;
@@ -2644,47 +2218,38 @@
s3 = peg$FAILED;
}
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
-
if (peg$c49.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c50);
}
}
-
if (s3 === peg$FAILED) {
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 92) {
s4 = peg$c51;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c52);
}
}
-
if (s4 !== peg$FAILED) {
if (input.length > peg$currPos) {
s5 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c53);
}
}
-
if (s5 !== peg$FAILED) {
s4 = peg$c54(s4, s5);
s3 = s4;
@@ -2698,19 +2263,16 @@
}
}
}
-
if (s2 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 34) {
s3 = peg$c47;
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c48);
}
}
-
if (s3 !== peg$FAILED) {
s1 = peg$c55(s2);
s0 = s1;
@@ -2726,61 +2288,49 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
if (s0 === peg$FAILED) {
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 39) {
s1 = peg$c56;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c57);
}
}
-
if (s1 !== peg$FAILED) {
s2 = [];
-
if (peg$c58.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c59);
}
}
-
if (s3 === peg$FAILED) {
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 92) {
s4 = peg$c51;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c52);
}
}
-
if (s4 !== peg$FAILED) {
if (input.length > peg$currPos) {
s5 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c53);
}
}
-
if (s5 !== peg$FAILED) {
s4 = peg$c54(s4, s5);
s3 = s4;
@@ -2793,47 +2343,38 @@
s3 = peg$FAILED;
}
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
-
if (peg$c58.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c59);
}
}
-
if (s3 === peg$FAILED) {
s3 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 92) {
s4 = peg$c51;
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c52);
}
}
-
if (s4 !== peg$FAILED) {
if (input.length > peg$currPos) {
s5 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c53);
}
}
-
if (s5 !== peg$FAILED) {
s4 = peg$c54(s4, s5);
s3 = s4;
@@ -2847,19 +2388,16 @@
}
}
}
-
if (s2 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 39) {
s3 = peg$c56;
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c57);
}
}
-
if (s3 !== peg$FAILED) {
s1 = peg$c55(s2);
s0 = s1;
@@ -2876,66 +2414,54 @@
s0 = peg$FAILED;
}
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsenumber() {
var s0, s1, s2, s3;
var key = peg$currPos * 30 + 16,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$currPos;
s2 = [];
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
}
-
while (s3 !== peg$FAILED) {
s2.push(s3);
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
}
}
-
if (s2 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 46) {
s3 = peg$c42;
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s3 !== peg$FAILED) {
s2 = [s2, s3];
s1 = s2;
@@ -2947,35 +2473,28 @@
peg$currPos = s1;
s1 = peg$FAILED;
}
-
if (s1 === peg$FAILED) {
s1 = null;
}
-
if (s1 !== peg$FAILED) {
s2 = [];
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
}
-
if (s3 !== peg$FAILED) {
while (s3 !== peg$FAILED) {
s2.push(s3);
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
@@ -2984,7 +2503,6 @@
} else {
s2 = peg$FAILED;
}
-
if (s2 !== peg$FAILED) {
s1 = peg$c62(s1, s2);
s0 = s1;
@@ -2996,31 +2514,25 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsepath() {
var s0, s1;
var key = peg$currPos * 30 + 17,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
s1 = peg$parseidentifierName();
-
if (s1 !== peg$FAILED) {
s1 = peg$c63(s1);
}
-
s0 = s1;
peg$resultsCache[key] = {
nextPos: peg$currPos,
@@ -3028,57 +2540,45 @@
};
return s0;
}
-
function peg$parsetype() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 18,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 5) === peg$c64) {
s1 = peg$c64;
peg$currPos += 5;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c65);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = [];
-
if (peg$c66.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c67);
}
}
-
if (s4 !== peg$FAILED) {
while (s4 !== peg$FAILED) {
s3.push(s4);
-
if (peg$c66.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c67);
}
@@ -3087,22 +2587,18 @@
} else {
s3 = peg$FAILED;
}
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c70(s3);
s0 = s1;
@@ -3126,47 +2622,38 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseflags() {
var s0, s1;
var key = peg$currPos * 30 + 19,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = [];
-
if (peg$c71.test(input.charAt(peg$currPos))) {
s1 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c72);
}
}
-
if (s1 !== peg$FAILED) {
while (s1 !== peg$FAILED) {
s0.push(s1);
-
if (peg$c71.test(input.charAt(peg$currPos))) {
s1 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c72);
}
@@ -3175,61 +2662,49 @@
} else {
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseregex() {
var s0, s1, s2, s3, s4;
var key = peg$currPos * 30 + 20,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 47) {
s1 = peg$c73;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c74);
}
}
-
if (s1 !== peg$FAILED) {
s2 = [];
-
if (peg$c75.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c76);
}
}
-
if (s3 !== peg$FAILED) {
while (s3 !== peg$FAILED) {
s2.push(s3);
-
if (peg$c75.test(input.charAt(peg$currPos))) {
s3 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c76);
}
@@ -3238,26 +2713,21 @@
} else {
s2 = peg$FAILED;
}
-
if (s2 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 47) {
s3 = peg$c73;
peg$currPos++;
} else {
s3 = peg$FAILED;
-
{
peg$fail(peg$c74);
}
}
-
if (s3 !== peg$FAILED) {
s4 = peg$parseflags();
-
if (s4 === peg$FAILED) {
s4 = null;
}
-
if (s4 !== peg$FAILED) {
s1 = peg$c77(s2, s4);
s0 = s1;
@@ -3277,58 +2747,46 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsefield() {
var s0, s1, s2, s3, s4, s5, s6;
var key = peg$currPos * 30 + 21,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 46) {
s1 = peg$c42;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parseidentifierName();
-
if (s2 !== peg$FAILED) {
s3 = [];
s4 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 46) {
s5 = peg$c42;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s5 !== peg$FAILED) {
s6 = peg$parseidentifierName();
-
if (s6 !== peg$FAILED) {
s5 = [s5, s6];
s4 = s5;
@@ -3340,25 +2798,20 @@
peg$currPos = s4;
s4 = peg$FAILED;
}
-
while (s4 !== peg$FAILED) {
s3.push(s4);
s4 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 46) {
s5 = peg$c42;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c43);
}
}
-
if (s5 !== peg$FAILED) {
s6 = peg$parseidentifierName();
-
if (s6 !== peg$FAILED) {
s5 = [s5, s6];
s4 = s5;
@@ -3371,7 +2824,6 @@
s4 = peg$FAILED;
}
}
-
if (s3 !== peg$FAILED) {
s1 = peg$c78(s2, s3);
s0 = s1;
@@ -3387,58 +2839,46 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsenegation() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 22,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 5) === peg$c79) {
s1 = peg$c79;
peg$currPos += 5;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c80);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseselectors();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c81(s3);
s0 = s1;
@@ -3462,58 +2902,46 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsematches() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 23,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 9) === peg$c82) {
s1 = peg$c82;
peg$currPos += 9;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c83);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseselectors();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c84(s3);
s0 = s1;
@@ -3537,58 +2965,46 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsehas() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 24,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 5) === peg$c85) {
s1 = peg$c85;
peg$currPos += 5;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c86);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = peg$parseselectors();
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c87(s3);
s0 = s1;
@@ -3612,41 +3028,33 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsefirstChild() {
var s0, s1;
var key = peg$currPos * 30 + 25,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 12) === peg$c88) {
s1 = peg$c88;
peg$currPos += 12;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c89);
}
}
-
if (s1 !== peg$FAILED) {
s1 = peg$c90();
}
-
s0 = s1;
peg$resultsCache[key] = {
nextPos: peg$currPos,
@@ -3654,34 +3062,27 @@
};
return s0;
}
-
function peg$parselastChild() {
var s0, s1;
var key = peg$currPos * 30 + 26,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 11) === peg$c91) {
s1 = peg$c91;
peg$currPos += 11;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c92);
}
}
-
if (s1 !== peg$FAILED) {
s1 = peg$c93();
}
-
s0 = s1;
peg$resultsCache[key] = {
nextPos: peg$currPos,
@@ -3689,57 +3090,45 @@
};
return s0;
}
-
function peg$parsenthChild() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 27,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 11) === peg$c94) {
s1 = peg$c94;
peg$currPos += 11;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c95);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = [];
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
}
-
if (s4 !== peg$FAILED) {
while (s4 !== peg$FAILED) {
s3.push(s4);
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
@@ -3748,22 +3137,18 @@
} else {
s3 = peg$FAILED;
}
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c96(s3);
s0 = s1;
@@ -3787,64 +3172,51 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parsenthLastChild() {
var s0, s1, s2, s3, s4, s5;
var key = peg$currPos * 30 + 28,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.substr(peg$currPos, 16) === peg$c97) {
s1 = peg$c97;
peg$currPos += 16;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c98);
}
}
-
if (s1 !== peg$FAILED) {
s2 = peg$parse_();
-
if (s2 !== peg$FAILED) {
s3 = [];
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
}
-
if (s4 !== peg$FAILED) {
while (s4 !== peg$FAILED) {
s3.push(s4);
-
if (peg$c60.test(input.charAt(peg$currPos))) {
s4 = input.charAt(peg$currPos);
peg$currPos++;
} else {
s4 = peg$FAILED;
-
{
peg$fail(peg$c61);
}
@@ -3853,22 +3225,18 @@
} else {
s3 = peg$FAILED;
}
-
if (s3 !== peg$FAILED) {
s4 = peg$parse_();
-
if (s4 !== peg$FAILED) {
if (input.charCodeAt(peg$currPos) === 41) {
s5 = peg$c68;
peg$currPos++;
} else {
s5 = peg$FAILED;
-
{
peg$fail(peg$c69);
}
}
-
if (s5 !== peg$FAILED) {
s1 = peg$c99(s3);
s0 = s1;
@@ -3892,103 +3260,34 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function peg$parseclass() {
var s0, s1, s2;
var key = peg$currPos * 30 + 29,
- cached = peg$resultsCache[key];
-
+ cached = peg$resultsCache[key];
if (cached) {
peg$currPos = cached.nextPos;
return cached.result;
}
-
s0 = peg$currPos;
-
if (input.charCodeAt(peg$currPos) === 58) {
s1 = peg$c100;
peg$currPos++;
} else {
s1 = peg$FAILED;
-
{
peg$fail(peg$c101);
}
}
-
if (s1 !== peg$FAILED) {
- if (input.substr(peg$currPos, 9).toLowerCase() === peg$c102) {
- s2 = input.substr(peg$currPos, 9);
- peg$currPos += 9;
- } else {
- s2 = peg$FAILED;
-
- {
- peg$fail(peg$c103);
- }
- }
-
- if (s2 === peg$FAILED) {
- if (input.substr(peg$currPos, 10).toLowerCase() === peg$c104) {
- s2 = input.substr(peg$currPos, 10);
- peg$currPos += 10;
- } else {
- s2 = peg$FAILED;
-
- {
- peg$fail(peg$c105);
- }
- }
-
- if (s2 === peg$FAILED) {
- if (input.substr(peg$currPos, 11).toLowerCase() === peg$c106) {
- s2 = input.substr(peg$currPos, 11);
- peg$currPos += 11;
- } else {
- s2 = peg$FAILED;
-
- {
- peg$fail(peg$c107);
- }
- }
-
- if (s2 === peg$FAILED) {
- if (input.substr(peg$currPos, 8).toLowerCase() === peg$c108) {
- s2 = input.substr(peg$currPos, 8);
- peg$currPos += 8;
- } else {
- s2 = peg$FAILED;
-
- {
- peg$fail(peg$c109);
- }
- }
-
- if (s2 === peg$FAILED) {
- if (input.substr(peg$currPos, 7).toLowerCase() === peg$c110) {
- s2 = input.substr(peg$currPos, 7);
- peg$currPos += 7;
- } else {
- s2 = peg$FAILED;
-
- {
- peg$fail(peg$c111);
- }
- }
- }
- }
- }
- }
-
+ s2 = peg$parseidentifierName();
if (s2 !== peg$FAILED) {
- s1 = peg$c112(s2);
+ s1 = peg$c102(s2);
s0 = s1;
} else {
peg$currPos = s0;
@@ -3998,14 +3297,12 @@
peg$currPos = s0;
s0 = peg$FAILED;
}
-
peg$resultsCache[key] = {
nextPos: peg$currPos,
result: s0
};
return s0;
}
-
function nth(n) {
return {
type: 'nth-child',
@@ -4015,7 +3312,6 @@
}
};
}
-
function nthLast(n) {
return {
type: 'nth-last-child',
@@ -4025,47 +3321,36 @@
}
};
}
-
function strUnescape(s) {
return s.replace(/\\(.)/g, function (match, ch) {
switch (ch) {
case 'b':
return '\b';
-
case 'f':
return '\f';
-
case 'n':
return '\n';
-
case 'r':
return '\r';
-
case 't':
return '\t';
-
case 'v':
return '\v';
-
default:
return ch;
}
});
}
-
peg$result = peg$startRuleFunction();
-
if (peg$result !== peg$FAILED && peg$currPos === input.length) {
return peg$result;
} else {
if (peg$result !== peg$FAILED && peg$currPos < input.length) {
peg$fail(peg$endExpectation());
}
-
throw peg$buildStructuredError(peg$maxFailExpected, peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null, peg$maxFailPos < input.length ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1) : peg$computeLocation(peg$maxFailPos, peg$maxFailPos));
}
}
-
return {
SyntaxError: peg$SyntaxError,
parse: peg$parse
@@ -4073,20 +3358,13 @@
});
});
-function _objectEntries(obj) {
- var entries = [];
- var keys = Object.keys(obj);
-
- for (var k = 0; k < keys.length; k++) entries.push([keys[k], obj[keys[k]]]);
-
- return entries;
-}
/**
* @typedef {"LEFT_SIDE"|"RIGHT_SIDE"} Side
*/
var LEFT_SIDE = 'LEFT_SIDE';
var RIGHT_SIDE = 'RIGHT_SIDE';
+
/**
* @external AST
* @see https://esprima.readthedocs.io/en/latest/syntax-tree-format.html
@@ -4107,79 +3385,328 @@
* Get the value of a property which may be multiple levels down
* in the object.
* @param {?PlainObject} obj
- * @param {string} key
+ * @param {string[]} keys
* @returns {undefined|boolean|string|number|external:AST}
*/
-
-function getPath(obj, key) {
- var keys = key.split('.');
-
- var _iterator = _createForOfIteratorHelper(keys),
- _step;
-
- try {
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
- var _key = _step.value;
-
- if (obj == null) {
- return obj;
- }
-
- obj = obj[_key];
+function getPath(obj, keys) {
+ for (var i = 0; i < keys.length; ++i) {
+ if (obj == null) {
+ return obj;
}
- } catch (err) {
- _iterator.e(err);
- } finally {
- _iterator.f();
+ obj = obj[keys[i]];
}
-
return obj;
}
+
/**
* Determine whether `node` can be reached by following `path`,
* starting at `ancestor`.
* @param {?external:AST} node
* @param {?external:AST} ancestor
* @param {string[]} path
+ * @param {Integer} fromPathIndex
* @returns {boolean}
*/
-
-
-function inPath(node, ancestor, path) {
- if (path.length === 0) {
- return node === ancestor;
- }
-
- if (ancestor == null) {
- return false;
- }
-
- var field = ancestor[path[0]];
- var remainingPath = path.slice(1);
-
- if (Array.isArray(field)) {
- var _iterator2 = _createForOfIteratorHelper(field),
- _step2;
-
- try {
- for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
- var component = _step2.value;
-
- if (inPath(node, component, remainingPath)) {
+function inPath(node, ancestor, path, fromPathIndex) {
+ var current = ancestor;
+ for (var i = fromPathIndex; i < path.length; ++i) {
+ if (current == null) {
+ return false;
+ }
+ var field = current[path[i]];
+ if (Array.isArray(field)) {
+ for (var k = 0; k < field.length; ++k) {
+ if (inPath(node, field[k], path, i + 1)) {
return true;
}
}
- } catch (err) {
- _iterator2.e(err);
- } finally {
- _iterator2.f();
+ return false;
}
-
- return false;
- } else {
- return inPath(node, field, remainingPath);
+ current = field;
}
+ return node === current;
}
+
+/**
+ * A generated matcher function for a selector.
+ * @typedef {function} SelectorMatcher
+*/
+
+/**
+ * A WeakMap for holding cached matcher functions for selectors.
+ * @type {WeakMap<SelectorAST, SelectorMatcher>}
+*/
+var MATCHER_CACHE = typeof WeakMap === 'function' ? new WeakMap() : null;
+
+/**
+ * Look up a matcher function for `selector` in the cache.
+ * If it does not exist, generate it with `generateMatcher` and add it to the cache.
+ * In engines without WeakMap, the caching is skipped and matchers are generated with every call.
+ * @param {?SelectorAST} selector
+ * @returns {SelectorMatcher}
+ */
+function getMatcher(selector) {
+ if (selector == null) {
+ return function () {
+ return true;
+ };
+ }
+ if (MATCHER_CACHE != null) {
+ var matcher = MATCHER_CACHE.get(selector);
+ if (matcher != null) {
+ return matcher;
+ }
+ matcher = generateMatcher(selector);
+ MATCHER_CACHE.set(selector, matcher);
+ return matcher;
+ }
+ return generateMatcher(selector);
+}
+
+/**
+ * Create a matcher function for `selector`,
+ * @param {?SelectorAST} selector
+ * @returns {SelectorMatcher}
+ */
+function generateMatcher(selector) {
+ switch (selector.type) {
+ case 'wildcard':
+ return function () {
+ return true;
+ };
+ case 'identifier':
+ {
+ var value = selector.value.toLowerCase();
+ return function (node, ancestry, options) {
+ var nodeTypeKey = options && options.nodeTypeKey || 'type';
+ return value === node[nodeTypeKey].toLowerCase();
+ };
+ }
+ case 'field':
+ {
+ var path = selector.name.split('.');
+ return function (node, ancestry) {
+ var ancestor = ancestry[path.length - 1];
+ return inPath(node, ancestor, path, 0);
+ };
+ }
+ case 'matches':
+ {
+ var matchers = selector.selectors.map(getMatcher);
+ return function (node, ancestry, options) {
+ for (var i = 0; i < matchers.length; ++i) {
+ if (matchers[i](node, ancestry, options)) {
+ return true;
+ }
+ }
+ return false;
+ };
+ }
+ case 'compound':
+ {
+ var _matchers = selector.selectors.map(getMatcher);
+ return function (node, ancestry, options) {
+ for (var i = 0; i < _matchers.length; ++i) {
+ if (!_matchers[i](node, ancestry, options)) {
+ return false;
+ }
+ }
+ return true;
+ };
+ }
+ case 'not':
+ {
+ var _matchers2 = selector.selectors.map(getMatcher);
+ return function (node, ancestry, options) {
+ for (var i = 0; i < _matchers2.length; ++i) {
+ if (_matchers2[i](node, ancestry, options)) {
+ return false;
+ }
+ }
+ return true;
+ };
+ }
+ case 'has':
+ {
+ var _matchers3 = selector.selectors.map(getMatcher);
+ return function (node, ancestry, options) {
+ var result = false;
+ var a = [];
+ estraverse.traverse(node, {
+ enter: function enter(node, parent) {
+ if (parent != null) {
+ a.unshift(parent);
+ }
+ for (var i = 0; i < _matchers3.length; ++i) {
+ if (_matchers3[i](node, a, options)) {
+ result = true;
+ this["break"]();
+ return;
+ }
+ }
+ },
+ leave: function leave() {
+ a.shift();
+ },
+ keys: options && options.visitorKeys,
+ fallback: options && options.fallback || 'iteration'
+ });
+ return result;
+ };
+ }
+ case 'child':
+ {
+ var left = getMatcher(selector.left);
+ var right = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ if (ancestry.length > 0 && right(node, ancestry, options)) {
+ return left(ancestry[0], ancestry.slice(1), options);
+ }
+ return false;
+ };
+ }
+ case 'descendant':
+ {
+ var _left = getMatcher(selector.left);
+ var _right = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ if (_right(node, ancestry, options)) {
+ for (var i = 0, l = ancestry.length; i < l; ++i) {
+ if (_left(ancestry[i], ancestry.slice(i + 1), options)) {
+ return true;
+ }
+ }
+ }
+ return false;
+ };
+ }
+ case 'attribute':
+ {
+ var _path = selector.name.split('.');
+ switch (selector.operator) {
+ case void 0:
+ return function (node) {
+ return getPath(node, _path) != null;
+ };
+ case '=':
+ switch (selector.value.type) {
+ case 'regexp':
+ return function (node) {
+ var p = getPath(node, _path);
+ return typeof p === 'string' && selector.value.value.test(p);
+ };
+ case 'literal':
+ {
+ var literal = "".concat(selector.value.value);
+ return function (node) {
+ return literal === "".concat(getPath(node, _path));
+ };
+ }
+ case 'type':
+ return function (node) {
+ return selector.value.value === _typeof(getPath(node, _path));
+ };
+ }
+ throw new Error("Unknown selector value type: ".concat(selector.value.type));
+ case '!=':
+ switch (selector.value.type) {
+ case 'regexp':
+ return function (node) {
+ return !selector.value.value.test(getPath(node, _path));
+ };
+ case 'literal':
+ {
+ var _literal = "".concat(selector.value.value);
+ return function (node) {
+ return _literal !== "".concat(getPath(node, _path));
+ };
+ }
+ case 'type':
+ return function (node) {
+ return selector.value.value !== _typeof(getPath(node, _path));
+ };
+ }
+ throw new Error("Unknown selector value type: ".concat(selector.value.type));
+ case '<=':
+ return function (node) {
+ return getPath(node, _path) <= selector.value.value;
+ };
+ case '<':
+ return function (node) {
+ return getPath(node, _path) < selector.value.value;
+ };
+ case '>':
+ return function (node) {
+ return getPath(node, _path) > selector.value.value;
+ };
+ case '>=':
+ return function (node) {
+ return getPath(node, _path) >= selector.value.value;
+ };
+ }
+ throw new Error("Unknown operator: ".concat(selector.operator));
+ }
+ case 'sibling':
+ {
+ var _left2 = getMatcher(selector.left);
+ var _right2 = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ return _right2(node, ancestry, options) && sibling(node, _left2, ancestry, LEFT_SIDE, options) || selector.left.subject && _left2(node, ancestry, options) && sibling(node, _right2, ancestry, RIGHT_SIDE, options);
+ };
+ }
+ case 'adjacent':
+ {
+ var _left3 = getMatcher(selector.left);
+ var _right3 = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ return _right3(node, ancestry, options) && adjacent(node, _left3, ancestry, LEFT_SIDE, options) || selector.right.subject && _left3(node, ancestry, options) && adjacent(node, _right3, ancestry, RIGHT_SIDE, options);
+ };
+ }
+ case 'nth-child':
+ {
+ var nth = selector.index.value;
+ var _right4 = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ return _right4(node, ancestry, options) && nthChild(node, ancestry, nth, options);
+ };
+ }
+ case 'nth-last-child':
+ {
+ var _nth = -selector.index.value;
+ var _right5 = getMatcher(selector.right);
+ return function (node, ancestry, options) {
+ return _right5(node, ancestry, options) && nthChild(node, ancestry, _nth, options);
+ };
+ }
+ case 'class':
+ {
+ return function (node, ancestry, options) {
+ if (options && options.matchClass) {
+ return options.matchClass(selector.name, node, ancestry);
+ }
+ if (options && options.nodeTypeKey) return false;
+ var name = selector.name.toLowerCase();
+ switch (name) {
+ case 'statement':
+ if (node.type.slice(-9) === 'Statement') return true;
+ // fallthrough: interface Declaration <: Statement { }
+ case 'declaration':
+ return node.type.slice(-11) === 'Declaration';
+ case 'pattern':
+ if (node.type.slice(-7) === 'Pattern') return true;
+ // fallthrough: interface Expression <: Node, Pattern { }
+ case 'expression':
+ return node.type.slice(-10) === 'Expression' || node.type.slice(-7) === 'Literal' || node.type === 'Identifier' && (ancestry.length === 0 || ancestry[0].type !== 'MetaProperty') || node.type === 'MetaProperty';
+ case 'function':
+ return node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression' || node.type === 'ArrowFunctionExpression';
+ }
+ throw new Error("Unknown class name: ".concat(selector.name));
+ };
+ }
+ }
+ throw new Error("Unknown selector type: ".concat(selector.type));
+}
+
/**
* @callback TraverseOptionFallback
* @param {external:AST} node The given node.
@@ -4187,9 +3714,19 @@
*/
/**
+ * @callback ClassMatcher
+ * @param {string} className The name of the class to match.
+ * @param {external:AST} node The node to match against.
+ * @param {Array<external:AST>} ancestry The ancestry of the node.
+ * @returns {boolean} True if the node matches the class, false if not.
+ */
+
+/**
* @typedef {object} ESQueryOptions
+ * @property {string} [nodeTypeKey="type"] By passing `nodeTypeKey`, we can allow other ASTs to use ESQuery.
* @property { { [nodeType: string]: string[] } } [visitorKeys] By passing `visitorKeys` mapping, we can extend the properties of the nodes that traverse the node.
* @property {TraverseOptionFallback} [fallback] By passing `fallback` option, we can control the properties of traversing nodes when encountering unknown nodes.
+ * @property {ClassMatcher} [matchClass] By passing `matchClass` option, we can customize the interpretation of classes.
*/
/**
@@ -4203,459 +3740,164 @@
* selector value type)
* @returns {boolean}
*/
-
-
function matches(node, selector, ancestry, options) {
if (!selector) {
return true;
}
-
if (!node) {
return false;
}
-
if (!ancestry) {
ancestry = [];
}
-
- switch (selector.type) {
- case 'wildcard':
- return true;
-
- case 'identifier':
- return selector.value.toLowerCase() === node.type.toLowerCase();
-
- case 'field':
- {
- var path = selector.name.split('.');
- var ancestor = ancestry[path.length - 1];
- return inPath(node, ancestor, path);
- }
-
- case 'matches':
- var _iterator3 = _createForOfIteratorHelper(selector.selectors),
- _step3;
-
- try {
- for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
- var sel = _step3.value;
-
- if (matches(node, sel, ancestry, options)) {
- return true;
- }
- }
- } catch (err) {
- _iterator3.e(err);
- } finally {
- _iterator3.f();
- }
-
- return false;
-
- case 'compound':
- var _iterator4 = _createForOfIteratorHelper(selector.selectors),
- _step4;
-
- try {
- for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
- var _sel = _step4.value;
-
- if (!matches(node, _sel, ancestry, options)) {
- return false;
- }
- }
- } catch (err) {
- _iterator4.e(err);
- } finally {
- _iterator4.f();
- }
-
- return true;
-
- case 'not':
- var _iterator5 = _createForOfIteratorHelper(selector.selectors),
- _step5;
-
- try {
- for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
- var _sel2 = _step5.value;
-
- if (matches(node, _sel2, ancestry, options)) {
- return false;
- }
- }
- } catch (err) {
- _iterator5.e(err);
- } finally {
- _iterator5.f();
- }
-
- return true;
-
- case 'has':
- {
- var _ret = function () {
- var collector = [];
-
- var _iterator6 = _createForOfIteratorHelper(selector.selectors),
- _step6;
-
- try {
- var _loop = function _loop() {
- var sel = _step6.value;
- var a = [];
- estraverse.traverse(node, {
- enter: function enter(node, parent) {
- if (parent != null) {
- a.unshift(parent);
- }
-
- if (matches(node, sel, a, options)) {
- collector.push(node);
- }
- },
- leave: function leave() {
- a.shift();
- },
- keys: options && options.visitorKeys,
- fallback: options && options.fallback || 'iteration'
- });
- };
-
- for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
- _loop();
- }
- } catch (err) {
- _iterator6.e(err);
- } finally {
- _iterator6.f();
- }
-
- return {
- v: collector.length !== 0
- };
- }();
-
- if (_typeof(_ret) === "object") return _ret.v;
- }
-
- case 'child':
- if (matches(node, selector.right, ancestry, options)) {
- return matches(ancestry[0], selector.left, ancestry.slice(1), options);
- }
-
- return false;
-
- case 'descendant':
- if (matches(node, selector.right, ancestry, options)) {
- for (var i = 0, l = ancestry.length; i < l; ++i) {
- if (matches(ancestry[i], selector.left, ancestry.slice(i + 1), options)) {
- return true;
- }
- }
- }
-
- return false;
-
- case 'attribute':
- {
- var p = getPath(node, selector.name);
-
- switch (selector.operator) {
- case void 0:
- return p != null;
-
- case '=':
- switch (selector.value.type) {
- case 'regexp':
- return typeof p === 'string' && selector.value.value.test(p);
-
- case 'literal':
- return "".concat(selector.value.value) === "".concat(p);
-
- case 'type':
- return selector.value.value === _typeof(p);
- }
-
- throw new Error("Unknown selector value type: ".concat(selector.value.type));
-
- case '!=':
- switch (selector.value.type) {
- case 'regexp':
- return !selector.value.value.test(p);
-
- case 'literal':
- return "".concat(selector.value.value) !== "".concat(p);
-
- case 'type':
- return selector.value.value !== _typeof(p);
- }
-
- throw new Error("Unknown selector value type: ".concat(selector.value.type));
-
- case '<=':
- return p <= selector.value.value;
-
- case '<':
- return p < selector.value.value;
-
- case '>':
- return p > selector.value.value;
-
- case '>=':
- return p >= selector.value.value;
- }
-
- throw new Error("Unknown operator: ".concat(selector.operator));
- }
-
- case 'sibling':
- return matches(node, selector.right, ancestry, options) && sibling(node, selector.left, ancestry, LEFT_SIDE, options) || selector.left.subject && matches(node, selector.left, ancestry, options) && sibling(node, selector.right, ancestry, RIGHT_SIDE, options);
-
- case 'adjacent':
- return matches(node, selector.right, ancestry, options) && adjacent(node, selector.left, ancestry, LEFT_SIDE, options) || selector.right.subject && matches(node, selector.left, ancestry, options) && adjacent(node, selector.right, ancestry, RIGHT_SIDE, options);
-
- case 'nth-child':
- return matches(node, selector.right, ancestry, options) && nthChild(node, ancestry, function () {
- return selector.index.value - 1;
- }, options);
-
- case 'nth-last-child':
- return matches(node, selector.right, ancestry, options) && nthChild(node, ancestry, function (length) {
- return length - selector.index.value;
- }, options);
-
- case 'class':
- switch (selector.name.toLowerCase()) {
- case 'statement':
- if (node.type.slice(-9) === 'Statement') return true;
- // fallthrough: interface Declaration <: Statement { }
-
- case 'declaration':
- return node.type.slice(-11) === 'Declaration';
-
- case 'pattern':
- if (node.type.slice(-7) === 'Pattern') return true;
- // fallthrough: interface Expression <: Node, Pattern { }
-
- case 'expression':
- return node.type.slice(-10) === 'Expression' || node.type.slice(-7) === 'Literal' || node.type === 'Identifier' && (ancestry.length === 0 || ancestry[0].type !== 'MetaProperty') || node.type === 'MetaProperty';
-
- case 'function':
- return node.type === 'FunctionDeclaration' || node.type === 'FunctionExpression' || node.type === 'ArrowFunctionExpression';
- }
-
- throw new Error("Unknown class name: ".concat(selector.name));
- }
-
- throw new Error("Unknown selector type: ".concat(selector.type));
+ return getMatcher(selector)(node, ancestry, options);
}
+
/**
* Get visitor keys of a given node.
* @param {external:AST} node The AST node to get keys.
* @param {ESQueryOptions|undefined} options
* @returns {string[]} Visitor keys of the node.
*/
-
-
function getVisitorKeys(node, options) {
- var nodeType = node.type;
-
+ var nodeTypeKey = options && options.nodeTypeKey || 'type';
+ var nodeType = node[nodeTypeKey];
if (options && options.visitorKeys && options.visitorKeys[nodeType]) {
return options.visitorKeys[nodeType];
}
-
if (estraverse.VisitorKeys[nodeType]) {
return estraverse.VisitorKeys[nodeType];
}
-
if (options && typeof options.fallback === 'function') {
return options.fallback(node);
- } // 'iteration' fallback
-
-
+ }
+ // 'iteration' fallback
return Object.keys(node).filter(function (key) {
- return key !== 'type';
+ return key !== nodeTypeKey;
});
}
+
/**
* Check whether the given value is an ASTNode or not.
* @param {any} node The value to check.
+ * @param {ESQueryOptions|undefined} options The options to use.
* @returns {boolean} `true` if the value is an ASTNode.
*/
-
-
-function isNode(node) {
- return node !== null && _typeof(node) === 'object' && typeof node.type === 'string';
+function isNode(node, options) {
+ var nodeTypeKey = options && options.nodeTypeKey || 'type';
+ return node !== null && _typeof(node) === 'object' && typeof node[nodeTypeKey] === 'string';
}
+
/**
* Determines if the given node has a sibling that matches the
- * given selector.
+ * given selector matcher.
* @param {external:AST} node
- * @param {SelectorSequenceAST} selector
+ * @param {SelectorMatcher} matcher
* @param {external:AST[]} ancestry
* @param {Side} side
* @param {ESQueryOptions|undefined} options
* @returns {boolean}
*/
-
-
-function sibling(node, selector, ancestry, side, options) {
+function sibling(node, matcher, ancestry, side, options) {
var _ancestry = _slicedToArray(ancestry, 1),
- parent = _ancestry[0];
-
+ parent = _ancestry[0];
if (!parent) {
return false;
}
-
var keys = getVisitorKeys(parent, options);
-
- var _iterator7 = _createForOfIteratorHelper(keys),
- _step7;
-
- try {
- for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
- var key = _step7.value;
- var listProp = parent[key];
-
- if (Array.isArray(listProp)) {
- var startIndex = listProp.indexOf(node);
-
- if (startIndex < 0) {
- continue;
- }
-
- var lowerBound = void 0,
- upperBound = void 0;
-
- if (side === LEFT_SIDE) {
- lowerBound = 0;
- upperBound = startIndex;
- } else {
- lowerBound = startIndex + 1;
- upperBound = listProp.length;
- }
-
- for (var k = lowerBound; k < upperBound; ++k) {
- if (isNode(listProp[k]) && matches(listProp[k], selector, ancestry, options)) {
- return true;
- }
+ for (var i = 0; i < keys.length; ++i) {
+ var listProp = parent[keys[i]];
+ if (Array.isArray(listProp)) {
+ var startIndex = listProp.indexOf(node);
+ if (startIndex < 0) {
+ continue;
+ }
+ var lowerBound = void 0,
+ upperBound = void 0;
+ if (side === LEFT_SIDE) {
+ lowerBound = 0;
+ upperBound = startIndex;
+ } else {
+ lowerBound = startIndex + 1;
+ upperBound = listProp.length;
+ }
+ for (var k = lowerBound; k < upperBound; ++k) {
+ if (isNode(listProp[k], options) && matcher(listProp[k], ancestry, options)) {
+ return true;
}
}
}
- } catch (err) {
- _iterator7.e(err);
- } finally {
- _iterator7.f();
}
-
return false;
}
+
/**
* Determines if the given node has an adjacent sibling that matches
- * the given selector.
+ * the given selector matcher.
* @param {external:AST} node
- * @param {SelectorSequenceAST} selector
+ * @param {SelectorMatcher} matcher
* @param {external:AST[]} ancestry
* @param {Side} side
* @param {ESQueryOptions|undefined} options
* @returns {boolean}
*/
-
-
-function adjacent(node, selector, ancestry, side, options) {
+function adjacent(node, matcher, ancestry, side, options) {
var _ancestry2 = _slicedToArray(ancestry, 1),
- parent = _ancestry2[0];
-
+ parent = _ancestry2[0];
if (!parent) {
return false;
}
-
var keys = getVisitorKeys(parent, options);
-
- var _iterator8 = _createForOfIteratorHelper(keys),
- _step8;
-
- try {
- for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
- var key = _step8.value;
- var listProp = parent[key];
-
- if (Array.isArray(listProp)) {
- var idx = listProp.indexOf(node);
-
- if (idx < 0) {
- continue;
- }
-
- if (side === LEFT_SIDE && idx > 0 && isNode(listProp[idx - 1]) && matches(listProp[idx - 1], selector, ancestry, options)) {
- return true;
- }
-
- if (side === RIGHT_SIDE && idx < listProp.length - 1 && isNode(listProp[idx + 1]) && matches(listProp[idx + 1], selector, ancestry, options)) {
- return true;
- }
+ for (var i = 0; i < keys.length; ++i) {
+ var listProp = parent[keys[i]];
+ if (Array.isArray(listProp)) {
+ var idx = listProp.indexOf(node);
+ if (idx < 0) {
+ continue;
+ }
+ if (side === LEFT_SIDE && idx > 0 && isNode(listProp[idx - 1], options) && matcher(listProp[idx - 1], ancestry, options)) {
+ return true;
+ }
+ if (side === RIGHT_SIDE && idx < listProp.length - 1 && isNode(listProp[idx + 1], options) && matcher(listProp[idx + 1], ancestry, options)) {
+ return true;
}
}
- } catch (err) {
- _iterator8.e(err);
- } finally {
- _iterator8.f();
}
-
return false;
}
-/**
-* @callback IndexFunction
-* @param {Integer} len Containing list's length
-* @returns {Integer}
-*/
/**
- * Determines if the given node is the nth child, determined by
- * `idxFn`, which is given the containing list's length.
+ * Determines if the given node is the `nth` child.
+ * If `nth` is negative then the position is counted
+ * from the end of the list of children.
* @param {external:AST} node
* @param {external:AST[]} ancestry
- * @param {IndexFunction} idxFn
+ * @param {Integer} nth
* @param {ESQueryOptions|undefined} options
* @returns {boolean}
*/
-
-
-function nthChild(node, ancestry, idxFn, options) {
+function nthChild(node, ancestry, nth, options) {
+ if (nth === 0) {
+ return false;
+ }
var _ancestry3 = _slicedToArray(ancestry, 1),
- parent = _ancestry3[0];
-
+ parent = _ancestry3[0];
if (!parent) {
return false;
}
-
var keys = getVisitorKeys(parent, options);
-
- var _iterator9 = _createForOfIteratorHelper(keys),
- _step9;
-
- try {
- for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {
- var key = _step9.value;
- var listProp = parent[key];
-
- if (Array.isArray(listProp)) {
- var idx = listProp.indexOf(node);
-
- if (idx >= 0 && idx === idxFn(listProp.length)) {
- return true;
- }
+ for (var i = 0; i < keys.length; ++i) {
+ var listProp = parent[keys[i]];
+ if (Array.isArray(listProp)) {
+ var idx = nth < 0 ? listProp.length + nth : nth - 1;
+ if (idx >= 0 && idx < listProp.length && listProp[idx] === node) {
+ return true;
}
}
- } catch (err) {
- _iterator9.e(err);
- } finally {
- _iterator9.f();
}
-
return false;
}
+
/**
* For each selector node marked as a subject, find the portion of the
* selector that the subject must match.
@@ -4663,29 +3905,23 @@
* @param {SelectorAST} [ancestor] Defaults to `selector`
* @returns {SelectorAST[]}
*/
-
-
function subjects(selector, ancestor) {
if (selector == null || _typeof(selector) != 'object') {
return [];
}
-
if (ancestor == null) {
ancestor = selector;
}
-
var results = selector.subject ? [ancestor] : [];
-
- for (var _i = 0, _Object$entries = _objectEntries(selector); _i < _Object$entries.length; _i++) {
- var _Object$entries$_i = _slicedToArray(_Object$entries[_i], 2),
- p = _Object$entries$_i[0],
- sel = _Object$entries$_i[1];
-
+ var keys = Object.keys(selector);
+ for (var i = 0; i < keys.length; ++i) {
+ var p = keys[i];
+ var sel = selector[p];
results.push.apply(results, _toConsumableArray(subjects(sel, p === 'left' ? sel : ancestor)));
}
-
return results;
}
+
/**
* @callback TraverseVisitor
* @param {?external:AST} node
@@ -4702,32 +3938,27 @@
* @param {ESQueryOptions} [options]
* @returns {external:AST[]}
*/
-
-
function traverse(ast, selector, visitor, options) {
if (!selector) {
return;
}
-
var ancestry = [];
- var altSubjects = subjects(selector);
+ var matcher = getMatcher(selector);
+ var altSubjects = subjects(selector).map(getMatcher);
estraverse.traverse(ast, {
enter: function enter(node, parent) {
if (parent != null) {
ancestry.unshift(parent);
}
-
- if (matches(node, selector, ancestry, options)) {
+ if (matcher(node, ancestry, options)) {
if (altSubjects.length) {
for (var i = 0, l = altSubjects.length; i < l; ++i) {
- if (matches(node, altSubjects[i], ancestry, options)) {
+ if (altSubjects[i](node, ancestry, options)) {
visitor(node, parent, ancestry);
}
-
for (var k = 0, m = ancestry.length; k < m; ++k) {
var succeedingAncestry = ancestry.slice(k + 1);
-
- if (matches(ancestry[k], altSubjects[i], succeedingAncestry, options)) {
+ if (altSubjects[i](ancestry[k], succeedingAncestry, options)) {
visitor(ancestry[k], parent, succeedingAncestry);
}
}
@@ -4744,6 +3975,7 @@
fallback: options && options.fallback || 'iteration'
});
}
+
/**
* From a JS AST and a selector AST, collect all JS AST nodes that
* match the selector.
@@ -4752,8 +3984,6 @@
* @param {ESQueryOptions} [options]
* @returns {external:AST[]}
*/
-
-
function match(ast, selector, options) {
var results = [];
traverse(ast, selector, function (node) {
@@ -4761,16 +3991,16 @@
}, options);
return results;
}
+
/**
* Parse a selector string and return its AST.
* @param {string} selector
* @returns {SelectorAST}
*/
-
-
function parse(selector) {
return parser.parse(selector);
}
+
/**
* Query the code AST using the selector string.
* @param {external:AST} ast
@@ -4778,12 +4008,9 @@
* @param {ESQueryOptions} [options]
* @returns {external:AST[]}
*/
-
-
function query(ast, selector, options) {
return match(ast, parse(selector), options);
}
-
query.parse = parse;
query.match = match;
query.traverse = traverse;
