@monoes/memory 1.0.20 → 1.0.21

package/dist/hnsw-distance.d.ts

@@ -0,0 +1,31 @@
+/**
+ * V1 HNSW Vector Index — distance metrics
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: the method bodies
+ * are unchanged; state previously reached via `this` (the configured metric,
+ * a node's normalized vector) is now passed in explicitly by the caller.
+ *
+ * @module v1/memory/hnsw-distance
+ */
+import type { HNSWNode } from './hnsw-index.js';
+import type { DistanceMetric } from './types.js';
+export declare function distance(metric: DistanceMetric, a: Float32Array, b: Float32Array): number;
+export declare function cosineDistance(a: Float32Array, b: Float32Array): number;
+/**
+ * OPTIMIZED: Cosine distance using pre-normalized vectors
+ * Only requires dot product (no sqrt operations)
+ * Performance: O(n) with ~2x speedup over standard cosine
+ */
+export declare function cosineDistanceNormalized(a: Float32Array, b: Float32Array): number;
+/**
+ * Normalize a vector to unit length for O(1) cosine similarity
+ */
+export declare function normalizeVector(vector: Float32Array): Float32Array;
+/**
+ * OPTIMIZED distance calculation that uses pre-normalized vectors when available
+ */
+export declare function distanceOptimized(metric: DistanceMetric, query: Float32Array, normalizedQuery: Float32Array | null, node: HNSWNode): number;
+export declare function euclideanDistance(a: Float32Array, b: Float32Array): number;
+export declare function dotProductDistance(a: Float32Array, b: Float32Array): number;
+export declare function manhattanDistance(a: Float32Array, b: Float32Array): number;
+//# sourceMappingURL=hnsw-distance.d.ts.map

package/dist/hnsw-distance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-distance.d.ts","sourceRoot":"","sources":["../src/hnsw-distance.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEjD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAazF;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAevE;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAQjF;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,YAAY,CAiBlE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,cAAc,EACtB,KAAK,EAAE,YAAY,EACnB,eAAe,EAAE,YAAY,GAAG,IAAI,EACpC,IAAI,EAAE,QAAQ,GACb,MAAM,CAQR;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAO1E;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAO3E;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAM1E"}

package/dist/hnsw-distance.js

@@ -0,0 +1,106 @@
+/**
+ * V1 HNSW Vector Index — distance metrics
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: the method bodies
+ * are unchanged; state previously reached via `this` (the configured metric,
+ * a node's normalized vector) is now passed in explicitly by the caller.
+ *
+ * @module v1/memory/hnsw-distance
+ */
+export function distance(metric, a, b) {
+    switch (metric) {
+        case 'cosine':
+            return cosineDistance(a, b);
+        case 'euclidean':
+            return euclideanDistance(a, b);
+        case 'dot':
+            return dotProductDistance(a, b);
+        case 'manhattan':
+            return manhattanDistance(a, b);
+        default:
+            return cosineDistance(a, b);
+    }
+}
+export function cosineDistance(a, b) {
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denom === 0)
+        return 1; // zero vector has maximum distance
+    const similarity = dotProduct / denom;
+    return 1 - similarity; // Convert to distance
+}
+/**
+ * OPTIMIZED: Cosine distance using pre-normalized vectors
+ * Only requires dot product (no sqrt operations)
+ * Performance: O(n) with ~2x speedup over standard cosine
+ */
+export function cosineDistanceNormalized(a, b) {
+    let dotProduct = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+    }
+    // For normalized vectors: cosine_similarity = dot_product
+    // Return distance (1 - similarity)
+    return 1 - dotProduct;
+}
+/**
+ * Normalize a vector to unit length for O(1) cosine similarity
+ */
+export function normalizeVector(vector) {
+    let norm = 0;
+    for (let i = 0; i < vector.length; i++) {
+        const v = Number.isFinite(vector[i]) ? vector[i] : 0;
+        norm += v * v;
+    }
+    norm = Math.sqrt(norm);
+    if (norm === 0 || !Number.isFinite(norm)) {
+        return new Float32Array(vector.length); // safe zero vector for non-finite input
+    }
+    const normalized = new Float32Array(vector.length);
+    for (let i = 0; i < vector.length; i++) {
+        normalized[i] = (Number.isFinite(vector[i]) ? vector[i] : 0) / norm;
+    }
+    return normalized;
+}
+/**
+ * OPTIMIZED distance calculation that uses pre-normalized vectors when available
+ */
+export function distanceOptimized(metric, query, normalizedQuery, node) {
+    // Use optimized path for cosine with pre-normalized vectors
+    if (metric === 'cosine' && normalizedQuery !== null && node.normalizedVector !== null) {
+        return cosineDistanceNormalized(normalizedQuery, node.normalizedVector);
+    }
+    // Fall back to standard distance calculation
+    return distance(metric, query, node.vector);
+}
+export function euclideanDistance(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    return Math.sqrt(sum);
+}
+export function dotProductDistance(a, b) {
+    let dotProduct = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+    }
+    // Negative because higher dot product = more similar
+    return -dotProduct;
+}
+export function manhattanDistance(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        sum += Math.abs(a[i] - b[i]);
+    }
+    return sum;
+}
+//# sourceMappingURL=hnsw-distance.js.map

