kirograph 0.12.1

package/dist/context/index.js

@@ -0,0 +1,224 @@
+"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 __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 __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 __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var context_exports = {};
+__export(context_exports, {
+  ContextBuilder: () => ContextBuilder
+});
+module.exports = __toCommonJS(context_exports);
+var fs = __toESM(require("fs"));
+var path = __toESM(require("path"));
+var import_errors = require("../errors");
+var import_query_utils = require("../search/query-utils");
+var import_utils = require("../utils");
+const EXCLUDED_NODE_KINDS = /* @__PURE__ */ new Set(["import", "export"]);
+const DEFAULT_MAX_NODES = 20;
+const DEFAULT_MAX_CODE_BLOCKS = 5;
+const DEFAULT_MAX_CODE_BLOCK_SIZE = 1500;
+const NO_RESULTS_MESSAGE = "No relevant context found for the given query.";
+const FEATURE_REQUEST_WORDS = /* @__PURE__ */ new Set([
+  "add",
+  "create",
+  "implement",
+  "build",
+  "make",
+  "new",
+  "feature",
+  "support",
+  "enable",
+  "allow",
+  "introduce",
+  "generate",
+  "write",
+  "develop",
+  "design",
+  "extend"
+]);
+function isFeatureRequest(task) {
+  const words = task.toLowerCase().split(/\s+/);
+  return words.some((w) => FEATURE_REQUEST_WORDS.has(w));
+}
+class ContextBuilder {
+  constructor(db, resolver, vectors, projectRoot) {
+    this.db = db;
+    this.resolver = resolver;
+    this.vectors = vectors;
+    this.projectRoot = projectRoot;
+  }
+  /**
+   * Find relevant nodes for the given query using hybrid search.
+   *
+   * Pipeline:
+   * 1. Extract symbol tokens from query
+   * 2. Exact name lookup (priority: 'exact')
+   * 3. Semantic search via VectorManager (priority: 'semantic')
+   * 4. Full-text search fallback (priority: 'fts')
+   * 5. Merge and deduplicate by node ID
+   * 6. Resolve import nodes to their definitions via 'imports' edge
+   * 7. Exclude 'import' and 'export' node kinds
+   * 8. Priority-based trimming when exceeding maxNodes
+   */
+  async findRelevantContext(query, opts) {
+    const maxNodes = opts?.maxNodes ?? DEFAULT_MAX_NODES;
+    const tokens = (0, import_query_utils.extractSearchTerms)(query);
+    (0, import_errors.logDebug)("ContextBuilder.findRelevantContext", { query, tokens });
+    const ranked = [];
+    const seen = /* @__PURE__ */ new Map();
+    for (const token of tokens) {
+      const nodes = this.db.findNodesByExactName(token);
+      for (const node of nodes) {
+        if (!seen.has(node.id)) {
+          seen.set(node.id, "exact");
+          ranked.push({ node, priority: "exact" });
+        }
+      }
+    }
+    if (this.vectors.isInitialized()) {
+      const semanticNodes = await this.vectors.search(query, maxNodes);
+      for (const node of semanticNodes) {
+        if (!seen.has(node.id)) {
+          seen.set(node.id, "semantic");
+          ranked.push({ node, priority: "semantic" });
+        }
+      }
+    }
+    const ftsNodes = this.db.searchNodes(query, { limit: maxNodes });
+    for (const node of ftsNodes) {
+      if (!seen.has(node.id)) {
+        seen.set(node.id, "fts");
+        ranked.push({ node, priority: "fts" });
+      }
+    }
+    const importNodeIds = ranked.filter((r) => r.node.kind === "import").map((r) => r.node.id);
+    if (importNodeIds.length > 0) {
+      const edges = this.db.getEdgesForNodes(importNodeIds);
+      for (const edge of edges) {
+        if (edge.kind === "imports" && importNodeIds.includes(edge.source)) {
+          const targetNode = this.db.getNode(edge.target);
+          if (targetNode && !seen.has(targetNode.id)) {
+            const importPriority = seen.get(edge.source) ?? "fts";
+            seen.set(targetNode.id, importPriority);
+            ranked.push({ node: targetNode, priority: importPriority });
+          }
+        }
+      }
+    }
+    const filtered = ranked.filter((r) => !EXCLUDED_NODE_KINDS.has(r.node.kind));
+    if (filtered.length <= maxNodes) {
+      return filtered.map((r) => r.node);
+    }
+    const exact = filtered.filter((r) => r.priority === "exact");
+    const semantic = filtered.filter((r) => r.priority === "semantic");
+    const fts = filtered.filter((r) => r.priority === "fts");
+    const trimmed = [];
+    for (const group of [exact, semantic, fts]) {
+      for (const item of group) {
+        if (trimmed.length >= maxNodes) break;
+        trimmed.push(item);
+      }
+      if (trimmed.length >= maxNodes) break;
+    }
+    return trimmed.map((r) => r.node);
+  }
+  /**
+   * Build a full TaskContext for the given task description.
+   * Finds relevant nodes, gathers their edges and source snippets, and returns
+   * the structured context used by MCP tools and the query API.
+   */
+  async buildTaskContext(task, opts) {
+    const maxNodes = opts?.maxNodes ?? DEFAULT_MAX_NODES;
+    const nodes = await this.findRelevantContext(task, { maxNodes });
+    const entryPoints = nodes.slice(0, Math.ceil(maxNodes / 2));
+    const relatedNodes = nodes.slice(Math.ceil(maxNodes / 2));
+    const edges = this.db.getEdgesForNodes(nodes.map((n) => n.id));
+    const codeSnippets = /* @__PURE__ */ new Map();
+    if (opts?.includeCode !== false) {
+      for (const node of nodes.slice(0, 10)) {
+        const src = this._readNodeSource(node);
+        if (src) codeSnippets.set(node.id, src);
+      }
+    }
+    const hint = isFeatureRequest(task) ? " (feature request \u2014 showing existing patterns and extension points)" : "";
+    return {
+      task,
+      entryPoints,
+      relatedNodes,
+      edges,
+      codeSnippets,
+      summary: `Found ${entryPoints.length} entry points and ${relatedNodes.length} related symbols for: "${task}"${hint}`
+    };
+  }
+  _readNodeSource(node) {
+    const absPath = (0, import_utils.validatePathWithinRoot)(path.join(this.projectRoot, node.filePath), this.projectRoot);
+    if (!absPath) return null;
+    try {
+      return fs.readFileSync(absPath, "utf8").split("\n").slice(node.startLine - 1, node.endLine).join("\n");
+    } catch {
+      return null;
+    }
+  }
+  /**
+   * Build a formatted context string for the given query.
+   *
+   * Each node is formatted as:
+   *   [filePath:line] kind name
+   *   ```
+   *   {snippet}
+   *   ```
+   *
+   * Returns NO_RESULTS_MESSAGE when no nodes are found.
+   */
+  async build(query, opts) {
+    const maxCodeBlocks = opts?.maxCodeBlocks ?? DEFAULT_MAX_CODE_BLOCKS;
+    const maxCodeBlockSize = opts?.maxCodeBlockSize ?? DEFAULT_MAX_CODE_BLOCK_SIZE;
+    const nodes = await this.findRelevantContext(query, opts);
+    if (nodes.length === 0) {
+      return NO_RESULTS_MESSAGE;
+    }
+    const parts = [];
+    const limit = Math.min(nodes.length, maxCodeBlocks);
+    for (let i = 0; i < limit; i++) {
+      const node = nodes[i];
+      const snippet = getSnippet(node, maxCodeBlockSize);
+      parts.push(`[${node.filePath}:${node.startLine}] ${node.kind} ${node.name}
+\`\`\`
+${snippet}
+\`\`\``);
+    }
+    return parts.join("\n\n");
+  }
+}
+function getSnippet(node, maxSize) {
+  const raw = node.signature ?? node.docstring ?? node.name;
+  return raw.length > maxSize ? raw.slice(0, maxSize) : raw;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  ContextBuilder
+});
+//# sourceMappingURL=index.js.map

