@exero1/claudecontext 0.1.0

package/dist/src/gating/gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate.js","sourceRoot":"","sources":["../../../src/gating/gate.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAgBH;;;;;;;;GAQG;AACH,MAAM,aAAa,GAAe;IAChC,2DAA2D;IAC3D,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,mCAAmC,EAAE;IACzF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,mDAAmD,EAAE;IACzG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,0CAA0C,EAAE;IAC9F,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,sCAAsC,EAAE;IACvF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,sBAAsB,EAAE,MAAM,EAAE,yBAAyB,EAAE;IACtF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,+BAA+B,EAAE;IAC9E,gFAAgF;IAChF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,qCAAqC,EAAE,MAAM,EAAE,4BAA4B,EAAE;IAExG,yDAAyD;IACzD,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,kDAAkD,EAAE;IACnG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,sBAAsB,EAAE,MAAM,EAAE,6CAA6C,EAAE;IAC1G,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,yCAAyC,EAAE;IACxG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,yBAAyB,EAAE;IAC/E,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAE,4BAA4B,EAAE;IACrF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,EAAE,uBAAuB,EAAE;IACjF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,wCAAwC,EAAE;IAC5F,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,8BAA8B,EAAE;IAChF,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,EAAE,uDAAuD,EAAE;IAC/G,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,6DAA6D,EAAE;IAEnH,wBAAwB;IACxB,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,uBAAuB,EAAE;CACpE,CAAC;AAEF,IAAI,KAAK,GAAe,CAAC,GAAG,aAAa,CAAC,CAAC;AAE3C;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,QAAoB;IAC3C,KAAK,GAAG,QAAQ,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAoB;IAC/C,KAAK,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QACrE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAkE;IACpG,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,EAAE,CAAC,CAAC,MAAoB;QAC9B,OAAO,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;QAC9B,MAAM,EAAE,CAAC,CAAC,MAAM;KACjB,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/src/graph/edges.d.ts

@@ -0,0 +1,41 @@
+import type { Db, Edge, EdgeType, NodeType } from '../storage/db.js';
+/**
+ * Edge weight decay formula — half-life ~70 days.
+ * Applied lazily on next write, never on read.
+ */
+export declare function decayWeight(weight: number, lastReinforced: number, now?: number): number;
+export interface EdgeCreateOptions {
+    fromNode: string;
+    fromType: NodeType;
+    toNode: string;
+    toType: NodeType;
+    edgeType: EdgeType;
+    weight?: number;
+}
+/**
+ * Create or reinforce an edge.
+ * If the edge already exists: apply lazy decay first, then reinforce (+0.1, capped at 1.0).
+ * If new: insert with weight 1.0.
+ */
+export declare function upsertEdge(db: Db, opts: EdgeCreateOptions): void;
+/**
+ * Create a bidirectional edge pair (e.g. co_modified).
+ */
+export declare function upsertBidirectionalEdge(db: Db, opts: EdgeCreateOptions): void;
+/**
+ * Apply lazy weight decay to ALL edges in the database.
+ * Called during pre-compact sweep (not during reads).
+ */
+export declare function applyDecayToAll(db: Db): {
+    updated: number;
+    pruned: number;
+};
+/**
+ * Get all direct neighbors of a node, filtered by edge type.
+ */
+export declare function getNeighbors(db: Db, node: string, edgeTypes?: EdgeType[], limit?: number): Edge[];
+/**
+ * Get all neighbors of multiple nodes (for 1-hop bundle expansion).
+ */
+export declare function getNeighborsForNodes(db: Db, nodes: string[], edgeTypes?: EdgeType[], limitPerNode?: number): Map<string, Edge[]>;
+//# sourceMappingURL=edges.d.ts.map

package/dist/src/graph/edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edges.d.ts","sourceRoot":"","sources":["../../../src/graph/edges.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAErE;;;GAGG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,SAAa,GAAG,MAAM,CAG5F;AAOD,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,QAAQ,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,iBAAiB,GAAG,IAAI,CAmChE;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,iBAAiB,GAAG,IAAI,CAS7E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CA4B3E;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,EAAE,EACN,IAAI,EAAE,MAAM,EACZ,SAAS,CAAC,EAAE,QAAQ,EAAE,EACtB,KAAK,SAAK,GACT,IAAI,EAAE,CAMR;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,EAAE,EAAE,EAAE,EACN,KAAK,EAAE,MAAM,EAAE,EACf,SAAS,CAAC,EAAE,QAAQ,EAAE,EACtB,YAAY,SAAK,GAChB,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAMrB"}

package/dist/src/graph/edges.js

