@anoki/fse-ui 2.2.0-RC2 → 2.2.0-RC3

package/dist/index.es680.js

@@ -0,0 +1,64 @@
+import { __exports as u } from "./index.es716.js";
+import { __require as o } from "./index.es641.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 {
+  O as __require
+};
+//# sourceMappingURL=index.es680.js.map

package/dist/index.es680.js.map

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

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

package/dist/index.es681.js.map

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

@@ -0,0 +1,55 @@
+import { __exports as N } from "./index.es718.js";
+import { __require as S } from "./index.es641.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 {
+  b as __require
+};
+//# sourceMappingURL=index.es682.js.map

package/dist/index.es682.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es682.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]}

package/dist/index.es683.js

@@ -0,0 +1,93 @@
+import { __exports as p } from "./index.es719.js";
+import { __require as B } from "./index.es677.js";
+import { __require as w } from "./index.es681.js";
+var b;
+function C() {
+  if (b) return p;
+  b = 1, Object.defineProperty(p, "__esModule", { value: !0 }), p.getFeed = _;
+  var D = /* @__PURE__ */ B(), m = /* @__PURE__ */ w();
+  function _(r) {
+    var t = v(x, r);
+    return t ? t.name === "feed" ? k(t) : E(t) : null;
+  }
+  function k(r) {
+    var t, e = r.children, i = {
+      type: "atom",
+      items: (0, m.getElementsByTagName)("entry", e).map(function(s) {
+        var d, a = s.children, o = { media: c(a) };
+        l(o, "id", "id", a), l(o, "title", "title", a);
+        var g = (d = v("link", a)) === null || d === void 0 ? void 0 : d.attribs.href;
+        g && (o.link = g);
+        var h = f("summary", a) || f("content", a);
+        h && (o.description = h);
+        var y = f("updated", a);
+        return y && (o.pubDate = new Date(y)), o;
+      })
+    };
+    l(i, "id", "id", e), l(i, "title", "title", e);
+    var n = (t = v("link", e)) === null || t === void 0 ? void 0 : t.attribs.href;
+    n && (i.link = n), l(i, "description", "subtitle", e);
+    var u = f("updated", e);
+    return u && (i.updated = new Date(u)), l(i, "author", "email", e, !0), i;
+  }
+  function E(r) {
+    var t, e, i = (e = (t = v("channel", r.children)) === null || t === void 0 ? void 0 : t.children) !== null && e !== void 0 ? e : [], n = {
+      type: r.name.substr(0, 3),
+      id: "",
+      items: (0, m.getElementsByTagName)("item", r.children).map(function(s) {
+        var d = s.children, a = { media: c(d) };
+        l(a, "id", "guid", d), l(a, "title", "title", d), l(a, "link", "link", d), l(a, "description", "description", d);
+        var o = f("pubDate", d) || f("dc:date", d);
+        return o && (a.pubDate = new Date(o)), a;
+      })
+    };
+    l(n, "title", "title", i), l(n, "link", "link", i), l(n, "description", "description", i);
+    var u = f("lastBuildDate", i);
+    return u && (n.updated = new Date(u)), l(n, "author", "managingEditor", i, !0), n;
+  }
+  var F = ["url", "type", "lang"], q = [
+    "fileSize",
+    "bitrate",
+    "framerate",
+    "samplingrate",
+    "channels",
+    "duration",
+    "height",
+    "width"
+  ];
+  function c(r) {
+    return (0, m.getElementsByTagName)("media:content", r).map(function(t) {
+      for (var e = t.attribs, i = {
+        medium: e.medium,
+        isDefault: !!e.isDefault
+      }, n = 0, u = F; n < u.length; n++) {
+        var s = u[n];
+        e[s] && (i[s] = e[s]);
+      }
+      for (var d = 0, a = q; d < a.length; d++) {
+        var s = a[d];
+        e[s] && (i[s] = parseInt(e[s], 10));
+      }
+      return e.expression && (i.expression = e.expression), i;
+    });
+  }
+  function v(r, t) {
+    return (0, m.getElementsByTagName)(r, t, !0, 1)[0];
+  }
+  function f(r, t, e) {
+    return e === void 0 && (e = !1), (0, D.textContent)((0, m.getElementsByTagName)(r, t, e, 1)).trim();
+  }
+  function l(r, t, e, i, n) {
+    n === void 0 && (n = !1);
+    var u = f(e, i, n);
+    u && (r[t] = u);
+  }
+  function x(r) {
+    return r === "rss" || r === "feed" || r === "rdf:RDF";
+  }
+  return p;
+}
+export {
+  C as __require
+};
+//# sourceMappingURL=index.es683.js.map