package/dist/context/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/context/index.ts"],
+  "sourcesContent": ["/**\n * KiroGraph Context Builder\n *\n * Implements hybrid search (exact name + semantic + full-text) to assemble\n * relevant code context for a given query.\n * Mirrors CodeGraph src/context/index.ts\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\nimport type { Node, TaskContext } from '../types';\nimport type { GraphDatabase } from '../db/database';\nimport type { ReferenceResolver } from '../resolution/index';\nimport type { VectorManager } from '../vectors/index';\nimport { logDebug } from '../errors';\nimport { extractSearchTerms } from '../search/query-utils';\nimport { validatePathWithinRoot } from '../utils';\n\n// \u2500\u2500 Constants \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\n/** Node kinds excluded from context results (low information density). */\nconst EXCLUDED_NODE_KINDS = new Set<string>(['import', 'export']);\n\nconst DEFAULT_MAX_NODES = 20;\nconst DEFAULT_MAX_CODE_BLOCKS = 5;\nconst DEFAULT_MAX_CODE_BLOCK_SIZE = 1500;\n\nconst NO_RESULTS_MESSAGE = 'No relevant context found for the given query.';\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 ContextOptions {\n  maxNodes?: number;\n  maxCodeBlocks?: number;\n  maxCodeBlockSize?: number;\n  traversalDepth?: number;\n}\n\ntype Priority = 'exact' | 'semantic' | 'fts';\n\ninterface RankedNode {\n  node: Node;\n  priority: Priority;\n}\n\n// \u2500\u2500 ContextBuilder \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\nconst FEATURE_REQUEST_WORDS = new Set([\n  'add', 'create', 'implement', 'build', 'make', 'new', 'feature', 'support', 'enable', 'allow',\n  'introduce', 'generate', 'write', 'develop', 'design', 'extend',\n]);\n\nfunction isFeatureRequest(task: string): boolean {\n  const words = task.toLowerCase().split(/\\s+/);\n  return words.some(w => FEATURE_REQUEST_WORDS.has(w));\n}\n\nexport class ContextBuilder {\n  constructor(\n    private readonly db: GraphDatabase,\n    private readonly resolver: ReferenceResolver,\n    private readonly vectors: VectorManager,\n    private readonly projectRoot: string,\n  ) {}\n\n  /**\n   * Find relevant nodes for the given query using hybrid search.\n   *\n   * Pipeline:\n   * 1. Extract symbol tokens from query\n   * 2. Exact name lookup (priority: 'exact')\n   * 3. Semantic search via VectorManager (priority: 'semantic')\n   * 4. Full-text search fallback (priority: 'fts')\n   * 5. Merge and deduplicate by node ID\n   * 6. Resolve import nodes to their definitions via 'imports' edge\n   * 7. Exclude 'import' and 'export' node kinds\n   * 8. Priority-based trimming when exceeding maxNodes\n   */\n  async findRelevantContext(query: string, opts?: ContextOptions): Promise<Node[]> {\n    const maxNodes = opts?.maxNodes ?? DEFAULT_MAX_NODES;\n\n    const tokens = extractSearchTerms(query);\n    logDebug('ContextBuilder.findRelevantContext', { query, tokens });\n\n    const ranked: RankedNode[] = [];\n    const seen = new Map<string, Priority>();\n\n    // Step 2: Exact name lookup\n    for (const token of tokens) {\n      const nodes = this.db.findNodesByExactName(token);\n      for (const node of nodes) {\n        if (!seen.has(node.id)) {\n          seen.set(node.id, 'exact');\n          ranked.push({ node, priority: 'exact' });\n        }\n      }\n    }\n\n    // Step 3: Semantic search (if vectors enabled)\n    if (this.vectors.isInitialized()) {\n      const semanticNodes = await this.vectors.search(query, maxNodes);\n      for (const node of semanticNodes) {\n        if (!seen.has(node.id)) {\n          seen.set(node.id, 'semantic');\n          ranked.push({ node, priority: 'semantic' });\n        }\n      }\n    }\n\n    // Step 4: Full-text search fallback\n    const ftsNodes = this.db.searchNodes(query, { limit: maxNodes });\n    for (const node of ftsNodes) {\n      if (!seen.has(node.id)) {\n        seen.set(node.id, 'fts');\n        ranked.push({ node, priority: 'fts' });\n      }\n    }\n\n    // Step 5: Deduplicated by node ID (already handled via `seen` map above)\n\n    // Step 6: Resolve import nodes to their definitions via 'imports' edge\n    const importNodeIds = ranked\n      .filter(r => r.node.kind === 'import')\n      .map(r => r.node.id);\n\n    if (importNodeIds.length > 0) {\n      const edges = this.db.getEdgesForNodes(importNodeIds);\n      for (const edge of edges) {\n        if (edge.kind === 'imports' && importNodeIds.includes(edge.source)) {\n          const targetNode = this.db.getNode(edge.target);\n          if (targetNode && !seen.has(targetNode.id)) {\n            // Inherit priority from the import node that resolved to this definition\n            const importPriority = seen.get(edge.source) ?? 'fts';\n            seen.set(targetNode.id, importPriority);\n            ranked.push({ node: targetNode, priority: importPriority });\n          }\n        }\n      }\n    }\n\n    // Step 7: Exclude 'import' and 'export' node kinds\n    const filtered = ranked.filter(r => !EXCLUDED_NODE_KINDS.has(r.node.kind));\n\n    // Step 8: Priority-based trimming\n    if (filtered.length <= maxNodes) {\n      return filtered.map(r => r.node);\n    }\n\n    const exact = filtered.filter(r => r.priority === 'exact');\n    const semantic = filtered.filter(r => r.priority === 'semantic');\n    const fts = filtered.filter(r => r.priority === 'fts');\n\n    const trimmed: RankedNode[] = [];\n    for (const group of [exact, semantic, fts]) {\n      for (const item of group) {\n        if (trimmed.length >= maxNodes) break;\n        trimmed.push(item);\n      }\n      if (trimmed.length >= maxNodes) break;\n    }\n\n    return trimmed.map(r => r.node);\n  }\n\n  /**\n   * Build a full TaskContext for the given task description.\n   * Finds relevant nodes, gathers their edges and source snippets, and returns\n   * the structured context used by MCP tools and the query API.\n   */\n  async buildTaskContext(task: string, opts?: { maxNodes?: number; includeCode?: boolean }): Promise<TaskContext> {\n    const maxNodes = opts?.maxNodes ?? DEFAULT_MAX_NODES;\n    const nodes = await this.findRelevantContext(task, { maxNodes });\n\n    const entryPoints = nodes.slice(0, Math.ceil(maxNodes / 2));\n    const relatedNodes = nodes.slice(Math.ceil(maxNodes / 2));\n    const edges = this.db.getEdgesForNodes(nodes.map(n => n.id));\n\n    const codeSnippets = new Map<string, string>();\n    if (opts?.includeCode !== false) {\n      for (const node of nodes.slice(0, 10)) {\n        const src = this._readNodeSource(node);\n        if (src) codeSnippets.set(node.id, src);\n      }\n    }\n\n    const hint = isFeatureRequest(task)\n      ? ' (feature request \u2014 showing existing patterns and extension points)'\n      : '';\n\n    return {\n      task, entryPoints, relatedNodes, edges, codeSnippets,\n      summary: `Found ${entryPoints.length} entry points and ${relatedNodes.length} related symbols for: \"${task}\"${hint}`,\n    };\n  }\n\n  private _readNodeSource(node: Node): string | null {\n    const absPath = validatePathWithinRoot(path.join(this.projectRoot, node.filePath), this.projectRoot);\n    if (!absPath) return null;\n    try {\n      return fs.readFileSync(absPath, 'utf8').split('\\n').slice(node.startLine - 1, node.endLine).join('\\n');\n    } catch { return null; }\n  }\n\n  /**\n   * Build a formatted context string for the given query.\n   *\n   * Each node is formatted as:\n   *   [filePath:line] kind name\n   *   ```\n   *   {snippet}\n   *   ```\n   *\n   * Returns NO_RESULTS_MESSAGE when no nodes are found.\n   */\n  async build(query: string, opts?: ContextOptions): Promise<string> {\n    const maxCodeBlocks = opts?.maxCodeBlocks ?? DEFAULT_MAX_CODE_BLOCKS;\n    const maxCodeBlockSize = opts?.maxCodeBlockSize ?? DEFAULT_MAX_CODE_BLOCK_SIZE;\n\n    const nodes = await this.findRelevantContext(query, opts);\n\n    if (nodes.length === 0) {\n      return NO_RESULTS_MESSAGE;\n    }\n\n    const parts: string[] = [];\n    const limit = Math.min(nodes.length, maxCodeBlocks);\n\n    for (let i = 0; i < limit; i++) {\n      const node = nodes[i];\n      const snippet = getSnippet(node, maxCodeBlockSize);\n      parts.push(`[${node.filePath}:${node.startLine}] ${node.kind} ${node.name}\\n\\`\\`\\`\\n${snippet}\\n\\`\\`\\``);\n    }\n\n    return parts.join('\\n\\n');\n  }\n}\n\n// \u2500\u2500 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\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Get the best available snippet for a node, truncated to maxSize.\n * Prefers signature > docstring > name.\n */\nfunction getSnippet(node: Node, maxSize: number): string {\n  const raw = node.signature ?? node.docstring ?? node.name;\n  return raw.length > maxSize ? raw.slice(0, maxSize) : raw;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAQA,SAAoB;AACpB,WAAsB;AAKtB,oBAAyB;AACzB,yBAAmC;AACnC,mBAAuC;AAKvC,MAAM,sBAAsB,oBAAI,IAAY,CAAC,UAAU,QAAQ,CAAC;AAEhE,MAAM,oBAAoB;AAC1B,MAAM,0BAA0B;AAChC,MAAM,8BAA8B;AAEpC,MAAM,qBAAqB;AAoB3B,MAAM,wBAAwB,oBAAI,IAAI;AAAA,EACpC;AAAA,EAAO;AAAA,EAAU;AAAA,EAAa;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAW;AAAA,EAAW;AAAA,EAAU;AAAA,EACtF;AAAA,EAAa;AAAA,EAAY;AAAA,EAAS;AAAA,EAAW;AAAA,EAAU;AACzD,CAAC;AAED,SAAS,iBAAiB,MAAuB;AAC/C,QAAM,QAAQ,KAAK,YAAY,EAAE,MAAM,KAAK;AAC5C,SAAO,MAAM,KAAK,OAAK,sBAAsB,IAAI,CAAC,CAAC;AACrD;AAEO,MAAM,eAAe;AAAA,EAC1B,YACmB,IACA,UACA,SACA,aACjB;AAJiB;AACA;AACA;AACA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeH,MAAM,oBAAoB,OAAe,MAAwC;AAC/E,UAAM,WAAW,MAAM,YAAY;AAEnC,UAAM,aAAS,uCAAmB,KAAK;AACvC,gCAAS,sCAAsC,EAAE,OAAO,OAAO,CAAC;AAEhE,UAAM,SAAuB,CAAC;AAC9B,UAAM,OAAO,oBAAI,IAAsB;AAGvC,eAAW,SAAS,QAAQ;AAC1B,YAAM,QAAQ,KAAK,GAAG,qBAAqB,KAAK;AAChD,iBAAW,QAAQ,OAAO;AACxB,YAAI,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACtB,eAAK,IAAI,KAAK,IAAI,OAAO;AACzB,iBAAO,KAAK,EAAE,MAAM,UAAU,QAAQ,CAAC;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,QAAQ,cAAc,GAAG;AAChC,YAAM,gBAAgB,MAAM,KAAK,QAAQ,OAAO,OAAO,QAAQ;AAC/D,iBAAW,QAAQ,eAAe;AAChC,YAAI,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACtB,eAAK,IAAI,KAAK,IAAI,UAAU;AAC5B,iBAAO,KAAK,EAAE,MAAM,UAAU,WAAW,CAAC;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AAGA,UAAM,WAAW,KAAK,GAAG,YAAY,OAAO,EAAE,OAAO,SAAS,CAAC;AAC/D,eAAW,QAAQ,UAAU;AAC3B,UAAI,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACtB,aAAK,IAAI,KAAK,IAAI,KAAK;AACvB,eAAO,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AAAA,MACvC;AAAA,IACF;AAKA,UAAM,gBAAgB,OACnB,OAAO,OAAK,EAAE,KAAK,SAAS,QAAQ,EACpC,IAAI,OAAK,EAAE,KAAK,EAAE;AAErB,QAAI,cAAc,SAAS,GAAG;AAC5B,YAAM,QAAQ,KAAK,GAAG,iBAAiB,aAAa;AACpD,iBAAW,QAAQ,OAAO;AACxB,YAAI,KAAK,SAAS,aAAa,cAAc,SAAS,KAAK,MAAM,GAAG;AAClE,gBAAM,aAAa,KAAK,GAAG,QAAQ,KAAK,MAAM;AAC9C,cAAI,cAAc,CAAC,KAAK,IAAI,WAAW,EAAE,GAAG;AAE1C,kBAAM,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAK;AAChD,iBAAK,IAAI,WAAW,IAAI,cAAc;AACtC,mBAAO,KAAK,EAAE,MAAM,YAAY,UAAU,eAAe,CAAC;AAAA,UAC5D;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,UAAM,WAAW,OAAO,OAAO,OAAK,CAAC,oBAAoB,IAAI,EAAE,KAAK,IAAI,CAAC;AAGzE,QAAI,SAAS,UAAU,UAAU;AAC/B,aAAO,SAAS,IAAI,OAAK,EAAE,IAAI;AAAA,IACjC;AAEA,UAAM,QAAQ,SAAS,OAAO,OAAK,EAAE,aAAa,OAAO;AACzD,UAAM,WAAW,SAAS,OAAO,OAAK,EAAE,aAAa,UAAU;AAC/D,UAAM,MAAM,SAAS,OAAO,OAAK,EAAE,aAAa,KAAK;AAErD,UAAM,UAAwB,CAAC;AAC/B,eAAW,SAAS,CAAC,OAAO,UAAU,GAAG,GAAG;AAC1C,iBAAW,QAAQ,OAAO;AACxB,YAAI,QAAQ,UAAU,SAAU;AAChC,gBAAQ,KAAK,IAAI;AAAA,MACnB;AACA,UAAI,QAAQ,UAAU,SAAU;AAAA,IAClC;AAEA,WAAO,QAAQ,IAAI,OAAK,EAAE,IAAI;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,iBAAiB,MAAc,MAA2E;AAC9G,UAAM,WAAW,MAAM,YAAY;AACnC,UAAM,QAAQ,MAAM,KAAK,oBAAoB,MAAM,EAAE,SAAS,CAAC;AAE/D,UAAM,cAAc,MAAM,MAAM,GAAG,KAAK,KAAK,WAAW,CAAC,CAAC;AAC1D,UAAM,eAAe,MAAM,MAAM,KAAK,KAAK,WAAW,CAAC,CAAC;AACxD,UAAM,QAAQ,KAAK,GAAG,iBAAiB,MAAM,IAAI,OAAK,EAAE,EAAE,CAAC;AAE3D,UAAM,eAAe,oBAAI,IAAoB;AAC7C,QAAI,MAAM,gBAAgB,OAAO;AAC/B,iBAAW,QAAQ,MAAM,MAAM,GAAG,EAAE,GAAG;AACrC,cAAM,MAAM,KAAK,gBAAgB,IAAI;AACrC,YAAI,IAAK,cAAa,IAAI,KAAK,IAAI,GAAG;AAAA,MACxC;AAAA,IACF;AAEA,UAAM,OAAO,iBAAiB,IAAI,IAC9B,6EACA;AAEJ,WAAO;AAAA,MACL;AAAA,MAAM;AAAA,MAAa;AAAA,MAAc;AAAA,MAAO;AAAA,MACxC,SAAS,SAAS,YAAY,MAAM,qBAAqB,aAAa,MAAM,0BAA0B,IAAI,IAAI,IAAI;AAAA,IACpH;AAAA,EACF;AAAA,EAEQ,gBAAgB,MAA2B;AACjD,UAAM,cAAU,qCAAuB,KAAK,KAAK,KAAK,aAAa,KAAK,QAAQ,GAAG,KAAK,WAAW;AACnG,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI;AACF,aAAO,GAAG,aAAa,SAAS,MAAM,EAAE,MAAM,IAAI,EAAE,MAAM,KAAK,YAAY,GAAG,KAAK,OAAO,EAAE,KAAK,IAAI;AAAA,IACvG,QAAQ;AAAE,aAAO;AAAA,IAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,MAAM,OAAe,MAAwC;AACjE,UAAM,gBAAgB,MAAM,iBAAiB;AAC7C,UAAM,mBAAmB,MAAM,oBAAoB;AAEnD,UAAM,QAAQ,MAAM,KAAK,oBAAoB,OAAO,IAAI;AAExD,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AAEA,UAAM,QAAkB,CAAC;AACzB,UAAM,QAAQ,KAAK,IAAI,MAAM,QAAQ,aAAa;AAElD,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,UAAU,WAAW,MAAM,gBAAgB;AACjD,YAAM,KAAK,IAAI,KAAK,QAAQ,IAAI,KAAK,SAAS,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI;AAAA;AAAA,EAAa,OAAO;AAAA,OAAU;AAAA,IACzG;AAEA,WAAO,MAAM,KAAK,MAAM;AAAA,EAC1B;AACF;AAQA,SAAS,WAAW,MAAY,SAAyB;AACvD,QAAM,MAAM,KAAK,aAAa,KAAK,aAAa,KAAK;AACrD,SAAO,IAAI,SAAS,UAAU,IAAI,MAAM,GAAG,OAAO,IAAI;AACxD;",
+  "names": []
+}

