codehere 0.1.0 → 0.3.0

package/dist/infrastructure/storage/sqlite-embedding-repository.js

@@ -0,0 +1,277 @@
+/**
+ * Infrastructure: SQLiteEmbeddingRepository
+ * Implements IEmbeddingRepository using SQLite
+ */
+import { readFileSync, existsSync, mkdirSync, writeFileSync } from 'fs';
+import { join, dirname } from 'path';
+import { fileURLToPath } from 'url';
+import initSqlJs from 'sql.js';
+import { getQueryResultCache } from '../cache/query-result-cache.js';
+function getDbPath() {
+    const __filename = fileURLToPath(import.meta.url);
+    const __dirname = dirname(__filename);
+    const agentDir = join(__dirname, '../../..');
+    if (existsSync(join(agentDir, 'package.json'))) {
+        return join(agentDir, 'data', 'embeddings.sqlite');
+    }
+    return join(process.cwd(), 'agent', 'data', 'embeddings.sqlite');
+}
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    return denominator === 0 ? 0 : dotProduct / denominator;
+}
+/**
+ * Optimized cosine similarity with pre-computed query norm
+ * Reduces redundant calculations when comparing same query to multiple embeddings
+ */
+function cosineSimilarityOptimized(queryEmbedding, queryNorm, docEmbedding) {
+    if (queryEmbedding.length !== docEmbedding.length)
+        return 0;
+    let dotProduct = 0;
+    let docNorm = 0;
+    for (let i = 0; i < docEmbedding.length; i++) {
+        dotProduct += queryEmbedding[i] * docEmbedding[i];
+        docNorm += docEmbedding[i] * docEmbedding[i];
+    }
+    const denominator = queryNorm * Math.sqrt(docNorm);
+    return denominator === 0 ? 0 : dotProduct / denominator;
+}
+export class SQLiteEmbeddingRepository {
+    dbPath;
+    db = null;
+    constructor() {
+        this.dbPath = getDbPath();
+    }
+    async getDb() {
+        if (this.db)
+            return this.db;
+        const SQL = await initSqlJs();
+        const dbDir = dirname(this.dbPath);
+        if (!existsSync(dbDir)) {
+            mkdirSync(dbDir, { recursive: true });
+        }
+        if (existsSync(this.dbPath)) {
+            const buffer = readFileSync(this.dbPath);
+            this.db = new SQL.Database(buffer);
+        }
+        else {
+            this.db = new SQL.Database();
+        }
+        this.db.run(`
+      CREATE TABLE IF NOT EXISTS embeddings (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        filepath TEXT NOT NULL,
+        chunkIndex INTEGER NOT NULL,
+        content TEXT NOT NULL,
+        embedding TEXT NOT NULL
+      )
+    `);
+        this.db.run(`
+      CREATE INDEX IF NOT EXISTS idx_filepath ON embeddings(filepath)
+    `);
+        return this.db;
+    }
+    async store(chunks) {
+        const db = await this.getDb();
+        db.run('DELETE FROM embeddings');
+        const stmt = db.prepare(`
+      INSERT INTO embeddings (filepath, chunkIndex, content, embedding)
+      VALUES (?, ?, ?, ?)
+    `);
+        for (const chunk of chunks) {
+            if (!chunk.embedding)
+                continue;
+            stmt.run([
+                chunk.filepath,
+                chunk.chunkIndex || 0,
+                chunk.content,
+                JSON.stringify(chunk.embedding),
+            ]);
+        }
+        stmt.free();
+        this.saveDb();
+        // Clear query result cache when codebase is re-indexed
+        getQueryResultCache().clear();
+    }
+    async search(query, topK) {
+        // For now, return empty - will implement with query embedding
+        // This requires AI service, which creates circular dependency
+        // Will be resolved via dependency injection in application layer
+        return [];
+    }
+    async getByFilepath(filepath) {
+        const db = await this.getDb();
+        const stmt = db.prepare('SELECT * FROM embeddings WHERE filepath = ?');
+        stmt.bind([filepath]);
+        const results = [];
+        while (stmt.step()) {
+            const row = stmt.getAsObject();
+            results.push({
+                filepath: row.filepath,
+                content: row.content,
+                score: 1.0,
+                chunkIndex: row.chunkIndex,
+                embedding: JSON.parse(row.embedding),
+            });
+        }
+        stmt.free();
+        return results;
+    }
+    async isIndexed(filepath) {
+        const db = await this.getDb();
+        const stmt = db.prepare('SELECT COUNT(*) as count FROM embeddings WHERE filepath = ?');
+        stmt.bind([filepath]);
+        stmt.step();
+        const result = stmt.getAsObject();
+        stmt.free();
+        return result.count > 0;
+    }
+    async clear() {
+        const db = await this.getDb();
+        db.run('DELETE FROM embeddings');
+        this.saveDb();
+    }
+    saveDb() {
+        if (!this.db)
+            return;
+        const data = this.db.export();
+        const buffer = Buffer.from(data);
+        writeFileSync(this.dbPath, buffer);
+    }
+    /**
+     * Search with pre-computed query embedding
+     * (Used by application layer to avoid circular dependency)
+     *
+     * PERFORMANCE OPTIMIZATION:
+     * 1. Uses min-heap to maintain only topK results (O(n log k) vs O(n log n))
+     * 2. Pre-computes query norm once (avoids redundant calculations)
+     * 3. Optimized cosine similarity calculation
+     * 4. Result caching (query + topK results) to avoid redundant searches
+     * 5. Batch processing with early termination for large datasets
+     * 6. Optimized JSON parsing (cache parsed embeddings per row)
+     *
+     * Note: Cache key should be generated from query string, not embedding
+     * This method receives embedding, so caching should be done at call site
+     */
+    async searchWithEmbedding(queryEmbedding, topK) {
+        const db = await this.getDb();
+        // Pre-compute query norm once (used for all similarity calculations)
+        let queryNorm = 0;
+        for (let i = 0; i < queryEmbedding.length; i++) {
+            queryNorm += queryEmbedding[i] * queryEmbedding[i];
+        }
+        queryNorm = Math.sqrt(queryNorm);
+        // Get total count for optimization decisions
+        const countStmt = db.prepare('SELECT COUNT(*) as count FROM embeddings');
+        countStmt.step();
+        const totalCount = countStmt.getAsObject().count;
+        countStmt.free();
+        // OPTIMIZATION: Early termination for large datasets
+        // Process with early termination if dataset is large
+        const USE_EARLY_TERMINATION = totalCount > 500;
+        const MAX_PROCESS = USE_EARLY_TERMINATION ? Math.min(totalCount, 1000) : totalCount;
+        // Min-heap to maintain topK results (smallest score at root)
+        const heap = [];
+        const heapInsert = (item) => {
+            if (heap.length < topK) {
+                heap.push(item);
+                // Bubble up
+                let i = heap.length - 1;
+                while (i > 0) {
+                    const parent = Math.floor((i - 1) / 2);
+                    if (heap[parent].score <= heap[i].score)
+                        break;
+                    [heap[parent], heap[i]] = [heap[i], heap[parent]];
+                    i = parent;
+                }
+            }
+            else if (item.score > heap[0].score) {
+                // Replace root (smallest) with new item if it's larger
+                heap[0] = item;
+                // Bubble down
+                let i = 0;
+                while (true) {
+                    const left = 2 * i + 1;
+                    const right = 2 * i + 2;
+                    let smallest = i;
+                    if (left < heap.length && heap[left].score < heap[smallest].score) {
+                        smallest = left;
+                    }
+                    if (right < heap.length && heap[right].score < heap[smallest].score) {
+                        smallest = right;
+                    }
+                    if (smallest === i)
+                        break;
+                    [heap[i], heap[smallest]] = [heap[smallest], heap[i]];
+                    i = smallest;
+                }
+            }
+        };
+        // Standard query - early termination will handle large datasets
+        const stmt = db.prepare('SELECT * FROM embeddings');
+        let processed = 0;
+        let consecutiveLowScores = 0;
+        const EARLY_TERMINATION_THRESHOLD = USE_EARLY_TERMINATION ? 150 : Infinity; // More aggressive for large datasets
+        // Process embeddings in batches with early termination
+        while (stmt.step()) {
+            const row = stmt.getAsObject();
+            // Parse embedding (try-catch for invalid JSON)
+            let embedding;
+            try {
+                embedding = JSON.parse(row.embedding);
+            }
+            catch {
+                continue; // Skip invalid embeddings
+            }
+            // Compute similarity using optimized function (pre-computed query norm)
+            const score = cosineSimilarityOptimized(queryEmbedding, queryNorm, embedding);
+            // Insert into heap (maintains topK)
+            heapInsert({
+                chunk: {
+                    filepath: row.filepath,
+                    content: row.content,
+                    score,
+                    chunkIndex: row.chunkIndex,
+                    embedding,
+                },
+                score,
+            });
+            processed++;
+            // Early termination: If we have topK results and many consecutive low scores,
+            // likely we've found the best matches
+            if (heap.length >= topK) {
+                const minScore = heap[0].score;
+                if (score < minScore * 0.8) { // Score significantly lower than current min
+                    consecutiveLowScores++;
+                    if (consecutiveLowScores > EARLY_TERMINATION_THRESHOLD) {
+                        break; // Early termination
+                    }
+                }
+                else {
+                    consecutiveLowScores = 0; // Reset counter
+                }
+            }
+            // Limit total processing for very large datasets (early termination optimization)
+            if (processed >= MAX_PROCESS) {
+                break;
+            }
+        }
+        stmt.free();
+        // Extract results from heap and sort descending (highest scores first)
+        const results = heap
+            .sort((a, b) => b.score - a.score)
+            .map(r => r.chunk);
+        return results;
+    }
+}
+//# sourceMappingURL=sqlite-embedding-repository.js.map

