@anoki/fse-ui 2.3.0-12-SNAPSHOT1 → 2.3.0-12-SNAPSHOT2

package/dist/index.es726.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es726.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","filter","find","findOneChild","findOne","existsOne","findAll","domhandler_1","require$$0","test","node","recurse","limit","nodes","result","nodeStack","indexStack","elem","searchedNodes","i","found"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,SAAiBC,GACjBD,EAAA,OAAeE,GACfF,EAAA,eAAuBG,GACvBH,EAAA,UAAkBI,GAClBJ,EAAA,YAAoBK,GACpBL,EAAA,UAAkBM;AAClB,MAAIC,IAAeC,gBAAAA,EAAA;AAWnB,WAASP,EAAOQ,GAAMC,GAAMC,GAASC,GAAO;AACxC,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,QACzBV,EAAKO,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AAAA,EACzE;AAWA,WAASV,EAAKO,GAAMI,GAAOF,GAASC,GAAO;AAMvC,aALIE,IAAS,CAAA,GAETC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GAEnDG,IAAa,CAAC,CAAC,OACV;AAEL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAEtC,YAAIC,EAAW,WAAW;AACtB,iBAAOF;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAIP,EAAKQ,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEL,KAAS;AACX,eAAOE;AAEf,MAAIH,SAAeJ,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;AAUA,WAASd,EAAaM,GAAMI,GAAO;AAC/B,WAAOA,EAAM,KAAKJ,CAAI;AAAA,EAC1B;AAUA,WAASL,EAAQK,GAAMI,GAAOF,GAAS;AACnC,IAAIA,MAAY,WAAUA,IAAU;AAEpC,aADIO,IAAgB,MAAM,QAAQL,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAChDM,IAAI,GAAGA,IAAID,EAAc,QAAQC,KAAK;AAC3C,UAAIT,IAAOQ,EAAcC,CAAC;AAC1B,cAAQZ,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI;AAC1C,eAAOA;AAEX,UAAIC,SAAeJ,EAAa,aAAaG,CAAI,KAAKA,EAAK,SAAS,SAAS,GAAG;AAC5E,YAAIU,IAAQhB,EAAQK,GAAMC,EAAK,UAAU,EAAI;AAC7C,YAAIU;AACA,iBAAOA;AAAA,MACvB;AAAA,IACA;AACI,WAAO;AAAA,EACX;AASA,WAASf,EAAUI,GAAMI,GAAO;AAC5B,YAAQ,MAAM,QAAQA,CAAK,IAAIA,IAAQ,CAACA,CAAK,GAAG,KAAK,SAAUH,GAAM;AACjE,iBAAYH,EAAa,OAAOG,CAAI,KAAKD,EAAKC,CAAI,SACzCH,EAAa,aAAaG,CAAI,KAAKL,EAAUI,GAAMC,EAAK,QAAQ;AAAA,IACjF,CAAK;AAAA,EACL;AAWA,WAASJ,EAAQG,GAAMI,GAAO;AAI1B,aAHIC,IAAS,CAAA,GACTC,IAAY,CAAC,MAAM,QAAQF,CAAK,IAAIA,IAAQ,CAACA,CAAK,CAAC,GACnDG,IAAa,CAAC,CAAC,OACV;AACL,UAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AACtC,YAAIA,EAAU,WAAW;AACrB,iBAAOD;AAGX,QAAAC,EAAU,MAAK,GACfC,EAAW,MAAK;AAEhB;AAAA,MACZ;AACQ,UAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,UAAQT,EAAa,OAAOU,CAAI,KAAKR,EAAKQ,CAAI,KAC1CH,EAAO,KAAKG,CAAI,OACZV,EAAa,aAAaU,CAAI,KAAKA,EAAK,SAAS,SAAS,MAC9DD,EAAW,QAAQ,CAAC,GACpBD,EAAU,QAAQE,EAAK,QAAQ;AAAA,IAE3C;AAAA,EACA;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es726.js","sources":["../node_modules/htmlparser2/node_modules/entities/lib/decode.js"],"sourcesContent":["\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    var desc = Object.getOwnPropertyDescriptor(m, k);\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n    }\n    Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.decodeXML = exports.decodeHTMLStrict = exports.decodeHTMLAttribute = exports.decodeHTML = exports.determineBranch = exports.EntityDecoder = exports.DecodingMode = exports.BinTrieFlags = exports.fromCodePoint = exports.replaceCodePoint = exports.decodeCodePoint = exports.xmlDecodeTree = exports.htmlDecodeTree = void 0;\nvar decode_data_html_js_1 = __importDefault(require(\"./generated/decode-data-html.js\"));\nexports.htmlDecodeTree = decode_data_html_js_1.default;\nvar decode_data_xml_js_1 = __importDefault(require(\"./generated/decode-data-xml.js\"));\nexports.xmlDecodeTree = decode_data_xml_js_1.default;\nvar decode_codepoint_js_1 = __importStar(require(\"./decode_codepoint.js\"));\nexports.decodeCodePoint = decode_codepoint_js_1.default;\nvar decode_codepoint_js_2 = require(\"./decode_codepoint.js\");\nObject.defineProperty(exports, \"replaceCodePoint\", { enumerable: true, get: function () { return decode_codepoint_js_2.replaceCodePoint; } });\nObject.defineProperty(exports, \"fromCodePoint\", { enumerable: true, get: function () { return decode_codepoint_js_2.fromCodePoint; } });\nvar CharCodes;\n(function (CharCodes) {\n    CharCodes[CharCodes[\"NUM\"] = 35] = \"NUM\";\n    CharCodes[CharCodes[\"SEMI\"] = 59] = \"SEMI\";\n    CharCodes[CharCodes[\"EQUALS\"] = 61] = \"EQUALS\";\n    CharCodes[CharCodes[\"ZERO\"] = 48] = \"ZERO\";\n    CharCodes[CharCodes[\"NINE\"] = 57] = \"NINE\";\n    CharCodes[CharCodes[\"LOWER_A\"] = 97] = \"LOWER_A\";\n    CharCodes[CharCodes[\"LOWER_F\"] = 102] = \"LOWER_F\";\n    CharCodes[CharCodes[\"LOWER_X\"] = 120] = \"LOWER_X\";\n    CharCodes[CharCodes[\"LOWER_Z\"] = 122] = \"LOWER_Z\";\n    CharCodes[CharCodes[\"UPPER_A\"] = 65] = \"UPPER_A\";\n    CharCodes[CharCodes[\"UPPER_F\"] = 70] = \"UPPER_F\";\n    CharCodes[CharCodes[\"UPPER_Z\"] = 90] = \"UPPER_Z\";\n})(CharCodes || (CharCodes = {}));\n/** Bit that needs to be set to convert an upper case ASCII character to lower case */\nvar TO_LOWER_BIT = 32;\nvar BinTrieFlags;\n(function (BinTrieFlags) {\n    BinTrieFlags[BinTrieFlags[\"VALUE_LENGTH\"] = 49152] = \"VALUE_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"BRANCH_LENGTH\"] = 16256] = \"BRANCH_LENGTH\";\n    BinTrieFlags[BinTrieFlags[\"JUMP_TABLE\"] = 127] = \"JUMP_TABLE\";\n})(BinTrieFlags = exports.BinTrieFlags || (exports.BinTrieFlags = {}));\nfunction isNumber(code) {\n    return code >= CharCodes.ZERO && code <= CharCodes.NINE;\n}\nfunction isHexadecimalCharacter(code) {\n    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_F) ||\n        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_F));\n}\nfunction isAsciiAlphaNumeric(code) {\n    return ((code >= CharCodes.UPPER_A && code <= CharCodes.UPPER_Z) ||\n        (code >= CharCodes.LOWER_A && code <= CharCodes.LOWER_Z) ||\n        isNumber(code));\n}\n/**\n * Checks if the given character is a valid end character for an entity in an attribute.\n *\n * Attribute values that aren't terminated properly aren't parsed, and shouldn't lead to a parser error.\n * See the example in https://html.spec.whatwg.org/multipage/parsing.html#named-character-reference-state\n */\nfunction isEntityInAttributeInvalidEnd(code) {\n    return code === CharCodes.EQUALS || isAsciiAlphaNumeric(code);\n}\nvar EntityDecoderState;\n(function (EntityDecoderState) {\n    EntityDecoderState[EntityDecoderState[\"EntityStart\"] = 0] = \"EntityStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericStart\"] = 1] = \"NumericStart\";\n    EntityDecoderState[EntityDecoderState[\"NumericDecimal\"] = 2] = \"NumericDecimal\";\n    EntityDecoderState[EntityDecoderState[\"NumericHex\"] = 3] = \"NumericHex\";\n    EntityDecoderState[EntityDecoderState[\"NamedEntity\"] = 4] = \"NamedEntity\";\n})(EntityDecoderState || (EntityDecoderState = {}));\nvar DecodingMode;\n(function (DecodingMode) {\n    /** Entities in text nodes that can end with any character. */\n    DecodingMode[DecodingMode[\"Legacy\"] = 0] = \"Legacy\";\n    /** Only allow entities terminated with a semicolon. */\n    DecodingMode[DecodingMode[\"Strict\"] = 1] = \"Strict\";\n    /** Entities in attributes have limitations on ending characters. */\n    DecodingMode[DecodingMode[\"Attribute\"] = 2] = \"Attribute\";\n})(DecodingMode = exports.DecodingMode || (exports.DecodingMode = {}));\n/**\n * Token decoder with support of writing partial entities.\n */\nvar EntityDecoder = /** @class */ (function () {\n    function EntityDecoder(\n    /** The tree used to decode entities. */\n    decodeTree, \n    /**\n     * The function that is called when a codepoint is decoded.\n     *\n     * For multi-byte named entities, this will be called multiple times,\n     * with the second codepoint, and the same `consumed` value.\n     *\n     * @param codepoint The decoded codepoint.\n     * @param consumed The number of bytes consumed by the decoder.\n     */\n    emitCodePoint, \n    /** An object that is used to produce errors. */\n    errors) {\n        this.decodeTree = decodeTree;\n        this.emitCodePoint = emitCodePoint;\n        this.errors = errors;\n        /** The current state of the decoder. */\n        this.state = EntityDecoderState.EntityStart;\n        /** Characters that were consumed while parsing an entity. */\n        this.consumed = 1;\n        /**\n         * The result of the entity.\n         *\n         * Either the result index of a numeric entity, or the codepoint of a\n         * numeric entity.\n         */\n        this.result = 0;\n        /** The current index in the decode tree. */\n        this.treeIndex = 0;\n        /** The number of characters that were consumed in excess. */\n        this.excess = 1;\n        /** The mode in which the decoder is operating. */\n        this.decodeMode = DecodingMode.Strict;\n    }\n    /** Resets the instance to make it reusable. */\n    EntityDecoder.prototype.startEntity = function (decodeMode) {\n        this.decodeMode = decodeMode;\n        this.state = EntityDecoderState.EntityStart;\n        this.result = 0;\n        this.treeIndex = 0;\n        this.excess = 1;\n        this.consumed = 1;\n    };\n    /**\n     * Write an entity to the decoder. This can be called multiple times with partial entities.\n     * If the entity is incomplete, the decoder will return -1.\n     *\n     * Mirrors the implementation of `getDecoder`, but with the ability to stop decoding if the\n     * entity is incomplete, and resume when the next string is written.\n     *\n     * @param string The string containing the entity (or a continuation of the entity).\n     * @param offset The offset at which the entity begins. Should be 0 if this is not the first call.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    EntityDecoder.prototype.write = function (str, offset) {\n        switch (this.state) {\n            case EntityDecoderState.EntityStart: {\n                if (str.charCodeAt(offset) === CharCodes.NUM) {\n                    this.state = EntityDecoderState.NumericStart;\n                    this.consumed += 1;\n                    return this.stateNumericStart(str, offset + 1);\n                }\n                this.state = EntityDecoderState.NamedEntity;\n                return this.stateNamedEntity(str, offset);\n            }\n            case EntityDecoderState.NumericStart: {\n                return this.stateNumericStart(str, offset);\n            }\n            case EntityDecoderState.NumericDecimal: {\n                return this.stateNumericDecimal(str, offset);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.stateNumericHex(str, offset);\n            }\n            case EntityDecoderState.NamedEntity: {\n                return this.stateNamedEntity(str, offset);\n            }\n        }\n    };\n    /**\n     * Switches between the numeric decimal and hexadecimal states.\n     *\n     * Equivalent to the `Numeric character reference state` in the HTML spec.\n     *\n     * @param str The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    EntityDecoder.prototype.stateNumericStart = function (str, offset) {\n        if (offset >= str.length) {\n            return -1;\n        }\n        if ((str.charCodeAt(offset) | TO_LOWER_BIT) === CharCodes.LOWER_X) {\n            this.state = EntityDecoderState.NumericHex;\n            this.consumed += 1;\n            return this.stateNumericHex(str, offset + 1);\n        }\n        this.state = EntityDecoderState.NumericDecimal;\n        return this.stateNumericDecimal(str, offset);\n    };\n    EntityDecoder.prototype.addToNumericResult = function (str, start, end, base) {\n        if (start !== end) {\n            var digitCount = end - start;\n            this.result =\n                this.result * Math.pow(base, digitCount) +\n                    parseInt(str.substr(start, digitCount), base);\n            this.consumed += digitCount;\n        }\n    };\n    /**\n     * Parses a hexadecimal numeric entity.\n     *\n     * Equivalent to the `Hexademical character reference state` in the HTML spec.\n     *\n     * @param str The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    EntityDecoder.prototype.stateNumericHex = function (str, offset) {\n        var startIdx = offset;\n        while (offset < str.length) {\n            var char = str.charCodeAt(offset);\n            if (isNumber(char) || isHexadecimalCharacter(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(str, startIdx, offset, 16);\n                return this.emitNumericEntity(char, 3);\n            }\n        }\n        this.addToNumericResult(str, startIdx, offset, 16);\n        return -1;\n    };\n    /**\n     * Parses a decimal numeric entity.\n     *\n     * Equivalent to the `Decimal character reference state` in the HTML spec.\n     *\n     * @param str The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    EntityDecoder.prototype.stateNumericDecimal = function (str, offset) {\n        var startIdx = offset;\n        while (offset < str.length) {\n            var char = str.charCodeAt(offset);\n            if (isNumber(char)) {\n                offset += 1;\n            }\n            else {\n                this.addToNumericResult(str, startIdx, offset, 10);\n                return this.emitNumericEntity(char, 2);\n            }\n        }\n        this.addToNumericResult(str, startIdx, offset, 10);\n        return -1;\n    };\n    /**\n     * Validate and emit a numeric entity.\n     *\n     * Implements the logic from the `Hexademical character reference start\n     * state` and `Numeric character reference end state` in the HTML spec.\n     *\n     * @param lastCp The last code point of the entity. Used to see if the\n     *               entity was terminated with a semicolon.\n     * @param expectedLength The minimum number of characters that should be\n     *                       consumed. Used to validate that at least one digit\n     *                       was consumed.\n     * @returns The number of characters that were consumed.\n     */\n    EntityDecoder.prototype.emitNumericEntity = function (lastCp, expectedLength) {\n        var _a;\n        // Ensure we consumed at least one digit.\n        if (this.consumed <= expectedLength) {\n            (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);\n            return 0;\n        }\n        // Figure out if this is a legit end of the entity\n        if (lastCp === CharCodes.SEMI) {\n            this.consumed += 1;\n        }\n        else if (this.decodeMode === DecodingMode.Strict) {\n            return 0;\n        }\n        this.emitCodePoint((0, decode_codepoint_js_1.replaceCodePoint)(this.result), this.consumed);\n        if (this.errors) {\n            if (lastCp !== CharCodes.SEMI) {\n                this.errors.missingSemicolonAfterCharacterReference();\n            }\n            this.errors.validateNumericCharacterReference(this.result);\n        }\n        return this.consumed;\n    };\n    /**\n     * Parses a named entity.\n     *\n     * Equivalent to the `Named character reference state` in the HTML spec.\n     *\n     * @param str The string containing the entity (or a continuation of the entity).\n     * @param offset The current offset.\n     * @returns The number of characters that were consumed, or -1 if the entity is incomplete.\n     */\n    EntityDecoder.prototype.stateNamedEntity = function (str, offset) {\n        var decodeTree = this.decodeTree;\n        var current = decodeTree[this.treeIndex];\n        // The mask is the number of bytes of the value, including the current byte.\n        var valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;\n        for (; offset < str.length; offset++, this.excess++) {\n            var char = str.charCodeAt(offset);\n            this.treeIndex = determineBranch(decodeTree, current, this.treeIndex + Math.max(1, valueLength), char);\n            if (this.treeIndex < 0) {\n                return this.result === 0 ||\n                    // If we are parsing an attribute\n                    (this.decodeMode === DecodingMode.Attribute &&\n                        // We shouldn't have consumed any characters after the entity,\n                        (valueLength === 0 ||\n                            // And there should be no invalid characters.\n                            isEntityInAttributeInvalidEnd(char)))\n                    ? 0\n                    : this.emitNotTerminatedNamedEntity();\n            }\n            current = decodeTree[this.treeIndex];\n            valueLength = (current & BinTrieFlags.VALUE_LENGTH) >> 14;\n            // If the branch is a value, store it and continue\n            if (valueLength !== 0) {\n                // If the entity is terminated by a semicolon, we are done.\n                if (char === CharCodes.SEMI) {\n                    return this.emitNamedEntityData(this.treeIndex, valueLength, this.consumed + this.excess);\n                }\n                // If we encounter a non-terminated (legacy) entity while parsing strictly, then ignore it.\n                if (this.decodeMode !== DecodingMode.Strict) {\n                    this.result = this.treeIndex;\n                    this.consumed += this.excess;\n                    this.excess = 0;\n                }\n            }\n        }\n        return -1;\n    };\n    /**\n     * Emit a named entity that was not terminated with a semicolon.\n     *\n     * @returns The number of characters consumed.\n     */\n    EntityDecoder.prototype.emitNotTerminatedNamedEntity = function () {\n        var _a;\n        var _b = this, result = _b.result, decodeTree = _b.decodeTree;\n        var valueLength = (decodeTree[result] & BinTrieFlags.VALUE_LENGTH) >> 14;\n        this.emitNamedEntityData(result, valueLength, this.consumed);\n        (_a = this.errors) === null || _a === void 0 ? void 0 : _a.missingSemicolonAfterCharacterReference();\n        return this.consumed;\n    };\n    /**\n     * Emit a named entity.\n     *\n     * @param result The index of the entity in the decode tree.\n     * @param valueLength The number of bytes in the entity.\n     * @param consumed The number of characters consumed.\n     *\n     * @returns The number of characters consumed.\n     */\n    EntityDecoder.prototype.emitNamedEntityData = function (result, valueLength, consumed) {\n        var decodeTree = this.decodeTree;\n        this.emitCodePoint(valueLength === 1\n            ? decodeTree[result] & ~BinTrieFlags.VALUE_LENGTH\n            : decodeTree[result + 1], consumed);\n        if (valueLength === 3) {\n            // For multi-byte values, we need to emit the second byte.\n            this.emitCodePoint(decodeTree[result + 2], consumed);\n        }\n        return consumed;\n    };\n    /**\n     * Signal to the parser that the end of the input was reached.\n     *\n     * Remaining data will be emitted and relevant errors will be produced.\n     *\n     * @returns The number of characters consumed.\n     */\n    EntityDecoder.prototype.end = function () {\n        var _a;\n        switch (this.state) {\n            case EntityDecoderState.NamedEntity: {\n                // Emit a named entity if we have one.\n                return this.result !== 0 &&\n                    (this.decodeMode !== DecodingMode.Attribute ||\n                        this.result === this.treeIndex)\n                    ? this.emitNotTerminatedNamedEntity()\n                    : 0;\n            }\n            // Otherwise, emit a numeric entity if we have one.\n            case EntityDecoderState.NumericDecimal: {\n                return this.emitNumericEntity(0, 2);\n            }\n            case EntityDecoderState.NumericHex: {\n                return this.emitNumericEntity(0, 3);\n            }\n            case EntityDecoderState.NumericStart: {\n                (_a = this.errors) === null || _a === void 0 ? void 0 : _a.absenceOfDigitsInNumericCharacterReference(this.consumed);\n                return 0;\n            }\n            case EntityDecoderState.EntityStart: {\n                // Return 0 if we have no entity.\n                return 0;\n            }\n        }\n    };\n    return EntityDecoder;\n}());\nexports.EntityDecoder = EntityDecoder;\n/**\n * Creates a function that decodes entities in a string.\n *\n * @param decodeTree The decode tree.\n * @returns A function that decodes entities in a string.\n */\nfunction getDecoder(decodeTree) {\n    var ret = \"\";\n    var decoder = new EntityDecoder(decodeTree, function (str) { return (ret += (0, decode_codepoint_js_1.fromCodePoint)(str)); });\n    return function decodeWithTrie(str, decodeMode) {\n        var lastIndex = 0;\n        var offset = 0;\n        while ((offset = str.indexOf(\"&\", offset)) >= 0) {\n            ret += str.slice(lastIndex, offset);\n            decoder.startEntity(decodeMode);\n            var len = decoder.write(str, \n            // Skip the \"&\"\n            offset + 1);\n            if (len < 0) {\n                lastIndex = offset + decoder.end();\n                break;\n            }\n            lastIndex = offset + len;\n            // If `len` is 0, skip the current `&` and continue.\n            offset = len === 0 ? lastIndex + 1 : lastIndex;\n        }\n        var result = ret + str.slice(lastIndex);\n        // Make sure we don't keep a reference to the final string.\n        ret = \"\";\n        return result;\n    };\n}\n/**\n * Determines the branch of the current node that is taken given the current\n * character. This function is used to traverse the trie.\n *\n * @param decodeTree The trie.\n * @param current The current node.\n * @param nodeIdx The index right after the current node and its value.\n * @param char The current character.\n * @returns The index of the next node, or -1 if no branch is taken.\n */\nfunction determineBranch(decodeTree, current, nodeIdx, char) {\n    var branchCount = (current & BinTrieFlags.BRANCH_LENGTH) >> 7;\n    var jumpOffset = current & BinTrieFlags.JUMP_TABLE;\n    // Case 1: Single branch encoded in jump offset\n    if (branchCount === 0) {\n        return jumpOffset !== 0 && char === jumpOffset ? nodeIdx : -1;\n    }\n    // Case 2: Multiple branches encoded in jump table\n    if (jumpOffset) {\n        var value = char - jumpOffset;\n        return value < 0 || value >= branchCount\n            ? -1\n            : decodeTree[nodeIdx + value] - 1;\n    }\n    // Case 3: Multiple branches encoded in dictionary\n    // Binary search for the character.\n    var lo = nodeIdx;\n    var hi = lo + branchCount - 1;\n    while (lo <= hi) {\n        var mid = (lo + hi) >>> 1;\n        var midVal = decodeTree[mid];\n        if (midVal < char) {\n            lo = mid + 1;\n        }\n        else if (midVal > char) {\n            hi = mid - 1;\n        }\n        else {\n            return decodeTree[mid + branchCount];\n        }\n    }\n    return -1;\n}\nexports.determineBranch = determineBranch;\nvar htmlDecoder = getDecoder(decode_data_html_js_1.default);\nvar xmlDecoder = getDecoder(decode_data_xml_js_1.default);\n/**\n * Decodes an HTML string.\n *\n * @param str The string to decode.\n * @param mode The decoding mode.\n * @returns The decoded string.\n */\nfunction decodeHTML(str, mode) {\n    if (mode === void 0) { mode = DecodingMode.Legacy; }\n    return htmlDecoder(str, mode);\n}\nexports.decodeHTML = decodeHTML;\n/**\n * Decodes an HTML string in an attribute.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLAttribute(str) {\n    return htmlDecoder(str, DecodingMode.Attribute);\n}\nexports.decodeHTMLAttribute = decodeHTMLAttribute;\n/**\n * Decodes an HTML string, requiring all entities to be terminated by a semicolon.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeHTMLStrict(str) {\n    return htmlDecoder(str, DecodingMode.Strict);\n}\nexports.decodeHTMLStrict = decodeHTMLStrict;\n/**\n * Decodes an XML string, requiring all entities to be terminated by a semicolon.\n *\n * @param str The string to decode.\n * @returns The decoded string.\n */\nfunction decodeXML(str) {\n    return xmlDecoder(str, DecodingMode.Strict);\n}\nexports.decodeXML = decodeXML;\n//# sourceMappingURL=decode.js.map"],"names":["__createBinding","this","o","m","k","k2","desc","__setModuleDefault","v","__importStar","mod","result","__importDefault","exports","decode_data_html_js_1","decode_data_xml_js_1","decode_codepoint_js_1","decode_codepoint_js_2","require$$2","CharCodes","TO_LOWER_BIT","BinTrieFlags","isNumber","code","isHexadecimalCharacter","isAsciiAlphaNumeric","isEntityInAttributeInvalidEnd","EntityDecoderState","DecodingMode","EntityDecoder","decodeTree","emitCodePoint","errors","decodeMode","str","offset","start","end","base","digitCount","startIdx","char","lastCp","expectedLength","_a","current","valueLength","determineBranch","_b","consumed","getDecoder","ret","decoder","lastIndex","len","nodeIdx","branchCount","jumpOffset","value","lo","hi","mid","midVal","htmlDecoder","xmlDecoder","decodeHTML","mode","decodeHTMLAttribute","decodeHTMLStrict","decodeXML"],"mappings":";;;;;;;AACA,QAAIA,IAAmBC,KAAQA,EAAK,oBAAqB,OAAO,UAAU,SAASC,GAAGC,GAAGC,GAAGC,GAAI;AAC5F,MAAIA,MAAO,WAAWA,IAAKD;AAC3B,UAAIE,IAAO,OAAO,yBAAyBH,GAAGC,CAAC;AAC/C,OAAI,CAACE,MAAS,SAASA,IAAO,CAACH,EAAE,aAAaG,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,eAAOH,EAAEC,CAAC;AAAA,QAAI,IAE7D,OAAO,eAAeF,GAAGG,GAAIC,CAAI;AAAA,IACrC,MAAM,SAASJ,GAAGC,GAAGC,GAAGC,GAAI;AACxB,MAAIA,MAAO,WAAWA,IAAKD,IAC3BF,EAAEG,CAAE,IAAIF,EAAEC,CAAC;AAAA,IACf,KACIG,IAAsBN,KAAQA,EAAK,uBAAwB,OAAO,UAAU,SAASC,GAAGM,GAAG;AAC3F,aAAO,eAAeN,GAAG,WAAW,EAAE,YAAY,IAAM,OAAOM,GAAG;AAAA,IACtE,KAAK,SAASN,GAAGM,GAAG;AAChB,MAAAN,EAAE,UAAaM;AAAA,IACnB,IACIC,IAAgBR,KAAQA,EAAK,gBAAiB,SAAUS,GAAK;AAC7D,UAAIA,KAAOA,EAAI,WAAY,QAAOA;AAClC,UAAIC,IAAS,CAAA;AACb,UAAID,KAAO,KAAM,UAASN,KAAKM,EAAK,CAAIN,MAAM,aAAa,OAAO,UAAU,eAAe,KAAKM,GAAKN,CAAC,KAAGJ,EAAgBW,GAAQD,GAAKN,CAAC;AACvI,aAAAG,EAAmBI,GAAQD,CAAG,GACvBC;AAAA,IACX,GACIC,IAAmBX,KAAQA,EAAK,mBAAoB,SAAUS,GAAK;AACnE,aAAQA,KAAOA,EAAI,aAAcA,IAAM,EAAE,SAAWA,EAAG;AAAA,IAC3D;AACA,WAAO,eAAcG,GAAU,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,YAAoBA,EAAA,mBAA2BA,EAAA,sBAA8BA,EAAA,aAAqBA,EAAA,kBAA0BA,EAAA,gBAAwBA,EAAA,eAAuBA,EAAA,eAAuBA,EAAA,gBAAwBA,EAAA,mBAA2BA,EAAA,kBAA0BA,EAAA,gBAAwBA,EAAA,iBAAyB;AAChU,QAAIC,IAAwBF,qBAA0D;AACtF,IAAAC,EAAA,iBAAyBC,EAAsB;AAC/C,QAAIC,IAAuBH,qBAAyD;AACpF,IAAAC,EAAA,gBAAwBE,EAAqB;AAC7C,QAAIC,IAAwBP,qBAA6C;AACzE,IAAAI,EAAA,kBAA0BG,EAAsB;AAChD,QAAIC,IAAwBC,gBAAAA,EAAA;AAC5B,WAAO,eAAeL,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOI,EAAsB;AAAA,IAAiB,EAAE,CAAE,GAC5I,OAAO,eAAeJ,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,aAAOI,EAAsB;AAAA,IAAc,EAAE,CAAE;AACtI,QAAIE;AACJ,KAAC,SAAUA,GAAW;AAClB,MAAAA,EAAUA,EAAU,MAAS,EAAE,IAAI,OACnCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,SAAY,EAAE,IAAI,UACtCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,OAAU,EAAE,IAAI,QACpCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,GAAG,IAAI,WACxCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,EAAE,IAAI,WACvCA,EAAUA,EAAU,UAAa,EAAE,IAAI;AAAA,IAC3C,GAAGA,MAAcA,IAAY,CAAA,EAAG;AAEhC,QAAIC,IAAe,IACfC;AACJ,KAAC,SAAUA,GAAc;AACrB,MAAAA,EAAaA,EAAa,eAAkB,KAAK,IAAI,gBACrDA,EAAaA,EAAa,gBAAmB,KAAK,IAAI,iBACtDA,EAAaA,EAAa,aAAgB,GAAG,IAAI;AAAA,IACrD,GAAGA,IAAeR,EAAQ,iBAAiBA,EAAA,eAAuB,CAAA,EAAG;AACrE,aAASS,EAASC,GAAM;AACpB,aAAOA,KAAQJ,EAAU,QAAQI,KAAQJ,EAAU;AAAA,IACvD;AACA,aAASK,EAAuBD,GAAM;AAClC,aAASA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU;AAAA,IACxD;AACA,aAASM,EAAoBF,GAAM;AAC/B,aAASA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WAChDG,EAASC,CAAI;AAAA,IACrB;AAOA,aAASG,EAA8BH,GAAM;AACzC,aAAOA,MAASJ,EAAU,UAAUM,EAAoBF,CAAI;AAAA,IAChE;AACA,QAAII;AACJ,KAAC,SAAUA,GAAoB;AAC3B,MAAAA,EAAmBA,EAAmB,cAAiB,CAAC,IAAI,eAC5DA,EAAmBA,EAAmB,eAAkB,CAAC,IAAI,gBAC7DA,EAAmBA,EAAmB,iBAAoB,CAAC,IAAI,kBAC/DA,EAAmBA,EAAmB,aAAgB,CAAC,IAAI,cAC3DA,EAAmBA,EAAmB,cAAiB,CAAC,IAAI;AAAA,IAChE,GAAGA,MAAuBA,IAAqB,CAAA,EAAG;AAClD,QAAIC;AACJ,KAAC,SAAUA,GAAc;AAErB,MAAAA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,YAAe,CAAC,IAAI;AAAA,IAClD,GAAGA,IAAef,EAAQ,iBAAiBA,EAAA,eAAuB,CAAA,EAAG;AAIrE,QAAIgB;AAAA;AAAA,OAA+B,WAAY;AAC3C,iBAASA,EAETC,GAUAC,GAEAC,GAAQ;AACJ,eAAK,aAAaF,GAClB,KAAK,gBAAgBC,GACrB,KAAK,SAASC,GAEd,KAAK,QAAQL,EAAmB,aAEhC,KAAK,WAAW,GAOhB,KAAK,SAAS,GAEd,KAAK,YAAY,GAEjB,KAAK,SAAS,GAEd,KAAK,aAAaC,EAAa;AAAA,QACvC;AAEI,eAAAC,EAAc,UAAU,cAAc,SAAUI,GAAY;AACxD,eAAK,aAAaA,GAClB,KAAK,QAAQN,EAAmB,aAChC,KAAK,SAAS,GACd,KAAK,YAAY,GACjB,KAAK,SAAS,GACd,KAAK,WAAW;AAAA,QACxB,GAYIE,EAAc,UAAU,QAAQ,SAAUK,GAAKC,GAAQ;AACnD,kBAAQ,KAAK,OAAK;AAAA,YACd,KAAKR,EAAmB;AACpB,qBAAIO,EAAI,WAAWC,CAAM,MAAMhB,EAAU,OACrC,KAAK,QAAQQ,EAAmB,cAChC,KAAK,YAAY,GACV,KAAK,kBAAkBO,GAAKC,IAAS,CAAC,MAEjD,KAAK,QAAQR,EAAmB,aACzB,KAAK,iBAAiBO,GAAKC,CAAM;AAAA,YAE5C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,kBAAkBO,GAAKC,CAAM;AAAA,YAE7C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,oBAAoBO,GAAKC,CAAM;AAAA,YAE/C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,gBAAgBO,GAAKC,CAAM;AAAA,YAE3C,KAAKR,EAAmB;AACpB,qBAAO,KAAK,iBAAiBO,GAAKC,CAAM;AAAA,UAExD;AAAA,QACA,GAUIN,EAAc,UAAU,oBAAoB,SAAUK,GAAKC,GAAQ;AAC/D,iBAAIA,KAAUD,EAAI,SACP,MAENA,EAAI,WAAWC,CAAM,IAAIf,OAAkBD,EAAU,WACtD,KAAK,QAAQQ,EAAmB,YAChC,KAAK,YAAY,GACV,KAAK,gBAAgBO,GAAKC,IAAS,CAAC,MAE/C,KAAK,QAAQR,EAAmB,gBACzB,KAAK,oBAAoBO,GAAKC,CAAM;AAAA,QACnD,GACIN,EAAc,UAAU,qBAAqB,SAAUK,GAAKE,GAAOC,GAAKC,GAAM;AAC1E,cAAIF,MAAUC,GAAK;AACf,gBAAIE,IAAaF,IAAMD;AACvB,iBAAK,SACD,KAAK,SAAS,KAAK,IAAIE,GAAMC,CAAU,IACnC,SAASL,EAAI,OAAOE,GAAOG,CAAU,GAAGD,CAAI,GACpD,KAAK,YAAYC;AAAA,UAC7B;AAAA,QACA,GAUIV,EAAc,UAAU,kBAAkB,SAAUK,GAAKC,GAAQ;AAE7D,mBADIK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACxB,gBAAIO,IAAOP,EAAI,WAAWC,CAAM;AAChC,gBAAIb,EAASmB,CAAI,KAAKjB,EAAuBiB,CAAI;AAC7C,cAAAN,KAAU;AAAA;AAGV,0BAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,UAErD;AACQ,sBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,QACf,GAUIN,EAAc,UAAU,sBAAsB,SAAUK,GAAKC,GAAQ;AAEjE,mBADIK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACxB,gBAAIO,IAAOP,EAAI,WAAWC,CAAM;AAChC,gBAAIb,EAASmB,CAAI;AACb,cAAAN,KAAU;AAAA;AAGV,0BAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,UAErD;AACQ,sBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,QACf,GAcIN,EAAc,UAAU,oBAAoB,SAAUa,GAAQC,GAAgB;AAC1E,cAAIC;AAEJ,cAAI,KAAK,YAAYD;AACjB,oBAACC,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAGX,cAAIF,MAAWvB,EAAU;AACrB,iBAAK,YAAY;AAAA,mBAEZ,KAAK,eAAeS,EAAa;AACtC,mBAAO;AAEX,sBAAK,kBAAkBZ,EAAsB,kBAAkB,KAAK,MAAM,GAAG,KAAK,QAAQ,GACtF,KAAK,WACD0B,MAAWvB,EAAU,QACrB,KAAK,OAAO,wCAAuC,GAEvD,KAAK,OAAO,kCAAkC,KAAK,MAAM,IAEtD,KAAK;AAAA,QACpB,GAUIU,EAAc,UAAU,mBAAmB,SAAUK,GAAKC,GAAQ;AAK9D,mBAJIL,IAAa,KAAK,YAClBe,IAAUf,EAAW,KAAK,SAAS,GAEnCgB,KAAeD,IAAUxB,EAAa,iBAAiB,IACpDc,IAASD,EAAI,QAAQC,KAAU,KAAK,UAAU;AACjD,gBAAIM,IAAOP,EAAI,WAAWC,CAAM;AAEhC,gBADA,KAAK,YAAYY,EAAgBjB,GAAYe,GAAS,KAAK,YAAY,KAAK,IAAI,GAAGC,CAAW,GAAGL,CAAI,GACjG,KAAK,YAAY;AACjB,qBAAO,KAAK,WAAW;AAAA,cAElB,KAAK,eAAeb,EAAa;AAAA,eAE7BkB,MAAgB;AAAA,cAEbpB,EAA8Be,CAAI,KACxC,IACA,KAAK,6BAA4B;AAK3C,gBAHAI,IAAUf,EAAW,KAAK,SAAS,GACnCgB,KAAeD,IAAUxB,EAAa,iBAAiB,IAEnDyB,MAAgB,GAAG;AAEnB,kBAAIL,MAAStB,EAAU;AACnB,uBAAO,KAAK,oBAAoB,KAAK,WAAW2B,GAAa,KAAK,WAAW,KAAK,MAAM;AAG5F,cAAI,KAAK,eAAelB,EAAa,WACjC,KAAK,SAAS,KAAK,WACnB,KAAK,YAAY,KAAK,QACtB,KAAK,SAAS;AAAA,YAElC;AAAA,UACA;AACQ,iBAAO;AAAA,QACf,GAMIC,EAAc,UAAU,+BAA+B,WAAY;AAC/D,cAAIe,GACAI,IAAK,MAAMrC,IAASqC,EAAG,QAAQlB,IAAakB,EAAG,YAC/CF,KAAehB,EAAWnB,CAAM,IAAIU,EAAa,iBAAiB;AACtE,sBAAK,oBAAoBV,GAAQmC,GAAa,KAAK,QAAQ,IAC1DF,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,wCAAuC,GAC3F,KAAK;AAAA,QACpB,GAUIf,EAAc,UAAU,sBAAsB,SAAUlB,GAAQmC,GAAaG,GAAU;AACnF,cAAInB,IAAa,KAAK;AACtB,sBAAK,cAAcgB,MAAgB,IAC7BhB,EAAWnB,CAAM,IAAI,CAACU,EAAa,eACnCS,EAAWnB,IAAS,CAAC,GAAGsC,CAAQ,GAClCH,MAAgB,KAEhB,KAAK,cAAchB,EAAWnB,IAAS,CAAC,GAAGsC,CAAQ,GAEhDA;AAAA,QACf,GAQIpB,EAAc,UAAU,MAAM,WAAY;AACtC,cAAIe;AACJ,kBAAQ,KAAK,OAAK;AAAA,YACd,KAAKjB,EAAmB;AAEpB,qBAAO,KAAK,WAAW,MAClB,KAAK,eAAeC,EAAa,aAC9B,KAAK,WAAW,KAAK,aACvB,KAAK,6BAA4B,IACjC;AAAA;AAAA,YAGV,KAAKD,EAAmB;AACpB,qBAAO,KAAK,kBAAkB,GAAG,CAAC;AAAA,YAEtC,KAAKA,EAAmB;AACpB,qBAAO,KAAK,kBAAkB,GAAG,CAAC;AAAA,YAEtC,KAAKA,EAAmB;AACpB,sBAACiB,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAAA,YAEX,KAAKjB,EAAmB;AAEpB,qBAAO;AAAA,UAEvB;AAAA,QACA,GACWE;AAAA,MACX;;AACA,IAAAhB,EAAA,gBAAwBgB;AAOxB,aAASqB,EAAWpB,GAAY;AAC5B,UAAIqB,IAAM,IACNC,IAAU,IAAIvB,EAAcC,GAAY,SAAUI,GAAK;AAAE,eAAQiB,SAAWnC,EAAsB,eAAekB,CAAG;AAAA,MAAG,CAAE;AAC7H,aAAO,SAAwBA,GAAKD,GAAY;AAG5C,iBAFIoB,IAAY,GACZlB,IAAS,IACLA,IAASD,EAAI,QAAQ,KAAKC,CAAM,MAAM,KAAG;AAC7C,UAAAgB,KAAOjB,EAAI,MAAMmB,GAAWlB,CAAM,GAClCiB,EAAQ,YAAYnB,CAAU;AAC9B,cAAIqB,IAAMF,EAAQ;AAAA,YAAMlB;AAAA;AAAA,YAExBC,IAAS;AAAA,UAAC;AACV,cAAImB,IAAM,GAAG;AACT,YAAAD,IAAYlB,IAASiB,EAAQ,IAAG;AAChC;AAAA,UAChB;AACY,UAAAC,IAAYlB,IAASmB,GAErBnB,IAASmB,MAAQ,IAAID,IAAY,IAAIA;AAAA,QACjD;AACQ,YAAI1C,IAASwC,IAAMjB,EAAI,MAAMmB,CAAS;AAEtC,eAAAF,IAAM,IACCxC;AAAA,MACf;AAAA,IACA;AAWA,aAASoC,EAAgBjB,GAAYe,GAASU,GAASd,GAAM;AACzD,UAAIe,KAAeX,IAAUxB,EAAa,kBAAkB,GACxDoC,IAAaZ,IAAUxB,EAAa;AAExC,UAAImC,MAAgB;AAChB,eAAOC,MAAe,KAAKhB,MAASgB,IAAaF,IAAU;AAG/D,UAAIE,GAAY;AACZ,YAAIC,IAAQjB,IAAOgB;AACnB,eAAOC,IAAQ,KAAKA,KAASF,IACvB,KACA1B,EAAWyB,IAAUG,CAAK,IAAI;AAAA,MAC5C;AAKI,eAFIC,IAAKJ,GACLK,IAAKD,IAAKH,IAAc,GACrBG,KAAMC,KAAI;AACb,YAAIC,IAAOF,IAAKC,MAAQ,GACpBE,IAAShC,EAAW+B,CAAG;AAC3B,YAAIC,IAASrB;AACT,UAAAkB,IAAKE,IAAM;AAAA,iBAENC,IAASrB;AACd,UAAAmB,IAAKC,IAAM;AAAA;AAGX,iBAAO/B,EAAW+B,IAAML,CAAW;AAAA,MAE/C;AACI,aAAO;AAAA,IACX;AACA,IAAA3C,EAAA,kBAA0BkC;AAC1B,QAAIgB,IAAcb,EAAWpC,EAAsB,OAAO,GACtDkD,IAAad,EAAWnC,EAAqB,OAAO;AAQxD,aAASkD,EAAW/B,GAAKgC,GAAM;AAC3B,aAAIA,MAAS,WAAUA,IAAOtC,EAAa,SACpCmC,EAAY7B,GAAKgC,CAAI;AAAA,IAChC;AACA,IAAArD,EAAA,aAAqBoD;AAOrB,aAASE,EAAoBjC,GAAK;AAC9B,aAAO6B,EAAY7B,GAAKN,EAAa,SAAS;AAAA,IAClD;AACA,IAAAf,EAAA,sBAA8BsD;AAO9B,aAASC,EAAiBlC,GAAK;AAC3B,aAAO6B,EAAY7B,GAAKN,EAAa,MAAM;AAAA,IAC/C;AACA,IAAAf,EAAA,mBAA2BuD;AAO3B,aAASC,EAAUnC,GAAK;AACpB,aAAO8B,EAAW9B,GAAKN,EAAa,MAAM;AAAA,IAC9C;AACA,IAAAf,EAAA,YAAoBwD;AAAA;;","x_google_ignoreList":[0]}