package/dist/hnsw-distance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-distance.js","sourceRoot":"","sources":["../src/hnsw-distance.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH,MAAM,UAAU,QAAQ,CAAC,MAAsB,EAAE,CAAe,EAAE,CAAe;IAC/E,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,QAAQ;YACX,OAAO,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,KAAK,WAAW;YACd,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,KAAK,KAAK;YACR,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,KAAK,WAAW;YACd,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC;YACE,OAAO,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAe,EAAE,CAAe;IAC7D,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,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,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,mCAAmC;IAC9D,MAAM,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC;IACtC,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC,sBAAsB;AAC/C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CAAC,CAAe,EAAE,CAAe;IACvE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,0DAA0D;IAC1D,mCAAmC;IACnC,OAAO,CAAC,GAAG,UAAU,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAoB;IAClD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEvB,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,wCAAwC;IAClF,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACtE,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAsB,EACtB,KAAmB,EACnB,eAAoC,EACpC,IAAc;IAEd,4DAA4D;IAC5D,IAAI,MAAM,KAAK,QAAQ,IAAI,eAAe,KAAK,IAAI,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,EAAE,CAAC;QACtF,OAAO,wBAAwB,CAAC,eAAe,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC1E,CAAC;IAED,6CAA6C;IAC7C,OAAO,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,CAAe,EAAE,CAAe;IAChE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,CAAe,EAAE,CAAe;IACjE,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,qDAAqD;IACrD,OAAO,CAAC,UAAU,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,CAAe,EAAE,CAAe;IAChE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/hnsw-graph-ops.d.ts

@@ -0,0 +1,29 @@
+/**
+ * V1 HNSW Vector Index — graph search/maintenance operations
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: the method bodies
+ * are unchanged; the node map and configured metric previously reached via
+ * `this` are now passed in explicitly by the caller.
+ *
+ * @module v1/memory/hnsw-graph-ops
+ */
+import type { HNSWNode } from './hnsw-index.js';
+import type { DistanceMetric } from './types.js';
+/**
+ * OPTIMIZED searchLayer using heap-based priority queues
+ * Performance: O(log n) per operation vs O(n log n) for Array.sort()
+ * Expected speedup: 3-5x for large result sets
+ */
+export declare function searchLayerOptimized(nodes: Map<string, HNSWNode>, metric: DistanceMetric, query: Float32Array, normalizedQuery: Float32Array | null, entryPoint: string, ef: number, level: number): Array<{
+    id: string;
+    distance: number;
+}>;
+export declare function selectNeighbors(nodeId: string, _query: Float32Array, candidates: Array<{
+    id: string;
+    distance: number;
+}>, M: number): Array<{
+    id: string;
+    distance: number;
+}>;
+export declare function pruneConnections(nodes: Map<string, HNSWNode>, metric: DistanceMetric, node: HNSWNode, level: number, maxConnections: number): void;
+//# sourceMappingURL=hnsw-graph-ops.d.ts.map

