@nanonets/graft 0.1.0

package/dist/graph/build.js

@@ -0,0 +1,95 @@
+/**
+ * `graph` — build `.context/graph.json` from a code repository.
+ *
+ * M1 pipeline (Tier-1 only, deterministic, no LLM):
+ *   1. Walk the repo for TS/Python source files.
+ *   2. Parse each with tree-sitter and emit one NodeV1 per definition.
+ *   3. Write a sorted graph.json.
+ * Edges (M2) and LLM summary/crux (M3) layer onto this without changing it.
+ */
+import { readFileSync } from "node:fs";
+import { join, relative, resolve } from "node:path";
+import { walkDir } from "../ingest/fs.js";
+import { contextDirFor } from "../context/node-file.js";
+import { extractFile, languageOf } from "./extract.js";
+import { resolveEdges } from "./resolve.js";
+import { enrichGraph } from "./enrich.js";
+import { GRAPH_FILE, readGraph, writeGraph } from "./write.js";
+/** The source files a graph build parses: supported languages, minus the output dir. */
+export function listSourceFiles(root, outDir) {
+    return walkDir(root).filter((f) => !f.startsWith(outDir) && languageOf(f) !== null);
+}
+export async function buildGraph(dir, opts = {}) {
+    const root = resolve(dir);
+    const outDir = contextDirFor(root, opts.contextDir);
+    const files = listSourceFiles(root, outDir);
+    const nodes = [];
+    const rawEdges = [];
+    const sources = new Map();
+    const langs = new Set();
+    const errors = [];
+    files.forEach((file, i) => {
+        const rel = relative(root, file);
+        opts.onProgress?.({ phase: "parse", index: i, total: files.length, file: rel });
+        const lang = languageOf(file);
+        let source;
+        try {
+            source = readFileSync(file, "utf8");
+        }
+        catch (err) {
+            errors.push(`${rel}: ${err instanceof Error ? err.message : String(err)}`);
+            return;
+        }
+        try {
+            const { nodes: fileNodes, rawEdges: fileEdges } = extractFile(rel, source, lang);
+            nodes.push(...fileNodes);
+            rawEdges.push(...fileEdges);
+            sources.set(rel, source);
+            langs.add(lang);
+        }
+        catch (err) {
+            errors.push(`${rel}: parse failed — ${err instanceof Error ? err.message : String(err)}`);
+        }
+    });
+    const edges = resolveEdges(nodes, rawEdges);
+    // graph.json is its own Tier-2 cache: fold in the prior meaning layer so an
+    // unchanged body is never re-summarized (and a Tier-1-only run never wipes it).
+    const prior = readGraph(join(outDir, GRAPH_FILE));
+    const priorById = new Map((prior?.nodes ?? []).map((n) => [n.id, n]));
+    const meaning = await enrichGraph(nodes, priorById, sources, {
+        summarizer: opts.summarizer,
+        onProgress: ({ index, total, node }) => opts.onProgress?.({ phase: "enrich", index, total, file: node }),
+    });
+    errors.push(...meaning.errors);
+    const graph = {
+        meta: {
+            version: 1,
+            nodeCount: nodes.length,
+            edgeCount: edges.length,
+            languages: [...langs].sort(),
+        },
+        nodes,
+        edges,
+    };
+    const graphPath = writeGraph(graph, outDir);
+    const byKind = {};
+    for (const n of nodes)
+        byKind[n.kind] = (byKind[n.kind] ?? 0) + 1;
+    const byRelation = {};
+    for (const e of edges)
+        byRelation[e.relation] = (byRelation[e.relation] ?? 0) + 1;
+    return {
+        contextDir: outDir,
+        graphPath,
+        files: files.length,
+        nodes: nodes.length,
+        edges: edges.length,
+        byKind,
+        byRelation,
+        languages: [...langs].sort(),
+        meaning,
+        errors,
+    };
+}
+export { GRAPH_FILE };
+//# sourceMappingURL=build.js.map

