repo-codegraph 0.0.0-stage → 0.2.1

package/dist/graph/DirectedGraph.js

@@ -0,0 +1,258 @@
+/**
+ * A generic directed graph with deterministic insertion-order traversal.
+ *
+ * A -> B means A depends on B. Outgoing adjacency therefore answers
+ * dependency queries, while incoming adjacency answers dependent queries.
+ */
+export class DirectedGraph {
+    nodes = new Map();
+    outgoing = new Map();
+    incoming = new Map();
+    get nodeCount() {
+        return this.nodes.size;
+    }
+    get edgeCount() {
+        let count = 0;
+        for (const edgesByNeighbor of this.outgoing.values()) {
+            for (const edgesByType of edgesByNeighbor.values()) {
+                count += edgesByType.size;
+            }
+        }
+        return count;
+    }
+    addNode(node) {
+        if (this.nodes.has(node.id)) {
+            throw new Error(`Node already exists: ${node.id}`);
+        }
+        this.nodes.set(node.id, node);
+        this.outgoing.set(node.id, new Map());
+        this.incoming.set(node.id, new Map());
+    }
+    addEdge(edge) {
+        this.assertNodeExists(edge.from);
+        this.assertNodeExists(edge.to);
+        const outgoingFromSource = this.getAdjacencyBucket(this.outgoing, edge.from);
+        const edgesToDestination = this.getOrCreateNeighborBucket(outgoingFromSource, edge.to);
+        if (edgesToDestination.has(edge.type)) {
+            throw new Error(`Edge already exists: ${edge.from} -[${edge.type}]-> ${edge.to}`);
+        }
+        edgesToDestination.set(edge.type, edge);
+        const incomingToDestination = this.getAdjacencyBucket(this.incoming, edge.to);
+        const edgesFromSource = this.getOrCreateNeighborBucket(incomingToDestination, edge.from);
+        edgesFromSource.set(edge.type, edge);
+    }
+    removeNode(id) {
+        if (!this.nodes.has(id)) {
+            return false;
+        }
+        const outgoing = this.getAdjacencyBucket(this.outgoing, id);
+        for (const destinationId of outgoing.keys()) {
+            this.getAdjacencyBucket(this.incoming, destinationId).delete(id);
+        }
+        const incoming = this.getAdjacencyBucket(this.incoming, id);
+        for (const sourceId of incoming.keys()) {
+            this.getAdjacencyBucket(this.outgoing, sourceId).delete(id);
+        }
+        this.outgoing.delete(id);
+        this.incoming.delete(id);
+        this.nodes.delete(id);
+        return true;
+    }
+    removeEdge(from, to, type) {
+        this.assertNodeExists(from);
+        this.assertNodeExists(to);
+        const outgoingByNeighbor = this.getAdjacencyBucket(this.outgoing, from);
+        const outgoingByType = outgoingByNeighbor.get(to);
+        if (outgoingByType === undefined || !outgoingByType.delete(type)) {
+            return false;
+        }
+        if (outgoingByType.size === 0) {
+            outgoingByNeighbor.delete(to);
+        }
+        const incomingByNeighbor = this.getAdjacencyBucket(this.incoming, to);
+        const incomingByType = incomingByNeighbor.get(from);
+        incomingByType?.delete(type);
+        if (incomingByType?.size === 0) {
+            incomingByNeighbor.delete(from);
+        }
+        return true;
+    }
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    getNodes() {
+        return [...this.nodes.values()];
+    }
+    getEdges() {
+        const result = [];
+        for (const edgesByNeighbor of this.outgoing.values()) {
+            for (const edgesByType of edgesByNeighbor.values()) {
+                result.push(...edgesByType.values());
+            }
+        }
+        return result;
+    }
+    getOutgoingEdges(id) {
+        this.assertNodeExists(id);
+        return this.edgesFromBucket(this.getAdjacencyBucket(this.outgoing, id));
+    }
+    getIncomingEdges(id) {
+        this.assertNodeExists(id);
+        return this.edgesFromBucket(this.getAdjacencyBucket(this.incoming, id));
+    }
+    hasEdge(from, to, type) {
+        this.assertNodeExists(from);
+        this.assertNodeExists(to);
+        return this.getAdjacencyBucket(this.outgoing, from).get(to)?.has(type) ?? false;
+    }
+    /** Returns nodes at the destination of this node's outgoing edges. */
+    getNeighbors(id) {
+        return this.getDependencies(id);
+    }
+    /** Returns the direct nodes that `id` depends on. */
+    getDependencies(id) {
+        this.assertNodeExists(id);
+        return this.nodesForIds(this.getNeighborIds(this.outgoing, id));
+    }
+    /** Returns the direct nodes that depend on `id`. */
+    getDependents(id) {
+        this.assertNodeExists(id);
+        return this.nodesForIds(this.getNeighborIds(this.incoming, id));
+    }
+    /** Breadth-first traversal over outgoing edges. */
+    bfs(startId) {
+        this.assertNodeExists(startId);
+        const visited = new Set([startId]);
+        const queue = [startId];
+        const order = [];
+        let nextIndex = 0;
+        while (nextIndex < queue.length) {
+            const currentId = queue[nextIndex];
+            nextIndex += 1;
+            // The loop condition guarantees this indexed item exists.
+            if (currentId === undefined) {
+                continue;
+            }
+            order.push(currentId);
+            for (const neighborId of this.getNeighborIds(this.outgoing, currentId)) {
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    queue.push(neighborId);
+                }
+            }
+        }
+        return order;
+    }
+    /** Iterative depth-first traversal over outgoing edges. */
+    dfs(startId) {
+        this.assertNodeExists(startId);
+        const visited = new Set();
+        const stack = [startId];
+        const order = [];
+        while (stack.length > 0) {
+            const currentId = stack.pop();
+            if (currentId === undefined || visited.has(currentId)) {
+                continue;
+            }
+            visited.add(currentId);
+            order.push(currentId);
+            const neighbors = [...this.getNeighborIds(this.outgoing, currentId)];
+            // A stack is last-in, first-out. Reverse insertion preserves the same
+            // left-to-right neighbor order users see in dependency queries.
+            for (let index = neighbors.length - 1; index >= 0; index -= 1) {
+                const neighborId = neighbors[index];
+                if (neighborId !== undefined && !visited.has(neighborId)) {
+                    stack.push(neighborId);
+                }
+            }
+        }
+        return order;
+    }
+    /** Finds a shortest path by edge count, following outgoing edges. */
+    findPath(sourceId, targetId) {
+        this.assertNodeExists(sourceId);
+        this.assertNodeExists(targetId);
+        if (sourceId === targetId) {
+            return [sourceId];
+        }
+        const visited = new Set([sourceId]);
+        const parent = new Map();
+        const queue = [sourceId];
+        let nextIndex = 0;
+        while (nextIndex < queue.length) {
+            const currentId = queue[nextIndex];
+            nextIndex += 1;
+            if (currentId === undefined) {
+                continue;
+            }
+            for (const neighborId of this.getNeighborIds(this.outgoing, currentId)) {
+                if (visited.has(neighborId)) {
+                    continue;
+                }
+                visited.add(neighborId);
+                parent.set(neighborId, currentId);
+                if (neighborId === targetId) {
+                    return this.reconstructPath(parent, sourceId, targetId);
+                }
+                queue.push(neighborId);
+            }
+        }
+        return null;
+    }
+    assertNodeExists(id) {
+        if (!this.nodes.has(id)) {
+            throw new Error(`Node does not exist: ${id}`);
+        }
+    }
+    getAdjacencyBucket(adjacency, id) {
+        const bucket = adjacency.get(id);
+        if (bucket === undefined) {
+            throw new Error(`Internal graph invariant failed for node: ${id}`);
+        }
+        return bucket;
+    }
+    getOrCreateNeighborBucket(adjacency, neighborId) {
+        const existing = adjacency.get(neighborId);
+        if (existing !== undefined) {
+            return existing;
+        }
+        const created = new Map();
+        adjacency.set(neighborId, created);
+        return created;
+    }
+    getNeighborIds(adjacency, id) {
+        return this.getAdjacencyBucket(adjacency, id).keys();
+    }
+    nodesForIds(ids) {
+        const result = [];
+        for (const id of ids) {
+            const node = this.nodes.get(id);
+            if (node === undefined) {
+                throw new Error(`Internal graph invariant failed for node: ${id}`);
+            }
+            result.push(node);
+        }
+        return result;
+    }
+    edgesFromBucket(bucket) {
+        const result = [];
+        for (const edgesByType of bucket.values()) {
+            result.push(...edgesByType.values());
+        }
+        return result;
+    }
+    reconstructPath(parent, sourceId, targetId) {
+        const reversedPath = [targetId];
+        let currentId = targetId;
+        while (currentId !== sourceId) {
+            const parentId = parent.get(currentId);
+            if (parentId === undefined) {
+                throw new Error("Internal graph invariant failed while rebuilding path");
+            }
+            reversedPath.push(parentId);
+            currentId = parentId;
+        }
+        return reversedPath.reverse();
+    }
+}
+//# sourceMappingURL=DirectedGraph.js.map

