family-ai-agent 1.0.6 → 1.0.8

package/dist/database/vector/hnsw-index.js

@@ -0,0 +1,337 @@
+/**
+ * HNSW (Hierarchical Navigable Small World) Index
+ *
+ * In-memory approximate nearest neighbor search for SQLite mode.
+ * Provides fast vector similarity search without pgvector.
+ */
+import { cosineSimilarity, euclideanDistance } from './similarity.js';
+import { createLogger } from '../../utils/logger.js';
+const logger = createLogger('HNSWIndex');
+/**
+ * Default HNSW configuration
+ */
+const DEFAULT_CONFIG = {
+    dimension: 1536,
+    similarity: 'cosine',
+    M: 16,
+    M0: 32,
+    efConstruction: 200,
+    mL: 1 / Math.log(16),
+};
+/**
+ * HNSW Index for fast approximate nearest neighbor search
+ */
+export class HNSWIndex {
+    nodes = new Map();
+    entryPoint = null;
+    maxLevel = 0;
+    config;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Get similarity function based on config
+     */
+    getSimilarity() {
+        if (this.config.similarity === 'euclidean') {
+            // Convert distance to similarity (higher is better)
+            return (a, b) => 1 / (1 + euclideanDistance(a, b));
+        }
+        return cosineSimilarity;
+    }
+    /**
+     * Generate random level for new node
+     */
+    randomLevel() {
+        let level = 0;
+        while (Math.random() < this.config.mL && level < 32) {
+            level++;
+        }
+        return level;
+    }
+    /**
+     * Get maximum connections for a level
+     */
+    getMaxConnections(level) {
+        return level === 0 ? this.config.M0 : this.config.M;
+    }
+    /**
+     * Add a vector to the index
+     */
+    add(id, vector) {
+        if (vector.length !== this.config.dimension) {
+            throw new Error(`Expected dimension ${this.config.dimension}, got ${vector.length}`);
+        }
+        // Check if already exists
+        if (this.nodes.has(id)) {
+            // Update existing node
+            const existingNode = this.nodes.get(id);
+            existingNode.vector = vector;
+            return;
+        }
+        const level = this.randomLevel();
+        const node = {
+            id,
+            vector,
+            neighbors: new Map(),
+            level,
+        };
+        // Initialize neighbor sets for each level
+        for (let l = 0; l <= level; l++) {
+            node.neighbors.set(l, new Set());
+        }
+        this.nodes.set(id, node);
+        // First node becomes entry point
+        if (!this.entryPoint) {
+            this.entryPoint = id;
+            this.maxLevel = level;
+            return;
+        }
+        const similarity = this.getSimilarity();
+        let currentNode = this.entryPoint;
+        // Traverse from top level down to level + 1
+        for (let l = this.maxLevel; l > level; l--) {
+            currentNode = this.searchLayer(vector, currentNode, 1, l, similarity)[0]?.id ?? currentNode;
+        }
+        // Insert at each level from level down to 0
+        for (let l = Math.min(level, this.maxLevel); l >= 0; l--) {
+            const candidates = this.searchLayer(vector, currentNode, this.config.efConstruction, l, similarity);
+            const neighbors = this.selectNeighbors(candidates, this.getMaxConnections(l));
+            // Connect new node to neighbors
+            for (const neighbor of neighbors) {
+                node.neighbors.get(l).add(neighbor.id);
+                // Connect neighbors back to new node (bidirectional)
+                const neighborNode = this.nodes.get(neighbor.id);
+                if (neighborNode) {
+                    neighborNode.neighbors.get(l)?.add(id);
+                    // Prune if too many connections
+                    const maxConn = this.getMaxConnections(l);
+                    if ((neighborNode.neighbors.get(l)?.size ?? 0) > maxConn) {
+                        this.pruneConnections(neighborNode, l, maxConn, similarity);
+                    }
+                }
+            }
+            if (candidates.length > 0) {
+                currentNode = candidates[0].id;
+            }
+        }
+        // Update entry point if new node has higher level
+        if (level > this.maxLevel) {
+            this.entryPoint = id;
+            this.maxLevel = level;
+        }
+    }
+    /**
+     * Search for k nearest neighbors
+     */
+    search(query, k, ef) {
+        if (query.length !== this.config.dimension) {
+            throw new Error(`Expected dimension ${this.config.dimension}, got ${query.length}`);
+        }
+        if (!this.entryPoint) {
+            return [];
+        }
+        const effectiveEf = ef ?? Math.max(k, 100);
+        const similarity = this.getSimilarity();
+        let currentNode = this.entryPoint;
+        // Traverse from top level down to level 1
+        for (let l = this.maxLevel; l > 0; l--) {
+            currentNode = this.searchLayer(query, currentNode, 1, l, similarity)[0]?.id ?? currentNode;
+        }
+        // Search at level 0 with ef candidates
+        const candidates = this.searchLayer(query, currentNode, effectiveEf, 0, similarity);
+        // Return top k
+        return candidates.slice(0, k);
+    }
+    /**
+     * Search within a layer
+     */
+    searchLayer(query, entryId, ef, level, similarity) {
+        const entryNode = this.nodes.get(entryId);
+        if (!entryNode)
+            return [];
+        const visited = new Set([entryId]);
+        const candidates = [
+            { id: entryId, similarity: similarity(query, entryNode.vector) },
+        ];
+        // Priority queue (sorted by similarity descending)
+        const toExplore = [...candidates];
+        while (toExplore.length > 0) {
+            // Get best candidate
+            toExplore.sort((a, b) => b.similarity - a.similarity);
+            const current = toExplore.shift();
+            // Get worst in results
+            candidates.sort((a, b) => b.similarity - a.similarity);
+            const worstSimilarity = candidates.length >= ef
+                ? candidates[candidates.length - 1].similarity
+                : -Infinity;
+            // Stop if current is worse than worst result
+            if (current.similarity < worstSimilarity) {
+                break;
+            }
+            // Explore neighbors
+            const currentNode = this.nodes.get(current.id);
+            const neighbors = currentNode?.neighbors.get(level) ?? new Set();
+            for (const neighborId of neighbors) {
+                if (visited.has(neighborId))
+                    continue;
+                visited.add(neighborId);
+                const neighborNode = this.nodes.get(neighborId);
+                if (!neighborNode)
+                    continue;
+                const sim = similarity(query, neighborNode.vector);
+                const result = { id: neighborId, similarity: sim };
+                if (candidates.length < ef || sim > worstSimilarity) {
+                    candidates.push(result);
+                    candidates.sort((a, b) => b.similarity - a.similarity);
+                    if (candidates.length > ef) {
+                        candidates.pop();
+                    }
+                    toExplore.push(result);
+                }
+            }
+        }
+        return candidates;
+    }
+    /**
+     * Select best neighbors from candidates
+     */
+    selectNeighbors(candidates, maxNeighbors) {
+        // Simple approach: take top maxNeighbors by similarity
+        return candidates
+            .sort((a, b) => b.similarity - a.similarity)
+            .slice(0, maxNeighbors);
+    }
+    /**
+     * Prune connections to maintain max connections
+     */
+    pruneConnections(node, level, maxConnections, similarity) {
+        const neighbors = node.neighbors.get(level);
+        if (!neighbors || neighbors.size <= maxConnections)
+            return;
+        // Calculate similarities and keep best
+        const scored = [];
+        for (const neighborId of neighbors) {
+            const neighborNode = this.nodes.get(neighborId);
+            if (neighborNode) {
+                scored.push({
+                    id: neighborId,
+                    similarity: similarity(node.vector, neighborNode.vector),
+                });
+            }
+        }
+        scored.sort((a, b) => b.similarity - a.similarity);
+        const keep = new Set(scored.slice(0, maxConnections).map((s) => s.id));
+        // Remove excess connections
+        for (const neighborId of neighbors) {
+            if (!keep.has(neighborId)) {
+                neighbors.delete(neighborId);
+                // Also remove back-link
+                this.nodes.get(neighborId)?.neighbors.get(level)?.delete(node.id);
+            }
+        }
+    }
+    /**
+     * Remove a vector from the index
+     */
+    remove(id) {
+        const node = this.nodes.get(id);
+        if (!node)
+            return false;
+        // Remove from all neighbors
+        for (const [level, neighbors] of node.neighbors) {
+            for (const neighborId of neighbors) {
+                this.nodes.get(neighborId)?.neighbors.get(level)?.delete(id);
+            }
+        }
+        this.nodes.delete(id);
+        // Update entry point if needed
+        if (this.entryPoint === id) {
+            if (this.nodes.size === 0) {
+                this.entryPoint = null;
+                this.maxLevel = 0;
+            }
+            else {
+                // Find new entry point with highest level
+                let maxLvl = 0;
+                let newEntry = null;
+                for (const [nodeId, n] of this.nodes) {
+                    if (n.level >= maxLvl) {
+                        maxLvl = n.level;
+                        newEntry = nodeId;
+                    }
+                }
+                this.entryPoint = newEntry;
+                this.maxLevel = maxLvl;
+            }
+        }
+        return true;
+    }
+    /**
+     * Check if an ID exists in the index
+     */
+    has(id) {
+        return this.nodes.has(id);
+    }
+    /**
+     * Get vector by ID
+     */
+    get(id) {
+        return this.nodes.get(id)?.vector;
+    }
+    /**
+     * Get index size
+     */
+    get size() {
+        return this.nodes.size;
+    }
+    /**
+     * Get index statistics
+     */
+    getStats() {
+        let totalConnections = 0;
+        let connectionCount = 0;
+        for (const node of this.nodes.values()) {
+            for (const neighbors of node.neighbors.values()) {
+                totalConnections += neighbors.size;
+                connectionCount++;
+            }
+        }
+        return {
+            size: this.nodes.size,
+            dimension: this.config.dimension,
+            maxLevel: this.maxLevel,
+            avgConnections: connectionCount > 0 ? totalConnections / connectionCount : 0,
+        };
+    }
+    /**
+     * Clear the index
+     */
+    clear() {
+        this.nodes.clear();
+        this.entryPoint = null;
+        this.maxLevel = 0;
+    }
+    /**
+     * Get all IDs in the index
+     */
+    getAllIds() {
+        return Array.from(this.nodes.keys());
+    }
+    /**
+     * Rebuild index from scratch (for optimization)
+     */
+    rebuild() {
+        const vectors = Array.from(this.nodes.entries()).map(([id, node]) => ({
+            id,
+            vector: node.vector,
+        }));
+        this.clear();
+        for (const { id, vector } of vectors) {
+            this.add(id, vector);
+        }
+        logger.debug('Index rebuilt', { size: this.size });
+    }
+}
+export default HNSWIndex;
+//# sourceMappingURL=hnsw-index.js.map

