kirograph 0.12.1

package/dist/resolution/index.js

@@ -0,0 +1,384 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var resolution_exports = {};
+__export(resolution_exports, {
+  ReferenceResolver: () => ReferenceResolver
+});
+module.exports = __toCommonJS(resolution_exports);
+var import_name_matcher = require("./name-matcher");
+var import_errors = require("../errors");
+class ReferenceResolver {
+  constructor(db, config) {
+    // Warm caches for O(1) lookup
+    this.nameCache = /* @__PURE__ */ new Map();
+    this.qualifiedNameCache = /* @__PURE__ */ new Map();
+    this.kindCache = /* @__PURE__ */ new Map();
+    this.lowerNameCache = /* @__PURE__ */ new Map();
+    this.nodeByIdCache = /* @__PURE__ */ new Map();
+    // namespace prefix → first non-import node ID (for C#/Java namespace-level imports)
+    this.namespacePrefixCache = /* @__PURE__ */ new Map();
+    this.cacheWarmed = false;
+    this.db = db;
+    this.config = config;
+  }
+  /**
+   * Pre-load all nodes into Maps for O(1) lookup.
+   * Must be called before resolveUnresolvedRefs() for best performance.
+   */
+  warmCaches() {
+    this.nameCache.clear();
+    this.qualifiedNameCache.clear();
+    this.kindCache.clear();
+    this.lowerNameCache.clear();
+    this.nodeByIdCache.clear();
+    this.namespacePrefixCache.clear();
+    const rawDb = this.db.db;
+    const rows = rawDb.all("SELECT * FROM nodes");
+    for (const row of rows) {
+      const node = this._rowToNode(row);
+      const nameList = this.nameCache.get(node.name) ?? [];
+      nameList.push(node);
+      this.nameCache.set(node.name, nameList);
+      if (node.qualifiedName) {
+        this.qualifiedNameCache.set(node.qualifiedName, node);
+      }
+      const kindList = this.kindCache.get(node.kind) ?? [];
+      kindList.push(node);
+      this.kindCache.set(node.kind, kindList);
+      const lower = node.name.toLowerCase();
+      const lowerList = this.lowerNameCache.get(lower) ?? [];
+      lowerList.push(node);
+      this.lowerNameCache.set(lower, lowerList);
+      this.nodeByIdCache.set(node.id, node);
+    }
+    for (const [qualName, node] of this.qualifiedNameCache) {
+      if (node.kind === "class" || node.kind === "interface" || node.kind === "namespace" || node.kind === "module") {
+        const parts = qualName.split(".");
+        for (let k = 1; k < parts.length; k++) {
+          const prefix = parts.slice(0, k).join(".");
+          if (!this.namespacePrefixCache.has(prefix)) {
+            this.namespacePrefixCache.set(prefix, node.id);
+          }
+        }
+      }
+    }
+    this.cacheWarmed = true;
+    (0, import_errors.logDebug)(`ReferenceResolver: warmed caches with ${rows.length} nodes`);
+  }
+  /**
+   * Resolve all pending unresolved references.
+   * Warms caches first, then processes all pending refs.
+   * Returns a ResolutionResult with counts and duration.
+   */
+  async resolveAll(onProgress) {
+    const start = Date.now();
+    this.warmCaches();
+    const resolvedCount = await this.resolveUnresolvedRefs(onProgress);
+    const rawDb = this.db.db;
+    const remaining = rawDb.get("SELECT COUNT(*) as c FROM unresolved_refs")?.c ?? 0;
+    const total = resolvedCount + remaining;
+    const durationMs = Date.now() - start;
+    (0, import_errors.logDebug)(`ReferenceResolver: resolved ${resolvedCount}/${total} refs in ${durationMs}ms`);
+    return {
+      resolved: resolvedCount,
+      unresolved: remaining,
+      total,
+      durationMs
+    };
+  }
+  /**
+   * Process all pending unresolved references using warm caches.
+   * Returns the count of newly resolved edges.
+   */
+  async resolveUnresolvedRefs(onProgress) {
+    if (!this.cacheWarmed) {
+      this.warmCaches();
+    }
+    const rawDb = this.db.db;
+    const refs = rawDb.all("SELECT * FROM unresolved_refs");
+    let resolved = 0;
+    const total = refs.length;
+    const BATCH_SIZE = 1e3;
+    const FUZZY_ALL_NODES_LIMIT = 2e5;
+    const skipFullFuzzy = this.nodeByIdCache.size > FUZZY_ALL_NODES_LIMIT;
+    if (skipFullFuzzy) {
+      (0, import_errors.logDebug)(`ReferenceResolver: skipping full-scan fuzzy (${this.nodeByIdCache.size} nodes exceeds ${FUZZY_ALL_NODES_LIMIT} limit)`);
+    }
+    for (let batchStart = 0; batchStart < refs.length; batchStart += BATCH_SIZE) {
+      const batchEnd = Math.min(batchStart + BATCH_SIZE, refs.length);
+      rawDb.run("BEGIN");
+      try {
+        for (let i = batchStart; i < batchEnd; i++) {
+          const ref = refs[i];
+          onProgress?.(i + 1, total);
+          const {
+            id: refId,
+            source_id: sourceId,
+            ref_name: refName,
+            ref_kind: refKind,
+            file_path: filePath,
+            line,
+            column
+          } = ref;
+          const attemptedStrategies = [];
+          let targetId = null;
+          if (refKind === "import") {
+            attemptedStrategies.push("import-path");
+            targetId = this._resolveImportPath(refName, filePath);
+          } else if (refKind === "extends" || refKind === "implements") {
+            attemptedStrategies.push("type-name");
+            targetId = this._resolveTypeName(refName);
+          } else {
+            attemptedStrategies.push("framework");
+            attemptedStrategies.push("qualified");
+            const qualifiedNode = this.qualifiedNameCache.get(refName);
+            if (qualifiedNode) {
+              targetId = qualifiedNode.id;
+            }
+            if (!targetId && refName.includes(".")) {
+              attemptedStrategies.push("method");
+              const methodPart = refName.slice(refName.lastIndexOf(".") + 1);
+              const methodCandidates = this.nameCache.get(methodPart) ?? [];
+              if (methodCandidates.length > 0) {
+                targetId = methodCandidates[0].id;
+              }
+            }
+            if (!targetId) {
+              attemptedStrategies.push("exact");
+              const exactCandidates = this.nameCache.get(refName) ?? [];
+              if (exactCandidates.length > 0) {
+                targetId = exactCandidates[0].id;
+              }
+            }
+            if (!targetId) {
+              attemptedStrategies.push("fuzzy");
+              const threshold = this.config.fuzzyResolutionThreshold ?? 0.5;
+              const lowerRef = refName.toLowerCase();
+              const fuzzyCandidates = this.lowerNameCache.get(lowerRef) ?? [];
+              if (fuzzyCandidates.length > 0) {
+                const match = (0, import_name_matcher.matchReference)(refName, fuzzyCandidates, threshold);
+                if (match) {
+                  targetId = match.nodeId;
+                }
+              }
+              if (!targetId && !skipFullFuzzy) {
+                const allCandidates = [...this.nodeByIdCache.values()];
+                const match = (0, import_name_matcher.matchReference)(refName, allCandidates, threshold);
+                if (match) {
+                  targetId = match.nodeId;
+                }
+              }
+            }
+          }
+          if (targetId) {
+            const edgeKind = refKind === "import" ? "imports" : refKind === "extends" ? "extends" : refKind === "implements" ? "implements" : "calls";
+            const edge = {
+              source: sourceId,
+              target: targetId,
+              kind: edgeKind,
+              line: line ?? void 0,
+              column: column ?? void 0
+            };
+            this.db.insertEdge(edge);
+            rawDb.run("DELETE FROM unresolved_refs WHERE id = ?", [refId]);
+            resolved++;
+          } else {
+            const strategiesJson = JSON.stringify(attemptedStrategies);
+            try {
+              rawDb.run(
+                "UPDATE unresolved_refs SET attempted_strategies = ? WHERE id = ?",
+                [strategiesJson, refId]
+              );
+            } catch {
+              (0, import_errors.logWarn)(`ReferenceResolver: failed to record attempted strategies for ref ${refId}`);
+            }
+          }
+        }
+        rawDb.run("COMMIT");
+      } catch (err) {
+        try {
+          rawDb.run("ROLLBACK");
+        } catch {
+        }
+        (0, import_errors.logWarn)(`ReferenceResolver: batch ${batchStart}-${batchEnd} failed: ${err instanceof Error ? err.message : String(err)}`);
+      }
+    }
+    return resolved;
+  }
+  /**
+   * Invalidate cache entries for all nodes belonging to the given file.
+   * Call this when a file is re-indexed to prevent stale cache hits.
+   */
+  invalidateFile(filePath) {
+    const nodesToRemove = [];
+    for (const node of this.nodeByIdCache.values()) {
+      if (node.filePath === filePath) {
+        nodesToRemove.push(node);
+      }
+    }
+    for (const node of nodesToRemove) {
+      this.nodeByIdCache.delete(node.id);
+      const nameList = this.nameCache.get(node.name);
+      if (nameList) {
+        const filtered = nameList.filter((n) => n.id !== node.id);
+        if (filtered.length === 0) {
+          this.nameCache.delete(node.name);
+        } else {
+          this.nameCache.set(node.name, filtered);
+        }
+      }
+      if (node.qualifiedName) {
+        const cached = this.qualifiedNameCache.get(node.qualifiedName);
+        if (cached?.id === node.id) {
+          this.qualifiedNameCache.delete(node.qualifiedName);
+        }
+      }
+      const kindList = this.kindCache.get(node.kind);
+      if (kindList) {
+        const filtered = kindList.filter((n) => n.id !== node.id);
+        if (filtered.length === 0) {
+          this.kindCache.delete(node.kind);
+        } else {
+          this.kindCache.set(node.kind, filtered);
+        }
+      }
+      const lower = node.name.toLowerCase();
+      const lowerList = this.lowerNameCache.get(lower);
+      if (lowerList) {
+        const filtered = lowerList.filter((n) => n.id !== node.id);
+        if (filtered.length === 0) {
+          this.lowerNameCache.delete(lower);
+        } else {
+          this.lowerNameCache.set(lower, filtered);
+        }
+      }
+    }
+    (0, import_errors.logDebug)(`ReferenceResolver: invalidated ${nodesToRemove.length} cache entries for ${filePath}`);
+  }
+  // ── Private helpers ────────────────────────────────────────────────────────
+  /**
+   * Resolve an import path to a node ID.
+   *
+   * Handles three cases:
+   *  1. Relative paths (JS/TS/Go/…) — resolved via the file tree.
+   *  2. Fully-qualified type imports (Java `import com.example.Foo`) — exact qualifiedName lookup,
+   *     then name+namespace-prefix match.
+   *  3. Namespace-level imports (C# `using MyApp.Services`) — namespace node lookup, then
+   *     namespace prefix cache (O(1)) to find any class in that namespace.
+   */
+  _resolveImportPath(importPath, sourceFilePath) {
+    if (importPath.startsWith(".")) {
+      const sourceDir = sourceFilePath.replace(/[^/]+$/, "");
+      const segments = (sourceDir + importPath).split("/");
+      const normalized = [];
+      for (const seg of segments) {
+        if (seg === "..") normalized.pop();
+        else if (seg !== ".") normalized.push(seg);
+      }
+      const basePath = normalized.join("/");
+      const candidates = [
+        basePath,
+        basePath + ".ts",
+        basePath + ".tsx",
+        basePath + ".js",
+        basePath + ".jsx",
+        basePath + "/index.ts",
+        basePath + "/index.tsx",
+        basePath + "/index.js"
+      ];
+      const rawDb = this.db.db;
+      for (const candidate of candidates) {
+        const row = rawDb.get("SELECT id FROM nodes WHERE file_path = ? LIMIT 1", [candidate]);
+        if (row) return row.id;
+      }
+      return null;
+    }
+    if (importPath.endsWith(".*") || importPath.endsWith("*")) {
+      const ns = importPath.replace(/\.\*$/, "").replace(/\*$/, "");
+      return this.namespacePrefixCache.get(ns) ?? null;
+    }
+    const exact = this.qualifiedNameCache.get(importPath);
+    if (exact) return exact.id;
+    const lastDot = importPath.lastIndexOf(".");
+    if (lastDot > 0) {
+      const typeName = importPath.slice(lastDot + 1);
+      const namespace = importPath.slice(0, lastDot);
+      const candidates = this.nameCache.get(typeName) ?? [];
+      for (const candidate of candidates) {
+        if (candidate.qualifiedName && candidate.qualifiedName.startsWith(namespace)) {
+          return candidate.id;
+        }
+      }
+    }
+    const nsCandidates = this.nameCache.get(importPath.split(".").pop() ?? "") ?? [];
+    for (const candidate of nsCandidates) {
+      if (candidate.kind === "namespace" && candidate.name === importPath) return candidate.id;
+    }
+    return this.namespacePrefixCache.get(importPath) ?? null;
+  }
+  /**
+   * Resolve a bare type name to a node ID.
+   * Used for extends/implements refs where we have only the unqualified type name.
+   * Prefers class/interface/trait/protocol nodes over other kinds.
+   */
+  _resolveTypeName(name) {
+    const candidates = this.nameCache.get(name) ?? [];
+    if (candidates.length > 0) {
+      const preferred = candidates.find(
+        (n) => n.kind === "class" || n.kind === "interface" || n.kind === "trait" || n.kind === "protocol"
+      );
+      return (preferred ?? candidates[0]).id;
+    }
+    const qualified = this.qualifiedNameCache.get(name);
+    if (qualified) return qualified.id;
+    return null;
+  }
+  /**
+   * Convert a raw DB row to a Node object.
+   */
+  _rowToNode(row) {
+    return {
+      id: row.id,
+      kind: row.kind,
+      name: row.name,
+      qualifiedName: row.qualified_name,
+      filePath: row.file_path,
+      language: row.language,
+      startLine: row.start_line,
+      endLine: row.end_line,
+      startColumn: row.start_column,
+      endColumn: row.end_column,
+      docstring: row.docstring ?? void 0,
+      signature: row.signature ?? void 0,
+      visibility: row.visibility ?? void 0,
+      isExported: row.is_exported === 1,
+      isAsync: row.is_async === 1,
+      isStatic: row.is_static === 1,
+      isAbstract: row.is_abstract === 1,
+      decorators: row.decorators ? JSON.parse(row.decorators) : void 0,
+      typeParameters: row.type_parameters ? JSON.parse(row.type_parameters) : void 0,
+      updatedAt: row.updated_at
+    };
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ReferenceResolver
+});
+//# sourceMappingURL=index.js.map