package/dist/graph/DirectedGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DirectedGraph.js","sourceRoot":"","sources":["../../src/graph/DirectedGraph.ts"],"names":[],"mappings":"AAYA;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IAKP,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC/C,QAAQ,GAAG,IAAI,GAAG,EAGhC,CAAC;IACa,QAAQ,GAAG,IAAI,GAAG,EAGhC,CAAC;IAEJ,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,IAAI,SAAS;QACX,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACrD,KAAK,MAAM,WAAW,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnD,KAAK,IAAI,WAAW,CAAC,IAAI,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,IAAyB;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,CAAC,IAAmC;QACzC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE/B,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7E,MAAM,kBAAkB,GAAG,IAAI,CAAC,yBAAyB,CACvD,kBAAkB,EAClB,IAAI,CAAC,EAAE,CACR,CAAC;QAEF,IAAI,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CACb,wBAAwB,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,EAAE,CACjE,CAAC;QACJ,CAAC;QAED,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAExC,MAAM,qBAAqB,GAAG,IAAI,CAAC,kBAAkB,CACnD,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,EAAE,CACR,CAAC;QACF,MAAM,eAAe,GAAG,IAAI,CAAC,yBAAyB,CACpD,qBAAqB,EACrB,IAAI,CAAC,IAAI,CACV,CAAC;QACF,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5D,KAAK,MAAM,aAAa,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5D,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,EAAU,EAAE,IAAc;QACjD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACxE,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClD,IAAI,cAAc,KAAK,SAAS,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACjE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9B,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpD,cAAc,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,cAAc,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,QAAQ;QACN,MAAM,MAAM,GAAoC,EAAE,CAAC;QAEnD,KAAK,MAAM,eAAe,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACrD,KAAK,MAAM,WAAW,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnD,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,gBAAgB,CAAC,EAAU;QACzB,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,gBAAgB,CAAC,EAAU;QACzB,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,IAAc;QAC9C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC;IAClF,CAAC;IAED,sEAAsE;IACtE,YAAY,CAAC,EAAU;QACrB,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,qDAAqD;IACrD,eAAe,CAAC,EAAU;QACxB,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,oDAAoD;IACpD,aAAa,CAAC,EAAU;QACtB,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,mDAAmD;IACnD,GAAG,CAAC,OAAe;QACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAa,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;YACnC,SAAS,IAAI,CAAC,CAAC;YAEf,0DAA0D;YAC1D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEtB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC;gBACvE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2DAA2D;IAC3D,GAAG,CAAC,OAAe;QACjB,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAE9B,IAAI,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACtD,SAAS;YACX,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEtB,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;YAErE,sEAAsE;YACtE,gEAAgE;YAChE,KAAK,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC9D,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;gBACpC,IAAI,UAAU,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBACzD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,QAAQ,CAAC,QAAgB,EAAE,QAAgB;QACzC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEhC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;YACnC,SAAS,IAAI,CAAC,CAAC;YAEf,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YAED,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC;gBACvE,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC5B,SAAS;gBACX,CAAC;gBAED,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;gBAElC,IAAI,UAAU,KAAK,QAAQ,EAAE,CAAC;oBAC5B,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAC1D,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,gBAAgB,CAAC,EAAU;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAEO,kBAAkB,CACxB,SAA0D,EAC1D,EAAU;QAEV,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,6CAA6C,EAAE,EAAE,CAAC,CAAC;QACrE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,yBAAyB,CAC/B,SAA6C,EAC7C,UAAkB;QAElB,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAE3C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2C,CAAC;QACnE,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACnC,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,cAAc,CACpB,SAA0D,EAC1D,EAAU;QAEV,OAAO,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACvD,CAAC;IAEO,WAAW,CAAC,GAAqB;QACvC,MAAM,MAAM,GAA0B,EAAE,CAAC;QAEzC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,6CAA6C,EAAE,EAAE,CAAC,CAAC;YACrE,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,eAAe,CACrB,MAA0C;QAE1C,MAAM,MAAM,GAAoC,EAAE,CAAC;QAEnD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,eAAe,CACrB,MAAmC,EACnC,QAAgB,EAChB,QAAgB;QAEhB,MAAM,YAAY,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,SAAS,GAAG,QAAQ,CAAC;QAEzB,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEvC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;YAC3E,CAAC;YAED,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5B,SAAS,GAAG,QAAQ,CAAC;QACvB,CAAC;QAED,OAAO,YAAY,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC;CACF"}