package/dist/index.es727.js

@@ -1,76 +1,5 @@
-import { __exports as i } from "./index.es760.js";
-import { __require as m } from "./index.es673.js";
-import { __require as E } from "./index.es726.js";
-var g;
-function h() {
-  if (g) return i;
-  g = 1, Object.defineProperty(i, "__esModule", { value: !0 }), i.testElement = p, i.getElements = _, i.getElementById = v, i.getElementsByTagName = d, i.getElementsByClassName = l, i.getElementsByTagType = T;
-  var u = /* @__PURE__ */ m(), f = /* @__PURE__ */ E(), o = {
-    tag_name: function(e) {
-      return typeof e == "function" ? function(t) {
-        return (0, u.isTag)(t) && e(t.name);
-      } : e === "*" ? u.isTag : function(t) {
-        return (0, u.isTag)(t) && t.name === e;
-      };
-    },
-    tag_type: function(e) {
-      return typeof e == "function" ? function(t) {
-        return e(t.type);
-      } : function(t) {
-        return t.type === e;
-      };
-    },
-    tag_contains: function(e) {
-      return typeof e == "function" ? function(t) {
-        return (0, u.isText)(t) && e(t.data);
-      } : function(t) {
-        return (0, u.isText)(t) && t.data === e;
-      };
-    }
-  };
-  function a(e, t) {
-    return typeof t == "function" ? function(n) {
-      return (0, u.isTag)(n) && t(n.attribs[e]);
-    } : function(n) {
-      return (0, u.isTag)(n) && n.attribs[e] === t;
-    };
-  }
-  function y(e, t) {
-    return function(n) {
-      return e(n) || t(n);
-    };
-  }
-  function c(e) {
-    var t = Object.keys(e).map(function(n) {
-      var r = e[n];
-      return Object.prototype.hasOwnProperty.call(o, n) ? o[n](r) : a(n, r);
-    });
-    return t.length === 0 ? null : t.reduce(y);
-  }
-  function p(e, t) {
-    var n = c(e);
-    return n ? n(t) : !0;
-  }
-  function _(e, t, n, r) {
-    r === void 0 && (r = 1 / 0);
-    var s = c(e);
-    return s ? (0, f.filter)(s, t, n, r) : [];
-  }
-  function v(e, t, n) {
-    return n === void 0 && (n = !0), Array.isArray(t) || (t = [t]), (0, f.findOne)(a("id", e), t, n);
-  }
-  function d(e, t, n, r) {
-    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_name(e), t, n, r);
-  }
-  function l(e, t, n, r) {
-    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(a("class", e), t, n, r);
-  }
-  function T(e, t, n, r) {
-    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_type(e), t, n, r);
-  }
-  return i;
-}
+var r = {};
 export {
-  h as __require
+  r as __exports
 };
 //# sourceMappingURL=index.es727.js.map

