ece-docs-components 1.0.40 → 1.0.41

package/dist/cjs/node_modules/domutils/lib/legacy.js

@@ -0,0 +1,183 @@
+'use strict';
+
+var legacy = require('../../../_virtual/legacy.js');
+var index = require('../../domhandler/lib/index.js');
+var querying = require('./querying.js');
+
+var hasRequiredLegacy;
+
+function requireLegacy () {
+	if (hasRequiredLegacy) return legacy.__exports;
+	hasRequiredLegacy = 1;
+	Object.defineProperty(legacy.__exports, "__esModule", { value: true });
+	legacy.__exports.testElement = testElement;
+	legacy.__exports.getElements = getElements;
+	legacy.__exports.getElementById = getElementById;
+	legacy.__exports.getElementsByTagName = getElementsByTagName;
+	legacy.__exports.getElementsByClassName = getElementsByClassName;
+	legacy.__exports.getElementsByTagType = getElementsByTagType;
+	var domhandler_1 = /*@__PURE__*/ index.__require();
+	var querying_js_1 = /*@__PURE__*/ querying.__require();
+	/**
+	 * A map of functions to check nodes against.
+	 */
+	var Checks = {
+	    tag_name: function (name) {
+	        if (typeof name === "function") {
+	            return function (elem) { return (0, domhandler_1.isTag)(elem) && name(elem.name); };
+	        }
+	        else if (name === "*") {
+	            return domhandler_1.isTag;
+	        }
+	        return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.name === name; };
+	    },
+	    tag_type: function (type) {
+	        if (typeof type === "function") {
+	            return function (elem) { return type(elem.type); };
+	        }
+	        return function (elem) { return elem.type === type; };
+	    },
+	    tag_contains: function (data) {
+	        if (typeof data === "function") {
+	            return function (elem) { return (0, domhandler_1.isText)(elem) && data(elem.data); };
+	        }
+	        return function (elem) { return (0, domhandler_1.isText)(elem) && elem.data === data; };
+	    },
+	};
+	/**
+	 * Returns a function to check whether a node has an attribute with a particular
+	 * value.
+	 *
+	 * @param attrib Attribute to check.
+	 * @param value Attribute value to look for.
+	 * @returns A function to check whether the a node has an attribute with a
+	 *   particular value.
+	 */
+	function getAttribCheck(attrib, value) {
+	    if (typeof value === "function") {
+	        return function (elem) { return (0, domhandler_1.isTag)(elem) && value(elem.attribs[attrib]); };
+	    }
+	    return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.attribs[attrib] === value; };
+	}
+	/**
+	 * Returns a function that returns `true` if either of the input functions
+	 * returns `true` for a node.
+	 *
+	 * @param a First function to combine.
+	 * @param b Second function to combine.
+	 * @returns A function taking a node and returning `true` if either of the input
+	 *   functions returns `true` for the node.
+	 */
+	function combineFuncs(a, b) {
+	    return function (elem) { return a(elem) || b(elem); };
+	}
+	/**
+	 * Returns a function that executes all checks in `options` and returns `true`
+	 * if any of them match a node.
+	 *
+	 * @param options An object describing nodes to look for.
+	 * @returns A function that executes all checks in `options` and returns `true`
+	 *   if any of them match a node.
+	 */
+	function compileTest(options) {
+	    var funcs = Object.keys(options).map(function (key) {
+	        var value = options[key];
+	        return Object.prototype.hasOwnProperty.call(Checks, key)
+	            ? Checks[key](value)
+	            : getAttribCheck(key, value);
+	    });
+	    return funcs.length === 0 ? null : funcs.reduce(combineFuncs);
+	}
+	/**
+	 * Checks whether a node matches the description in `options`.
+	 *
+	 * @category Legacy Query Functions
+	 * @param options An object describing nodes to look for.
+	 * @param node The element to test.
+	 * @returns Whether the element matches the description in `options`.
+	 */
+	function testElement(options, node) {
+	    var test = compileTest(options);
+	    return test ? test(node) : true;
+	}
+	/**
+	 * Returns all nodes that match `options`.
+	 *
+	 * @category Legacy Query Functions
+	 * @param options An object describing nodes to look for.
+	 * @param nodes Nodes to search through.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes that match `options`.
+	 */
+	function getElements(options, nodes, recurse, limit) {
+	    if (limit === void 0) { limit = Infinity; }
+	    var test = compileTest(options);
+	    return test ? (0, querying_js_1.filter)(test, nodes, recurse, limit) : [];
+	}
+	/**
+	 * Returns the node with the supplied ID.
+	 *
+	 * @category Legacy Query Functions
+	 * @param id The unique ID attribute value to look for.
+	 * @param nodes Nodes to search through.
+	 * @param recurse Also consider child nodes.
+	 * @returns The node with the supplied ID.
+	 */
+	function getElementById(id, nodes, recurse) {
+	    if (recurse === void 0) { recurse = true; }
+	    if (!Array.isArray(nodes))
+	        nodes = [nodes];
+	    return (0, querying_js_1.findOne)(getAttribCheck("id", id), nodes, recurse);
+	}
+	/**
+	 * Returns all nodes with the supplied `tagName`.
+	 *
+	 * @category Legacy Query Functions
+	 * @param tagName Tag name to search for.
+	 * @param nodes Nodes to search through.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes with the supplied `tagName`.
+	 */
+	function getElementsByTagName(tagName, nodes, recurse, limit) {
+	    if (recurse === void 0) { recurse = true; }
+	    if (limit === void 0) { limit = Infinity; }
+	    return (0, querying_js_1.filter)(Checks["tag_name"](tagName), nodes, recurse, limit);
+	}
+	/**
+	 * Returns all nodes with the supplied `className`.
+	 *
+	 * @category Legacy Query Functions
+	 * @param className Class name to search for.
+	 * @param nodes Nodes to search through.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes with the supplied `className`.
+	 */
+	function getElementsByClassName(className, nodes, recurse, limit) {
+	    if (recurse === void 0) { recurse = true; }
+	    if (limit === void 0) { limit = Infinity; }
+	    return (0, querying_js_1.filter)(getAttribCheck("class", className), nodes, recurse, limit);
+	}
+	/**
+	 * Returns all nodes with the supplied `type`.
+	 *
+	 * @category Legacy Query Functions
+	 * @param type Element type to look for.
+	 * @param nodes Nodes to search through.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes with the supplied `type`.
+	 */
+	function getElementsByTagType(type, nodes, recurse, limit) {
+	    if (recurse === void 0) { recurse = true; }
+	    if (limit === void 0) { limit = Infinity; }
+	    return (0, querying_js_1.filter)(Checks["tag_type"](type), nodes, recurse, limit);
+	}
+	
+	return legacy.__exports;
+}
+
+exports.__require = requireLegacy;
+//# sourceMappingURL=legacy.js.map

