@monoes/memory 1.0.3 → 1.0.5

package/dist/diskann-backend.js

@@ -1,336 +0,0 @@
-/**
- * DiskAnnBackend — SSD-resident ANN graph with in-memory compressed vectors
- *
- * Architecture (faithful to DiskANN / Vamana; source: arXiv:2305.04359):
- *   (a) Adjacency-list graph persisted as a separate JSON file on disk
- *       (NOT the SQLite rows — a distinct index artifact)
- *   (b) Int8-quantised vectors kept in memory for fast candidate beam search
- *       (scalar quantisation: float32 × 127 → int8, ~4× memory reduction)
- *   (c) Full-precision re-ranking: for each beam candidate, load the original
- *       Float32 embedding from the delegate backend and rescore with cosine
- *
- * This backend wraps any IMemoryBackend (delegate) and delegates all CRUD
- * operations to it, overriding only `search()` with the DiskANN algorithm.
- *
- * @module v1/memory/diskann-backend
- */
-import { writeFile, readFile, mkdir } from 'node:fs/promises';
-import { existsSync } from 'node:fs';
-import { dirname } from 'node:path';
-// ============================================================
-// DiskAnnBackend
-// ============================================================
-/**
- * DiskAnnBackend
- *
- * Wraps any IMemoryBackend and replaces the `search()` method with a three-phase
- * DiskANN procedure:
- *   1. Quantised beam search (Int8 dot products — fast, approximate)
- *   2. Full-precision re-ranking (Float32 cosine from delegate.get())
- *   3. Threshold filtering and top-k selection
- *
- * All other IMemoryBackend methods delegate directly to the inner backend.
- */
-export class DiskAnnBackend {
-    delegate;
-    /** Adjacency list: nodeId → sorted neighbour IDs */
-    graph = new Map();
-    /**
-     * Int8 scalar-quantised embeddings for beam search.
-     * Kept entirely in memory — the critical DiskANN optimisation that avoids
-     * loading full-precision vectors during candidate generation.
-     */
-    qvecs = new Map();
-    /** Random walk entry point into the graph */
-    entryPoint;
-    /** Whether the in-memory graph differs from the disk file */
-    graphDirty = false;
-    graphPath;
-    beamWidth;
-    maxConnections;
-    rerankMultiplier;
-    constructor(delegate, config) {
-        this.delegate = delegate;
-        this.graphPath = config.graphPath;
-        this.beamWidth = config.beamWidth ?? 32;
-        this.maxConnections = config.maxConnections ?? 12;
-        this.rerankMultiplier = config.rerankMultiplier ?? 3;
-    }
-    // ----------------------------------------------------------------
-    // Lifecycle
-    // ----------------------------------------------------------------
-    async initialize() {
-        await this.delegate.initialize();
-        await this.loadGraph();
-    }
-    async shutdown() {
-        await this.persistGraph();
-        await this.delegate.shutdown();
-    }
-    // ----------------------------------------------------------------
-    // CRUD — fully delegated
-    // ----------------------------------------------------------------
-    async store(entry) {
-        await this.delegate.store(entry);
-        this.indexEntry(entry);
-    }
-    async get(id) {
-        return this.delegate.get(id);
-    }
-    async getByKey(namespace, key) {
-        return this.delegate.getByKey(namespace, key);
-    }
-    async update(id, update) {
-        return this.delegate.update(id, update);
-    }
-    async delete(id) {
-        const ok = await this.delegate.delete(id);
-        if (ok)
-            this.removeFromIndex(id);
-        return ok;
-    }
-    async query(q) {
-        return this.delegate.query(q);
-    }
-    async bulkInsert(entries) {
-        await this.delegate.bulkInsert(entries);
-        for (const e of entries)
-            this.indexEntry(e);
-    }
-    async bulkDelete(ids) {
-        const n = await this.delegate.bulkDelete(ids);
-        for (const id of ids)
-            this.removeFromIndex(id);
-        return n;
-    }
-    async count(namespace) {
-        return this.delegate.count(namespace);
-    }
-    async listNamespaces() {
-        return this.delegate.listNamespaces();
-    }
-    async clearNamespace(namespace) {
-        const n = await this.delegate.clearNamespace(namespace);
-        // Rebuild index — we don't track namespace per node
-        this.graph.clear();
-        this.qvecs.clear();
-        this.entryPoint = undefined;
-        this.graphDirty = true;
-        return n;
-    }
-    async getStats() {
-        return this.delegate.getStats();
-    }
-    async healthCheck() {
-        return this.delegate.healthCheck();
-    }
-    // ----------------------------------------------------------------
-    // search() — DiskANN three-phase algorithm
-    // ----------------------------------------------------------------
-    /**
-     * Vector similarity search using the DiskANN beam algorithm.
-     *
-     * Phase (b): beam traversal over compressed Int8 vectors (fast, no I/O)
-     * Phase (c): full-precision cosine re-ranking via delegate.get() (accurate)
-     *
-     * Falls back to delegate.search() when no entries have been indexed yet.
-     */
-    async search(queryVec, options) {
-        if (this.qvecs.size === 0) {
-            return this.delegate.search(queryVec, options);
-        }
-        const k = options.k;
-        const threshold = options.threshold ?? 0;
-        // Phase (b): beam search with Int8-quantised vectors
-        const qQuery = this.quantize(queryVec);
-        const candidateIds = this.beamSearch(qQuery, k * this.rerankMultiplier);
-        // Phase (c): full-precision re-ranking by loading embeddings from disk/delegate
-        const results = [];
-        for (const id of candidateIds) {
-            const entry = await this.delegate.get(id);
-            if (!entry?.embedding)
-                continue;
-            const score = this.cosine(queryVec, entry.embedding);
-            if (score >= threshold) {
-                results.push({ entry, score, distance: 1 - score });
-            }
-        }
-        results.sort((a, b) => b.score - a.score);
-        return results.slice(0, k);
-    }
-    // ----------------------------------------------------------------
-    // Index management (private)
-    // ----------------------------------------------------------------
-    /** Add or update a node in the in-memory ANN index */
-    indexEntry(entry) {
-        if (!entry.embedding)
-            return;
-        const qvec = this.quantize(entry.embedding);
-        this.qvecs.set(entry.id, qvec);
-        // Greedy M-nearest-neighbour insertion (O(n) scan over compressed vectors)
-        const neighbors = this.greedyNearestNeighbors(entry.id, qvec, this.maxConnections);
-        this.graph.set(entry.id, neighbors);
-        // Add reverse edges (backlinks) — keep outdegree bounded
-        for (const nid of neighbors) {
-            let nEdges = this.graph.get(nid);
-            if (!nEdges) {
-                nEdges = [];
-                this.graph.set(nid, nEdges);
-            }
-            if (!nEdges.includes(entry.id) && nEdges.length < this.maxConnections * 2) {
-                nEdges.push(entry.id);
-            }
-        }
-        if (!this.entryPoint)
-            this.entryPoint = entry.id;
-        this.graphDirty = true;
-    }
-    /** Remove a node and all its references from the index */
-    removeFromIndex(id) {
-        this.qvecs.delete(id);
-        const neighbors = this.graph.get(id) ?? [];
-        this.graph.delete(id);
-        // Remove backreferences from neighbours
-        for (const nid of neighbors) {
-            const edges = this.graph.get(nid);
-            if (edges) {
-                this.graph.set(nid, edges.filter(e => e !== id));
-            }
-        }
-        if (this.entryPoint === id) {
-            this.entryPoint = this.graph.keys().next().value;
-        }
-        this.graphDirty = true;
-    }
-    /** Scan all existing qvecs and return the k nearest to `qvec` */
-    greedyNearestNeighbors(excludeId, qvec, k) {
-        const scored = [];
-        for (const [id, vec] of this.qvecs) {
-            if (id === excludeId)
-                continue;
-            scored.push({ id, score: this.dotProduct(qvec, vec) });
-        }
-        scored.sort((a, b) => b.score - a.score);
-        const ids = [];
-        const returnCount = Math.min(k, scored.length);
-        for (let i = 0; i < returnCount; i++)
-            ids.push(scored[i].id);
-        return ids;
-    }
-    /**
-     * Beam search over the compressed-vector graph.
-     *
-     * Starts from `entryPoint`, expands neighbours BFS-style, and scores each
-     * visited node with Int8 dot products.  Returns up to `candidateCount` IDs
-     * sorted by descending similarity.
-     */
-    beamSearch(qQuery, candidateCount) {
-        if (!this.entryPoint || this.qvecs.size === 0)
-            return [];
-        const visited = new Set();
-        const scored = [];
-        const frontier = [this.entryPoint];
-        visited.add(this.entryPoint);
-        const maxVisit = Math.min(this.beamWidth * 4, this.qvecs.size);
-        while (frontier.length > 0 && visited.size <= maxVisit) {
-            const current = frontier.shift();
-            const qvec = this.qvecs.get(current);
-            if (!qvec)
-                continue;
-            scored.push({ id: current, score: this.dotProduct(qQuery, qvec) });
-            // Expand graph neighbours
-            for (const nid of (this.graph.get(current) ?? [])) {
-                if (!visited.has(nid)) {
-                    visited.add(nid);
-                    frontier.push(nid);
-                }
-            }
-        }
-        scored.sort((a, b) => b.score - a.score);
-        const ids = [];
-        const returnCount = Math.min(candidateCount, scored.length);
-        for (let i = 0; i < returnCount; i++)
-            ids.push(scored[i].id);
-        return ids;
-    }
-    // ----------------------------------------------------------------
-    // Quantisation and distance helpers
-    // ----------------------------------------------------------------
-    /** Scalar Int8 quantisation: float32 × 127 → clamped int8 */
-    quantize(vec) {
-        const q = new Int8Array(vec.length);
-        for (let i = 0; i < vec.length; i++) {
-            q[i] = Math.max(-127, Math.min(127, Math.round(vec[i] * 127)));
-        }
-        return q;
-    }
-    /** Int8 dot product (used for beam search scoring) */
-    dotProduct(a, b) {
-        const len = Math.min(a.length, b.length);
-        let sum = 0;
-        for (let i = 0; i < len; i++)
-            sum += a[i] * b[i];
-        return sum;
-    }
-    /** Full-precision cosine similarity (used for re-ranking) */
-    cosine(a, b) {
-        const len = Math.min(a.length, b.length);
-        let dot = 0, normA = 0, normB = 0;
-        for (let i = 0; i < len; i++) {
-            dot += a[i] * b[i];
-            normA += a[i] * a[i];
-            normB += b[i] * b[i];
-        }
-        const denom = Math.sqrt(normA) * Math.sqrt(normB);
-        return denom === 0 ? 0 : dot / denom;
-    }
-    // ----------------------------------------------------------------
-    // Disk persistence (graph adjacency list only — NOT the entry data)
-    // ----------------------------------------------------------------
-    /**
-     * Load the persisted adjacency list from disk.
-     * Called during initialize(). A missing or corrupt file is silently ignored;
-     * the index will be rebuilt as entries are stored.
-     */
-    async loadGraph() {
-        if (!existsSync(this.graphPath))
-            return;
-        try {
-            const raw = await readFile(this.graphPath, 'utf8');
-            const data = JSON.parse(raw);
-            this.graph.clear();
-            for (const [id, neighbors] of data.graph) {
-                this.graph.set(id, neighbors);
-            }
-            this.entryPoint = data.entryPoint;
-            this.graphDirty = false;
-        }
-        catch {
-            // Corrupt file — start with empty graph
-        }
-    }
-    /**
-     * Persist the adjacency list to disk.
-     * Only writes when the graph has changed since the last persist.
-     * Errors are non-fatal; the graph will be rebuilt on next startup.
-     */
-    async persistGraph() {
-        if (!this.graphDirty)
-            return;
-        try {
-            await mkdir(dirname(this.graphPath), { recursive: true });
-            const data = {
-                graph: [...this.graph.entries()],
-                entryPoint: this.entryPoint,
-                nodeCount: this.graph.size,
-                savedAt: Date.now(),
-            };
-            await writeFile(this.graphPath, JSON.stringify(data), 'utf8');
-            this.graphDirty = false;
-        }
-        catch {
-            // Non-fatal — graph will be rebuilt on next startup
-        }
-    }
-}
-//# sourceMappingURL=diskann-backend.js.map