package/dist/core/file-tree.d.ts

@@ -0,0 +1,15 @@
+/**
+ * File tree builder — constructs a navigable directory tree from flat FileRecord list.
+ */
+import type { FileRecord } from '../types';
+export interface FileTreeNode {
+    name: string;
+    path: string;
+    type: 'file' | 'dir';
+    language?: string;
+    symbolCount?: number;
+    children?: FileTreeNode[];
+}
+export type FileTree = FileTreeNode[];
+export declare function buildFileTree(files: FileRecord[], maxDepth?: number): FileTree;
+//# sourceMappingURL=file-tree.d.ts.map

package/dist/core/file-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-tree.d.ts","sourceRoot":"","sources":["../../src/core/file-tree.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAE3C,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;CAC3B;AAED,MAAM,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;AAEtC,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,QAAQ,CA6C9E"}

package/dist/core/file-tree.js

@@ -0,0 +1,69 @@
+"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 file_tree_exports = {};
+__export(file_tree_exports, {
+  buildFileTree: () => buildFileTree
+});
+module.exports = __toCommonJS(file_tree_exports);
+function buildFileTree(files, maxDepth) {
+  const rootMap = /* @__PURE__ */ new Map();
+  for (const file of files) {
+    const parts = file.path.split("/");
+    let currentMap = rootMap;
+    for (let i = 0; i < parts.length; i++) {
+      if (maxDepth !== void 0 && i >= maxDepth) break;
+      const part = parts[i];
+      const currentPath = parts.slice(0, i + 1).join("/");
+      const isLast = i === parts.length - 1;
+      if (!currentMap.has(part)) {
+        if (isLast) {
+          currentMap.set(part, {
+            name: part,
+            path: currentPath,
+            type: "file",
+            language: file.language,
+            symbolCount: file.symbolCount
+          });
+        } else {
+          const dir = { name: part, path: currentPath, type: "dir", children: [], _childMap: /* @__PURE__ */ new Map() };
+          currentMap.set(part, dir);
+        }
+      }
+      if (!isLast) {
+        const dir = currentMap.get(part);
+        currentMap = dir._childMap;
+      }
+    }
+  }
+  function toTree(map) {
+    return [...map.values()].map((n) => {
+      if (n.type === "dir") {
+        const dir = n;
+        return { name: dir.name, path: dir.path, type: "dir", children: toTree(dir._childMap) };
+      }
+      return n;
+    });
+  }
+  return toTree(rootMap);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  buildFileTree
+});
+//# sourceMappingURL=file-tree.js.map

