@roarpeng/graphflow 0.6.15 → 1.0.0

package/dist/graph/graph-compression.js

@@ -0,0 +1,153 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_EDGE_WEIGHTS = void 0;
+exports.extractConnectedSubgraph = extractConnectedSubgraph;
+exports.computePageRank = computePageRank;
+exports.blendWithCentrality = blendWithCentrality;
+/**
+ * Graph-structure-based context compression.
+ *
+ * Unlike token-level pruning (LLMLingua-style), this module compresses by
+ * exploiting the graph topology: edge-weighted connectivity + centrality
+ * ranking keeps the most "load-bearing" nodes and drops peripheral ones,
+ * with zero LLM cost.
+ */
+exports.DEFAULT_EDGE_WEIGHTS = {
+    references: 1.0,
+    imports: 0.85,
+    depends_on: 0.7,
+    prerequisite: 0.7,
+    defines: 0.6,
+    validates: 0.5,
+    changes: 0.4,
+    improves: 0.4,
+    co_occurs: 0.3,
+    conflicts_with: 0.2,
+};
+/**
+ * Extracts a connected subgraph centered on the seed nodes, ranking members
+ * by edge-weighted proximity. Returns nodes sorted by relevance (seeds first).
+ */
+async function extractConnectedSubgraph(client, seeds, options) {
+    if (typeof client.getNeighbors !== "function" || seeds.length === 0) {
+        return seeds.map((node) => ({ node, score: 1 }));
+    }
+    const weights = { ...exports.DEFAULT_EDGE_WEIGHTS, ...options?.edgeWeights };
+    const maxNodes = options?.maxNodes ?? 30;
+    const hops = options?.hops ?? 2;
+    const minNodeWeight = options?.minNodeWeight ?? 0;
+    // Seeds start with full score; each hop decays.
+    const scores = new Map();
+    const nodeById = new Map();
+    for (const seed of seeds) {
+        scores.set(seed.id, 1);
+        nodeById.set(seed.id, seed);
+    }
+    let frontier = seeds.map((s) => s.id);
+    const relations = Object.keys(weights);
+    for (let depth = 0; depth < hops; depth += 1) {
+        if (frontier.length === 0 || nodeById.size >= maxNodes)
+            break;
+        const decay = 1 / (depth + 2); // hop 0 -> 0.5, hop 1 -> 0.33, ...
+        const neighbors = await client.getNeighbors(frontier, relations, "both");
+        const nextFrontier = [];
+        for (const { node, via } of neighbors) {
+            const edgeWeight = weights[via] ?? 0.1;
+            const contribution = edgeWeight * decay;
+            const prev = scores.get(node.id) ?? 0;
+            scores.set(node.id, prev + contribution);
+            if (!nodeById.has(node.id)) {
+                nodeById.set(node.id, node);
+                nextFrontier.push(node.id);
+            }
+        }
+        frontier = nextFrontier;
+    }
+    const ranked = [];
+    for (const [id, score] of scores.entries()) {
+        const node = nodeById.get(id);
+        if (!node)
+            continue;
+        if (score < minNodeWeight)
+            continue;
+        ranked.push({ node, score });
+    }
+    ranked.sort((a, b) => b.score - a.score);
+    return ranked.slice(0, maxNodes);
+}
+/**
+ * Computes weighted PageRank over a node/edge set. Used to surface "central"
+ * nodes (frequently-referenced functions, core modules) that should be
+ * prioritized in the context budget.
+ */
+function computePageRank(nodes, edges, options) {
+    const damping = options?.damping ?? 0.85;
+    const iterations = options?.iterations ?? 20;
+    const weights = { ...exports.DEFAULT_EDGE_WEIGHTS, ...options?.edgeWeights };
+    const ids = nodes.map((n) => n.id);
+    const idSet = new Set(ids);
+    const n = ids.length;
+    if (n === 0)
+        return new Map();
+    // Build weighted outbound adjacency.
+    const outWeight = new Map();
+    const outEdges = new Map();
+    for (const edge of edges) {
+        if (!idSet.has(edge.from) || !idSet.has(edge.to))
+            continue;
+        const w = weights[edge.relation] ?? 0.1;
+        const list = outEdges.get(edge.from) ?? [];
+        list.push({ to: edge.to, w });
+        outEdges.set(edge.from, list);
+        outWeight.set(edge.from, (outWeight.get(edge.from) ?? 0) + w);
+    }
+    let rank = new Map(ids.map((id) => [id, 1 / n]));
+    const base = (1 - damping) / n;
+    for (let iter = 0; iter < iterations; iter += 1) {
+        const next = new Map(ids.map((id) => [id, base]));
+        let danglingSum = 0;
+        for (const id of ids) {
+            const out = outEdges.get(id);
+            const r = rank.get(id) ?? 0;
+            if (!out || out.length === 0) {
+                danglingSum += r;
+                continue;
+            }
+            const total = outWeight.get(id) ?? 1;
+            for (const { to, w } of out) {
+                next.set(to, (next.get(to) ?? 0) + damping * r * (w / total));
+            }
+        }
+        // Redistribute dangling-node mass uniformly.
+        if (danglingSum > 0) {
+            const share = (damping * danglingSum) / n;
+            for (const id of ids) {
+                next.set(id, (next.get(id) ?? 0) + share);
+            }
+        }
+        rank = next;
+    }
+    return rank;
+}
+/**
+ * Re-ranks a candidate node list by blending retrieval order with PageRank
+ * centrality. alpha controls the centrality weight (0 = pure retrieval order).
+ */
+function blendWithCentrality(candidates, pageRank, alpha = 0.3) {
+    if (candidates.length === 0)
+        return candidates;
+    const maxPr = Math.max(1e-9, ...Array.from(pageRank.values()));
+    const scored = candidates.map((node, index) => {
+        const retrievalScore = 1 - index / candidates.length; // higher = earlier
+        const centrality = (pageRank.get(node.id) ?? 0) / maxPr;
+        const score = (1 - alpha) * retrievalScore + alpha * centrality;
+        return { node, score, index };
+    });
+    scored.sort((a, b) => {
+        if (b.score !== a.score)
+            return b.score - a.score;
+        return a.index - b.index;
+    });
+    return scored.map((s) => s.node);
+}
+//# sourceMappingURL=graph-compression.js.map