@@ -0,0 +1,115 @@
+/**
+ * Edge weight decay formula — half-life ~70 days.
+ * Applied lazily on next write, never on read.
+ */
+export function decayWeight(weight, lastReinforced, now = Date.now()) {
+    const daysSince = (now - lastReinforced) / (24 * 60 * 60 * 1000);
+    return weight * Math.exp(-0.01 * daysSince);
+}
+// Use \x01 (SOH) delimiter — safe in node:sqlite, cannot appear in file paths or edge type names
+function edgeId(fromNode, toNode, edgeType) {
+    return `${edgeType}\x01${fromNode}\x01${toNode}`;
+}
+/**
+ * Create or reinforce an edge.
+ * If the edge already exists: apply lazy decay first, then reinforce (+0.1, capped at 1.0).
+ * If new: insert with weight 1.0.
+ */
+export function upsertEdge(db, opts) {
+    const id = edgeId(opts.fromNode, opts.toNode, opts.edgeType);
+    const now = Date.now();
+    const existing = db.getEdge(id);
+    if (existing) {
+        // Apply lazy decay then reinforce
+        const decayed = decayWeight(existing.weight, existing.last_reinforced, now);
+        const newWeight = Math.min(1.0, decayed + 0.1);
+        const newCount = existing.co_occurrence_count + 1;
+        const newConfidence = Math.min(1.0, newCount / (newCount + 2)); // Bayesian-style confidence
+        db.upsertEdge({
+            ...existing,
+            weight: newWeight,
+            last_reinforced: now,
+            session_count: existing.session_count + 1,
+            co_occurrence_count: newCount,
+            confidence: newConfidence,
+        });
+    }
+    else {
+        db.upsertEdge({
+            id,
+            from_node: opts.fromNode,
+            from_type: opts.fromType,
+            to_node: opts.toNode,
+            to_type: opts.toType,
+            edge_type: opts.edgeType,
+            weight: opts.weight ?? 1.0,
+            created_at: now,
+            last_reinforced: now,
+            session_count: 1,
+            co_occurrence_count: 1,
+            confidence: 1.0,
+        });
+    }
+}
+/**
+ * Create a bidirectional edge pair (e.g. co_modified).
+ */
+export function upsertBidirectionalEdge(db, opts) {
+    upsertEdge(db, opts);
+    upsertEdge(db, {
+        ...opts,
+        fromNode: opts.toNode,
+        fromType: opts.toType,
+        toNode: opts.fromNode,
+        toType: opts.fromType,
+    });
+}
+/**
+ * Apply lazy weight decay to ALL edges in the database.
+ * Called during pre-compact sweep (not during reads).
+ */
+export function applyDecayToAll(db) {
+    const now = Date.now();
+    const all = db.getAllEdgesForDecay();
+    const updates = [];
+    for (const edge of all) {
+        const newWeight = decayWeight(edge.weight, edge.last_reinforced, now);
+        if (newWeight !== edge.weight) {
+            updates.push({ id: edge.id, weight: newWeight, last_reinforced: edge.last_reinforced });
+        }
+    }
+    if (updates.length > 0) {
+        // Apply decayed weights first, preserving original last_reinforced so pruning
+        // can correctly check edge age in the same pass.
+        db.bulkUpdateEdgeWeights(updates);
+    }
+    // Prune BEFORE resetting last_reinforced so the age check uses original timestamps.
+    const pruned = db.pruneWeakEdges(0.1, 90);
+    if (updates.length > 0) {
+        // Now reset last_reinforced to now to prevent double-applying decay on next sweep.
+        const withNow = updates.map(u => ({ ...u, last_reinforced: now }));
+        db.bulkUpdateEdgeWeights(withNow);
+    }
+    return { updated: updates.length, pruned };
+}
+/**
+ * Get all direct neighbors of a node, filtered by edge type.
+ */
+export function getNeighbors(db, node, edgeTypes, limit = 20) {
+    const edges = db.getEdgesFrom(node, limit * 2);
+    const filtered = edgeTypes
+        ? edges.filter(e => edgeTypes.includes(e.edge_type))
+        : edges;
+    return filtered.slice(0, limit);
+}
+/**
+ * Get all neighbors of multiple nodes (for 1-hop bundle expansion).
+ */
+export function getNeighborsForNodes(db, nodes, edgeTypes, limitPerNode = 10) {
+    const result = new Map();
+    for (const node of nodes) {
+        result.set(node, getNeighbors(db, node, edgeTypes, limitPerNode));
+    }
+    return result;
+}
+//# sourceMappingURL=edges.js.map