package/dist/core/file-tree.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/core/file-tree.ts"],
+  "sourcesContent": ["/**\n * File tree builder \u2014 constructs a navigable directory tree from flat FileRecord list.\n */\n\nimport type { FileRecord } from '../types';\n\nexport interface FileTreeNode {\n  name: string;\n  path: string;\n  type: 'file' | 'dir';\n  language?: string;\n  symbolCount?: number;\n  children?: FileTreeNode[];\n}\n\nexport type FileTree = FileTreeNode[];\n\nexport function buildFileTree(files: FileRecord[], maxDepth?: number): FileTree {\n  interface DirNode extends FileTreeNode { _childMap: Map<string, DirNode | FileTreeNode> }\n\n  const rootMap = new Map<string, DirNode | FileTreeNode>();\n\n  for (const file of files) {\n    const parts = file.path.split('/');\n    let currentMap = rootMap;\n\n    for (let i = 0; i < parts.length; i++) {\n      if (maxDepth !== undefined && i >= maxDepth) break;\n      const part = parts[i];\n      const currentPath = parts.slice(0, i + 1).join('/');\n      const isLast = i === parts.length - 1;\n\n      if (!currentMap.has(part)) {\n        if (isLast) {\n          currentMap.set(part, {\n            name: part, path: currentPath, type: 'file',\n            language: file.language, symbolCount: file.symbolCount,\n          });\n        } else {\n          const dir: DirNode = { name: part, path: currentPath, type: 'dir', children: [], _childMap: new Map() };\n          currentMap.set(part, dir);\n        }\n      }\n\n      if (!isLast) {\n        const dir = currentMap.get(part) as DirNode;\n        currentMap = dir._childMap;\n      }\n    }\n  }\n\n  function toTree(map: Map<string, DirNode | FileTreeNode>): FileTreeNode[] {\n    return [...map.values()].map(n => {\n      if (n.type === 'dir') {\n        const dir = n as DirNode;\n        return { name: dir.name, path: dir.path, type: 'dir' as const, children: toTree(dir._childMap) };\n      }\n      return n;\n    });\n  }\n\n  return toTree(rootMap);\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAiBO,SAAS,cAAc,OAAqB,UAA6B;AAG9E,QAAM,UAAU,oBAAI,IAAoC;AAExD,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,KAAK,MAAM,GAAG;AACjC,QAAI,aAAa;AAEjB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAI,aAAa,UAAa,KAAK,SAAU;AAC7C,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,cAAc,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,GAAG;AAClD,YAAM,SAAS,MAAM,MAAM,SAAS;AAEpC,UAAI,CAAC,WAAW,IAAI,IAAI,GAAG;AACzB,YAAI,QAAQ;AACV,qBAAW,IAAI,MAAM;AAAA,YACnB,MAAM;AAAA,YAAM,MAAM;AAAA,YAAa,MAAM;AAAA,YACrC,UAAU,KAAK;AAAA,YAAU,aAAa,KAAK;AAAA,UAC7C,CAAC;AAAA,QACH,OAAO;AACL,gBAAM,MAAe,EAAE,MAAM,MAAM,MAAM,aAAa,MAAM,OAAO,UAAU,CAAC,GAAG,WAAW,oBAAI,IAAI,EAAE;AACtG,qBAAW,IAAI,MAAM,GAAG;AAAA,QAC1B;AAAA,MACF;AAEA,UAAI,CAAC,QAAQ;AACX,cAAM,MAAM,WAAW,IAAI,IAAI;AAC/B,qBAAa,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAEA,WAAS,OAAO,KAA0D;AACxE,WAAO,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,IAAI,OAAK;AAChC,UAAI,EAAE,SAAS,OAAO;AACpB,cAAM,MAAM;AACZ,eAAO,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,MAAM,MAAM,OAAgB,UAAU,OAAO,IAAI,SAAS,EAAE;AAAA,MACjG;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,SAAO,OAAO,OAAO;AACvB;",
+  "names": []
+}