package/dist/graph/graph-compression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-compression.js","sourceRoot":"","sources":["../../src/graph/graph-compression.ts"],"names":[],"mappings":";;;AA0CA,4DAsDC;AAaD,0CA0DC;AAMD,kDAqBC;AA/LD;;;;;;;GAOG;AAEU,QAAA,oBAAoB,GAA0C;IACzE,UAAU,EAAE,GAAG;IACf,OAAO,EAAE,IAAI;IACb,UAAU,EAAE,GAAG;IACf,YAAY,EAAE,GAAG;IACjB,OAAO,EAAE,GAAG;IACZ,SAAS,EAAE,GAAG;IACd,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,SAAS,EAAE,GAAG;IACd,cAAc,EAAE,GAAG;CACpB,CAAC;AAeF;;;GAGG;AACI,KAAK,UAAU,wBAAwB,CAC5C,MAAmB,EACnB,KAAkB,EAClB,OAAkC;IAElC,IAAI,OAAO,MAAM,CAAC,YAAY,KAAK,UAAU,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,OAAO,GAAG,EAAE,GAAG,4BAAoB,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,CAAC;IACrE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAC;IACzC,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC;IAChC,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,CAAC,CAAC;IAElD,gDAAgD;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,IAAI,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAA4B,CAAC;IAElE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ;YAAE,MAAM;QAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,mCAAmC;QAClE,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzE,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,SAAS,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACvC,MAAM,YAAY,GAAG,UAAU,GAAG,KAAK,CAAC;YACxC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,YAAY,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC5B,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,YAAY,CAAC;IAC1B,CAAC;IAED,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,KAAK,GAAG,aAAa;YAAE,SAAS;QACpC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AACnC,CAAC;AAQD;;;;GAIG;AACH,SAAgB,eAAe,CAC7B,KAAkB,EAClB,KAAkB,EAClB,OAAyB;IAEzB,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC;IACzC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAG,EAAE,GAAG,4BAAoB,EAAE,GAAG,OAAO,EAAE,WAAW,EAAE,CAAC;IAErE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAE9B,qCAAqC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuC,CAAC;IAChE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3D,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;QACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,IAAI,IAAI,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAE/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,WAAW,IAAI,CAAC,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAC1C,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,IAAI,GAAG,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAgB,mBAAmB,CACjC,UAAuB,EACvB,QAA6B,EAC7B,KAAK,GAAG,GAAG;IAEX,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAE/D,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5C,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,mBAAmB;QACzE,MAAM,UAAU,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;QACxD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,cAAc,GAAG,KAAK,GAAG,UAAU,CAAC;QAChE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC"}

package/dist/graph/repo-map.d.ts