package/dist/index.es683.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es683.js","sources":["../node_modules/domutils/lib/feeds.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getFeed = getFeed;\nvar stringify_js_1 = require(\"./stringify.js\");\nvar legacy_js_1 = require(\"./legacy.js\");\n/**\n * Get the feed object from the root of a DOM tree.\n *\n * @category Feeds\n * @param doc - The DOM to to extract the feed from.\n * @returns The feed.\n */\nfunction getFeed(doc) {\n    var feedRoot = getOneElement(isValidFeed, doc);\n    return !feedRoot\n        ? null\n        : feedRoot.name === \"feed\"\n            ? getAtomFeed(feedRoot)\n            : getRssFeed(feedRoot);\n}\n/**\n * Parse an Atom feed.\n *\n * @param feedRoot The root of the feed.\n * @returns The parsed feed.\n */\nfunction getAtomFeed(feedRoot) {\n    var _a;\n    var childs = feedRoot.children;\n    var feed = {\n        type: \"atom\",\n        items: (0, legacy_js_1.getElementsByTagName)(\"entry\", childs).map(function (item) {\n            var _a;\n            var children = item.children;\n            var entry = { media: getMediaElements(children) };\n            addConditionally(entry, \"id\", \"id\", children);\n            addConditionally(entry, \"title\", \"title\", children);\n            var href = (_a = getOneElement(\"link\", children)) === null || _a === void 0 ? void 0 : _a.attribs[\"href\"];\n            if (href) {\n                entry.link = href;\n            }\n            var description = fetch(\"summary\", children) || fetch(\"content\", children);\n            if (description) {\n                entry.description = description;\n            }\n            var pubDate = fetch(\"updated\", children);\n            if (pubDate) {\n                entry.pubDate = new Date(pubDate);\n            }\n            return entry;\n        }),\n    };\n    addConditionally(feed, \"id\", \"id\", childs);\n    addConditionally(feed, \"title\", \"title\", childs);\n    var href = (_a = getOneElement(\"link\", childs)) === null || _a === void 0 ? void 0 : _a.attribs[\"href\"];\n    if (href) {\n        feed.link = href;\n    }\n    addConditionally(feed, \"description\", \"subtitle\", childs);\n    var updated = fetch(\"updated\", childs);\n    if (updated) {\n        feed.updated = new Date(updated);\n    }\n    addConditionally(feed, \"author\", \"email\", childs, true);\n    return feed;\n}\n/**\n * Parse a RSS feed.\n *\n * @param feedRoot The root of the feed.\n * @returns The parsed feed.\n */\nfunction getRssFeed(feedRoot) {\n    var _a, _b;\n    var childs = (_b = (_a = getOneElement(\"channel\", feedRoot.children)) === null || _a === void 0 ? void 0 : _a.children) !== null && _b !== void 0 ? _b : [];\n    var feed = {\n        type: feedRoot.name.substr(0, 3),\n        id: \"\",\n        items: (0, legacy_js_1.getElementsByTagName)(\"item\", feedRoot.children).map(function (item) {\n            var children = item.children;\n            var entry = { media: getMediaElements(children) };\n            addConditionally(entry, \"id\", \"guid\", children);\n            addConditionally(entry, \"title\", \"title\", children);\n            addConditionally(entry, \"link\", \"link\", children);\n            addConditionally(entry, \"description\", \"description\", children);\n            var pubDate = fetch(\"pubDate\", children) || fetch(\"dc:date\", children);\n            if (pubDate)\n                entry.pubDate = new Date(pubDate);\n            return entry;\n        }),\n    };\n    addConditionally(feed, \"title\", \"title\", childs);\n    addConditionally(feed, \"link\", \"link\", childs);\n    addConditionally(feed, \"description\", \"description\", childs);\n    var updated = fetch(\"lastBuildDate\", childs);\n    if (updated) {\n        feed.updated = new Date(updated);\n    }\n    addConditionally(feed, \"author\", \"managingEditor\", childs, true);\n    return feed;\n}\nvar MEDIA_KEYS_STRING = [\"url\", \"type\", \"lang\"];\nvar MEDIA_KEYS_INT = [\n    \"fileSize\",\n    \"bitrate\",\n    \"framerate\",\n    \"samplingrate\",\n    \"channels\",\n    \"duration\",\n    \"height\",\n    \"width\",\n];\n/**\n * Get all media elements of a feed item.\n *\n * @param where Nodes to search in.\n * @returns Media elements.\n */\nfunction getMediaElements(where) {\n    return (0, legacy_js_1.getElementsByTagName)(\"media:content\", where).map(function (elem) {\n        var attribs = elem.attribs;\n        var media = {\n            medium: attribs[\"medium\"],\n            isDefault: !!attribs[\"isDefault\"],\n        };\n        for (var _i = 0, MEDIA_KEYS_STRING_1 = MEDIA_KEYS_STRING; _i < MEDIA_KEYS_STRING_1.length; _i++) {\n            var attrib = MEDIA_KEYS_STRING_1[_i];\n            if (attribs[attrib]) {\n                media[attrib] = attribs[attrib];\n            }\n        }\n        for (var _a = 0, MEDIA_KEYS_INT_1 = MEDIA_KEYS_INT; _a < MEDIA_KEYS_INT_1.length; _a++) {\n            var attrib = MEDIA_KEYS_INT_1[_a];\n            if (attribs[attrib]) {\n                media[attrib] = parseInt(attribs[attrib], 10);\n            }\n        }\n        if (attribs[\"expression\"]) {\n            media.expression = attribs[\"expression\"];\n        }\n        return media;\n    });\n}\n/**\n * Get one element by tag name.\n *\n * @param tagName Tag name to look for\n * @param node Node to search in\n * @returns The element or null\n */\nfunction getOneElement(tagName, node) {\n    return (0, legacy_js_1.getElementsByTagName)(tagName, node, true, 1)[0];\n}\n/**\n * Get the text content of an element with a certain tag name.\n *\n * @param tagName Tag name to look for.\n * @param where Node to search in.\n * @param recurse Whether to recurse into child nodes.\n * @returns The text content of the element.\n */\nfunction fetch(tagName, where, recurse) {\n    if (recurse === void 0) { recurse = false; }\n    return (0, stringify_js_1.textContent)((0, legacy_js_1.getElementsByTagName)(tagName, where, recurse, 1)).trim();\n}\n/**\n * Adds a property to an object if it has a value.\n *\n * @param obj Object to be extended\n * @param prop Property name\n * @param tagName Tag name that contains the conditionally added property\n * @param where Element to search for the property\n * @param recurse Whether to recurse into child nodes.\n */\nfunction addConditionally(obj, prop, tagName, where, recurse) {\n    if (recurse === void 0) { recurse = false; }\n    var val = fetch(tagName, where, recurse);\n    if (val)\n        obj[prop] = val;\n}\n/**\n * Checks if an element is a feed root node.\n *\n * @param value The name of the element to check.\n * @returns Whether an element is a feed root node.\n */\nfunction isValidFeed(value) {\n    return value === \"rss\" || value === \"feed\" || value === \"rdf:RDF\";\n}\n//# sourceMappingURL=feeds.js.map"],"names":["feeds","getFeed","stringify_js_1","require$$0","legacy_js_1","require$$1","doc","feedRoot","getOneElement","isValidFeed","getAtomFeed","getRssFeed","_a","childs","feed","item","children","entry","getMediaElements","addConditionally","href","description","fetch","pubDate","updated","_b","MEDIA_KEYS_STRING","MEDIA_KEYS_INT","where","elem","attribs","media","_i","MEDIA_KEYS_STRING_1","attrib","MEDIA_KEYS_INT_1","tagName","node","recurse","obj","prop","val","value"],"mappings":";;;;;;SACA,OAAO,eAAeA,GAAS,cAAc,EAAE,OAAO,IAAM,GAC5DA,EAAA,UAAkBC;AAClB,MAAIC,IAAiBC,gBAAAA,EAAA,GACjBC,IAAcC,gBAAAA,EAAA;AAQlB,WAASJ,EAAQK,GAAK;AAClB,QAAIC,IAAWC,EAAcC,GAAaH,CAAG;AAC7C,WAAQC,IAEFA,EAAS,SAAS,SACdG,EAAYH,CAAQ,IACpBI,EAAWJ,CAAQ,IAHvB;AAAA,EAIV;AAOA,WAASG,EAAYH,GAAU;AAC3B,QAAIK,GACAC,IAASN,EAAS,UAClBO,IAAO;AAAA,MACP,MAAM;AAAA,MACN,WAAWV,EAAY,sBAAsB,SAASS,CAAM,EAAE,IAAI,SAAUE,GAAM;AAC9E,YAAIH,GACAI,IAAWD,EAAK,UAChBE,IAAQ,EAAE,OAAOC,EAAiBF,CAAQ,EAAC;AAC/C,QAAAG,EAAiBF,GAAO,MAAM,MAAMD,CAAQ,GAC5CG,EAAiBF,GAAO,SAAS,SAASD,CAAQ;AAClD,YAAII,KAAQR,IAAKJ,EAAc,QAAQQ,CAAQ,OAAO,QAAQJ,MAAO,SAAS,SAASA,EAAG,QAAQ;AAClG,QAAIQ,MACAH,EAAM,OAAOG;AAEjB,YAAIC,IAAcC,EAAM,WAAWN,CAAQ,KAAKM,EAAM,WAAWN,CAAQ;AACzE,QAAIK,MACAJ,EAAM,cAAcI;AAExB,YAAIE,IAAUD,EAAM,WAAWN,CAAQ;AACvC,eAAIO,MACAN,EAAM,UAAU,IAAI,KAAKM,CAAO,IAE7BN;AAAA,MACnB,CAAS;AAAA;AAEL,IAAAE,EAAiBL,GAAM,MAAM,MAAMD,CAAM,GACzCM,EAAiBL,GAAM,SAAS,SAASD,CAAM;AAC/C,QAAIO,KAAQR,IAAKJ,EAAc,QAAQK,CAAM,OAAO,QAAQD,MAAO,SAAS,SAASA,EAAG,QAAQ;AAChG,IAAIQ,MACAN,EAAK,OAAOM,IAEhBD,EAAiBL,GAAM,eAAe,YAAYD,CAAM;AACxD,QAAIW,IAAUF,EAAM,WAAWT,CAAM;AACrC,WAAIW,MACAV,EAAK,UAAU,IAAI,KAAKU,CAAO,IAEnCL,EAAiBL,GAAM,UAAU,SAASD,GAAQ,EAAI,GAC/CC;AAAA,EACX;AAOA,WAASH,EAAWJ,GAAU;AAC1B,QAAIK,GAAIa,GACJZ,KAAUY,KAAMb,IAAKJ,EAAc,WAAWD,EAAS,QAAQ,OAAO,QAAQK,MAAO,SAAS,SAASA,EAAG,cAAc,QAAQa,MAAO,SAASA,IAAK,CAAA,GACrJX,IAAO;AAAA,MACP,MAAMP,EAAS,KAAK,OAAO,GAAG,CAAC;AAAA,MAC/B,IAAI;AAAA,MACJ,WAAWH,EAAY,sBAAsB,QAAQG,EAAS,QAAQ,EAAE,IAAI,SAAUQ,GAAM;AACxF,YAAIC,IAAWD,EAAK,UAChBE,IAAQ,EAAE,OAAOC,EAAiBF,CAAQ,EAAC;AAC/C,QAAAG,EAAiBF,GAAO,MAAM,QAAQD,CAAQ,GAC9CG,EAAiBF,GAAO,SAAS,SAASD,CAAQ,GAClDG,EAAiBF,GAAO,QAAQ,QAAQD,CAAQ,GAChDG,EAAiBF,GAAO,eAAe,eAAeD,CAAQ;AAC9D,YAAIO,IAAUD,EAAM,WAAWN,CAAQ,KAAKM,EAAM,WAAWN,CAAQ;AACrE,eAAIO,MACAN,EAAM,UAAU,IAAI,KAAKM,CAAO,IAC7BN;AAAA,MACnB,CAAS;AAAA;AAEL,IAAAE,EAAiBL,GAAM,SAAS,SAASD,CAAM,GAC/CM,EAAiBL,GAAM,QAAQ,QAAQD,CAAM,GAC7CM,EAAiBL,GAAM,eAAe,eAAeD,CAAM;AAC3D,QAAIW,IAAUF,EAAM,iBAAiBT,CAAM;AAC3C,WAAIW,MACAV,EAAK,UAAU,IAAI,KAAKU,CAAO,IAEnCL,EAAiBL,GAAM,UAAU,kBAAkBD,GAAQ,EAAI,GACxDC;AAAA,EACX;AACA,MAAIY,IAAoB,CAAC,OAAO,QAAQ,MAAM,GAC1CC,IAAiB;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAQJ,WAAST,EAAiBU,GAAO;AAC7B,eAAWxB,EAAY,sBAAsB,iBAAiBwB,CAAK,EAAE,IAAI,SAAUC,GAAM;AAMrF,eALIC,IAAUD,EAAK,SACfE,IAAQ;AAAA,QACR,QAAQD,EAAQ;AAAA,QAChB,WAAW,CAAC,CAACA,EAAQ;AAAA,SAEhBE,IAAK,GAAGC,IAAsBP,GAAmBM,IAAKC,EAAoB,QAAQD,KAAM;AAC7F,YAAIE,IAASD,EAAoBD,CAAE;AACnC,QAAIF,EAAQI,CAAM,MACdH,EAAMG,CAAM,IAAIJ,EAAQI,CAAM;AAAA,MAE9C;AACQ,eAAStB,IAAK,GAAGuB,IAAmBR,GAAgBf,IAAKuB,EAAiB,QAAQvB,KAAM;AACpF,YAAIsB,IAASC,EAAiBvB,CAAE;AAChC,QAAIkB,EAAQI,CAAM,MACdH,EAAMG,CAAM,IAAI,SAASJ,EAAQI,CAAM,GAAG,EAAE;AAAA,MAE5D;AACQ,aAAIJ,EAAQ,eACRC,EAAM,aAAaD,EAAQ,aAExBC;AAAA,IACf,CAAK;AAAA,EACL;AAQA,WAASvB,EAAc4B,GAASC,GAAM;AAClC,eAAWjC,EAAY,sBAAsBgC,GAASC,GAAM,IAAM,CAAC,EAAE,CAAC;AAAA,EAC1E;AASA,WAASf,EAAMc,GAASR,GAAOU,GAAS;AACpC,WAAIA,MAAY,WAAUA,IAAU,SACzBpC,EAAe,iBAAiBE,EAAY,sBAAsBgC,GAASR,GAAOU,GAAS,CAAC,CAAC,EAAE,KAAI;AAAA,EAClH;AAUA,WAASnB,EAAiBoB,GAAKC,GAAMJ,GAASR,GAAOU,GAAS;AAC1D,IAAIA,MAAY,WAAUA,IAAU;AACpC,QAAIG,IAAMnB,EAAMc,GAASR,GAAOU,CAAO;AACvC,IAAIG,MACAF,EAAIC,CAAI,IAAIC;AAAA,EACpB;AAOA,WAAShC,EAAYiC,GAAO;AACxB,WAAOA,MAAU,SAASA,MAAU,UAAUA,MAAU;AAAA,EAC5D;;;","x_google_ignoreList":[0]}