package/dist/database/vector/hnsw-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-index.js","sourceRoot":"","sources":["../../../src/database/vector/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAErD,MAAM,MAAM,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;AAsCzC;;GAEG;AACH,MAAM,cAAc,GAAe;IACjC,SAAS,EAAE,IAAI;IACf,UAAU,EAAE,QAAQ;IACpB,CAAC,EAAE,EAAE;IACL,EAAE,EAAE,EAAE;IACN,cAAc,EAAE,GAAG;IACnB,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;CACrB,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IACzC,UAAU,GAAkB,IAAI,CAAC;IACjC,QAAQ,GAAW,CAAC,CAAC;IACrB,MAAM,CAAa;IAE3B,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,aAAa;QACnB,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,WAAW,EAAE,CAAC;YAC3C,oDAAoD;YACpD,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACpD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAa;QACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU,EAAE,MAAgB;QAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,MAAM,CAAC,SAAS,SAAS,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACvF,CAAC;QAED,0BAA0B;QAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,uBAAuB;YACvB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACzC,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,IAAI,GAAa;YACrB,EAAE;YACF,MAAM;YACN,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,KAAK;SACN,CAAC;QAEF,0CAA0C;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEzB,iCAAiC;QACjC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,OAAO;QACT,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;QAElC,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,WAAW,CAAC;QAC9F,CAAC;QAED,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CACjC,MAAM,EACN,WAAW,EACX,IAAI,CAAC,MAAM,CAAC,cAAc,EAC1B,CAAC,EACD,UAAU,CACX,CAAC;YAEF,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9E,gCAAgC;YAChC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAExC,qDAAqD;gBACrD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACjD,IAAI,YAAY,EAAE,CAAC;oBACjB,YAAY,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;oBAEvC,gCAAgC;oBAChC,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBAC1C,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC;wBACzD,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,WAAW,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YAClC,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAe,EAAE,CAAS,EAAE,EAAW;QAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,MAAM,CAAC,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACtF,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,WAAW,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;QAElC,0CAA0C;QAC1C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,WAAW,CAAC;QAC7F,CAAC;QAED,uCAAuC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAEpF,eAAe;QACf,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,WAAW,CACjB,KAAe,EACf,OAAe,EACf,EAAU,EACV,KAAa,EACb,UAAgD;QAEhD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAE1B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAmB;YACjC,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE;SACjE,CAAC;QAEF,mDAAmD;QACnD,MAAM,SAAS,GAAmB,CAAC,GAAG,UAAU,CAAC,CAAC;QAElD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,qBAAqB;YACrB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YACtD,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;YAEnC,uBAAuB;YACvB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;YACvD,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,IAAI,EAAE;gBAC7C,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,UAAU;gBAC/C,CAAC,CAAC,CAAC,QAAQ,CAAC;YAEd,6CAA6C;YAC7C,IAAI,OAAO,CAAC,UAAU,GAAG,eAAe,EAAE,CAAC;gBACzC,MAAM;YACR,CAAC;YAED,oBAAoB;YACpB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC/C,MAAM,SAAS,GAAG,WAAW,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAEjE,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACtC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAChD,IAAI,CAAC,YAAY;oBAAE,SAAS;gBAE5B,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,EAAE,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;gBAEnD,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,IAAI,GAAG,GAAG,eAAe,EAAE,CAAC;oBACpD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACxB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;oBACvD,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;wBAC3B,UAAU,CAAC,GAAG,EAAE,CAAC;oBACnB,CAAC;oBACD,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,UAA0B,EAAE,YAAoB;QACtE,uDAAuD;QACvD,OAAO,UAAU;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,IAAc,EACd,KAAa,EACb,cAAsB,EACtB,UAAgD;QAEhD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,IAAI,cAAc;YAAE,OAAO;QAE3D,uCAAuC;QACvC,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;YACnC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAChD,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,UAAU;oBACd,UAAU,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;iBACzD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACnD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvE,4BAA4B;QAC5B,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAC7B,wBAAwB;gBACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,4BAA4B;QAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAChD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,+BAA+B;QAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,0CAA0C;gBAC1C,IAAI,MAAM,GAAG,CAAC,CAAC;gBACf,IAAI,QAAQ,GAAkB,IAAI,CAAC;gBACnC,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACrC,IAAI,CAAC,CAAC,KAAK,IAAI,MAAM,EAAE,CAAC;wBACtB,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;wBACjB,QAAQ,GAAG,MAAM,CAAC;oBACpB,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;gBAC3B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;gBAChD,gBAAgB,IAAI,SAAS,CAAC,IAAI,CAAC;gBACnC,eAAe,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACrB,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;YAChC,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,cAAc,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;SAC7E,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,OAAO;QACL,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YACpE,EAAE;YACF,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,CAAC;QAEJ,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACrC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACrD,CAAC;CACF;AAED,eAAe,SAAS,CAAC"}

