@planu/cli 0.28.0 → 0.30.0

package/dist/engine/vector-store/hnsw.js

@@ -0,0 +1,294 @@
+// engine/vector-store/hnsw.ts — HNSW index for approximate nearest neighbor search.
+// SPEC-075 AC-02: Pure TypeScript, O(log n), recall > 0.9.
+import { cosineSimilarity } from './similarity.js';
+/**
+ * HNSW (Hierarchical Navigable Small World) index.
+ * For corpus < flatSearchThreshold, delegates to brute-force flat search.
+ */
+export class HNSWIndex {
+    config;
+    nodes = new Map();
+    entryPoint = null;
+    maxLayer = 0;
+    constructor(config) {
+        this.config = {
+            M: config?.M ?? 16,
+            efConstruction: config?.efConstruction ?? 200,
+            efSearch: config?.efSearch ?? 50,
+            flatSearchThreshold: config?.flatSearchThreshold ?? 1000,
+        };
+    }
+    /** Number of indexed vectors. */
+    get size() {
+        return this.nodes.size;
+    }
+    /** Insert a vector into the index. */
+    insert(id, vector) {
+        const level = this.randomLevel();
+        const layers = [];
+        for (let i = 0; i <= level; i++) {
+            layers.push(new Map());
+        }
+        const node = { id, vector, layers };
+        if (this.nodes.size === 0) {
+            this.nodes.set(id, node);
+            this.entryPoint = id;
+            this.maxLayer = level;
+            return;
+        }
+        // Navigate from top to insertion level
+        /* v8 ignore start -- entryPoint always set when nodes.size > 0 */
+        let currentId = this.entryPoint ?? id;
+        /* v8 ignore stop */
+        for (let lc = this.maxLayer; lc > level; lc--) {
+            currentId = this.greedyClosest(currentId, vector, lc);
+        }
+        // Insert at each layer from level down to 0
+        for (let lc = Math.min(level, this.maxLayer); lc >= 0; lc--) {
+            const neighbors = this.searchLayer(currentId, vector, this.config.efConstruction, lc);
+            const selected = neighbors.slice(0, this.config.M);
+            for (const nb of selected) {
+                const sim = nb.similarity;
+                node.layers[lc]?.set(nb.id, sim);
+                const nbNode = this.nodes.get(nb.id);
+                /* v8 ignore start -- neighbor always exists and has layers at lc */
+                if (nbNode && lc < nbNode.layers.length) {
+                    /* v8 ignore stop */
+                    nbNode.layers[lc]?.set(id, sim);
+                    // Prune if too many connections
+                    /* v8 ignore start -- lc always within nbNode.layers bounds */
+                    if ((nbNode.layers[lc]?.size ?? 0) > this.config.M * 2) {
+                        /* v8 ignore stop */
+                        this.pruneConnections(nbNode, lc);
+                    }
+                }
+            }
+            const first = selected[0];
+            /* v8 ignore start -- searchLayer always returns at least one result */
+            if (first) {
+                /* v8 ignore stop */
+                currentId = first.id;
+            }
+        }
+        this.nodes.set(id, node);
+        if (level > this.maxLayer) {
+            this.maxLayer = level;
+            this.entryPoint = id;
+        }
+    }
+    /** Remove a vector from the index. */
+    remove(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            return false;
+        }
+        // Remove references from neighbors
+        for (let lc = 0; lc < node.layers.length; lc++) {
+            const layer = node.layers[lc];
+            /* v8 ignore start -- defensive: layers always exist within bounds */
+            if (!layer) {
+                continue;
+            }
+            /* v8 ignore stop */
+            for (const neighborId of layer.keys()) {
+                const neighbor = this.nodes.get(neighborId);
+                /* v8 ignore start -- neighbor always exists in graph */
+                if (neighbor && lc < neighbor.layers.length) {
+                    /* v8 ignore stop */
+                    neighbor.layers[lc]?.delete(id);
+                }
+            }
+        }
+        this.nodes.delete(id);
+        // Update entry point if needed
+        if (this.entryPoint === id) {
+            /* v8 ignore start -- Map.keys().next().value always defined when size > 0 */
+            this.entryPoint = this.nodes.size > 0 ? (this.nodes.keys().next().value ?? null) : null;
+            /* v8 ignore stop */
+            this.maxLayer = 0;
+            for (const n of this.nodes.values()) {
+                if (n.layers.length - 1 > this.maxLayer) {
+                    this.maxLayer = n.layers.length - 1;
+                    this.entryPoint = n.id;
+                }
+            }
+        }
+        return true;
+    }
+    /** Search for the top-K nearest neighbors. Uses flat search for small corpus. */
+    search(query, topK) {
+        if (this.nodes.size === 0) {
+            return [];
+        }
+        // Flat search for small corpus
+        if (this.nodes.size < this.config.flatSearchThreshold) {
+            return this.flatSearch(query, topK);
+        }
+        return this.hnswSearch(query, topK);
+    }
+    /** Brute-force flat search -- guaranteed recall = 1.0. */
+    flatSearch(query, topK) {
+        const results = [];
+        for (const node of this.nodes.values()) {
+            results.push({ id: node.id, similarity: cosineSimilarity(query, node.vector) });
+        }
+        results.sort((a, b) => b.similarity - a.similarity);
+        return results.slice(0, topK);
+    }
+    /** HNSW graph search -- approximate, O(log n). */
+    hnswSearch(query, topK) {
+        /* v8 ignore start -- entryPoint always set when called (size > 0) */
+        let currentId = this.entryPoint ?? '';
+        /* v8 ignore stop */
+        // Traverse from top layer to layer 1
+        for (let lc = this.maxLayer; lc > 0; lc--) {
+            currentId = this.greedyClosest(currentId, query, lc);
+        }
+        // Search at layer 0 with efSearch candidates
+        const candidates = this.searchLayer(currentId, query, this.config.efSearch, 0);
+        return candidates.slice(0, topK);
+    }
+    /** Greedy walk to the closest node in a given layer. */
+    greedyClosest(startId, query, layer) {
+        let bestId = startId;
+        const startNode = this.nodes.get(startId);
+        /* v8 ignore start -- defensive: startId always valid when called internally */
+        if (!startNode) {
+            return bestId;
+        }
+        /* v8 ignore stop */
+        let bestSim = cosineSimilarity(query, startNode.vector);
+        let improved = true;
+        while (improved) {
+            improved = false;
+            const node = this.nodes.get(bestId);
+            /* v8 ignore start -- defensive: bestId always valid in walk */
+            if (!node || layer >= node.layers.length) {
+                break;
+            }
+            /* v8 ignore stop */
+            const neighbors = node.layers[layer];
+            /* v8 ignore start -- defensive: layer within bounds */
+            if (!neighbors) {
+                break;
+            }
+            /* v8 ignore stop */
+            for (const neighborId of neighbors.keys()) {
+                const neighbor = this.nodes.get(neighborId);
+                /* v8 ignore start -- defensive: neighbor always valid in graph */
+                if (!neighbor) {
+                    continue;
+                }
+                /* v8 ignore stop */
+                const sim = cosineSimilarity(query, neighbor.vector);
+                if (sim > bestSim) {
+                    bestSim = sim;
+                    bestId = neighborId;
+                    improved = true;
+                }
+            }
+        }
+        return bestId;
+    }
+    /** Search a single layer, returning ef closest candidates. */
+    searchLayer(startId, query, ef, layer) {
+        const visited = new Set([startId]);
+        const startNode = this.nodes.get(startId);
+        /* v8 ignore start -- defensive: startId always valid */
+        if (!startNode) {
+            return [];
+        }
+        /* v8 ignore stop */
+        const candidates = [
+            { id: startId, similarity: cosineSimilarity(query, startNode.vector) },
+        ];
+        const queue = [startId];
+        while (queue.length > 0) {
+            const currentId = queue.shift();
+            /* v8 ignore start -- defensive: queue checked non-empty */
+            if (!currentId) {
+                continue;
+            }
+            /* v8 ignore stop */
+            const current = this.nodes.get(currentId);
+            /* v8 ignore start -- defensive: currentId always valid */
+            if (!current || layer >= current.layers.length) {
+                continue;
+            }
+            /* v8 ignore stop */
+            const neighbors = current.layers[layer];
+            /* v8 ignore start -- defensive: layer within bounds */
+            if (!neighbors) {
+                continue;
+            }
+            /* v8 ignore stop */
+            for (const neighborId of neighbors.keys()) {
+                if (visited.has(neighborId)) {
+                    continue;
+                }
+                visited.add(neighborId);
+                const neighbor = this.nodes.get(neighborId);
+                /* v8 ignore start -- defensive: neighbor always in graph */
+                if (!neighbor) {
+                    continue;
+                }
+                /* v8 ignore stop */
+                const sim = cosineSimilarity(query, neighbor.vector);
+                candidates.push({ id: neighborId, similarity: sim });
+                queue.push(neighborId);
+                // Keep candidate list bounded
+                /* v8 ignore start -- requires corpus > ef*2 neighbors from a single node */
+                if (candidates.length > ef * 2) {
+                    candidates.sort((a, b) => b.similarity - a.similarity);
+                    candidates.length = ef;
+                }
+                /* v8 ignore stop */
+            }
+        }
+        candidates.sort((a, b) => b.similarity - a.similarity);
+        return candidates.slice(0, ef);
+    }
+    /** Prune connections to keep at most M neighbors. */
+    pruneConnections(node, layer) {
+        const layerMap = node.layers[layer];
+        /* v8 ignore start -- defensive: layer always valid when called */
+        if (!layerMap) {
+            return;
+        }
+        /* v8 ignore stop */
+        const entries = [...layerMap.entries()].sort((a, b) => b[1] - a[1]);
+        layerMap.clear();
+        for (const [id, sim] of entries.slice(0, this.config.M)) {
+            layerMap.set(id, sim);
+        }
+    }
+    /** Random level for a new node (geometric distribution). */
+    randomLevel() {
+        const ml = 1 / Math.log(this.config.M);
+        let level = 0;
+        while (Math.random() < ml && level < 16) {
+            level++;
+        }
+        return level;
+    }
+    /** Export the index for serialization. */
+    exportState() {
+        const nodes = [...this.nodes.values()].map((n) => ({
+            id: n.id,
+            vector: n.vector,
+            layers: n.layers.map((l) => [...l.entries()]),
+        }));
+        return { nodes, entryPoint: this.entryPoint, maxLayer: this.maxLayer };
+    }
+    /** Import the index from serialized form. */
+    importState(state) {
+        this.nodes.clear();
+        for (const n of state.nodes) {
+            const layers = n.layers.map((l) => new Map(l));
+            this.nodes.set(n.id, { id: n.id, vector: n.vector, layers });
+        }
+        this.entryPoint = state.entryPoint;
+        this.maxLayer = state.maxLayer;
+    }
+}
+//# sourceMappingURL=hnsw.js.map

