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

package/dist/consolidator-embedding-benchmark.test.js

@@ -0,0 +1,366 @@
+/**
+ * Phase 4.1 — embedding near-duplicate pass: precision/recall, latency,
+ * namespace-isolation, and determinism receipts (response to PR #3232
+ * review: "the 0.95 threshold needs an empirical contract rather than a
+ * smoke fixture").
+ *
+ * IMPORTANT — corpus provenance: this file does NOT use a real pinned
+ * embedding model. Both real ONNX backends this monorepo ships
+ * (`@huggingface/transformers` and the legacy `@xenova/transformers`) were
+ * attempted directly in this environment and both fail for reasons
+ * unrelated to this candidate:
+ *   - `@huggingface/transformers@4.2.0`: `transformers.node.mjs` does
+ *     `import { Tensor } from "onnxruntime-common"` against a CJS module,
+ *     a real ESM/CJS interop break under this Node version — reproduces
+ *     on an unmodified checkout, confirmed before writing this file.
+ *   - `@xenova/transformers@2.17.0`: pulls in `sharp@0.32.6`, whose
+ *     native binding (`sharp-linux-x64.node`) isn't present for this
+ *     sandbox's platform.
+ * Neither is fixable within this PR's scope without touching unrelated,
+ * pre-existing native/module-resolution infrastructure this diff never
+ * touches. This package's own `__tests__/embeddings.test.ts` exercises
+ * only the `mock` provider — it never invokes a real transformer either,
+ * consistent with what was found here.
+ *
+ * What this file DOES provide instead: a deterministic synthetic corpus
+ * where pairwise cosine similarity is constructed EXACTLY (not measured
+ * after the fact) via `pairAtSimilarity()` below — for every pair the
+ * ground-truth similarity is known analytically, not estimated. That
+ * makes this a rigorous test of the near-dup pass's THRESHOLD MECHANICS
+ * (precision/recall as a function of `similarityThreshold`, exactly where
+ * the boundary is) — arguably a cleaner instrument for that specific
+ * question than a real corpus would be, since there is no measurement
+ * noise in the "true" similarity. It does NOT validate that 0.95 is the
+ * right cutoff for real-world semantic paraphrase detection with a real
+ * embedding model — that claim remains open pending the blocked ONNX
+ * path, and is called out explicitly, not implied.
+ */
+import { describe, it, expect } from 'vitest';
+import { MemoryService } from './index.js';
+import { MemoryConsolidator } from './consolidator.js';
+import { createDefaultEntry } from './types.js';
+/** Deterministic xorshift PRNG, seeded — matches consolidator.test.ts's randomVec. */
+function seededRng(seed) {
+    let s = seed | 0 || 1;
+    return () => {
+        s ^= s << 13;
+        s ^= s >>> 17;
+        s ^= s << 5;
+        return (s | 0) / 2 ** 31;
+    };
+}
+function randomUnitVector(dim, seed) {
+    const rng = seededRng(seed);
+    const v = new Float32Array(dim);
+    for (let i = 0; i < dim; i++)
+        v[i] = rng();
+    return normalize(v);
+}
+function normalize(v) {
+    let norm = 0;
+    for (let i = 0; i < v.length; i++)
+        norm += v[i] * v[i];
+    norm = Math.sqrt(norm) || 1;
+    const out = new Float32Array(v.length);
+    for (let i = 0; i < v.length; i++)
+        out[i] = v[i] / norm;
+    return out;
+}
+function dot(a, b) {
+    let s = 0;
+    for (let i = 0; i < a.length; i++)
+        s += a[i] * b[i];
+    return s;
+}
+/**
+ * Construct a unit vector `b` such that cosine(a, b) === targetSimilarity
+ * exactly (up to float precision), by mixing `a` with a vector orthogonal
+ * to it: b = s*a + sqrt(1-s^2)*orth, |a|=|orth|=1, a⊥orth.
+ */
+function vectorAtSimilarity(a, targetSimilarity, seed) {
+    const dim = a.length;
+    // Random candidate, then Gram-Schmidt to make it orthogonal to `a`.
+    let orth = randomUnitVector(dim, seed);
+    const proj = dot(orth, a);
+    const raw = new Float32Array(dim);
+    for (let i = 0; i < dim; i++)
+        raw[i] = orth[i] - proj * a[i];
+    orth = normalize(raw);
+    const s = targetSimilarity;
+    const c = Math.sqrt(Math.max(0, 1 - s * s));
+    const out = new Float32Array(dim);
+    for (let i = 0; i < dim; i++)
+        out[i] = s * a[i] + c * orth[i];
+    return out;
+}
+async function newService(dimensions = 32) {
+    const svc = new MemoryService({ dimensions, persistenceEnabled: false, snapshotInterval: 0 });
+    await svc.initialize();
+    return svc;
+}
+const DIM = 32;
+// Base anchor vectors, one per pair, all mutually near-orthogonal (distinct
+// content clusters) so pairs don't cross-contaminate each other's matches.
+function buildCorpus() {
+    const pairs = [
+        { label: 'near-dup-0.999', targetSimilarity: 0.999, shouldMergeAtDefault: true },
+        { label: 'near-dup-0.98', targetSimilarity: 0.98, shouldMergeAtDefault: true },
+        { label: 'near-dup-0.96', targetSimilarity: 0.96, shouldMergeAtDefault: true },
+        { label: 'boundary-0.955', targetSimilarity: 0.955, shouldMergeAtDefault: true },
+        { label: 'hard-negative-0.94', targetSimilarity: 0.94, shouldMergeAtDefault: false },
+        { label: 'hard-negative-0.90', targetSimilarity: 0.90, shouldMergeAtDefault: false },
+        { label: 'hard-negative-0.85', targetSimilarity: 0.85, shouldMergeAtDefault: false },
+        { label: 'easy-negative-0.30', targetSimilarity: 0.30, shouldMergeAtDefault: false },
+    ];
+    const anchors = pairs.map((_, i) => randomUnitVector(DIM, 1000 + i * 7));
+    return { anchors, pairs };
+}
+describe('Phase 4.1 embedding benchmark — pairwise similarity is exact by construction', () => {
+    it('vectorAtSimilarity produces the requested cosine similarity to within 1e-5', () => {
+        const a = randomUnitVector(DIM, 42);
+        for (const target of [0.999, 0.96, 0.955, 0.9, 0.85, 0.3, 0, -0.5]) {
+            const b = vectorAtSimilarity(a, target, 99);
+            expect(dot(a, b)).toBeCloseTo(target, 5);
+        }
+    });
+});
+describe('Phase 4.1 embedding benchmark — precision/recall across a threshold sweep', () => {
+    it('at the shipped default (0.95), every near-dup pair merges and every hard negative does not', async () => {
+        const svc = await newService();
+        const consolidator = new MemoryConsolidator(svc);
+        const { anchors, pairs } = buildCorpus();
+        const ids = {};
+        for (let i = 0; i < pairs.length; i++) {
+            const a = createDefaultEntry({ key: `${pairs[i].label}-a`, content: `${pairs[i].label} canonical text ${i}` });
+            a.embedding = anchors[i];
+            await svc.store(a);
+            const b = createDefaultEntry({ key: `${pairs[i].label}-b`, content: `${pairs[i].label} variant text ${i}` });
+            b.embedding = vectorAtSimilarity(anchors[i], pairs[i].targetSimilarity, 5000 + i);
+            await svc.store(b);
+            ids[pairs[i].label] = [a.id, b.id];
+        }
+        await consolidator.dedup('keep-newest');
+        const adapter = svc.getAdapter();
+        let truePositives = 0;
+        let falseNegatives = 0;
+        let trueNegatives = 0;
+        let falsePositives = 0;
+        for (const pair of pairs) {
+            const [idA, idB] = ids[pair.label];
+            const bothSurvive = adapter.entries.has(idA) && adapter.entries.has(idB);
+            const merged = !bothSurvive;
+            if (pair.shouldMergeAtDefault) {
+                if (merged)
+                    truePositives++;
+                else
+                    falseNegatives++;
+            }
+            else {
+                if (merged)
+                    falsePositives++;
+                else
+                    trueNegatives++;
+            }
+        }
+        // Ground-truth contract for the shipped default: clean separation
+        // around the 0.95 boundary in this corpus — no false merges, no
+        // false splits among the near-dup/hard-negative pairs constructed
+        // above.
+        expect(falsePositives).toBe(0); // no hard negative incorrectly merged
+        expect(falseNegatives).toBe(0); // no true near-dup left unmerged
+        expect(truePositives).toBe(pairs.filter((p) => p.shouldMergeAtDefault).length);
+        expect(trueNegatives).toBe(pairs.filter((p) => !p.shouldMergeAtDefault).length);
+        await svc.close();
+    });
+    it('reports precision/recall/false-merge-rate across a threshold sweep', async () => {
+        // Deliberately offset from every corpus pair's constructed similarity
+        // (0.999/0.98/0.96/0.955/0.94/0.90/0.85/0.30) by a margin large enough
+        // to absorb float32 precision jitter from HNSW's internal
+        // normalize-then-dot-product distance computation (empirically <1e-5
+        // here, but a boundary value with ZERO margin — e.g. sweeping exactly
+        // 0.90 against a pair constructed at exactly 0.90 — is a real flake
+        // this file hit and fixed while writing it; the margin here is the fix).
+        const thresholds = [0.5, 0.8, 0.875, 0.92, 0.97];
+        const rows = [];
+        for (const threshold of thresholds) {
+            const svc = await newService();
+            const consolidator = new MemoryConsolidator(svc, { similarityThreshold: threshold });
+            const { anchors, pairs: p2 } = buildCorpus();
+            const ids = {};
+            for (let i = 0; i < p2.length; i++) {
+                const a = createDefaultEntry({ key: `${p2[i].label}-a`, content: `${p2[i].label} canonical text ${i}` });
+                a.embedding = anchors[i];
+                await svc.store(a);
+                const b = createDefaultEntry({ key: `${p2[i].label}-b`, content: `${p2[i].label} variant text ${i}` });
+                b.embedding = vectorAtSimilarity(anchors[i], p2[i].targetSimilarity, 5000 + i);
+                await svc.store(b);
+                ids[p2[i].label] = [a.id, b.id];
+            }
+            await consolidator.dedup('keep-newest');
+            const adapter = svc.getAdapter();
+            // Ground truth here is "similarity >= threshold" (not the fixed
+            // 0.95-default contract used above), so precision/recall are
+            // measured against what SHOULD merge at each threshold under test.
+            let tp = 0;
+            let fp = 0;
+            let fn = 0;
+            let tn = 0;
+            for (const pair of p2) {
+                const [idA, idB] = ids[pair.label];
+                const merged = !(adapter.entries.has(idA) && adapter.entries.has(idB));
+                const shouldMerge = pair.targetSimilarity >= threshold;
+                if (shouldMerge && merged)
+                    tp++;
+                else if (shouldMerge && !merged)
+                    fn++;
+                else if (!shouldMerge && merged)
+                    fp++;
+                else
+                    tn++;
+            }
+            const precision = tp + fp === 0 ? 1 : tp / (tp + fp);
+            const recall = tp + fn === 0 ? 1 : tp / (tp + fn);
+            const falseMergeRate = fp + tn === 0 ? 0 : fp / (fp + tn);
+            rows.push({ threshold, precision, recall, falseMergeRate });
+            await svc.close();
+        }
+        // eslint-disable-next-line no-console
+        console.log('similarityThreshold sweep (synthetic exact-similarity corpus):', JSON.stringify(rows));
+        // Every threshold in this sweep gets perfect precision/recall on this
+        // corpus, because pair similarities were deliberately placed with a
+        // >=0.005 margin on either side of each candidate threshold. That is
+        // the corpus proving the near-dup pass's comparison (`similarity >=
+        // threshold`) is exact and monotonic, not that any one threshold is
+        // "best" — this sweep is a mechanics check, not a model-selection
+        // benchmark.
+        for (const row of rows) {
+            expect(row.precision).toBe(1);
+            expect(row.recall).toBe(1);
+            expect(row.falseMergeRate).toBe(0);
+        }
+    });
+});
+describe('Phase 4.1 embedding benchmark — namespace isolation (pre-existing behavior, unchanged)', () => {
+    it('cross-namespace near-duplicates merge exactly as cross-namespace hash-exact duplicates already did', async () => {
+        const svc = await newService();
+        const consolidator = new MemoryConsolidator(svc);
+        // Hash-exact case: identical content, two namespaces. dedup()'s
+        // bucket-by-hash pass has never scoped by namespace (grep-confirmed
+        // on the pre-candidate code: `for (const entry of entries.values())`
+        // with no namespace filter) — this candidate does not change that.
+        const h1 = createDefaultEntry({ key: 'h', content: 'exact-duplicate-content', namespace: 'ns-a' });
+        await svc.store(h1);
+        const h2 = createDefaultEntry({ key: 'h', content: 'exact-duplicate-content', namespace: 'ns-b' });
+        await svc.store(h2);
+        // Near-dup case: different content, identical embedding, two namespaces.
+        const anchor = randomUnitVector(DIM, 777);
+        const e1 = createDefaultEntry({ key: 'e', content: 'namespace-a-phrasing', namespace: 'ns-a' });
+        e1.embedding = anchor;
+        await svc.store(e1);
+        const e2 = createDefaultEntry({ key: 'e', content: 'namespace-b-phrasing', namespace: 'ns-b' });
+        e2.embedding = new Float32Array(anchor);
+        await svc.store(e2);
+        const result = await consolidator.dedup('keep-newest');
+        const adapter = svc.getAdapter();
+        // Both the hash-exact pair and the near-dup pair merge across the
+        // namespace boundary — documented, not silently changed. If Ruflo
+        // later decides dedup() should be namespace-scoped, that's a
+        // separate, pre-existing-behavior-affecting decision spanning both
+        // passes, not something introduced by this candidate.
+        const hashSurvivors = [h1.id, h2.id].filter((id) => adapter.entries.has(id));
+        const embedSurvivors = [e1.id, e2.id].filter((id) => adapter.entries.has(id));
+        expect(hashSurvivors.length).toBe(1);
+        expect(embedSurvivors.length).toBe(1);
+        expect(result.merged).toBe(2);
+        await svc.close();
+    });
+});
+describe('Phase 4.1 embedding benchmark — determinism / replay', () => {
+    it('the same corpus produces byte-identical merge/group counts and survivor keys across 3 independent runs', async () => {
+        // Entry ids are randomly generated per store() call (mem_<ts>_<rand>),
+        // so they are NOT expected to match across independent runs even when
+        // merge behavior is fully deterministic — comparing raw ids here would
+        // be testing the id generator, not dedup(). Compare by `key` instead,
+        // which this corpus constructs deterministically from `pairs`.
+        async function runOnce() {
+            const svc = await newService();
+            const consolidator = new MemoryConsolidator(svc);
+            const { anchors, pairs } = buildCorpus();
+            const idToKey = new Map();
+            for (let i = 0; i < pairs.length; i++) {
+                const aKey = `${pairs[i].label}-a`;
+                const a = createDefaultEntry({ key: aKey, content: `${pairs[i].label} canonical text ${i}` });
+                a.embedding = anchors[i];
+                a.updatedAt = 1000 + i * 2;
+                await svc.store(a);
+                idToKey.set(a.id, aKey);
+                const bKey = `${pairs[i].label}-b`;
+                const b = createDefaultEntry({ key: bKey, content: `${pairs[i].label} variant text ${i}` });
+                b.embedding = vectorAtSimilarity(anchors[i], pairs[i].targetSimilarity, 5000 + i);
+                b.updatedAt = 1000 + i * 2 + 1; // always the newer of the pair
+                await svc.store(b);
+                idToKey.set(b.id, bKey);
+            }
+            const result = await consolidator.dedup('keep-newest');
+            const adapter = svc.getAdapter();
+            const survivorKeys = [...idToKey.entries()]
+                .filter(([id]) => adapter.entries.has(id))
+                .map(([, key]) => key)
+                .sort();
+            await svc.close();
+            return { merged: result.merged, groups: result.groups, survivorKeys };
+        }
+        // Sequential, not parallel — isolates each run's timing/state fully,
+        // removing any doubt about event-loop interleaving as a confound.
+        const r1 = await runOnce();
+        const r2 = await runOnce();
+        const r3 = await runOnce();
+        expect(r2).toEqual(r1);
+        expect(r3).toEqual(r1);
+    });
+});
+describe('Phase 4.1 embedding benchmark — latency/memory at realistic cardinality', () => {
+    it('dedup() at N=5000 (matching this repo\'s own HNSW benchmark convention) completes within a generous ceiling, baseline vs candidate', async () => {
+        const N = 5000;
+        const DUP_FRACTION = 0.1; // 10% of entries are near-duplicates of an earlier entry
+        async function buildAndRun(similarityThreshold) {
+            const svc = await newService();
+            const consolidator = new MemoryConsolidator(svc, { similarityThreshold });
+            const anchors = [];
+            for (let i = 0; i < N; i++) {
+                const isDup = i > 0 && i % Math.round(1 / DUP_FRACTION) === 0;
+                let embedding;
+                if (isDup) {
+                    const anchor = anchors[Math.floor(Math.random() * anchors.length)];
+                    embedding = vectorAtSimilarity(anchor, 0.985, i);
+                }
+                else {
+                    embedding = randomUnitVector(DIM, 20000 + i);
+                    anchors.push(embedding);
+                }
+                const entry = createDefaultEntry({ key: `n-${i}`, content: `entry-${i}-${isDup ? 'dup' : 'unique'}` });
+                entry.embedding = embedding;
+                await svc.store(entry);
+            }
+            const memBefore = process.memoryUsage().heapUsed;
+            const t0 = Date.now();
+            const result = await consolidator.dedup('keep-newest');
+            const durationMs = Date.now() - t0;
+            const memAfter = process.memoryUsage().heapUsed;
+            await svc.close();
+            return { durationMs, heapDeltaMb: (memAfter - memBefore) / (1024 * 1024), merged: result.merged };
+        }
+        const baseline = await buildAndRun(1); // near-dup pass disabled — hash-only, matches pre-candidate behavior
+        const candidate = await buildAndRun(0.95); // shipped default
+        // eslint-disable-next-line no-console
+        console.log('latency/memory @ N=5000:', JSON.stringify({ baseline, candidate }));
+        // Generous ceilings — this is a regression guard against a pathological
+        // blowup (e.g., an accidental O(n^2) reintroduction), not a tight perf
+        // assertion; CI hardware varies. Real numbers are logged above for the
+        // reviewer regardless of pass/fail margin.
+        expect(candidate.durationMs).toBeLessThan(15_000);
+        expect(candidate.merged).toBeGreaterThan(0); // the injected near-dups were actually caught
+        expect(baseline.merged).toBe(0); // hash-only baseline: all content strings are unique, so 0 hash-exact merges
+    }, 30_000);
+});
+//# sourceMappingURL=consolidator-embedding-benchmark.test.js.map

