optave-codegraph 3.13.0

package/dist/ast-analysis/visitor-utils.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Shared AST helper functions used by multiple visitors (dataflow, etc.).
+ *
+ * Extracted from dataflow.js to be reusable across the visitor framework.
+ */
+import type { TreeSitterNode } from '../types.js';
+interface ParamInfo {
+    name: string;
+    index: number;
+}
+interface LanguageRules {
+    nameField: string;
+    nameExtractor?: ((node: TreeSitterNode) => string | null) | null;
+    varAssignedFnParent?: string;
+    pairFnParent?: string;
+    assignmentFnParent?: string;
+    assignLeftField?: string;
+    paramIdentifier: string;
+    paramWrapperTypes: Set<string>;
+    defaultParamType?: string;
+    restParamType?: string;
+    objectDestructType?: string;
+    shorthandPropPattern?: string;
+    pairPatternType?: string;
+    arrayDestructType?: string;
+    extraIdentifierTypes?: Set<string>;
+    callFunctionField: string;
+    memberNode: string;
+    memberPropertyField: string;
+    memberObjectField: string;
+    optionalChainNode?: string;
+    extractParamName?(node: TreeSitterNode): string[] | null;
+}
+/**
+ * Truncate a string to a maximum length.
+ */
+export declare function truncate(str: string, max?: number): string;
+/**
+ * Get the name of a function node from the AST using rules.
+ */
+export declare function functionName(fnNode: TreeSitterNode | null, rules: LanguageRules): string | null;
+/**
+ * Extract parameter names and indices from a formal_parameters node.
+ */
+export declare function extractParams(paramsNode: TreeSitterNode | null, rules: LanguageRules): ParamInfo[];
+/**
+ * Extract parameter names from a single parameter node.
+ *
+ * Uses an iterative worklist to handle nested destructuring (objects, arrays,
+ * defaults, rest, wrappers) without mutual recursion through helper functions.
+ */
+export declare function extractParamNames(node: TreeSitterNode | null, rules: LanguageRules): string[];
+/**
+ * Check if a node type is identifier-like for this language.
+ */
+export declare function isIdent(nodeType: string, rules: LanguageRules): boolean;
+/**
+ * Resolve the name a call expression is calling using rules.
+ */
+export declare function resolveCalleeName(callNode: TreeSitterNode, rules: LanguageRules): string | null;
+/**
+ * Get the receiver (object) of a member expression using rules.
+ */
+export declare function memberReceiver(memberExpr: TreeSitterNode, rules: LanguageRules): string | null;
+/**
+ * Collect all identifier names referenced within a node.
+ */
+export declare function collectIdentifiers(node: TreeSitterNode | null, out: string[], rules: LanguageRules): void;
+export {};
+//# sourceMappingURL=visitor-utils.d.ts.map

package/dist/ast-analysis/visitor-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor-utils.d.ts","sourceRoot":"","sources":["../../src/ast-analysis/visitor-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,UAAU,SAAS;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,UAAU,aAAa;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,cAAc,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IACjE,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,CAAC;IACxB,iBAAiB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,oBAAoB,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,gBAAgB,CAAC,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC;CAC1D;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,SAAM,GAAG,MAAM,CAGvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG,IAAI,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,IAAI,CAyB/F;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,UAAU,EAAE,cAAc,GAAG,IAAI,EACjC,KAAK,EAAE,aAAa,GACnB,SAAS,EAAE,CAYb;AA+ED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,cAAc,GAAG,IAAI,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,EAAE,CA6B7F;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,OAAO,CAGvE;AAeD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,IAAI,CAe/F;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,UAAU,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,GAAG,MAAM,GAAG,IAAI,CAM9F;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,cAAc,GAAG,IAAI,EAC3B,GAAG,EAAE,MAAM,EAAE,EACb,KAAK,EAAE,aAAa,GACnB,IAAI,CASN"}

package/dist/ast-analysis/visitor-utils.js