package/dist/database/vector/index.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Vector Search Engine
+ *
+ * Unified interface for vector similarity search.
+ * PostgreSQL uses pgvector, SQLite uses in-memory HNSW.
+ */
+import type { DatabaseAdapter, VectorSearchOptions, VectorSearchResult, VectorSearchEngine } from '../types.js';
+export { HNSWIndex, type SearchResult } from './hnsw-index.js';
+export { EmbeddingCache, type EmbeddingCacheStats } from './embedding-cache.js';
+export * from './similarity.js';
+/**
+ * PostgreSQL vector search engine using pgvector
+ */
+export declare class PgVectorSearchEngine implements VectorSearchEngine {
+    private adapter;
+    private tableName;
+    private embeddingColumn;
+    private dimension;
+    constructor(adapter: DatabaseAdapter, options: {
+        tableName: string;
+        embeddingColumn?: string;
+        dimension?: number;
+    });
+    initialize(): Promise<void>;
+    store(id: string, embedding: number[], metadata?: Record<string, unknown>): Promise<void>;
+    search(queryEmbedding: number[], options?: VectorSearchOptions): Promise<VectorSearchResult[]>;
+    remove(id: string): Promise<void>;
+    rebuildIndex(): Promise<void>;
+    getStats(): {
+        size: number;
+        dimension: number;
+    };
+}
+/**
+ * SQLite vector search engine using in-memory HNSW
+ */
+export declare class SqliteVectorSearchEngine implements VectorSearchEngine {
+    private adapter;
+    private tableName;
+    private index;
+    private cache;
+    private dimension;
+    private initialized;
+    constructor(adapter: DatabaseAdapter, options: {
+        tableName: string;
+        dimension?: number;
+        cacheSize?: number;
+    });
+    initialize(): Promise<void>;
+    store(id: string, embedding: number[], metadata?: Record<string, unknown>): Promise<void>;
+    search(queryEmbedding: number[], options?: VectorSearchOptions): Promise<VectorSearchResult[]>;
+    remove(id: string): Promise<void>;
+    rebuildIndex(): Promise<void>;
+    getStats(): {
+        size: number;
+        dimension: number;
+    };
+    getCacheStats(): import("./embedding-cache.js").EmbeddingCacheStats;
+}
+/**
+ * Create vector search engine based on adapter type
+ */
+export declare function createVectorSearchEngine(adapter: DatabaseAdapter, options: {
+    tableName: string;
+    embeddingColumn?: string;
+    dimension?: number;
+    cacheSize?: number;
+}): VectorSearchEngine;
+declare const _default: {
+    PgVectorSearchEngine: typeof PgVectorSearchEngine;
+    SqliteVectorSearchEngine: typeof SqliteVectorSearchEngine;
+    createVectorSearchEngine: typeof createVectorSearchEngine;
+};
+export default _default;
+//# sourceMappingURL=index.d.ts.map