@@ -0,0 +1,25 @@
+import type { GraphClient } from "./client-factory";
+/**
+ * Repo-Map: module-level overview compression inspired by Aider's repo-map.
+ *
+ * Instead of sending full symbol definitions, we generate a high-level "map"
+ * where each module gets one line: `path/to/module: exports symbol1, symbol2, ...`
+ *
+ * This is extremely token-efficient (~100-300 tokens for entire repos) and
+ * lets LLMs understand the project structure before diving into specific code.
+ */
+export interface RepoMapEntry {
+    moduleId: string;
+    path: string;
+    exports: string[];
+    tokenEstimate: number;
+}
+/**
+ * Builds a repo map from Module nodes. Each entry summarizes one module's exports.
+ */
+export declare function buildRepoMap(client: GraphClient): Promise<RepoMapEntry[]>;
+/**
+ * Formats the repo map into a single string for injection into LLM context.
+ */
+export declare function formatRepoMapString(entries: RepoMapEntry[]): string;
+//# sourceMappingURL=repo-map.d.ts.map

package/dist/graph/repo-map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"repo-map.d.ts","sourceRoot":"","sources":["../../src/graph/repo-map.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD;;;;;;;;GAQG;AAEH,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,wBAAsB,YAAY,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAwB/E;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,MAAM,CAUnE"}

package/dist/graph/repo-map.js

@@ -0,0 +1,80 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildRepoMap = buildRepoMap;
+exports.formatRepoMapString = formatRepoMapString;
+/**
+ * Builds a repo map from Module nodes. Each entry summarizes one module's exports.
+ */
+async function buildRepoMap(client) {
+    if (typeof client.readSnapshot !== "function") {
+        return [];
+    }
+    const snapshot = client.readSnapshot();
+    const modules = snapshot.nodes.filter((n) => n.type === "Module");
+    const entries = [];
+    for (const mod of modules) {
+        const path = extractModulePath(mod);
+        const exports = extractExportedSymbols(mod, snapshot.nodes);
+        const line = formatRepoMapLine(path, exports);
+        entries.push({
+            moduleId: mod.id,
+            path,
+            exports,
+            tokenEstimate: Math.ceil(line.length / 4),
+        });
+    }
+    // Sort by path for readability.
+    entries.sort((a, b) => a.path.localeCompare(b.path));
+    return entries;
+}
+/**
+ * Formats the repo map into a single string for injection into LLM context.
+ */
+function formatRepoMapString(entries) {
+    if (entries.length === 0) {
+        return "# Repository Map\n(No modules indexed)\n";
+    }
+    const lines = ["# Repository Map", ""];
+    for (const entry of entries) {
+        lines.push(formatRepoMapLine(entry.path, entry.exports));
+    }
+    return lines.join("\n");
+}
+function formatRepoMapLine(path, exports) {
+    if (exports.length === 0) {
+        return `${path}`;
+    }
+    return `${path}: exports ${exports.slice(0, 10).join(", ")}${exports.length > 10 ? ", ..." : ""}`;
+}
+function extractModulePath(moduleNode) {
+    // Module node content often contains the file path or module name.
+    const content = moduleNode.content.trim();
+    const pathMatch = content.match(/^(?:module|file):\s*(.+)$/i);
+    if (pathMatch && pathMatch[1]) {
+        return pathMatch[1].trim();
+    }
+    // Fallback: use id if it looks like a path.
+    if (moduleNode.id.includes("/") || moduleNode.id.includes("\\")) {
+        return moduleNode.id;
+    }
+    return content || moduleNode.id;
+}
+function extractExportedSymbols(moduleNode, _allNodes) {
+    // Heuristic: look for Symbol nodes that reference this module via "defines" edges.
+    // In practice, you'd traverse edges from the module to its defined symbols.
+    // For now, we do a simple name-based heuristic from the module's metadata.
+    const meta = moduleNode.metadata;
+    if (meta && Array.isArray(meta.exports)) {
+        return meta.exports.slice(0, 20).map(String);
+    }
+    // Fallback: scan content for "exports" keyword.
+    const content = moduleNode.content;
+    const exportMatches = content.match(/exports?[:\s]+([^\n]+)/gi);
+    if (exportMatches) {
+        return exportMatches
+            .map((m) => m.replace(/^exports?[:\s]+/i, "").trim())
+            .slice(0, 10);
+    }
+    return [];
+}
+//# sourceMappingURL=repo-map.js.map