@@ -0,0 +1,235 @@
+/**
+ * Shared AST helper functions used by multiple visitors (dataflow, etc.).
+ *
+ * Extracted from dataflow.js to be reusable across the visitor framework.
+ */
+/**
+ * Truncate a string to a maximum length.
+ */
+export function truncate(str, max = 120) {
+    if (!str)
+        return '';
+    return str.length > max ? `${str.slice(0, max)}…` : str;
+}
+/**
+ * Get the name of a function node from the AST using rules.
+ */
+export function functionName(fnNode, rules) {
+    if (!fnNode)
+        return null;
+    if (rules.nameExtractor) {
+        const extracted = rules.nameExtractor(fnNode);
+        if (extracted)
+            return extracted;
+    }
+    const nameNode = fnNode.childForFieldName(rules.nameField);
+    if (nameNode)
+        return nameNode.text;
+    const parent = fnNode.parent;
+    if (parent) {
+        if (rules.varAssignedFnParent && parent.type === rules.varAssignedFnParent) {
+            const n = parent.childForFieldName('name');
+            return n ? n.text : null;
+        }
+        if (rules.pairFnParent && parent.type === rules.pairFnParent) {
+            const keyNode = parent.childForFieldName('key');
+            return keyNode ? keyNode.text : null;
+        }
+        if (rules.assignmentFnParent && parent.type === rules.assignmentFnParent) {
+            const left = parent.childForFieldName(rules.assignLeftField);
+            return left ? left.text : null;
+        }
+    }
+    return null;
+}
+/**
+ * Extract parameter names and indices from a formal_parameters node.
+ */
+export function extractParams(paramsNode, rules) {
+    if (!paramsNode)
+        return [];
+    const result = [];
+    let index = 0;
+    for (const child of paramsNode.namedChildren) {
+        const names = extractParamNames(child, rules);
+        for (const name of names) {
+            result.push({ name, index });
+        }
+        index++;
+    }
+    return result;
+}
+/**
+ * Resolve a single parameter node to either a direct list of names (base case)
+ * or a list of child nodes that still need processing. Returns `null` if the
+ * node yields nothing.
+ *
+ * This base case keeps destructuring helpers from recursing back into
+ * `extractParamNames`, breaking the 3-node mutual recursion cycle between
+ * `extractParamNames`, `extractObjectDestructNames`, and `extractArrayDestructNames`.
+ */
+function resolveParamNode(node, rules) {
+    const t = node.type;
+    if (rules.extractParamName) {
+        const result = rules.extractParamName(node);
+        if (result)
+            return { names: result };
+    }
+    if (t === rules.paramIdentifier)
+        return { names: [node.text] };
+    if (rules.paramWrapperTypes.has(t)) {
+        const pattern = node.childForFieldName('pattern') || node.childForFieldName('name');
+        return pattern ? { next: [pattern] } : null;
+    }
+    if (rules.defaultParamType && t === rules.defaultParamType) {
+        const left = node.childForFieldName('left') || node.childForFieldName('name');
+        return left ? { next: [left] } : null;
+    }
+    if (rules.restParamType && t === rules.restParamType) {
+        const nameNode = node.childForFieldName('name');
+        if (nameNode)
+            return { names: [nameNode.text] };
+        for (const child of node.namedChildren) {
+            if (child.type === rules.paramIdentifier)
+                return { names: [child.text] };
+        }
+        return null;
+    }
+    if (rules.objectDestructType && t === rules.objectDestructType) {
+        return { next: collectObjectDestructChildren(node, rules) };
+    }
+    if (rules.arrayDestructType && t === rules.arrayDestructType) {
+        return { next: [...node.namedChildren] };
+    }
+    return null;
+}
+/**
+ * Collect child nodes from an object destructuring pattern that should be
+ * processed for further name extraction. Returns nodes (not names) so the
+ * caller drives traversal via a worklist instead of recursion.
+ */
+function collectObjectDestructChildren(node, rules) {
+    const next = [];
+    for (const child of node.namedChildren) {
+        if (rules.shorthandPropPattern && child.type === rules.shorthandPropPattern) {
+            // Shorthand prop is a direct identifier — handled by the shorthand
+            // guard in the `extractParamNames` worklist loop (before `resolveParamNode`).
+            next.push(child);
+        }
+        else if (rules.pairPatternType && child.type === rules.pairPatternType) {
+            const value = child.childForFieldName('value');
+            if (value)
+                next.push(value);
+        }
+        else if (rules.restParamType && child.type === rules.restParamType) {
+            next.push(child);
+        }
+    }
+    return next;
+}
+/**
+ * Extract parameter names from a single parameter node.
+ *
+ * Uses an iterative worklist to handle nested destructuring (objects, arrays,
+ * defaults, rest, wrappers) without mutual recursion through helper functions.
+ */
+export function extractParamNames(node, rules) {
+    if (!node)
+        return [];
+    const names = [];
+    const stack = [node];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        if (!current)
+            continue;
+        // Shorthand identifier inside an object destructuring is just the node's text.
+        if (rules.shorthandPropPattern && current.type === rules.shorthandPropPattern) {
+            names.push(current.text);
+            continue;
+        }
+        const resolved = resolveParamNode(current, rules);
+        if (!resolved)
+            continue;
+        if (resolved.names)
+            names.push(...resolved.names);
+        if (resolved.next) {
+            // Push in reverse so traversal order matches the previous recursive order.
+            for (let i = resolved.next.length - 1; i >= 0; i--) {
+                const child = resolved.next[i];
+                if (child)
+                    stack.push(child);
+            }
+        }
+    }
+    return names;
+}
+/**
+ * Check if a node type is identifier-like for this language.
+ */
+export function isIdent(nodeType, rules) {
+    if (nodeType === 'identifier' || nodeType === rules.paramIdentifier)
+        return true;
+    return rules.extraIdentifierTypes ? rules.extraIdentifierTypes.has(nodeType) : false;
+}
+/** Resolve callee name from an optional chain node (e.g. `obj?.method()`). */
+function resolveOptionalChainCallee(fn, rules) {
+    const target = fn.namedChildren[0];
+    if (!target)
+        return null;
+    if (target.type === rules.memberNode) {
+        const prop = target.childForFieldName(rules.memberPropertyField);
+        return prop ? prop.text : null;
+    }
+    if (target.type === 'identifier')
+        return target.text;
+    const prop = fn.childForFieldName(rules.memberPropertyField);
+    return prop ? prop.text : null;
+}
+/**
+ * Resolve the name a call expression is calling using rules.
+ */
+export function resolveCalleeName(callNode, rules) {
+    const fn = callNode.childForFieldName(rules.callFunctionField);
+    if (!fn) {
+        const nameNode = callNode.childForFieldName('name') || callNode.childForFieldName('method');
+        return nameNode ? nameNode.text : null;
+    }
+    if (isIdent(fn.type, rules))
+        return fn.text;
+    if (fn.type === rules.memberNode) {
+        const prop = fn.childForFieldName(rules.memberPropertyField);
+        return prop ? prop.text : null;
+    }
+    if (rules.optionalChainNode && fn.type === rules.optionalChainNode) {
+        return resolveOptionalChainCallee(fn, rules);
+    }
+    return null;
+}
+/**
+ * Get the receiver (object) of a member expression using rules.
+ */
+export function memberReceiver(memberExpr, rules) {
+    const obj = memberExpr.childForFieldName(rules.memberObjectField);
+    if (!obj)
+        return null;
+    if (isIdent(obj.type, rules))
+        return obj.text;
+    if (obj.type === rules.memberNode)
+        return memberReceiver(obj, rules);
+    return null;
+}
+/**
+ * Collect all identifier names referenced within a node.
+ */
+export function collectIdentifiers(node, out, rules) {
+    if (!node)
+        return;
+    if (isIdent(node.type, rules)) {
+        out.push(node.text);
+        return;
+    }
+    for (const child of node.namedChildren) {
+        collectIdentifiers(child, out, rules);
+    }
+}
+//# sourceMappingURL=visitor-utils.js.map