package/dist/consolidator-embedding-benchmark.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator-embedding-benchmark.test.js","sourceRoot":"","sources":["../src/consolidator-embedding-benchmark.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAEhD,sFAAsF;AACtF,SAAS,SAAS,CAAC,IAAY;IAC7B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,OAAO,GAAG,EAAE;QACV,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACb,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACZ,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,GAAW,EAAE,IAAY;IACjD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IAC3C,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED,SAAS,SAAS,CAAC,CAAe;IAChC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,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,IAAI,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,GAAG,CAAC,CAAe,EAAE,CAAe;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,CAAe,EAAE,gBAAwB,EAAE,IAAY;IACjF,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;IACrB,oEAAoE;IACpE,IAAI,IAAI,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAEtB,MAAM,CAAC,GAAG,gBAAgB,CAAC;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,UAAU,GAAG,EAAE;IACvC,MAAM,GAAG,GAAG,IAAI,aAAa,CAAC,EAAE,UAAU,EAAE,kBAAkB,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,EAAS,CAAC,CAAC;IACrG,MAAM,GAAG,CAAC,UAAU,EAAE,CAAC;IACvB,OAAO,GAAG,CAAC;AACb,CAAC;AAQD,MAAM,GAAG,GAAG,EAAE,CAAC;AAEf,4EAA4E;AAC5E,2EAA2E;AAC3E,SAAS,WAAW;IAClB,MAAM,KAAK,GAAW;QACpB,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,KAAK,EAAE,oBAAoB,EAAE,IAAI,EAAE;QAChF,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE;QAC9E,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE;QAC9E,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,KAAK,EAAE,oBAAoB,EAAE,IAAI,EAAE;QAChF,EAAE,KAAK,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE;QACpF,EAAE,KAAK,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE;QACpF,EAAE,KAAK,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE;QACpF,EAAE,KAAK,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,IAAI,EAAE,oBAAoB,EAAE,KAAK,EAAE;KACrF,CAAC;IACF,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AAED,QAAQ,CAAC,8EAA8E,EAAE,GAAG,EAAE;IAC5F,EAAE,CAAC,4EAA4E,EAAE,GAAG,EAAE;QACpF,MAAM,CAAC,GAAG,gBAAgB,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACnE,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2EAA2E,EAAE,GAAG,EAAE;IACzF,EAAE,CAAC,4FAA4F,EAAE,KAAK,IAAI,EAAE;QAC1G,MAAM,GAAG,GAAG,MAAM,UAAU,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAC,GAAU,CAAC,CAAC;QACxD,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,WAAW,EAAE,CAAC;QAEzC,MAAM,GAAG,GAAqC,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/G,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7G,CAAC,CAAC,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;YAClF,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QACxC,MAAM,OAAO,GAAQ,GAAG,CAAC,UAAU,EAAE,CAAC;QAEtC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACzE,MAAM,MAAM,GAAG,CAAC,WAAW,CAAC;YAC5B,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC9B,IAAI,MAAM;oBAAE,aAAa,EAAE,CAAC;;oBACvB,cAAc,EAAE,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,IAAI,MAAM;oBAAE,cAAc,EAAE,CAAC;;oBACxB,aAAa,EAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,gEAAgE;QAChE,kEAAkE;QAClE,SAAS;QACT,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,sCAAsC;QACtE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAiC;QACjE,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC;QAC/E,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC;QAEhF,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,KAAK,IAAI,EAAE;QAClF,sEAAsE;QACtE,uEAAuE;QACvE,0DAA0D;QAC1D,qEAAqE;QACrE,sEAAsE;QACtE,oEAAoE;QACpE,yEAAyE;QACzE,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,IAAI,GAKL,EAAE,CAAC;QAER,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,MAAM,UAAU,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAC,GAAU,EAAE,EAAE,mBAAmB,EAAE,SAAS,EAAE,CAAC,CAAC;YAC5F,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,WAAW,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAqC,EAAE,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC;gBACzG,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvG,CAAC,CAAC,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;gBAC/E,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,MAAM,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YACxC,MAAM,OAAO,GAAQ,GAAG,CAAC,UAAU,EAAE,CAAC;YAEtC,gEAAgE;YAChE,6DAA6D;YAC7D,mEAAmE;YACnE,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,KAAK,MAAM,IAAI,IAAI,EAAE,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvE,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,IAAI,SAAS,CAAC;gBACvD,IAAI,WAAW,IAAI,MAAM;oBAAE,EAAE,EAAE,CAAC;qBAC3B,IAAI,WAAW,IAAI,CAAC,MAAM;oBAAE,EAAE,EAAE,CAAC;qBACjC,IAAI,CAAC,WAAW,IAAI,MAAM;oBAAE,EAAE,EAAE,CAAC;;oBACjC,EAAE,EAAE,CAAC;YACZ,CAAC;YACD,MAAM,SAAS,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrD,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAClD,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;YAE5D,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;QACpB,CAAC;QAED,sCAAsC;QACtC,OAAO,CAAC,GAAG,CAAC,gEAAgE,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAEpG,sEAAsE;QACtE,oEAAoE;QACpE,qEAAqE;QACrE,oEAAoE;QACpE,oEAAoE;QACpE,kEAAkE;QAClE,aAAa;QACb,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,wFAAwF,EAAE,GAAG,EAAE;IACtG,EAAE,CAAC,oGAAoG,EAAE,KAAK,IAAI,EAAE;QAClH,MAAM,GAAG,GAAG,MAAM,UAAU,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAC,GAAU,CAAC,CAAC;QAExD,gEAAgE;QAChE,oEAAoE;QACpE,qEAAqE;QACrE,mEAAmE;QACnE,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,yBAAyB,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QACnG,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,yBAAyB,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QACnG,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAEpB,yEAAyE;QACzE,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,sBAAsB,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QAChG,EAAE,CAAC,SAAS,GAAG,MAAM,CAAC;QACtB,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,sBAAsB,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;QAChG,EAAE,CAAC,SAAS,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAEpB,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAEvD,MAAM,OAAO,GAAQ,GAAG,CAAC,UAAU,EAAE,CAAC;QACtC,kEAAkE;QAClE,kEAAkE;QAClE,6DAA6D;QAC7D,mEAAmE;QACnE,sDAAsD;QACtD,MAAM,aAAa,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7E,MAAM,cAAc,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE9B,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,EAAE,CAAC,wGAAwG,EAAE,KAAK,IAAI,EAAE;QACtH,uEAAuE;QACvE,sEAAsE;QACtE,uEAAuE;QACvE,sEAAsE;QACtE,+DAA+D;QAC/D,KAAK,UAAU,OAAO;YACpB,MAAM,GAAG,GAAG,MAAM,UAAU,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAC,GAAU,CAAC,CAAC;YACxD,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,WAAW,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;gBACnC,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC9F,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBACxB,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;gBACnC,MAAM,CAAC,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC5F,CAAC,CAAC,SAAS,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;gBAClF,CAAC,CAAC,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,+BAA+B;gBAC/D,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC1B,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YACvD,MAAM,OAAO,GAAQ,GAAG,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,YAAY,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBACzC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;iBACrB,IAAI,EAAE,CAAC;YACV,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;YAClB,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC;QACxE,CAAC;QAED,qEAAqE;QACrE,kEAAkE;QAClE,MAAM,EAAE,GAAG,MAAM,OAAO,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,OAAO,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,OAAO,EAAE,CAAC;QAC3B,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yEAAyE,EAAE,GAAG,EAAE;IACvF,EAAE,CAAC,oIAAoI,EAAE,KAAK,IAAI,EAAE;QAClJ,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,YAAY,GAAG,GAAG,CAAC,CAAC,yDAAyD;QAEnF,KAAK,UAAU,WAAW,CAAC,mBAA2B;YACpD,MAAM,GAAG,GAAG,MAAM,UAAU,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,kBAAkB,CAAC,GAAU,EAAE,EAAE,mBAAmB,EAAE,CAAC,CAAC;YACjF,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC9D,IAAI,SAAuB,CAAC;gBAC5B,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;oBACnE,SAAS,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,gBAAgB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1B,CAAC;gBACD,MAAM,KAAK,GAAG,kBAAkB,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBACvG,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;gBAC5B,MAAM,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;YAED,MAAM,SAAS,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;YACjD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YACvD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;YAEhD,MAAM,GAAG,CAAC,KAAK,EAAE,CAAC;YAClB,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QACpG,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,qEAAqE;QAC5G,MAAM,SAAS,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB;QAE7D,sCAAsC;QACtC,OAAO,CAAC,GAAG,CAAC,0BAA0B,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAEjF,wEAAwE;QACxE,uEAAuE;QACvE,uEAAuE;QACvE,2CAA2C;QAC3C,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,8CAA8C;QAC3F,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,6EAA6E;IAChH,CAAC,EAAE,MAAM,CAAC,CAAC;AACb,CAAC,CAAC,CAAC"}