package/dist/graph/repo-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"repo-map.js","sourceRoot":"","sources":["../../src/graph/repo-map.ts"],"names":[],"mappings":";;AAuBA,oCAwBC;AAKD,kDAUC;AA1CD;;GAEG;AACI,KAAK,UAAU,YAAY,CAAC,MAAmB;IACpD,IAAI,OAAO,MAAM,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IAClE,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC;YACX,QAAQ,EAAE,GAAG,CAAC,EAAE;YAChB,IAAI;YACJ,OAAO;YACP,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,gCAAgC;IAChC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAgB,mBAAmB,CAAC,OAAuB;IACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,0CAA0C,CAAC;IACpD,CAAC;IAED,MAAM,KAAK,GAAa,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC;IACjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY,EAAE,OAAiB;IACxD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,GAAG,IAAI,EAAE,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,IAAI,aAAa,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;AACpG,CAAC;AAED,SAAS,iBAAiB,CAAC,UAAqB;IAC9C,mEAAmE;IACnE,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAC9D,IAAI,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9B,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IACD,4CAA4C;IAC5C,IAAI,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAChE,OAAO,UAAU,CAAC,EAAE,CAAC;IACvB,CAAC;IACD,OAAO,OAAO,IAAI,UAAU,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,sBAAsB,CAAC,UAAqB,EAAE,SAAsB;IAC3E,mFAAmF;IACnF,4EAA4E;IAC5E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;IACjC,IAAI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACxC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED,gDAAgD;IAChD,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,CAAC;IACnC,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAChE,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,aAAa;aACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;aACpD,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/graph/semantic-compression.d.ts

@@ -0,0 +1,65 @@
+import type { GraphNode } from "../core/types";
+import { type EmbeddingProvider } from "../learning/embeddings";
+import { type OpenBmbRuntimeOptions } from "../routing/provider-adapters/openbmb";
+import type { CompressionModelHandle } from "./compression-model";
+/**
+ * Semantic compression via minicpm-1b: cluster similar nodes and generate
+ * unified summaries, or condense verbose content into dense descriptions.
+ *
+ * This is the "Layer 1" compression that leverages the local LLM after graph-
+ * structure pruning has already reduced the candidate set.
+ */
+export interface ClusteringOptions {
+    embeddingProvider?: EmbeddingProvider;
+    similarityThreshold?: number;
+    maxClusterSize?: number;
+}
+export interface NodeCluster {
+    representative: GraphNode;
+    members: GraphNode[];
+    avgSimilarity: number;
+}
+/**
+ * Clusters nodes by embedding similarity. Nodes within a cluster can be
+ * merged into a single summary line to save tokens.
+ */
+export declare function clusterSimilarNodes(nodes: GraphNode[], options?: ClusteringOptions): Promise<NodeCluster[]>;
+export interface SummarizerOptions extends OpenBmbRuntimeOptions {
+    maxSummaryTokens?: number;
+    /** Preferred: unified compression model handle (auto-selects external/embedded). */
+    modelHandle?: CompressionModelHandle;
+}
+/**
+ * Generates a unified summary for a cluster of similar nodes.
+ * Uses the provided compression model handle (external or embedded) if given,
+ * otherwise falls back to direct embedded openbmb invocation.
+ * Example: 3 overloaded `login()` variants → "login function with 3 signatures".
+ */
+export declare function summarizeCluster(cluster: NodeCluster, options?: SummarizerOptions): Promise<string>;
+export interface DensifierOptions extends OpenBmbRuntimeOptions {
+    maxOutputTokens?: number;
+    minInputTokens?: number;
+    /** Preferred: unified compression model handle (auto-selects external/embedded). */
+    modelHandle?: CompressionModelHandle;
+}
+/**
+ * Rewrites verbose node content into dense summaries.
+ * Uses the provided compression model handle if given, otherwise falls back to
+ * direct embedded openbmb invocation. Only applies to nodes exceeding minInputTokens.
+ */
+export declare function densifyNodeContent(node: GraphNode, options?: DensifierOptions): Promise<string>;
+/**
+ * High-level pipeline: cluster similar nodes, summarize each cluster, and
+ * densify remaining verbose nodes. Returns compressed node set.
+ *
+ * When a compression model handle is provided, summarization/densification
+ * route through it (external economy tier or embedded minicpm); otherwise they
+ * fall back to direct embedded openbmb invocation.
+ */
+export declare function applySemanticCompression(nodes: GraphNode[], options?: {
+    clusteringOptions?: ClusteringOptions;
+    summarizerOptions?: SummarizerOptions;
+    densifierOptions?: DensifierOptions;
+    modelHandle?: CompressionModelHandle;
+}): Promise<GraphNode[]>;
+//# sourceMappingURL=semantic-compression.d.ts.map