package/dist/ast-analysis/visitor-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor-utils.js","sourceRoot":"","sources":["../../src/ast-analysis/visitor-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAiCH;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAW,EAAE,GAAG,GAAG,GAAG;IAC7C,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IACpB,OAAO,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAA6B,EAAE,KAAoB;IAC9E,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,SAAS;YAAE,OAAO,SAAS,CAAC;IAClC,CAAC;IACD,MAAM,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC3D,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;IAEnC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,KAAK,CAAC,mBAAmB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,mBAAmB,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC3C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3B,CAAC;QACD,IAAI,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7D,MAAM,OAAO,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACvC,CAAC;QACD,IAAI,KAAK,CAAC,kBAAkB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACzE,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,eAAgB,CAAC,CAAC;YAC9D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,UAAiC,EACjC,KAAoB;IAEpB,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,KAAK,EAAE,CAAC;IACV,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,IAAoB,EACpB,KAAoB;IAEpB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IAEpB,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,MAAM;YAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IACvC,CAAC;IAED,IAAI,CAAC,KAAK,KAAK,CAAC,eAAe;QAAE,OAAO,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAE/D,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACpF,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9C,CAAC;IAED,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC9E,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IAED,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,OAAO,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,eAAe;gBAAE,OAAO,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,KAAK,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC/D,OAAO,EAAE,IAAI,EAAE,6BAA6B,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IAC9D,CAAC;IAED,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,KAAK,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC7D,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;IAC3C,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,6BAA6B,CACpC,IAAoB,EACpB,KAAoB;IAEpB,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,oBAAoB,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,oBAAoB,EAAE,CAAC;YAC5E,mEAAmE;YACnE,8EAA8E;YAC9E,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;aAAM,IAAI,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,eAAe,EAAE,CAAC;YACzE,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;YACrE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA2B,EAAE,KAAoB;IACjF,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAqB,CAAC,IAAI,CAAC,CAAC;IAEvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,+EAA+E;QAC/E,IAAI,KAAK,CAAC,oBAAoB,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,oBAAoB,EAAE,CAAC;YAC9E,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACzB,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxB,IAAI,QAAQ,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAClB,2EAA2E;YAC3E,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK;oBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,QAAgB,EAAE,KAAoB;IAC5D,IAAI,QAAQ,KAAK,YAAY,IAAI,QAAQ,KAAK,KAAK,CAAC,eAAe;QAAE,OAAO,IAAI,CAAC;IACjF,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACvF,CAAC;AAED,8EAA8E;AAC9E,SAAS,0BAA0B,CAAC,EAAkB,EAAE,KAAoB;IAC1E,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC;IACrD,MAAM,IAAI,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;IAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAwB,EAAE,KAAoB;IAC9E,MAAM,EAAE,GAAG,QAAQ,CAAC,iBAAiB,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC/D,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,MAAM,QAAQ,GAAG,QAAQ,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAC5F,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;IACD,IAAI,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC;IAC5C,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,iBAAiB,EAAE,CAAC;QACnE,OAAO,0BAA0B,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,UAA0B,EAAE,KAAoB;IAC7E,MAAM,GAAG,GAAG,UAAU,CAAC,iBAAiB,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAClE,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IAC9C,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU;QAAE,OAAO,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACrE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAA2B,EAC3B,GAAa,EACb,KAAoB;IAEpB,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAC9B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO;IACT,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACvC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;AACH,CAAC"}