package/dist/index.es684.js

@@ -0,0 +1,9 @@
+import { __exports as r } from "./index.es724.js";
+var e;
+function s() {
+  return e ? r : (e = 1, r.isClean = Symbol("isClean"), r.my = Symbol("my"), r);
+}
+export {
+  s as __require
+};
+//# sourceMappingURL=index.es684.js.map

package/dist/index.es684.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es684.js","sources":["../node_modules/postcss/lib/symbols.js"],"sourcesContent":["'use strict'\n\nmodule.exports.isClean = Symbol('isClean')\n\nmodule.exports.my = Symbol('my')\n"],"names":["symbols"],"mappings":";;;yBAEAA,EAAA,UAAyB,OAAO,SAAS,GAEzCA,EAAA,KAAoB,OAAO,IAAI;;","x_google_ignoreList":[0]}

package/dist/index.es685.js

@@ -0,0 +1,14 @@
+import { __module as e } from "./index.es727.js";
+var g;
+function o() {
+  if (g) return e.exports;
+  g = 1;
+  var r = String, t = function() {
+    return { isColorSupported: !1, reset: r, bold: r, dim: r, italic: r, underline: r, inverse: r, hidden: r, strikethrough: r, black: r, red: r, green: r, yellow: r, blue: r, magenta: r, cyan: r, white: r, gray: r, bgBlack: r, bgRed: r, bgGreen: r, bgYellow: r, bgBlue: r, bgMagenta: r, bgCyan: r, bgWhite: r, blackBright: r, redBright: r, greenBright: r, yellowBright: r, blueBright: r, magentaBright: r, cyanBright: r, whiteBright: r, bgBlackBright: r, bgRedBright: r, bgGreenBright: r, bgYellowBright: r, bgBlueBright: r, bgMagentaBright: r, bgCyanBright: r, bgWhiteBright: r };
+  };
+  return e.exports = t(), e.exports.createColors = t, e.exports;
+}
+export {
+  o as __require
+};
+//# sourceMappingURL=index.es685.js.map