package/dist/graph/semantic-compression.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-compression.d.ts","sourceRoot":"","sources":["../../src/graph/semantic-compression.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAsC,KAAK,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AACpG,OAAO,EAAuB,KAAK,qBAAqB,EAAE,MAAM,sCAAsC,CAAC;AACvG,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AAElE;;;;;;GAMG;AAEH,MAAM,WAAW,iBAAiB;IAChC,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IACtC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,WAAW;IAC1B,cAAc,EAAE,SAAS,CAAC;IAC1B,OAAO,EAAE,SAAS,EAAE,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAsB,mBAAmB,CACvC,KAAK,EAAE,SAAS,EAAE,EAClB,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,WAAW,EAAE,CAAC,CA6CxB;AAED,MAAM,WAAW,iBAAkB,SAAQ,qBAAqB;IAC9D,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,oFAAoF;IACpF,WAAW,CAAC,EAAE,sBAAsB,CAAC;CACtC;AAED;;;;;GAKG;AACH,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,WAAW,EACpB,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,MAAM,CAAC,CA8BjB;AAED,MAAM,WAAW,gBAAiB,SAAQ,qBAAqB;IAC7D,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,oFAAoF;IACpF,WAAW,CAAC,EAAE,sBAAsB,CAAC;CACtC;AAED;;;;GAIG;AACH,wBAAsB,kBAAkB,CACtC,IAAI,EAAE,SAAS,EACf,OAAO,CAAC,EAAE,gBAAgB,GACzB,OAAO,CAAC,MAAM,CAAC,CAqCjB;AAED;;;;;;;GAOG;AACH,wBAAsB,wBAAwB,CAC5C,KAAK,EAAE,SAAS,EAAE,EAClB,OAAO,CAAC,EAAE;IACR,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IACtC,iBAAiB,CAAC,EAAE,iBAAiB,CAAC;IACtC,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IACpC,WAAW,CAAC,EAAE,sBAAsB,CAAC;CACtC,GACA,OAAO,CAAC,SAAS,EAAE,CAAC,CA6CtB"}

package/dist/graph/semantic-compression.js