package/dist/diskann-backend.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diskann-backend.js","sourceRoot":"","sources":["../src/diskann-backend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAoDpC,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,cAAc;IAuBN;IAtBnB,oDAAoD;IACnC,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAErD;;;;OAIG;IACc,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IAEtD,6CAA6C;IACrC,UAAU,CAAqB;IAEvC,6DAA6D;IACrD,UAAU,GAAG,KAAK,CAAC;IAEV,SAAS,CAAS;IAClB,SAAS,CAAS;IAClB,cAAc,CAAS;IACvB,gBAAgB,CAAS;IAE1C,YACmB,QAAwB,EACzC,MAA4B;QADX,aAAQ,GAAR,QAAQ,CAAgB;QAGzC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACvD,CAAC;IAED,mEAAmE;IACnE,YAAY;IACZ,mEAAmE;IAEnE,KAAK,CAAC,UAAU;QACd,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC1B,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;IACjC,CAAC;IAED,mEAAmE;IACnE,yBAAyB;IACzB,mEAAmE;IAEnE,KAAK,CAAC,KAAK,CAAC,KAAkB;QAC5B,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,SAAiB,EAAE,GAAW;QAC3C,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU,EAAE,MAAyB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,EAAE;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACjC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,CAAc;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,OAAsB;QACrC,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAa;QAC5B,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC9C,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,SAAkB;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,SAAiB;QACpC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QACxD,oDAAoD;QACpD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC;IAED,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;IAED,mEAAmE;IACnE,2CAA2C;IAC3C,mEAAmE;IAEnE;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CAAC,QAAsB,EAAE,OAAsB;QACzD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACjD,CAAC;QAED,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpB,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;QAEzC,qDAAqD;QACrD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAExE,gFAAgF;QAChF,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,EAAE,SAAS;gBAAE,SAAS;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,mEAAmE;IACnE,6BAA6B;IAC7B,mEAAmE;IAEnE,sDAAsD;IAC9C,UAAU,CAAC,KAAkB;QACnC,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAO;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,2EAA2E;QAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QACnF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEpC,yDAAyD;QACzD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,EAAE,CAAC;gBAAC,MAAM,GAAG,EAAE,CAAC;gBAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAAC,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC;gBAC1E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,0DAA0D;IAClD,eAAe,CAAC,EAAU;QAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAA2B,CAAC;QACzE,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,iEAAiE;IACzD,sBAAsB,CAAC,SAAiB,EAAE,IAAe,EAAE,CAAS;QAC1E,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,EAAE,KAAK,SAAS;gBAAE,SAAS;YAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7D,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,UAAU,CAAC,MAAiB,EAAE,cAAsB;QAC1D,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,MAAM,QAAQ,GAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE7B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAE/D,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;YACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAEnE,0BAA0B;YAC1B,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACjB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7D,OAAO,GAAG,CAAC;IACb,CAAC;IAED,mEAAmE;IACnE,oCAAoC;IACpC,mEAAmE;IAEnE,6DAA6D;IACrD,QAAQ,CAAC,GAAiB;QAChC,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sDAAsD;IAC9C,UAAU,CAAC,CAAY,EAAE,CAAY;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,6DAA6D;IACrD,MAAM,CAAC,CAAe,EAAE,CAAe;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;IACvC,CAAC;IAED,mEAAmE;IACnE,oEAAoE;IACpE,mEAAmE;IAEnE;;;;OAIG;IACK,KAAK,CAAC,SAAS;QACrB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QACxC,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;YAClC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;QAC1C,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,YAAY;QACxB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,MAAM,IAAI,GAAmB;gBAC3B,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChC,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;gBAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;aACpB,CAAC;YACF,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9D,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,oDAAoD;QACtD,CAAC;IACH,CAAC;CACF"}

