@performant-software/core-data 2.3.8 → 2.3.9-beta.0

package/dist/index.es531.js

@@ -1,65 +1,228 @@
-import { __exports as e } from "./index.es538.js";
-Object.defineProperty(e, "__esModule", { value: !0 });
-e.prepend = e.prependChild = e.append = e.appendChild = e.replaceElement = e.removeElement = void 0;
-function v(r) {
-  if (r.prev && (r.prev.next = r.next), r.next && (r.next.prev = r.prev), r.parent) {
-    var n = r.parent.children, p = n.lastIndexOf(r);
-    p >= 0 && n.splice(p, 1);
+import { commonjsGlobal as h } from "./index.es241.js";
+import { __exports as Z } from "./index.es532.js";
+import "./index.es615.js";
+import "./index.es616.js";
+import "./index.es617.js";
+import { __exports as x } from "./index.es618.js";
+import { __exports as X } from "./index.es619.js";
+import { __exports as b } from "./index.es620.js";
+(function(c) {
+  var H = h && h.__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];
+  }), p = h && h.__setModuleDefault || (Object.create ? function(e, t) {
+    Object.defineProperty(e, "default", { enumerable: !0, value: t });
+  } : function(e, t) {
+    e.default = t;
+  }), S = h && h.__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) && H(t, e, i);
+    return p(t, e), t;
+  }, L = h && h.__importDefault || function(e) {
+    return e && e.__esModule ? e : { default: e };
+  };
+  Object.defineProperty(c, "__esModule", { value: !0 }), c.decodeXML = c.decodeHTMLStrict = c.decodeHTMLAttribute = c.decodeHTML = c.determineBranch = c.EntityDecoder = c.DecodingMode = c.BinTrieFlags = c.fromCodePoint = c.replaceCodePoint = c.decodeCodePoint = c.xmlDecodeTree = c.htmlDecodeTree = void 0;
+  var y = L(x);
+  c.htmlDecodeTree = y.default;
+  var P = L(X);
+  c.xmlDecodeTree = P.default;
+  var N = S(b);
+  c.decodeCodePoint = N.default;
+  var A = b;
+  Object.defineProperty(c, "replaceCodePoint", { enumerable: !0, get: function() {
+    return A.replaceCodePoint;
+  } }), Object.defineProperty(c, "fromCodePoint", { enumerable: !0, get: function() {
+    return A.fromCodePoint;
+  } });
+  var u;
+  (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";
+  })(u || (u = {}));
+  var I = 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 = c.BinTrieFlags || (c.BinTrieFlags = {}));
+  function f(e) {
+    return e >= u.ZERO && e <= u.NINE;
   }
-  r.next = null, r.prev = null, r.parent = null;
-}
-e.removeElement = v;
-function i(r, n) {
-  var p = n.prev = r.prev;
-  p && (p.next = n);
-  var t = n.next = r.next;
-  t && (t.prev = n);
-  var a = n.parent = r.parent;
-  if (a) {
-    var f = a.children;
-    f[f.lastIndexOf(r)] = n, r.parent = null;
+  function U(e) {
+    return e >= u.UPPER_A && e <= u.UPPER_F || e >= u.LOWER_A && e <= u.LOWER_F;
   }
-}
-e.replaceElement = i;
-function u(r, n) {
-  if (v(n), n.next = null, n.parent = r, r.children.push(n) > 1) {
-    var p = r.children[r.children.length - 2];
-    p.next = n, n.prev = p;
-  } else
-    n.prev = null;
-}
-e.appendChild = u;
-function d(r, n) {
-  v(n);
-  var p = r.parent, t = r.next;
-  if (n.next = t, n.prev = r, r.next = n, n.parent = p, t) {
-    if (t.prev = n, p) {
-      var a = p.children;
-      a.splice(a.lastIndexOf(t), 0, n);
+  function D(e) {
+    return e >= u.UPPER_A && e <= u.UPPER_Z || e >= u.LOWER_A && e <= u.LOWER_Z || f(e);
+  }
+  function g(e) {
+    return e === u.EQUALS || D(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 m;
+  (function(e) {
+    e[e.Legacy = 0] = "Legacy", e[e.Strict = 1] = "Strict", e[e.Attribute = 2] = "Attribute";
+  })(m = c.DecodingMode || (c.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 = m.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) === u.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) | I) === u.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) || U(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 === u.SEMI)
+          this.consumed += 1;
+        else if (this.decodeMode === m.Strict)
+          return 0;
+        return this.emitCodePoint((0, N.replaceCodePoint)(this.result), this.consumed), this.errors && (t !== u.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 === m.Attribute && // We shouldn't have consumed any characters after the entity,
+            (d === 0 || // And there should be no invalid characters.
+            g(o)) ? 0 : this.emitNotTerminatedNamedEntity();
+          if (n = r[this.treeIndex], d = (n & l.VALUE_LENGTH) >> 14, d !== 0) {
+            if (o === u.SEMI)
+              return this.emitNamedEntityData(this.treeIndex, d, this.consumed + this.excess);
+            this.decodeMode !== m.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 !== m.Attribute || this.result === this.treeIndex) ? this.emitNotTerminatedNamedEntity() : 0;
+          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;
+    }()
+  );
+  c.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 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];
     }
-  } else
-    p && p.children.push(n);
-}
-e.append = d;
-function o(r, n) {
-  if (v(n), n.parent = r, n.prev = null, r.children.unshift(n) !== 1) {
-    var p = r.children[1];
-    p.prev = n, n.next = p;
-  } else
-    n.next = null;
-}
-e.prependChild = o;
-function x(r, n) {
-  v(n);
-  var p = r.parent;
-  if (p) {
-    var t = p.children;
-    t.splice(t.indexOf(r), 0, n);
+    return -1;
+  }
+  c.determineBranch = M;
+  var v = T(y.default), j = T(P.default);
+  function W(e, t) {
+    return t === void 0 && (t = m.Legacy), v(e, t);
+  }
+  c.decodeHTML = W;
+  function w(e) {
+    return v(e, m.Attribute);
+  }
+  c.decodeHTMLAttribute = w;
+  function B(e) {
+    return v(e, m.Strict);
+  }
+  c.decodeHTMLStrict = B;
+  function G(e) {
+    return j(e, m.Strict);
   }
-  r.prev && (r.prev.next = n), n.parent = p, n.prev = r.prev, n.next = r, r.prev = n;
-}
-e.prepend = x;
-export {
-  e as default
-};
+  c.decodeXML = G;
+})(Z);
 //# sourceMappingURL=index.es531.js.map

