query-selector-shadow-dom-modern 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,52 @@
+# query-selector-shadow-dom-modern
+
+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.).
+
+## Install
+
+```sh
+npm install query-selector-shadow-dom-modern
+# or
+pnpm add query-selector-shadow-dom-modern
+# or
+yarn add query-selector-shadow-dom-modern
+```
+
+## Usage
+
+```ts
+import { querySelectorDeep, querySelectorAllDeep, collectAllElementsDeep } from 'query-selector-shadow-dom-modern';
+
+// Find first matching element (pierces shadow roots)
+const btn = querySelectorDeep('.btn-in-shadow-dom');
+
+// Find all matching elements
+const items = querySelectorAllDeep('my-component .item');
+
+// Collect all elements on the page, including shadow DOM
+const all = collectAllElementsDeep();
+const filtered = collectAllElementsDeep('a[href]');
+```
+
+### UMD (browser)
+
+```html
+<script src="node_modules/query-selector-shadow-dom-modern/dist/umd/index.js"></script>
+<script>
+  const btn = querySelectorShadowDom.querySelectorDeep('.btn-in-shadow-dom');
+</script>
+```
+
+## API
+
+- `querySelectorDeep(selector, root?)` — Returns the first matching element, piercing shadow roots
+- `querySelectorAllDeep(selector, root?)` — Returns an array of all matching elements, piercing shadow roots
+- `collectAllElementsDeep(selector?, root?)` — Collects all elements on the page, including those within shadow roots. Optionally filters by a CSS selector
+
+Both `root` defaults to `document`. Pass a custom root to scope the search (e.g., an iframe's `contentDocument`).
+
+## License
+
+MIT

package/dist/esm/index.d.ts

@@ -0,0 +1,49 @@
+/**
+ * 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.
+ */
+export type QueryableNode = Document | DocumentFragment | Element;
+/**
+ * Finds the first matching element on the page, piercing any number of nested
+ * shadow roots. Same signature and semantics as the original library.
+ */
+export declare function querySelectorDeep<T extends Element = HTMLElement>(selector: string, root?: QueryableNode, allElements?: Element[] | null): T | 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).
+ */
+export declare function querySelectorAllDeep<T extends Element = HTMLElement>(selector: string, root?: QueryableNode, allElements?: Element[] | null): T[];
+/**
+ * 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.
+ */
+export declare function collectAllElementsDeep<T extends Element = HTMLElement>(selector?: string | null, root?: QueryableNode, cachedElements?: Element[] | null): T[];
+/**
+ * Split a selector list on top-level commas (ignores commas inside quotes,
+ * attribute brackets and pseudo-class parentheses).
+ */
+export declare function splitByComma(selector: string): string[];
+/**
+ * Tokenize a CSS selector into compounds and combinators:
+ * 'div > p span' → ['div', '>', 'p', ' ', 'span'].
+ */
+export declare function tokenizePath(selector: string): string[];
+//# sourceMappingURL=index.d.ts.map

package/dist/esm/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,gBAAgB,GAAG,OAAO,CAAC;AAsOlE;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,OAAO,GAAG,WAAW,EAC7D,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE,aAAwB,EAC9B,WAAW,GAAE,OAAO,EAAE,GAAG,IAAW,GACrC,CAAC,GAAG,IAAI,CAmDV;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,OAAO,GAAG,WAAW,EAChE,QAAQ,EAAE,MAAM,EAChB,IAAI,GAAE,aAAwB,EAC9B,WAAW,GAAE,OAAO,EAAE,GAAG,IAAW,GACrC,CAAC,EAAE,CA8DL;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,OAAO,GAAG,WAAW,EAClE,QAAQ,GAAE,MAAM,GAAG,IAAW,EAC9B,IAAI,GAAE,aAAwB,EAC9B,cAAc,GAAE,OAAO,EAAE,GAAG,IAAW,GACxC,CAAC,EAAE,CAQL;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CA0DvD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAmGvD"}

package/dist/esm/index.js

@@ -0,0 +1,527 @@
+/**
+ * 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.
+ */
+export 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).
+ */
+export 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.
+ */
+export 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).
+ */
+export 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'].
+ */
+export 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;
+}
+//# sourceMappingURL=index.js.map