package/dist/infrastructure/storage/sqlite-embedding-repository.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-embedding-repository.js","sourceRoot":"","sources":["../../../src/infrastructure/storage/sqlite-embedding-repository.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,IAAI,CAAC;AACxE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AACpC,OAAO,SAAuB,MAAM,QAAQ,CAAC;AAG7C,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AAErE,SAAS,SAAS;IAChB,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAC7C,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC;QAC/C,OAAO,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,mBAAmB,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,mBAAmB,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC;AAC1D,CAAC;AAED;;;GAGG;AACH,SAAS,yBAAyB,CAAC,cAAwB,EAAE,SAAiB,EAAE,YAAsB;IACpG,IAAI,cAAc,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IAC5D,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,UAAU,IAAI,cAAc,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAClD,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,MAAM,WAAW,GAAG,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnD,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC;AAC1D,CAAC;AAED,MAAM,OAAO,yBAAyB;IAC5B,MAAM,CAAS;IACf,EAAE,GAAoB,IAAI,CAAC;IAEnC;QACE,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;IAC5B,CAAC;IAEO,KAAK,CAAC,KAAK;QACjB,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QAE5B,MAAM,GAAG,GAAG,MAAM,SAAS,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEnC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,SAAS,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzC,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;;;;;;;;KAQX,CAAC,CAAC;QAEH,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;;KAEX,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,MAAmB;QAC7B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,EAAE,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;QAEjC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGvB,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,SAAS;gBAAE,SAAS;YAC/B,IAAI,CAAC,GAAG,CAAC;gBACP,KAAK,CAAC,QAAQ;gBACd,KAAK,CAAC,UAAU,IAAI,CAAC;gBACrB,KAAK,CAAC,OAAO;gBACb,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC;aAChC,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,uDAAuD;QACvD,mBAAmB,EAAE,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,IAAY;QACtC,8DAA8D;QAC9D,8DAA8D;QAC9D,iEAAiE;QACjE,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,QAAgB;QAClC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtB,MAAM,OAAO,GAAgB,EAAE,CAAC;QAEhC,OAAO,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAS,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,OAAO,EAAE,GAAG,CAAC,OAAO;gBACpB,KAAK,EAAE,GAAG;gBACV,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;aACrC,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,QAAgB;QAC9B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC;QACvF,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAuB,CAAC;QACvD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,EAAE,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,MAAM;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,mBAAmB,CAAC,cAAwB,EAAE,IAAY;QAC9D,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,qEAAqE;QACrE,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,SAAS,IAAI,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAEjC,6CAA6C;QAC7C,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;QACzE,SAAS,CAAC,IAAI,EAAE,CAAC;QACjB,MAAM,UAAU,GAAI,SAAS,CAAC,WAAW,EAAwB,CAAC,KAAK,CAAC;QACxE,SAAS,CAAC,IAAI,EAAE,CAAC;QAEjB,qDAAqD;QACrD,qDAAqD;QACrD,MAAM,qBAAqB,GAAG,UAAU,GAAG,GAAG,CAAC;QAC/C,MAAM,WAAW,GAAG,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAEpF,6DAA6D;QAC7D,MAAM,IAAI,GAA+C,EAAE,CAAC;QAE5D,MAAM,UAAU,GAAG,CAAC,IAAyC,EAAE,EAAE;YAC/D,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAChB,YAAY;gBACZ,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBACb,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;wBAAE,MAAM;oBAC/C,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;oBAClD,CAAC,GAAG,MAAM,CAAC;gBACb,CAAC;YACH,CAAC;iBAAM,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBACtC,uDAAuD;gBACvD,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACf,cAAc;gBACd,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAO,IAAI,EAAE,CAAC;oBACZ,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;oBAEjB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC;wBAClE,QAAQ,GAAG,IAAI,CAAC;oBAClB,CAAC;oBACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC;wBACpE,QAAQ,GAAG,KAAK,CAAC;oBACnB,CAAC;oBAED,IAAI,QAAQ,KAAK,CAAC;wBAAE,MAAM;oBAC1B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtD,CAAC,GAAG,QAAQ,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,gEAAgE;QAChE,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,0BAA0B,CAAC,CAAC;QAEpD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,MAAM,2BAA2B,GAAG,qBAAqB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,qCAAqC;QAEjH,uDAAuD;QACvD,OAAO,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAS,CAAC;YAEtC,+CAA+C;YAC/C,IAAI,SAAmB,CAAC;YACxB,IAAI,CAAC;gBACH,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAa,CAAC;YACpD,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS,CAAC,0BAA0B;YACtC,CAAC;YAED,wEAAwE;YACxE,MAAM,KAAK,GAAG,yBAAyB,CAAC,cAAc,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YAE9E,oCAAoC;YACpC,UAAU,CAAC;gBACT,KAAK,EAAE;oBACL,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,KAAK;oBACL,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,SAAS;iBACV;gBACD,KAAK;aACN,CAAC,CAAC;YAEH,SAAS,EAAE,CAAC;YAEZ,8EAA8E;YAC9E,sCAAsC;YACtC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC/B,IAAI,KAAK,GAAG,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC,6CAA6C;oBACzE,oBAAoB,EAAE,CAAC;oBACvB,IAAI,oBAAoB,GAAG,2BAA2B,EAAE,CAAC;wBACvD,MAAM,CAAC,oBAAoB;oBAC7B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,oBAAoB,GAAG,CAAC,CAAC,CAAC,gBAAgB;gBAC5C,CAAC;YACH,CAAC;YAED,kFAAkF;YAClF,IAAI,SAAS,IAAI,WAAW,EAAE,CAAC;gBAC7B,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,uEAAuE;QACvE,MAAM,OAAO,GAAG,IAAI;aACjB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAErB,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/infrastructure/storage/sqlite-knowledge-graph-repository.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Infrastructure: SQLiteKnowledgeGraphRepository
+ * SQLite implementation of knowledge graph storage
+ *
+ * Clean Architecture: Infrastructure Layer
+ * Pattern: Repository Pattern Implementation
+ */
+import type { IKnowledgeGraphRepository } from '../../domain/interfaces/knowledge-graph-repository.interface.js';
+import type { KnowledgeNode, KnowledgeEdge, KnowledgeGraph, NodeType, RelationshipType } from '../../domain/entities/knowledge-node.js';
+export declare class SQLiteKnowledgeGraphRepository implements IKnowledgeGraphRepository {
+    private dbPath;
+    private db;
+    constructor();
+    private getDb;
+    storeNode(node: KnowledgeNode): Promise<void>;
+    getNodeById(id: string): Promise<KnowledgeNode | null>;
+    findNodesByCodebase(codebaseId: string, limit?: number): Promise<KnowledgeNode[]>;
+    findNodesByType(codebaseId: string, type: NodeType, limit?: number): Promise<KnowledgeNode[]>;
+    searchNodes(codebaseId: string, query: string, limit?: number): Promise<KnowledgeNode[]>;
+    updateNode(node: KnowledgeNode): Promise<void>;
+    deleteNode(id: string): Promise<void>;
+    storeEdge(edge: KnowledgeEdge): Promise<void>;
+    getEdgeById(id: string): Promise<KnowledgeEdge | null>;
+    findEdgesByCodebase(codebaseId: string, limit?: number): Promise<KnowledgeEdge[]>;
+    findEdgesByType(codebaseId: string, type: RelationshipType, limit?: number): Promise<KnowledgeEdge[]>;
+    findEdgesFromNode(nodeId: string, limit?: number): Promise<KnowledgeEdge[]>;
+    findEdgesToNode(nodeId: string, limit?: number): Promise<KnowledgeEdge[]>;
+    findEdgesBetween(fromNodeId: string, toNodeId: string): Promise<KnowledgeEdge[]>;
+    updateEdge(edge: KnowledgeEdge): Promise<void>;
+    deleteEdge(id: string): Promise<void>;
+    getGraphByCodebase(codebaseId: string): Promise<KnowledgeGraph>;
+    getNeighbors(nodeId: string, direction?: 'in' | 'out' | 'both'): Promise<KnowledgeNode[]>;
+    getNodesWithinHops(nodeId: string, maxHops: number): Promise<KnowledgeNode[]>;
+    findShortestPath(fromNodeId: string, toNodeId: string): Promise<KnowledgeNode[] | null>;
+    private mapRowToNode;
+    private mapRowToEdge;
+    private executeAndMapNodes;
+    private executeAndMapEdges;
+    private saveDb;
+}
+//# sourceMappingURL=sqlite-knowledge-graph-repository.d.ts.map

