devlensio 0.3.0 → 0.4.1

package/dist/clustering/index.js

@@ -42,7 +42,6 @@ export function computeClusters(allNodes, allEdges, nodeScores) {
                 queue.push({ nodeId: id, clusterId, rank: 0 });
             }
         }
-        console.log(clusterId, rootId);
     };
     // 3. PHASE 1: Seed Entry Points (Structural Entry)
     allNodes

package/dist/graph/traversal.d.ts

@@ -0,0 +1,38 @@
+import type { CycleGroup } from "../summarizer/types.js";
+import { CodeEdge, CodeNode, EdgeType } from "../types.js";
+export interface GraphIndex {
+    nodesById: Map<string, CodeNode>;
+    forward: Map<string, CodeEdge[]>;
+    reverse: Map<string, CodeEdge[]>;
+    nodesByFilePath: Map<string, string[]>;
+}
+export declare function buildGraphIndex(nodes: CodeNode[], edges: CodeEdge[]): GraphIndex;
+export interface TraversalHit {
+    nodeId: string;
+    hop: number;
+    viaEdge: EdgeType;
+}
+export interface TraversalResult {
+    seedId: string;
+    direction: "upstream" | "downstream";
+    hits: TraversalHit[];
+    truncated: boolean;
+    stoppedAtRadius: number;
+    hop1Count: number;
+    radiusUsed: number;
+    radiusWasExplicit: boolean;
+}
+export interface TraversalOpts {
+    radius?: number;
+    edgeTypes?: EdgeType[];
+}
+export declare function getBlastRadius(index: GraphIndex, seedId: string, opts?: TraversalOpts): TraversalResult;
+export declare function getKHop(index: GraphIndex, seedId: string, opts?: TraversalOpts): TraversalResult;
+export interface SubgraphResult {
+    seedNodeId: string;
+    clusterId: string;
+    nodes: CodeNode[];
+    edges: CodeEdge[];
+}
+export declare function getSubgraph(allNodes: CodeNode[], allEdges: CodeEdge[], nodeScores: Record<string, number>, seedNodeId: string): SubgraphResult | undefined;
+export declare function findCycles(nodes: CodeNode[], edges: CodeEdge[]): CycleGroup[];

package/dist/graph/traversal.js

@@ -0,0 +1,99 @@
+import { computeClusters } from "../clustering/index.js";
+import { buildTopologicalOrder } from "../summarizer/topological.js";
+export function buildGraphIndex(nodes, edges) {
+    const nodesById = new Map();
+    const forward = new Map();
+    const reverse = new Map();
+    const nodesByFilePath = new Map();
+    for (const node of nodes) {
+        nodesById.set(node.id, node);
+        const fp = node.filePath || "external";
+        if (!nodesByFilePath.has(fp))
+            nodesByFilePath.set(fp, []);
+        nodesByFilePath.get(fp).push(node.id);
+    }
+    for (const edge of edges) {
+        if (!forward.has(edge.from))
+            forward.set(edge.from, []);
+        forward.get(edge.from).push(edge);
+        if (!reverse.has(edge.to))
+            reverse.set(edge.to, []);
+        reverse.get(edge.to).push(edge);
+    }
+    return { nodesById, forward, reverse, nodesByFilePath };
+}
+const DEFAULT_RADIUS = 2;
+const HOP1_CAP = 100;
+function bfsTraverse(index, seedId, direction, opts = {}) {
+    const explicit = opts.radius !== undefined;
+    const maxRadius = opts.radius ?? DEFAULT_RADIUS;
+    const edgeFilter = opts.edgeTypes ? new Set(opts.edgeTypes) : null;
+    // downstream (callees) walks forward edges; upstream (callers) walks reverse
+    const adj = direction === "downstream" ? index.forward : index.reverse;
+    const visited = new Set([seedId]); // seed excluded from results
+    const hits = [];
+    let queue = [seedId];
+    let hop1Count = 0;
+    let truncated = false;
+    let stoppedAtRadius = 0;
+    for (let hop = 1; hop <= maxRadius; hop++) {
+        const nextqueue = [];
+        for (const nodeId of queue) {
+            for (const edge of adj.get(nodeId) ?? []) {
+                if (edgeFilter && !edgeFilter.has(edge.type))
+                    continue;
+                const neighborId = direction === "downstream" ? edge.to : edge.from;
+                if (visited.has(neighborId))
+                    continue;
+                visited.add(neighborId);
+                hits.push({ nodeId: neighborId, hop, viaEdge: edge.type });
+                nextqueue.push(neighborId);
+            }
+        }
+        if (hop === 1) {
+            hop1Count = nextqueue.length;
+            // Cap applies ONLY on the default (non-explicit) path:
+            // huge fanout → return hop-1 hits, skip deeper hops, flag truncated.
+            if (!explicit && hop1Count >= HOP1_CAP) {
+                truncated = true;
+                stoppedAtRadius = 1;
+                break;
+            }
+        }
+        stoppedAtRadius = hop;
+        queue = nextqueue;
+        if (queue.length === 0)
+            break; // nothing more to expand
+    }
+    return {
+        seedId, direction, hits, truncated, stoppedAtRadius, hop1Count,
+        radiusUsed: maxRadius, radiusWasExplicit: explicit,
+    };
+}
+// Upstream / dependents — "if I change this node, what is affected"
+export function getBlastRadius(index, seedId, opts) {
+    return bfsTraverse(index, seedId, "upstream", opts);
+}
+// Downstream / dependencies — "what this node calls/uses"
+export function getKHop(index, seedId, opts) {
+    return bfsTraverse(index, seedId, "downstream", opts);
+}
+export function getSubgraph(allNodes, allEdges, nodeScores, seedNodeId) {
+    const { clusterMembership } = computeClusters(allNodes, allEdges, nodeScores);
+    const clusterId = clusterMembership[seedNodeId];
+    if (!clusterId)
+        return undefined; // seed not found / not clustered
+    const memberIds = new Set();
+    for (const [nodeId, cId] of Object.entries(clusterMembership)) {
+        if (cId === clusterId)
+            memberIds.add(nodeId);
+    }
+    const nodes = allNodes.filter(n => memberIds.has(n.id));
+    const edges = allEdges.filter(e => memberIds.has(e.from) && memberIds.has(e.to));
+    return { seedNodeId, clusterId, nodes, edges };
+}
+// Cyclic dependency groups — reuses the connected-component detection that
+// already runs inside the topological sort (src/summarizer/topological.ts).
+export function findCycles(nodes, edges) {
+    return buildTopologicalOrder(nodes, edges).cycleGroups;
+}