@@ -0,0 +1,173 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.clusterSimilarNodes = clusterSimilarNodes;
+exports.summarizeCluster = summarizeCluster;
+exports.densifyNodeContent = densifyNodeContent;
+exports.applySemanticCompression = applySemanticCompression;
+const embeddings_1 = require("../learning/embeddings");
+const openbmb_1 = require("../routing/provider-adapters/openbmb");
+/**
+ * Clusters nodes by embedding similarity. Nodes within a cluster can be
+ * merged into a single summary line to save tokens.
+ */
+async function clusterSimilarNodes(nodes, options) {
+    const threshold = options?.similarityThreshold ?? 0.75;
+    const maxSize = options?.maxClusterSize ?? 5;
+    // Ensure all nodes have embeddings.
+    const withEmbedding = nodes.filter((n) => (0, embeddings_1.extractEmbedding)(n) !== null);
+    if (withEmbedding.length === 0)
+        return [];
+    const clusters = [];
+    const assigned = new Set();
+    for (const candidate of withEmbedding) {
+        if (assigned.has(candidate.id))
+            continue;
+        const cluster = [candidate];
+        assigned.add(candidate.id);
+        const candidateEmb = (0, embeddings_1.extractEmbedding)(candidate);
+        let simSum = 0;
+        for (const other of withEmbedding) {
+            if (assigned.has(other.id))
+                continue;
+            if (cluster.length >= maxSize)
+                break;
+            const otherEmb = (0, embeddings_1.extractEmbedding)(other);
+            if (!otherEmb)
+                continue;
+            const sim = (0, embeddings_1.cosineSimilarity)(candidateEmb, otherEmb);
+            if (sim >= threshold) {
+                cluster.push(other);
+                assigned.add(other.id);
+                simSum += sim;
+            }
+        }
+        // Only create cluster if we found similar nodes (cluster size > 1).
+        if (cluster.length > 1) {
+            clusters.push({
+                representative: candidate,
+                members: cluster,
+                avgSimilarity: simSum / (cluster.length - 1),
+            });
+        }
+    }
+    return clusters;
+}
+/**
+ * Generates a unified summary for a cluster of similar nodes.
+ * Uses the provided compression model handle (external or embedded) if given,
+ * otherwise falls back to direct embedded openbmb invocation.
+ * Example: 3 overloaded `login()` variants → "login function with 3 signatures".
+ */
+async function summarizeCluster(cluster, options) {
+    const memberContents = cluster.members.map((m) => m.content).slice(0, 5);
+    const prompt = [
+        "你是代码摘要生成器。多个相似的代码片段需要合并为一句统一描述。",
+        "要求：",
+        "1. 用一句话概括它们的共同功能（20字以内）",
+        "2. 如果是重载/变体，说明有几个版本",
+        "3. 不要逐个列举，只给出统一摘要",
+        "",
+        "代码片段：",
+        ...memberContents.map((c, i) => `${i + 1}. ${c}`),
+        "",
+        "统一摘要：",
+    ].join("\n");
+    const maxTokens = options?.maxSummaryTokens ?? 64;
+    try {
+        const result = options?.modelHandle
+            ? await options.modelHandle.generate(prompt, maxTokens)
+            : await (0, openbmb_1.openbmbGenerateText)({ prompt, model: options?.modelPath ?? "minicpm-1b" }, { ...options, maxTokens });
+        return result.trim().replace(/^统一摘要[:：]?\s*/i, "");
+    }
+    catch {
+        // Degrade gracefully: if no model is available, keep the representative's original content.
+        return cluster.representative.content;
+    }
+}
+/**
+ * Rewrites verbose node content into dense summaries.
+ * Uses the provided compression model handle if given, otherwise falls back to
+ * direct embedded openbmb invocation. Only applies to nodes exceeding minInputTokens.
+ */
+async function densifyNodeContent(node, options) {
+    const content = node.content;
+    const minInput = options?.minInputTokens ?? 150;
+    const estimatedTokens = Math.ceil(content.length / 4);
+    if (estimatedTokens < minInput) {
+        // Already concise.
+        return content;
+    }
+    const prompt = [
+        "你是代码压缩专家。将以下代码签名/内容改写为极简版（保留核心信息，去掉冗余）。",
+        "要求：",
+        "1. 保留函数名、参数、返回类型",
+        "2. 去掉注释、装饰器、冗长描述",
+        "3. 输出格式：function_name(params) -> return_type | 核心功能",
+        "",
+        `原内容：\n${content.slice(0, 600)}`,
+        "",
+        "压缩版：",
+    ].join("\n");
+    const maxTokens = options?.maxOutputTokens ?? 80;
+    try {
+        const result = options?.modelHandle
+            ? await options.modelHandle.generate(prompt, maxTokens)
+            : await (0, openbmb_1.openbmbGenerateText)({ prompt, model: options?.modelPath ?? "minicpm-1b" }, { ...options, maxTokens });
+        return result.trim().replace(/^压缩版[:：]?\s*/i, "");
+    }
+    catch {
+        // Degrade gracefully: if no model is available, keep the original content.
+        return content;
+    }
+}
+/**
+ * High-level pipeline: cluster similar nodes, summarize each cluster, and
+ * densify remaining verbose nodes. Returns compressed node set.
+ *
+ * When a compression model handle is provided, summarization/densification
+ * route through it (external economy tier or embedded minicpm); otherwise they
+ * fall back to direct embedded openbmb invocation.
+ */
+async function applySemanticCompression(nodes, options) {
+    const clusters = await clusterSimilarNodes(nodes, options?.clusteringOptions);
+    const clusterIds = new Set(clusters.flatMap((c) => c.members.map((m) => m.id)));
+    const summarizerOptions = {
+        ...options?.summarizerOptions,
+        ...(options?.modelHandle ? { modelHandle: options.modelHandle } : {}),
+    };
+    const densifierOptions = {
+        ...options?.densifierOptions,
+        ...(options?.modelHandle ? { modelHandle: options.modelHandle } : {}),
+    };
+    const compressed = [];
+    // Replace each cluster with a single summarized node.
+    for (const cluster of clusters) {
+        const summary = await summarizeCluster(cluster, summarizerOptions);
+        compressed.push({
+            ...cluster.representative,
+            content: summary,
+            metadata: {
+                ...cluster.representative.metadata,
+                compressed: true,
+                clusterSize: cluster.members.length,
+                originalIds: cluster.members.map((m) => m.id),
+            },
+        });
+    }
+    // Densify non-clustered nodes if verbose.
+    for (const node of nodes) {
+        if (clusterIds.has(node.id))
+            continue;
+        const dense = await densifyNodeContent(node, densifierOptions);
+        compressed.push({
+            ...node,
+            content: dense,
+            metadata: {
+                ...node.metadata,
+                ...(dense !== node.content ? { densified: true } : {}),
+            },
+        });
+    }
+    return compressed;
+}
+//# sourceMappingURL=semantic-compression.js.map

