@anoki/fse-ui 2.3.0-7-SNAPSHOT6 → 2.3.0-8-SNAPSHOT

package/dist/index.es673.js

@@ -1,64 +1,5 @@
-import { __exports as u } from "./index.es727.js";
-import { __require as o } from "./index.es635.js";
-var d;
-function O() {
-  if (d) return u;
-  d = 1, Object.defineProperty(u, "__esModule", { value: !0 }), u.filter = y, u.find = s, u.findOneChild = g, u.findOne = c, u.existsOne = v, u.findAll = A;
-  var e = /* @__PURE__ */ o();
-  function y(f, r, n, t) {
-    return n === void 0 && (n = !0), t === void 0 && (t = 1 / 0), s(f, Array.isArray(r) ? r : [r], n, t);
-  }
-  function s(f, r, n, t) {
-    for (var a = [], i = [Array.isArray(r) ? r : [r]], h = [0]; ; ) {
-      if (h[0] >= i[0].length) {
-        if (h.length === 1)
-          return a;
-        i.shift(), h.shift();
-        continue;
-      }
-      var l = i[0][h[0]++];
-      if (f(l) && (a.push(l), --t <= 0))
-        return a;
-      n && (0, e.hasChildren)(l) && l.children.length > 0 && (h.unshift(0), i.unshift(l.children));
-    }
-  }
-  function g(f, r) {
-    return r.find(f);
-  }
-  function c(f, r, n) {
-    n === void 0 && (n = !0);
-    for (var t = Array.isArray(r) ? r : [r], a = 0; a < t.length; a++) {
-      var i = t[a];
-      if ((0, e.isTag)(i) && f(i))
-        return i;
-      if (n && (0, e.hasChildren)(i) && i.children.length > 0) {
-        var h = c(f, i.children, !0);
-        if (h)
-          return h;
-      }
-    }
-    return null;
-  }
-  function v(f, r) {
-    return (Array.isArray(r) ? r : [r]).some(function(n) {
-      return (0, e.isTag)(n) && f(n) || (0, e.hasChildren)(n) && v(f, n.children);
-    });
-  }
-  function A(f, r) {
-    for (var n = [], t = [Array.isArray(r) ? r : [r]], a = [0]; ; ) {
-      if (a[0] >= t[0].length) {
-        if (t.length === 1)
-          return n;
-        t.shift(), a.shift();
-        continue;
-      }
-      var i = t[0][a[0]++];
-      (0, e.isTag)(i) && f(i) && n.push(i), (0, e.hasChildren)(i) && i.children.length > 0 && (a.unshift(0), t.unshift(i.children));
-    }
-  }
-  return u;
-}
+var r = {};
 export {
-  O as __require
+  r as __exports
 };
 //# sourceMappingURL=index.es673.js.map

package/dist/index.es673.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es673.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.es673.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es674.js