package/dist/index.d.ts

@@ -16,3 +16,5 @@ export { runSummarization } from "./summarizer/index.js";
 export { computeClusters } from "./clustering/index.js";
 export { EDGE_LABELS } from "./summarizer/prompts.js";
 export { CycleGroup, TopologicalResult } from "./summarizer/types.js";
+export { buildGraphIndex, getBlastRadius, getKHop, getSubgraph, findCycles, } from "./graph/traversal.js";
+export type { GraphIndex, TraversalHit, TraversalResult, TraversalOpts, SubgraphResult, } from "./graph/traversal.js";

package/dist/index.js

@@ -19,3 +19,5 @@ export { analyzePipeline } from "./pipeline/index.js";
 export { runSummarization } from "./summarizer/index.js";
 export { computeClusters } from "./clustering/index.js";
 export { EDGE_LABELS } from "./summarizer/prompts.js";
+// Graph traversal & queries (consumed by the MCP server)
+export { buildGraphIndex, getBlastRadius, getKHop, getSubgraph, findCycles, } from "./graph/traversal.js";

package/package.json

@@ -1,48 +1,48 @@
-{
-  "name": "devlensio",
-  "version": "0.3.0",
-  "description": "Codebase intelligence engine for TypeScript/JavaScript/Reactjs/Nextjs repositories.",
-  "type": "module",
-  "main": "./dist/index.js",
-  "module": "./dist/index.js",
-  "types": "./dist/index.d.ts",
-  "exports": {
-    ".": {
-      "import": "./dist/index.js",
-      "types": "./dist/index.d.ts"
-    }
-  },
-  "scripts": {
-    "dev": "bun --watch src/server/index.ts",
-    "start": "bun src/server/index.ts",
-    "build": "tsc --project tsconfig.build.json",
-    "test": "bun test",
-    "export-graph": "bun src/debug/exportGraph.ts"
-  },
-  "keywords": ["codebase", "graph", "ast", "typescript", "javascript", "devtools"],
-  "author": "",
-  "license": "AGPL-3.0",
-  "files": [
-    "dist/**/*"
-  ],
-  "dependencies": {
-    "@anthropic-ai/sdk": "^0.104.2",
-    "@google/genai": "^2.8.0",
-    "dotenv": "^17.4.2",
-    "openai": "^6.42.0",
-    "simple-git": "^3.36.0",
-    "ts-morph": "^28.0.0",
-    "uuid": "^11.0.0"
-  },
-  "devDependencies": {
-    "@types/bun": "^1.3.9",
-    "@types/jest": "^30.0.0",
-    "@types/node": "^25.3.0",
-    "@types/uuid": "^11.0.0",
-    "jest": "^30.2.0",
-    "ts-jest": "^29.4.6",
-    "ts-node": "^10.9.2",
-    "ts-node-dev": "^2.0.0",
-    "typescript": "^5.9.3"
-  }
+{
+  "name": "devlensio",
+  "version": "0.4.1",
+  "description": "Codebase intelligence engine for TypeScript/JavaScript/Reactjs/Nextjs repositories.",
+  "type": "module",
+  "main": "./dist/index.js",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "scripts": {
+    "dev": "bun --watch src/server/index.ts",
+    "start": "bun src/server/index.ts",
+    "build": "tsc --project tsconfig.build.json",
+    "test": "bun test",
+    "export-graph": "bun src/debug/exportGraph.ts"
+  },
+  "keywords": ["codebase", "graph", "ast", "typescript", "javascript", "devtools"],
+  "author": "",
+  "license": "AGPL-3.0",
+  "files": [
+    "dist/**/*"
+  ],
+  "dependencies": {
+    "@anthropic-ai/sdk": "^0.104.2",
+    "@google/genai": "^2.8.0",
+    "dotenv": "^17.4.2",
+    "openai": "^6.42.0",
+    "simple-git": "^3.36.0",
+    "ts-morph": "^28.0.0",
+    "uuid": "^11.0.0"
+  },
+  "devDependencies": {
+    "@types/bun": "^1.3.9",
+    "@types/jest": "^30.0.0",
+    "@types/node": "^25.3.0",
+    "@types/uuid": "^11.0.0",
+    "jest": "^30.2.0",
+    "ts-jest": "^29.4.6",
+    "ts-node": "^10.9.2",
+    "ts-node-dev": "^2.0.0",
+    "typescript": "^5.9.3"
+  }
 }