@opencodehub/ingestion 0.1.0

package/dist/providers/resolution/stack-graphs/rule-parser.js

@@ -0,0 +1,247 @@
+// Rule-file parser for the vendored .tsg Python ruleset.
+//
+// The .tsg DSL is a mix of tree-sitter S-expression queries and a
+// small imperative language for declaring nodes, edges, and attributes.
+// We parse only the surface structure we need:
+//   * top-level rule blocks: `(pattern) @capture { actions }`
+//   * global declarations: `global NAME`, `global NAME = value` (recorded but
+//     otherwise ignored — the builder hardcodes Python's needs)
+//   * attribute shorthands: `attribute name = ...` (stored raw; the builder
+//     references them by name, not by macroexpansion)
+//   * actions inside blocks are shallowly tokenised into `node-decl`,
+//     `edge-decl`, `attr-decl`, or `unknown` so callers can surface stats.
+//
+// This is deliberately permissive — constructs we don't understand are
+// recorded as `unknown` rather than rejected. The Python evaluator uses
+// the rule file primarily as a licence-scoped manifest: our actual path
+// construction lives in node-edge-builder.ts and is driven by the
+// tree-sitter parse rather than a generic DSL interpreter.
+/** Strip `;;`-prefixed comments from a line. */
+function stripLineComment(line) {
+    const idx = line.indexOf(";;");
+    if (idx < 0)
+        return line;
+    return line.slice(0, idx);
+}
+/** Scan the opening pattern — everything inside a balanced `(...)` pair. */
+function readBalanced(source, start, open, close) {
+    if (source[start] !== open)
+        return null;
+    let depth = 0;
+    let inString = false;
+    for (let i = start; i < source.length; i++) {
+        const ch = source[i];
+        if (ch === '"' && source[i - 1] !== "\\") {
+            inString = !inString;
+            continue;
+        }
+        if (inString)
+            continue;
+        if (ch === open)
+            depth++;
+        else if (ch === close) {
+            depth--;
+            if (depth === 0) {
+                return { body: source.slice(start + 1, i), end: i };
+            }
+        }
+    }
+    return null;
+}
+/** Extract rough tree-sitter pattern info from a parenthesised pattern body. */
+function parsePattern(body) {
+    // The S-expression head token names the node type. Any `@capture` after
+    // the closing paren is attached outside by the caller; here we only peek
+    // at the very first identifier so callers can group rules by target type.
+    const m = /^\s*([A-Za-z_][\w]*)/.exec(body);
+    const nodeType = m?.[1] ?? "unknown";
+    return { kind: "pattern", nodeType };
+}
+/** Classify an action line into one of our coarse buckets. */
+function classifyAction(raw) {
+    const trimmed = raw.trim();
+    if (trimmed.startsWith("node "))
+        return "node-decl";
+    if (trimmed.startsWith("edge "))
+        return "edge-decl";
+    if (trimmed.startsWith("attr ") || trimmed.startsWith("attribute "))
+        return "attr-decl";
+    return "unknown";
+}
+/** Split an action body into individual statements at top-level newlines. */
+function splitActions(body) {
+    // We respect braces — an action like `scan x { ... }` is one statement even
+    // though it spans multiple lines. This keeps the `unknown` bucket from
+    // exploding.
+    const out = [];
+    let buf = "";
+    let braceDepth = 0;
+    let parenDepth = 0;
+    let inString = false;
+    for (let i = 0; i < body.length; i++) {
+        const ch = body[i];
+        if (ch === '"' && body[i - 1] !== "\\")
+            inString = !inString;
+        if (!inString) {
+            if (ch === "{")
+                braceDepth++;
+            else if (ch === "}")
+                braceDepth--;
+            else if (ch === "(")
+                parenDepth++;
+            else if (ch === ")")
+                parenDepth--;
+        }
+        buf += ch;
+        if (!inString && braceDepth === 0 && parenDepth === 0 && (ch === "\n" || ch === ";")) {
+            const cleaned = stripLineComment(buf).trim();
+            if (cleaned.length > 0)
+                out.push(cleaned);
+            buf = "";
+        }
+    }
+    const tail = stripLineComment(buf).trim();
+    if (tail.length > 0)
+        out.push(tail);
+    return out;
+}
+/** Parse a .tsg source string into a set of rules plus ancillary decls. */
+export function parseTsg(source) {
+    const rules = [];
+    const globals = [];
+    const attributeShorthands = [];
+    const warnings = [];
+    let i = 0;
+    const n = source.length;
+    const skipSpaceAndComments = () => {
+        while (i < n) {
+            const ch = source[i];
+            if (ch === undefined)
+                break;
+            if (ch === " " || ch === "\t" || ch === "\n" || ch === "\r") {
+                i++;
+                continue;
+            }
+            if (ch === ";" && source[i + 1] === ";") {
+                while (i < n && source[i] !== "\n")
+                    i++;
+                continue;
+            }
+            break;
+        }
+    };
+    while (i < n) {
+        skipSpaceAndComments();
+        if (i >= n)
+            break;
+        // Top-level keywords we track explicitly.
+        if (source.startsWith("global", i)) {
+            const end = source.indexOf("\n", i);
+            const line = source.slice(i, end < 0 ? n : end).trim();
+            globals.push(line);
+            i = end < 0 ? n : end;
+            continue;
+        }
+        if (source.startsWith("attribute", i)) {
+            const end = source.indexOf("\n", i);
+            const line = source.slice(i, end < 0 ? n : end).trim();
+            attributeShorthands.push(line);
+            i = end < 0 ? n : end;
+            continue;
+        }
+        if (source.startsWith("inherit", i)) {
+            const end = source.indexOf("\n", i);
+            i = end < 0 ? n : end;
+            continue;
+        }
+        // A rule block must start with `(` or `[`.
+        const ch = source[i];
+        if (ch !== "(" && ch !== "[") {
+            // Skip unrecognised tokens to the next newline.
+            const end = source.indexOf("\n", i);
+            if (end < 0)
+                break;
+            i = end + 1;
+            continue;
+        }
+        const patterns = [];
+        if (ch === "[") {
+            // Multi-pattern rule: `[ pat1 pat2 ... ] @capture { ... }`
+            const block = readBalanced(source, i, "[", "]");
+            if (block === null) {
+                warnings.push(`unterminated '[' at offset ${i}`);
+                break;
+            }
+            // Walk the bracket body picking out each top-level `(...)` pattern.
+            let j = 0;
+            while (j < block.body.length) {
+                const c = block.body[j];
+                if (c === undefined)
+                    break;
+                if (c === " " || c === "\n" || c === "\t" || c === "\r") {
+                    j++;
+                    continue;
+                }
+                if (c === ";" && block.body[j + 1] === ";") {
+                    while (j < block.body.length && block.body[j] !== "\n")
+                        j++;
+                    continue;
+                }
+                if (c === "(") {
+                    const inner = readBalanced(block.body, j, "(", ")");
+                    if (inner === null)
+                        break;
+                    patterns.push(parsePattern(inner.body));
+                    j = inner.end + 1;
+                    continue;
+                }
+                j++;
+            }
+            i = block.end + 1;
+        }
+        else {
+            const pat = readBalanced(source, i, "(", ")");
+            if (pat === null) {
+                warnings.push(`unterminated '(' at offset ${i}`);
+                break;
+            }
+            patterns.push(parsePattern(pat.body));
+            i = pat.end + 1;
+        }
+        // Skip to the action block `{ ... }` — the `@capture` name, if any, lives
+        // between the pattern and the brace; we don't need to retain it.
+        while (i < n && source[i] !== "{") {
+            if (source[i] === "\n" || source[i] === " " || source[i] === "\t" || source[i] === "@") {
+                i++;
+                continue;
+            }
+            if (source[i] === "(") {
+                const pred = readBalanced(source, i, "(", ")");
+                if (pred === null)
+                    break;
+                i = pred.end + 1;
+                continue;
+            }
+            // Unknown chars before the block — drift forward rather than abort.
+            i++;
+        }
+        if (source[i] !== "{") {
+            warnings.push(`missing action block after pattern at offset ${i}`);
+            continue;
+        }
+        const action = readBalanced(source, i, "{", "}");
+        if (action === null) {
+            warnings.push(`unterminated action block at offset ${i}`);
+            break;
+        }
+        const statements = splitActions(action.body);
+        const actions = statements.map((s) => ({
+            kind: classifyAction(s),
+            raw: s,
+        }));
+        rules.push({ patterns, actions });
+        i = action.end + 1;
+    }
+    return { rules, globals, attributeShorthands, warnings };
+}
+//# sourceMappingURL=rule-parser.js.map