package/dist/graph/types.d.ts

@@ -0,0 +1,13 @@
+/** A vertex in the graph, identified independently of its payload. */
+export interface GraphNode<NodeData> {
+    readonly id: string;
+    readonly data: NodeData;
+}
+/** A directed, typed relationship from one node to another. */
+export interface GraphEdge<EdgeType extends string, EdgeData> {
+    readonly from: string;
+    readonly to: string;
+    readonly type: EdgeType;
+    readonly data?: EdgeData;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":"AAAA,sEAAsE;AACtE,MAAM,WAAW,SAAS,CAAC,QAAQ;IACjC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;CACzB;AAED,+DAA+D;AAC/D,MAAM,WAAW,SAAS,CAAC,QAAQ,SAAS,MAAM,EAAE,QAAQ;IAC1D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC;CAC1B"}

package/dist/graph/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":""}

package/dist/index.d.ts

@@ -0,0 +1,21 @@
+export { analyzeProject } from "./analyzer/analyzeProject.js";
+export type { AnalysisDiagnostic, AnalysisDiagnosticKind, ProjectAnalysis, } from "./analyzer/analyzeProject.js";
+export { defaultIndexPath, updateProjectAnalysis, updateProjectIndex, } from "./analyzer/incrementalIndex.js";
+export type { FileChanges, IncrementalUpdateResult, } from "./analyzer/incrementalIndex.js";
+export { buildDefinitionGraph, createFileNodeId, createSymbolNodeId, } from "./analyzer/buildDefinitionGraph.js";
+export type { BuildDefinitionGraphOptions, CallEdgeData, CodeGraph, CodeGraphEdgeData, CodeGraphEdgeType, CodeGraphNodeData, DefinesEdgeData, DefinitionGraph, FileNodeData, ImportEdgeData, ResolutionConfidence, SymbolNodeData, } from "./analyzer/buildDefinitionGraph.js";
+export { discoverSourceFiles } from "./files/discoverSourceFiles.js";
+export { analyzeDiffImpact, parseGitDiff, readGitDiff, } from "./git/diffImpact.js";
+export type { ChangedFileLines, DiffImpactResult, UnmappedChangedLine, } from "./git/diffImpact.js";
+export { DirectedGraph } from "./graph/DirectedGraph.js";
+export type { GraphEdge, GraphNode } from "./graph/types.js";
+export { extractDeclarations } from "./parser/extractDeclarations.js";
+export type { DeclarationKind, ExtractedDeclaration, SourceLocation, SourceRange, } from "./parser/extractDeclarations.js";
+export { parseSourceFile } from "./parser/parseSourceFile.js";
+export { CODEGRAPH_JSON_SCHEMA_VERSION, deserializeProjectAnalysis, loadProjectAnalysis, saveProjectAnalysis, serializeProjectAnalysis, } from "./persistence/jsonPersistence.js";
+export { analyzeImpact } from "./queries/analyzeImpact.js";
+export type { ImpactOptions, ImpactResult, } from "./queries/analyzeImpact.js";
+export { findCodePath, findSymbols, getCodeDependencies, getCodeDependents, } from "./queries/codeGraphQueries.js";
+export { createVisualizationDocument, startVisualizationServer, writeVisualizationDocument, } from "./visualization/viewer.js";
+export type { VisualizationServer, VisualizationServerOptions, } from "./visualization/viewer.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,YAAY,EACV,kBAAkB,EAClB,sBAAsB,EACtB,eAAe,GAChB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,gCAAgC,CAAC;AACxC,YAAY,EACV,WAAW,EACX,uBAAuB,GACxB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EACL,oBAAoB,EACpB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,oCAAoC,CAAC;AAC5C,YAAY,EACV,2BAA2B,EAC3B,YAAY,EACZ,SAAS,EACT,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,YAAY,EACZ,cAAc,EACd,oBAAoB,EACpB,cAAc,GACf,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,WAAW,GACZ,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,YAAY,EACV,eAAe,EACf,oBAAoB,EACpB,cAAc,EACd,WAAW,GACZ,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,mBAAmB,EACnB,mBAAmB,EACnB,wBAAwB,GACzB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,YAAY,EACV,aAAa,EACb,YAAY,GACb,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,YAAY,EACZ,WAAW,EACX,mBAAmB,EACnB,iBAAiB,GAClB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,2BAA2B,EAC3B,wBAAwB,EACxB,0BAA0B,GAC3B,MAAM,2BAA2B,CAAC;AACnC,YAAY,EACV,mBAAmB,EACnB,0BAA0B,GAC3B,MAAM,2BAA2B,CAAC"}

