@asamuzakjp/dom-selector 2.0.3-a.1 → 2.0.3-a.2

package/dist/cjs/js/matcher.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/js/matcher.js"],
-  "sourcesContent": ["/**\n * matcher.js\n */\n\n/* import */\nimport isCustomElementName from 'is-potential-custom-element-name';\nimport {\n  getDirectionality, isContentEditable, isInclusive, isInShadowTree,\n  isNamespaceDeclared, isPreceding, selectorToNodeProps\n} from './dom-util.js';\nimport {\n  generateCSS, parseSelector, unescapeSelector, walkAST\n} from './parser.js';\n\n/* constants */\nimport {\n  ALPHA_NUM, BIT_01, BIT_02, BIT_04, BIT_08, BIT_16, BIT_32, COMBINATOR,\n  DOCUMENT_FRAGMENT_NODE, DOCUMENT_NODE, ELEMENT_NODE, NOT_SUPPORTED_ERR,\n  REG_LOGICAL_PSEUDO, REG_SHADOW_HOST, SELECTOR_ATTR, SELECTOR_CLASS,\n  SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT, SELECTOR_TYPE,\n  SHOW_ALL, SHOW_DOCUMENT, SHOW_DOCUMENT_FRAGMENT, SHOW_ELEMENT, SYNTAX_ERR,\n  TEXT_NODE, TYPE_FROM, TYPE_TO\n} from './constant.js';\nconst DIR_NEXT = 'next';\nconst DIR_PREV = 'prev';\nconst TARGET_ALL = 'all';\nconst TARGET_FIRST = 'first';\nconst TARGET_LINEAL = 'lineal';\nconst TARGET_SELF = 'self';\nconst WALKER_FILTER = SHOW_DOCUMENT | SHOW_DOCUMENT_FRAGMENT | SHOW_ELEMENT;\n\n/**\n * Matcher\n * NOTE: #ast[i] corresponds to #nodes[i]\n * #ast: [\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   },\n *   {\n *     branch: branch[],\n *     dir: string|null,\n *     filtered: boolean,\n *     find: boolean\n *   }\n * ]\n * #nodes: [\n *   Set([node{}, node{}]),\n *   Set([node{}, node{}, node{}])\n * ]\n * branch[]: [twig{}, twig{}]\n * twig{}: {\n *   combo: leaf{}|null,\n *   leaves: leaves[]\n * }\n * leaves[]: [leaf{}, leaf{}, leaf{}]\n * leaf{}: CSSTree AST object\n * node{}: Element node\n */\nexport class Matcher {\n  /* private fields */\n  #ast;\n  #bit;\n  #cache;\n  #document;\n  #finder;\n  #node;\n  #nodes;\n  #root;\n  #selector;\n  #shadow;\n  #sort;\n  #tree;\n  #warn;\n  #window;\n\n  /**\n   * construct\n   */\n  constructor() {\n    this.#bit = new Map([\n      [SELECTOR_PSEUDO_ELEMENT, BIT_01],\n      [SELECTOR_ID, BIT_02],\n      [SELECTOR_CLASS, BIT_04],\n      [SELECTOR_TYPE, BIT_08],\n      [SELECTOR_ATTR, BIT_16],\n      [SELECTOR_PSEUDO_CLASS, BIT_32]\n    ]);\n    this.#cache = new WeakMap();\n  }\n\n  /**\n   * handle error\n   * @param {Error} e - Error\n   * @throws Error\n   * @returns {void}\n   */\n  _onError(e) {\n    if (e instanceof DOMException ||\n        (this.#window && e instanceof this.#window.DOMException)) {\n      if (e.name === NOT_SUPPORTED_ERR) {\n        if (this.#warn) {\n          console.warn(e.message);\n        }\n      } else if (this.#window) {\n        throw new this.#window.DOMException(e.message, e.name);\n      } else {\n        throw e;\n      }\n    } else {\n      throw e;\n    }\n  }\n\n  /**\n   * set up #window, #document, #root\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @returns {Array.<object>} - array of #window, #document, #root\n   */\n  _setup(node) {\n    let document;\n    let root;\n    switch (node?.nodeType) {\n      case DOCUMENT_NODE: {\n        document = node;\n        root = node;\n        break;\n      }\n      case DOCUMENT_FRAGMENT_NODE: {\n        document = node.ownerDocument;\n        root = node;\n        break;\n      }\n      case ELEMENT_NODE: {\n        if (node.ownerDocument.contains(node)) {\n          document = node.ownerDocument;\n          root = node.ownerDocument;\n        } else {\n          let parent = node;\n          while (parent) {\n            if (parent.parentNode) {\n              parent = parent.parentNode;\n            } else {\n              break;\n            }\n          }\n          if (parent.nodeType === DOCUMENT_NODE) {\n            document = parent;\n          } else {\n            document = parent.ownerDocument;\n          }\n          root = parent;\n        }\n        break;\n      }\n      default: {\n        let msg;\n        if (node?.nodeName) {\n          msg = `Unexpected node ${node.nodeName}`;\n        } else {\n          const nodeType =\n            Object.prototype.toString.call(node).slice(TYPE_FROM, TYPE_TO);\n          msg = `Unexpected node ${nodeType}`;\n        }\n        throw new TypeError(msg);\n      }\n    }\n    const window = document.defaultView;\n    return [\n      window,\n      document,\n      root\n    ];\n  }\n\n  /**\n   * sort AST leaves\n   * @param {Array.<object>} leaves - collection of AST leaves\n   * @returns {Array.<object>} - sorted leaves\n   */\n  _sortLeaves(leaves) {\n    const arr = [...leaves];\n    if (arr.length > 1) {\n      arr.sort((a, b) => {\n        const { type: typeA } = a;\n        const { type: typeB } = b;\n        const bitA = this.#bit.get(typeA);\n        const bitB = this.#bit.get(typeB);\n        let res;\n        if (bitA === bitB) {\n          res = 0;\n        } else if (bitA > bitB) {\n          res = 1;\n        } else {\n          res = -1;\n        }\n        return res;\n      });\n    }\n    return arr;\n  }\n\n  /**\n   * correspond #ast and #nodes\n   * @param {string} selector - CSS selector\n   * @returns {Array.<Array.<object|undefined>>} - array of #ast and #nodes\n   */\n  _correspond(selector) {\n    const nodes = [];\n    let ast;\n    let cachedItem = this.#document && this.#cache.get(this.#document);\n    if (cachedItem && cachedItem.has(`${selector}`)) {\n      ast = cachedItem.get(selector);\n      if (typeof ast === 'string') {\n        throw new DOMException(ast, SYNTAX_ERR);\n      }\n    }\n    if (ast) {\n      const l = ast.length;\n      for (let i = 0; i < l; i++) {\n        ast[i].dir = null;\n        ast[i].filtered = false;\n        ast[i].find = false;\n        nodes[i] = new Set();\n      }\n    } else {\n      let cssAst;\n      try {\n        cssAst = parseSelector(selector);\n      } catch (e) {\n        if (this.#document) {\n          if (!cachedItem) {\n            cachedItem = new Map();\n          }\n          cachedItem.set(`${selector}`, e.message);\n          this.#cache.set(this.#document, cachedItem);\n        }\n        this._onError(e);\n      }\n      const branches = walkAST(cssAst);\n      ast = [];\n      let i = 0;\n      for (const [...items] of branches) {\n        const branch = [];\n        let item = items.shift();\n        if (item && item.type !== COMBINATOR) {\n          const leaves = new Set();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              const [nextItem] = items;\n              if (nextItem.type === COMBINATOR) {\n                const msg = `Invalid selector ${selector}`;\n                if (this.#document) {\n                  if (!cachedItem) {\n                    cachedItem = new Map();\n                  }\n                  cachedItem.set(`${selector}`, msg);\n                  this.#cache.set(this.#document, cachedItem);\n                }\n                throw new DOMException(msg, SYNTAX_ERR);\n              }\n              branch.push({\n                combo: item,\n                leaves: this._sortLeaves(leaves)\n              });\n              leaves.clear();\n            } else if (item) {\n              leaves.add(item);\n            }\n            if (items.length) {\n              item = items.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: this._sortLeaves(leaves)\n              });\n              leaves.clear();\n              break;\n            }\n          }\n        }\n        ast.push({\n          branch,\n          dir: null,\n          filtered: false,\n          find: false\n        });\n        nodes[i] = new Set();\n        i++;\n      }\n      if (this.#document) {\n        if (!cachedItem) {\n          cachedItem = new Map();\n        }\n        cachedItem.set(`${selector}`, ast);\n        this.#cache.set(this.#document, cachedItem);\n      }\n    }\n    return [\n      ast,\n      nodes\n    ];\n  }\n\n  /**\n   * traverse tree walker\n   * @param {object} [node] - Element node\n   * @param {object} [walker] - tree walker\n   * @returns {?object} - current node\n   */\n  _traverse(node = {}, walker = this.#tree) {\n    let current;\n    let refNode = walker.currentNode;\n    if (node.nodeType === ELEMENT_NODE && refNode === node) {\n      current = refNode;\n    } else {\n      if (refNode !== walker.root) {\n        while (refNode) {\n          if (refNode === walker.root ||\n              (node.nodeType === ELEMENT_NODE && refNode === node)) {\n            break;\n          }\n          refNode = walker.parentNode();\n        }\n      }\n      if (node.nodeType === ELEMENT_NODE) {\n        while (refNode) {\n          if (refNode === node) {\n            current = refNode;\n            break;\n          }\n          refNode = walker.nextNode();\n        }\n      } else {\n        current = refNode;\n      }\n    }\n    return current ?? null;\n  }\n\n  /**\n   * collect nth child\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} [anb.selector] - AST\n   * @param {object} node - Element node\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthChild(anb, node) {\n    const { a, b, reverse, selector } = anb;\n    const { parentNode } = node;\n    let matched = new Set();\n    let selectorBranches;\n    if (selector) {\n      if (this.#cache.has(selector)) {\n        selectorBranches = this.#cache.get(selector);\n      } else {\n        selectorBranches = walkAST(selector);\n        this.#cache.set(selector, selectorBranches);\n      }\n    }\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      refNode = this._traverse(parentNode, walker);\n      const selectorNodes = new Set();\n      if (selectorBranches) {\n        refNode = this._traverse(parentNode, walker);\n        refNode = walker.firstChild();\n        while (refNode) {\n          let bool;\n          for (const leaves of selectorBranches) {\n            bool = this._matchLeaves(leaves, refNode);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            selectorNodes.add(refNode);\n          }\n          refNode = walker.nextSibling();\n        }\n      }\n      // :first-child, :last-child, :nth-child(b of S), :nth-last-child(b of S)\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          if (selectorNodes.size) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (selectorNodes.has(refNode)) {\n                if (i === b - 1) {\n                  matched.add(refNode);\n                  break;\n                }\n                i++;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n            }\n          } else if (!selector) {\n            let i = 0;\n            refNode = this._traverse(parentNode, walker);\n            if (reverse) {\n              refNode = walker.lastChild();\n            } else {\n              refNode = walker.firstChild();\n            }\n            while (refNode) {\n              if (i === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            }\n          }\n        }\n      // :nth-child()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let i = 0;\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            if (refNode && nth >= 0 && nth < l) {\n              if (selectorNodes.size) {\n                if (selectorNodes.has(refNode)) {\n                  if (j === nth) {\n                    matched.add(refNode);\n                    nth += a;\n                  }\n                  if (a > 0) {\n                    j++;\n                  } else {\n                    j--;\n                  }\n                }\n              } else if (i === nth) {\n                if (!selector) {\n                  matched.add(refNode);\n                }\n                nth += a;\n              }\n              if (reverse) {\n                refNode = walker.previousSibling();\n              } else {\n                refNode = walker.nextSibling();\n              }\n              i++;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && this.#root.nodeType === ELEMENT_NODE &&\n               (a + b) === 1) {\n      if (selectorBranches) {\n        let bool;\n        for (const leaves of selectorBranches) {\n          bool = this._matchLeaves(leaves, node);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          matched.add(node);\n        }\n      } else {\n        matched.add(node);\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * collect nth of type\n   * @param {object} anb - An+B options\n   * @param {number} anb.a - a\n   * @param {number} anb.b - b\n   * @param {boolean} [anb.reverse] - reverse order\n   * @param {object} node - Element node\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _collectNthOfType(anb, node) {\n    const { a, b, reverse } = anb;\n    const { localName, parentNode, prefix } = node;\n    let matched = new Set();\n    if (parentNode) {\n      const walker = this.#document.createTreeWalker(parentNode, WALKER_FILTER);\n      let l = 0;\n      let refNode = walker.firstChild();\n      while (refNode) {\n        l++;\n        refNode = walker.nextSibling();\n      }\n      // :first-of-type, :last-of-type\n      if (a === 0) {\n        if (b > 0 && b <= l) {\n          let j = 0;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === b - 1) {\n                matched.add(refNode);\n                break;\n              }\n              j++;\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      // :nth-of-type()\n      } else {\n        let nth = b - 1;\n        if (a > 0) {\n          while (nth < 0) {\n            nth += a;\n          }\n        }\n        if (nth >= 0 && nth < l) {\n          let j = a > 0 ? 0 : b - 1;\n          refNode = this._traverse(parentNode, walker);\n          if (reverse) {\n            refNode = walker.lastChild();\n          } else {\n            refNode = walker.firstChild();\n          }\n          while (refNode) {\n            const { localName: itemLocalName, prefix: itemPrefix } = refNode;\n            if (itemLocalName === localName && itemPrefix === prefix) {\n              if (j === nth) {\n                matched.add(refNode);\n                nth += a;\n              }\n              if (nth < 0 || nth >= l) {\n                break;\n              } else if (a > 0) {\n                j++;\n              } else {\n                j--;\n              }\n            }\n            if (reverse) {\n              refNode = walker.previousSibling();\n            } else {\n              refNode = walker.nextSibling();\n            }\n          }\n        }\n      }\n      if (reverse && matched.size > 1) {\n        const m = [...matched];\n        matched = new Set(m.reverse());\n      }\n    } else if (node === this.#root && this.#root.nodeType === ELEMENT_NODE &&\n               (a + b) === 1) {\n      matched.add(node);\n    }\n    return matched;\n  }\n\n  /**\n   * match An+B\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {string} nthName - nth pseudo-class name\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchAnPlusB(ast, node, nthName) {\n    const {\n      nth: {\n        a,\n        b,\n        name: nthIdentName\n      },\n      selector\n    } = ast;\n    const identName = unescapeSelector(nthIdentName);\n    const anbMap = new Map();\n    if (identName) {\n      if (identName === 'even') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 0);\n      } else if (identName === 'odd') {\n        anbMap.set('a', 2);\n        anbMap.set('b', 1);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    } else {\n      if (typeof a === 'string' && /-?\\d+/.test(a)) {\n        anbMap.set('a', a * 1);\n      } else {\n        anbMap.set('a', 0);\n      }\n      if (typeof b === 'string' && /-?\\d+/.test(b)) {\n        anbMap.set('b', b * 1);\n      } else {\n        anbMap.set('b', 0);\n      }\n      if (nthName.indexOf('last') > -1) {\n        anbMap.set('reverse', true);\n      }\n    }\n    let matched = new Set();\n    if (anbMap.has('a') && anbMap.has('b')) {\n      if (/^nth-(?:last-)?child$/.test(nthName)) {\n        if (selector) {\n          anbMap.set('selector', selector);\n        }\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthChild(anb, node);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (/^nth-(?:last-)?of-type$/.test(nthName)) {\n        const anb = Object.fromEntries(anbMap);\n        const nodes = this._collectNthOfType(anb, node);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match pseudo element selector\n   * @param {string} astName - AST name\n   * @param {object} [opt] - options\n   * @param {boolean} [opt.forgive] - is forgiving selector list\n   * @throws {DOMException}\n   * @returns {void}\n   */\n  _matchPseudoElementSelector(astName, opt = {}) {\n    const { forgive } = opt;\n    switch (astName) {\n      case 'after':\n      case 'backdrop':\n      case 'before':\n      case 'cue':\n      case 'cue-region':\n      case 'first-letter':\n      case 'first-line':\n      case 'file-selector-button':\n      case 'marker':\n      case 'placeholder':\n      case 'selection':\n      case 'target-text': {\n        if (this.#warn) {\n          const msg = `Unsupported pseudo-element ::${astName}`;\n          throw new DOMException(msg, NOT_SUPPORTED_ERR);\n        }\n        break;\n      }\n      case 'part':\n      case 'slotted': {\n        if (this.#warn) {\n          const msg = `Unsupported pseudo-element ::${astName}()`;\n          throw new DOMException(msg, NOT_SUPPORTED_ERR);\n        }\n        break;\n      }\n      default: {\n        if (astName.startsWith('-webkit-')) {\n          if (this.#warn) {\n            const msg = `Unsupported pseudo-element ::${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n        } else if (!forgive) {\n          const msg = `Unknown pseudo-element ::${astName}`;\n          throw new DOMException(msg, SYNTAX_ERR);\n        }\n      }\n    }\n  }\n\n  /**\n   * match directionality pseudo-class - :dir()\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchDirectionPseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    const dir = getDirectionality(node);\n    let res;\n    if (astName === dir) {\n      res = node;\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match language pseudo-class - :lang()\n   * @see https://datatracker.ietf.org/doc/html/rfc4647#section-3.3.1\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchLanguagePseudoClass(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (astName === '*') {\n      if (node.hasAttribute('lang')) {\n        if (node.getAttribute('lang')) {\n          res = node;\n        }\n      } else {\n        let parent = node.parentNode;\n        while (parent) {\n          if (parent.nodeType === ELEMENT_NODE) {\n            if (parent.hasAttribute('lang')) {\n              if (parent.getAttribute('lang')) {\n                res = node;\n              }\n              break;\n            }\n            parent = parent.parentNode;\n          } else {\n            break;\n          }\n        }\n      }\n    } else if (astName) {\n      const langPart = `(?:-${ALPHA_NUM})*`;\n      const regLang = new RegExp(`^(?:\\\\*-)?${ALPHA_NUM}${langPart}$`, 'i');\n      if (regLang.test(astName)) {\n        let regExtendedLang;\n        if (astName.indexOf('-') > -1) {\n          const [langMain, langSub, ...langRest] = astName.split('-');\n          let extendedMain;\n          if (langMain === '*') {\n            extendedMain = `${ALPHA_NUM}${langPart}`;\n          } else {\n            extendedMain = `${langMain}${langPart}`;\n          }\n          const extendedSub = `-${langSub}${langPart}`;\n          const len = langRest.length;\n          let extendedRest = '';\n          if (len) {\n            for (let i = 0; i < len; i++) {\n              extendedRest += `-${langRest[i]}${langPart}`;\n            }\n          }\n          regExtendedLang =\n            new RegExp(`^${extendedMain}${extendedSub}${extendedRest}$`, 'i');\n        } else {\n          regExtendedLang = new RegExp(`^${astName}${langPart}$`, 'i');\n        }\n        if (node.hasAttribute('lang')) {\n          if (regExtendedLang.test(node.getAttribute('lang'))) {\n            res = node;\n          }\n        } else {\n          let parent = node.parentNode;\n          while (parent) {\n            if (parent.nodeType === ELEMENT_NODE) {\n              if (parent.hasAttribute('lang')) {\n                const value = parent.getAttribute('lang');\n                if (regExtendedLang.test(value)) {\n                  res = node;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match :has() pseudo-class function\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - Element node\n   * @returns {boolean} - result\n   */\n  _matchHasPseudoFunc(leaves, node) {\n    let bool;\n    if (Array.isArray(leaves) && leaves.length) {\n      const [leaf] = leaves;\n      const { type: leafType } = leaf;\n      let combo;\n      if (leafType === COMBINATOR) {\n        combo = leaves.shift();\n      } else {\n        combo = {\n          name: ' ',\n          type: COMBINATOR\n        };\n      }\n      const twigLeaves = [];\n      while (leaves.length) {\n        const [item] = leaves;\n        const { type: itemType } = item;\n        if (itemType === COMBINATOR) {\n          break;\n        } else {\n          twigLeaves.push(leaves.shift());\n        }\n      }\n      const twig = {\n        combo,\n        leaves: twigLeaves\n      };\n      const nodes = this._matchCombinator(twig, node, {\n        dir: DIR_NEXT\n      });\n      if (nodes.size) {\n        if (leaves.length) {\n          for (const nextNode of nodes) {\n            bool =\n              this._matchHasPseudoFunc(Object.assign([], leaves), nextNode);\n            if (bool) {\n              break;\n            }\n          }\n        } else {\n          bool = true;\n        }\n      }\n    }\n    return !!bool;\n  }\n\n  /**\n   * match logical pseudo-class functions - :has(), :is(), :not(), :where()\n   * @param {object} astData - AST data\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchLogicalPseudoFunc(astData, node) {\n    const {\n      astName = '', branches = [], selector = '', twigBranches = []\n    } = astData;\n    let res;\n    if (astName === 'has') {\n      if (selector.includes(':has(')) {\n        res = null;\n      } else {\n        let bool;\n        for (const leaves of branches) {\n          bool = this._matchHasPseudoFunc(Object.assign([], leaves), node);\n          if (bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else {\n      const forgive = /^(?:is|where)$/.test(astName);\n      const l = twigBranches.length;\n      let bool;\n      for (let i = 0; i < l; i++) {\n        const branch = twigBranches[i];\n        const lastIndex = branch.length - 1;\n        const { leaves } = branch[lastIndex];\n        bool = this._matchLeaves(leaves, node, { forgive });\n        if (bool && lastIndex > 0) {\n          let nextNodes = new Set([node]);\n          for (let j = lastIndex - 1; j >= 0; j--) {\n            const twig = branch[j];\n            const arr = [];\n            for (const nextNode of nextNodes) {\n              const m = this._matchCombinator(twig, nextNode, {\n                forgive,\n                dir: DIR_PREV\n              });\n              if (m.size) {\n                arr.push(...m);\n              }\n            }\n            if (arr.length) {\n              if (j === 0) {\n                bool = true;\n              } else {\n                nextNodes = new Set(arr);\n              }\n            } else {\n              bool = false;\n              break;\n            }\n          }\n        }\n        if (bool) {\n          break;\n        }\n      }\n      if (astName === 'not') {\n        if (!bool) {\n          res = node;\n        }\n      } else if (bool) {\n        res = node;\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match pseudo-class selector\n   * @see https://html.spec.whatwg.org/#pseudo-classes\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {object} [opt] - options\n   * @param {boolean} [opt.forgive] - is forgiving selector list\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchPseudoClassSelector(ast, node, opt = {}) {\n    const { children: astChildren } = ast;\n    const { localName, parentNode } = node;\n    const { forgive } = opt;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    // :has(), :is(), :not(), :where()\n    if (REG_LOGICAL_PSEUDO.test(astName)) {\n      let astData;\n      if (this.#cache.has(ast)) {\n        astData = this.#cache.get(ast);\n      } else {\n        const branches = walkAST(ast);\n        const selectors = [];\n        const twigBranches = [];\n        for (const [...leaves] of branches) {\n          for (const leaf of leaves) {\n            const css = generateCSS(leaf);\n            selectors.push(css);\n          }\n          const branch = [];\n          const leavesSet = new Set();\n          let item = leaves.shift();\n          while (item) {\n            if (item.type === COMBINATOR) {\n              branch.push({\n                combo: item,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n            } else if (item) {\n              leavesSet.add(item);\n            }\n            if (leaves.length) {\n              item = leaves.shift();\n            } else {\n              branch.push({\n                combo: null,\n                leaves: [...leavesSet]\n              });\n              leavesSet.clear();\n              break;\n            }\n          }\n          twigBranches.push(branch);\n        }\n        astData = {\n          astName,\n          branches,\n          twigBranches,\n          selector: selectors.join(',')\n        };\n        this.#cache.set(ast, astData);\n      }\n      const res = this._matchLogicalPseudoFunc(astData, node);\n      if (res) {\n        matched.add(res);\n      }\n    } else if (Array.isArray(astChildren)) {\n      const [branch] = astChildren;\n      // :nth-child(), :nth-last-child(), nth-of-type(), :nth-last-of-type()\n      if (/^nth-(?:last-)?(?:child|of-type)$/.test(astName)) {\n        const nodes = this._matchAnPlusB(branch, node, astName);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      // :dir()\n      } else if (astName === 'dir') {\n        const res = this._matchDirectionPseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      // :lang()\n      } else if (astName === 'lang') {\n        const res = this._matchLanguagePseudoClass(branch, node);\n        if (res) {\n          matched.add(res);\n        }\n      } else {\n        switch (astName) {\n          case 'current':\n          case 'nth-col':\n          case 'nth-last-col': {\n            if (this.#warn) {\n              const msg = `Unsupported pseudo-class :${astName}()`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n            break;\n          }\n          case 'host':\n          case 'host-context': {\n            // ignore\n            break;\n          }\n          default: {\n            if (!forgive) {\n              const msg = `Unknown pseudo-class :${astName}()`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n          }\n        }\n      }\n    } else {\n      const regAnchor = /^a(?:rea)?$/;\n      const regFormCtrl =\n        /^(?:(?:fieldse|inpu|selec)t|button|opt(?:group|ion)|textarea)$/;\n      const regFormValidity = /^(?:(?:inpu|selec)t|button|form|textarea)$/;\n      const regInteract = /^d(?:etails|ialog)$/;\n      const regTypeCheck = /^(?:checkbox|radio)$/;\n      const regTypeDate = /^(?:date(?:time-local)?|month|time|week)$/;\n      const regTypeRange =\n        /(?:(?:rang|tim)e|date(?:time-local)?|month|number|week)$/;\n      const regTypeText = /^(?:(?:emai|te|ur)l|number|password|search|text)$/;\n      switch (astName) {\n        case 'any-link':\n        case 'link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'local-link': {\n          if (regAnchor.test(localName) && node.hasAttribute('href')) {\n            const { href, origin, pathname } = new URL(this.#document.URL);\n            const attrURL = new URL(node.getAttribute('href'), href);\n            if (attrURL.origin === origin && attrURL.pathname === pathname) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'visited': {\n          // prevent fingerprinting\n          break;\n        }\n        case 'target': {\n          const { hash } = new URL(this.#document.URL);\n          if (node.id && hash === `#${node.id}` &&\n              this.#document.contains(node)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'target-within': {\n          const { hash } = new URL(this.#document.URL);\n          if (hash) {\n            const id = hash.replace(/^#/, '');\n            let current = this.#document.getElementById(id);\n            while (current) {\n              if (current === node) {\n                matched.add(node);\n                break;\n              }\n              current = current.parentNode;\n            }\n          }\n          break;\n        }\n        case 'scope': {\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (node === this.#node) {\n              matched.add(node);\n            }\n          } else if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus': {\n          if (node === this.#document.activeElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'focus-within': {\n          let current = this.#document.activeElement;\n          while (current) {\n            if (current === node) {\n              matched.add(node);\n              break;\n            }\n            current = current.parentNode;\n          }\n          break;\n        }\n        case 'open': {\n          if (regInteract.test(localName) && node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'closed': {\n          if (regInteract.test(localName) && !node.hasAttribute('open')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'disabled': {\n          if (regFormCtrl.test(localName) || isCustomElementName(localName)) {\n            if (node.disabled || node.hasAttribute('disabled')) {\n              matched.add(node);\n            } else {\n              let parent = parentNode;\n              while (parent) {\n                if (parent.localName === 'fieldset') {\n                  break;\n                }\n                parent = parent.parentNode;\n              }\n              if (parent && parentNode.localName !== 'legend' &&\n                  parent.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'enabled': {\n          if ((regFormCtrl.test(localName) || isCustomElementName(localName)) &&\n              !(node.disabled && node.hasAttribute('disabled'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'read-only': {\n          switch (localName) {\n            case 'textarea': {\n              if (node.readonly || node.hasAttribute('readonly') ||\n                  node.disabled || node.hasAttribute('disabled')) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  (node.readonly || node.hasAttribute('readonly') ||\n                   node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (!isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'read-write': {\n          switch (localName) {\n            case 'textarea': {\n              if (!(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            case 'input': {\n              if ((!node.type || regTypeDate.test(node.type) ||\n                   regTypeText.test(node.type)) &&\n                  !(node.readonly || node.hasAttribute('readonly') ||\n                    node.disabled || node.hasAttribute('disabled'))) {\n                matched.add(node);\n              }\n              break;\n            }\n            default: {\n              if (isContentEditable(node)) {\n                matched.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case 'placeholder-shown': {\n          let targetNode;\n          if (localName === 'textarea') {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              if (regTypeText.test(node.getAttribute('type'))) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode && node.value === '' &&\n              node.hasAttribute('placeholder') &&\n              node.getAttribute('placeholder').trim().length) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'checked': {\n          if ((node.checked && localName === 'input' &&\n               node.hasAttribute('type') &&\n               regTypeCheck.test(node.getAttribute('type'))) ||\n              (node.selected && localName === 'option')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'indeterminate': {\n          if ((node.indeterminate && localName === 'input' &&\n               node.type === 'checkbox') ||\n              (localName === 'progress' && !node.hasAttribute('value'))) {\n            matched.add(node);\n          } else if (localName === 'input' && node.type === 'radio' &&\n                     !node.hasAttribute('checked')) {\n            const nodeName = node.name;\n            let parent = node.parentNode;\n            while (parent) {\n              if (parent.localName === 'form') {\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (!parent) {\n              parent = this.#document.documentElement;\n            }\n            let checked;\n            const nodes = [].slice.call(parent.getElementsByTagName('input'));\n            for (const item of nodes) {\n              if (item.getAttribute('type') === 'radio') {\n                if (nodeName) {\n                  if (item.getAttribute('name') === nodeName) {\n                    checked = !!item.checked;\n                  }\n                } else if (!item.hasAttribute('name')) {\n                  checked = !!item.checked;\n                }\n                if (checked) {\n                  break;\n                }\n              }\n            }\n            if (!checked) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'default': {\n          const regTypeReset = /^(?:button|reset)$/;\n          const regTypeSubmit = /^(?:image|submit)$/;\n          // button[type=\"submit\"], input[type=\"submit\"], input[type=\"image\"]\n          if ((localName === 'button' &&\n               !(node.hasAttribute('type') &&\n                 regTypeReset.test(node.getAttribute('type')))) ||\n              (localName === 'input' && node.hasAttribute('type') &&\n               regTypeSubmit.test(node.getAttribute('type')))) {\n            let form = node.parentNode;\n            while (form) {\n              if (form.localName === 'form') {\n                break;\n              }\n              form = form.parentNode;\n            }\n            if (form) {\n              const walker =\n                this.#document.createTreeWalker(form, SHOW_ELEMENT);\n              let nextNode = walker.firstChild();\n              while (nextNode) {\n                const nodeName = nextNode.localName;\n                let m;\n                if (nodeName === 'button') {\n                  m = !(nextNode.hasAttribute('type') &&\n                    regTypeReset.test(nextNode.getAttribute('type')));\n                } else if (nodeName === 'input') {\n                  m = nextNode.hasAttribute('type') &&\n                    regTypeSubmit.test(nextNode.getAttribute('type'));\n                }\n                if (m) {\n                  if (nextNode === node) {\n                    matched.add(node);\n                  }\n                  break;\n                }\n                nextNode = walker.nextNode();\n              }\n            }\n          // input[type=\"checkbox\"], input[type=\"radio\"]\n          } else if (localName === 'input' && node.hasAttribute('type') &&\n                     regTypeCheck.test(node.getAttribute('type')) &&\n                     (node.checked || node.hasAttribute('checked'))) {\n            matched.add(node);\n          // option\n          } else if (localName === 'option') {\n            let isMultiple = false;\n            let parent = parentNode;\n            while (parent) {\n              if (parent.localName === 'datalist') {\n                break;\n              } else if (parent.localName === 'select') {\n                if (parent.multiple || parent.hasAttribute('multiple')) {\n                  isMultiple = true;\n                }\n                break;\n              }\n              parent = parent.parentNode;\n            }\n            if (isMultiple) {\n              if (node.selected || node.hasAttribute('selected')) {\n                matched.add(node);\n              }\n            } else {\n              const defaultOpt = new Set();\n              const walker =\n                this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n              let refNode = walker.firstChild();\n              while (refNode) {\n                if (refNode.selected || refNode.hasAttribute('selected')) {\n                  defaultOpt.add(refNode);\n                  break;\n                }\n                refNode = walker.nextSibling();\n              }\n              if (defaultOpt.size) {\n                if (defaultOpt.has(node)) {\n                  matched.add(node);\n                }\n              }\n            }\n          }\n          break;\n        }\n        case 'valid': {\n          if (regFormValidity.test(localName)) {\n            if (node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'invalid': {\n          if (regFormValidity.test(localName)) {\n            if (!node.checkValidity()) {\n              matched.add(node);\n            }\n          } else if (localName === 'fieldset') {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              if (regFormValidity.test(refNode.localName)) {\n                bool = refNode.checkValidity();\n                if (!bool) {\n                  break;\n                }\n              }\n              refNode = walker.nextNode();\n            }\n            if (!bool) {\n              matched.add(node);\n            }\n          }\n          break;\n        }\n        case 'in-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              !(node.validity.rangeUnderflow ||\n                node.validity.rangeOverflow) &&\n              (node.hasAttribute('min') || node.hasAttribute('max') ||\n               node.getAttribute('type') === 'range')) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'out-of-range': {\n          if (localName === 'input' &&\n              !(node.readonly || node.hasAttribute('readonly')) &&\n              !(node.disabled || node.hasAttribute('disabled')) &&\n              node.hasAttribute('type') &&\n              regTypeRange.test(node.getAttribute('type')) &&\n              (node.validity.rangeUnderflow || node.validity.rangeOverflow)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'required': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              (node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'optional': {\n          let targetNode;\n          if (/^(?:select|textarea)$/.test(localName)) {\n            targetNode = node;\n          } else if (localName === 'input') {\n            if (node.hasAttribute('type')) {\n              const inputType = node.getAttribute('type');\n              if (inputType === 'file' || regTypeCheck.test(inputType) ||\n                  regTypeDate.test(inputType) || regTypeText.test(inputType)) {\n                targetNode = node;\n              }\n            } else {\n              targetNode = node;\n            }\n          }\n          if (targetNode &&\n              !(node.required || node.hasAttribute('required'))) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'root': {\n          if (node === this.#document.documentElement) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'empty': {\n          if (node.hasChildNodes()) {\n            let bool;\n            const walker = this.#document.createTreeWalker(node, SHOW_ALL);\n            let refNode = walker.firstChild();\n            while (refNode) {\n              bool = refNode.nodeType !== ELEMENT_NODE &&\n                refNode.nodeType !== TEXT_NODE;\n              if (!bool) {\n                break;\n              }\n              refNode = walker.nextSibling();\n            }\n            if (bool) {\n              matched.add(node);\n            }\n          } else {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-child': {\n          if ((parentNode && node === parentNode.firstElementChild) ||\n              (node === this.#root && this.#root.nodeType === ELEMENT_NODE)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-child': {\n          if ((parentNode && node === parentNode.lastElementChild) ||\n              (node === this.#root && this.#root.nodeType === ELEMENT_NODE)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-child': {\n          if ((parentNode &&\n               node === parentNode.firstElementChild &&\n               node === parentNode.lastElementChild) ||\n              (node === this.#root && this.#root.nodeType === ELEMENT_NODE)) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'first-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root &&\n                     this.#root.nodeType === ELEMENT_NODE) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'last-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1,\n              reverse: true\n            }, node);\n            if (node1) {\n              matched.add(node1);\n            }\n          } else if (node === this.#root &&\n                     this.#root.nodeType === ELEMENT_NODE) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'only-of-type': {\n          if (parentNode) {\n            const [node1] = this._collectNthOfType({\n              a: 0,\n              b: 1\n            }, node);\n            if (node1 === node) {\n              const [node2] = this._collectNthOfType({\n                a: 0,\n                b: 1,\n                reverse: true\n              }, node);\n              if (node2 === node) {\n                matched.add(node);\n              }\n            }\n          } else if (node === this.#root &&\n                     this.#root.nodeType === ELEMENT_NODE) {\n            matched.add(node);\n          }\n          break;\n        }\n        case 'host':\n        case 'host-context': {\n          // ignore\n          break;\n        }\n        // legacy pseudo-elements\n        case 'after':\n        case 'before':\n        case 'first-letter':\n        case 'first-line': {\n          if (this.#warn) {\n            const msg = `Unsupported pseudo-element ::${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        case 'active':\n        case 'autofill':\n        case 'blank':\n        case 'buffering':\n        case 'current':\n        case 'defined':\n        case 'focus-visible':\n        case 'fullscreen':\n        case 'future':\n        case 'hover':\n        case 'modal':\n        case 'muted':\n        case 'past':\n        case 'paused':\n        case 'picture-in-picture':\n        case 'playing':\n        case 'seeking':\n        case 'stalled':\n        case 'user-invalid':\n        case 'user-valid':\n        case 'volume-locked':\n        case '-webkit-autofill': {\n          if (this.#warn) {\n            const msg = `Unsupported pseudo-class :${astName}`;\n            throw new DOMException(msg, NOT_SUPPORTED_ERR);\n          }\n          break;\n        }\n        default: {\n          if (astName.startsWith('-webkit-')) {\n            if (this.#warn) {\n              const msg = `Unsupported pseudo-class :${astName}`;\n              throw new DOMException(msg, NOT_SUPPORTED_ERR);\n            }\n          } else if (!forgive) {\n            const msg = `Unknown pseudo-class :${astName}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match attribute selector\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchAttributeSelector(ast, node) {\n    const {\n      flags: astFlags, matcher: astMatcher, name: astName, value: astValue\n    } = ast;\n    if (typeof astFlags === 'string' && !/^[is]$/i.test(astFlags)) {\n      const css = generateCSS(ast);\n      const msg = `Invalid selector ${css}`;\n      throw new DOMException(msg, SYNTAX_ERR);\n    }\n    const { attributes } = node;\n    let res;\n    if (attributes && attributes.length) {\n      let caseInsensitive;\n      if (this.#document.contentType === 'text/html') {\n        if (typeof astFlags === 'string' && /^s$/i.test(astFlags)) {\n          caseInsensitive = false;\n        } else {\n          caseInsensitive = true;\n        }\n      } else if (typeof astFlags === 'string' && /^i$/i.test(astFlags)) {\n        caseInsensitive = true;\n      } else {\n        caseInsensitive = false;\n      }\n      let astAttrName = unescapeSelector(astName.name);\n      if (caseInsensitive) {\n        astAttrName = astAttrName.toLowerCase();\n      }\n      const attrValues = new Set();\n      // namespaced\n      if (astAttrName.indexOf('|') > -1) {\n        const {\n          prefix: astAttrPrefix, tagName: astAttrLocalName\n        } = selectorToNodeProps(astAttrName);\n        for (let { name: itemName, value: itemValue } of attributes) {\n          if (caseInsensitive) {\n            itemName = itemName.toLowerCase();\n            itemValue = itemValue.toLowerCase();\n          }\n          switch (astAttrPrefix) {\n            case '': {\n              if (astAttrLocalName === itemName) {\n                attrValues.add(itemValue);\n              }\n              break;\n            }\n            case '*': {\n              if (itemName.indexOf(':') > -1) {\n                if (itemName.endsWith(`:${astAttrLocalName}`)) {\n                  attrValues.add(itemValue);\n                }\n              } else if (astAttrLocalName === itemName) {\n                attrValues.add(itemValue);\n              }\n              break;\n            }\n            default: {\n              if (itemName.indexOf(':') > -1) {\n                const [itemNamePrefix, itemNameLocalName] = itemName.split(':');\n                if (astAttrPrefix === itemNamePrefix &&\n                    astAttrLocalName === itemNameLocalName &&\n                    isNamespaceDeclared(astAttrPrefix, node)) {\n                  attrValues.add(itemValue);\n                }\n              }\n            }\n          }\n        }\n      } else {\n        for (let { name: itemName, value: itemValue } of attributes) {\n          if (caseInsensitive) {\n            itemName = itemName.toLowerCase();\n            itemValue = itemValue.toLowerCase();\n          }\n          if (itemName.indexOf(':') > -1) {\n            const [itemNamePrefix, itemNameLocalName] = itemName.split(':');\n            // ignore xml:lang\n            if (itemNamePrefix === 'xml' && itemNameLocalName === 'lang') {\n              continue;\n            } else if (astAttrName === itemNameLocalName) {\n              attrValues.add(itemValue);\n            }\n          } else if (astAttrName === itemName) {\n            attrValues.add(itemValue);\n          }\n        }\n      }\n      if (attrValues.size) {\n        const {\n          name: astAttrIdentValue, value: astAttrStringValue\n        } = astValue || {};\n        let attrValue;\n        if (astAttrIdentValue) {\n          if (caseInsensitive) {\n            attrValue = astAttrIdentValue.toLowerCase();\n          } else {\n            attrValue = astAttrIdentValue;\n          }\n        } else if (astAttrStringValue) {\n          if (caseInsensitive) {\n            attrValue = astAttrStringValue.toLowerCase();\n          } else {\n            attrValue = astAttrStringValue;\n          }\n        } else if (astAttrStringValue === '') {\n          attrValue = astAttrStringValue;\n        }\n        switch (astMatcher) {\n          case '=': {\n            if (typeof attrValue === 'string' && attrValues.has(attrValue)) {\n              res = node;\n            }\n            break;\n          }\n          case '~=': {\n            if (attrValue && typeof attrValue === 'string') {\n              for (const value of attrValues) {\n                const item = new Set(value.split(/\\s+/));\n                if (item.has(attrValue)) {\n                  res = node;\n                  break;\n                }\n              }\n            }\n            break;\n          }\n          case '|=': {\n            if (attrValue && typeof attrValue === 'string') {\n              let item;\n              for (const value of attrValues) {\n                if (value === attrValue || value.startsWith(`${attrValue}-`)) {\n                  item = value;\n                  break;\n                }\n              }\n              if (item) {\n                res = node;\n              }\n            }\n            break;\n          }\n          case '^=': {\n            if (attrValue && typeof attrValue === 'string') {\n              let item;\n              for (const value of attrValues) {\n                if (value.startsWith(`${attrValue}`)) {\n                  item = value;\n                  break;\n                }\n              }\n              if (item) {\n                res = node;\n              }\n            }\n            break;\n          }\n          case '$=': {\n            if (attrValue && typeof attrValue === 'string') {\n              let item;\n              for (const value of attrValues) {\n                if (value.endsWith(`${attrValue}`)) {\n                  item = value;\n                  break;\n                }\n              }\n              if (item) {\n                res = node;\n              }\n            }\n            break;\n          }\n          case '*=': {\n            if (attrValue && typeof attrValue === 'string') {\n              let item;\n              for (const value of attrValues) {\n                if (value.includes(`${attrValue}`)) {\n                  item = value;\n                  break;\n                }\n              }\n              if (item) {\n                res = node;\n              }\n            }\n            break;\n          }\n          case null:\n          default: {\n            res = node;\n          }\n        }\n      }\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match class selector\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchClassSelector(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (node.classList.contains(astName)) {\n      res = node;\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match ID selector\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @returns {?object} - matched node\n   */\n  _matchIDSelector(ast, node) {\n    const astName = unescapeSelector(ast.name);\n    const { id } = node;\n    let res;\n    if (astName === id) {\n      res = node;\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match type selector\n   * @param {object} ast - AST\n   * @param {object} node - Element node\n   * @param {object} [opt] - options\n   * @param {boolean} [opt.forgive] - is forgiving selector list\n   * @returns {?object} - matched node\n   */\n  _matchTypeSelector(ast, node, opt = {}) {\n    const astName = unescapeSelector(ast.name);\n    const { localName, prefix } = node;\n    const { forgive } = opt;\n    let {\n      prefix: astPrefix, tagName: astNodeName\n    } = selectorToNodeProps(astName, node);\n    if (this.#document.contentType === 'text/html') {\n      astPrefix = astPrefix.toLowerCase();\n      astNodeName = astNodeName.toLowerCase();\n    }\n    let nodePrefix;\n    let nodeName;\n    // just in case that the namespaced content is parsed as text/html\n    if (localName.indexOf(':') > -1) {\n      [nodePrefix, nodeName] = localName.split(':');\n    } else {\n      nodePrefix = prefix || '';\n      nodeName = localName;\n    }\n    let res;\n    if (astPrefix === '' && nodePrefix === '') {\n      if (node.namespaceURI === null &&\n          (astNodeName === '*' || astNodeName === nodeName)) {\n        res = node;\n      }\n    } else if (astPrefix === '*') {\n      if (astNodeName === '*' || astNodeName === nodeName) {\n        res = node;\n      }\n    } else if (astPrefix === nodePrefix) {\n      if (isNamespaceDeclared(astPrefix, node)) {\n        if (astNodeName === '*' || astNodeName === nodeName) {\n          res = node;\n        }\n      } else if (!forgive) {\n        const msg = `Undeclared namespace ${astPrefix}`;\n        throw new DOMException(msg, SYNTAX_ERR);\n      }\n    } else if (astPrefix && !forgive && !isNamespaceDeclared(astPrefix, node)) {\n      const msg = `Undeclared namespace ${astPrefix}`;\n      throw new DOMException(msg, SYNTAX_ERR);\n    }\n    return res ?? null;\n  };\n\n  /**\n   * match shadow host pseudo class\n   * @param {object} ast - AST\n   * @param {object} node - DocumentFragment node\n   * @returns {?object} - matched node\n   */\n  _matchShadowHostPseudoClass(ast, node) {\n    const { children: astChildren } = ast;\n    const astName = unescapeSelector(ast.name);\n    let res;\n    if (Array.isArray(astChildren)) {\n      const [branch] = walkAST(astChildren[0]);\n      const [...leaves] = branch;\n      const { host } = node;\n      if (astName === 'host') {\n        let bool;\n        for (const leaf of leaves) {\n          const { type: leafType } = leaf;\n          if (leafType === COMBINATOR) {\n            const css = generateCSS(ast);\n            const msg = `Invalid selector ${css}`;\n            throw new DOMException(msg, SYNTAX_ERR);\n          }\n          bool = this._matchSelector(leaf, host).has(host);\n          if (!bool) {\n            break;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      } else if (astName === 'host-context') {\n        let bool;\n        let parent = host;\n        while (parent) {\n          for (const leaf of leaves) {\n            const { type: leafType } = leaf;\n            if (leafType === COMBINATOR) {\n              const css = generateCSS(ast);\n              const msg = `Invalid selector ${css}`;\n              throw new DOMException(msg, SYNTAX_ERR);\n            }\n            bool = this._matchSelector(leaf, parent).has(parent);\n            if (!bool) {\n              break;\n            }\n          }\n          if (bool) {\n            break;\n          } else {\n            parent = parent.parentNode;\n          }\n        }\n        if (bool) {\n          res = node;\n        }\n      }\n    } else if (astName === 'host') {\n      res = node;\n    } else {\n      const msg = `Invalid selector :${astName}`;\n      throw new DOMException(msg, SYNTAX_ERR);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * match selector\n   * @param {object} ast - AST\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {object} [opt] - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchSelector(ast, node, opt) {\n    const { type: astType } = ast;\n    const astName = unescapeSelector(ast.name);\n    let matched = new Set();\n    if (node.nodeType === ELEMENT_NODE) {\n      switch (astType) {\n        case SELECTOR_ATTR: {\n          const res = this._matchAttributeSelector(ast, node);\n          if (res) {\n            matched.add(res);\n          }\n          break;\n        }\n        case SELECTOR_CLASS: {\n          const res = this._matchClassSelector(ast, node);\n          if (res) {\n            matched.add(res);\n          }\n          break;\n        }\n        case SELECTOR_ID: {\n          const res = this._matchIDSelector(ast, node);\n          if (res) {\n            matched.add(res);\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_CLASS: {\n          const nodes = this._matchPseudoClassSelector(ast, node, opt);\n          if (nodes.size) {\n            matched = nodes;\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_ELEMENT: {\n          this._matchPseudoElementSelector(astName, opt);\n          break;\n        }\n        case SELECTOR_TYPE:\n        default: {\n          const res = this._matchTypeSelector(ast, node, opt);\n          if (res) {\n            matched.add(res);\n          }\n        }\n      }\n    } else if (this.#shadow && astType === SELECTOR_PSEUDO_CLASS &&\n               node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n      if (astName !== 'has' && REG_LOGICAL_PSEUDO.test(astName)) {\n        const nodes = this._matchPseudoClassSelector(ast, node, opt);\n        if (nodes.size) {\n          matched = nodes;\n        }\n      } else if (REG_SHADOW_HOST.test(astName)) {\n        const res = this._matchShadowHostPseudoClass(ast, node);\n        if (res) {\n          matched.add(res);\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * match leaves\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} node - node\n   * @param {object} [opt] - options\n   * @returns {boolean} - result\n   */\n  _matchLeaves(leaves, node, opt) {\n    let bool;\n    for (const leaf of leaves) {\n      bool = this._matchSelector(leaf, node, opt).has(node);\n      if (!bool) {\n        break;\n      }\n    }\n    return !!bool;\n  }\n\n  /**\n   * find descendant nodes\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} baseNode - base Element node\n   * @returns {object} - collection of nodes and pending state\n   */\n  _findDescendantNodes(leaves, baseNode) {\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = new Set();\n    let pending = false;\n    if (this.#shadow) {\n      pending = true;\n    } else {\n      switch (leafType) {\n        case SELECTOR_ID: {\n          if (this.#root.nodeType === ELEMENT_NODE) {\n            pending = true;\n          } else {\n            const node = this.#root.getElementById(leafName);\n            if (node && node !== baseNode && baseNode.contains(node)) {\n              if (compound) {\n                const bool = this._matchLeaves(filterLeaves, node);\n                if (bool) {\n                  nodes.add(node);\n                }\n              } else {\n                nodes.add(node);\n              }\n            }\n          }\n          break;\n        }\n        case SELECTOR_CLASS: {\n          const arr = [].slice.call(baseNode.getElementsByClassName(leafName));\n          if (arr.length) {\n            if (compound) {\n              for (const node of arr) {\n                const bool = this._matchLeaves(filterLeaves, node);\n                if (bool) {\n                  nodes.add(node);\n                }\n              }\n            } else {\n              nodes = new Set(arr);\n            }\n          }\n          break;\n        }\n        case SELECTOR_TYPE: {\n          if (this.#document.contentType === 'text/html' &&\n              !/[*|]/.test(leafName)) {\n            const arr = [].slice.call(baseNode.getElementsByTagName(leafName));\n            if (arr.length) {\n              if (compound) {\n                for (const node of arr) {\n                  const bool = this._matchLeaves(filterLeaves, node);\n                  if (bool) {\n                    nodes.add(node);\n                  }\n                }\n              } else {\n                nodes = new Set(arr);\n              }\n            }\n          } else {\n            pending = true;\n          }\n          break;\n        }\n        case SELECTOR_PSEUDO_ELEMENT: {\n          this._matchPseudoElementSelector(leafName);\n          break;\n        }\n        default: {\n          pending = true;\n        }\n      }\n    }\n    return {\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * match combinator\n   * @param {object} twig - twig\n   * @param {object} node - Element node\n   * @param {object} [opt] - option\n   * @param {string} [opt.dir] - direction to find\n   * @param {boolean} [opt.forgive] - is forgiving selector list\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchCombinator(twig, node, opt = {}) {\n    const { combo, leaves } = twig;\n    const { name: comboName } = combo;\n    const { dir, forgive } = opt;\n    let matched = new Set();\n    if (dir === DIR_NEXT) {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.nextElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, { forgive });\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const { parentNode } = node;\n          if (parentNode) {\n            const walker =\n              this.#document.createTreeWalker(parentNode, SHOW_ELEMENT);\n            let refNode = this._traverse(node, walker);\n            if (refNode === node) {\n              refNode = walker.nextSibling();\n            }\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, { forgive });\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextSibling();\n            }\n          }\n          break;\n        }\n        case '>': {\n          const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, { forgive });\n            if (bool) {\n              matched.add(refNode);\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const { nodes, pending } = this._findDescendantNodes(leaves, node);\n          if (nodes.size) {\n            matched = nodes;\n          } else if (pending) {\n            const walker = this.#document.createTreeWalker(node, SHOW_ELEMENT);\n            let refNode = walker.nextNode();\n            while (refNode) {\n              const bool = this._matchLeaves(leaves, refNode, { forgive });\n              if (bool) {\n                matched.add(refNode);\n              }\n              refNode = walker.nextNode();\n            }\n          }\n        }\n      }\n    } else {\n      switch (comboName) {\n        case '+': {\n          const refNode = node.previousElementSibling;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, { forgive });\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case '~': {\n          const walker =\n            this.#document.createTreeWalker(node.parentNode, SHOW_ELEMENT);\n          let refNode = walker.firstChild();\n          while (refNode) {\n            if (refNode === node) {\n              break;\n            } else {\n              const bool = this._matchLeaves(leaves, refNode, { forgive });\n              if (bool) {\n                matched.add(refNode);\n              }\n            }\n            refNode = walker.nextSibling();\n          }\n          break;\n        }\n        case '>': {\n          const refNode = node.parentNode;\n          if (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, { forgive });\n            if (bool) {\n              matched.add(refNode);\n            }\n          }\n          break;\n        }\n        case ' ':\n        default: {\n          const arr = [];\n          let refNode = node.parentNode;\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode, { forgive });\n            if (bool) {\n              arr.push(refNode);\n            }\n            refNode = refNode.parentNode;\n          }\n          if (arr.length) {\n            matched = new Set(arr.reverse());\n          }\n        }\n      }\n    }\n    return matched;\n  }\n\n  /**\n   * find matched node from finder\n   * @param {Array.<object>} leaves - AST leaves\n   * @param {object} [opt] - options\n   * @param {object} [opt.node] - node to start from\n   * @returns {?object} - matched node\n   */\n  _findNode(leaves, opt = {}) {\n    const { node } = opt;\n    let matchedNode;\n    let refNode = this._traverse(node, this.#finder);\n    if (refNode) {\n      if (refNode.nodeType !== ELEMENT_NODE) {\n        refNode = this.#finder.nextNode();\n      } else if (refNode === node) {\n        if (refNode !== this.#root) {\n          refNode = this.#finder.nextNode();\n        }\n      }\n      while (refNode) {\n        let bool;\n        if (this.#node.nodeType === ELEMENT_NODE) {\n          if (refNode === this.#node) {\n            bool = true;\n          } else {\n            bool = this.#node.contains(refNode);\n          }\n        } else {\n          bool = true;\n        }\n        if (bool) {\n          const matched = this._matchLeaves(leaves, refNode);\n          if (matched) {\n            matchedNode = refNode;\n            break;\n          }\n        }\n        refNode = this.#finder.nextNode();\n      }\n    }\n    return matchedNode ?? null;\n  }\n\n  /**\n   * find entry nodes\n   * @param {object} twig - twig\n   * @param {string} targetType - target type\n   * @returns {object} - collection of nodes etc.\n   */\n  _findEntryNodes(twig, targetType) {\n    const { leaves } = twig;\n    const [leaf, ...filterLeaves] = leaves;\n    const { type: leafType } = leaf;\n    const leafName = unescapeSelector(leaf.name);\n    const compound = filterLeaves.length > 0;\n    let nodes = new Set();\n    let filtered = false;\n    let pending = false;\n    switch (leafType) {\n      case SELECTOR_ID: {\n        if (targetType === TARGET_SELF) {\n          const bool = this._matchLeaves(leaves, this.#node);\n          if (bool) {\n            nodes.add(this.#node);\n            filtered = true;\n          }\n        } else if (targetType === TARGET_LINEAL) {\n          let refNode = this.#node;\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode);\n            if (bool) {\n              nodes.add(refNode);\n              filtered = true;\n            }\n            refNode = refNode.parentNode;\n          }\n        } else if (targetType === TARGET_FIRST &&\n                   this.#root.nodeType !== ELEMENT_NODE) {\n          const node = this.#root.getElementById(leafName);\n          if (node) {\n            nodes.add(node);\n          }\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_CLASS: {\n        if (targetType === TARGET_SELF) {\n          if (this.#node.nodeType === ELEMENT_NODE &&\n              this.#node.classList.contains(leafName)) {\n            nodes.add(this.#node);\n          }\n        } else if (targetType === TARGET_LINEAL) {\n          let refNode = this.#node;\n          while (refNode) {\n            if (refNode.nodeType === ELEMENT_NODE) {\n              if (refNode.classList.contains(leafName)) {\n                nodes.add(refNode);\n              }\n              refNode = refNode.parentNode;\n            } else {\n              break;\n            }\n          }\n        } else if (targetType === TARGET_FIRST) {\n          const node = this._findNode(leaves, {\n            node: this.#node\n          });\n          if (node) {\n            nodes.add(node);\n            filtered = true;\n          }\n        } else if (this.#root.nodeType === DOCUMENT_NODE) {\n          const arr =\n            [].slice.call(this.#root.getElementsByClassName(leafName));\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            for (const node of arr) {\n              if (node === this.#node || isInclusive(node, this.#node)) {\n                nodes.add(node);\n              }\n            }\n          } else if (arr.length) {\n            nodes = new Set(arr);\n          }\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_TYPE: {\n        if (targetType === TARGET_SELF) {\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            const bool = this._matchLeaves(leaves, this.#node);\n            if (bool) {\n              nodes.add(this.#node);\n              filtered = true;\n            }\n          }\n        } else if (targetType === TARGET_LINEAL) {\n          let refNode = this.#node;\n          while (refNode) {\n            if (refNode.nodeType === ELEMENT_NODE) {\n              const bool = this._matchLeaves(leaves, refNode);\n              if (bool) {\n                nodes.add(refNode);\n                filtered = true;\n              }\n              refNode = refNode.parentNode;\n            } else {\n              break;\n            }\n          }\n        } else if (targetType === TARGET_FIRST) {\n          const node = this._findNode(leaves, {\n            node: this.#node\n          });\n          if (node) {\n            nodes.add(node);\n            filtered = true;\n          }\n        } else if (this.#document.contentType === 'text/html' &&\n                   this.#root.nodeType === DOCUMENT_NODE &&\n                   !/[*|]/.test(leafName)) {\n          const arr = [].slice.call(this.#root.getElementsByTagName(leafName));\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            for (const node of arr) {\n              if (node === this.#node || isInclusive(node, this.#node)) {\n                nodes.add(node);\n              }\n            }\n          } else if (arr.length) {\n            nodes = new Set(arr);\n          }\n        } else {\n          pending = true;\n        }\n        break;\n      }\n      case SELECTOR_PSEUDO_ELEMENT: {\n        // throws\n        this._matchPseudoElementSelector(leafName);\n        break;\n      }\n      default: {\n        if (targetType !== TARGET_LINEAL && REG_SHADOW_HOST.test(leafName)) {\n          if (this.#shadow && this.#node.nodeType === DOCUMENT_FRAGMENT_NODE) {\n            const node = this._matchShadowHostPseudoClass(leaf, this.#node);\n            if (node) {\n              nodes.add(node);\n            }\n          }\n        } else if (targetType === TARGET_SELF) {\n          const bool = this._matchLeaves(leaves, this.#node);\n          if (bool) {\n            nodes.add(this.#node);\n            filtered = true;\n          }\n        } else if (targetType === TARGET_LINEAL) {\n          let refNode = this.#node;\n          while (refNode) {\n            const bool = this._matchLeaves(leaves, refNode);\n            if (bool) {\n              nodes.add(refNode);\n              filtered = true;\n            }\n            refNode = refNode.parentNode;\n          }\n        } else if (targetType === TARGET_FIRST) {\n          const node = this._findNode(leaves, {\n            node: this.#node\n          });\n          if (node) {\n            nodes.add(node);\n            filtered = true;\n          }\n        } else {\n          pending = true;\n        }\n      }\n    }\n    return {\n      compound,\n      filtered,\n      nodes,\n      pending\n    };\n  }\n\n  /**\n   * get entry twig\n   * @param {Array.<object>} branch - AST branch\n   * @param {string} targetType - target type\n   * @returns {object} - direction and twig\n   */\n  _getEntryTwig(branch, targetType) {\n    const branchLen = branch.length;\n    const complex = branchLen > 1;\n    const firstTwig = branch[0];\n    let dir;\n    let twig;\n    if (complex) {\n      const {\n        combo: firstCombo,\n        leaves: [{\n          name: firstName,\n          type: firstType\n        }]\n      } = firstTwig;\n      const lastTwig = branch[branchLen - 1];\n      const {\n        leaves: [{\n          name: lastName,\n          type: lastType\n        }]\n      } = lastTwig;\n      if (lastType === SELECTOR_PSEUDO_ELEMENT || lastType === SELECTOR_ID) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else if (firstType === SELECTOR_PSEUDO_ELEMENT ||\n                 firstType === SELECTOR_ID) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (targetType === TARGET_ALL) {\n        if (firstName === '*' && firstType === SELECTOR_TYPE) {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else if (branchLen === 2) {\n          const { name: comboName } = firstCombo;\n          if (/^[+~]$/.test(comboName)) {\n            dir = DIR_PREV;\n            twig = lastTwig;\n          } else {\n            dir = DIR_NEXT;\n            twig = firstTwig;\n          }\n        } else {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        }\n      } else if (lastName === '*' && lastType === SELECTOR_TYPE) {\n        dir = DIR_NEXT;\n        twig = firstTwig;\n      } else if (firstName === '*' && firstType === SELECTOR_TYPE) {\n        dir = DIR_PREV;\n        twig = lastTwig;\n      } else {\n        let bool;\n        let sibling;\n        for (const { combo, leaves: [leaf] } of branch) {\n          const { type: leafType } = leaf;\n          const leafName = unescapeSelector(leaf.name);\n          if (leafType === SELECTOR_PSEUDO_CLASS && leafName === 'dir') {\n            bool = false;\n            break;\n          }\n          if (combo && !sibling) {\n            const { name: comboName } = combo;\n            if (/^[+~]$/.test(comboName)) {\n              bool = true;\n              sibling = true;\n            }\n          }\n        }\n        if (bool) {\n          dir = DIR_NEXT;\n          twig = firstTwig;\n        } else {\n          dir = DIR_PREV;\n          twig = lastTwig;\n        }\n      }\n    } else {\n      dir = DIR_PREV;\n      twig = firstTwig;\n    }\n    return {\n      complex,\n      dir,\n      twig\n    };\n  }\n\n  /**\n   * collect nodes\n   * @param {string} targetType - target type\n   * @returns {Array.<Array.<object|undefined>>} - #ast and #nodes\n   */\n  _collectNodes(targetType) {\n    const ast = this.#ast.values();\n    if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n      const pendingItems = new Set();\n      let i = 0;\n      for (const { branch } of ast) {\n        const { dir, twig } = this._getEntryTwig(branch, targetType);\n        const {\n          compound, filtered, nodes, pending\n        } = this._findEntryNodes(twig, targetType);\n        if (nodes.size) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        } else if (pending) {\n          pendingItems.add(new Map([\n            ['index', i],\n            ['twig', twig]\n          ]));\n        }\n        this.#ast[i].dir = dir;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n      if (pendingItems.size) {\n        let node;\n        let walker;\n        if (this.#node !== this.#root && this.#node.nodeType === ELEMENT_NODE) {\n          node = this.#node;\n          walker = this.#finder;\n        } else {\n          node = this.#root;\n          walker = this.#tree;\n        }\n        let nextNode = this._traverse(node, walker);\n        while (nextNode) {\n          let bool = false;\n          if (this.#node.nodeType === ELEMENT_NODE) {\n            if (nextNode === this.#node) {\n              bool = true;\n            } else {\n              bool = this.#node.contains(nextNode);\n            }\n          } else {\n            bool = true;\n          }\n          if (bool) {\n            for (const pendingItem of pendingItems) {\n              const { leaves } = pendingItem.get('twig');\n              const matched = this._matchLeaves(leaves, nextNode);\n              if (matched) {\n                const index = pendingItem.get('index');\n                this.#ast[index].filtered = true;\n                this.#ast[index].find = true;\n                this.#nodes[index].add(nextNode);\n              }\n            }\n          }\n          nextNode = walker.nextNode();\n        }\n      }\n    } else {\n      let i = 0;\n      for (const { branch } of ast) {\n        const twig = branch[branch.length - 1];\n        const {\n          compound, filtered, nodes\n        } = this._findEntryNodes(twig, targetType);\n        if (nodes.size) {\n          this.#ast[i].find = true;\n          this.#nodes[i] = nodes;\n        }\n        this.#ast[i].dir = DIR_PREV;\n        this.#ast[i].filtered = filtered || !compound;\n        i++;\n      }\n    }\n    return [\n      this.#ast,\n      this.#nodes\n    ];\n  }\n\n  /**\n   * sort nodes\n   * @param {Array.<object>|Set.<object>} nodes - collection of nodes\n   * @returns {Array.<object|undefined>} - collection of sorted nodes\n   */\n  _sortNodes(nodes) {\n    const arr = [...nodes];\n    if (arr.length > 1) {\n      arr.sort((a, b) => {\n        let res;\n        if (isPreceding(b, a)) {\n          res = 1;\n        } else {\n          res = -1;\n        }\n        return res;\n      });\n    }\n    return arr;\n  }\n\n  /**\n   * match nodes\n   * @param {string} targetType - target type\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _matchNodes(targetType) {\n    const [...branches] = this.#ast;\n    const l = branches.length;\n    let nodes = new Set();\n    for (let i = 0; i < l; i++) {\n      const { branch, dir, filtered, find } = branches[i];\n      const branchLen = branch.length;\n      if (branchLen && find) {\n        const entryNodes = this.#nodes[i];\n        const lastIndex = branchLen - 1;\n        if (lastIndex === 0) {\n          const { leaves: [, ...filterLeaves] } = branch[0];\n          if ((targetType === TARGET_ALL || targetType === TARGET_FIRST) &&\n              this.#node.nodeType === ELEMENT_NODE) {\n            for (const node of entryNodes) {\n              const bool = filtered || this._matchLeaves(filterLeaves, node);\n              if (bool && node !== this.#node && this.#node.contains(node)) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          } else if (!filterLeaves.length) {\n            if (targetType === TARGET_ALL) {\n              if (nodes.size) {\n                const n = [...nodes];\n                nodes = new Set([...n, ...entryNodes]);\n                this.#sort = true;\n              } else {\n                nodes = new Set([...entryNodes]);\n              }\n            } else {\n              const [node] = [...entryNodes];\n              nodes.add(node);\n            }\n          } else {\n            for (const node of entryNodes) {\n              const bool = filtered || this._matchLeaves(filterLeaves, node);\n              if (bool) {\n                nodes.add(node);\n                if (targetType !== TARGET_ALL) {\n                  break;\n                }\n              }\n            }\n          }\n        } else if (dir === DIR_NEXT) {\n          let { combo, leaves: entryLeaves } = branch[0];\n          const [, ...filterLeaves] = entryLeaves;\n          let matched;\n          for (const node of entryNodes) {\n            const bool = filtered || this._matchLeaves(filterLeaves, node);\n            if (bool) {\n              let nextNodes = new Set([node]);\n              for (let j = 1; j < branchLen; j++) {\n                const { combo: nextCombo, leaves } = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const twig = {\n                    combo,\n                    leaves\n                  };\n                  const m = this._matchCombinator(twig, nextNode, { dir });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === lastIndex) {\n                    if (targetType === TARGET_ALL) {\n                      if (nodes.size) {\n                        const n = [...nodes];\n                        nodes = new Set([...n, ...arr]);\n                      } else {\n                        nodes = new Set([...arr]);\n                      }\n                      this.#sort = true;\n                    } else {\n                      const [node] = this._sortNodes(arr);\n                      nodes.add(node);\n                    }\n                    matched = true;\n                  } else {\n                    combo = nextCombo;\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n            } else {\n              matched = false;\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = 1; j < branchLen; j++) {\n                const { combo: nextCombo, leaves } = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const twig = {\n                    combo,\n                    leaves\n                  };\n                  const m = this._matchCombinator(twig, nextNode, { dir });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === lastIndex) {\n                    const [node] = this._sortNodes(arr);\n                    nodes.add(node);\n                    matched = true;\n                  } else {\n                    combo = nextCombo;\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        } else {\n          const { leaves: entryLeaves } = branch[lastIndex];\n          const [, ...filterLeaves] = entryLeaves;\n          let matched;\n          for (const node of entryNodes) {\n            const bool = filtered || this._matchLeaves(filterLeaves, node);\n            if (bool) {\n              let nextNodes = new Set([node]);\n              for (let j = lastIndex - 1; j >= 0; j--) {\n                const twig = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const m = this._matchCombinator(twig, nextNode, { dir });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === 0) {\n                    nodes.add(node);\n                    matched = true;\n                    if (targetType === TARGET_ALL &&\n                        branchLen > 1 && nodes.size > 1) {\n                      this.#sort = true;\n                    }\n                  } else {\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n            }\n            if (matched && targetType !== TARGET_ALL) {\n              break;\n            }\n          }\n          if (!matched && targetType === TARGET_FIRST) {\n            const [entryNode] = [...entryNodes];\n            let refNode = this._findNode(entryLeaves, {\n              node: entryNode\n            });\n            while (refNode) {\n              let nextNodes = new Set([refNode]);\n              for (let j = lastIndex - 1; j >= 0; j--) {\n                const twig = branch[j];\n                const arr = [];\n                for (const nextNode of nextNodes) {\n                  const m = this._matchCombinator(twig, nextNode, { dir });\n                  if (m.size) {\n                    arr.push(...m);\n                  }\n                }\n                if (arr.length) {\n                  if (j === 0) {\n                    nodes.add(refNode);\n                    matched = true;\n                  } else {\n                    nextNodes = new Set(arr);\n                    matched = false;\n                  }\n                } else {\n                  matched = false;\n                  break;\n                }\n              }\n              if (matched) {\n                break;\n              }\n              refNode = this._findNode(entryLeaves, {\n                node: refNode\n              });\n              nextNodes = new Set([refNode]);\n            }\n          }\n        }\n      }\n    }\n    return nodes;\n  }\n\n  /**\n   * find matched nodes\n   * @param {string} targetType - target type\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {string} selector - CSS selector\n   * @param {object} [opt] - options\n   * @returns {Set.<object>} - collection of matched nodes\n   */\n  _find(targetType, node, selector, opt = {}) {\n    const { warn } = opt;\n    this.#warn = !!warn;\n    if (!node) {\n      const nodeType =\n        Object.prototype.toString.call(node).slice(TYPE_FROM, TYPE_TO);\n      const msg = `Unexpected node ${nodeType}`;\n      throw new TypeError(msg);\n    } else if (node.nodeType !== DOCUMENT_NODE &&\n               node.nodeType !== DOCUMENT_FRAGMENT_NODE &&\n               node.nodeType !== ELEMENT_NODE) {\n      const msg = `Unexpected node ${node.nodeName}`;\n      throw new TypeError(msg);\n    } else if ((targetType === TARGET_SELF || targetType === TARGET_LINEAL) &&\n               node.nodeType !== ELEMENT_NODE) {\n      const msg = `Unexpected node ${node.nodeName}`;\n      throw new TypeError(msg);\n    }\n    this.#node = node;\n    [this.#window, this.#document, this.#root] = this._setup(node);\n    this.#shadow = isInShadowTree(node);\n    this.#selector = selector;\n    [this.#ast, this.#nodes] = this._correspond(selector);\n    if (targetType === TARGET_ALL || targetType === TARGET_FIRST) {\n      this.#tree = this.#document.createTreeWalker(this.#root, WALKER_FILTER);\n      this.#finder = this.#document.createTreeWalker(this.#node, SHOW_ELEMENT);\n      this.#sort = false;\n    }\n    this._collectNodes(targetType);\n    const nodes = this._matchNodes(targetType);\n    return nodes;\n  }\n\n  /**\n   * matches\n   * @param {object} node - Element node\n   * @param {string} selector - CSS selector\n   * @param {object} opt - options\n   * @returns {boolean} - `true` if matched `false` otherwise\n   */\n  matches(node, selector, opt) {\n    let res;\n    try {\n      const nodes = this._find(TARGET_SELF, node, selector, opt);\n      if (nodes.size) {\n        res = nodes.has(this.#node);\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return !!res;\n  }\n\n  /**\n   * closest\n   * @param {object} node - Element node\n   * @param {string} selector - CSS selector\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  closest(node, selector, opt) {\n    let res;\n    try {\n      const nodes = this._find(TARGET_LINEAL, node, selector, opt);\n      let refNode = this.#node;\n      while (refNode) {\n        if (nodes.has(refNode)) {\n          res = refNode;\n          break;\n        }\n        refNode = refNode.parentNode;\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {string} selector - CSS selector\n   * @param {object} opt - options\n   * @returns {?object} - matched node\n   */\n  querySelector(node, selector, opt) {\n    let res;\n    try {\n      const nodes = this._find(TARGET_FIRST, node, selector, opt);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        [res] = this._sortNodes(nodes);\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? null;\n  }\n\n  /**\n   * query selector all\n   * NOTE: returns Array, not NodeList\n   * @param {object} node - Document, DocumentFragment, Element node\n   * @param {string} selector - CSS selector\n   * @param {object} opt - options\n   * @returns {Array.<object|undefined>} - collection of matched nodes\n   */\n  querySelectorAll(node, selector, opt) {\n    let res;\n    try {\n      const nodes = this._find(TARGET_ALL, node, selector, opt);\n      nodes.delete(this.#node);\n      if (nodes.size) {\n        if (this.#sort) {\n          res = this._sortNodes(nodes);\n        } else {\n          res = [...nodes];\n        }\n      }\n    } catch (e) {\n      this._onError(e);\n    }\n    return res ?? [];\n  }\n};\n"],
-  "mappings": "6iBAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,aAAAE,IAAA,eAAAC,EAAAH,GAKA,IAAAI,EAAgC,iDAChCC,EAGO,yBACPC,EAEO,uBAGPC,EAOO,yBACP,MAAMC,EAAW,OACXC,EAAW,OACXC,EAAa,MACbC,EAAe,QACfC,EAAgB,SAChBC,EAAc,OACdC,EAAgB,gBAAgB,yBAAyB,eAgCxD,MAAMZ,CAAQ,CAEnBa,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GAKA,aAAc,CACZ,KAAKZ,GAAO,IAAI,IAAI,CAClB,CAAC,0BAAyB,QAAM,EAChC,CAAC,cAAa,QAAM,EACpB,CAAC,iBAAgB,QAAM,EACvB,CAAC,gBAAe,QAAM,EACtB,CAAC,gBAAe,QAAM,EACtB,CAAC,wBAAuB,QAAM,CAChC,CAAC,EACD,KAAKC,GAAS,IAAI,OACpB,CAQA,SAASY,EAAG,CACV,GAAIA,aAAa,cACZ,KAAKD,IAAWC,aAAa,KAAKD,GAAQ,aAC7C,GAAIC,EAAE,OAAS,oBACT,KAAKF,IACP,QAAQ,KAAKE,EAAE,OAAO,MAEnB,OAAI,KAAKD,GACR,IAAI,KAAKA,GAAQ,aAAaC,EAAE,QAASA,EAAE,IAAI,EAE/CA,MAGR,OAAMA,CAEV,CAOA,OAAOC,EAAM,CACX,IAAIC,EACAC,EACJ,OAAQF,GAAM,SAAU,CACtB,KAAK,gBAAe,CAClBC,EAAWD,EACXE,EAAOF,EACP,KACF,CACA,KAAK,yBAAwB,CAC3BC,EAAWD,EAAK,cAChBE,EAAOF,EACP,KACF,CACA,KAAK,eAAc,CACjB,GAAIA,EAAK,cAAc,SAASA,CAAI,EAClCC,EAAWD,EAAK,cAChBE,EAAOF,EAAK,kBACP,CACL,IAAIG,EAASH,EACb,KAAOG,GACDA,EAAO,YACTA,EAASA,EAAO,WAKhBA,EAAO,WAAa,gBACtBF,EAAWE,EAEXF,EAAWE,EAAO,cAEpBD,EAAOC,CACT,CACA,KACF,CACA,QAAS,CACP,IAAIC,EACJ,MAAIJ,GAAM,SACRI,EAAM,mBAAmBJ,EAAK,QAAQ,GAItCI,EAAM,mBADJ,OAAO,UAAU,SAAS,KAAKJ,CAAI,EAAE,MAAM,YAAW,SAAO,CAC9B,GAE7B,IAAI,UAAUI,CAAG,CACzB,CACF,CAEA,MAAO,CADQH,EAAS,YAGtBA,EACAC,CACF,CACF,CAOA,YAAYG,EAAQ,CAClB,MAAMC,EAAM,CAAC,GAAGD,CAAM,EACtB,OAAIC,EAAI,OAAS,GACfA,EAAI,KAAK,CAACC,EAAGC,IAAM,CACjB,KAAM,CAAE,KAAMC,CAAM,EAAIF,EAClB,CAAE,KAAMG,CAAM,EAAIF,EAClBG,EAAO,KAAKzB,GAAK,IAAIuB,CAAK,EAC1BG,EAAO,KAAK1B,GAAK,IAAIwB,CAAK,EAChC,IAAIG,EACJ,OAAIF,IAASC,EACXC,EAAM,EACGF,EAAOC,EAChBC,EAAM,EAENA,EAAM,GAEDA,CACT,CAAC,EAEIP,CACT,CAOA,YAAYQ,EAAU,CACpB,MAAMC,EAAQ,CAAC,EACf,IAAIC,EACAC,EAAa,KAAK7B,IAAa,KAAKD,GAAO,IAAI,KAAKC,EAAS,EACjE,GAAI6B,GAAcA,EAAW,IAAI,GAAGH,CAAQ,EAAE,IAC5CE,EAAMC,EAAW,IAAIH,CAAQ,EACzB,OAAOE,GAAQ,UACjB,MAAM,IAAI,aAAaA,EAAK,YAAU,EAG1C,GAAIA,EAAK,CACP,MAAME,EAAIF,EAAI,OACd,QAASG,EAAI,EAAGA,EAAID,EAAGC,IACrBH,EAAIG,CAAC,EAAE,IAAM,KACbH,EAAIG,CAAC,EAAE,SAAW,GAClBH,EAAIG,CAAC,EAAE,KAAO,GACdJ,EAAMI,CAAC,EAAI,IAAI,GAEnB,KAAO,CACL,IAAIC,EACJ,GAAI,CACFA,KAAS,iBAAcN,CAAQ,CACjC,OAASf,EAAG,CACN,KAAKX,KACF6B,IACHA,EAAa,IAAI,KAEnBA,EAAW,IAAI,GAAGH,CAAQ,GAAIf,EAAE,OAAO,EACvC,KAAKZ,GAAO,IAAI,KAAKC,GAAW6B,CAAU,GAE5C,KAAK,SAASlB,CAAC,CACjB,CACA,MAAMsB,KAAW,WAAQD,CAAM,EAC/BJ,EAAM,CAAC,EACP,IAAIG,EAAI,EACR,SAAW,CAAC,GAAGG,CAAK,IAAKD,EAAU,CACjC,MAAME,EAAS,CAAC,EAChB,IAAIC,EAAOF,EAAM,MAAM,EACvB,GAAIE,GAAQA,EAAK,OAAS,aAAY,CACpC,MAAMnB,EAAS,IAAI,IACnB,KAAOmB,GAAM,CACX,GAAIA,EAAK,OAAS,aAAY,CAC5B,KAAM,CAACC,CAAQ,EAAIH,EACnB,GAAIG,EAAS,OAAS,aAAY,CAChC,MAAMrB,EAAM,oBAAoBU,CAAQ,GACxC,MAAI,KAAK1B,KACF6B,IACHA,EAAa,IAAI,KAEnBA,EAAW,IAAI,GAAGH,CAAQ,GAAIV,CAAG,EACjC,KAAKjB,GAAO,IAAI,KAAKC,GAAW6B,CAAU,GAEtC,IAAI,aAAab,EAAK,YAAU,CACxC,CACAmB,EAAO,KAAK,CACV,MAAOC,EACP,OAAQ,KAAK,YAAYnB,CAAM,CACjC,CAAC,EACDA,EAAO,MAAM,CACf,MAAWmB,GACTnB,EAAO,IAAImB,CAAI,EAEjB,GAAIF,EAAM,OACRE,EAAOF,EAAM,MAAM,MACd,CACLC,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,KAAK,YAAYlB,CAAM,CACjC,CAAC,EACDA,EAAO,MAAM,EACb,KACF,CACF,CACF,CACAW,EAAI,KAAK,CACP,OAAAO,EACA,IAAK,KACL,SAAU,GACV,KAAM,EACR,CAAC,EACDR,EAAMI,CAAC,EAAI,IAAI,IACfA,GACF,CACI,KAAK/B,KACF6B,IACHA,EAAa,IAAI,KAEnBA,EAAW,IAAI,GAAGH,CAAQ,GAAIE,CAAG,EACjC,KAAK7B,GAAO,IAAI,KAAKC,GAAW6B,CAAU,EAE9C,CACA,MAAO,CACLD,EACAD,CACF,CACF,CAQA,UAAUf,EAAO,CAAC,EAAG0B,EAAS,KAAK9B,GAAO,CACxC,IAAI+B,EACAC,EAAUF,EAAO,YACrB,GAAI1B,EAAK,WAAa,gBAAgB4B,IAAY5B,EAChD2B,EAAUC,MACL,CACL,GAAIA,IAAYF,EAAO,KACrB,KAAOE,GACD,EAAAA,IAAYF,EAAO,MAClB1B,EAAK,WAAa,gBAAgB4B,IAAY5B,IAGnD4B,EAAUF,EAAO,WAAW,EAGhC,GAAI1B,EAAK,WAAa,eACpB,KAAO4B,GAAS,CACd,GAAIA,IAAY5B,EAAM,CACpB2B,EAAUC,EACV,KACF,CACAA,EAAUF,EAAO,SAAS,CAC5B,MAEAC,EAAUC,CAEd,CACA,OAAOD,GAAW,IACpB,CAYA,iBAAiBE,EAAK7B,EAAM,CAC1B,KAAM,CAAE,EAAAO,EAAG,EAAAC,EAAG,QAAAsB,EAAS,SAAAhB,CAAS,EAAIe,EAC9B,CAAE,WAAAE,CAAW,EAAI/B,EACvB,IAAIgC,EAAU,IAAI,IACdC,EASJ,GARInB,IACE,KAAK3B,GAAO,IAAI2B,CAAQ,EAC1BmB,EAAmB,KAAK9C,GAAO,IAAI2B,CAAQ,GAE3CmB,KAAmB,WAAQnB,CAAQ,EACnC,KAAK3B,GAAO,IAAI2B,EAAUmB,CAAgB,IAG1CF,EAAY,CACd,MAAML,EAAS,KAAKtC,GAAU,iBAAiB2C,EAAY/C,CAAa,EACxE,IAAIkC,EAAI,EACJU,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACLV,IACAU,EAAUF,EAAO,YAAY,EAE/BE,EAAU,KAAK,UAAUG,EAAYL,CAAM,EAC3C,MAAMQ,EAAgB,IAAI,IAC1B,GAAID,EAGF,IAFAL,EAAU,KAAK,UAAUG,EAAYL,CAAM,EAC3CE,EAAUF,EAAO,WAAW,EACrBE,GAAS,CACd,IAAIO,EACJ,UAAW9B,KAAU4B,EAEnB,GADAE,EAAO,KAAK,aAAa9B,EAAQuB,CAAO,EACpC,CAACO,EACH,MAGAA,GACFD,EAAc,IAAIN,CAAO,EAE3BA,EAAUF,EAAO,YAAY,CAC/B,CAGF,GAAInB,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKU,GAChB,GAAIgB,EAAc,KAAM,CACtB,IAAIf,EAAI,EAOR,IANAS,EAAU,KAAK,UAAUG,EAAYL,CAAM,EACvCI,EACFF,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIM,EAAc,IAAIN,CAAO,EAAG,CAC9B,GAAIT,IAAMX,EAAI,EAAG,CACfwB,EAAQ,IAAIJ,CAAO,EACnB,KACF,CACAT,GACF,CACIW,EACFF,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,SAAW,CAACZ,EAAU,CACpB,IAAIK,EAAI,EAOR,IANAS,EAAU,KAAK,UAAUG,EAAYL,CAAM,EACvCI,EACFF,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,GAAIT,IAAMX,EAAI,EAAG,CACfwB,EAAQ,IAAIJ,CAAO,EACnB,KACF,CACIE,EACFF,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BP,GACF,CACF,OAGG,CACL,IAAIiB,EAAM5B,EAAI,EACd,GAAID,EAAI,EACN,KAAO6B,EAAM,GACXA,GAAO7B,EAGX,GAAI6B,GAAO,GAAKA,EAAMlB,EAAG,CACvB,IAAIC,EAAI,EACJkB,EAAI9B,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAoB,EAAU,KAAK,UAAUG,EAAYL,CAAM,EACvCI,EACFF,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,IACDA,GAAWQ,GAAO,GAAKA,EAAMlB,IAC3BgB,EAAc,KACZA,EAAc,IAAIN,CAAO,IACvBS,IAAMD,IACRJ,EAAQ,IAAIJ,CAAO,EACnBQ,GAAO7B,GAELA,EAAI,EACN8B,IAEAA,KAGKlB,IAAMiB,IACVtB,GACHkB,EAAQ,IAAIJ,CAAO,EAErBQ,GAAO7B,GAELuB,EACFF,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,EAE/BP,GAKN,CACF,CACA,GAAIW,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAMM,EAAI,CAAC,GAAGN,CAAO,EACrBA,EAAU,IAAI,IAAIM,EAAE,QAAQ,CAAC,CAC/B,CACF,SAAWtC,IAAS,KAAKR,IAAS,KAAKA,GAAM,WAAa,gBAC9Ce,EAAIC,IAAO,EACrB,GAAIyB,EAAkB,CACpB,IAAIE,EACJ,UAAW9B,KAAU4B,EAEnB,GADAE,EAAO,KAAK,aAAa9B,EAAQL,CAAI,EACjCmC,EACF,MAGAA,GACFH,EAAQ,IAAIhC,CAAI,CAEpB,MACEgC,EAAQ,IAAIhC,CAAI,EAGpB,OAAOgC,CACT,CAWA,kBAAkBH,EAAK7B,EAAM,CAC3B,KAAM,CAAE,EAAAO,EAAG,EAAAC,EAAG,QAAAsB,CAAQ,EAAID,EACpB,CAAE,UAAAU,EAAW,WAAAR,EAAY,OAAAS,CAAO,EAAIxC,EAC1C,IAAIgC,EAAU,IAAI,IAClB,GAAID,EAAY,CACd,MAAML,EAAS,KAAKtC,GAAU,iBAAiB2C,EAAY/C,CAAa,EACxE,IAAIkC,EAAI,EACJU,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACLV,IACAU,EAAUF,EAAO,YAAY,EAG/B,GAAInB,IAAM,GACR,GAAIC,EAAI,GAAKA,GAAKU,EAAG,CACnB,IAAImB,EAAI,EAOR,IANAT,EAAU,KAAK,UAAUG,EAAYL,CAAM,EACvCI,EACFF,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWa,EAAe,OAAQC,CAAW,EAAId,EACzD,GAAIa,IAAkBF,GAAaG,IAAeF,EAAQ,CACxD,GAAIH,IAAM7B,EAAI,EAAG,CACfwB,EAAQ,IAAIJ,CAAO,EACnB,KACF,CACAS,GACF,CACIP,EACFF,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,MAEK,CACL,IAAIU,EAAM5B,EAAI,EACd,GAAID,EAAI,EACN,KAAO6B,EAAM,GACXA,GAAO7B,EAGX,GAAI6B,GAAO,GAAKA,EAAMlB,EAAG,CACvB,IAAImB,EAAI9B,EAAI,EAAI,EAAIC,EAAI,EAOxB,IANAoB,EAAU,KAAK,UAAUG,EAAYL,CAAM,EACvCI,EACFF,EAAUF,EAAO,UAAU,EAE3BE,EAAUF,EAAO,WAAW,EAEvBE,GAAS,CACd,KAAM,CAAE,UAAWa,EAAe,OAAQC,CAAW,EAAId,EACzD,GAAIa,IAAkBF,GAAaG,IAAeF,EAAQ,CAKxD,GAJIH,IAAMD,IACRJ,EAAQ,IAAIJ,CAAO,EACnBQ,GAAO7B,GAEL6B,EAAM,GAAKA,GAAOlB,EACpB,MACSX,EAAI,EACb8B,IAEAA,GAEJ,CACIP,EACFF,EAAUF,EAAO,gBAAgB,EAEjCE,EAAUF,EAAO,YAAY,CAEjC,CACF,CACF,CACA,GAAII,GAAWE,EAAQ,KAAO,EAAG,CAC/B,MAAM,EAAI,CAAC,GAAGA,CAAO,EACrBA,EAAU,IAAI,IAAI,EAAE,QAAQ,CAAC,CAC/B,CACF,MAAWhC,IAAS,KAAKR,IAAS,KAAKA,GAAM,WAAa,gBAC9Ce,EAAIC,IAAO,GACrBwB,EAAQ,IAAIhC,CAAI,EAElB,OAAOgC,CACT,CASA,cAAchB,EAAKhB,EAAM2C,EAAS,CAChC,KAAM,CACJ,IAAK,CACH,EAAApC,EACA,EAAAC,EACA,KAAMoC,CACR,EACA,SAAA9B,CACF,EAAIE,EACE6B,KAAY,oBAAiBD,CAAY,EACzCE,EAAS,IAAI,IACfD,GACEA,IAAc,QAChBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GACRD,IAAc,QACvBC,EAAO,IAAI,IAAK,CAAC,EACjBA,EAAO,IAAI,IAAK,CAAC,GAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,IAGxB,OAAOvC,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCuC,EAAO,IAAI,IAAKvC,EAAI,CAAC,EAErBuC,EAAO,IAAI,IAAK,CAAC,EAEf,OAAOtC,GAAM,UAAY,QAAQ,KAAKA,CAAC,EACzCsC,EAAO,IAAI,IAAKtC,EAAI,CAAC,EAErBsC,EAAO,IAAI,IAAK,CAAC,EAEfH,EAAQ,QAAQ,MAAM,EAAI,IAC5BG,EAAO,IAAI,UAAW,EAAI,GAG9B,IAAId,EAAU,IAAI,IAClB,GAAIc,EAAO,IAAI,GAAG,GAAKA,EAAO,IAAI,GAAG,GACnC,GAAI,wBAAwB,KAAKH,CAAO,EAAG,CACrC7B,GACFgC,EAAO,IAAI,WAAYhC,CAAQ,EAEjC,MAAMe,EAAM,OAAO,YAAYiB,CAAM,EAC/B/B,EAAQ,KAAK,iBAAiBc,EAAK7B,CAAI,EACzCe,EAAM,OACRiB,EAAUjB,EAEd,SAAW,0BAA0B,KAAK4B,CAAO,EAAG,CAClD,MAAMd,EAAM,OAAO,YAAYiB,CAAM,EAC/B/B,EAAQ,KAAK,kBAAkBc,EAAK7B,CAAI,EAC1Ce,EAAM,OACRiB,EAAUjB,EAEd,EAEF,OAAOiB,CACT,CAUA,4BAA4Be,EAASC,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,QAAAC,CAAQ,EAAID,EACpB,OAAQD,EAAS,CACf,IAAK,QACL,IAAK,WACL,IAAK,SACL,IAAK,MACL,IAAK,aACL,IAAK,eACL,IAAK,aACL,IAAK,uBACL,IAAK,SACL,IAAK,cACL,IAAK,YACL,IAAK,cAAe,CAClB,GAAI,KAAKlD,GAAO,CACd,MAAMO,EAAM,gCAAgC2C,CAAO,GACnD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,UAAW,CACd,GAAI,KAAKP,GAAO,CACd,MAAMO,EAAM,gCAAgC2C,CAAO,KACnD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAI2C,EAAQ,WAAW,UAAU,GAC/B,GAAI,KAAKlD,GAAO,CACd,MAAMO,EAAM,gCAAgC2C,CAAO,GACnD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,UACS,CAAC6C,EAAS,CACnB,MAAM7C,EAAM,4BAA4B2C,CAAO,GAC/C,MAAM,IAAI,aAAa3C,EAAK,YAAU,CACxC,CAEJ,CACF,CAQA,2BAA2BY,EAAKhB,EAAM,CACpC,MAAM+C,KAAU,oBAAiB/B,EAAI,IAAI,EACnCkC,KAAM,qBAAkBlD,CAAI,EAClC,IAAIa,EACJ,OAAIkC,IAAYG,IACdrC,EAAMb,GAEDa,GAAO,IAChB,CASA,0BAA0BG,EAAKhB,EAAM,CACnC,MAAM+C,KAAU,oBAAiB/B,EAAI,IAAI,EACzC,IAAIH,EACJ,GAAIkC,IAAY,IACd,GAAI/C,EAAK,aAAa,MAAM,EACtBA,EAAK,aAAa,MAAM,IAC1Ba,EAAMb,OAEH,CACL,IAAIG,EAASH,EAAK,WAClB,KAAOG,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC3BA,EAAO,aAAa,MAAM,IAC5BU,EAAMb,GAER,KACF,CACAG,EAASA,EAAO,UAClB,CAIJ,SACS4C,EAAS,CAClB,MAAMI,EAAW,OAAO,WAAS,KAEjC,GADgB,IAAI,OAAO,aAAa,WAAS,GAAGA,CAAQ,IAAK,GAAG,EACxD,KAAKJ,CAAO,EAAG,CACzB,IAAIK,EACJ,GAAIL,EAAQ,QAAQ,GAAG,EAAI,GAAI,CAC7B,KAAM,CAACM,EAAUC,EAAS,GAAGC,CAAQ,EAAIR,EAAQ,MAAM,GAAG,EAC1D,IAAIS,EACAH,IAAa,IACfG,EAAe,GAAG,WAAS,GAAGL,CAAQ,GAEtCK,EAAe,GAAGH,CAAQ,GAAGF,CAAQ,GAEvC,MAAMM,EAAc,IAAIH,CAAO,GAAGH,CAAQ,GACpCO,EAAMH,EAAS,OACrB,IAAII,EAAe,GACnB,GAAID,EACF,QAASvC,EAAI,EAAGA,EAAIuC,EAAKvC,IACvBwC,GAAgB,IAAIJ,EAASpC,CAAC,CAAC,GAAGgC,CAAQ,GAG9CC,EACE,IAAI,OAAO,IAAII,CAAY,GAAGC,CAAW,GAAGE,CAAY,IAAK,GAAG,CACpE,MACEP,EAAkB,IAAI,OAAO,IAAIL,CAAO,GAAGI,CAAQ,IAAK,GAAG,EAE7D,GAAInD,EAAK,aAAa,MAAM,EACtBoD,EAAgB,KAAKpD,EAAK,aAAa,MAAM,CAAC,IAChDa,EAAMb,OAEH,CACL,IAAIG,EAASH,EAAK,WAClB,KAAOG,GACDA,EAAO,WAAa,gBAAc,CACpC,GAAIA,EAAO,aAAa,MAAM,EAAG,CAC/B,MAAMyD,EAAQzD,EAAO,aAAa,MAAM,EACpCiD,EAAgB,KAAKQ,CAAK,IAC5B/C,EAAMb,GAER,KACF,CACAG,EAASA,EAAO,UAClB,CAIJ,CACF,CACF,CACA,OAAOU,GAAO,IAChB,CAQA,oBAAoBR,EAAQL,EAAM,CAChC,IAAImC,EACJ,GAAI,MAAM,QAAQ9B,CAAM,GAAKA,EAAO,OAAQ,CAC1C,KAAM,CAACwD,CAAI,EAAIxD,EACT,CAAE,KAAMyD,CAAS,EAAID,EAC3B,IAAIE,EACAD,IAAa,aACfC,EAAQ1D,EAAO,MAAM,EAErB0D,EAAQ,CACN,KAAM,IACN,KAAM,YACR,EAEF,MAAMC,EAAa,CAAC,EACpB,KAAO3D,EAAO,QAAQ,CACpB,KAAM,CAACmB,CAAI,EAAInB,EACT,CAAE,KAAM4D,CAAS,EAAIzC,EAC3B,GAAIyC,IAAa,aACf,MAEAD,EAAW,KAAK3D,EAAO,MAAM,CAAC,CAElC,CACA,MAAM6D,EAAO,CACX,MAAAH,EACA,OAAQC,CACV,EACMjD,EAAQ,KAAK,iBAAiBmD,EAAMlE,EAAM,CAC9C,IAAKtB,CACP,CAAC,EACD,GAAIqC,EAAM,KACR,GAAIV,EAAO,QACT,UAAW8D,KAAYpD,EAGrB,GAFAoB,EACE,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAG9B,CAAM,EAAG8D,CAAQ,EAC1DhC,EACF,WAIJA,EAAO,EAGb,CACA,MAAO,CAAC,CAACA,CACX,CAQA,wBAAwBiC,EAASpE,EAAM,CACrC,KAAM,CACJ,QAAA+C,EAAU,GAAI,SAAA1B,EAAW,CAAC,EAAG,SAAAP,EAAW,GAAI,aAAAuD,EAAe,CAAC,CAC9D,EAAID,EACJ,IAAIvD,EACJ,GAAIkC,IAAY,MACd,GAAIjC,EAAS,SAAS,OAAO,EAC3BD,EAAM,SACD,CACL,IAAIsB,EACJ,UAAW9B,KAAUgB,EAEnB,GADAc,EAAO,KAAK,oBAAoB,OAAO,OAAO,CAAC,EAAG9B,CAAM,EAAGL,CAAI,EAC3DmC,EACF,MAGAA,IACFtB,EAAMb,EAEV,KACK,CACL,MAAMiD,EAAU,iBAAiB,KAAKF,CAAO,EACvC7B,EAAImD,EAAa,OACvB,IAAIlC,EACJ,QAAShB,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,MAAMI,EAAS8C,EAAalD,CAAC,EACvBmD,EAAY/C,EAAO,OAAS,EAC5B,CAAE,OAAAlB,CAAO,EAAIkB,EAAO+C,CAAS,EAEnC,GADAnC,EAAO,KAAK,aAAa9B,EAAQL,EAAM,CAAE,QAAAiD,CAAQ,CAAC,EAC9Cd,GAAQmC,EAAY,EAAG,CACzB,IAAIC,EAAY,IAAI,IAAI,CAACvE,CAAI,CAAC,EAC9B,QAASqC,EAAIiC,EAAY,EAAGjC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO3C,EAAOc,CAAC,EACf/B,EAAM,CAAC,EACb,UAAW6D,KAAYI,EAAW,CAChC,MAAMjC,EAAI,KAAK,iBAAiB4B,EAAMC,EAAU,CAC9C,QAAAlB,EACA,IAAKtE,CACP,CAAC,EACG2D,EAAE,MACJhC,EAAI,KAAK,GAAGgC,CAAC,CAEjB,CACA,GAAIhC,EAAI,OACF+B,IAAM,EACRF,EAAO,GAEPoC,EAAY,IAAI,IAAIjE,CAAG,MAEpB,CACL6B,EAAO,GACP,KACF,CACF,CACF,CACA,GAAIA,EACF,KAEJ,CACIY,IAAY,MACTZ,IACHtB,EAAMb,GAECmC,IACTtB,EAAMb,EAEV,CACA,OAAOa,GAAO,IAChB,CAWA,0BAA0BG,EAAKhB,EAAMgD,EAAM,CAAC,EAAG,CAC7C,KAAM,CAAE,SAAUwB,CAAY,EAAIxD,EAC5B,CAAE,UAAAuB,EAAW,WAAAR,CAAW,EAAI/B,EAC5B,CAAE,QAAAiD,CAAQ,EAAID,EACdD,KAAU,oBAAiB/B,EAAI,IAAI,EACzC,IAAIgB,EAAU,IAAI,IAElB,GAAI,qBAAmB,KAAKe,CAAO,EAAG,CACpC,IAAIqB,EACJ,GAAI,KAAKjF,GAAO,IAAI6B,CAAG,EACrBoD,EAAU,KAAKjF,GAAO,IAAI6B,CAAG,MACxB,CACL,MAAMK,KAAW,WAAQL,CAAG,EACtByD,EAAY,CAAC,EACbJ,EAAe,CAAC,EACtB,SAAW,CAAC,GAAGhE,CAAM,IAAKgB,EAAU,CAClC,UAAWwC,KAAQxD,EAAQ,CACzB,MAAMqE,KAAM,eAAYb,CAAI,EAC5BY,EAAU,KAAKC,CAAG,CACpB,CACA,MAAMnD,EAAS,CAAC,EACVoD,EAAY,IAAI,IACtB,IAAInD,EAAOnB,EAAO,MAAM,EACxB,KAAOmB,GAUL,GATIA,EAAK,OAAS,cAChBD,EAAO,KAAK,CACV,MAAOC,EACP,OAAQ,CAAC,GAAGmD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,GACPnD,GACTmD,EAAU,IAAInD,CAAI,EAEhBnB,EAAO,OACTmB,EAAOnB,EAAO,MAAM,MACf,CACLkB,EAAO,KAAK,CACV,MAAO,KACP,OAAQ,CAAC,GAAGoD,CAAS,CACvB,CAAC,EACDA,EAAU,MAAM,EAChB,KACF,CAEFN,EAAa,KAAK9C,CAAM,CAC1B,CACA6C,EAAU,CACR,QAAArB,EACA,SAAA1B,EACA,aAAAgD,EACA,SAAUI,EAAU,KAAK,GAAG,CAC9B,EACA,KAAKtF,GAAO,IAAI6B,EAAKoD,CAAO,CAC9B,CACA,MAAMvD,EAAM,KAAK,wBAAwBuD,EAASpE,CAAI,EAClDa,GACFmB,EAAQ,IAAInB,CAAG,CAEnB,SAAW,MAAM,QAAQ2D,CAAW,EAAG,CACrC,KAAM,CAACjD,CAAM,EAAIiD,EAEjB,GAAI,oCAAoC,KAAKzB,CAAO,EAAG,CACrD,MAAMhC,EAAQ,KAAK,cAAcQ,EAAQvB,EAAM+C,CAAO,EAClDhC,EAAM,OACRiB,EAAUjB,EAGd,SAAWgC,IAAY,MAAO,CAC5B,MAAMlC,EAAM,KAAK,2BAA2BU,EAAQvB,CAAI,EACpDa,GACFmB,EAAQ,IAAInB,CAAG,CAGnB,SAAWkC,IAAY,OAAQ,CAC7B,MAAMlC,EAAM,KAAK,0BAA0BU,EAAQvB,CAAI,EACnDa,GACFmB,EAAQ,IAAInB,CAAG,CAEnB,KACE,QAAQkC,EAAS,CACf,IAAK,UACL,IAAK,UACL,IAAK,eAAgB,CACnB,GAAI,KAAKlD,GAAO,CACd,MAAMO,EAAM,6BAA6B2C,CAAO,KAChD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAEF,QACE,GAAI,CAAC6C,EAAS,CACZ,MAAM7C,EAAM,yBAAyB2C,CAAO,KAC5C,MAAM,IAAI,aAAa3C,EAAK,YAAU,CACxC,CAEJ,CAEJ,KAAO,CACL,MAAMwE,EAAY,cACZC,EACJ,iEACIC,EAAkB,6CAClBC,EAAc,sBACdC,EAAe,uBACfC,EAAc,4CACdC,EACJ,2DACIC,EAAc,oDACpB,OAAQpC,EAAS,CACf,IAAK,WACL,IAAK,OAAQ,CACP6B,EAAU,KAAKrC,CAAS,GAAKvC,EAAK,aAAa,MAAM,GACvDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,aAAc,CACjB,GAAI4E,EAAU,KAAKrC,CAAS,GAAKvC,EAAK,aAAa,MAAM,EAAG,CAC1D,KAAM,CAAE,KAAAoF,EAAM,OAAAC,EAAQ,SAAAC,CAAS,EAAI,IAAI,IAAI,KAAKlG,GAAU,GAAG,EACvDmG,EAAU,IAAI,IAAIvF,EAAK,aAAa,MAAM,EAAGoF,CAAI,EACnDG,EAAQ,SAAWF,GAAUE,EAAQ,WAAaD,GACpDtD,EAAQ,IAAIhC,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAEH,MAEF,IAAK,SAAU,CACb,KAAM,CAAE,KAAAwF,CAAK,EAAI,IAAI,IAAI,KAAKpG,GAAU,GAAG,EACvCY,EAAK,IAAMwF,IAAS,IAAIxF,EAAK,EAAE,IAC/B,KAAKZ,GAAU,SAASY,CAAI,GAC9BgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,KAAM,CAAE,KAAAwF,CAAK,EAAI,IAAI,IAAI,KAAKpG,GAAU,GAAG,EAC3C,GAAIoG,EAAM,CACR,MAAMC,EAAKD,EAAK,QAAQ,KAAM,EAAE,EAChC,IAAI7D,EAAU,KAAKvC,GAAU,eAAeqG,CAAE,EAC9C,KAAO9D,GAAS,CACd,GAAIA,IAAY3B,EAAM,CACpBgC,EAAQ,IAAIhC,CAAI,EAChB,KACF,CACA2B,EAAUA,EAAQ,UACpB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACR,KAAKrC,GAAM,WAAa,eACtBU,IAAS,KAAKV,IAChB0C,EAAQ,IAAIhC,CAAI,EAETA,IAAS,KAAKZ,GAAU,iBACjC4C,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACRA,IAAS,KAAKZ,GAAU,eAC1B4C,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,IAAI2B,EAAU,KAAKvC,GAAU,cAC7B,KAAOuC,GAAS,CACd,GAAIA,IAAY3B,EAAM,CACpBgC,EAAQ,IAAIhC,CAAI,EAChB,KACF,CACA2B,EAAUA,EAAQ,UACpB,CACA,KACF,CACA,IAAK,OAAQ,CACPoD,EAAY,KAAKxC,CAAS,GAAKvC,EAAK,aAAa,MAAM,GACzDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,SAAU,CACT+E,EAAY,KAAKxC,CAAS,GAAK,CAACvC,EAAK,aAAa,MAAM,GAC1DgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,GAAI6E,EAAY,KAAKtC,CAAS,MAAK,EAAAmD,SAAoBnD,CAAS,EAC9D,GAAIvC,EAAK,UAAYA,EAAK,aAAa,UAAU,EAC/CgC,EAAQ,IAAIhC,CAAI,MACX,CACL,IAAIG,EAAS4B,EACb,KAAO5B,GACDA,EAAO,YAAc,YAGzBA,EAASA,EAAO,WAEdA,GAAU4B,EAAW,YAAc,UACnC5B,EAAO,aAAa,UAAU,GAChC6B,EAAQ,IAAIhC,CAAI,CAEpB,CAEF,KACF,CACA,IAAK,UAAW,EACT6E,EAAY,KAAKtC,CAAS,MAAK,EAAAmD,SAAoBnD,CAAS,IAC7D,EAAEvC,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,YAAa,CAChB,OAAQuC,EAAW,CACjB,IAAK,WAAY,EACXvC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQiF,EAAY,KAAKjF,EAAK,IAAI,GACxCmF,EAAY,KAAKnF,EAAK,IAAI,KAC1BA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,WACO,qBAAkBA,CAAI,GACzBgC,EAAQ,IAAIhC,CAAI,CAGtB,CACA,KACF,CACA,IAAK,aAAc,CACjB,OAAQuC,EAAW,CACjB,IAAK,WAAY,CACTvC,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,GACjDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,QAAS,EACP,CAACA,EAAK,MAAQiF,EAAY,KAAKjF,EAAK,IAAI,GACxCmF,EAAY,KAAKnF,EAAK,IAAI,IAC3B,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,GAC7CA,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,WACM,qBAAkBA,CAAI,GACxBgC,EAAQ,IAAIhC,CAAI,CAGtB,CACA,KACF,CACA,IAAK,oBAAqB,CACxB,IAAI2F,EACApD,IAAc,WAChBoD,EAAa3F,EACJuC,IAAc,UACnBvC,EAAK,aAAa,MAAM,EACtBmF,EAAY,KAAKnF,EAAK,aAAa,MAAM,CAAC,IAC5C2F,EAAa3F,GAGf2F,EAAa3F,GAGb2F,GAAc3F,EAAK,QAAU,IAC7BA,EAAK,aAAa,aAAa,GAC/BA,EAAK,aAAa,aAAa,EAAE,KAAK,EAAE,QAC1CgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,UAAW,EACTA,EAAK,SAAWuC,IAAc,SAC9BvC,EAAK,aAAa,MAAM,GACxBgF,EAAa,KAAKhF,EAAK,aAAa,MAAM,CAAC,GAC3CA,EAAK,UAAYuC,IAAc,WAClCP,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAKA,EAAK,eAAiBuC,IAAc,SACpCvC,EAAK,OAAS,YACduC,IAAc,YAAc,CAACvC,EAAK,aAAa,OAAO,EACzDgC,EAAQ,IAAIhC,CAAI,UACPuC,IAAc,SAAWvC,EAAK,OAAS,SACvC,CAACA,EAAK,aAAa,SAAS,EAAG,CACxC,MAAM4F,EAAW5F,EAAK,KACtB,IAAIG,EAASH,EAAK,WAClB,KAAOG,GACDA,EAAO,YAAc,QAGzBA,EAASA,EAAO,WAEbA,IACHA,EAAS,KAAKf,GAAU,iBAE1B,IAAIyG,EACJ,MAAM9E,EAAQ,CAAC,EAAE,MAAM,KAAKZ,EAAO,qBAAqB,OAAO,CAAC,EAChE,UAAWqB,KAAQT,EACjB,GAAIS,EAAK,aAAa,MAAM,IAAM,UAC5BoE,EACEpE,EAAK,aAAa,MAAM,IAAMoE,IAChCC,EAAU,CAAC,CAACrE,EAAK,SAETA,EAAK,aAAa,MAAM,IAClCqE,EAAU,CAAC,CAACrE,EAAK,SAEfqE,GACF,MAIDA,GACH7D,EAAQ,IAAIhC,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,MAAM8F,EAAe,qBACfC,EAAgB,qBAEtB,GAAKxD,IAAc,UACd,EAAEvC,EAAK,aAAa,MAAM,GACxB8F,EAAa,KAAK9F,EAAK,aAAa,MAAM,CAAC,IAC7CuC,IAAc,SAAWvC,EAAK,aAAa,MAAM,GACjD+F,EAAc,KAAK/F,EAAK,aAAa,MAAM,CAAC,EAAI,CACnD,IAAIgG,EAAOhG,EAAK,WAChB,KAAOgG,GACDA,EAAK,YAAc,QAGvBA,EAAOA,EAAK,WAEd,GAAIA,EAAM,CACR,MAAMtE,EACJ,KAAKtC,GAAU,iBAAiB4G,EAAM,cAAY,EACpD,IAAI7B,EAAWzC,EAAO,WAAW,EACjC,KAAOyC,GAAU,CACf,MAAMyB,EAAWzB,EAAS,UAC1B,IAAI7B,EAQJ,GAPIsD,IAAa,SACftD,EAAI,EAAE6B,EAAS,aAAa,MAAM,GAChC2B,EAAa,KAAK3B,EAAS,aAAa,MAAM,CAAC,GACxCyB,IAAa,UACtBtD,EAAI6B,EAAS,aAAa,MAAM,GAC9B4B,EAAc,KAAK5B,EAAS,aAAa,MAAM,CAAC,GAEhD7B,EAAG,CACD6B,IAAanE,GACfgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACAmE,EAAWzC,EAAO,SAAS,CAC7B,CACF,CAEF,SAAWa,IAAc,SAAWvC,EAAK,aAAa,MAAM,GACjDgF,EAAa,KAAKhF,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAWA,EAAK,aAAa,SAAS,GACrDgC,EAAQ,IAAIhC,CAAI,UAEPuC,IAAc,SAAU,CACjC,IAAI0D,EAAa,GACb9F,EAAS4B,EACb,KAAO5B,GACDA,EAAO,YAAc,YADZ,CAGN,GAAIA,EAAO,YAAc,SAAU,EACpCA,EAAO,UAAYA,EAAO,aAAa,UAAU,KACnD8F,EAAa,IAEf,KACF,CACA9F,EAASA,EAAO,UAClB,CACA,GAAI8F,GACEjG,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CgC,EAAQ,IAAIhC,CAAI,MAEb,CACL,MAAMkG,EAAa,IAAI,IACjBxE,EACJ,KAAKtC,GAAU,iBAAiB2C,EAAY,cAAY,EAC1D,IAAIH,EAAUF,EAAO,WAAW,EAChC,KAAOE,GAAS,CACd,GAAIA,EAAQ,UAAYA,EAAQ,aAAa,UAAU,EAAG,CACxDsE,EAAW,IAAItE,CAAO,EACtB,KACF,CACAA,EAAUF,EAAO,YAAY,CAC/B,CACIwE,EAAW,MACTA,EAAW,IAAIlG,CAAI,GACrBgC,EAAQ,IAAIhC,CAAI,CAGtB,CACF,CACA,KACF,CACA,IAAK,QAAS,CACZ,GAAI8E,EAAgB,KAAKvC,CAAS,EAC5BvC,EAAK,cAAc,GACrBgC,EAAQ,IAAIhC,CAAI,UAETuC,IAAc,WAAY,CACnC,IAAIJ,EACJ,MAAMT,EAAS,KAAKtC,GAAU,iBAAiBY,EAAM,cAAY,EACjE,IAAI4B,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAkD,EAAgB,KAAKlD,EAAQ,SAAS,IACxCO,EAAOP,EAAQ,cAAc,EACzB,CAACO,KAIPP,EAAUF,EAAO,SAAS,EAExBS,GACFH,EAAQ,IAAIhC,CAAI,CAEpB,CACA,KACF,CACA,IAAK,UAAW,CACd,GAAI8E,EAAgB,KAAKvC,CAAS,EAC3BvC,EAAK,cAAc,GACtBgC,EAAQ,IAAIhC,CAAI,UAETuC,IAAc,WAAY,CACnC,IAAIJ,EACJ,MAAMT,EAAS,KAAKtC,GAAU,iBAAiBY,EAAM,cAAY,EACjE,IAAI4B,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACD,EAAAkD,EAAgB,KAAKlD,EAAQ,SAAS,IACxCO,EAAOP,EAAQ,cAAc,EACzB,CAACO,KAIPP,EAAUF,EAAO,SAAS,EAEvBS,GACHH,EAAQ,IAAIhC,CAAI,CAEpB,CACA,KACF,CACA,IAAK,WAAY,CACXuC,IAAc,SACd,EAAEvC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxBkF,EAAa,KAAKlF,EAAK,aAAa,MAAM,CAAC,GAC3C,EAAEA,EAAK,SAAS,gBACdA,EAAK,SAAS,iBACfA,EAAK,aAAa,KAAK,GAAKA,EAAK,aAAa,KAAK,GACnDA,EAAK,aAAa,MAAM,IAAM,UACjCgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACfuC,IAAc,SACd,EAAEvC,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/C,EAAEA,EAAK,UAAYA,EAAK,aAAa,UAAU,IAC/CA,EAAK,aAAa,MAAM,GACxBkF,EAAa,KAAKlF,EAAK,aAAa,MAAM,CAAC,IAC1CA,EAAK,SAAS,gBAAkBA,EAAK,SAAS,gBACjDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAI2F,EACJ,GAAI,wBAAwB,KAAKpD,CAAS,EACxCoD,EAAa3F,UACJuC,IAAc,QACvB,GAAIvC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMmG,EAAYnG,EAAK,aAAa,MAAM,GACtCmG,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAa3F,EAEjB,MACE2F,EAAa3F,EAGb2F,IACC3F,EAAK,UAAYA,EAAK,aAAa,UAAU,IAChDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,WAAY,CACf,IAAI2F,EACJ,GAAI,wBAAwB,KAAKpD,CAAS,EACxCoD,EAAa3F,UACJuC,IAAc,QACvB,GAAIvC,EAAK,aAAa,MAAM,EAAG,CAC7B,MAAMmG,EAAYnG,EAAK,aAAa,MAAM,GACtCmG,IAAc,QAAUnB,EAAa,KAAKmB,CAAS,GACnDlB,EAAY,KAAKkB,CAAS,GAAKhB,EAAY,KAAKgB,CAAS,KAC3DR,EAAa3F,EAEjB,MACE2F,EAAa3F,EAGb2F,GACA,EAAE3F,EAAK,UAAYA,EAAK,aAAa,UAAU,IACjDgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,OAAQ,CACPA,IAAS,KAAKZ,GAAU,iBAC1B4C,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,QAAS,CACZ,GAAIA,EAAK,cAAc,EAAG,CACxB,IAAImC,EACJ,MAAMT,EAAS,KAAKtC,GAAU,iBAAiBY,EAAM,UAAQ,EAC7D,IAAI4B,EAAUF,EAAO,WAAW,EAChC,KAAOE,IACLO,EAAOP,EAAQ,WAAa,gBAC1BA,EAAQ,WAAa,YACnB,EAACO,IAGLP,EAAUF,EAAO,YAAY,EAE3BS,GACFH,EAAQ,IAAIhC,CAAI,CAEpB,MACEgC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,cAAe,EACb+B,GAAc/B,IAAS+B,EAAW,mBAClC/B,IAAS,KAAKR,IAAS,KAAKA,GAAM,WAAa,iBAClDwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZ+B,GAAc/B,IAAS+B,EAAW,kBAClC/B,IAAS,KAAKR,IAAS,KAAKA,GAAM,WAAa,iBAClDwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,aAAc,EACZ+B,GACA/B,IAAS+B,EAAW,mBACpB/B,IAAS+B,EAAW,kBACpB/B,IAAS,KAAKR,IAAS,KAAKA,GAAM,WAAa,iBAClDwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,gBAAiB,CACpB,GAAI+B,EAAY,CACd,KAAM,CAACqE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGpG,CAAI,EACHoG,GACFpE,EAAQ,IAAIoE,CAAK,CAErB,MAAWpG,IAAS,KAAKR,IACd,KAAKA,GAAM,WAAa,gBACjCwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAI+B,EAAY,CACd,KAAM,CAACqE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGpG,CAAI,EACHoG,GACFpE,EAAQ,IAAIoE,CAAK,CAErB,MAAWpG,IAAS,KAAKR,IACd,KAAKA,GAAM,WAAa,gBACjCwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,eAAgB,CACnB,GAAI+B,EAAY,CACd,KAAM,CAACqE,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,CACL,EAAGpG,CAAI,EACP,GAAIoG,IAAUpG,EAAM,CAClB,KAAM,CAACqG,CAAK,EAAI,KAAK,kBAAkB,CACrC,EAAG,EACH,EAAG,EACH,QAAS,EACX,EAAGrG,CAAI,EACHqG,IAAUrG,GACZgC,EAAQ,IAAIhC,CAAI,CAEpB,CACF,MAAWA,IAAS,KAAKR,IACd,KAAKA,GAAM,WAAa,gBACjCwC,EAAQ,IAAIhC,CAAI,EAElB,KACF,CACA,IAAK,OACL,IAAK,eAEH,MAGF,IAAK,QACL,IAAK,SACL,IAAK,eACL,IAAK,aAAc,CACjB,GAAI,KAAKH,GAAO,CACd,MAAMO,EAAM,gCAAgC2C,CAAO,GACnD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,SACL,IAAK,WACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,UACL,IAAK,gBACL,IAAK,aACL,IAAK,SACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,OACL,IAAK,SACL,IAAK,qBACL,IAAK,UACL,IAAK,UACL,IAAK,UACL,IAAK,eACL,IAAK,aACL,IAAK,gBACL,IAAK,mBAAoB,CACvB,GAAI,KAAKP,GAAO,CACd,MAAMO,EAAM,6BAA6B2C,CAAO,GAChD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAI2C,EAAQ,WAAW,UAAU,GAC/B,GAAI,KAAKlD,GAAO,CACd,MAAMO,EAAM,6BAA6B2C,CAAO,GAChD,MAAM,IAAI,aAAa3C,EAAK,mBAAiB,CAC/C,UACS,CAAC6C,EAAS,CACnB,MAAM7C,EAAM,yBAAyB2C,CAAO,GAC5C,MAAM,IAAI,aAAa3C,EAAK,YAAU,CACxC,CAEJ,CACF,CACA,OAAO4B,CACT,CAQA,wBAAwBhB,EAAKhB,EAAM,CACjC,KAAM,CACJ,MAAOsG,EAAU,QAASC,EAAY,KAAMxD,EAAS,MAAOyD,CAC9D,EAAIxF,EACJ,GAAI,OAAOsF,GAAa,UAAY,CAAC,UAAU,KAAKA,CAAQ,EAAG,CAE7D,MAAMlG,EAAM,uBADA,eAAYY,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaZ,EAAK,YAAU,CACxC,CACA,KAAM,CAAE,WAAAqG,CAAW,EAAIzG,EACvB,IAAIa,EACJ,GAAI4F,GAAcA,EAAW,OAAQ,CACnC,IAAIC,EACA,KAAKtH,GAAU,cAAgB,YAC7B,OAAOkH,GAAa,UAAY,OAAO,KAAKA,CAAQ,EACtDI,EAAkB,GAElBA,EAAkB,GAEX,OAAOJ,GAAa,UAAY,OAAO,KAAKA,CAAQ,EAC7DI,EAAkB,GAElBA,EAAkB,GAEpB,IAAIC,KAAc,oBAAiB5D,EAAQ,IAAI,EAC3C2D,IACFC,EAAcA,EAAY,YAAY,GAExC,MAAMC,EAAa,IAAI,IAEvB,GAAID,EAAY,QAAQ,GAAG,EAAI,GAAI,CACjC,KAAM,CACJ,OAAQE,EAAe,QAASC,CAClC,KAAI,uBAAoBH,CAAW,EACnC,OAAS,CAAE,KAAMI,EAAU,MAAOC,CAAU,IAAKP,EAK/C,OAJIC,IACFK,EAAWA,EAAS,YAAY,EAChCC,EAAYA,EAAU,YAAY,GAE5BH,EAAe,CACrB,IAAK,GAAI,CACHC,IAAqBC,GACvBH,EAAW,IAAII,CAAS,EAE1B,KACF,CACA,IAAK,IAAK,CACJD,EAAS,QAAQ,GAAG,EAAI,GACtBA,EAAS,SAAS,IAAID,CAAgB,EAAE,GAC1CF,EAAW,IAAII,CAAS,EAEjBF,IAAqBC,GAC9BH,EAAW,IAAII,CAAS,EAE1B,KACF,CACA,QACE,GAAID,EAAS,QAAQ,GAAG,EAAI,GAAI,CAC9B,KAAM,CAACE,EAAgBC,CAAiB,EAAIH,EAAS,MAAM,GAAG,EAC1DF,IAAkBI,GAClBH,IAAqBI,MACrB,uBAAoBL,EAAe7G,CAAI,GACzC4G,EAAW,IAAII,CAAS,CAE5B,CAEJ,CAEJ,KACE,QAAS,CAAE,KAAMD,EAAU,MAAOC,CAAU,IAAKP,EAK/C,GAJIC,IACFK,EAAWA,EAAS,YAAY,EAChCC,EAAYA,EAAU,YAAY,GAEhCD,EAAS,QAAQ,GAAG,EAAI,GAAI,CAC9B,KAAM,CAACE,EAAgBC,CAAiB,EAAIH,EAAS,MAAM,GAAG,EAE9D,GAAIE,IAAmB,OAASC,IAAsB,OACpD,SACSP,IAAgBO,GACzBN,EAAW,IAAII,CAAS,CAE5B,MAAWL,IAAgBI,GACzBH,EAAW,IAAII,CAAS,EAI9B,GAAIJ,EAAW,KAAM,CACnB,KAAM,CACJ,KAAMO,EAAmB,MAAOC,CAClC,EAAIZ,GAAY,CAAC,EACjB,IAAIa,EAgBJ,OAfIF,EACET,EACFW,EAAYF,EAAkB,YAAY,EAE1CE,EAAYF,EAELC,EACLV,EACFW,EAAYD,EAAmB,YAAY,EAE3CC,EAAYD,EAELA,IAAuB,KAChCC,EAAYD,GAENb,EAAY,CAClB,IAAK,IAAK,CACJ,OAAOc,GAAc,UAAYT,EAAW,IAAIS,CAAS,IAC3DxG,EAAMb,GAER,KACF,CACA,IAAK,KAAM,CACT,GAAIqH,GAAa,OAAOA,GAAc,UACpC,UAAWzD,KAASgD,EAElB,GADa,IAAI,IAAIhD,EAAM,MAAM,KAAK,CAAC,EAC9B,IAAIyD,CAAS,EAAG,CACvBxG,EAAMb,EACN,KACF,EAGJ,KACF,CACA,IAAK,KAAM,CACT,GAAIqH,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAI7F,EACJ,UAAWoC,KAASgD,EAClB,GAAIhD,IAAUyD,GAAazD,EAAM,WAAW,GAAGyD,CAAS,GAAG,EAAG,CAC5D7F,EAAOoC,EACP,KACF,CAEEpC,IACFX,EAAMb,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqH,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAI7F,EACJ,UAAWoC,KAASgD,EAClB,GAAIhD,EAAM,WAAW,GAAGyD,CAAS,EAAE,EAAG,CACpC7F,EAAOoC,EACP,KACF,CAEEpC,IACFX,EAAMb,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqH,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAI7F,EACJ,UAAWoC,KAASgD,EAClB,GAAIhD,EAAM,SAAS,GAAGyD,CAAS,EAAE,EAAG,CAClC7F,EAAOoC,EACP,KACF,CAEEpC,IACFX,EAAMb,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqH,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAI7F,EACJ,UAAWoC,KAASgD,EAClB,GAAIhD,EAAM,SAAS,GAAGyD,CAAS,EAAE,EAAG,CAClC7F,EAAOoC,EACP,KACF,CAEEpC,IACFX,EAAMb,EAEV,CACA,KACF,CACA,KAAK,KACL,QACEa,EAAMb,CAEV,CACF,CACF,CACA,OAAOa,GAAO,IAChB,CAQA,oBAAoBG,EAAKhB,EAAM,CAC7B,MAAM+C,KAAU,oBAAiB/B,EAAI,IAAI,EACzC,IAAIH,EACJ,OAAIb,EAAK,UAAU,SAAS+C,CAAO,IACjClC,EAAMb,GAEDa,GAAO,IAChB,CAQA,iBAAiBG,EAAKhB,EAAM,CAC1B,MAAM+C,KAAU,oBAAiB/B,EAAI,IAAI,EACnC,CAAE,GAAAyE,CAAG,EAAIzF,EACf,IAAIa,EACJ,OAAIkC,IAAY0C,IACd5E,EAAMb,GAEDa,GAAO,IAChB,CAUA,mBAAmBG,EAAKhB,EAAMgD,EAAM,CAAC,EAAG,CACtC,MAAMD,KAAU,oBAAiB/B,EAAI,IAAI,EACnC,CAAE,UAAAuB,EAAW,OAAAC,CAAO,EAAIxC,EACxB,CAAE,QAAAiD,CAAQ,EAAID,EACpB,GAAI,CACF,OAAQsE,EAAW,QAASC,CAC9B,KAAI,uBAAoBxE,EAAS/C,CAAI,EACjC,KAAKZ,GAAU,cAAgB,cACjCkI,EAAYA,EAAU,YAAY,EAClCC,EAAcA,EAAY,YAAY,GAExC,IAAIC,EACA5B,EAEArD,EAAU,QAAQ,GAAG,EAAI,GAC3B,CAACiF,EAAY5B,CAAQ,EAAIrD,EAAU,MAAM,GAAG,GAE5CiF,EAAahF,GAAU,GACvBoD,EAAWrD,GAEb,IAAI1B,EACJ,GAAIyG,IAAc,IAAME,IAAe,GACjCxH,EAAK,eAAiB,OACrBuH,IAAgB,KAAOA,IAAgB3B,KAC1C/E,EAAMb,WAECsH,IAAc,KACnBC,IAAgB,KAAOA,IAAgB3B,KACzC/E,EAAMb,WAECsH,IAAcE,GACvB,MAAI,uBAAoBF,EAAWtH,CAAI,GACjCuH,IAAgB,KAAOA,IAAgB3B,KACzC/E,EAAMb,WAEC,CAACiD,EAAS,CACnB,MAAM7C,EAAM,wBAAwBkH,CAAS,GAC7C,MAAM,IAAI,aAAalH,EAAK,YAAU,CACxC,UACSkH,GAAa,CAACrE,GAAW,IAAC,uBAAoBqE,EAAWtH,CAAI,EAAG,CACzE,MAAMI,EAAM,wBAAwBkH,CAAS,GAC7C,MAAM,IAAI,aAAalH,EAAK,YAAU,CACxC,CACA,OAAOS,GAAO,IAChB,CAQA,4BAA4BG,EAAKhB,EAAM,CACrC,KAAM,CAAE,SAAUwE,CAAY,EAAIxD,EAC5B+B,KAAU,oBAAiB/B,EAAI,IAAI,EACzC,IAAIH,EACJ,GAAI,MAAM,QAAQ2D,CAAW,EAAG,CAC9B,KAAM,CAACjD,CAAM,KAAI,WAAQiD,EAAY,CAAC,CAAC,EACjC,CAAC,GAAGnE,CAAM,EAAIkB,EACd,CAAE,KAAAkG,CAAK,EAAIzH,EACjB,GAAI+C,IAAY,OAAQ,CACtB,IAAIZ,EACJ,UAAW0B,KAAQxD,EAAQ,CACzB,KAAM,CAAE,KAAMyD,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM1D,EAAM,uBADA,eAAYY,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaZ,EAAK,YAAU,CACxC,CAEA,GADA+B,EAAO,KAAK,eAAe0B,EAAM4D,CAAI,EAAE,IAAIA,CAAI,EAC3C,CAACtF,EACH,KAEJ,CACIA,IACFtB,EAAMb,EAEV,SAAW+C,IAAY,eAAgB,CACrC,IAAIZ,EACAhC,EAASsH,EACb,KAAOtH,GAAQ,CACb,UAAW0D,KAAQxD,EAAQ,CACzB,KAAM,CAAE,KAAMyD,CAAS,EAAID,EAC3B,GAAIC,IAAa,aAAY,CAE3B,MAAM1D,EAAM,uBADA,eAAYY,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaZ,EAAK,YAAU,CACxC,CAEA,GADA+B,EAAO,KAAK,eAAe0B,EAAM1D,CAAM,EAAE,IAAIA,CAAM,EAC/C,CAACgC,EACH,KAEJ,CACA,GAAIA,EACF,MAEAhC,EAASA,EAAO,UAEpB,CACIgC,IACFtB,EAAMb,EAEV,CACF,SAAW+C,IAAY,OACrBlC,EAAMb,MACD,CACL,MAAMI,EAAM,qBAAqB2C,CAAO,GACxC,MAAM,IAAI,aAAa3C,EAAK,YAAU,CACxC,CACA,OAAOS,GAAO,IAChB,CASA,eAAeG,EAAKhB,EAAMgD,EAAK,CAC7B,KAAM,CAAE,KAAM0E,CAAQ,EAAI1G,EACpB+B,KAAU,oBAAiB/B,EAAI,IAAI,EACzC,IAAIgB,EAAU,IAAI,IAClB,GAAIhC,EAAK,WAAa,eACpB,OAAQ0H,EAAS,CACf,KAAK,gBAAe,CAClB,MAAM7G,EAAM,KAAK,wBAAwBG,EAAKhB,CAAI,EAC9Ca,GACFmB,EAAQ,IAAInB,CAAG,EAEjB,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMA,EAAM,KAAK,oBAAoBG,EAAKhB,CAAI,EAC1Ca,GACFmB,EAAQ,IAAInB,CAAG,EAEjB,KACF,CACA,KAAK,cAAa,CAChB,MAAMA,EAAM,KAAK,iBAAiBG,EAAKhB,CAAI,EACvCa,GACFmB,EAAQ,IAAInB,CAAG,EAEjB,KACF,CACA,KAAK,wBAAuB,CAC1B,MAAME,EAAQ,KAAK,0BAA0BC,EAAKhB,EAAMgD,CAAG,EACvDjC,EAAM,OACRiB,EAAUjB,GAEZ,KACF,CACA,KAAK,0BAAyB,CAC5B,KAAK,4BAA4BgC,EAASC,CAAG,EAC7C,KACF,CACA,KAAK,gBACL,QAAS,CACP,MAAMnC,EAAM,KAAK,mBAAmBG,EAAKhB,EAAMgD,CAAG,EAC9CnC,GACFmB,EAAQ,IAAInB,CAAG,CAEnB,CACF,SACS,KAAKnB,IAAWgI,IAAY,yBAC5B1H,EAAK,WAAa,0BAC3B,GAAI+C,IAAY,OAAS,qBAAmB,KAAKA,CAAO,EAAG,CACzD,MAAMhC,EAAQ,KAAK,0BAA0BC,EAAKhB,EAAMgD,CAAG,EACvDjC,EAAM,OACRiB,EAAUjB,EAEd,SAAW,kBAAgB,KAAKgC,CAAO,EAAG,CACxC,MAAMlC,EAAM,KAAK,4BAA4BG,EAAKhB,CAAI,EAClDa,GACFmB,EAAQ,IAAInB,CAAG,CAEnB,EAEF,OAAOmB,CACT,CASA,aAAa3B,EAAQL,EAAMgD,EAAK,CAC9B,IAAIb,EACJ,UAAW0B,KAAQxD,EAEjB,GADA8B,EAAO,KAAK,eAAe0B,EAAM7D,EAAMgD,CAAG,EAAE,IAAIhD,CAAI,EAChD,CAACmC,EACH,MAGJ,MAAO,CAAC,CAACA,CACX,CAQA,qBAAqB9B,EAAQsH,EAAU,CACrC,KAAM,CAAC9D,EAAM,GAAG+D,CAAY,EAAIvH,EAC1B,CAAE,KAAMyD,CAAS,EAAID,EACrBgE,KAAW,oBAAiBhE,EAAK,IAAI,EACrCiE,EAAWF,EAAa,OAAS,EACvC,IAAI7G,EAAQ,IAAI,IACZgH,EAAU,GACd,GAAI,KAAKrI,GACPqI,EAAU,OAEV,QAAQjE,EAAU,CAChB,KAAK,cAAa,CAChB,GAAI,KAAKtE,GAAM,WAAa,eAC1BuI,EAAU,OACL,CACL,MAAM/H,EAAO,KAAKR,GAAM,eAAeqI,CAAQ,EAC3C7H,GAAQA,IAAS2H,GAAYA,EAAS,SAAS3H,CAAI,IACjD8H,EACW,KAAK,aAAaF,EAAc5H,CAAI,GAE/Ce,EAAM,IAAIf,CAAI,EAGhBe,EAAM,IAAIf,CAAI,EAGpB,CACA,KACF,CACA,KAAK,iBAAgB,CACnB,MAAMM,EAAM,CAAC,EAAE,MAAM,KAAKqH,EAAS,uBAAuBE,CAAQ,CAAC,EACnE,GAAIvH,EAAI,OACN,GAAIwH,EACF,UAAW9H,KAAQM,EACJ,KAAK,aAAasH,EAAc5H,CAAI,GAE/Ce,EAAM,IAAIf,CAAI,OAIlBe,EAAQ,IAAI,IAAIT,CAAG,EAGvB,KACF,CACA,KAAK,gBAAe,CAClB,GAAI,KAAKlB,GAAU,cAAgB,aAC/B,CAAC,OAAO,KAAKyI,CAAQ,EAAG,CAC1B,MAAMvH,EAAM,CAAC,EAAE,MAAM,KAAKqH,EAAS,qBAAqBE,CAAQ,CAAC,EACjE,GAAIvH,EAAI,OACN,GAAIwH,EACF,UAAW9H,KAAQM,EACJ,KAAK,aAAasH,EAAc5H,CAAI,GAE/Ce,EAAM,IAAIf,CAAI,OAIlBe,EAAQ,IAAI,IAAIT,CAAG,CAGzB,MACEyH,EAAU,GAEZ,KACF,CACA,KAAK,0BAAyB,CAC5B,KAAK,4BAA4BF,CAAQ,EACzC,KACF,CACA,QACEE,EAAU,EAEd,CAEF,MAAO,CACL,MAAAhH,EACA,QAAAgH,CACF,CACF,CAWA,iBAAiB7D,EAAMlE,EAAMgD,EAAM,CAAC,EAAG,CACrC,KAAM,CAAE,MAAAe,EAAO,OAAA1D,CAAO,EAAI6D,EACpB,CAAE,KAAM8D,CAAU,EAAIjE,EACtB,CAAE,IAAAb,EAAK,QAAAD,CAAQ,EAAID,EACzB,IAAIhB,EAAU,IAAI,IAClB,GAAIkB,IAAQxE,EACV,OAAQsJ,EAAW,CACjB,IAAK,IAAK,CACR,MAAMpG,EAAU5B,EAAK,mBACjB4B,GACW,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,KAAM,CAAE,WAAAG,CAAW,EAAI/B,EACvB,GAAI+B,EAAY,CACd,MAAML,EACJ,KAAKtC,GAAU,iBAAiB2C,EAAY,cAAY,EAC1D,IAAIH,EAAU,KAAK,UAAU5B,EAAM0B,CAAM,EAIzC,IAHIE,IAAY5B,IACd4B,EAAUF,EAAO,YAAY,GAExBE,GACQ,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAErBA,EAAUF,EAAO,YAAY,CAEjC,CACA,KACF,CACA,IAAK,IAAK,CACR,MAAMA,EAAS,KAAKtC,GAAU,iBAAiBY,EAAM,cAAY,EACjE,IAAI4B,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACQ,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAErBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IACL,QAAS,CACP,KAAM,CAAE,MAAAX,EAAO,QAAAgH,CAAQ,EAAI,KAAK,qBAAqB1H,EAAQL,CAAI,EACjE,GAAIe,EAAM,KACRiB,EAAUjB,UACDgH,EAAS,CAClB,MAAMrG,EAAS,KAAKtC,GAAU,iBAAiBY,EAAM,cAAY,EACjE,IAAI4B,EAAUF,EAAO,SAAS,EAC9B,KAAOE,GACQ,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAErBA,EAAUF,EAAO,SAAS,CAE9B,CACF,CACF,KAEA,QAAQsG,EAAW,CACjB,IAAK,IAAK,CACR,MAAMpG,EAAU5B,EAAK,uBACjB4B,GACW,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAGvB,KACF,CACA,IAAK,IAAK,CACR,MAAMF,EACJ,KAAKtC,GAAU,iBAAiBY,EAAK,WAAY,cAAY,EAC/D,IAAI4B,EAAUF,EAAO,WAAW,EAChC,KAAOE,GACDA,IAAY5B,GAGD,KAAK,aAAaK,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAGvBA,EAAUF,EAAO,YAAY,EAE/B,KACF,CACA,IAAK,IAAK,CACR,MAAME,EAAU5B,EAAK,WACjB4B,GACW,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzDjB,EAAQ,IAAIJ,CAAO,EAGvB,KACF,CACA,IAAK,IACL,QAAS,CACP,MAAMtB,EAAM,CAAC,EACb,IAAIsB,EAAU5B,EAAK,WACnB,KAAO4B,GACQ,KAAK,aAAavB,EAAQuB,EAAS,CAAE,QAAAqB,CAAQ,CAAC,GAEzD3C,EAAI,KAAKsB,CAAO,EAElBA,EAAUA,EAAQ,WAEhBtB,EAAI,SACN0B,EAAU,IAAI,IAAI1B,EAAI,QAAQ,CAAC,EAEnC,CACF,CAEF,OAAO0B,CACT,CASA,UAAU3B,EAAQ2C,EAAM,CAAC,EAAG,CAC1B,KAAM,CAAE,KAAAhD,CAAK,EAAIgD,EACjB,IAAIiF,EACArG,EAAU,KAAK,UAAU5B,EAAM,KAAKX,EAAO,EAC/C,GAAIuC,EAQF,IAPIA,EAAQ,WAAa,eACvBA,EAAU,KAAKvC,GAAQ,SAAS,EACvBuC,IAAY5B,GACjB4B,IAAY,KAAKpC,KACnBoC,EAAU,KAAKvC,GAAQ,SAAS,GAG7BuC,GAAS,CACd,IAAIO,EAUJ,GATI,KAAK7C,GAAM,WAAa,eACtBsC,IAAY,KAAKtC,GACnB6C,EAAO,GAEPA,EAAO,KAAK7C,GAAM,SAASsC,CAAO,EAGpCO,EAAO,GAELA,GACc,KAAK,aAAa9B,EAAQuB,CAAO,EACpC,CACXqG,EAAcrG,EACd,KACF,CAEFA,EAAU,KAAKvC,GAAQ,SAAS,CAClC,CAEF,OAAO4I,GAAe,IACxB,CAQA,gBAAgB/D,EAAMgE,EAAY,CAChC,KAAM,CAAE,OAAA7H,CAAO,EAAI6D,EACb,CAACL,EAAM,GAAG+D,CAAY,EAAIvH,EAC1B,CAAE,KAAMyD,CAAS,EAAID,EACrBgE,KAAW,oBAAiBhE,EAAK,IAAI,EACrCiE,EAAWF,EAAa,OAAS,EACvC,IAAI7G,EAAQ,IAAI,IACZoH,EAAW,GACXJ,EAAU,GACd,OAAQjE,EAAU,CAChB,KAAK,cAAa,CAChB,GAAIoE,IAAenJ,EACJ,KAAK,aAAasB,EAAQ,KAAKf,EAAK,IAE/CyB,EAAM,IAAI,KAAKzB,EAAK,EACpB6I,EAAW,YAEJD,IAAepJ,EAAe,CACvC,IAAI8C,EAAU,KAAKtC,GACnB,KAAOsC,GACQ,KAAK,aAAavB,EAAQuB,CAAO,IAE5Cb,EAAM,IAAIa,CAAO,EACjBuG,EAAW,IAEbvG,EAAUA,EAAQ,UAEtB,SAAWsG,IAAerJ,GACf,KAAKW,GAAM,WAAa,eAAc,CAC/C,MAAMQ,EAAO,KAAKR,GAAM,eAAeqI,CAAQ,EAC3C7H,GACFe,EAAM,IAAIf,CAAI,CAElB,MACE+H,EAAU,GAEZ,KACF,CACA,KAAK,iBAAgB,CACnB,GAAIG,IAAenJ,EACb,KAAKO,GAAM,WAAa,gBACxB,KAAKA,GAAM,UAAU,SAASuI,CAAQ,GACxC9G,EAAM,IAAI,KAAKzB,EAAK,UAEb4I,IAAepJ,EAAe,CACvC,IAAI8C,EAAU,KAAKtC,GACnB,KAAOsC,GACDA,EAAQ,WAAa,gBACnBA,EAAQ,UAAU,SAASiG,CAAQ,GACrC9G,EAAM,IAAIa,CAAO,EAEnBA,EAAUA,EAAQ,UAKxB,SAAWsG,IAAerJ,EAAc,CACtC,MAAMmB,EAAO,KAAK,UAAUK,EAAQ,CAClC,KAAM,KAAKf,EACb,CAAC,EACGU,IACFe,EAAM,IAAIf,CAAI,EACdmI,EAAW,GAEf,SAAW,KAAK3I,GAAM,WAAa,gBAAe,CAChD,MAAMc,EACJ,CAAC,EAAE,MAAM,KAAK,KAAKd,GAAM,uBAAuBqI,CAAQ,CAAC,EAC3D,GAAI,KAAKvI,GAAM,WAAa,eAC1B,UAAWU,KAAQM,GACbN,IAAS,KAAKV,OAAS,eAAYU,EAAM,KAAKV,EAAK,IACrDyB,EAAM,IAAIf,CAAI,OAGTM,EAAI,SACbS,EAAQ,IAAI,IAAIT,CAAG,EAEvB,MACEyH,EAAU,GAEZ,KACF,CACA,KAAK,gBAAe,CAClB,GAAIG,IAAenJ,EACb,KAAKO,GAAM,WAAa,gBACb,KAAK,aAAae,EAAQ,KAAKf,EAAK,IAE/CyB,EAAM,IAAI,KAAKzB,EAAK,EACpB6I,EAAW,YAGND,IAAepJ,EAAe,CACvC,IAAI8C,EAAU,KAAKtC,GACnB,KAAOsC,GACDA,EAAQ,WAAa,gBACV,KAAK,aAAavB,EAAQuB,CAAO,IAE5Cb,EAAM,IAAIa,CAAO,EACjBuG,EAAW,IAEbvG,EAAUA,EAAQ,UAKxB,SAAWsG,IAAerJ,EAAc,CACtC,MAAMmB,EAAO,KAAK,UAAUK,EAAQ,CAClC,KAAM,KAAKf,EACb,CAAC,EACGU,IACFe,EAAM,IAAIf,CAAI,EACdmI,EAAW,GAEf,SAAW,KAAK/I,GAAU,cAAgB,aAC/B,KAAKI,GAAM,WAAa,iBACxB,CAAC,OAAO,KAAKqI,CAAQ,EAAG,CACjC,MAAMvH,EAAM,CAAC,EAAE,MAAM,KAAK,KAAKd,GAAM,qBAAqBqI,CAAQ,CAAC,EACnE,GAAI,KAAKvI,GAAM,WAAa,eAC1B,UAAWU,KAAQM,GACbN,IAAS,KAAKV,OAAS,eAAYU,EAAM,KAAKV,EAAK,IACrDyB,EAAM,IAAIf,CAAI,OAGTM,EAAI,SACbS,EAAQ,IAAI,IAAIT,CAAG,EAEvB,MACEyH,EAAU,GAEZ,KACF,CACA,KAAK,0BAAyB,CAE5B,KAAK,4BAA4BF,CAAQ,EACzC,KACF,CACA,QACE,GAAIK,IAAepJ,GAAiB,kBAAgB,KAAK+I,CAAQ,GAC/D,GAAI,KAAKnI,IAAW,KAAKJ,GAAM,WAAa,yBAAwB,CAClE,MAAMU,EAAO,KAAK,4BAA4B6D,EAAM,KAAKvE,EAAK,EAC1DU,GACFe,EAAM,IAAIf,CAAI,CAElB,UACSkI,IAAenJ,EACX,KAAK,aAAasB,EAAQ,KAAKf,EAAK,IAE/CyB,EAAM,IAAI,KAAKzB,EAAK,EACpB6I,EAAW,YAEJD,IAAepJ,EAAe,CACvC,IAAI8C,EAAU,KAAKtC,GACnB,KAAOsC,GACQ,KAAK,aAAavB,EAAQuB,CAAO,IAE5Cb,EAAM,IAAIa,CAAO,EACjBuG,EAAW,IAEbvG,EAAUA,EAAQ,UAEtB,SAAWsG,IAAerJ,EAAc,CACtC,MAAMmB,EAAO,KAAK,UAAUK,EAAQ,CAClC,KAAM,KAAKf,EACb,CAAC,EACGU,IACFe,EAAM,IAAIf,CAAI,EACdmI,EAAW,GAEf,MACEJ,EAAU,EAGhB,CACA,MAAO,CACL,SAAAD,EACA,SAAAK,EACA,MAAApH,EACA,QAAAgH,CACF,CACF,CAQA,cAAcxG,EAAQ2G,EAAY,CAChC,MAAME,EAAY7G,EAAO,OACnB8G,EAAUD,EAAY,EACtBE,EAAY/G,EAAO,CAAC,EAC1B,IAAI2B,EACAgB,EACJ,GAAImE,EAAS,CACX,KAAM,CACJ,MAAOE,EACP,OAAQ,CAAC,CACP,KAAMC,EACN,KAAMC,CACR,CAAC,CACH,EAAIH,EACEI,EAAWnH,EAAO6G,EAAY,CAAC,EAC/B,CACJ,OAAQ,CAAC,CACP,KAAMO,EACN,KAAMC,CACR,CAAC,CACH,EAAIF,EACJ,GAAIE,IAAa,2BAA2BA,IAAa,cACvD1F,EAAMvE,EACNuF,EAAOwE,UACED,IAAc,2BACdA,IAAc,cACvBvF,EAAMxE,EACNwF,EAAOoE,UACEJ,IAAetJ,EACxB,GAAI4J,IAAc,KAAOC,IAAc,gBACrCvF,EAAMvE,EACNuF,EAAOwE,UACEC,IAAa,KAAOC,IAAa,gBAC1C1F,EAAMxE,EACNwF,EAAOoE,UACEF,IAAc,EAAG,CAC1B,KAAM,CAAE,KAAMJ,CAAU,EAAIO,EACxB,SAAS,KAAKP,CAAS,GACzB9E,EAAMvE,EACNuF,EAAOwE,IAEPxF,EAAMxE,EACNwF,EAAOoE,EAEX,MACEpF,EAAMxE,EACNwF,EAAOoE,UAEAK,IAAa,KAAOC,IAAa,gBAC1C1F,EAAMxE,EACNwF,EAAOoE,UACEE,IAAc,KAAOC,IAAc,gBAC5CvF,EAAMvE,EACNuF,EAAOwE,MACF,CACL,IAAIvG,EACA0G,EACJ,SAAW,CAAE,MAAA9E,EAAO,OAAQ,CAACF,CAAI,CAAE,IAAKtC,EAAQ,CAC9C,KAAM,CAAE,KAAMuC,CAAS,EAAID,EACrBgE,KAAW,oBAAiBhE,EAAK,IAAI,EAC3C,GAAIC,IAAa,yBAAyB+D,IAAa,MAAO,CAC5D1F,EAAO,GACP,KACF,CACA,GAAI4B,GAAS,CAAC8E,EAAS,CACrB,KAAM,CAAE,KAAMb,CAAU,EAAIjE,EACxB,SAAS,KAAKiE,CAAS,IACzB7F,EAAO,GACP0G,EAAU,GAEd,CACF,CACI1G,GACFe,EAAMxE,EACNwF,EAAOoE,IAEPpF,EAAMvE,EACNuF,EAAOwE,EAEX,CACF,MACExF,EAAMvE,EACNuF,EAAOoE,EAET,MAAO,CACL,QAAAD,EACA,IAAAnF,EACA,KAAAgB,CACF,CACF,CAOA,cAAcgE,EAAY,CACxB,MAAMlH,EAAM,KAAK/B,GAAK,OAAO,EAC7B,GAAIiJ,IAAetJ,GAAcsJ,IAAerJ,EAAc,CAC5D,MAAMiK,EAAe,IAAI,IACzB,IAAI3H,EAAI,EACR,SAAW,CAAE,OAAAI,CAAO,IAAKP,EAAK,CAC5B,KAAM,CAAE,IAAAkC,EAAK,KAAAgB,CAAK,EAAI,KAAK,cAAc3C,EAAQ2G,CAAU,EACrD,CACJ,SAAAJ,EAAU,SAAAK,EAAU,MAAApH,EAAO,QAAAgH,CAC7B,EAAI,KAAK,gBAAgB7D,EAAMgE,CAAU,EACrCnH,EAAM,MACR,KAAK9B,GAAKkC,CAAC,EAAE,KAAO,GACpB,KAAK5B,GAAO4B,CAAC,EAAIJ,GACRgH,GACTe,EAAa,IAAI,IAAI,IAAI,CACvB,CAAC,QAAS3H,CAAC,EACX,CAAC,OAAQ+C,CAAI,CACf,CAAC,CAAC,EAEJ,KAAKjF,GAAKkC,CAAC,EAAE,IAAM+B,EACnB,KAAKjE,GAAKkC,CAAC,EAAE,SAAWgH,GAAY,CAACL,EACrC3G,GACF,CACA,GAAI2H,EAAa,KAAM,CACrB,IAAI9I,EACA0B,EACA,KAAKpC,KAAU,KAAKE,IAAS,KAAKF,GAAM,WAAa,gBACvDU,EAAO,KAAKV,GACZoC,EAAS,KAAKrC,KAEdW,EAAO,KAAKR,GACZkC,EAAS,KAAK9B,IAEhB,IAAIuE,EAAW,KAAK,UAAUnE,EAAM0B,CAAM,EAC1C,KAAOyC,GAAU,CACf,IAAIhC,EAAO,GAUX,GATI,KAAK7C,GAAM,WAAa,eACtB6E,IAAa,KAAK7E,GACpB6C,EAAO,GAEPA,EAAO,KAAK7C,GAAM,SAAS6E,CAAQ,EAGrChC,EAAO,GAELA,EACF,UAAW4G,KAAeD,EAAc,CACtC,KAAM,CAAE,OAAAzI,CAAO,EAAI0I,EAAY,IAAI,MAAM,EAEzC,GADgB,KAAK,aAAa1I,EAAQ8D,CAAQ,EACrC,CACX,MAAM6E,EAAQD,EAAY,IAAI,OAAO,EACrC,KAAK9J,GAAK+J,CAAK,EAAE,SAAW,GAC5B,KAAK/J,GAAK+J,CAAK,EAAE,KAAO,GACxB,KAAKzJ,GAAOyJ,CAAK,EAAE,IAAI7E,CAAQ,CACjC,CACF,CAEFA,EAAWzC,EAAO,SAAS,CAC7B,CACF,CACF,KAAO,CACL,IAAIP,EAAI,EACR,SAAW,CAAE,OAAAI,CAAO,IAAKP,EAAK,CAC5B,MAAMkD,EAAO3C,EAAOA,EAAO,OAAS,CAAC,EAC/B,CACJ,SAAAuG,EAAU,SAAAK,EAAU,MAAApH,CACtB,EAAI,KAAK,gBAAgBmD,EAAMgE,CAAU,EACrCnH,EAAM,OACR,KAAK9B,GAAKkC,CAAC,EAAE,KAAO,GACpB,KAAK5B,GAAO4B,CAAC,EAAIJ,GAEnB,KAAK9B,GAAKkC,CAAC,EAAE,IAAMxC,EACnB,KAAKM,GAAKkC,CAAC,EAAE,SAAWgH,GAAY,CAACL,EACrC3G,GACF,CACF,CACA,MAAO,CACL,KAAKlC,GACL,KAAKM,EACP,CACF,CAOA,WAAWwB,EAAO,CAChB,MAAMT,EAAM,CAAC,GAAGS,CAAK,EACrB,OAAIT,EAAI,OAAS,GACfA,EAAI,KAAK,CAACC,EAAGC,IAAM,CACjB,IAAIK,EACJ,SAAI,eAAYL,EAAGD,CAAC,EAClBM,EAAM,EAENA,EAAM,GAEDA,CACT,CAAC,EAEIP,CACT,CAOA,YAAY4H,EAAY,CACtB,KAAM,CAAC,GAAG7G,CAAQ,EAAI,KAAKpC,GACrBiC,EAAIG,EAAS,OACnB,IAAIN,EAAQ,IAAI,IAChB,QAASI,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,KAAM,CAAE,OAAAI,EAAQ,IAAA2B,EAAK,SAAAiF,EAAU,KAAAc,CAAK,EAAI5H,EAASF,CAAC,EAC5CiH,EAAY7G,EAAO,OACzB,GAAI6G,GAAaa,EAAM,CACrB,MAAMC,EAAa,KAAK3J,GAAO4B,CAAC,EAC1BmD,EAAY8D,EAAY,EAC9B,GAAI9D,IAAc,EAAG,CACnB,KAAM,CAAE,OAAQ,CAAC,CAAE,GAAGsD,CAAY,CAAE,EAAIrG,EAAO,CAAC,EAChD,IAAK2G,IAAetJ,GAAcsJ,IAAerJ,IAC7C,KAAKS,GAAM,WAAa,gBAC1B,UAAWU,KAAQkJ,EAEjB,IADaf,GAAY,KAAK,aAAaP,EAAc5H,CAAI,IACjDA,IAAS,KAAKV,IAAS,KAAKA,GAAM,SAASU,CAAI,IACzDe,EAAM,IAAIf,CAAI,EACVkI,IAAetJ,GACjB,cAIIgJ,EAAa,QAcvB,UAAW5H,KAAQkJ,EAEjB,IADaf,GAAY,KAAK,aAAaP,EAAc5H,CAAI,KAE3De,EAAM,IAAIf,CAAI,EACVkI,IAAetJ,GACjB,cAlBFsJ,IAAetJ,EACjB,GAAImC,EAAM,KAAM,CACd,MAAMoI,EAAI,CAAC,GAAGpI,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGoI,EAAG,GAAGD,CAAU,CAAC,EACrC,KAAKvJ,GAAQ,EACf,MACEoB,EAAQ,IAAI,IAAI,CAAC,GAAGmI,CAAU,CAAC,MAE5B,CACL,KAAM,CAAClJ,CAAI,EAAI,CAAC,GAAGkJ,CAAU,EAC7BnI,EAAM,IAAIf,CAAI,CAChB,CAYJ,SAAWkD,IAAQxE,EAAU,CAC3B,GAAI,CAAE,MAAAqF,EAAO,OAAQqF,CAAY,EAAI7H,EAAO,CAAC,EAC7C,KAAM,CAAC,CAAE,GAAGqG,CAAY,EAAIwB,EAC5B,IAAIpH,EACJ,UAAWhC,KAAQkJ,EAAY,CAE7B,GADaf,GAAY,KAAK,aAAaP,EAAc5H,CAAI,EACnD,CACR,IAAIuE,EAAY,IAAI,IAAI,CAACvE,CAAI,CAAC,EAC9B,QAASqC,EAAI,EAAGA,EAAI+F,EAAW/F,IAAK,CAClC,KAAM,CAAE,MAAOgH,EAAW,OAAAhJ,CAAO,EAAIkB,EAAOc,CAAC,EACvC/B,EAAM,CAAC,EACb,UAAW6D,KAAYI,EAAW,CAChC,MAAML,EAAO,CACX,MAAAH,EACA,OAAA1D,CACF,EACMiC,EAAI,KAAK,iBAAiB4B,EAAMC,EAAU,CAAE,IAAAjB,CAAI,CAAC,EACnDZ,EAAE,MACJhC,EAAI,KAAK,GAAGgC,CAAC,CAEjB,CACA,GAAIhC,EAAI,OACN,GAAI+B,IAAMiC,EAAW,CACnB,GAAI4D,IAAetJ,EAAY,CAC7B,GAAImC,EAAM,KAAM,CACd,MAAMoI,EAAI,CAAC,GAAGpI,CAAK,EACnBA,EAAQ,IAAI,IAAI,CAAC,GAAGoI,EAAG,GAAG7I,CAAG,CAAC,CAChC,MACES,EAAQ,IAAI,IAAI,CAAC,GAAGT,CAAG,CAAC,EAE1B,KAAKX,GAAQ,EACf,KAAO,CACL,KAAM,CAACK,CAAI,EAAI,KAAK,WAAWM,CAAG,EAClCS,EAAM,IAAIf,CAAI,CAChB,CACAgC,EAAU,EACZ,MACE+B,EAAQsF,EACR9E,EAAY,IAAI,IAAIjE,CAAG,EACvB0B,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACF,MACEA,EAAU,GAEZ,GAAIA,GAAWkG,IAAetJ,EAC5B,KAEJ,CACA,GAAI,CAACoD,GAAWkG,IAAerJ,EAAc,CAC3C,KAAM,CAACyK,CAAS,EAAI,CAAC,GAAGJ,CAAU,EAClC,IAAItH,EAAU,KAAK,UAAUwH,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO1H,GAAS,CACd,IAAI2C,EAAY,IAAI,IAAI,CAAC3C,CAAO,CAAC,EACjC,QAASS,EAAI,EAAGA,EAAI+F,EAAW/F,IAAK,CAClC,KAAM,CAAE,MAAOgH,EAAW,OAAAhJ,CAAO,EAAIkB,EAAOc,CAAC,EACvC/B,EAAM,CAAC,EACb,UAAW6D,KAAYI,EAAW,CAChC,MAAML,EAAO,CACX,MAAAH,EACA,OAAA1D,CACF,EACMiC,EAAI,KAAK,iBAAiB4B,EAAMC,EAAU,CAAE,IAAAjB,CAAI,CAAC,EACnDZ,EAAE,MACJhC,EAAI,KAAK,GAAGgC,CAAC,CAEjB,CACA,GAAIhC,EAAI,OACN,GAAI+B,IAAMiC,EAAW,CACnB,KAAM,CAACtE,CAAI,EAAI,KAAK,WAAWM,CAAG,EAClCS,EAAM,IAAIf,CAAI,EACdgC,EAAU,EACZ,MACE+B,EAAQsF,EACR9E,EAAY,IAAI,IAAIjE,CAAG,EACvB0B,EAAU,OAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFJ,EAAU,KAAK,UAAUwH,EAAa,CACpC,KAAMxH,CACR,CAAC,EACD2C,EAAY,IAAI,IAAI,CAAC3C,CAAO,CAAC,CAC/B,CACF,CACF,KAAO,CACL,KAAM,CAAE,OAAQwH,CAAY,EAAI7H,EAAO+C,CAAS,EAC1C,CAAC,CAAE,GAAGsD,CAAY,EAAIwB,EAC5B,IAAIpH,EACJ,UAAWhC,KAAQkJ,EAAY,CAE7B,GADaf,GAAY,KAAK,aAAaP,EAAc5H,CAAI,EACnD,CACR,IAAIuE,EAAY,IAAI,IAAI,CAACvE,CAAI,CAAC,EAC9B,QAASqC,EAAIiC,EAAY,EAAGjC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO3C,EAAOc,CAAC,EACf/B,EAAM,CAAC,EACb,UAAW6D,KAAYI,EAAW,CAChC,MAAMjC,EAAI,KAAK,iBAAiB4B,EAAMC,EAAU,CAAE,IAAAjB,CAAI,CAAC,EACnDZ,EAAE,MACJhC,EAAI,KAAK,GAAGgC,CAAC,CAEjB,CACA,GAAIhC,EAAI,OACF+B,IAAM,GACRtB,EAAM,IAAIf,CAAI,EACdgC,EAAU,GACNkG,IAAetJ,GACfwJ,EAAY,GAAKrH,EAAM,KAAO,IAChC,KAAKpB,GAAQ,MAGf4E,EAAY,IAAI,IAAIjE,CAAG,EACvB0B,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACF,CACA,GAAIA,GAAWkG,IAAetJ,EAC5B,KAEJ,CACA,GAAI,CAACoD,GAAWkG,IAAerJ,EAAc,CAC3C,KAAM,CAACyK,CAAS,EAAI,CAAC,GAAGJ,CAAU,EAClC,IAAItH,EAAU,KAAK,UAAUwH,EAAa,CACxC,KAAME,CACR,CAAC,EACD,KAAO1H,GAAS,CACd,IAAI2C,EAAY,IAAI,IAAI,CAAC3C,CAAO,CAAC,EACjC,QAASS,EAAIiC,EAAY,EAAGjC,GAAK,EAAGA,IAAK,CACvC,MAAM6B,EAAO3C,EAAOc,CAAC,EACf/B,EAAM,CAAC,EACb,UAAW6D,KAAYI,EAAW,CAChC,MAAMjC,EAAI,KAAK,iBAAiB4B,EAAMC,EAAU,CAAE,IAAAjB,CAAI,CAAC,EACnDZ,EAAE,MACJhC,EAAI,KAAK,GAAGgC,CAAC,CAEjB,CACA,GAAIhC,EAAI,OACF+B,IAAM,GACRtB,EAAM,IAAIa,CAAO,EACjBI,EAAU,KAEVuC,EAAY,IAAI,IAAIjE,CAAG,EACvB0B,EAAU,QAEP,CACLA,EAAU,GACV,KACF,CACF,CACA,GAAIA,EACF,MAEFJ,EAAU,KAAK,UAAUwH,EAAa,CACpC,KAAMxH,CACR,CAAC,EACD2C,EAAY,IAAI,IAAI,CAAC3C,CAAO,CAAC,CAC/B,CACF,CACF,CACF,CACF,CACA,OAAOb,CACT,CAUA,MAAMmH,EAAYlI,EAAMc,EAAUkC,EAAM,CAAC,EAAG,CAC1C,KAAM,CAAE,KAAAuG,CAAK,EAAIvG,EAEjB,GADA,KAAKnD,GAAQ,CAAC,CAAC0J,EACVvJ,GAKE,GAAIA,EAAK,WAAa,iBAClBA,EAAK,WAAa,0BAClBA,EAAK,WAAa,eAAc,CACzC,MAAMI,EAAM,mBAAmBJ,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUI,CAAG,CACzB,UAAY8H,IAAenJ,GAAemJ,IAAepJ,IAC9CkB,EAAK,WAAa,eAAc,CACzC,MAAMI,EAAM,mBAAmBJ,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUI,CAAG,CACzB,MAdW,CAGT,MAAMA,EAAM,mBADV,OAAO,UAAU,SAAS,KAAKJ,CAAI,EAAE,MAAM,YAAW,SAAO,CACxB,GACvC,MAAM,IAAI,UAAUI,CAAG,CACzB,CAUA,YAAKd,GAAQU,EACb,CAAC,KAAKF,GAAS,KAAKV,GAAW,KAAKI,EAAK,EAAI,KAAK,OAAOQ,CAAI,EAC7D,KAAKN,MAAU,kBAAeM,CAAI,EAClC,KAAKP,GAAYqB,EACjB,CAAC,KAAK7B,GAAM,KAAKM,EAAM,EAAI,KAAK,YAAYuB,CAAQ,GAChDoH,IAAetJ,GAAcsJ,IAAerJ,KAC9C,KAAKe,GAAQ,KAAKR,GAAU,iBAAiB,KAAKI,GAAOR,CAAa,EACtE,KAAKK,GAAU,KAAKD,GAAU,iBAAiB,KAAKE,GAAO,cAAY,EACvE,KAAKK,GAAQ,IAEf,KAAK,cAAcuI,CAAU,EACf,KAAK,YAAYA,CAAU,CAE3C,CASA,QAAQlI,EAAMc,EAAUkC,EAAK,CAC3B,IAAInC,EACJ,GAAI,CACF,MAAME,EAAQ,KAAK,MAAMhC,EAAaiB,EAAMc,EAAUkC,CAAG,EACrDjC,EAAM,OACRF,EAAME,EAAM,IAAI,KAAKzB,EAAK,EAE9B,OAASS,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,MAAO,CAAC,CAACc,CACX,CASA,QAAQb,EAAMc,EAAUkC,EAAK,CAC3B,IAAInC,EACJ,GAAI,CACF,MAAME,EAAQ,KAAK,MAAMjC,EAAekB,EAAMc,EAAUkC,CAAG,EAC3D,IAAIpB,EAAU,KAAKtC,GACnB,KAAOsC,GAAS,CACd,GAAIb,EAAM,IAAIa,CAAO,EAAG,CACtBf,EAAMe,EACN,KACF,CACAA,EAAUA,EAAQ,UACpB,CACF,OAAS7B,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAOc,GAAO,IAChB,CASA,cAAcb,EAAMc,EAAUkC,EAAK,CACjC,IAAInC,EACJ,GAAI,CACF,MAAME,EAAQ,KAAK,MAAMlC,EAAcmB,EAAMc,EAAUkC,CAAG,EAC1DjC,EAAM,OAAO,KAAKzB,EAAK,EACnByB,EAAM,OACR,CAACF,CAAG,EAAI,KAAK,WAAWE,CAAK,EAEjC,OAAShB,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAOc,GAAO,IAChB,CAUA,iBAAiBb,EAAMc,EAAUkC,EAAK,CACpC,IAAInC,EACJ,GAAI,CACF,MAAME,EAAQ,KAAK,MAAMnC,EAAYoB,EAAMc,EAAUkC,CAAG,EACxDjC,EAAM,OAAO,KAAKzB,EAAK,EACnByB,EAAM,OACJ,KAAKpB,GACPkB,EAAM,KAAK,WAAWE,CAAK,EAE3BF,EAAM,CAAC,GAAGE,CAAK,EAGrB,OAAShB,EAAG,CACV,KAAK,SAASA,CAAC,CACjB,CACA,OAAOc,GAAO,CAAC,CACjB,CACF",
-  "names": ["matcher_exports", "__export", "Matcher", "__toCommonJS", "import_is_potential_custom_element_name", "import_dom_util", "import_parser", "import_constant", "DIR_NEXT", "DIR_PREV", "TARGET_ALL", "TARGET_FIRST", "TARGET_LINEAL", "TARGET_SELF", "WALKER_FILTER", "#ast", "#bit", "#cache", "#document", "#finder", "#node", "#nodes", "#root", "#selector", "#shadow", "#sort", "#tree", "#warn", "#window", "e", "node", "document", "root", "parent", "msg", "leaves", "arr", "a", "b", "typeA", "typeB", "bitA", "bitB", "res", "selector", "nodes", "ast", "cachedItem", "l", "i", "cssAst", "branches", "items", "branch", "item", "nextItem", "walker", "current", "refNode", "anb", "reverse", "parentNode", "matched", "selectorBranches", "selectorNodes", "bool", "nth", "j", "m", "localName", "prefix", "itemLocalName", "itemPrefix", "nthName", "nthIdentName", "identName", "anbMap", "astName", "opt", "forgive", "dir", "langPart", "regExtendedLang", "langMain", "langSub", "langRest", "extendedMain", "extendedSub", "len", "extendedRest", "value", "leaf", "leafType", "combo", "twigLeaves", "itemType", "twig", "nextNode", "astData", "twigBranches", "lastIndex", "nextNodes", "astChildren", "selectors", "css", "leavesSet", "regAnchor", "regFormCtrl", "regFormValidity", "regInteract", "regTypeCheck", "regTypeDate", "regTypeRange", "regTypeText", "href", "origin", "pathname", "attrURL", "hash", "id", "isCustomElementName", "targetNode", "nodeName", "checked", "regTypeReset", "regTypeSubmit", "form", "isMultiple", "defaultOpt", "inputType", "node1", "node2", "astFlags", "astMatcher", "astValue", "attributes", "caseInsensitive", "astAttrName", "attrValues", "astAttrPrefix", "astAttrLocalName", "itemName", "itemValue", "itemNamePrefix", "itemNameLocalName", "astAttrIdentValue", "astAttrStringValue", "attrValue", "astPrefix", "astNodeName", "nodePrefix", "host", "astType", "baseNode", "filterLeaves", "leafName", "compound", "pending", "comboName", "matchedNode", "targetType", "filtered", "branchLen", "complex", "firstTwig", "firstCombo", "firstName", "firstType", "lastTwig", "lastName", "lastType", "sibling", "pendingItems", "pendingItem", "index", "find", "entryNodes", "n", "entryLeaves", "nextCombo", "entryNode", "warn"]
+  "sourcesContent": ["/**\n * matcher.js\n * NOTE: Pseudo-class selector matching is done within `./finder.js`.\n *       Functions that begin with `_` are not intended for general use,\n *       and are exported for testing purposes only.\n */\n\n/* import */\nimport { isNamespaceDeclared } from './dom-util.js';\nimport { generateCSS, parseAstName, unescapeSelector } from './parser.js';\n\n/* constants */\nimport {\n  ELEMENT_NODE, NOT_SUPPORTED_ERR, SELECTOR_ATTR, SELECTOR_CLASS, SELECTOR_ID,\n  SELECTOR_TYPE, SYNTAX_ERR, TYPE_FROM, TYPE_TO\n} from './constant.js';\n\n/**\n * match attribute selector\n * @private\n * @param {object} ast - AST\n * @param {object} node - Element node or structured clone\n * @returns {?object} - matched node\n */\nexport const _matchAttributeSelector = (ast, node) => {\n  const {\n    flags: astFlags, matcher: astMatcher, name: astName, value: astValue\n  } = ast;\n  if (typeof astFlags === 'string' && !/^[is]$/i.test(astFlags)) {\n    const css = generateCSS(ast);\n    const msg = `Invalid selector ${css}`;\n    throw new DOMException(msg, SYNTAX_ERR);\n  }\n  const { attributes } = node;\n  let res;\n  if (attributes && attributes.length) {\n    const contentType = node.ownerDocument.contentType;\n    let caseInsensitive;\n    if (contentType === 'text/html') {\n      if (typeof astFlags === 'string' && /^s$/i.test(astFlags)) {\n        caseInsensitive = false;\n      } else {\n        caseInsensitive = true;\n      }\n    } else if (typeof astFlags === 'string' && /^i$/i.test(astFlags)) {\n      caseInsensitive = true;\n    } else {\n      caseInsensitive = false;\n    }\n    let astAttrName = unescapeSelector(astName.name);\n    if (caseInsensitive) {\n      astAttrName = astAttrName.toLowerCase();\n    }\n    const attrValues = new Set();\n    // namespaced\n    if (astAttrName.indexOf('|') > -1) {\n      const {\n        prefix: astPrefix, localName: astLocalName\n      } = parseAstName(astAttrName);\n      for (const item of attributes) {\n        let { name: itemName, value: itemValue } = item;\n        if (caseInsensitive) {\n          itemName = itemName.toLowerCase();\n          itemValue = itemValue.toLowerCase();\n        }\n        switch (astPrefix) {\n          case '': {\n            if (astLocalName === itemName) {\n              attrValues.add(itemValue);\n            }\n            break;\n          }\n          case '*': {\n            if (itemName.indexOf(':') > -1) {\n              if (itemName.endsWith(`:${astLocalName}`)) {\n                attrValues.add(itemValue);\n              }\n            } else if (astLocalName === itemName) {\n              attrValues.add(itemValue);\n            }\n            break;\n          }\n          default: {\n            if (itemName.indexOf(':') > -1) {\n              const [itemPrefix, itemLocalName] = itemName.split(':');\n              // ignore xml:lang\n              if (itemPrefix === 'xml' && itemLocalName === 'lang') {\n                continue;\n              } else if (astPrefix === itemPrefix &&\n                         astLocalName === itemLocalName) {\n                const namespaceDeclared = isNamespaceDeclared(itemPrefix, node);\n                if (namespaceDeclared) {\n                  attrValues.add(itemValue);\n                }\n              }\n            }\n          }\n        }\n      }\n    } else {\n      for (let { name: itemName, value: itemValue } of attributes) {\n        if (caseInsensitive) {\n          itemName = itemName.toLowerCase();\n          itemValue = itemValue.toLowerCase();\n        }\n        if (itemName.indexOf(':') > -1) {\n          const [itemPrefix, itemLocalName] = itemName.split(':');\n          // ignore xml:lang\n          if (itemPrefix === 'xml' && itemLocalName === 'lang') {\n            continue;\n          } else if (astAttrName === itemLocalName) {\n            attrValues.add(itemValue);\n          }\n        } else if (astAttrName === itemName) {\n          attrValues.add(itemValue);\n        }\n      }\n    }\n    if (attrValues.size) {\n      const { name: astIdentValue, value: astStringValue } = astValue ?? {};\n      let attrValue;\n      if (astIdentValue) {\n        if (caseInsensitive) {\n          attrValue = astIdentValue.toLowerCase();\n        } else {\n          attrValue = astIdentValue;\n        }\n      } else if (astStringValue) {\n        if (caseInsensitive) {\n          attrValue = astStringValue.toLowerCase();\n        } else {\n          attrValue = astStringValue;\n        }\n      } else if (astStringValue === '') {\n        attrValue = astStringValue;\n      }\n      switch (astMatcher) {\n        case '=': {\n          if (typeof attrValue === 'string' && attrValues.has(attrValue)) {\n            res = node;\n          }\n          break;\n        }\n        case '~=': {\n          if (attrValue && typeof attrValue === 'string') {\n            for (const value of attrValues) {\n              const item = new Set(value.split(/\\s+/));\n              if (item.has(attrValue)) {\n                res = node;\n                break;\n              }\n            }\n          }\n          break;\n        }\n        case '|=': {\n          if (attrValue && typeof attrValue === 'string') {\n            let item;\n            for (const value of attrValues) {\n              if (value === attrValue || value.startsWith(`${attrValue}-`)) {\n                item = value;\n                break;\n              }\n            }\n            if (item) {\n              res = node;\n            }\n          }\n          break;\n        }\n        case '^=': {\n          if (attrValue && typeof attrValue === 'string') {\n            let item;\n            for (const value of attrValues) {\n              if (value.startsWith(`${attrValue}`)) {\n                item = value;\n                break;\n              }\n            }\n            if (item) {\n              res = node;\n            }\n          }\n          break;\n        }\n        case '$=': {\n          if (attrValue && typeof attrValue === 'string') {\n            let item;\n            for (const value of attrValues) {\n              if (value.endsWith(`${attrValue}`)) {\n                item = value;\n                break;\n              }\n            }\n            if (item) {\n              res = node;\n            }\n          }\n          break;\n        }\n        case '*=': {\n          if (attrValue && typeof attrValue === 'string') {\n            let item;\n            for (const value of attrValues) {\n              if (value.includes(`${attrValue}`)) {\n                item = value;\n                break;\n              }\n            }\n            if (item) {\n              res = node;\n            }\n          }\n          break;\n        }\n        case null:\n        default: {\n          res = node;\n        }\n      }\n    }\n  }\n  return res ?? null;\n};\n\n/**\n * match class selector\n * @private\n * @param {object} ast - AST\n * @param {object} node - Element node or structured clone\n * @returns {?object} - matched node\n */\nexport const _matchClassSelector = (ast, node) => {\n  const astName = unescapeSelector(ast.name);\n  const { classList } = node;\n  let res;\n  if (classList.contains(astName)) {\n    res = node;\n  }\n  return res ?? null;\n};\n\n/**\n * match ID selector\n * @private\n * @param {object} ast - AST\n * @param {object} node - Element node or structured clone\n * @returns {?object} - matched node\n */\nexport const _matchIDSelector = (ast, node) => {\n  const astName = unescapeSelector(ast.name);\n  const { id } = node;\n  let res;\n  if (astName === id) {\n    res = node;\n  }\n  return res ?? null;\n};\n\n/**\n * match type selector\n * @private\n * @param {object} ast - AST\n * @param {object} node - Element node or structured clone\n * @param {object} opt - options\n * @param {boolean} [opt.forgive] - forgive undeclared namespace\n * @returns {?object} - matched node\n */\nexport const _matchTypeSelector = (ast, node, opt = {}) => {\n  const astName = unescapeSelector(ast.name);\n  const { localName, namespaceURI, prefix } = node;\n  const { forgive } = opt;\n  let {\n    prefix: astPrefix, localName: astLocalName\n  } = parseAstName(astName, node);\n  const contentType = node.ownerDocument.contentType;\n  if (contentType === 'text/html') {\n    astPrefix = astPrefix.toLowerCase();\n    astLocalName = astLocalName.toLowerCase();\n  }\n  let nodePrefix;\n  let nodeLocalName;\n  // just in case that the namespaced content is parsed as text/html\n  if (localName.indexOf(':') > -1) {\n    [nodePrefix, nodeLocalName] = localName.split(':');\n  } else {\n    nodePrefix = prefix || '';\n    nodeLocalName = localName;\n  }\n  let res;\n  if (astPrefix === '' && nodePrefix === '') {\n    if (namespaceURI === null &&\n        (astLocalName === '*' || astLocalName === nodeLocalName)) {\n      res = node;\n    }\n  } else if (astPrefix === '*') {\n    if (astLocalName === '*' || astLocalName === nodeLocalName) {\n      res = node;\n    }\n  } else if (astPrefix && nodePrefix) {\n    const namespaceDeclared = isNamespaceDeclared(nodePrefix, node);\n    if (astPrefix === nodePrefix) {\n      if (namespaceDeclared) {\n        if (astLocalName === '*' || astLocalName === nodeLocalName) {\n          res = node;\n        }\n      } else if (!forgive) {\n        const msg = `Undeclared namespace ${astPrefix}`;\n        throw new DOMException(msg, SYNTAX_ERR);\n      }\n    }\n  }\n  return res ?? null;\n};\n\n/**\n * match selector\n * @param {object} ast - AST\n * @param {object} node - Element node or structured clone\n * @param {object} opt - options\n * @returns {?object} - matched node\n */\nexport const matchSelector = (ast, node, opt) => {\n  if (!ast || !ast.type) {\n    const nodeType =\n      Object.prototype.toString.call(ast).slice(TYPE_FROM, TYPE_TO);\n    const msg = `Unexpected node ${nodeType}`;\n    throw new TypeError(msg);\n  } else if (!node || !node.nodeType) {\n    const nodeType =\n      Object.prototype.toString.call(node).slice(TYPE_FROM, TYPE_TO);\n    const msg = `Unexpected node ${nodeType}`;\n    throw new TypeError(msg);\n  } else if (node.nodeType !== ELEMENT_NODE) {\n    const msg = `Unexpected node ${node.nodeName}`;\n    throw new TypeError(msg);\n  }\n  let matched;\n  switch (ast.type) {\n    case SELECTOR_ATTR: {\n      matched = _matchAttributeSelector(ast, node);\n      break;\n    }\n    case SELECTOR_CLASS: {\n      matched = _matchClassSelector(ast, node);\n      break;\n    }\n    case SELECTOR_ID: {\n      matched = _matchIDSelector(ast, node);\n      break;\n    }\n    case SELECTOR_TYPE:\n    default: {\n      matched = _matchTypeSelector(ast, node, opt);\n    }\n  }\n  return matched;\n};\n\n/**\n * match pseudo-element selector\n * @param {string} astName - AST name\n * @param {object} opt - options\n * @param {boolean} [opt.forgive] - forgive unknown pseudo-element\n * @param {boolean} [opt.warn] - warn unsupported pseudo-element\n * @throws {DOMException}\n * @returns {void}\n */\nexport const matchPseudoElementSelector = (astName, opt = {}) => {\n  if (!astName || typeof astName !== 'string') {\n    const nodeType =\n      Object.prototype.toString.call(astName).slice(TYPE_FROM, TYPE_TO);\n    const msg = `Unexpected type ${nodeType}`;\n    throw new TypeError(msg);\n  }\n  const { forgive, warn } = opt;\n  switch (astName) {\n    case 'after':\n    case 'backdrop':\n    case 'before':\n    case 'cue':\n    case 'cue-region':\n    case 'first-letter':\n    case 'first-line':\n    case 'file-selector-button':\n    case 'marker':\n    case 'placeholder':\n    case 'selection':\n    case 'target-text': {\n      if (warn) {\n        const msg = `Unsupported pseudo-element ::${astName}`;\n        throw new DOMException(msg, NOT_SUPPORTED_ERR);\n      }\n      break;\n    }\n    case 'part':\n    case 'slotted': {\n      if (warn) {\n        const msg = `Unsupported pseudo-element ::${astName}()`;\n        throw new DOMException(msg, NOT_SUPPORTED_ERR);\n      }\n      break;\n    }\n    default: {\n      if (astName.startsWith('-webkit-')) {\n        if (warn) {\n          const msg = `Unsupported pseudo-element ::${astName}`;\n          throw new DOMException(msg, NOT_SUPPORTED_ERR);\n        }\n      } else if (!forgive) {\n        const msg = `Unknown pseudo-element ::${astName}`;\n        throw new DOMException(msg, SYNTAX_ERR);\n      }\n    }\n  }\n};\n"],
+  "mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,6BAAAE,EAAA,wBAAAC,EAAA,qBAAAC,EAAA,uBAAAC,EAAA,+BAAAC,EAAA,kBAAAC,IAAA,eAAAC,EAAAR,GAQA,IAAAS,EAAoC,yBACpCC,EAA4D,uBAG5DC,EAGO,yBASA,MAAMT,EAA0B,CAACU,EAAKC,IAAS,CACpD,KAAM,CACJ,MAAOC,EAAU,QAASC,EAAY,KAAMC,EAAS,MAAOC,CAC9D,EAAIL,EACJ,GAAI,OAAOE,GAAa,UAAY,CAAC,UAAU,KAAKA,CAAQ,EAAG,CAE7D,MAAMI,EAAM,uBADA,eAAYN,CAAG,CACQ,GACnC,MAAM,IAAI,aAAaM,EAAK,YAAU,CACxC,CACA,KAAM,CAAE,WAAAC,CAAW,EAAIN,EACvB,IAAIO,EACJ,GAAID,GAAcA,EAAW,OAAQ,CACnC,MAAME,EAAcR,EAAK,cAAc,YACvC,IAAIS,EACAD,IAAgB,YACd,OAAOP,GAAa,UAAY,OAAO,KAAKA,CAAQ,EACtDQ,EAAkB,GAElBA,EAAkB,GAEX,OAAOR,GAAa,UAAY,OAAO,KAAKA,CAAQ,EAC7DQ,EAAkB,GAElBA,EAAkB,GAEpB,IAAIC,KAAc,oBAAiBP,EAAQ,IAAI,EAC3CM,IACFC,EAAcA,EAAY,YAAY,GAExC,MAAMC,EAAa,IAAI,IAEvB,GAAID,EAAY,QAAQ,GAAG,EAAI,GAAI,CACjC,KAAM,CACJ,OAAQE,EAAW,UAAWC,CAChC,KAAI,gBAAaH,CAAW,EAC5B,UAAWI,KAAQR,EAAY,CAC7B,GAAI,CAAE,KAAMS,EAAU,MAAOC,CAAU,EAAIF,EAK3C,OAJIL,IACFM,EAAWA,EAAS,YAAY,EAChCC,EAAYA,EAAU,YAAY,GAE5BJ,EAAW,CACjB,IAAK,GAAI,CACHC,IAAiBE,GACnBJ,EAAW,IAAIK,CAAS,EAE1B,KACF,CACA,IAAK,IAAK,CACJD,EAAS,QAAQ,GAAG,EAAI,GACtBA,EAAS,SAAS,IAAIF,CAAY,EAAE,GACtCF,EAAW,IAAIK,CAAS,EAEjBH,IAAiBE,GAC1BJ,EAAW,IAAIK,CAAS,EAE1B,KACF,CACA,QACE,GAAID,EAAS,QAAQ,GAAG,EAAI,GAAI,CAC9B,KAAM,CAACE,EAAYC,CAAa,EAAIH,EAAS,MAAM,GAAG,EAEtD,GAAIE,IAAe,OAASC,IAAkB,OAC5C,SACSN,IAAcK,GACdJ,IAAiBK,MACA,uBAAoBD,EAAYjB,CAAI,GAE5DW,EAAW,IAAIK,CAAS,CAG9B,CAEJ,CACF,CACF,KACE,QAAS,CAAE,KAAMD,EAAU,MAAOC,CAAU,IAAKV,EAK/C,GAJIG,IACFM,EAAWA,EAAS,YAAY,EAChCC,EAAYA,EAAU,YAAY,GAEhCD,EAAS,QAAQ,GAAG,EAAI,GAAI,CAC9B,KAAM,CAACE,EAAYC,CAAa,EAAIH,EAAS,MAAM,GAAG,EAEtD,GAAIE,IAAe,OAASC,IAAkB,OAC5C,SACSR,IAAgBQ,GACzBP,EAAW,IAAIK,CAAS,CAE5B,MAAWN,IAAgBK,GACzBJ,EAAW,IAAIK,CAAS,EAI9B,GAAIL,EAAW,KAAM,CACnB,KAAM,CAAE,KAAMQ,EAAe,MAAOC,CAAe,EAAIhB,GAAY,CAAC,EACpE,IAAIiB,EAgBJ,OAfIF,EACEV,EACFY,EAAYF,EAAc,YAAY,EAEtCE,EAAYF,EAELC,EACLX,EACFY,EAAYD,EAAe,YAAY,EAEvCC,EAAYD,EAELA,IAAmB,KAC5BC,EAAYD,GAENlB,EAAY,CAClB,IAAK,IAAK,CACJ,OAAOmB,GAAc,UAAYV,EAAW,IAAIU,CAAS,IAC3Dd,EAAMP,GAER,KACF,CACA,IAAK,KAAM,CACT,GAAIqB,GAAa,OAAOA,GAAc,UACpC,UAAWC,KAASX,EAElB,GADa,IAAI,IAAIW,EAAM,MAAM,KAAK,CAAC,EAC9B,IAAID,CAAS,EAAG,CACvBd,EAAMP,EACN,KACF,EAGJ,KACF,CACA,IAAK,KAAM,CACT,GAAIqB,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAIP,EACJ,UAAWQ,KAASX,EAClB,GAAIW,IAAUD,GAAaC,EAAM,WAAW,GAAGD,CAAS,GAAG,EAAG,CAC5DP,EAAOQ,EACP,KACF,CAEER,IACFP,EAAMP,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqB,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAIP,EACJ,UAAWQ,KAASX,EAClB,GAAIW,EAAM,WAAW,GAAGD,CAAS,EAAE,EAAG,CACpCP,EAAOQ,EACP,KACF,CAEER,IACFP,EAAMP,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqB,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAIP,EACJ,UAAWQ,KAASX,EAClB,GAAIW,EAAM,SAAS,GAAGD,CAAS,EAAE,EAAG,CAClCP,EAAOQ,EACP,KACF,CAEER,IACFP,EAAMP,EAEV,CACA,KACF,CACA,IAAK,KAAM,CACT,GAAIqB,GAAa,OAAOA,GAAc,SAAU,CAC9C,IAAIP,EACJ,UAAWQ,KAASX,EAClB,GAAIW,EAAM,SAAS,GAAGD,CAAS,EAAE,EAAG,CAClCP,EAAOQ,EACP,KACF,CAEER,IACFP,EAAMP,EAEV,CACA,KACF,CACA,KAAK,KACL,QACEO,EAAMP,CAEV,CACF,CACF,CACA,OAAOO,GAAO,IAChB,EASajB,EAAsB,CAACS,EAAKC,IAAS,CAChD,MAAMG,KAAU,oBAAiBJ,EAAI,IAAI,EACnC,CAAE,UAAAwB,CAAU,EAAIvB,EACtB,IAAIO,EACJ,OAAIgB,EAAU,SAASpB,CAAO,IAC5BI,EAAMP,GAEDO,GAAO,IAChB,EASahB,EAAmB,CAACQ,EAAKC,IAAS,CAC7C,MAAMG,KAAU,oBAAiBJ,EAAI,IAAI,EACnC,CAAE,GAAAyB,CAAG,EAAIxB,EACf,IAAIO,EACJ,OAAIJ,IAAYqB,IACdjB,EAAMP,GAEDO,GAAO,IAChB,EAWaf,EAAqB,CAACO,EAAKC,EAAMyB,EAAM,CAAC,IAAM,CACzD,MAAMtB,KAAU,oBAAiBJ,EAAI,IAAI,EACnC,CAAE,UAAA2B,EAAW,aAAAC,EAAc,OAAAC,CAAO,EAAI5B,EACtC,CAAE,QAAA6B,CAAQ,EAAIJ,EACpB,GAAI,CACF,OAAQb,EAAW,UAAWC,CAChC,KAAI,gBAAaV,EAASH,CAAI,EACVA,EAAK,cAAc,cACnB,cAClBY,EAAYA,EAAU,YAAY,EAClCC,EAAeA,EAAa,YAAY,GAE1C,IAAIiB,EACAC,EAEAL,EAAU,QAAQ,GAAG,EAAI,GAC3B,CAACI,EAAYC,CAAa,EAAIL,EAAU,MAAM,GAAG,GAEjDI,EAAaF,GAAU,GACvBG,EAAgBL,GAElB,IAAInB,EACJ,GAAIK,IAAc,IAAMkB,IAAe,GACjCH,IAAiB,OAChBd,IAAiB,KAAOA,IAAiBkB,KAC5CxB,EAAMP,WAECY,IAAc,KACnBC,IAAiB,KAAOA,IAAiBkB,KAC3CxB,EAAMP,WAECY,GAAakB,EAAY,CAClC,MAAME,KAAoB,uBAAoBF,EAAY9B,CAAI,EAC9D,GAAIY,IAAckB,GAChB,GAAIE,GACEnB,IAAiB,KAAOA,IAAiBkB,KAC3CxB,EAAMP,WAEC,CAAC6B,EAAS,CACnB,MAAMxB,EAAM,wBAAwBO,CAAS,GAC7C,MAAM,IAAI,aAAaP,EAAK,YAAU,CACxC,EAEJ,CACA,OAAOE,GAAO,IAChB,EASab,EAAgB,CAACK,EAAKC,EAAMyB,IAAQ,CAC/C,GAAI,CAAC1B,GAAO,CAACA,EAAI,KAAM,CAGrB,MAAMM,EAAM,mBADV,OAAO,UAAU,SAAS,KAAKN,CAAG,EAAE,MAAM,YAAW,SAAO,CACvB,GACvC,MAAM,IAAI,UAAUM,CAAG,CACzB,SAAW,CAACL,GAAQ,CAACA,EAAK,SAAU,CAGlC,MAAMK,EAAM,mBADV,OAAO,UAAU,SAAS,KAAKL,CAAI,EAAE,MAAM,YAAW,SAAO,CACxB,GACvC,MAAM,IAAI,UAAUK,CAAG,CACzB,SAAWL,EAAK,WAAa,eAAc,CACzC,MAAMK,EAAM,mBAAmBL,EAAK,QAAQ,GAC5C,MAAM,IAAI,UAAUK,CAAG,CACzB,CACA,IAAI4B,EACJ,OAAQlC,EAAI,KAAM,CAChB,KAAK,gBAAe,CAClBkC,EAAU5C,EAAwBU,EAAKC,CAAI,EAC3C,KACF,CACA,KAAK,iBAAgB,CACnBiC,EAAU3C,EAAoBS,EAAKC,CAAI,EACvC,KACF,CACA,KAAK,cAAa,CAChBiC,EAAU1C,EAAiBQ,EAAKC,CAAI,EACpC,KACF,CACA,KAAK,gBACL,QACEiC,EAAUzC,EAAmBO,EAAKC,EAAMyB,CAAG,CAE/C,CACA,OAAOQ,CACT,EAWaxC,EAA6B,CAACU,EAASsB,EAAM,CAAC,IAAM,CAC/D,GAAI,CAACtB,GAAW,OAAOA,GAAY,SAAU,CAG3C,MAAME,EAAM,mBADV,OAAO,UAAU,SAAS,KAAKF,CAAO,EAAE,MAAM,YAAW,SAAO,CAC3B,GACvC,MAAM,IAAI,UAAUE,CAAG,CACzB,CACA,KAAM,CAAE,QAAAwB,EAAS,KAAAK,CAAK,EAAIT,EAC1B,OAAQtB,EAAS,CACf,IAAK,QACL,IAAK,WACL,IAAK,SACL,IAAK,MACL,IAAK,aACL,IAAK,eACL,IAAK,aACL,IAAK,uBACL,IAAK,SACL,IAAK,cACL,IAAK,YACL,IAAK,cAAe,CAClB,GAAI+B,EAAM,CACR,MAAM7B,EAAM,gCAAgCF,CAAO,GACnD,MAAM,IAAI,aAAaE,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,IAAK,OACL,IAAK,UAAW,CACd,GAAI6B,EAAM,CACR,MAAM7B,EAAM,gCAAgCF,CAAO,KACnD,MAAM,IAAI,aAAaE,EAAK,mBAAiB,CAC/C,CACA,KACF,CACA,QACE,GAAIF,EAAQ,WAAW,UAAU,GAC/B,GAAI+B,EAAM,CACR,MAAM7B,EAAM,gCAAgCF,CAAO,GACnD,MAAM,IAAI,aAAaE,EAAK,mBAAiB,CAC/C,UACS,CAACwB,EAAS,CACnB,MAAMxB,EAAM,4BAA4BF,CAAO,GAC/C,MAAM,IAAI,aAAaE,EAAK,YAAU,CACxC,CAEJ,CACF",
+  "names": ["matcher_exports", "__export", "_matchAttributeSelector", "_matchClassSelector", "_matchIDSelector", "_matchTypeSelector", "matchPseudoElementSelector", "matchSelector", "__toCommonJS", "import_dom_util", "import_parser", "import_constant", "ast", "node", "astFlags", "astMatcher", "astName", "astValue", "msg", "attributes", "res", "contentType", "caseInsensitive", "astAttrName", "attrValues", "astPrefix", "astLocalName", "item", "itemName", "itemValue", "itemPrefix", "itemLocalName", "astIdentValue", "astStringValue", "attrValue", "value", "classList", "id", "opt", "localName", "namespaceURI", "prefix", "forgive", "nodePrefix", "nodeLocalName", "namespaceDeclared", "matched", "warn"]
 }