package/dist/hnsw-graph-ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-graph-ops.d.ts","sourceRoot":"","sources":["../src/hnsw-graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAEjD;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,EAC5B,MAAM,EAAE,cAAc,EACtB,KAAK,EAAE,YAAY,EACnB,eAAe,EAAE,YAAY,GAAG,IAAI,EACpC,UAAU,EAAE,MAAM,EAClB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,GACZ,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CAwDzC;AAED,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,EACnD,CAAC,EAAE,MAAM,GACR,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,CAIzC;AAED,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,EAC5B,MAAM,EAAE,cAAc,EACtB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,GACrB,IAAI,CA2BN"}

package/dist/hnsw-graph-ops.js

@@ -0,0 +1,96 @@
+/**
+ * V1 HNSW Vector Index — graph search/maintenance operations
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: the method bodies
+ * are unchanged; the node map and configured metric previously reached via
+ * `this` are now passed in explicitly by the caller.
+ *
+ * @module v1/memory/hnsw-graph-ops
+ */
+import { distance, distanceOptimized } from './hnsw-distance.js';
+import { BinaryMaxHeap, BinaryMinHeap } from './hnsw-heap.js';
+/**
+ * OPTIMIZED searchLayer using heap-based priority queues
+ * Performance: O(log n) per operation vs O(n log n) for Array.sort()
+ * Expected speedup: 3-5x for large result sets
+ */
+export function searchLayerOptimized(nodes, metric, query, normalizedQuery, entryPoint, ef, level) {
+    const visited = new Set([entryPoint]);
+    // Min-heap for candidates (closest first for expansion)
+    const candidates = new BinaryMinHeap();
+    // Max-heap for results (bounded size, tracks worst distance efficiently)
+    const results = new BinaryMaxHeap(ef);
+    const entryNode = nodes.get(entryPoint);
+    const entryDist = distanceOptimized(metric, query, normalizedQuery, entryNode);
+    candidates.insert(entryPoint, entryDist);
+    results.insert(entryPoint, entryDist);
+    while (!candidates.isEmpty()) {
+        // Get closest candidate - O(log n)
+        const currentDist = candidates.peekPriority();
+        const currentId = candidates.extractMin();
+        // Check termination: if closest candidate is worse than worst result, stop
+        const worstResultDist = results.peekMaxPriority();
+        if (currentDist > worstResultDist && results.size >= ef) {
+            break;
+        }
+        // Explore neighbors
+        const node = nodes.get(currentId);
+        if (!node)
+            continue;
+        const connections = node.connections.get(level);
+        if (!connections)
+            continue;
+        for (const neighborId of connections) {
+            if (visited.has(neighborId))
+                continue;
+            visited.add(neighborId);
+            const neighborNode = nodes.get(neighborId);
+            if (!neighborNode)
+                continue;
+            const dist = distanceOptimized(metric, query, normalizedQuery, neighborNode);
+            // Only add if within threshold or results not full
+            if (results.size < ef || dist < worstResultDist) {
+                candidates.insert(neighborId, dist);
+                // Max-heap handles size bounding automatically - O(log n)
+                results.insert(neighborId, dist);
+            }
+        }
+    }
+    // Return sorted results
+    return results.toSortedArray().map(({ item, priority }) => ({
+        id: item,
+        distance: priority,
+    }));
+}
+export function selectNeighbors(nodeId, _query, candidates, M) {
+    // candidates arrive distance-ascending from searchLayerOptimized/toSortedArray;
+    // filter preserves that order, so no additional sort is needed.
+    return candidates.filter((c) => c.id !== nodeId).slice(0, M);
+}
+export function pruneConnections(nodes, metric, node, level, maxConnections) {
+    const connections = node.connections.get(level);
+    if (!connections || connections.size <= maxConnections)
+        return;
+    // Calculate distances to all connections
+    const distances = [];
+    for (const connId of connections) {
+        const connNode = nodes.get(connId);
+        if (connNode) {
+            distances.push({
+                id: connId,
+                distance: distance(metric, node.vector, connNode.vector),
+            });
+        }
+    }
+    // Keep only the closest ones
+    distances.sort((a, b) => a.distance - b.distance);
+    const toKeep = new Set(distances.slice(0, maxConnections).map((d) => d.id));
+    // Remove excess connections
+    for (const connId of connections) {
+        if (!toKeep.has(connId)) {
+            connections.delete(connId);
+            nodes.get(connId)?.connections.get(level)?.delete(node.id);
+        }
+    }
+}
+//# sourceMappingURL=hnsw-graph-ops.js.map