package/dist/index.js

@@ -0,0 +1,13 @@
+export { analyzeProject } from "./analyzer/analyzeProject.js";
+export { defaultIndexPath, updateProjectAnalysis, updateProjectIndex, } from "./analyzer/incrementalIndex.js";
+export { buildDefinitionGraph, createFileNodeId, createSymbolNodeId, } from "./analyzer/buildDefinitionGraph.js";
+export { discoverSourceFiles } from "./files/discoverSourceFiles.js";
+export { analyzeDiffImpact, parseGitDiff, readGitDiff, } from "./git/diffImpact.js";
+export { DirectedGraph } from "./graph/DirectedGraph.js";
+export { extractDeclarations } from "./parser/extractDeclarations.js";
+export { parseSourceFile } from "./parser/parseSourceFile.js";
+export { CODEGRAPH_JSON_SCHEMA_VERSION, deserializeProjectAnalysis, loadProjectAnalysis, saveProjectAnalysis, serializeProjectAnalysis, } from "./persistence/jsonPersistence.js";
+export { analyzeImpact } from "./queries/analyzeImpact.js";
+export { findCodePath, findSymbols, getCodeDependencies, getCodeDependents, } from "./queries/codeGraphQueries.js";
+export { createVisualizationDocument, startVisualizationServer, writeVisualizationDocument, } from "./visualization/viewer.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAM9D,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,gCAAgC,CAAC;AAKxC,OAAO,EACL,oBAAoB,EACpB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,oCAAoC,CAAC;AAe5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,WAAW,GACZ,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAEzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAOtE,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EACL,6BAA6B,EAC7B,0BAA0B,EAC1B,mBAAmB,EACnB,mBAAmB,EACnB,wBAAwB,GACzB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAK3D,OAAO,EACL,YAAY,EACZ,WAAW,EACX,mBAAmB,EACnB,iBAAiB,GAClB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,2BAA2B,EAC3B,wBAAwB,EACxB,0BAA0B,GAC3B,MAAM,2BAA2B,CAAC"}