package/dist/ast-analysis/visitor.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ */
+import type { TreeSitterNode, Visitor, WalkOptions, WalkResults } from '../types.js';
+/**
+ * Walk an AST root with multiple visitors in a single DFS pass.
+ *
+ * @param {object} rootNode   - tree-sitter root node to walk
+ * @param {Visitor[]} visitors - array of visitor objects
+ * @param {string} langId     - language identifier
+ * @param {object} [options]
+ * @param {Set}    [options.functionNodeTypes] - set of node types that are function boundaries
+ * @param {Set}    [options.nestingNodeTypes]  - set of node types that increase nesting depth
+ * @param {function} [options.getFunctionName] - (funcNode) => string|null
+ * @returns {object} Map of visitor.name → finish() result
+ */
+export declare function walkWithVisitors(rootNode: TreeSitterNode, visitors: Visitor[], langId: string, options?: WalkOptions): WalkResults;
+//# sourceMappingURL=visitor.d.ts.map

package/dist/ast-analysis/visitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor.d.ts","sourceRoot":"","sources":["../../src/ast-analysis/visitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAEV,cAAc,EACd,OAAO,EAEP,WAAW,EACX,WAAW,EACZ,MAAM,aAAa,CAAC;AA+NrB;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,cAAc,EACxB,QAAQ,EAAE,OAAO,EAAE,EACnB,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,WAAgB,GACxB,WAAW,CAIb"}

package/dist/ast-analysis/visitor.js