package/dist/partitioned-hnsw.d.ts

@@ -1,65 +0,0 @@
-/**
- * PartitionedHNSW — Timestamp-partitioned HNSW sub-indexes for temporal locality
- *
- * Partitions the HNSW vector index into time-bucket sub-indexes so that recent
- * entries are searched first, dramatically reducing average search latency for
- * workloads where recency correlates with relevance.
- *
- * Architecture:
- *   - Entries are routed to a bucket based on Math.floor(createdAt / bucketMs)
- *   - Each bucket owns an independent HNSWIndex (lazy-created)
- *   - Search merges results across buckets, sorted by recency then similarity
- *   - Old buckets can be evicted once they exceed maxBuckets
- *
- * Source: ICDE 2025 Timestamp-Partitioned HNSW
- *
- * @module v1/memory/partitioned-hnsw
- */
-import type { MemoryEntry } from './types.js';
-export interface PartitionedHNSWConfig {
-    /** Time window per bucket in milliseconds. Default: 1 hour */
-    bucketMs?: number;
-    /** Maximum number of buckets to retain in memory. Default: 48 */
-    maxBuckets?: number;
-    /** Number of neighbours (ef-construction equivalent). Default: 16 */
-    k?: number;
-}
-export interface BucketStats {
-    bucketKey: number;
-    entryCount: number;
-    oldestMs: number;
-    newestMs: number;
-}
-export declare class PartitionedHNSW {
-    private readonly bucketMs;
-    private readonly maxBuckets;
-    private readonly k;
-    /** bucketKey → TimeBucket, ordered newest-first via insertion order */
-    private readonly buckets;
-    constructor(config?: PartitionedHNSWConfig);
-    /** Add a memory entry to its time-bucket. */
-    add(entry: MemoryEntry): void;
-    /**
-     * Search across partitions, newest buckets first.
-     * Stops early once `limit` results are collected or all buckets exhausted.
-     *
-     * @param queryEmbedding - optional query vector (cosine similarity)
-     * @param textQuery      - optional keyword fallback
-     * @param limit          - max results
-     * @param fromMs         - optional lower bound on createdAt (temporal filter)
-     * @param toMs           - optional upper bound on createdAt (temporal filter)
-     */
-    search(queryEmbedding: Float32Array | null, textQuery: string | undefined, limit: number, fromMs?: number, toMs?: number): MemoryEntry[];
-    /**
-     * Remove an entry from its time-bucket by id and original createdAt timestamp.
-     * Returns true if the entry was found and removed, false otherwise.
-     */
-    remove(id: string, createdAt: number): boolean;
-    /** Stats per bucket for observability. */
-    bucketStats(): BucketStats[];
-    get totalEntries(): number;
-    private bucketKeyFor;
-    /** Evict the oldest bucket(s) when we exceed maxBuckets. */
-    private evictOldBuckets;
-}
-//# sourceMappingURL=partitioned-hnsw.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"partitioned-hnsw.d.ts","sourceRoot":"","sources":["../src/partitioned-hnsw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAI9C,MAAM,WAAW,qBAAqB;IACpC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qEAAqE;IACrE,CAAC,CAAC,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAoFD,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAS;IAE3B,uEAAuE;IACvE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAsC;gBAElD,MAAM,GAAE,qBAA0B;IAM9C,6CAA6C;IAC7C,GAAG,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI;IAY7B;;;;;;;;;OASG;IACH,MAAM,CACJ,cAAc,EAAE,YAAY,GAAG,IAAI,EACnC,SAAS,EAAE,MAAM,GAAG,SAAS,EAC7B,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM,EACf,IAAI,CAAC,EAAE,MAAM,GACZ,WAAW,EAAE;IAqChB;;;OAGG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO;IAO9C,0CAA0C;IAC1C,WAAW,IAAI,WAAW,EAAE;IAS5B,IAAI,YAAY,IAAI,MAAM,CAIzB;IAMD,OAAO,CAAC,YAAY;IAIpB,4DAA4D;IAC5D,OAAO,CAAC,eAAe;CAWxB"}