package/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAIH,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC,yEAAyE;AACzE,SAAS,aAAa,CAAC,IAAa;IAChC,OAAO,CAAC,CAAC,IAAI,IAAK,IAAa,CAAC,QAAQ,KAAK,YAAY,CAAC;AAC9D,CAAC;AAED,yCAAyC;AACzC,SAAS,gBAAgB,CAAC,IAAa;IACnC,OAAO,CACH,CAAC,CAAC,IAAI;QACL,IAAa,CAAC,QAAQ,KAAK,sBAAsB;QAClD,CAAC,CAAE,IAAmB,CAAC,IAAI,CAC9B,CAAC;AACN,CAAC;AAED,gFAAgF;AAChF,SAAS,eAAe,CAAC,EAAW,EAAE,QAAgB;IAClD,IAAI,CAAC;QACD,OAAO,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACL,OAAO,KAAK,CAAC;IACjB,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,EAAW,EAAE,QAAuB;IACxD,IAAI,EAAE,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACjC,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC;IAChC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,QAAQ,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IAClC,IAAI,QAAQ,KAAK,EAAE,IAAI,QAAQ,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,gBAAgB,CAAC,QAAQ,CAAC;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;IACrD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,EAAW,EAAE,MAAgB,EAAE,QAAuB;IAC/E,IAAI,IAAI,GAAmB,EAAE,CAAC;IAC9B,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IAE1B,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;QACnB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE/B,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YACrB,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChE,CAAC;aAAM,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC;YACnC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChE,CAAC;aAAM,IAAI,UAAU,KAAK,GAAG,EAAE,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC;YACnC,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,OAAO,IAAI,EAAE,CAAC;gBACV,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAClC,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM;gBACV,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,sBAAsB,CAAC;YACvC,CAAC;YACD,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC7B,CAAC;aAAM,CAAC;YACJ,wBAAwB;YACxB,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACtC,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,OAAO,IAAI,EAAE,CAAC;gBACV,IAAI,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAClC,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM;gBACV,CAAC;gBACD,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC1C,CAAC;YACD,IAAI,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC7B,CAAC;QACD,CAAC,IAAI,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,IAAmB;IACrC,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,OAAO,GAAoB,EAAE,CAAC;IAEpC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,KAAK,GAA8B,IAAI,CAAC;IAC5C,OAAO,KAAK,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,UAAU,GAAI,GAAG,CAAC,CAAC,CAAa,CAAC,UAAU,CAAC;YAClD,IAAI,UAAU,EAAE,CAAC;gBACb,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7B,CAAC;QACL,CAAC;QACD,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;IAC1B,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,IAAmB,EAAE,MAAe;IAC5D,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,WAAW,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC/B,OAAO,GAAG,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,KAAoB,EAAE,GAAc,EAAE,MAAe;IACtE,2EAA2E;IAC3E,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QAC3C,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IACD,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,WAAW,CAAC,IAAyB,EAAE,GAAc,EAAE,MAAe;IAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,IAAI,eAAe,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,UAAU,GAAG,EAAE,CAAC,UAAU,CAAC;QACjC,IAAI,UAAU,EAAE,CAAC;YACb,WAAW,CAAC,UAAU,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QAC/D,CAAC;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,QAAQ,CAAC,CAAC,WAAW,CAAC,IAAmB;IACrC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,YAAY,GAAG,CAAC,KAAoB,EAAE,EAAE;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC5B,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,CAAC;IACnE,CAAC,CAAC;IAEF,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,YAAY,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,UAAU;YAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvD,CAAC;SAAM,CAAC;QACJ,YAAY,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,MAAM,EAAE,CAAC;QACT,YAAY,CAAC,EAAE,CAAC,CAAC;QACjB,IAAI,EAAE,CAAC,UAAU;YAAE,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;AACL,CAAC;AAED,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;AAEjD,iGAAiG;AACjG,SAAS,aAAa,CAAC,QAAgB;IACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,IAAI,iBAAiB;QAAE,UAAU,CAAC,KAAK,EAAE,CAAC;IAC7D,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CACtB,KAAsB,EACtB,iBAAyB;IAEzB,IAAI,IAAI,GAAe,IAAI,CAAC;IAC5B,IAAI,GAAG,GAAkB,IAAI,CAAC;IAC9B,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,KAAoB,CAAC;QACzB,IAAI,CAAC;YACD,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAI,iBAAiB,CAAC,CAAC;QACxD,CAAC;QAAC,MAAM,CAAC;YACL,SAAS,CAAC,4CAA4C;QAC1D,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACjC,aAAa,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,GAAG;gBAAE,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;IACL,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC7B,QAAgB,EAChB,OAAsB,QAAQ,EAC9B,cAAgC,IAAI;IAEpC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,IAAI,CAAC;IAE/C,gEAAgE;IAChE,qEAAqE;IACrE,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAI,QAAQ,CAAC,CAAC;IACrD,IAAI,YAAY;QAAE,OAAO,YAAY,CAAC;IAEtC,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpC,gEAAgE;IAChE,IAAI,WAAW,EAAE,CAAC;QACd,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC3B,IACI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;oBACzB,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAChE,CAAC;oBACC,OAAO,EAAO,CAAC;gBACnB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,+CAA+C;IAEpF,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,MAAM,QAAQ,GAAG,CAAC,EAAK,EAAW,EAAE,CAChC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAEjE,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACtB,qFAAqF;YACrF,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,QAAQ,CAAC,EAAE,CAAC;oBAAE,OAAO,EAAE,CAAC;YAChC,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,IAAI,UAAU,CAAC,GAAG,CAAC,EAAO,CAAC,IAAI,QAAQ,CAAC,EAAO,CAAC;oBAAE,OAAO,EAAO,CAAC;YACrE,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAChC,QAAgB,EAChB,OAAsB,QAAQ,EAC9B,cAAgC,IAAI;IAEpC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAE7C,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,gEAAgE;IAChE,IAAI,WAAW,EAAE,CAAC;QACd,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;oBAAE,SAAS;gBACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC/D,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACb,GAAG,CAAC,IAAI,CAAC,EAAO,CAAC,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAED,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEjC,iEAAiE;IACjE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAI,QAAQ,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAE1B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAI,KAAK,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACtB,6EAA6E;YAC7E,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;gBACpB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC/D,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACb,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,CAAC;YACL,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,iEAAiE;YACjE,MAAM,UAAU,GAAG,GAAG,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAM,CAAC;gBACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAClD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC/D,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACb,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAClC,WAA0B,IAAI,EAC9B,OAAsB,QAAQ,EAC9B,iBAAmC,IAAI;IAEvC,IAAI,cAAc,EAAE,CAAC;QACjB,MAAM,GAAG,GAAG,cAAqB,CAAC;QAClC,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9E,CAAC;IAED,qEAAqE;IACrE,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,IAAI,SAAS,CAAQ,CAAC;AAClE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IACzC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAE7C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEzB,IAAI,OAAO,EAAE,CAAC;YACV,OAAO,IAAI,IAAI,CAAC;YAChB,OAAO,GAAG,KAAK,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAChB,OAAO,GAAG,IAAI,CAAC;YACf,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjC,aAAa,GAAG,CAAC,aAAa,CAAC;YAC/B,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjC,aAAa,GAAG,CAAC,aAAa,CAAC;YAC/B,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;YACnC,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;iBAC1B,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;iBAC3D,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,EAAE,CAAC;iBACjC,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;iBAC/D,IAAI,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC9D,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,GAAG,EAAE,CAAC;gBACb,SAAS;YACb,CAAC;QACL,CAAC;QAED,OAAO,IAAI,IAAI,CAAC;IACpB,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACjB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IACzC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAE7C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,MAAM,WAAW,GAAG,GAAG,EAAE;QACrB,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,OAAO,EAAE,CAAC;YACV,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEzB,IAAI,OAAO,EAAE,CAAC;YACV,OAAO,IAAI,IAAI,CAAC;YAChB,OAAO,GAAG,KAAK,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAChB,OAAO,GAAG,IAAI,CAAC;YACf,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjC,aAAa,GAAG,CAAC,aAAa,CAAC;YAC/B,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjC,aAAa,GAAG,CAAC,aAAa,CAAC;YAC/B,OAAO,IAAI,IAAI,CAAC;YAChB,SAAS;QACb,CAAC;QAED,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,EAAE,CAAC;YACnC,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;iBAC1B,IAAI,IAAI,KAAK,GAAG;gBAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;iBAC3D,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,EAAE,CAAC;iBACjC,IAAI,IAAI,KAAK,GAAG;gBAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YAEpE,IAAI,UAAU,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBACzC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAC/C,WAAW,EAAE,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,SAAS;gBACb,CAAC;gBAED,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClB,WAAW,EAAE,CAAC;oBAEd,OAAO,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC3D,CAAC,EAAE,CAAC;oBACR,CAAC;oBAED,IAAI,QAAQ,GAAG,EAAE,CAAC;oBAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;4BAC1B,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;4BACvB,MAAM;wBACV,CAAC;oBACL,CAAC;oBAED,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC5C,MAAM,gBAAgB,GAClB,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,CAAC;oBAErF,IACI,MAAM,CAAC,MAAM,GAAG,CAAC;wBACjB,CAAC,gBAAgB;wBACjB,QAAQ;wBACR,QAAQ,KAAK,GAAG;wBAChB,QAAQ,KAAK,GAAG;wBAChB,QAAQ,KAAK,GAAG,EAClB,CAAC;wBACC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACrB,CAAC;oBACD,SAAS;gBACb,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,IAAI,CAAC;IACpB,CAAC;IAED,WAAW,EAAE,CAAC;IAEd,OAAO,MAAM,CAAC;AAClB,CAAC"}