package/dist/providers/resolution/stack-graphs/rule-parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-parser.js","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/rule-parser.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,EAAE;AACF,kEAAkE;AAClE,wEAAwE;AACxE,+CAA+C;AAC/C,8DAA8D;AAC9D,8EAA8E;AAC9E,gEAAgE;AAChE,4EAA4E;AAC5E,sDAAsD;AACtD,sEAAsE;AACtE,2EAA2E;AAC3E,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,kEAAkE;AAClE,2DAA2D;AAI3D,gDAAgD;AAChD,SAAS,gBAAgB,CAAC,IAAY;IACpC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED,4EAA4E;AAC5E,SAAS,YAAY,CACnB,MAAc,EACd,KAAa,EACb,IAAY,EACZ,KAAa;IAEb,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACxC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACzC,QAAQ,GAAG,CAAC,QAAQ,CAAC;YACrB,SAAS;QACX,CAAC;QACD,IAAI,QAAQ;YAAE,SAAS;QACvB,IAAI,EAAE,KAAK,IAAI;YAAE,KAAK,EAAE,CAAC;aACpB,IAAI,EAAE,KAAK,KAAK,EAAE,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAChF,SAAS,YAAY,CAAC,IAAY;IAChC,wEAAwE;IACxE,yEAAyE;IACzE,0EAA0E;IAC1E,MAAM,CAAC,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;AACvC,CAAC;AAED,8DAA8D;AAC9D,SAAS,cAAc,CAAC,GAAW;IACjC,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,WAAW,CAAC;IACpD,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,WAAW,CAAC;IACpD,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC;QAAE,OAAO,WAAW,CAAC;IACxF,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,6EAA6E;AAC7E,SAAS,YAAY,CAAC,IAAY;IAChC,4EAA4E;IAC5E,uEAAuE;IACvE,aAAa;IACb,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;YAAE,QAAQ,GAAG,CAAC,QAAQ,CAAC;QAC7D,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;iBACxB,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;iBAC7B,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;iBAC7B,IAAI,EAAE,KAAK,GAAG;gBAAE,UAAU,EAAE,CAAC;QACpC,CAAC;QACD,GAAG,IAAI,EAAE,CAAC;QACV,IAAI,CAAC,QAAQ,IAAI,UAAU,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;YACrF,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,GAAG,GAAG,EAAE,CAAC;QACX,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC;AACb,CAAC;AAUD,2EAA2E;AAC3E,MAAM,UAAU,QAAQ,CAAC,MAAc;IACrC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,mBAAmB,GAAa,EAAE,CAAC;IACzC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,MAAM,oBAAoB,GAAG,GAAS,EAAE;QACtC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,EAAE,KAAK,SAAS;gBAAE,MAAM;YAC5B,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAC5D,CAAC,EAAE,CAAC;gBACJ,SAAS;YACX,CAAC;YACD,IAAI,EAAE,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACxC,OAAO,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,CAAC,EAAE,CAAC;gBACxC,SAAS;YACX,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,oBAAoB,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC;YAAE,MAAM;QAElB,0CAA0C;QAC1C,IAAI,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACtB,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACvD,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACtB,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC;YACpC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACtB,SAAS;QACX,CAAC;QAED,2CAA2C;QAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,gDAAgD;YAChD,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpC,IAAI,GAAG,GAAG,CAAC;gBAAE,MAAM;YACnB,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YACZ,SAAS;QACX,CAAC;QAED,MAAM,QAAQ,GAAe,EAAE,CAAC;QAChC,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,2DAA2D;YAC3D,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAChD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM;YACR,CAAC;YACD,oEAAoE;YACpE,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,KAAK,SAAS;oBAAE,MAAM;gBAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;oBACxD,CAAC,EAAE,CAAC;oBACJ,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;oBAC3C,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;wBAAE,CAAC,EAAE,CAAC;oBAC5D,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;oBACd,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;oBACpD,IAAI,KAAK,KAAK,IAAI;wBAAE,MAAM;oBAC1B,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;oBACxC,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;oBAClB,SAAS;gBACX,CAAC;gBACD,CAAC,EAAE,CAAC;YACN,CAAC;YACD,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9C,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM;YACR,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,0EAA0E;QAC1E,iEAAiE;QACjE,OAAO,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACvF,CAAC,EAAE,CAAC;gBACJ,SAAS;YACX,CAAC;YACD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACtB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC/C,IAAI,IAAI,KAAK,IAAI;oBAAE,MAAM;gBACzB,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,oEAAoE;YACpE,CAAC,EAAE,CAAC;QACN,CAAC;QACD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,EAAE,CAAC,CAAC;YACnE,SAAS;QACX,CAAC;QACD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACjD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,uCAAuC,CAAC,EAAE,CAAC,CAAC;YAC1D,MAAM;QACR,CAAC;QACD,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAgB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAClD,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;YACvB,GAAG,EAAE,CAAC;SACP,CAAC,CAAC,CAAC;QACJ,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;QAClC,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,mBAAmB,EAAE,QAAQ,EAAE,CAAC;AAC3D,CAAC"}

