query-selector-shadow-dom-modern 1.0.0 → 1.0.2

package/README.md

@@ -1,5 +1,7 @@
 # query-selector-shadow-dom-modern
 
+[![Release](https://github.com/kaixinol/query-selector-shadow-dom-modern/actions/workflows/release.yml/badge.svg)](https://github.com/kaixinol/query-selector-shadow-dom-modern/actions/workflows/release.yml)
+
 Modern drop-in replacement for [query-selector-shadow-dom](https://www.npmjs.com/package/query-selector-shadow-dom). Zero dependencies, full TypeScript support.
 
 querySelector that can pierce Shadow DOM roots without knowing the path through nested shadow roots. Useful for automated testing of Web Components (Selenium, Puppeteer, Playwright, etc.).
@@ -33,7 +35,10 @@ const filtered = collectAllElementsDeep('a[href]');
 ### UMD (browser)
 
 ```html
+<!-- Full build (debuggable, with sourcemap) -->
 <script src="node_modules/query-selector-shadow-dom-modern/dist/umd/index.js"></script>
+<!-- Or minified (~1.9 KB gzipped) -->
+<script src="node_modules/query-selector-shadow-dom-modern/dist/umd/index.min.js"></script>
 <script>
   const btn = querySelectorShadowDom.querySelectorDeep('.btn-in-shadow-dom');
 </script>

package/dist/umd/index.cjs

@@ -0,0 +1,535 @@
+'use strict';
+
+/**
+ * query-selector-shadow-dom-modern
+ *
+ * Drop-in replacement for https://www.npmjs.com/package/query-selector-shadow-dom
+ * with the same public API:
+ *
+ *   - querySelectorDeep(selector, root?, allElements?)
+ *   - querySelectorAllDeep(selector, root?, allElements?)
+ *   - collectAllElementsDeep(selector?, root?, cachedElements?)
+ *
+ * but faster and safer:
+ *   - Native `querySelector(All)` does the heavy lifting whenever possible
+ *     (whole-selector fast path when no shadow roots are involved, and a
+ *     per-root pre-filter on the right-most compound selector otherwise).
+ *   - Selector parsing is memoized (strings are immutable — safe to cache).
+ *   - No DOM caching: results are always computed from the live tree, so
+ *     dynamic pages never see stale data.
+ *   - Full combinator support across shadow boundaries: ` `, `>`, `+`, `~`.
+ *   - Cross-realm safe (iframe documents): no `instanceof` on DOM classes.
+ */
+const ELEMENT_NODE = 1;
+const DOCUMENT_FRAGMENT_NODE = 11;
+/** Cross-realm-safe Element check (`instanceof` fails across frames). */
+function isElementNode(node) {
+    return !!node && node.nodeType === ELEMENT_NODE;
+}
+/** Cross-realm-safe ShadowRoot check. */
+function isHostedFragment(node) {
+    return (!!node &&
+        node.nodeType === DOCUMENT_FRAGMENT_NODE &&
+        !!node.host);
+}
+/** `el.matches()` that never throws (context-dependent pseudo-classes etc.). */
+function matchesSelector(el, compound) {
+    try {
+        return el.matches(compound);
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Parent in the composed (flat-ish) tree: crosses shadow boundaries towards
+ * the host, and stops at the boundary the search was scoped to.
+ * Matches the original library's findParentOrHost semantics.
+ */
+function composedParent(el, boundary) {
+    if (el === boundary)
+        return null;
+    const parent = el.parentElement;
+    if (parent)
+        return parent;
+    const rootNode = el.getRootNode();
+    if (rootNode === el || rootNode === boundary)
+        return null;
+    if (isHostedFragment(rootNode))
+        return rootNode.host;
+    return null;
+}
+/**
+ * Verify that `el` (already known to match the right-most compound) satisfies
+ * the whole selector path, walking the composed tree right-to-left.
+ * `tokens` looks like: [compound, combinator, compound, ...].
+ */
+function matchesComposedPath(el, tokens, boundary) {
+    let node = el;
+    let i = tokens.length - 1;
+    while (i > 0 && node) {
+        const combinator = tokens[i - 1];
+        const compound = tokens[i - 2];
+        if (combinator === '>') {
+            node = composedParent(node, boundary);
+            if (!node || !matchesSelector(node, compound))
+                return false;
+        }
+        else if (combinator === '+') {
+            node = node.previousElementSibling;
+            if (!node || !matchesSelector(node, compound))
+                return false;
+        }
+        else if (combinator === '~') {
+            node = node.previousElementSibling;
+            let found = false;
+            while (node) {
+                if (matchesSelector(node, compound)) {
+                    found = true;
+                    break;
+                }
+                node = node.previousElementSibling;
+            }
+            if (!found)
+                return false;
+        }
+        else {
+            // descendant combinator
+            node = composedParent(node, boundary);
+            let found = false;
+            while (node) {
+                if (matchesSelector(node, compound)) {
+                    found = true;
+                    break;
+                }
+                node = composedParent(node, boundary);
+            }
+            if (!found)
+                return false;
+        }
+        i -= 2;
+    }
+    return i <= 0;
+}
+/**
+ * All queryable roots below (and including) `root`: the root itself plus every
+ * open shadow root found underneath, in discovery order. Computed fresh on
+ * every call — never cached, so dynamic DOMs are always correct.
+ */
+function collectRoots(root) {
+    const roots = [root];
+    const pending = [];
+    if (isElementNode(root) && root.shadowRoot) {
+        roots.push(root.shadowRoot);
+        pending.push(root.shadowRoot);
+    }
+    let scope = root;
+    while (scope) {
+        const all = scope.querySelectorAll('*');
+        for (let i = 0; i < all.length; i++) {
+            const shadowRoot = all[i].shadowRoot;
+            if (shadowRoot) {
+                roots.push(shadowRoot);
+                pending.push(shadowRoot);
+            }
+        }
+        scope = pending.pop();
+    }
+    return roots;
+}
+/**
+ * Collect every element under `root` in the original library's order
+ * (composed tree pre-order: a host's shadow content comes immediately after
+ * the host element). One native `querySelectorAll('*')` per root — the
+ * browser does the walking.
+ */
+function collectAllElements(root, filter) {
+    const out = [];
+    collectInto(root, out, filter);
+    return out;
+}
+function collectInto(scope, out, filter) {
+    // A root element's own shadow content is listed first (original behavior).
+    if (isElementNode(scope) && scope.shadowRoot) {
+        collectList(scope.shadowRoot.querySelectorAll('*'), out, filter);
+    }
+    collectList(scope.querySelectorAll('*'), out, filter);
+}
+function collectList(list, out, filter) {
+    for (let i = 0; i < list.length; i++) {
+        const el = list[i];
+        if (!filter || matchesSelector(el, filter)) {
+            out.push(el);
+        }
+        const shadowRoot = el.shadowRoot;
+        if (shadowRoot) {
+            collectList(shadowRoot.querySelectorAll('*'), out, filter);
+        }
+    }
+}
+/**
+ * Generator variant of the same traversal, for callers that can stop early.
+ */
+function* iterateDeep(root) {
+    const stack = [];
+    const pushChildren = (scope) => {
+        const kids = scope.children;
+        for (let i = kids.length - 1; i >= 0; i--)
+            stack.push(kids[i]);
+    };
+    if (isElementNode(root)) {
+        pushChildren(root);
+        if (root.shadowRoot)
+            pushChildren(root.shadowRoot);
+    }
+    else {
+        pushChildren(root);
+    }
+    while (stack.length > 0) {
+        const el = stack.pop();
+        yield el;
+        pushChildren(el);
+        if (el.shadowRoot)
+            pushChildren(el.shadowRoot);
+    }
+}
+const PARSE_CACHE_LIMIT = 512;
+const parseCache = new Map();
+/** Split into comma-separated parts, each tokenized as [compound, combinator, ...]. Memoized. */
+function parseSelector(selector) {
+    const cached = parseCache.get(selector);
+    if (cached)
+        return cached;
+    const parts = [];
+    for (const part of splitByComma(selector)) {
+        const tokens = tokenizePath(part);
+        if (tokens.length > 0)
+            parts.push(tokens);
+    }
+    if (parseCache.size >= PARSE_CACHE_LIMIT)
+        parseCache.clear();
+    parseCache.set(selector, parts);
+    return parts;
+}
+/**
+ * Candidates for one tokenized selector part: elements matching the
+ * right-most compound, natively pre-filtered inside each root.
+ * Returns the candidates either as a single ordered list (when only one root
+ * produced hits) or as a Set plus a flag that a composed-order walk is needed.
+ */
+function collectCandidates(roots, rightMostCompound) {
+    let list = null;
+    let set = null;
+    let rootsWithHits = 0;
+    for (const root of roots) {
+        let found;
+        try {
+            found = root.querySelectorAll(rightMostCompound);
+        }
+        catch {
+            continue; // selector not valid in this root's context
+        }
+        if (found.length === 0)
+            continue;
+        rootsWithHits++;
+        if (!list) {
+            list = Array.from(found);
+        }
+        else {
+            if (!set)
+                set = new Set(list);
+            for (let i = 0; i < found.length; i++)
+                set.add(found[i]);
+        }
+    }
+    return { list, set, rootsWithHits };
+}
+/**
+ * Finds the first matching element on the page, piercing any number of nested
+ * shadow roots. Same signature and semantics as the original library.
+ */
+function querySelectorDeep(selector, root = document, allElements = null) {
+    if (!selector || !selector.trim())
+        return null;
+    // Native fast path — identical to the original library: a plain
+    // light-DOM match always wins, no matter what lives in shadow roots.
+    const lightElement = root.querySelector(selector);
+    if (lightElement)
+        return lightElement;
+    const parts = parseSelector(selector);
+    if (parts.length === 0)
+        return null;
+    // Caller-supplied element list (original API's third argument).
+    if (allElements) {
+        for (const tokens of parts) {
+            const last = tokens[tokens.length - 1];
+            for (const el of allElements) {
+                if (matchesSelector(el, last) &&
+                    (tokens.length === 1 || matchesComposedPath(el, tokens, root))) {
+                    return el;
+                }
+            }
+        }
+        return null;
+    }
+    const roots = collectRoots(root);
+    if (roots.length === 1)
+        return null; // no shadow roots; native query already failed
+    for (const tokens of parts) {
+        const last = tokens[tokens.length - 1];
+        const { list, set, rootsWithHits } = collectCandidates(roots, last);
+        if (!list)
+            continue;
+        const verified = (el) => tokens.length === 1 || matchesComposedPath(el, tokens, root);
+        if (rootsWithHits === 1) {
+            // All candidates live in a single root → that root's native order is composed order.
+            for (const el of list) {
+                if (verified(el))
+                    return el;
+            }
+        }
+        else {
+            const candidates = set ?? new Set(list);
+            for (const el of iterateDeep(root)) {
+                if (candidates.has(el) && verified(el))
+                    return el;
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Finds all matching elements on the page, piercing any number of nested
+ * shadow roots. Same signature and semantics as the original library
+ * (results are additionally de-duplicated).
+ */
+function querySelectorAllDeep(selector, root = document, allElements = null) {
+    if (!selector || !selector.trim())
+        return [];
+    const parts = parseSelector(selector);
+    if (parts.length === 0)
+        return [];
+    // Caller-supplied element list (original API's third argument).
+    if (allElements) {
+        const out = [];
+        const seen = new Set();
+        for (const tokens of parts) {
+            const last = tokens[tokens.length - 1];
+            for (const el of allElements) {
+                if (seen.has(el) || !matchesSelector(el, last))
+                    continue;
+                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {
+                    seen.add(el);
+                    out.push(el);
+                }
+            }
+        }
+        return out;
+    }
+    const roots = collectRoots(root);
+    // No shadow roots below `root` → hand everything to the browser.
+    if (roots.length === 1) {
+        return Array.from(root.querySelectorAll(selector));
+    }
+    const results = [];
+    const seen = new Set();
+    for (const tokens of parts) {
+        const last = tokens[tokens.length - 1];
+        const { list, set, rootsWithHits } = collectCandidates(roots, last);
+        if (!list)
+            continue;
+        if (rootsWithHits === 1) {
+            // All candidates live in a single root → its native order is composed order.
+            for (const el of list) {
+                if (seen.has(el))
+                    continue;
+                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {
+                    seen.add(el);
+                    results.push(el);
+                }
+            }
+        }
+        else {
+            // Candidates spread across roots → merge in composed tree order.
+            const candidates = set ?? new Set(list);
+            const all = collectAllElements(root);
+            for (let i = 0; i < all.length; i++) {
+                const el = all[i];
+                if (!candidates.has(el) || seen.has(el))
+                    continue;
+                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {
+                    seen.add(el);
+                    results.push(el);
+                }
+            }
+        }
+    }
+    return results;
+}
+/**
+ * Finds all elements on the page, inclusive of those within shadow roots.
+ * Optionally filtered by a CSS selector.
+ * Same signature and semantics as the original library.
+ */
+function collectAllElementsDeep(selector = null, root = document, cachedElements = null) {
+    if (cachedElements) {
+        const all = cachedElements;
+        return selector ? all.filter((el) => matchesSelector(el, selector)) : all;
+    }
+    // Single pass: elements are filtered while the tree is being walked.
+    return collectAllElements(root, selector ?? undefined);
+}
+/**
+ * Split a selector list on top-level commas (ignores commas inside quotes,
+ * attribute brackets and pseudo-class parentheses).
+ */
+function splitByComma(selector) {
+    if (!selector || !selector.trim())
+        return [];
+    const results = [];
+    let current = '';
+    let parenDepth = 0;
+    let bracketDepth = 0;
+    let inSingleQuote = false;
+    let inDoubleQuote = false;
+    let escaped = false;
+    for (let i = 0; i < selector.length; i++) {
+        const char = selector[i];
+        if (escaped) {
+            current += char;
+            escaped = false;
+            continue;
+        }
+        if (char === '\\') {
+            escaped = true;
+            current += char;
+            continue;
+        }
+        if (char === "'" && !inDoubleQuote) {
+            inSingleQuote = !inSingleQuote;
+            current += char;
+            continue;
+        }
+        if (char === '"' && !inSingleQuote) {
+            inDoubleQuote = !inDoubleQuote;
+            current += char;
+            continue;
+        }
+        if (!inSingleQuote && !inDoubleQuote) {
+            if (char === '(')
+                parenDepth++;
+            else if (char === ')')
+                parenDepth = Math.max(0, parenDepth - 1);
+            else if (char === '[')
+                bracketDepth++;
+            else if (char === ']')
+                bracketDepth = Math.max(0, bracketDepth - 1);
+            else if (char === ',' && parenDepth === 0 && bracketDepth === 0) {
+                results.push(current.trim());
+                current = '';
+                continue;
+            }
+        }
+        current += char;
+    }
+    if (current.trim()) {
+        results.push(current.trim());
+    }
+    return results;
+}
+/**
+ * Tokenize a CSS selector into compounds and combinators:
+ * 'div > p span' → ['div', '>', 'p', ' ', 'span'].
+ */
+function tokenizePath(selector) {
+    if (!selector || !selector.trim())
+        return [];
+    const tokens = [];
+    let current = '';
+    let parenDepth = 0;
+    let bracketDepth = 0;
+    let inSingleQuote = false;
+    let inDoubleQuote = false;
+    let escaped = false;
+    const pushCurrent = () => {
+        const trimmed = current.trim();
+        if (trimmed) {
+            tokens.push(trimmed);
+        }
+        current = '';
+    };
+    for (let i = 0; i < selector.length; i++) {
+        const char = selector[i];
+        if (escaped) {
+            current += char;
+            escaped = false;
+            continue;
+        }
+        if (char === '\\') {
+            escaped = true;
+            current += char;
+            continue;
+        }
+        if (char === "'" && !inDoubleQuote) {
+            inSingleQuote = !inSingleQuote;
+            current += char;
+            continue;
+        }
+        if (char === '"' && !inSingleQuote) {
+            inDoubleQuote = !inDoubleQuote;
+            current += char;
+            continue;
+        }
+        if (!inSingleQuote && !inDoubleQuote) {
+            if (char === '(')
+                parenDepth++;
+            else if (char === ')')
+                parenDepth = Math.max(0, parenDepth - 1);
+            else if (char === '[')
+                bracketDepth++;
+            else if (char === ']')
+                bracketDepth = Math.max(0, bracketDepth - 1);
+            if (parenDepth === 0 && bracketDepth === 0) {
+                if (char === '>' || char === '+' || char === '~') {
+                    pushCurrent();
+                    tokens.push(char);
+                    continue;
+                }
+                if (/\s/.test(char)) {
+                    pushCurrent();
+                    while (i + 1 < selector.length && /\s/.test(selector[i + 1])) {
+                        i++;
+                    }
+                    let nextChar = '';
+                    for (let j = i + 1; j < selector.length; j++) {
+                        if (!/\s/.test(selector[j])) {
+                            nextChar = selector[j];
+                            break;
+                        }
+                    }
+                    const lastToken = tokens[tokens.length - 1];
+                    const isLastCombinator = lastToken === ' ' || lastToken === '>' || lastToken === '+' || lastToken === '~';
+                    if (tokens.length > 0 &&
+                        !isLastCombinator &&
+                        nextChar &&
+                        nextChar !== '>' &&
+                        nextChar !== '+' &&
+                        nextChar !== '~') {
+                        tokens.push(' ');
+                    }
+                    continue;
+                }
+            }
+        }
+        current += char;
+    }
+    pushCurrent();
+    return tokens;
+}
+
+exports.collectAllElementsDeep = collectAllElementsDeep;
+exports.querySelectorAllDeep = querySelectorAllDeep;
+exports.querySelectorDeep = querySelectorDeep;
+exports.splitByComma = splitByComma;
+exports.tokenizePath = tokenizePath;
+//# sourceMappingURL=index.cjs.map

package/dist/umd/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../src/index.ts"],"sourcesContent":["/**\n * query-selector-shadow-dom-modern\n *\n * Drop-in replacement for https://www.npmjs.com/package/query-selector-shadow-dom\n * with the same public API:\n *\n *   - querySelectorDeep(selector, root?, allElements?)\n *   - querySelectorAllDeep(selector, root?, allElements?)\n *   - collectAllElementsDeep(selector?, root?, cachedElements?)\n *\n * but faster and safer:\n *   - Native `querySelector(All)` does the heavy lifting whenever possible\n *     (whole-selector fast path when no shadow roots are involved, and a\n *     per-root pre-filter on the right-most compound selector otherwise).\n *   - Selector parsing is memoized (strings are immutable — safe to cache).\n *   - No DOM caching: results are always computed from the live tree, so\n *     dynamic pages never see stale data.\n *   - Full combinator support across shadow boundaries: ` `, `>`, `+`, `~`.\n *   - Cross-realm safe (iframe documents): no `instanceof` on DOM classes.\n */\n\nexport type QueryableNode = Document | DocumentFragment | Element;\n\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\n\n/** Cross-realm-safe Element check (`instanceof` fails across frames). */\nfunction isElementNode(node: unknown): node is Element {\n    return !!node && (node as Node).nodeType === ELEMENT_NODE;\n}\n\n/** Cross-realm-safe ShadowRoot check. */\nfunction isHostedFragment(node: unknown): node is ShadowRoot {\n    return (\n        !!node &&\n        (node as Node).nodeType === DOCUMENT_FRAGMENT_NODE &&\n        !!(node as ShadowRoot).host\n    );\n}\n\n/** `el.matches()` that never throws (context-dependent pseudo-classes etc.). */\nfunction matchesSelector(el: Element, compound: string): boolean {\n    try {\n        return el.matches(compound);\n    } catch {\n        return false;\n    }\n}\n\n/**\n * Parent in the composed (flat-ish) tree: crosses shadow boundaries towards\n * the host, and stops at the boundary the search was scoped to.\n * Matches the original library's findParentOrHost semantics.\n */\nfunction composedParent(el: Element, boundary: QueryableNode): Element | null {\n    if (el === boundary) return null;\n    const parent = el.parentElement;\n    if (parent) return parent;\n    const rootNode = el.getRootNode();\n    if (rootNode === el || rootNode === boundary) return null;\n    if (isHostedFragment(rootNode)) return rootNode.host;\n    return null;\n}\n\n/**\n * Verify that `el` (already known to match the right-most compound) satisfies\n * the whole selector path, walking the composed tree right-to-left.\n * `tokens` looks like: [compound, combinator, compound, ...].\n */\nfunction matchesComposedPath(el: Element, tokens: string[], boundary: QueryableNode): boolean {\n    let node: Element | null = el;\n    let i = tokens.length - 1;\n\n    while (i > 0 && node) {\n        const combinator = tokens[i - 1];\n        const compound = tokens[i - 2];\n\n        if (combinator === '>') {\n            node = composedParent(node, boundary);\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '+') {\n            node = node.previousElementSibling;\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '~') {\n            node = node.previousElementSibling;\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = node.previousElementSibling;\n            }\n            if (!found) return false;\n        } else {\n            // descendant combinator\n            node = composedParent(node, boundary);\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = composedParent(node, boundary);\n            }\n            if (!found) return false;\n        }\n        i -= 2;\n    }\n    return i <= 0;\n}\n\n/**\n * All queryable roots below (and including) `root`: the root itself plus every\n * open shadow root found underneath, in discovery order. Computed fresh on\n * every call — never cached, so dynamic DOMs are always correct.\n */\nfunction collectRoots(root: QueryableNode): QueryableNode[] {\n    const roots: QueryableNode[] = [root];\n    const pending: QueryableNode[] = [];\n\n    if (isElementNode(root) && root.shadowRoot) {\n        roots.push(root.shadowRoot);\n        pending.push(root.shadowRoot);\n    }\n\n    let scope: QueryableNode | undefined = root;\n    while (scope) {\n        const all = scope.querySelectorAll('*');\n        for (let i = 0; i < all.length; i++) {\n            const shadowRoot = (all[i] as Element).shadowRoot;\n            if (shadowRoot) {\n                roots.push(shadowRoot);\n                pending.push(shadowRoot);\n            }\n        }\n        scope = pending.pop();\n    }\n    return roots;\n}\n\n/**\n * Collect every element under `root` in the original library's order\n * (composed tree pre-order: a host's shadow content comes immediately after\n * the host element). One native `querySelectorAll('*')` per root — the\n * browser does the walking.\n */\nfunction collectAllElements(root: QueryableNode, filter?: string): Element[] {\n    const out: Element[] = [];\n    collectInto(root, out, filter);\n    return out;\n}\n\nfunction collectInto(scope: QueryableNode, out: Element[], filter?: string): void {\n    // A root element's own shadow content is listed first (original behavior).\n    if (isElementNode(scope) && scope.shadowRoot) {\n        collectList(scope.shadowRoot.querySelectorAll('*'), out, filter);\n    }\n    collectList(scope.querySelectorAll('*'), out, filter);\n}\n\nfunction collectList(list: NodeListOf<Element>, out: Element[], filter?: string): void {\n    for (let i = 0; i < list.length; i++) {\n        const el = list[i];\n        if (!filter || matchesSelector(el, filter)) {\n            out.push(el);\n        }\n        const shadowRoot = el.shadowRoot;\n        if (shadowRoot) {\n            collectList(shadowRoot.querySelectorAll('*'), out, filter);\n        }\n    }\n}\n\n/**\n * Generator variant of the same traversal, for callers that can stop early.\n */\nfunction* iterateDeep(root: QueryableNode): Generator<Element, void, undefined> {\n    const stack: Element[] = [];\n    const pushChildren = (scope: QueryableNode) => {\n        const kids = scope.children;\n        for (let i = kids.length - 1; i >= 0; i--) stack.push(kids[i]);\n    };\n\n    if (isElementNode(root)) {\n        pushChildren(root);\n        if (root.shadowRoot) pushChildren(root.shadowRoot);\n    } else {\n        pushChildren(root);\n    }\n\n    while (stack.length > 0) {\n        const el = stack.pop()!;\n        yield el;\n        pushChildren(el);\n        if (el.shadowRoot) pushChildren(el.shadowRoot);\n    }\n}\n\nconst PARSE_CACHE_LIMIT = 512;\nconst parseCache = new Map<string, string[][]>();\n\n/** Split into comma-separated parts, each tokenized as [compound, combinator, ...]. Memoized. */\nfunction parseSelector(selector: string): string[][] {\n    const cached = parseCache.get(selector);\n    if (cached) return cached;\n\n    const parts: string[][] = [];\n    for (const part of splitByComma(selector)) {\n        const tokens = tokenizePath(part);\n        if (tokens.length > 0) parts.push(tokens);\n    }\n\n    if (parseCache.size >= PARSE_CACHE_LIMIT) parseCache.clear();\n    parseCache.set(selector, parts);\n    return parts;\n}\n\n/**\n * Candidates for one tokenized selector part: elements matching the\n * right-most compound, natively pre-filtered inside each root.\n * Returns the candidates either as a single ordered list (when only one root\n * produced hits) or as a Set plus a flag that a composed-order walk is needed.\n */\nfunction collectCandidates<T extends Element>(\n    roots: QueryableNode[],\n    rightMostCompound: string,\n): { list: T[] | null; set: Set<T> | null; rootsWithHits: number } {\n    let list: T[] | null = null;\n    let set: Set<T> | null = null;\n    let rootsWithHits = 0;\n\n    for (const root of roots) {\n        let found: NodeListOf<T>;\n        try {\n            found = root.querySelectorAll<T>(rightMostCompound);\n        } catch {\n            continue; // selector not valid in this root's context\n        }\n        if (found.length === 0) continue;\n        rootsWithHits++;\n        if (!list) {\n            list = Array.from(found);\n        } else {\n            if (!set) set = new Set(list);\n            for (let i = 0; i < found.length; i++) set.add(found[i]);\n        }\n    }\n    return { list, set, rootsWithHits };\n}\n\n/**\n * Finds the first matching element on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library.\n */\nexport function querySelectorDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T | null {\n    if (!selector || !selector.trim()) return null;\n\n    // Native fast path — identical to the original library: a plain\n    // light-DOM match always wins, no matter what lives in shadow roots.\n    const lightElement = root.querySelector<T>(selector);\n    if (lightElement) return lightElement;\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return null;\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (\n                    matchesSelector(el, last) &&\n                    (tokens.length === 1 || matchesComposedPath(el, tokens, root))\n                ) {\n                    return el as T;\n                }\n            }\n        }\n        return null;\n    }\n\n    const roots = collectRoots(root);\n    if (roots.length === 1) return null; // no shadow roots; native query already failed\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        const verified = (el: T): boolean =>\n            tokens.length === 1 || matchesComposedPath(el, tokens, root);\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → that root's native order is composed order.\n            for (const el of list) {\n                if (verified(el)) return el;\n            }\n        } else {\n            const candidates = set ?? new Set(list);\n            for (const el of iterateDeep(root)) {\n                if (candidates.has(el as T) && verified(el as T)) return el as T;\n            }\n        }\n    }\n    return null;\n}\n\n/**\n * Finds all matching elements on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library\n * (results are additionally de-duplicated).\n */\nexport function querySelectorAllDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T[] {\n    if (!selector || !selector.trim()) return [];\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return [];\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        const out: T[] = [];\n        const seen = new Set<Element>();\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (seen.has(el) || !matchesSelector(el, last)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    out.push(el as T);\n                }\n            }\n        }\n        return out;\n    }\n\n    const roots = collectRoots(root);\n\n    // No shadow roots below `root` → hand everything to the browser.\n    if (roots.length === 1) {\n        return Array.from(root.querySelectorAll<T>(selector));\n    }\n\n    const results: T[] = [];\n    const seen = new Set<T>();\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → its native order is composed order.\n            for (const el of list) {\n                if (seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        } else {\n            // Candidates spread across roots → merge in composed tree order.\n            const candidates = set ?? new Set(list);\n            const all = collectAllElements(root);\n            for (let i = 0; i < all.length; i++) {\n                const el = all[i] as T;\n                if (!candidates.has(el) || seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        }\n    }\n    return results;\n}\n\n/**\n * Finds all elements on the page, inclusive of those within shadow roots.\n * Optionally filtered by a CSS selector.\n * Same signature and semantics as the original library.\n */\nexport function collectAllElementsDeep<T extends Element = HTMLElement>(\n    selector: string | null = null,\n    root: QueryableNode = document,\n    cachedElements: Element[] | null = null,\n): T[] {\n    if (cachedElements) {\n        const all = cachedElements as T[];\n        return selector ? all.filter((el) => matchesSelector(el, selector)) : all;\n    }\n\n    // Single pass: elements are filtered while the tree is being walked.\n    return collectAllElements(root, selector ?? undefined) as T[];\n}\n\n/**\n * Split a selector list on top-level commas (ignores commas inside quotes,\n * attribute brackets and pseudo-class parentheses).\n */\nexport function splitByComma(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const results: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n            else if (char === ',' && parenDepth === 0 && bracketDepth === 0) {\n                results.push(current.trim());\n                current = '';\n                continue;\n            }\n        }\n\n        current += char;\n    }\n\n    if (current.trim()) {\n        results.push(current.trim());\n    }\n\n    return results;\n}\n\n/**\n * Tokenize a CSS selector into compounds and combinators:\n * 'div > p span' → ['div', '>', 'p', ' ', 'span'].\n */\nexport function tokenizePath(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const tokens: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    const pushCurrent = () => {\n        const trimmed = current.trim();\n        if (trimmed) {\n            tokens.push(trimmed);\n        }\n        current = '';\n    };\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n\n            if (parenDepth === 0 && bracketDepth === 0) {\n                if (char === '>' || char === '+' || char === '~') {\n                    pushCurrent();\n                    tokens.push(char);\n                    continue;\n                }\n\n                if (/\\s/.test(char)) {\n                    pushCurrent();\n\n                    while (i + 1 < selector.length && /\\s/.test(selector[i + 1])) {\n                        i++;\n                    }\n\n                    let nextChar = '';\n                    for (let j = i + 1; j < selector.length; j++) {\n                        if (!/\\s/.test(selector[j])) {\n                            nextChar = selector[j];\n                            break;\n                        }\n                    }\n\n                    const lastToken = tokens[tokens.length - 1];\n                    const isLastCombinator =\n                        lastToken === ' ' || lastToken === '>' || lastToken === '+' || lastToken === '~';\n\n                    if (\n                        tokens.length > 0 &&\n                        !isLastCombinator &&\n                        nextChar &&\n                        nextChar !== '>' &&\n                        nextChar !== '+' &&\n                        nextChar !== '~'\n                    ) {\n                        tokens.push(' ');\n                    }\n                    continue;\n                }\n            }\n        }\n\n        current += char;\n    }\n\n    pushCurrent();\n\n    return tokens;\n}\n"],"names":[],"mappings":";;AAAA;;;;;;;;;;;;;;;;;;;AAmBG;AAIH,MAAM,YAAY,GAAG,CAAC;AACtB,MAAM,sBAAsB,GAAG,EAAE;AAEjC;AACA,SAAS,aAAa,CAAC,IAAa,EAAA;IAChC,OAAO,CAAC,CAAC,IAAI,IAAK,IAAa,CAAC,QAAQ,KAAK,YAAY;AAC7D;AAEA;AACA,SAAS,gBAAgB,CAAC,IAAa,EAAA;IACnC,QACI,CAAC,CAAC,IAAI;QACL,IAAa,CAAC,QAAQ,KAAK,sBAAsB;AAClD,QAAA,CAAC,CAAE,IAAmB,CAAC,IAAI;AAEnC;AAEA;AACA,SAAS,eAAe,CAAC,EAAW,EAAE,QAAgB,EAAA;AAClD,IAAA,IAAI;AACA,QAAA,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B;AAAE,IAAA,MAAM;AACJ,QAAA,OAAO,KAAK;IAChB;AACJ;AAEA;;;;AAIG;AACH,SAAS,cAAc,CAAC,EAAW,EAAE,QAAuB,EAAA;IACxD,IAAI,EAAE,KAAK,QAAQ;AAAE,QAAA,OAAO,IAAI;AAChC,IAAA,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa;AAC/B,IAAA,IAAI,MAAM;AAAE,QAAA,OAAO,MAAM;AACzB,IAAA,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE;AACjC,IAAA,IAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,KAAK,QAAQ;AAAE,QAAA,OAAO,IAAI;IACzD,IAAI,gBAAgB,CAAC,QAAQ,CAAC;QAAE,OAAO,QAAQ,CAAC,IAAI;AACpD,IAAA,OAAO,IAAI;AACf;AAEA;;;;AAIG;AACH,SAAS,mBAAmB,CAAC,EAAW,EAAE,MAAgB,EAAE,QAAuB,EAAA;IAC/E,IAAI,IAAI,GAAmB,EAAE;AAC7B,IAAA,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC;AAEzB,IAAA,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;QAClB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;AAE9B,QAAA,IAAI,UAAU,KAAK,GAAG,EAAE;AACpB,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;YACrC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;AAAE,gBAAA,OAAO,KAAK;QAC/D;AAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;AAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;YAClC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;AAAE,gBAAA,OAAO,KAAK;QAC/D;AAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;AAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;YAClC,IAAI,KAAK,GAAG,KAAK;YACjB,OAAO,IAAI,EAAE;AACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;oBACjC,KAAK,GAAG,IAAI;oBACZ;gBACJ;AACA,gBAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;YACtC;AACA,YAAA,IAAI,CAAC,KAAK;AAAE,gBAAA,OAAO,KAAK;QAC5B;aAAO;;AAEH,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;YACrC,IAAI,KAAK,GAAG,KAAK;YACjB,OAAO,IAAI,EAAE;AACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;oBACjC,KAAK,GAAG,IAAI;oBACZ;gBACJ;AACA,gBAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;YACzC;AACA,YAAA,IAAI,CAAC,KAAK;AAAE,gBAAA,OAAO,KAAK;QAC5B;QACA,CAAC,IAAI,CAAC;IACV;IACA,OAAO,CAAC,IAAI,CAAC;AACjB;AAEA;;;;AAIG;AACH,SAAS,YAAY,CAAC,IAAmB,EAAA;AACrC,IAAA,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC;IACrC,MAAM,OAAO,GAAoB,EAAE;IAEnC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE;AACxC,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;AAC3B,QAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IACjC;IAEA,IAAI,KAAK,GAA8B,IAAI;IAC3C,OAAO,KAAK,EAAE;QACV,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC;AACvC,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,UAAU,GAAI,GAAG,CAAC,CAAC,CAAa,CAAC,UAAU;YACjD,IAAI,UAAU,EAAE;AACZ,gBAAA,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AACtB,gBAAA,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;YAC5B;QACJ;AACA,QAAA,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE;IACzB;AACA,IAAA,OAAO,KAAK;AAChB;AAEA;;;;;AAKG;AACH,SAAS,kBAAkB,CAAC,IAAmB,EAAE,MAAe,EAAA;IAC5D,MAAM,GAAG,GAAc,EAAE;AACzB,IAAA,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC;AAC9B,IAAA,OAAO,GAAG;AACd;AAEA,SAAS,WAAW,CAAC,KAAoB,EAAE,GAAc,EAAE,MAAe,EAAA;;IAEtE,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE;AAC1C,QAAA,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;IACpE;AACA,IAAA,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;AACzD;AAEA,SAAS,WAAW,CAAC,IAAyB,EAAE,GAAc,EAAE,MAAe,EAAA;AAC3E,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAClC,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;AACxC,YAAA,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAChB;AACA,QAAA,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU;QAChC,IAAI,UAAU,EAAE;AACZ,YAAA,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;QAC9D;IACJ;AACJ;AAEA;;AAEG;AACH,UAAU,WAAW,CAAC,IAAmB,EAAA;IACrC,MAAM,KAAK,GAAc,EAAE;AAC3B,IAAA,MAAM,YAAY,GAAG,CAAC,KAAoB,KAAI;AAC1C,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ;AAC3B,QAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClE,IAAA,CAAC;AAED,IAAA,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;QACrB,YAAY,CAAC,IAAI,CAAC;QAClB,IAAI,IAAI,CAAC,UAAU;AAAE,YAAA,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;IACtD;SAAO;QACH,YAAY,CAAC,IAAI,CAAC;IACtB;AAEA,IAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACrB,QAAA,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG;AACvB,QAAA,MAAM,EAAE;QACR,YAAY,CAAC,EAAE,CAAC;QAChB,IAAI,EAAE,CAAC,UAAU;AAAE,YAAA,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC;IAClD;AACJ;AAEA,MAAM,iBAAiB,GAAG,GAAG;AAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB;AAEhD;AACA,SAAS,aAAa,CAAC,QAAgB,EAAA;IACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC;AACvC,IAAA,IAAI,MAAM;AAAE,QAAA,OAAO,MAAM;IAEzB,MAAM,KAAK,GAAe,EAAE;IAC5B,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE;AACvC,QAAA,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC;AACjC,QAAA,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;AAAE,YAAA,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;IAC7C;AAEA,IAAA,IAAI,UAAU,CAAC,IAAI,IAAI,iBAAiB;QAAE,UAAU,CAAC,KAAK,EAAE;AAC5D,IAAA,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC;AAC/B,IAAA,OAAO,KAAK;AAChB;AAEA;;;;;AAKG;AACH,SAAS,iBAAiB,CACtB,KAAsB,EACtB,iBAAyB,EAAA;IAEzB,IAAI,IAAI,GAAe,IAAI;IAC3B,IAAI,GAAG,GAAkB,IAAI;IAC7B,IAAI,aAAa,GAAG,CAAC;AAErB,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACtB,QAAA,IAAI,KAAoB;AACxB,QAAA,IAAI;AACA,YAAA,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAI,iBAAiB,CAAC;QACvD;AAAE,QAAA,MAAM;AACJ,YAAA,SAAS;QACb;AACA,QAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE;AACxB,QAAA,aAAa,EAAE;QACf,IAAI,CAAC,IAAI,EAAE;AACP,YAAA,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAC5B;aAAO;AACH,YAAA,IAAI,CAAC,GAAG;AAAE,gBAAA,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;AAC7B,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5D;IACJ;AACA,IAAA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE;AACvC;AAEA;;;AAGG;AACG,SAAU,iBAAiB,CAC7B,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;AAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;AAAE,QAAA,OAAO,IAAI;;;IAI9C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAI,QAAQ,CAAC;AACpD,IAAA,IAAI,YAAY;AAAE,QAAA,OAAO,YAAY;AAErC,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;AACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;;IAGnC,IAAI,WAAW,EAAE;AACb,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;AAC1B,gBAAA,IACI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;AACzB,qBAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAChE;AACE,oBAAA,OAAO,EAAO;gBAClB;YACJ;QACJ;AACA,QAAA,OAAO,IAAI;IACf;AAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;AAChC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;AAEpC,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;AACtE,QAAA,IAAI,CAAC,IAAI;YAAE;QAEX,MAAM,QAAQ,GAAG,CAAC,EAAK,KACnB,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC;AAEhE,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;AAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;gBACnB,IAAI,QAAQ,CAAC,EAAE,CAAC;AAAE,oBAAA,OAAO,EAAE;YAC/B;QACJ;aAAO;YACH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;YACvC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE;gBAChC,IAAI,UAAU,CAAC,GAAG,CAAC,EAAO,CAAC,IAAI,QAAQ,CAAC,EAAO,CAAC;AAAE,oBAAA,OAAO,EAAO;YACpE;QACJ;IACJ;AACA,IAAA,OAAO,IAAI;AACf;AAEA;;;;AAIG;AACG,SAAU,oBAAoB,CAChC,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;AAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;AAAE,QAAA,OAAO,EAAE;AAE5C,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;AACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,EAAE;;IAGjC,IAAI,WAAW,EAAE;QACb,MAAM,GAAG,GAAQ,EAAE;AACnB,QAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW;AAC/B,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;AAC1B,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;oBAAE;AAChD,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;AAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACZ,oBAAA,GAAG,CAAC,IAAI,CAAC,EAAO,CAAC;gBACrB;YACJ;QACJ;AACA,QAAA,OAAO,GAAG;IACd;AAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;;AAGhC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAI,QAAQ,CAAC,CAAC;IACzD;IAEA,MAAM,OAAO,GAAQ,EAAE;AACvB,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK;AAEzB,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;AACtE,QAAA,IAAI,CAAC,IAAI;YAAE;AAEX,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;AAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;AACnB,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE;AAClB,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;AAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB;YACJ;QACJ;aAAO;;YAEH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;AACvC,YAAA,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC;AACpC,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACjC,gBAAA,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAM;AACtB,gBAAA,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE;AACzC,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;AAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB;YACJ;QACJ;IACJ;AACA,IAAA,OAAO,OAAO;AAClB;AAEA;;;;AAIG;AACG,SAAU,sBAAsB,CAClC,QAAA,GAA0B,IAAI,EAC9B,IAAA,GAAsB,QAAQ,EAC9B,cAAA,GAAmC,IAAI,EAAA;IAEvC,IAAI,cAAc,EAAE;QAChB,MAAM,GAAG,GAAG,cAAqB;QACjC,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG;IAC7E;;IAGA,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAQ;AACjE;AAEA;;;AAGG;AACG,SAAU,YAAY,CAAC,QAAgB,EAAA;AACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;AAAE,QAAA,OAAO,EAAE;IAE5C,MAAM,OAAO,GAAa,EAAE;IAC5B,IAAI,OAAO,GAAG,EAAE;IAChB,IAAI,UAAU,GAAG,CAAC;IAClB,IAAI,YAAY,GAAG,CAAC;IACpB,IAAI,aAAa,GAAG,KAAK;IACzB,IAAI,aAAa,GAAG,KAAK;IACzB,IAAI,OAAO,GAAG,KAAK;AAEnB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;QAExB,IAAI,OAAO,EAAE;YACT,OAAO,IAAI,IAAI;YACf,OAAO,GAAG,KAAK;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;YACf,OAAO,GAAG,IAAI;YACd,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;YAChC,aAAa,GAAG,CAAC,aAAa;YAC9B,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;YAChC,aAAa,GAAG,CAAC,aAAa;YAC9B,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;YAClC,IAAI,IAAI,KAAK,GAAG;AAAE,gBAAA,UAAU,EAAE;iBACzB,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;iBAC1D,IAAI,IAAI,KAAK,GAAG;AAAE,gBAAA,YAAY,EAAE;iBAChC,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;AAC9D,iBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;gBAC7D,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAC5B,OAAO,GAAG,EAAE;gBACZ;YACJ;QACJ;QAEA,OAAO,IAAI,IAAI;IACnB;AAEA,IAAA,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IAChC;AAEA,IAAA,OAAO,OAAO;AAClB;AAEA;;;AAGG;AACG,SAAU,YAAY,CAAC,QAAgB,EAAA;AACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;AAAE,QAAA,OAAO,EAAE;IAE5C,MAAM,MAAM,GAAa,EAAE;IAC3B,IAAI,OAAO,GAAG,EAAE;IAChB,IAAI,UAAU,GAAG,CAAC;IAClB,IAAI,YAAY,GAAG,CAAC;IACpB,IAAI,aAAa,GAAG,KAAK;IACzB,IAAI,aAAa,GAAG,KAAK;IACzB,IAAI,OAAO,GAAG,KAAK;IAEnB,MAAM,WAAW,GAAG,MAAK;AACrB,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;QAC9B,IAAI,OAAO,EAAE;AACT,YAAA,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;QACxB;QACA,OAAO,GAAG,EAAE;AAChB,IAAA,CAAC;AAED,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;QAExB,IAAI,OAAO,EAAE;YACT,OAAO,IAAI,IAAI;YACf,OAAO,GAAG,KAAK;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;YACf,OAAO,GAAG,IAAI;YACd,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;YAChC,aAAa,GAAG,CAAC,aAAa;YAC9B,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;YAChC,aAAa,GAAG,CAAC,aAAa;YAC9B,OAAO,IAAI,IAAI;YACf;QACJ;AAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;YAClC,IAAI,IAAI,KAAK,GAAG;AAAE,gBAAA,UAAU,EAAE;iBACzB,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;iBAC1D,IAAI,IAAI,KAAK,GAAG;AAAE,gBAAA,YAAY,EAAE;iBAChC,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;YAEnE,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;AACxC,gBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE;AAC9C,oBAAA,WAAW,EAAE;AACb,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;oBACjB;gBACJ;AAEA,gBAAA,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AACjB,oBAAA,WAAW,EAAE;oBAEb,OAAO,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC1D,wBAAA,CAAC,EAAE;oBACP;oBAEA,IAAI,QAAQ,GAAG,EAAE;AACjB,oBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;AACzB,4BAAA,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC;4BACtB;wBACJ;oBACJ;oBAEA,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC3C,oBAAA,MAAM,gBAAgB,GAClB,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG;AAEpF,oBAAA,IACI,MAAM,CAAC,MAAM,GAAG,CAAC;AACjB,wBAAA,CAAC,gBAAgB;wBACjB,QAAQ;AACR,wBAAA,QAAQ,KAAK,GAAG;AAChB,wBAAA,QAAQ,KAAK,GAAG;wBAChB,QAAQ,KAAK,GAAG,EAClB;AACE,wBAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;oBACpB;oBACA;gBACJ;YACJ;QACJ;QAEA,OAAO,IAAI,IAAI;IACnB;AAEA,IAAA,WAAW,EAAE;AAEb,IAAA,OAAO,MAAM;AACjB;;;;;;"}

package/dist/umd/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../src/index.ts"],"sourcesContent":["/**\n * query-selector-shadow-dom-modern\n *\n * Drop-in replacement for https://www.npmjs.com/package/query-selector-shadow-dom\n * with the same public API:\n *\n *   - querySelectorDeep(selector, root?, allElements?)\n *   - querySelectorAllDeep(selector, root?, allElements?)\n *   - collectAllElementsDeep(selector?, root?, cachedElements?)\n *\n * but faster and safer:\n *   - Native `querySelector(All)` does the heavy lifting whenever possible\n *     (whole-selector fast path when no shadow roots are involved, and a\n *     per-root pre-filter on the right-most compound selector otherwise).\n *   - Selector parsing is memoized (strings are immutable — safe to cache).\n *   - No DOM caching: results are always computed from the live tree, so\n *     dynamic pages never see stale data.\n *   - Full combinator support across shadow boundaries: ` `, `>`, `+`, `~`.\n *   - Cross-realm safe (iframe documents): no `instanceof` on DOM classes.\n */\n\nexport type QueryableNode = Document | DocumentFragment | Element;\n\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\n\n/** Cross-realm-safe Element check (`instanceof` fails across frames). */\nfunction isElementNode(node: unknown): node is Element {\n    return !!node && (node as Node).nodeType === ELEMENT_NODE;\n}\n\n/** Cross-realm-safe ShadowRoot check. */\nfunction isHostedFragment(node: unknown): node is ShadowRoot {\n    return (\n        !!node &&\n        (node as Node).nodeType === DOCUMENT_FRAGMENT_NODE &&\n        !!(node as ShadowRoot).host\n    );\n}\n\n/** `el.matches()` that never throws (context-dependent pseudo-classes etc.). */\nfunction matchesSelector(el: Element, compound: string): boolean {\n    try {\n        return el.matches(compound);\n    } catch {\n        return false;\n    }\n}\n\n/**\n * Parent in the composed (flat-ish) tree: crosses shadow boundaries towards\n * the host, and stops at the boundary the search was scoped to.\n * Matches the original library's findParentOrHost semantics.\n */\nfunction composedParent(el: Element, boundary: QueryableNode): Element | null {\n    if (el === boundary) return null;\n    const parent = el.parentElement;\n    if (parent) return parent;\n    const rootNode = el.getRootNode();\n    if (rootNode === el || rootNode === boundary) return null;\n    if (isHostedFragment(rootNode)) return rootNode.host;\n    return null;\n}\n\n/**\n * Verify that `el` (already known to match the right-most compound) satisfies\n * the whole selector path, walking the composed tree right-to-left.\n * `tokens` looks like: [compound, combinator, compound, ...].\n */\nfunction matchesComposedPath(el: Element, tokens: string[], boundary: QueryableNode): boolean {\n    let node: Element | null = el;\n    let i = tokens.length - 1;\n\n    while (i > 0 && node) {\n        const combinator = tokens[i - 1];\n        const compound = tokens[i - 2];\n\n        if (combinator === '>') {\n            node = composedParent(node, boundary);\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '+') {\n            node = node.previousElementSibling;\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '~') {\n            node = node.previousElementSibling;\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = node.previousElementSibling;\n            }\n            if (!found) return false;\n        } else {\n            // descendant combinator\n            node = composedParent(node, boundary);\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = composedParent(node, boundary);\n            }\n            if (!found) return false;\n        }\n        i -= 2;\n    }\n    return i <= 0;\n}\n\n/**\n * All queryable roots below (and including) `root`: the root itself plus every\n * open shadow root found underneath, in discovery order. Computed fresh on\n * every call — never cached, so dynamic DOMs are always correct.\n */\nfunction collectRoots(root: QueryableNode): QueryableNode[] {\n    const roots: QueryableNode[] = [root];\n    const pending: QueryableNode[] = [];\n\n    if (isElementNode(root) && root.shadowRoot) {\n        roots.push(root.shadowRoot);\n        pending.push(root.shadowRoot);\n    }\n\n    let scope: QueryableNode | undefined = root;\n    while (scope) {\n        const all = scope.querySelectorAll('*');\n        for (let i = 0; i < all.length; i++) {\n            const shadowRoot = (all[i] as Element).shadowRoot;\n            if (shadowRoot) {\n                roots.push(shadowRoot);\n                pending.push(shadowRoot);\n            }\n        }\n        scope = pending.pop();\n    }\n    return roots;\n}\n\n/**\n * Collect every element under `root` in the original library's order\n * (composed tree pre-order: a host's shadow content comes immediately after\n * the host element). One native `querySelectorAll('*')` per root — the\n * browser does the walking.\n */\nfunction collectAllElements(root: QueryableNode, filter?: string): Element[] {\n    const out: Element[] = [];\n    collectInto(root, out, filter);\n    return out;\n}\n\nfunction collectInto(scope: QueryableNode, out: Element[], filter?: string): void {\n    // A root element's own shadow content is listed first (original behavior).\n    if (isElementNode(scope) && scope.shadowRoot) {\n        collectList(scope.shadowRoot.querySelectorAll('*'), out, filter);\n    }\n    collectList(scope.querySelectorAll('*'), out, filter);\n}\n\nfunction collectList(list: NodeListOf<Element>, out: Element[], filter?: string): void {\n    for (let i = 0; i < list.length; i++) {\n        const el = list[i];\n        if (!filter || matchesSelector(el, filter)) {\n            out.push(el);\n        }\n        const shadowRoot = el.shadowRoot;\n        if (shadowRoot) {\n            collectList(shadowRoot.querySelectorAll('*'), out, filter);\n        }\n    }\n}\n\n/**\n * Generator variant of the same traversal, for callers that can stop early.\n */\nfunction* iterateDeep(root: QueryableNode): Generator<Element, void, undefined> {\n    const stack: Element[] = [];\n    const pushChildren = (scope: QueryableNode) => {\n        const kids = scope.children;\n        for (let i = kids.length - 1; i >= 0; i--) stack.push(kids[i]);\n    };\n\n    if (isElementNode(root)) {\n        pushChildren(root);\n        if (root.shadowRoot) pushChildren(root.shadowRoot);\n    } else {\n        pushChildren(root);\n    }\n\n    while (stack.length > 0) {\n        const el = stack.pop()!;\n        yield el;\n        pushChildren(el);\n        if (el.shadowRoot) pushChildren(el.shadowRoot);\n    }\n}\n\nconst PARSE_CACHE_LIMIT = 512;\nconst parseCache = new Map<string, string[][]>();\n\n/** Split into comma-separated parts, each tokenized as [compound, combinator, ...]. Memoized. */\nfunction parseSelector(selector: string): string[][] {\n    const cached = parseCache.get(selector);\n    if (cached) return cached;\n\n    const parts: string[][] = [];\n    for (const part of splitByComma(selector)) {\n        const tokens = tokenizePath(part);\n        if (tokens.length > 0) parts.push(tokens);\n    }\n\n    if (parseCache.size >= PARSE_CACHE_LIMIT) parseCache.clear();\n    parseCache.set(selector, parts);\n    return parts;\n}\n\n/**\n * Candidates for one tokenized selector part: elements matching the\n * right-most compound, natively pre-filtered inside each root.\n * Returns the candidates either as a single ordered list (when only one root\n * produced hits) or as a Set plus a flag that a composed-order walk is needed.\n */\nfunction collectCandidates<T extends Element>(\n    roots: QueryableNode[],\n    rightMostCompound: string,\n): { list: T[] | null; set: Set<T> | null; rootsWithHits: number } {\n    let list: T[] | null = null;\n    let set: Set<T> | null = null;\n    let rootsWithHits = 0;\n\n    for (const root of roots) {\n        let found: NodeListOf<T>;\n        try {\n            found = root.querySelectorAll<T>(rightMostCompound);\n        } catch {\n            continue; // selector not valid in this root's context\n        }\n        if (found.length === 0) continue;\n        rootsWithHits++;\n        if (!list) {\n            list = Array.from(found);\n        } else {\n            if (!set) set = new Set(list);\n            for (let i = 0; i < found.length; i++) set.add(found[i]);\n        }\n    }\n    return { list, set, rootsWithHits };\n}\n\n/**\n * Finds the first matching element on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library.\n */\nexport function querySelectorDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T | null {\n    if (!selector || !selector.trim()) return null;\n\n    // Native fast path — identical to the original library: a plain\n    // light-DOM match always wins, no matter what lives in shadow roots.\n    const lightElement = root.querySelector<T>(selector);\n    if (lightElement) return lightElement;\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return null;\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (\n                    matchesSelector(el, last) &&\n                    (tokens.length === 1 || matchesComposedPath(el, tokens, root))\n                ) {\n                    return el as T;\n                }\n            }\n        }\n        return null;\n    }\n\n    const roots = collectRoots(root);\n    if (roots.length === 1) return null; // no shadow roots; native query already failed\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        const verified = (el: T): boolean =>\n            tokens.length === 1 || matchesComposedPath(el, tokens, root);\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → that root's native order is composed order.\n            for (const el of list) {\n                if (verified(el)) return el;\n            }\n        } else {\n            const candidates = set ?? new Set(list);\n            for (const el of iterateDeep(root)) {\n                if (candidates.has(el as T) && verified(el as T)) return el as T;\n            }\n        }\n    }\n    return null;\n}\n\n/**\n * Finds all matching elements on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library\n * (results are additionally de-duplicated).\n */\nexport function querySelectorAllDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T[] {\n    if (!selector || !selector.trim()) return [];\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return [];\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        const out: T[] = [];\n        const seen = new Set<Element>();\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (seen.has(el) || !matchesSelector(el, last)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    out.push(el as T);\n                }\n            }\n        }\n        return out;\n    }\n\n    const roots = collectRoots(root);\n\n    // No shadow roots below `root` → hand everything to the browser.\n    if (roots.length === 1) {\n        return Array.from(root.querySelectorAll<T>(selector));\n    }\n\n    const results: T[] = [];\n    const seen = new Set<T>();\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → its native order is composed order.\n            for (const el of list) {\n                if (seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        } else {\n            // Candidates spread across roots → merge in composed tree order.\n            const candidates = set ?? new Set(list);\n            const all = collectAllElements(root);\n            for (let i = 0; i < all.length; i++) {\n                const el = all[i] as T;\n                if (!candidates.has(el) || seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        }\n    }\n    return results;\n}\n\n/**\n * Finds all elements on the page, inclusive of those within shadow roots.\n * Optionally filtered by a CSS selector.\n * Same signature and semantics as the original library.\n */\nexport function collectAllElementsDeep<T extends Element = HTMLElement>(\n    selector: string | null = null,\n    root: QueryableNode = document,\n    cachedElements: Element[] | null = null,\n): T[] {\n    if (cachedElements) {\n        const all = cachedElements as T[];\n        return selector ? all.filter((el) => matchesSelector(el, selector)) : all;\n    }\n\n    // Single pass: elements are filtered while the tree is being walked.\n    return collectAllElements(root, selector ?? undefined) as T[];\n}\n\n/**\n * Split a selector list on top-level commas (ignores commas inside quotes,\n * attribute brackets and pseudo-class parentheses).\n */\nexport function splitByComma(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const results: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n            else if (char === ',' && parenDepth === 0 && bracketDepth === 0) {\n                results.push(current.trim());\n                current = '';\n                continue;\n            }\n        }\n\n        current += char;\n    }\n\n    if (current.trim()) {\n        results.push(current.trim());\n    }\n\n    return results;\n}\n\n/**\n * Tokenize a CSS selector into compounds and combinators:\n * 'div > p span' → ['div', '>', 'p', ' ', 'span'].\n */\nexport function tokenizePath(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const tokens: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    const pushCurrent = () => {\n        const trimmed = current.trim();\n        if (trimmed) {\n            tokens.push(trimmed);\n        }\n        current = '';\n    };\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n\n            if (parenDepth === 0 && bracketDepth === 0) {\n                if (char === '>' || char === '+' || char === '~') {\n                    pushCurrent();\n                    tokens.push(char);\n                    continue;\n                }\n\n                if (/\\s/.test(char)) {\n                    pushCurrent();\n\n                    while (i + 1 < selector.length && /\\s/.test(selector[i + 1])) {\n                        i++;\n                    }\n\n                    let nextChar = '';\n                    for (let j = i + 1; j < selector.length; j++) {\n                        if (!/\\s/.test(selector[j])) {\n                            nextChar = selector[j];\n                            break;\n                        }\n                    }\n\n                    const lastToken = tokens[tokens.length - 1];\n                    const isLastCombinator =\n                        lastToken === ' ' || lastToken === '>' || lastToken === '+' || lastToken === '~';\n\n                    if (\n                        tokens.length > 0 &&\n                        !isLastCombinator &&\n                        nextChar &&\n                        nextChar !== '>' &&\n                        nextChar !== '+' &&\n                        nextChar !== '~'\n                    ) {\n                        tokens.push(' ');\n                    }\n                    continue;\n                }\n            }\n        }\n\n        current += char;\n    }\n\n    pushCurrent();\n\n    return tokens;\n}\n"],"names":[],"mappings":";;;;;;IAAA;;;;;;;;;;;;;;;;;;;IAmBG;IAIH,MAAM,YAAY,GAAG,CAAC;IACtB,MAAM,sBAAsB,GAAG,EAAE;IAEjC;IACA,SAAS,aAAa,CAAC,IAAa,EAAA;QAChC,OAAO,CAAC,CAAC,IAAI,IAAK,IAAa,CAAC,QAAQ,KAAK,YAAY;IAC7D;IAEA;IACA,SAAS,gBAAgB,CAAC,IAAa,EAAA;QACnC,QACI,CAAC,CAAC,IAAI;YACL,IAAa,CAAC,QAAQ,KAAK,sBAAsB;IAClD,QAAA,CAAC,CAAE,IAAmB,CAAC,IAAI;IAEnC;IAEA;IACA,SAAS,eAAe,CAAC,EAAW,EAAE,QAAgB,EAAA;IAClD,IAAA,IAAI;IACA,QAAA,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC/B;IAAE,IAAA,MAAM;IACJ,QAAA,OAAO,KAAK;QAChB;IACJ;IAEA;;;;IAIG;IACH,SAAS,cAAc,CAAC,EAAW,EAAE,QAAuB,EAAA;QACxD,IAAI,EAAE,KAAK,QAAQ;IAAE,QAAA,OAAO,IAAI;IAChC,IAAA,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa;IAC/B,IAAA,IAAI,MAAM;IAAE,QAAA,OAAO,MAAM;IACzB,IAAA,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE;IACjC,IAAA,IAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,KAAK,QAAQ;IAAE,QAAA,OAAO,IAAI;QACzD,IAAI,gBAAgB,CAAC,QAAQ,CAAC;YAAE,OAAO,QAAQ,CAAC,IAAI;IACpD,IAAA,OAAO,IAAI;IACf;IAEA;;;;IAIG;IACH,SAAS,mBAAmB,CAAC,EAAW,EAAE,MAAgB,EAAE,QAAuB,EAAA;QAC/E,IAAI,IAAI,GAAmB,EAAE;IAC7B,IAAA,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC;IAEzB,IAAA,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;YAClB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IAE9B,QAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IACpB,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACrC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAE,gBAAA,OAAO,KAAK;YAC/D;IAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBAClC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAE,gBAAA,OAAO,KAAK;YAC/D;IAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBAClC,IAAI,KAAK,GAAG,KAAK;gBACjB,OAAO,IAAI,EAAE;IACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;wBACjC,KAAK,GAAG,IAAI;wBACZ;oBACJ;IACA,gBAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBACtC;IACA,YAAA,IAAI,CAAC,KAAK;IAAE,gBAAA,OAAO,KAAK;YAC5B;iBAAO;;IAEH,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACrC,IAAI,KAAK,GAAG,KAAK;gBACjB,OAAO,IAAI,EAAE;IACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;wBACjC,KAAK,GAAG,IAAI;wBACZ;oBACJ;IACA,gBAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACzC;IACA,YAAA,IAAI,CAAC,KAAK;IAAE,gBAAA,OAAO,KAAK;YAC5B;YACA,CAAC,IAAI,CAAC;QACV;QACA,OAAO,CAAC,IAAI,CAAC;IACjB;IAEA;;;;IAIG;IACH,SAAS,YAAY,CAAC,IAAmB,EAAA;IACrC,IAAA,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC;QACrC,MAAM,OAAO,GAAoB,EAAE;QAEnC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE;IACxC,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC3B,QAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC;QAEA,IAAI,KAAK,GAA8B,IAAI;QAC3C,OAAO,KAAK,EAAE;YACV,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC;IACvC,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,MAAM,UAAU,GAAI,GAAG,CAAC,CAAC,CAAa,CAAC,UAAU;gBACjD,IAAI,UAAU,EAAE;IACZ,gBAAA,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;IACtB,gBAAA,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC5B;YACJ;IACA,QAAA,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE;QACzB;IACA,IAAA,OAAO,KAAK;IAChB;IAEA;;;;;IAKG;IACH,SAAS,kBAAkB,CAAC,IAAmB,EAAE,MAAe,EAAA;QAC5D,MAAM,GAAG,GAAc,EAAE;IACzB,IAAA,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC;IAC9B,IAAA,OAAO,GAAG;IACd;IAEA,SAAS,WAAW,CAAC,KAAoB,EAAE,GAAc,EAAE,MAAe,EAAA;;QAEtE,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE;IAC1C,QAAA,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;QACpE;IACA,IAAA,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;IACzD;IAEA,SAAS,WAAW,CAAC,IAAyB,EAAE,GAAc,EAAE,MAAe,EAAA;IAC3E,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IAClC,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;IACxC,YAAA,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAChB;IACA,QAAA,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU;YAChC,IAAI,UAAU,EAAE;IACZ,YAAA,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;YAC9D;QACJ;IACJ;IAEA;;IAEG;IACH,UAAU,WAAW,CAAC,IAAmB,EAAA;QACrC,MAAM,KAAK,GAAc,EAAE;IAC3B,IAAA,MAAM,YAAY,GAAG,CAAC,KAAoB,KAAI;IAC1C,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ;IAC3B,QAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClE,IAAA,CAAC;IAED,IAAA,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YACrB,YAAY,CAAC,IAAI,CAAC;YAClB,IAAI,IAAI,CAAC,UAAU;IAAE,YAAA,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;QACtD;aAAO;YACH,YAAY,CAAC,IAAI,CAAC;QACtB;IAEA,IAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;IACrB,QAAA,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG;IACvB,QAAA,MAAM,EAAE;YACR,YAAY,CAAC,EAAE,CAAC;YAChB,IAAI,EAAE,CAAC,UAAU;IAAE,YAAA,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC;QAClD;IACJ;IAEA,MAAM,iBAAiB,GAAG,GAAG;IAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB;IAEhD;IACA,SAAS,aAAa,CAAC,QAAgB,EAAA;QACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC;IACvC,IAAA,IAAI,MAAM;IAAE,QAAA,OAAO,MAAM;QAEzB,MAAM,KAAK,GAAe,EAAE;QAC5B,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE;IACvC,QAAA,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,QAAA,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;IAAE,YAAA,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7C;IAEA,IAAA,IAAI,UAAU,CAAC,IAAI,IAAI,iBAAiB;YAAE,UAAU,CAAC,KAAK,EAAE;IAC5D,IAAA,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC;IAC/B,IAAA,OAAO,KAAK;IAChB;IAEA;;;;;IAKG;IACH,SAAS,iBAAiB,CACtB,KAAsB,EACtB,iBAAyB,EAAA;QAEzB,IAAI,IAAI,GAAe,IAAI;QAC3B,IAAI,GAAG,GAAkB,IAAI;QAC7B,IAAI,aAAa,GAAG,CAAC;IAErB,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACtB,QAAA,IAAI,KAAoB;IACxB,QAAA,IAAI;IACA,YAAA,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAI,iBAAiB,CAAC;YACvD;IAAE,QAAA,MAAM;IACJ,YAAA,SAAS;YACb;IACA,QAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE;IACxB,QAAA,aAAa,EAAE;YACf,IAAI,CAAC,IAAI,EAAE;IACP,YAAA,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5B;iBAAO;IACH,YAAA,IAAI,CAAC,GAAG;IAAE,gBAAA,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;IAC7B,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5D;QACJ;IACA,IAAA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE;IACvC;IAEA;;;IAGG;IACG,SAAU,iBAAiB,CAC7B,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;IAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,IAAI;;;QAI9C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAI,QAAQ,CAAC;IACpD,IAAA,IAAI,YAAY;IAAE,QAAA,OAAO,YAAY;IAErC,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;IACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;IAAE,QAAA,OAAO,IAAI;;QAGnC,IAAI,WAAW,EAAE;IACb,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;gBACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;IAC1B,gBAAA,IACI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;IACzB,qBAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAChE;IACE,oBAAA,OAAO,EAAO;oBAClB;gBACJ;YACJ;IACA,QAAA,OAAO,IAAI;QACf;IAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IAChC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAEpC,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;IACtE,QAAA,IAAI,CAAC,IAAI;gBAAE;YAEX,MAAM,QAAQ,GAAG,CAAC,EAAK,KACnB,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC;IAEhE,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;IAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;oBACnB,IAAI,QAAQ,CAAC,EAAE,CAAC;IAAE,oBAAA,OAAO,EAAE;gBAC/B;YACJ;iBAAO;gBACH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;gBACvC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE;oBAChC,IAAI,UAAU,CAAC,GAAG,CAAC,EAAO,CAAC,IAAI,QAAQ,CAAC,EAAO,CAAC;IAAE,oBAAA,OAAO,EAAO;gBACpE;YACJ;QACJ;IACA,IAAA,OAAO,IAAI;IACf;IAEA;;;;IAIG;IACG,SAAU,oBAAoB,CAChC,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;IAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;IAE5C,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;IACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;IAAE,QAAA,OAAO,EAAE;;QAGjC,IAAI,WAAW,EAAE;YACb,MAAM,GAAG,GAAQ,EAAE;IACnB,QAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW;IAC/B,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;gBACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;IAC1B,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;wBAAE;IAChD,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,GAAG,CAAC,IAAI,CAAC,EAAO,CAAC;oBACrB;gBACJ;YACJ;IACA,QAAA,OAAO,GAAG;QACd;IAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;;IAGhC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;YACpB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAI,QAAQ,CAAC,CAAC;QACzD;QAEA,MAAM,OAAO,GAAQ,EAAE;IACvB,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK;IAEzB,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;IACtE,QAAA,IAAI,CAAC,IAAI;gBAAE;IAEX,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;IAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;IACnB,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAE;IAClB,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB;gBACJ;YACJ;iBAAO;;gBAEH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;IACvC,YAAA,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC;IACpC,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACjC,gBAAA,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAM;IACtB,gBAAA,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAE;IACzC,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB;gBACJ;YACJ;QACJ;IACA,IAAA,OAAO,OAAO;IAClB;IAEA;;;;IAIG;IACG,SAAU,sBAAsB,CAClC,QAAA,GAA0B,IAAI,EAC9B,IAAA,GAAsB,QAAQ,EAC9B,cAAA,GAAmC,IAAI,EAAA;QAEvC,IAAI,cAAc,EAAE;YAChB,MAAM,GAAG,GAAG,cAAqB;YACjC,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG;QAC7E;;QAGA,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAQ;IACjE;IAEA;;;IAGG;IACG,SAAU,YAAY,CAAC,QAAgB,EAAA;IACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;QAE5C,MAAM,OAAO,GAAa,EAAE;QAC5B,IAAI,OAAO,GAAG,EAAE;QAChB,IAAI,UAAU,GAAG,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC;QACpB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,OAAO,GAAG,KAAK;IAEnB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;YAExB,IAAI,OAAO,EAAE;gBACT,OAAO,IAAI,IAAI;gBACf,OAAO,GAAG,KAAK;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;gBACf,OAAO,GAAG,IAAI;gBACd,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;gBAClC,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,UAAU,EAAE;qBACzB,IAAI,IAAI,KAAK,GAAG;oBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;qBAC1D,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,YAAY,EAAE;qBAChC,IAAI,IAAI,KAAK,GAAG;oBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;IAC9D,iBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;oBAC7D,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;oBAC5B,OAAO,GAAG,EAAE;oBACZ;gBACJ;YACJ;YAEA,OAAO,IAAI,IAAI;QACnB;IAEA,IAAA,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE;YAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAChC;IAEA,IAAA,OAAO,OAAO;IAClB;IAEA;;;IAGG;IACG,SAAU,YAAY,CAAC,QAAgB,EAAA;IACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;QAE5C,MAAM,MAAM,GAAa,EAAE;QAC3B,IAAI,OAAO,GAAG,EAAE;QAChB,IAAI,UAAU,GAAG,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC;QACpB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,OAAO,GAAG,KAAK;QAEnB,MAAM,WAAW,GAAG,MAAK;IACrB,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YAC9B,IAAI,OAAO,EAAE;IACT,YAAA,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;YACxB;YACA,OAAO,GAAG,EAAE;IAChB,IAAA,CAAC;IAED,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;YAExB,IAAI,OAAO,EAAE;gBACT,OAAO,IAAI,IAAI;gBACf,OAAO,GAAG,KAAK;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;gBACf,OAAO,GAAG,IAAI;gBACd,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;gBAClC,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,UAAU,EAAE;qBACzB,IAAI,IAAI,KAAK,GAAG;oBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;qBAC1D,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,YAAY,EAAE;qBAChC,IAAI,IAAI,KAAK,GAAG;oBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;gBAEnE,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;IACxC,gBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE;IAC9C,oBAAA,WAAW,EAAE;IACb,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;wBACjB;oBACJ;IAEA,gBAAA,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IACjB,oBAAA,WAAW,EAAE;wBAEb,OAAO,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;IAC1D,wBAAA,CAAC,EAAE;wBACP;wBAEA,IAAI,QAAQ,GAAG,EAAE;IACjB,oBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;IACzB,4BAAA,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC;gCACtB;4BACJ;wBACJ;wBAEA,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,oBAAA,MAAM,gBAAgB,GAClB,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG;IAEpF,oBAAA,IACI,MAAM,CAAC,MAAM,GAAG,CAAC;IACjB,wBAAA,CAAC,gBAAgB;4BACjB,QAAQ;IACR,wBAAA,QAAQ,KAAK,GAAG;IAChB,wBAAA,QAAQ,KAAK,GAAG;4BAChB,QAAQ,KAAK,GAAG,EAClB;IACE,wBAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;wBACpB;wBACA;oBACJ;gBACJ;YACJ;YAEA,OAAO,IAAI,IAAI;QACnB;IAEA,IAAA,WAAW,EAAE;IAEb,IAAA,OAAO,MAAM;IACjB;;;;;;;;;;;;"}
+{"version":3,"file":"index.js","sources":["../../src/index.ts"],"sourcesContent":["/**\n * query-selector-shadow-dom-modern\n *\n * Drop-in replacement for https://www.npmjs.com/package/query-selector-shadow-dom\n * with the same public API:\n *\n *   - querySelectorDeep(selector, root?, allElements?)\n *   - querySelectorAllDeep(selector, root?, allElements?)\n *   - collectAllElementsDeep(selector?, root?, cachedElements?)\n *\n * but faster and safer:\n *   - Native `querySelector(All)` does the heavy lifting whenever possible\n *     (whole-selector fast path when no shadow roots are involved, and a\n *     per-root pre-filter on the right-most compound selector otherwise).\n *   - Selector parsing is memoized (strings are immutable — safe to cache).\n *   - No DOM caching: results are always computed from the live tree, so\n *     dynamic pages never see stale data.\n *   - Full combinator support across shadow boundaries: ` `, `>`, `+`, `~`.\n *   - Cross-realm safe (iframe documents): no `instanceof` on DOM classes.\n */\n\nexport type QueryableNode = Document | DocumentFragment | Element;\n\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\n\n/** Cross-realm-safe Element check (`instanceof` fails across frames). */\nfunction isElementNode(node: unknown): node is Element {\n    return !!node && (node as Node).nodeType === ELEMENT_NODE;\n}\n\n/** Cross-realm-safe ShadowRoot check. */\nfunction isHostedFragment(node: unknown): node is ShadowRoot {\n    return (\n        !!node &&\n        (node as Node).nodeType === DOCUMENT_FRAGMENT_NODE &&\n        !!(node as ShadowRoot).host\n    );\n}\n\n/** `el.matches()` that never throws (context-dependent pseudo-classes etc.). */\nfunction matchesSelector(el: Element, compound: string): boolean {\n    try {\n        return el.matches(compound);\n    } catch {\n        return false;\n    }\n}\n\n/**\n * Parent in the composed (flat-ish) tree: crosses shadow boundaries towards\n * the host, and stops at the boundary the search was scoped to.\n * Matches the original library's findParentOrHost semantics.\n */\nfunction composedParent(el: Element, boundary: QueryableNode): Element | null {\n    if (el === boundary) return null;\n    const parent = el.parentElement;\n    if (parent) return parent;\n    const rootNode = el.getRootNode();\n    if (rootNode === el || rootNode === boundary) return null;\n    if (isHostedFragment(rootNode)) return rootNode.host;\n    return null;\n}\n\n/**\n * Verify that `el` (already known to match the right-most compound) satisfies\n * the whole selector path, walking the composed tree right-to-left.\n * `tokens` looks like: [compound, combinator, compound, ...].\n */\nfunction matchesComposedPath(el: Element, tokens: string[], boundary: QueryableNode): boolean {\n    let node: Element | null = el;\n    let i = tokens.length - 1;\n\n    while (i > 0 && node) {\n        const combinator = tokens[i - 1];\n        const compound = tokens[i - 2];\n\n        if (combinator === '>') {\n            node = composedParent(node, boundary);\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '+') {\n            node = node.previousElementSibling;\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '~') {\n            node = node.previousElementSibling;\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = node.previousElementSibling;\n            }\n            if (!found) return false;\n        } else {\n            // descendant combinator\n            node = composedParent(node, boundary);\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = composedParent(node, boundary);\n            }\n            if (!found) return false;\n        }\n        i -= 2;\n    }\n    return i <= 0;\n}\n\n/**\n * All queryable roots below (and including) `root`: the root itself plus every\n * open shadow root found underneath, in discovery order. Computed fresh on\n * every call — never cached, so dynamic DOMs are always correct.\n */\nfunction collectRoots(root: QueryableNode): QueryableNode[] {\n    const roots: QueryableNode[] = [root];\n    const pending: QueryableNode[] = [];\n\n    if (isElementNode(root) && root.shadowRoot) {\n        roots.push(root.shadowRoot);\n        pending.push(root.shadowRoot);\n    }\n\n    let scope: QueryableNode | undefined = root;\n    while (scope) {\n        const all = scope.querySelectorAll('*');\n        for (let i = 0; i < all.length; i++) {\n            const shadowRoot = (all[i] as Element).shadowRoot;\n            if (shadowRoot) {\n                roots.push(shadowRoot);\n                pending.push(shadowRoot);\n            }\n        }\n        scope = pending.pop();\n    }\n    return roots;\n}\n\n/**\n * Collect every element under `root` in the original library's order\n * (composed tree pre-order: a host's shadow content comes immediately after\n * the host element). One native `querySelectorAll('*')` per root — the\n * browser does the walking.\n */\nfunction collectAllElements(root: QueryableNode, filter?: string): Element[] {\n    const out: Element[] = [];\n    collectInto(root, out, filter);\n    return out;\n}\n\nfunction collectInto(scope: QueryableNode, out: Element[], filter?: string): void {\n    // A root element's own shadow content is listed first (original behavior).\n    if (isElementNode(scope) && scope.shadowRoot) {\n        collectList(scope.shadowRoot.querySelectorAll('*'), out, filter);\n    }\n    collectList(scope.querySelectorAll('*'), out, filter);\n}\n\nfunction collectList(list: NodeListOf<Element>, out: Element[], filter?: string): void {\n    for (let i = 0; i < list.length; i++) {\n        const el = list[i];\n        if (!filter || matchesSelector(el, filter)) {\n            out.push(el);\n        }\n        const shadowRoot = el.shadowRoot;\n        if (shadowRoot) {\n            collectList(shadowRoot.querySelectorAll('*'), out, filter);\n        }\n    }\n}\n\n/**\n * Generator variant of the same traversal, for callers that can stop early.\n */\nfunction* iterateDeep(root: QueryableNode): Generator<Element, void, undefined> {\n    const stack: Element[] = [];\n    const pushChildren = (scope: QueryableNode) => {\n        const kids = scope.children;\n        for (let i = kids.length - 1; i >= 0; i--) stack.push(kids[i]);\n    };\n\n    if (isElementNode(root)) {\n        pushChildren(root);\n        if (root.shadowRoot) pushChildren(root.shadowRoot);\n    } else {\n        pushChildren(root);\n    }\n\n    while (stack.length > 0) {\n        const el = stack.pop()!;\n        yield el;\n        pushChildren(el);\n        if (el.shadowRoot) pushChildren(el.shadowRoot);\n    }\n}\n\nconst PARSE_CACHE_LIMIT = 512;\nconst parseCache = new Map<string, string[][]>();\n\n/** Split into comma-separated parts, each tokenized as [compound, combinator, ...]. Memoized. */\nfunction parseSelector(selector: string): string[][] {\n    const cached = parseCache.get(selector);\n    if (cached) return cached;\n\n    const parts: string[][] = [];\n    for (const part of splitByComma(selector)) {\n        const tokens = tokenizePath(part);\n        if (tokens.length > 0) parts.push(tokens);\n    }\n\n    if (parseCache.size >= PARSE_CACHE_LIMIT) parseCache.clear();\n    parseCache.set(selector, parts);\n    return parts;\n}\n\n/**\n * Candidates for one tokenized selector part: elements matching the\n * right-most compound, natively pre-filtered inside each root.\n * Returns the candidates either as a single ordered list (when only one root\n * produced hits) or as a Set plus a flag that a composed-order walk is needed.\n */\nfunction collectCandidates<T extends Element>(\n    roots: QueryableNode[],\n    rightMostCompound: string,\n): { list: T[] | null; set: Set<T> | null; rootsWithHits: number } {\n    let list: T[] | null = null;\n    let set: Set<T> | null = null;\n    let rootsWithHits = 0;\n\n    for (const root of roots) {\n        let found: NodeListOf<T>;\n        try {\n            found = root.querySelectorAll<T>(rightMostCompound);\n        } catch {\n            continue; // selector not valid in this root's context\n        }\n        if (found.length === 0) continue;\n        rootsWithHits++;\n        if (!list) {\n            list = Array.from(found);\n        } else {\n            if (!set) set = new Set(list);\n            for (let i = 0; i < found.length; i++) set.add(found[i]);\n        }\n    }\n    return { list, set, rootsWithHits };\n}\n\n/**\n * Finds the first matching element on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library.\n */\nexport function querySelectorDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T | null {\n    if (!selector || !selector.trim()) return null;\n\n    // Native fast path — identical to the original library: a plain\n    // light-DOM match always wins, no matter what lives in shadow roots.\n    const lightElement = root.querySelector<T>(selector);\n    if (lightElement) return lightElement;\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return null;\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (\n                    matchesSelector(el, last) &&\n                    (tokens.length === 1 || matchesComposedPath(el, tokens, root))\n                ) {\n                    return el as T;\n                }\n            }\n        }\n        return null;\n    }\n\n    const roots = collectRoots(root);\n    if (roots.length === 1) return null; // no shadow roots; native query already failed\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        const verified = (el: T): boolean =>\n            tokens.length === 1 || matchesComposedPath(el, tokens, root);\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → that root's native order is composed order.\n            for (const el of list) {\n                if (verified(el)) return el;\n            }\n        } else {\n            const candidates = set ?? new Set(list);\n            for (const el of iterateDeep(root)) {\n                if (candidates.has(el as T) && verified(el as T)) return el as T;\n            }\n        }\n    }\n    return null;\n}\n\n/**\n * Finds all matching elements on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library\n * (results are additionally de-duplicated).\n */\nexport function querySelectorAllDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T[] {\n    if (!selector || !selector.trim()) return [];\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return [];\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        const out: T[] = [];\n        const seen = new Set<Element>();\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (seen.has(el) || !matchesSelector(el, last)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    out.push(el as T);\n                }\n            }\n        }\n        return out;\n    }\n\n    const roots = collectRoots(root);\n\n    // No shadow roots below `root` → hand everything to the browser.\n    if (roots.length === 1) {\n        return Array.from(root.querySelectorAll<T>(selector));\n    }\n\n    const results: T[] = [];\n    const seen = new Set<T>();\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → its native order is composed order.\n            for (const el of list) {\n                if (seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        } else {\n            // Candidates spread across roots → merge in composed tree order.\n            const candidates = set ?? new Set(list);\n            const all = collectAllElements(root);\n            for (let i = 0; i < all.length; i++) {\n                const el = all[i] as T;\n                if (!candidates.has(el) || seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        }\n    }\n    return results;\n}\n\n/**\n * Finds all elements on the page, inclusive of those within shadow roots.\n * Optionally filtered by a CSS selector.\n * Same signature and semantics as the original library.\n */\nexport function collectAllElementsDeep<T extends Element = HTMLElement>(\n    selector: string | null = null,\n    root: QueryableNode = document,\n    cachedElements: Element[] | null = null,\n): T[] {\n    if (cachedElements) {\n        const all = cachedElements as T[];\n        return selector ? all.filter((el) => matchesSelector(el, selector)) : all;\n    }\n\n    // Single pass: elements are filtered while the tree is being walked.\n    return collectAllElements(root, selector ?? undefined) as T[];\n}\n\n/**\n * Split a selector list on top-level commas (ignores commas inside quotes,\n * attribute brackets and pseudo-class parentheses).\n */\nexport function splitByComma(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const results: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n            else if (char === ',' && parenDepth === 0 && bracketDepth === 0) {\n                results.push(current.trim());\n                current = '';\n                continue;\n            }\n        }\n\n        current += char;\n    }\n\n    if (current.trim()) {\n        results.push(current.trim());\n    }\n\n    return results;\n}\n\n/**\n * Tokenize a CSS selector into compounds and combinators:\n * 'div > p span' → ['div', '>', 'p', ' ', 'span'].\n */\nexport function tokenizePath(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const tokens: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    const pushCurrent = () => {\n        const trimmed = current.trim();\n        if (trimmed) {\n            tokens.push(trimmed);\n        }\n        current = '';\n    };\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n\n            if (parenDepth === 0 && bracketDepth === 0) {\n                if (char === '>' || char === '+' || char === '~') {\n                    pushCurrent();\n                    tokens.push(char);\n                    continue;\n                }\n\n                if (/\\s/.test(char)) {\n                    pushCurrent();\n\n                    while (i + 1 < selector.length && /\\s/.test(selector[i + 1])) {\n                        i++;\n                    }\n\n                    let nextChar = '';\n                    for (let j = i + 1; j < selector.length; j++) {\n                        if (!/\\s/.test(selector[j])) {\n                            nextChar = selector[j];\n                            break;\n                        }\n                    }\n\n                    const lastToken = tokens[tokens.length - 1];\n                    const isLastCombinator =\n                        lastToken === ' ' || lastToken === '>' || lastToken === '+' || lastToken === '~';\n\n                    if (\n                        tokens.length > 0 &&\n                        !isLastCombinator &&\n                        nextChar &&\n                        nextChar !== '>' &&\n                        nextChar !== '+' &&\n                        nextChar !== '~'\n                    ) {\n                        tokens.push(' ');\n                    }\n                    continue;\n                }\n            }\n        }\n\n        current += char;\n    }\n\n    pushCurrent();\n\n    return tokens;\n}\n"],"names":[],"mappings":";;;;;;IAAA;;;;;;;;;;;;;;;;;;;IAmBG;IAIH,MAAM,YAAY,GAAG,CAAC;IACtB,MAAM,sBAAsB,GAAG,EAAE;IAEjC;IACA,SAAS,aAAa,CAAC,IAAa,EAAA;QAChC,OAAO,CAAC,CAAC,IAAI,IAAK,IAAa,CAAC,QAAQ,KAAK,YAAY;IAC7D;IAEA;IACA,SAAS,gBAAgB,CAAC,IAAa,EAAA;QACnC,QACI,CAAC,CAAC,IAAI;YACL,IAAa,CAAC,QAAQ,KAAK,sBAAsB;IAClD,QAAA,CAAC,CAAE,IAAmB,CAAC,IAAI;IAEnC;IAEA;IACA,SAAS,eAAe,CAAC,EAAW,EAAE,QAAgB,EAAA;IAClD,IAAA,IAAI;IACA,QAAA,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC/B;IAAE,IAAA,MAAM;IACJ,QAAA,OAAO,KAAK;QAChB;IACJ;IAEA;;;;IAIG;IACH,SAAS,cAAc,CAAC,EAAW,EAAE,QAAuB,EAAA;QACxD,IAAI,EAAE,KAAK,QAAQ;IAAE,QAAA,OAAO,IAAI;IAChC,IAAA,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa;IAC/B,IAAA,IAAI,MAAM;IAAE,QAAA,OAAO,MAAM;IACzB,IAAA,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE;IACjC,IAAA,IAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,KAAK,QAAQ;IAAE,QAAA,OAAO,IAAI;QACzD,IAAI,gBAAgB,CAAC,QAAQ,CAAC;YAAE,OAAO,QAAQ,CAAC,IAAI;IACpD,IAAA,OAAO,IAAI;IACf;IAEA;;;;IAIG;IACH,SAAS,mBAAmB,CAAC,EAAW,EAAE,MAAgB,EAAE,QAAuB,EAAA;QAC/E,IAAI,IAAI,GAAmB,EAAE;IAC7B,IAAA,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC;IAEzB,IAAA,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;YAClB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;IAE9B,QAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IACpB,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACrC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAE,gBAAA,OAAO,KAAK;YAC/D;IAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBAClC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAE,gBAAA,OAAO,KAAK;YAC/D;IAAO,aAAA,IAAI,UAAU,KAAK,GAAG,EAAE;IAC3B,YAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBAClC,IAAI,KAAK,GAAG,KAAK;gBACjB,OAAO,IAAI,EAAE;IACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;wBACjC,KAAK,GAAG,IAAI;wBACZ;oBACJ;IACA,gBAAA,IAAI,GAAG,IAAI,CAAC,sBAAsB;gBACtC;IACA,YAAA,IAAI,CAAC,KAAK;IAAE,gBAAA,OAAO,KAAK;YAC5B;iBAAO;;IAEH,YAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACrC,IAAI,KAAK,GAAG,KAAK;gBACjB,OAAO,IAAI,EAAE;IACT,gBAAA,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE;wBACjC,KAAK,GAAG,IAAI;wBACZ;oBACJ;IACA,gBAAA,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;gBACzC;IACA,YAAA,IAAI,CAAC,KAAK;IAAE,gBAAA,OAAO,KAAK;YAC5B;YACA,CAAC,IAAI,CAAC;QACV;QACA,OAAO,CAAC,IAAI,CAAC;IACjB;IAEA;;;;IAIG;IACH,SAAS,YAAY,CAAC,IAAmB,EAAA;IACrC,IAAA,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC;QACrC,MAAM,OAAO,GAAoB,EAAE;QAEnC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE;IACxC,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC3B,QAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;QACjC;QAEA,IAAI,KAAK,GAA8B,IAAI;QAC3C,OAAO,KAAK,EAAE;YACV,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC;IACvC,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,MAAM,UAAU,GAAI,GAAG,CAAC,CAAC,CAAa,CAAC,UAAU;gBACjD,IAAI,UAAU,EAAE;IACZ,gBAAA,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;IACtB,gBAAA,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC;gBAC5B;YACJ;IACA,QAAA,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE;QACzB;IACA,IAAA,OAAO,KAAK;IAChB;IAEA;;;;;IAKG;IACH,SAAS,kBAAkB,CAAC,IAAmB,EAAE,MAAe,EAAA;QAC5D,MAAM,GAAG,GAAc,EAAE;IACzB,IAAA,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC;IAC9B,IAAA,OAAO,GAAG;IACd;IAEA,SAAS,WAAW,CAAC,KAAoB,EAAE,GAAc,EAAE,MAAe,EAAA;;QAEtE,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE;IAC1C,QAAA,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;QACpE;IACA,IAAA,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;IACzD;IAEA,SAAS,WAAW,CAAC,IAAyB,EAAE,GAAc,EAAE,MAAe,EAAA;IAC3E,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IAClC,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;IACxC,YAAA,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAChB;IACA,QAAA,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU;YAChC,IAAI,UAAU,EAAE;IACZ,YAAA,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC;YAC9D;QACJ;IACJ;IAEA;;IAEG;IACH,UAAU,WAAW,CAAC,IAAmB,EAAA;QACrC,MAAM,KAAK,GAAc,EAAE;IAC3B,IAAA,MAAM,YAAY,GAAG,CAAC,KAAoB,KAAI;IAC1C,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ;IAC3B,QAAA,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClE,IAAA,CAAC;IAED,IAAA,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;YACrB,YAAY,CAAC,IAAI,CAAC;YAClB,IAAI,IAAI,CAAC,UAAU;IAAE,YAAA,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;QACtD;aAAO;YACH,YAAY,CAAC,IAAI,CAAC;QACtB;IAEA,IAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;IACrB,QAAA,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG;IACvB,QAAA,MAAM,EAAE;YACR,YAAY,CAAC,EAAE,CAAC;YAChB,IAAI,EAAE,CAAC,UAAU;IAAE,YAAA,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC;QAClD;IACJ;IAEA,MAAM,iBAAiB,GAAG,GAAG;IAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB;IAEhD;IACA,SAAS,aAAa,CAAC,QAAgB,EAAA;QACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC;IACvC,IAAA,IAAI,MAAM;IAAE,QAAA,OAAO,MAAM;QAEzB,MAAM,KAAK,GAAe,EAAE;QAC5B,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE;IACvC,QAAA,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,QAAA,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;IAAE,YAAA,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7C;IAEA,IAAA,IAAI,UAAU,CAAC,IAAI,IAAI,iBAAiB;YAAE,UAAU,CAAC,KAAK,EAAE;IAC5D,IAAA,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC;IAC/B,IAAA,OAAO,KAAK;IAChB;IAEA;;;;;IAKG;IACH,SAAS,iBAAiB,CACtB,KAAsB,EACtB,iBAAyB,EAAA;QAEzB,IAAI,IAAI,GAAe,IAAI;QAC3B,IAAI,GAAG,GAAkB,IAAI;QAC7B,IAAI,aAAa,GAAG,CAAC;IAErB,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;IACtB,QAAA,IAAI,KAAoB;IACxB,QAAA,IAAI;IACA,YAAA,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAI,iBAAiB,CAAC;YACvD;IAAE,QAAA,MAAM;IACJ,YAAA,SAAS;YACb;IACA,QAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE;IACxB,QAAA,aAAa,EAAE;YACf,IAAI,CAAC,IAAI,EAAE;IACP,YAAA,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5B;iBAAO;IACH,YAAA,IAAI,CAAC,GAAG;IAAE,gBAAA,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;IAC7B,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5D;QACJ;IACA,IAAA,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE;IACvC;IAEA;;;IAGG;IACG,SAAU,iBAAiB,CAC7B,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;IAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,IAAI;;;QAI9C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAI,QAAQ,CAAC;IACpD,IAAA,IAAI,YAAY;IAAE,QAAA,OAAO,YAAY;IAErC,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;IACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;IAAE,QAAA,OAAO,IAAI;;QAGnC,IAAI,WAAW,EAAE;IACb,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;gBACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;IAC1B,gBAAA,IACI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;IACzB,qBAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAChE;IACE,oBAAA,OAAO,EAAO;oBAClB;gBACJ;YACJ;IACA,QAAA,OAAO,IAAI;QACf;IAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IAChC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IAEpC,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;IACtE,QAAA,IAAI,CAAC,IAAI;gBAAE;YAEX,MAAM,QAAQ,GAAG,CAAC,EAAK,KACnB,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC;IAEhE,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;IAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;oBACnB,IAAI,QAAQ,CAAC,EAAE,CAAC;IAAE,oBAAA,OAAO,EAAE;gBAC/B;YACJ;iBAAO;gBACH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;gBACvC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE;oBAChC,IAAI,UAAU,CAAC,GAAG,CAAC,EAAO,CAAC,IAAI,QAAQ,CAAC,EAAO,CAAC;IAAE,oBAAA,OAAO,EAAO;gBACpE;YACJ;QACJ;IACA,IAAA,OAAO,IAAI;IACf;IAEA;;;;IAIG;IACG,SAAU,oBAAoB,CAChC,QAAgB,EAChB,IAAA,GAAsB,QAAQ,EAC9B,WAAA,GAAgC,IAAI,EAAA;IAEpC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;IAE5C,IAAA,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC;IACrC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;IAAE,QAAA,OAAO,EAAE;;QAGjC,IAAI,WAAW,EAAE;YACb,MAAM,GAAG,GAAQ,EAAE;IACnB,QAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW;IAC/B,QAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;gBACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,YAAA,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;IAC1B,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;wBAAE;IAChD,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,GAAG,CAAC,IAAI,CAAC,EAAO,CAAC;oBACrB;gBACJ;YACJ;IACA,QAAA,OAAO,GAAG;QACd;IAEA,IAAA,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;;IAGhC,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;YACpB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAI,QAAQ,CAAC,CAAC;QACzD;QAEA,MAAM,OAAO,GAAQ,EAAE;IACvB,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK;IAEzB,IAAA,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,QAAA,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC;IACtE,QAAA,IAAI,CAAC,IAAI;gBAAE;IAEX,QAAA,IAAI,aAAa,KAAK,CAAC,EAAE;;IAErB,YAAA,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE;IACnB,gBAAA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAE;IAClB,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB;gBACJ;YACJ;iBAAO;;gBAEH,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;IACvC,YAAA,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC;IACpC,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACjC,gBAAA,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAM;IACtB,gBAAA,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;wBAAE;IACzC,gBAAA,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAC9D,oBAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IACZ,oBAAA,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpB;gBACJ;YACJ;QACJ;IACA,IAAA,OAAO,OAAO;IAClB;IAEA;;;;IAIG;IACG,SAAU,sBAAsB,CAClC,QAAA,GAA0B,IAAI,EAC9B,IAAA,GAAsB,QAAQ,EAC9B,cAAA,GAAmC,IAAI,EAAA;QAEvC,IAAI,cAAc,EAAE;YAChB,MAAM,GAAG,GAAG,cAAqB;YACjC,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,GAAG;QAC7E;;QAGA,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAQ;IACjE;IAEA;;;IAGG;IACG,SAAU,YAAY,CAAC,QAAgB,EAAA;IACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;QAE5C,MAAM,OAAO,GAAa,EAAE;QAC5B,IAAI,OAAO,GAAG,EAAE;QAChB,IAAI,UAAU,GAAG,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC;QACpB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,OAAO,GAAG,KAAK;IAEnB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;YAExB,IAAI,OAAO,EAAE;gBACT,OAAO,IAAI,IAAI;gBACf,OAAO,GAAG,KAAK;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;gBACf,OAAO,GAAG,IAAI;gBACd,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;gBAClC,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,UAAU,EAAE;qBACzB,IAAI,IAAI,KAAK,GAAG;oBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;qBAC1D,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,YAAY,EAAE;qBAChC,IAAI,IAAI,KAAK,GAAG;oBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;IAC9D,iBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;oBAC7D,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;oBAC5B,OAAO,GAAG,EAAE;oBACZ;gBACJ;YACJ;YAEA,OAAO,IAAI,IAAI;QACnB;IAEA,IAAA,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE;YAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAChC;IAEA,IAAA,OAAO,OAAO;IAClB;IAEA;;;IAGG;IACG,SAAU,YAAY,CAAC,QAAgB,EAAA;IACzC,IAAA,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;IAAE,QAAA,OAAO,EAAE;QAE5C,MAAM,MAAM,GAAa,EAAE;QAC3B,IAAI,OAAO,GAAG,EAAE;QAChB,IAAI,UAAU,GAAG,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC;QACpB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,aAAa,GAAG,KAAK;QACzB,IAAI,OAAO,GAAG,KAAK;QAEnB,MAAM,WAAW,GAAG,MAAK;IACrB,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE;YAC9B,IAAI,OAAO,EAAE;IACT,YAAA,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;YACxB;YACA,OAAO,GAAG,EAAE;IAChB,IAAA,CAAC;IAED,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;IACtC,QAAA,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;YAExB,IAAI,OAAO,EAAE;gBACT,OAAO,IAAI,IAAI;gBACf,OAAO,GAAG,KAAK;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,IAAI,EAAE;gBACf,OAAO,GAAG,IAAI;gBACd,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE;gBAChC,aAAa,GAAG,CAAC,aAAa;gBAC9B,OAAO,IAAI,IAAI;gBACf;YACJ;IAEA,QAAA,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE;gBAClC,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,UAAU,EAAE;qBACzB,IAAI,IAAI,KAAK,GAAG;oBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;qBAC1D,IAAI,IAAI,KAAK,GAAG;IAAE,gBAAA,YAAY,EAAE;qBAChC,IAAI,IAAI,KAAK,GAAG;oBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;gBAEnE,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE;IACxC,gBAAA,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE;IAC9C,oBAAA,WAAW,EAAE;IACb,oBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;wBACjB;oBACJ;IAEA,gBAAA,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;IACjB,oBAAA,WAAW,EAAE;wBAEb,OAAO,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;IAC1D,wBAAA,CAAC,EAAE;wBACP;wBAEA,IAAI,QAAQ,GAAG,EAAE;IACjB,oBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;IACzB,4BAAA,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC;gCACtB;4BACJ;wBACJ;wBAEA,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,oBAAA,MAAM,gBAAgB,GAClB,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG;IAEpF,oBAAA,IACI,MAAM,CAAC,MAAM,GAAG,CAAC;IACjB,wBAAA,CAAC,gBAAgB;4BACjB,QAAQ;IACR,wBAAA,QAAQ,KAAK,GAAG;IAChB,wBAAA,QAAQ,KAAK,GAAG;4BAChB,QAAQ,KAAK,GAAG,EAClB;IACE,wBAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;wBACpB;wBACA;oBACJ;gBACJ;YACJ;YAEA,OAAO,IAAI,IAAI;QACnB;IAEA,IAAA,WAAW,EAAE;IAEb,IAAA,OAAO,MAAM;IACjB;;;;;;;;"}

package/dist/umd/index.min.js

@@ -0,0 +1,2 @@
+"use strict";(function(d,E){typeof exports=="object"&&typeof module<"u"?E(exports):typeof define=="function"&&define.amd?define(["exports"],E):(d=typeof globalThis<"u"?globalThis:d||self,E(d.querySelectorShadowDom={}))})(void 0,(function(d){"use strict";function D(e){return!!e&&e.nodeType===1}function b(e){return!!e&&e.nodeType===11&&!!e.host}function p(e,o){try{return e.matches(o)}catch{return!1}}function R(e,o){if(e===o)return null;const n=e.parentElement;if(n)return n;const t=e.getRootNode();return t===e||t===o?null:b(t)?t.host:null}function w(e,o,n){let t=e,i=o.length-1;for(;i>0&&t;){const f=o[i-1],l=o[i-2];if(f===">"){if(t=R(t,n),!t||!p(t,l))return!1}else if(f==="+"){if(t=t.previousElementSibling,!t||!p(t,l))return!1}else if(f==="~"){t=t.previousElementSibling;let u=!1;for(;t;){if(p(t,l)){u=!0;break}t=t.previousElementSibling}if(!u)return!1}else{t=R(t,n);let u=!1;for(;t;){if(p(t,l)){u=!0;break}t=R(t,n)}if(!u)return!1}i-=2}return i<=0}function k(e){const o=[e],n=[];D(e)&&e.shadowRoot&&(o.push(e.shadowRoot),n.push(e.shadowRoot));let t=e;for(;t;){const i=t.querySelectorAll("*");for(let f=0;f<i.length;f++){const l=i[f].shadowRoot;l&&(o.push(l),n.push(l))}t=n.pop()}return o}function C(e,o){const n=[];return _(e,n,o),n}function _(e,o,n){D(e)&&e.shadowRoot&&A(e.shadowRoot.querySelectorAll("*"),o,n),A(e.querySelectorAll("*"),o,n)}function A(e,o,n){for(let t=0;t<e.length;t++){const i=e[t];(!n||p(i,n))&&o.push(i);const f=i.shadowRoot;f&&A(f.querySelectorAll("*"),o,n)}}function*O(e){const o=[],n=t=>{const i=t.children;for(let f=i.length-1;f>=0;f--)o.push(i[f])};for(D(e)?(n(e),e.shadowRoot&&n(e.shadowRoot)):n(e);o.length>0;){const t=o.pop();yield t,n(t),t.shadowRoot&&n(t.shadowRoot)}}const H=512,y=new Map;function N(e){const o=y.get(e);if(o)return o;const n=[];for(const t of M(e)){const i=T(t);i.length>0&&n.push(i)}return y.size>=H&&y.clear(),y.set(e,n),n}function q(e,o){let n=null,t=null,i=0;for(const f of e){let l;try{l=f.querySelectorAll(o)}catch{continue}if(l.length!==0)if(i++,!n)n=Array.from(l);else{t||(t=new Set(n));for(let u=0;u<l.length;u++)t.add(l[u])}}return{list:n,set:t,rootsWithHits:i}}function L(e,o=document,n=null){if(!e||!e.trim())return null;const t=o.querySelector(e);if(t)return t;const i=N(e);if(i.length===0)return null;if(n){for(const l of i){const u=l[l.length-1];for(const c of n)if(p(c,u)&&(l.length===1||w(c,l,o)))return c}return null}const f=k(o);if(f.length===1)return null;for(const l of i){const u=l[l.length-1],{list:c,set:s,rootsWithHits:r}=q(f,u);if(!c)continue;const a=h=>l.length===1||w(h,l,o);if(r===1){for(const h of c)if(a(h))return h}else{const h=s??new Set(c);for(const m of O(o))if(h.has(m)&&a(m))return m}}return null}function P(e,o=document,n=null){if(!e||!e.trim())return[];const t=N(e);if(t.length===0)return[];if(n){const u=[],c=new Set;for(const s of t){const r=s[s.length-1];for(const a of n)c.has(a)||!p(a,r)||(s.length===1||w(a,s,o))&&(c.add(a),u.push(a))}return u}const i=k(o);if(i.length===1)return Array.from(o.querySelectorAll(e));const f=[],l=new Set;for(const u of t){const c=u[u.length-1],{list:s,set:r,rootsWithHits:a}=q(i,c);if(s)if(a===1)for(const h of s)l.has(h)||(u.length===1||w(h,u,o))&&(l.add(h),f.push(h));else{const h=r??new Set(s),m=C(o);for(let g=0;g<m.length;g++){const S=m[g];!h.has(S)||l.has(S)||(u.length===1||w(S,u,o))&&(l.add(S),f.push(S))}}}return f}function v(e=null,o=document,n=null){if(n){const t=n;return e?t.filter(i=>p(i,e)):t}return C(o,e??void 0)}function M(e){if(!e||!e.trim())return[];const o=[];let n="",t=0,i=0,f=!1,l=!1,u=!1;for(let c=0;c<e.length;c++){const s=e[c];if(u){n+=s,u=!1;continue}if(s==="\\"){u=!0,n+=s;continue}if(s==="'"&&!l){f=!f,n+=s;continue}if(s==='"'&&!f){l=!l,n+=s;continue}if(!f&&!l){if(s==="(")t++;else if(s===")")t=Math.max(0,t-1);else if(s==="[")i++;else if(s==="]")i=Math.max(0,i-1);else if(s===","&&t===0&&i===0){o.push(n.trim()),n="";continue}}n+=s}return n.trim()&&o.push(n.trim()),o}function T(e){if(!e||!e.trim())return[];const o=[];let n="",t=0,i=0,f=!1,l=!1,u=!1;const c=()=>{const s=n.trim();s&&o.push(s),n=""};for(let s=0;s<e.length;s++){const r=e[s];if(u){n+=r,u=!1;continue}if(r==="\\"){u=!0,n+=r;continue}if(r==="'"&&!l){f=!f,n+=r;continue}if(r==='"'&&!f){l=!l,n+=r;continue}if(!f&&!l&&(r==="("?t++:r===")"?t=Math.max(0,t-1):r==="["?i++:r==="]"&&(i=Math.max(0,i-1)),t===0&&i===0)){if(r===">"||r==="+"||r==="~"){c(),o.push(r);continue}if(/\s/.test(r)){for(c();s+1<e.length&&/\s/.test(e[s+1]);)s++;let a="";for(let g=s+1;g<e.length;g++)if(!/\s/.test(e[g])){a=e[g];break}const h=o[o.length-1],m=h===" "||h===">"||h==="+"||h==="~";o.length>0&&!m&&a&&a!==">"&&a!=="+"&&a!=="~"&&o.push(" ");continue}}n+=r}return c(),o}d.collectAllElementsDeep=v,d.querySelectorAllDeep=P,d.querySelectorDeep=L,d.splitByComma=M,d.tokenizePath=T}));
+//# sourceMappingURL=index.min.js.map

package/dist/umd/index.min.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/index.ts"],
+  "sourcesContent": ["/**\n * query-selector-shadow-dom-modern\n *\n * Drop-in replacement for https://www.npmjs.com/package/query-selector-shadow-dom\n * with the same public API:\n *\n *   - querySelectorDeep(selector, root?, allElements?)\n *   - querySelectorAllDeep(selector, root?, allElements?)\n *   - collectAllElementsDeep(selector?, root?, cachedElements?)\n *\n * but faster and safer:\n *   - Native `querySelector(All)` does the heavy lifting whenever possible\n *     (whole-selector fast path when no shadow roots are involved, and a\n *     per-root pre-filter on the right-most compound selector otherwise).\n *   - Selector parsing is memoized (strings are immutable — safe to cache).\n *   - No DOM caching: results are always computed from the live tree, so\n *     dynamic pages never see stale data.\n *   - Full combinator support across shadow boundaries: ` `, `>`, `+`, `~`.\n *   - Cross-realm safe (iframe documents): no `instanceof` on DOM classes.\n */\n\nexport type QueryableNode = Document | DocumentFragment | Element;\n\nconst ELEMENT_NODE = 1;\nconst DOCUMENT_FRAGMENT_NODE = 11;\n\n/** Cross-realm-safe Element check (`instanceof` fails across frames). */\nfunction isElementNode(node: unknown): node is Element {\n    return !!node && (node as Node).nodeType === ELEMENT_NODE;\n}\n\n/** Cross-realm-safe ShadowRoot check. */\nfunction isHostedFragment(node: unknown): node is ShadowRoot {\n    return (\n        !!node &&\n        (node as Node).nodeType === DOCUMENT_FRAGMENT_NODE &&\n        !!(node as ShadowRoot).host\n    );\n}\n\n/** `el.matches()` that never throws (context-dependent pseudo-classes etc.). */\nfunction matchesSelector(el: Element, compound: string): boolean {\n    try {\n        return el.matches(compound);\n    } catch {\n        return false;\n    }\n}\n\n/**\n * Parent in the composed (flat-ish) tree: crosses shadow boundaries towards\n * the host, and stops at the boundary the search was scoped to.\n * Matches the original library's findParentOrHost semantics.\n */\nfunction composedParent(el: Element, boundary: QueryableNode): Element | null {\n    if (el === boundary) return null;\n    const parent = el.parentElement;\n    if (parent) return parent;\n    const rootNode = el.getRootNode();\n    if (rootNode === el || rootNode === boundary) return null;\n    if (isHostedFragment(rootNode)) return rootNode.host;\n    return null;\n}\n\n/**\n * Verify that `el` (already known to match the right-most compound) satisfies\n * the whole selector path, walking the composed tree right-to-left.\n * `tokens` looks like: [compound, combinator, compound, ...].\n */\nfunction matchesComposedPath(el: Element, tokens: string[], boundary: QueryableNode): boolean {\n    let node: Element | null = el;\n    let i = tokens.length - 1;\n\n    while (i > 0 && node) {\n        const combinator = tokens[i - 1];\n        const compound = tokens[i - 2];\n\n        if (combinator === '>') {\n            node = composedParent(node, boundary);\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '+') {\n            node = node.previousElementSibling;\n            if (!node || !matchesSelector(node, compound)) return false;\n        } else if (combinator === '~') {\n            node = node.previousElementSibling;\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = node.previousElementSibling;\n            }\n            if (!found) return false;\n        } else {\n            // descendant combinator\n            node = composedParent(node, boundary);\n            let found = false;\n            while (node) {\n                if (matchesSelector(node, compound)) {\n                    found = true;\n                    break;\n                }\n                node = composedParent(node, boundary);\n            }\n            if (!found) return false;\n        }\n        i -= 2;\n    }\n    return i <= 0;\n}\n\n/**\n * All queryable roots below (and including) `root`: the root itself plus every\n * open shadow root found underneath, in discovery order. Computed fresh on\n * every call — never cached, so dynamic DOMs are always correct.\n */\nfunction collectRoots(root: QueryableNode): QueryableNode[] {\n    const roots: QueryableNode[] = [root];\n    const pending: QueryableNode[] = [];\n\n    if (isElementNode(root) && root.shadowRoot) {\n        roots.push(root.shadowRoot);\n        pending.push(root.shadowRoot);\n    }\n\n    let scope: QueryableNode | undefined = root;\n    while (scope) {\n        const all = scope.querySelectorAll('*');\n        for (let i = 0; i < all.length; i++) {\n            const shadowRoot = (all[i] as Element).shadowRoot;\n            if (shadowRoot) {\n                roots.push(shadowRoot);\n                pending.push(shadowRoot);\n            }\n        }\n        scope = pending.pop();\n    }\n    return roots;\n}\n\n/**\n * Collect every element under `root` in the original library's order\n * (composed tree pre-order: a host's shadow content comes immediately after\n * the host element). One native `querySelectorAll('*')` per root — the\n * browser does the walking.\n */\nfunction collectAllElements(root: QueryableNode, filter?: string): Element[] {\n    const out: Element[] = [];\n    collectInto(root, out, filter);\n    return out;\n}\n\nfunction collectInto(scope: QueryableNode, out: Element[], filter?: string): void {\n    // A root element's own shadow content is listed first (original behavior).\n    if (isElementNode(scope) && scope.shadowRoot) {\n        collectList(scope.shadowRoot.querySelectorAll('*'), out, filter);\n    }\n    collectList(scope.querySelectorAll('*'), out, filter);\n}\n\nfunction collectList(list: NodeListOf<Element>, out: Element[], filter?: string): void {\n    for (let i = 0; i < list.length; i++) {\n        const el = list[i];\n        if (!filter || matchesSelector(el, filter)) {\n            out.push(el);\n        }\n        const shadowRoot = el.shadowRoot;\n        if (shadowRoot) {\n            collectList(shadowRoot.querySelectorAll('*'), out, filter);\n        }\n    }\n}\n\n/**\n * Generator variant of the same traversal, for callers that can stop early.\n */\nfunction* iterateDeep(root: QueryableNode): Generator<Element, void, undefined> {\n    const stack: Element[] = [];\n    const pushChildren = (scope: QueryableNode) => {\n        const kids = scope.children;\n        for (let i = kids.length - 1; i >= 0; i--) stack.push(kids[i]);\n    };\n\n    if (isElementNode(root)) {\n        pushChildren(root);\n        if (root.shadowRoot) pushChildren(root.shadowRoot);\n    } else {\n        pushChildren(root);\n    }\n\n    while (stack.length > 0) {\n        const el = stack.pop()!;\n        yield el;\n        pushChildren(el);\n        if (el.shadowRoot) pushChildren(el.shadowRoot);\n    }\n}\n\nconst PARSE_CACHE_LIMIT = 512;\nconst parseCache = new Map<string, string[][]>();\n\n/** Split into comma-separated parts, each tokenized as [compound, combinator, ...]. Memoized. */\nfunction parseSelector(selector: string): string[][] {\n    const cached = parseCache.get(selector);\n    if (cached) return cached;\n\n    const parts: string[][] = [];\n    for (const part of splitByComma(selector)) {\n        const tokens = tokenizePath(part);\n        if (tokens.length > 0) parts.push(tokens);\n    }\n\n    if (parseCache.size >= PARSE_CACHE_LIMIT) parseCache.clear();\n    parseCache.set(selector, parts);\n    return parts;\n}\n\n/**\n * Candidates for one tokenized selector part: elements matching the\n * right-most compound, natively pre-filtered inside each root.\n * Returns the candidates either as a single ordered list (when only one root\n * produced hits) or as a Set plus a flag that a composed-order walk is needed.\n */\nfunction collectCandidates<T extends Element>(\n    roots: QueryableNode[],\n    rightMostCompound: string,\n): { list: T[] | null; set: Set<T> | null; rootsWithHits: number } {\n    let list: T[] | null = null;\n    let set: Set<T> | null = null;\n    let rootsWithHits = 0;\n\n    for (const root of roots) {\n        let found: NodeListOf<T>;\n        try {\n            found = root.querySelectorAll<T>(rightMostCompound);\n        } catch {\n            continue; // selector not valid in this root's context\n        }\n        if (found.length === 0) continue;\n        rootsWithHits++;\n        if (!list) {\n            list = Array.from(found);\n        } else {\n            if (!set) set = new Set(list);\n            for (let i = 0; i < found.length; i++) set.add(found[i]);\n        }\n    }\n    return { list, set, rootsWithHits };\n}\n\n/**\n * Finds the first matching element on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library.\n */\nexport function querySelectorDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T | null {\n    if (!selector || !selector.trim()) return null;\n\n    // Native fast path — identical to the original library: a plain\n    // light-DOM match always wins, no matter what lives in shadow roots.\n    const lightElement = root.querySelector<T>(selector);\n    if (lightElement) return lightElement;\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return null;\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (\n                    matchesSelector(el, last) &&\n                    (tokens.length === 1 || matchesComposedPath(el, tokens, root))\n                ) {\n                    return el as T;\n                }\n            }\n        }\n        return null;\n    }\n\n    const roots = collectRoots(root);\n    if (roots.length === 1) return null; // no shadow roots; native query already failed\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        const verified = (el: T): boolean =>\n            tokens.length === 1 || matchesComposedPath(el, tokens, root);\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → that root's native order is composed order.\n            for (const el of list) {\n                if (verified(el)) return el;\n            }\n        } else {\n            const candidates = set ?? new Set(list);\n            for (const el of iterateDeep(root)) {\n                if (candidates.has(el as T) && verified(el as T)) return el as T;\n            }\n        }\n    }\n    return null;\n}\n\n/**\n * Finds all matching elements on the page, piercing any number of nested\n * shadow roots. Same signature and semantics as the original library\n * (results are additionally de-duplicated).\n */\nexport function querySelectorAllDeep<T extends Element = HTMLElement>(\n    selector: string,\n    root: QueryableNode = document,\n    allElements: Element[] | null = null,\n): T[] {\n    if (!selector || !selector.trim()) return [];\n\n    const parts = parseSelector(selector);\n    if (parts.length === 0) return [];\n\n    // Caller-supplied element list (original API's third argument).\n    if (allElements) {\n        const out: T[] = [];\n        const seen = new Set<Element>();\n        for (const tokens of parts) {\n            const last = tokens[tokens.length - 1];\n            for (const el of allElements) {\n                if (seen.has(el) || !matchesSelector(el, last)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    out.push(el as T);\n                }\n            }\n        }\n        return out;\n    }\n\n    const roots = collectRoots(root);\n\n    // No shadow roots below `root` → hand everything to the browser.\n    if (roots.length === 1) {\n        return Array.from(root.querySelectorAll<T>(selector));\n    }\n\n    const results: T[] = [];\n    const seen = new Set<T>();\n\n    for (const tokens of parts) {\n        const last = tokens[tokens.length - 1];\n        const { list, set, rootsWithHits } = collectCandidates<T>(roots, last);\n        if (!list) continue;\n\n        if (rootsWithHits === 1) {\n            // All candidates live in a single root → its native order is composed order.\n            for (const el of list) {\n                if (seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        } else {\n            // Candidates spread across roots → merge in composed tree order.\n            const candidates = set ?? new Set(list);\n            const all = collectAllElements(root);\n            for (let i = 0; i < all.length; i++) {\n                const el = all[i] as T;\n                if (!candidates.has(el) || seen.has(el)) continue;\n                if (tokens.length === 1 || matchesComposedPath(el, tokens, root)) {\n                    seen.add(el);\n                    results.push(el);\n                }\n            }\n        }\n    }\n    return results;\n}\n\n/**\n * Finds all elements on the page, inclusive of those within shadow roots.\n * Optionally filtered by a CSS selector.\n * Same signature and semantics as the original library.\n */\nexport function collectAllElementsDeep<T extends Element = HTMLElement>(\n    selector: string | null = null,\n    root: QueryableNode = document,\n    cachedElements: Element[] | null = null,\n): T[] {\n    if (cachedElements) {\n        const all = cachedElements as T[];\n        return selector ? all.filter((el) => matchesSelector(el, selector)) : all;\n    }\n\n    // Single pass: elements are filtered while the tree is being walked.\n    return collectAllElements(root, selector ?? undefined) as T[];\n}\n\n/**\n * Split a selector list on top-level commas (ignores commas inside quotes,\n * attribute brackets and pseudo-class parentheses).\n */\nexport function splitByComma(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const results: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n            else if (char === ',' && parenDepth === 0 && bracketDepth === 0) {\n                results.push(current.trim());\n                current = '';\n                continue;\n            }\n        }\n\n        current += char;\n    }\n\n    if (current.trim()) {\n        results.push(current.trim());\n    }\n\n    return results;\n}\n\n/**\n * Tokenize a CSS selector into compounds and combinators:\n * 'div > p span' → ['div', '>', 'p', ' ', 'span'].\n */\nexport function tokenizePath(selector: string): string[] {\n    if (!selector || !selector.trim()) return [];\n\n    const tokens: string[] = [];\n    let current = '';\n    let parenDepth = 0;\n    let bracketDepth = 0;\n    let inSingleQuote = false;\n    let inDoubleQuote = false;\n    let escaped = false;\n\n    const pushCurrent = () => {\n        const trimmed = current.trim();\n        if (trimmed) {\n            tokens.push(trimmed);\n        }\n        current = '';\n    };\n\n    for (let i = 0; i < selector.length; i++) {\n        const char = selector[i];\n\n        if (escaped) {\n            current += char;\n            escaped = false;\n            continue;\n        }\n\n        if (char === '\\\\') {\n            escaped = true;\n            current += char;\n            continue;\n        }\n\n        if (char === \"'\" && !inDoubleQuote) {\n            inSingleQuote = !inSingleQuote;\n            current += char;\n            continue;\n        }\n\n        if (char === '\"' && !inSingleQuote) {\n            inDoubleQuote = !inDoubleQuote;\n            current += char;\n            continue;\n        }\n\n        if (!inSingleQuote && !inDoubleQuote) {\n            if (char === '(') parenDepth++;\n            else if (char === ')') parenDepth = Math.max(0, parenDepth - 1);\n            else if (char === '[') bracketDepth++;\n            else if (char === ']') bracketDepth = Math.max(0, bracketDepth - 1);\n\n            if (parenDepth === 0 && bracketDepth === 0) {\n                if (char === '>' || char === '+' || char === '~') {\n                    pushCurrent();\n                    tokens.push(char);\n                    continue;\n                }\n\n                if (/\\s/.test(char)) {\n                    pushCurrent();\n\n                    while (i + 1 < selector.length && /\\s/.test(selector[i + 1])) {\n                        i++;\n                    }\n\n                    let nextChar = '';\n                    for (let j = i + 1; j < selector.length; j++) {\n                        if (!/\\s/.test(selector[j])) {\n                            nextChar = selector[j];\n                            break;\n                        }\n                    }\n\n                    const lastToken = tokens[tokens.length - 1];\n                    const isLastCombinator =\n                        lastToken === ' ' || lastToken === '>' || lastToken === '+' || lastToken === '~';\n\n                    if (\n                        tokens.length > 0 &&\n                        !isLastCombinator &&\n                        nextChar &&\n                        nextChar !== '>' &&\n                        nextChar !== '+' &&\n                        nextChar !== '~'\n                    ) {\n                        tokens.push(' ');\n                    }\n                    continue;\n                }\n            }\n        }\n\n        current += char;\n    }\n\n    pushCurrent();\n\n    return tokens;\n}\n"],
+  "mappings": "8PA2BA,SAASA,EAAcC,EAAa,CAChC,MAAO,CAAC,CAACA,GAASA,EAAc,WAAa,CACjD,CAGA,SAASC,EAAiBD,EAAa,CACnC,MACI,CAAC,CAACA,GACDA,EAAc,WAAa,IAC5B,CAAC,CAAEA,EAAoB,IAE/B,CAGA,SAASE,EAAgBC,EAAaC,EAAgB,CAClD,GAAI,CACA,OAAOD,EAAG,QAAQC,CAAQ,CAC9B,MAAQ,CACJ,MAAO,EACX,CACJ,CAOA,SAASC,EAAeF,EAAaG,EAAuB,CACxD,GAAIH,IAAOG,EAAU,OAAO,KAC5B,MAAMC,EAASJ,EAAG,cAClB,GAAII,EAAQ,OAAOA,EACnB,MAAMC,EAAWL,EAAG,YAAW,EAC/B,OAAIK,IAAaL,GAAMK,IAAaF,EAAiB,KACjDL,EAAiBO,CAAQ,EAAUA,EAAS,KACzC,IACX,CAOA,SAASC,EAAoBN,EAAaO,EAAkBJ,EAAuB,CAC/E,IAAIN,EAAuBG,EACvB,EAAIO,EAAO,OAAS,EAExB,KAAO,EAAI,GAAKV,GAAM,CAClB,MAAMW,EAAaD,EAAO,EAAI,CAAC,EACzBN,EAAWM,EAAO,EAAI,CAAC,EAE7B,GAAIC,IAAe,KAEf,GADAX,EAAOK,EAAeL,EAAMM,CAAQ,EAChC,CAACN,GAAQ,CAACE,EAAgBF,EAAMI,CAAQ,EAAG,MAAO,WAC/CO,IAAe,KAEtB,GADAX,EAAOA,EAAK,uBACR,CAACA,GAAQ,CAACE,EAAgBF,EAAMI,CAAQ,EAAG,MAAO,WAC/CO,IAAe,IAAK,CAC3BX,EAAOA,EAAK,uBACZ,IAAIY,EAAQ,GACZ,KAAOZ,GAAM,CACT,GAAIE,EAAgBF,EAAMI,CAAQ,EAAG,CACjCQ,EAAQ,GACR,KACJ,CACAZ,EAAOA,EAAK,sBAChB,CACA,GAAI,CAACY,EAAO,MAAO,EACvB,KAAO,CAEHZ,EAAOK,EAAeL,EAAMM,CAAQ,EACpC,IAAIM,EAAQ,GACZ,KAAOZ,GAAM,CACT,GAAIE,EAAgBF,EAAMI,CAAQ,EAAG,CACjCQ,EAAQ,GACR,KACJ,CACAZ,EAAOK,EAAeL,EAAMM,CAAQ,CACxC,CACA,GAAI,CAACM,EAAO,MAAO,EACvB,CACA,GAAK,CACT,CACA,OAAO,GAAK,CAChB,CAOA,SAASC,EAAaC,EAAmB,CACrC,MAAMC,EAAyB,CAACD,CAAI,EAC9BE,EAA2B,CAAA,EAE7BjB,EAAce,CAAI,GAAKA,EAAK,aAC5BC,EAAM,KAAKD,EAAK,UAAU,EAC1BE,EAAQ,KAAKF,EAAK,UAAU,GAGhC,IAAIG,EAAmCH,EACvC,KAAOG,GAAO,CACV,MAAMC,EAAMD,EAAM,iBAAiB,GAAG,EACtC,QAASE,EAAI,EAAGA,EAAID,EAAI,OAAQC,IAAK,CACjC,MAAMC,EAAcF,EAAIC,CAAC,EAAc,WACnCC,IACAL,EAAM,KAAKK,CAAU,EACrBJ,EAAQ,KAAKI,CAAU,EAE/B,CACAH,EAAQD,EAAQ,IAAG,CACvB,CACA,OAAOD,CACX,CAQA,SAASM,EAAmBP,EAAqBQ,EAAe,CAC5D,MAAMC,EAAiB,CAAA,EACvB,OAAAC,EAAYV,EAAMS,EAAKD,CAAM,EACtBC,CACX,CAEA,SAASC,EAAYP,EAAsBM,EAAgBD,EAAe,CAElEvB,EAAckB,CAAK,GAAKA,EAAM,YAC9BQ,EAAYR,EAAM,WAAW,iBAAiB,GAAG,EAAGM,EAAKD,CAAM,EAEnEG,EAAYR,EAAM,iBAAiB,GAAG,EAAGM,EAAKD,CAAM,CACxD,CAEA,SAASG,EAAYC,EAA2BH,EAAgBD,EAAe,CAC3E,QAASH,EAAI,EAAGA,EAAIO,EAAK,OAAQP,IAAK,CAClC,MAAMhB,EAAKuB,EAAKP,CAAC,GACb,CAACG,GAAUpB,EAAgBC,EAAImB,CAAM,IACrCC,EAAI,KAAKpB,CAAE,EAEf,MAAMiB,EAAajB,EAAG,WAClBiB,GACAK,EAAYL,EAAW,iBAAiB,GAAG,EAAGG,EAAKD,CAAM,CAEjE,CACJ,CAKA,SAAUK,EAAYb,EAAmB,CACrC,MAAMc,EAAmB,CAAA,EACnBC,EAAgBZ,GAAwB,CAC1C,MAAMa,EAAOb,EAAM,SACnB,QAASE,EAAIW,EAAK,OAAS,EAAGX,GAAK,EAAGA,IAAKS,EAAM,KAAKE,EAAKX,CAAC,CAAC,CACjE,EASA,IAPIpB,EAAce,CAAI,GAClBe,EAAaf,CAAI,EACbA,EAAK,YAAYe,EAAaf,EAAK,UAAU,GAEjDe,EAAaf,CAAI,EAGdc,EAAM,OAAS,GAAG,CACrB,MAAMzB,EAAKyB,EAAM,IAAG,EACpB,MAAMzB,EACN0B,EAAa1B,CAAE,EACXA,EAAG,YAAY0B,EAAa1B,EAAG,UAAU,CACjD,CACJ,CAEA,MAAM4B,EAAoB,IACpBC,EAAa,IAAI,IAGvB,SAASC,EAAcC,EAAgB,CACnC,MAAMC,EAASH,EAAW,IAAIE,CAAQ,EACtC,GAAIC,EAAQ,OAAOA,EAEnB,MAAMC,EAAoB,CAAA,EAC1B,UAAWC,KAAQC,EAAaJ,CAAQ,EAAG,CACvC,MAAMxB,EAAS6B,EAAaF,CAAI,EAC5B3B,EAAO,OAAS,GAAG0B,EAAM,KAAK1B,CAAM,CAC5C,CAEA,OAAIsB,EAAW,MAAQD,GAAmBC,EAAW,MAAK,EAC1DA,EAAW,IAAIE,EAAUE,CAAK,EACvBA,CACX,CAQA,SAASI,EACLzB,EACA0B,EAAyB,CAEzB,IAAIf,EAAmB,KACnBgB,EAAqB,KACrBC,EAAgB,EAEpB,UAAW7B,KAAQC,EAAO,CACtB,IAAIH,EACJ,GAAI,CACAA,EAAQE,EAAK,iBAAoB2B,CAAiB,CACtD,MAAQ,CACJ,QACJ,CACA,GAAI7B,EAAM,SAAW,EAErB,GADA+B,IACI,CAACjB,EACDA,EAAO,MAAM,KAAKd,CAAK,MACpB,CACE8B,IAAKA,EAAM,IAAI,IAAIhB,CAAI,GAC5B,QAASP,EAAI,EAAGA,EAAIP,EAAM,OAAQO,IAAKuB,EAAI,IAAI9B,EAAMO,CAAC,CAAC,CAC3D,CACJ,CACA,MAAO,CAAE,KAAAO,EAAM,IAAAgB,EAAK,cAAAC,CAAa,CACrC,CAMM,SAAUC,EACZV,EACApB,EAAsB,SACtB+B,EAAgC,KAAI,CAEpC,GAAI,CAACX,GAAY,CAACA,EAAS,KAAI,EAAI,OAAO,KAI1C,MAAMY,EAAehC,EAAK,cAAiBoB,CAAQ,EACnD,GAAIY,EAAc,OAAOA,EAEzB,MAAMV,EAAQH,EAAcC,CAAQ,EACpC,GAAIE,EAAM,SAAW,EAAG,OAAO,KAG/B,GAAIS,EAAa,CACb,UAAWnC,KAAU0B,EAAO,CACxB,MAAMW,EAAOrC,EAAOA,EAAO,OAAS,CAAC,EACrC,UAAWP,KAAM0C,EACb,GACI3C,EAAgBC,EAAI4C,CAAI,IACvBrC,EAAO,SAAW,GAAKD,EAAoBN,EAAIO,EAAQI,CAAI,GAE5D,OAAOX,CAGnB,CACA,OAAO,IACX,CAEA,MAAMY,EAAQF,EAAaC,CAAI,EAC/B,GAAIC,EAAM,SAAW,EAAG,OAAO,KAE/B,UAAWL,KAAU0B,EAAO,CACxB,MAAMW,EAAOrC,EAAOA,EAAO,OAAS,CAAC,EAC/B,CAAE,KAAAgB,EAAM,IAAAgB,EAAK,cAAAC,CAAa,EAAKH,EAAqBzB,EAAOgC,CAAI,EACrE,GAAI,CAACrB,EAAM,SAEX,MAAMsB,EAAY7C,GACdO,EAAO,SAAW,GAAKD,EAAoBN,EAAIO,EAAQI,CAAI,EAE/D,GAAI6B,IAAkB,GAElB,UAAWxC,KAAMuB,EACb,GAAIsB,EAAS7C,CAAE,EAAG,OAAOA,MAE1B,CACH,MAAM8C,EAAaP,GAAO,IAAI,IAAIhB,CAAI,EACtC,UAAWvB,KAAMwB,EAAYb,CAAI,EAC7B,GAAImC,EAAW,IAAI9C,CAAO,GAAK6C,EAAS7C,CAAO,EAAG,OAAOA,CAEjE,CACJ,CACA,OAAO,IACX,CAOM,SAAU+C,EACZhB,EACApB,EAAsB,SACtB+B,EAAgC,KAAI,CAEpC,GAAI,CAACX,GAAY,CAACA,EAAS,KAAI,EAAI,MAAO,CAAA,EAE1C,MAAME,EAAQH,EAAcC,CAAQ,EACpC,GAAIE,EAAM,SAAW,EAAG,MAAO,CAAA,EAG/B,GAAIS,EAAa,CACb,MAAMtB,EAAW,CAAA,EACX4B,EAAO,IAAI,IACjB,UAAWzC,KAAU0B,EAAO,CACxB,MAAMW,EAAOrC,EAAOA,EAAO,OAAS,CAAC,EACrC,UAAWP,KAAM0C,EACTM,EAAK,IAAIhD,CAAE,GAAK,CAACD,EAAgBC,EAAI4C,CAAI,IACzCrC,EAAO,SAAW,GAAKD,EAAoBN,EAAIO,EAAQI,CAAI,KAC3DqC,EAAK,IAAIhD,CAAE,EACXoB,EAAI,KAAKpB,CAAO,EAG5B,CACA,OAAOoB,CACX,CAEA,MAAMR,EAAQF,EAAaC,CAAI,EAG/B,GAAIC,EAAM,SAAW,EACjB,OAAO,MAAM,KAAKD,EAAK,iBAAoBoB,CAAQ,CAAC,EAGxD,MAAMkB,EAAe,CAAA,EACfD,EAAO,IAAI,IAEjB,UAAWzC,KAAU0B,EAAO,CACxB,MAAMW,EAAOrC,EAAOA,EAAO,OAAS,CAAC,EAC/B,CAAE,KAAAgB,EAAM,IAAAgB,EAAK,cAAAC,CAAa,EAAKH,EAAqBzB,EAAOgC,CAAI,EACrE,GAAKrB,EAEL,GAAIiB,IAAkB,EAElB,UAAWxC,KAAMuB,EACTyB,EAAK,IAAIhD,CAAE,IACXO,EAAO,SAAW,GAAKD,EAAoBN,EAAIO,EAAQI,CAAI,KAC3DqC,EAAK,IAAIhD,CAAE,EACXiD,EAAQ,KAAKjD,CAAE,OAGpB,CAEH,MAAM8C,EAAaP,GAAO,IAAI,IAAIhB,CAAI,EAChCR,EAAMG,EAAmBP,CAAI,EACnC,QAASK,EAAI,EAAGA,EAAID,EAAI,OAAQC,IAAK,CACjC,MAAMhB,EAAKe,EAAIC,CAAC,EACZ,CAAC8B,EAAW,IAAI9C,CAAE,GAAKgD,EAAK,IAAIhD,CAAE,IAClCO,EAAO,SAAW,GAAKD,EAAoBN,EAAIO,EAAQI,CAAI,KAC3DqC,EAAK,IAAIhD,CAAE,EACXiD,EAAQ,KAAKjD,CAAE,EAEvB,CACJ,CACJ,CACA,OAAOiD,CACX,CAOM,SAAUC,EACZnB,EAA0B,KAC1BpB,EAAsB,SACtBwC,EAAmC,KAAI,CAEvC,GAAIA,EAAgB,CAChB,MAAMpC,EAAMoC,EACZ,OAAOpB,EAAWhB,EAAI,OAAQf,GAAOD,EAAgBC,EAAI+B,CAAQ,CAAC,EAAIhB,CAC1E,CAGA,OAAOG,EAAmBP,EAAMoB,GAAY,MAAS,CACzD,CAMM,SAAUI,EAAaJ,EAAgB,CACzC,GAAI,CAACA,GAAY,CAACA,EAAS,KAAI,EAAI,MAAO,CAAA,EAE1C,MAAMkB,EAAoB,CAAA,EAC1B,IAAIG,EAAU,GACVC,EAAa,EACbC,EAAe,EACfC,EAAgB,GAChBC,EAAgB,GAChBC,EAAU,GAEd,QAASzC,EAAI,EAAGA,EAAIe,EAAS,OAAQf,IAAK,CACtC,MAAM0C,EAAO3B,EAASf,CAAC,EAEvB,GAAIyC,EAAS,CACTL,GAAWM,EACXD,EAAU,GACV,QACJ,CAEA,GAAIC,IAAS,KAAM,CACfD,EAAU,GACVL,GAAWM,EACX,QACJ,CAEA,GAAIA,IAAS,KAAO,CAACF,EAAe,CAChCD,EAAgB,CAACA,EACjBH,GAAWM,EACX,QACJ,CAEA,GAAIA,IAAS,KAAO,CAACH,EAAe,CAChCC,EAAgB,CAACA,EACjBJ,GAAWM,EACX,QACJ,CAEA,GAAI,CAACH,GAAiB,CAACC,GACnB,GAAIE,IAAS,IAAKL,YACTK,IAAS,IAAKL,EAAa,KAAK,IAAI,EAAGA,EAAa,CAAC,UACrDK,IAAS,IAAKJ,YACdI,IAAS,IAAKJ,EAAe,KAAK,IAAI,EAAGA,EAAe,CAAC,UACzDI,IAAS,KAAOL,IAAe,GAAKC,IAAiB,EAAG,CAC7DL,EAAQ,KAAKG,EAAQ,KAAI,CAAE,EAC3BA,EAAU,GACV,QACJ,EAGJA,GAAWM,CACf,CAEA,OAAIN,EAAQ,KAAI,GACZH,EAAQ,KAAKG,EAAQ,KAAI,CAAE,EAGxBH,CACX,CAMM,SAAUb,EAAaL,EAAgB,CACzC,GAAI,CAACA,GAAY,CAACA,EAAS,KAAI,EAAI,MAAO,CAAA,EAE1C,MAAMxB,EAAmB,CAAA,EACzB,IAAI6C,EAAU,GACVC,EAAa,EACbC,EAAe,EACfC,EAAgB,GAChBC,EAAgB,GAChBC,EAAU,GAEd,MAAME,EAAc,IAAK,CACrB,MAAMC,EAAUR,EAAQ,KAAI,EACxBQ,GACArD,EAAO,KAAKqD,CAAO,EAEvBR,EAAU,EACd,EAEA,QAASpC,EAAI,EAAGA,EAAIe,EAAS,OAAQf,IAAK,CACtC,MAAM0C,EAAO3B,EAASf,CAAC,EAEvB,GAAIyC,EAAS,CACTL,GAAWM,EACXD,EAAU,GACV,QACJ,CAEA,GAAIC,IAAS,KAAM,CACfD,EAAU,GACVL,GAAWM,EACX,QACJ,CAEA,GAAIA,IAAS,KAAO,CAACF,EAAe,CAChCD,EAAgB,CAACA,EACjBH,GAAWM,EACX,QACJ,CAEA,GAAIA,IAAS,KAAO,CAACH,EAAe,CAChCC,EAAgB,CAACA,EACjBJ,GAAWM,EACX,QACJ,CAEA,GAAI,CAACH,GAAiB,CAACC,IACfE,IAAS,IAAKL,IACTK,IAAS,IAAKL,EAAa,KAAK,IAAI,EAAGA,EAAa,CAAC,EACrDK,IAAS,IAAKJ,IACdI,IAAS,MAAKJ,EAAe,KAAK,IAAI,EAAGA,EAAe,CAAC,GAE9DD,IAAe,GAAKC,IAAiB,GAAG,CACxC,GAAII,IAAS,KAAOA,IAAS,KAAOA,IAAS,IAAK,CAC9CC,EAAW,EACXpD,EAAO,KAAKmD,CAAI,EAChB,QACJ,CAEA,GAAI,KAAK,KAAKA,CAAI,EAAG,CAGjB,IAFAC,EAAW,EAEJ3C,EAAI,EAAIe,EAAS,QAAU,KAAK,KAAKA,EAASf,EAAI,CAAC,CAAC,GACvDA,IAGJ,IAAI6C,EAAW,GACf,QAASC,EAAI9C,EAAI,EAAG8C,EAAI/B,EAAS,OAAQ+B,IACrC,GAAI,CAAC,KAAK,KAAK/B,EAAS+B,CAAC,CAAC,EAAG,CACzBD,EAAW9B,EAAS+B,CAAC,EACrB,KACJ,CAGJ,MAAMC,EAAYxD,EAAOA,EAAO,OAAS,CAAC,EACpCyD,EACFD,IAAc,KAAOA,IAAc,KAAOA,IAAc,KAAOA,IAAc,IAG7ExD,EAAO,OAAS,GAChB,CAACyD,GACDH,GACAA,IAAa,KACbA,IAAa,KACbA,IAAa,KAEbtD,EAAO,KAAK,GAAG,EAEnB,QACJ,CACJ,CAGJ6C,GAAWM,CACf,CAEA,OAAAC,EAAW,EAEJpD,CACX",
+  "names": ["isElementNode", "node", "isHostedFragment", "matchesSelector", "el", "compound", "composedParent", "boundary", "parent", "rootNode", "matchesComposedPath", "tokens", "combinator", "found", "collectRoots", "root", "roots", "pending", "scope", "all", "i", "shadowRoot", "collectAllElements", "filter", "out", "collectInto", "collectList", "list", "iterateDeep", "stack", "pushChildren", "kids", "PARSE_CACHE_LIMIT", "parseCache", "parseSelector", "selector", "cached", "parts", "part", "splitByComma", "tokenizePath", "collectCandidates", "rightMostCompound", "set", "rootsWithHits", "querySelectorDeep", "allElements", "lightElement", "last", "verified", "candidates", "querySelectorAllDeep", "seen", "results", "collectAllElementsDeep", "cachedElements", "current", "parenDepth", "bracketDepth", "inSingleQuote", "inDoubleQuote", "escaped", "char", "pushCurrent", "trimmed", "nextChar", "j", "lastToken", "isLastCombinator"]
+}

package/package.json

@@ -1,16 +1,16 @@
 {
   "name": "query-selector-shadow-dom-modern",
-  "version": "1.0.0",
+  "version": "1.0.2",
   "description": "Modern drop-in replacement for query-selector-shadow-dom — querySelector that pierces Shadow DOM roots without knowing the path",
   "type": "module",
-  "main": "dist/umd/index.js",
+  "main": "dist/umd/index.cjs",
   "module": "dist/esm/index.js",
   "types": "dist/esm/index.d.ts",
   "exports": {
     ".": {
       "types": "./dist/esm/index.d.ts",
       "import": "./dist/esm/index.js",
-      "require": "./dist/umd/index.js"
+      "require": "./dist/umd/index.cjs"
     }
   },
   "files": [
@@ -28,23 +28,33 @@
     "testing"
   ],
   "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/kaixinol/query-selector-shadow-dom-modern.git"
+  },
+  "bugs": {
+    "url": "https://github.com/kaixinol/query-selector-shadow-dom-modern/issues"
+  },
+  "homepage": "https://github.com/kaixinol/query-selector-shadow-dom-modern#readme",
   "devDependencies": {
     "@rollup/plugin-typescript": "^12.1.2",
     "@types/jsdom": "^30.0.0",
     "@types/node": "^26.1.1",
+    "esbuild": "^0.28.2",
     "jsdom": "^30.0.1",
     "playwright": "^1.62.0",
     "query-selector-shadow-dom": "^1.0.1",
     "rollup": "^4.34.8",
     "tslib": "^2.8.1",
     "tsx": "^4.23.1",
-    "typescript": "^5.7.3",
-    "vitest": "^3.2.7"
+    "typescript": "^6.0.3",
+    "vitest": "^5.0.0"
   },
   "scripts": {
     "build:esm": "tsc -p tsconfig.json",
     "build:umd": "rollup -c",
-    "build": "pnpm build:esm && pnpm build:umd",
+    "build:min": "esbuild dist/umd/index.js --minify --sourcemap --outfile=dist/umd/index.min.js",
+    "build": "pnpm build:esm && pnpm build:umd && pnpm build:min",
     "test": "vitest run",
     "test:watch": "vitest",
     "benchmark": "tsx benchmark/runner.ts",