package/dist/cjs/js/parser.js

@@ -1,3 +1,3 @@
-var E=Object.defineProperty;var m=Object.getOwnPropertyDescriptor;var O=Object.getOwnPropertyNames;var x=Object.prototype.hasOwnProperty;var y=(s,e)=>{for(var r in e)E(s,r,{get:e[r],enumerable:!0})},w=(s,e,r,i)=>{if(e&&typeof e=="object"||typeof e=="function")for(let n of O(e))!x.call(s,n)&&n!==r&&E(s,n,{get:()=>e[n],enumerable:!(i=m(e,n))||i.enumerable});return s};var $=s=>w(E({},"__esModule",{value:!0}),s);var P={};y(P,{generateCSS:()=>S.generate,parseSelector:()=>d,preprocess:()=>u,unescapeSelector:()=>D,walkAST:()=>_});module.exports=$(P);var g=require("css-tree"),t=require("./constant.js"),S=require("css-tree");const D=(s="")=>{if(typeof s=="string"&&s.indexOf("\\",0)>=0){const e=s.split("\\"),r=e.length;for(let i=1;i<r;i++){let n=e[i];if(n===""&&i===r-1)n=t.U_FFFD;else{const a=/^([\da-f]{1,6}\s?)/i.exec(n);if(a){const[,o]=a;let l;try{const c=parseInt("D800",t.HEX),p=parseInt("DFFF",t.HEX),h=parseInt(o,t.HEX);h===0||h>=c&&h<=p?l=t.U_FFFD:l=String.fromCodePoint(h)}catch{l=t.U_FFFD}let f="";n.length>o.length&&(f=n.substring(o.length)),n=`${l}${f}`}else/^[\n\r\f]/.test(n)&&(n="\\"+n)}e[i]=n}s=e.join("")}return s},u=(...s)=>{if(!s.length)throw new TypeError("1 argument required, but only 0 present.");let[e]=s;if(typeof e=="string"){let r=0;for(;r>=0&&(r=e.indexOf("#",r),!(r<0));){const i=e.substring(0,r+1);let n=e.substring(r+1);const a=n.codePointAt(0);if(a===t.BIT_HYPHEN){if(/^\d$/.test(n.substring(1,2)))throw new DOMException(`Invalid selector ${e}`,t.SYNTAX_ERR)}else if(a>t.MAX_BIT_16){const o=`\\${a.toString(t.HEX)} `;n.length===t.DUO?n=o:n=`${o}${n.substring(t.DUO)}`}e=`${i}${n}`,r++}e=e.replace(/\f|\r\n?/g,`
-`).replace(/[\0\uD800-\uDFFF]|\\$/g,t.U_FFFD)}else if(e==null)e=Object.prototype.toString.call(e).slice(t.TYPE_FROM,t.TYPE_TO).toLowerCase();else if(Array.isArray(e))e=e.join(",");else if(Object.prototype.hasOwnProperty.call(e,"toString"))e=e.toString();else throw new DOMException(`Invalid selector ${e}`,t.SYNTAX_ERR);return e},d=s=>{if(s=u(s),/^$|^\s*>|,\s*$/.test(s))throw new DOMException(`Invalid selector ${s}`,t.SYNTAX_ERR);let e;try{const r=(0,g.parse)(s,{context:"selectorList",parseCustomProperty:!0});e=(0,g.toPlainObject)(r)}catch(r){const i=/(:lang\(\s*("[A-Za-z\d\-*]+")\s*\))/;if(r.message==="Identifier is expected"&&i.test(s)){const[,n,a]=i.exec(s),o=a.replaceAll("*","\\*").replace(/^"/,"").replace(/"$/,""),l=n.replace(a,o);e=d(s.replace(n,l))}else if(r.message==='"]" is expected'&&!s.endsWith("]"))e=d(`${s}]`);else if(r.message==='")" is expected'&&!s.endsWith(")"))e=d(`${s})`);else throw new DOMException(r.message,t.SYNTAX_ERR)}return e},_=(s={})=>{const e=new Set;let r;return(0,g.walk)(s,{enter:n=>{n.type===t.SELECTOR?e.add(n.children):(n.type===t.SELECTOR_PSEUDO_CLASS&&t.REG_LOGICAL_PSEUDO.test(n.name)||n.type===t.SELECTOR_PSEUDO_ELEMENT&&t.REG_SHADOW_PSEUDO.test(n.name))&&(r=!0)}}),r&&(0,g.findAll)(s,(n,a,o)=>{if(o){if(n.type===t.SELECTOR_PSEUDO_CLASS&&t.REG_LOGICAL_PSEUDO.test(n.name)){const l=o.filter(f=>{const{name:c,type:p}=f;return p===t.SELECTOR_PSEUDO_CLASS&&t.REG_LOGICAL_PSEUDO.test(c)});for(const{children:f}of l)for(const{children:c}of f)for(const{children:p}of c)e.has(p)&&e.delete(p)}else if(n.type===t.SELECTOR_PSEUDO_ELEMENT&&t.REG_SHADOW_PSEUDO.test(n.name)){const l=o.filter(f=>{const{name:c,type:p}=f;return p===t.SELECTOR_PSEUDO_ELEMENT&&t.REG_SHADOW_PSEUDO.test(c)});for(const{children:f}of l)for(const{children:c}of f)e.has(c)&&e.delete(c)}}}),[...e]};0&&(module.exports={generateCSS,parseSelector,preprocess,unescapeSelector,walkAST});
+var E=Object.defineProperty;var u=Object.getOwnPropertyDescriptor;var x=Object.getOwnPropertyNames;var T=Object.prototype.hasOwnProperty;var m=(n,t)=>{for(var r in t)E(n,r,{get:t[r],enumerable:!0})},y=(n,t,r,i)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of x(t))!T.call(n,s)&&s!==r&&E(n,s,{get:()=>t[s],enumerable:!(i=u(t,s))||i.enumerable});return n};var _=n=>y(E({},"__esModule",{value:!0}),n);var A={};m(A,{generateCSS:()=>O.generate,parseAstName:()=>$,parseSelector:()=>d,preprocess:()=>S,sortAST:()=>L,unescapeSelector:()=>w,walkAST:()=>I});module.exports=_(A);var g=require("css-tree"),e=require("./constant.js"),O=require("css-tree");const w=(n="")=>{if(typeof n=="string"&&n.indexOf("\\",0)>=0){const t=n.split("\\"),r=t.length;for(let i=1;i<r;i++){let s=t[i];if(s===""&&i===r-1)s=e.U_FFFD;else{const p=/^([\da-f]{1,6}\s?)/i.exec(s);if(p){const[,c]=p;let a;try{const o=parseInt("D800",e.HEX),f=parseInt("DFFF",e.HEX),h=parseInt(c,e.HEX);h===0||h>=o&&h<=f?a=e.U_FFFD:a=String.fromCodePoint(h)}catch{a=e.U_FFFD}let l="";s.length>c.length&&(l=s.substring(c.length)),s=`${a}${l}`}else/^[\n\r\f]/.test(s)&&(s="\\"+s)}t[i]=s}n=t.join("")}return n},S=(...n)=>{if(!n.length)throw new TypeError("1 argument required, but only 0 present.");let[t]=n;if(typeof t=="string"){let r=0;for(;r>=0&&(r=t.indexOf("#",r),!(r<0));){const i=t.substring(0,r+1);let s=t.substring(r+1);const p=s.codePointAt(0);if(p===e.BIT_HYPHEN){if(/^\d$/.test(s.substring(1,2)))throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR)}else if(p>e.BIT_FFFF){const c=`\\${p.toString(e.HEX)} `;s.length===e.DUO?s=c:s=`${c}${s.substring(e.DUO)}`}t=`${i}${s}`,r++}t=t.replace(/\f|\r\n?/g,`
+`).replace(/[\0\uD800-\uDFFF]|\\$/g,e.U_FFFD)}else if(t==null)t=Object.prototype.toString.call(t).slice(e.TYPE_FROM,e.TYPE_TO).toLowerCase();else if(Array.isArray(t))t=t.join(",");else if(Object.prototype.hasOwnProperty.call(t,"toString"))t=t.toString();else throw new DOMException(`Invalid selector ${t}`,e.SYNTAX_ERR);return t},d=n=>{if(n=S(n),/^$|^\s*>|,\s*$/.test(n))throw new DOMException(`Invalid selector ${n}`,e.SYNTAX_ERR);let t;try{const r=(0,g.parse)(n,{context:"selectorList",parseCustomProperty:!0});t=(0,g.toPlainObject)(r)}catch(r){const i=/(:lang\(\s*("[A-Za-z\d\-*]+")\s*\))/;if(r.message==="Identifier is expected"&&i.test(n)){const[,s,p]=i.exec(n),c=p.replaceAll("*","\\*").replace(/^"/,"").replace(/"$/,""),a=s.replace(p,c);t=d(n.replace(s,a))}else if(r.message==='"]" is expected'&&!n.endsWith("]"))t=d(`${n}]`);else if(r.message==='")" is expected'&&!n.endsWith(")"))t=d(`${n})`);else throw new DOMException(r.message,e.SYNTAX_ERR)}return t},I=(n={})=>{const t=new Set;let r;return(0,g.walk)(n,{enter:s=>{s.type===e.SELECTOR?t.add(s.children):(s.type===e.SELECTOR_PSEUDO_CLASS&&e.REG_LOGICAL_PSEUDO.test(s.name)||s.type===e.SELECTOR_PSEUDO_ELEMENT&&e.REG_SHADOW_PSEUDO.test(s.name))&&(r=!0)}}),r&&(0,g.findAll)(n,(s,p,c)=>{if(c){if(s.type===e.SELECTOR_PSEUDO_CLASS&&e.REG_LOGICAL_PSEUDO.test(s.name)){const a=c.filter(l=>{const{name:o,type:f}=l;return f===e.SELECTOR_PSEUDO_CLASS&&e.REG_LOGICAL_PSEUDO.test(o)});for(const{children:l}of a)for(const{children:o}of l)for(const{children:f}of o)t.has(f)&&t.delete(f)}else if(s.type===e.SELECTOR_PSEUDO_ELEMENT&&e.REG_SHADOW_PSEUDO.test(s.name)){const a=c.filter(l=>{const{name:o,type:f}=l;return f===e.SELECTOR_PSEUDO_ELEMENT&&e.REG_SHADOW_PSEUDO.test(o)});for(const{children:l}of a)for(const{children:o}of l)t.has(o)&&t.delete(o)}}}),[...t]},L=n=>{const t=[...n];if(t.length>1){const r=new Map([[e.SELECTOR_PSEUDO_ELEMENT,e.BIT_01],[e.SELECTOR_ID,e.BIT_02],[e.SELECTOR_CLASS,e.BIT_04],[e.SELECTOR_TYPE,e.BIT_08],[e.SELECTOR_ATTR,e.BIT_16],[e.SELECTOR_PSEUDO_CLASS,e.BIT_32]]);t.sort((i,s)=>{const{type:p}=i,{type:c}=s,a=r.get(p),l=r.get(c);let o;return a===l?o=0:a>l?o=1:o=-1,o})}return t},$=n=>{let t,r;if(n&&typeof n=="string")n.indexOf("|")>-1?[t,r]=n.split("|"):(t="*",r=n);else throw new DOMException(`Invalid selector ${n}`,e.SYNTAX_ERR);return{prefix:t,localName:r}};0&&(module.exports={generateCSS,parseAstName,parseSelector,preprocess,sortAST,unescapeSelector,walkAST});
 //# sourceMappingURL=parser.js.map

