ai-mind-map 1.6.0 → 1.6.2

package/dist/knowledge-graph/graph.js

@@ -12,109 +12,109 @@ import Database from 'better-sqlite3';
 // ============================================================
 // Schema SQL
 // ============================================================
-const SCHEMA_SQL = `
--- Core nodes table
-CREATE TABLE IF NOT EXISTS nodes (
-  id TEXT PRIMARY KEY,
-  type TEXT NOT NULL,
-  name TEXT NOT NULL,
-  qualifiedName TEXT NOT NULL,
-  filePath TEXT NOT NULL,
-  startLine INTEGER NOT NULL,
-  endLine INTEGER NOT NULL,
-  signature TEXT NOT NULL DEFAULT '',
-  docComment TEXT,
-  hash TEXT NOT NULL,
-  language TEXT NOT NULL,
-  visibility TEXT NOT NULL DEFAULT 'unknown',
-  isAsync INTEGER NOT NULL DEFAULT 0,
-  isStatic INTEGER NOT NULL DEFAULT 0,
-  isExported INTEGER NOT NULL DEFAULT 0,
-  parameters TEXT,
-  returnType TEXT,
-  updatedAt INTEGER NOT NULL
-);
-
--- Edges table with composite primary key
-CREATE TABLE IF NOT EXISTS edges (
-  sourceId TEXT NOT NULL,
-  targetId TEXT NOT NULL,
-  type TEXT NOT NULL,
-  metadata TEXT,
-  PRIMARY KEY (sourceId, targetId, type)
-);
-
--- Indexes for common queries
-CREATE INDEX IF NOT EXISTS idx_nodes_filePath ON nodes(filePath);
-CREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);
-CREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);
-CREATE INDEX IF NOT EXISTS idx_nodes_language ON nodes(language);
-CREATE INDEX IF NOT EXISTS idx_nodes_hash ON nodes(hash);
-CREATE INDEX IF NOT EXISTS idx_edges_sourceId ON edges(sourceId);
-CREATE INDEX IF NOT EXISTS idx_edges_targetId ON edges(targetId);
-CREATE INDEX IF NOT EXISTS idx_edges_type ON edges(type);
-
--- FTS5 virtual table for full-text search across names, signatures, and doc comments
-CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
-  id UNINDEXED,
-  name,
-  qualifiedName,
-  signature,
-  docComment,
-  content='nodes',
-  content_rowid='rowid',
-  tokenize='porter unicode61'
-);
-
--- Triggers to keep FTS in sync with nodes table
-CREATE TRIGGER IF NOT EXISTS nodes_ai AFTER INSERT ON nodes BEGIN
-  INSERT INTO nodes_fts(rowid, id, name, qualifiedName, signature, docComment)
-  VALUES (new.rowid, new.id, new.name, new.qualifiedName, new.signature, new.docComment);
-END;
-
-CREATE TRIGGER IF NOT EXISTS nodes_ad AFTER DELETE ON nodes BEGIN
-  INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualifiedName, signature, docComment)
-  VALUES ('delete', old.rowid, old.id, old.name, old.qualifiedName, old.signature, old.docComment);
-END;
-
-CREATE TRIGGER IF NOT EXISTS nodes_au AFTER UPDATE ON nodes BEGIN
-  INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualifiedName, signature, docComment)
-  VALUES ('delete', old.rowid, old.id, old.name, old.qualifiedName, old.signature, old.docComment);
-  INSERT INTO nodes_fts(rowid, id, name, qualifiedName, signature, docComment)
-  VALUES (new.rowid, new.id, new.name, new.qualifiedName, new.signature, new.docComment);
-END;
-
--- Metadata table for tracking schema version and stats
-CREATE TABLE IF NOT EXISTS graph_meta (
-  key TEXT PRIMARY KEY,
-  value TEXT NOT NULL
-);
-
--- Learned rules: AI-taught patterns that persist per-project
-CREATE TABLE IF NOT EXISTS learned_rules (
-  id TEXT PRIMARY KEY,
-  type TEXT NOT NULL,          -- 'classification' | 'search_alias' | 'code_pattern' | 'convention'
-  name TEXT NOT NULL,
-  description TEXT NOT NULL,
-  rule TEXT NOT NULL,           -- JSON: the actual rule definition
-  created_at INTEGER NOT NULL,
-  updated_at INTEGER NOT NULL,
-  used_count INTEGER NOT NULL DEFAULT 0,
-  last_used_at INTEGER,
-  created_by TEXT NOT NULL DEFAULT 'ai'
-);
-
-CREATE INDEX IF NOT EXISTS idx_learned_rules_type ON learned_rules(type);
-CREATE INDEX IF NOT EXISTS idx_learned_rules_name ON learned_rules(name);
-
--- File index for fast staleness detection via mtime
-CREATE TABLE IF NOT EXISTS file_index (
-  file_path TEXT PRIMARY KEY,
-  mtime_ms REAL NOT NULL,
-  size_bytes INTEGER NOT NULL,
-  content_hash TEXT NOT NULL,
-  indexed_at INTEGER NOT NULL
-);
+const SCHEMA_SQL = `
+-- Core nodes table
+CREATE TABLE IF NOT EXISTS nodes (
+  id TEXT PRIMARY KEY,
+  type TEXT NOT NULL,
+  name TEXT NOT NULL,
+  qualifiedName TEXT NOT NULL,
+  filePath TEXT NOT NULL,
+  startLine INTEGER NOT NULL,
+  endLine INTEGER NOT NULL,
+  signature TEXT NOT NULL DEFAULT '',
+  docComment TEXT,
+  hash TEXT NOT NULL,
+  language TEXT NOT NULL,
+  visibility TEXT NOT NULL DEFAULT 'unknown',
+  isAsync INTEGER NOT NULL DEFAULT 0,
+  isStatic INTEGER NOT NULL DEFAULT 0,
+  isExported INTEGER NOT NULL DEFAULT 0,
+  parameters TEXT,
+  returnType TEXT,
+  updatedAt INTEGER NOT NULL
+);
+
+-- Edges table with composite primary key
+CREATE TABLE IF NOT EXISTS edges (
+  sourceId TEXT NOT NULL,
+  targetId TEXT NOT NULL,
+  type TEXT NOT NULL,
+  metadata TEXT,
+  PRIMARY KEY (sourceId, targetId, type)
+);
+
+-- Indexes for common queries
+CREATE INDEX IF NOT EXISTS idx_nodes_filePath ON nodes(filePath);
+CREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);
+CREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);
+CREATE INDEX IF NOT EXISTS idx_nodes_language ON nodes(language);
+CREATE INDEX IF NOT EXISTS idx_nodes_hash ON nodes(hash);
+CREATE INDEX IF NOT EXISTS idx_edges_sourceId ON edges(sourceId);
+CREATE INDEX IF NOT EXISTS idx_edges_targetId ON edges(targetId);
+CREATE INDEX IF NOT EXISTS idx_edges_type ON edges(type);
+
+-- FTS5 virtual table for full-text search across names, signatures, and doc comments
+CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
+  id UNINDEXED,
+  name,
+  qualifiedName,
+  signature,
+  docComment,
+  content='nodes',
+  content_rowid='rowid',
+  tokenize='porter unicode61'
+);
+
+-- Triggers to keep FTS in sync with nodes table
+CREATE TRIGGER IF NOT EXISTS nodes_ai AFTER INSERT ON nodes BEGIN
+  INSERT INTO nodes_fts(rowid, id, name, qualifiedName, signature, docComment)
+  VALUES (new.rowid, new.id, new.name, new.qualifiedName, new.signature, new.docComment);
+END;
+
+CREATE TRIGGER IF NOT EXISTS nodes_ad AFTER DELETE ON nodes BEGIN
+  INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualifiedName, signature, docComment)
+  VALUES ('delete', old.rowid, old.id, old.name, old.qualifiedName, old.signature, old.docComment);
+END;
+
+CREATE TRIGGER IF NOT EXISTS nodes_au AFTER UPDATE ON nodes BEGIN
+  INSERT INTO nodes_fts(nodes_fts, rowid, id, name, qualifiedName, signature, docComment)
+  VALUES ('delete', old.rowid, old.id, old.name, old.qualifiedName, old.signature, old.docComment);
+  INSERT INTO nodes_fts(rowid, id, name, qualifiedName, signature, docComment)
+  VALUES (new.rowid, new.id, new.name, new.qualifiedName, new.signature, new.docComment);
+END;
+
+-- Metadata table for tracking schema version and stats
+CREATE TABLE IF NOT EXISTS graph_meta (
+  key TEXT PRIMARY KEY,
+  value TEXT NOT NULL
+);
+
+-- Learned rules: AI-taught patterns that persist per-project
+CREATE TABLE IF NOT EXISTS learned_rules (
+  id TEXT PRIMARY KEY,
+  type TEXT NOT NULL,          -- 'classification' | 'search_alias' | 'code_pattern' | 'convention'
+  name TEXT NOT NULL,
+  description TEXT NOT NULL,
+  rule TEXT NOT NULL,           -- JSON: the actual rule definition
+  created_at INTEGER NOT NULL,
+  updated_at INTEGER NOT NULL,
+  used_count INTEGER NOT NULL DEFAULT 0,
+  last_used_at INTEGER,
+  created_by TEXT NOT NULL DEFAULT 'ai'
+);
+
+CREATE INDEX IF NOT EXISTS idx_learned_rules_type ON learned_rules(type);
+CREATE INDEX IF NOT EXISTS idx_learned_rules_name ON learned_rules(name);
+
+-- File index for fast staleness detection via mtime
+CREATE TABLE IF NOT EXISTS file_index (
+  file_path TEXT PRIMARY KEY,
+  mtime_ms REAL NOT NULL,
+  size_bytes INTEGER NOT NULL,
+  content_hash TEXT NOT NULL,
+  indexed_at INTEGER NOT NULL
+);
 `;
 const SCHEMA_VERSION = '4';
 // ============================================================
@@ -270,16 +270,16 @@ export class KnowledgeGraph {
      * Insert or update a single node.
      */
     upsertNode(node) {
-        this.db.prepare(`
-      INSERT OR REPLACE INTO nodes (
-        id, type, name, qualifiedName, filePath, startLine, endLine,
-        signature, docComment, hash, language, visibility,
-        isAsync, isStatic, isExported, parameters, returnType, updatedAt
-      ) VALUES (
-        @id, @type, @name, @qualifiedName, @filePath, @startLine, @endLine,
-        @signature, @docComment, @hash, @language, @visibility,
-        @isAsync, @isStatic, @isExported, @parameters, @returnType, @updatedAt
-      )
+        this.db.prepare(`
+      INSERT OR REPLACE INTO nodes (
+        id, type, name, qualifiedName, filePath, startLine, endLine,
+        signature, docComment, hash, language, visibility,
+        isAsync, isStatic, isExported, parameters, returnType, updatedAt
+      ) VALUES (
+        @id, @type, @name, @qualifiedName, @filePath, @startLine, @endLine,
+        @signature, @docComment, @hash, @language, @visibility,
+        @isAsync, @isStatic, @isExported, @parameters, @returnType, @updatedAt
+      )
     `).run({
             id: node.id,
             type: node.type,
@@ -307,16 +307,16 @@ export class KnowledgeGraph {
     upsertNodes(nodes) {
         if (nodes.length === 0)
             return;
-        const insertStmt = this.db.prepare(`
-      INSERT OR REPLACE INTO nodes (
-        id, type, name, qualifiedName, filePath, startLine, endLine,
-        signature, docComment, hash, language, visibility,
-        isAsync, isStatic, isExported, parameters, returnType, updatedAt
-      ) VALUES (
-        @id, @type, @name, @qualifiedName, @filePath, @startLine, @endLine,
-        @signature, @docComment, @hash, @language, @visibility,
-        @isAsync, @isStatic, @isExported, @parameters, @returnType, @updatedAt
-      )
+        const insertStmt = this.db.prepare(`
+      INSERT OR REPLACE INTO nodes (
+        id, type, name, qualifiedName, filePath, startLine, endLine,
+        signature, docComment, hash, language, visibility,
+        isAsync, isStatic, isExported, parameters, returnType, updatedAt
+      ) VALUES (
+        @id, @type, @name, @qualifiedName, @filePath, @startLine, @endLine,
+        @signature, @docComment, @hash, @language, @visibility,
+        @isAsync, @isStatic, @isExported, @parameters, @returnType, @updatedAt
+      )
     `);
         const transaction = this.db.transaction((items) => {
             for (const node of items) {
@@ -408,9 +408,9 @@ export class KnowledgeGraph {
      * Insert or update a single edge.
      */
     upsertEdge(edge) {
-        this.db.prepare(`
-      INSERT OR REPLACE INTO edges (sourceId, targetId, type, metadata)
-      VALUES (@sourceId, @targetId, @type, @metadata)
+        this.db.prepare(`
+      INSERT OR REPLACE INTO edges (sourceId, targetId, type, metadata)
+      VALUES (@sourceId, @targetId, @type, @metadata)
     `).run({
             sourceId: edge.sourceId,
             targetId: edge.targetId,
@@ -424,9 +424,9 @@ export class KnowledgeGraph {
     upsertEdges(edges) {
         if (edges.length === 0)
             return;
-        const insertStmt = this.db.prepare(`
-      INSERT OR REPLACE INTO edges (sourceId, targetId, type, metadata)
-      VALUES (@sourceId, @targetId, @type, @metadata)
+        const insertStmt = this.db.prepare(`
+      INSERT OR REPLACE INTO edges (sourceId, targetId, type, metadata)
+      VALUES (@sourceId, @targetId, @type, @metadata)
     `);
         const transaction = this.db.transaction((items) => {
             for (const edge of items) {
@@ -506,10 +506,10 @@ export class KnowledgeGraph {
      * Find all nodes that call a given node (callers / "who calls this?").
      */
     findCallers(nodeId) {
-        const rows = this.db.prepare(`
-      SELECT n.* FROM nodes n
-      JOIN edges e ON n.id = e.sourceId
-      WHERE e.targetId = ? AND e.type = 'calls'
+        const rows = this.db.prepare(`
+      SELECT n.* FROM nodes n
+      JOIN edges e ON n.id = e.sourceId
+      WHERE e.targetId = ? AND e.type = 'calls'
     `).all(nodeId);
         return rows.map((r) => this.rowToNode(r));
     }
@@ -517,10 +517,10 @@ export class KnowledgeGraph {
      * Find all nodes that a given node calls (callees / "what does this call?").
      */
     findCallees(nodeId) {
-        const rows = this.db.prepare(`
-      SELECT n.* FROM nodes n
-      JOIN edges e ON n.id = e.targetId
-      WHERE e.sourceId = ? AND e.type = 'calls'
+        const rows = this.db.prepare(`
+      SELECT n.* FROM nodes n
+      JOIN edges e ON n.id = e.targetId
+      WHERE e.sourceId = ? AND e.type = 'calls'
     `).all(nodeId);
         return rows.map((r) => this.rowToNode(r));
     }
@@ -539,9 +539,9 @@ export class KnowledgeGraph {
             if (current.depth >= maxDepth || visited.has(current.id))
                 continue;
             visited.add(current.id);
-            const parentEdges = this.db.prepare(`
-        SELECT e.targetId FROM edges e
-        WHERE e.sourceId = ? AND e.type IN ('inherits', 'implements', 'contains')
+            const parentEdges = this.db.prepare(`
+        SELECT e.targetId FROM edges e
+        WHERE e.sourceId = ? AND e.type IN ('inherits', 'implements', 'contains')
       `).all(current.id);
             for (const { targetId } of parentEdges) {
                 if (!visited.has(targetId)) {
@@ -570,9 +570,9 @@ export class KnowledgeGraph {
             if (current.depth >= maxDepth || visited.has(current.id))
                 continue;
             visited.add(current.id);
-            const childEdges = this.db.prepare(`
-        SELECT e.sourceId FROM edges e
-        WHERE e.targetId = ? AND e.type IN ('inherits', 'implements', 'contains')
+            const childEdges = this.db.prepare(`
+        SELECT e.sourceId FROM edges e
+        WHERE e.targetId = ? AND e.type IN ('inherits', 'implements', 'contains')
       `).all(current.id);
             for (const { sourceId } of childEdges) {
                 if (!visited.has(sourceId)) {
@@ -607,9 +607,9 @@ export class KnowledgeGraph {
                 continue;
             visited.add(current.id);
             // Find nodes that depend ON this node (reverse dependency)
-            const dependents = this.db.prepare(`
-        SELECT e.sourceId FROM edges e
-        WHERE e.targetId = ? AND e.type IN (${typeFilter})
+            const dependents = this.db.prepare(`
+        SELECT e.sourceId FROM edges e
+        WHERE e.targetId = ? AND e.type IN (${typeFilter})
       `).all(current.id);
             for (const { sourceId } of dependents) {
                 if (!visited.has(sourceId)) {
@@ -647,38 +647,38 @@ export class KnowledgeGraph {
         try {
             // Use FTS5 bm25() for proper information-retrieval ranking
             // bm25 weights: name(10), qualifiedName(5), signature(3), docComment(1)
-            const rows = this.db.prepare(`
-        SELECT * FROM (
-          SELECT n.*, bm25(nodes_fts, 10, 5, 3, 1) AS bm25_score,
-          CASE
-            WHEN n.name = @query THEN 0
-            WHEN n.name LIKE @like THEN 1
-            WHEN n.qualifiedName LIKE @like THEN 2
-            ELSE 3
-          END AS exact_bonus
-          FROM nodes_fts fts
-          JOIN nodes n ON fts.id = n.id
-          WHERE nodes_fts MATCH @fts
-
-          UNION
-
-          SELECT n.*, 0 AS bm25_score,
-          CASE
-            WHEN n.name = @query THEN 0
-            WHEN n.name LIKE @like THEN 1
-            WHEN n.qualifiedName LIKE @like THEN 2
-            WHEN n.signature LIKE @like THEN 3
-            ELSE 4
-          END AS exact_bonus
-          FROM nodes n
-          WHERE n.name LIKE @like
-            OR n.qualifiedName LIKE @like
-            OR n.signature LIKE @like
-            OR n.docComment LIKE @like
-        )
-        GROUP BY id
-        ORDER BY MIN(exact_bonus), MIN(bm25_score), name
-        LIMIT @limit
+            const rows = this.db.prepare(`
+        SELECT * FROM (
+          SELECT n.*, bm25(nodes_fts, 10, 5, 3, 1) AS bm25_score,
+          CASE
+            WHEN n.name = @query THEN 0
+            WHEN n.name LIKE @like THEN 1
+            WHEN n.qualifiedName LIKE @like THEN 2
+            ELSE 3
+          END AS exact_bonus
+          FROM nodes_fts fts
+          JOIN nodes n ON fts.id = n.id
+          WHERE nodes_fts MATCH @fts
+
+          UNION
+
+          SELECT n.*, 0 AS bm25_score,
+          CASE
+            WHEN n.name = @query THEN 0
+            WHEN n.name LIKE @like THEN 1
+            WHEN n.qualifiedName LIKE @like THEN 2
+            WHEN n.signature LIKE @like THEN 3
+            ELSE 4
+          END AS exact_bonus
+          FROM nodes n
+          WHERE n.name LIKE @like
+            OR n.qualifiedName LIKE @like
+            OR n.signature LIKE @like
+            OR n.docComment LIKE @like
+        )
+        GROUP BY id
+        ORDER BY MIN(exact_bonus), MIN(bm25_score), name
+        LIMIT @limit
       `).all({ query: trimmed, like: likePattern, fts: sanitized, limit });
             return rows.map((r) => this.rowToNode(r));
         }
@@ -707,19 +707,19 @@ export class KnowledgeGraph {
     /** Fallback LIKE-based search */
     searchLike(query, limit) {
         const pattern = `%${query}%`;
-        const rows = this.db.prepare(`
-      SELECT * FROM nodes
-      WHERE name LIKE ? OR qualifiedName LIKE ? OR signature LIKE ? OR docComment LIKE ?
-      ORDER BY
-        CASE
-          WHEN name = ? THEN 0
-          WHEN name LIKE ? THEN 1
-          WHEN qualifiedName LIKE ? THEN 2
-          WHEN signature LIKE ? THEN 3
-          ELSE 4
-        END,
-        name
-      LIMIT ?
+        const rows = this.db.prepare(`
+      SELECT * FROM nodes
+      WHERE name LIKE ? OR qualifiedName LIKE ? OR signature LIKE ? OR docComment LIKE ?
+      ORDER BY
+        CASE
+          WHEN name = ? THEN 0
+          WHEN name LIKE ? THEN 1
+          WHEN qualifiedName LIKE ? THEN 2
+          WHEN signature LIKE ? THEN 3
+          ELSE 4
+        END,
+        name
+      LIMIT ?
     `).all(pattern, pattern, pattern, pattern, query, pattern, pattern, pattern, limit);
         return rows.map((r) => this.rowToNode(r));
     }
@@ -761,10 +761,10 @@ export class KnowledgeGraph {
     getProjectOverview() {
         const overview = new Map();
         // Single query: get ALL non-file nodes, ordered by file then line
-        const allSymbols = this.db.prepare(`
-      SELECT * FROM nodes
-      WHERE type != 'file'
-      ORDER BY filePath, startLine
+        const allSymbols = this.db.prepare(`
+      SELECT * FROM nodes
+      WHERE type != 'file'
+      ORDER BY filePath, startLine
     `).all();
         for (const row of allSymbols) {
             const node = this.rowToNode(row);
@@ -925,9 +925,9 @@ export class KnowledgeGraph {
             this.db.prepare('UPDATE learned_rules SET description = ?, rule = ?, updated_at = ? WHERE id = ?').run(rule.description, JSON.stringify(rule.rule), now, existing.id);
             return { id: existing.id, created: false };
         }
-        this.db.prepare(`
-      INSERT INTO learned_rules (id, type, name, description, rule, created_at, updated_at, created_by)
-      VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+        this.db.prepare(`
+      INSERT INTO learned_rules (id, type, name, description, rule, created_at, updated_at, created_by)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?)
     `).run(id, rule.type, rule.name, rule.description, JSON.stringify(rule.rule), now, now, rule.createdBy ?? 'ai');
         return { id, created: true };
     }
@@ -1008,9 +1008,9 @@ export class KnowledgeGraph {
      * Upsert a file index entry after indexing.
      */
     upsertFileIndex(filePath, mtimeMs, sizeBytes, contentHash) {
-        this.db.prepare(`
-      INSERT OR REPLACE INTO file_index (file_path, mtime_ms, size_bytes, content_hash, indexed_at)
-      VALUES (?, ?, ?, ?, ?)
+        this.db.prepare(`
+      INSERT OR REPLACE INTO file_index (file_path, mtime_ms, size_bytes, content_hash, indexed_at)
+      VALUES (?, ?, ?, ?, ?)
     `).run(filePath, mtimeMs, sizeBytes, contentHash, Date.now());
     }
     /**

package/dist/knowledge-graph/indexer.d.ts

@@ -44,6 +44,13 @@ export declare class Indexer {
     private config;
     private ig;
     private changelog;
+    /**
+     * Per-project-root ignore patterns.
+     * When multiple projects are indexed, each keeps its own .gitignore rules.
+     */
+    private projectIgnores;
+    /** Track all project roots we've indexed */
+    private knownProjectRoots;
     constructor(graph: KnowledgeGraph, config: MindMapConfig);
     /** Attach a changelog engine for node-level change tracking */
     setChangelog(changelog: ChangelogEngine): void;
@@ -51,8 +58,21 @@ export declare class Indexer {
      * Re-target the indexer to a different project directory.
      * Reloads .gitignore patterns and updates config.projectRoot.
      * The graph is NOT cleared — nodes from multiple projects can coexist.
+     * Previous project's ignore patterns are preserved for file watcher events.
      */
     setProjectRoot(newRoot: string): void;
+    /** Get the list of all indexed project roots */
+    getKnownProjectRoots(): string[];
+    /**
+     * Find the project root that a file belongs to.
+     * Matches by longest prefix (most specific root wins).
+     */
+    private findProjectRootForFile;
+    /**
+     * Get the correct ignore instance for a file path.
+     * Falls back to the current project's ignore if no match found.
+     */
+    private getIgnoreForFile;
     /** Load ignore patterns from .gitignore and config */
     private loadIgnorePatterns;
     /**

package/dist/knowledge-graph/indexer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"indexer.d.ts","sourceRoot":"","sources":["../../src/knowledge-graph/indexer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAS5C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAYtD,gDAAgD;AAChD,MAAM,MAAM,qBAAqB,GAAG,CAAC,QAAQ,EAAE,aAAa,KAAK,IAAI,CAAC;AAEtE,oCAAoC;AACpC,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,UAAU,CAAC;IACnE,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC;AAMD;;;GAGG;AACH,qBAAa,OAAO;IAClB,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,EAAE,CAA4B;IACtC,OAAO,CAAC,SAAS,CAAgC;gBAErC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,aAAa;IASxD,+DAA+D;IAC/D,YAAY,CAAC,SAAS,EAAE,eAAe,GAAG,IAAI;IAI9C;;;;OAIG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAOrC,sDAAsD;IACtD,OAAO,CAAC,kBAAkB;IAkC1B;;;;;OAKG;IACG,SAAS,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAsDpC;;;;;;;;OAQG;IACG,SAAS,CAAC,UAAU,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,UAAU,CAAC;IAkIxE;;;;;;;;OAQG;IACG,gBAAgB,CAAC,UAAU,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,UAAU,CAAC;IAiN/E;;;;;OAKG;IACG,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAwC9D;;;;;OAKG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAKpC;;;OAGG;IACG,cAAc,IAAI,OAAO,CAAC;QAC9B,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;IA6CF;;;;OAIG;IACG,sBAAsB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAgBjD;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC;QAC9B,YAAY,EAAE,MAAM,CAAC;QACrB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,OAAO,CAAC;KACvB,CAAC;IA8BF,qGAAqG;IAC/F,aAAa,IAAI,OAAO,CAAC;QAC7B,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,OAAO,EAAE,OAAO,CAAC;KAClB,CAAC;CA2CH"}
+{"version":3,"file":"indexer.d.ts","sourceRoot":"","sources":["../../src/knowledge-graph/indexer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAS5C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAYtD,gDAAgD;AAChD,MAAM,MAAM,qBAAqB,GAAG,CAAC,QAAQ,EAAE,aAAa,KAAK,IAAI,CAAC;AAEtE,oCAAoC;AACpC,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,UAAU,CAAC;IACnE,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,sCAAsC;AACtC,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC;AAMD;;;GAGG;AACH,qBAAa,OAAO;IAClB,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,EAAE,CAA4B;IACtC,OAAO,CAAC,SAAS,CAAgC;IAEjD;;;OAGG;IACH,OAAO,CAAC,cAAc,CAAgD;IACtE,4CAA4C;IAC5C,OAAO,CAAC,iBAAiB,CAAgB;gBAE7B,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,aAAa;IAYxD,+DAA+D;IAC/D,YAAY,CAAC,SAAS,EAAE,eAAe,GAAG,IAAI;IAI9C;;;;;OAKG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAYrC,gDAAgD;IAChD,oBAAoB,IAAI,MAAM,EAAE;IAIhC;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IAc9B;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IAQxB,sDAAsD;IACtD,OAAO,CAAC,kBAAkB;IAkC1B;;;;;OAKG;IACG,SAAS,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAsDpC;;;;;;;;OAQG;IACG,SAAS,CAAC,UAAU,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,UAAU,CAAC;IAkIxE;;;;;;;;OAQG;IACG,gBAAgB,CAAC,UAAU,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,UAAU,CAAC;IAiN/E;;;;;OAKG;IACG,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IA4C9D;;;;;OAKG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAKpC;;;OAGG;IACG,cAAc,IAAI,OAAO,CAAC;QAC9B,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,YAAY,EAAE,MAAM,CAAC;QACrB,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;IA6CF;;;;OAIG;IACG,sBAAsB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAgBjD;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC;QAC9B,YAAY,EAAE,MAAM,CAAC;QACrB,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,OAAO,CAAC;KACvB,CAAC;IA8BF,qGAAqG;IAC/F,aAAa,IAAI,OAAO,CAAC;QAC7B,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,cAAc,EAAE,MAAM,EAAE,CAAC;QACzB,OAAO,EAAE,OAAO,CAAC;KAClB,CAAC;CA2CH"}

package/dist/knowledge-graph/indexer.js

@@ -31,12 +31,22 @@ export class Indexer {
     config;
     ig;
     changelog = null;
+    /**
+     * Per-project-root ignore patterns.
+     * When multiple projects are indexed, each keeps its own .gitignore rules.
+     */
+    projectIgnores = new Map();
+    /** Track all project roots we've indexed */
+    knownProjectRoots = [];
     constructor(graph, config) {
         this.graph = graph;
         this.config = config;
         this.ig = ignore();
         // Load .gitignore patterns
         this.loadIgnorePatterns();
+        // Store as the first known project
+        this.projectIgnores.set(this.config.projectRoot, this.ig);
+        this.knownProjectRoots.push(this.config.projectRoot);
     }
     /** Attach a changelog engine for node-level change tracking */
     setChangelog(changelog) {
@@ -46,12 +56,50 @@ export class Indexer {
      * Re-target the indexer to a different project directory.
      * Reloads .gitignore patterns and updates config.projectRoot.
      * The graph is NOT cleared — nodes from multiple projects can coexist.
+     * Previous project's ignore patterns are preserved for file watcher events.
      */
     setProjectRoot(newRoot) {
         this.config.projectRoot = newRoot;
         // Reset and reload ignore patterns for the new root
         this.ig = ignore();
         this.loadIgnorePatterns();
+        // Store the new project's ignore patterns
+        this.projectIgnores.set(newRoot, this.ig);
+        if (!this.knownProjectRoots.includes(newRoot)) {
+            this.knownProjectRoots.push(newRoot);
+        }
+    }
+    /** Get the list of all indexed project roots */
+    getKnownProjectRoots() {
+        return [...this.knownProjectRoots];
+    }
+    /**
+     * Find the project root that a file belongs to.
+     * Matches by longest prefix (most specific root wins).
+     */
+    findProjectRootForFile(filePath) {
+        const normalized = filePath.replace(/\\/g, '/');
+        let bestMatch = null;
+        let bestLength = 0;
+        for (const root of this.knownProjectRoots) {
+            const normalizedRoot = root.replace(/\\/g, '/');
+            if (normalized.startsWith(normalizedRoot) && normalizedRoot.length > bestLength) {
+                bestMatch = root;
+                bestLength = normalizedRoot.length;
+            }
+        }
+        return bestMatch;
+    }
+    /**
+     * Get the correct ignore instance for a file path.
+     * Falls back to the current project's ignore if no match found.
+     */
+    getIgnoreForFile(filePath) {
+        const projectRoot = this.findProjectRootForFile(filePath);
+        if (projectRoot) {
+            return this.projectIgnores.get(projectRoot) ?? this.ig;
+        }
+        return this.ig;
     }
     /** Load ignore patterns from .gitignore and config */
     loadIgnorePatterns() {
@@ -243,7 +291,7 @@ export class Indexer {
                 if (i % 100 === 0 && i > 0) {
                     const mem = process.memoryUsage();
                     if (mem.heapUsed / mem.heapTotal > MEMORY_PRESSURE_THRESHOLD) {
-                        process.stderr.write(`⚠️ Memory pressure during fullIndex at file ${i}/${parseResults.length}. Stopping early.\n`);
+                        process.stderr.write(`⚠ Memory pressure during fullIndex at file ${i}/${parseResults.length}. Stopping early.\n`);
                         break;
                     }
                 }
@@ -460,9 +508,12 @@ export class Indexer {
      * @returns Parse result, or null if file was skipped
      */
     async indexFile(filePath) {
-        // Check if file should be ignored
-        const relPath = relative(this.config.projectRoot, filePath).replace(/\\/g, '/');
-        if (this.ig.ignores(relPath))
+        // Determine which project this file belongs to (multi-project support)
+        const fileProjectRoot = this.findProjectRootForFile(filePath) ?? this.config.projectRoot;
+        const fileIgnore = this.getIgnoreForFile(filePath);
+        // Check if file should be ignored using the correct project's rules
+        const relPath = relative(fileProjectRoot, filePath).replace(/\\/g, '/');
+        if (fileIgnore.ignores(relPath))
             return null;
         if (!isSupportedFile(filePath))
             return null;