package/dist/database/vector/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/database/vector/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EAAE,eAAe,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAMhH,OAAO,EAAE,SAAS,EAAE,KAAK,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,KAAK,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAChF,cAAc,iBAAiB,CAAC;AAEhC;;GAEG;AACH,qBAAa,oBAAqB,YAAW,kBAAkB;IAC7D,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO,CAAC,SAAS,CAAS;gBAGxB,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE;QACP,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,CAAC,EAAE,MAAM,CAAC;QACzB,SAAS,CAAC,EAAE,MAAM,CAAC;KACpB;IAQG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAK3B,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAKzF,MAAM,CAAC,cAAc,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE,mBAAwB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IA6ClG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKjC,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC;IAKnC,QAAQ,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;CAGhD;AAED;;GAEG;AACH,qBAAa,wBAAyB,YAAW,kBAAkB;IACjE,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,WAAW,CAAkB;gBAGnC,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE;QACP,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;KACpB;IAiBG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IA0B3B,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAKzF,MAAM,CAAC,cAAc,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE,mBAAwB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAkElG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAKjC,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC;IAOnC,QAAQ,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE;IAQ/C,aAAa;CAGd;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,eAAe,EACxB,OAAO,EAAE;IACP,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,GACA,kBAAkB,CAKpB;;;;;;AAED,wBAIE"}