package/dist/graph/semantic-compression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-compression.js","sourceRoot":"","sources":["../../src/graph/semantic-compression.ts"],"names":[],"mappings":";;AA6BA,kDAgDC;AAcD,4CAiCC;AAcD,gDAwCC;AAUD,4DAqDC;AAhPD,uDAAoG;AACpG,kEAAuG;AAuBvG;;;GAGG;AACI,KAAK,UAAU,mBAAmB,CACvC,KAAkB,EAClB,OAA2B;IAE3B,MAAM,SAAS,GAAG,OAAO,EAAE,mBAAmB,IAAI,IAAI,CAAC;IACvD,MAAM,OAAO,GAAG,OAAO,EAAE,cAAc,IAAI,CAAC,CAAC;IAE7C,oCAAoC;IACpC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,6BAAgB,EAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IACxE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE1C,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;QACtC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAAE,SAAS;QAEzC,MAAM,OAAO,GAAgB,CAAC,SAAS,CAAC,CAAC;QACzC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAA,6BAAgB,EAAC,SAAS,CAAE,CAAC;QAClD,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YACrC,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO;gBAAE,MAAM;YAErC,MAAM,QAAQ,GAAG,IAAA,6BAAgB,EAAC,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,MAAM,GAAG,GAAG,IAAA,6BAAgB,EAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YACrD,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACpB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACvB,MAAM,IAAI,GAAG,CAAC;YAChB,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC;gBACZ,cAAc,EAAE,SAAS;gBACzB,OAAO,EAAE,OAAO;gBAChB,aAAa,EAAE,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;aAC7C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAQD;;;;;GAKG;AACI,KAAK,UAAU,gBAAgB,CACpC,OAAoB,EACpB,OAA2B;IAE3B,MAAM,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,MAAM,MAAM,GAAG;QACb,iCAAiC;QACjC,KAAK;QACL,yBAAyB;QACzB,qBAAqB;QACrB,mBAAmB;QACnB,EAAE;QACF,OAAO;QACP,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,EAAE;QACF,OAAO;KACR,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,MAAM,SAAS,GAAG,OAAO,EAAE,gBAAgB,IAAI,EAAE,CAAC;IAElD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,OAAO,EAAE,WAAW;YACjC,CAAC,CAAC,MAAM,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;YACvD,CAAC,CAAC,MAAM,IAAA,6BAAmB,EACvB,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,IAAI,YAAY,EAAE,EACrD,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,CAC1B,CAAC;QAEN,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;IACrD,CAAC;IAAC,MAAM,CAAC;QACP,4FAA4F;QAC5F,OAAO,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC;IACxC,CAAC;AACH,CAAC;AASD;;;;GAIG;AACI,KAAK,UAAU,kBAAkB,CACtC,IAAe,EACf,OAA0B;IAE1B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IAC7B,MAAM,QAAQ,GAAG,OAAO,EAAE,cAAc,IAAI,GAAG,CAAC;IAChD,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEtD,IAAI,eAAe,GAAG,QAAQ,EAAE,CAAC;QAC/B,mBAAmB;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,MAAM,GAAG;QACb,yCAAyC;QACzC,KAAK;QACL,kBAAkB;QAClB,kBAAkB;QAClB,qDAAqD;QACrD,EAAE;QACF,SAAS,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;QAChC,EAAE;QACF,MAAM;KACP,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,MAAM,SAAS,GAAG,OAAO,EAAE,eAAe,IAAI,EAAE,CAAC;IAEjD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,OAAO,EAAE,WAAW;YACjC,CAAC,CAAC,MAAM,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;YACvD,CAAC,CAAC,MAAM,IAAA,6BAAmB,EACvB,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,IAAI,YAAY,EAAE,EACrD,EAAE,GAAG,OAAO,EAAE,SAAS,EAAE,CAC1B,CAAC;QAEN,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAAC,MAAM,CAAC;QACP,2EAA2E;QAC3E,OAAO,OAAO,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,wBAAwB,CAC5C,KAAkB,EAClB,OAKC;IAED,MAAM,QAAQ,GAAG,MAAM,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC;IAC9E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEhF,MAAM,iBAAiB,GAAsB;QAC3C,GAAG,OAAO,EAAE,iBAAiB;QAC7B,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtE,CAAC;IACF,MAAM,gBAAgB,GAAqB;QACzC,GAAG,OAAO,EAAE,gBAAgB;QAC5B,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtE,CAAC;IAEF,MAAM,UAAU,GAAgB,EAAE,CAAC;IAEnC,sDAAsD;IACtD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,MAAM,gBAAgB,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;QACnE,UAAU,CAAC,IAAI,CAAC;YACd,GAAG,OAAO,CAAC,cAAc;YACzB,OAAO,EAAE,OAAO;YAChB,QAAQ,EAAE;gBACR,GAAG,OAAO,CAAC,cAAc,CAAC,QAAQ;gBAClC,UAAU,EAAE,IAAI;gBAChB,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM;gBACnC,WAAW,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC9C;SACF,CAAC,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACtC,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;QAC/D,UAAU,CAAC,IAAI,CAAC;YACd,GAAG,IAAI;YACP,OAAO,EAAE,KAAK;YACd,QAAQ,EAAE;gBACR,GAAG,IAAI,CAAC,QAAQ;gBAChB,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/integrations/agent-mcp-installer.d.ts