package/dist/graph/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../src/graph/build.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,UAAU,EAA+B,MAAM,cAAc,CAAC;AACpF,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAoB,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AA8B/D,wFAAwF;AACxF,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,MAAc;IAC1D,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AACtF,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,GAAW,EACX,OAA0B,EAAE;IAE5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAE5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAY,CAAC;IAClC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;QAChF,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAE,CAAC;QAC/B,IAAI,MAAc,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3E,OAAO;QACT,CAAC;QACD,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACjF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,oBAAoB,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAE5C,4EAA4E;IAC5E,gFAAgF;IAChF,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE;QAC3D,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CACrC,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;KACnE,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAE/B,MAAM,KAAK,GAAY;QACrB,IAAI,EAAE;YACJ,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE;SAC7B;QACD,KAAK;QACL,KAAK;KACN,CAAC;IAEF,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAE5C,MAAM,MAAM,GAAG,EAA0B,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAElF,OAAO;QACL,UAAU,EAAE,MAAM;QAClB,SAAS;QACT,KAAK,EAAE,KAAK,CAAC,MAAM;QACnB,KAAK,EAAE,KAAK,CAAC,MAAM;QACnB,KAAK,EAAE,KAAK,CAAC,MAAM;QACnB,MAAM;QACN,UAAU;QACV,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE;QAC5B,OAAO;QACP,MAAM;KACP,CAAC;AACJ,CAAC;AAED,OAAO,EAAE,UAAU,EAAE,CAAC"}

package/dist/graph/check.d.ts

@@ -0,0 +1,18 @@
+export interface GraphCheckResult {
+    ok: boolean;
+    /** True when there is no graph.json (a graph has never been built). */
+    missing: boolean;
+    added: string[];
+    removed: string[];
+    changed: string[];
+    stale: string[];
+    /** Nodes never summarized (reported for context; not counted as drift). */
+    pending: number;
+}
+export interface GraphCheckOptions {
+    contextDir?: string;
+}
+export declare function checkGraph(dir: string, opts?: GraphCheckOptions): GraphCheckResult;
+/** Render a graph-check result as a human-readable report. */
+export declare function formatGraphCheckReport(r: GraphCheckResult): string;
+//# sourceMappingURL=check.d.ts.map

package/dist/graph/check.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.d.ts","sourceRoot":"","sources":["../../src/graph/check.ts"],"names":[],"mappings":"AA0BA,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,OAAO,CAAC;IACZ,uEAAuE;IACvE,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,2EAA2E;IAC3E,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,iBAAiB;IAChC,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,GAAE,iBAAsB,GAAG,gBAAgB,CA0DtF;AAED,8DAA8D;AAC9D,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,gBAAgB,GAAG,MAAM,CA+BlE"}

package/dist/graph/check.js