package/dist/cjs/node_modules/domutils/lib/legacy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"legacy.js","sources":["../../../../../node_modules/domutils/lib/legacy.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.testElement = testElement;\nexports.getElements = getElements;\nexports.getElementById = getElementById;\nexports.getElementsByTagName = getElementsByTagName;\nexports.getElementsByClassName = getElementsByClassName;\nexports.getElementsByTagType = getElementsByTagType;\nvar domhandler_1 = require(\"domhandler\");\nvar querying_js_1 = require(\"./querying.js\");\n/**\n * A map of functions to check nodes against.\n */\nvar Checks = {\n    tag_name: function (name) {\n        if (typeof name === \"function\") {\n            return function (elem) { return (0, domhandler_1.isTag)(elem) && name(elem.name); };\n        }\n        else if (name === \"*\") {\n            return domhandler_1.isTag;\n        }\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.name === name; };\n    },\n    tag_type: function (type) {\n        if (typeof type === \"function\") {\n            return function (elem) { return type(elem.type); };\n        }\n        return function (elem) { return elem.type === type; };\n    },\n    tag_contains: function (data) {\n        if (typeof data === \"function\") {\n            return function (elem) { return (0, domhandler_1.isText)(elem) && data(elem.data); };\n        }\n        return function (elem) { return (0, domhandler_1.isText)(elem) && elem.data === data; };\n    },\n};\n/**\n * Returns a function to check whether a node has an attribute with a particular\n * value.\n *\n * @param attrib Attribute to check.\n * @param value Attribute value to look for.\n * @returns A function to check whether the a node has an attribute with a\n *   particular value.\n */\nfunction getAttribCheck(attrib, value) {\n    if (typeof value === \"function\") {\n        return function (elem) { return (0, domhandler_1.isTag)(elem) && value(elem.attribs[attrib]); };\n    }\n    return function (elem) { return (0, domhandler_1.isTag)(elem) && elem.attribs[attrib] === value; };\n}\n/**\n * Returns a function that returns `true` if either of the input functions\n * returns `true` for a node.\n *\n * @param a First function to combine.\n * @param b Second function to combine.\n * @returns A function taking a node and returning `true` if either of the input\n *   functions returns `true` for the node.\n */\nfunction combineFuncs(a, b) {\n    return function (elem) { return a(elem) || b(elem); };\n}\n/**\n * Returns a function that executes all checks in `options` and returns `true`\n * if any of them match a node.\n *\n * @param options An object describing nodes to look for.\n * @returns A function that executes all checks in `options` and returns `true`\n *   if any of them match a node.\n */\nfunction compileTest(options) {\n    var funcs = Object.keys(options).map(function (key) {\n        var value = options[key];\n        return Object.prototype.hasOwnProperty.call(Checks, key)\n            ? Checks[key](value)\n            : getAttribCheck(key, value);\n    });\n    return funcs.length === 0 ? null : funcs.reduce(combineFuncs);\n}\n/**\n * Checks whether a node matches the description in `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param node The element to test.\n * @returns Whether the element matches the description in `options`.\n */\nfunction testElement(options, node) {\n    var test = compileTest(options);\n    return test ? test(node) : true;\n}\n/**\n * Returns all nodes that match `options`.\n *\n * @category Legacy Query Functions\n * @param options An object describing nodes to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes that match `options`.\n */\nfunction getElements(options, nodes, recurse, limit) {\n    if (limit === void 0) { limit = Infinity; }\n    var test = compileTest(options);\n    return test ? (0, querying_js_1.filter)(test, nodes, recurse, limit) : [];\n}\n/**\n * Returns the node with the supplied ID.\n *\n * @category Legacy Query Functions\n * @param id The unique ID attribute value to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @returns The node with the supplied ID.\n */\nfunction getElementById(id, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    if (!Array.isArray(nodes))\n        nodes = [nodes];\n    return (0, querying_js_1.findOne)(getAttribCheck(\"id\", id), nodes, recurse);\n}\n/**\n * Returns all nodes with the supplied `tagName`.\n *\n * @category Legacy Query Functions\n * @param tagName Tag name to search for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `tagName`.\n */\nfunction getElementsByTagName(tagName, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_name\"](tagName), nodes, recurse, limit);\n}\n/**\n * Returns all nodes with the supplied `className`.\n *\n * @category Legacy Query Functions\n * @param className Class name to search for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `className`.\n */\nfunction getElementsByClassName(className, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(getAttribCheck(\"class\", className), nodes, recurse, limit);\n}\n/**\n * Returns all nodes with the supplied `type`.\n *\n * @category Legacy Query Functions\n * @param type Element type to look for.\n * @param nodes Nodes to search through.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes with the supplied `type`.\n */\nfunction getElementsByTagType(type, nodes, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return (0, querying_js_1.filter)(Checks[\"tag_type\"](type), nodes, recurse, limit);\n}\n//# sourceMappingURL=legacy.js.map"],"names":["legacy","require$$0","require$$1"],"mappings":";;;;;;;;;;;AACA,CAAA,MAAM,CAAC,cAAc,CAACA,gBAAO,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC7D,CAAAA,gBAAA,CAAA,WAAmB,GAAG,WAAW;AACjC,CAAAA,gBAAA,CAAA,WAAmB,GAAG,WAAW;AACjC,CAAAA,gBAAA,CAAA,cAAsB,GAAG,cAAc;AACvC,CAAAA,gBAAA,CAAA,oBAA4B,GAAG,oBAAoB;AACnD,CAAAA,gBAAA,CAAA,sBAA8B,GAAG,sBAAsB;AACvD,CAAAA,gBAAA,CAAA,oBAA4B,GAAG,oBAAoB;CACnD,IAAI,YAAY,iBAAGC,eAAA,EAAqB;CACxC,IAAI,aAAa,iBAAGC,kBAAA,EAAwB;AAC5C;AACA;AACA;AACA,CAAA,IAAI,MAAM,GAAG;AACb,KAAI,QAAQ,EAAE,UAAU,IAAI,EAAE;AAC9B,SAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;aAC5B,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA,CAAE;AAC/F,SAAA;AACA,cAAa,IAAI,IAAI,KAAK,GAAG,EAAE;aACnB,OAAO,YAAY,CAAC,KAAK;AACrC,SAAA;SACQ,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA,CAAE;KAC9F,CAAK;AACL,KAAI,QAAQ,EAAE,UAAU,IAAI,EAAE;AAC9B,SAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AACxC,aAAY,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA,CAAE;AAC9D,SAAA;AACA,SAAQ,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA,CAAE;KAC7D,CAAK;AACL,KAAI,YAAY,EAAE,UAAU,IAAI,EAAE;AAClC,SAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;aAC5B,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA,CAAE;AAChG,SAAA;SACQ,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA,CAAE;KAC/F,CAAK;EACJ;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE;AACvC,KAAI,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE;SAC7B,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA,CAAE;AACvG,KAAA;KACI,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAA,CAAE;AACtG,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE;AAC5B,KAAI,OAAO,UAAU,IAAI,EAAE,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA,CAAE;AACzD,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,WAAW,CAAC,OAAO,EAAE;AAC9B,KAAI,IAAI,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE;AACxD,SAAQ,IAAI,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC;SACxB,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG;AAC/D,eAAc,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK;AAC/B,eAAc,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC;AACxC,KAAA,CAAK,CAAC;AACN,KAAI,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;AACjE,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE;AACpC,KAAI,IAAI,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC;KAC/B,OAAO,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI;AACnC,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;KACjD,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAA;AAC7C,KAAI,IAAI,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC;AACnC,KAAI,OAAO,IAAI,GAAG,IAAI,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE;AAC7E,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE;KACxC,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;AAC7C,KAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7B,SAAQ,KAAK,GAAG,CAAC,KAAK,CAAC;AACvB,KAAI,OAAO,IAAI,aAAa,CAAC,OAAO,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC;AAC/E,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;KAC1D,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;KACzC,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAA;KACzC,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC;AACxF,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,sBAAsB,CAAC,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;KAC9D,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;KACzC,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAA;KACzC,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC;AAC/F,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;KACvD,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;KACzC,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAA;KACzC,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC;AACrF,CAAA;AACA;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/domutils/lib/manipulation.js