package/dist/infrastructure/storage/sqlite-knowledge-graph-repository.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-knowledge-graph-repository.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/storage/sqlite-knowledge-graph-repository.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAOH,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,iEAAiE,CAAC;AACjH,OAAO,KAAK,EACV,aAAa,EACb,aAAa,EACb,cAAc,EACd,QAAQ,EACR,gBAAgB,EAEjB,MAAM,yCAAyC,CAAC;AAYjD,qBAAa,8BAA+B,YAAW,yBAAyB;IAC9E,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,EAAE,CAAyB;;YAMrB,KAAK;IAyDb,SAAS,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAyB7C,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;IAgBtD,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAatF,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAalG,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAe5F,UAAU,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAO9C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAmBrC,SAAS,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAwB7C,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;IAgBtD,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,GAAE,MAAa,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAcvF,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAc1G,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAahF,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAa9E,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAWhF,UAAU,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAO9C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAQrC,kBAAkB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC;IAiC/D,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,KAAK,GAAG,MAAe,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAyBjG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IA+B7E,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC;IAqC7F,OAAO,CAAC,YAAY;IAapB,OAAO,CAAC,YAAY;IAYpB,OAAO,CAAC,kBAAkB;IAS1B,OAAO,CAAC,kBAAkB;IAS1B,OAAO,CAAC,MAAM;CAMf"}