package/dist/core/lock-manager.d.ts

@@ -0,0 +1,20 @@
+/**
+ * LockManager — file-based process lock + dirty marker.
+ *
+ * The lock prevents concurrent indexing runs (even from separate processes).
+ * The dirty marker is a lightweight signal written on file-save hooks and
+ * consumed by sync-if-dirty to trigger deferred incremental syncs.
+ */
+export declare class LockManager {
+    private readonly projectRoot;
+    private readonly lockPath;
+    private readonly dirtyPath;
+    constructor(projectRoot: string);
+    acquire(): void;
+    release(): void;
+    forceRelease(): void;
+    markDirty(): void;
+    clearDirty(): void;
+    isDirty(): boolean;
+}
+//# sourceMappingURL=lock-manager.d.ts.map

package/dist/core/lock-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lock-manager.d.ts","sourceRoot":"","sources":["../../src/core/lock-manager.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAUH,qBAAa,WAAW;IAIV,OAAO,CAAC,QAAQ,CAAC,WAAW;IAHxC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEN,WAAW,EAAE,MAAM;IAQhD,OAAO,IAAI,IAAI;IA4Bf,OAAO,IAAI,IAAI;IAIf,YAAY,IAAI,IAAI;IAMpB,SAAS,IAAI,IAAI;IAIjB,UAAU,IAAI,IAAI;IAIlB,OAAO,IAAI,OAAO;CAGnB"}

