@apify/docusaurus-plugin-typedoc-api 4.2.11-0 → 4.2.11-1

package/lib/node_modules/domutils/lib/esm/helpers.js

@@ -1,142 +0,0 @@
-'use strict';
-
-require('../../../domhandler/lib/esm/index.js');
-const node = require('../../../domhandler/lib/esm/node.js');
-
-/**
- * Given an array of nodes, remove any member that is contained by another
- * member.
- *
- * @category Helpers
- * @param nodes Nodes to filter.
- * @returns Remaining nodes that aren't contained by other nodes.
- */
-function removeSubsets(nodes) {
-  let idx = nodes.length;
-  /*
-   * Check if each node (or one of its ancestors) is already contained in the
-   * array.
-   */
-  while (--idx >= 0) {
-    const node = nodes[idx];
-    /*
-     * Remove the node if it is not unique.
-     * We are going through the array from the end, so we only
-     * have to check nodes that preceed the node under consideration in the array.
-     */
-    if (idx > 0 && nodes.lastIndexOf(node, idx - 1) >= 0) {
-      nodes.splice(idx, 1);
-      continue;
-    }
-    for (let ancestor = node.parent; ancestor; ancestor = ancestor.parent) {
-      if (nodes.includes(ancestor)) {
-        nodes.splice(idx, 1);
-        break;
-      }
-    }
-  }
-  return nodes;
-}
-/**
- * @category Helpers
- * @see {@link http://dom.spec.whatwg.org/#dom-node-comparedocumentposition}
- */
-exports.DocumentPosition = void 0;
-(function (DocumentPosition) {
-  DocumentPosition[DocumentPosition["DISCONNECTED"] = 1] = "DISCONNECTED";
-  DocumentPosition[DocumentPosition["PRECEDING"] = 2] = "PRECEDING";
-  DocumentPosition[DocumentPosition["FOLLOWING"] = 4] = "FOLLOWING";
-  DocumentPosition[DocumentPosition["CONTAINS"] = 8] = "CONTAINS";
-  DocumentPosition[DocumentPosition["CONTAINED_BY"] = 16] = "CONTAINED_BY";
-})(exports.DocumentPosition || (exports.DocumentPosition = {}));
-/**
- * Compare the position of one node against another node in any other document,
- * returning a bitmask with the values from {@link DocumentPosition}.
- *
- * Document order:
- * > There is an ordering, document order, defined on all the nodes in the
- * > document corresponding to the order in which the first character of the
- * > XML representation of each node occurs in the XML representation of the
- * > document after expansion of general entities. Thus, the document element
- * > node will be the first node. Element nodes occur before their children.
- * > Thus, document order orders element nodes in order of the occurrence of
- * > their start-tag in the XML (after expansion of entities). The attribute
- * > nodes of an element occur after the element and before its children. The
- * > relative order of attribute nodes is implementation-dependent.
- *
- * Source:
- * http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order
- *
- * @category Helpers
- * @param nodeA The first node to use in the comparison
- * @param nodeB The second node to use in the comparison
- * @returns A bitmask describing the input nodes' relative position.
- *
- * See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for
- * a description of these values.
- */
-function compareDocumentPosition(nodeA, nodeB) {
-  const aParents = [];
-  const bParents = [];
-  if (nodeA === nodeB) {
-    return 0;
-  }
-  let current = node.hasChildren(nodeA) ? nodeA : nodeA.parent;
-  while (current) {
-    aParents.unshift(current);
-    current = current.parent;
-  }
-  current = node.hasChildren(nodeB) ? nodeB : nodeB.parent;
-  while (current) {
-    bParents.unshift(current);
-    current = current.parent;
-  }
-  const maxIdx = Math.min(aParents.length, bParents.length);
-  let idx = 0;
-  while (idx < maxIdx && aParents[idx] === bParents[idx]) {
-    idx++;
-  }
-  if (idx === 0) {
-    return exports.DocumentPosition.DISCONNECTED;
-  }
-  const sharedParent = aParents[idx - 1];
-  const siblings = sharedParent.children;
-  const aSibling = aParents[idx];
-  const bSibling = bParents[idx];
-  if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {
-    if (sharedParent === nodeB) {
-      return exports.DocumentPosition.FOLLOWING | exports.DocumentPosition.CONTAINED_BY;
-    }
-    return exports.DocumentPosition.FOLLOWING;
-  }
-  if (sharedParent === nodeA) {
-    return exports.DocumentPosition.PRECEDING | exports.DocumentPosition.CONTAINS;
-  }
-  return exports.DocumentPosition.PRECEDING;
-}
-/**
- * Sort an array of nodes based on their relative position in the document,
- * removing any duplicate nodes. If the array contains nodes that do not belong
- * to the same document, sort order is unspecified.
- *
- * @category Helpers
- * @param nodes Array of DOM nodes.
- * @returns Collection of unique nodes, sorted in document order.
- */
-function uniqueSort(nodes) {
-  nodes = nodes.filter((node, i, arr) => !arr.includes(node, i + 1));
-  nodes.sort((a, b) => {
-    const relative = compareDocumentPosition(a, b);
-    if (relative & exports.DocumentPosition.PRECEDING) {
-      return -1;
-    } else if (relative & exports.DocumentPosition.FOLLOWING) {
-      return 1;
-    }
-    return 0;
-  });
-  return nodes;
-}
-exports.compareDocumentPosition = compareDocumentPosition;
-exports.removeSubsets = removeSubsets;
-exports.uniqueSort = uniqueSort;
-//# sourceMappingURL=helpers.js.map