package/dist/mcp/projectSession.d.ts

@@ -0,0 +1,18 @@
+import { type ProjectAnalysis } from "../analyzer/analyzeProject.js";
+import { type IncrementalUpdateResult } from "../analyzer/incrementalIndex.js";
+export type RefreshMode = "incremental" | "full";
+/** Maintains one project-scoped graph for the lifetime of an MCP connection. */
+export declare class CodeGraphProjectSession {
+    readonly rootDirectory: string;
+    readonly indexPath: string;
+    private currentAnalysis;
+    constructor(rootDirectory: string, indexPath?: string);
+    /**
+     * Builds a fresh in-memory snapshot on first use. The server deliberately
+     * avoids trusting a possibly stale persisted index without an explicit
+     * refresh request.
+     */
+    getAnalysis(): Promise<ProjectAnalysis>;
+    refresh(mode: RefreshMode): Promise<IncrementalUpdateResult>;
+}
+//# sourceMappingURL=projectSession.d.ts.map

package/dist/mcp/projectSession.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"projectSession.d.ts","sourceRoot":"","sources":["../../src/mcp/projectSession.ts"],"names":[],"mappings":"AAGA,OAAO,EAEL,KAAK,eAAe,EACrB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAGL,KAAK,uBAAuB,EAE7B,MAAM,iCAAiC,CAAC;AAMzC,MAAM,MAAM,WAAW,GAAG,aAAa,GAAG,MAAM,CAAC;AAEjD,gFAAgF;AAChF,qBAAa,uBAAuB;IAClC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,eAAe,CAA8B;gBAEzC,aAAa,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;IAOrD;;;;OAIG;IACG,WAAW,IAAI,OAAO,CAAC,eAAe,CAAC;IAOvC,OAAO,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAAC,uBAAuB,CAAC;CAoBnE"}