package/dist/providers/resolution/stack-graphs/types.d.ts

@@ -0,0 +1,93 @@
+/**
+ * Node roles in our simplified stack-graph. Each maps to one primitive
+ * attribute family in the broader stack-graphs model, but we collapse
+ * push-scoped / pop-scoped into `push`/`pop` here because Python's
+ * reference model doesn't require the scope-stack machinery for the
+ * re-export cases we actually resolve.
+ */
+export type StackNodeKind = "push" | "pop" | "scope" | "root";
+/** Opaque node identifier. Format: `${file}#${seq}` where seq is per-file. */
+export type NodeId = string;
+/**
+ * One node in our stack graph. `symbol` is populated for push/pop kinds and
+ * carries the Python identifier the node pushes or pops. `definitionTarget`
+ * is set on pop nodes that correspond to concrete definitions (e.g. the
+ * function / class the resolver should land on).
+ */
+export interface StackGraphNode {
+    readonly id: NodeId;
+    readonly kind: StackNodeKind;
+    readonly symbol?: string;
+    readonly definitionTarget?: string;
+    /** Source file that created this node — useful for cross-file debugging. */
+    readonly file: string;
+    /** Optional line number in the source file (1-indexed). */
+    readonly line?: number;
+}
+/** A directed edge with optional precedence (higher wins at enumeration time). */
+export interface StackGraphEdge {
+    readonly source: NodeId;
+    readonly target: NodeId;
+    readonly precedence: number;
+}
+/** Per-file stack graph plus the well-known root-node id. */
+export interface StackGraph {
+    readonly file: string;
+    readonly nodes: ReadonlyMap<NodeId, StackGraphNode>;
+    readonly edges: readonly StackGraphEdge[];
+    /** Id of the module's per-file root — references escape to here. */
+    readonly rootNodeId: NodeId;
+    /** Ids of reference-push nodes, keyed by (line, column) for lookup. */
+    readonly referenceIndex: ReadonlyMap<string, NodeId>;
+}
+/**
+ * Query input: resolve the reference at this position in this file.
+ * The evaluator looks up the starting push-node via `referenceIndex`.
+ */
+export interface ReferenceQuery {
+    readonly file: string;
+    readonly line: number;
+    readonly column: number;
+    readonly name: string;
+}
+/** A successful path resolution. */
+export interface ResolvedDefinition {
+    readonly targetNodeId: NodeId;
+    /** Where the definition actually lives — typically `${file}:${line}:${name}`. */
+    readonly targetKey: string;
+    /** Length of the path in edges; shorter paths score higher. */
+    readonly pathLength: number;
+}
+/** Confidence assigned when stack-graphs produces a hit. */
+export declare const STACK_GRAPHS_HIT_CONFIDENCE = 0.9;
+/** Budget — never enumerate a path longer than this. */
+export declare const MAX_PARTIAL_PATH_DEPTH = 100;
+/**
+ * Rule-file AST — consumed by the node/edge builder. We intentionally keep
+ * only the shapes our Python evaluator consults; other rule kinds
+ * (let/set/var/scan) are parsed into an opaque `raw` form and ignored by
+ * the builder.
+ */
+export type TsgMatch = {
+    readonly kind: "pattern";
+    /** Tree-sitter node type name the rule fires on (e.g. `module`). */
+    readonly nodeType: string;
+    /** Tree-sitter capture name attached to the match (e.g. `@mod`). */
+    readonly capture?: string;
+};
+export type TsgActionKind = "node-decl" | "edge-decl" | "attr-decl" | "unknown";
+export interface TsgAction {
+    readonly kind: TsgActionKind;
+    /** Raw action source text (debug only). */
+    readonly raw: string;
+}
+export interface TsgRule {
+    readonly patterns: readonly TsgMatch[];
+    readonly actions: readonly TsgAction[];
+}
+/** Result returned from `resolveReference`. */
+export interface PartialPathResult {
+    readonly results: readonly ResolvedDefinition[];
+    readonly truncated: boolean;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/providers/resolution/stack-graphs/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/types.ts"],"names":[],"mappings":"AAOA;;;;;;GAMG;AACH,MAAM,MAAM,aAAa,GACrB,MAAM,GACN,KAAK,GACL,OAAO,GACP,MAAM,CAAC;AAEX,8EAA8E;AAC9E,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAE5B;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,4EAA4E;IAC5E,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,kFAAkF;AAClF,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,6DAA6D;AAC7D,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,cAAc,EAAE,CAAC;IAC1C,oEAAoE;IACpE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,uEAAuE;IACvE,QAAQ,CAAC,cAAc,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACtD;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,oCAAoC;AACpC,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,iFAAiF;IACjF,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,+DAA+D;IAC/D,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,4DAA4D;AAC5D,eAAO,MAAM,2BAA2B,MAAM,CAAC;AAE/C,wDAAwD;AACxD,eAAO,MAAM,sBAAsB,MAAM,CAAC;AAE1C;;;;;GAKG;AACH,MAAM,MAAM,QAAQ,GAAG;IACrB,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,oEAAoE;IACpE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,oEAAoE;IACpE,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG,WAAW,GAAG,WAAW,GAAG,SAAS,CAAC;AAEhF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,2CAA2C;IAC3C,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,CAAC;CACxC;AAED,+CAA+C;AAC/C,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,OAAO,EAAE,SAAS,kBAAkB,EAAE,CAAC;IAChD,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC7B"}

package/dist/providers/resolution/stack-graphs/types.js

@@ -0,0 +1,11 @@
+// Shared types for the clean-room stack-graphs evaluator.
+//
+// This module is a minimal, Python-scoped subset of the stack-graphs model.
+// Our types are intentionally narrow. All names and semantics were chosen
+// independently from any prior implementation — we model only what our
+// Python rules need.
+/** Confidence assigned when stack-graphs produces a hit. */
+export const STACK_GRAPHS_HIT_CONFIDENCE = 0.9;
+/** Budget — never enumerate a path longer than this. */
+export const MAX_PARTIAL_PATH_DEPTH = 100;
+//# sourceMappingURL=types.js.map

package/dist/providers/resolution/stack-graphs/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/types.ts"],"names":[],"mappings":"AAAA,0DAA0D;AAC1D,EAAE;AACF,4EAA4E;AAC5E,0EAA0E;AAC1E,uEAAuE;AACvE,qBAAqB;AAyErB,4DAA4D;AAC5D,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAE/C,wDAAwD;AACxD,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAC"}

package/dist/providers/resolution/stack-graphs-python.d.ts

@@ -0,0 +1,27 @@
+import type { ResolutionQuery } from "./context.js";
+import type { ResolverStrategy } from "./resolver-strategy.js";
+import type { StackGraph } from "./stack-graphs/types.js";
+/**
+ * Per-reference lookup info the ingestion pipeline attaches to the query
+ * when delegating to stack-graphs. The default three-tier `ResolutionQuery`
+ * lacks line/column, so strategies that want them advertise a sibling
+ * interface and the pipeline downcasts when invoking stack-graphs.
+ */
+export interface StackGraphsHintedQuery extends ResolutionQuery {
+    readonly referenceLine?: number;
+    readonly referenceColumn?: number;
+}
+/**
+ * Prime the cache with per-file stack graphs. Called by the ingestion parse
+ * phase before resolution runs.
+ */
+export declare function registerStackGraphs(graphs: ReadonlyMap<string, StackGraph>): void;
+/** For tests: drop all graphs. */
+export declare function clearStackGraphsForTests(): void;
+/** Stats surfaced to the pipeline for telemetry. */
+export declare function getStackGraphsStats(): {
+    readonly fallbacks: number;
+    readonly hits: number;
+};
+export declare const stackGraphsPythonResolver: ResolverStrategy;
+//# sourceMappingURL=stack-graphs-python.d.ts.map

package/dist/providers/resolution/stack-graphs-python.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-graphs-python.d.ts","sourceRoot":"","sources":["../../../src/providers/resolution/stack-graphs-python.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAuB,eAAe,EAAe,MAAM,cAAc,CAAC;AAEtF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAAkB,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAG1E;;;;;GAKG;AACH,MAAM,WAAW,sBAAuB,SAAQ,eAAe;IAC7D,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;CACnC;AAcD;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,IAAI,CAGjF;AAED,kCAAkC;AAClC,wBAAgB,wBAAwB,IAAI,IAAI,CAI/C;AAED,oDAAoD;AACpD,wBAAgB,mBAAmB,IAAI;IAAE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAE3F;AAyCD,eAAO,MAAM,yBAAyB,EAAE,gBAuBvC,CAAC"}

package/dist/providers/resolution/stack-graphs-python.js

@@ -0,0 +1,104 @@
+// Python-specific ResolverStrategy backed by the clean-room stack-graphs
+// evaluator. Uses the three-tier walker as a fallback whenever stack-graphs
+// can't produce an answer — missing rule file, empty graph cache, parse
+// errors, traversal timeout — so a Python ingest never regresses versus the
+// default resolver.
+//
+// The strategy is registered in resolver-strategy.ts under the key
+// "stack-graphs"; the python provider opts in via `resolverStrategyName`.
+//
+// Cross-module graph wiring is provided by the caller via `registerStackGraphs`
+// — the ingestion pipeline prepares one `StackGraph` per Python file during
+// parse and primes the cache before resolution begins. Tests drive this same
+// API with in-memory fixtures.
+import { CONFIDENCE_BY_TIER, resolve as threeTierResolve } from "./context.js";
+import { resolveViaStackGraphs } from "./stack-graphs/glue.js";
+import { STACK_GRAPHS_HIT_CONFIDENCE } from "./stack-graphs/types.js";
+const STORE = {
+    graphs: new Map(),
+    fallbacks: 0,
+    stackGraphHits: 0,
+};
+/**
+ * Prime the cache with per-file stack graphs. Called by the ingestion parse
+ * phase before resolution runs.
+ */
+export function registerStackGraphs(graphs) {
+    STORE.graphs.clear();
+    for (const [k, v] of graphs)
+        STORE.graphs.set(k, v);
+}
+/** For tests: drop all graphs. */
+export function clearStackGraphsForTests() {
+    STORE.graphs.clear();
+    STORE.fallbacks = 0;
+    STORE.stackGraphHits = 0;
+}
+/** Stats surfaced to the pipeline for telemetry. */
+export function getStackGraphsStats() {
+    return { fallbacks: STORE.fallbacks, hits: STORE.stackGraphHits };
+}
+/** Is this provider Python? Strategy no-ops on non-Python inputs. */
+function isPythonQuery(q) {
+    return q.provider.id === "python";
+}
+function mapTargetKeyToResolutionId(targetKey) {
+    // targetKey is `${file}:${line}:${qualifiedName}`. We emit this as the
+    // resolver's `targetId`. The storage layer treats opaque ids, so any
+    // shape that's unique works. Using `:` as the separator mirrors the
+    // qualified-name convention elsewhere in the ingestion pipeline.
+    return targetKey;
+}
+function runStackGraphs(q) {
+    if (STORE.graphs.size === 0)
+        return null;
+    const line = q.referenceLine;
+    const column = q.referenceColumn;
+    if (line === undefined || column === undefined)
+        return null;
+    const ref = {
+        file: q.callerFile,
+        line,
+        column,
+        name: q.calleeName,
+    };
+    try {
+        const { results } = resolveViaStackGraphs(ref, STORE.graphs);
+        const best = results[0];
+        if (best === undefined)
+            return null;
+        return {
+            targetId: mapTargetKeyToResolutionId(best.targetKey),
+            tier: "import-scoped",
+            confidence: STACK_GRAPHS_HIT_CONFIDENCE,
+        };
+    }
+    catch {
+        return null;
+    }
+}
+export const stackGraphsPythonResolver = {
+    name: "stack-graphs",
+    resolve(q, index) {
+        if (!isPythonQuery(q)) {
+            return threeTierResolve(q, index);
+        }
+        const hinted = q;
+        const hit = runStackGraphs(hinted);
+        if (hit !== null) {
+            STORE.stackGraphHits++;
+            // Stack-graphs resolutions always outrank the three-tier import-scoped
+            // confidence — we emit the fixed STACK_GRAPHS_HIT_CONFIDENCE score and
+            // leave re-ranking to the caller.
+            const clamped = {
+                targetId: hit.targetId,
+                tier: hit.tier,
+                confidence: Math.max(hit.confidence, CONFIDENCE_BY_TIER["import-scoped"]),
+            };
+            return [clamped];
+        }
+        STORE.fallbacks++;
+        return threeTierResolve(q, index);
+    },
+};
+//# sourceMappingURL=stack-graphs-python.js.map

package/dist/providers/resolution/stack-graphs-python.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-graphs-python.js","sourceRoot":"","sources":["../../../src/providers/resolution/stack-graphs-python.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,4EAA4E;AAC5E,wEAAwE;AACxE,4EAA4E;AAC5E,oBAAoB;AACpB,EAAE;AACF,mEAAmE;AACnE,0EAA0E;AAC1E,EAAE;AACF,gFAAgF;AAChF,4EAA4E;AAC5E,6EAA6E;AAC7E,+BAA+B;AAG/B,OAAO,EAAE,kBAAkB,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAE/E,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAmBtE,MAAM,KAAK,GAAoB;IAC7B,MAAM,EAAE,IAAI,GAAG,EAAE;IACjB,SAAS,EAAE,CAAC;IACZ,cAAc,EAAE,CAAC;CAClB,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAuC;IACzE,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM;QAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,wBAAwB;IACtC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrB,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;IACpB,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,mBAAmB;IACjC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC;AACpE,CAAC;AAED,qEAAqE;AACrE,SAAS,aAAa,CAAC,CAAkB;IACvC,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC;AACpC,CAAC;AAED,SAAS,0BAA0B,CAAC,SAAiB;IACnD,uEAAuE;IACvE,qEAAqE;IACrE,oEAAoE;IACpE,iEAAiE;IACjE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,cAAc,CAAC,CAAyB;IAC/C,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,IAAI,GAAG,CAAC,CAAC,aAAa,CAAC;IAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,eAAe,CAAC;IACjC,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5D,MAAM,GAAG,GAAmB;QAC1B,IAAI,EAAE,CAAC,CAAC,UAAU;QAClB,IAAI;QACJ,MAAM;QACN,IAAI,EAAE,CAAC,CAAC,UAAU;KACnB,CAAC;IACF,IAAI,CAAC;QACH,MAAM,EAAE,OAAO,EAAE,GAAG,qBAAqB,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO;YACL,QAAQ,EAAE,0BAA0B,CAAC,IAAI,CAAC,SAAS,CAAC;YACpD,IAAI,EAAE,eAAe;YACrB,UAAU,EAAE,2BAA2B;SACxC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GAAqB;IACzD,IAAI,EAAE,cAAc;IACpB,OAAO,CAAC,CAAkB,EAAE,KAAkB;QAC5C,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,MAAM,GAAG,CAA2B,CAAC;QAC3C,MAAM,GAAG,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,KAAK,CAAC,cAAc,EAAE,CAAC;YACvB,uEAAuE;YACvE,uEAAuE;YACvE,kCAAkC;YAClC,MAAM,OAAO,GAAwB;gBACnC,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,kBAAkB,CAAC,eAAe,CAAC,CAAC;aAC1E,CAAC;YACF,OAAO,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;QACD,KAAK,CAAC,SAAS,EAAE,CAAC;QAClB,OAAO,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;CACF,CAAC"}

package/dist/providers/resolution/stack-graphs-ts.d.ts

@@ -0,0 +1,134 @@
+import type { ResolutionQuery } from "./context.js";
+import type { ResolverStrategy } from "./resolver-strategy.js";
+import type { StackGraph } from "./stack-graphs/types.js";
+/**
+ * Per-reference lookup info — the ingestion pipeline attaches (line, column)
+ * to the query when delegating to stack-graphs. Mirrors the Python hinted
+ * query type.
+ */
+export interface TsStackGraphsHintedQuery extends ResolutionQuery {
+    readonly referenceLine?: number;
+    readonly referenceColumn?: number;
+}
+/**
+ * Prime the TS cache with per-file stack graphs. Called by the ingestion
+ * parse phase before resolution runs. Uses a store separate from Python's.
+ */
+export declare function registerTsStackGraphs(graphs: ReadonlyMap<string, StackGraph>): void;
+/** For tests: drop all TS graphs and reset counters. */
+export declare function clearTsStackGraphsForTests(): void;
+/** Stats surfaced to the pipeline for telemetry. */
+export declare function getTsStackGraphsStats(): {
+    readonly fallbacks: number;
+    readonly hits: number;
+};
+export declare const stackGraphsTsResolver: ResolverStrategy;
+/**
+ * Minimal import/export IR. The pipeline's parse phase produces this shape
+ * from the TS tree-sitter CST; tests can also hand-author it. Keeping the
+ * builder driven by a plain IR (rather than a tree-sitter node adapter)
+ * means we don't need to fake the full SyntaxNode surface for every test
+ * fixture — unlike the Python builder which consumes `MinimalTsNode`.
+ */
+export type TsImportSpec = {
+    readonly kind: "named";
+    readonly name: string;
+    readonly local: string;
+    readonly module: string;
+    readonly typeOnly?: boolean;
+    readonly line: number;
+} | {
+    readonly kind: "default";
+    readonly local: string;
+    readonly module: string;
+    readonly typeOnly?: boolean;
+    readonly line: number;
+} | {
+    readonly kind: "namespace";
+    readonly local: string;
+    readonly module: string;
+    readonly typeOnly?: boolean;
+    readonly line: number;
+};
+export type TsExportSpec = {
+    readonly kind: "named-local";
+    readonly name: string;
+    readonly line: number;
+} | {
+    readonly kind: "default-local";
+    readonly target: string;
+    readonly line: number;
+} | {
+    readonly kind: "named-reexport";
+    readonly name: string;
+    readonly imported: string;
+    readonly module: string;
+    readonly line: number;
+} | {
+    readonly kind: "default-reexport-as";
+    readonly name: string;
+    readonly module: string;
+    readonly line: number;
+} | {
+    readonly kind: "star-reexport";
+    readonly module: string;
+    readonly line: number;
+};
+/**
+ * A reference site inside the module — typically an identifier the call
+ * extractor already located. The builder emits one push-node per reference
+ * so the resolver can look up (line, column).
+ */
+export interface TsReferenceSite {
+    readonly name: string;
+    readonly line: number;
+    readonly column: number;
+}
+/**
+ * All the per-file facts the builder needs. `moduleKey` is the canonical
+ * identifier used both as the `graphs` map key and as the resolution target
+ * for cross-file ROOT hops. Typically the absolute file path without the
+ * extension; callers decide the shape as long as it's consistent with
+ * `resolveModule`.
+ */
+export interface TsModuleFacts {
+    readonly file: string;
+    readonly moduleKey: string;
+    readonly imports: readonly TsImportSpec[];
+    readonly exports: readonly TsExportSpec[];
+    readonly localDefinitions: readonly {
+        readonly name: string;
+        readonly line: number;
+    }[];
+    readonly references: readonly TsReferenceSite[];
+    /**
+     * Resolve an import specifier (e.g. `"./bar"`) to a `moduleKey` string
+     * matching another `TsModuleFacts.moduleKey`. Returning `null` means the
+     * import target is unknown — the builder will still emit the push-chain
+     * but cross-file traversal won't hop.
+     */
+    resolveModule(specifier: string): string | null;
+}
+/**
+ * Build a stack graph for a single TS-family module from an import/export
+ * IR. The graph shape:
+ *
+ *   * module-scope is a `scope` node. ROOT points at it (so external
+ *     lookups hitting this module begin there).
+ *   * Local definitions are `pop` nodes hanging off module-scope, precedence 2.
+ *   * Named imports create a local `pop` for the binding plus a push chain
+ *     `[binding-name, moduleKey]` terminating at ROOT.
+ *   * Default imports are identical to named imports with `imported = "default"`.
+ *   * Namespace imports create a `pop` at the local name whose continuation
+ *     chains straight to ROOT of the target module (the member push is
+ *     generated at the reference site — see `references`).
+ *   * Star re-exports emit a precedence-1 scope edge mirroring Python's
+ *     wildcard handling.
+ *   * Named re-exports create a local `pop` whose target is the remote
+ *     module's export with the same (or renamed-from) name.
+ *   * Default re-exports (`export { default as foo }`) create a local pop
+ *     "foo" targeting the remote default slot.
+ *   * Default exports create a local pop "default" pointing at the target.
+ */
+export declare function buildTsStackGraph(facts: TsModuleFacts): StackGraph;
+//# sourceMappingURL=stack-graphs-ts.d.ts.map

package/dist/providers/resolution/stack-graphs-ts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack-graphs-ts.d.ts","sourceRoot":"","sources":["../../../src/providers/resolution/stack-graphs-ts.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAuB,eAAe,EAAe,MAAM,cAAc,CAAC;AAEtF,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D,OAAO,KAAK,EAGV,UAAU,EAIX,MAAM,yBAAyB,CAAC;AAGjC;;;;GAIG;AACH,MAAM,WAAW,wBAAyB,SAAQ,eAAe;IAC/D,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;CACnC;AAcD;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,IAAI,CAGnF;AAED,wDAAwD;AACxD,wBAAgB,0BAA0B,IAAI,IAAI,CAIjD;AAED,oDAAoD;AACpD,wBAAgB,qBAAqB,IAAI;IACvC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,CAEA;AAgDD,eAAO,MAAM,qBAAqB,EAAE,gBAoBnC,CAAC;AAMF;;;;;;GAMG;AACH,MAAM,MAAM,YAAY,GACpB;IACE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,CAAC;AAEN,MAAM,MAAM,YAAY,GACpB;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9E;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAClF;IACE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,GACD;IACE,QAAQ,CAAC,IAAI,EAAE,qBAAqB,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvF;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,QAAQ,CAAC,gBAAgB,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IACvF,QAAQ,CAAC,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IAChD;;;;;OAKG;IACH,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACjD;AA4CD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,aAAa,GAAG,UAAU,CA+BlE"}