@@ -1,76 +1,228 @@
-import { __exports as i } from "./index.es728.js";
-import { __require as m } from "./index.es635.js";
-import { __require as E } from "./index.es673.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;
+import { __exports as m } from "./index.es723.js";
+import { __require as Z } from "./index.es724.js";
+import { __require as X } from "./index.es725.js";
+import { __require as H } from "./index.es726.js";
+var b;
+function Q() {
+  return b ? m : (b = 1, (function(u) {
+    var S = m && m.__createBinding || (Object.create ? (function(e, t, i, r) {
+      r === void 0 && (r = i);
+      var n = Object.getOwnPropertyDescriptor(t, i);
+      (!n || ("get" in n ? !t.__esModule : n.writable || n.configurable)) && (n = { enumerable: !0, get: function() {
+        return t[i];
+      } }), Object.defineProperty(e, r, n);
+    }) : (function(e, t, i, r) {
+      r === void 0 && (r = i), e[r] = t[i];
+    })), D = m && m.__setModuleDefault || (Object.create ? (function(e, t) {
+      Object.defineProperty(e, "default", { enumerable: !0, value: t });
+    }) : function(e, t) {
+      e.default = t;
+    }), I = m && m.__importStar || function(e) {
+      if (e && e.__esModule) return e;
+      var t = {};
+      if (e != null) for (var i in e) i !== "default" && Object.prototype.hasOwnProperty.call(e, i) && S(t, e, i);
+      return D(t, e), t;
+    }, L = m && m.__importDefault || function(e) {
+      return e && e.__esModule ? e : { default: e };
+    };
+    Object.defineProperty(u, "__esModule", { value: !0 }), u.decodeXML = u.decodeHTMLStrict = u.decodeHTMLAttribute = u.decodeHTML = u.determineBranch = u.EntityDecoder = u.DecodingMode = u.BinTrieFlags = u.fromCodePoint = u.replaceCodePoint = u.decodeCodePoint = u.xmlDecodeTree = u.htmlDecodeTree = void 0;
+    var y = L(/* @__PURE__ */ Z());
+    u.htmlDecodeTree = y.default;
+    var P = L(/* @__PURE__ */ X());
+    u.xmlDecodeTree = P.default;
+    var N = I(/* @__PURE__ */ H());
+    u.decodeCodePoint = N.default;
+    var A = /* @__PURE__ */ H();
+    Object.defineProperty(u, "replaceCodePoint", { enumerable: !0, get: function() {
+      return A.replaceCodePoint;
+    } }), Object.defineProperty(u, "fromCodePoint", { enumerable: !0, get: function() {
+      return A.fromCodePoint;
+    } });
+    var c;
+    (function(e) {
+      e[e.NUM = 35] = "NUM", e[e.SEMI = 59] = "SEMI", e[e.EQUALS = 61] = "EQUALS", e[e.ZERO = 48] = "ZERO", e[e.NINE = 57] = "NINE", e[e.LOWER_A = 97] = "LOWER_A", e[e.LOWER_F = 102] = "LOWER_F", e[e.LOWER_X = 120] = "LOWER_X", e[e.LOWER_Z = 122] = "LOWER_Z", e[e.UPPER_A = 65] = "UPPER_A", e[e.UPPER_F = 70] = "UPPER_F", e[e.UPPER_Z = 90] = "UPPER_Z";
+    })(c || (c = {}));
+    var U = 32, l;
+    (function(e) {
+      e[e.VALUE_LENGTH = 49152] = "VALUE_LENGTH", e[e.BRANCH_LENGTH = 16256] = "BRANCH_LENGTH", e[e.JUMP_TABLE = 127] = "JUMP_TABLE";
+    })(l = u.BinTrieFlags || (u.BinTrieFlags = {}));
+    function f(e) {
+      return e >= c.ZERO && e <= c.NINE;
+    }
+    function p(e) {
+      return e >= c.UPPER_A && e <= c.UPPER_F || e >= c.LOWER_A && e <= c.LOWER_F;
+    }
+    function g(e) {
+      return e >= c.UPPER_A && e <= c.UPPER_Z || e >= c.LOWER_A && e <= c.LOWER_Z || f(e);
+    }
+    function W(e) {
+      return e === c.EQUALS || g(e);
+    }
+    var a;
+    (function(e) {
+      e[e.EntityStart = 0] = "EntityStart", e[e.NumericStart = 1] = "NumericStart", e[e.NumericDecimal = 2] = "NumericDecimal", e[e.NumericHex = 3] = "NumericHex", e[e.NamedEntity = 4] = "NamedEntity";
+    })(a || (a = {}));
+    var h;
+    (function(e) {
+      e[e.Legacy = 0] = "Legacy", e[e.Strict = 1] = "Strict", e[e.Attribute = 2] = "Attribute";
+    })(h = u.DecodingMode || (u.DecodingMode = {}));
+    var R = (
+      /** @class */
+      (function() {
+        function e(t, i, r) {
+          this.decodeTree = t, this.emitCodePoint = i, this.errors = r, this.state = a.EntityStart, this.consumed = 1, this.result = 0, this.treeIndex = 0, this.excess = 1, this.decodeMode = h.Strict;
+        }
+        return e.prototype.startEntity = function(t) {
+          this.decodeMode = t, this.state = a.EntityStart, this.result = 0, this.treeIndex = 0, this.excess = 1, this.consumed = 1;
+        }, e.prototype.write = function(t, i) {
+          switch (this.state) {
+            case a.EntityStart:
+              return t.charCodeAt(i) === c.NUM ? (this.state = a.NumericStart, this.consumed += 1, this.stateNumericStart(t, i + 1)) : (this.state = a.NamedEntity, this.stateNamedEntity(t, i));
+            case a.NumericStart:
+              return this.stateNumericStart(t, i);
+            case a.NumericDecimal:
+              return this.stateNumericDecimal(t, i);
+            case a.NumericHex:
+              return this.stateNumericHex(t, i);
+            case a.NamedEntity:
+              return this.stateNamedEntity(t, i);
+          }
+        }, e.prototype.stateNumericStart = function(t, i) {
+          return i >= t.length ? -1 : (t.charCodeAt(i) | U) === c.LOWER_X ? (this.state = a.NumericHex, this.consumed += 1, this.stateNumericHex(t, i + 1)) : (this.state = a.NumericDecimal, this.stateNumericDecimal(t, i));
+        }, e.prototype.addToNumericResult = function(t, i, r, n) {
+          if (i !== r) {
+            var d = r - i;
+            this.result = this.result * Math.pow(n, d) + parseInt(t.substr(i, d), n), this.consumed += d;
+          }
+        }, e.prototype.stateNumericHex = function(t, i) {
+          for (var r = i; i < t.length; ) {
+            var n = t.charCodeAt(i);
+            if (f(n) || p(n))
+              i += 1;
+            else
+              return this.addToNumericResult(t, r, i, 16), this.emitNumericEntity(n, 3);
+          }
+          return this.addToNumericResult(t, r, i, 16), -1;
+        }, e.prototype.stateNumericDecimal = function(t, i) {
+          for (var r = i; i < t.length; ) {
+            var n = t.charCodeAt(i);
+            if (f(n))
+              i += 1;
+            else
+              return this.addToNumericResult(t, r, i, 10), this.emitNumericEntity(n, 2);
+          }
+          return this.addToNumericResult(t, r, i, 10), -1;
+        }, e.prototype.emitNumericEntity = function(t, i) {
+          var r;
+          if (this.consumed <= i)
+            return (r = this.errors) === null || r === void 0 || r.absenceOfDigitsInNumericCharacterReference(this.consumed), 0;
+          if (t === c.SEMI)
+            this.consumed += 1;
+          else if (this.decodeMode === h.Strict)
+            return 0;
+          return this.emitCodePoint((0, N.replaceCodePoint)(this.result), this.consumed), this.errors && (t !== c.SEMI && this.errors.missingSemicolonAfterCharacterReference(), this.errors.validateNumericCharacterReference(this.result)), this.consumed;
+        }, e.prototype.stateNamedEntity = function(t, i) {
+          for (var r = this.decodeTree, n = r[this.treeIndex], d = (n & l.VALUE_LENGTH) >> 14; i < t.length; i++, this.excess++) {
+            var o = t.charCodeAt(i);
+            if (this.treeIndex = M(r, n, this.treeIndex + Math.max(1, d), o), this.treeIndex < 0)
+              return this.result === 0 || // If we are parsing an attribute
+              this.decodeMode === h.Attribute && // We shouldn't have consumed any characters after the entity,
+              (d === 0 || // And there should be no invalid characters.
+              W(o)) ? 0 : this.emitNotTerminatedNamedEntity();
+            if (n = r[this.treeIndex], d = (n & l.VALUE_LENGTH) >> 14, d !== 0) {
+              if (o === c.SEMI)
+                return this.emitNamedEntityData(this.treeIndex, d, this.consumed + this.excess);
+              this.decodeMode !== h.Strict && (this.result = this.treeIndex, this.consumed += this.excess, this.excess = 0);
+            }
+          }
+          return -1;
+        }, e.prototype.emitNotTerminatedNamedEntity = function() {
+          var t, i = this, r = i.result, n = i.decodeTree, d = (n[r] & l.VALUE_LENGTH) >> 14;
+          return this.emitNamedEntityData(r, d, this.consumed), (t = this.errors) === null || t === void 0 || t.missingSemicolonAfterCharacterReference(), this.consumed;
+        }, e.prototype.emitNamedEntityData = function(t, i, r) {
+          var n = this.decodeTree;
+          return this.emitCodePoint(i === 1 ? n[t] & ~l.VALUE_LENGTH : n[t + 1], r), i === 3 && this.emitCodePoint(n[t + 2], r), r;
+        }, e.prototype.end = function() {
+          var t;
+          switch (this.state) {
+            case a.NamedEntity:
+              return this.result !== 0 && (this.decodeMode !== h.Attribute || this.result === this.treeIndex) ? this.emitNotTerminatedNamedEntity() : 0;
+            // Otherwise, emit a numeric entity if we have one.
+            case a.NumericDecimal:
+              return this.emitNumericEntity(0, 2);
+            case a.NumericHex:
+              return this.emitNumericEntity(0, 3);
+            case a.NumericStart:
+              return (t = this.errors) === null || t === void 0 || t.absenceOfDigitsInNumericCharacterReference(this.consumed), 0;
+            case a.EntityStart:
+              return 0;
+          }
+        }, e;
+      })()
+    );
+    u.EntityDecoder = R;
+    function T(e) {
+      var t = "", i = new R(e, function(r) {
+        return t += (0, N.fromCodePoint)(r);
+      });
+      return function(n, d) {
+        for (var o = 0, s = 0; (s = n.indexOf("&", s)) >= 0; ) {
+          t += n.slice(o, s), i.startEntity(d);
+          var _ = i.write(
+            n,
+            // Skip the "&"
+            s + 1
+          );
+          if (_ < 0) {
+            o = s + i.end();
+            break;
+          }
+          o = s + _, s = _ === 0 ? o + 1 : o;
+        }
+        var E = t + n.slice(o);
+        return t = "", 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;
+    function M(e, t, i, r) {
+      var n = (t & l.BRANCH_LENGTH) >> 7, d = t & l.JUMP_TABLE;
+      if (n === 0)
+        return d !== 0 && r === d ? i : -1;
+      if (d) {
+        var o = r - d;
+        return o < 0 || o >= n ? -1 : e[i + o] - 1;
+      }
+      for (var s = i, _ = s + n - 1; s <= _; ) {
+        var E = s + _ >>> 1, O = e[E];
+        if (O < r)
+          s = E + 1;
+        else if (O > r)
+          _ = E - 1;
+        else
+          return e[E + n];
+      }
+      return -1;
+    }
+    u.determineBranch = M;
+    var v = T(y.default), j = T(P.default);
+    function w(e, t) {
+      return t === void 0 && (t = h.Legacy), v(e, t);
+    }
+    u.decodeHTML = w;
+    function B(e) {
+      return v(e, h.Attribute);
+    }
+    u.decodeHTMLAttribute = B;
+    function q(e) {
+      return v(e, h.Strict);
+    }
+    u.decodeHTMLStrict = q;
+    function G(e) {
+      return j(e, h.Strict);
+    }
+    u.decodeXML = G;
+  })(m), m);
 }
 export {
-  h as __require
+  Q as __require
 };
 //# sourceMappingURL=index.es674.js.map

package/dist/index.es674.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es674.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.es674.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.es675.js

@@ -1,55 +1,5 @@
-import { __exports as N } from "./index.es729.js";
-import { __require as S } from "./index.es635.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;
-}
+var r = {};
 export {
-  b as __require
+  r as __exports
 };
 //# sourceMappingURL=index.es675.js.map

package/dist/index.es675.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es675.js","sources":["../node_modules/domutils/lib/helpers.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DocumentPosition = void 0;\nexports.removeSubsets = removeSubsets;\nexports.compareDocumentPosition = compareDocumentPosition;\nexports.uniqueSort = uniqueSort;\nvar domhandler_1 = require(\"domhandler\");\n/**\n * Given an array of nodes, remove any member that is contained by another\n * member.\n *\n * @category Helpers\n * @param nodes Nodes to filter.\n * @returns Remaining nodes that aren't contained by other nodes.\n */\nfunction removeSubsets(nodes) {\n    var idx = nodes.length;\n    /*\n     * Check if each node (or one of its ancestors) is already contained in the\n     * array.\n     */\n    while (--idx >= 0) {\n        var node = nodes[idx];\n        /*\n         * Remove the node if it is not unique.\n         * We are going through the array from the end, so we only\n         * have to check nodes that preceed the node under consideration in the array.\n         */\n        if (idx > 0 && nodes.lastIndexOf(node, idx - 1) >= 0) {\n            nodes.splice(idx, 1);\n            continue;\n        }\n        for (var ancestor = node.parent; ancestor; ancestor = ancestor.parent) {\n            if (nodes.includes(ancestor)) {\n                nodes.splice(idx, 1);\n                break;\n            }\n        }\n    }\n    return nodes;\n}\n/**\n * @category Helpers\n * @see {@link http://dom.spec.whatwg.org/#dom-node-comparedocumentposition}\n */\nvar DocumentPosition;\n(function (DocumentPosition) {\n    DocumentPosition[DocumentPosition[\"DISCONNECTED\"] = 1] = \"DISCONNECTED\";\n    DocumentPosition[DocumentPosition[\"PRECEDING\"] = 2] = \"PRECEDING\";\n    DocumentPosition[DocumentPosition[\"FOLLOWING\"] = 4] = \"FOLLOWING\";\n    DocumentPosition[DocumentPosition[\"CONTAINS\"] = 8] = \"CONTAINS\";\n    DocumentPosition[DocumentPosition[\"CONTAINED_BY\"] = 16] = \"CONTAINED_BY\";\n})(DocumentPosition || (exports.DocumentPosition = DocumentPosition = {}));\n/**\n * Compare the position of one node against another node in any other document,\n * returning a bitmask with the values from {@link DocumentPosition}.\n *\n * Document order:\n * > There is an ordering, document order, defined on all the nodes in the\n * > document corresponding to the order in which the first character of the\n * > XML representation of each node occurs in the XML representation of the\n * > document after expansion of general entities. Thus, the document element\n * > node will be the first node. Element nodes occur before their children.\n * > Thus, document order orders element nodes in order of the occurrence of\n * > their start-tag in the XML (after expansion of entities). The attribute\n * > nodes of an element occur after the element and before its children. The\n * > relative order of attribute nodes is implementation-dependent.\n *\n * Source:\n * http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order\n *\n * @category Helpers\n * @param nodeA The first node to use in the comparison\n * @param nodeB The second node to use in the comparison\n * @returns A bitmask describing the input nodes' relative position.\n *\n * See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for\n * a description of these values.\n */\nfunction compareDocumentPosition(nodeA, nodeB) {\n    var aParents = [];\n    var bParents = [];\n    if (nodeA === nodeB) {\n        return 0;\n    }\n    var current = (0, domhandler_1.hasChildren)(nodeA) ? nodeA : nodeA.parent;\n    while (current) {\n        aParents.unshift(current);\n        current = current.parent;\n    }\n    current = (0, domhandler_1.hasChildren)(nodeB) ? nodeB : nodeB.parent;\n    while (current) {\n        bParents.unshift(current);\n        current = current.parent;\n    }\n    var maxIdx = Math.min(aParents.length, bParents.length);\n    var idx = 0;\n    while (idx < maxIdx && aParents[idx] === bParents[idx]) {\n        idx++;\n    }\n    if (idx === 0) {\n        return DocumentPosition.DISCONNECTED;\n    }\n    var sharedParent = aParents[idx - 1];\n    var siblings = sharedParent.children;\n    var aSibling = aParents[idx];\n    var bSibling = bParents[idx];\n    if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {\n        if (sharedParent === nodeB) {\n            return DocumentPosition.FOLLOWING | DocumentPosition.CONTAINED_BY;\n        }\n        return DocumentPosition.FOLLOWING;\n    }\n    if (sharedParent === nodeA) {\n        return DocumentPosition.PRECEDING | DocumentPosition.CONTAINS;\n    }\n    return DocumentPosition.PRECEDING;\n}\n/**\n * Sort an array of nodes based on their relative position in the document,\n * removing any duplicate nodes. If the array contains nodes that do not belong\n * to the same document, sort order is unspecified.\n *\n * @category Helpers\n * @param nodes Array of DOM nodes.\n * @returns Collection of unique nodes, sorted in document order.\n */\nfunction uniqueSort(nodes) {\n    nodes = nodes.filter(function (node, i, arr) { return !arr.includes(node, i + 1); });\n    nodes.sort(function (a, b) {\n        var relative = compareDocumentPosition(a, b);\n        if (relative & DocumentPosition.PRECEDING) {\n            return -1;\n        }\n        else if (relative & DocumentPosition.FOLLOWING) {\n            return 1;\n        }\n        return 0;\n    });\n    return nodes;\n}\n//# sourceMappingURL=helpers.js.map"],"names":["helpers","removeSubsets","compareDocumentPosition","uniqueSort","domhandler_1","require$$0","nodes","idx","node","ancestor","DocumentPosition","nodeA","nodeB","aParents","bParents","current","maxIdx","sharedParent","siblings","aSibling","bSibling","i","arr","a","b","relative"],"mappings":";;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,mBAA2B,QAC3BA,EAAA,gBAAwBC,GACxBD,EAAA,0BAAkCE,GAClCF,EAAA,aAAqBG;AACrB,MAAIC,IAAeC,gBAAAA,EAAA;AASnB,WAASJ,EAAcK,GAAO;AAM1B,aALIC,IAAMD,EAAM,QAKT,EAAEC,KAAO,KAAG;AACf,UAAIC,IAAOF,EAAMC,CAAG;AAMpB,UAAIA,IAAM,KAAKD,EAAM,YAAYE,GAAMD,IAAM,CAAC,KAAK,GAAG;AAClD,QAAAD,EAAM,OAAOC,GAAK,CAAC;AACnB;AAAA,MACZ;AACQ,eAASE,IAAWD,EAAK,QAAQC,GAAUA,IAAWA,EAAS;AAC3D,YAAIH,EAAM,SAASG,CAAQ,GAAG;AAC1B,UAAAH,EAAM,OAAOC,GAAK,CAAC;AACnB;AAAA,QAChB;AAAA,IAEA;AACI,WAAOD;AAAA,EACX;AAKA,MAAII;AACJ,GAAC,SAAUA,GAAkB;AACzB,IAAAA,EAAiBA,EAAiB,eAAkB,CAAC,IAAI,gBACzDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,YAAe,CAAC,IAAI,aACtDA,EAAiBA,EAAiB,WAAc,CAAC,IAAI,YACrDA,EAAiBA,EAAiB,eAAkB,EAAE,IAAI;AAAA,EAC9D,GAAGA,MAAqBV,EAAA,mBAA2BU,IAAmB,CAAA,EAAG;AA2BzE,WAASR,EAAwBS,GAAOC,GAAO;AAC3C,QAAIC,IAAW,CAAA,GACXC,IAAW,CAAA;AACf,QAAIH,MAAUC;AACV,aAAO;AAGX,aADIG,QAAcX,EAAa,aAAaO,CAAK,IAAIA,IAAQA,EAAM,QAC5DI;AACH,MAAAF,EAAS,QAAQE,CAAO,GACxBA,IAAUA,EAAQ;AAGtB,SADAA,QAAcX,EAAa,aAAaQ,CAAK,IAAIA,IAAQA,EAAM,QACxDG;AACH,MAAAD,EAAS,QAAQC,CAAO,GACxBA,IAAUA,EAAQ;AAItB,aAFIC,IAAS,KAAK,IAAIH,EAAS,QAAQC,EAAS,MAAM,GAClDP,IAAM,GACHA,IAAMS,KAAUH,EAASN,CAAG,MAAMO,EAASP,CAAG;AACjD,MAAAA;AAEJ,QAAIA,MAAQ;AACR,aAAOG,EAAiB;AAE5B,QAAIO,IAAeJ,EAASN,IAAM,CAAC,GAC/BW,IAAWD,EAAa,UACxBE,IAAWN,EAASN,CAAG,GACvBa,IAAWN,EAASP,CAAG;AAC3B,WAAIW,EAAS,QAAQC,CAAQ,IAAID,EAAS,QAAQE,CAAQ,IAClDH,MAAiBL,IACVF,EAAiB,YAAYA,EAAiB,eAElDA,EAAiB,YAExBO,MAAiBN,IACVD,EAAiB,YAAYA,EAAiB,WAElDA,EAAiB;AAAA,EAC5B;AAUA,WAASP,EAAWG,GAAO;AACvB,WAAAA,IAAQA,EAAM,OAAO,SAAUE,GAAMa,GAAGC,GAAK;AAAE,aAAO,CAACA,EAAI,SAASd,GAAMa,IAAI,CAAC;AAAA,IAAE,CAAE,GACnFf,EAAM,KAAK,SAAUiB,GAAGC,GAAG;AACvB,UAAIC,IAAWvB,EAAwBqB,GAAGC,CAAC;AAC3C,aAAIC,IAAWf,EAAiB,YACrB,KAEFe,IAAWf,EAAiB,YAC1B,IAEJ;AAAA,IACf,CAAK,GACMJ;AAAA,EACX;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es675.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}