package/lib/node_modules/domutils/lib/esm/helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"helpers.js","sources":["../../../../../../../node_modules/domutils/lib/esm/helpers.js"],"sourcesContent":null,"names":["DocumentPosition","hasChildren"],"mappings":";;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,aAAa,CAAC,KAAK,EAAE;AACrC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;AAC3B;AACA;AACA;AACA;AACA,IAAI,OAAO,EAAE,GAAG,IAAI,CAAC,EAAE;AACvB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;AAChC;AACA;AACA;AACA;AACA;AACA,QAAQ,IAAI,GAAG,GAAG,CAAC,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;AAC9D,YAAY,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACjC,YAAY,SAAS;AACrB,SAAS;AACT,QAAQ,KAAK,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE;AAC/E,YAAY,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;AAC1C,gBAAgB,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACrC,gBAAgB,MAAM;AACtB,aAAa;AACb,SAAS;AACT,KAAK;AACL,IAAI,OAAO,KAAK,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACWA,kCAAiB;AAC5B,CAAC,UAAU,gBAAgB,EAAE;AAC7B,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC;AAC5E,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;AACtE,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;AACtE,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC;AACpE,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,cAAc,CAAC;AAC7E,CAAC,EAAEA,wBAAgB,KAAKA,wBAAgB,GAAG,EAAE,CAAC,CAAC,CAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE;AACtD,IAAI,MAAM,QAAQ,GAAG,EAAE,CAAC;AACxB,IAAI,MAAM,QAAQ,GAAG,EAAE,CAAC;AACxB,IAAI,IAAI,KAAK,KAAK,KAAK,EAAE;AACzB,QAAQ,OAAO,CAAC,CAAC;AACjB,KAAK;AACL,IAAI,IAAI,OAAO,GAAGC,gBAAW,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;AAC5D,IAAI,OAAO,OAAO,EAAE;AACpB,QAAQ,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AAClC,QAAQ,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;AACjC,KAAK;AACL,IAAI,OAAO,GAAGA,gBAAW,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;AACxD,IAAI,OAAO,OAAO,EAAE;AACpB,QAAQ,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AAClC,QAAQ,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;AACjC,KAAK;AACL,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;AAC9D,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC;AAChB,IAAI,OAAO,GAAG,GAAG,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,EAAE;AAC5D,QAAQ,GAAG,EAAE,CAAC;AACd,KAAK;AACL,IAAI,IAAI,GAAG,KAAK,CAAC,EAAE;AACnB,QAAQ,OAAOD,wBAAgB,CAAC,YAAY,CAAC;AAC7C,KAAK;AACL,IAAI,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAC3C,IAAI,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;AAC3C,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;AACnC,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;AACnC,IAAI,IAAI,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;AACjE,QAAQ,IAAI,YAAY,KAAK,KAAK,EAAE;AACpC,YAAY,OAAOA,wBAAgB,CAAC,SAAS,GAAGA,wBAAgB,CAAC,YAAY,CAAC;AAC9E,SAAS;AACT,QAAQ,OAAOA,wBAAgB,CAAC,SAAS,CAAC;AAC1C,KAAK;AACL,IAAI,IAAI,YAAY,KAAK,KAAK,EAAE;AAChC,QAAQ,OAAOA,wBAAgB,CAAC,SAAS,GAAGA,wBAAgB,CAAC,QAAQ,CAAC;AACtE,KAAK;AACL,IAAI,OAAOA,wBAAgB,CAAC,SAAS,CAAC;AACtC,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,UAAU,CAAC,KAAK,EAAE;AAClC,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvE,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK;AACzB,QAAQ,MAAM,QAAQ,GAAG,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,QAAQ,IAAI,QAAQ,GAAGA,wBAAgB,CAAC,SAAS,EAAE;AACnD,YAAY,OAAO,CAAC,CAAC,CAAC;AACtB,SAAS;AACT,aAAa,IAAI,QAAQ,GAAGA,wBAAgB,CAAC,SAAS,EAAE;AACxD,YAAY,OAAO,CAAC,CAAC;AACrB,SAAS;AACT,QAAQ,OAAO,CAAC,CAAC;AACjB,KAAK,CAAC,CAAC;AACP,IAAI,OAAO,KAAK,CAAC;AACjB;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/domutils/lib/esm/index.js