package/dist/database/vector/index.js

@@ -0,0 +1,213 @@
+/**
+ * Vector Search Engine
+ *
+ * Unified interface for vector similarity search.
+ * PostgreSQL uses pgvector, SQLite uses in-memory HNSW.
+ */
+import { HNSWIndex } from './hnsw-index.js';
+import { EmbeddingCache } from './embedding-cache.js';
+import { parseEmbedding } from './similarity.js';
+import { createLogger } from '../../utils/logger.js';
+const logger = createLogger('VectorSearch');
+// Re-export components
+export { HNSWIndex } from './hnsw-index.js';
+export { EmbeddingCache } from './embedding-cache.js';
+export * from './similarity.js';
+/**
+ * PostgreSQL vector search engine using pgvector
+ */
+export class PgVectorSearchEngine {
+    adapter;
+    tableName;
+    embeddingColumn;
+    dimension;
+    constructor(adapter, options) {
+        this.adapter = adapter;
+        this.tableName = options.tableName;
+        this.embeddingColumn = options.embeddingColumn ?? 'embedding';
+        this.dimension = options.dimension ?? 1536;
+    }
+    async initialize() {
+        // pgvector is initialized at adapter level
+        logger.debug('PgVectorSearchEngine initialized', { table: this.tableName });
+    }
+    async store(id, embedding, metadata) {
+        // This is handled by the memory layer, not directly by vector engine
+        logger.debug('Store called on PgVectorSearchEngine', { id });
+    }
+    async search(queryEmbedding, options = {}) {
+        const { limit = 5, minSimilarity = 0.7, userId, memoryType } = options;
+        const embeddingStr = `[${queryEmbedding.join(',')}]`;
+        let sql = `
+      SELECT id, content, memory_type, metadata,
+             1 - (${this.embeddingColumn} <=> $1::vector) as similarity
+      FROM ${this.tableName}
+      WHERE 1 - (${this.embeddingColumn} <=> $1::vector) >= $2
+    `;
+        const params = [embeddingStr, minSimilarity];
+        let paramIdx = 3;
+        if (userId) {
+            sql += ` AND user_id = $${paramIdx}`;
+            params.push(userId);
+            paramIdx++;
+        }
+        if (memoryType) {
+            sql += ` AND memory_type = $${paramIdx}`;
+            params.push(memoryType);
+            paramIdx++;
+        }
+        sql += ` ORDER BY similarity DESC LIMIT $${paramIdx}`;
+        params.push(limit);
+        const result = await this.adapter.query(sql, params);
+        return result.rows.map((row) => ({
+            id: row.id,
+            content: row.content,
+            similarity: row.similarity,
+            memoryType: row.memory_type,
+            metadata: row.metadata,
+        }));
+    }
+    async remove(id) {
+        // Handled by memory layer
+        logger.debug('Remove called on PgVectorSearchEngine', { id });
+    }
+    async rebuildIndex() {
+        // pgvector indexes are managed by PostgreSQL
+        logger.debug('Rebuild index called on PgVectorSearchEngine');
+    }
+    getStats() {
+        return { size: 0, dimension: this.dimension }; // Would need a count query
+    }
+}
+/**
+ * SQLite vector search engine using in-memory HNSW
+ */
+export class SqliteVectorSearchEngine {
+    adapter;
+    tableName;
+    index;
+    cache;
+    dimension;
+    initialized = false;
+    constructor(adapter, options) {
+        this.adapter = adapter;
+        this.tableName = options.tableName;
+        this.dimension = options.dimension ?? 1536;
+        this.index = new HNSWIndex({
+            dimension: this.dimension,
+            similarity: 'cosine',
+            M: 16,
+            efConstruction: 200,
+        });
+        this.cache = new EmbeddingCache({
+            maxSize: options.cacheSize ?? 10000,
+            dimension: this.dimension,
+        });
+    }
+    async initialize() {
+        if (this.initialized)
+            return;
+        // Load all embeddings from database into memory
+        const result = await this.adapter.query(`SELECT id, embedding, memory_type, content FROM ${this.tableName}`);
+        for (const row of result.rows) {
+            const embedding = parseEmbedding(row.embedding);
+            if (embedding && embedding.length === this.dimension) {
+                this.index.add(row.id, embedding);
+                this.cache.set(row.id, embedding);
+            }
+        }
+        this.initialized = true;
+        logger.info('SqliteVectorSearchEngine initialized', {
+            table: this.tableName,
+            vectorCount: this.index.size,
+        });
+    }
+    async store(id, embedding, metadata) {
+        this.index.add(id, embedding);
+        this.cache.set(id, embedding, metadata);
+    }
+    async search(queryEmbedding, options = {}) {
+        const { limit = 5, minSimilarity = 0.7, userId, memoryType } = options;
+        // Use HNSW for initial candidates (get more than needed for filtering)
+        const candidates = this.index.search(queryEmbedding, limit * 3);
+        // Filter candidates that don't meet similarity threshold
+        const filtered = candidates.filter((c) => c.similarity >= minSimilarity);
+        if (filtered.length === 0) {
+            return [];
+        }
+        // Get full records from database
+        const ids = filtered.map((c) => c.id);
+        const placeholders = ids.map((_, i) => `$${i + 1}`).join(',');
+        let sql = `SELECT id, content, memory_type, metadata FROM ${this.tableName} WHERE id IN (${placeholders})`;
+        const params = [...ids];
+        if (userId) {
+            sql = sql.replace('WHERE', `WHERE user_id = $${params.length + 1} AND`);
+            params.push(userId);
+        }
+        if (memoryType) {
+            sql = sql.replace('WHERE', `WHERE memory_type = $${params.length + 1} AND`);
+            params.push(memoryType);
+        }
+        const result = await this.adapter.query(sql, params);
+        // Create a map for quick lookup
+        const recordMap = new Map();
+        for (const row of result.rows) {
+            recordMap.set(row.id, row);
+        }
+        // Build results with similarity scores
+        const results = [];
+        for (const candidate of filtered) {
+            const record = recordMap.get(candidate.id);
+            if (record) {
+                results.push({
+                    id: record.id,
+                    content: record.content,
+                    similarity: candidate.similarity,
+                    memoryType: record.memory_type,
+                    metadata: typeof record.metadata === 'string'
+                        ? JSON.parse(record.metadata)
+                        : record.metadata,
+                });
+            }
+        }
+        // Sort by similarity and limit
+        return results
+            .sort((a, b) => b.similarity - a.similarity)
+            .slice(0, limit);
+    }
+    async remove(id) {
+        this.index.remove(id);
+        this.cache.delete(id);
+    }
+    async rebuildIndex() {
+        this.initialized = false;
+        this.index.clear();
+        this.cache.clear();
+        await this.initialize();
+    }
+    getStats() {
+        const indexStats = this.index.getStats();
+        return {
+            size: indexStats.size,
+            dimension: indexStats.dimension,
+        };
+    }
+    getCacheStats() {
+        return this.cache.getStats();
+    }
+}
+/**
+ * Create vector search engine based on adapter type
+ */
+export function createVectorSearchEngine(adapter, options) {
+    if (adapter.type === 'postgresql') {
+        return new PgVectorSearchEngine(adapter, options);
+    }
+    return new SqliteVectorSearchEngine(adapter, options);
+}
+export default {
+    PgVectorSearchEngine,
+    SqliteVectorSearchEngine,
+    createVectorSearchEngine,
+};
+//# sourceMappingURL=index.js.map

