@ts-guaranteed/tsgo 7.0.0-alpha.2

package/dist/ast/astnav.js

@@ -0,0 +1,596 @@
+import { NodeFlags } from "#enums/nodeFlags";
+import { SyntaxKind } from "#enums/syntaxKind";
+import { createToken } from "./factory.generated.js";
+import { isJSDocNodeKind, isKeywordKind, isPrivateIdentifier, isPropertyNameLiteral, isTokenKind, } from "./is.js";
+import { createScanner, skipTrivia, } from "./scanner.js";
+export function getTokenAtPosition(sourceFile, position) {
+    return getTokenAtPositionImpl(sourceFile, position, /*allowPositionInLeadingTrivia*/ true, /*includePrecedingTokenAtEndPosition*/ undefined);
+}
+export function getTouchingPropertyName(sourceFile, position) {
+    return getTokenAtPositionImpl(sourceFile, position, /*allowPositionInLeadingTrivia*/ false, node => isPropertyNameLiteral(node) || isKeywordKind(node.kind) || isPrivateIdentifier(node));
+}
+export function getTouchingToken(sourceFile, position) {
+    return getTokenAtPositionImpl(sourceFile, position, /*allowPositionInLeadingTrivia*/ false, /*includePrecedingTokenAtEndPosition*/ undefined);
+}
+/**
+ * Finds the token that starts immediately after `previousToken` ends, searching
+ * within `parent`.  Returns `undefined` if no such token exists.
+ */
+export function findNextToken(previousToken, parent, sourceFile) {
+    return find(parent);
+    function find(n) {
+        if (isTokenKind(n.kind) && n.pos === previousToken.end) {
+            // This is the token that starts at the end of previousToken – return it.
+            return n;
+        }
+        // Find the child node that contains `previousToken` or starts immediately after it.
+        let foundNode;
+        const visitChild = (node) => {
+            if (node.flags & NodeFlags.Reparsed) {
+                return undefined;
+            }
+            if (node.pos <= previousToken.end && node.end > previousToken.end) {
+                foundNode = node;
+            }
+            return undefined;
+        };
+        // Visit JSDoc children first (mirrors Go's VisitEachChildAndJSDoc).
+        if (n.jsDoc) {
+            for (const jsdoc of n.jsDoc) {
+                visitChild(jsdoc);
+            }
+        }
+        n.forEachChild(visitChild, nodes => {
+            if (nodes.length > 0 && foundNode === undefined) {
+                for (const node of nodes) {
+                    if (node.flags & NodeFlags.Reparsed)
+                        continue;
+                    if (node.pos > previousToken.end)
+                        break;
+                    if (node.end > previousToken.end) {
+                        foundNode = node;
+                        break;
+                    }
+                }
+            }
+            return undefined;
+        });
+        // Recurse into the found child.
+        if (foundNode !== undefined) {
+            return find(foundNode);
+        }
+        // No AST child covers the position; use the scanner to find the syntactic token.
+        // The scanner is initialized at `previousToken.end`, so tokenFullStart === previousToken.end.
+        const startPos = previousToken.end;
+        if (startPos >= n.pos && startPos < n.end) {
+            const scanner = getScannerForSourceFile(sourceFile, startPos);
+            const token = scanner.getToken();
+            const tokenFullStart = scanner.getTokenFullStart();
+            const tokenEnd = scanner.getTokenEnd();
+            const flags = scanner.getTokenFlags();
+            return getOrCreateToken(sourceFile, token, tokenFullStart, tokenEnd, n, flags);
+        }
+        return undefined;
+    }
+}
+/**
+ * Finds the leftmost token satisfying `position < token.end`.
+ * If the position is in the trivia of that leftmost token, or the token is invalid,
+ * returns the rightmost valid token with `token.end <= position`.
+ * Excludes `JsxText` tokens containing only whitespace.
+ */
+export function findPrecedingToken(sourceFile, position) {
+    return findPrecedingTokenImpl(sourceFile, position, sourceFile);
+}
+function getTokenAtPositionImpl(sourceFile, position, allowPositionInLeadingTrivia, includePrecedingTokenAtEndPosition) {
+    let current = sourceFile;
+    let nodeAfterLeft;
+    const state = {
+        next: undefined,
+        prevSubtree: undefined,
+        left: 0,
+    };
+    const testNode = (node) => {
+        if (node.kind !== SyntaxKind.EndOfFile && node.end === position && includePrecedingTokenAtEndPosition !== undefined) {
+            state.prevSubtree = node;
+        }
+        // A node "contains" the position if position < end, except nodes at the file end
+        // treat end as inclusive (there's nowhere else to look). This applies to the EOF
+        // token itself, and to JSDoc nodes reaching EOF (e.g. unterminated JSDoc comments).
+        if (node.end < position || node.end === position &&
+            node.kind !== SyntaxKind.EndOfFile &&
+            (!isJSDocNodeKind(node.kind) || node.end !== sourceFile.endOfFileToken.end)) {
+            return -1;
+        }
+        const nodePos = getPosition(node, sourceFile, allowPositionInLeadingTrivia);
+        if (nodePos > position) {
+            return 1;
+        }
+        return 0;
+    };
+    while (true) {
+        // Visit each child of current to find the one containing the position.
+        state.next = undefined;
+        nodeAfterLeft = undefined;
+        // In Strada, JSDoc nodes with a single comment represent that comment as a string
+        // property (not a child node), so forEachChild does not visit it. We replicate this
+        // by detecting single-comment NodeLists in visitList and skipping their elements in visitNode.
+        let skipSingleCommentChildren = false;
+        const visitNode = (node) => {
+            if (node.flags & NodeFlags.Reparsed) {
+                return undefined;
+            }
+            if (skipSingleCommentChildren && isJSDocCommentChildKind(node.kind)) {
+                return undefined;
+            }
+            if (nodeAfterLeft === undefined) {
+                nodeAfterLeft = node;
+            }
+            if (state.next === undefined) {
+                const result = testNode(node);
+                switch (result) {
+                    case -1:
+                        if (!isJSDocNodeKind(node.kind)) {
+                            state.left = node.end;
+                        }
+                        nodeAfterLeft = undefined;
+                        break;
+                    case 0:
+                        state.next = node;
+                        break;
+                }
+            }
+            return undefined;
+        };
+        // Visit JSDoc children first, then regular children (mirrors Go's VisitEachChildAndJSDoc).
+        if (current.jsDoc) {
+            for (const jsdoc of current.jsDoc) {
+                visitNode(jsdoc);
+            }
+        }
+        current.forEachChild(visitNode, nodes => {
+            // Track whether this NodeList is a single-comment list that should be skipped.
+            // The flag affects the subsequent forEachNode(visitNode) calls for this NodeList.
+            skipSingleCommentChildren = isJSDocSingleCommentNodeList(nodes);
+            if (nodes.length === 0 || skipSingleCommentChildren) {
+                return undefined;
+            }
+            if (nodeAfterLeft === undefined) {
+                for (const node of nodes) {
+                    if (!(node.flags & NodeFlags.Reparsed)) {
+                        nodeAfterLeft = node;
+                        break;
+                    }
+                }
+            }
+            if (state.next === undefined) {
+                if (nodes.end === position && includePrecedingTokenAtEndPosition !== undefined) {
+                    state.left = nodes.end;
+                    nodeAfterLeft = undefined;
+                    state.prevSubtree = nodes[nodes.length - 1];
+                }
+                else if (nodes.end <= position) {
+                    state.left = nodes.end;
+                    nodeAfterLeft = undefined;
+                }
+                else if (nodes.pos <= position) {
+                    binarySearchNodeList(nodes, testNode, (node, middle, arr) => {
+                        state.left = node.end;
+                        nodeAfterLeft = undefined;
+                        for (let i = middle + 1; i < arr.length; i++) {
+                            if (!(arr[i].flags & NodeFlags.Reparsed)) {
+                                nodeAfterLeft = arr[i];
+                                break;
+                            }
+                        }
+                    }, found => {
+                        state.next = found;
+                    });
+                }
+            }
+            return undefined;
+        });
+        // If prevSubtree was set, check if the rightmost token of prevSubtree should be returned.
+        if (state.prevSubtree !== undefined) {
+            const child = findPrecedingTokenImpl(sourceFile, position, state.prevSubtree);
+            if (child !== undefined && child.end === position && includePrecedingTokenAtEndPosition(child)) {
+                return child;
+            }
+            state.prevSubtree = undefined;
+        }
+        if (state.next === undefined) {
+            if (isTokenKind(current.kind) || shouldSkipChild(current)) {
+                return current;
+            }
+            // Use the scanner to find a token not stored in the AST.
+            const scanner = getScannerForSourceFile(sourceFile, state.left);
+            let end = current.end;
+            const afterLeft = nodeAfterLeft;
+            if (afterLeft !== undefined) {
+                end = afterLeft.pos;
+            }
+            while (state.left < end) {
+                const token = scanner.getToken();
+                const tokenFullStart = scanner.getTokenFullStart();
+                const tokenStart = allowPositionInLeadingTrivia ? tokenFullStart : scanner.getTokenStart();
+                const tokenEnd = scanner.getTokenEnd();
+                const flags = scanner.getTokenFlags();
+                if (tokenEnd > end) {
+                    break;
+                }
+                if (tokenStart <= position && position < tokenEnd) {
+                    if (token === SyntaxKind.Identifier || !isTokenKind(token)) {
+                        if (isJSDocNodeKind(current.kind)) {
+                            return current;
+                        }
+                        throw new Error(`did not expect ${SyntaxKind[current.kind]} to have ${SyntaxKind[token]} in its trivia`);
+                    }
+                    return getOrCreateToken(sourceFile, token, tokenFullStart, tokenEnd, current, flags);
+                }
+                if (includePrecedingTokenAtEndPosition !== undefined && tokenEnd === position) {
+                    const prevToken = getOrCreateToken(sourceFile, token, tokenFullStart, tokenEnd, current, flags);
+                    if (includePrecedingTokenAtEndPosition(prevToken)) {
+                        return prevToken;
+                    }
+                }
+                state.left = tokenEnd;
+                scanner.scan();
+            }
+            return current;
+        }
+        current = state.next;
+        state.left = current.pos;
+        nodeAfterLeft = undefined;
+    }
+}
+function getPosition(node, sourceFile, allowPositionInLeadingTrivia) {
+    if (allowPositionInLeadingTrivia) {
+        return node.pos;
+    }
+    return getTokenPosOfNode(node, sourceFile, /*includeJSDoc*/ true);
+}
+/** @internal */
+export function getTokenPosOfNode(node, sourceFile, includeJSDoc) {
+    // With nodes that have no width (i.e. 'Missing' nodes), we actually *don't*
+    // want to skip trivia because this will launch us forward to the next token.
+    if (nodeIsMissing(node)) {
+        return node.pos;
+    }
+    if (isJSDocNodeKind(node.kind) || node.kind === SyntaxKind.JsxText) {
+        return skipTrivia(sourceFile.text, node.pos, /*stopAfterLineBreak*/ false, /*stopAtComments*/ true);
+    }
+    if (includeJSDoc && node.jsDoc && node.jsDoc.length > 0) {
+        return getTokenPosOfNode(node.jsDoc[0], sourceFile, /*includeJSDoc*/ false);
+    }
+    return skipTrivia(sourceFile.text, node.pos, /*stopAfterLineBreak*/ false, /*stopAtComments*/ false, /*inJSDoc*/ !!(node.flags & NodeFlags.JSDoc));
+}
+function nodeIsMissing(node) {
+    return node.pos === node.end && node.pos >= 0 && node.kind !== SyntaxKind.EndOfFile;
+}
+function findPrecedingTokenImpl(sourceFile, position, startNode) {
+    const find = (n) => {
+        if (isTokenKind(n.kind) && n.kind !== SyntaxKind.EndOfFile) {
+            return n;
+        }
+        let foundChild;
+        let prevChild;
+        // Visit JSDoc nodes first (mirrors Go's VisitEachChildAndJSDoc).
+        if (n.jsDoc) {
+            for (const jsdoc of n.jsDoc) {
+                if (jsdoc.flags & NodeFlags.Reparsed)
+                    continue;
+                if (foundChild !== undefined)
+                    break;
+                if (position < jsdoc.end && (prevChild === undefined || prevChild.end <= position)) {
+                    foundChild = jsdoc;
+                }
+                else {
+                    prevChild = jsdoc;
+                }
+            }
+        }
+        let skipSingleCommentChildrenImpl = false;
+        n.forEachChild(node => {
+            if (node.flags & NodeFlags.Reparsed) {
+                return undefined;
+            }
+            if (skipSingleCommentChildrenImpl && isJSDocCommentChildKind(node.kind)) {
+                return undefined;
+            }
+            if (foundChild !== undefined) {
+                return undefined;
+            }
+            if (position < node.end && (prevChild === undefined || prevChild.end <= position)) {
+                foundChild = node;
+            }
+            else {
+                prevChild = node;
+            }
+            return undefined;
+        }, nodes => {
+            skipSingleCommentChildrenImpl = isJSDocSingleCommentNodeList(nodes);
+            if (foundChild !== undefined) {
+                return undefined;
+            }
+            if (nodes.length > 0 && !skipSingleCommentChildrenImpl) {
+                const index = binarySearchForPrecedingToken(nodes, position);
+                if (index >= 0 && !(nodes[index].flags & NodeFlags.Reparsed)) {
+                    foundChild = nodes[index];
+                }
+                const lookupIndex = index >= 0 ? index - 1 : nodes.length - 1;
+                for (let i = lookupIndex; i >= 0; i--) {
+                    if (!(nodes[i].flags & NodeFlags.Reparsed)) {
+                        if (prevChild === undefined) {
+                            prevChild = nodes[i];
+                        }
+                        break;
+                    }
+                }
+            }
+            return undefined;
+        });
+        if (foundChild !== undefined) {
+            const start = getTokenPosOfNode(foundChild, sourceFile, /*includeJSDoc*/ true);
+            if (start >= position) {
+                if (position >= foundChild.pos) {
+                    // We are in the leading trivia of foundChild. Check for JSDoc nodes of n
+                    // preceding foundChild, mirroring Go's findPrecedingToken logic.
+                    let jsDoc;
+                    if (n.jsDoc) {
+                        for (let i = n.jsDoc.length - 1; i >= 0; i--) {
+                            if (n.jsDoc[i].pos >= foundChild.pos) {
+                                jsDoc = n.jsDoc[i];
+                                break;
+                            }
+                        }
+                    }
+                    if (jsDoc !== undefined) {
+                        if (position < jsDoc.end) {
+                            return find(jsDoc);
+                        }
+                        return findRightmostValidToken(sourceFile, jsDoc.end, n, position);
+                    }
+                    return findRightmostValidToken(sourceFile, foundChild.pos, n, -1);
+                }
+                // Answer is in tokens between two visited children.
+                return findRightmostValidToken(sourceFile, foundChild.pos, n, position);
+            }
+            return find(foundChild);
+        }
+        if (position >= n.end) {
+            return findRightmostValidToken(sourceFile, n.end, n, -1);
+        }
+        return findRightmostValidToken(sourceFile, n.end, n, position);
+    };
+    return find(startNode);
+}
+function findRightmostValidToken(sourceFile, endPos, containingNode, position) {
+    if (position === -1) {
+        position = containingNode.end;
+    }
+    const find = (n, endPos) => {
+        if (isTokenKind(n.kind) && n.kind !== SyntaxKind.EndOfFile) {
+            return n;
+        }
+        let rightmostValidNode;
+        let hasChildren = false;
+        // Visit JSDoc nodes first (mirrors Go's VisitEachChildAndJSDoc).
+        if (n.jsDoc) {
+            hasChildren = true;
+            for (const jsdoc of n.jsDoc) {
+                if (jsdoc.flags & NodeFlags.Reparsed)
+                    continue;
+                if (jsdoc.end > endPos || getTokenPosOfNode(jsdoc, sourceFile) >= position)
+                    continue;
+                if (isValidPrecedingNode(jsdoc, sourceFile)) {
+                    rightmostValidNode = jsdoc;
+                }
+            }
+        }
+        let skipSingleCommentChildren = false;
+        n.forEachChild(node => {
+            if (node.flags & NodeFlags.Reparsed) {
+                return undefined;
+            }
+            if (skipSingleCommentChildren && isJSDocCommentChildKind(node.kind)) {
+                return undefined;
+            }
+            hasChildren = true;
+            if (node.end > endPos || getTokenPosOfNode(node, sourceFile) >= position) {
+                return undefined;
+            }
+            if (isValidPrecedingNode(node, sourceFile)) {
+                rightmostValidNode = node;
+            }
+            return undefined;
+        }, nodes => {
+            // Skip single-comment JSDoc NodeLists (e.g. JSDocText children of a JSDoc node):
+            // In Go, these are stored as string properties and are never visited as children.
+            skipSingleCommentChildren = isJSDocSingleCommentNodeList(nodes);
+            if (nodes.length > 0 && !skipSingleCommentChildren) {
+                hasChildren = true;
+                for (let i = nodes.length - 1; i >= 0; i--) {
+                    const node = nodes[i];
+                    if (node.flags & NodeFlags.Reparsed)
+                        continue;
+                    if (node.end > endPos || getTokenPosOfNode(node, sourceFile) >= position)
+                        continue;
+                    if (isValidPrecedingNode(node, sourceFile)) {
+                        rightmostValidNode = node;
+                        break;
+                    }
+                }
+            }
+            return undefined;
+        });
+        // Scan for syntactic tokens (e.g. `{`, `,`) between AST nodes, matching Go's
+        // findRightmostValidToken scanner step.
+        if (!shouldSkipChild(n)) {
+            const startPos = rightmostValidNode !== undefined ? rightmostValidNode.end : n.pos;
+            const targetEnd = Math.min(endPos, position);
+            if (startPos < targetEnd) {
+                const scanner = getScannerForSourceFile(sourceFile, startPos);
+                let pos = startPos;
+                let lastScannedToken;
+                while (pos < targetEnd) {
+                    const tokenStart = scanner.getTokenStart();
+                    if (tokenStart >= position)
+                        break;
+                    const tokenFullStart = scanner.getTokenFullStart();
+                    const tokenEnd = scanner.getTokenEnd();
+                    const token = scanner.getToken();
+                    const flags = scanner.getTokenFlags();
+                    lastScannedToken = getOrCreateToken(sourceFile, token, tokenFullStart, tokenEnd, n, flags);
+                    pos = tokenEnd;
+                    scanner.scan();
+                }
+                if (lastScannedToken !== undefined) {
+                    return lastScannedToken;
+                }
+            }
+        }
+        if (!hasChildren) {
+            if (n !== containingNode) {
+                return n;
+            }
+            return undefined;
+        }
+        if (rightmostValidNode !== undefined) {
+            return find(rightmostValidNode, rightmostValidNode.end);
+        }
+        return undefined;
+    };
+    return find(containingNode, endPos);
+}
+function isValidPrecedingNode(node, sourceFile) {
+    if (node.kind === SyntaxKind.EndOfFile) {
+        return false;
+    }
+    const start = getTokenPosOfNode(node, sourceFile);
+    const width = node.end - start;
+    return width > 0;
+}
+function shouldSkipChild(node) {
+    return node.kind === SyntaxKind.JSDoc ||
+        node.kind === SyntaxKind.JSDocText ||
+        node.kind === SyntaxKind.JSDocTypeLiteral ||
+        node.kind === SyntaxKind.JSDocSignature ||
+        node.kind === SyntaxKind.JSDocLink ||
+        node.kind === SyntaxKind.JSDocLinkCode ||
+        node.kind === SyntaxKind.JSDocLinkPlain ||
+        isJSDocTag(node);
+}
+function isJSDocTag(node) {
+    return node.kind >= SyntaxKind.FirstJSDocTagNode && node.kind <= SyntaxKind.LastJSDocTagNode;
+}
+// In Strada, if a JSDoc node has a single comment, that comment is represented as a string
+// property as a simplification, and therefore that comment is not visited by forEachChild.
+// To match, we skip single-element comment NodeLists within JSDoc/JSDocTag nodes.
+function isJSDocCommentChildKind(kind) {
+    switch (kind) {
+        case SyntaxKind.JSDocText:
+        case SyntaxKind.JSDocLink:
+        case SyntaxKind.JSDocLinkCode:
+        case SyntaxKind.JSDocLinkPlain:
+            return true;
+        default:
+            return false;
+    }
+}
+function isJSDocSingleCommentNodeList(nodes) {
+    return nodes.length === 1 && isJSDocCommentChildKind(nodes[0].kind);
+}
+function getScannerForSourceFile(sourceFile, pos) {
+    const scanner = createScanner(/*skipTrivia*/ true, sourceFile.languageVariant, sourceFile.text);
+    scanner.resetTokenState(pos);
+    scanner.scan();
+    return scanner;
+}
+function getOrCreateToken(sourceFile, kind, pos, end, parent, _flags) {
+    const key = `${pos}_${end}`;
+    if (!sourceFile.tokenCache) {
+        sourceFile.tokenCache = new Map();
+    }
+    const existing = sourceFile.tokenCache.get(key);
+    if (existing !== undefined) {
+        return existing;
+    }
+    const token = createToken(kind);
+    token.pos = pos;
+    token.end = end;
+    token.parent = parent;
+    sourceFile.tokenCache.set(key, token);
+    return token;
+}
+/** Binary search a node list for the node containing position. */
+function binarySearchNodeList(nodes, testNode, onLeft, onMatch) {
+    let lo = 0;
+    let hi = nodes.length - 1;
+    while (lo <= hi) {
+        const mid = (lo + hi) >>> 1;
+        const node = nodes[mid];
+        if (node.flags & NodeFlags.Reparsed) {
+            // Skip reparsed nodes: try to find a non-reparsed node nearby
+            let found = false;
+            for (let i = mid + 1; i <= hi; i++) {
+                if (!(nodes[i].flags & NodeFlags.Reparsed)) {
+                    const cmp = testNode(nodes[i]);
+                    if (cmp < 0) {
+                        onLeft(nodes[i], i, nodes);
+                        lo = i + 1;
+                    }
+                    else if (cmp > 0) {
+                        hi = i - 1;
+                    }
+                    else {
+                        onMatch(nodes[i]);
+                        return;
+                    }
+                    found = true;
+                    break;
+                }
+            }
+            if (!found) {
+                hi = mid - 1;
+            }
+            continue;
+        }
+        const cmp = testNode(node);
+        if (cmp < 0) {
+            onLeft(node, mid, nodes);
+            lo = mid + 1;
+        }
+        else if (cmp > 0) {
+            hi = mid - 1;
+        }
+        else {
+            onMatch(node);
+            return;
+        }
+    }
+}
+function binarySearchForPrecedingToken(nodes, position) {
+    let lo = 0;
+    let hi = nodes.length - 1;
+    let result = -1;
+    while (lo <= hi) {
+        const mid = (lo + hi) >>> 1;
+        const node = nodes[mid];
+        if (node.flags & NodeFlags.Reparsed) {
+            lo = mid + 1;
+            continue;
+        }
+        if (position < node.end) {
+            if (mid === 0 || position >= nodes[mid - 1].end) {
+                result = mid;
+                break;
+            }
+            hi = mid - 1;
+        }
+        else {
+            lo = mid + 1;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=astnav.js.map

package/dist/ast/astnav.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"astnav.js","sourceRoot":"","sources":["../../src/ast/astnav.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAO/C,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EACH,eAAe,EACf,aAAa,EACb,mBAAmB,EACnB,qBAAqB,EACrB,WAAW,GACd,MAAM,SAAS,CAAC;AACjB,OAAO,EACH,aAAa,EACb,UAAU,GACb,MAAM,cAAc,CAAC;AAEtB,MAAM,UAAU,kBAAkB,CAAC,UAAsB,EAAE,QAAgB;IACvE,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,gCAAgC,CAAC,IAAI,EAAE,sCAAsC,CAAC,SAAS,CAAC,CAAC;AACjJ,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,UAAsB,EAAE,QAAgB;IAC5E,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,gCAAgC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9L,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,UAAsB,EAAE,QAAgB;IACrE,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,gCAAgC,CAAC,KAAK,EAAE,sCAAsC,CAAC,SAAS,CAAC,CAAC;AAClJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,aAAmB,EAAE,MAAY,EAAE,UAAsB;IACnF,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;IAEpB,SAAS,IAAI,CAAC,CAAO;QACjB,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,aAAa,CAAC,GAAG,EAAE,CAAC;YACrD,yEAAyE;YACzE,OAAO,CAAC,CAAC;QACb,CAAC;QAED,oFAAoF;QACpF,IAAI,SAA2B,CAAC;QAEhC,MAAM,UAAU,GAAG,CAAC,IAAU,EAAE,EAAE;YAC9B,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;gBAClC,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,IAAI,aAAa,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC;gBAChE,SAAS,GAAG,IAAI,CAAC;YACrB,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CAAC;QAEF,oEAAoE;QACpE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACV,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1B,UAAU,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;QAED,CAAC,CAAC,YAAY,CACV,UAAU,EACV,KAAK,CAAC,EAAE;YACJ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACvB,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ;wBAAE,SAAS;oBAC9C,IAAI,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,GAAG;wBAAE,MAAM;oBACxC,IAAI,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC;wBAC/B,SAAS,GAAG,IAAI,CAAC;wBACjB,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CACJ,CAAC;QAEF,gCAAgC;QAChC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3B,CAAC;QAED,iFAAiF;QACjF,8FAA8F;QAC9F,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC;QACnC,IAAI,QAAQ,IAAI,CAAC,CAAC,GAAG,IAAI,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,MAAM,cAAc,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;YACtC,OAAO,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACnF,CAAC;QAED,OAAO,SAAS,CAAC;IACrB,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAsB,EAAE,QAAgB;IACvE,OAAO,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AACpE,CAAC;AAED,SAAS,sBAAsB,CAC3B,UAAsB,EACtB,QAAgB,EAChB,4BAAqC,EACrC,kCAAyE;IAEzE,IAAI,OAAO,GAAS,UAAU,CAAC;IAC/B,IAAI,aAA+B,CAAC;IACpC,MAAM,KAAK,GAIP;QACA,IAAI,EAAE,SAAS;QACf,WAAW,EAAE,SAAS;QACtB,IAAI,EAAE,CAAC;KACV,CAAC;IAEF,MAAM,QAAQ,GAAG,CAAC,IAAU,EAAU,EAAE;QACpC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,KAAK,QAAQ,IAAI,kCAAkC,KAAK,SAAS,EAAE,CAAC;YAClH,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7B,CAAC;QACD,iFAAiF;QACjF,iFAAiF;QACjF,oFAAoF;QACpF,IACI,IAAI,CAAC,GAAG,GAAG,QAAQ,IAAI,IAAI,CAAC,GAAG,KAAK,QAAQ;YACxC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS;YAClC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,CAAC,cAAc,CAAC,GAAG,CAAC,EACjF,CAAC;YACC,OAAO,CAAC,CAAC,CAAC;QACd,CAAC;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,UAAU,EAAE,4BAA4B,CAAC,CAAC;QAC5E,IAAI,OAAO,GAAG,QAAQ,EAAE,CAAC;YACrB,OAAO,CAAC,CAAC;QACb,CAAC;QACD,OAAO,CAAC,CAAC;IACb,CAAC,CAAC;IAEF,OAAO,IAAI,EAAE,CAAC;QACV,uEAAuE;QACvE,KAAK,CAAC,IAAI,GAAG,SAAS,CAAC;QACvB,aAAa,GAAG,SAA6B,CAAC;QAE9C,kFAAkF;QAClF,oFAAoF;QACpF,+FAA+F;QAC/F,IAAI,yBAAyB,GAAG,KAAK,CAAC;QAEtC,MAAM,SAAS,GAAG,CAAC,IAAU,EAAE,EAAE;YAC7B,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;gBAClC,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,yBAAyB,IAAI,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClE,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAC9B,aAAa,GAAG,IAAI,CAAC;YACzB,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC9B,QAAQ,MAAM,EAAE,CAAC;oBACb,KAAK,CAAC,CAAC;wBACH,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;4BAC9B,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;wBAC1B,CAAC;wBACD,aAAa,GAAG,SAAS,CAAC;wBAC1B,MAAM;oBACV,KAAK,CAAC;wBACF,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;wBAClB,MAAM;gBACd,CAAC;YACL,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CAAC;QAEF,2FAA2F;QAC3F,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChC,SAAS,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,OAAO,CAAC,YAAY,CAChB,SAAS,EACT,KAAK,CAAC,EAAE;YACJ,+EAA+E;YAC/E,kFAAkF;YAClF,yBAAyB,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;YAChE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,yBAAyB,EAAE,CAAC;gBAClD,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACvB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACrC,aAAa,GAAG,IAAI,CAAC;wBACrB,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,kCAAkC,KAAK,SAAS,EAAE,CAAC;oBAC7E,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC;oBACvB,aAAa,GAAG,SAAS,CAAC;oBAC1B,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChD,CAAC;qBACI,IAAI,KAAK,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC;oBACvB,aAAa,GAAG,SAAS,CAAC;gBAC9B,CAAC;qBACI,IAAI,KAAK,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;oBAC7B,oBAAoB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;wBACxD,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;wBACtB,aAAa,GAAG,SAAS,CAAC;wBAC1B,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;gCACvC,aAAa,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gCACvB,MAAM;4BACV,CAAC;wBACL,CAAC;oBACL,CAAC,EAAE,KAAK,CAAC,EAAE;wBACP,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;oBACvB,CAAC,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CACJ,CAAC;QAEF,0FAA0F;QAC1F,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,sBAAsB,CAAC,UAAU,EAAE,QAAQ,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;YAC9E,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,kCAAmC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9F,OAAO,KAAK,CAAC;YACjB,CAAC;YACD,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC;QAClC,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC;gBACxD,OAAO,OAAO,CAAC;YACnB,CAAC;YACD,yDAAyD;YACzD,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAChE,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;YACtB,MAAM,SAAS,GAAG,aAAa,CAAC;YAChC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC1B,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC;YACxB,CAAC;YACD,OAAO,KAAK,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;gBACtB,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACjC,MAAM,cAAc,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,4BAA4B,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;gBAC3F,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;gBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;gBACtC,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;oBACjB,MAAM;gBACV,CAAC;gBACD,IAAI,UAAU,IAAI,QAAQ,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;oBAChD,IAAI,KAAK,KAAK,UAAU,CAAC,UAAU,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBACzD,IAAI,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;4BAChC,OAAO,OAAO,CAAC;wBACnB,CAAC;wBACD,MAAM,IAAI,KAAK,CAAC,kBAAkB,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,UAAU,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;oBAC7G,CAAC;oBACD,OAAO,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;gBACzF,CAAC;gBACD,IAAI,kCAAkC,KAAK,SAAS,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC5E,MAAM,SAAS,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;oBAChG,IAAI,kCAAkC,CAAC,SAAS,CAAC,EAAE,CAAC;wBAChD,OAAO,SAAS,CAAC;oBACrB,CAAC;gBACL,CAAC;gBACD,KAAK,CAAC,IAAI,GAAG,QAAQ,CAAC;gBACtB,OAAO,CAAC,IAAI,EAAE,CAAC;YACnB,CAAC;YACD,OAAO,OAAO,CAAC;QACnB,CAAC;QAED,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC;QACrB,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC;QACzB,aAAa,GAAG,SAAS,CAAC;IAC9B,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,IAAU,EAAE,UAAsB,EAAE,4BAAqC;IAC1F,IAAI,4BAA4B,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,OAAO,iBAAiB,CAAC,IAAI,EAAE,UAAU,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC;AACtE,CAAC;AAED,gBAAgB;AAChB,MAAM,UAAU,iBAAiB,CAAC,IAAU,EAAE,UAAsB,EAAE,YAAsB;IACxF,4EAA4E;IAC5E,6EAA6E;IAC7E,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,OAAO,EAAE,CAAC;QACjE,OAAO,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,sBAAsB,CAAC,KAAK,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACxG,CAAC;IACD,IAAI,YAAY,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,OAAO,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,UAAU,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,sBAAsB,CAAC,KAAK,EAAE,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;AACvJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAU;IAC7B,OAAO,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS,CAAC;AACxF,CAAC;AAED,SAAS,sBAAsB,CAAC,UAAsB,EAAE,QAAgB,EAAE,SAAe;IACrF,MAAM,IAAI,GAAG,CAAC,CAAO,EAAoB,EAAE;QACvC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS,EAAE,CAAC;YACzD,OAAO,CAAC,CAAC;QACb,CAAC;QAED,IAAI,UAA4B,CAAC;QACjC,IAAI,SAA2B,CAAC;QAEhC,iEAAiE;QACjE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACV,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ;oBAAE,SAAS;gBAC/C,IAAI,UAAU,KAAK,SAAS;oBAAE,MAAM;gBACpC,IAAI,QAAQ,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC;oBACjF,UAAU,GAAG,KAAK,CAAC;gBACvB,CAAC;qBACI,CAAC;oBACF,SAAS,GAAG,KAAK,CAAC;gBACtB,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,6BAA6B,GAAG,KAAK,CAAC;QAC1C,CAAC,CAAC,YAAY,CACV,IAAI,CAAC,EAAE;YACH,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;gBAClC,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,6BAA6B,IAAI,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtE,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC;gBAChF,UAAU,GAAG,IAAI,CAAC;YACtB,CAAC;iBACI,CAAC;gBACF,SAAS,GAAG,IAAI,CAAC;YACrB,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,EACD,KAAK,CAAC,EAAE;YACJ,6BAA6B,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;YACpE,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,6BAA6B,EAAE,CAAC;gBACrD,MAAM,KAAK,GAAG,6BAA6B,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC7D,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3D,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;gBACD,MAAM,WAAW,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACpC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACzC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;4BAC1B,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACzB,CAAC;wBACD,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CACJ,CAAC;QAEF,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,iBAAiB,CAAC,UAAU,EAAE,UAAU,EAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC/E,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACpB,IAAI,QAAQ,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC;oBAC7B,yEAAyE;oBACzE,iEAAiE;oBACjE,IAAI,KAAuB,CAAC;oBAC5B,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;wBACV,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC3C,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC;gCACnC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gCACnB,MAAM;4BACV,CAAC;wBACL,CAAC;oBACL,CAAC;oBACD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;wBACtB,IAAI,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;4BACvB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;wBACvB,CAAC;wBACD,OAAO,uBAAuB,CAAC,UAAU,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACvE,CAAC;oBACD,OAAO,uBAAuB,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC;gBACD,oDAAoD;gBACpD,OAAO,uBAAuB,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC5E,CAAC;YACD,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,QAAQ,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;YACpB,OAAO,uBAAuB,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,uBAAuB,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACnE,CAAC,CAAC;IAEF,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,uBAAuB,CAAC,UAAsB,EAAE,MAAc,EAAE,cAAoB,EAAE,QAAgB;IAC3G,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC;IAClC,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,MAAc,EAAoB,EAAE;QACvD,IAAI,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS,EAAE,CAAC;YACzD,OAAO,CAAC,CAAC;QACb,CAAC;QAED,IAAI,kBAAoC,CAAC;QACzC,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,iEAAiE;QACjE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACV,WAAW,GAAG,IAAI,CAAC;YACnB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1B,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ;oBAAE,SAAS;gBAC/C,IAAI,KAAK,CAAC,GAAG,GAAG,MAAM,IAAI,iBAAiB,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,QAAQ;oBAAE,SAAS;gBACrF,IAAI,oBAAoB,CAAC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;oBAC1C,kBAAkB,GAAG,KAAK,CAAC;gBAC/B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,yBAAyB,GAAG,KAAK,CAAC;QACtC,CAAC,CAAC,YAAY,CACV,IAAI,CAAC,EAAE;YACH,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;gBAClC,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,yBAAyB,IAAI,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClE,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,WAAW,GAAG,IAAI,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,GAAG,MAAM,IAAI,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACvE,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,IAAI,oBAAoB,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;gBACzC,kBAAkB,GAAG,IAAI,CAAC;YAC9B,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,EACD,KAAK,CAAC,EAAE;YACJ,iFAAiF;YACjF,kFAAkF;YAClF,yBAAyB,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;YAChE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,yBAAyB,EAAE,CAAC;gBACjD,WAAW,GAAG,IAAI,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ;wBAAE,SAAS;oBAC9C,IAAI,IAAI,CAAC,GAAG,GAAG,MAAM,IAAI,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,QAAQ;wBAAE,SAAS;oBACnF,IAAI,oBAAoB,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;wBACzC,kBAAkB,GAAG,IAAI,CAAC;wBAC1B,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC,CACJ,CAAC;QAEF,6EAA6E;QAC7E,wCAAwC;QACxC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,kBAAkB,KAAK,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACnF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,QAAQ,GAAG,SAAS,EAAE,CAAC;gBACvB,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBAC9D,IAAI,GAAG,GAAG,QAAQ,CAAC;gBACnB,IAAI,gBAAkC,CAAC;gBACvC,OAAO,GAAG,GAAG,SAAS,EAAE,CAAC;oBACrB,MAAM,UAAU,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;oBAC3C,IAAI,UAAU,IAAI,QAAQ;wBAAE,MAAM;oBAClC,MAAM,cAAc,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;oBACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;oBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACjC,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;oBACtC,gBAAgB,GAAG,gBAAgB,CAAC,UAAU,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;oBAC3F,GAAG,GAAG,QAAQ,CAAC;oBACf,OAAO,CAAC,IAAI,EAAE,CAAC;gBACnB,CAAC;gBACD,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;oBACjC,OAAO,gBAAgB,CAAC;gBAC5B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,CAAC,WAAW,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,cAAc,EAAE,CAAC;gBACvB,OAAO,CAAC,CAAC;YACb,CAAC;YACD,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC,CAAC;IAEF,OAAO,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAU,EAAE,UAAsB;IAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS,EAAE,CAAC;QACrC,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC;IAC/B,OAAO,KAAK,GAAG,CAAC,CAAC;AACrB,CAAC;AAED,SAAS,eAAe,CAAC,IAAU;IAC/B,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,KAAK;QACjC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS;QAClC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,gBAAgB;QACzC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,cAAc;QACvC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,SAAS;QAClC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,aAAa;QACtC,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,cAAc;QACvC,UAAU,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,UAAU,CAAC,IAAU;IAC1B,OAAO,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,iBAAiB,IAAI,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,gBAAgB,CAAC;AACjG,CAAC;AAED,2FAA2F;AAC3F,2FAA2F;AAC3F,kFAAkF;AAClF,SAAS,uBAAuB,CAAC,IAAgB;IAC7C,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,UAAU,CAAC,SAAS,CAAC;QAC1B,KAAK,UAAU,CAAC,SAAS,CAAC;QAC1B,KAAK,UAAU,CAAC,aAAa,CAAC;QAC9B,KAAK,UAAU,CAAC,cAAc;YAC1B,OAAO,IAAI,CAAC;QAChB;YACI,OAAO,KAAK,CAAC;IACrB,CAAC;AACL,CAAC;AAED,SAAS,4BAA4B,CAAC,KAAsB;IACxD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,uBAAuB,CAAC,UAAsB,EAAE,GAAW;IAChE,MAAM,OAAO,GAAG,aAAa,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,eAAe,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;IAChG,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IAC7B,OAAO,CAAC,IAAI,EAAE,CAAC;IACf,OAAO,OAAO,CAAC;AACnB,CAAC;AAID,SAAS,gBAAgB,CAAC,UAAsB,EAAE,IAAgB,EAAE,GAAW,EAAE,GAAW,EAAE,MAAY,EAAE,MAAc;IACtH,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IAC5B,IAAI,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC;QACzB,UAAU,CAAC,UAAU,GAAG,IAAI,GAAG,EAAgB,CAAC;IACpD,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAkB,WAAW,CAAC,IAAuB,CAAC,CAAC;IAClE,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC;IAChB,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,kEAAkE;AAClE,SAAS,oBAAoB,CACzB,KAAsB,EACtB,QAAgC,EAChC,MAAiE,EACjE,OAA6B;IAE7B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QACd,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClC,8DAA8D;YAC9D,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/B,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;wBACV,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;wBAC3B,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;oBACf,CAAC;yBACI,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;wBACf,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;oBACf,CAAC;yBACI,CAAC;wBACF,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;wBAClB,OAAO;oBACX,CAAC;oBACD,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM;gBACV,CAAC;YACL,CAAC;YACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YACjB,CAAC;YACD,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACzB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aACI,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aACI,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,CAAC;YACd,OAAO;QACX,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,6BAA6B,CAAC,KAAsB,EAAE,QAAgB;IAC3E,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QACd,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClC,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;YACb,SAAS;QACb,CAAC;QACD,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACtB,IAAI,GAAG,KAAK,CAAC,IAAI,QAAQ,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAG,CAAC;gBACb,MAAM;YACV,CAAC;YACD,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aACI,CAAC;YACF,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/ast/clone.d.ts

@@ -0,0 +1,16 @@
+import type { Node, NodeArray } from "./ast.ts";
+/**
+ * Creates a deep clone of a node and its subtree, synthesizing new nodes for every child.
+ * The resulting tree has fully set parent pointers.
+ *
+ * @param node The node to clone.
+ * @param includeTrivia Whether to preserve the text range (pos/end) on the clone.
+ */
+export declare function getSynthesizedDeepClone<T extends Node>(node: T, includeTrivia?: boolean): T;
+export declare function getSynthesizedDeepClone<T extends Node>(node: T | undefined, includeTrivia?: boolean): T | undefined;
+/**
+ * Creates deep clones of a NodeArray and all its elements.
+ */
+export declare function getSynthesizedDeepClones<T extends Node>(nodes: NodeArray<T>, includeTrivia?: boolean): NodeArray<T>;
+export declare function getSynthesizedDeepClones<T extends Node>(nodes: NodeArray<T> | undefined, includeTrivia?: boolean): NodeArray<T> | undefined;
+//# sourceMappingURL=clone.d.ts.map

package/dist/ast/clone.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone.d.ts","sourceRoot":"","sources":["../../src/ast/clone.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACR,IAAI,EACJ,SAAS,EAIZ,MAAM,UAAU,CAAC;AAgFlB;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC;AAC7F,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC;AAUrH;;GAEG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,SAAS,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AACrH,wBAAgB,wBAAwB,CAAC,CAAC,SAAS,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC"}