@harness-engineering/graph 0.3.3 → 0.3.5

package/dist/index.d.mts

@@ -163,10 +163,11 @@ interface EdgeQuery {
     readonly type?: EdgeType;
 }
 declare class GraphStore {
-    private readonly db;
-    private nodes;
-    private edges;
-    constructor();
+    private nodeMap;
+    private edgeMap;
+    private edgesByFrom;
+    private edgesByTo;
+    private edgesByType;
     addNode(node: GraphNode): void;
     batchAddNodes(nodes: readonly GraphNode[]): void;
     getNode(id: string): GraphNode | null;
@@ -181,7 +182,7 @@ declare class GraphStore {
     clear(): void;
     save(dirPath: string): Promise<void>;
     load(dirPath: string): Promise<boolean>;
-    private stripLokiMeta;
+    private removeEdgeInternal;
 }
 
 /**

package/dist/index.d.ts

@@ -163,10 +163,11 @@ interface EdgeQuery {
     readonly type?: EdgeType;
 }
 declare class GraphStore {
-    private readonly db;
-    private nodes;
-    private edges;
-    constructor();
+    private nodeMap;
+    private edgeMap;
+    private edgesByFrom;
+    private edgesByTo;
+    private edgesByType;
     addNode(node: GraphNode): void;
     batchAddNodes(nodes: readonly GraphNode[]): void;
     getNode(id: string): GraphNode | null;
@@ -181,7 +182,7 @@ declare class GraphStore {
     clear(): void;
     save(dirPath: string): Promise<void>;
     load(dirPath: string): Promise<boolean>;
-    private stripLokiMeta;
+    private removeEdgeInternal;
 }
 
 /**

package/dist/index.js

@@ -171,9 +171,6 @@ var GraphEdgeSchema = import_zod.z.object({
   metadata: import_zod.z.record(import_zod.z.unknown()).optional()
 });
 
-// src/store/GraphStore.ts
-var import_lokijs = __toESM(require("lokijs"));
-
 // src/store/Serializer.ts
 var import_promises = require("fs/promises");
 var import_node_path = require("path");
@@ -218,28 +215,38 @@ function safeMerge(target, source) {
     }
   }
 }
-var GraphStore = class {
-  db;
-  nodes;
-  edges;
-  constructor() {
-    this.db = new import_lokijs.default("graph.db");
-    this.nodes = this.db.addCollection("nodes", {
-      unique: ["id"],
-      indices: ["type", "name"]
-    });
-    this.edges = this.db.addCollection("edges", {
-      indices: ["from", "to", "type"]
-    });
+function edgeKey(from, to, type) {
+  return `${from}\0${to}\0${type}`;
+}
+function addToIndex(index, key, edge) {
+  const list = index.get(key);
+  if (list) {
+    list.push(edge);
+  } else {
+    index.set(key, [edge]);
   }
+}
+function removeFromIndex(index, key, edge) {
+  const list = index.get(key);
+  if (!list) return;
+  const idx = list.indexOf(edge);
+  if (idx !== -1) list.splice(idx, 1);
+  if (list.length === 0) index.delete(key);
+}
+var GraphStore = class {
+  nodeMap = /* @__PURE__ */ new Map();
+  edgeMap = /* @__PURE__ */ new Map();
+  // keyed by from\0to\0type
+  edgesByFrom = /* @__PURE__ */ new Map();
+  edgesByTo = /* @__PURE__ */ new Map();
+  edgesByType = /* @__PURE__ */ new Map();
   // --- Node operations ---
   addNode(node) {
-    const existing = this.nodes.by("id", node.id);
+    const existing = this.nodeMap.get(node.id);
     if (existing) {
       safeMerge(existing, node);
-      this.nodes.update(existing);
     } else {
-      this.nodes.insert({ ...node });
+      this.nodeMap.set(node.id, { ...node });
     }
   }
   batchAddNodes(nodes) {
@@ -248,44 +255,44 @@ var GraphStore = class {
     }
   }
   getNode(id) {
-    const doc = this.nodes.by("id", id);
-    if (!doc) return null;
-    return this.stripLokiMeta(doc);
+    const node = this.nodeMap.get(id);
+    if (!node) return null;
+    return { ...node };
   }
   findNodes(query) {
-    const lokiQuery = {};
-    if (query.type !== void 0) lokiQuery["type"] = query.type;
-    if (query.name !== void 0) lokiQuery["name"] = query.name;
-    if (query.path !== void 0) lokiQuery["path"] = query.path;
-    return this.nodes.find(lokiQuery).map((doc) => this.stripLokiMeta(doc));
+    const results = [];
+    for (const node of this.nodeMap.values()) {
+      if (query.type !== void 0 && node.type !== query.type) continue;
+      if (query.name !== void 0 && node.name !== query.name) continue;
+      if (query.path !== void 0 && node.path !== query.path) continue;
+      results.push({ ...node });
+    }
+    return results;
   }
   removeNode(id) {
-    const doc = this.nodes.by("id", id);
-    if (doc) {
-      this.nodes.remove(doc);
-    }
-    const edgesToRemove = this.edges.find({
-      $or: [{ from: id }, { to: id }]
-    });
+    this.nodeMap.delete(id);
+    const fromEdges = this.edgesByFrom.get(id) ?? [];
+    const toEdges = this.edgesByTo.get(id) ?? [];
+    const edgesToRemove = /* @__PURE__ */ new Set([...fromEdges, ...toEdges]);
     for (const edge of edgesToRemove) {
-      this.edges.remove(edge);
+      this.removeEdgeInternal(edge);
     }
   }
   // --- Edge operations ---
   addEdge(edge) {
-    const existing = this.edges.findOne({
-      from: edge.from,
-      to: edge.to,
-      type: edge.type
-    });
+    const key = edgeKey(edge.from, edge.to, edge.type);
+    const existing = this.edgeMap.get(key);
     if (existing) {
       if (edge.metadata) {
         safeMerge(existing, edge);
-        this.edges.update(existing);
       }
       return;
     }
-    this.edges.insert({ ...edge });
+    const copy = { ...edge };
+    this.edgeMap.set(key, copy);
+    addToIndex(this.edgesByFrom, edge.from, copy);
+    addToIndex(this.edgesByTo, edge.to, copy);
+    addToIndex(this.edgesByType, edge.type, copy);
   }
   batchAddEdges(edges) {
     for (const edge of edges) {
@@ -293,22 +300,38 @@ var GraphStore = class {
     }
   }
   getEdges(query) {
-    const lokiQuery = {};
-    if (query.from !== void 0) lokiQuery["from"] = query.from;
-    if (query.to !== void 0) lokiQuery["to"] = query.to;
-    if (query.type !== void 0) lokiQuery["type"] = query.type;
-    return this.edges.find(lokiQuery).map((doc) => this.stripLokiMeta(doc));
+    let candidates;
+    if (query.from !== void 0 && query.to !== void 0 && query.type !== void 0) {
+      const edge = this.edgeMap.get(edgeKey(query.from, query.to, query.type));
+      return edge ? [{ ...edge }] : [];
+    } else if (query.from !== void 0) {
+      candidates = this.edgesByFrom.get(query.from) ?? [];
+    } else if (query.to !== void 0) {
+      candidates = this.edgesByTo.get(query.to) ?? [];
+    } else if (query.type !== void 0) {
+      candidates = this.edgesByType.get(query.type) ?? [];
+    } else {
+      candidates = this.edgeMap.values();
+    }
+    const results = [];
+    for (const edge of candidates) {
+      if (query.from !== void 0 && edge.from !== query.from) continue;
+      if (query.to !== void 0 && edge.to !== query.to) continue;
+      if (query.type !== void 0 && edge.type !== query.type) continue;
+      results.push({ ...edge });
+    }
+    return results;
   }
   getNeighbors(nodeId, direction = "both") {
     const neighborIds = /* @__PURE__ */ new Set();
     if (direction === "outbound" || direction === "both") {
-      const outEdges = this.edges.find({ from: nodeId });
+      const outEdges = this.edgesByFrom.get(nodeId) ?? [];
       for (const edge of outEdges) {
         neighborIds.add(edge.to);
       }
     }
     if (direction === "inbound" || direction === "both") {
-      const inEdges = this.edges.find({ to: nodeId });
+      const inEdges = this.edgesByTo.get(nodeId) ?? [];
       for (const edge of inEdges) {
         neighborIds.add(edge.from);
       }
@@ -322,20 +345,23 @@ var GraphStore = class {
   }
   // --- Counts ---
   get nodeCount() {
-    return this.nodes.count();
+    return this.nodeMap.size;
   }
   get edgeCount() {
-    return this.edges.count();
+    return this.edgeMap.size;
   }
   // --- Clear ---
   clear() {
-    this.nodes.clear();
-    this.edges.clear();
+    this.nodeMap.clear();
+    this.edgeMap.clear();
+    this.edgesByFrom.clear();
+    this.edgesByTo.clear();
+    this.edgesByType.clear();
   }
   // --- Persistence ---
   async save(dirPath) {
-    const allNodes = this.nodes.find().map((doc) => this.stripLokiMeta(doc));
-    const allEdges = this.edges.find().map((doc) => this.stripLokiMeta(doc));
+    const allNodes = Array.from(this.nodeMap.values()).map((n) => ({ ...n }));
+    const allEdges = Array.from(this.edgeMap.values()).map((e) => ({ ...e }));
     await saveGraph(dirPath, allNodes, allEdges);
   }
   async load(dirPath) {
@@ -343,17 +369,25 @@ var GraphStore = class {
     if (!data) return false;
     this.clear();
     for (const node of data.nodes) {
-      this.nodes.insert({ ...node });
+      this.nodeMap.set(node.id, { ...node });
     }
     for (const edge of data.edges) {
-      this.edges.insert({ ...edge });
+      const copy = { ...edge };
+      const key = edgeKey(edge.from, edge.to, edge.type);
+      this.edgeMap.set(key, copy);
+      addToIndex(this.edgesByFrom, edge.from, copy);
+      addToIndex(this.edgesByTo, edge.to, copy);
+      addToIndex(this.edgesByType, edge.type, copy);
     }
     return true;
   }
   // --- Internal ---
-  stripLokiMeta(doc) {
-    const { $loki: _, meta: _meta, ...rest } = doc;
-    return rest;
+  removeEdgeInternal(edge) {
+    const key = edgeKey(edge.from, edge.to, edge.type);
+    this.edgeMap.delete(key);
+    removeFromIndex(this.edgesByFrom, edge.from, edge);
+    removeFromIndex(this.edgesByTo, edge.to, edge);
+    removeFromIndex(this.edgesByType, edge.type, edge);
   }
 };
 
@@ -434,11 +468,11 @@ var VectorStore = class _VectorStore {
 };
 
 // src/query/ContextQL.ts
-function edgeKey(e) {
+function edgeKey2(e) {
   return `${e.from}|${e.to}|${e.type}`;
 }
 function addEdge(state, edge) {
-  const key = edgeKey(edge);
+  const key = edgeKey2(edge);
   if (!state.edgeSet.has(key)) {
     state.edgeSet.add(key);
     state.resultEdges.push(edge);
@@ -618,6 +652,7 @@ var CodeIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingest(rootDir) {
     const start = Date.now();
     const errors = [];
@@ -1009,6 +1044,8 @@ var GitIngestor = class {
     this.store = store;
     this.gitRunner = gitRunner;
   }
+  store;
+  gitRunner;
   async ingest(rootDir) {
     const start = Date.now();
     const errors = [];
@@ -1188,6 +1225,7 @@ var TopologicalLinker = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   link() {
     let edgesAdded = 0;
     const files = this.store.findNodes({ type: "file" });
@@ -1285,6 +1323,7 @@ var KnowledgeIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingestADRs(adrDir) {
     const start = Date.now();
     const errors = [];
@@ -1533,6 +1572,7 @@ var SyncManager = class {
     this.store = store;
     this.metadataPath = path4.join(graphDir, "sync-metadata.json");
   }
+  store;
   registrations = /* @__PURE__ */ new Map();
   metadataPath;
   registerConnector(connector, config) {
@@ -2127,6 +2167,7 @@ var GraphEntropyAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Find all `documents` edges and classify them as stale or missing-target.
    *
@@ -2267,6 +2308,7 @@ var GraphComplexityAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Compute complexity hotspots by combining cyclomatic complexity with change frequency.
    *
@@ -2354,6 +2396,7 @@ var GraphCouplingAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Compute coupling data for all file nodes in the graph.
    *
@@ -2423,6 +2466,7 @@ var GraphAnomalyAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   detect(options) {
     const threshold = options?.threshold != null && options.threshold > 0 ? options.threshold : DEFAULT_THRESHOLD;
     const requestedMetrics = options?.metrics ?? [...DEFAULT_METRICS];
@@ -3583,6 +3627,7 @@ var GraphConstraintAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   computeDependencyGraph() {
     const fileNodes = this.store.findNodes({ type: "file" });
     const nodes = fileNodes.map((n) => n.path ?? n.id);
@@ -3727,6 +3772,7 @@ var DesignIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingestTokens(tokensPath) {
     const start = Date.now();
     const content = await readFileOrNull(tokensPath);
@@ -3799,6 +3845,7 @@ var DesignConstraintAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   checkForHardcodedColors(source, file, strictness) {
     const severity = this.mapSeverity(strictness);
     const tokenNodes = this.store.findNodes({ type: "design_token" });
@@ -3882,6 +3929,7 @@ var GraphFeedbackAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   computeImpactData(changedFiles) {
     const affectedTests = [];
     const affectedDocs = [];

package/dist/index.mjs

@@ -94,9 +94,6 @@ var GraphEdgeSchema = z.object({
   metadata: z.record(z.unknown()).optional()
 });
 
-// src/store/GraphStore.ts
-import loki from "lokijs";
-
 // src/store/Serializer.ts
 import { readFile, writeFile, mkdir, access } from "fs/promises";
 import { join } from "path";
@@ -141,28 +138,38 @@ function safeMerge(target, source) {
     }
   }
 }
-var GraphStore = class {
-  db;
-  nodes;
-  edges;
-  constructor() {
-    this.db = new loki("graph.db");
-    this.nodes = this.db.addCollection("nodes", {
-      unique: ["id"],
-      indices: ["type", "name"]
-    });
-    this.edges = this.db.addCollection("edges", {
-      indices: ["from", "to", "type"]
-    });
+function edgeKey(from, to, type) {
+  return `${from}\0${to}\0${type}`;
+}
+function addToIndex(index, key, edge) {
+  const list = index.get(key);
+  if (list) {
+    list.push(edge);
+  } else {
+    index.set(key, [edge]);
   }
+}
+function removeFromIndex(index, key, edge) {
+  const list = index.get(key);
+  if (!list) return;
+  const idx = list.indexOf(edge);
+  if (idx !== -1) list.splice(idx, 1);
+  if (list.length === 0) index.delete(key);
+}
+var GraphStore = class {
+  nodeMap = /* @__PURE__ */ new Map();
+  edgeMap = /* @__PURE__ */ new Map();
+  // keyed by from\0to\0type
+  edgesByFrom = /* @__PURE__ */ new Map();
+  edgesByTo = /* @__PURE__ */ new Map();
+  edgesByType = /* @__PURE__ */ new Map();
   // --- Node operations ---
   addNode(node) {
-    const existing = this.nodes.by("id", node.id);
+    const existing = this.nodeMap.get(node.id);
     if (existing) {
       safeMerge(existing, node);
-      this.nodes.update(existing);
     } else {
-      this.nodes.insert({ ...node });
+      this.nodeMap.set(node.id, { ...node });
     }
   }
   batchAddNodes(nodes) {
@@ -171,44 +178,44 @@ var GraphStore = class {
     }
   }
   getNode(id) {
-    const doc = this.nodes.by("id", id);
-    if (!doc) return null;
-    return this.stripLokiMeta(doc);
+    const node = this.nodeMap.get(id);
+    if (!node) return null;
+    return { ...node };
   }
   findNodes(query) {
-    const lokiQuery = {};
-    if (query.type !== void 0) lokiQuery["type"] = query.type;
-    if (query.name !== void 0) lokiQuery["name"] = query.name;
-    if (query.path !== void 0) lokiQuery["path"] = query.path;
-    return this.nodes.find(lokiQuery).map((doc) => this.stripLokiMeta(doc));
+    const results = [];
+    for (const node of this.nodeMap.values()) {
+      if (query.type !== void 0 && node.type !== query.type) continue;
+      if (query.name !== void 0 && node.name !== query.name) continue;
+      if (query.path !== void 0 && node.path !== query.path) continue;
+      results.push({ ...node });
+    }
+    return results;
   }
   removeNode(id) {
-    const doc = this.nodes.by("id", id);
-    if (doc) {
-      this.nodes.remove(doc);
-    }
-    const edgesToRemove = this.edges.find({
-      $or: [{ from: id }, { to: id }]
-    });
+    this.nodeMap.delete(id);
+    const fromEdges = this.edgesByFrom.get(id) ?? [];
+    const toEdges = this.edgesByTo.get(id) ?? [];
+    const edgesToRemove = /* @__PURE__ */ new Set([...fromEdges, ...toEdges]);
     for (const edge of edgesToRemove) {
-      this.edges.remove(edge);
+      this.removeEdgeInternal(edge);
     }
   }
   // --- Edge operations ---
   addEdge(edge) {
-    const existing = this.edges.findOne({
-      from: edge.from,
-      to: edge.to,
-      type: edge.type
-    });
+    const key = edgeKey(edge.from, edge.to, edge.type);
+    const existing = this.edgeMap.get(key);
     if (existing) {
       if (edge.metadata) {
         safeMerge(existing, edge);
-        this.edges.update(existing);
       }
       return;
     }
-    this.edges.insert({ ...edge });
+    const copy = { ...edge };
+    this.edgeMap.set(key, copy);
+    addToIndex(this.edgesByFrom, edge.from, copy);
+    addToIndex(this.edgesByTo, edge.to, copy);
+    addToIndex(this.edgesByType, edge.type, copy);
   }
   batchAddEdges(edges) {
     for (const edge of edges) {
@@ -216,22 +223,38 @@ var GraphStore = class {
     }
   }
   getEdges(query) {
-    const lokiQuery = {};
-    if (query.from !== void 0) lokiQuery["from"] = query.from;
-    if (query.to !== void 0) lokiQuery["to"] = query.to;
-    if (query.type !== void 0) lokiQuery["type"] = query.type;
-    return this.edges.find(lokiQuery).map((doc) => this.stripLokiMeta(doc));
+    let candidates;
+    if (query.from !== void 0 && query.to !== void 0 && query.type !== void 0) {
+      const edge = this.edgeMap.get(edgeKey(query.from, query.to, query.type));
+      return edge ? [{ ...edge }] : [];
+    } else if (query.from !== void 0) {
+      candidates = this.edgesByFrom.get(query.from) ?? [];
+    } else if (query.to !== void 0) {
+      candidates = this.edgesByTo.get(query.to) ?? [];
+    } else if (query.type !== void 0) {
+      candidates = this.edgesByType.get(query.type) ?? [];
+    } else {
+      candidates = this.edgeMap.values();
+    }
+    const results = [];
+    for (const edge of candidates) {
+      if (query.from !== void 0 && edge.from !== query.from) continue;
+      if (query.to !== void 0 && edge.to !== query.to) continue;
+      if (query.type !== void 0 && edge.type !== query.type) continue;
+      results.push({ ...edge });
+    }
+    return results;
   }
   getNeighbors(nodeId, direction = "both") {
     const neighborIds = /* @__PURE__ */ new Set();
     if (direction === "outbound" || direction === "both") {
-      const outEdges = this.edges.find({ from: nodeId });
+      const outEdges = this.edgesByFrom.get(nodeId) ?? [];
       for (const edge of outEdges) {
         neighborIds.add(edge.to);
       }
     }
     if (direction === "inbound" || direction === "both") {
-      const inEdges = this.edges.find({ to: nodeId });
+      const inEdges = this.edgesByTo.get(nodeId) ?? [];
       for (const edge of inEdges) {
         neighborIds.add(edge.from);
       }
@@ -245,20 +268,23 @@ var GraphStore = class {
   }
   // --- Counts ---
   get nodeCount() {
-    return this.nodes.count();
+    return this.nodeMap.size;
   }
   get edgeCount() {
-    return this.edges.count();
+    return this.edgeMap.size;
   }
   // --- Clear ---
   clear() {
-    this.nodes.clear();
-    this.edges.clear();
+    this.nodeMap.clear();
+    this.edgeMap.clear();
+    this.edgesByFrom.clear();
+    this.edgesByTo.clear();
+    this.edgesByType.clear();
   }
   // --- Persistence ---
   async save(dirPath) {
-    const allNodes = this.nodes.find().map((doc) => this.stripLokiMeta(doc));
-    const allEdges = this.edges.find().map((doc) => this.stripLokiMeta(doc));
+    const allNodes = Array.from(this.nodeMap.values()).map((n) => ({ ...n }));
+    const allEdges = Array.from(this.edgeMap.values()).map((e) => ({ ...e }));
     await saveGraph(dirPath, allNodes, allEdges);
   }
   async load(dirPath) {
@@ -266,17 +292,25 @@ var GraphStore = class {
     if (!data) return false;
     this.clear();
     for (const node of data.nodes) {
-      this.nodes.insert({ ...node });
+      this.nodeMap.set(node.id, { ...node });
     }
     for (const edge of data.edges) {
-      this.edges.insert({ ...edge });
+      const copy = { ...edge };
+      const key = edgeKey(edge.from, edge.to, edge.type);
+      this.edgeMap.set(key, copy);
+      addToIndex(this.edgesByFrom, edge.from, copy);
+      addToIndex(this.edgesByTo, edge.to, copy);
+      addToIndex(this.edgesByType, edge.type, copy);
     }
     return true;
   }
   // --- Internal ---
-  stripLokiMeta(doc) {
-    const { $loki: _, meta: _meta, ...rest } = doc;
-    return rest;
+  removeEdgeInternal(edge) {
+    const key = edgeKey(edge.from, edge.to, edge.type);
+    this.edgeMap.delete(key);
+    removeFromIndex(this.edgesByFrom, edge.from, edge);
+    removeFromIndex(this.edgesByTo, edge.to, edge);
+    removeFromIndex(this.edgesByType, edge.type, edge);
   }
 };
 
@@ -357,11 +391,11 @@ var VectorStore = class _VectorStore {
 };
 
 // src/query/ContextQL.ts
-function edgeKey(e) {
+function edgeKey2(e) {
   return `${e.from}|${e.to}|${e.type}`;
 }
 function addEdge(state, edge) {
-  const key = edgeKey(edge);
+  const key = edgeKey2(edge);
   if (!state.edgeSet.has(key)) {
     state.edgeSet.add(key);
     state.resultEdges.push(edge);
@@ -541,6 +575,7 @@ var CodeIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingest(rootDir) {
     const start = Date.now();
     const errors = [];
@@ -932,6 +967,8 @@ var GitIngestor = class {
     this.store = store;
     this.gitRunner = gitRunner;
   }
+  store;
+  gitRunner;
   async ingest(rootDir) {
     const start = Date.now();
     const errors = [];
@@ -1111,6 +1148,7 @@ var TopologicalLinker = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   link() {
     let edgesAdded = 0;
     const files = this.store.findNodes({ type: "file" });
@@ -1208,6 +1246,7 @@ var KnowledgeIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingestADRs(adrDir) {
     const start = Date.now();
     const errors = [];
@@ -1456,6 +1495,7 @@ var SyncManager = class {
     this.store = store;
     this.metadataPath = path4.join(graphDir, "sync-metadata.json");
   }
+  store;
   registrations = /* @__PURE__ */ new Map();
   metadataPath;
   registerConnector(connector, config) {
@@ -2050,6 +2090,7 @@ var GraphEntropyAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Find all `documents` edges and classify them as stale or missing-target.
    *
@@ -2190,6 +2231,7 @@ var GraphComplexityAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Compute complexity hotspots by combining cyclomatic complexity with change frequency.
    *
@@ -2277,6 +2319,7 @@ var GraphCouplingAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   /**
    * Compute coupling data for all file nodes in the graph.
    *
@@ -2346,6 +2389,7 @@ var GraphAnomalyAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   detect(options) {
     const threshold = options?.threshold != null && options.threshold > 0 ? options.threshold : DEFAULT_THRESHOLD;
     const requestedMetrics = options?.metrics ?? [...DEFAULT_METRICS];
@@ -3506,6 +3550,7 @@ var GraphConstraintAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   computeDependencyGraph() {
     const fileNodes = this.store.findNodes({ type: "file" });
     const nodes = fileNodes.map((n) => n.path ?? n.id);
@@ -3650,6 +3695,7 @@ var DesignIngestor = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   async ingestTokens(tokensPath) {
     const start = Date.now();
     const content = await readFileOrNull(tokensPath);
@@ -3722,6 +3768,7 @@ var DesignConstraintAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   checkForHardcodedColors(source, file, strictness) {
     const severity = this.mapSeverity(strictness);
     const tokenNodes = this.store.findNodes({ type: "design_token" });
@@ -3805,6 +3852,7 @@ var GraphFeedbackAdapter = class {
   constructor(store) {
     this.store = store;
   }
+  store;
   computeImpactData(changedFiles) {
     const affectedTests = [];
     const affectedDocs = [];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@harness-engineering/graph",
-  "version": "0.3.3",
+  "version": "0.3.5",
   "license": "MIT",
   "description": "Knowledge graph for context assembly in Harness Engineering",
   "main": "./dist/index.js",
@@ -18,13 +18,11 @@
     }
   },
   "dependencies": {
-    "lokijs": "^1.5.12",
-    "minimatch": "^10.2.4",
-    "zod": "^3.24.1",
-    "@harness-engineering/types": "0.4.0"
+    "minimatch": "^10.2.5",
+    "zod": "^3.25.76",
+    "@harness-engineering/types": "0.7.0"
   },
   "optionalDependencies": {
-    "hnswlib-node": "^3.0.0",
     "tree-sitter": "^0.22.4",
     "tree-sitter-typescript": "^0.23.2"
   },
@@ -41,11 +39,11 @@
   },
   "homepage": "https://github.com/Intense-Visions/harness-engineering/tree/main/packages/graph#readme",
   "devDependencies": {
-    "@types/node": "^22.0.0",
-    "@vitest/coverage-v8": "^4.0.18",
-    "tsup": "^8.0.0",
+    "@types/node": "^22.19.15",
+    "@vitest/coverage-v8": "^4.1.2",
+    "tsup": "^8.5.1",
     "typescript": "^5.9.3",
-    "vitest": "^4.0.18"
+    "vitest": "^4.1.2"
   },
   "scripts": {
     "build": "tsup src/index.ts --format cjs,esm --dts --tsconfig tsconfig.build.json",
@@ -55,6 +53,7 @@
     "clean": "node ../../scripts/clean.mjs dist",
     "test": "vitest run",
     "test:watch": "vitest",
-    "test:coverage": "vitest run --coverage"
+    "test:coverage": "vitest run --coverage",
+    "bench": "vitest bench"
   }
 }