package/dist/index.es685.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es685.js","sources":["../node_modules/picocolors/picocolors.browser.js"],"sourcesContent":["var x=String;\nvar create=function() {return {isColorSupported:false,reset:x,bold:x,dim:x,italic:x,underline:x,inverse:x,hidden:x,strikethrough:x,black:x,red:x,green:x,yellow:x,blue:x,magenta:x,cyan:x,white:x,gray:x,bgBlack:x,bgRed:x,bgGreen:x,bgYellow:x,bgBlue:x,bgMagenta:x,bgCyan:x,bgWhite:x,blackBright:x,redBright:x,greenBright:x,yellowBright:x,blueBright:x,magentaBright:x,cyanBright:x,whiteBright:x,bgBlackBright:x,bgRedBright:x,bgGreenBright:x,bgYellowBright:x,bgBlueBright:x,bgMagentaBright:x,bgCyanBright:x,bgWhiteBright:x}};\nmodule.exports=create();\nmodule.exports.createColors = create;\n"],"names":["x","create","picocolors_browserModule"],"mappings":";;;;;AAAA,MAAIA,IAAE,QACFC,IAAO,WAAW;AAAC,WAAO,EAAC,kBAAiB,IAAM,OAAMD,GAAE,MAAKA,GAAE,KAAIA,GAAE,QAAOA,GAAE,WAAUA,GAAE,SAAQA,GAAE,QAAOA,GAAE,eAAcA,GAAE,OAAMA,GAAE,KAAIA,GAAE,OAAMA,GAAE,QAAOA,GAAE,MAAKA,GAAE,SAAQA,GAAE,MAAKA,GAAE,OAAMA,GAAE,MAAKA,GAAE,SAAQA,GAAE,OAAMA,GAAE,SAAQA,GAAE,UAASA,GAAE,QAAOA,GAAE,WAAUA,GAAE,QAAOA,GAAE,SAAQA,GAAE,aAAYA,GAAE,WAAUA,GAAE,aAAYA,GAAE,cAAaA,GAAE,YAAWA,GAAE,eAAcA,GAAE,YAAWA,GAAE,aAAYA,GAAE,eAAcA,GAAE,aAAYA,GAAE,eAAcA,GAAE,gBAAeA,GAAE,cAAaA,GAAE,iBAAgBA,GAAE,cAAaA,GAAE,eAAcA,EAAC;AAAA,EAAC;AACtgBE,SAAAA,EAAA,UAAeD,EAAM,GACrBC,EAAA,QAAA,eAA8BD;;","x_google_ignoreList":[0]}