@@ -0,0 +1,126 @@
+/**
+ * `checkGraph` — is the committed `graph.json` still in sync with the code?
+ *
+ * Deterministic and fast (tree-sitter only, no LLM, no network): it re-runs
+ * Tier-1 extraction and diffs the fresh node set against the committed graph by
+ * `id` and `body_hash`. Meant for CI — exit non-zero when a PR changed code but
+ * didn't rebuild the graph.
+ *
+ * Drift categories:
+ *   added    a definition exists in code but not in graph.json (run `graph`)
+ *   removed  a node in graph.json no longer exists in code       (run `graph`)
+ *   changed  a node's body_hash differs from the committed one   (run `graph`)
+ *   stale    a committed node's summary is flagged stale — its body changed
+ *            since it was last summarized                         (run `graph --llm`)
+ *
+ * `added`/`removed`/`changed` are structural: the graph no longer describes the
+ * code. `stale` is a meaning-layer signal the last build already recorded.
+ * `pending` (never summarized) is not drift — it's a deliberate Tier-1-only build.
+ */
+import { readFileSync } from "node:fs";
+import { join, relative, resolve } from "node:path";
+import { contextDirFor } from "../context/node-file.js";
+import { extractFile, languageOf } from "./extract.js";
+import { listSourceFiles } from "./build.js";
+import { GRAPH_FILE, readGraph } from "./write.js";
+export function checkGraph(dir, opts = {}) {
+    const root = resolve(dir);
+    const outDir = contextDirFor(root, opts.contextDir);
+    const result = {
+        ok: false,
+        missing: false,
+        added: [],
+        removed: [],
+        changed: [],
+        stale: [],
+        pending: 0,
+    };
+    const committed = readGraph(join(outDir, GRAPH_FILE));
+    if (!committed) {
+        result.missing = true;
+        return result;
+    }
+    // Freshly extract Tier-1 nodes from the code on disk (same file set as build).
+    const current = new Map(); // id → body_hash
+    for (const file of listSourceFiles(root, outDir)) {
+        const lang = languageOf(file);
+        let source;
+        try {
+            source = readFileSync(file, "utf8");
+        }
+        catch {
+            continue; // unreadable now → its nodes show up as `removed` below
+        }
+        try {
+            const { nodes } = extractFile(relative(root, file), source, lang);
+            for (const n of nodes)
+                current.set(n.id, n.body_hash);
+        }
+        catch {
+            // parse failure → skip; the committed nodes for this file become `removed`.
+        }
+    }
+    const committedById = new Map(committed.nodes.map((n) => [n.id, n]));
+    for (const [id, node] of committedById) {
+        const now = current.get(id);
+        if (now === undefined)
+            result.removed.push(id);
+        else if (now !== node.body_hash)
+            result.changed.push(id);
+        if (node.summary_state === "stale")
+            result.stale.push(id);
+        if (node.summary_state === "pending")
+            result.pending++;
+    }
+    for (const id of current.keys()) {
+        if (!committedById.has(id))
+            result.added.push(id);
+    }
+    for (const arr of [result.added, result.removed, result.changed, result.stale])
+        arr.sort();
+    result.ok =
+        result.added.length === 0 &&
+            result.removed.length === 0 &&
+            result.changed.length === 0 &&
+            result.stale.length === 0;
+    return result;
+}
+/** Render a graph-check result as a human-readable report. */
+export function formatGraphCheckReport(r) {
+    if (r.missing) {
+        return "graph check: NO GRAPH\n\nNo .context/graph.json found. Run `graft graph` first.";
+    }
+    if (r.ok) {
+        const note = r.pending ? ` (${r.pending} node(s) not yet summarized — run \`graph --llm\`)` : "";
+        return `graph check: OK — graph.json is in sync with the code.${note}`;
+    }
+    const lines = ["graph check: STALE", ""];
+    const structural = r.added.length + r.removed.length + r.changed.length;
+    if (r.changed.length) {
+        lines.push(`changed (${r.changed.length}):`);
+        for (const id of r.changed)
+            lines.push(`  ~ ${id}`);
+    }
+    if (r.added.length) {
+        lines.push(`added (${r.added.length}):`);
+        for (const id of r.added)
+            lines.push(`  + ${id}`);
+    }
+    if (r.removed.length) {
+        lines.push(`removed (${r.removed.length}):`);
+        for (const id of r.removed)
+            lines.push(`  - ${id}`);
+    }
+    if (r.stale.length) {
+        lines.push(`stale summaries (${r.stale.length}):`);
+        for (const id of r.stale)
+            lines.push(`  ! ${id}`);
+    }
+    lines.push("");
+    if (structural)
+        lines.push("Run `graft graph` to rebuild the structure, then commit .context/.");
+    if (r.stale.length)
+        lines.push("Run `graft graph --llm` to refresh stale summaries.");
+    return lines.join("\n");
+}
+//# sourceMappingURL=check.js.map