@@ -0,0 +1,178 @@
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ */
+import { debug } from '../infrastructure/logger.js';
+/** Merge each visitor's custom functionNodeTypes into the master set. */
+function mergeFunctionNodeTypes(visitors, base) {
+    const merged = new Set(base);
+    for (const v of visitors) {
+        if (v.functionNodeTypes) {
+            for (const t of v.functionNodeTypes)
+                merged.add(t);
+        }
+    }
+    return merged;
+}
+/** Initialize all visitors for a given language. */
+function initVisitors(visitors, langId) {
+    for (const v of visitors) {
+        if (v.init)
+            v.init(langId);
+    }
+}
+/** Check whether a visitor should be skipped at the current depth. */
+function isSkipped(skipDepths, visitorIndex, currentDepth) {
+    const skipAt = skipDepths.get(visitorIndex);
+    // Skipped if skip was requested at a shallower (or equal) depth
+    // We skip descendants, not the node itself, so skip when currentDepth > skipAt
+    return skipAt !== undefined && currentDepth > skipAt;
+}
+/** Dispatch enterFunction hooks to all non-skipped visitors. */
+function dispatchEnterFunction(visitors, skipDepths, node, funcName, context, depth) {
+    for (let i = 0; i < visitors.length; i++) {
+        const v = visitors[i];
+        if (v.enterFunction && !isSkipped(skipDepths, i, depth)) {
+            v.enterFunction(node, funcName, context);
+        }
+    }
+}
+/** Dispatch enterNode hooks and track skipChildren requests. */
+function dispatchEnterNode(visitors, skipDepths, node, context, depth) {
+    for (let i = 0; i < visitors.length; i++) {
+        const v = visitors[i];
+        if (v.enterNode && !isSkipped(skipDepths, i, depth)) {
+            const result = v.enterNode(node, context);
+            if (result?.skipChildren) {
+                skipDepths.set(i, depth);
+            }
+        }
+    }
+}
+/** Dispatch exitNode hooks to all non-skipped visitors. */
+function dispatchExitNode(visitors, skipDepths, node, context, depth) {
+    for (let i = 0; i < visitors.length; i++) {
+        const v = visitors[i];
+        if (v.exitNode && !isSkipped(skipDepths, i, depth)) {
+            v.exitNode(node, context);
+        }
+    }
+}
+/** Clear skip flags for visitors that started skipping at this depth. */
+function clearSkipFlags(skipDepths, visitorCount, depth) {
+    for (let i = 0; i < visitorCount; i++) {
+        if (skipDepths.get(i) === depth) {
+            skipDepths.delete(i);
+        }
+    }
+}
+/** Dispatch exitFunction hooks to all non-skipped visitors. */
+function dispatchExitFunction(visitors, skipDepths, node, funcName, context, depth) {
+    for (let i = 0; i < visitors.length; i++) {
+        const v = visitors[i];
+        if (v.exitFunction && !isSkipped(skipDepths, i, depth)) {
+            v.exitFunction(node, funcName, context);
+        }
+    }
+}
+/**
+ * Maximum AST depth before walk() bails out.  WASM-backed tree-sitter parsers
+ * have a smaller stack than native V8 (~64-256 KB).  Deep recursion in
+ * generated code, deeply nested object literals, or pathologically large
+ * switch statements can exhaust that stack, causing a V8 fatal error /
+ * segfault (#931).  500 levels is well beyond any realistic hand-written
+ * code while staying safely inside the WASM stack budget.
+ */
+const MAX_WALK_DEPTH = 500;
+/** Collect finish() results from all visitors into a name-keyed map. */
+function collectResults(visitors) {
+    const results = {};
+    for (const v of visitors) {
+        results[v.name] = v.finish ? v.finish() : undefined;
+    }
+    return results;
+}
+/** Build walk state from options: resolve function types, init visitors, create shared context. */
+function buildWalkState(visitors, langId, options) {
+    const { functionNodeTypes = new Set(), nestingNodeTypes = new Set(), getFunctionName = () => null, } = options;
+    const allFuncTypes = mergeFunctionNodeTypes(visitors, functionNodeTypes);
+    initVisitors(visitors, langId);
+    const scopeStack = [];
+    const context = {
+        nestingLevel: 0,
+        currentFunction: null,
+        langId,
+        scopeStack,
+    };
+    return {
+        visitors,
+        allFuncTypes,
+        nestingNodeTypes,
+        getFunctionName,
+        context,
+        scopeStack,
+        skipDepths: new Map(),
+    };
+}
+/** Single DFS step: dispatch enter/exit hooks and recurse into children. */
+function walkNode(state, node, depth) {
+    if (!node)
+        return;
+    if (depth > MAX_WALK_DEPTH) {
+        debug(`walkWithVisitors: AST depth limit (${MAX_WALK_DEPTH}) hit — subtree truncated`);
+        return;
+    }
+    const { visitors, allFuncTypes, nestingNodeTypes, getFunctionName, context, scopeStack, skipDepths, } = state;
+    const type = node.type;
+    const isFuncBoundary = allFuncTypes.has(type);
+    let funcName = null;
+    if (isFuncBoundary) {
+        funcName = getFunctionName(node);
+        context.currentFunction = node;
+        scopeStack.push({ funcName, funcNode: node, params: new Map(), locals: new Map() });
+        dispatchEnterFunction(visitors, skipDepths, node, funcName, context, depth);
+    }
+    dispatchEnterNode(visitors, skipDepths, node, context, depth);
+    const addsNesting = nestingNodeTypes.has(type);
+    if (addsNesting)
+        context.nestingLevel++;
+    for (let i = 0; i < node.childCount; i++) {
+        walkNode(state, node.child(i), depth + 1);
+    }
+    if (addsNesting)
+        context.nestingLevel--;
+    dispatchExitNode(visitors, skipDepths, node, context, depth);
+    clearSkipFlags(skipDepths, visitors.length, depth);
+    if (isFuncBoundary) {
+        dispatchExitFunction(visitors, skipDepths, node, funcName, context, depth);
+        scopeStack.pop();
+        context.currentFunction =
+            scopeStack.length > 0 ? scopeStack[scopeStack.length - 1].funcNode : null;
+    }
+}
+/**
+ * Walk an AST root with multiple visitors in a single DFS pass.
+ *
+ * @param {object} rootNode   - tree-sitter root node to walk
+ * @param {Visitor[]} visitors - array of visitor objects
+ * @param {string} langId     - language identifier
+ * @param {object} [options]
+ * @param {Set}    [options.functionNodeTypes] - set of node types that are function boundaries
+ * @param {Set}    [options.nestingNodeTypes]  - set of node types that increase nesting depth
+ * @param {function} [options.getFunctionName] - (funcNode) => string|null
+ * @returns {object} Map of visitor.name → finish() result
+ */
+export function walkWithVisitors(rootNode, visitors, langId, options = {}) {
+    const state = buildWalkState(visitors, langId, options);
+    walkNode(state, rootNode, 0);
+    return collectResults(visitors);
+}
+//# sourceMappingURL=visitor.js.map