package/dist/consolidator.d.ts

@@ -0,0 +1,131 @@
+/**
+ * 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 type { MemoryEntry } from './types.js';
+/**
+ * Strategy for resolving content-hash duplicates inside {@link MemoryConsolidator.dedup}.
+ */
+export type DedupStrategy = 'keep-newest' | 'keep-oldest' | 'merge-tags';
+export interface ConsolidatorOptions {
+    /** Default strategy when `dedup()` is invoked with no argument. */
+    dedupStrategy?: DedupStrategy;
+    /** Used by `MemoryService` when scheduling automatic runs (ms). */
+    intervalMs?: number;
+    /**
+     * Cosine-similarity floor (0-1) above which two entries with embeddings
+     * are treated as near-duplicates by `dedup()`'s embedding pass, in
+     * addition to its byte-exact content-hash pass. Set to `1` (or above) to
+     * disable the embedding pass entirely and keep pre-Phase-4.1 hash-only
+     * behavior. Default 0.95 — conservative, matches the threshold already
+     * used by the (unwired) domain-layer consolidator for the same purpose.
+     */
+    similarityThreshold?: number;
+}
+export interface SweepResult {
+    removed: number;
+    remaining: number;
+    hnswRemoved: number;
+}
+export interface DedupResult {
+    merged: number;
+    groups: number;
+}
+export interface CompactResult {
+    before: number;
+    after: number;
+    durationMs: number;
+}
+export interface ConsolidationResult {
+    sweep: SweepResult;
+    dedup: DedupResult;
+    compact: CompactResult;
+    totalDurationMs: number;
+}
+/**
+ * Minimal surface the consolidator needs from `UnifiedMemoryService`. Avoids
+ * a circular type import.
+ */
+interface ServiceLike {
+    getAdapter(): {
+        entries: Map<string, MemoryEntry>;
+        namespaceIndex: Map<string, Set<string>>;
+        keyIndex: Map<string, string>;
+        tagIndex: Map<string, Set<string>>;
+        [key: string]: any;
+    };
+}
+export declare class MemoryConsolidator {
+    private readonly service;
+    private readonly opts;
+    constructor(service: ServiceLike, opts?: ConsolidatorOptions);
+    /**
+     * Drop all entries whose `expiresAt` is in the past.
+     */
+    sweepExpired(): Promise<SweepResult>;
+    /**
+     * 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()`.
+     */
+    private selectKeeper;
+    /**
+     * 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.
+     */
+    private mergeGroup;
+    /**
+     * 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.
+     */
+    dedup(strategy?: DedupStrategy): Promise<DedupResult>;
+    /**
+     * Rebuild the HNSW index from the current set of entries with embeddings.
+     * Returns a count snapshot + duration.
+     */
+    compactHnsw(): Promise<CompactResult>;
+    /**
+     * Sweep → dedup → compact. Used by the background timer and by the
+     * `nightlyLearner` AgentDB controller.
+     */
+    runAll(): Promise<ConsolidationResult>;
+}
+export default MemoryConsolidator;
+//# sourceMappingURL=consolidator.d.ts.map

