@opencodehub/ingestion 0.1.0

package/dist/providers/resolution/stack-graphs/node-edge-builder.js

@@ -0,0 +1,366 @@
+// Python-targeted stack-graph builder.
+//
+// Given a tree-sitter CST for a Python file this module produces a stack
+// graph whose structure mirrors the intent of the vendored Python tsg rules
+// without reusing their implementation. We inspect the parsed rule file
+// only to guard our visitor: if the rule file lacks a pattern for a given
+// Python construct (e.g. `module`) we skip synthesising nodes for it, so
+// our graph never claims more structure than the vendored rules authorise.
+//
+// The graph we emit captures four shapes that drive Python re-export
+// resolution:
+//   1. module root scope + root entry/exit
+//   2. top-level definitions (function / class / const) as pop nodes
+//   3. import forms (import, from-import, wildcard) producing push/pop
+//      chains and ROOT edges
+//   4. reference sites inside function bodies (call / attribute) as push
+//      nodes keyed by (line, column) so the resolver can look them up
+//
+// We intentionally do not model function-local scope machinery or scoped
+// symbols — Python's class/method resolution in OpenCodeHub is handled by
+// the C3 MRO walker; stack-graphs here specifically targets cross-module
+// and re-export resolution.
+function nextId(g, kind) {
+    g.seq++;
+    return `${g.file}#${kind}-${g.seq}`;
+}
+function addNode(g, kind, opts = {}) {
+    const id = nextId(g, kind);
+    const base = { id, kind, file: g.file };
+    const node = {
+        ...base,
+        ...(opts.symbol !== undefined ? { symbol: opts.symbol } : {}),
+        ...(opts.definitionTarget !== undefined ? { definitionTarget: opts.definitionTarget } : {}),
+        ...(opts.line !== undefined ? { line: opts.line } : {}),
+    };
+    g.nodes.set(id, node);
+    return id;
+}
+function addEdge(g, source, target, precedence = 0) {
+    g.edges.push({ source, target, precedence });
+}
+/** Iterate every named descendant breadth-first. Stable order. */
+function* walkNamed(root) {
+    const queue = [root];
+    while (queue.length > 0) {
+        const cur = queue.shift();
+        if (cur === undefined)
+            continue;
+        yield cur;
+        for (let i = 0; i < cur.namedChildCount; i++) {
+            const c = cur.namedChild(i);
+            if (c !== null)
+                queue.push(c);
+        }
+    }
+}
+function positionKey(line, column) {
+    return `${line}:${column}`;
+}
+/** Build a graph for a single Python file. */
+export function buildStackGraph(file, tree, rules) {
+    const rootNodeId = `${file}#root`;
+    const moduleScopeId = `${file}#module-scope`;
+    const graph = {
+        file,
+        nodes: new Map(),
+        edges: [],
+        referenceIndex: new Map(),
+        rootNodeId,
+        moduleScopeId,
+        seq: 0,
+    };
+    graph.nodes.set(rootNodeId, { id: rootNodeId, kind: "root", file });
+    graph.nodes.set(moduleScopeId, { id: moduleScopeId, kind: "scope", file });
+    addEdge(graph, rootNodeId, moduleScopeId, 0);
+    // Gate visitors on the parsed rule set. A rule firing on `module` means
+    // the vendored ruleset authorises us to walk modules; missing the rule
+    // disables our synthesiser for that kind.
+    const authorised = new Set();
+    for (const rule of rules) {
+        for (const pat of rule.patterns)
+            authorised.add(pat.nodeType);
+    }
+    const root = tree.rootNode;
+    if (!authorised.has("module") && root.type !== "module") {
+        // Unknown rule set — return an empty graph so callers can fall back.
+        return finalise(graph);
+    }
+    visitTopLevel(root, graph, authorised);
+    return finalise(graph);
+}
+function finalise(g) {
+    return {
+        file: g.file,
+        nodes: new Map(g.nodes),
+        edges: g.edges.slice(),
+        rootNodeId: g.rootNodeId,
+        referenceIndex: new Map(g.referenceIndex),
+    };
+}
+/** Module-level walk — definitions, imports, and function bodies. */
+function visitTopLevel(moduleNode, g, authorised) {
+    for (let i = 0; i < moduleNode.namedChildCount; i++) {
+        const child = moduleNode.namedChild(i);
+        if (child === null)
+            continue;
+        dispatchStatement(child, g, authorised);
+    }
+}
+function dispatchStatement(node, g, authorised) {
+    switch (node.type) {
+        case "import_statement":
+            if (authorised.has("import_statement"))
+                handleImport(node, g);
+            break;
+        case "import_from_statement":
+            if (authorised.has("import_from_statement"))
+                handleFromImport(node, g);
+            break;
+        case "function_definition":
+            if (authorised.has("function_definition"))
+                handleFunctionDef(node, g, authorised);
+            break;
+        case "class_definition":
+            if (authorised.has("class_definition"))
+                handleClassDef(node, g, authorised);
+            break;
+        case "expression_statement":
+            // Assignment targets like `__all__ = [...]` are interpreted by the
+            // post-processor; we don't add stack-graph nodes for them.
+            break;
+        default: {
+            // Recurse into decorated defs, if statements, etc., so we still reach
+            // function/class definitions and reference sites living inside them.
+            for (const named of walkNamed(node)) {
+                if (named === node)
+                    continue;
+                if (named.type === "function_definition" ||
+                    named.type === "class_definition" ||
+                    named.type === "import_statement" ||
+                    named.type === "import_from_statement") {
+                    dispatchStatement(named, g, authorised);
+                }
+            }
+        }
+    }
+}
+function dottedNameSegments(node) {
+    if (node.type === "identifier")
+        return [node.text];
+    if (node.type === "dotted_name") {
+        const out = [];
+        for (let i = 0; i < node.namedChildCount; i++) {
+            const c = node.namedChild(i);
+            if (c === null)
+                continue;
+            if (c.type === "identifier")
+                out.push(c.text);
+        }
+        return out;
+    }
+    return [node.text];
+}
+function handleImport(node, g) {
+    // `import foo.bar [as baz]` — bind `foo` (or alias) to the module path.
+    for (let i = 0; i < node.namedChildCount; i++) {
+        const child = node.namedChild(i);
+        if (child === null)
+            continue;
+        if (child.type === "dotted_name") {
+            const segments = dottedNameSegments(child);
+            if (segments.length === 0)
+                continue;
+            const head = segments[0];
+            if (head === undefined)
+                continue;
+            bindModuleAlias(g, head, segments, node.startPosition.row + 1);
+        }
+        else if (child.type === "aliased_import") {
+            const nameChild = child.childForFieldName("name");
+            const aliasChild = child.childForFieldName("alias");
+            if (nameChild === null)
+                continue;
+            const segments = dottedNameSegments(nameChild);
+            const alias = aliasChild?.text ?? segments[0];
+            if (alias === undefined)
+                continue;
+            bindModuleAlias(g, alias, segments, node.startPosition.row + 1);
+        }
+    }
+}
+function bindModuleAlias(g, alias, targetSegments, line) {
+    // A local definition that pops the alias symbol and points to ROOT via
+    // a push chain of the target segments — so when a reference later pushes
+    // `alias`, the path lands on ROOT with `segments` still to pop.
+    const defNode = addNode(g, "pop", {
+        symbol: alias,
+        definitionTarget: targetSegments.join("."),
+        line,
+    });
+    addEdge(g, g.moduleScopeId, defNode, 1);
+    // Push chain: each segment becomes a push node in reverse order so the
+    // final edge lands on ROOT.
+    let cursor = defNode;
+    for (const segment of targetSegments) {
+        const pushNode = addNode(g, "push", { symbol: segment, line });
+        addEdge(g, cursor, pushNode, 0);
+        cursor = pushNode;
+    }
+    addEdge(g, cursor, g.rootNodeId, 0);
+}
+function handleFromImport(node, g) {
+    const moduleField = node.childForFieldName("module_name");
+    if (moduleField === null)
+        return;
+    const modulePath = resolveModulePath(moduleField);
+    if (modulePath === null)
+        return;
+    const names = collectImportedNames(node);
+    const line = node.startPosition.row + 1;
+    for (const binding of names) {
+        if (binding.kind === "wildcard") {
+            // Wildcard: every symbol reachable from the target module's scope
+            // becomes reachable from ours. We model this with a precedence-1
+            // edge from module-scope through a push chain to ROOT.
+            emitFromImportChain(g, null, modulePath, line, /*precedence*/ 1);
+            continue;
+        }
+        emitFromImportChain(g, binding, modulePath, line, /*precedence*/ 2);
+    }
+}
+function collectImportedNames(node) {
+    const out = [];
+    for (let i = 0; i < node.namedChildCount; i++) {
+        const c = node.namedChild(i);
+        if (c === null)
+            continue;
+        if (c.type === "wildcard_import") {
+            out.push({ kind: "wildcard" });
+            continue;
+        }
+        // Skip the module_name child — it appears as a named child too.
+        const moduleField = node.childForFieldName("module_name");
+        if (moduleField !== null && c === moduleField)
+            continue;
+        if (c.type === "dotted_name") {
+            const segs = dottedNameSegments(c);
+            const name = segs[0];
+            if (name !== undefined)
+                out.push({ kind: "named", local: name, imported: name });
+        }
+        else if (c.type === "aliased_import") {
+            const nameChild = c.childForFieldName("name");
+            const aliasChild = c.childForFieldName("alias");
+            if (nameChild === null)
+                continue;
+            const imported = dottedNameSegments(nameChild)[0];
+            const local = aliasChild?.text ?? imported;
+            if (imported !== undefined && local !== undefined) {
+                out.push({ kind: "named", local, imported });
+            }
+        }
+    }
+    return out;
+}
+function resolveModulePath(field) {
+    if (field.type === "dotted_name")
+        return dottedNameSegments(field);
+    if (field.type === "relative_import") {
+        // `from . import x` or `from ..pkg import y` — we flatten dots into
+        // leading empty segments so the resolver can interpret them later.
+        const segments = [];
+        for (let i = 0; i < field.namedChildCount; i++) {
+            const c = field.namedChild(i);
+            if (c === null)
+                continue;
+            if (c.type === "import_prefix") {
+                for (const _ of c.text)
+                    segments.push("");
+            }
+            else if (c.type === "dotted_name") {
+                segments.push(...dottedNameSegments(c));
+            }
+        }
+        return segments;
+    }
+    return null;
+}
+function emitFromImportChain(g, binding, modulePath, line, precedence) {
+    // Definition (pop) for the locally-bound name, or a scope junction for
+    // wildcards so every push that reaches the module scope forwards on.
+    const defNode = binding === null
+        ? addNode(g, "scope", { line })
+        : addNode(g, "pop", {
+            symbol: binding.local,
+            definitionTarget: `${modulePath.join(".")}.${binding.imported}`,
+            line,
+        });
+    addEdge(g, g.moduleScopeId, defNode, precedence);
+    // Emit the push chain: imported-name then each module segment in reverse.
+    let cursor = defNode;
+    if (binding !== null) {
+        const pushImported = addNode(g, "push", { symbol: binding.imported, line });
+        addEdge(g, cursor, pushImported, 0);
+        cursor = pushImported;
+    }
+    for (const segment of modulePath) {
+        if (segment === "")
+            continue; // skip relative-prefix placeholders
+        const pushSegment = addNode(g, "push", { symbol: segment, line });
+        addEdge(g, cursor, pushSegment, 0);
+        cursor = pushSegment;
+    }
+    addEdge(g, cursor, g.rootNodeId, 0);
+}
+function handleFunctionDef(node, g, authorised) {
+    const nameChild = node.childForFieldName("name");
+    if (nameChild === null)
+        return;
+    const line = node.startPosition.row + 1;
+    const defNode = addNode(g, "pop", {
+        symbol: nameChild.text,
+        definitionTarget: nameChild.text,
+        line,
+    });
+    addEdge(g, g.moduleScopeId, defNode, 2);
+    // Walk the body to index reference sites.
+    const body = node.childForFieldName("body");
+    if (body !== null)
+        indexReferences(body, g, authorised);
+}
+function handleClassDef(node, g, authorised) {
+    const nameChild = node.childForFieldName("name");
+    if (nameChild === null)
+        return;
+    const line = node.startPosition.row + 1;
+    const defNode = addNode(g, "pop", {
+        symbol: nameChild.text,
+        definitionTarget: nameChild.text,
+        line,
+    });
+    addEdge(g, g.moduleScopeId, defNode, 2);
+    const body = node.childForFieldName("body");
+    if (body !== null)
+        indexReferences(body, g, authorised);
+}
+function indexReferences(root, g, authorised) {
+    for (const node of walkNamed(root)) {
+        if (node.type === "identifier") {
+            if (!authorised.has("identifier"))
+                continue;
+            // Skip identifiers that are themselves names of nested defs.
+            // Heuristic: we index every identifier and rely on the resolver to
+            // filter — position-keyed lookup means false-positives are harmless.
+            const line = node.startPosition.row + 1;
+            const col = node.startPosition.column;
+            const key = positionKey(line, col);
+            if (g.referenceIndex.has(key))
+                continue;
+            const pushNode = addNode(g, "push", { symbol: node.text, line });
+            addEdge(g, pushNode, g.moduleScopeId, 0);
+            g.referenceIndex.set(key, pushNode);
+        }
+    }
+}
+//# sourceMappingURL=node-edge-builder.js.map