@@ -38,7 +38,18 @@ export interface McpInstallResult {
     status: "injected" | "created" | "skipped" | "error" | "updated";
     message?: string;
 }
+export interface McpAgentInstallStatus {
+    agentId: string;
+    agentName: string;
+    configPath: string;
+    scope: "user" | "workspace";
+    detected: boolean;
+    installed: boolean;
+}
+export type McpConfigFormat = "json" | "codex-toml";
 export declare function detectInstalledAgents(): DetectedAgent[];
+/** Inspect detected agents and whether GraphFlow MCP is present in each config file. */
+export declare function getMcpInstallStatus(serverName?: string): McpAgentInstallStatus[];
 export declare function resolveSystemNodeCommand(): string | undefined;
 export declare function resolveMcpNodeLaunch(options: {
     nodeCommand?: string;

package/dist/integrations/agent-mcp-installer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"agent-mcp-installer.d.ts","sourceRoot":"","sources":["../../src/integrations/agent-mcp-installer.ts"],"names":[],"mappings":"AAKA,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG,SAAS,CAAC;AAErD,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC9B;AAED,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,YAAY,GAAG,cAAc,CAAC;AACvE,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,KAAK,CAAC;AAE7C,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,2EAA2E;IAC3E,YAAY,CAAC,EAAE,eAAe,CAAC;IAC/B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,6FAA6F;IAC7F,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oFAAoF;IACpF,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,uFAAuF;IACvF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,2FAA2F;IAC3F,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC;IAC5B,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;IACjE,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAuJD,wBAAgB,qBAAqB,IAAI,aAAa,EAAE,CAYvD;AAOD,wBAAgB,wBAAwB,IAAI,MAAM,GAAG,SAAS,CAa7D;AAED,wBAAgB,oBAAoB,CAAC,OAAO,EAAE;IAC5C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAenD;AAED,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,iBAAiB,GAAG,aAAa,CA4D5E;AAkHD,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,iBAAiB,GAAG,gBAAgB,EAAE,CA8CzF;AAED,wBAAgB,sBAAsB,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,CAwCrE"}
+{"version":3,"file":"agent-mcp-installer.d.ts","sourceRoot":"","sources":["../../src/integrations/agent-mcp-installer.ts"],"names":[],"mappings":"AAKA,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG,SAAS,CAAC;AAErD,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC9B;AAED,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,YAAY,GAAG,cAAc,CAAC;AACvE,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,KAAK,CAAC;AAE7C,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,2EAA2E;IAC3E,YAAY,CAAC,EAAE,eAAe,CAAC;IAC/B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,6FAA6F;IAC7F,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oFAAoF;IACpF,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,uFAAuF;IACvF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,2FAA2F;IAC3F,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;CAC7B;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC;IAC5B,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;IACjE,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,GAAG,WAAW,CAAC;IAC5B,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,YAAY,CAAC;AAkMpD,wBAAgB,qBAAqB,IAAI,aAAa,EAAE,CAYvD;AAwBD,wFAAwF;AACxF,wBAAgB,mBAAmB,CAAC,UAAU,SAAc,GAAG,qBAAqB,EAAE,CAmCrF;AAOD,wBAAgB,wBAAwB,IAAI,MAAM,GAAG,SAAS,CAa7D;AAED,wBAAgB,oBAAoB,CAAC,OAAO,EAAE;IAC5C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAenD;AAuBD,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,iBAAiB,GAAG,aAAa,CAwE5E;AAwMD,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,iBAAiB,GAAG,gBAAgB,EAAE,CAoDzF;AAED,wBAAgB,sBAAsB,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,MAAM,CA0CrE"}