@@ -1,56 +0,0 @@
-'use strict';
-
-const stringify = require('./stringify.js');
-const traversal = require('./traversal.js');
-const manipulation = require('./manipulation.js');
-const querying = require('./querying.js');
-const legacy = require('./legacy.js');
-const helpers = require('./helpers.js');
-const feeds = require('./feeds.js');
-require('../../../domhandler/lib/esm/index.js');
-const node = require('../../../domhandler/lib/esm/node.js');
-exports.getInnerHTML = stringify.getInnerHTML;
-exports.getOuterHTML = stringify.getOuterHTML;
-exports.getText = stringify.getText;
-exports.innerText = stringify.innerText;
-exports.textContent = stringify.textContent;
-exports.getAttributeValue = traversal.getAttributeValue;
-exports.getChildren = traversal.getChildren;
-exports.getName = traversal.getName;
-exports.getParent = traversal.getParent;
-exports.getSiblings = traversal.getSiblings;
-exports.hasAttrib = traversal.hasAttrib;
-exports.nextElementSibling = traversal.nextElementSibling;
-exports.prevElementSibling = traversal.prevElementSibling;
-exports.append = manipulation.append;
-exports.appendChild = manipulation.appendChild;
-exports.prepend = manipulation.prepend;
-exports.prependChild = manipulation.prependChild;
-exports.removeElement = manipulation.removeElement;
-exports.replaceElement = manipulation.replaceElement;
-exports.existsOne = querying.existsOne;
-exports.filter = querying.filter;
-exports.find = querying.find;
-exports.findAll = querying.findAll;
-exports.findOne = querying.findOne;
-exports.findOneChild = querying.findOneChild;
-exports.getElementById = legacy.getElementById;
-exports.getElements = legacy.getElements;
-exports.getElementsByTagName = legacy.getElementsByTagName;
-exports.getElementsByTagType = legacy.getElementsByTagType;
-exports.testElement = legacy.testElement;
-Object.defineProperty(exports, "DocumentPosition", {
-  enumerable: true,
-  get: () => helpers.DocumentPosition
-});
-exports.compareDocumentPosition = helpers.compareDocumentPosition;
-exports.removeSubsets = helpers.removeSubsets;
-exports.uniqueSort = helpers.uniqueSort;
-exports.getFeed = feeds.getFeed;
-exports.hasChildren = node.hasChildren;
-exports.isCDATA = node.isCDATA;
-exports.isComment = node.isComment;
-exports.isDocument = node.isDocument;
-exports.isTag = node.isTag;
-exports.isText = node.isText;
-//# sourceMappingURL=index.js.map

package/lib/node_modules/domutils/lib/esm/index.js.map

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

package/lib/node_modules/domutils/lib/esm/legacy.js