package/dist/engine/vector-store/hnsw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw.js","sourceRoot":"","sources":["../../../src/engine/vector-store/hnsw.ts"],"names":[],"mappings":"AAAA,oFAAoF;AACpF,2DAA2D;AAQ3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD;;;GAGG;AACH,MAAM,OAAO,SAAS;IACH,MAAM,CAAa;IACnB,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,UAAU,GAAkB,IAAI,CAAC;IACjC,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,MAA4B;QACtC,IAAI,CAAC,MAAM,GAAG;YACZ,CAAC,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE;YAClB,cAAc,EAAE,MAAM,EAAE,cAAc,IAAI,GAAG;YAC7C,QAAQ,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE;YAChC,mBAAmB,EAAE,MAAM,EAAE,mBAAmB,IAAI,IAAI;SACzD,CAAC;IACJ,CAAC;IAED,iCAAiC;IACjC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,sCAAsC;IACtC,MAAM,CAAC,EAAU,EAAE,MAAgB;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,EAAkB,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,IAAI,GAAa,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAE9C,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,OAAO;QACT,CAAC;QAED,uCAAuC;QACvC,kEAAkE;QAClE,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;QACtC,oBAAoB;QACpB,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;YAC9C,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,4CAA4C;QAC5C,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YACtF,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEnD,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrC,oEAAoE;gBACpE,IAAI,MAAM,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBACxC,oBAAoB;oBACpB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;oBAChC,gCAAgC;oBAChC,8DAA8D;oBAC9D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;wBACvD,oBAAoB;wBACpB,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,uEAAuE;YACvE,IAAI,KAAK,EAAE,CAAC;gBACV,oBAAoB;gBACpB,SAAS,GAAG,KAAK,CAAC,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEzB,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,MAAM,CAAC,EAAU;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,KAAK,CAAC;QACf,CAAC;QAED,mCAAmC;QACnC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9B,qEAAqE;YACrE,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;YACD,oBAAoB;YACpB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,wDAAwD;gBACxD,IAAI,QAAQ,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC5C,oBAAoB;oBACpB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;gBAClC,CAAC;YACH,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,6EAA6E;YAC7E,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACxF,oBAAoB;YACpB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACpC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACxC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;oBACpC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iFAAiF;IACjF,MAAM,CAAC,KAAe,EAAE,IAAY;QAClC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,+BAA+B;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;YACtD,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,0DAA0D;IAClD,UAAU,CAAC,KAAe,EAAE,IAAY;QAC9C,MAAM,OAAO,GAA0B,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,kDAAkD;IAC1C,UAAU,CAAC,KAAe,EAAE,IAAY;QAC9C,qEAAqE;QACrE,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;QACtC,oBAAoB;QAEpB,qCAAqC;QACrC,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC1C,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACvD,CAAC;QAED,6CAA6C;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,wDAAwD;IAChD,aAAa,CAAC,OAAe,EAAE,KAAe,EAAE,KAAa;QACnE,IAAI,MAAM,GAAG,OAAO,CAAC;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,+EAA+E;QAC/E,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,oBAAoB;QACpB,IAAI,OAAO,GAAG,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAExD,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,OAAO,QAAQ,EAAE,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,+DAA+D;YAC/D,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACzC,MAAM;YACR,CAAC;YACD,oBAAoB;YACpB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,uDAAuD;YACvD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,MAAM;YACR,CAAC;YACD,oBAAoB;YAEpB,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,kEAAkE;gBAClE,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,SAAS;gBACX,CAAC;gBACD,oBAAoB;gBACpB,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACrD,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;oBAClB,OAAO,GAAG,GAAG,CAAC;oBACd,MAAM,GAAG,UAAU,CAAC;oBACpB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,8DAA8D;IACtD,WAAW,CACjB,OAAe,EACf,KAAe,EACf,EAAU,EACV,KAAa;QAEb,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,wDAAwD;QACxD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,oBAAoB;QAEpB,MAAM,UAAU,GAA0B;YACxC,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE;SACvE,CAAC;QAEF,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAChC,2DAA2D;YAC3D,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS;YACX,CAAC;YACD,oBAAoB;YACpB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1C,0DAA0D;YAC1D,IAAI,CAAC,OAAO,IAAI,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC/C,SAAS;YACX,CAAC;YACD,oBAAoB;YACpB,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACxC,uDAAuD;YACvD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS;YACX,CAAC;YACD,oBAAoB;YAEpB,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC5B,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,4DAA4D;gBAC5D,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,SAAS;gBACX,CAAC;gBACD,oBAAoB;gBAEpB,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACrD,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAEvB,8BAA8B;gBAC9B,4EAA4E;gBAC5E,IAAI,UAAU,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC/B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;oBACvD,UAAU,CAAC,MAAM,GAAG,EAAE,CAAC;gBACzB,CAAC;gBACD,oBAAoB;YACtB,CAAC;QACH,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QACvD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,qDAAqD;IAC7C,gBAAgB,CAAC,IAAc,EAAE,KAAa;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,kEAAkE;QAClE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;QACT,CAAC;QACD,oBAAoB;QAEpB,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,4DAA4D;IACpD,WAAW;QACjB,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACxC,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0CAA0C;IAC1C,WAAW;QACT,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjD,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SAC9C,CAAC,CAAC,CAAC;QACJ,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzE,CAAC;IAED,6CAA6C;IAC7C,WAAW,CAAC,KAA0B;QACpC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IACjC,CAAC;CACF"}