package/dist/index.es727.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es727.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","testElement","getElements","getElementById","getElementsByTagName","getElementsByClassName","getElementsByTagType","domhandler_1","require$$0","querying_js_1","require$$1","Checks","name","elem","type","data","getAttribCheck","attrib","value","combineFuncs","a","b","compileTest","options","funcs","key","node","test","nodes","recurse","limit","id","tagName","className"],"mappings":";;;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,cAAsBC,GACtBD,EAAA,cAAsBE,GACtBF,EAAA,iBAAyBG,GACzBH,EAAA,uBAA+BI,GAC/BJ,EAAA,yBAAiCK,GACjCL,EAAA,uBAA+BM;AAC/B,MAAIC,IAAeC,gBAAAA,EAAA,GACfC,IAAgBC,gBAAAA,EAAA,GAIhBC,IAAS;AAAA,IACT,UAAU,SAAUC,GAAM;AACtB,aAAI,OAAOA,KAAS,aACT,SAAUC,GAAM;AAAE,mBAAWN,EAAa,OAAOM,CAAI,KAAKD,EAAKC,EAAK,IAAI;AAAA,MAAE,IAE5ED,MAAS,MACPL,EAAa,QAEjB,SAAUM,GAAM;AAAE,mBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,SAASD;AAAA,MAAK;AAAA,IAC5F;AAAA,IACI,UAAU,SAAUE,GAAM;AACtB,aAAI,OAAOA,KAAS,aACT,SAAUD,GAAM;AAAE,eAAOC,EAAKD,EAAK,IAAI;AAAA,MAAE,IAE7C,SAAUA,GAAM;AAAE,eAAOA,EAAK,SAASC;AAAA,MAAK;AAAA,IAC3D;AAAA,IACI,cAAc,SAAUC,GAAM;AAC1B,aAAI,OAAOA,KAAS,aACT,SAAUF,GAAM;AAAE,mBAAWN,EAAa,QAAQM,CAAI,KAAKE,EAAKF,EAAK,IAAI;AAAA,MAAE,IAE/E,SAAUA,GAAM;AAAE,mBAAWN,EAAa,QAAQM,CAAI,KAAKA,EAAK,SAASE;AAAA,MAAK;AAAA,IAC7F;AAAA;AAWA,WAASC,EAAeC,GAAQC,GAAO;AACnC,WAAI,OAAOA,KAAU,aACV,SAAUL,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKK,EAAML,EAAK,QAAQI,CAAM,CAAC;AAAA,IAAE,IAE1F,SAAUJ,GAAM;AAAE,iBAAWN,EAAa,OAAOM,CAAI,KAAKA,EAAK,QAAQI,CAAM,MAAMC;AAAA,IAAM;AAAA,EACpG;AAUA,WAASC,EAAaC,GAAGC,GAAG;AACxB,WAAO,SAAUR,GAAM;AAAE,aAAOO,EAAEP,CAAI,KAAKQ,EAAER,CAAI;AAAA,IAAE;AAAA,EACvD;AASA,WAASS,EAAYC,GAAS;AAC1B,QAAIC,IAAQ,OAAO,KAAKD,CAAO,EAAE,IAAI,SAAUE,GAAK;AAChD,UAAIP,IAAQK,EAAQE,CAAG;AACvB,aAAO,OAAO,UAAU,eAAe,KAAKd,GAAQc,CAAG,IACjDd,EAAOc,CAAG,EAAEP,CAAK,IACjBF,EAAeS,GAAKP,CAAK;AAAA,IACvC,CAAK;AACD,WAAOM,EAAM,WAAW,IAAI,OAAOA,EAAM,OAAOL,CAAY;AAAA,EAChE;AASA,WAASlB,EAAYsB,GAASG,GAAM;AAChC,QAAIC,IAAOL,EAAYC,CAAO;AAC9B,WAAOI,IAAOA,EAAKD,CAAI,IAAI;AAAA,EAC/B;AAWA,WAASxB,EAAYqB,GAASK,GAAOC,GAASC,GAAO;AACjD,IAAIA,MAAU,WAAUA,IAAQ;AAChC,QAAIH,IAAOL,EAAYC,CAAO;AAC9B,WAAOI,QAAWlB,EAAc,QAAQkB,GAAMC,GAAOC,GAASC,CAAK,IAAI,CAAA;AAAA,EAC3E;AAUA,WAAS3B,EAAe4B,GAAIH,GAAOC,GAAS;AACxC,WAAIA,MAAY,WAAUA,IAAU,KAC/B,MAAM,QAAQD,CAAK,MACpBA,IAAQ,CAACA,CAAK,QACPnB,EAAc,SAASO,EAAe,MAAMe,CAAE,GAAGH,GAAOC,CAAO;AAAA,EAC9E;AAWA,WAASzB,EAAqB4B,GAASJ,GAAOC,GAASC,GAAO;AAC1D,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQE,EAAO,SAAYqB,CAAO,GAAGJ,GAAOC,GAASC,CAAK;AAAA,EACvF;AAWA,WAASzB,EAAuB4B,GAAWL,GAAOC,GAASC,GAAO;AAC9D,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQO,EAAe,SAASiB,CAAS,GAAGL,GAAOC,GAASC,CAAK;AAAA,EAC9F;AAWA,WAASxB,EAAqBQ,GAAMc,GAAOC,GAASC,GAAO;AACvD,WAAID,MAAY,WAAUA,IAAU,KAChCC,MAAU,WAAUA,IAAQ,YACrBrB,EAAc,QAAQE,EAAO,SAAYG,CAAI,GAAGc,GAAOC,GAASC,CAAK;AAAA,EACpF;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es727.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es728.js