package/dist/providers/resolution/stack-graphs/node-edge-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-edge-builder.js","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/node-edge-builder.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,EAAE;AACF,yEAAyE;AACzE,4EAA4E;AAC5E,wEAAwE;AACxE,0EAA0E;AAC1E,yEAAyE;AACzE,2EAA2E;AAC3E,EAAE;AACF,qEAAqE;AACrE,cAAc;AACd,2CAA2C;AAC3C,qEAAqE;AACrE,uEAAuE;AACvE,6BAA6B;AAC7B,yEAAyE;AACzE,sEAAsE;AACtE,EAAE;AACF,yEAAyE;AACzE,0EAA0E;AAC1E,yEAAyE;AACzE,4BAA4B;AA2C5B,SAAS,MAAM,CAAC,CAAe,EAAE,IAAmB;IAClD,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;AACtC,CAAC;AAED,SAAS,OAAO,CACd,CAAe,EACf,IAAmB,EACnB,OAII,EAAE;IAEN,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAW,CAAC;IACjD,MAAM,IAAI,GAAmB;QAC3B,GAAG,IAAI;QACP,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,GAAG,CAAC,IAAI,CAAC,gBAAgB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACxD,CAAC;IACF,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACtB,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,OAAO,CAAC,CAAe,EAAE,MAAc,EAAE,MAAc,EAAE,UAAU,GAAG,CAAC;IAC9E,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;AAC/C,CAAC;AAED,kEAAkE;AAClE,QAAQ,CAAC,CAAC,SAAS,CAAC,IAAmB;IACrC,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAChC,MAAM,GAAG,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,MAAc;IAC/C,OAAO,GAAG,IAAI,IAAI,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,eAAe,CAC7B,IAAY,EACZ,IAAmB,EACnB,KAAyB;IAEzB,MAAM,UAAU,GAAW,GAAG,IAAI,OAAO,CAAC;IAC1C,MAAM,aAAa,GAAW,GAAG,IAAI,eAAe,CAAC;IACrD,MAAM,KAAK,GAAiB;QAC1B,IAAI;QACJ,KAAK,EAAE,IAAI,GAAG,EAA0B;QACxC,KAAK,EAAE,EAAE;QACT,cAAc,EAAE,IAAI,GAAG,EAAkB;QACzC,UAAU;QACV,aAAa;QACb,GAAG,EAAE,CAAC;KACP,CAAC;IACF,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IACpE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3E,OAAO,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC;IAE7C,wEAAwE;IACxE,uEAAuE;IACvE,0CAA0C;IAC1C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxD,qEAAqE;QACrE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IACvC,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,QAAQ,CAAC,CAAe;IAC/B,OAAO;QACL,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QACvB,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE;QACtB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,cAAc,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;KAC1C,CAAC;AACJ,CAAC;AAED,qEAAqE;AACrE,SAAS,aAAa,CACpB,UAAyB,EACzB,CAAe,EACf,UAA+B;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC7B,iBAAiB,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CACxB,IAAmB,EACnB,CAAe,EACf,UAA+B;IAE/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,kBAAkB;YACrB,IAAI,UAAU,CAAC,GAAG,CAAC,kBAAkB,CAAC;gBAAE,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC9D,MAAM;QACR,KAAK,uBAAuB;YAC1B,IAAI,UAAU,CAAC,GAAG,CAAC,uBAAuB,CAAC;gBAAE,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACvE,MAAM;QACR,KAAK,qBAAqB;YACxB,IAAI,UAAU,CAAC,GAAG,CAAC,qBAAqB,CAAC;gBAAE,iBAAiB,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAClF,MAAM;QACR,KAAK,kBAAkB;YACrB,IAAI,UAAU,CAAC,GAAG,CAAC,kBAAkB,CAAC;gBAAE,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC5E,MAAM;QACR,KAAK,sBAAsB;YACzB,mEAAmE;YACnE,2DAA2D;YAC3D,MAAM;QACR,OAAO,CAAC,CAAC,CAAC;YACR,sEAAsE;YACtE,qEAAqE;YACrE,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpC,IAAI,KAAK,KAAK,IAAI;oBAAE,SAAS;gBAC7B,IACE,KAAK,CAAC,IAAI,KAAK,qBAAqB;oBACpC,KAAK,CAAC,IAAI,KAAK,kBAAkB;oBACjC,KAAK,CAAC,IAAI,KAAK,kBAAkB;oBACjC,KAAK,CAAC,IAAI,KAAK,uBAAuB,EACtC,CAAC;oBACD,iBAAiB,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAmB;IAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAChC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAS;YACzB,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AAED,SAAS,YAAY,CAAC,IAAmB,EAAE,CAAe;IACxD,wEAAwE;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,IAAI;YAAE,SAAS;QAC7B,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YACjC,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACjE,CAAC;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,UAAU,GAAG,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YACpD,IAAI,SAAS,KAAK,IAAI;gBAAE,SAAS;YACjC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,UAAU,EAAE,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CACtB,CAAe,EACf,KAAa,EACb,cAAiC,EACjC,IAAY;IAEZ,uEAAuE;IACvE,yEAAyE;IACzE,gEAAgE;IAChE,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;QAChC,MAAM,EAAE,KAAK;QACb,gBAAgB,EAAE,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC;QAC1C,IAAI;KACL,CAAC,CAAC;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACxC,uEAAuE;IACvE,4BAA4B;IAC5B,IAAI,MAAM,GAAG,OAAO,CAAC;IACrB,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/D,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,QAAQ,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAmB,EAAE,CAAe;IAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;IAC1D,IAAI,WAAW,KAAK,IAAI;QAAE,OAAO;IACjC,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAClD,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO;IAEhC,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;IACxC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,kEAAkE;YAClE,iEAAiE;YACjE,uDAAuD;YACvD,mBAAmB,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;YACjE,SAAS;QACX,CAAC;QACD,mBAAmB,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;AACH,CAAC;AAWD,SAAS,oBAAoB,CAAC,IAAmB;IAC/C,MAAM,GAAG,GAAoC,EAAE,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,IAAI;YAAE,SAAS;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;YACjC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,gEAAgE;QAChE,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;QAC1D,IAAI,WAAW,KAAK,IAAI,IAAI,CAAC,KAAK,WAAW;YAAE,SAAS;QAExD,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,IAAI,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,UAAU,GAAG,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,SAAS,KAAK,IAAI;gBAAE,SAAS;YACjC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,UAAU,EAAE,IAAI,IAAI,QAAQ,CAAC;YAC3C,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBAClD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAoB;IAC7C,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACnE,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;QACrC,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAS;YACzB,IAAI,CAAC,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,CAAC;iBAAM,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACpC,QAAQ,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,mBAAmB,CAC1B,CAAe,EACf,OAA4B,EAC5B,UAA6B,EAC7B,IAAY,EACZ,UAAkB;IAElB,uEAAuE;IACvE,qEAAqE;IACrE,MAAM,OAAO,GACX,OAAO,KAAK,IAAI;QACd,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC;QAC/B,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;YAChB,MAAM,EAAE,OAAO,CAAC,KAAK;YACrB,gBAAgB,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE;YAC/D,IAAI;SACL,CAAC,CAAC;IACT,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IAEjD,0EAA0E;IAC1E,IAAI,MAAM,GAAG,OAAO,CAAC;IACrB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QACrB,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5E,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,GAAG,YAAY,CAAC;IACxB,CAAC;IACD,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;QACjC,IAAI,OAAO,KAAK,EAAE;YAAE,SAAS,CAAC,oCAAoC;QAClE,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QAClE,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QACnC,MAAM,GAAG,WAAW,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,iBAAiB,CACxB,IAAmB,EACnB,CAAe,EACf,UAA+B;IAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;QAChC,MAAM,EAAE,SAAS,CAAC,IAAI;QACtB,gBAAgB,EAAE,SAAS,CAAC,IAAI;QAChC,IAAI;KACL,CAAC,CAAC;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IAExC,0CAA0C;IAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,IAAI,KAAK,IAAI;QAAE,eAAe,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,cAAc,CACrB,IAAmB,EACnB,CAAe,EACf,UAA+B;IAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,SAAS,KAAK,IAAI;QAAE,OAAO;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE;QAChC,MAAM,EAAE,SAAS,CAAC,IAAI;QACtB,gBAAgB,EAAE,SAAS,CAAC,IAAI;QAChC,IAAI;KACL,CAAC,CAAC;IACH,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,IAAI,KAAK,IAAI;QAAE,eAAe,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,eAAe,CACtB,IAAmB,EACnB,CAAe,EACf,UAA+B;IAE/B,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;gBAAE,SAAS;YAC5C,6DAA6D;YAC7D,mEAAmE;YACnE,qEAAqE;YACrE,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YACtC,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACjE,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/providers/resolution/stack-graphs/partial-path-engine.d.ts