package/dist/hnsw-graph-ops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-graph-ops.js","sourceRoot":"","sources":["../src/hnsw-graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAI9D;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAA4B,EAC5B,MAAsB,EACtB,KAAmB,EACnB,eAAoC,EACpC,UAAkB,EAClB,EAAU,EACV,KAAa;IAEb,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,CAAC,CAAC;IAE9C,wDAAwD;IACxD,MAAM,UAAU,GAAG,IAAI,aAAa,EAAU,CAAC;IAE/C,yEAAyE;IACzE,MAAM,OAAO,GAAG,IAAI,aAAa,CAAS,EAAE,CAAC,CAAC;IAE9C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;IACzC,MAAM,SAAS,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;IAE/E,UAAU,CAAC,MAAM,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACzC,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAEtC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7B,mCAAmC;QACnC,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,EAAG,CAAC;QAC/C,MAAM,SAAS,GAAG,UAAU,CAAC,UAAU,EAAG,CAAC;QAE3C,2EAA2E;QAC3E,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;QAClD,IAAI,WAAW,GAAG,eAAe,IAAI,OAAO,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;YACxD,MAAM;QACR,CAAC;QAED,oBAAoB;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW;YAAE,SAAS;QAE3B,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YACtC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAExB,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,CAAC,YAAY;gBAAE,SAAS;YAE5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,YAAY,CAAC,CAAC;YAE7E,mDAAmD;YACnD,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,IAAI,IAAI,GAAG,eAAe,EAAE,CAAC;gBAChD,UAAU,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;gBACpC,0DAA0D;gBAC1D,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,OAAO,OAAO,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1D,EAAE,EAAE,IAAI;QACR,QAAQ,EAAE,QAAQ;KACnB,CAAC,CAAC,CAAC;AACN,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,MAAc,EACd,MAAoB,EACpB,UAAmD,EACnD,CAAS;IAET,gFAAgF;IAChF,gEAAgE;IAChE,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,KAA4B,EAC5B,MAAsB,EACtB,IAAc,EACd,KAAa,EACb,cAAsB;IAEtB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,IAAI,cAAc;QAAE,OAAO;IAE/D,yCAAyC;IACzC,MAAM,SAAS,GAA4C,EAAE,CAAC;IAC9D,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,QAAQ,EAAE,CAAC;YACb,SAAS,CAAC,IAAI,CAAC;gBACb,EAAE,EAAE,MAAM;gBACV,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC;aACzD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5E,4BAA4B;IAC5B,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/hnsw-heap.d.ts