package/dist/core/lock-manager.js

@@ -0,0 +1,120 @@
+"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 __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 __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 __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var lock_manager_exports = {};
+__export(lock_manager_exports, {
+  LockManager: () => LockManager
+});
+module.exports = __toCommonJS(lock_manager_exports);
+var fs = __toESM(require("fs"));
+var path = __toESM(require("path"));
+const KIROGRAPH_DIR = ".kirograph";
+const LOCK_FILE = "kirograph.lock";
+const DIRTY_FILE = "dirty";
+const LOCK_STALE_MS = 5 * 60 * 1e3;
+class LockManager {
+  constructor(projectRoot) {
+    this.projectRoot = projectRoot;
+    const dir = path.join(projectRoot, KIROGRAPH_DIR);
+    this.lockPath = path.join(dir, LOCK_FILE);
+    this.dirtyPath = path.join(dir, DIRTY_FILE);
+  }
+  // ── Process lock ───────────────────────────────────────────────────────────
+  acquire() {
+    if (fs.existsSync(this.lockPath)) {
+      try {
+        const content = fs.readFileSync(this.lockPath, "utf8").trim();
+        const [pidStr, tsStr] = content.split(":");
+        const pid = parseInt(pidStr, 10);
+        const ts = parseInt(tsStr, 10);
+        if (!isNaN(pid) && pid !== process.pid) {
+          const isStale = !isNaN(ts) && Date.now() - ts > LOCK_STALE_MS;
+          if (!isStale) {
+            try {
+              process.kill(pid, 0);
+              throw new Error(`KiroGraph is locked by PID ${pid}. Use 'kirograph unlock' to force-release.`);
+            } catch (e) {
+              if (e.message.includes("KiroGraph is locked")) throw e;
+            }
+          }
+        }
+      } catch (e) {
+        if (e.message.includes("KiroGraph is locked")) throw e;
+      }
+    }
+    fs.writeFileSync(this.lockPath, `${process.pid}:${Date.now()}`);
+  }
+  release() {
+    try {
+      fs.unlinkSync(this.lockPath);
+    } catch {
+    }
+  }
+  forceRelease() {
+    this.release();
+  }
+  // ── Dirty marker ───────────────────────────────────────────────────────────
+  markDirty() {
+    fs.writeFileSync(this.dirtyPath, String(Date.now()));
+  }
+  clearDirty() {
+    try {
+      fs.unlinkSync(this.dirtyPath);
+    } catch {
+    }
+  }
+  isDirty() {
+    return fs.existsSync(this.dirtyPath);
+  }
+  /** Returns true if a sync/index is currently running (lock file held by another process). */
+  isLocked() {
+    if (!fs.existsSync(this.lockPath)) return false;
+    try {
+      const content = fs.readFileSync(this.lockPath, "utf8").trim();
+      const [pidStr, tsStr] = content.split(":");
+      const pid = parseInt(pidStr, 10);
+      const ts = parseInt(tsStr, 10);
+      if (isNaN(pid) || pid === process.pid) return false;
+      const isStale = !isNaN(ts) && Date.now() - ts > LOCK_STALE_MS;
+      if (isStale) return false;
+      try {
+        process.kill(pid, 0);
+        return true;
+      } catch {
+        return false;
+      }
+    } catch {
+      return false;
+    }
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  LockManager
+});
+//# sourceMappingURL=lock-manager.js.map