@@ -0,0 +1,9 @@
+import type { NodeId, PartialPathResult, StackGraph } from "./types.js";
+/** Map a graph by file path so the traversal can hop across graphs. */
+export type GraphIndex = ReadonlyMap<string, StackGraph>;
+/**
+ * Resolve a reference within a per-file graph. `startGraphFile` is the key
+ * into `graphs` at which the search begins.
+ */
+export declare function resolveReference(graphs: GraphIndex, startGraphFile: string, referenceNodeId: NodeId): PartialPathResult;
+//# sourceMappingURL=partial-path-engine.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"partial-path-engine.d.ts","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/partial-path-engine.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EACV,MAAM,EACN,iBAAiB,EAEjB,UAAU,EAEX,MAAM,YAAY,CAAC;AAGpB,uEAAuE;AACvE,MAAM,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AA8BzD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,UAAU,EAClB,cAAc,EAAE,MAAM,EACtB,eAAe,EAAE,MAAM,GACtB,iBAAiB,CAwGnB"}

package/dist/providers/resolution/stack-graphs/partial-path-engine.js

@@ -0,0 +1,152 @@
+// Partial-path search engine.
+//
+// Given one or more stack graphs (per-file) and a starting reference node,
+// enumerate paths whose symbol stack eventually empties at a pop node that
+// carries a `definitionTarget`. We use BFS rather than DFS so the first
+// result found is also the shortest — a natural ranking signal when several
+// alternative definitions exist (e.g. conditional imports).
+//
+// Semantics (simplified, intentionally narrower than the full model):
+//   * Every `push` node appends its symbol to the current stack.
+//   * Every `pop` node must match the top of the stack; path is pruned if
+//     the top differs.
+//   * A path terminates successfully when it lands on a pop node whose
+//     `definitionTarget` is set and the remaining stack is empty.
+//   * `root` nodes hop to every other graph's root, enabling cross-file
+//     resolution without having to model a global scope stack.
+//
+// Determinism is provided by sorting each node's outgoing edges on
+// (descending precedence, ascending target id) before expansion. That gives
+// us reproducible traversal order regardless of insertion order.
+import { MAX_PARTIAL_PATH_DEPTH } from "./types.js";
+function edgeSortKey(e) {
+    // Sort by descending precedence (higher first), then ascending target id
+    // to keep iteration deterministic across runs.
+    const invPrec = String(10_000 - e.precedence).padStart(6, "0");
+    return `${invPrec}|${e.target}`;
+}
+function outgoingEdges(graph, nodeId) {
+    const out = [];
+    for (const e of graph.edges) {
+        if (e.source === nodeId)
+            out.push(e);
+    }
+    return out.sort((a, b) => (edgeSortKey(a) < edgeSortKey(b) ? -1 : 1));
+}
+function makeVisitedKey(graphFile, nodeId, stack) {
+    return `${graphFile}|${nodeId}|${stack.join(">")}`;
+}
+/**
+ * Resolve a reference within a per-file graph. `startGraphFile` is the key
+ * into `graphs` at which the search begins.
+ */
+export function resolveReference(graphs, startGraphFile, referenceNodeId) {
+    const startGraph = graphs.get(startGraphFile);
+    if (startGraph === undefined)
+        return { results: [], truncated: false };
+    const startNode = startGraph.nodes.get(referenceNodeId);
+    if (startNode === undefined)
+        return { results: [], truncated: false };
+    const results = [];
+    const visited = new Set();
+    const initialStack = startNode.symbol === undefined ? [] : [startNode.symbol];
+    const queue = [];
+    queue.push({
+        nodeId: referenceNodeId,
+        graphFile: startGraphFile,
+        symbolStack: initialStack,
+        depth: 0,
+        visitedKey: makeVisitedKey(startGraphFile, referenceNodeId, initialStack),
+    });
+    visited.add(queue[0]?.visitedKey ?? "");
+    let truncated = false;
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (current === undefined)
+            continue;
+        if (current.depth > MAX_PARTIAL_PATH_DEPTH) {
+            truncated = true;
+            continue;
+        }
+        const graph = graphs.get(current.graphFile);
+        if (graph === undefined)
+            continue;
+        const node = graph.nodes.get(current.nodeId);
+        if (node === undefined)
+            continue;
+        // Successful termination: we landed on a pop node whose own symbol
+        // has already been consumed via the inbound edge traversal (stack.length
+        // now zero) AND the node advertises a definitionTarget.
+        if (node.kind === "pop" &&
+            node.definitionTarget !== undefined &&
+            current.symbolStack.length === 0) {
+            results.push({
+                targetNodeId: node.id,
+                targetKey: `${graph.file}:${node.line ?? 0}:${node.definitionTarget}`,
+                pathLength: current.depth,
+            });
+            // Don't continue from a successful terminal — any further traversal
+            // would leave the stack empty and then try to pop with nothing to
+            // pop, which is semantically invalid.
+            continue;
+        }
+        // Cross-graph hop at root nodes.
+        if (node.kind === "root") {
+            for (const [otherFile, otherGraph] of graphs) {
+                if (otherFile === current.graphFile)
+                    continue;
+                const key = makeVisitedKey(otherFile, otherGraph.rootNodeId, current.symbolStack);
+                if (visited.has(key))
+                    continue;
+                visited.add(key);
+                queue.push({
+                    nodeId: otherGraph.rootNodeId,
+                    graphFile: otherFile,
+                    symbolStack: current.symbolStack,
+                    depth: current.depth + 1,
+                    visitedKey: key,
+                });
+            }
+        }
+        for (const edge of outgoingEdges(graph, current.nodeId)) {
+            const nextNode = graph.nodes.get(edge.target);
+            if (nextNode === undefined)
+                continue;
+            let nextStack = current.symbolStack;
+            if (nextNode.kind === "push" && nextNode.symbol !== undefined) {
+                nextStack = [...current.symbolStack, nextNode.symbol];
+            }
+            else if (nextNode.kind === "pop" && nextNode.symbol !== undefined) {
+                const top = current.symbolStack[current.symbolStack.length - 1];
+                if (top !== nextNode.symbol) {
+                    // Pop mismatch — prune.
+                    nextStack = null;
+                }
+                else {
+                    nextStack = current.symbolStack.slice(0, -1);
+                }
+            }
+            if (nextStack === null)
+                continue;
+            const key = makeVisitedKey(current.graphFile, edge.target, nextStack);
+            if (visited.has(key))
+                continue;
+            visited.add(key);
+            queue.push({
+                nodeId: edge.target,
+                graphFile: current.graphFile,
+                symbolStack: nextStack,
+                depth: current.depth + 1,
+                visitedKey: key,
+            });
+        }
+    }
+    // Sort by path length (shorter first) for deterministic output.
+    results.sort((a, b) => {
+        if (a.pathLength !== b.pathLength)
+            return a.pathLength - b.pathLength;
+        return a.targetKey < b.targetKey ? -1 : 1;
+    });
+    return { results, truncated };
+}
+//# sourceMappingURL=partial-path-engine.js.map