@@ -0,0 +1,155 @@
+'use strict';
+
+var manipulation = require('../../../_virtual/manipulation.js');
+
+var hasRequiredManipulation;
+
+function requireManipulation () {
+	if (hasRequiredManipulation) return manipulation.__exports;
+	hasRequiredManipulation = 1;
+	Object.defineProperty(manipulation.__exports, "__esModule", { value: true });
+	manipulation.__exports.removeElement = removeElement;
+	manipulation.__exports.replaceElement = replaceElement;
+	manipulation.__exports.appendChild = appendChild;
+	manipulation.__exports.append = append;
+	manipulation.__exports.prependChild = prependChild;
+	manipulation.__exports.prepend = prepend;
+	/**
+	 * Remove an element from the dom
+	 *
+	 * @category Manipulation
+	 * @param elem The element to be removed
+	 */
+	function removeElement(elem) {
+	    if (elem.prev)
+	        elem.prev.next = elem.next;
+	    if (elem.next)
+	        elem.next.prev = elem.prev;
+	    if (elem.parent) {
+	        var childs = elem.parent.children;
+	        var childsIndex = childs.lastIndexOf(elem);
+	        if (childsIndex >= 0) {
+	            childs.splice(childsIndex, 1);
+	        }
+	    }
+	    elem.next = null;
+	    elem.prev = null;
+	    elem.parent = null;
+	}
+	/**
+	 * Replace an element in the dom
+	 *
+	 * @category Manipulation
+	 * @param elem The element to be replaced
+	 * @param replacement The element to be added
+	 */
+	function replaceElement(elem, replacement) {
+	    var prev = (replacement.prev = elem.prev);
+	    if (prev) {
+	        prev.next = replacement;
+	    }
+	    var next = (replacement.next = elem.next);
+	    if (next) {
+	        next.prev = replacement;
+	    }
+	    var parent = (replacement.parent = elem.parent);
+	    if (parent) {
+	        var childs = parent.children;
+	        childs[childs.lastIndexOf(elem)] = replacement;
+	        elem.parent = null;
+	    }
+	}
+	/**
+	 * Append a child to an element.
+	 *
+	 * @category Manipulation
+	 * @param parent The element to append to.
+	 * @param child The element to be added as a child.
+	 */
+	function appendChild(parent, child) {
+	    removeElement(child);
+	    child.next = null;
+	    child.parent = parent;
+	    if (parent.children.push(child) > 1) {
+	        var sibling = parent.children[parent.children.length - 2];
+	        sibling.next = child;
+	        child.prev = sibling;
+	    }
+	    else {
+	        child.prev = null;
+	    }
+	}
+	/**
+	 * Append an element after another.
+	 *
+	 * @category Manipulation
+	 * @param elem The element to append after.
+	 * @param next The element be added.
+	 */
+	function append(elem, next) {
+	    removeElement(next);
+	    var parent = elem.parent;
+	    var currNext = elem.next;
+	    next.next = currNext;
+	    next.prev = elem;
+	    elem.next = next;
+	    next.parent = parent;
+	    if (currNext) {
+	        currNext.prev = next;
+	        if (parent) {
+	            var childs = parent.children;
+	            childs.splice(childs.lastIndexOf(currNext), 0, next);
+	        }
+	    }
+	    else if (parent) {
+	        parent.children.push(next);
+	    }
+	}
+	/**
+	 * Prepend a child to an element.
+	 *
+	 * @category Manipulation
+	 * @param parent The element to prepend before.
+	 * @param child The element to be added as a child.
+	 */
+	function prependChild(parent, child) {
+	    removeElement(child);
+	    child.parent = parent;
+	    child.prev = null;
+	    if (parent.children.unshift(child) !== 1) {
+	        var sibling = parent.children[1];
+	        sibling.prev = child;
+	        child.next = sibling;
+	    }
+	    else {
+	        child.next = null;
+	    }
+	}
+	/**
+	 * Prepend an element before another.
+	 *
+	 * @category Manipulation
+	 * @param elem The element to prepend before.
+	 * @param prev The element be added.
+	 */
+	function prepend(elem, prev) {
+	    removeElement(prev);
+	    var parent = elem.parent;
+	    if (parent) {
+	        var childs = parent.children;
+	        childs.splice(childs.indexOf(elem), 0, prev);
+	    }
+	    if (elem.prev) {
+	        elem.prev.next = prev;
+	    }
+	    prev.parent = parent;
+	    prev.prev = elem.prev;
+	    prev.next = elem;
+	    elem.prev = prev;
+	}
+	
+	return manipulation.__exports;
+}
+
+exports.__require = requireManipulation;
+//# sourceMappingURL=manipulation.js.map