@@ -0,0 +1,45 @@
+/**
+ * V1 HNSW Vector Index — priority-queue heaps
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: no behaviour change.
+ *
+ * @module v1/memory/hnsw-heap
+ */
+/**
+ * Binary Min Heap for O(log n) priority queue operations
+ * Used for candidate selection in HNSW search
+ */
+export declare class BinaryMinHeap<T> {
+    private heap;
+    get size(): number;
+    insert(item: T, priority: number): void;
+    extractMin(): T | undefined;
+    peek(): T | undefined;
+    peekPriority(): number | undefined;
+    isEmpty(): boolean;
+    toArray(): T[];
+    private bubbleUp;
+    private bubbleDown;
+}
+/**
+ * Binary Max Heap for bounded top-k tracking
+ * Keeps track of k smallest elements by evicting largest when full
+ */
+export declare class BinaryMaxHeap<T> {
+    private heap;
+    private maxSize;
+    constructor(maxSize?: number);
+    get size(): number;
+    insert(item: T, priority: number): boolean;
+    peekMax(): T | undefined;
+    peekMaxPriority(): number;
+    extractMax(): T | undefined;
+    isEmpty(): boolean;
+    toSortedArray(): Array<{
+        item: T;
+        priority: number;
+    }>;
+    private bubbleUp;
+    private bubbleDown;
+}
+//# sourceMappingURL=hnsw-heap.d.ts.map

package/dist/hnsw-heap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-heap.d.ts","sourceRoot":"","sources":["../src/hnsw-heap.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAA4C;IAExD,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAGtC;IAED,UAAU,IAAI,CAAC,GAAG,SAAS,CAS1B;IAED,IAAI,IAAI,CAAC,GAAG,SAAS,CAEpB;IAED,YAAY,IAAI,MAAM,GAAG,SAAS,CAEjC;IAED,OAAO,IAAI,OAAO,CAEjB;IAED,OAAO,IAAI,CAAC,EAAE,CAKb;IAED,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,UAAU;CAiBnB;AAED;;;GAGG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAA4C;IACxD,OAAO,CAAC,OAAO,CAAS;IAExB,YAAY,OAAO,GAAE,MAAiB,EAErC;IAED,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAezC;IAED,OAAO,IAAI,CAAC,GAAG,SAAS,CAEvB;IAED,eAAe,IAAI,MAAM,CAExB;IAED,UAAU,IAAI,CAAC,GAAG,SAAS,CAS1B;IAED,OAAO,IAAI,OAAO,CAEjB;IAED,aAAa,IAAI,KAAK,CAAC;QAAE,IAAI,EAAE,CAAC,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAEpD;IAED,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,UAAU;CAiBnB"}

package/dist/hnsw-heap.js