package/dist/providers/resolution/stack-graphs/partial-path-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partial-path-engine.js","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/partial-path-engine.ts"],"names":[],"mappings":"AAAA,8BAA8B;AAC9B,EAAE;AACF,2EAA2E;AAC3E,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,4DAA4D;AAC5D,EAAE;AACF,sEAAsE;AACtE,iEAAiE;AACjE,0EAA0E;AAC1E,uBAAuB;AACvB,uEAAuE;AACvE,kEAAkE;AAClE,wEAAwE;AACxE,+DAA+D;AAC/D,EAAE;AACF,mEAAmE;AACnE,4EAA4E;AAC5E,iEAAiE;AASjE,OAAO,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAcpD,SAAS,WAAW,CAAC,CAAiB;IACpC,yEAAyE;IACzE,+CAA+C;IAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC/D,OAAO,GAAG,OAAO,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,aAAa,CAAC,KAAiB,EAAE,MAAc;IACtD,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,cAAc,CAAC,SAAiB,EAAE,MAAc,EAAE,KAAwB;IACjF,OAAO,GAAG,SAAS,IAAI,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAkB,EAClB,cAAsB,EACtB,eAAuB;IAEvB,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAC9C,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACvE,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACxD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAEtE,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,YAAY,GAAsB,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACjG,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,CAAC,IAAI,CAAC;QACT,MAAM,EAAE,eAAe;QACvB,SAAS,EAAE,cAAc;QACzB,WAAW,EAAE,YAAY;QACzB,KAAK,EAAE,CAAC;QACR,UAAU,EAAE,cAAc,CAAC,cAAc,EAAE,eAAe,EAAE,YAAY,CAAC;KAC1E,CAAC,CAAC;IACH,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC;IAExC,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,OAAO,KAAK,SAAS;YAAE,SAAS;QACpC,IAAI,OAAO,CAAC,KAAK,GAAG,sBAAsB,EAAE,CAAC;YAC3C,SAAS,GAAG,IAAI,CAAC;YACjB,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QAEjC,mEAAmE;QACnE,yEAAyE;QACzE,wDAAwD;QACxD,IACE,IAAI,CAAC,IAAI,KAAK,KAAK;YACnB,IAAI,CAAC,gBAAgB,KAAK,SAAS;YACnC,OAAO,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAChC,CAAC;YACD,OAAO,CAAC,IAAI,CAAC;gBACX,YAAY,EAAE,IAAI,CAAC,EAAE;gBACrB,SAAS,EAAE,GAAG,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;gBACrE,UAAU,EAAE,OAAO,CAAC,KAAK;aAC1B,CAAC,CAAC;YACH,oEAAoE;YACpE,kEAAkE;YAClE,sCAAsC;YACtC,SAAS;QACX,CAAC;QAED,iCAAiC;QACjC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,MAAM,EAAE,CAAC;gBAC7C,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS;oBAAE,SAAS;gBAC9C,MAAM,GAAG,GAAG,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,UAAU,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;gBAClF,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,UAAU,CAAC,UAAU;oBAC7B,SAAS,EAAE,SAAS;oBACpB,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;oBACxB,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAS;YACrC,IAAI,SAAS,GAA6B,OAAO,CAAC,WAAW,CAAC;YAC9D,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9D,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACxD,CAAC;iBAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,KAAK,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBACpE,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,GAAG,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;oBAC5B,wBAAwB;oBACxB,SAAS,GAAG,IAAI,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;YACD,IAAI,SAAS,KAAK,IAAI;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAG,cAAc,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YACtE,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,WAAW,EAAE,SAAS;gBACtB,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;gBACxB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QACtE,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC"}

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

@@ -0,0 +1,11 @@
+import type { TsgRule } from "./types.js";
+/** Result of parsing a tsg source file. */
+export interface ParsedTsg {
+    readonly rules: readonly TsgRule[];
+    readonly globals: readonly string[];
+    readonly attributeShorthands: readonly string[];
+    readonly warnings: readonly string[];
+}
+/** Parse a .tsg source string into a set of rules plus ancillary decls. */
+export declare function parseTsg(source: string): ParsedTsg;
+//# sourceMappingURL=rule-parser.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rule-parser.d.ts","sourceRoot":"","sources":["../../../../src/providers/resolution/stack-graphs/rule-parser.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EAAsC,OAAO,EAAE,MAAM,YAAY,CAAC;AAwF9E,2CAA2C;AAC3C,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,mBAAmB,EAAE,SAAS,MAAM,EAAE,CAAC;IAChD,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAED,2EAA2E;AAC3E,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAwIlD"}