package/dist/cjs/node_modules/domutils/lib/manipulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"manipulation.js","sources":["../../../../../node_modules/domutils/lib/manipulation.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.removeElement = removeElement;\nexports.replaceElement = replaceElement;\nexports.appendChild = appendChild;\nexports.append = append;\nexports.prependChild = prependChild;\nexports.prepend = prepend;\n/**\n * Remove an element from the dom\n *\n * @category Manipulation\n * @param elem The element to be removed\n */\nfunction removeElement(elem) {\n    if (elem.prev)\n        elem.prev.next = elem.next;\n    if (elem.next)\n        elem.next.prev = elem.prev;\n    if (elem.parent) {\n        var childs = elem.parent.children;\n        var childsIndex = childs.lastIndexOf(elem);\n        if (childsIndex >= 0) {\n            childs.splice(childsIndex, 1);\n        }\n    }\n    elem.next = null;\n    elem.prev = null;\n    elem.parent = null;\n}\n/**\n * Replace an element in the dom\n *\n * @category Manipulation\n * @param elem The element to be replaced\n * @param replacement The element to be added\n */\nfunction replaceElement(elem, replacement) {\n    var prev = (replacement.prev = elem.prev);\n    if (prev) {\n        prev.next = replacement;\n    }\n    var next = (replacement.next = elem.next);\n    if (next) {\n        next.prev = replacement;\n    }\n    var parent = (replacement.parent = elem.parent);\n    if (parent) {\n        var childs = parent.children;\n        childs[childs.lastIndexOf(elem)] = replacement;\n        elem.parent = null;\n    }\n}\n/**\n * Append a child to an element.\n *\n * @category Manipulation\n * @param parent The element to append to.\n * @param child The element to be added as a child.\n */\nfunction appendChild(parent, child) {\n    removeElement(child);\n    child.next = null;\n    child.parent = parent;\n    if (parent.children.push(child) > 1) {\n        var sibling = parent.children[parent.children.length - 2];\n        sibling.next = child;\n        child.prev = sibling;\n    }\n    else {\n        child.prev = null;\n    }\n}\n/**\n * Append an element after another.\n *\n * @category Manipulation\n * @param elem The element to append after.\n * @param next The element be added.\n */\nfunction append(elem, next) {\n    removeElement(next);\n    var parent = elem.parent;\n    var currNext = elem.next;\n    next.next = currNext;\n    next.prev = elem;\n    elem.next = next;\n    next.parent = parent;\n    if (currNext) {\n        currNext.prev = next;\n        if (parent) {\n            var childs = parent.children;\n            childs.splice(childs.lastIndexOf(currNext), 0, next);\n        }\n    }\n    else if (parent) {\n        parent.children.push(next);\n    }\n}\n/**\n * Prepend a child to an element.\n *\n * @category Manipulation\n * @param parent The element to prepend before.\n * @param child The element to be added as a child.\n */\nfunction prependChild(parent, child) {\n    removeElement(child);\n    child.parent = parent;\n    child.prev = null;\n    if (parent.children.unshift(child) !== 1) {\n        var sibling = parent.children[1];\n        sibling.prev = child;\n        child.next = sibling;\n    }\n    else {\n        child.next = null;\n    }\n}\n/**\n * Prepend an element before another.\n *\n * @category Manipulation\n * @param elem The element to prepend before.\n * @param prev The element be added.\n */\nfunction prepend(elem, prev) {\n    removeElement(prev);\n    var parent = elem.parent;\n    if (parent) {\n        var childs = parent.children;\n        childs.splice(childs.indexOf(elem), 0, prev);\n    }\n    if (elem.prev) {\n        elem.prev.next = prev;\n    }\n    prev.parent = parent;\n    prev.prev = elem.prev;\n    prev.next = elem;\n    elem.prev = prev;\n}\n//# sourceMappingURL=manipulation.js.map"],"names":["manipulation"],"mappings":";;;;;;;;;AACA,CAAA,MAAM,CAAC,cAAc,CAACA,sBAAO,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC7D,CAAAA,sBAAA,CAAA,aAAqB,GAAG,aAAa;AACrC,CAAAA,sBAAA,CAAA,cAAsB,GAAG,cAAc;AACvC,CAAAA,sBAAA,CAAA,WAAmB,GAAG,WAAW;AACjC,CAAAA,sBAAA,CAAA,MAAc,GAAG,MAAM;AACvB,CAAAA,sBAAA,CAAA,YAAoB,GAAG,YAAY;AACnC,CAAAA,sBAAA,CAAA,OAAe,GAAG,OAAO;AACzB;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,aAAa,CAAC,IAAI,EAAE;KACzB,IAAI,IAAI,CAAC,IAAI;SACT,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;KAC9B,IAAI,IAAI,CAAC,IAAI;SACT,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AAClC,KAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACrB,SAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ;SACjC,IAAI,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;AAClD,SAAQ,IAAI,WAAW,IAAI,CAAC,EAAE;AAC9B,aAAY,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;AACzC,SAAA;AACA,KAAA;AACA,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,MAAM,GAAG,IAAI;AACtB,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE;KACvC,IAAI,IAAI,IAAI,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;KACzC,IAAI,IAAI,EAAE;AACd,SAAQ,IAAI,CAAC,IAAI,GAAG,WAAW;AAC/B,KAAA;KACI,IAAI,IAAI,IAAI,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;KACzC,IAAI,IAAI,EAAE;AACd,SAAQ,IAAI,CAAC,IAAI,GAAG,WAAW;AAC/B,KAAA;KACI,IAAI,MAAM,IAAI,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;KAC/C,IAAI,MAAM,EAAE;AAChB,SAAQ,IAAI,MAAM,GAAG,MAAM,CAAC,QAAQ;SAC5B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW;AACtD,SAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;AAC1B,KAAA;AACA,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE;KAChC,aAAa,CAAC,KAAK,CAAC;AACxB,KAAI,KAAK,CAAC,IAAI,GAAG,IAAI;AACrB,KAAI,KAAK,CAAC,MAAM,GAAG,MAAM;KACrB,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;AACzC,SAAQ,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;AACjE,SAAQ,OAAO,CAAC,IAAI,GAAG,KAAK;AAC5B,SAAQ,KAAK,CAAC,IAAI,GAAG,OAAO;AAC5B,KAAA;UACS;AACT,SAAQ,KAAK,CAAC,IAAI,GAAG,IAAI;AACzB,KAAA;AACA,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE;KACxB,aAAa,CAAC,IAAI,CAAC;AACvB,KAAI,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;AAC5B,KAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI;AAC5B,KAAI,IAAI,CAAC,IAAI,GAAG,QAAQ;AACxB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,MAAM,GAAG,MAAM;KACpB,IAAI,QAAQ,EAAE;AAClB,SAAQ,QAAQ,CAAC,IAAI,GAAG,IAAI;SACpB,IAAI,MAAM,EAAE;AACpB,aAAY,IAAI,MAAM,GAAG,MAAM,CAAC,QAAQ;AACxC,aAAY,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AAChE,SAAA;AACA,KAAA;UACS,IAAI,MAAM,EAAE;AACrB,SAAQ,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AAClC,KAAA;AACA,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE;KACjC,aAAa,CAAC,KAAK,CAAC;AACxB,KAAI,KAAK,CAAC,MAAM,GAAG,MAAM;AACzB,KAAI,KAAK,CAAC,IAAI,GAAG,IAAI;KACjB,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;SACtC,IAAI,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;AACxC,SAAQ,OAAO,CAAC,IAAI,GAAG,KAAK;AAC5B,SAAQ,KAAK,CAAC,IAAI,GAAG,OAAO;AAC5B,KAAA;UACS;AACT,SAAQ,KAAK,CAAC,IAAI,GAAG,IAAI;AACzB,KAAA;AACA,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE;KACzB,aAAa,CAAC,IAAI,CAAC;AACvB,KAAI,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;KACxB,IAAI,MAAM,EAAE;AAChB,SAAQ,IAAI,MAAM,GAAG,MAAM,CAAC,QAAQ;AACpC,SAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AACpD,KAAA;AACA,KAAI,IAAI,IAAI,CAAC,IAAI,EAAE;AACnB,SAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI;AAC7B,KAAA;AACA,KAAI,IAAI,CAAC,MAAM,GAAG,MAAM;AACxB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AACzB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,CAAA;AACA;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/domutils/lib/querying.js