@@ -0,0 +1,155 @@
+/**
+ * V1 HNSW Vector Index — priority-queue heaps
+ *
+ * Split out of hnsw-index.ts (file-size sweep). Pure move: no behaviour change.
+ *
+ * @module v1/memory/hnsw-heap
+ */
+/**
+ * Binary Min Heap for O(log n) priority queue operations
+ * Used for candidate selection in HNSW search
+ */
+export class BinaryMinHeap {
+    heap = [];
+    get size() {
+        return this.heap.length;
+    }
+    insert(item, priority) {
+        this.heap.push({ item, priority });
+        this.bubbleUp(this.heap.length - 1);
+    }
+    extractMin() {
+        if (this.heap.length === 0)
+            return undefined;
+        const min = this.heap[0].item;
+        const last = this.heap.pop();
+        if (this.heap.length > 0) {
+            this.heap[0] = last;
+            this.bubbleDown(0);
+        }
+        return min;
+    }
+    peek() {
+        return this.heap[0]?.item;
+    }
+    peekPriority() {
+        return this.heap[0]?.priority;
+    }
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    toArray() {
+        return this.heap
+            .slice()
+            .sort((a, b) => a.priority - b.priority)
+            .map((entry) => entry.item);
+    }
+    bubbleUp(index) {
+        while (index > 0) {
+            const parent = Math.floor((index - 1) / 2);
+            if (this.heap[parent].priority <= this.heap[index].priority)
+                break;
+            [this.heap[parent], this.heap[index]] = [this.heap[index], this.heap[parent]];
+            index = parent;
+        }
+    }
+    bubbleDown(index) {
+        const length = this.heap.length;
+        while (true) {
+            let smallest = index;
+            const left = 2 * index + 1;
+            const right = 2 * index + 2;
+            if (left < length && this.heap[left].priority < this.heap[smallest].priority) {
+                smallest = left;
+            }
+            if (right < length && this.heap[right].priority < this.heap[smallest].priority) {
+                smallest = right;
+            }
+            if (smallest === index)
+                break;
+            [this.heap[smallest], this.heap[index]] = [this.heap[index], this.heap[smallest]];
+            index = smallest;
+        }
+    }
+}
+/**
+ * Binary Max Heap for bounded top-k tracking
+ * Keeps track of k smallest elements by evicting largest when full
+ */
+export class BinaryMaxHeap {
+    heap = [];
+    maxSize;
+    constructor(maxSize = Infinity) {
+        this.maxSize = maxSize;
+    }
+    get size() {
+        return this.heap.length;
+    }
+    insert(item, priority) {
+        // If at capacity and new item is worse than worst, reject
+        if (this.heap.length >= this.maxSize && priority >= this.heap[0]?.priority) {
+            return false;
+        }
+        if (this.heap.length >= this.maxSize) {
+            // Replace max element
+            this.heap[0] = { item, priority };
+            this.bubbleDown(0);
+        }
+        else {
+            this.heap.push({ item, priority });
+            this.bubbleUp(this.heap.length - 1);
+        }
+        return true;
+    }
+    peekMax() {
+        return this.heap[0]?.item;
+    }
+    peekMaxPriority() {
+        return this.heap[0]?.priority ?? Infinity;
+    }
+    extractMax() {
+        if (this.heap.length === 0)
+            return undefined;
+        const max = this.heap[0].item;
+        const last = this.heap.pop();
+        if (this.heap.length > 0) {
+            this.heap[0] = last;
+            this.bubbleDown(0);
+        }
+        return max;
+    }
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    toSortedArray() {
+        return this.heap.slice().sort((a, b) => a.priority - b.priority);
+    }
+    bubbleUp(index) {
+        while (index > 0) {
+            const parent = Math.floor((index - 1) / 2);
+            if (this.heap[parent].priority >= this.heap[index].priority)
+                break;
+            [this.heap[parent], this.heap[index]] = [this.heap[index], this.heap[parent]];
+            index = parent;
+        }
+    }
+    bubbleDown(index) {
+        const length = this.heap.length;
+        while (true) {
+            let largest = index;
+            const left = 2 * index + 1;
+            const right = 2 * index + 2;
+            if (left < length && this.heap[left].priority > this.heap[largest].priority) {
+                largest = left;
+            }
+            if (right < length && this.heap[right].priority > this.heap[largest].priority) {
+                largest = right;
+            }
+            if (largest === index)
+                break;
+            [this.heap[largest], this.heap[index]] = [this.heap[index], this.heap[largest]];
+            index = largest;
+        }
+    }
+}
+//# sourceMappingURL=hnsw-heap.js.map

package/dist/hnsw-heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-heap.js","sourceRoot":"","sources":["../src/hnsw-heap.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,IAAI,GAAyC,EAAE,CAAC;IAExD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,IAAO,EAAE,QAAgB;QAC9B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;IAC5B,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC;IAChC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI;aACb,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAEO,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;gBAAE,MAAM;YACnE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9E,KAAK,GAAG,MAAM,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC5B,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC7E,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,KAAK,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC/E,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,KAAK,KAAK;gBAAE,MAAM;YAC9B,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAClF,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,IAAI,GAAyC,EAAE,CAAC;IAChD,OAAO,CAAS;IAExB,YAAY,OAAO,GAAW,QAAQ;QACpC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,IAAO,EAAE,QAAgB;QAC9B,0DAA0D;QAC1D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;YAC3E,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACrC,sBAAsB;YACtB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;IAC5B,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,QAAQ,CAAC;IAC5C,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnE,CAAC;IAEO,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;gBAAE,MAAM;YACnE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAC9E,KAAK,GAAG,MAAM,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAC5B,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC5E,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;YACD,IAAI,KAAK,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC9E,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,IAAI,OAAO,KAAK,KAAK;gBAAE,MAAM;YAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAChF,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;IACH,CAAC;CACF"}