@@ -1,144 +0,0 @@
-'use strict';
-
-require('../../../domhandler/lib/esm/index.js');
-const querying = require('./querying.js');
-const node = require('../../../domhandler/lib/esm/node.js');
-
-/**
- * A map of functions to check nodes against.
- */
-const Checks = {
-  tag_name(name) {
-    if (typeof name === "function") {
-      return elem => node.isTag(elem) && name(elem.name);
-    } else if (name === "*") {
-      return node.isTag;
-    }
-    return elem => node.isTag(elem) && elem.name === name;
-  },
-  tag_type(type) {
-    if (typeof type === "function") {
-      return elem => type(elem.type);
-    }
-    return elem => elem.type === type;
-  },
-  tag_contains(data) {
-    if (typeof data === "function") {
-      return elem => node.isText(elem) && data(elem.data);
-    }
-    return elem => node.isText(elem) && elem.data === data;
-  }
-};
-/**
- * Returns a function to check whether a node has an attribute with a particular
- * value.
- *
- * @param attrib Attribute to check.
- * @param value Attribute value to look for.
- * @returns A function to check whether the a node has an attribute with a
- *   particular value.
- */
-function getAttribCheck(attrib, value) {
-  if (typeof value === "function") {
-    return elem => node.isTag(elem) && value(elem.attribs[attrib]);
-  }
-  return elem => node.isTag(elem) && elem.attribs[attrib] === value;
-}
-/**
- * Returns a function that returns `true` if either of the input functions
- * returns `true` for a node.
- *
- * @param a First function to combine.
- * @param b Second function to combine.
- * @returns A function taking a node and returning `true` if either of the input
- *   functions returns `true` for the node.
- */
-function combineFuncs(a, b) {
-  return elem => a(elem) || b(elem);
-}
-/**
- * Returns a function that executes all checks in `options` and returns `true`
- * if any of them match a node.
- *
- * @param options An object describing nodes to look for.
- * @returns A function that executes all checks in `options` and returns `true`
- *   if any of them match a node.
- */
-function compileTest(options) {
-  const funcs = Object.keys(options).map(key => {
-    const value = options[key];
-    return Object.prototype.hasOwnProperty.call(Checks, key) ? Checks[key](value) : getAttribCheck(key, value);
-  });
-  return funcs.length === 0 ? null : funcs.reduce(combineFuncs);
-}
-/**
- * Checks whether a node matches the description in `options`.
- *
- * @category Legacy Query Functions
- * @param options An object describing nodes to look for.
- * @param node The element to test.
- * @returns Whether the element matches the description in `options`.
- */
-function testElement(options, node) {
-  const test = compileTest(options);
-  return test ? test(node) : true;
-}
-/**
- * Returns all nodes that match `options`.
- *
- * @category Legacy Query Functions
- * @param options An object describing nodes to look for.
- * @param nodes Nodes to search through.
- * @param recurse Also consider child nodes.
- * @param limit Maximum number of nodes to return.
- * @returns All nodes that match `options`.
- */
-function getElements(options, nodes, recurse, limit = Infinity) {
-  const test = compileTest(options);
-  return test ? querying.filter(test, nodes, recurse, limit) : [];
-}
-/**
- * Returns the node with the supplied ID.
- *
- * @category Legacy Query Functions
- * @param id The unique ID attribute value to look for.
- * @param nodes Nodes to search through.
- * @param recurse Also consider child nodes.
- * @returns The node with the supplied ID.
- */
-function getElementById(id, nodes, recurse = true) {
-  if (!Array.isArray(nodes)) nodes = [nodes];
-  return querying.findOne(getAttribCheck("id", id), nodes, recurse);
-}
-/**
- * Returns all nodes with the supplied `tagName`.
- *
- * @category Legacy Query Functions
- * @param tagName Tag name to search for.
- * @param nodes Nodes to search through.
- * @param recurse Also consider child nodes.
- * @param limit Maximum number of nodes to return.
- * @returns All nodes with the supplied `tagName`.
- */
-function getElementsByTagName(tagName, nodes, recurse = true, limit = Infinity) {
-  return querying.filter(Checks["tag_name"](tagName), nodes, recurse, limit);
-}
-/**
- * Returns all nodes with the supplied `type`.
- *
- * @category Legacy Query Functions
- * @param type Element type to look for.
- * @param nodes Nodes to search through.
- * @param recurse Also consider child nodes.
- * @param limit Maximum number of nodes to return.
- * @returns All nodes with the supplied `type`.
- */
-function getElementsByTagType(type, nodes, recurse = true, limit = Infinity) {
-  return querying.filter(Checks["tag_type"](type), nodes, recurse, limit);
-}
-exports.getElementById = getElementById;
-exports.getElements = getElements;
-exports.getElementsByTagName = getElementsByTagName;
-exports.getElementsByTagType = getElementsByTagType;
-exports.testElement = testElement;
-//# sourceMappingURL=legacy.js.map