@@ -0,0 +1,169 @@
+'use strict';
+
+var querying = require('../../../_virtual/querying.js');
+var index = require('../../domhandler/lib/index.js');
+
+var hasRequiredQuerying;
+
+function requireQuerying () {
+	if (hasRequiredQuerying) return querying.__exports;
+	hasRequiredQuerying = 1;
+	Object.defineProperty(querying.__exports, "__esModule", { value: true });
+	querying.__exports.filter = filter;
+	querying.__exports.find = find;
+	querying.__exports.findOneChild = findOneChild;
+	querying.__exports.findOne = findOne;
+	querying.__exports.existsOne = existsOne;
+	querying.__exports.findAll = findAll;
+	var domhandler_1 = /*@__PURE__*/ index.__require();
+	/**
+	 * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param node Node to search. Will be included in the result set if it matches.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes passing `test`.
+	 */
+	function filter(test, node, recurse, limit) {
+	    if (recurse === void 0) { recurse = true; }
+	    if (limit === void 0) { limit = Infinity; }
+	    return find(test, Array.isArray(node) ? node : [node], recurse, limit);
+	}
+	/**
+	 * Search an array of nodes and their children for nodes passing a test function.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param nodes Array of nodes to search.
+	 * @param recurse Also consider child nodes.
+	 * @param limit Maximum number of nodes to return.
+	 * @returns All nodes passing `test`.
+	 */
+	function find(test, nodes, recurse, limit) {
+	    var result = [];
+	    /** Stack of the arrays we are looking at. */
+	    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];
+	    /** Stack of the indices within the arrays. */
+	    var indexStack = [0];
+	    for (;;) {
+	        // First, check if the current array has any more elements to look at.
+	        if (indexStack[0] >= nodeStack[0].length) {
+	            // If we have no more arrays to look at, we are done.
+	            if (indexStack.length === 1) {
+	                return result;
+	            }
+	            // Otherwise, remove the current array from the stack.
+	            nodeStack.shift();
+	            indexStack.shift();
+	            // Loop back to the start to continue with the next array.
+	            continue;
+	        }
+	        var elem = nodeStack[0][indexStack[0]++];
+	        if (test(elem)) {
+	            result.push(elem);
+	            if (--limit <= 0)
+	                return result;
+	        }
+	        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {
+	            /*
+	             * Add the children to the stack. We are depth-first, so this is
+	             * the next array we look at.
+	             */
+	            indexStack.unshift(0);
+	            nodeStack.unshift(elem.children);
+	        }
+	    }
+	}
+	/**
+	 * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param nodes Array of nodes to search.
+	 * @returns The first node in the array that passes `test`.
+	 * @deprecated Use `Array.prototype.find` directly.
+	 */
+	function findOneChild(test, nodes) {
+	    return nodes.find(test);
+	}
+	/**
+	 * Finds one element in a tree that passes a test.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param nodes Node or array of nodes to search.
+	 * @param recurse Also consider child nodes.
+	 * @returns The first node that passes `test`.
+	 */
+	function findOne(test, nodes, recurse) {
+	    if (recurse === void 0) { recurse = true; }
+	    var searchedNodes = Array.isArray(nodes) ? nodes : [nodes];
+	    for (var i = 0; i < searchedNodes.length; i++) {
+	        var node = searchedNodes[i];
+	        if ((0, domhandler_1.isTag)(node) && test(node)) {
+	            return node;
+	        }
+	        if (recurse && (0, domhandler_1.hasChildren)(node) && node.children.length > 0) {
+	            var found = findOne(test, node.children, true);
+	            if (found)
+	                return found;
+	        }
+	    }
+	    return null;
+	}
+	/**
+	 * Checks if a tree of nodes contains at least one node passing a test.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param nodes Array of nodes to search.
+	 * @returns Whether a tree of nodes contains at least one node passing the test.
+	 */
+	function existsOne(test, nodes) {
+	    return (Array.isArray(nodes) ? nodes : [nodes]).some(function (node) {
+	        return ((0, domhandler_1.isTag)(node) && test(node)) ||
+	            ((0, domhandler_1.hasChildren)(node) && existsOne(test, node.children));
+	    });
+	}
+	/**
+	 * Search an array of nodes and their children for elements passing a test function.
+	 *
+	 * Same as `find`, but limited to elements and with less options, leading to reduced complexity.
+	 *
+	 * @category Querying
+	 * @param test Function to test nodes on.
+	 * @param nodes Array of nodes to search.
+	 * @returns All nodes passing `test`.
+	 */
+	function findAll(test, nodes) {
+	    var result = [];
+	    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];
+	    var indexStack = [0];
+	    for (;;) {
+	        if (indexStack[0] >= nodeStack[0].length) {
+	            if (nodeStack.length === 1) {
+	                return result;
+	            }
+	            // Otherwise, remove the current array from the stack.
+	            nodeStack.shift();
+	            indexStack.shift();
+	            // Loop back to the start to continue with the next array.
+	            continue;
+	        }
+	        var elem = nodeStack[0][indexStack[0]++];
+	        if ((0, domhandler_1.isTag)(elem) && test(elem))
+	            result.push(elem);
+	        if ((0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {
+	            indexStack.unshift(0);
+	            nodeStack.unshift(elem.children);
+	        }
+	    }
+	}
+	
+	return querying.__exports;
+}
+
+exports.__require = requireQuerying;
+//# sourceMappingURL=querying.js.map

