@claude-flow/memory 3.0.0-alpha.9 → 3.0.0

package/dist/consolidator.js

@@ -0,0 +1,309 @@
+/**
+ * MemoryConsolidator — ADR-125 Phase 4
+ *
+ * Periodic maintenance for the in-memory state owned by {@link UnifiedMemoryService}.
+ *
+ * Operations:
+ * - `sweepExpired()` — drop entries past `expiresAt` from all indexes (including HNSW).
+ * - `dedup(strategy)` — collapse content-hash duplicates per strategy.
+ * - `compactHnsw()` — rebuild the HNSW index from current `entries`.
+ * - `runAll()` — sweep → dedup → compact in order.
+ *
+ * Invoked from two paths:
+ * 1. {@link UnifiedMemoryService}'s lifecycle (background timer when
+ *    `consolidator.autoRun === true`, plus `close()`).
+ * 2. The AgentDB `nightlyLearner` controller (`src/controller-registry.ts`)
+ *    delegates to `runAll()` instead of hitting AgentDB directly.
+ *
+ * Phase 3 placeholder lives in this file too — it provides the typed
+ * surface that {@link UnifiedMemoryService.getConsolidator} resolves to.
+ * The real implementation lands with Phase 4.
+ *
+ * @module v3/memory/consolidator
+ */
+import { createHash } from 'node:crypto';
+import { HNSWIndex } from './hnsw-index.js';
+import { encodeMemoryKey } from './memory-key.js';
+const DEFAULT_SIMILARITY_THRESHOLD = 0.95;
+/** Neighborhood size for the near-duplicate HNSW lookup — small and cheap. */
+const NEAR_DUP_SEARCH_K = 8;
+/**
+ * Explicit `ef` (candidate-list size) for the near-duplicate HNSW search.
+ * Left unset, `HNSWIndex.search()` defaults `ef` to
+ * `Math.max(k, efConstruction)` — efConstruction defaults to 200, so an
+ * unset `ef` here means every dedup() search traverses a 200-candidate
+ * list even though duplicate detection only needs to find very-close
+ * neighbors (high similarity), not broad top-k recall. Measured impact at
+ * N=5000 (`consolidator-embedding-benchmark.test.ts`): ~9.8s with the
+ * inherited ef=200 default vs a small fixed ef here. 32 is a deliberate
+ * margin above NEAR_DUP_SEARCH_K (8) for HNSW's approximate-search
+ * headroom, not a re-derivation of efConstruction's separate
+ * index-build-quality concern.
+ */
+const NEAR_DUP_SEARCH_EF = 32;
+export class MemoryConsolidator {
+    service;
+    opts;
+    constructor(service, opts = {}) {
+        this.service = service;
+        this.opts = opts;
+    }
+    /**
+     * Drop all entries whose `expiresAt` is in the past.
+     */
+    async sweepExpired() {
+        const adapter = this.service.getAdapter();
+        const entries = adapter.entries;
+        const namespaceIndex = adapter.namespaceIndex;
+        const keyIndex = adapter.keyIndex;
+        const tagIndex = adapter.tagIndex;
+        const index = adapter.index;
+        const now = Date.now();
+        const toRemove = [];
+        for (const entry of entries.values()) {
+            if (entry.expiresAt != null && entry.expiresAt < now) {
+                toRemove.push(entry);
+            }
+        }
+        let hnswRemoved = 0;
+        for (const entry of toRemove) {
+            entries.delete(entry.id);
+            namespaceIndex.get(entry.namespace)?.delete(entry.id);
+            const compositeKey = encodeMemoryKey(entry.namespace, entry.key, adapter.config?.defaultNamespace);
+            if (keyIndex.get(compositeKey) === entry.id)
+                keyIndex.delete(compositeKey);
+            for (const tag of entry.tags)
+                tagIndex.get(tag)?.delete(entry.id);
+            if (entry.embedding) {
+                const removed = await index.removePoint(entry.id);
+                if (removed)
+                    hnswRemoved += 1;
+            }
+        }
+        // Clean up empty namespace/tag sets to keep memory bounded
+        for (const [ns, ids] of namespaceIndex) {
+            if (ids.size === 0)
+                namespaceIndex.delete(ns);
+        }
+        for (const [tag, ids] of tagIndex) {
+            if (ids.size === 0)
+                tagIndex.delete(tag);
+        }
+        return {
+            removed: toRemove.length,
+            remaining: entries.size,
+            hnswRemoved,
+        };
+    }
+    /**
+     * Pick the keeper for a duplicate group per `strategy` and, for
+     * `merge-tags`, union the group's tag sets onto it. Shared by both the
+     * content-hash pass and the embedding near-duplicate pass in `dedup()`.
+     */
+    selectKeeper(bucket, strategy) {
+        const keeper = strategy === 'keep-oldest'
+            ? bucket.reduce((acc, e) => (e.createdAt < acc.createdAt ? e : acc))
+            : // keep-newest + merge-tags share this branch
+                bucket.reduce((acc, e) => (e.updatedAt > acc.updatedAt ? e : acc));
+        return keeper;
+    }
+    /**
+     * Drop every entry in `bucket` except the strategy-selected keeper,
+     * updating all adapter indexes (and the HNSW index, for entries that have
+     * an embedding) to match. Shared by both dedup passes.
+     */
+    async mergeGroup(bucket, strategy, ctx) {
+        const keeper = this.selectKeeper(bucket, strategy);
+        if (strategy === 'merge-tags') {
+            const tagSet = new Set(keeper.tags);
+            for (const e of bucket)
+                for (const t of e.tags)
+                    tagSet.add(t);
+            const oldTags = keeper.tags;
+            keeper.tags = [...tagSet];
+            // Update tagIndex membership for newly-added tags
+            for (const t of keeper.tags) {
+                if (!oldTags.includes(t)) {
+                    if (!ctx.tagIndex.has(t))
+                        ctx.tagIndex.set(t, new Set());
+                    ctx.tagIndex.get(t).add(keeper.id);
+                }
+            }
+        }
+        let dropped = 0;
+        for (const e of bucket) {
+            if (e.id === keeper.id)
+                continue;
+            ctx.entries.delete(e.id);
+            ctx.namespaceIndex.get(e.namespace)?.delete(e.id);
+            const compositeKey = encodeMemoryKey(e.namespace, e.key, ctx.defaultNamespace);
+            if (ctx.keyIndex.get(compositeKey) === e.id) {
+                ctx.keyIndex.delete(compositeKey);
+            }
+            for (const tag of e.tags)
+                ctx.tagIndex.get(tag)?.delete(e.id);
+            if (e.embedding) {
+                await ctx.index.removePoint(e.id);
+            }
+            dropped += 1;
+        }
+        return { keeperId: keeper.id, dropped };
+    }
+    /**
+     * Collapse duplicates across all namespaces per `strategy`, in two passes:
+     *
+     * 1. Byte-exact content-hash buckets (unchanged from pre-4.1 behavior).
+     * 2. Embedding near-duplicates: for entries that survive pass 1 and carry
+     *    an `embedding`, query the already-populated `HNSWIndex` (the same
+     *    index instance this method already holds a handle to for removal
+     *    bookkeeping) for cosine-similarity neighbors above
+     *    `opts.similarityThreshold` (default 0.95). This catches paraphrases
+     *    and reformattings that byte-exact hashing structurally cannot, at no
+     *    extra backend round-trip cost — the embedding and the index are both
+     *    already resident in memory at this call site.
+     *
+     * Pass 2 only runs when the index's configured metric is `'cosine'` (its
+     * distances are `1 - similarity`) and the threshold is `< 1`; otherwise
+     * behavior is identical to hash-only dedup.
+     *
+     * - `keep-newest`: keep the entry with the highest `updatedAt`, drop the rest.
+     * - `keep-oldest`: keep the entry with the lowest `createdAt`, drop the rest.
+     * - `merge-tags`: keep newest, but union the tag sets of the duplicates first.
+     */
+    async dedup(strategy) {
+        const adapter = this.service.getAdapter();
+        const entries = adapter.entries;
+        const namespaceIndex = adapter.namespaceIndex;
+        const keyIndex = adapter.keyIndex;
+        const tagIndex = adapter.tagIndex;
+        const index = adapter.index;
+        const ctx = { entries, namespaceIndex, keyIndex, tagIndex, index, defaultNamespace: adapter.config?.defaultNamespace };
+        const effective = strategy ?? this.opts.dedupStrategy ?? 'keep-newest';
+        // Pass 1: bucket by content hash (byte-exact duplicates)
+        const buckets = new Map();
+        for (const entry of entries.values()) {
+            const hash = createHash('sha256').update(entry.content).digest('hex');
+            const bucket = buckets.get(hash);
+            if (bucket)
+                bucket.push(entry);
+            else
+                buckets.set(hash, [entry]);
+        }
+        let merged = 0;
+        let dupGroups = 0;
+        for (const bucket of buckets.values()) {
+            if (bucket.length <= 1)
+                continue;
+            dupGroups += 1;
+            const { dropped } = await this.mergeGroup(bucket, effective, ctx);
+            merged += dropped;
+        }
+        // Pass 2: embedding near-duplicates among pass-1 survivors.
+        //
+        // Each round only groups an entry with what its single
+        // `NEAR_DUP_SEARCH_K`-wide HNSW query returns, so a duplicate cluster
+        // larger than that window can split into more than one surviving
+        // sub-group in a single round (each sub-group's keeper remains
+        // un-merged with the others). Looping to a fixed point — re-scanning
+        // until a full round produces zero merges — guarantees a single
+        // `dedup()` call fully converges regardless of cluster size, at the
+        // cost of one extra full round whenever a cluster does split (bounded:
+        // strictly fewer entries remain each round that merges anything, so
+        // this always terminates). `groups` therefore counts merge operations
+        // across all rounds, which can exceed the number of ultimate
+        // underlying duplicate clusters when one of them needed more than one
+        // round to fully collapse.
+        const threshold = this.opts.similarityThreshold ?? DEFAULT_SIMILARITY_THRESHOLD;
+        if (index.getConfig().metric === 'cosine' && threshold < 1) {
+            let roundMerged;
+            do {
+                roundMerged = 0;
+                const consumed = new Set();
+                // Snapshot survivors up front — mutated further as groups merge.
+                for (const entry of [...entries.values()]) {
+                    if (consumed.has(entry.id) || !entry.embedding || !entries.has(entry.id)) {
+                        continue;
+                    }
+                    const hits = await index.search(entry.embedding, NEAR_DUP_SEARCH_K, NEAR_DUP_SEARCH_EF);
+                    const group = [entry];
+                    for (const hit of hits) {
+                        if (hit.id === entry.id || consumed.has(hit.id))
+                            continue;
+                        const candidate = entries.get(hit.id);
+                        if (!candidate || !candidate.embedding)
+                            continue;
+                        const similarity = 1 - hit.distance;
+                        if (similarity >= threshold)
+                            group.push(candidate);
+                    }
+                    if (group.length <= 1) {
+                        consumed.add(entry.id);
+                        continue;
+                    }
+                    dupGroups += 1;
+                    const { dropped } = await this.mergeGroup(group, effective, ctx);
+                    merged += dropped;
+                    roundMerged += dropped;
+                    for (const e of group)
+                        consumed.add(e.id);
+                }
+            } while (roundMerged > 0);
+        }
+        return { merged, groups: dupGroups };
+    }
+    /**
+     * Rebuild the HNSW index from the current set of entries with embeddings.
+     * Returns a count snapshot + duration.
+     */
+    async compactHnsw() {
+        const adapter = this.service.getAdapter();
+        const entries = adapter.entries;
+        const index = adapter.index;
+        const before = index.size;
+        const t0 = Date.now();
+        // Build a fresh HNSW from current entries that have embeddings.
+        const cfg = index.getConfig();
+        const fresh = new HNSWIndex({
+            dimensions: cfg.dimensions,
+            M: cfg.M,
+            efConstruction: cfg.efConstruction,
+            maxElements: cfg.maxElements,
+            metric: cfg.metric,
+        });
+        for (const entry of entries.values()) {
+            if (entry.embedding) {
+                try {
+                    await fresh.addPoint(entry.id, entry.embedding);
+                }
+                catch {
+                    // Tolerate dimension mismatches in malformed datasets.
+                }
+            }
+        }
+        // Swap pointers atomically and re-forward events
+        adapter.index = fresh;
+        if (typeof adapter.emit === 'function') {
+            fresh.on('point:added', (data) => adapter.emit('index:added', data));
+        }
+        const durationMs = Date.now() - t0;
+        return { before, after: fresh.size, durationMs };
+    }
+    /**
+     * Sweep → dedup → compact. Used by the background timer and by the
+     * `nightlyLearner` AgentDB controller.
+     */
+    async runAll() {
+        const start = Date.now();
+        const sweep = await this.sweepExpired();
+        const dedup = await this.dedup();
+        const compact = await this.compactHnsw();
+        return {
+            sweep,
+            dedup,
+            compact,
+            totalDurationMs: Date.now() - start,
+        };
+    }
+}
+export default MemoryConsolidator;
+//# sourceMappingURL=consolidator.js.map