package/dist/src/graph/edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edges.js","sourceRoot":"","sources":["../../../src/graph/edges.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,cAAsB,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;IAClF,MAAM,SAAS,GAAG,CAAC,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;IACjE,OAAO,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC;AAC9C,CAAC;AAED,iGAAiG;AACjG,SAAS,MAAM,CAAC,QAAgB,EAAE,MAAc,EAAE,QAAkB;IAClE,OAAO,GAAG,QAAQ,OAAO,QAAQ,OAAO,MAAM,EAAE,CAAC;AACnD,CAAC;AAWD;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,EAAM,EAAE,IAAuB;IACxD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAEhC,IAAI,QAAQ,EAAE,CAAC;QACb,kCAAkC;QAClC,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,QAAQ,CAAC,mBAAmB,GAAG,CAAC,CAAC;QAClD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B;QAC5F,EAAE,CAAC,UAAU,CAAC;YACZ,GAAG,QAAQ;YACX,MAAM,EAAE,SAAS;YACjB,eAAe,EAAE,GAAG;YACpB,aAAa,EAAE,QAAQ,CAAC,aAAa,GAAG,CAAC;YACzC,mBAAmB,EAAE,QAAQ;YAC7B,UAAU,EAAE,aAAa;SAC1B,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,EAAE,CAAC,UAAU,CAAC;YACZ,EAAE;YACF,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,OAAO,EAAE,IAAI,CAAC,MAAM;YACpB,OAAO,EAAE,IAAI,CAAC,MAAM;YACpB,SAAS,EAAE,IAAI,CAAC,QAAQ;YACxB,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;YAC1B,UAAU,EAAE,GAAG;YACf,eAAe,EAAE,GAAG;YACpB,aAAa,EAAE,CAAC;YAChB,mBAAmB,EAAE,CAAC;YACtB,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,EAAM,EAAE,IAAuB;IACrE,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACrB,UAAU,CAAC,EAAE,EAAE;QACb,GAAG,IAAI;QACP,QAAQ,EAAE,IAAI,CAAC,MAAM;QACrB,QAAQ,EAAE,IAAI,CAAC,MAAM;QACrB,MAAM,EAAE,IAAI,CAAC,QAAQ;QACrB,MAAM,EAAE,IAAI,CAAC,QAAQ;KACtB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,EAAM;IACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,GAAG,GAAG,EAAE,CAAC,mBAAmB,EAAE,CAAC;IACrC,MAAM,OAAO,GAAmE,EAAE,CAAC;IAEnF,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QACtE,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,8EAA8E;QAC9E,iDAAiD;QACjD,EAAE,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,oFAAoF;IACpF,MAAM,MAAM,GAAG,EAAE,CAAC,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAE1C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,mFAAmF;QACnF,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACnE,EAAE,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAC1B,EAAM,EACN,IAAY,EACZ,SAAsB,EACtB,KAAK,GAAG,EAAE;IAEV,MAAM,KAAK,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,SAAS;QACxB,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAqB,CAAC,CAAC;QAChE,CAAC,CAAC,KAAK,CAAC;IACV,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,EAAM,EACN,KAAe,EACf,SAAsB,EACtB,YAAY,GAAG,EAAE;IAEjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/graph/indexer.d.ts

@@ -0,0 +1,38 @@
+import type { Db } from '../storage/db.js';
+export interface AreaDef {
+    name: string;
+    globs: string[];
+    docPath: string;
+}
+/**
+ * Extract import paths from JS/TS source using acorn.
+ * Falls back to regex if acorn parse fails (e.g., JSX, complex TS generics).
+ */
+export declare function extractImports(source: string): string[];
+/**
+ * Resolve a relative import path to an absolute file path.
+ * Handles .js extension aliasing TypeScript files.
+ * Returns null if the import is a bare specifier (npm package).
+ */
+export declare function resolveImport(importPath: string, sourceFile: string, projectRoot: string): string | null;
+/**
+ * Index a single file: create import edges for all its imports.
+ */
+export declare function indexFileImports(db: Db, filePath: string, projectRoot: string): void;
+/**
+ * Index a file's subsystem membership: create subsystem_of edges.
+ * filePath may be relative (relative to projectRoot) or absolute.
+ * Glob matching uses the relative path; fromNode is always stored as absolute.
+ */
+export declare function indexFileSubsystem(db: Db, filePath: string, areas: AreaDef[], projectRoot: string): void;
+/**
+ * Walk a directory and collect all JS/TS source files.
+ */
+export declare function collectSourceFiles(dir: string, projectRoot: string, maxDepth?: number, depth?: number): string[];
+/**
+ * Full project index: scan all source files, create imports + subsystem_of edges.
+ */
+export declare function indexProject(db: Db, projectRoot: string, areas: AreaDef[]): {
+    indexed: number;
+};
+//# sourceMappingURL=indexer.d.ts.map