package/dist/cjs/node_modules/domutils/lib/querying.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"querying.js","sources":["../../../../../node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.filter = filter;\nexports.find = find;\nexports.findOneChild = findOneChild;\nexports.findOne = findOne;\nexports.existsOne = existsOne;\nexports.findAll = findAll;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param node Node to search. Will be included in the result set if it matches.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction filter(test, node, recurse, limit) {\n    if (recurse === void 0) { recurse = true; }\n    if (limit === void 0) { limit = Infinity; }\n    return find(test, Array.isArray(node) ? node : [node], recurse, limit);\n}\n/**\n * Search an array of nodes and their children for nodes passing a test function.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @param recurse Also consider child nodes.\n * @param limit Maximum number of nodes to return.\n * @returns All nodes passing `test`.\n */\nfunction find(test, nodes, recurse, limit) {\n    var result = [];\n    /** Stack of the arrays we are looking at. */\n    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];\n    /** Stack of the indices within the arrays. */\n    var indexStack = [0];\n    for (;;) {\n        // First, check if the current array has any more elements to look at.\n        if (indexStack[0] >= nodeStack[0].length) {\n            // If we have no more arrays to look at, we are done.\n            if (indexStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if (test(elem)) {\n            result.push(elem);\n            if (--limit <= 0)\n                return result;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            /*\n             * Add the children to the stack. We are depth-first, so this is\n             * the next array we look at.\n             */\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\n/**\n * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns The first node in the array that passes `test`.\n * @deprecated Use `Array.prototype.find` directly.\n */\nfunction findOneChild(test, nodes) {\n    return nodes.find(test);\n}\n/**\n * Finds one element in a tree that passes a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Node or array of nodes to search.\n * @param recurse Also consider child nodes.\n * @returns The first node that passes `test`.\n */\nfunction findOne(test, nodes, recurse) {\n    if (recurse === void 0) { recurse = true; }\n    var searchedNodes = Array.isArray(nodes) ? nodes : [nodes];\n    for (var i = 0; i < searchedNodes.length; i++) {\n        var node = searchedNodes[i];\n        if ((0, domhandler_1.isTag)(node) && test(node)) {\n            return node;\n        }\n        if (recurse && (0, domhandler_1.hasChildren)(node) && node.children.length > 0) {\n            var found = findOne(test, node.children, true);\n            if (found)\n                return found;\n        }\n    }\n    return null;\n}\n/**\n * Checks if a tree of nodes contains at least one node passing a test.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns Whether a tree of nodes contains at least one node passing the test.\n */\nfunction existsOne(test, nodes) {\n    return (Array.isArray(nodes) ? nodes : [nodes]).some(function (node) {\n        return ((0, domhandler_1.isTag)(node) && test(node)) ||\n            ((0, domhandler_1.hasChildren)(node) && existsOne(test, node.children));\n    });\n}\n/**\n * Search an array of nodes and their children for elements passing a test function.\n *\n * Same as `find`, but limited to elements and with less options, leading to reduced complexity.\n *\n * @category Querying\n * @param test Function to test nodes on.\n * @param nodes Array of nodes to search.\n * @returns All nodes passing `test`.\n */\nfunction findAll(test, nodes) {\n    var result = [];\n    var nodeStack = [Array.isArray(nodes) ? nodes : [nodes]];\n    var indexStack = [0];\n    for (;;) {\n        if (indexStack[0] >= nodeStack[0].length) {\n            if (nodeStack.length === 1) {\n                return result;\n            }\n            // Otherwise, remove the current array from the stack.\n            nodeStack.shift();\n            indexStack.shift();\n            // Loop back to the start to continue with the next array.\n            continue;\n        }\n        var elem = nodeStack[0][indexStack[0]++];\n        if ((0, domhandler_1.isTag)(elem) && test(elem))\n            result.push(elem);\n        if ((0, domhandler_1.hasChildren)(elem) && elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\n//# sourceMappingURL=querying.js.map"],"names":["querying","require$$0"],"mappings":";;;;;;;;;;AACA,CAAA,MAAM,CAAC,cAAc,CAACA,kBAAO,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC7D,CAAAA,kBAAA,CAAA,MAAc,GAAG,MAAM;AACvB,CAAAA,kBAAA,CAAA,IAAY,GAAG,IAAI;AACnB,CAAAA,kBAAA,CAAA,YAAoB,GAAG,YAAY;AACnC,CAAAA,kBAAA,CAAA,OAAe,GAAG,OAAO;AACzB,CAAAA,kBAAA,CAAA,SAAiB,GAAG,SAAS;AAC7B,CAAAA,kBAAA,CAAA,OAAe,GAAG,OAAO;CACzB,IAAI,YAAY,iBAAGC,eAAA,EAAqB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE;KACxC,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;KACzC,IAAI,KAAK,KAAK,MAAM,EAAE,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAA;KACzC,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC;AAC1E,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;KACvC,IAAI,MAAM,GAAG,EAAE;AACnB;AACA,KAAI,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AAC5D;AACA,KAAI,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;AACxB,KAAI,SAAS;AACb;AACA,SAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAClD;AACA,aAAY,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;AACzC,iBAAgB,OAAO,MAAM;AAC7B,aAAA;AACA;aACY,SAAS,CAAC,KAAK,EAAE;aACjB,UAAU,CAAC,KAAK,EAAE;AAC9B;aACY;AACZ,SAAA;AACA,SAAQ,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AAChD,SAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACxB,aAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,aAAY,IAAI,EAAE,KAAK,IAAI,CAAC;AAC5B,iBAAgB,OAAO,MAAM;AAC7B,SAAA;SACQ,IAAI,OAAO,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACxF;AACA;AACA;AACA;AACA,aAAY,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;AACjC,aAAY,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC5C,SAAA;AACA,KAAA;AACA,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE;AACnC,KAAI,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAC3B,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE;KACnC,IAAI,OAAO,KAAK,MAAM,EAAE,EAAE,OAAO,GAAG,IAAI,CAAC,CAAA;AAC7C,KAAI,IAAI,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC;AAC9D,KAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnD,SAAQ,IAAI,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC;AACnC,SAAQ,IAAI,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACzD,aAAY,OAAO,IAAI;AACvB,SAAA;SACQ,IAAI,OAAO,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACxF,aAAY,IAAI,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC;AAC1D,aAAY,IAAI,KAAK;AACrB,iBAAgB,OAAO,KAAK;AAC5B,SAAA;AACA,KAAA;AACA,KAAI,OAAO,IAAI;AACf,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE;AAChC,KAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,UAAU,IAAI,EAAE;AACzE,SAAQ,OAAO,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC3D,cAAa,IAAI,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACnF,KAAA,CAAK,CAAC;AACN,CAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAA,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;KAC1B,IAAI,MAAM,GAAG,EAAE;AACnB,KAAI,IAAI,SAAS,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AAC5D,KAAI,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;AACxB,KAAI,SAAS;AACb,SAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAClD,aAAY,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AACxC,iBAAgB,OAAO,MAAM;AAC7B,aAAA;AACA;aACY,SAAS,CAAC,KAAK,EAAE;aACjB,UAAU,CAAC,KAAK,EAAE;AAC9B;aACY;AACZ,SAAA;AACA,SAAQ,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AAChD,SAAQ,IAAI,IAAI,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AACvD,aAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAC7B,SAAQ,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AAC7E,aAAY,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;AACjC,aAAY,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC5C,SAAA;AACA,KAAA;AACA,CAAA;AACA;;;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/domutils/lib/stringify.js