package/dist/core/lock-manager.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/core/lock-manager.ts"],
+  "sourcesContent": ["/**\n * LockManager \u2014 file-based process lock + dirty marker.\n *\n * The lock prevents concurrent indexing runs (even from separate processes).\n * The dirty marker is a lightweight signal written on file-save hooks and\n * consumed by sync-if-dirty to trigger deferred incremental syncs.\n */\n\nimport * as fs from 'fs';\nimport * as path from 'path';\n\nconst KIROGRAPH_DIR = '.kirograph';\nconst LOCK_FILE = 'kirograph.lock';\nconst DIRTY_FILE = 'dirty';\nconst LOCK_STALE_MS = 5 * 60 * 1000; // 5 minutes\n\nexport class LockManager {\n  private readonly lockPath: string;\n  private readonly dirtyPath: string;\n\n  constructor(private readonly projectRoot: string) {\n    const dir = path.join(projectRoot, KIROGRAPH_DIR);\n    this.lockPath = path.join(dir, LOCK_FILE);\n    this.dirtyPath = path.join(dir, DIRTY_FILE);\n  }\n\n  // \u2500\u2500 Process lock \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  acquire(): void {\n    if (fs.existsSync(this.lockPath)) {\n      try {\n        const content = fs.readFileSync(this.lockPath, 'utf8').trim();\n        const [pidStr, tsStr] = content.split(':');\n        const pid = parseInt(pidStr, 10);\n        const ts = parseInt(tsStr, 10);\n\n        if (!isNaN(pid) && pid !== process.pid) {\n          const isStale = !isNaN(ts) && Date.now() - ts > LOCK_STALE_MS;\n          if (!isStale) {\n            try {\n              process.kill(pid, 0);\n              throw new Error(`KiroGraph is locked by PID ${pid}. Use 'kirograph unlock' to force-release.`);\n            } catch (e: any) {\n              if (e.message.includes('KiroGraph is locked')) throw e;\n              // Process not found \u2014 stale lock, override it\n            }\n          }\n        }\n      } catch (e: any) {\n        if (e.message.includes('KiroGraph is locked')) throw e;\n        // Could not read lock file \u2014 override\n      }\n    }\n    fs.writeFileSync(this.lockPath, `${process.pid}:${Date.now()}`);\n  }\n\n  release(): void {\n    try { fs.unlinkSync(this.lockPath); } catch { /* ignore */ }\n  }\n\n  forceRelease(): void {\n    this.release();\n  }\n\n  // \u2500\u2500 Dirty marker \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  markDirty(): void {\n    fs.writeFileSync(this.dirtyPath, String(Date.now()));\n  }\n\n  clearDirty(): void {\n    try { fs.unlinkSync(this.dirtyPath); } catch { /* ignore */ }\n  }\n\n  isDirty(): boolean {\n    return fs.existsSync(this.dirtyPath);\n  }\n\n  /** Returns true if a sync/index is currently running (lock file held by another process). */\n  isLocked(): boolean {\n    if (!fs.existsSync(this.lockPath)) return false;\n    try {\n      const content = fs.readFileSync(this.lockPath, 'utf8').trim();\n      const [pidStr, tsStr] = content.split(':');\n      const pid = parseInt(pidStr, 10);\n      const ts = parseInt(tsStr, 10);\n      if (isNaN(pid) || pid === process.pid) return false;\n      const isStale = !isNaN(ts) && Date.now() - ts > LOCK_STALE_MS;\n      if (isStale) return false;\n      try { process.kill(pid, 0); return true; } catch { return false; }\n    } catch { return false; }\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAQA,SAAoB;AACpB,WAAsB;AAEtB,MAAM,gBAAgB;AACtB,MAAM,YAAY;AAClB,MAAM,aAAa;AACnB,MAAM,gBAAgB,IAAI,KAAK;AAExB,MAAM,YAAY;AAAA,EAIvB,YAA6B,aAAqB;AAArB;AAC3B,UAAM,MAAM,KAAK,KAAK,aAAa,aAAa;AAChD,SAAK,WAAW,KAAK,KAAK,KAAK,SAAS;AACxC,SAAK,YAAY,KAAK,KAAK,KAAK,UAAU;AAAA,EAC5C;AAAA;AAAA,EAIA,UAAgB;AACd,QAAI,GAAG,WAAW,KAAK,QAAQ,GAAG;AAChC,UAAI;AACF,cAAM,UAAU,GAAG,aAAa,KAAK,UAAU,MAAM,EAAE,KAAK;AAC5D,cAAM,CAAC,QAAQ,KAAK,IAAI,QAAQ,MAAM,GAAG;AACzC,cAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,cAAM,KAAK,SAAS,OAAO,EAAE;AAE7B,YAAI,CAAC,MAAM,GAAG,KAAK,QAAQ,QAAQ,KAAK;AACtC,gBAAM,UAAU,CAAC,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,KAAK;AAChD,cAAI,CAAC,SAAS;AACZ,gBAAI;AACF,sBAAQ,KAAK,KAAK,CAAC;AACnB,oBAAM,IAAI,MAAM,8BAA8B,GAAG,4CAA4C;AAAA,YAC/F,SAAS,GAAQ;AACf,kBAAI,EAAE,QAAQ,SAAS,qBAAqB,EAAG,OAAM;AAAA,YAEvD;AAAA,UACF;AAAA,QACF;AAAA,MACF,SAAS,GAAQ;AACf,YAAI,EAAE,QAAQ,SAAS,qBAAqB,EAAG,OAAM;AAAA,MAEvD;AAAA,IACF;AACA,OAAG,cAAc,KAAK,UAAU,GAAG,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC,EAAE;AAAA,EAChE;AAAA,EAEA,UAAgB;AACd,QAAI;AAAE,SAAG,WAAW,KAAK,QAAQ;AAAA,IAAG,QAAQ;AAAA,IAAe;AAAA,EAC7D;AAAA,EAEA,eAAqB;AACnB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA,EAIA,YAAkB;AAChB,OAAG,cAAc,KAAK,WAAW,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,EACrD;AAAA,EAEA,aAAmB;AACjB,QAAI;AAAE,SAAG,WAAW,KAAK,SAAS;AAAA,IAAG,QAAQ;AAAA,IAAe;AAAA,EAC9D;AAAA,EAEA,UAAmB;AACjB,WAAO,GAAG,WAAW,KAAK,SAAS;AAAA,EACrC;AAAA;AAAA,EAGA,WAAoB;AAClB,QAAI,CAAC,GAAG,WAAW,KAAK,QAAQ,EAAG,QAAO;AAC1C,QAAI;AACF,YAAM,UAAU,GAAG,aAAa,KAAK,UAAU,MAAM,EAAE,KAAK;AAC5D,YAAM,CAAC,QAAQ,KAAK,IAAI,QAAQ,MAAM,GAAG;AACzC,YAAM,MAAM,SAAS,QAAQ,EAAE;AAC/B,YAAM,KAAK,SAAS,OAAO,EAAE;AAC7B,UAAI,MAAM,GAAG,KAAK,QAAQ,QAAQ,IAAK,QAAO;AAC9C,YAAM,UAAU,CAAC,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,KAAK;AAChD,UAAI,QAAS,QAAO;AACpB,UAAI;AAAE,gBAAQ,KAAK,KAAK,CAAC;AAAG,eAAO;AAAA,MAAM,QAAQ;AAAE,eAAO;AAAA,MAAO;AAAA,IACnE,QAAQ;AAAE,aAAO;AAAA,IAAO;AAAA,EAC1B;AACF;",
+  "names": []
+}