package/lib/node_modules/domutils/lib/esm/legacy.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"legacy.js","sources":["../../../../../../../node_modules/domutils/lib/esm/legacy.js"],"sourcesContent":null,"names":["isTag","isText","filter","findOne"],"mappings":";;;;;;AAEA;AACA;AACA;AACA,MAAM,MAAM,GAAG;AACf,IAAI,QAAQ,CAAC,IAAI,EAAE;AACnB,QAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AACxC,YAAY,OAAO,CAAC,IAAI,KAAKA,UAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5D,SAAS;AACT,aAAa,IAAI,IAAI,KAAK,GAAG,EAAE;AAC/B,YAAY,OAAOA,UAAK,CAAC;AACzB,SAAS;AACT,QAAQ,OAAO,CAAC,IAAI,KAAKA,UAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAC3D,KAAK;AACL,IAAI,QAAQ,CAAC,IAAI,EAAE;AACnB,QAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AACxC,YAAY,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7C,SAAS;AACT,QAAQ,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAC5C,KAAK;AACL,IAAI,YAAY,CAAC,IAAI,EAAE;AACvB,QAAQ,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AACxC,YAAY,OAAO,CAAC,IAAI,KAAKC,WAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7D,SAAS;AACT,QAAQ,OAAO,CAAC,IAAI,KAAKA,WAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAC5D,KAAK;AACL,CAAC,CAAC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE;AACvC,IAAI,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE;AACrC,QAAQ,OAAO,CAAC,IAAI,KAAKD,UAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AACpE,KAAK;AACL,IAAI,OAAO,CAAC,IAAI,KAAKA,UAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC;AACnE,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE;AAC5B,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AACxC,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,OAAO,EAAE;AAC9B,IAAI,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK;AACpD,QAAQ,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;AACnC,QAAQ,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;AAChE,cAAc,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AAChC,cAAc,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACzC,KAAK,CAAC,CAAC;AACP,IAAI,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;AAClE,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE;AAC3C,IAAI,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;AACtC,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACpC,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,QAAQ,EAAE;AACvE,IAAI,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;AACtC,IAAI,OAAO,IAAI,GAAGE,eAAM,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC;AAC3D,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,cAAc,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,EAAE;AAC1D,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7B,QAAQ,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AACxB,IAAI,OAAOC,gBAAO,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,EAAE,KAAK,GAAG,QAAQ,EAAE;AACvF,IAAI,OAAOD,eAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AACtE,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,EAAE,KAAK,GAAG,QAAQ,EAAE;AACpF,IAAI,OAAOA,eAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AACnE;;;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/domutils/lib/esm/manipulation.js

