codehere 0.1.0 → 0.3.0

package/dist/infrastructure/storage/sqlite-knowledge-graph-repository.js

@@ -0,0 +1,417 @@
+/**
+ * Infrastructure: SQLiteKnowledgeGraphRepository
+ * SQLite implementation of knowledge graph storage
+ *
+ * Clean Architecture: Infrastructure Layer
+ * Pattern: Repository Pattern Implementation
+ */
+import { readFileSync, existsSync, mkdirSync, writeFileSync } from 'fs';
+import { join, dirname } from 'path';
+import { fileURLToPath } from 'url';
+import initSqlJs from 'sql.js';
+import { randomUUID } from 'crypto';
+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', 'knowledge-graph.sqlite');
+    }
+    return join(process.cwd(), 'agent', 'data', 'knowledge-graph.sqlite');
+}
+export class SQLiteKnowledgeGraphRepository {
+    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();
+        }
+        // Create nodes table
+        this.db.run(`
+      CREATE TABLE IF NOT EXISTS knowledge_nodes (
+        id TEXT PRIMARY KEY,
+        codebaseId TEXT NOT NULL,
+        type TEXT NOT NULL,
+        label TEXT NOT NULL,
+        content TEXT NOT NULL,
+        metadata TEXT,
+        createdAt INTEGER NOT NULL,
+        lastUpdated INTEGER NOT NULL
+      )
+    `);
+        // Create edges table
+        this.db.run(`
+      CREATE TABLE IF NOT EXISTS knowledge_edges (
+        id TEXT PRIMARY KEY,
+        fromNodeId TEXT NOT NULL,
+        toNodeId TEXT NOT NULL,
+        type TEXT NOT NULL,
+        weight REAL,
+        metadata TEXT,
+        createdAt INTEGER NOT NULL,
+        FOREIGN KEY (fromNodeId) REFERENCES knowledge_nodes(id),
+        FOREIGN KEY (toNodeId) REFERENCES knowledge_nodes(id)
+      )
+    `);
+        // Create indexes
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_codebase ON knowledge_nodes(codebaseId)`);
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_type ON knowledge_nodes(codebaseId, type)`);
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_from_node ON knowledge_edges(fromNodeId)`);
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_to_node ON knowledge_edges(toNodeId)`);
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_edge_type ON knowledge_edges(type)`);
+        this.db.run(`CREATE INDEX IF NOT EXISTS idx_edge_codebase ON knowledge_edges(fromNodeId, toNodeId)`);
+        return this.db;
+    }
+    async storeNode(node) {
+        const db = await this.getDb();
+        const id = node.id || randomUUID();
+        const stmt = db.prepare(`
+      INSERT OR REPLACE INTO knowledge_nodes
+      (id, codebaseId, type, label, content, metadata, createdAt, lastUpdated)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run([
+            id,
+            node.codebaseId,
+            node.type,
+            node.label,
+            node.content,
+            JSON.stringify(node.metadata ?? {}),
+            node.createdAt.getTime(),
+            node.lastUpdated.getTime(),
+        ]);
+        stmt.free();
+        this.saveDb();
+    }
+    async getNodeById(id) {
+        const db = await this.getDb();
+        const stmt = db.prepare('SELECT * FROM knowledge_nodes WHERE id = ?');
+        stmt.bind([id]);
+        if (!stmt.step()) {
+            stmt.free();
+            return null;
+        }
+        const row = stmt.getAsObject();
+        stmt.free();
+        return this.mapRowToNode(row);
+    }
+    async findNodesByCodebase(codebaseId, limit = 100) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_nodes
+      WHERE codebaseId = ?
+      ORDER BY lastUpdated DESC
+      LIMIT ?
+    `);
+        stmt.bind([codebaseId, limit]);
+        return this.executeAndMapNodes(stmt);
+    }
+    async findNodesByType(codebaseId, type, limit = 100) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_nodes
+      WHERE codebaseId = ? AND type = ?
+      ORDER BY lastUpdated DESC
+      LIMIT ?
+    `);
+        stmt.bind([codebaseId, type, limit]);
+        return this.executeAndMapNodes(stmt);
+    }
+    async searchNodes(codebaseId, query, limit = 50) {
+        const db = await this.getDb();
+        const searchTerm = `%${query}%`;
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_nodes
+      WHERE codebaseId = ?
+        AND (label LIKE ? OR content LIKE ?)
+      ORDER BY lastUpdated DESC
+      LIMIT ?
+    `);
+        stmt.bind([codebaseId, searchTerm, searchTerm, limit]);
+        return this.executeAndMapNodes(stmt);
+    }
+    async updateNode(node) {
+        if (!node.id) {
+            throw new Error('Node ID required for update');
+        }
+        await this.storeNode(node); // INSERT OR REPLACE handles update
+    }
+    async deleteNode(id) {
+        const db = await this.getDb();
+        // Delete edges first (foreign key constraints)
+        const deleteEdgesStmt = db.prepare(`
+      DELETE FROM knowledge_edges
+      WHERE fromNodeId = ? OR toNodeId = ?
+    `);
+        deleteEdgesStmt.run([id, id]);
+        deleteEdgesStmt.free();
+        // Delete node
+        const deleteNodeStmt = db.prepare('DELETE FROM knowledge_nodes WHERE id = ?');
+        deleteNodeStmt.run([id]);
+        deleteNodeStmt.free();
+        this.saveDb();
+    }
+    async storeEdge(edge) {
+        const db = await this.getDb();
+        const id = edge.id || randomUUID();
+        const stmt = db.prepare(`
+      INSERT OR REPLACE INTO knowledge_edges
+      (id, fromNodeId, toNodeId, type, weight, metadata, createdAt)
+      VALUES (?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run([
+            id,
+            edge.fromNodeId,
+            edge.toNodeId,
+            edge.type,
+            edge.weight ?? null,
+            JSON.stringify(edge.metadata ?? {}),
+            edge.createdAt.getTime(),
+        ]);
+        stmt.free();
+        this.saveDb();
+    }
+    async getEdgeById(id) {
+        const db = await this.getDb();
+        const stmt = db.prepare('SELECT * FROM knowledge_edges WHERE id = ?');
+        stmt.bind([id]);
+        if (!stmt.step()) {
+            stmt.free();
+            return null;
+        }
+        const row = stmt.getAsObject();
+        stmt.free();
+        return this.mapRowToEdge(row);
+    }
+    async findEdgesByCodebase(codebaseId, limit = 1000) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT e.* FROM knowledge_edges e
+      INNER JOIN knowledge_nodes n1 ON e.fromNodeId = n1.id
+      WHERE n1.codebaseId = ?
+      ORDER BY e.createdAt DESC
+      LIMIT ?
+    `);
+        stmt.bind([codebaseId, limit]);
+        return this.executeAndMapEdges(stmt);
+    }
+    async findEdgesByType(codebaseId, type, limit = 100) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT e.* FROM knowledge_edges e
+      INNER JOIN knowledge_nodes n1 ON e.fromNodeId = n1.id
+      WHERE n1.codebaseId = ? AND e.type = ?
+      ORDER BY e.createdAt DESC
+      LIMIT ?
+    `);
+        stmt.bind([codebaseId, type, limit]);
+        return this.executeAndMapEdges(stmt);
+    }
+    async findEdgesFromNode(nodeId, limit = 100) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_edges
+      WHERE fromNodeId = ?
+      ORDER BY createdAt DESC
+      LIMIT ?
+    `);
+        stmt.bind([nodeId, limit]);
+        return this.executeAndMapEdges(stmt);
+    }
+    async findEdgesToNode(nodeId, limit = 100) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_edges
+      WHERE toNodeId = ?
+      ORDER BY createdAt DESC
+      LIMIT ?
+    `);
+        stmt.bind([nodeId, limit]);
+        return this.executeAndMapEdges(stmt);
+    }
+    async findEdgesBetween(fromNodeId, toNodeId) {
+        const db = await this.getDb();
+        const stmt = db.prepare(`
+      SELECT * FROM knowledge_edges
+      WHERE fromNodeId = ? AND toNodeId = ?
+    `);
+        stmt.bind([fromNodeId, toNodeId]);
+        return this.executeAndMapEdges(stmt);
+    }
+    async updateEdge(edge) {
+        if (!edge.id) {
+            throw new Error('Edge ID required for update');
+        }
+        await this.storeEdge(edge); // INSERT OR REPLACE handles update
+    }
+    async deleteEdge(id) {
+        const db = await this.getDb();
+        const stmt = db.prepare('DELETE FROM knowledge_edges WHERE id = ?');
+        stmt.run([id]);
+        stmt.free();
+        this.saveDb();
+    }
+    async getGraphByCodebase(codebaseId) {
+        const nodes = await this.findNodesByCodebase(codebaseId);
+        const edges = await this.findEdgesByCodebase(codebaseId);
+        // Calculate metadata
+        const nodeTypes = {};
+        const relationshipTypes = {};
+        for (const node of nodes) {
+            nodeTypes[node.type] = (nodeTypes[node.type] || 0) + 1;
+        }
+        for (const edge of edges) {
+            relationshipTypes[edge.type] = (relationshipTypes[edge.type] || 0) + 1;
+        }
+        const metadata = {
+            nodeCount: nodes.length,
+            edgeCount: edges.length,
+            nodeTypes,
+            relationshipTypes,
+        };
+        return {
+            codebaseId,
+            nodes,
+            edges,
+            metadata,
+            createdAt: nodes.length > 0 ? nodes[0].createdAt : new Date(),
+            lastUpdated: nodes.length > 0 ? nodes[nodes.length - 1].lastUpdated : new Date(),
+        };
+    }
+    async getNeighbors(nodeId, direction = 'both') {
+        const db = await this.getDb();
+        const nodeIds = new Set();
+        if (direction === 'out' || direction === 'both') {
+            const outEdges = await this.findEdgesFromNode(nodeId);
+            outEdges.forEach(edge => nodeIds.add(edge.toNodeId));
+        }
+        if (direction === 'in' || direction === 'both') {
+            const inEdges = await this.findEdgesToNode(nodeId);
+            inEdges.forEach(edge => nodeIds.add(edge.fromNodeId));
+        }
+        const neighbors = [];
+        for (const id of nodeIds) {
+            const node = await this.getNodeById(id);
+            if (node) {
+                neighbors.push(node);
+            }
+        }
+        return neighbors;
+    }
+    async getNodesWithinHops(nodeId, maxHops) {
+        const visited = new Set();
+        const result = [];
+        const queue = [{ nodeId, hops: 0 }];
+        while (queue.length > 0) {
+            const { nodeId: currentId, hops } = queue.shift();
+            if (visited.has(currentId) || hops > maxHops) {
+                continue;
+            }
+            visited.add(currentId);
+            const node = await this.getNodeById(currentId);
+            if (node) {
+                result.push(node);
+            }
+            if (hops < maxHops) {
+                const neighbors = await this.getNeighbors(currentId);
+                for (const neighbor of neighbors) {
+                    if (neighbor.id && !visited.has(neighbor.id)) {
+                        queue.push({ nodeId: neighbor.id, hops: hops + 1 });
+                    }
+                }
+            }
+        }
+        return result;
+    }
+    async findShortestPath(fromNodeId, toNodeId) {
+        // BFS to find shortest path
+        const visited = new Set();
+        const queue = [{ nodeId: fromNodeId, path: [fromNodeId] }];
+        while (queue.length > 0) {
+            const { nodeId: currentId, path } = queue.shift();
+            if (visited.has(currentId)) {
+                continue;
+            }
+            visited.add(currentId);
+            if (currentId === toNodeId) {
+                // Found path, return nodes
+                const nodes = [];
+                for (const id of path) {
+                    const node = await this.getNodeById(id);
+                    if (node) {
+                        nodes.push(node);
+                    }
+                }
+                return nodes;
+            }
+            const neighbors = await this.getNeighbors(currentId, 'out');
+            for (const neighbor of neighbors) {
+                if (neighbor.id && !visited.has(neighbor.id)) {
+                    queue.push({ nodeId: neighbor.id, path: [...path, neighbor.id] });
+                }
+            }
+        }
+        return null; // No path found
+    }
+    mapRowToNode(row) {
+        return {
+            id: row.id,
+            codebaseId: row.codebaseId,
+            type: row.type,
+            label: row.label,
+            content: row.content,
+            metadata: JSON.parse(row.metadata ?? '{}'),
+            createdAt: new Date(row.createdAt),
+            lastUpdated: new Date(row.lastUpdated),
+        };
+    }
+    mapRowToEdge(row) {
+        return {
+            id: row.id,
+            fromNodeId: row.fromNodeId,
+            toNodeId: row.toNodeId,
+            type: row.type,
+            weight: row.weight ?? undefined,
+            metadata: JSON.parse(row.metadata ?? '{}'),
+            createdAt: new Date(row.createdAt),
+        };
+    }
+    executeAndMapNodes(stmt) {
+        const nodes = [];
+        while (stmt.step()) {
+            nodes.push(this.mapRowToNode(stmt.getAsObject()));
+        }
+        stmt.free();
+        return nodes;
+    }
+    executeAndMapEdges(stmt) {
+        const edges = [];
+        while (stmt.step()) {
+            edges.push(this.mapRowToEdge(stmt.getAsObject()));
+        }
+        stmt.free();
+        return edges;
+    }
+    saveDb() {
+        if (!this.db)
+            return;
+        const data = this.db.export();
+        const buffer = Buffer.from(data);
+        writeFileSync(this.dbPath, buffer);
+    }
+}
+//# sourceMappingURL=sqlite-knowledge-graph-repository.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-knowledge-graph-repository.js","sourceRoot":"","sources":["../../../src/infrastructure/storage/sqlite-knowledge-graph-repository.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;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;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAWpC,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,wBAAwB,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,wBAAwB,CAAC,CAAC;AACxE,CAAC;AAED,MAAM,OAAO,8BAA8B;IACjC,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,qBAAqB;QACrB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;;;;;;;;;;;KAWX,CAAC,CAAC;QAEH,qBAAqB;QACrB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;;;;;;;;;;;;KAYX,CAAC,CAAC;QAEH,iBAAiB;QACjB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,wEAAwE,CAAC,CAAC;QACtF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,0EAA0E,CAAC,CAAC;QACxF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,yEAAyE,CAAC,CAAC;QACvF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,qEAAqE,CAAC,CAAC;QACnF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,mEAAmE,CAAC,CAAC;QACjF,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,uFAAuF,CAAC,CAAC;QAErG,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,IAAmB;QACjC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,UAAU,EAAE,CAAC;QAEnC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAIvB,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC;YACP,EAAE;YACF,IAAI,CAAC,UAAU;YACf,IAAI,CAAC,IAAI;YACT,IAAI,CAAC,KAAK;YACV,IAAI,CAAC,OAAO;YACZ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;YACxB,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE;SAC3B,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,EAAU;QAC1B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,UAAkB,EAAE,QAAgB,GAAG;QAC/D,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;QAE/B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,UAAkB,EAAE,IAAc,EAAE,QAAgB,GAAG;QAC3E,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,UAAkB,EAAE,KAAa,EAAE,QAAgB,EAAE;QACrE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAG,IAAI,KAAK,GAAG,CAAC;QAChC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;KAMvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,IAAmB;QAClC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,mCAAmC;IACjE,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,+CAA+C;QAC/C,MAAM,eAAe,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGlC,CAAC,CAAC;QACH,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9B,eAAe,CAAC,IAAI,EAAE,CAAC;QAEvB,cAAc;QACd,MAAM,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;QAC9E,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,cAAc,CAAC,IAAI,EAAE,CAAC;QAEtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,IAAmB;QACjC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,UAAU,EAAE,CAAC;QAEnC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAIvB,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC;YACP,EAAE;YACF,IAAI,CAAC,UAAU;YACf,IAAI,CAAC,QAAQ;YACb,IAAI,CAAC,IAAI;YACT,IAAI,CAAC,MAAM,IAAI,IAAI;YACnB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;SACzB,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,EAAU;QAC1B,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,UAAkB,EAAE,QAAgB,IAAI;QAChE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;KAMvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;QAE/B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,UAAkB,EAAE,IAAsB,EAAE,QAAgB,GAAG;QACnF,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;KAMvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAErC,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,MAAc,EAAE,QAAgB,GAAG;QACzD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QAE3B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,MAAc,EAAE,QAAgB,GAAG;QACvD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QAE3B,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,UAAkB,EAAE,QAAgB;QACzD,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGvB,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAElC,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,IAAmB;QAClC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,mCAAmC;IACjE,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,0CAA0C,CAAC,CAAC;QACpE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,kBAAkB,CAAC,UAAkB;QACzC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAEzD,qBAAqB;QACrB,MAAM,SAAS,GAA6B,EAAS,CAAC;QACtD,MAAM,iBAAiB,GAAqC,EAAS,CAAC;QAEtE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzD,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,CAAC;QAED,MAAM,QAAQ,GAA2B;YACvC,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,SAAS;YACT,iBAAiB;SAClB,CAAC;QAEF,OAAO;YACL,UAAU;YACV,KAAK;YACL,KAAK;YACL,QAAQ;YACR,SAAS,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;YAC7D,WAAW,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;SACjF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,MAAc,EAAE,YAAmC,MAAM;QAC1E,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YACtD,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YACnD,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,SAAS,GAAoB,EAAE,CAAC;QACtC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,IAAI,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,kBAAkB,CAAC,MAAc,EAAE,OAAe;QACtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,MAAM,KAAK,GAAuC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAExE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEnD,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC/C,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;YAED,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;gBACnB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;gBACrD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,IAAI,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,UAAkB,EAAE,QAAgB;QACzD,4BAA4B;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAEjG,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEnD,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEvB,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAC3B,2BAA2B;gBAC3B,MAAM,KAAK,GAAoB,EAAE,CAAC;gBAClC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;oBACtB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,IAAI,EAAE,CAAC;wBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC5D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAEO,YAAY,CAAC,GAAQ;QAC3B,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,IAAI,EAAE,GAAG,CAAC,IAAgB;YAC1B,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YAC1C,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;YAClC,WAAW,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;SACvC,CAAC;IACJ,CAAC;IAEO,YAAY,CAAC,GAAQ;QAC3B,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,IAAI,EAAE,GAAG,CAAC,IAAwB;YAClC,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,SAAS;YAC/B,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC;YAC1C,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;SACnC,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,IAAS;QAClC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,kBAAkB,CAAC,IAAS;QAClC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC;IACf,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;CACF"}

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