@@ -0,0 +1,107 @@
+'use strict';
+
+var stringify = require('../../../_virtual/stringify.js');
+var index$1 = require('../../domhandler/lib/index.js');
+var index = require('../../dom-serializer/lib/index.js');
+var index$2 = require('../../domelementtype/lib/index.js');
+
+var hasRequiredStringify;
+
+function requireStringify () {
+	if (hasRequiredStringify) return stringify.__exports;
+	hasRequiredStringify = 1;
+	var __importDefault = (stringify.__exports && stringify.__exports.__importDefault) || function (mod) {
+	    return (mod && mod.__esModule) ? mod : { "default": mod };
+	};
+	Object.defineProperty(stringify.__exports, "__esModule", { value: true });
+	stringify.__exports.getOuterHTML = getOuterHTML;
+	stringify.__exports.getInnerHTML = getInnerHTML;
+	stringify.__exports.getText = getText;
+	stringify.__exports.textContent = textContent;
+	stringify.__exports.innerText = innerText;
+	var domhandler_1 = /*@__PURE__*/ index$1.__require();
+	var dom_serializer_1 = __importDefault(/*@__PURE__*/ index.__require());
+	var domelementtype_1 = /*@__PURE__*/ index$2.__require();
+	/**
+	 * @category Stringify
+	 * @deprecated Use the `dom-serializer` module directly.
+	 * @param node Node to get the outer HTML of.
+	 * @param options Options for serialization.
+	 * @returns `node`'s outer HTML.
+	 */
+	function getOuterHTML(node, options) {
+	    return (0, dom_serializer_1.default)(node, options);
+	}
+	/**
+	 * @category Stringify
+	 * @deprecated Use the `dom-serializer` module directly.
+	 * @param node Node to get the inner HTML of.
+	 * @param options Options for serialization.
+	 * @returns `node`'s inner HTML.
+	 */
+	function getInnerHTML(node, options) {
+	    return (0, domhandler_1.hasChildren)(node)
+	        ? node.children.map(function (node) { return getOuterHTML(node, options); }).join("")
+	        : "";
+	}
+	/**
+	 * Get a node's inner text. Same as `textContent`, but inserts newlines for `<br>` tags. Ignores comments.
+	 *
+	 * @category Stringify
+	 * @deprecated Use `textContent` instead.
+	 * @param node Node to get the inner text of.
+	 * @returns `node`'s inner text.
+	 */
+	function getText(node) {
+	    if (Array.isArray(node))
+	        return node.map(getText).join("");
+	    if ((0, domhandler_1.isTag)(node))
+	        return node.name === "br" ? "\n" : getText(node.children);
+	    if ((0, domhandler_1.isCDATA)(node))
+	        return getText(node.children);
+	    if ((0, domhandler_1.isText)(node))
+	        return node.data;
+	    return "";
+	}
+	/**
+	 * Get a node's text content. Ignores comments.
+	 *
+	 * @category Stringify
+	 * @param node Node to get the text content of.
+	 * @returns `node`'s text content.
+	 * @see {@link https://developer.mozilla.org/en-US/docs/Web/API/Node/textContent}
+	 */
+	function textContent(node) {
+	    if (Array.isArray(node))
+	        return node.map(textContent).join("");
+	    if ((0, domhandler_1.hasChildren)(node) && !(0, domhandler_1.isComment)(node)) {
+	        return textContent(node.children);
+	    }
+	    if ((0, domhandler_1.isText)(node))
+	        return node.data;
+	    return "";
+	}
+	/**
+	 * Get a node's inner text, ignoring `<script>` and `<style>` tags. Ignores comments.
+	 *
+	 * @category Stringify
+	 * @param node Node to get the inner text of.
+	 * @returns `node`'s inner text.
+	 * @see {@link https://developer.mozilla.org/en-US/docs/Web/API/Node/innerText}
+	 */
+	function innerText(node) {
+	    if (Array.isArray(node))
+	        return node.map(innerText).join("");
+	    if ((0, domhandler_1.hasChildren)(node) && (node.type === domelementtype_1.ElementType.Tag || (0, domhandler_1.isCDATA)(node))) {
+	        return innerText(node.children);
+	    }
+	    if ((0, domhandler_1.isText)(node))
+	        return node.data;
+	    return "";
+	}
+	
+	return stringify.__exports;
+}
+
+exports.__require = requireStringify;
+//# sourceMappingURL=stringify.js.map