package/dist/index.es531.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es531.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/manipulation.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.prepend = exports.prependChild = exports.append = exports.appendChild = exports.replaceElement = exports.removeElement = void 0;\n/**\n * Remove an element from the dom\n *\n * @category Manipulation\n * @param elem The element to be removed\n */\nfunction removeElement(elem) {\n    if (elem.prev)\n        elem.prev.next = elem.next;\n    if (elem.next)\n        elem.next.prev = elem.prev;\n    if (elem.parent) {\n        var childs = elem.parent.children;\n        var childsIndex = childs.lastIndexOf(elem);\n        if (childsIndex >= 0) {\n            childs.splice(childsIndex, 1);\n        }\n    }\n    elem.next = null;\n    elem.prev = null;\n    elem.parent = null;\n}\nexports.removeElement = removeElement;\n/**\n * Replace an element in the dom\n *\n * @category Manipulation\n * @param elem The element to be replaced\n * @param replacement The element to be added\n */\nfunction replaceElement(elem, replacement) {\n    var prev = (replacement.prev = elem.prev);\n    if (prev) {\n        prev.next = replacement;\n    }\n    var next = (replacement.next = elem.next);\n    if (next) {\n        next.prev = replacement;\n    }\n    var parent = (replacement.parent = elem.parent);\n    if (parent) {\n        var childs = parent.children;\n        childs[childs.lastIndexOf(elem)] = replacement;\n        elem.parent = null;\n    }\n}\nexports.replaceElement = replaceElement;\n/**\n * Append a child to an element.\n *\n * @category Manipulation\n * @param parent The element to append to.\n * @param child The element to be added as a child.\n */\nfunction appendChild(parent, child) {\n    removeElement(child);\n    child.next = null;\n    child.parent = parent;\n    if (parent.children.push(child) > 1) {\n        var sibling = parent.children[parent.children.length - 2];\n        sibling.next = child;\n        child.prev = sibling;\n    }\n    else {\n        child.prev = null;\n    }\n}\nexports.appendChild = appendChild;\n/**\n * Append an element after another.\n *\n * @category Manipulation\n * @param elem The element to append after.\n * @param next The element be added.\n */\nfunction append(elem, next) {\n    removeElement(next);\n    var parent = elem.parent;\n    var currNext = elem.next;\n    next.next = currNext;\n    next.prev = elem;\n    elem.next = next;\n    next.parent = parent;\n    if (currNext) {\n        currNext.prev = next;\n        if (parent) {\n            var childs = parent.children;\n            childs.splice(childs.lastIndexOf(currNext), 0, next);\n        }\n    }\n    else if (parent) {\n        parent.children.push(next);\n    }\n}\nexports.append = append;\n/**\n * Prepend a child to an element.\n *\n * @category Manipulation\n * @param parent The element to prepend before.\n * @param child The element to be added as a child.\n */\nfunction prependChild(parent, child) {\n    removeElement(child);\n    child.parent = parent;\n    child.prev = null;\n    if (parent.children.unshift(child) !== 1) {\n        var sibling = parent.children[1];\n        sibling.prev = child;\n        child.next = sibling;\n    }\n    else {\n        child.next = null;\n    }\n}\nexports.prependChild = prependChild;\n/**\n * Prepend an element before another.\n *\n * @category Manipulation\n * @param elem The element to prepend before.\n * @param prev The element be added.\n */\nfunction prepend(elem, prev) {\n    removeElement(prev);\n    var parent = elem.parent;\n    if (parent) {\n        var childs = parent.children;\n        childs.splice(childs.indexOf(elem), 0, prev);\n    }\n    if (elem.prev) {\n        elem.prev.next = prev;\n    }\n    prev.parent = parent;\n    prev.prev = elem.prev;\n    prev.next = elem;\n    elem.prev = prev;\n}\nexports.prepend = prepend;\n//# sourceMappingURL=manipulation.js.map"],"names":["manipulation","removeElement","elem","childs","childsIndex","replaceElement","replacement","prev","next","parent","appendChild","child","sibling","append","currNext","prependChild","prepend"],"mappings":";AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,UAAkBA,EAAA,eAAuBA,EAAA,SAAiBA,EAAA,cAAsBA,EAAA,iBAAyBA,EAAA,gBAAwB;AAOjI,SAASC,EAAcC,GAAM;AAKzB,MAJIA,EAAK,SACAA,EAAA,KAAK,OAAOA,EAAK,OACtBA,EAAK,SACAA,EAAA,KAAK,OAAOA,EAAK,OACtBA,EAAK,QAAQ;AACT,QAAAC,IAASD,EAAK,OAAO,UACrBE,IAAcD,EAAO,YAAYD,CAAI;AACzC,IAAIE,KAAe,KACRD,EAAA,OAAOC,GAAa,CAAC;AAAA,EAEpC;AACA,EAAAF,EAAK,OAAO,MACZA,EAAK,OAAO,MACZA,EAAK,SAAS;AAClB;AACwBF,EAAA,gBAAAC;AAQxB,SAASI,EAAeH,GAAMI,GAAa;AACnC,MAAAC,IAAQD,EAAY,OAAOJ,EAAK;AACpC,EAAIK,MACAA,EAAK,OAAOD;AAEZ,MAAAE,IAAQF,EAAY,OAAOJ,EAAK;AACpC,EAAIM,MACAA,EAAK,OAAOF;AAEZ,MAAAG,IAAUH,EAAY,SAASJ,EAAK;AACxC,MAAIO,GAAQ;AACR,QAAIN,IAASM,EAAO;AACpB,IAAAN,EAAOA,EAAO,YAAYD,CAAI,CAAC,IAAII,GACnCJ,EAAK,SAAS;AAAA,EAClB;AACJ;AACyBF,EAAA,iBAAAK;AAQzB,SAASK,EAAYD,GAAQE,GAAO;AAIhC,MAHAV,EAAcU,CAAK,GACnBA,EAAM,OAAO,MACbA,EAAM,SAASF,GACXA,EAAO,SAAS,KAAKE,CAAK,IAAI,GAAG;AACjC,QAAIC,IAAUH,EAAO,SAASA,EAAO,SAAS,SAAS,CAAC;AACxD,IAAAG,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,EAAA;AAGb,IAAAD,EAAM,OAAO;AAErB;AACsBX,EAAA,cAAAU;AAQtB,SAASG,EAAOX,GAAMM,GAAM;AACxB,EAAAP,EAAcO,CAAI;AAClB,MAAIC,IAASP,EAAK,QACdY,IAAWZ,EAAK;AAKpB,MAJAM,EAAK,OAAOM,GACZN,EAAK,OAAON,GACZA,EAAK,OAAOM,GACZA,EAAK,SAASC,GACVK;AAEA,QADAA,EAAS,OAAON,GACZC,GAAQ;AACR,UAAIN,IAASM,EAAO;AACpB,MAAAN,EAAO,OAAOA,EAAO,YAAYW,CAAQ,GAAG,GAAGN,CAAI;AAAA,IACvD;AAAA;IAEKC,KACEA,EAAA,SAAS,KAAKD,CAAI;AAEjC;AACiBR,EAAA,SAAAa;AAQjB,SAASE,EAAaN,GAAQE,GAAO;AAIjC,MAHAV,EAAcU,CAAK,GACnBA,EAAM,SAASF,GACfE,EAAM,OAAO,MACTF,EAAO,SAAS,QAAQE,CAAK,MAAM,GAAG;AAClC,QAAAC,IAAUH,EAAO,SAAS,CAAC;AAC/B,IAAAG,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,EAAA;AAGb,IAAAD,EAAM,OAAO;AAErB;AACuBX,EAAA,eAAAe;AAQvB,SAASC,EAAQd,GAAMK,GAAM;AACzB,EAAAN,EAAcM,CAAI;AAClB,MAAIE,IAASP,EAAK;AAClB,MAAIO,GAAQ;AACR,QAAIN,IAASM,EAAO;AACpB,IAAAN,EAAO,OAAOA,EAAO,QAAQD,CAAI,GAAG,GAAGK,CAAI;AAAA,EAC/C;AACA,EAAIL,EAAK,SACLA,EAAK,KAAK,OAAOK,IAErBA,EAAK,SAASE,GACdF,EAAK,OAAOL,EAAK,MACjBK,EAAK,OAAOL,GACZA,EAAK,OAAOK;AAChB;AACAP,EAAA,UAAkBgB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es531.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","require$$0","decode_data_xml_js_1","require$$1","decode_codepoint_js_1","require$$2","decode_codepoint_js_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,MAAIA,IAAmBC,KAAQA,EAAK,oBAAqB,OAAO,SAAU,SAASC,GAAGC,GAAGC,GAAGC,GAAI;AAC5F,IAAIA,MAAO,WAAgBA,IAAAD;AAC3B,QAAIE,IAAO,OAAO,yBAAyBH,GAAGC,CAAC;AAC3C,KAAA,CAACE,MAAS,SAASA,IAAO,CAACH,EAAE,aAAaG,EAAK,YAAYA,EAAK,mBAClEA,IAAO,EAAE,YAAY,IAAM,KAAK,WAAW;AAAE,aAAOH,EAAEC,CAAC;AAAA,IAAA,MAElD,OAAA,eAAeF,GAAGG,GAAIC,CAAI;AAAA,EACrC,IAAM,SAASJ,GAAGC,GAAGC,GAAGC,GAAI;AACxB,IAAIA,MAAO,WAAgBA,IAAAD,IACzBF,EAAAG,CAAE,IAAIF,EAAEC,CAAC;AAAA,EACf,IACIG,IAAsBN,KAAQA,EAAK,uBAAwB,OAAO,SAAU,SAASC,GAAGM,GAAG;AACpF,WAAA,eAAeN,GAAG,WAAW,EAAE,YAAY,IAAM,OAAOM,GAAG;AAAA,EACtE,IAAK,SAASN,GAAGM,GAAG;AAChB,IAAAN,EAAE,UAAaM;AAAA,EACnB,IACIC,IAAgBR,KAAQA,EAAK,gBAAiB,SAAUS,GAAK;AAC7D,QAAIA,KAAOA,EAAI;AAAmB,aAAAA;AAClC,QAAIC,IAAS,CAAA;AACb,QAAID,KAAO;AAAM,eAASN,KAAKM;AAAK,QAAIN,MAAM,aAAa,OAAO,UAAU,eAAe,KAAKM,GAAKN,CAAC,KAAmBJ,EAAAW,GAAQD,GAAKN,CAAC;AACvI,WAAAG,EAAmBI,GAAQD,CAAG,GACvBC;AAAA,EACX,GACIC,IAAmBX,KAAQA,EAAK,mBAAoB,SAAUS,GAAK;AACnE,WAAQA,KAAOA,EAAI,aAAcA,IAAM,EAAE,SAAWA;EACxD;AACA,SAAO,kBAAwB,cAAc,EAAE,OAAO,IAAM,GAC5DG,EAAA,YAAoBA,EAA2B,mBAAAA,EAAA,sBAA8BA,EAAqB,aAAAA,EAAA,kBAA0BA,kBAAwBA,EAAuB,eAAAA,EAAA,eAAuBA,EAAwB,gBAAAA,EAAA,mBAA2BA,EAA0B,kBAAAA,EAAA,gBAAwBA,EAAyB,iBAAA;AAChU,MAAIC,IAAwBF,EAAgBG,CAA0C;AACtF,EAAAF,EAAyB,iBAAAC,EAAsB;AAC/C,MAAIE,IAAuBJ,EAAgBK,CAAyC;AACpF,EAAAJ,EAAwB,gBAAAG,EAAqB;AAC7C,MAAIE,IAAwBT,EAAaU,CAAgC;AACzE,EAAAN,EAA0B,kBAAAK,EAAsB;AAChD,MAAIE,IAAwBD;AAC5B,SAAO,eAAeN,GAAS,oBAAoB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,WAAOO,EAAsB;AAAA,EAAkB,EAAA,CAAG,GAC5I,OAAO,eAAeP,GAAS,iBAAiB,EAAE,YAAY,IAAM,KAAK,WAAY;AAAE,WAAOO,EAAsB;AAAA,EAAe,EAAA,CAAG;AACtI,MAAIC;AAAA,GACH,SAAUA,GAAW;AAClBA,IAAAA,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,EACxC,GAAAA,MAAcA,IAAY,CAAG,EAAA;AAEhC,MAAIC,IAAe,IACfC;AAAA,GACH,SAAUA,GAAc;AACrBA,IAAAA,EAAaA,EAAa,eAAkB,KAAK,IAAI,gBACrDA,EAAaA,EAAa,gBAAmB,KAAK,IAAI,iBACtDA,EAAaA,EAAa,aAAgB,GAAG,IAAI;AAAA,KAClDA,IAAeV,EAAQ,iBAAiBA,EAAuB,eAAA,CAAG,EAAA;AACrE,WAASW,EAASC,GAAM;AACpB,WAAOA,KAAQJ,EAAU,QAAQI,KAAQJ,EAAU;AAAA,EACvD;AACA,WAASK,EAAuBD,GAAM;AACzB,WAAAA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU;AAAA,EACxD;AACA,WAASM,EAAoBF,GAAM;AAC/B,WAASA,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WACnDI,KAAQJ,EAAU,WAAWI,KAAQJ,EAAU,WAChDG,EAASC,CAAI;AAAA,EACrB;AAOA,WAASG,EAA8BH,GAAM;AACzC,WAAOA,MAASJ,EAAU,UAAUM,EAAoBF,CAAI;AAAA,EAChE;AACA,MAAII;AAAA,GACH,SAAUA,GAAoB;AAC3BA,IAAAA,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,EAC7D,GAAAA,MAAuBA,IAAqB,CAAG,EAAA;AAClD,MAAIC;AAAA,GACH,SAAUA,GAAc;AAErBA,IAAAA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,SAAY,CAAC,IAAI,UAE3CA,EAAaA,EAAa,YAAe,CAAC,IAAI;AAAA,KAC/CA,IAAejB,EAAQ,iBAAiBA,EAAuB,eAAA,CAAG,EAAA;AAIrE,MAAIkB;AAAA;AAAA,IAA+B,WAAY;AAClCA,eAAAA,EAETC,GAUAC,GAEAC,GAAQ;AACJ,aAAK,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,MACnC;AAEAC,aAAAA,EAAc,UAAU,cAAc,SAAUI,GAAY;AACxD,aAAK,aAAaA,GAClB,KAAK,QAAQN,EAAmB,aAChC,KAAK,SAAS,GACd,KAAK,YAAY,GACjB,KAAK,SAAS,GACd,KAAK,WAAW;AAAA,MAAA,GAapBE,EAAc,UAAU,QAAQ,SAAUK,GAAKC,GAAQ;AACnD,gBAAQ,KAAK,OAAO;AAAA,UAChB,KAAKR,EAAmB;AACpB,mBAAIO,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,UAE5C,KAAKR,EAAmB;AACb,mBAAA,KAAK,kBAAkBO,GAAKC,CAAM;AAAA,UAE7C,KAAKR,EAAmB;AACb,mBAAA,KAAK,oBAAoBO,GAAKC,CAAM;AAAA,UAE/C,KAAKR,EAAmB;AACb,mBAAA,KAAK,gBAAgBO,GAAKC,CAAM;AAAA,UAE3C,KAAKR,EAAmB;AACb,mBAAA,KAAK,iBAAiBO,GAAKC,CAAM;AAAA,QAEhD;AAAA,MAAA,GAWJN,EAAc,UAAU,oBAAoB,SAAUK,GAAKC,GAAQ;AAC3D,eAAAA,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,MAAA,GAE/CN,EAAc,UAAU,qBAAqB,SAAUK,GAAKE,GAAOC,GAAKC,GAAM;AAC1E,YAAIF,MAAUC,GAAK;AACf,cAAIE,IAAaF,IAAMD;AACvB,eAAK,SACD,KAAK,SAAS,KAAK,IAAIE,GAAMC,CAAU,IACnC,SAASL,EAAI,OAAOE,GAAOG,CAAU,GAAGD,CAAI,GACpD,KAAK,YAAYC;AAAA,QACrB;AAAA,MAAA,GAWJV,EAAc,UAAU,kBAAkB,SAAUK,GAAKC,GAAQ;AAEtD,iBADHK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACpB,cAAAO,IAAOP,EAAI,WAAWC,CAAM;AAChC,cAAIb,EAASmB,CAAI,KAAKjB,EAAuBiB,CAAI;AACnC,YAAAN,KAAA;AAAA;AAGV,wBAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,QAE7C;AACA,oBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,MAAA,GAWXN,EAAc,UAAU,sBAAsB,SAAUK,GAAKC,GAAQ;AAE1D,iBADHK,IAAWL,GACRA,IAASD,EAAI,UAAQ;AACpB,cAAAO,IAAOP,EAAI,WAAWC,CAAM;AAC5B,cAAAb,EAASmB,CAAI;AACH,YAAAN,KAAA;AAAA;AAGV,wBAAK,mBAAmBD,GAAKM,GAAUL,GAAQ,EAAE,GAC1C,KAAK,kBAAkBM,GAAM,CAAC;AAAA,QAE7C;AACA,oBAAK,mBAAmBP,GAAKM,GAAUL,GAAQ,EAAE,GAC1C;AAAA,MAAA,GAeXN,EAAc,UAAU,oBAAoB,SAAUa,GAAQC,GAAgB;AACtE,YAAAC;AAEA,YAAA,KAAK,YAAYD;AAChB,kBAAAC,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAGP,YAAAF,MAAWvB,EAAU;AACrB,eAAK,YAAY;AAAA,iBAEZ,KAAK,eAAeS,EAAa;AAC/B,iBAAA;AAEN,oBAAA,kBAAkBZ,EAAsB,kBAAkB,KAAK,MAAM,GAAG,KAAK,QAAQ,GACtF,KAAK,WACD0B,MAAWvB,EAAU,QACrB,KAAK,OAAO,2CAEX,KAAA,OAAO,kCAAkC,KAAK,MAAM,IAEtD,KAAK;AAAA,MAAA,GAWhBU,EAAc,UAAU,mBAAmB,SAAUK,GAAKC,GAAQ;AAK9D,iBAJIL,IAAa,KAAK,YAClBe,IAAUf,EAAW,KAAK,SAAS,GAEnCgB,KAAeD,IAAUxB,EAAa,iBAAiB,IACpDc,IAASD,EAAI,QAAQC,KAAU,KAAK,UAAU;AAC7C,cAAAM,IAAOP,EAAI,WAAWC,CAAM;AAE5B,cADC,KAAA,YAAYY,EAAgBjB,GAAYe,GAAS,KAAK,YAAY,KAAK,IAAI,GAAGC,CAAW,GAAGL,CAAI,GACjG,KAAK,YAAY;AACjB,mBAAO,KAAK,WAAW;AAAA,YAElB,KAAK,eAAeb,EAAa;AAAA,aAE7BkB,MAAgB;AAAA,YAEbpB,EAA8Be,CAAI,KACxC,IACA,KAAK,6BAA6B;AAK5C,cAHUI,IAAAf,EAAW,KAAK,SAAS,GACpBgB,KAAAD,IAAUxB,EAAa,iBAAiB,IAEnDyB,MAAgB,GAAG;AAEf,gBAAAL,MAAStB,EAAU;AACZ,qBAAA,KAAK,oBAAoB,KAAK,WAAW2B,GAAa,KAAK,WAAW,KAAK,MAAM;AAGxF,YAAA,KAAK,eAAelB,EAAa,WACjC,KAAK,SAAS,KAAK,WACnB,KAAK,YAAY,KAAK,QACtB,KAAK,SAAS;AAAA,UAEtB;AAAA,QACJ;AACO,eAAA;AAAA,MAAA,GAOXC,EAAc,UAAU,+BAA+B,WAAY;AAC3D,YAAAe,GACAI,IAAK,MAAMvC,IAASuC,EAAG,QAAQlB,IAAakB,EAAG,YAC/CF,KAAehB,EAAWrB,CAAM,IAAIY,EAAa,iBAAiB;AACtE,oBAAK,oBAAoBZ,GAAQqC,GAAa,KAAK,QAAQ,IAC1DF,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,wCAAwC,GAC5F,KAAK;AAAA,MAAA,GAWhBf,EAAc,UAAU,sBAAsB,SAAUpB,GAAQqC,GAAaG,GAAU;AACnF,YAAInB,IAAa,KAAK;AACtB,oBAAK,cAAcgB,MAAgB,IAC7BhB,EAAWrB,CAAM,IAAI,CAACY,EAAa,eACnCS,EAAWrB,IAAS,CAAC,GAAGwC,CAAQ,GAClCH,MAAgB,KAEhB,KAAK,cAAchB,EAAWrB,IAAS,CAAC,GAAGwC,CAAQ,GAEhDA;AAAA,MAAA,GASXpB,EAAc,UAAU,MAAM,WAAY;AAClC,YAAAe;AACJ,gBAAQ,KAAK,OAAO;AAAA,UAChB,KAAKjB,EAAmB;AAEpB,mBAAO,KAAK,WAAW,MAClB,KAAK,eAAeC,EAAa,aAC9B,KAAK,WAAW,KAAK,aACvB,KAAK,6BACL,IAAA;AAAA,UAGV,KAAKD,EAAmB;AACb,mBAAA,KAAK,kBAAkB,GAAG,CAAC;AAAA,UAEtC,KAAKA,EAAmB;AACb,mBAAA,KAAK,kBAAkB,GAAG,CAAC;AAAA,UAEtC,KAAKA,EAAmB;AACnB,oBAAAiB,IAAK,KAAK,YAAY,QAAQA,MAAO,UAAkBA,EAAG,2CAA2C,KAAK,QAAQ,GAC5G;AAAA,UAEX,KAAKjB,EAAmB;AAEb,mBAAA;AAAA,QAEf;AAAA,MAAA,GAEGE;AAAAA,IAAA,EACT;AAAA;AACF,EAAAlB,EAAA,gBAAwBkB;AAOxB,WAASqB,EAAWpB,GAAY;AAC5B,QAAIqB,IAAM,IACNC,IAAU,IAAIvB,EAAcC,GAAY,SAAUI,GAAK;AAAE,aAAQiB,SAAWnC,EAAsB,eAAekB,CAAG;AAAA,IAAA,CAAK;AACtH,WAAA,SAAwBA,GAAKD,GAAY;AAG5C,eAFIoB,IAAY,GACZlB,IAAS,IACLA,IAASD,EAAI,QAAQ,KAAKC,CAAM,MAAM,KAAG;AACtC,QAAAgB,KAAAjB,EAAI,MAAMmB,GAAWlB,CAAM,GAClCiB,EAAQ,YAAYnB,CAAU;AAC9B,YAAIqB,IAAMF,EAAQ;AAAA,UAAMlB;AAAA;AAAA,UAExBC,IAAS;AAAA,QAAA;AACT,YAAImB,IAAM,GAAG;AACG,UAAAD,IAAAlB,IAASiB,EAAQ;AAC7B;AAAA,QACJ;AACA,QAAAC,IAAYlB,IAASmB,GAEZnB,IAAAmB,MAAQ,IAAID,IAAY,IAAIA;AAAA,MACzC;AACA,UAAI5C,IAAS0C,IAAMjB,EAAI,MAAMmB,CAAS;AAEhC,aAAAF,IAAA,IACC1C;AAAA,IAAA;AAAA,EAEf;AAWA,WAASsC,EAAgBjB,GAAYe,GAASU,GAASd,GAAM;AACrD,QAAAe,KAAeX,IAAUxB,EAAa,kBAAkB,GACxDoC,IAAaZ,IAAUxB,EAAa;AAExC,QAAImC,MAAgB;AAChB,aAAOC,MAAe,KAAKhB,MAASgB,IAAaF,IAAU;AAG/D,QAAIE,GAAY;AACZ,UAAIC,IAAQjB,IAAOgB;AACZ,aAAAC,IAAQ,KAAKA,KAASF,IACvB,KACA1B,EAAWyB,IAAUG,CAAK,IAAI;AAAA,IACxC;AAKA,aAFIC,IAAKJ,GACLK,IAAKD,IAAKH,IAAc,GACrBG,KAAMC,KAAI;AACT,UAAAC,IAAOF,IAAKC,MAAQ,GACpBE,IAAShC,EAAW+B,CAAG;AAC3B,UAAIC,IAASrB;AACT,QAAAkB,IAAKE,IAAM;AAAA,eAENC,IAASrB;AACd,QAAAmB,IAAKC,IAAM;AAAA;AAGJ,eAAA/B,EAAW+B,IAAML,CAAW;AAAA,IAE3C;AACO,WAAA;AAAA,EACX;AACA,EAAA7C,EAAA,kBAA0BoC;AAC1B,MAAIgB,IAAcb,EAAWtC,EAAsB,OAAO,GACtDoD,IAAad,EAAWpC,EAAqB,OAAO;AAQxD,WAASmD,EAAW/B,GAAKgC,GAAM;AAC3B,WAAIA,MAAS,WAAUA,IAAOtC,EAAa,SACpCmC,EAAY7B,GAAKgC,CAAI;AAAA,EAChC;AACA,EAAAvD,EAAA,aAAqBsD;AAOrB,WAASE,EAAoBjC,GAAK;AACvB,WAAA6B,EAAY7B,GAAKN,EAAa,SAAS;AAAA,EAClD;AACA,EAAAjB,EAAA,sBAA8BwD;AAO9B,WAASC,EAAiBlC,GAAK;AACpB,WAAA6B,EAAY7B,GAAKN,EAAa,MAAM;AAAA,EAC/C;AACA,EAAAjB,EAAA,mBAA2ByD;AAO3B,WAASC,EAAUnC,GAAK;AACb,WAAA8B,EAAW9B,GAAKN,EAAa,MAAM;AAAA,EAC9C;AACA,EAAAjB,EAAA,YAAoB0D;;","x_google_ignoreList":[0]}