package/dist/resolution/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/resolution/index.ts"],
+  "sourcesContent": ["/**\n * KiroGraph Reference Resolver\n *\n * Implements the warm-cache resolution engine with multiple strategies.\n * Mirrors CodeGraph src/resolution/index.ts\n */\n\nimport type { Node, NodeKind, Edge } from '../types';\nimport type { GraphDatabase } from '../db/database';\nimport type { KiroGraphConfig } from '../config';\nimport { matchReference } from './name-matcher';\nimport { logDebug, logWarn } from '../errors';\n\n// \u2500\u2500 Types \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport interface ResolutionResult {\n  resolved: number;\n  unresolved: number;\n  total: number;\n  durationMs: number;\n}\n\n// \u2500\u2500 ReferenceResolver \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class ReferenceResolver {\n  private db: GraphDatabase;\n  private config: KiroGraphConfig;\n\n  // Warm caches for O(1) lookup\n  private nameCache: Map<string, Node[]> = new Map();\n  private qualifiedNameCache: Map<string, Node> = new Map();\n  private kindCache: Map<NodeKind, Node[]> = new Map();\n  private lowerNameCache: Map<string, Node[]> = new Map();\n  private nodeByIdCache: Map<string, Node> = new Map();\n  // namespace prefix \u2192 first non-import node ID (for C#/Java namespace-level imports)\n  private namespacePrefixCache: Map<string, string> = new Map();\n\n  private cacheWarmed = false;\n\n  constructor(db: GraphDatabase, config: KiroGraphConfig) {\n    this.db = db;\n    this.config = config;\n  }\n\n  /**\n   * Pre-load all nodes into Maps for O(1) lookup.\n   * Must be called before resolveUnresolvedRefs() for best performance.\n   */\n  warmCaches(): void {\n    this.nameCache.clear();\n    this.qualifiedNameCache.clear();\n    this.kindCache.clear();\n    this.lowerNameCache.clear();\n    this.nodeByIdCache.clear();\n    this.namespacePrefixCache.clear();\n\n    // Access the underlying db instance to query all nodes\n    const rawDb = (this.db as any).db;\n    const rows: any[] = rawDb.all('SELECT * FROM nodes');\n\n    for (const row of rows) {\n      const node: Node = this._rowToNode(row);\n\n      // nameCache\n      const nameList = this.nameCache.get(node.name) ?? [];\n      nameList.push(node);\n      this.nameCache.set(node.name, nameList);\n\n      // qualifiedNameCache\n      if (node.qualifiedName) {\n        this.qualifiedNameCache.set(node.qualifiedName, node);\n      }\n\n      // kindCache\n      const kindList = this.kindCache.get(node.kind) ?? [];\n      kindList.push(node);\n      this.kindCache.set(node.kind, kindList);\n\n      // lowerNameCache\n      const lower = node.name.toLowerCase();\n      const lowerList = this.lowerNameCache.get(lower) ?? [];\n      lowerList.push(node);\n      this.lowerNameCache.set(lower, lowerList);\n\n      // nodeByIdCache\n      this.nodeByIdCache.set(node.id, node);\n    }\n\n    // Build namespace prefix cache for C#/Java namespace-level import resolution.\n    // For each class/interface with a dotted qualifiedName, record every ancestor\n    // namespace prefix \u2192 the node ID, so \"using MyApp.Services\" resolves O(1).\n    for (const [qualName, node] of this.qualifiedNameCache) {\n      if (node.kind === 'class' || node.kind === 'interface' || node.kind === 'namespace' || node.kind === 'module') {\n        const parts = qualName.split('.');\n        for (let k = 1; k < parts.length; k++) {\n          const prefix = parts.slice(0, k).join('.');\n          if (!this.namespacePrefixCache.has(prefix)) {\n            this.namespacePrefixCache.set(prefix, node.id);\n          }\n        }\n      }\n    }\n\n    this.cacheWarmed = true;\n    logDebug(`ReferenceResolver: warmed caches with ${rows.length} nodes`);\n  }\n\n  /**\n   * Resolve all pending unresolved references.\n   * Warms caches first, then processes all pending refs.\n   * Returns a ResolutionResult with counts and duration.\n   */\n  async resolveAll(onProgress?: (current: number, total: number) => void): Promise<ResolutionResult> {\n    const start = Date.now();\n\n    this.warmCaches();\n    const resolvedCount = await this.resolveUnresolvedRefs(onProgress);\n\n    // Count remaining unresolved\n    const rawDb = (this.db as any).db;\n    const remaining = rawDb.get('SELECT COUNT(*) as c FROM unresolved_refs')?.c ?? 0;\n    const total = resolvedCount + remaining;\n\n    const durationMs = Date.now() - start;\n    logDebug(`ReferenceResolver: resolved ${resolvedCount}/${total} refs in ${durationMs}ms`);\n\n    return {\n      resolved: resolvedCount,\n      unresolved: remaining,\n      total,\n      durationMs,\n    };\n  }\n\n  /**\n   * Process all pending unresolved references using warm caches.\n   * Returns the count of newly resolved edges.\n   */\n  async resolveUnresolvedRefs(onProgress?: (current: number, total: number) => void): Promise<number> {\n    if (!this.cacheWarmed) {\n      this.warmCaches();\n    }\n\n    const rawDb = (this.db as any).db;\n    const refs: any[] = rawDb.all('SELECT * FROM unresolved_refs');\n    let resolved = 0;\n    const total = refs.length;\n\n    // Process in batched transactions to avoid WASM heap exhaustion.\n    // Without batching, each individual write allocates journal pages in the\n    // WASM linear memory, which can exceed the 2GB limit on large codebases.\n    const BATCH_SIZE = 1000;\n\n    // Skip the expensive \"scan all nodes\" fuzzy fallback for very large graphs.\n    // The O(N*M) cost is prohibitive and the WASM heap cannot sustain it.\n    const FUZZY_ALL_NODES_LIMIT = 200_000;\n    const skipFullFuzzy = this.nodeByIdCache.size > FUZZY_ALL_NODES_LIMIT;\n    if (skipFullFuzzy) {\n      logDebug(`ReferenceResolver: skipping full-scan fuzzy (${this.nodeByIdCache.size} nodes exceeds ${FUZZY_ALL_NODES_LIMIT} limit)`);\n    }\n\n    for (let batchStart = 0; batchStart < refs.length; batchStart += BATCH_SIZE) {\n      const batchEnd = Math.min(batchStart + BATCH_SIZE, refs.length);\n\n      // Wrap each batch in a transaction \u2014 dramatically reduces write amplification\n      rawDb.run('BEGIN');\n      try {\n        for (let i = batchStart; i < batchEnd; i++) {\n          const ref = refs[i];\n          onProgress?.(i + 1, total);\n          const {\n            id: refId,\n            source_id: sourceId,\n            ref_name: refName,\n            ref_kind: refKind,\n            file_path: filePath,\n            line,\n            column,\n          } = ref;\n\n          const attemptedStrategies: string[] = [];\n          let targetId: string | null = null;\n\n          if (refKind === 'import') {\n            attemptedStrategies.push('import-path');\n            targetId = this._resolveImportPath(refName, filePath);\n          } else if (refKind === 'extends' || refKind === 'implements') {\n            attemptedStrategies.push('type-name');\n            targetId = this._resolveTypeName(refName);\n          } else {\n            attemptedStrategies.push('framework');\n\n            // Strategy 2: Qualified name match (confidence 0.95)\n            attemptedStrategies.push('qualified');\n            const qualifiedNode = this.qualifiedNameCache.get(refName);\n            if (qualifiedNode) {\n              targetId = qualifiedNode.id;\n            }\n\n            // Strategy 3: Method call pattern (confidence 0.85)\n            if (!targetId && refName.includes('.')) {\n              attemptedStrategies.push('method');\n              const methodPart = refName.slice(refName.lastIndexOf('.') + 1);\n              const methodCandidates = this.nameCache.get(methodPart) ?? [];\n              if (methodCandidates.length > 0) {\n                targetId = methodCandidates[0].id;\n              }\n            }\n\n            // Strategy 4: Exact name match (confidence 0.9)\n            if (!targetId) {\n              attemptedStrategies.push('exact');\n              const exactCandidates = this.nameCache.get(refName) ?? [];\n              if (exactCandidates.length > 0) {\n                targetId = exactCandidates[0].id;\n              }\n            }\n\n            // Strategy 5: Fuzzy / lowercase match (confidence 0.5)\n            if (!targetId) {\n              attemptedStrategies.push('fuzzy');\n              const threshold = this.config.fuzzyResolutionThreshold ?? 0.5;\n              const lowerRef = refName.toLowerCase();\n              const fuzzyCandidates = this.lowerNameCache.get(lowerRef) ?? [];\n\n              if (fuzzyCandidates.length > 0) {\n                const match = matchReference(refName, fuzzyCandidates, threshold);\n                if (match) {\n                  targetId = match.nodeId;\n                }\n              }\n\n              // Full-scan fuzzy: only for smaller graphs (O(N*M) is too expensive otherwise)\n              if (!targetId && !skipFullFuzzy) {\n                const allCandidates = [...this.nodeByIdCache.values()];\n                const match = matchReference(refName, allCandidates, threshold);\n                if (match) {\n                  targetId = match.nodeId;\n                }\n              }\n            }\n          }\n\n          if (targetId) {\n            const edgeKind = refKind === 'import' ? 'imports'\n              : refKind === 'extends' ? 'extends'\n              : refKind === 'implements' ? 'implements'\n              : 'calls';\n            const edge: Edge = {\n              source: sourceId,\n              target: targetId,\n              kind: edgeKind,\n              line: line ?? undefined,\n              column: column ?? undefined,\n            };\n            this.db.insertEdge(edge);\n            rawDb.run('DELETE FROM unresolved_refs WHERE id = ?', [refId]);\n            resolved++;\n          } else {\n            const strategiesJson = JSON.stringify(attemptedStrategies);\n            try {\n              rawDb.run(\n                'UPDATE unresolved_refs SET attempted_strategies = ? WHERE id = ?',\n                [strategiesJson, refId]\n              );\n            } catch {\n              logWarn(`ReferenceResolver: failed to record attempted strategies for ref ${refId}`);\n            }\n          }\n        }\n        rawDb.run('COMMIT');\n      } catch (err) {\n        // Roll back the failed batch but continue with remaining batches\n        try { rawDb.run('ROLLBACK'); } catch { /* already rolled back */ }\n        logWarn(`ReferenceResolver: batch ${batchStart}-${batchEnd} failed: ${err instanceof Error ? err.message : String(err)}`);\n      }\n    }\n\n    return resolved;\n  }\n\n  /**\n   * Invalidate cache entries for all nodes belonging to the given file.\n   * Call this when a file is re-indexed to prevent stale cache hits.\n   */\n  invalidateFile(filePath: string): void {\n    const nodesToRemove: Node[] = [];\n\n    for (const node of this.nodeByIdCache.values()) {\n      if (node.filePath === filePath) {\n        nodesToRemove.push(node);\n      }\n    }\n\n    for (const node of nodesToRemove) {\n      // Remove from nodeByIdCache\n      this.nodeByIdCache.delete(node.id);\n\n      // Remove from nameCache\n      const nameList = this.nameCache.get(node.name);\n      if (nameList) {\n        const filtered = nameList.filter(n => n.id !== node.id);\n        if (filtered.length === 0) {\n          this.nameCache.delete(node.name);\n        } else {\n          this.nameCache.set(node.name, filtered);\n        }\n      }\n\n      // Remove from qualifiedNameCache\n      if (node.qualifiedName) {\n        const cached = this.qualifiedNameCache.get(node.qualifiedName);\n        if (cached?.id === node.id) {\n          this.qualifiedNameCache.delete(node.qualifiedName);\n        }\n      }\n\n      // Remove from kindCache\n      const kindList = this.kindCache.get(node.kind);\n      if (kindList) {\n        const filtered = kindList.filter(n => n.id !== node.id);\n        if (filtered.length === 0) {\n          this.kindCache.delete(node.kind);\n        } else {\n          this.kindCache.set(node.kind, filtered);\n        }\n      }\n\n      // Remove from lowerNameCache\n      const lower = node.name.toLowerCase();\n      const lowerList = this.lowerNameCache.get(lower);\n      if (lowerList) {\n        const filtered = lowerList.filter(n => n.id !== node.id);\n        if (filtered.length === 0) {\n          this.lowerNameCache.delete(lower);\n        } else {\n          this.lowerNameCache.set(lower, filtered);\n        }\n      }\n    }\n\n    logDebug(`ReferenceResolver: invalidated ${nodesToRemove.length} cache entries for ${filePath}`);\n  }\n\n  // \u2500\u2500 Private helpers \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n  /**\n   * Resolve an import path to a node ID.\n   *\n   * Handles three cases:\n   *  1. Relative paths (JS/TS/Go/\u2026) \u2014 resolved via the file tree.\n   *  2. Fully-qualified type imports (Java `import com.example.Foo`) \u2014 exact qualifiedName lookup,\n   *     then name+namespace-prefix match.\n   *  3. Namespace-level imports (C# `using MyApp.Services`) \u2014 namespace node lookup, then\n   *     namespace prefix cache (O(1)) to find any class in that namespace.\n   */\n  private _resolveImportPath(importPath: string, sourceFilePath: string): string | null {\n    // \u2500\u2500 1. Relative path (JS/TS etc.) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n    if (importPath.startsWith('.')) {\n      const sourceDir = sourceFilePath.replace(/[^/]+$/, '');\n      const segments = (sourceDir + importPath).split('/');\n      const normalized: string[] = [];\n      for (const seg of segments) {\n        if (seg === '..') normalized.pop();\n        else if (seg !== '.') normalized.push(seg);\n      }\n      const basePath = normalized.join('/');\n      const candidates = [\n        basePath,\n        basePath + '.ts', basePath + '.tsx',\n        basePath + '.js', basePath + '.jsx',\n        basePath + '/index.ts', basePath + '/index.tsx', basePath + '/index.js',\n      ];\n      const rawDb = (this.db as any).db;\n      for (const candidate of candidates) {\n        const row = rawDb.get('SELECT id FROM nodes WHERE file_path = ? LIMIT 1', [candidate]);\n        if (row) return row.id;\n      }\n      return null;\n    }\n\n    // \u2500\u2500 2. Wildcard namespace import (`import com.example.*`, `using static \u2026`) \u2500\n    if (importPath.endsWith('.*') || importPath.endsWith('*')) {\n      const ns = importPath.replace(/\\.\\*$/, '').replace(/\\*$/, '');\n      return this.namespacePrefixCache.get(ns) ?? null;\n    }\n\n    // \u2500\u2500 3. Exact qualifiedName match (Java `import com.example.Foo`) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n    const exact = this.qualifiedNameCache.get(importPath);\n    if (exact) return exact.id;\n\n    // \u2500\u2500 4. Name + namespace prefix (Java: last segment is the type name) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n    const lastDot = importPath.lastIndexOf('.');\n    if (lastDot > 0) {\n      const typeName = importPath.slice(lastDot + 1);\n      const namespace = importPath.slice(0, lastDot);\n      const candidates = this.nameCache.get(typeName) ?? [];\n      for (const candidate of candidates) {\n        if (candidate.qualifiedName && candidate.qualifiedName.startsWith(namespace)) {\n          return candidate.id;\n        }\n      }\n    }\n\n    // \u2500\u2500 5. Namespace-level import (C# `using MyApp.Services`) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n    // First check for an explicit namespace node with this name\n    const nsCandidates = this.nameCache.get(importPath.split('.').pop() ?? '') ?? [];\n    for (const candidate of nsCandidates) {\n      if (candidate.kind === 'namespace' && candidate.name === importPath) return candidate.id;\n    }\n    // Then fall back to the prefix cache: return any class/interface in this namespace\n    return this.namespacePrefixCache.get(importPath) ?? null;\n  }\n\n  /**\n   * Resolve a bare type name to a node ID.\n   * Used for extends/implements refs where we have only the unqualified type name.\n   * Prefers class/interface/trait/protocol nodes over other kinds.\n   */\n  private _resolveTypeName(name: string): string | null {\n    const candidates = this.nameCache.get(name) ?? [];\n    if (candidates.length > 0) {\n      const preferred = candidates.find(n =>\n        n.kind === 'class' || n.kind === 'interface' || n.kind === 'trait' || n.kind === 'protocol'\n      );\n      return (preferred ?? candidates[0]).id;\n    }\n    // Try as a fully-qualified name\n    const qualified = this.qualifiedNameCache.get(name);\n    if (qualified) return qualified.id;\n    return null;\n  }\n\n  /**\n   * Convert a raw DB row to a Node object.\n   */\n  private _rowToNode(row: any): Node {\n    return {\n      id: row.id,\n      kind: row.kind,\n      name: row.name,\n      qualifiedName: row.qualified_name,\n      filePath: row.file_path,\n      language: row.language,\n      startLine: row.start_line,\n      endLine: row.end_line,\n      startColumn: row.start_column,\n      endColumn: row.end_column,\n      docstring: row.docstring ?? undefined,\n      signature: row.signature ?? undefined,\n      visibility: row.visibility ?? undefined,\n      isExported: row.is_exported === 1,\n      isAsync: row.is_async === 1,\n      isStatic: row.is_static === 1,\n      isAbstract: row.is_abstract === 1,\n      decorators: row.decorators ? JSON.parse(row.decorators) : undefined,\n      typeParameters: row.type_parameters ? JSON.parse(row.type_parameters) : undefined,\n      updatedAt: row.updated_at,\n    };\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAUA,0BAA+B;AAC/B,oBAAkC;AAa3B,MAAM,kBAAkB;AAAA,EAe7B,YAAY,IAAmB,QAAyB;AAVxD;AAAA,SAAQ,YAAiC,oBAAI,IAAI;AACjD,SAAQ,qBAAwC,oBAAI,IAAI;AACxD,SAAQ,YAAmC,oBAAI,IAAI;AACnD,SAAQ,iBAAsC,oBAAI,IAAI;AACtD,SAAQ,gBAAmC,oBAAI,IAAI;AAEnD;AAAA,SAAQ,uBAA4C,oBAAI,IAAI;AAE5D,SAAQ,cAAc;AAGpB,SAAK,KAAK;AACV,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAmB;AACjB,SAAK,UAAU,MAAM;AACrB,SAAK,mBAAmB,MAAM;AAC9B,SAAK,UAAU,MAAM;AACrB,SAAK,eAAe,MAAM;AAC1B,SAAK,cAAc,MAAM;AACzB,SAAK,qBAAqB,MAAM;AAGhC,UAAM,QAAS,KAAK,GAAW;AAC/B,UAAM,OAAc,MAAM,IAAI,qBAAqB;AAEnD,eAAW,OAAO,MAAM;AACtB,YAAM,OAAa,KAAK,WAAW,GAAG;AAGtC,YAAM,WAAW,KAAK,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC;AACnD,eAAS,KAAK,IAAI;AAClB,WAAK,UAAU,IAAI,KAAK,MAAM,QAAQ;AAGtC,UAAI,KAAK,eAAe;AACtB,aAAK,mBAAmB,IAAI,KAAK,eAAe,IAAI;AAAA,MACtD;AAGA,YAAM,WAAW,KAAK,UAAU,IAAI,KAAK,IAAI,KAAK,CAAC;AACnD,eAAS,KAAK,IAAI;AAClB,WAAK,UAAU,IAAI,KAAK,MAAM,QAAQ;AAGtC,YAAM,QAAQ,KAAK,KAAK,YAAY;AACpC,YAAM,YAAY,KAAK,eAAe,IAAI,KAAK,KAAK,CAAC;AACrD,gBAAU,KAAK,IAAI;AACnB,WAAK,eAAe,IAAI,OAAO,SAAS;AAGxC,WAAK,cAAc,IAAI,KAAK,IAAI,IAAI;AAAA,IACtC;AAKA,eAAW,CAAC,UAAU,IAAI,KAAK,KAAK,oBAAoB;AACtD,UAAI,KAAK,SAAS,WAAW,KAAK,SAAS,eAAe,KAAK,SAAS,eAAe,KAAK,SAAS,UAAU;AAC7G,cAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,SAAS,MAAM,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;AACzC,cAAI,CAAC,KAAK,qBAAqB,IAAI,MAAM,GAAG;AAC1C,iBAAK,qBAAqB,IAAI,QAAQ,KAAK,EAAE;AAAA,UAC/C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,cAAc;AACnB,gCAAS,yCAAyC,KAAK,MAAM,QAAQ;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,WAAW,YAAkF;AACjG,UAAM,QAAQ,KAAK,IAAI;AAEvB,SAAK,WAAW;AAChB,UAAM,gBAAgB,MAAM,KAAK,sBAAsB,UAAU;AAGjE,UAAM,QAAS,KAAK,GAAW;AAC/B,UAAM,YAAY,MAAM,IAAI,2CAA2C,GAAG,KAAK;AAC/E,UAAM,QAAQ,gBAAgB;AAE9B,UAAM,aAAa,KAAK,IAAI,IAAI;AAChC,gCAAS,+BAA+B,aAAa,IAAI,KAAK,YAAY,UAAU,IAAI;AAExF,WAAO;AAAA,MACL,UAAU;AAAA,MACV,YAAY;AAAA,MACZ;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,sBAAsB,YAAwE;AAClG,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,WAAW;AAAA,IAClB;AAEA,UAAM,QAAS,KAAK,GAAW;AAC/B,UAAM,OAAc,MAAM,IAAI,+BAA+B;AAC7D,QAAI,WAAW;AACf,UAAM,QAAQ,KAAK;AAKnB,UAAM,aAAa;AAInB,UAAM,wBAAwB;AAC9B,UAAM,gBAAgB,KAAK,cAAc,OAAO;AAChD,QAAI,eAAe;AACjB,kCAAS,gDAAgD,KAAK,cAAc,IAAI,kBAAkB,qBAAqB,SAAS;AAAA,IAClI;AAEA,aAAS,aAAa,GAAG,aAAa,KAAK,QAAQ,cAAc,YAAY;AAC3E,YAAM,WAAW,KAAK,IAAI,aAAa,YAAY,KAAK,MAAM;AAG9D,YAAM,IAAI,OAAO;AACjB,UAAI;AACF,iBAAS,IAAI,YAAY,IAAI,UAAU,KAAK;AAC1C,gBAAM,MAAM,KAAK,CAAC;AAClB,uBAAa,IAAI,GAAG,KAAK;AACzB,gBAAM;AAAA,YACJ,IAAI;AAAA,YACJ,WAAW;AAAA,YACX,UAAU;AAAA,YACV,UAAU;AAAA,YACV,WAAW;AAAA,YACX;AAAA,YACA;AAAA,UACF,IAAI;AAEJ,gBAAM,sBAAgC,CAAC;AACvC,cAAI,WAA0B;AAE9B,cAAI,YAAY,UAAU;AACxB,gCAAoB,KAAK,aAAa;AACtC,uBAAW,KAAK,mBAAmB,SAAS,QAAQ;AAAA,UACtD,WAAW,YAAY,aAAa,YAAY,cAAc;AAC5D,gCAAoB,KAAK,WAAW;AACpC,uBAAW,KAAK,iBAAiB,OAAO;AAAA,UAC1C,OAAO;AACL,gCAAoB,KAAK,WAAW;AAGpC,gCAAoB,KAAK,WAAW;AACpC,kBAAM,gBAAgB,KAAK,mBAAmB,IAAI,OAAO;AACzD,gBAAI,eAAe;AACjB,yBAAW,cAAc;AAAA,YAC3B;AAGA,gBAAI,CAAC,YAAY,QAAQ,SAAS,GAAG,GAAG;AACtC,kCAAoB,KAAK,QAAQ;AACjC,oBAAM,aAAa,QAAQ,MAAM,QAAQ,YAAY,GAAG,IAAI,CAAC;AAC7D,oBAAM,mBAAmB,KAAK,UAAU,IAAI,UAAU,KAAK,CAAC;AAC5D,kBAAI,iBAAiB,SAAS,GAAG;AAC/B,2BAAW,iBAAiB,CAAC,EAAE;AAAA,cACjC;AAAA,YACF;AAGA,gBAAI,CAAC,UAAU;AACb,kCAAoB,KAAK,OAAO;AAChC,oBAAM,kBAAkB,KAAK,UAAU,IAAI,OAAO,KAAK,CAAC;AACxD,kBAAI,gBAAgB,SAAS,GAAG;AAC9B,2BAAW,gBAAgB,CAAC,EAAE;AAAA,cAChC;AAAA,YACF;AAGA,gBAAI,CAAC,UAAU;AACb,kCAAoB,KAAK,OAAO;AAChC,oBAAM,YAAY,KAAK,OAAO,4BAA4B;AAC1D,oBAAM,WAAW,QAAQ,YAAY;AACrC,oBAAM,kBAAkB,KAAK,eAAe,IAAI,QAAQ,KAAK,CAAC;AAE9D,kBAAI,gBAAgB,SAAS,GAAG;AAC9B,sBAAM,YAAQ,oCAAe,SAAS,iBAAiB,SAAS;AAChE,oBAAI,OAAO;AACT,6BAAW,MAAM;AAAA,gBACnB;AAAA,cACF;AAGA,kBAAI,CAAC,YAAY,CAAC,eAAe;AAC/B,sBAAM,gBAAgB,CAAC,GAAG,KAAK,cAAc,OAAO,CAAC;AACrD,sBAAM,YAAQ,oCAAe,SAAS,eAAe,SAAS;AAC9D,oBAAI,OAAO;AACT,6BAAW,MAAM;AAAA,gBACnB;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAEA,cAAI,UAAU;AACZ,kBAAM,WAAW,YAAY,WAAW,YACpC,YAAY,YAAY,YACxB,YAAY,eAAe,eAC3B;AACJ,kBAAM,OAAa;AAAA,cACjB,QAAQ;AAAA,cACR,QAAQ;AAAA,cACR,MAAM;AAAA,cACN,MAAM,QAAQ;AAAA,cACd,QAAQ,UAAU;AAAA,YACpB;AACA,iBAAK,GAAG,WAAW,IAAI;AACvB,kBAAM,IAAI,4CAA4C,CAAC,KAAK,CAAC;AAC7D;AAAA,UACF,OAAO;AACL,kBAAM,iBAAiB,KAAK,UAAU,mBAAmB;AACzD,gBAAI;AACF,oBAAM;AAAA,gBACJ;AAAA,gBACA,CAAC,gBAAgB,KAAK;AAAA,cACxB;AAAA,YACF,QAAQ;AACN,yCAAQ,oEAAoE,KAAK,EAAE;AAAA,YACrF;AAAA,UACF;AAAA,QACF;AACA,cAAM,IAAI,QAAQ;AAAA,MACpB,SAAS,KAAK;AAEZ,YAAI;AAAE,gBAAM,IAAI,UAAU;AAAA,QAAG,QAAQ;AAAA,QAA4B;AACjE,mCAAQ,4BAA4B,UAAU,IAAI,QAAQ,YAAY,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AAAA,MAC1H;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,UAAwB;AACrC,UAAM,gBAAwB,CAAC;AAE/B,eAAW,QAAQ,KAAK,cAAc,OAAO,GAAG;AAC9C,UAAI,KAAK,aAAa,UAAU;AAC9B,sBAAc,KAAK,IAAI;AAAA,MACzB;AAAA,IACF;AAEA,eAAW,QAAQ,eAAe;AAEhC,WAAK,cAAc,OAAO,KAAK,EAAE;AAGjC,YAAM,WAAW,KAAK,UAAU,IAAI,KAAK,IAAI;AAC7C,UAAI,UAAU;AACZ,cAAM,WAAW,SAAS,OAAO,OAAK,EAAE,OAAO,KAAK,EAAE;AACtD,YAAI,SAAS,WAAW,GAAG;AACzB,eAAK,UAAU,OAAO,KAAK,IAAI;AAAA,QACjC,OAAO;AACL,eAAK,UAAU,IAAI,KAAK,MAAM,QAAQ;AAAA,QACxC;AAAA,MACF;AAGA,UAAI,KAAK,eAAe;AACtB,cAAM,SAAS,KAAK,mBAAmB,IAAI,KAAK,aAAa;AAC7D,YAAI,QAAQ,OAAO,KAAK,IAAI;AAC1B,eAAK,mBAAmB,OAAO,KAAK,aAAa;AAAA,QACnD;AAAA,MACF;AAGA,YAAM,WAAW,KAAK,UAAU,IAAI,KAAK,IAAI;AAC7C,UAAI,UAAU;AACZ,cAAM,WAAW,SAAS,OAAO,OAAK,EAAE,OAAO,KAAK,EAAE;AACtD,YAAI,SAAS,WAAW,GAAG;AACzB,eAAK,UAAU,OAAO,KAAK,IAAI;AAAA,QACjC,OAAO;AACL,eAAK,UAAU,IAAI,KAAK,MAAM,QAAQ;AAAA,QACxC;AAAA,MACF;AAGA,YAAM,QAAQ,KAAK,KAAK,YAAY;AACpC,YAAM,YAAY,KAAK,eAAe,IAAI,KAAK;AAC/C,UAAI,WAAW;AACb,cAAM,WAAW,UAAU,OAAO,OAAK,EAAE,OAAO,KAAK,EAAE;AACvD,YAAI,SAAS,WAAW,GAAG;AACzB,eAAK,eAAe,OAAO,KAAK;AAAA,QAClC,OAAO;AACL,eAAK,eAAe,IAAI,OAAO,QAAQ;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAEA,gCAAS,kCAAkC,cAAc,MAAM,sBAAsB,QAAQ,EAAE;AAAA,EACjG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,mBAAmB,YAAoB,gBAAuC;AAEpF,QAAI,WAAW,WAAW,GAAG,GAAG;AAC9B,YAAM,YAAY,eAAe,QAAQ,UAAU,EAAE;AACrD,YAAM,YAAY,YAAY,YAAY,MAAM,GAAG;AACnD,YAAM,aAAuB,CAAC;AAC9B,iBAAW,OAAO,UAAU;AAC1B,YAAI,QAAQ,KAAM,YAAW,IAAI;AAAA,iBACxB,QAAQ,IAAK,YAAW,KAAK,GAAG;AAAA,MAC3C;AACA,YAAM,WAAW,WAAW,KAAK,GAAG;AACpC,YAAM,aAAa;AAAA,QACjB;AAAA,QACA,WAAW;AAAA,QAAO,WAAW;AAAA,QAC7B,WAAW;AAAA,QAAO,WAAW;AAAA,QAC7B,WAAW;AAAA,QAAa,WAAW;AAAA,QAAc,WAAW;AAAA,MAC9D;AACA,YAAM,QAAS,KAAK,GAAW;AAC/B,iBAAW,aAAa,YAAY;AAClC,cAAM,MAAM,MAAM,IAAI,oDAAoD,CAAC,SAAS,CAAC;AACrF,YAAI,IAAK,QAAO,IAAI;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AAGA,QAAI,WAAW,SAAS,IAAI,KAAK,WAAW,SAAS,GAAG,GAAG;AACzD,YAAM,KAAK,WAAW,QAAQ,SAAS,EAAE,EAAE,QAAQ,OAAO,EAAE;AAC5D,aAAO,KAAK,qBAAqB,IAAI,EAAE,KAAK;AAAA,IAC9C;AAGA,UAAM,QAAQ,KAAK,mBAAmB,IAAI,UAAU;AACpD,QAAI,MAAO,QAAO,MAAM;AAGxB,UAAM,UAAU,WAAW,YAAY,GAAG;AAC1C,QAAI,UAAU,GAAG;AACf,YAAM,WAAW,WAAW,MAAM,UAAU,CAAC;AAC7C,YAAM,YAAY,WAAW,MAAM,GAAG,OAAO;AAC7C,YAAM,aAAa,KAAK,UAAU,IAAI,QAAQ,KAAK,CAAC;AACpD,iBAAW,aAAa,YAAY;AAClC,YAAI,UAAU,iBAAiB,UAAU,cAAc,WAAW,SAAS,GAAG;AAC5E,iBAAO,UAAU;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAIA,UAAM,eAAe,KAAK,UAAU,IAAI,WAAW,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,KAAK,CAAC;AAC/E,eAAW,aAAa,cAAc;AACpC,UAAI,UAAU,SAAS,eAAe,UAAU,SAAS,WAAY,QAAO,UAAU;AAAA,IACxF;AAEA,WAAO,KAAK,qBAAqB,IAAI,UAAU,KAAK;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,iBAAiB,MAA6B;AACpD,UAAM,aAAa,KAAK,UAAU,IAAI,IAAI,KAAK,CAAC;AAChD,QAAI,WAAW,SAAS,GAAG;AACzB,YAAM,YAAY,WAAW;AAAA,QAAK,OAChC,EAAE,SAAS,WAAW,EAAE,SAAS,eAAe,EAAE,SAAS,WAAW,EAAE,SAAS;AAAA,MACnF;AACA,cAAQ,aAAa,WAAW,CAAC,GAAG;AAAA,IACtC;AAEA,UAAM,YAAY,KAAK,mBAAmB,IAAI,IAAI;AAClD,QAAI,UAAW,QAAO,UAAU;AAChC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,KAAgB;AACjC,WAAO;AAAA,MACL,IAAI,IAAI;AAAA,MACR,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,eAAe,IAAI;AAAA,MACnB,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,aAAa,IAAI;AAAA,MACjB,WAAW,IAAI;AAAA,MACf,WAAW,IAAI,aAAa;AAAA,MAC5B,WAAW,IAAI,aAAa;AAAA,MAC5B,YAAY,IAAI,cAAc;AAAA,MAC9B,YAAY,IAAI,gBAAgB;AAAA,MAChC,SAAS,IAAI,aAAa;AAAA,MAC1B,UAAU,IAAI,cAAc;AAAA,MAC5B,YAAY,IAAI,gBAAgB;AAAA,MAChC,YAAY,IAAI,aAAa,KAAK,MAAM,IAAI,UAAU,IAAI;AAAA,MAC1D,gBAAgB,IAAI,kBAAkB,KAAK,MAAM,IAAI,eAAe,IAAI;AAAA,MACxE,WAAW,IAAI;AAAA,IACjB;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/resolution/name-matcher.d.ts

@@ -0,0 +1,25 @@
+/**
+ * KiroGraph Reference Name Matcher
+ *
+ * Implements multi-strategy reference matching for the resolution engine.
+ * Mirrors CodeGraph src/resolution/name-matcher.ts
+ */
+import type { Node } from '../types';
+export interface MatchResult {
+    nodeId: string;
+    confidence: number;
+    strategy: 'qualified' | 'exact' | 'method' | 'fuzzy';
+}
+/**
+ * Attempt to match a reference name against a set of candidate nodes using
+ * multiple strategies in priority order. Returns the best match above the
+ * given confidence threshold, or null if none qualifies.
+ *
+ * Strategy order (highest confidence first):
+ *   1. Qualified name match  — confidence 0.95
+ *   2. Exact name match      — confidence 0.90
+ *   3. Method call pattern   — confidence 0.85  (refName contains '.')
+ *   4. Fuzzy / lowercase     — confidence 0.50
+ */
+export declare function matchReference(refName: string, candidates: Node[], threshold: number): MatchResult | null;
+//# sourceMappingURL=name-matcher.d.ts.map

package/dist/resolution/name-matcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"name-matcher.d.ts","sourceRoot":"","sources":["../../src/resolution/name-matcher.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAIrC,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,WAAW,GAAG,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;CACtD;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,IAAI,EAAE,EAClB,SAAS,EAAE,MAAM,GAChB,WAAW,GAAG,IAAI,CAwCpB"}

package/dist/resolution/name-matcher.js

@@ -0,0 +1,60 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var name_matcher_exports = {};
+__export(name_matcher_exports, {
+  matchReference: () => matchReference
+});
+module.exports = __toCommonJS(name_matcher_exports);
+function matchReference(refName, candidates, threshold) {
+  if (!refName || candidates.length === 0) return null;
+  for (const node of candidates) {
+    if (node.qualifiedName === refName) {
+      const result = { nodeId: node.id, confidence: 0.95, strategy: "qualified" };
+      if (result.confidence >= threshold) return result;
+    }
+  }
+  for (const node of candidates) {
+    if (node.name === refName) {
+      const result = { nodeId: node.id, confidence: 0.9, strategy: "exact" };
+      if (result.confidence >= threshold) return result;
+    }
+  }
+  if (refName.includes(".")) {
+    const methodPart = refName.slice(refName.lastIndexOf(".") + 1);
+    for (const node of candidates) {
+      if (node.name === methodPart) {
+        const result = { nodeId: node.id, confidence: 0.85, strategy: "method" };
+        if (result.confidence >= threshold) return result;
+      }
+    }
+  }
+  const lowerRef = refName.toLowerCase();
+  for (const node of candidates) {
+    if (node.name.toLowerCase() === lowerRef) {
+      const result = { nodeId: node.id, confidence: 0.5, strategy: "fuzzy" };
+      if (result.confidence >= threshold) return result;
+    }
+  }
+  return null;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  matchReference
+});
+//# sourceMappingURL=name-matcher.js.map