package/dist/graph/check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.js","sourceRoot":"","sources":["../../src/graph/check.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAkBnD,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,OAA0B,EAAE;IAClE,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAEpD,MAAM,MAAM,GAAqB;QAC/B,EAAE,EAAE,KAAK;QACT,OAAO,EAAE,KAAK;QACd,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,CAAC;KACX,CAAC;IAEF,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;IACtD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+EAA+E;IAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,iBAAiB;IAC5D,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAE,CAAC;QAC/B,IAAI,MAAc,CAAC;QACnB,IAAI,CAAC;YACH,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACtC,CAAC;QAAC,MAAM,CAAC;YACP,SAAS,CAAC,wDAAwD;QACpE,CAAC;QACD,IAAI,CAAC;YACH,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAClE,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;QACxD,CAAC;QAAC,MAAM,CAAC;YACP,4EAA4E;QAC9E,CAAC;IACH,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS;YAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC1C,IAAI,GAAG,KAAK,IAAI,CAAC,SAAS;YAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO;YAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1D,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS;YAAE,MAAM,CAAC,OAAO,EAAE,CAAC;IACzD,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC;QAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IAE3F,MAAM,CAAC,EAAE;QACP,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YACzB,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,sBAAsB,CAAC,CAAmB;IACxD,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,iFAAiF,CAAC;IAC3F,CAAC;IACD,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QACT,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,oDAAoD,CAAC,CAAC,CAAC,EAAE,CAAC;QACjG,OAAO,yDAAyD,IAAI,EAAE,CAAC;IACzE,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IACxE,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;QACnD,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,IAAI,UAAU;QAAE,KAAK,CAAC,IAAI,CAAC,oEAAoE,CAAC,CAAC;IACjG,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM;QAAE,KAAK,CAAC,IAAI,CAAC,qDAAqD,CAAC,CAAC;IACtF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/graph/enrich.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Tier-2 pass: attach the LLM meaning layer (`summary` + `crux`) to nodes.
+ *
+ * graph.json is its own cache — the committed file already holds every node's
+ * summary/crux from a prior run. So this pass is diff-driven:
+ *
+ *   - cache hit  — a prior node with the same id, same `body_hash`, and
+ *     `summary_state:"ready"` → carry its summary/crux over, no LLM call.
+ *   - stale      — a prior ready summary whose body has since changed → keep the
+ *     old text as a hint but mark it "stale". Recomputed only if an LLM is given.
+ *   - pending    — new or never-summarized node → one LLM call when an LLM is
+ *     given, otherwise left "pending".
+ *
+ * Passing no summarizer runs the cache/stale bookkeeping alone (no calls, no
+ * cost) — which is what a plain `graph` build does, so it never wipes the
+ * meaning layer a previous `--llm` run produced.
+ *
+ * The LLM returns line numbers into the slice it was shown; we consume them here,
+ * once, to cut `crux.code` verbatim from the source. `crux.span` is a pointer
+ * only and is never used to re-slice.
+ */
+import type { CruxSummarizer } from "../ai/crux.js";
+import type { NodeV1 } from "./types.js";
+export interface EnrichOptions {
+    /** When present, (re)compute meaning for stale/pending nodes. Absent → cache only. */
+    summarizer?: CruxSummarizer;
+    /** Progress is reported per file (one LLM call each), not per node. */
+    onProgress?: (info: {
+        index: number;
+        total: number;
+        node: string;
+    }) => void;
+}
+export interface EnrichStats {
+    cached: number;
+    computed: number;
+    stale: number;
+    pending: number;
+    errors: string[];
+}
+export declare function enrichGraph(nodes: NodeV1[], prior: Map<string, NodeV1>, sources: Map<string, string>, opts?: EnrichOptions): Promise<EnrichStats>;
+//# sourceMappingURL=enrich.d.ts.map

package/dist/graph/enrich.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"enrich.d.ts","sourceRoot":"","sources":["../../src/graph/enrich.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,KAAK,EAAE,cAAc,EAAqB,MAAM,eAAe,CAAC;AACvE,OAAO,KAAK,EAAQ,MAAM,EAAE,MAAM,YAAY,CAAC;AAK/C,MAAM,WAAW,aAAa;IAC5B,sFAAsF;IACtF,UAAU,CAAC,EAAE,cAAc,CAAC;IAC5B,uEAAuE;IACvE,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,KAAK,IAAI,CAAC;CAC7E;AAED,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,wBAAsB,WAAW,CAC/B,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC5B,IAAI,GAAE,aAAkB,GACvB,OAAO,CAAC,WAAW,CAAC,CAgFtB"}

package/dist/graph/enrich.js