package/dist/engine/vector-store/similarity.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [0, 1] where 1 means identical direction.
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Compute Jaccard similarity between two binary-ish vectors.
+ * Treats non-zero values as "present". Returns value in [0, 1].
+ */
+export declare function jaccardSimilarity(a: number[], b: number[]): number;
+/**
+ * Combined similarity: weighted average of cosine and jaccard.
+ * Default weights: 0.8 cosine + 0.2 jaccard.
+ */
+export declare function combinedSimilarity(a: number[], b: number[], cosineWeight?: number): number;
+/**
+ * Normalize a vector to unit length (L2 norm).
+ * Returns a new array. If the vector is zero, returns a zero vector.
+ */
+export declare function normalizeVector(v: number[]): number[];
+//# sourceMappingURL=similarity.d.ts.map

package/dist/engine/vector-store/similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../../src/engine/vector-store/similarity.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CA2BjE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CA4BlE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,YAAY,SAAM,GAAG,MAAM,CAIvF;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAUrD"}

package/dist/engine/vector-store/similarity.js

@@ -0,0 +1,86 @@
+// engine/vector-store/similarity.ts — Similarity metrics for vector comparison.
+// SPEC-075: cosine, jaccard, combined similarity functions.
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [0, 1] where 1 means identical direction.
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length === 0 || b.length === 0) {
+        return 0;
+    }
+    if (a.length !== b.length) {
+        return 0;
+    }
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        /* v8 ignore start -- noUncheckedIndexedAccess: i always within bounds */
+        const ai = a[i] ?? 0;
+        const bi = b[i] ?? 0;
+        /* v8 ignore stop */
+        dot += ai * bi;
+        normA += ai * ai;
+        normB += bi * bi;
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denom === 0) {
+        return 0;
+    }
+    return dot / denom;
+}
+/**
+ * Compute Jaccard similarity between two binary-ish vectors.
+ * Treats non-zero values as "present". Returns value in [0, 1].
+ */
+export function jaccardSimilarity(a, b) {
+    if (a.length === 0 || b.length === 0) {
+        return 0;
+    }
+    if (a.length !== b.length) {
+        return 0;
+    }
+    let intersection = 0;
+    let union = 0;
+    for (let i = 0; i < a.length; i++) {
+        /* v8 ignore start -- noUncheckedIndexedAccess: i always within bounds */
+        const aPresent = (a[i] ?? 0) !== 0;
+        const bPresent = (b[i] ?? 0) !== 0;
+        /* v8 ignore stop */
+        if (aPresent || bPresent) {
+            union++;
+            if (aPresent && bPresent) {
+                intersection++;
+            }
+        }
+    }
+    if (union === 0) {
+        return 0;
+    }
+    return intersection / union;
+}
+/**
+ * Combined similarity: weighted average of cosine and jaccard.
+ * Default weights: 0.8 cosine + 0.2 jaccard.
+ */
+export function combinedSimilarity(a, b, cosineWeight = 0.8) {
+    const cos = cosineSimilarity(a, b);
+    const jac = jaccardSimilarity(a, b);
+    return cos * cosineWeight + jac * (1 - cosineWeight);
+}
+/**
+ * Normalize a vector to unit length (L2 norm).
+ * Returns a new array. If the vector is zero, returns a zero vector.
+ */
+export function normalizeVector(v) {
+    let norm = 0;
+    for (const val of v) {
+        norm += val * val;
+    }
+    norm = Math.sqrt(norm);
+    if (norm === 0) {
+        return v.map(() => 0);
+    }
+    return v.map((val) => val / norm);
+}
+//# sourceMappingURL=similarity.js.map