@@ -1,137 +0,0 @@
-'use strict';
-
-/**
- * Remove an element from the dom
- *
- * @category Manipulation
- * @param elem The element to be removed
- */
-function removeElement(elem) {
-  if (elem.prev) elem.prev.next = elem.next;
-  if (elem.next) elem.next.prev = elem.prev;
-  if (elem.parent) {
-    const childs = elem.parent.children;
-    const childsIndex = childs.lastIndexOf(elem);
-    if (childsIndex >= 0) {
-      childs.splice(childsIndex, 1);
-    }
-  }
-  elem.next = null;
-  elem.prev = null;
-  elem.parent = null;
-}
-/**
- * Replace an element in the dom
- *
- * @category Manipulation
- * @param elem The element to be replaced
- * @param replacement The element to be added
- */
-function replaceElement(elem, replacement) {
-  const prev = replacement.prev = elem.prev;
-  if (prev) {
-    prev.next = replacement;
-  }
-  const next = replacement.next = elem.next;
-  if (next) {
-    next.prev = replacement;
-  }
-  const parent = replacement.parent = elem.parent;
-  if (parent) {
-    const childs = parent.children;
-    childs[childs.lastIndexOf(elem)] = replacement;
-    elem.parent = null;
-  }
-}
-/**
- * Append a child to an element.
- *
- * @category Manipulation
- * @param parent The element to append to.
- * @param child The element to be added as a child.
- */
-function appendChild(parent, child) {
-  removeElement(child);
-  child.next = null;
-  child.parent = parent;
-  if (parent.children.push(child) > 1) {
-    const sibling = parent.children[parent.children.length - 2];
-    sibling.next = child;
-    child.prev = sibling;
-  } else {
-    child.prev = null;
-  }
-}
-/**
- * Append an element after another.
- *
- * @category Manipulation
- * @param elem The element to append after.
- * @param next The element be added.
- */
-function append(elem, next) {
-  removeElement(next);
-  const parent = elem.parent;
-  const currNext = elem.next;
-  next.next = currNext;
-  next.prev = elem;
-  elem.next = next;
-  next.parent = parent;
-  if (currNext) {
-    currNext.prev = next;
-    if (parent) {
-      const childs = parent.children;
-      childs.splice(childs.lastIndexOf(currNext), 0, next);
-    }
-  } else if (parent) {
-    parent.children.push(next);
-  }
-}
-/**
- * Prepend a child to an element.
- *
- * @category Manipulation
- * @param parent The element to prepend before.
- * @param child The element to be added as a child.
- */
-function prependChild(parent, child) {
-  removeElement(child);
-  child.parent = parent;
-  child.prev = null;
-  if (parent.children.unshift(child) !== 1) {
-    const sibling = parent.children[1];
-    sibling.prev = child;
-    child.next = sibling;
-  } else {
-    child.next = null;
-  }
-}
-/**
- * Prepend an element before another.
- *
- * @category Manipulation
- * @param elem The element to prepend before.
- * @param prev The element be added.
- */
-function prepend(elem, prev) {
-  removeElement(prev);
-  const parent = elem.parent;
-  if (parent) {
-    const childs = parent.children;
-    childs.splice(childs.indexOf(elem), 0, prev);
-  }
-  if (elem.prev) {
-    elem.prev.next = prev;
-  }
-  prev.parent = parent;
-  prev.prev = elem.prev;
-  prev.next = elem;
-  elem.prev = prev;
-}
-exports.append = append;
-exports.appendChild = appendChild;
-exports.prepend = prepend;
-exports.prependChild = prependChild;
-exports.removeElement = removeElement;
-exports.replaceElement = replaceElement;
-//# sourceMappingURL=manipulation.js.map

package/lib/node_modules/domutils/lib/esm/manipulation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"manipulation.js","sources":["../../../../../../../node_modules/domutils/lib/esm/manipulation.js"],"sourcesContent":null,"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,aAAa,CAAC,IAAI,EAAE;AACpC,IAAI,IAAI,IAAI,CAAC,IAAI;AACjB,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;AACnC,IAAI,IAAI,IAAI,CAAC,IAAI;AACjB,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;AACnC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACrB,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;AAC5C,QAAQ,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACrD,QAAQ,IAAI,WAAW,IAAI,CAAC,EAAE;AAC9B,YAAY,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AAC1C,SAAS;AACT,KAAK;AACL,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;AACvB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE;AAClD,IAAI,MAAM,IAAI,IAAI,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;AAChD,IAAI,IAAI,IAAI,EAAE;AACd,QAAQ,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;AAChC,KAAK;AACL,IAAI,MAAM,IAAI,IAAI,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;AAChD,IAAI,IAAI,IAAI,EAAE;AACd,QAAQ,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;AAChC,KAAK;AACL,IAAI,MAAM,MAAM,IAAI,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;AACtD,IAAI,IAAI,MAAM,EAAE;AAChB,QAAQ,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;AACvC,QAAQ,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC;AACvD,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;AAC3B,KAAK;AACL,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE;AAC3C,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC;AACzB,IAAI,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AACtB,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;AAC1B,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;AACzC,QAAQ,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpE,QAAQ,OAAO,CAAC,IAAI,GAAG,KAAK,CAAC;AAC7B,QAAQ,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC;AAC7B,KAAK;AACL,SAAS;AACT,QAAQ,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AAC1B,KAAK;AACL,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE;AACnC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;AACxB,IAAI,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;AAC5B,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;AAC/B,IAAI,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;AACzB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,IAAI,IAAI,QAAQ,EAAE;AAClB,QAAQ,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;AAC7B,QAAQ,IAAI,MAAM,EAAE;AACpB,YAAY,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;AAC3C,YAAY,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACjE,SAAS;AACT,KAAK;AACL,SAAS,IAAI,MAAM,EAAE;AACrB,QAAQ,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACnC,KAAK;AACL,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE;AAC5C,IAAI,aAAa,CAAC,KAAK,CAAC,CAAC;AACzB,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;AAC1B,IAAI,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AACtB,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;AAC9C,QAAQ,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC3C,QAAQ,OAAO,CAAC,IAAI,GAAG,KAAK,CAAC;AAC7B,QAAQ,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC;AAC7B,KAAK;AACL,SAAS;AACT,QAAQ,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;AAC1B,KAAK;AACL,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE;AACpC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;AACxB,IAAI,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;AAC5B,IAAI,IAAI,MAAM,EAAE;AAChB,QAAQ,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;AACvC,QAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACrD,KAAK;AACL,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE;AACnB,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AAC9B,KAAK;AACL,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;AAC1B,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB;;;;;;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/domutils/lib/esm/querying.js