package/dist/partitioned-hnsw.js

@@ -1,209 +0,0 @@
-/**
- * PartitionedHNSW — Timestamp-partitioned HNSW sub-indexes for temporal locality
- *
- * Partitions the HNSW vector index into time-bucket sub-indexes so that recent
- * entries are searched first, dramatically reducing average search latency for
- * workloads where recency correlates with relevance.
- *
- * Architecture:
- *   - Entries are routed to a bucket based on Math.floor(createdAt / bucketMs)
- *   - Each bucket owns an independent HNSWIndex (lazy-created)
- *   - Search merges results across buckets, sorted by recency then similarity
- *   - Old buckets can be evicted once they exceed maxBuckets
- *
- * Source: ICDE 2025 Timestamp-Partitioned HNSW
- *
- * @module v1/memory/partitioned-hnsw
- */
-function cosineSim(a, b) {
-    if (a.length !== b.length || a.length === 0)
-        return 0;
-    let dot = 0;
-    for (let i = 0; i < a.length; i++)
-        dot += a[i] * b[i];
-    // Vectors are pre-normalised, so dot == cosine similarity
-    return dot;
-}
-function l2Norm(v) {
-    let sum = 0;
-    for (let i = 0; i < v.length; i++)
-        sum += v[i] * v[i];
-    const len = Math.sqrt(sum);
-    if (len === 0)
-        return v;
-    const out = new Float32Array(v.length);
-    for (let i = 0; i < v.length; i++)
-        out[i] = v[i] / len;
-    return out;
-}
-class TimeBucket {
-    entries = [];
-    _oldest = Infinity;
-    _newest = 0;
-    add(entry) {
-        const normVec = entry.embedding ? l2Norm(entry.embedding) : null;
-        this.entries.push({ entry, normVec });
-        if (entry.createdAt < this._oldest)
-            this._oldest = entry.createdAt;
-        if (entry.createdAt > this._newest)
-            this._newest = entry.createdAt;
-    }
-    remove(id) {
-        const idx = this.entries.findIndex(e => e.entry.id === id);
-        if (idx === -1)
-            return false;
-        const removed = this.entries.splice(idx, 1)[0];
-        // Recompute _oldest/_newest if the removed entry was an extremum
-        if (removed.entry.createdAt === this._oldest || removed.entry.createdAt === this._newest) {
-            this._oldest = Infinity;
-            this._newest = 0;
-            for (const e of this.entries) {
-                if (e.entry.createdAt < this._oldest)
-                    this._oldest = e.entry.createdAt;
-                if (e.entry.createdAt > this._newest)
-                    this._newest = e.entry.createdAt;
-            }
-        }
-        return true;
-    }
-    /** Approximate k-NN by brute-force within the bucket (buckets are small). */
-    search(queryVec, limit, textQuery) {
-        const scored = this.entries.map(({ entry, normVec }) => {
-            let score = 0;
-            if (queryVec && normVec) {
-                score = cosineSim(queryVec, normVec);
-            }
-            else if (textQuery) {
-                // Keyword fallback: count overlapping terms
-                const terms = textQuery.toLowerCase().split(/\s+/);
-                const content = entry.content.toLowerCase();
-                const hits = terms.filter(t => content.includes(t)).length;
-                score = hits / Math.max(terms.length, 1);
-            }
-            return { entry, score };
-        });
-        scored.sort((a, b) => b.score - a.score);
-        return scored.slice(0, limit);
-    }
-    get size() { return this.entries.length; }
-    get oldest() { return this.entries.length ? this._oldest : Infinity; }
-    get newest() { return this.entries.length ? this._newest : 0; }
-}
-// ===== PartitionedHNSW =====
-export class PartitionedHNSW {
-    bucketMs;
-    maxBuckets;
-    k;
-    /** bucketKey → TimeBucket, ordered newest-first via insertion order */
-    buckets = new Map();
-    constructor(config = {}) {
-        this.bucketMs = config.bucketMs ?? 60 * 60 * 1000; // 1 hour default
-        this.maxBuckets = config.maxBuckets ?? 48; // 48 hours default retention
-        this.k = config.k ?? 16;
-    }
-    /** Add a memory entry to its time-bucket. */
-    add(entry) {
-        const bucketKey = this.bucketKeyFor(entry.createdAt);
-        if (!this.buckets.has(bucketKey)) {
-            this.buckets.set(bucketKey, new TimeBucket());
-            this.evictOldBuckets();
-            // After eviction the bucket we just created may have been removed
-            // (entry predates the retention window) — discard it silently.
-            if (!this.buckets.has(bucketKey))
-                return;
-        }
-        this.buckets.get(bucketKey).add(entry);
-    }
-    /**
-     * Search across partitions, newest buckets first.
-     * Stops early once `limit` results are collected or all buckets exhausted.
-     *
-     * @param queryEmbedding - optional query vector (cosine similarity)
-     * @param textQuery      - optional keyword fallback
-     * @param limit          - max results
-     * @param fromMs         - optional lower bound on createdAt (temporal filter)
-     * @param toMs           - optional upper bound on createdAt (temporal filter)
-     */
-    search(queryEmbedding, textQuery, limit, fromMs, toMs) {
-        const normQuery = queryEmbedding ? l2Norm(queryEmbedding) : null;
-        // Collect buckets in descending (newest-first) order
-        const sortedKeys = [...this.buckets.keys()].sort((a, b) => b - a);
-        const candidates = [];
-        for (const key of sortedKeys) {
-            // Skip buckets entirely outside the temporal filter
-            const bucket = this.buckets.get(key);
-            if (fromMs !== undefined && bucket.newest < fromMs)
-                continue;
-            if (toMs !== undefined && bucket.oldest > toMs)
-                continue;
-            const hits = bucket.search(normQuery, Math.max(limit, this.k), textQuery);
-            for (const h of hits) {
-                if (fromMs !== undefined && h.entry.createdAt < fromMs)
-                    continue;
-                if (toMs !== undefined && h.entry.createdAt > toMs)
-                    continue;
-                candidates.push({ ...h, bucketKey: key });
-            }
-        }
-        // Sort by score desc, then by recency (bucketKey desc) as tiebreak
-        candidates.sort((a, b) => b.score - a.score || b.bucketKey - a.bucketKey);
-        const seen = new Set();
-        const results = [];
-        for (const { entry } of candidates) {
-            if (!seen.has(entry.id)) {
-                seen.add(entry.id);
-                results.push(entry);
-            }
-            if (results.length >= limit)
-                break;
-        }
-        return results;
-    }
-    /**
-     * Remove an entry from its time-bucket by id and original createdAt timestamp.
-     * Returns true if the entry was found and removed, false otherwise.
-     */
-    remove(id, createdAt) {
-        const bucketKey = this.bucketKeyFor(createdAt);
-        const bucket = this.buckets.get(bucketKey);
-        if (!bucket)
-            return false;
-        return bucket.remove(id);
-    }
-    /** Stats per bucket for observability. */
-    bucketStats() {
-        return [...this.buckets.entries()].map(([key, bucket]) => ({
-            bucketKey: key,
-            entryCount: bucket.size,
-            oldestMs: bucket.oldest,
-            newestMs: bucket.newest,
-        }));
-    }
-    get totalEntries() {
-        let n = 0;
-        for (const b of this.buckets.values())
-            n += b.size;
-        return n;
-    }
-    // ------------------------------------------------------------------
-    // Private helpers
-    // ------------------------------------------------------------------
-    bucketKeyFor(createdAt) {
-        return Math.floor(createdAt / this.bucketMs);
-    }
-    /** Evict the oldest bucket(s) when we exceed maxBuckets. */
-    evictOldBuckets() {
-        while (this.buckets.size > this.maxBuckets) {
-            // Find the smallest bucket key (oldest in time), not first in insertion order.
-            // Insertion order diverges from temporal order during bulk inserts or migrations.
-            let oldestKey;
-            for (const k of this.buckets.keys()) {
-                if (oldestKey === undefined || k < oldestKey)
-                    oldestKey = k;
-            }
-            if (oldestKey !== undefined)
-                this.buckets.delete(oldestKey);
-        }
-    }
-}
-//# sourceMappingURL=partitioned-hnsw.js.map