package/dist/engine/vector-store/similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.js","sourceRoot":"","sources":["../../../src/engine/vector-store/similarity.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,4DAA4D;AAE5D;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,yEAAyE;QACzE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrB,oBAAoB;QACpB,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;QACf,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,GAAG,GAAG,KAAK,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACxD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,yEAAyE;QACzE,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QACnC,oBAAoB;QACpB,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,EAAE,CAAC;YACR,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBACzB,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,YAAY,GAAG,KAAK,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAW,EAAE,CAAW,EAAE,YAAY,GAAG,GAAG;IAC7E,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,OAAO,GAAG,GAAG,YAAY,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,CAAW;IACzC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;AACpC,CAAC"}

package/dist/engine/vector-store/tfidf.d.ts

@@ -0,0 +1,35 @@
+import type { TFIDFConfig } from '../../types/index.js';
+/** Tokenize text: split on whitespace/punctuation, split camelCase, lowercase, remove stop words. */
+export declare function tokenize(text: string, stopWords?: Set<string>): string[];
+/** TF-IDF engine: stateful, maintains vocabulary (IDF) across documents. */
+export declare class TFIDFEngine {
+    private readonly config;
+    private readonly docFreq;
+    private docCount;
+    private vocabulary;
+    private vocabDirty;
+    constructor(config?: Partial<TFIDFConfig>);
+    /** Add a document to the corpus (updates IDF). */
+    addDocument(text: string): void;
+    /** Rebuild vocabulary: top-K most discriminating terms by IDF. */
+    private rebuildVocabulary;
+    /** Generate a normalized TF-IDF embedding for the given text. */
+    embed(text: string): number[];
+    /** Batch embed multiple texts. */
+    batchEmbed(texts: string[]): number[][];
+    /** Get current vocabulary size. */
+    getVocabularySize(): number;
+    /** Get document count in corpus. */
+    getDocumentCount(): number;
+    /** Export state for serialization. */
+    exportState(): {
+        docFreq: [string, number][];
+        docCount: number;
+    };
+    /** Import state from serialized form. */
+    importState(state: {
+        docFreq: [string, number][];
+        docCount: number;
+    }): void;
+}
+//# sourceMappingURL=tfidf.d.ts.map

package/dist/engine/vector-store/tfidf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.d.ts","sourceRoot":"","sources":["../../../src/engine/vector-store/tfidf.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAwJxD,qGAAqG;AACrG,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,GAAG,CAAC,MAAM,CAAsB,GAAG,MAAM,EAAE,CAS5F;AAED,4EAA4E;AAC5E,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA6B;IACrD,OAAO,CAAC,QAAQ,CAAK;IACrB,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,UAAU,CAAQ;gBAEd,MAAM,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC;IAQzC,kDAAkD;IAClD,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAU/B,kEAAkE;IAClE,OAAO,CAAC,iBAAiB;IAiBzB,iEAAiE;IACjE,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IA0B7B,kCAAkC;IAClC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE;IAIvC,mCAAmC;IACnC,iBAAiB,IAAI,MAAM;IAK3B,oCAAoC;IACpC,gBAAgB,IAAI,MAAM;IAI1B,sCAAsC;IACtC,WAAW,IAAI;QAAE,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE;IAOhE,yCAAyC;IACzC,WAAW,CAAC,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;CAQ5E"}