package/dist/core/pipeline.d.ts

@@ -0,0 +1,37 @@
+/**
+ * IndexPipeline — full-index and incremental-sync pipelines.
+ *
+ * Owns the two heavy workflows:
+ *   - indexAll(): scan all files, extract, store, resolve, detect frameworks,
+ *                 generate embeddings, analyze architecture.
+ *   - sync():     detect changed files via git (or full scan fallback),
+ *                 re-extract only what changed, then run the same tail pipeline.
+ *
+ * Everything that touches the filesystem or sub-systems is injected via the
+ * constructor, keeping this class testable and free of global state.
+ */
+import { GraphDatabase } from '../db/database';
+import { ReferenceResolver } from '../resolution/index';
+import { VectorManager } from '../vectors/index';
+import { ArchitectureAnalyzer } from '../architecture/index';
+import type { KiroGraphConfig } from '../config';
+import type { IndexResult, IndexProgress, SyncResult } from '../types';
+import { LockManager } from './lock-manager';
+export declare class IndexPipeline {
+    private readonly db;
+    private readonly vectors;
+    private readonly resolver;
+    private readonly arch;
+    private readonly lock;
+    private readonly config;
+    private readonly projectRoot;
+    private readonly mutex;
+    constructor(db: GraphDatabase, vectors: VectorManager, resolver: ReferenceResolver, arch: ArchitectureAnalyzer, lock: LockManager, config: KiroGraphConfig, projectRoot: string);
+    indexAll(opts?: {
+        onProgress?: (p: IndexProgress) => void;
+        force?: boolean;
+        signal?: AbortSignal;
+    }): Promise<IndexResult>;
+    sync(changedFiles?: string[]): Promise<SyncResult>;
+}
+//# sourceMappingURL=pipeline.d.ts.map

package/dist/core/pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../src/core/pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAI/C,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACvE,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAK7C,qBAAa,aAAa;IAItB,OAAO,CAAC,QAAQ,CAAC,EAAE;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAT9B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAe;gBAGlB,EAAE,EAAE,aAAa,EACjB,OAAO,EAAE,aAAa,EACtB,QAAQ,EAAE,iBAAiB,EAC3B,IAAI,EAAE,oBAAoB,EAC1B,IAAI,EAAE,WAAW,EACjB,MAAM,EAAE,eAAe,EACvB,WAAW,EAAE,MAAM;IAGhC,QAAQ,CAAC,IAAI,CAAC,EAAE;QACpB,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,KAAK,IAAI,CAAC;QACxC,KAAK,CAAC,EAAE,OAAO,CAAC;QAChB,MAAM,CAAC,EAAE,WAAW,CAAC;KACtB,GAAG,OAAO,CAAC,WAAW,CAAC;IA6GlB,IAAI,CAAC,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC;CAuGzD"}