package/dist/mcp/projectSession.js

@@ -0,0 +1,86 @@
+import { access } from "node:fs/promises";
+import path from "node:path";
+import { analyzeProject, } from "../analyzer/analyzeProject.js";
+import { defaultIndexPath, updateProjectIndex, } from "../analyzer/incrementalIndex.js";
+import { loadProjectAnalysis, saveProjectAnalysis, } from "../persistence/jsonPersistence.js";
+/** Maintains one project-scoped graph for the lifetime of an MCP connection. */
+export class CodeGraphProjectSession {
+    rootDirectory;
+    indexPath;
+    currentAnalysis;
+    constructor(rootDirectory, indexPath) {
+        this.rootDirectory = path.resolve(rootDirectory);
+        this.indexPath = path.resolve(indexPath ?? defaultIndexPath(this.rootDirectory));
+    }
+    /**
+     * Builds a fresh in-memory snapshot on first use. The server deliberately
+     * avoids trusting a possibly stale persisted index without an explicit
+     * refresh request.
+     */
+    async getAnalysis() {
+        if (this.currentAnalysis === undefined) {
+            this.currentAnalysis = await analyzeProject(this.rootDirectory);
+        }
+        return this.currentAnalysis;
+    }
+    async refresh(mode) {
+        if (mode === "incremental" && await fileExists(this.indexPath)) {
+            const result = await updateProjectIndex(this.indexPath, this.rootDirectory);
+            this.currentAnalysis = result.analysis;
+            return result;
+        }
+        const previous = this.currentAnalysis ?? await loadIfPresent(this.indexPath);
+        const analysis = await analyzeProject(this.rootDirectory);
+        await saveProjectAnalysis(analysis, this.indexPath);
+        this.currentAnalysis = analysis;
+        return {
+            analysis,
+            files: compareFileHashes(previous?.fileHashes ?? {}, analysis.fileHashes),
+        };
+    }
+}
+async function loadIfPresent(indexPath) {
+    if (!await fileExists(indexPath)) {
+        return undefined;
+    }
+    return loadProjectAnalysis(indexPath);
+}
+async function fileExists(filePath) {
+    try {
+        await access(filePath);
+        return true;
+    }
+    catch (error) {
+        if (error instanceof Error &&
+            "code" in error &&
+            error.code === "ENOENT") {
+            return false;
+        }
+        throw error;
+    }
+}
+function compareFileHashes(previous, current) {
+    const previousPaths = new Set(Object.keys(previous));
+    const currentPaths = new Set(Object.keys(current));
+    const added = [...currentPaths]
+        .filter((filePath) => !previousPaths.has(filePath))
+        .sort();
+    const changed = [...currentPaths]
+        .filter((filePath) => previousPaths.has(filePath) &&
+        previous[filePath] !== current[filePath])
+        .sort();
+    const deleted = [...previousPaths]
+        .filter((filePath) => !currentPaths.has(filePath))
+        .sort();
+    const affected = [...new Set([...added, ...changed, ...deleted])].sort();
+    return {
+        added,
+        changed,
+        deleted,
+        affected,
+        reused: [...currentPaths]
+            .filter((filePath) => !affected.includes(filePath))
+            .sort(),
+    };
+}
+//# sourceMappingURL=projectSession.js.map