package/dist/resolution/name-matcher.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/resolution/name-matcher.ts"],
+  "sourcesContent": ["/**\n * KiroGraph Reference Name Matcher\n *\n * Implements multi-strategy reference matching for the resolution engine.\n * Mirrors CodeGraph src/resolution/name-matcher.ts\n */\n\nimport type { Node } from '../types';\n\n// \u2500\u2500 Types \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport interface MatchResult {\n  nodeId: string;\n  confidence: number; // 0.0\u20131.0\n  strategy: 'qualified' | 'exact' | 'method' | 'fuzzy';\n}\n\n// \u2500\u2500 matchReference \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Attempt to match a reference name against a set of candidate nodes using\n * multiple strategies in priority order. Returns the best match above the\n * given confidence threshold, or null if none qualifies.\n *\n * Strategy order (highest confidence first):\n *   1. Qualified name match  \u2014 confidence 0.95\n *   2. Exact name match      \u2014 confidence 0.90\n *   3. Method call pattern   \u2014 confidence 0.85  (refName contains '.')\n *   4. Fuzzy / lowercase     \u2014 confidence 0.50\n */\nexport function matchReference(\n  refName: string,\n  candidates: Node[],\n  threshold: number\n): MatchResult | null {\n  if (!refName || candidates.length === 0) return null;\n\n  // Strategy 1: Qualified name match (confidence 0.95)\n  for (const node of candidates) {\n    if (node.qualifiedName === refName) {\n      const result: MatchResult = { nodeId: node.id, confidence: 0.95, strategy: 'qualified' };\n      if (result.confidence >= threshold) return result;\n    }\n  }\n\n  // Strategy 2: Exact name match (confidence 0.90)\n  for (const node of candidates) {\n    if (node.name === refName) {\n      const result: MatchResult = { nodeId: node.id, confidence: 0.9, strategy: 'exact' };\n      if (result.confidence >= threshold) return result;\n    }\n  }\n\n  // Strategy 3: Method call pattern \u2014 if refName contains '.', match the part after '.' (confidence 0.85)\n  if (refName.includes('.')) {\n    const methodPart = refName.slice(refName.lastIndexOf('.') + 1);\n    for (const node of candidates) {\n      if (node.name === methodPart) {\n        const result: MatchResult = { nodeId: node.id, confidence: 0.85, strategy: 'method' };\n        if (result.confidence >= threshold) return result;\n      }\n    }\n  }\n\n  // Strategy 4: Fuzzy / lowercase match (confidence 0.50)\n  const lowerRef = refName.toLowerCase();\n  for (const node of candidates) {\n    if (node.name.toLowerCase() === lowerRef) {\n      const result: MatchResult = { nodeId: node.id, confidence: 0.5, strategy: 'fuzzy' };\n      if (result.confidence >= threshold) return result;\n    }\n  }\n\n  return null;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AA8BO,SAAS,eACd,SACA,YACA,WACoB;AACpB,MAAI,CAAC,WAAW,WAAW,WAAW,EAAG,QAAO;AAGhD,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,kBAAkB,SAAS;AAClC,YAAM,SAAsB,EAAE,QAAQ,KAAK,IAAI,YAAY,MAAM,UAAU,YAAY;AACvF,UAAI,OAAO,cAAc,UAAW,QAAO;AAAA,IAC7C;AAAA,EACF;AAGA,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,SAAS,SAAS;AACzB,YAAM,SAAsB,EAAE,QAAQ,KAAK,IAAI,YAAY,KAAK,UAAU,QAAQ;AAClF,UAAI,OAAO,cAAc,UAAW,QAAO;AAAA,IAC7C;AAAA,EACF;AAGA,MAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,UAAM,aAAa,QAAQ,MAAM,QAAQ,YAAY,GAAG,IAAI,CAAC;AAC7D,eAAW,QAAQ,YAAY;AAC7B,UAAI,KAAK,SAAS,YAAY;AAC5B,cAAM,SAAsB,EAAE,QAAQ,KAAK,IAAI,YAAY,MAAM,UAAU,SAAS;AACpF,YAAI,OAAO,cAAc,UAAW,QAAO;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,QAAQ,YAAY;AACrC,aAAW,QAAQ,YAAY;AAC7B,QAAI,KAAK,KAAK,YAAY,MAAM,UAAU;AACxC,YAAM,SAAsB,EAAE,QAAQ,KAAK,IAAI,YAAY,KAAK,UAAU,QAAQ;AAClF,UAAI,OAAO,cAAc,UAAW,QAAO;AAAA,IAC7C;AAAA,EACF;AAEA,SAAO;AACT;",
+  "names": []
+}