package/dist/hnsw-index.d.ts

@@ -14,23 +14,23 @@
  * @module v1/memory/hnsw-index
  */
 import { EventEmitter } from 'node:events';
+import type { HNSWSerialized } from './hnsw-serialize.js';
 import type { HNSWConfig, HNSWStats } from './types.js';
+export type { HNSWSerialized } from './hnsw-serialize.js';
 /**
- * On-disk representation produced by HNSWIndex.serialize() / consumed by
- * HNSWIndex.deserialize(). `version` guards against loading a shape from a
- * future/incompatible format.
+ * Internal node structure for HNSW graph
  */
-export interface HNSWSerialized {
-    version: 1;
-    config: HNSWConfig;
-    entryPoint: string | null;
-    maxLevel: number;
-    nodes: Array<{
-        id: string;
-        vectorB64: string;
-        level: number;
-        connections: Array<[number, string[]]>;
-    }>;
+export interface HNSWNode {
+    /** Node ID (memory entry ID) */
+    id: string;
+    /** Vector embedding (original) */
+    vector: Float32Array;
+    /** Pre-normalized vector for O(1) cosine similarity */
+    normalizedVector: Float32Array | null;
+    /** Connections at each layer */
+    connections: Map<number, Set<string>>;
+    /** Node level (top layer this node appears in) */
+    level: number;
 }
 /**
  * HNSW Index implementation for ultra-fast vector similarity search
@@ -111,33 +111,6 @@ export declare class HNSWIndex extends EventEmitter {
     private mergeConfig;
     private getRandomLevel;
     private insertNode;
-    /**
-     * OPTIMIZED searchLayer using heap-based priority queues
-     * Performance: O(log n) per operation vs O(n log n) for Array.sort()
-     * Expected speedup: 3-5x for large result sets
-     */
-    private searchLayerOptimized;
-    private selectNeighbors;
-    private pruneConnections;
-    private distance;
-    private cosineDistance;
-    /**
-     * OPTIMIZED: Cosine distance using pre-normalized vectors
-     * Only requires dot product (no sqrt operations)
-     * Performance: O(n) with ~2x speedup over standard cosine
-     */
-    private cosineDistanceNormalized;
-    /**
-     * Normalize a vector to unit length for O(1) cosine similarity
-     */
-    private normalizeVector;
-    /**
-     * OPTIMIZED distance calculation that uses pre-normalized vectors when available
-     */
-    private distanceOptimized;
-    private euclideanDistance;
-    private dotProductDistance;
-    private manhattanDistance;
 }
 export default HNSWIndex;
 //# sourceMappingURL=hnsw-index.d.ts.map