package/dist/index.es686.js

@@ -0,0 +1,7 @@
+import * as e from "./index.es725.js";
+import { getAugmentedNamespace as r } from "./index.es452.js";
+const o = /* @__PURE__ */ r(e);
+export {
+  o as default
+};
+//# sourceMappingURL=index.es686.js.map

package/dist/index.es686.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es686.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;"}

package/dist/index.es687.js

@@ -0,0 +1,93 @@
+import s from "./index.es686.js";
+var u, m;
+function w() {
+  if (m) return u;
+  m = 1;
+  let { existsSync: p, readFileSync: d } = s, { dirname: r, join: g } = s, { SourceMapConsumer: l, SourceMapGenerator: f } = s;
+  function M(o) {
+    return Buffer ? Buffer.from(o, "base64").toString() : window.atob(o);
+  }
+  class a {
+    constructor(t, e) {
+      if (e.map === !1) return;
+      this.loadAnnotation(t), this.inline = this.startWith(this.annotation, "data:");
+      let i = e.map ? e.map.prev : void 0, n = this.loadMap(e.from, i);
+      !this.mapFile && e.from && (this.mapFile = e.from), this.mapFile && (this.root = r(this.mapFile)), n && (this.text = n);
+    }
+    consumer() {
+      return this.consumerCache || (this.consumerCache = new l(this.text)), this.consumerCache;
+    }
+    decodeInline(t) {
+      let e = /^data:application\/json;charset=utf-?8;base64,/, i = /^data:application\/json;base64,/, n = /^data:application\/json;charset=utf-?8,/, b = /^data:application\/json,/, h = t.match(n) || t.match(b);
+      if (h)
+        return decodeURIComponent(t.substr(h[0].length));
+      let c = t.match(e) || t.match(i);
+      if (c)
+        return M(t.substr(c[0].length));
+      let S = t.match(/data:application\/json;([^,]+),/)[1];
+      throw new Error("Unsupported source map encoding " + S);
+    }
+    getAnnotationURL(t) {
+      return t.replace(/^\/\*\s*# sourceMappingURL=/, "").trim();
+    }
+    isMap(t) {
+      return typeof t != "object" ? !1 : typeof t.mappings == "string" || typeof t._mappings == "string" || Array.isArray(t.sections);
+    }
+    loadAnnotation(t) {
+      let e = t.match(/\/\*\s*# sourceMappingURL=/g);
+      if (!e) return;
+      let i = t.lastIndexOf(e.pop()), n = t.indexOf("*/", i);
+      i > -1 && n > -1 && (this.annotation = this.getAnnotationURL(t.substring(i, n)));
+    }
+    loadFile(t) {
+      if (this.root = r(t), p(t))
+        return this.mapFile = t, d(t, "utf-8").toString().trim();
+    }
+    loadMap(t, e) {
+      if (e === !1) return !1;
+      if (e) {
+        if (typeof e == "string")
+          return e;
+        if (typeof e == "function") {
+          let i = e(t);
+          if (i) {
+            let n = this.loadFile(i);
+            if (!n)
+              throw new Error(
+                "Unable to load previous source map: " + i.toString()
+              );
+            return n;
+          }
+        } else {
+          if (e instanceof l)
+            return f.fromSourceMap(e).toString();
+          if (e instanceof f)
+            return e.toString();
+          if (this.isMap(e))
+            return JSON.stringify(e);
+          throw new Error(
+            "Unsupported previous source map format: " + e.toString()
+          );
+        }
+      } else {
+        if (this.inline)
+          return this.decodeInline(this.annotation);
+        if (this.annotation) {
+          let i = this.annotation;
+          return t && (i = g(r(t), i)), this.loadFile(i);
+        }
+      }
+    }
+    startWith(t, e) {
+      return t ? t.substr(0, e.length) === e : !1;
+    }
+    withContent() {
+      return !!(this.consumer().sourcesContent && this.consumer().sourcesContent.length > 0);
+    }
+  }
+  return u = a, a.default = a, u;
+}
+export {
+  w as __require
+};
+//# sourceMappingURL=index.es687.js.map

package/dist/index.es687.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es687.js","sources":["../node_modules/postcss/lib/previous-map.js"],"sourcesContent":["'use strict'\n\nlet { existsSync, readFileSync } = require('fs')\nlet { dirname, join } = require('path')\nlet { SourceMapConsumer, SourceMapGenerator } = require('source-map-js')\n\nfunction fromBase64(str) {\n  if (Buffer) {\n    return Buffer.from(str, 'base64').toString()\n  } else {\n    /* c8 ignore next 2 */\n    return window.atob(str)\n  }\n}\n\nclass PreviousMap {\n  constructor(css, opts) {\n    if (opts.map === false) return\n    this.loadAnnotation(css)\n    this.inline = this.startWith(this.annotation, 'data:')\n\n    let prev = opts.map ? opts.map.prev : undefined\n    let text = this.loadMap(opts.from, prev)\n    if (!this.mapFile && opts.from) {\n      this.mapFile = opts.from\n    }\n    if (this.mapFile) this.root = dirname(this.mapFile)\n    if (text) this.text = text\n  }\n\n  consumer() {\n    if (!this.consumerCache) {\n      this.consumerCache = new SourceMapConsumer(this.text)\n    }\n    return this.consumerCache\n  }\n\n  decodeInline(text) {\n    let baseCharsetUri = /^data:application\\/json;charset=utf-?8;base64,/\n    let baseUri = /^data:application\\/json;base64,/\n    let charsetUri = /^data:application\\/json;charset=utf-?8,/\n    let uri = /^data:application\\/json,/\n\n    let uriMatch = text.match(charsetUri) || text.match(uri)\n    if (uriMatch) {\n      return decodeURIComponent(text.substr(uriMatch[0].length))\n    }\n\n    let baseUriMatch = text.match(baseCharsetUri) || text.match(baseUri)\n    if (baseUriMatch) {\n      return fromBase64(text.substr(baseUriMatch[0].length))\n    }\n\n    let encoding = text.match(/data:application\\/json;([^,]+),/)[1]\n    throw new Error('Unsupported source map encoding ' + encoding)\n  }\n\n  getAnnotationURL(sourceMapString) {\n    return sourceMapString.replace(/^\\/\\*\\s*# sourceMappingURL=/, '').trim()\n  }\n\n  isMap(map) {\n    if (typeof map !== 'object') return false\n    return (\n      typeof map.mappings === 'string' ||\n      typeof map._mappings === 'string' ||\n      Array.isArray(map.sections)\n    )\n  }\n\n  loadAnnotation(css) {\n    let comments = css.match(/\\/\\*\\s*# sourceMappingURL=/g)\n    if (!comments) return\n\n    // sourceMappingURLs from comments, strings, etc.\n    let start = css.lastIndexOf(comments.pop())\n    let end = css.indexOf('*/', start)\n\n    if (start > -1 && end > -1) {\n      // Locate the last sourceMappingURL to avoid pickin\n      this.annotation = this.getAnnotationURL(css.substring(start, end))\n    }\n  }\n\n  loadFile(path) {\n    this.root = dirname(path)\n    if (existsSync(path)) {\n      this.mapFile = path\n      return readFileSync(path, 'utf-8').toString().trim()\n    }\n  }\n\n  loadMap(file, prev) {\n    if (prev === false) return false\n\n    if (prev) {\n      if (typeof prev === 'string') {\n        return prev\n      } else if (typeof prev === 'function') {\n        let prevPath = prev(file)\n        if (prevPath) {\n          let map = this.loadFile(prevPath)\n          if (!map) {\n            throw new Error(\n              'Unable to load previous source map: ' + prevPath.toString()\n            )\n          }\n          return map\n        }\n      } else if (prev instanceof SourceMapConsumer) {\n        return SourceMapGenerator.fromSourceMap(prev).toString()\n      } else if (prev instanceof SourceMapGenerator) {\n        return prev.toString()\n      } else if (this.isMap(prev)) {\n        return JSON.stringify(prev)\n      } else {\n        throw new Error(\n          'Unsupported previous source map format: ' + prev.toString()\n        )\n      }\n    } else if (this.inline) {\n      return this.decodeInline(this.annotation)\n    } else if (this.annotation) {\n      let map = this.annotation\n      if (file) map = join(dirname(file), map)\n      return this.loadFile(map)\n    }\n  }\n\n  startWith(string, start) {\n    if (!string) return false\n    return string.substr(0, start.length) === start\n  }\n\n  withContent() {\n    return !!(\n      this.consumer().sourcesContent &&\n      this.consumer().sourcesContent.length > 0\n    )\n  }\n}\n\nmodule.exports = PreviousMap\nPreviousMap.default = PreviousMap\n"],"names":["existsSync","readFileSync","require$$0","dirname","join","require$$1","SourceMapConsumer","SourceMapGenerator","require$$2","fromBase64","str","PreviousMap","css","opts","prev","text","baseCharsetUri","baseUri","charsetUri","uri","uriMatch","baseUriMatch","encoding","sourceMapString","map","comments","start","end","path","file","prevPath","string","previousMap"],"mappings":";;;;;AAEA,MAAI,EAAE,YAAAA,GAAY,cAAAC,MAAiBC,GAC/B,EAAE,SAAAC,GAAS,MAAAC,MAASC,GACpB,EAAE,mBAAAC,GAAmB,oBAAAC,MAAuBC;AAEhD,WAASC,EAAWC,GAAK;AACvB,WAAI,SACK,OAAO,KAAKA,GAAK,QAAQ,EAAE,SAAQ,IAGnC,OAAO,KAAKA,CAAG;AAAA,EAE1B;AAAA,EAEA,MAAMC,EAAY;AAAA,IAChB,YAAYC,GAAKC,GAAM;AACrB,UAAIA,EAAK,QAAQ,GAAO;AACxB,WAAK,eAAeD,CAAG,GACvB,KAAK,SAAS,KAAK,UAAU,KAAK,YAAY,OAAO;AAErD,UAAIE,IAAOD,EAAK,MAAMA,EAAK,IAAI,OAAO,QAClCE,IAAO,KAAK,QAAQF,EAAK,MAAMC,CAAI;AACvC,MAAI,CAAC,KAAK,WAAWD,EAAK,SACxB,KAAK,UAAUA,EAAK,OAElB,KAAK,YAAS,KAAK,OAAOV,EAAQ,KAAK,OAAO,IAC9CY,MAAM,KAAK,OAAOA;AAAA,IAC1B;AAAA,IAEE,WAAW;AACT,aAAK,KAAK,kBACR,KAAK,gBAAgB,IAAIT,EAAkB,KAAK,IAAI,IAE/C,KAAK;AAAA,IAChB;AAAA,IAEE,aAAaS,GAAM;AACjB,UAAIC,IAAiB,kDACjBC,IAAU,mCACVC,IAAa,2CACbC,IAAM,4BAENC,IAAWL,EAAK,MAAMG,CAAU,KAAKH,EAAK,MAAMI,CAAG;AACvD,UAAIC;AACF,eAAO,mBAAmBL,EAAK,OAAOK,EAAS,CAAC,EAAE,MAAM,CAAC;AAG3D,UAAIC,IAAeN,EAAK,MAAMC,CAAc,KAAKD,EAAK,MAAME,CAAO;AACnE,UAAII;AACF,eAAOZ,EAAWM,EAAK,OAAOM,EAAa,CAAC,EAAE,MAAM,CAAC;AAGvD,UAAIC,IAAWP,EAAK,MAAM,iCAAiC,EAAE,CAAC;AAC9D,YAAM,IAAI,MAAM,qCAAqCO,CAAQ;AAAA,IACjE;AAAA,IAEE,iBAAiBC,GAAiB;AAChC,aAAOA,EAAgB,QAAQ,+BAA+B,EAAE,EAAE,KAAI;AAAA,IAC1E;AAAA,IAEE,MAAMC,GAAK;AACT,aAAI,OAAOA,KAAQ,WAAiB,KAElC,OAAOA,EAAI,YAAa,YACxB,OAAOA,EAAI,aAAc,YACzB,MAAM,QAAQA,EAAI,QAAQ;AAAA,IAEhC;AAAA,IAEE,eAAeZ,GAAK;AAClB,UAAIa,IAAWb,EAAI,MAAM,6BAA6B;AACtD,UAAI,CAACa,EAAU;AAGf,UAAIC,IAAQd,EAAI,YAAYa,EAAS,IAAG,CAAE,GACtCE,IAAMf,EAAI,QAAQ,MAAMc,CAAK;AAEjC,MAAIA,IAAQ,MAAMC,IAAM,OAEtB,KAAK,aAAa,KAAK,iBAAiBf,EAAI,UAAUc,GAAOC,CAAG,CAAC;AAAA,IAEvE;AAAA,IAEE,SAASC,GAAM;AAEb,UADA,KAAK,OAAOzB,EAAQyB,CAAI,GACpB5B,EAAW4B,CAAI;AACjB,oBAAK,UAAUA,GACR3B,EAAa2B,GAAM,OAAO,EAAE,SAAQ,EAAG,KAAI;AAAA,IAExD;AAAA,IAEE,QAAQC,GAAMf,GAAM;AAClB,UAAIA,MAAS,GAAO,QAAO;AAE3B,UAAIA,GAAM;AACR,YAAI,OAAOA,KAAS;AAClB,iBAAOA;AACF,YAAI,OAAOA,KAAS,YAAY;AACrC,cAAIgB,IAAWhB,EAAKe,CAAI;AACxB,cAAIC,GAAU;AACZ,gBAAIN,IAAM,KAAK,SAASM,CAAQ;AAChC,gBAAI,CAACN;AACH,oBAAM,IAAI;AAAA,gBACR,yCAAyCM,EAAS,SAAQ;AAAA,cACxE;AAEU,mBAAON;AAAA,UACjB;AAAA,QACA,OAAa;AAAA,cAAIV,aAAgBR;AACzB,mBAAOC,EAAmB,cAAcO,CAAI,EAAE,SAAQ;AACjD,cAAIA,aAAgBP;AACzB,mBAAOO,EAAK,SAAQ;AACf,cAAI,KAAK,MAAMA,CAAI;AACxB,mBAAO,KAAK,UAAUA,CAAI;AAE1B,gBAAM,IAAI;AAAA,YACR,6CAA6CA,EAAK,SAAQ;AAAA,UACpE;AAAA;AAAA,MAEA,OAAW;AAAA,YAAI,KAAK;AACd,iBAAO,KAAK,aAAa,KAAK,UAAU;AACnC,YAAI,KAAK,YAAY;AAC1B,cAAIU,IAAM,KAAK;AACf,iBAAIK,MAAML,IAAMpB,EAAKD,EAAQ0B,CAAI,GAAGL,CAAG,IAChC,KAAK,SAASA,CAAG;AAAA,QAC9B;AAAA;AAAA,IACA;AAAA,IAEE,UAAUO,GAAQL,GAAO;AACvB,aAAKK,IACEA,EAAO,OAAO,GAAGL,EAAM,MAAM,MAAMA,IADtB;AAAA,IAExB;AAAA,IAEE,cAAc;AACZ,aAAO,CAAC,EACN,KAAK,SAAQ,EAAG,kBAChB,KAAK,SAAQ,EAAG,eAAe,SAAS;AAAA,IAE9C;AAAA,EACA;AAEA,SAAAM,IAAiBrB,GACjBA,EAAY,UAAUA;;","x_google_ignoreList":[0]}

package/dist/index.es688.js

@@ -0,0 +1,21 @@
+var n, i;
+function d() {
+  if (i) return n;
+  i = 1;
+  let l = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
+  return n = { nanoid: (e = 21) => {
+    let r = "", t = e | 0;
+    for (; t--; )
+      r += l[Math.random() * 64 | 0];
+    return r;
+  }, customAlphabet: (e, r = 21) => (t = r) => {
+    let u = "", a = t | 0;
+    for (; a--; )
+      u += e[Math.random() * e.length | 0];
+    return u;
+  } }, n;
+}
+export {
+  d as __require
+};
+//# sourceMappingURL=index.es688.js.map

package/dist/index.es688.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es688.js","sources":["../node_modules/nanoid/non-secure/index.cjs"],"sourcesContent":["// This alphabet uses `A-Za-z0-9_-` symbols.\n// The order of characters is optimized for better gzip and brotli compression.\n// References to the same file (works both for gzip and brotli):\n// `'use`, `andom`, and `rict'`\n// References to the brotli default dictionary:\n// `-26T`, `1983`, `40px`, `75px`, `bush`, `jack`, `mind`, `very`, and `wolf`\nlet urlAlphabet =\n  'useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict'\n\nlet customAlphabet = (alphabet, defaultSize = 21) => {\n  return (size = defaultSize) => {\n    let id = ''\n    // A compact alternative for `for (var i = 0; i < step; i++)`.\n    let i = size | 0\n    while (i--) {\n      // `| 0` is more compact and faster than `Math.floor()`.\n      id += alphabet[(Math.random() * alphabet.length) | 0]\n    }\n    return id\n  }\n}\n\nlet nanoid = (size = 21) => {\n  let id = ''\n  // A compact alternative for `for (var i = 0; i < step; i++)`.\n  let i = size | 0\n  while (i--) {\n    // `| 0` is more compact and faster than `Math.floor()`.\n    id += urlAlphabet[(Math.random() * 64) | 0]\n  }\n  return id\n}\n\nmodule.exports = { nanoid, customAlphabet }\n"],"names":["urlAlphabet","nonSecure","size","id","i","alphabet","defaultSize"],"mappings":";;;;AAMA,MAAIA,IACF;AA0BF,SAAAC,IAAiB,EAAE,QAXN,CAACC,IAAO,OAAO;AAC1B,QAAIC,IAAK,IAELC,IAAIF,IAAO;AACf,WAAOE;AAEL,MAAAD,KAAMH,EAAa,KAAK,OAAM,IAAK,KAAM,CAAC;AAE5C,WAAOG;AAAA,EACT,GAE2B,gBAxBN,CAACE,GAAUC,IAAc,OACrC,CAACJ,IAAOI,MAAgB;AAC7B,QAAIH,IAAK,IAELC,IAAIF,IAAO;AACf,WAAOE;AAEL,MAAAD,KAAME,EAAU,KAAK,OAAM,IAAKA,EAAS,SAAU,CAAC;AAEtD,WAAOF;AAAA,EACX,EAcyC;;","x_google_ignoreList":[0]}