package/dist/scripts/postinstall.js

@@ -0,0 +1,64 @@
+#!/usr/bin/env node
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var import_fs = require("fs");
+var import_path = require("path");
+var import_os = require("os");
+const KIROGRAPH_DIR = (0, import_path.join)((0, import_os.homedir)(), ".kirograph");
+const MODELS_DIR = (0, import_path.join)(KIROGRAPH_DIR, "models");
+const MODEL_ID = "nomic-ai/nomic-embed-text-v1.5";
+async function downloadModel() {
+  (0, import_fs.mkdirSync)(KIROGRAPH_DIR, { recursive: true });
+  (0, import_fs.mkdirSync)(MODELS_DIR, { recursive: true });
+  const modelCachePath = (0, import_path.join)(MODELS_DIR, MODEL_ID.replace("/", "--"));
+  if ((0, import_fs.existsSync)(modelCachePath)) {
+    console.log("KiroGraph: Embedding model already downloaded.");
+    return;
+  }
+  console.log("KiroGraph: Downloading embedding model (~130MB)...");
+  console.log("This is a one-time download for semantic code search.\n");
+  try {
+    const { pipeline, env } = await import("@huggingface/transformers");
+    env.cacheDir = MODELS_DIR;
+    await pipeline("feature-extraction", MODEL_ID, {
+      progress_callback: (progress) => {
+        if (progress.status === "progress" && progress.file && progress.progress !== void 0) {
+          const fileName = progress.file.split("/").pop();
+          const percent = Math.round(progress.progress);
+          process.stdout.write(`\rDownloading ${fileName}... ${percent}%   `);
+        } else if (progress.status === "done") {
+          process.stdout.write("\n");
+        }
+      }
+    });
+    console.log("\nKiroGraph: Embedding model ready!");
+  } catch (error) {
+    console.log("\nKiroGraph: Could not download embedding model.");
+    console.log("Semantic search will download it on first use.");
+    if (process.env.KIROGRAPH_DEBUG) {
+      console.error(error);
+    }
+  }
+}
+downloadModel().catch(() => process.exit(0));