@@ -1,149 +0,0 @@
-'use strict';
-
-require('../../../domhandler/lib/esm/index.js');
-const node = require('../../../domhandler/lib/esm/node.js');
-
-/**
- * Search a node and its children for nodes passing a test function. If `node` is not an array, it will be wrapped in one.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param node Node to search. Will be included in the result set if it matches.
- * @param recurse Also consider child nodes.
- * @param limit Maximum number of nodes to return.
- * @returns All nodes passing `test`.
- */
-function filter(test, node, recurse = true, limit = Infinity) {
-  return find(test, Array.isArray(node) ? node : [node], recurse, limit);
-}
-/**
- * Search an array of nodes and their children for nodes passing a test function.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Array of nodes to search.
- * @param recurse Also consider child nodes.
- * @param limit Maximum number of nodes to return.
- * @returns All nodes passing `test`.
- */
-function find(test, nodes, recurse, limit) {
-  const result = [];
-  /** Stack of the arrays we are looking at. */
-  const nodeStack = [nodes];
-  /** Stack of the indices within the arrays. */
-  const indexStack = [0];
-  for (;;) {
-    // First, check if the current array has any more elements to look at.
-    if (indexStack[0] >= nodeStack[0].length) {
-      // If we have no more arrays to look at, we are done.
-      if (indexStack.length === 1) {
-        return result;
-      }
-      // Otherwise, remove the current array from the stack.
-      nodeStack.shift();
-      indexStack.shift();
-      // Loop back to the start to continue with the next array.
-      continue;
-    }
-    const elem = nodeStack[0][indexStack[0]++];
-    if (test(elem)) {
-      result.push(elem);
-      if (--limit <= 0) return result;
-    }
-    if (recurse && node.hasChildren(elem) && elem.children.length > 0) {
-      /*
-       * Add the children to the stack. We are depth-first, so this is
-       * the next array we look at.
-       */
-      indexStack.unshift(0);
-      nodeStack.unshift(elem.children);
-    }
-  }
-}
-/**
- * Finds the first element inside of an array that matches a test function. This is an alias for `Array.prototype.find`.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Array of nodes to search.
- * @returns The first node in the array that passes `test`.
- * @deprecated Use `Array.prototype.find` directly.
- */
-function findOneChild(test, nodes) {
-  return nodes.find(test);
-}
-/**
- * Finds one element in a tree that passes a test.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Node or array of nodes to search.
- * @param recurse Also consider child nodes.
- * @returns The first node that passes `test`.
- */
-function findOne(test, nodes, recurse = true) {
-  let elem = null;
-  for (let i = 0; i < nodes.length && !elem; i++) {
-    const node$1 = nodes[i];
-    if (!node.isTag(node$1)) {
-      continue;
-    } else if (test(node$1)) {
-      elem = node$1;
-    } else if (recurse && node$1.children.length > 0) {
-      elem = findOne(test, node$1.children, true);
-    }
-  }
-  return elem;
-}
-/**
- * Checks if a tree of nodes contains at least one node passing a test.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Array of nodes to search.
- * @returns Whether a tree of nodes contains at least one node passing the test.
- */
-function existsOne(test, nodes) {
-  return nodes.some(checked => node.isTag(checked) && (test(checked) || existsOne(test, checked.children)));
-}
-/**
- * Search an array of nodes and their children for elements passing a test function.
- *
- * Same as `find`, but limited to elements and with less options, leading to reduced complexity.
- *
- * @category Querying
- * @param test Function to test nodes on.
- * @param nodes Array of nodes to search.
- * @returns All nodes passing `test`.
- */
-function findAll(test, nodes) {
-  const result = [];
-  const nodeStack = [nodes];
-  const indexStack = [0];
-  for (;;) {
-    if (indexStack[0] >= nodeStack[0].length) {
-      if (nodeStack.length === 1) {
-        return result;
-      }
-      // Otherwise, remove the current array from the stack.
-      nodeStack.shift();
-      indexStack.shift();
-      // Loop back to the start to continue with the next array.
-      continue;
-    }
-    const elem = nodeStack[0][indexStack[0]++];
-    if (!node.isTag(elem)) continue;
-    if (test(elem)) result.push(elem);
-    if (elem.children.length > 0) {
-      indexStack.unshift(0);
-      nodeStack.unshift(elem.children);
-    }
-  }
-}
-exports.existsOne = existsOne;
-exports.filter = filter;
-exports.find = find;
-exports.findAll = findAll;
-exports.findOne = findOne;
-exports.findOneChild = findOneChild;
-//# sourceMappingURL=querying.js.map