package/dist/src/graph/indexer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.d.ts","sourceRoot":"","sources":["../../../src/graph/indexer.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAC;AAI3C,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAqCvD;AAiDD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CA4BxG;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CA2BpF;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAgBxG;AAOD;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,SAAI,EAAE,KAAK,SAAI,GAAG,MAAM,EAAE,CAgCtG;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,CAO/F"}

package/dist/src/graph/indexer.js

@@ -0,0 +1,228 @@
+import { parse as acornParse } from 'acorn';
+import { simple as acornWalk } from 'acorn-walk';
+import { existsSync, readdirSync, readFileSync, statSync } from 'node:fs';
+import { join, resolve, relative, extname, dirname } from 'node:path';
+import { upsertEdge } from './edges.js';
+import { matchGlob } from '../utils/glob.js';
+/**
+ * Extract import paths from JS/TS source using acorn.
+ * Falls back to regex if acorn parse fails (e.g., JSX, complex TS generics).
+ */
+export function extractImports(source) {
+    const imports = [];
+    // Try acorn parse (strip TS type annotations first with regex to improve parse rate)
+    const stripped = stripTypeAnnotations(source);
+    try {
+        const ast = acornParse(stripped, {
+            ecmaVersion: 'latest',
+            sourceType: 'module',
+        });
+        acornWalk(ast, {
+            ImportDeclaration(node) {
+                const n = node;
+                if (typeof n.source?.value === 'string')
+                    imports.push(n.source.value);
+            },
+            ExportNamedDeclaration(node) {
+                const n = node;
+                if (n.source && typeof n.source.value === 'string')
+                    imports.push(n.source.value);
+            },
+            ExportAllDeclaration(node) {
+                const n = node;
+                if (typeof n.source?.value === 'string')
+                    imports.push(n.source.value);
+            },
+        });
+    }
+    catch {
+        // Acorn failed — regex will handle it below
+    }
+    // Always run regex to catch require() and dynamic imports acorn misses in CommonJS files
+    for (const i of extractImportsRegex(source)) {
+        if (!imports.includes(i))
+            imports.push(i);
+    }
+    return imports;
+}
+function stripTypeAnnotations(source) {
+    // Strip TypeScript-specific syntax that acorn can't parse.
+    // IMPORTANT: Preserve string literals first (e.g. 'node:fs') so the colon-strip
+    // regex doesn't corrupt protocol-style import specifiers.
+    const stringLiterals = [];
+    const withPlaceholders = source.replace(/(["'])(?:[^\\]|\\.)*?\1/g, (match) => {
+        const idx = stringLiterals.length;
+        stringLiterals.push(match);
+        return `"__CC_STR_${idx}__"`;
+    });
+    const stripped = withPlaceholders
+        // Remove type/interface declarations
+        .replace(/^\s*(export\s+)?(declare\s+)?(type|interface)\s+\w[^{=;]*(=|{)[^;]*;?\s*$/gm, '')
+        // Remove generic type params (both upper and lowercase: <T>, <string>, <MyType>)
+        .replace(/<[A-Za-z_$][A-Za-z0-9,\s<>[\]|&?]*>/g, '')
+        // Remove type annotations after colon (handles primitives: string, number, boolean, any, etc.)
+        .replace(/:\s*[A-Za-z_$][A-Za-z0-9<>[\]|&?,\s]*/g, '')
+        // Remove 'as TypeName' casts
+        .replace(/\bas\s+[A-Za-z_$][A-Za-z0-9<>[\]|&?,\s]*/g, '');
+    // Restore string literals
+    return stripped.replace(/"__CC_STR_(\d+)__"/g, (_, idx) => {
+        return stringLiterals[parseInt(idx, 10)] ?? '""';
+    });
+}
+function extractImportsRegex(source) {
+    const imports = [];
+    // Match: import ... from '...' or require('...')
+    const staticImport = /import\s+(?:[^'"]+\s+from\s+)?['"]([^'"]+)['"]/g;
+    const dynamicImport = /import\(['"]([^'"]+)['"]\)/g;
+    const requireCall = /require\(['"]([^'"]+)['"]\)/g;
+    let m;
+    while ((m = staticImport.exec(source)) !== null) {
+        if (m[1])
+            imports.push(m[1]);
+    }
+    while ((m = dynamicImport.exec(source)) !== null) {
+        if (m[1])
+            imports.push(m[1]);
+    }
+    while ((m = requireCall.exec(source)) !== null) {
+        if (m[1])
+            imports.push(m[1]);
+    }
+    return imports;
+}
+/**
+ * Resolve a relative import path to an absolute file path.
+ * Handles .js extension aliasing TypeScript files.
+ * Returns null if the import is a bare specifier (npm package).
+ */
+export function resolveImport(importPath, sourceFile, projectRoot) {
+    // Bare specifier = npm package, skip
+    if (!importPath.startsWith('.') && !importPath.startsWith('/'))
+        return null;
+    const sourceDir = dirname(sourceFile);
+    const resolved = resolve(sourceDir, importPath);
+    // Strip .js extension to get the base path (TS files are imported as .js in ESM)
+    const base = resolved.replace(/\.js$/, '');
+    // Try extensions in priority order
+    const candidates = [
+        base + '.ts',
+        base + '.tsx',
+        base + '.js',
+        base + '.jsx',
+        base + '/index.ts',
+        base + '/index.js',
+        resolved, // exact match as-is (e.g. already .ts, or extensionless)
+    ];
+    for (const candidate of candidates) {
+        if (existsSync(candidate)) {
+            return relative(projectRoot, candidate);
+        }
+    }
+    return null;
+}
+/**
+ * Index a single file: create import edges for all its imports.
+ */
+export function indexFileImports(db, filePath, projectRoot) {
+    const absolutePath = resolve(projectRoot, filePath);
+    if (!existsSync(absolutePath))
+        return;
+    const ext = extname(absolutePath);
+    if (!['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'].includes(ext))
+        return;
+    let source;
+    try {
+        source = readFileSync(absolutePath, 'utf8');
+    }
+    catch {
+        return;
+    }
+    const importPaths = extractImports(source);
+    for (const importPath of importPaths) {
+        const resolvedRelative = resolveImport(importPath, absolutePath, projectRoot);
+        if (resolvedRelative) {
+            upsertEdge(db, {
+                fromNode: absolutePath,
+                fromType: 'file',
+                toNode: resolve(projectRoot, resolvedRelative),
+                toType: 'file',
+                edgeType: 'imports',
+            });
+        }
+    }
+}
+/**
+ * Index a file's subsystem membership: create subsystem_of edges.
+ * filePath may be relative (relative to projectRoot) or absolute.
+ * Glob matching uses the relative path; fromNode is always stored as absolute.
+ */
+export function indexFileSubsystem(db, filePath, areas, projectRoot) {
+    const absolutePath = resolve(projectRoot, filePath);
+    const relativePath = relative(projectRoot, absolutePath);
+    for (const area of areas) {
+        const matches = area.globs.some(glob => matchGlob(relativePath, glob));
+        if (matches) {
+            upsertEdge(db, {
+                fromNode: absolutePath,
+                fromType: 'file',
+                toNode: area.name,
+                toType: 'area',
+                edgeType: 'subsystem_of',
+                weight: 1.0,
+            });
+        }
+    }
+}
+const SKIP_DIRS = new Set([
+    'node_modules', '.git', 'dist', 'build', '.next', '.nuxt',
+    'coverage', '.cache', '__pycache__', '.claudecontext',
+]);
+/**
+ * Walk a directory and collect all JS/TS source files.
+ */
+export function collectSourceFiles(dir, projectRoot, maxDepth = 6, depth = 0) {
+    if (depth > maxDepth)
+        return [];
+    const files = [];
+    let entries;
+    try {
+        entries = readdirSync(dir);
+    }
+    catch {
+        return [];
+    }
+    for (const entry of entries) {
+        if (SKIP_DIRS.has(entry))
+            continue;
+        const fullPath = join(dir, entry);
+        let stat;
+        try {
+            stat = statSync(fullPath);
+        }
+        catch {
+            continue;
+        }
+        if (stat.isDirectory()) {
+            files.push(...collectSourceFiles(fullPath, projectRoot, maxDepth, depth + 1));
+        }
+        else {
+            const ext = extname(entry);
+            if (['.ts', '.tsx', '.js', '.jsx', '.mjs'].includes(ext)) {
+                files.push(relative(projectRoot, fullPath));
+            }
+        }
+    }
+    return files;
+}
+/**
+ * Full project index: scan all source files, create imports + subsystem_of edges.
+ */
+export function indexProject(db, projectRoot, areas) {
+    const files = collectSourceFiles(projectRoot, projectRoot);
+    for (const file of files) {
+        indexFileImports(db, file, projectRoot);
+        indexFileSubsystem(db, file, areas, projectRoot);
+    }
+    return { indexed: files.length };
+}
+//# sourceMappingURL=indexer.js.map

package/dist/src/graph/indexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.js","sourceRoot":"","sources":["../../../src/graph/indexer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,IAAI,UAAU,EAAE,MAAM,OAAO,CAAC;AAC5C,OAAO,EAAE,MAAM,IAAI,SAAS,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEtE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAQ7C;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,qFAAqF;IACrF,MAAM,QAAQ,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC;IAC9C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,EAAE;YAC/B,WAAW,EAAE,QAAQ;YACrB,UAAU,EAAE,QAAQ;SACrB,CAAC,CAAC;QAGH,SAAS,CAAC,GAAsC,EAAE;YAChD,iBAAiB,CAAC,IAAa;gBAC7B,MAAM,CAAC,GAAG,IAAiB,CAAC;gBAC5B,IAAI,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,KAAK,QAAQ;oBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACxE,CAAC;YACD,sBAAsB,CAAC,IAAa;gBAClC,MAAM,CAAC,GAAG,IAAiB,CAAC;gBAC5B,IAAI,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,KAAK,QAAQ;oBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnF,CAAC;YACD,oBAAoB,CAAC,IAAa;gBAChC,MAAM,CAAC,GAAG,IAAiB,CAAC;gBAC5B,IAAI,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,KAAK,QAAQ;oBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACxE,CAAC;SACiC,CAAC,CAAC;IAExC,CAAC;IAAC,MAAM,CAAC;QACP,4CAA4C;IAC9C,CAAC;IAED,yFAAyF;IACzF,KAAK,MAAM,CAAC,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAc;IAC1C,2DAA2D;IAC3D,gFAAgF;IAChF,0DAA0D;IAC1D,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,0BAA0B,EAAE,CAAC,KAAK,EAAE,EAAE;QAC5E,MAAM,GAAG,GAAG,cAAc,CAAC,MAAM,CAAC;QAClC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,aAAa,GAAG,KAAK,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,gBAAgB;QAC/B,qCAAqC;SACpC,OAAO,CAAC,6EAA6E,EAAE,EAAE,CAAC;QAC3F,iFAAiF;SAChF,OAAO,CAAC,sCAAsC,EAAE,EAAE,CAAC;QACpD,+FAA+F;SAC9F,OAAO,CAAC,wCAAwC,EAAE,EAAE,CAAC;QACtD,6BAA6B;SAC5B,OAAO,CAAC,2CAA2C,EAAE,EAAE,CAAC,CAAC;IAE5D,0BAA0B;IAC1B,OAAO,QAAQ,CAAC,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;QACxD,OAAO,cAAc,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAc;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,iDAAiD;IACjD,MAAM,YAAY,GAAG,iDAAiD,CAAC;IACvE,MAAM,aAAa,GAAG,6BAA6B,CAAC;IACpD,MAAM,WAAW,GAAG,8BAA8B,CAAC;IAEnD,IAAI,CAAyB,CAAC;IAC9B,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QACjD,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/C,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,UAAkB,EAAE,UAAkB,EAAE,WAAmB;IACvF,qCAAqC;IACrC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5E,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAEhD,iFAAiF;IACjF,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAE3C,mCAAmC;IACnC,MAAM,UAAU,GAAG;QACjB,IAAI,GAAG,KAAK;QACZ,IAAI,GAAG,MAAM;QACb,IAAI,GAAG,KAAK;QACZ,IAAI,GAAG,MAAM;QACb,IAAI,GAAG,WAAW;QAClB,IAAI,GAAG,WAAW;QAClB,QAAQ,EAAG,yDAAyD;KACrE,CAAC;IAEF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1B,OAAO,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAM,EAAE,QAAgB,EAAE,WAAmB;IAC5E,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC;QAAE,OAAO;IAEtC,MAAM,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;IAClC,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO;IAE1E,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;IAC9C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IAED,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAC3C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;QAC9E,IAAI,gBAAgB,EAAE,CAAC;YACrB,UAAU,CAAC,EAAE,EAAE;gBACb,QAAQ,EAAE,YAAY;gBACtB,QAAQ,EAAE,MAAM;gBAChB,MAAM,EAAE,OAAO,CAAC,WAAW,EAAE,gBAAgB,CAAC;gBAC9C,MAAM,EAAE,MAAM;gBACd,QAAQ,EAAE,SAAS;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,EAAM,EAAE,QAAgB,EAAE,KAAgB,EAAE,WAAmB;IAChG,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,YAAY,GAAG,QAAQ,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;QACvE,IAAI,OAAO,EAAE,CAAC;YACZ,UAAU,CAAC,EAAE,EAAE;gBACb,QAAQ,EAAE,YAAY;gBACtB,QAAQ,EAAE,MAAM;gBAChB,MAAM,EAAE,IAAI,CAAC,IAAI;gBACjB,MAAM,EAAE,MAAM;gBACd,QAAQ,EAAE,cAAc;gBACxB,MAAM,EAAE,GAAG;aACZ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACzD,UAAU,EAAE,QAAQ,EAAE,aAAa,EAAE,gBAAgB;CACtD,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW,EAAE,WAAmB,EAAE,QAAQ,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;IAC1F,IAAI,KAAK,GAAG,QAAQ;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,OAAiB,CAAC;IACtB,IAAI,CAAC;QACH,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC;QACT,IAAI,CAAC;YACH,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,EAAM,EAAE,WAAmB,EAAE,KAAgB;IACxE,MAAM,KAAK,GAAG,kBAAkB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;IAC3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,gBAAgB,CAAC,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QACxC,kBAAkB,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;AACnC,CAAC"}

package/dist/src/graph/traversal.d.ts

@@ -0,0 +1,25 @@
+import type { Db } from '../storage/db.js';
+export interface TraversalNode {
+    node: string;
+    nodeType: string;
+    content: string;
+    tokenCount: number;
+    discoveredVia: string;
+    weight: number;
+}
+export interface TraversalResult {
+    nodes: TraversalNode[];
+    tokensUsed: number;
+}
+/**
+ * V1 traversal: 1-hop direct neighbor fetch.
+ * Fetches direct imports/subsystem_of/co_modified neighbors of the given root files.
+ * Budget-bounded — stops adding nodes when tokenBudget is exhausted.
+ */
+export declare function expandOneHop(db: Db, projectRoot: string, rootFiles: string[], tokenBudget: number): TraversalResult;
+/**
+ * V2 traversal scaffold: priority-queue BFS up to maxDepth hops.
+ * Gated behind depth > 1. Only used in V2.
+ */
+export declare function expandBFS(db: Db, projectRoot: string, rootFiles: string[], tokenBudget: number, maxDepth: number): TraversalResult;
+//# sourceMappingURL=traversal.d.ts.map

package/dist/src/graph/traversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../../../src/graph/traversal.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,EAAE,EAAQ,MAAM,kBAAkB,CAAC;AAmBjD,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,EAAE,EACN,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EAAE,EACnB,WAAW,EAAE,MAAM,GAClB,eAAe,CAoDjB;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACvB,EAAE,EAAE,EAAE,EACN,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EAAE,EACnB,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,GACf,eAAe,CA6EjB"}

package/dist/src/graph/traversal.js

@@ -0,0 +1,173 @@
+import { estimateTokens } from '../cache/budget.js';
+import { readFileSync, existsSync } from 'node:fs';
+import { resolve } from 'node:path';
+/**
+ * Composite priority: edge weight × frequency boost × recency decay of destination file.
+ * Higher touch_count and more recently touched files rank higher.
+ */
+function filePriority(db, edge) {
+    const fi = db.getFile(edge.to_node);
+    const tc = fi?.touch_count ?? 0;
+    const lt = fi?.last_touched ?? 0;
+    const daysSince = (Date.now() - lt) / 86_400_000;
+    const recency = Math.exp(-0.05 * daysSince);
+    const freq = Math.log(tc + 1) / Math.log(10);
+    return edge.weight * (1 + freq) * recency;
+}
+/**
+ * V1 traversal: 1-hop direct neighbor fetch.
+ * Fetches direct imports/subsystem_of/co_modified neighbors of the given root files.
+ * Budget-bounded — stops adding nodes when tokenBudget is exhausted.
+ */
+export function expandOneHop(db, projectRoot, rootFiles, tokenBudget) {
+    const visited = new Set(rootFiles);
+    const nodes = [];
+    let tokensUsed = 0;
+    // Collect all neighbor edges from root files, sorted by weight descending
+    const candidateEdges = [];
+    for (const file of rootFiles) {
+        const edges = db.getEdgesFrom(file, 50);
+        candidateEdges.push(...edges);
+    }
+    candidateEdges.sort((a, b) => filePriority(db, b) - filePriority(db, a));
+    for (const edge of candidateEdges) {
+        if (tokensUsed >= tokenBudget)
+            break;
+        if (visited.has(edge.to_node))
+            continue;
+        visited.add(edge.to_node);
+        const content = loadNodeContent(edge.to_node, edge.to_type, projectRoot);
+        if (!content)
+            continue;
+        const tokenCount = estimateTokens(content);
+        if (tokensUsed + tokenCount > tokenBudget) {
+            // Try to fit a truncated version
+            const remaining = tokenBudget - tokensUsed;
+            if (remaining < 100)
+                break; // Not worth including a tiny snippet
+            const truncated = content.slice(0, Math.floor(remaining * 3.5 / 1.15));
+            nodes.push({
+                node: edge.to_node,
+                nodeType: edge.to_type,
+                content: truncated + '\n[... truncated ...]',
+                tokenCount: estimateTokens(truncated),
+                discoveredVia: `via ${edge.edge_type} from ${edge.from_node} (weight=${edge.weight.toFixed(2)})`,
+                weight: edge.weight,
+            });
+            tokensUsed += estimateTokens(truncated);
+            break;
+        }
+        nodes.push({
+            node: edge.to_node,
+            nodeType: edge.to_type,
+            content,
+            tokenCount,
+            discoveredVia: `via ${edge.edge_type} from ${edge.from_node} (weight=${edge.weight.toFixed(2)})`,
+            weight: edge.weight,
+        });
+        tokensUsed += tokenCount;
+    }
+    return { nodes, tokensUsed };
+}
+/**
+ * V2 traversal scaffold: priority-queue BFS up to maxDepth hops.
+ * Gated behind depth > 1. Only used in V2.
+ */
+export function expandBFS(db, projectRoot, rootFiles, tokenBudget, maxDepth) {
+    if (maxDepth <= 1) {
+        return expandOneHop(db, projectRoot, rootFiles, tokenBudget);
+    }
+    const visited = new Set(rootFiles);
+    const nodes = [];
+    let tokensUsed = 0;
+    const queue = [];
+    const pushNeighbors = (files, currentDepth) => {
+        for (const file of files) {
+            const edges = db.getEdgesFrom(file, 30);
+            for (const edge of edges) {
+                if (!visited.has(edge.to_node)) {
+                    queue.push({
+                        priority: filePriority(db, edge),
+                        depth: currentDepth,
+                        edge,
+                    });
+                }
+            }
+        }
+        // Sort descending by priority (simple sort — for production, use a heap)
+        queue.sort((a, b) => b.priority - a.priority);
+    };
+    pushNeighbors(rootFiles, 1);
+    while (queue.length > 0 && tokensUsed < tokenBudget) {
+        const item = queue.shift();
+        if (item.depth > maxDepth)
+            continue;
+        if (visited.has(item.edge.to_node))
+            continue;
+        visited.add(item.edge.to_node);
+        const content = loadNodeContent(item.edge.to_node, item.edge.to_type, projectRoot);
+        if (!content)
+            continue;
+        const tokenCount = estimateTokens(content);
+        if (tokensUsed + tokenCount > tokenBudget) {
+            const remaining = tokenBudget - tokensUsed;
+            if (remaining < 100)
+                break;
+            const truncated = content.slice(0, Math.floor(remaining * 3.5 / 1.15));
+            nodes.push({
+                node: item.edge.to_node,
+                nodeType: item.edge.to_type,
+                content: truncated + '\n[... truncated ...]',
+                tokenCount: estimateTokens(truncated),
+                discoveredVia: `via ${item.edge.edge_type} from ${item.edge.from_node} (hop ${item.depth}, weight=${item.edge.weight.toFixed(2)})`,
+                weight: item.edge.weight,
+            });
+            tokensUsed += estimateTokens(truncated);
+            break;
+        }
+        nodes.push({
+            node: item.edge.to_node,
+            nodeType: item.edge.to_type,
+            content,
+            tokenCount,
+            discoveredVia: `via ${item.edge.edge_type} from ${item.edge.from_node} (hop ${item.depth}, weight=${item.edge.weight.toFixed(2)})`,
+            weight: item.edge.weight,
+        });
+        tokensUsed += tokenCount;
+        // Expand neighbors at next depth
+        if (item.depth < maxDepth) {
+            pushNeighbors([item.edge.to_node], item.depth + 1);
+        }
+    }
+    return { nodes, tokensUsed };
+}
+/**
+ * Load the content of a graph node (file or area doc).
+ */
+function loadNodeContent(node, nodeType, projectRoot) {
+    if (nodeType === 'file') {
+        const fullPath = resolve(projectRoot, node);
+        if (!existsSync(fullPath))
+            return null;
+        try {
+            return readFileSync(fullPath, 'utf8');
+        }
+        catch {
+            return null;
+        }
+    }
+    if (nodeType === 'area') {
+        // Area docs are in docs/context/<area>.md
+        const docPath = resolve(projectRoot, 'docs', 'context', `${node}.md`);
+        if (!existsSync(docPath))
+            return null;
+        try {
+            return readFileSync(docPath, 'utf8');
+        }
+        catch {
+            return null;
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=traversal.js.map