@@ -0,0 +1,141 @@
+/** Cap on the stored crux: an over-long pick is trimmed to its leading slice. */
+const MAX_CRUX_LINES = 12;
+export async function enrichGraph(nodes, prior, sources, opts = {}) {
+    const stats = { cached: 0, computed: 0, stale: 0, pending: 0, errors: [] };
+    // Which nodes actually need an LLM call this run (after cache carry-over).
+    const dirty = [];
+    for (const node of nodes) {
+        const was = prior.get(node.id);
+        if (was?.summary_state === "ready" && was.body_hash === node.body_hash) {
+            node.summary = was.summary;
+            node.crux = was.crux;
+            node.summary_state = "ready";
+            stats.cached++;
+            continue;
+        }
+        // needs computing; seed with the old summary as a stale hint when one exists.
+        if (was && was.summary) {
+            node.summary = was.summary;
+            node.crux = was.crux;
+            node.summary_state = "stale";
+        }
+        dirty.push(node);
+    }
+    if (!opts.summarizer) {
+        for (const node of dirty) {
+            if (node.summary_state === "stale")
+                stats.stale++;
+            else
+                stats.pending++;
+        }
+        return stats;
+    }
+    // One LLM call per file: group the dirty nodes by the file they live in.
+    const byFile = new Map();
+    for (const node of dirty) {
+        if (!sources.has(node.path))
+            continue;
+        const arr = byFile.get(node.path);
+        if (arr)
+            arr.push(node);
+        else
+            byFile.set(node.path, [node]);
+    }
+    const files = [...byFile.keys()];
+    for (let i = 0; i < files.length; i++) {
+        const path = files[i];
+        const fileNodes = byFile.get(path);
+        const source = sources.get(path);
+        const lineCount = source.split("\n").length;
+        opts.onProgress?.({ index: i, total: files.length, node: path });
+        const refs = fileNodes.map((n) => {
+            const [startLine, endLine] = spanLines(n.span, lineCount);
+            return { id: n.id, kind: n.kind, signature: n.signature, startLine, endLine };
+        });
+        const { results, error } = await collectFileCrux(opts.summarizer, path, source, refs);
+        if (error)
+            stats.errors.push(`${path}: ${error}`);
+        if (results.size === 0) {
+            // whole-file call failed: leave every node as-is (stale hint or pending).
+            for (const node of fileNodes) {
+                if (node.summary_state === "stale")
+                    stats.stale++;
+                else
+                    stats.pending++;
+            }
+            continue;
+        }
+        for (const node of fileNodes) {
+            const r = results.get(node.id);
+            if (!r) {
+                // model skipped this symbol; keep whatever it had.
+                if (node.summary_state === "stale")
+                    stats.stale++;
+                else
+                    stats.pending++;
+                continue;
+            }
+            node.summary = r.summary || null;
+            node.crux = buildCrux(r, node, source, lineCount);
+            node.summary_state = "ready";
+            stats.computed++;
+        }
+    }
+    return stats;
+}
+/**
+ * Describe every requested definition in a file, re-asking for any the model
+ * omits (it sometimes drops entries from a batch). Returns whatever it collected
+ * plus the last error, if any — partial results are kept, not discarded.
+ */
+async function collectFileCrux(summarizer, path, source, refs) {
+    const results = new Map();
+    let missing = refs;
+    let error;
+    for (let attempt = 0; attempt < 2 && missing.length > 0; attempt++) {
+        try {
+            const list = await summarizer.describeFile({ path, source, nodes: missing });
+            for (const r of list)
+                if (!results.has(r.id))
+                    results.set(r.id, r);
+            missing = refs.filter((r) => !results.has(r.id));
+        }
+        catch (err) {
+            error = err instanceof Error ? err.message : String(err);
+            break;
+        }
+    }
+    return { results, error };
+}
+/**
+ * Cut the crux text verbatim from the file using the model's file-absolute line
+ * range, clamped to the node's own span. Returns null when the model reported no
+ * distinct crux (0/0) or gave an unusable range.
+ */
+function buildCrux(r, node, source, lineCount) {
+    // 0/0 (or an invalid range) is the model saying "nothing to highlight here".
+    if (r.crux_start < 1 || r.crux_end < r.crux_start)
+        return null;
+    const [nodeStart, nodeEnd] = spanLines(node.span, lineCount);
+    const start = Math.max(nodeStart, Math.min(r.crux_start, nodeEnd));
+    let end = Math.max(start, Math.min(r.crux_end, nodeEnd));
+    // Keep the crux readable: if the model pointed at a big region, store its
+    // leading slice (the anchor it chose) rather than the whole blob — still the
+    // most important part, and the full definition is reachable via node.span.
+    if (end - start + 1 > MAX_CRUX_LINES)
+        end = start + MAX_CRUX_LINES - 1;
+    const code = source.split("\n").slice(start - 1, end).join("\n");
+    if (!code.trim())
+        return null;
+    return { code, span: `L${start}-L${end}` };
+}
+/** Parse a `"L12-L30"` span into a clamped [start, end] line pair (1-based). */
+function spanLines(span, fileLines) {
+    const m = /^L(\d+)-L(\d+)$/.exec(span);
+    if (!m)
+        return [1, fileLines];
+    const start = Math.max(1, Math.min(Number(m[1]), fileLines));
+    const end = Math.max(start, Math.min(Number(m[2]), fileLines));
+    return [start, end];
+}
+//# sourceMappingURL=enrich.js.map