package/dist/database/vector/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/database/vector/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAqB,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAoB,cAAc,EAAsB,MAAM,iBAAiB,CAAC;AAEvF,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAErD,MAAM,MAAM,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;AAE5C,uBAAuB;AACvB,OAAO,EAAE,SAAS,EAAqB,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,cAAc,EAA4B,MAAM,sBAAsB,CAAC;AAChF,cAAc,iBAAiB,CAAC;AAEhC;;GAEG;AACH,MAAM,OAAO,oBAAoB;IACvB,OAAO,CAAkB;IACzB,SAAS,CAAS;IAClB,eAAe,CAAS;IACxB,SAAS,CAAS;IAE1B,YACE,OAAwB,EACxB,OAIC;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,WAAW,CAAC;QAC9D,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC7C,CAAC;IAED,KAAK,CAAC,UAAU;QACd,2CAA2C;QAC3C,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,EAAU,EAAE,SAAmB,EAAE,QAAkC;QAC7E,qEAAqE;QACrE,MAAM,CAAC,KAAK,CAAC,sCAAsC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,cAAwB,EAAE,UAA+B,EAAE;QACtE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,aAAa,GAAG,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;QACvE,MAAM,YAAY,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAErD,IAAI,GAAG,GAAG;;oBAEM,IAAI,CAAC,eAAe;aAC3B,IAAI,CAAC,SAAS;mBACR,IAAI,CAAC,eAAe;KAClC,CAAC;QACF,MAAM,MAAM,GAAc,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;QACxD,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,IAAI,MAAM,EAAE,CAAC;YACX,GAAG,IAAI,mBAAmB,QAAQ,EAAE,CAAC;YACrC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,QAAQ,EAAE,CAAC;QACb,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,GAAG,IAAI,uBAAuB,QAAQ,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxB,QAAQ,EAAE,CAAC;QACb,CAAC;QAED,GAAG,IAAI,oCAAoC,QAAQ,EAAE,CAAC;QACtD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEnB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAMpC,GAAG,EAAE,MAAM,CAAC,CAAC;QAEhB,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC/B,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,UAAU,EAAE,GAAG,CAAC,WAAW;YAC3B,QAAQ,EAAE,GAAG,CAAC,QAAQ;SACvB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,0BAA0B;QAC1B,MAAM,CAAC,KAAK,CAAC,uCAAuC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,6CAA6C;QAC7C,MAAM,CAAC,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAC/D,CAAC;IAED,QAAQ;QACN,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,2BAA2B;IAC5E,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,wBAAwB;IAC3B,OAAO,CAAkB;IACzB,SAAS,CAAS;IAClB,KAAK,CAAY;IACjB,KAAK,CAAiB;IACtB,SAAS,CAAS;IAClB,WAAW,GAAY,KAAK,CAAC;IAErC,YACE,OAAwB,EACxB,OAIC;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAC;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,UAAU,EAAE,QAAQ;YACpB,CAAC,EAAE,EAAE;YACL,cAAc,EAAE,GAAG;SACpB,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,cAAc,CAAC;YAC9B,OAAO,EAAE,OAAO,CAAC,SAAS,IAAI,KAAK;YACnC,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,gDAAgD;QAChD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAKpC,mDAAmD,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAExE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAChD,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;gBACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBAClC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC,sCAAsC,EAAE;YAClD,KAAK,EAAE,IAAI,CAAC,SAAS;YACrB,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,EAAU,EAAE,SAAmB,EAAE,QAAkC;QAC7E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,cAAwB,EAAE,UAA+B,EAAE;QACtE,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,aAAa,GAAG,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;QAEvE,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAEhE,yDAAyD;QACzD,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;QAEzE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,iCAAiC;QACjC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE9D,IAAI,GAAG,GAAG,kDAAkD,IAAI,CAAC,SAAS,iBAAiB,YAAY,GAAG,CAAC;QAC3G,MAAM,MAAM,GAAc,CAAC,GAAG,GAAG,CAAC,CAAC;QAEnC,IAAI,MAAM,EAAE,CAAC;YACX,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,oBAAoB,MAAM,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC;YACxE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,wBAAwB,MAAM,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5E,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAKpC,GAAG,EAAE,MAAM,CAAC,CAAC;QAEhB,gCAAgC;QAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiC,CAAC;QAC3D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC7B,CAAC;QAED,uCAAuC;QACvC,MAAM,OAAO,GAAyB,EAAE,CAAC;QACzC,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC;oBACX,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,UAAU,EAAE,SAAS,CAAC,UAAU;oBAChC,UAAU,EAAE,MAAM,CAAC,WAAW;oBAC9B,QAAQ,EAAE,OAAO,MAAM,CAAC,QAAQ,KAAK,QAAQ;wBAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;wBAC7B,CAAC,CAAC,MAAM,CAAC,QAAQ;iBACpB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,OAAO,OAAO;aACX,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;IAC1B,CAAC;IAED,QAAQ;QACN,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACzC,OAAO;YACL,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,SAAS,EAAE,UAAU,CAAC,SAAS;SAChC,CAAC;IACJ,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,OAAwB,EACxB,OAKC;IAED,IAAI,OAAO,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QAClC,OAAO,IAAI,oBAAoB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,IAAI,wBAAwB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,eAAe;IACb,oBAAoB;IACpB,wBAAwB;IACxB,wBAAwB;CACzB,CAAC"}