package/dist/cjs/js/parser.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/js/parser.js"],
-  "sourcesContent": ["/**\n * parser.js\n */\n\n/* import */\nimport { findAll, parse, toPlainObject, walk } from 'css-tree';\n\n/* constants */\nimport {\n  DUO, HEX, MAX_BIT_16, BIT_HYPHEN, REG_LOGICAL_PSEUDO, REG_SHADOW_PSEUDO,\n  SELECTOR, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT, SYNTAX_ERR,\n  TYPE_FROM, TYPE_TO, U_FFFD\n} from './constant.js';\n\n/**\n * unescape selector\n * @param {string} selector - CSS selector\n * @returns {?string} - unescaped selector\n */\nexport const unescapeSelector = (selector = '') => {\n  if (typeof selector === 'string' && selector.indexOf('\\\\', 0) >= 0) {\n    const arr = selector.split('\\\\');\n    const l = arr.length;\n    for (let i = 1; i < l; i++) {\n      let item = arr[i];\n      if (item === '' && i === l - 1) {\n        item = U_FFFD;\n      } else {\n        const hexExists = /^([\\da-f]{1,6}\\s?)/i.exec(item);\n        if (hexExists) {\n          const [, hex] = hexExists;\n          let str;\n          try {\n            const low = parseInt('D800', HEX);\n            const high = parseInt('DFFF', HEX);\n            const deci = parseInt(hex, HEX);\n            if (deci === 0 || (deci >= low && deci <= high)) {\n              str = U_FFFD;\n            } else {\n              str = String.fromCodePoint(deci);\n            }\n          } catch (e) {\n            str = U_FFFD;\n          }\n          let postStr = '';\n          if (item.length > hex.length) {\n            postStr = item.substring(hex.length);\n          }\n          item = `${str}${postStr}`;\n        // whitespace\n        } else if (/^[\\n\\r\\f]/.test(item)) {\n          item = '\\\\' + item;\n        }\n      }\n      arr[i] = item;\n    }\n    selector = arr.join('');\n  }\n  return selector;\n};\n\n/**\n * preprocess\n * @see https://drafts.csswg.org/css-syntax-3/#input-preprocessing\n * @param {...*} args - arguments\n * @returns {string} - filtered selector string\n */\nexport const preprocess = (...args) => {\n  if (!args.length) {\n    throw new TypeError('1 argument required, but only 0 present.');\n  }\n  let [selector] = args;\n  if (typeof selector === 'string') {\n    let index = 0;\n    while (index >= 0) {\n      index = selector.indexOf('#', index);\n      if (index < 0) {\n        break;\n      }\n      const preHash = selector.substring(0, index + 1);\n      let postHash = selector.substring(index + 1);\n      const codePoint = postHash.codePointAt(0);\n      // @see https://drafts.csswg.org/selectors/#id-selectors\n      // @see https://drafts.csswg.org/css-syntax-3/#ident-token-diagram\n      if (codePoint === BIT_HYPHEN) {\n        if (/^\\d$/.test(postHash.substring(1, 2))) {\n          throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n        }\n      // escape char above 0xFFFF\n      } else if (codePoint > MAX_BIT_16) {\n        const str = `\\\\${codePoint.toString(HEX)} `;\n        if (postHash.length === DUO) {\n          postHash = str;\n        } else {\n          postHash = `${str}${postHash.substring(DUO)}`;\n        }\n      }\n      selector = `${preHash}${postHash}`;\n      index++;\n    }\n    selector = selector.replace(/\\f|\\r\\n?/g, '\\n')\n      .replace(/[\\0\\uD800-\\uDFFF]|\\\\$/g, U_FFFD);\n  } else if (selector === undefined || selector === null) {\n    selector = Object.prototype.toString.call(selector)\n      .slice(TYPE_FROM, TYPE_TO).toLowerCase();\n  } else if (Array.isArray(selector)) {\n    selector = selector.join(',');\n  } else if (Object.prototype.hasOwnProperty.call(selector, 'toString')) {\n    selector = selector.toString();\n  } else {\n    throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n  }\n  return selector;\n};\n\n/**\n * create AST from CSS selector\n * @param {string} selector - CSS selector\n * @returns {object} - AST\n */\nexport const parseSelector = selector => {\n  selector = preprocess(selector);\n  // invalid selectors\n  if (/^$|^\\s*>|,\\s*$/.test(selector)) {\n    throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n  }\n  let res;\n  try {\n    const ast = parse(selector, {\n      context: 'selectorList',\n      parseCustomProperty: true\n    });\n    res = toPlainObject(ast);\n  } catch (e) {\n    // workaround for https://github.com/csstree/csstree/issues/265\n    // NOTE: still throws on `:lang(\"\")`;\n    const regLang = /(:lang\\(\\s*(\"[A-Za-z\\d\\-*]+\")\\s*\\))/;\n    if (e.message === 'Identifier is expected' && regLang.test(selector)) {\n      const [, lang, range] = regLang.exec(selector);\n      const escapedRange =\n        range.replaceAll('*', '\\\\*').replace(/^\"/, '').replace(/\"$/, '');\n      const escapedLang = lang.replace(range, escapedRange);\n      res = parseSelector(selector.replace(lang, escapedLang));\n    } else if (e.message === '\"]\" is expected' && !selector.endsWith(']')) {\n      res = parseSelector(`${selector}]`);\n    } else if (e.message === '\")\" is expected' && !selector.endsWith(')')) {\n      res = parseSelector(`${selector})`);\n    } else {\n      throw new DOMException(e.message, SYNTAX_ERR);\n    }\n  }\n  return res;\n};\n\n/**\n * walk AST\n * @param {object} ast - AST\n * @returns {Array.<object|undefined>} - collection of AST branches\n */\nexport const walkAST = (ast = {}) => {\n  const branches = new Set();\n  let hasPseudoFunc;\n  const opt = {\n    enter: node => {\n      if (node.type === SELECTOR) {\n        branches.add(node.children);\n      } else if ((node.type === SELECTOR_PSEUDO_CLASS &&\n                  REG_LOGICAL_PSEUDO.test(node.name)) ||\n                 (node.type === SELECTOR_PSEUDO_ELEMENT &&\n                  REG_SHADOW_PSEUDO.test(node.name))) {\n        hasPseudoFunc = true;\n      }\n    }\n  };\n  walk(ast, opt);\n  if (hasPseudoFunc) {\n    findAll(ast, (node, item, list) => {\n      if (list) {\n        if (node.type === SELECTOR_PSEUDO_CLASS &&\n            REG_LOGICAL_PSEUDO.test(node.name)) {\n          const itemList = list.filter(i => {\n            const { name, type } = i;\n            const res =\n              type === SELECTOR_PSEUDO_CLASS && REG_LOGICAL_PSEUDO.test(name);\n            return res;\n          });\n          for (const { children } of itemList) {\n            // SelectorList\n            for (const { children: grandChildren } of children) {\n              // Selector\n              for (const { children: greatGrandChildren } of grandChildren) {\n                if (branches.has(greatGrandChildren)) {\n                  branches.delete(greatGrandChildren);\n                }\n              }\n            }\n          }\n        } else if (node.type === SELECTOR_PSEUDO_ELEMENT &&\n                   REG_SHADOW_PSEUDO.test(node.name)) {\n          const itemList = list.filter(i => {\n            const { name, type } = i;\n            const res =\n              type === SELECTOR_PSEUDO_ELEMENT && REG_SHADOW_PSEUDO.test(name);\n            return res;\n          });\n          for (const { children } of itemList) {\n            // Selector\n            for (const { children: grandChildren } of children) {\n              if (branches.has(grandChildren)) {\n                branches.delete(grandChildren);\n              }\n            }\n          }\n        }\n      }\n    });\n  }\n  return [...branches];\n};\n\n/* export */\nexport { generate as generateCSS } from 'css-tree';\n"],
-  "mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,8CAAAE,EAAA,eAAAC,EAAA,qBAAAC,EAAA,YAAAC,IAAA,eAAAC,EAAAN,GAKA,IAAAO,EAAoD,oBAGpDC,EAIO,yBAiNPD,EAAwC,oBA1MjC,MAAMH,EAAmB,CAACK,EAAW,KAAO,CACjD,GAAI,OAAOA,GAAa,UAAYA,EAAS,QAAQ,KAAM,CAAC,GAAK,EAAG,CAClE,MAAMC,EAAMD,EAAS,MAAM,IAAI,EACzBE,EAAID,EAAI,OACd,QAAS,EAAI,EAAG,EAAIC,EAAG,IAAK,CAC1B,IAAIC,EAAOF,EAAI,CAAC,EAChB,GAAIE,IAAS,IAAM,IAAMD,EAAI,EAC3BC,EAAO,aACF,CACL,MAAMC,EAAY,sBAAsB,KAAKD,CAAI,EACjD,GAAIC,EAAW,CACb,KAAM,CAAC,CAAEC,CAAG,EAAID,EAChB,IAAIE,EACJ,GAAI,CACF,MAAMC,EAAM,SAAS,OAAQ,KAAG,EAC1BC,EAAO,SAAS,OAAQ,KAAG,EAC3BC,EAAO,SAASJ,EAAK,KAAG,EAC1BI,IAAS,GAAMA,GAAQF,GAAOE,GAAQD,EACxCF,EAAM,SAENA,EAAM,OAAO,cAAcG,CAAI,CAEnC,MAAY,CACVH,EAAM,QACR,CACA,IAAII,EAAU,GACVP,EAAK,OAASE,EAAI,SACpBK,EAAUP,EAAK,UAAUE,EAAI,MAAM,GAErCF,EAAO,GAAGG,CAAG,GAAGI,CAAO,EAEzB,KAAW,YAAY,KAAKP,CAAI,IAC9BA,EAAO,KAAOA,EAElB,CACAF,EAAI,CAAC,EAAIE,CACX,CACAH,EAAWC,EAAI,KAAK,EAAE,CACxB,CACA,OAAOD,CACT,EAQaN,EAAa,IAAIiB,IAAS,CACrC,GAAI,CAACA,EAAK,OACR,MAAM,IAAI,UAAU,0CAA0C,EAEhE,GAAI,CAACX,CAAQ,EAAIW,EACjB,GAAI,OAAOX,GAAa,SAAU,CAChC,IAAIY,EAAQ,EACZ,KAAOA,GAAS,IACdA,EAAQZ,EAAS,QAAQ,IAAKY,CAAK,EAC/B,EAAAA,EAAQ,KAFK,CAKjB,MAAMC,EAAUb,EAAS,UAAU,EAAGY,EAAQ,CAAC,EAC/C,IAAIE,EAAWd,EAAS,UAAUY,EAAQ,CAAC,EAC3C,MAAMG,EAAYD,EAAS,YAAY,CAAC,EAGxC,GAAIC,IAAc,cAChB,GAAI,OAAO,KAAKD,EAAS,UAAU,EAAG,CAAC,CAAC,EACtC,MAAM,IAAI,aAAa,oBAAoBd,CAAQ,GAAI,YAAU,UAG1De,EAAY,aAAY,CACjC,MAAMT,EAAM,KAAKS,EAAU,SAAS,KAAG,CAAC,IACpCD,EAAS,SAAW,MACtBA,EAAWR,EAEXQ,EAAW,GAAGR,CAAG,GAAGQ,EAAS,UAAU,KAAG,CAAC,EAE/C,CACAd,EAAW,GAAGa,CAAO,GAAGC,CAAQ,GAChCF,GACF,CACAZ,EAAWA,EAAS,QAAQ,YAAa;AAAA,CAAI,EAC1C,QAAQ,yBAA0B,QAAM,CAC7C,SAAqCA,GAAa,KAChDA,EAAW,OAAO,UAAU,SAAS,KAAKA,CAAQ,EAC/C,MAAM,YAAW,SAAO,EAAE,YAAY,UAChC,MAAM,QAAQA,CAAQ,EAC/BA,EAAWA,EAAS,KAAK,GAAG,UACnB,OAAO,UAAU,eAAe,KAAKA,EAAU,UAAU,EAClEA,EAAWA,EAAS,SAAS,MAE7B,OAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,OAAOA,CACT,EAOaP,EAAgBO,GAAY,CAGvC,GAFAA,EAAWN,EAAWM,CAAQ,EAE1B,iBAAiB,KAAKA,CAAQ,EAChC,MAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,IAAIgB,EACJ,GAAI,CACF,MAAMC,KAAM,SAAMjB,EAAU,CAC1B,QAAS,eACT,oBAAqB,EACvB,CAAC,EACDgB,KAAM,iBAAcC,CAAG,CACzB,OAASC,EAAG,CAGV,MAAMC,EAAU,sCAChB,GAAID,EAAE,UAAY,0BAA4BC,EAAQ,KAAKnB,CAAQ,EAAG,CACpE,KAAM,CAAC,CAAEoB,EAAMC,CAAK,EAAIF,EAAQ,KAAKnB,CAAQ,EACvCsB,EACJD,EAAM,WAAW,IAAK,KAAK,EAAE,QAAQ,KAAM,EAAE,EAAE,QAAQ,KAAM,EAAE,EAC3DE,EAAcH,EAAK,QAAQC,EAAOC,CAAY,EACpDN,EAAMvB,EAAcO,EAAS,QAAQoB,EAAMG,CAAW,CAAC,CACzD,SAAWL,EAAE,UAAY,mBAAqB,CAAClB,EAAS,SAAS,GAAG,EAClEgB,EAAMvB,EAAc,GAAGO,CAAQ,GAAG,UACzBkB,EAAE,UAAY,mBAAqB,CAAClB,EAAS,SAAS,GAAG,EAClEgB,EAAMvB,EAAc,GAAGO,CAAQ,GAAG,MAElC,OAAM,IAAI,aAAakB,EAAE,QAAS,YAAU,CAEhD,CACA,OAAOF,CACT,EAOapB,EAAU,CAACqB,EAAM,CAAC,IAAM,CACnC,MAAMO,EAAW,IAAI,IACrB,IAAIC,EAaJ,iBAAKR,EAZO,CACV,MAAOS,GAAQ,CACTA,EAAK,OAAS,WAChBF,EAAS,IAAIE,EAAK,QAAQ,GAChBA,EAAK,OAAS,yBACd,qBAAmB,KAAKA,EAAK,IAAI,GACjCA,EAAK,OAAS,2BACd,oBAAkB,KAAKA,EAAK,IAAI,KAC1CD,EAAgB,GAEpB,CACF,CACa,EACTA,MACF,WAAQR,EAAK,CAACS,EAAMvB,EAAMwB,IAAS,CACjC,GAAIA,GACF,GAAID,EAAK,OAAS,yBACd,qBAAmB,KAAKA,EAAK,IAAI,EAAG,CACtC,MAAME,EAAWD,EAAK,OAAOE,GAAK,CAChC,KAAM,CAAE,KAAAC,EAAM,KAAAC,CAAK,EAAIF,EAGvB,OADEE,IAAS,yBAAyB,qBAAmB,KAAKD,CAAI,CAElE,CAAC,EACD,SAAW,CAAE,SAAAE,CAAS,IAAKJ,EAEzB,SAAW,CAAE,SAAUK,CAAc,IAAKD,EAExC,SAAW,CAAE,SAAUE,CAAmB,IAAKD,EACzCT,EAAS,IAAIU,CAAkB,GACjCV,EAAS,OAAOU,CAAkB,CAK5C,SAAWR,EAAK,OAAS,2BACd,oBAAkB,KAAKA,EAAK,IAAI,EAAG,CAC5C,MAAME,EAAWD,EAAK,OAAOE,GAAK,CAChC,KAAM,CAAE,KAAAC,EAAM,KAAAC,CAAK,EAAIF,EAGvB,OADEE,IAAS,2BAA2B,oBAAkB,KAAKD,CAAI,CAEnE,CAAC,EACD,SAAW,CAAE,SAAAE,CAAS,IAAKJ,EAEzB,SAAW,CAAE,SAAUK,CAAc,IAAKD,EACpCR,EAAS,IAAIS,CAAa,GAC5BT,EAAS,OAAOS,CAAa,CAIrC,EAEJ,CAAC,EAEI,CAAC,GAAGT,CAAQ,CACrB",
-  "names": ["parser_exports", "__export", "parseSelector", "preprocess", "unescapeSelector", "walkAST", "__toCommonJS", "import_css_tree", "import_constant", "selector", "arr", "l", "item", "hexExists", "hex", "str", "low", "high", "deci", "postStr", "args", "index", "preHash", "postHash", "codePoint", "res", "ast", "e", "regLang", "lang", "range", "escapedRange", "escapedLang", "branches", "hasPseudoFunc", "node", "list", "itemList", "i", "name", "type", "children", "grandChildren", "greatGrandChildren"]
+  "sourcesContent": ["/**\n * parser.js\n */\n\n/* import */\nimport { findAll, parse, toPlainObject, walk } from 'css-tree';\n\n/* constants */\nimport {\n  BIT_01, BIT_02, BIT_04, BIT_08, BIT_16, BIT_32, BIT_FFFF, BIT_HYPHEN,\n  DUO, HEX, REG_LOGICAL_PSEUDO, REG_SHADOW_PSEUDO, SELECTOR, SELECTOR_ATTR,\n  SELECTOR_CLASS, SELECTOR_ID, SELECTOR_PSEUDO_CLASS, SELECTOR_PSEUDO_ELEMENT,\n  SELECTOR_TYPE, SYNTAX_ERR, TYPE_FROM, TYPE_TO, U_FFFD\n} from './constant.js';\n\n/**\n * unescape selector\n * @param {string} selector - CSS selector\n * @returns {?string} - unescaped selector\n */\nexport const unescapeSelector = (selector = '') => {\n  if (typeof selector === 'string' && selector.indexOf('\\\\', 0) >= 0) {\n    const arr = selector.split('\\\\');\n    const l = arr.length;\n    for (let i = 1; i < l; i++) {\n      let item = arr[i];\n      if (item === '' && i === l - 1) {\n        item = U_FFFD;\n      } else {\n        const hexExists = /^([\\da-f]{1,6}\\s?)/i.exec(item);\n        if (hexExists) {\n          const [, hex] = hexExists;\n          let str;\n          try {\n            const low = parseInt('D800', HEX);\n            const high = parseInt('DFFF', HEX);\n            const deci = parseInt(hex, HEX);\n            if (deci === 0 || (deci >= low && deci <= high)) {\n              str = U_FFFD;\n            } else {\n              str = String.fromCodePoint(deci);\n            }\n          } catch (e) {\n            str = U_FFFD;\n          }\n          let postStr = '';\n          if (item.length > hex.length) {\n            postStr = item.substring(hex.length);\n          }\n          item = `${str}${postStr}`;\n        // whitespace\n        } else if (/^[\\n\\r\\f]/.test(item)) {\n          item = '\\\\' + item;\n        }\n      }\n      arr[i] = item;\n    }\n    selector = arr.join('');\n  }\n  return selector;\n};\n\n/**\n * preprocess\n * @see https://drafts.csswg.org/css-syntax-3/#input-preprocessing\n * @param {...*} args - arguments\n * @returns {string} - filtered selector string\n */\nexport const preprocess = (...args) => {\n  if (!args.length) {\n    throw new TypeError('1 argument required, but only 0 present.');\n  }\n  let [selector] = args;\n  if (typeof selector === 'string') {\n    let index = 0;\n    while (index >= 0) {\n      index = selector.indexOf('#', index);\n      if (index < 0) {\n        break;\n      }\n      const preHash = selector.substring(0, index + 1);\n      let postHash = selector.substring(index + 1);\n      const codePoint = postHash.codePointAt(0);\n      // @see https://drafts.csswg.org/selectors/#id-selectors\n      // @see https://drafts.csswg.org/css-syntax-3/#ident-token-diagram\n      if (codePoint === BIT_HYPHEN) {\n        if (/^\\d$/.test(postHash.substring(1, 2))) {\n          throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n        }\n      // escape char above 0xFFFF\n      } else if (codePoint > BIT_FFFF) {\n        const str = `\\\\${codePoint.toString(HEX)} `;\n        if (postHash.length === DUO) {\n          postHash = str;\n        } else {\n          postHash = `${str}${postHash.substring(DUO)}`;\n        }\n      }\n      selector = `${preHash}${postHash}`;\n      index++;\n    }\n    selector = selector.replace(/\\f|\\r\\n?/g, '\\n')\n      .replace(/[\\0\\uD800-\\uDFFF]|\\\\$/g, U_FFFD);\n  } else if (selector === undefined || selector === null) {\n    selector = Object.prototype.toString.call(selector)\n      .slice(TYPE_FROM, TYPE_TO).toLowerCase();\n  } else if (Array.isArray(selector)) {\n    selector = selector.join(',');\n  } else if (Object.prototype.hasOwnProperty.call(selector, 'toString')) {\n    selector = selector.toString();\n  } else {\n    throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n  }\n  return selector;\n};\n\n/**\n * create AST from CSS selector\n * @param {string} selector - CSS selector\n * @returns {object} - AST\n */\nexport const parseSelector = selector => {\n  selector = preprocess(selector);\n  // invalid selectors\n  if (/^$|^\\s*>|,\\s*$/.test(selector)) {\n    throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n  }\n  let res;\n  try {\n    const ast = parse(selector, {\n      context: 'selectorList',\n      parseCustomProperty: true\n    });\n    res = toPlainObject(ast);\n  } catch (e) {\n    // workaround for https://github.com/csstree/csstree/issues/265\n    // NOTE: still throws on `:lang(\"\")`;\n    const regLang = /(:lang\\(\\s*(\"[A-Za-z\\d\\-*]+\")\\s*\\))/;\n    if (e.message === 'Identifier is expected' && regLang.test(selector)) {\n      const [, lang, range] = regLang.exec(selector);\n      const escapedRange =\n        range.replaceAll('*', '\\\\*').replace(/^\"/, '').replace(/\"$/, '');\n      const escapedLang = lang.replace(range, escapedRange);\n      res = parseSelector(selector.replace(lang, escapedLang));\n    } else if (e.message === '\"]\" is expected' && !selector.endsWith(']')) {\n      res = parseSelector(`${selector}]`);\n    } else if (e.message === '\")\" is expected' && !selector.endsWith(')')) {\n      res = parseSelector(`${selector})`);\n    } else {\n      throw new DOMException(e.message, SYNTAX_ERR);\n    }\n  }\n  return res;\n};\n\n/**\n * walk AST\n * @param {object} ast - AST\n * @returns {Array.<object|undefined>} - collection of AST branches\n */\nexport const walkAST = (ast = {}) => {\n  const branches = new Set();\n  let hasPseudoFunc;\n  const opt = {\n    enter: node => {\n      if (node.type === SELECTOR) {\n        branches.add(node.children);\n      } else if ((node.type === SELECTOR_PSEUDO_CLASS &&\n                  REG_LOGICAL_PSEUDO.test(node.name)) ||\n                 (node.type === SELECTOR_PSEUDO_ELEMENT &&\n                  REG_SHADOW_PSEUDO.test(node.name))) {\n        hasPseudoFunc = true;\n      }\n    }\n  };\n  walk(ast, opt);\n  if (hasPseudoFunc) {\n    findAll(ast, (node, item, list) => {\n      if (list) {\n        if (node.type === SELECTOR_PSEUDO_CLASS &&\n            REG_LOGICAL_PSEUDO.test(node.name)) {\n          const itemList = list.filter(i => {\n            const { name, type } = i;\n            const res =\n              type === SELECTOR_PSEUDO_CLASS && REG_LOGICAL_PSEUDO.test(name);\n            return res;\n          });\n          for (const { children } of itemList) {\n            // SelectorList\n            for (const { children: grandChildren } of children) {\n              // Selector\n              for (const { children: greatGrandChildren } of grandChildren) {\n                if (branches.has(greatGrandChildren)) {\n                  branches.delete(greatGrandChildren);\n                }\n              }\n            }\n          }\n        } else if (node.type === SELECTOR_PSEUDO_ELEMENT &&\n                   REG_SHADOW_PSEUDO.test(node.name)) {\n          const itemList = list.filter(i => {\n            const { name, type } = i;\n            const res =\n              type === SELECTOR_PSEUDO_ELEMENT && REG_SHADOW_PSEUDO.test(name);\n            return res;\n          });\n          for (const { children } of itemList) {\n            // Selector\n            for (const { children: grandChildren } of children) {\n              if (branches.has(grandChildren)) {\n                branches.delete(grandChildren);\n              }\n            }\n          }\n        }\n      }\n    });\n  }\n  return [...branches];\n};\n\n/**\n * sort AST\n * @param {Array.<object>} asts - collection of AST\n * @returns {Array.<object>} - collection of sorted AST\n */\nexport const sortAST = asts => {\n  const arr = [...asts];\n  if (arr.length > 1) {\n    const order = new Map([\n      [SELECTOR_PSEUDO_ELEMENT, BIT_01],\n      [SELECTOR_ID, BIT_02],\n      [SELECTOR_CLASS, BIT_04],\n      [SELECTOR_TYPE, BIT_08],\n      [SELECTOR_ATTR, BIT_16],\n      [SELECTOR_PSEUDO_CLASS, BIT_32]\n    ]);\n    arr.sort((a, b) => {\n      const { type: typeA } = a;\n      const { type: typeB } = b;\n      const bitA = order.get(typeA);\n      const bitB = order.get(typeB);\n      let res;\n      if (bitA === bitB) {\n        res = 0;\n      } else if (bitA > bitB) {\n        res = 1;\n      } else {\n        res = -1;\n      }\n      return res;\n    });\n  }\n  return arr;\n};\n\n/**\n * parse AST name - e.g. ns|E -> { prefix: ns, localName: E }\n * @private\n * @param {string} selector - type selector\n * @returns {object} - node properties\n */\nexport const parseAstName = selector => {\n  let prefix;\n  let localName;\n  if (selector && typeof selector === 'string') {\n    if (selector.indexOf('|') > -1) {\n      [prefix, localName] = selector.split('|');\n    } else {\n      prefix = '*';\n      localName = selector;\n    }\n  } else {\n    throw new DOMException(`Invalid selector ${selector}`, SYNTAX_ERR);\n  }\n  return {\n    prefix,\n    localName\n  };\n};\n\n/* export */\nexport { generate as generateCSS } from 'css-tree';\n"],
+  "mappings": "4ZAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,6CAAAE,EAAA,kBAAAC,EAAA,eAAAC,EAAA,YAAAC,EAAA,qBAAAC,EAAA,YAAAC,IAAA,eAAAC,EAAAR,GAKA,IAAAS,EAAoD,oBAGpDC,EAKO,yBA6QPD,EAAwC,oBAtQjC,MAAMH,EAAmB,CAACK,EAAW,KAAO,CACjD,GAAI,OAAOA,GAAa,UAAYA,EAAS,QAAQ,KAAM,CAAC,GAAK,EAAG,CAClE,MAAMC,EAAMD,EAAS,MAAM,IAAI,EACzBE,EAAID,EAAI,OACd,QAAS,EAAI,EAAG,EAAIC,EAAG,IAAK,CAC1B,IAAIC,EAAOF,EAAI,CAAC,EAChB,GAAIE,IAAS,IAAM,IAAMD,EAAI,EAC3BC,EAAO,aACF,CACL,MAAMC,EAAY,sBAAsB,KAAKD,CAAI,EACjD,GAAIC,EAAW,CACb,KAAM,CAAC,CAAEC,CAAG,EAAID,EAChB,IAAIE,EACJ,GAAI,CACF,MAAMC,EAAM,SAAS,OAAQ,KAAG,EAC1BC,EAAO,SAAS,OAAQ,KAAG,EAC3BC,EAAO,SAASJ,EAAK,KAAG,EAC1BI,IAAS,GAAMA,GAAQF,GAAOE,GAAQD,EACxCF,EAAM,SAENA,EAAM,OAAO,cAAcG,CAAI,CAEnC,MAAY,CACVH,EAAM,QACR,CACA,IAAII,EAAU,GACVP,EAAK,OAASE,EAAI,SACpBK,EAAUP,EAAK,UAAUE,EAAI,MAAM,GAErCF,EAAO,GAAGG,CAAG,GAAGI,CAAO,EAEzB,KAAW,YAAY,KAAKP,CAAI,IAC9BA,EAAO,KAAOA,EAElB,CACAF,EAAI,CAAC,EAAIE,CACX,CACAH,EAAWC,EAAI,KAAK,EAAE,CACxB,CACA,OAAOD,CACT,EAQaP,EAAa,IAAIkB,IAAS,CACrC,GAAI,CAACA,EAAK,OACR,MAAM,IAAI,UAAU,0CAA0C,EAEhE,GAAI,CAACX,CAAQ,EAAIW,EACjB,GAAI,OAAOX,GAAa,SAAU,CAChC,IAAIY,EAAQ,EACZ,KAAOA,GAAS,IACdA,EAAQZ,EAAS,QAAQ,IAAKY,CAAK,EAC/B,EAAAA,EAAQ,KAFK,CAKjB,MAAMC,EAAUb,EAAS,UAAU,EAAGY,EAAQ,CAAC,EAC/C,IAAIE,EAAWd,EAAS,UAAUY,EAAQ,CAAC,EAC3C,MAAMG,EAAYD,EAAS,YAAY,CAAC,EAGxC,GAAIC,IAAc,cAChB,GAAI,OAAO,KAAKD,EAAS,UAAU,EAAG,CAAC,CAAC,EACtC,MAAM,IAAI,aAAa,oBAAoBd,CAAQ,GAAI,YAAU,UAG1De,EAAY,WAAU,CAC/B,MAAMT,EAAM,KAAKS,EAAU,SAAS,KAAG,CAAC,IACpCD,EAAS,SAAW,MACtBA,EAAWR,EAEXQ,EAAW,GAAGR,CAAG,GAAGQ,EAAS,UAAU,KAAG,CAAC,EAE/C,CACAd,EAAW,GAAGa,CAAO,GAAGC,CAAQ,GAChCF,GACF,CACAZ,EAAWA,EAAS,QAAQ,YAAa;AAAA,CAAI,EAC1C,QAAQ,yBAA0B,QAAM,CAC7C,SAAqCA,GAAa,KAChDA,EAAW,OAAO,UAAU,SAAS,KAAKA,CAAQ,EAC/C,MAAM,YAAW,SAAO,EAAE,YAAY,UAChC,MAAM,QAAQA,CAAQ,EAC/BA,EAAWA,EAAS,KAAK,GAAG,UACnB,OAAO,UAAU,eAAe,KAAKA,EAAU,UAAU,EAClEA,EAAWA,EAAS,SAAS,MAE7B,OAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,OAAOA,CACT,EAOaR,EAAgBQ,GAAY,CAGvC,GAFAA,EAAWP,EAAWO,CAAQ,EAE1B,iBAAiB,KAAKA,CAAQ,EAChC,MAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,IAAIgB,EACJ,GAAI,CACF,MAAMC,KAAM,SAAMjB,EAAU,CAC1B,QAAS,eACT,oBAAqB,EACvB,CAAC,EACDgB,KAAM,iBAAcC,CAAG,CACzB,OAASC,EAAG,CAGV,MAAMC,EAAU,sCAChB,GAAID,EAAE,UAAY,0BAA4BC,EAAQ,KAAKnB,CAAQ,EAAG,CACpE,KAAM,CAAC,CAAEoB,EAAMC,CAAK,EAAIF,EAAQ,KAAKnB,CAAQ,EACvCsB,EACJD,EAAM,WAAW,IAAK,KAAK,EAAE,QAAQ,KAAM,EAAE,EAAE,QAAQ,KAAM,EAAE,EAC3DE,EAAcH,EAAK,QAAQC,EAAOC,CAAY,EACpDN,EAAMxB,EAAcQ,EAAS,QAAQoB,EAAMG,CAAW,CAAC,CACzD,SAAWL,EAAE,UAAY,mBAAqB,CAAClB,EAAS,SAAS,GAAG,EAClEgB,EAAMxB,EAAc,GAAGQ,CAAQ,GAAG,UACzBkB,EAAE,UAAY,mBAAqB,CAAClB,EAAS,SAAS,GAAG,EAClEgB,EAAMxB,EAAc,GAAGQ,CAAQ,GAAG,MAElC,OAAM,IAAI,aAAakB,EAAE,QAAS,YAAU,CAEhD,CACA,OAAOF,CACT,EAOapB,EAAU,CAACqB,EAAM,CAAC,IAAM,CACnC,MAAMO,EAAW,IAAI,IACrB,IAAIC,EAaJ,iBAAKR,EAZO,CACV,MAAOS,GAAQ,CACTA,EAAK,OAAS,WAChBF,EAAS,IAAIE,EAAK,QAAQ,GAChBA,EAAK,OAAS,yBACd,qBAAmB,KAAKA,EAAK,IAAI,GACjCA,EAAK,OAAS,2BACd,oBAAkB,KAAKA,EAAK,IAAI,KAC1CD,EAAgB,GAEpB,CACF,CACa,EACTA,MACF,WAAQR,EAAK,CAACS,EAAMvB,EAAMwB,IAAS,CACjC,GAAIA,GACF,GAAID,EAAK,OAAS,yBACd,qBAAmB,KAAKA,EAAK,IAAI,EAAG,CACtC,MAAME,EAAWD,EAAK,OAAOE,GAAK,CAChC,KAAM,CAAE,KAAAC,EAAM,KAAAC,CAAK,EAAIF,EAGvB,OADEE,IAAS,yBAAyB,qBAAmB,KAAKD,CAAI,CAElE,CAAC,EACD,SAAW,CAAE,SAAAE,CAAS,IAAKJ,EAEzB,SAAW,CAAE,SAAUK,CAAc,IAAKD,EAExC,SAAW,CAAE,SAAUE,CAAmB,IAAKD,EACzCT,EAAS,IAAIU,CAAkB,GACjCV,EAAS,OAAOU,CAAkB,CAK5C,SAAWR,EAAK,OAAS,2BACd,oBAAkB,KAAKA,EAAK,IAAI,EAAG,CAC5C,MAAME,EAAWD,EAAK,OAAOE,GAAK,CAChC,KAAM,CAAE,KAAAC,EAAM,KAAAC,CAAK,EAAIF,EAGvB,OADEE,IAAS,2BAA2B,oBAAkB,KAAKD,CAAI,CAEnE,CAAC,EACD,SAAW,CAAE,SAAAE,CAAS,IAAKJ,EAEzB,SAAW,CAAE,SAAUK,CAAc,IAAKD,EACpCR,EAAS,IAAIS,CAAa,GAC5BT,EAAS,OAAOS,CAAa,CAIrC,EAEJ,CAAC,EAEI,CAAC,GAAGT,CAAQ,CACrB,EAOa9B,EAAUyC,GAAQ,CAC7B,MAAMlC,EAAM,CAAC,GAAGkC,CAAI,EACpB,GAAIlC,EAAI,OAAS,EAAG,CAClB,MAAMmC,EAAQ,IAAI,IAAI,CACpB,CAAC,0BAAyB,QAAM,EAChC,CAAC,cAAa,QAAM,EACpB,CAAC,iBAAgB,QAAM,EACvB,CAAC,gBAAe,QAAM,EACtB,CAAC,gBAAe,QAAM,EACtB,CAAC,wBAAuB,QAAM,CAChC,CAAC,EACDnC,EAAI,KAAK,CAACoC,EAAGC,IAAM,CACjB,KAAM,CAAE,KAAMC,CAAM,EAAIF,EAClB,CAAE,KAAMG,CAAM,EAAIF,EAClBG,EAAOL,EAAM,IAAIG,CAAK,EACtBG,EAAON,EAAM,IAAII,CAAK,EAC5B,IAAIxB,EACJ,OAAIyB,IAASC,EACX1B,EAAM,EACGyB,EAAOC,EAChB1B,EAAM,EAENA,EAAM,GAEDA,CACT,CAAC,CACH,CACA,OAAOf,CACT,EAQaV,EAAeS,GAAY,CACtC,IAAI2C,EACAC,EACJ,GAAI5C,GAAY,OAAOA,GAAa,SAC9BA,EAAS,QAAQ,GAAG,EAAI,GAC1B,CAAC2C,EAAQC,CAAS,EAAI5C,EAAS,MAAM,GAAG,GAExC2C,EAAS,IACTC,EAAY5C,OAGd,OAAM,IAAI,aAAa,oBAAoBA,CAAQ,GAAI,YAAU,EAEnE,MAAO,CACL,OAAA2C,EACA,UAAAC,CACF,CACF",
+  "names": ["parser_exports", "__export", "parseAstName", "parseSelector", "preprocess", "sortAST", "unescapeSelector", "walkAST", "__toCommonJS", "import_css_tree", "import_constant", "selector", "arr", "l", "item", "hexExists", "hex", "str", "low", "high", "deci", "postStr", "args", "index", "preHash", "postHash", "codePoint", "res", "ast", "e", "regLang", "lang", "range", "escapedRange", "escapedLang", "branches", "hasPseudoFunc", "node", "list", "itemList", "i", "name", "type", "children", "grandChildren", "greatGrandChildren", "asts", "order", "a", "b", "typeA", "typeB", "bitA", "bitB", "prefix", "localName"]
 }

package/package.json

@@ -59,5 +59,5 @@
     "tsc": "npx tsc",
     "update-wpt": "git submodule update --init --recursive --remote"
   },
-  "version": "2.0.3-a.1"
+  "version": "2.0.3-a.2"
 }