package/dist/graph/enrich.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"enrich.js","sourceRoot":"","sources":["../../src/graph/enrich.ts"],"names":[],"mappings":"AAwBA,iFAAiF;AACjF,MAAM,cAAc,GAAG,EAAE,CAAC;AAiB1B,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,KAAe,EACf,KAA0B,EAC1B,OAA4B,EAC5B,OAAsB,EAAE;IAExB,MAAM,KAAK,GAAgB,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAExF,2EAA2E;IAC3E,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,GAAG,EAAE,aAAa,KAAK,OAAO,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YACvE,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;YAC7B,KAAK,CAAC,MAAM,EAAE,CAAC;YACf,SAAS;QACX,CAAC;QACD,8EAA8E;QAC9E,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YACvB,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,OAAO,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC/B,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO;gBAAE,KAAK,CAAC,KAAK,EAAE,CAAC;;gBAC7C,KAAK,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,yEAAyE;IACzE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACnB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACpC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAClC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAEjE,MAAM,IAAI,GAAc,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1C,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC1D,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;QAChF,CAAC,CAAC,CAAC;QAEH,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtF,IAAI,KAAK;YAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,KAAK,EAAE,CAAC,CAAC;QAClD,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACvB,0EAA0E;YAC1E,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO;oBAAE,KAAK,CAAC,KAAK,EAAE,CAAC;;oBAC7C,KAAK,CAAC,OAAO,EAAE,CAAC;YACvB,CAAC;YACD,SAAS;QACX,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC,EAAE,CAAC;gBACP,mDAAmD;gBACnD,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO;oBAAE,KAAK,CAAC,KAAK,EAAE,CAAC;;oBAC7C,KAAK,CAAC,OAAO,EAAE,CAAC;gBACrB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC;YACjC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;YAClD,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;YAC7B,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,eAAe,CAC5B,UAA0B,EAC1B,IAAY,EACZ,MAAc,EACd,IAAe;IAEf,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,KAAyB,CAAC;IAC9B,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC;QACnE,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YAC7E,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACnE,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzD,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,CAAW,EAAE,IAAY,EAAE,MAAc,EAAE,SAAiB;IAC7E,6EAA6E;IAC7E,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAC/D,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;IACnE,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;IAEzD,0EAA0E;IAC1E,6EAA6E;IAC7E,2EAA2E;IAC3E,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,cAAc;QAAE,GAAG,GAAG,KAAK,GAAG,cAAc,GAAG,CAAC,CAAC;IAEvE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,KAAK,GAAG,EAAE,EAAE,CAAC;AAC7C,CAAC;AAED,gFAAgF;AAChF,SAAS,SAAS,CAAC,IAAY,EAAE,SAAiB;IAChD,MAAM,CAAC,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IAC/D,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACtB,CAAC"}

package/dist/graph/extract.d.ts

@@ -0,0 +1,23 @@
+import type { NodeV1, Relation } from "./types.js";
+export type Language = "typescript" | "tsx" | "python";
+/** Map a file path to a supported language, or null if unsupported. */
+export declare function languageOf(path: string): Language | null;
+/**
+ * An edge whose target isn't resolved yet. build.ts turns these into EdgeV1 by
+ * matching `name`/`specifier` against the repo-wide node index.
+ */
+export interface RawEdge {
+    source: string;
+    relation: Relation;
+    file: string;
+    targetId?: string;
+    specifier?: string;
+    name?: string;
+    viaMember?: boolean;
+}
+export interface ExtractResult {
+    nodes: NodeV1[];
+    rawEdges: RawEdge[];
+}
+export declare function extractFile(rel: string, source: string, lang: Language): ExtractResult;
+//# sourceMappingURL=extract.d.ts.map

package/dist/graph/extract.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extract.d.ts","sourceRoot":"","sources":["../../src/graph/extract.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAQ,MAAM,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEzD,MAAM,MAAM,QAAQ,GAAG,YAAY,GAAG,KAAK,GAAG,QAAQ,CAAC;AAEvD,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CAMxD;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,QAAQ,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,OAAO,EAAE,CAAC;CACrB;AAkDD,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,aAAa,CAiCtF"}