package/dist/consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../src/consolidator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAIH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAG9C;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,aAAa,GAAG,aAAa,GAAG,YAAY,CAAC;AAEzE,MAAM,WAAW,mBAAmB;IAClC,mEAAmE;IACnE,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,mEAAmE;IACnE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAoBD,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE,WAAW,CAAC;IACnB,OAAO,EAAE,aAAa,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,UAAU,WAAW;IACnB,UAAU,IAAI;QAEZ,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAClC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QACzC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAEnC,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;KACpB,CAAC;CACH;AAED,qBAAa,kBAAkB;IAE3B,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,IAAI;gBADJ,OAAO,EAAE,WAAW,EACpB,IAAI,GAAE,mBAAwB;IAGjD;;OAEG;IACG,YAAY,IAAI,OAAO,CAAC,WAAW,CAAC;IA4C1C;;;;OAIG;IACH,OAAO,CAAC,YAAY;IASpB;;;;OAIG;YACW,UAAU;IA8CxB;;;;;;;;;;;;;;;;;;;;OAoBG;IACG,KAAK,CAAC,QAAQ,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,WAAW,CAAC;IAmF3D;;;OAGG;IACG,WAAW,IAAI,OAAO,CAAC,aAAa,CAAC;IAsC3C;;;OAGG;IACG,MAAM,IAAI,OAAO,CAAC,mBAAmB,CAAC;CAY7C;AAED,eAAe,kBAAkB,CAAC"}