package/dist/consolidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.js","sourceRoot":"","sources":["../src/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAuBlD,MAAM,4BAA4B,GAAG,IAAI,CAAC;AAC1C,8EAA8E;AAC9E,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B;;;;;;;;;;;;GAYG;AACH,MAAM,kBAAkB,GAAG,EAAE,CAAC;AA0C9B,MAAM,OAAO,kBAAkB;IAEV;IACA;IAFnB,YACmB,OAAoB,EACpB,OAA4B,EAAE;QAD9B,YAAO,GAAP,OAAO,CAAa;QACpB,SAAI,GAAJ,IAAI,CAA0B;IAC9C,CAAC;IAEJ;;OAEG;IACH,KAAK,CAAC,YAAY;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAS,CAAC;QACjD,MAAM,OAAO,GAA6B,OAAO,CAAC,OAAO,CAAC;QAC1D,MAAM,cAAc,GAA6B,OAAO,CAAC,cAAc,CAAC;QACxE,MAAM,QAAQ,GAAwB,OAAO,CAAC,QAAQ,CAAC;QACvD,MAAM,QAAQ,GAA6B,OAAO,CAAC,QAAQ,CAAC;QAC5D,MAAM,KAAK,GAAc,OAAO,CAAC,KAAK,CAAC;QAEvC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC;gBACrD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACzB,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACtD,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YACnG,IAAI,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,KAAK,CAAC,EAAE;gBAAE,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3E,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI;gBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAClE,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAClD,IAAI,OAAO;oBAAE,WAAW,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,cAAc,EAAE,CAAC;YACvC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;gBAAE,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;gBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO;YACL,OAAO,EAAE,QAAQ,CAAC,MAAM;YACxB,SAAS,EAAE,OAAO,CAAC,IAAI;YACvB,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,MAAqB,EAAE,QAAuB;QACjE,MAAM,MAAM,GACV,QAAQ,KAAK,aAAa;YACxB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACpE,CAAC,CAAC,6CAA6C;gBAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,UAAU,CACtB,MAAqB,EACrB,QAAuB,EACvB,GAOC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEnD,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5C,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;YAC5B,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;YAC1B,kDAAkD;YAClD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACzD,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBAAE,SAAS;YACjC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,MAAM,YAAY,GAAG,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;YAC/E,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;gBAC5C,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACpC,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI;gBAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9D,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;gBAChB,MAAM,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,IAAI,CAAC,CAAC;QACf,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,KAAK,CAAC,KAAK,CAAC,QAAwB;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAS,CAAC;QACjD,MAAM,OAAO,GAA6B,OAAO,CAAC,OAAO,CAAC;QAC1D,MAAM,cAAc,GAA6B,OAAO,CAAC,cAAc,CAAC;QACxE,MAAM,QAAQ,GAAwB,OAAO,CAAC,QAAQ,CAAC;QACvD,MAAM,QAAQ,GAA6B,OAAO,CAAC,QAAQ,CAAC;QAC5D,MAAM,KAAK,GAAc,OAAO,CAAC,KAAK,CAAC;QACvC,MAAM,GAAG,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,OAAO,CAAC,MAAM,EAAE,gBAAgB,EAAE,CAAC;QAEvH,MAAM,SAAS,GAAG,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC;QAEvE,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtE,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;gBAAE,SAAS;YACjC,SAAS,IAAI,CAAC,CAAC;YACf,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAClE,MAAM,IAAI,OAAO,CAAC;QACpB,CAAC;QAED,4DAA4D;QAC5D,EAAE;QACF,uDAAuD;QACvD,sEAAsE;QACtE,iEAAiE;QACjE,+DAA+D;QAC/D,qEAAqE;QACrE,gEAAgE;QAChE,oEAAoE;QACpE,uEAAuE;QACvE,oEAAoE;QACpE,sEAAsE;QACtE,6DAA6D;QAC7D,sEAAsE;QACtE,2BAA2B;QAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,mBAAmB,IAAI,4BAA4B,CAAC;QAChF,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC,MAAM,KAAK,QAAQ,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAC3D,IAAI,WAAmB,CAAC;YACxB,GAAG,CAAC;gBACF,WAAW,GAAG,CAAC,CAAC;gBAChB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;gBACnC,iEAAiE;gBACjE,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;oBAC1C,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;wBACzE,SAAS;oBACX,CAAC;oBAED,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;oBACxF,MAAM,KAAK,GAAkB,CAAC,KAAK,CAAC,CAAC;oBACrC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;wBACvB,IAAI,GAAG,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BAAE,SAAS;wBAC1D,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACtC,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,SAAS;4BAAE,SAAS;wBACjD,MAAM,UAAU,GAAG,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC;wBACpC,IAAI,UAAU,IAAI,SAAS;4BAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrD,CAAC;oBAED,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;wBACtB,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBACvB,SAAS;oBACX,CAAC;oBAED,SAAS,IAAI,CAAC,CAAC;oBACf,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;oBACjE,MAAM,IAAI,OAAO,CAAC;oBAClB,WAAW,IAAI,OAAO,CAAC;oBACvB,KAAK,MAAM,CAAC,IAAI,KAAK;wBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC,QAAQ,WAAW,GAAG,CAAC,EAAE;QAC5B,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IACvC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAS,CAAC;QACjD,MAAM,OAAO,GAA6B,OAAO,CAAC,OAAO,CAAC;QAC1D,MAAM,KAAK,GAAc,OAAO,CAAC,KAAK,CAAC;QAEvC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEtB,gEAAgE;QAChE,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC;YAC1B,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,CAAC,EAAE,GAAG,CAAC,CAAC;YACR,cAAc,EAAE,GAAG,CAAC,cAAc;YAClC,WAAW,EAAE,GAAG,CAAC,WAAW;YAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;SACnB,CAAC,CAAC;QAEH,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC;oBACH,MAAM,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;gBAClD,CAAC;gBAAC,MAAM,CAAC;oBACP,uDAAuD;gBACzD,CAAC;YACH,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;QACtB,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACvC,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAS,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;QAC5E,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QACnC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACzC,OAAO;YACL,KAAK;YACL,KAAK;YACL,OAAO;YACP,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SACpC,CAAC;IACJ,CAAC;CACF;AAED,eAAe,kBAAkB,CAAC"}

package/dist/consolidator.test.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Phase 4 — MemoryConsolidator (ADR-125)
+ *
+ * Verifies:
+ * - `sweepExpired()` after 1000 entries with `expiresAt` in the past →
+ *   `entries.size === 0` AND `hnsw.size === 0` (Acceptance Criterion #4).
+ * - `dedup('keep-newest')` collapses content-hash duplicates and keeps the
+ *   newest by `updatedAt`.
+ * - `dedup('keep-oldest')` keeps the oldest by `createdAt`.
+ * - `dedup('merge-tags')` unions tags and keeps the newest.
+ * - `compactHnsw` rebuilds the index so size matches `entries.size`.
+ * - Auto-run timer with a small interval calls `runAll()` at least once.
+ * - `nightlyLearner` controller delegates to `MemoryConsolidator.runAll()`
+ *   when a `MemoryService` is registered.
+ */
+export {};
+//# sourceMappingURL=consolidator.test.d.ts.map

package/dist/consolidator.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.test.d.ts","sourceRoot":"","sources":["../src/consolidator.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG"}