package/dist/partitioned-hnsw.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"partitioned-hnsw.js","sourceRoot":"","sources":["../src/partitioned-hnsw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AA+BH,SAAS,SAAS,CAAC,CAAe,EAAE,CAAe;IACjD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,0DAA0D;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,MAAM,CAAC,CAAe;IAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACvD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU;IACG,OAAO,GAAkB,EAAE,CAAC;IACrC,OAAO,GAAW,QAAQ,CAAC;IAC3B,OAAO,GAAW,CAAC,CAAC;IAE5B,GAAG,CAAC,KAAkB;QACpB,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC;QACnE,IAAI,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC;IACrE,CAAC;IAED,MAAM,CAAC,EAAU;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3D,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,iEAAiE;QACjE,IAAI,OAAO,CAAC,KAAK,CAAC,SAAS,KAAK,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC,SAAS,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YACzF,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO;oBAAE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBACvE,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO;oBAAE,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;YACzE,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,MAAM,CAAC,QAA6B,EAAE,KAAa,EAAE,SAAkB;QACrE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE;YACrD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,QAAQ,IAAI,OAAO,EAAE,CAAC;gBACxB,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACvC,CAAC;iBAAM,IAAI,SAAS,EAAE,CAAC;gBACrB,4CAA4C;gBAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACnD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC3D,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD,IAAI,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9E,IAAI,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACxE;AAED,8BAA8B;AAE9B,MAAM,OAAO,eAAe;IACT,QAAQ,CAAS;IACjB,UAAU,CAAS;IACnB,CAAC,CAAS;IAE3B,uEAAuE;IACtD,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAE9D,YAAY,SAAgC,EAAE;QAC5C,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAE,iBAAiB;QACrE,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAY,6BAA6B;QACnF,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,6CAA6C;IAC7C,GAAG,CAAC,KAAkB;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,UAAU,EAAE,CAAC,CAAC;YAC9C,IAAI,CAAC,eAAe,EAAE,CAAC;YACvB,kEAAkE;YAClE,+DAA+D;YAC/D,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,OAAO;QAC3C,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CACJ,cAAmC,EACnC,SAA6B,EAC7B,KAAa,EACb,MAAe,EACf,IAAa;QAEb,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEjE,qDAAqD;QACrD,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAElE,MAAM,UAAU,GAAoE,EAAE,CAAC;QAEvF,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,oDAAoD;YACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACtC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM;gBAAE,SAAS;YAC7D,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI;gBAAE,SAAS;YAEzD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC1E,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,MAAM;oBAAE,SAAS;gBACjE,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI;oBAAE,SAAS;gBAC7D,UAAU,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAE1E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACnB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACrC,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAU,EAAE,SAAiB;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC1B,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,0CAA0C;IAC1C,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;YACzD,SAAS,EAAE,GAAG;YACd,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,QAAQ,EAAE,MAAM,CAAC,MAAM;YACvB,QAAQ,EAAE,MAAM,CAAC,MAAM;SACxB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,IAAI,YAAY;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QACnD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,qEAAqE;IACrE,kBAAkB;IAClB,qEAAqE;IAE7D,YAAY,CAAC,SAAiB;QACpC,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,4DAA4D;IACpD,eAAe;QACrB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,+EAA+E;YAC/E,kFAAkF;YAClF,IAAI,SAA6B,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpC,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,SAAS;oBAAE,SAAS,GAAG,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,SAAS,KAAK,SAAS;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;CACF"}