package/dist/hnsw-index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hnsw-index.d.ts","sourceRoot":"","sources":["../src/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAsB,MAAM,YAAY,CAAC;AAoK5E;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,EAAE,UAAU,CAAC;IACnB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,KAAK,CAAC;QACX,EAAE,EAAE,MAAM,CAAC;QACX,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;QACd,WAAW,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;KACxC,CAAC,CAAC;CACJ;AAsBD;;;;;;;GAOG;AACH,qBAAa,SAAU,SAAQ,YAAY;IACzC,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,QAAQ,CAAa;IAC7B,OAAO,CAAC,SAAS,CAAS;IAG1B,OAAO,CAAC,KAAK,CAYX;IAGF,OAAO,CAAC,SAAS,CAA0B;IAE3C,YAAY,MAAM,GAAE,OAAO,CAAC,UAAU,CAAM,EAQ3C;IAED;;OAEG;IACG,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAmD9D;IAED;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,YAAY,EACnB,CAAC,EAAE,MAAM,EACT,EAAE,CAAC,EAAE,MAAM,GACV,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAgElD;IAED;;OAEG;IACG,iBAAiB,CACrB,KAAK,EAAE,YAAY,EACnB,CAAC,EAAE,MAAM,EACT,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,EAC/B,EAAE,CAAC,EAAE,MAAM,GACV,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAMlD;IAED;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CA2C9C;IAED;;OAEG;IACG,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAiBjF;IAED;;;;;;;;;;OAUG;IACH,SAAS,IAAI,cAAc,CAwB1B;IAED,+DAA+D;IAC/D,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,GAAG,SAAS,CAiBlD;IAED;;OAEG;IACH,QAAQ,IAAI,SAAS,CAiBpB;IAED;;OAEG;IACH,KAAK,IAAI,IAAI,CAWZ;IAED;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEvB;IAED;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAID,OAAO,CAAC,WAAW;IAWnB,OAAO,CAAC,cAAc;YAMR,UAAU;IA0DxB;;;;OAIG;IACH,OAAO,CAAC,oBAAoB;IAgE5B,OAAO,CAAC,eAAe;IAWvB,OAAO,CAAC,gBAAgB;IA6BxB,OAAO,CAAC,QAAQ;IAehB,OAAO,CAAC,cAAc;IAiBtB;;;;OAIG;IACH,OAAO,CAAC,wBAAwB;IAUhC;;OAEG;IACH,OAAO,CAAC,eAAe;IAmBvB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAkBzB,OAAO,CAAC,iBAAiB;IASzB,OAAO,CAAC,kBAAkB;IAS1B,OAAO,CAAC,iBAAiB;CAO1B;eA6Gc,SAAS"}
+{"version":3,"file":"hnsw-index.d.ts","sourceRoot":"","sources":["../src/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAI3C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAE1D,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAExD,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAE1D;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,gCAAgC;IAChC,EAAE,EAAE,MAAM,CAAC;IAEX,kCAAkC;IAClC,MAAM,EAAE,YAAY,CAAC;IAErB,uDAAuD;IACvD,gBAAgB,EAAE,YAAY,GAAG,IAAI,CAAC;IAEtC,gCAAgC;IAChC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAEtC,kDAAkD;IAClD,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,qBAAa,SAAU,SAAQ,YAAY;IACzC,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,KAAK,CAAoC;IACjD,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,QAAQ,CAAa;IAC7B,OAAO,CAAC,SAAS,CAAS;IAG1B,OAAO,CAAC,KAAK,CAYX;IAGF,OAAO,CAAC,SAAS,CAA0B;IAE3C,YAAY,MAAM,GAAE,OAAO,CAAC,UAAU,CAAM,EAQ3C;IAED;;OAEG;IACG,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,CAkD9D;IAED;;OAEG;IACG,MAAM,CACV,KAAK,EAAE,YAAY,EACnB,CAAC,EAAE,MAAM,EACT,EAAE,CAAC,EAAE,MAAM,GACV,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAqElD;IAED;;OAEG;IACG,iBAAiB,CACrB,KAAK,EAAE,YAAY,EACnB,CAAC,EAAE,MAAM,EACT,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,OAAO,EAC/B,EAAE,CAAC,EAAE,MAAM,GACV,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAMlD;IAED;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CA2C9C;IAED;;OAEG;IACG,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAiBjF;IAED;;;;;;;;;;OAUG;IACH,SAAS,IAAI,cAAc,CAK1B;IAED,+DAA+D;IAC/D,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,GAAG,SAAS,CASlD;IAED;;OAEG;IACH,QAAQ,IAAI,SAAS,CAiBpB;IAED;;OAEG;IACH,KAAK,IAAI,IAAI,CAWZ;IAED;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEvB;IAED;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAID,OAAO,CAAC,WAAW;IAWnB,OAAO,CAAC,cAAc;YAMR,UAAU;CAwEzB;eAEc,SAAS"}