@@ -1,55 +1,360 @@
-import { __exports as N } from "./index.es761.js";
-import { __require as S } from "./index.es673.js";
-var I;
-function b() {
-  if (I) return N;
-  I = 1, Object.defineProperty(N, "__esModule", { value: !0 }), N.DocumentPosition = void 0, N.removeSubsets = h, N.compareDocumentPosition = O, N.uniqueSort = C;
-  var l = /* @__PURE__ */ S();
-  function h(r) {
-    for (var e = r.length; --e >= 0; ) {
-      var t = r[e];
-      if (e > 0 && r.lastIndexOf(t, e - 1) >= 0) {
-        r.splice(e, 1);
-        continue;
-      }
-      for (var i = t.parent; i; i = i.parent)
-        if (r.includes(i)) {
-          r.splice(e, 1);
-          break;
-        }
-    }
-    return r;
-  }
-  var a;
-  (function(r) {
-    r[r.DISCONNECTED = 1] = "DISCONNECTED", r[r.PRECEDING = 2] = "PRECEDING", r[r.FOLLOWING = 4] = "FOLLOWING", r[r.CONTAINS = 8] = "CONTAINS", r[r.CONTAINED_BY = 16] = "CONTAINED_BY";
-  })(a || (N.DocumentPosition = a = {}));
-  function O(r, e) {
-    var t = [], i = [];
-    if (r === e)
-      return 0;
-    for (var u = (0, l.hasChildren)(r) ? r : r.parent; u; )
-      t.unshift(u), u = u.parent;
-    for (u = (0, l.hasChildren)(e) ? e : e.parent; u; )
-      i.unshift(u), u = u.parent;
-    for (var E = Math.min(t.length, i.length), n = 0; n < E && t[n] === i[n]; )
-      n++;
-    if (n === 0)
-      return a.DISCONNECTED;
-    var f = t[n - 1], v = f.children, p = t[n], s = i[n];
-    return v.indexOf(p) > v.indexOf(s) ? f === e ? a.FOLLOWING | a.CONTAINED_BY : a.FOLLOWING : f === r ? a.PRECEDING | a.CONTAINS : a.PRECEDING;
-  }
-  function C(r) {
-    return r = r.filter(function(e, t, i) {
-      return !i.includes(e, t + 1);
-    }), r.sort(function(e, t) {
-      var i = O(e, t);
-      return i & a.PRECEDING ? -1 : i & a.FOLLOWING ? 1 : 0;
-    }), r;
-  }
-  return N;
+import { __exports as r } from "./index.es752.js";
+import { __require as S } from "./index.es702.js";
+var A;
+function W() {
+  if (A) return r;
+  A = 1;
+  var l = r && r.__extends || /* @__PURE__ */ (function() {
+    var e = function(t, n) {
+      return e = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(i, o) {
+        i.__proto__ = o;
+      } || function(i, o) {
+        for (var u in o) Object.prototype.hasOwnProperty.call(o, u) && (i[u] = o[u]);
+      }, e(t, n);
+    };
+    return function(t, n) {
+      if (typeof n != "function" && n !== null)
+        throw new TypeError("Class extends value " + String(n) + " is not a constructor or null");
+      e(t, n);
+      function i() {
+        this.constructor = t;
+      }
+      t.prototype = n === null ? Object.create(n) : (i.prototype = n.prototype, new i());
+    };
+  })(), c = r && r.__assign || function() {
+    return c = Object.assign || function(e) {
+      for (var t, n = 1, i = arguments.length; n < i; n++) {
+        t = arguments[n];
+        for (var o in t) Object.prototype.hasOwnProperty.call(t, o) && (e[o] = t[o]);
+      }
+      return e;
+    }, c.apply(this, arguments);
+  };
+  Object.defineProperty(r, "__esModule", { value: !0 }), r.cloneNode = r.hasChildren = r.isDocument = r.isDirective = r.isComment = r.isText = r.isCDATA = r.isTag = r.Element = r.Document = r.CDATA = r.NodeWithChildren = r.ProcessingInstruction = r.Comment = r.Text = r.DataNode = r.Node = void 0;
+  var a = /* @__PURE__ */ S(), m = (
+    /** @class */
+    (function() {
+      function e() {
+        this.parent = null, this.prev = null, this.next = null, this.startIndex = null, this.endIndex = null;
+      }
+      return Object.defineProperty(e.prototype, "parentNode", {
+        // Read-write aliases for properties
+        /**
+         * Same as {@link parent}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.parent;
+        },
+        set: function(t) {
+          this.parent = t;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(e.prototype, "previousSibling", {
+        /**
+         * Same as {@link prev}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.prev;
+        },
+        set: function(t) {
+          this.prev = t;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(e.prototype, "nextSibling", {
+        /**
+         * Same as {@link next}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.next;
+        },
+        set: function(t) {
+          this.next = t;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), e.prototype.cloneNode = function(t) {
+        return t === void 0 && (t = !1), y(this, t);
+      }, e;
+    })()
+  );
+  r.Node = m;
+  var f = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t(n) {
+        var i = e.call(this) || this;
+        return i.data = n, i;
+      }
+      return Object.defineProperty(t.prototype, "nodeValue", {
+        /**
+         * Same as {@link data}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.data;
+        },
+        set: function(n) {
+          this.data = n;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(m)
+  );
+  r.DataNode = f;
+  var g = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t() {
+        var n = e !== null && e.apply(this, arguments) || this;
+        return n.type = a.ElementType.Text, n;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 3;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(f)
+  );
+  r.Text = g;
+  var v = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t() {
+        var n = e !== null && e.apply(this, arguments) || this;
+        return n.type = a.ElementType.Comment, n;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 8;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(f)
+  );
+  r.Comment = v;
+  var x = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t(n, i) {
+        var o = e.call(this, i) || this;
+        return o.name = n, o.type = a.ElementType.Directive, o;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 1;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(f)
+  );
+  r.ProcessingInstruction = x;
+  var p = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t(n) {
+        var i = e.call(this) || this;
+        return i.children = n, i;
+      }
+      return Object.defineProperty(t.prototype, "firstChild", {
+        // Aliases
+        /** First child of the node. */
+        get: function() {
+          var n;
+          return (n = this.children[0]) !== null && n !== void 0 ? n : null;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(t.prototype, "lastChild", {
+        /** Last child of the node. */
+        get: function() {
+          return this.children.length > 0 ? this.children[this.children.length - 1] : null;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(t.prototype, "childNodes", {
+        /**
+         * Same as {@link children}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.children;
+        },
+        set: function(n) {
+          this.children = n;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(m)
+  );
+  r.NodeWithChildren = p;
+  var T = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t() {
+        var n = e !== null && e.apply(this, arguments) || this;
+        return n.type = a.ElementType.CDATA, n;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 4;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(p)
+  );
+  r.CDATA = T;
+  var C = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t() {
+        var n = e !== null && e.apply(this, arguments) || this;
+        return n.type = a.ElementType.Root, n;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 9;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(p)
+  );
+  r.Document = C;
+  var P = (
+    /** @class */
+    (function(e) {
+      l(t, e);
+      function t(n, i, o, u) {
+        o === void 0 && (o = []), u === void 0 && (u = n === "script" ? a.ElementType.Script : n === "style" ? a.ElementType.Style : a.ElementType.Tag);
+        var s = e.call(this, o) || this;
+        return s.name = n, s.attribs = i, s.type = u, s;
+      }
+      return Object.defineProperty(t.prototype, "nodeType", {
+        get: function() {
+          return 1;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(t.prototype, "tagName", {
+        // DOM Level 1 aliases
+        /**
+         * Same as {@link name}.
+         * [DOM spec](https://dom.spec.whatwg.org)-compatible alias.
+         */
+        get: function() {
+          return this.name;
+        },
+        set: function(n) {
+          this.name = n;
+        },
+        enumerable: !1,
+        configurable: !0
+      }), Object.defineProperty(t.prototype, "attributes", {
+        get: function() {
+          var n = this;
+          return Object.keys(this.attribs).map(function(i) {
+            var o, u;
+            return {
+              name: i,
+              value: n.attribs[i],
+              namespace: (o = n["x-attribsNamespace"]) === null || o === void 0 ? void 0 : o[i],
+              prefix: (u = n["x-attribsPrefix"]) === null || u === void 0 ? void 0 : u[i]
+            };
+          });
+        },
+        enumerable: !1,
+        configurable: !0
+      }), t;
+    })(p)
+  );
+  r.Element = P;
+  function O(e) {
+    return (0, a.isTag)(e);
+  }
+  r.isTag = O;
+  function N(e) {
+    return e.type === a.ElementType.CDATA;
+  }
+  r.isCDATA = N;
+  function D(e) {
+    return e.type === a.ElementType.Text;
+  }
+  r.isText = D;
+  function j(e) {
+    return e.type === a.ElementType.Comment;
+  }
+  r.isComment = j;
+  function E(e) {
+    return e.type === a.ElementType.Directive;
+  }
+  r.isDirective = E;
+  function _(e) {
+    return e.type === a.ElementType.Root;
+  }
+  r.isDocument = _;
+  function w(e) {
+    return Object.prototype.hasOwnProperty.call(e, "children");
+  }
+  r.hasChildren = w;
+  function y(e, t) {
+    t === void 0 && (t = !1);
+    var n;
+    if (D(e))
+      n = new g(e.data);
+    else if (j(e))
+      n = new v(e.data);
+    else if (O(e)) {
+      var i = t ? d(e.children) : [], o = new P(e.name, c({}, e.attribs), i);
+      i.forEach(function(I) {
+        return I.parent = o;
+      }), e.namespace != null && (o.namespace = e.namespace), e["x-attribsNamespace"] && (o["x-attribsNamespace"] = c({}, e["x-attribsNamespace"])), e["x-attribsPrefix"] && (o["x-attribsPrefix"] = c({}, e["x-attribsPrefix"])), n = o;
+    } else if (N(e)) {
+      var i = t ? d(e.children) : [], u = new T(i);
+      i.forEach(function(b) {
+        return b.parent = u;
+      }), n = u;
+    } else if (_(e)) {
+      var i = t ? d(e.children) : [], s = new C(i);
+      i.forEach(function(b) {
+        return b.parent = s;
+      }), e["x-mode"] && (s["x-mode"] = e["x-mode"]), n = s;
+    } else if (E(e)) {
+      var h = new x(e.name, e.data);
+      e["x-name"] != null && (h["x-name"] = e["x-name"], h["x-publicId"] = e["x-publicId"], h["x-systemId"] = e["x-systemId"]), n = h;
+    } else
+      throw new Error("Not implemented yet: ".concat(e.type));
+    return n.startIndex = e.startIndex, n.endIndex = e.endIndex, e.sourceCodeLocation != null && (n.sourceCodeLocation = e.sourceCodeLocation), n;
+  }
+  r.cloneNode = y;
+  function d(e) {
+    for (var t = e.map(function(i) {
+      return y(i, !0);
+    }), n = 1; n < t.length; n++)
+      t[n].prev = t[n - 1], t[n - 1].next = t[n];
+    return t;
+  }
+  return r;
 }
 export {
-  b as __require
+  W as __require
 };
 //# sourceMappingURL=index.es728.js.map