package/dist/ast-analysis/visitor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor.js","sourceRoot":"","sources":["../../src/ast-analysis/visitor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AAUpD,yEAAyE;AACzE,SAAS,sBAAsB,CAAC,QAAmB,EAAE,IAAiB;IACpE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,iBAAiB;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,oDAAoD;AACpD,SAAS,YAAY,CAAC,QAAmB,EAAE,MAAc;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;AACH,CAAC;AAED,sEAAsE;AACtE,SAAS,SAAS,CAChB,UAA+B,EAC/B,YAAoB,EACpB,YAAoB;IAEpB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC5C,gEAAgE;IAChE,+EAA+E;IAC/E,OAAO,MAAM,KAAK,SAAS,IAAI,YAAY,GAAG,MAAM,CAAC;AACvD,CAAC;AAED,gEAAgE;AAChE,SAAS,qBAAqB,CAC5B,QAAmB,EACnB,UAA+B,EAC/B,IAAoB,EACpB,QAAuB,EACvB,OAAuB,EACvB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACxD,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAS,iBAAiB,CACxB,QAAmB,EACnB,UAA+B,EAC/B,IAAoB,EACpB,OAAuB,EACvB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC1C,IAAI,MAAM,EAAE,YAAY,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,SAAS,gBAAgB,CACvB,QAAmB,EACnB,UAA+B,EAC/B,IAAoB,EACpB,OAAuB,EACvB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACnD,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;AACH,CAAC;AAED,yEAAyE;AACzE,SAAS,cAAc,CACrB,UAA+B,EAC/B,YAAoB,EACpB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YAChC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,SAAS,oBAAoB,CAC3B,QAAmB,EACnB,UAA+B,EAC/B,IAAoB,EACpB,QAAuB,EACvB,OAAuB,EACvB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;YACvD,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,cAAc,GAAG,GAAG,CAAC;AAE3B,wEAAwE;AACxE,SAAS,cAAc,CAAC,QAAmB;IACzC,MAAM,OAAO,GAAgB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACtD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAYD,mGAAmG;AACnG,SAAS,cAAc,CAAC,QAAmB,EAAE,MAAc,EAAE,OAAoB;IAC/E,MAAM,EACJ,iBAAiB,GAAG,IAAI,GAAG,EAAU,EACrC,gBAAgB,GAAG,IAAI,GAAG,EAAU,EACpC,eAAe,GAAG,GAAG,EAAE,CAAC,IAAI,GAC7B,GAAG,OAAO,CAAC;IAEZ,MAAM,YAAY,GAAG,sBAAsB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;IACzE,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAE/B,MAAM,UAAU,GAAiB,EAAE,CAAC;IACpC,MAAM,OAAO,GAAmB;QAC9B,YAAY,EAAE,CAAC;QACf,eAAe,EAAE,IAAI;QACrB,MAAM;QACN,UAAU;KACX,CAAC;IAEF,OAAO;QACL,QAAQ;QACR,YAAY;QACZ,gBAAgB;QAChB,eAAe;QACf,OAAO;QACP,UAAU;QACV,UAAU,EAAE,IAAI,GAAG,EAAkB;KACtC,CAAC;AACJ,CAAC;AAED,4EAA4E;AAC5E,SAAS,QAAQ,CAAC,KAAgB,EAAE,IAA2B,EAAE,KAAa;IAC5E,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC;QAC3B,KAAK,CAAC,sCAAsC,cAAc,2BAA2B,CAAC,CAAC;QACvF,OAAO;IACT,CAAC;IAED,MAAM,EACJ,QAAQ,EACR,YAAY,EACZ,gBAAgB,EAChB,eAAe,EACf,OAAO,EACP,UAAU,EACV,UAAU,GACX,GAAG,KAAK,CAAC;IACV,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,QAAQ,GAAkB,IAAI,CAAC;IAEnC,IAAI,cAAc,EAAE,CAAC;QACnB,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;QAC/B,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QACpF,qBAAqB,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAC9E,CAAC;IAED,iBAAiB,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAE9D,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,WAAW;QAAE,OAAO,CAAC,YAAY,EAAE,CAAC;IAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,WAAW;QAAE,OAAO,CAAC,YAAY,EAAE,CAAC;IAExC,gBAAgB,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAC7D,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEnD,IAAI,cAAc,EAAE,CAAC;QACnB,oBAAoB,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3E,UAAU,CAAC,GAAG,EAAE,CAAC;QACjB,OAAO,CAAC,eAAe;YACrB,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/E,CAAC;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAwB,EACxB,QAAmB,EACnB,MAAc,EACd,UAAuB,EAAE;IAEzB,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACxD,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7B,OAAO,cAAc,CAAC,QAAQ,CAAC,CAAC;AAClC,CAAC"}

package/dist/ast-analysis/visitors/ast-store-visitor.d.ts

@@ -0,0 +1,4 @@
+import type { Definition, Visitor } from '../../types.js';
+import type { AstStringConfig } from '../rules/index.js';
+export declare function createAstStoreVisitor(astTypeMap: Record<string, string>, defs: Definition[], relPath: string, nodeIdMap: Map<string, number>, stringConfig?: AstStringConfig, stopRecurseKinds?: ReadonlySet<string>): Visitor;
+//# sourceMappingURL=ast-store-visitor.d.ts.map

package/dist/ast-analysis/visitors/ast-store-visitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-store-visitor.d.ts","sourceRoot":"","sources":["../../../src/ast-analysis/visitors/ast-store-visitor.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,UAAU,EAGV,OAAO,EAER,MAAM,gBAAgB,CAAC;AACxB,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAkRzD,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,IAAI,EAAE,UAAU,EAAE,EAClB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC9B,YAAY,GAAE,eAAuC,EACrD,gBAAgB,GAAE,WAAW,CAAC,MAAM,CAAa,GAChD,OAAO,CA6CT"}