package/dist/index.es532.js

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

package/dist/index.es532.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es532.js","sources":["../../../node_modules/htmlparser2/node_modules/domutils/lib/querying.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.findAll = exports.existsOne = exports.findOne = exports.findOneChild = exports.find = exports.filter = void 0;\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}\nexports.filter = filter;\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 = [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}\nexports.find = find;\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}\nexports.findOneChild = findOneChild;\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 elem = null;\n    for (var i = 0; i < nodes.length && !elem; i++) {\n        var node = nodes[i];\n        if (!(0, domhandler_1.isTag)(node)) {\n            continue;\n        }\n        else if (test(node)) {\n            elem = node;\n        }\n        else if (recurse && node.children.length > 0) {\n            elem = findOne(test, node.children, true);\n        }\n    }\n    return elem;\n}\nexports.findOne = findOne;\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 nodes.some(function (checked) {\n        return (0, domhandler_1.isTag)(checked) &&\n            (test(checked) || existsOne(test, checked.children));\n    });\n}\nexports.existsOne = existsOne;\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 = [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))\n            continue;\n        if (test(elem))\n            result.push(elem);\n        if (elem.children.length > 0) {\n            indexStack.unshift(0);\n            nodeStack.unshift(elem.children);\n        }\n    }\n}\nexports.findAll = findAll;\n//# sourceMappingURL=querying.js.map"],"names":["querying","domhandler_1","require$$0","filter","test","node","recurse","limit","find","nodes","result","nodeStack","indexStack","elem","findOneChild","findOne","i","existsOne","checked","findAll"],"mappings":";;;AACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM;AAC5DA,EAAA,UAAkBA,EAAA,YAAoBA,EAAA,UAAkBA,EAAA,eAAuBA,EAAA,OAAeA,EAAA,SAAiB;AAC/G,IAAIC,IAAeC;AAWnB,SAASC,EAAOC,GAAMC,GAAMC,GAASC,GAAO;AACxC,SAAID,MAAY,WAAoBA,IAAA,KAChCC,MAAU,WAAkBA,IAAA,QACzBC,EAAKJ,GAAM,MAAM,QAAQC,CAAI,IAAIA,IAAO,CAACA,CAAI,GAAGC,GAASC,CAAK;AACzE;AACiBP,EAAA,SAAAG;AAWjB,SAASK,EAAKJ,GAAMK,GAAOH,GAASC,GAAO;AAM9B,WALLG,IAAS,CAAA,GAETC,IAAY,CAACF,CAAK,GAElBG,IAAa,CAAC,CAAC,OACV;AAEL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAElC,UAAAC,EAAW,WAAW;AACf,eAAAF;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACnC,QAAAR,EAAKS,CAAI,MACTH,EAAO,KAAKG,CAAI,GACZ,EAAEN,KAAS;AACJ,aAAAG;AAEX,IAAAJ,SAAeL,EAAa,aAAaY,CAAI,KAAKA,EAAK,SAAS,SAAS,MAKzED,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACeb,EAAA,OAAAQ;AAUf,SAASM,EAAaV,GAAMK,GAAO;AACxB,SAAAA,EAAM,KAAKL,CAAI;AAC1B;AACuBJ,EAAA,eAAAc;AAUvB,SAASC,EAAQX,GAAMK,GAAOH,GAAS;AACnC,EAAIA,MAAY,WAAoBA,IAAA;AAEpC,WADIO,IAAO,MACFG,IAAI,GAAGA,IAAIP,EAAM,UAAU,CAACI,GAAMG,KAAK;AACxC,QAAAX,IAAOI,EAAMO,CAAC;AAClB,YAASf,EAAa,OAAOI,CAAI;AAEjC,MACSD,EAAKC,CAAI,IACPQ,IAAAR,IAEFC,KAAWD,EAAK,SAAS,SAAS,MACvCQ,IAAOE,EAAQX,GAAMC,EAAK,UAAU,EAAI;AAAA;AANxC;AAAA,EAQR;AACO,SAAAQ;AACX;AACkBb,EAAA,UAAAe;AASlB,SAASE,EAAUb,GAAMK,GAAO;AACrB,SAAAA,EAAM,KAAK,SAAUS,GAAS;AACzB,eAAGjB,EAAa,OAAOiB,CAAO,MACjCd,EAAKc,CAAO,KAAKD,EAAUb,GAAMc,EAAQ,QAAQ;AAAA,EAAA,CACzD;AACL;AACoBlB,EAAA,YAAAiB;AAWpB,SAASE,EAAQf,GAAMK,GAAO;AAIjB,WAHLC,IAAS,CAAA,GACTC,IAAY,CAACF,CAAK,GAClBG,IAAa,CAAC,CAAC,OACV;AACL,QAAIA,EAAW,CAAC,KAAKD,EAAU,CAAC,EAAE,QAAQ;AAClC,UAAAA,EAAU,WAAW;AACd,eAAAD;AAGX,MAAAC,EAAU,MAAM,GAChBC,EAAW,MAAM;AAEjB;AAAA,IACJ;AACA,QAAIC,IAAOF,EAAU,CAAC,EAAEC,EAAW,CAAC,GAAG;AACvC,QAASX,EAAa,OAAOY,CAAI,MAE7BT,EAAKS,CAAI,KACTH,EAAO,KAAKG,CAAI,GAChBA,EAAK,SAAS,SAAS,MACvBD,EAAW,QAAQ,CAAC,GACVD,EAAA,QAAQE,EAAK,QAAQ;AAAA,EAEvC;AACJ;AACAb,EAAA,UAAkBmB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es532.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}