@anoki/fse-ui 2.3.0-12-SNAPSHOT42 → 2.3.0-12-SNAPSHOT44

package/dist/index.es744.js

@@ -1,25 +1,62 @@
-import { __require as n } from "./index.es731.js";
-import { __require as a } from "./index.es738.js";
-var t, l;
-function f() {
-  if (l) return t;
-  l = 1;
-  let s = n(), o = a();
-  class e extends s {
-    get selectors() {
-      return o.comma(this.selector);
+import { __exports as e } from "./index.es775.js";
+var u;
+function O() {
+  if (u) return e;
+  u = 1, Object.defineProperty(e, "__esModule", { value: !0 }), e.removeElement = a, e.replaceElement = f, e.appendChild = o, e.append = x, e.prependChild = d, e.prepend = s;
+  function a(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);
     }
-    set selectors(r) {
-      let i = this.selector ? this.selector.match(/,\s*/) : null, u = i ? i[0] : "," + this.raw("between", "beforeOpen");
-      this.selector = r.join(u);
+    r.next = null, r.prev = null, r.parent = null;
+  }
+  function f(r, n) {
+    var p = n.prev = r.prev;
+    p && (p.next = n);
+    var t = n.next = r.next;
+    t && (t.prev = n);
+    var i = n.parent = r.parent;
+    if (i) {
+      var v = i.children;
+      v[v.lastIndexOf(r)] = n, r.parent = null;
     }
-    constructor(r) {
-      super(r), this.type = "rule", this.nodes || (this.nodes = []);
+  }
+  function o(r, n) {
+    if (a(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;
+  }
+  function x(r, n) {
+    a(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 i = p.children;
+        i.splice(i.lastIndexOf(t), 0, n);
+      }
+    } else p && p.children.push(n);
+  }
+  function d(r, n) {
+    if (a(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;
+  }
+  function s(r, n) {
+    a(n);
+    var p = r.parent;
+    if (p) {
+      var t = p.children;
+      t.splice(t.indexOf(r), 0, n);
     }
+    r.prev && (r.prev.next = n), n.parent = p, n.prev = r.prev, n.next = r, r.prev = n;
   }
-  return t = e, e.default = e, s.registerRule(e), t;
+  return e;
 }
 export {
-  f as __require
+  O as __require
 };
 //# sourceMappingURL=index.es744.js.map

package/dist/index.es744.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es744.js","sources":["../node_modules/postcss/lib/rule.js"],"sourcesContent":["'use strict'\n\nlet Container = require('./container')\nlet list = require('./list')\n\nclass Rule extends Container {\n  get selectors() {\n    return list.comma(this.selector)\n  }\n\n  set selectors(values) {\n    let match = this.selector ? this.selector.match(/,\\s*/) : null\n    let sep = match ? match[0] : ',' + this.raw('between', 'beforeOpen')\n    this.selector = values.join(sep)\n  }\n\n  constructor(defaults) {\n    super(defaults)\n    this.type = 'rule'\n    if (!this.nodes) this.nodes = []\n  }\n}\n\nmodule.exports = Rule\nRule.default = Rule\n\nContainer.registerRule(Rule)\n"],"names":["Container","require$$0","list","require$$1","Rule","values","match","sep","defaults","rule"],"mappings":";;;;;;AAEA,MAAIA,IAAYC,EAAA,GACZC,IAAOC,EAAA;AAAA,EAEX,MAAMC,UAAaJ,EAAU;AAAA,IAC3B,IAAI,YAAY;AACd,aAAOE,EAAK,MAAM,KAAK,QAAQ;AAAA,IACnC;AAAA,IAEE,IAAI,UAAUG,GAAQ;AACpB,UAAIC,IAAQ,KAAK,WAAW,KAAK,SAAS,MAAM,MAAM,IAAI,MACtDC,IAAMD,IAAQA,EAAM,CAAC,IAAI,MAAM,KAAK,IAAI,WAAW,YAAY;AACnE,WAAK,WAAWD,EAAO,KAAKE,CAAG;AAAA,IACnC;AAAA,IAEE,YAAYC,GAAU;AACpB,YAAMA,CAAQ,GACd,KAAK,OAAO,QACP,KAAK,UAAO,KAAK,QAAQ,CAAA;AAAA,IAClC;AAAA,EACA;AAEA,SAAAC,IAAiBL,GACjBA,EAAK,UAAUA,GAEfJ,EAAU,aAAaI,CAAI;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es744.js","sources":["../node_modules/domutils/lib/manipulation.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.removeElement = removeElement;\nexports.replaceElement = replaceElement;\nexports.appendChild = appendChild;\nexports.append = append;\nexports.prependChild = prependChild;\nexports.prepend = prepend;\n/**\n * Remove an element from the dom\n *\n * @category Manipulation\n * @param elem The element to be removed\n */\nfunction removeElement(elem) {\n    if (elem.prev)\n        elem.prev.next = elem.next;\n    if (elem.next)\n        elem.next.prev = elem.prev;\n    if (elem.parent) {\n        var childs = elem.parent.children;\n        var childsIndex = childs.lastIndexOf(elem);\n        if (childsIndex >= 0) {\n            childs.splice(childsIndex, 1);\n        }\n    }\n    elem.next = null;\n    elem.prev = null;\n    elem.parent = null;\n}\n/**\n * Replace an element in the dom\n *\n * @category Manipulation\n * @param elem The element to be replaced\n * @param replacement The element to be added\n */\nfunction replaceElement(elem, replacement) {\n    var prev = (replacement.prev = elem.prev);\n    if (prev) {\n        prev.next = replacement;\n    }\n    var next = (replacement.next = elem.next);\n    if (next) {\n        next.prev = replacement;\n    }\n    var parent = (replacement.parent = elem.parent);\n    if (parent) {\n        var childs = parent.children;\n        childs[childs.lastIndexOf(elem)] = replacement;\n        elem.parent = null;\n    }\n}\n/**\n * Append a child to an element.\n *\n * @category Manipulation\n * @param parent The element to append to.\n * @param child The element to be added as a child.\n */\nfunction appendChild(parent, child) {\n    removeElement(child);\n    child.next = null;\n    child.parent = parent;\n    if (parent.children.push(child) > 1) {\n        var sibling = parent.children[parent.children.length - 2];\n        sibling.next = child;\n        child.prev = sibling;\n    }\n    else {\n        child.prev = null;\n    }\n}\n/**\n * Append an element after another.\n *\n * @category Manipulation\n * @param elem The element to append after.\n * @param next The element be added.\n */\nfunction append(elem, next) {\n    removeElement(next);\n    var parent = elem.parent;\n    var currNext = elem.next;\n    next.next = currNext;\n    next.prev = elem;\n    elem.next = next;\n    next.parent = parent;\n    if (currNext) {\n        currNext.prev = next;\n        if (parent) {\n            var childs = parent.children;\n            childs.splice(childs.lastIndexOf(currNext), 0, next);\n        }\n    }\n    else if (parent) {\n        parent.children.push(next);\n    }\n}\n/**\n * Prepend a child to an element.\n *\n * @category Manipulation\n * @param parent The element to prepend before.\n * @param child The element to be added as a child.\n */\nfunction prependChild(parent, child) {\n    removeElement(child);\n    child.parent = parent;\n    child.prev = null;\n    if (parent.children.unshift(child) !== 1) {\n        var sibling = parent.children[1];\n        sibling.prev = child;\n        child.next = sibling;\n    }\n    else {\n        child.next = null;\n    }\n}\n/**\n * Prepend an element before another.\n *\n * @category Manipulation\n * @param elem The element to prepend before.\n * @param prev The element be added.\n */\nfunction prepend(elem, prev) {\n    removeElement(prev);\n    var parent = elem.parent;\n    if (parent) {\n        var childs = parent.children;\n        childs.splice(childs.indexOf(elem), 0, prev);\n    }\n    if (elem.prev) {\n        elem.prev.next = prev;\n    }\n    prev.parent = parent;\n    prev.prev = elem.prev;\n    prev.next = elem;\n    elem.prev = prev;\n}\n//# sourceMappingURL=manipulation.js.map"],"names":["manipulation","removeElement","replaceElement","appendChild","append","prependChild","prepend","elem","childs","childsIndex","replacement","prev","next","parent","child","sibling","currNext"],"mappings":";;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,gBAAwBC,GACxBD,EAAA,iBAAyBE,GACzBF,EAAA,cAAsBG,GACtBH,EAAA,SAAiBI,GACjBJ,EAAA,eAAuBK,GACvBL,EAAA,UAAkBM;AAOlB,WAASL,EAAcM,GAAM;AAKzB,QAJIA,EAAK,SACLA,EAAK,KAAK,OAAOA,EAAK,OACtBA,EAAK,SACLA,EAAK,KAAK,OAAOA,EAAK,OACtBA,EAAK,QAAQ;AACb,UAAIC,IAASD,EAAK,OAAO,UACrBE,IAAcD,EAAO,YAAYD,CAAI;AACzC,MAAIE,KAAe,KACfD,EAAO,OAAOC,GAAa,CAAC;AAAA,IAExC;AACI,IAAAF,EAAK,OAAO,MACZA,EAAK,OAAO,MACZA,EAAK,SAAS;AAAA,EAClB;AAQA,WAASL,EAAeK,GAAMG,GAAa;AACvC,QAAIC,IAAQD,EAAY,OAAOH,EAAK;AACpC,IAAII,MACAA,EAAK,OAAOD;AAEhB,QAAIE,IAAQF,EAAY,OAAOH,EAAK;AACpC,IAAIK,MACAA,EAAK,OAAOF;AAEhB,QAAIG,IAAUH,EAAY,SAASH,EAAK;AACxC,QAAIM,GAAQ;AACR,UAAIL,IAASK,EAAO;AACpB,MAAAL,EAAOA,EAAO,YAAYD,CAAI,CAAC,IAAIG,GACnCH,EAAK,SAAS;AAAA,IACtB;AAAA,EACA;AAQA,WAASJ,EAAYU,GAAQC,GAAO;AAIhC,QAHAb,EAAca,CAAK,GACnBA,EAAM,OAAO,MACbA,EAAM,SAASD,GACXA,EAAO,SAAS,KAAKC,CAAK,IAAI,GAAG;AACjC,UAAIC,IAAUF,EAAO,SAASA,EAAO,SAAS,SAAS,CAAC;AACxD,MAAAE,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,IACrB;AAEQ,MAAAD,EAAM,OAAO;AAAA,EAErB;AAQA,WAASV,EAAOG,GAAMK,GAAM;AACxB,IAAAX,EAAcW,CAAI;AAClB,QAAIC,IAASN,EAAK,QACdS,IAAWT,EAAK;AAKpB,QAJAK,EAAK,OAAOI,GACZJ,EAAK,OAAOL,GACZA,EAAK,OAAOK,GACZA,EAAK,SAASC,GACVG;AAEA,UADAA,EAAS,OAAOJ,GACZC,GAAQ;AACR,YAAIL,IAASK,EAAO;AACpB,QAAAL,EAAO,OAAOA,EAAO,YAAYQ,CAAQ,GAAG,GAAGJ,CAAI;AAAA,MAC/D;AAAA,UAES,CAAIC,KACLA,EAAO,SAAS,KAAKD,CAAI;AAAA,EAEjC;AAQA,WAASP,EAAaQ,GAAQC,GAAO;AAIjC,QAHAb,EAAca,CAAK,GACnBA,EAAM,SAASD,GACfC,EAAM,OAAO,MACTD,EAAO,SAAS,QAAQC,CAAK,MAAM,GAAG;AACtC,UAAIC,IAAUF,EAAO,SAAS,CAAC;AAC/B,MAAAE,EAAQ,OAAOD,GACfA,EAAM,OAAOC;AAAA,IACrB;AAEQ,MAAAD,EAAM,OAAO;AAAA,EAErB;AAQA,WAASR,EAAQC,GAAMI,GAAM;AACzB,IAAAV,EAAcU,CAAI;AAClB,QAAIE,IAASN,EAAK;AAClB,QAAIM,GAAQ;AACR,UAAIL,IAASK,EAAO;AACpB,MAAAL,EAAO,OAAOA,EAAO,QAAQD,CAAI,GAAG,GAAGI,CAAI;AAAA,IACnD;AACI,IAAIJ,EAAK,SACLA,EAAK,KAAK,OAAOI,IAErBA,EAAK,SAASE,GACdF,EAAK,OAAOJ,EAAK,MACjBI,EAAK,OAAOJ,GACZA,EAAK,OAAOI;AAAA,EAChB;;;","x_google_ignoreList":[0]}

package/dist/index.es745.js

@@ -1,15 +1,64 @@
-import { __require as u } from "./index.es768.js";
-var i, e;
-function a() {
-  if (e) return i;
-  e = 1;
-  let t = u();
-  function r(n, f) {
-    new t(f).stringify(n);
-  }
-  return i = r, r.default = r, i;
+import { __exports as u } from "./index.es776.js";
+import { __require as o } from "./index.es693.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;
 }
 export {
-  a as __require
+  O as __require
 };
 //# sourceMappingURL=index.es745.js.map

package/dist/index.es745.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es745.js","sources":["../node_modules/postcss/lib/stringify.js"],"sourcesContent":["'use strict'\n\nlet Stringifier = require('./stringifier')\n\nfunction stringify(node, builder) {\n  let str = new Stringifier(builder)\n  str.stringify(node)\n}\n\nmodule.exports = stringify\nstringify.default = stringify\n"],"names":["Stringifier","require$$0","stringify","node","builder","stringify_1"],"mappings":";;;;;AAEA,MAAIA,IAAcC,EAAA;AAElB,WAASC,EAAUC,GAAMC,GAAS;AAEhC,IADU,IAAIJ,EAAYI,CAAO,EAC7B,UAAUD,CAAI;AAAA,EACpB;AAEA,SAAAE,IAAiBH,GACjBA,EAAU,UAAUA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es745.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]}

package/dist/index.es746.js

@@ -1,24 +1,74 @@
-var t, r;
+import { __exports as i } from "./index.es777.js";
+import { __require as m } from "./index.es693.js";
+import { __require as E } from "./index.es745.js";
+var g;
 function h() {
-  if (r) return t;
-  r = 1;
-  class e {
-    constructor(s, i = {}) {
-      if (this.type = "warning", this.text = s, i.node && i.node.source) {
-        let n = i.node.rangeBy(i);
-        this.line = n.start.line, this.column = n.start.column, this.endLine = n.end.line, this.endColumn = n.end.column;
-      }
-      for (let n in i) this[n] = i[n];
-    }
-    toString() {
-      return this.node ? this.node.error(this.text, {
-        index: this.index,
-        plugin: this.plugin,
-        word: this.word
-      }).message : this.plugin ? this.plugin + ": " + this.text : this.text;
+  if (g) return i;
+  g = 1, Object.defineProperty(i, "__esModule", { value: !0 }), i.testElement = p, i.getElements = _, i.getElementById = v, i.getElementsByTagName = d, i.getElementsByClassName = l, i.getElementsByTagType = T;
+  var u = /* @__PURE__ */ m(), f = /* @__PURE__ */ E(), o = {
+    tag_name: function(e) {
+      return typeof e == "function" ? function(t) {
+        return (0, u.isTag)(t) && e(t.name);
+      } : e === "*" ? u.isTag : function(t) {
+        return (0, u.isTag)(t) && t.name === e;
+      };
+    },
+    tag_type: function(e) {
+      return typeof e == "function" ? function(t) {
+        return e(t.type);
+      } : function(t) {
+        return t.type === e;
+      };
+    },
+    tag_contains: function(e) {
+      return typeof e == "function" ? function(t) {
+        return (0, u.isText)(t) && e(t.data);
+      } : function(t) {
+        return (0, u.isText)(t) && t.data === e;
+      };
     }
+  };
+  function a(e, t) {
+    return typeof t == "function" ? function(n) {
+      return (0, u.isTag)(n) && t(n.attribs[e]);
+    } : function(n) {
+      return (0, u.isTag)(n) && n.attribs[e] === t;
+    };
+  }
+  function y(e, t) {
+    return function(n) {
+      return e(n) || t(n);
+    };
+  }
+  function c(e) {
+    var t = Object.keys(e).map(function(n) {
+      var r = e[n];
+      return Object.prototype.hasOwnProperty.call(o, n) ? o[n](r) : a(n, r);
+    });
+    return t.length === 0 ? null : t.reduce(y);
+  }
+  function p(e, t) {
+    var n = c(e);
+    return n ? n(t) : !0;
+  }
+  function _(e, t, n, r) {
+    r === void 0 && (r = 1 / 0);
+    var s = c(e);
+    return s ? (0, f.filter)(s, t, n, r) : [];
+  }
+  function v(e, t, n) {
+    return n === void 0 && (n = !0), Array.isArray(t) || (t = [t]), (0, f.findOne)(a("id", e), t, n);
+  }
+  function d(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_name(e), t, n, r);
+  }
+  function l(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(a("class", e), t, n, r);
+  }
+  function T(e, t, n, r) {
+    return n === void 0 && (n = !0), r === void 0 && (r = 1 / 0), (0, f.filter)(o.tag_type(e), t, n, r);
   }
-  return t = e, e.default = e, t;
+  return i;
 }
 export {
   h as __require

package/dist/index.es746.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es746.js","sources":["../node_modules/postcss/lib/warning.js"],"sourcesContent":["'use strict'\n\nclass Warning {\n  constructor(text, opts = {}) {\n    this.type = 'warning'\n    this.text = text\n\n    if (opts.node && opts.node.source) {\n      let range = opts.node.rangeBy(opts)\n      this.line = range.start.line\n      this.column = range.start.column\n      this.endLine = range.end.line\n      this.endColumn = range.end.column\n    }\n\n    for (let opt in opts) this[opt] = opts[opt]\n  }\n\n  toString() {\n    if (this.node) {\n      return this.node.error(this.text, {\n        index: this.index,\n        plugin: this.plugin,\n        word: this.word\n      }).message\n    }\n\n    if (this.plugin) {\n      return this.plugin + ': ' + this.text\n    }\n\n    return this.text\n  }\n}\n\nmodule.exports = Warning\nWarning.default = Warning\n"],"names":["Warning","text","opts","range","opt","warning"],"mappings":";;;;EAEA,MAAMA,EAAQ;AAAA,IACZ,YAAYC,GAAMC,IAAO,IAAI;AAI3B,UAHA,KAAK,OAAO,WACZ,KAAK,OAAOD,GAERC,EAAK,QAAQA,EAAK,KAAK,QAAQ;AACjC,YAAIC,IAAQD,EAAK,KAAK,QAAQA,CAAI;AAClC,aAAK,OAAOC,EAAM,MAAM,MACxB,KAAK,SAASA,EAAM,MAAM,QAC1B,KAAK,UAAUA,EAAM,IAAI,MACzB,KAAK,YAAYA,EAAM,IAAI;AAAA,MACjC;AAEI,eAASC,KAAOF,EAAM,MAAKE,CAAG,IAAIF,EAAKE,CAAG;AAAA,IAC9C;AAAA,IAEE,WAAW;AACT,aAAI,KAAK,OACA,KAAK,KAAK,MAAM,KAAK,MAAM;AAAA,QAChC,OAAO,KAAK;AAAA,QACZ,QAAQ,KAAK;AAAA,QACb,MAAM,KAAK;AAAA,MACnB,CAAO,EAAE,UAGD,KAAK,SACA,KAAK,SAAS,OAAO,KAAK,OAG5B,KAAK;AAAA,IAChB;AAAA,EACA;AAEA,SAAAC,IAAiBL,GACjBA,EAAQ,UAAUA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es746.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]}

package/dist/index.es747.js

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

package/dist/index.es747.js.map

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