package/dist/mcp/projectSession.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"projectSession.js","sourceRoot":"","sources":["../../src/mcp/projectSession.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B,OAAO,EACL,cAAc,GAEf,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACL,gBAAgB,EAGhB,kBAAkB,GACnB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EACL,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,mCAAmC,CAAC;AAI3C,gFAAgF;AAChF,MAAM,OAAO,uBAAuB;IACzB,aAAa,CAAS;IACtB,SAAS,CAAS;IACnB,eAAe,CAA8B;IAErD,YAAY,aAAqB,EAAE,SAAkB;QACnD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAC3B,SAAS,IAAI,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC,CAClD,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,WAAW;QACf,IAAI,IAAI,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,eAAe,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,IAAiB;QAC7B,IAAI,IAAI,KAAK,aAAa,IAAI,MAAM,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/D,MAAM,MAAM,GAAG,MAAM,kBAAkB,CACrC,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,aAAa,CACnB,CAAC;YACF,IAAI,CAAC,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC;YACvC,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,IAAI,MAAM,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7E,MAAM,QAAQ,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1D,MAAM,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,GAAG,QAAQ,CAAC;QAEhC,OAAO;YACL,QAAQ;YACR,KAAK,EAAE,iBAAiB,CAAC,QAAQ,EAAE,UAAU,IAAI,EAAE,EAAE,QAAQ,CAAC,UAAU,CAAC;SAC1E,CAAC;IACJ,CAAC;CACF;AAED,KAAK,UAAU,aAAa,CAC1B,SAAiB;IAEjB,IAAI,CAAC,MAAM,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,mBAAmB,CAAC,SAAS,CAAC,CAAC;AACxC,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,QAAgB;IACxC,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,KAAc,EAAE,CAAC;QACxB,IACE,KAAK,YAAY,KAAK;YACtB,MAAM,IAAI,KAAK;YACf,KAAK,CAAC,IAAI,KAAK,QAAQ,EACvB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CACxB,QAA0C,EAC1C,OAAyC;IAEzC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC;SAC5B,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;SAClD,IAAI,EAAE,CAAC;IACV,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC;SAC9B,MAAM,CACL,CAAC,QAAQ,EAAE,EAAE,CACX,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC3B,QAAQ,CAAC,QAAQ,CAAC,KAAK,OAAO,CAAC,QAAQ,CAAC,CAC3C;SACA,IAAI,EAAE,CAAC;IACV,MAAM,OAAO,GAAG,CAAC,GAAG,aAAa,CAAC;SAC/B,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;SACjD,IAAI,EAAE,CAAC;IACV,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAEzE,OAAO;QACL,KAAK;QACL,OAAO;QACP,OAAO;QACP,QAAQ;QACR,MAAM,EAAE,CAAC,GAAG,YAAY,CAAC;aACtB,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;aAClD,IAAI,EAAE;KACV,CAAC;AACJ,CAAC"}

package/dist/mcp/server.d.ts

@@ -0,0 +1,23 @@
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import type { DeclarationKind } from "../parser/extractDeclarations.js";
+export interface CodeGraphMcpServerOptions {
+    readonly rootDirectory?: string;
+    readonly indexPath?: string;
+}
+export interface EntitySummary {
+    readonly id: string;
+    readonly type: "file" | "symbol";
+    readonly name: string | null;
+    readonly qualifiedName: string | null;
+    readonly declarationKind: DeclarationKind | null;
+    readonly source: {
+        readonly path: string;
+        readonly startLine: number | null;
+        readonly startColumn: number | null;
+        readonly endLine: number | null;
+        readonly endColumn: number | null;
+    };
+}
+/** Creates one project-scoped MCP server. Callers choose the transport. */
+export declare function createCodeGraphMcpServer(options?: CodeGraphMcpServerOptions): McpServer;
+//# sourceMappingURL=server.d.ts.map

package/dist/mcp/server.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../../src/mcp/server.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAWpE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AA0FxE,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAAC;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,eAAe,EAAE,eAAe,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,MAAM,EAAE;QACf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QAClC,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;QACpC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAChC,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;KACnC,CAAC;CACH;AAqBD,2EAA2E;AAC3E,wBAAgB,wBAAwB,CACtC,OAAO,GAAE,yBAA8B,GACtC,SAAS,CAqUX"}