package/dist/search/query-utils.d.ts

@@ -0,0 +1,21 @@
+import type { NodeKind } from '../types';
+/** Common English words that carry no search signal. */
+export declare const STOP_WORDS: Set<string>;
+/**
+ * Tokenises a natural-language query.
+ * Splits camelCase, PascalCase, snake_case, SCREAMING_SNAKE, and dot.notation.
+ * Lowercases all tokens, removes stop words, removes tokens shorter than 3 chars.
+ */
+export declare function extractSearchTerms(query: string): string[];
+/**
+ * Numeric relevance score for a file path against a query string.
+ * +10 if filename (no extension) matches a query token exactly.
+ * +5  if a directory segment matches a query token exactly.
+ * +3  if any path segment contains a query token as a substring.
+ */
+export declare function scorePathRelevance(filePath: string, query: string): number;
+/**
+ * Numeric relevance bonus by node kind.
+ */
+export declare function kindBonus(kind: NodeKind): number;
+//# sourceMappingURL=query-utils.d.ts.map

package/dist/search/query-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-utils.d.ts","sourceRoot":"","sources":["../../src/search/query-utils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAIzC,wDAAwD;AACxD,eAAO,MAAM,UAAU,aAYrB,CAAC;AAIH;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAsB1D;AAID;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAiC1E;AAID;;GAEG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAoChD"}