package/lib/node_modules/domutils/lib/esm/querying.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"querying.js","sources":["../../../../../../../node_modules/domutils/lib/esm/querying.js"],"sourcesContent":null,"names":["hasChildren","node","isTag"],"mappings":";;;;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,KAAK,GAAG,QAAQ,EAAE;AACrE,IAAI,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;AAC3E,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE;AAClD,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB;AACA,IAAI,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC;AAC9B;AACA,IAAI,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3B,IAAI,SAAS;AACb;AACA,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAClD;AACA,YAAY,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;AACzC,gBAAgB,OAAO,MAAM,CAAC;AAC9B,aAAa;AACb;AACA,YAAY,SAAS,CAAC,KAAK,EAAE,CAAC;AAC9B,YAAY,UAAU,CAAC,KAAK,EAAE,CAAC;AAC/B;AACA,YAAY,SAAS;AACrB,SAAS;AACT,QAAQ,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACnD,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACxB,YAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC9B,YAAY,IAAI,EAAE,KAAK,IAAI,CAAC;AAC5B,gBAAgB,OAAO,MAAM,CAAC;AAC9B,SAAS;AACT,QAAQ,IAAI,OAAO,IAAIA,gBAAW,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACtE;AACA;AACA;AACA;AACA,YAAY,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAClC,YAAY,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC7C,SAAS;AACT,KAAK;AACL,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE;AAC1C,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,EAAE;AACrD,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC;AACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACpD,QAAQ,MAAMC,MAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AAC9B,QAAQ,IAAI,CAACC,UAAK,CAACD,MAAI,CAAC,EAAE;AAC1B,YAAY,SAAS;AACrB,SAAS;AACT,aAAa,IAAI,IAAI,CAACA,MAAI,CAAC,EAAE;AAC7B,YAAY,IAAI,GAAGA,MAAI,CAAC;AACxB,SAAS;AACT,aAAa,IAAI,OAAO,IAAIA,MAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAY,IAAI,GAAG,OAAO,CAAC,IAAI,EAAEA,MAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACtD,SAAS;AACT,KAAK;AACL,IAAI,OAAO,IAAI,CAAC;AAChB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE;AACvC,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,KAAKC,UAAK,CAAC,OAAO,CAAC;AACjD,SAAS,IAAI,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;AACrC,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,CAAC;AAC9B,IAAI,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3B,IAAI,SAAS;AACb,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;AAClD,YAAY,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AACxC,gBAAgB,OAAO,MAAM,CAAC;AAC9B,aAAa;AACb;AACA,YAAY,SAAS,CAAC,KAAK,EAAE,CAAC;AAC9B,YAAY,UAAU,CAAC,KAAK,EAAE,CAAC;AAC/B;AACA,YAAY,SAAS;AACrB,SAAS;AACT,QAAQ,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACnD,QAAQ,IAAI,CAACA,UAAK,CAAC,IAAI,CAAC;AACxB,YAAY,SAAS;AACrB,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC;AACtB,YAAY,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC9B,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACtC,YAAY,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAClC,YAAY,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC7C,SAAS;AACT,KAAK;AACL;;;;;;;;;","x_google_ignoreList":[0]}