@@ -0,0 +1,29 @@
+/**
+ * Infrastructure: SQLiteKnowledgePreservationRepository
+ * SQLite implementation of knowledge preservation storage
+ *
+ * Clean Architecture: Infrastructure Layer
+ * Pattern: Repository Pattern Implementation
+ */
+import type { IKnowledgePreservationRepository } from '../../domain/interfaces/knowledge-preservation-repository.interface.js';
+import type { KnowledgePreservation, KnowledgeType } from '../../domain/entities/knowledge-preservation.js';
+export declare class SQLiteKnowledgePreservationRepository implements IKnowledgePreservationRepository {
+    private dbPath;
+    private db;
+    constructor();
+    private getDb;
+    private saveDb;
+    store(knowledge: KnowledgePreservation): Promise<void>;
+    getById(id: string): Promise<KnowledgePreservation | null>;
+    findByCodebase(codebaseId: string, limit?: number): Promise<KnowledgePreservation[]>;
+    findByType(codebaseId: string, type: KnowledgeType, limit?: number): Promise<KnowledgePreservation[]>;
+    search(codebaseId: string, query: string, limit?: number): Promise<KnowledgePreservation[]>;
+    findByTags(codebaseId: string, tags: string[], limit?: number): Promise<KnowledgePreservation[]>;
+    update(knowledge: KnowledgePreservation): Promise<void>;
+    delete(id: string): Promise<void>;
+    getMostAccessed(codebaseId: string, limit?: number): Promise<KnowledgePreservation[]>;
+    getRecent(codebaseId: string, limit?: number): Promise<KnowledgePreservation[]>;
+    private mapRowToKnowledge;
+    private executeAndMap;
+}
+//# sourceMappingURL=sqlite-knowledge-preservation-repository.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-knowledge-preservation-repository.d.ts","sourceRoot":"","sources":["../../../src/infrastructure/storage/sqlite-knowledge-preservation-repository.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAOH,OAAO,KAAK,EAAE,gCAAgC,EAAE,MAAM,wEAAwE,CAAC;AAC/H,OAAO,KAAK,EAAE,qBAAqB,EAAE,aAAa,EAAE,MAAM,iDAAiD,CAAC;AAY5G,qBAAa,qCAAsC,YAAW,gCAAgC;IAC5F,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,EAAE,CAAyB;;YAMrB,KAAK;IA6CnB,OAAO,CAAC,MAAM;IAOR,KAAK,CAAC,SAAS,EAAE,qBAAqB,GAAG,OAAO,CAAC,IAAI,CAAC;IAgCtD,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC;IAe1D,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAazF,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,GAAE,MAAY,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAa1G,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAe/F,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAiBpG,MAAM,CAAC,SAAS,EAAE,qBAAqB,GAAG,OAAO,CAAC,IAAI,CAAC;IAOvD,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAQjC,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAczF,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,qBAAqB,EAAE,CAAC;IAazF,OAAO,CAAC,iBAAiB;IAsBzB,OAAO,CAAC,aAAa;CAQtB"}