@fgv/ts-agent-memory 5.1.0-47 → 5.1.0-48

package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js

@@ -1,362 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-import '@fgv/ts-utils-jest';
-import { fail, succeed } from '@fgv/ts-utils';
-import { InMemoryFragmentCosineIndex } from '../../../index';
-/** A scope-qualified target from a `(scope, id)` pair. */
-function target(scope, id) {
-    return { scope: scope, id: id };
-}
-/** A locator over an arbitrary `[start, end)` span (opaque to the index). */
-function loc(start, end) {
-    return { start, end };
-}
-/** An embedded fragment from a locator + a raw vector. */
-function frag(start, end, vector) {
-    return { locator: loc(start, end), vector: Float32Array.from(vector) };
-}
-/** A trivial record carrying just the id + a marker body, for rebuild tests. */
-function record(id, body = `body-${id}`) {
-    return {
-        envelope: { id: id },
-        body
-    };
-}
-/** A scope-qualified record entry for a rebuild source. */
-function scoped(scope, id, body) {
-    return { target: target(scope, id), record: record(id, body) };
-}
-/** A scripted record source for `rebuild`. */
-class FakeSource {
-    constructor(result) {
-        this._result = result;
-    }
-    list() {
-        return Promise.resolve(this._result);
-    }
-}
-describe('InMemoryFragmentCosineIndex', () => {
-    describe('addFragments', () => {
-        test('stores every fragment and reports the count; tracks record/fragment counts', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            expect(index.recordCount).toBe(0);
-            expect(index.fragmentCount).toBe(0);
-            const t = target('knowledge', 'doc-1');
-            expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])).toSucceedWith(2);
-            expect(index.recordCount).toBe(1);
-            expect(index.fragmentCount).toBe(2);
-        });
-        test('whole-record replace — a second addFragments drops the prior fragments', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const t = target('knowledge', 'doc-1');
-            expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])).toSucceedWith(2);
-            // Re-author with a single fragment: the old two must be gone.
-            expect(await index.addFragments(t, [frag(0, 3, [1, 1])])).toSucceedWith(1);
-            expect(index.recordCount).toBe(1);
-            expect(index.fragmentCount).toBe(1);
-            expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(1);
-                expect(hits[0].locator).toEqual(loc(0, 3));
-            });
-        });
-        test('an empty fragments array drops the record entirely', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const t = target('knowledge', 'doc-1');
-            expect(await index.addFragments(t, [frag(0, 5, [1, 0])])).toSucceedWith(1);
-            expect(await index.addFragments(t, [])).toSucceedWith(0);
-            expect(index.recordCount).toBe(0);
-            expect(index.fragmentCount).toBe(0);
-        });
-        test('same stem in different scopes are distinct entries', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const a = target('conv-a', 'turn-3');
-            const b = target('conv-b', 'turn-3');
-            expect(await index.addFragments(a, [frag(0, 5, [1, 0])])).toSucceedWith(1);
-            expect(await index.addFragments(b, [frag(0, 5, [0, 1])])).toSucceedWith(1);
-            expect(index.recordCount).toBe(2);
-            expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(2);
-                expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));
-            });
-        });
-        test('fails loudly on an empty fragment vector — and does not partially store', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const t = target('knowledge', 'doc-1');
-            // First fragment is fine, second is empty: whole-record-replace must be all-or-nothing.
-            expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [])])).toFailWith(/empty fragment vector/i);
-            expect(index.recordCount).toBe(0);
-            expect(index.fragmentCount).toBe(0);
-        });
-        test('fails loudly on a fragment-dimension mismatch against the established dimension', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            expect(await index.addFragments(target('knowledge', 'a'), [frag(0, 5, [1, 0])])).toSucceed();
-            expect(await index.addFragments(target('knowledge', 'b'), [frag(0, 5, [1, 0, 0])])).toFailWith(/fragment dimension 3 does not match index dimension 2/i);
-        });
-        test('a failed multi-fragment add on a fresh index does not establish a dimension (all-or-nothing)', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            // Batch: first fragment (dim 2) would set the dimension, second (dim 3) fails
-            // the check. The failed add must leave the index wholly dimensionless — not
-            // half-committed to dim 2 — so a later legitimate dim-3 add still succeeds.
-            expect(await index.addFragments(target('knowledge', 'doc-1'), [frag(0, 5, [1, 0]), frag(5, 10, [1, 0, 0])])).toFailWith(/fragment dimension 3 does not match index dimension 2/i);
-            expect(index.recordCount).toBe(0);
-            expect(index.fragmentCount).toBe(0);
-            // The dimension was never committed: a fresh dim-3 record indexes cleanly.
-            expect(await index.addFragments(target('knowledge', 'doc-2'), [frag(0, 5, [1, 0, 0])])).toSucceedWith(1);
-            expect(await index.query(Float32Array.from([1, 0, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].target.id).toBe('doc-2');
-                expect(hits[0].score).toBeCloseTo(1);
-            });
-        });
-        test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const buffer = Float32Array.from([1, 0]);
-            (await index.addFragments(target('knowledge', 'doc-1'), [{ locator: loc(0, 5), vector: buffer }])).orThrow();
-            buffer[0] = 0;
-            buffer[1] = 1;
-            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].score).toBeCloseTo(1);
-            });
-        });
-    });
-    describe('query', () => {
-        async function seeded() {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc-a'), [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])).orThrow();
-            (await index.addFragments(target('knowledge', 'doc-b'), [frag(0, 5, [1, 1])])).orThrow();
-            return index;
-        }
-        test('returns fragment hits in descending cosine-similarity order, each carrying its locator', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy((hits) => {
-                // doc-a[0,5] matches [1,0] best (score 1), then doc-b (1/sqrt2), then doc-a[5,10] (0).
-                expect(hits[0].target.id).toBe('doc-a');
-                expect(hits[0].locator).toEqual(loc(0, 5));
-                expect(hits[0].score).toBeCloseTo(1);
-                expect(hits[1].target.id).toBe('doc-b');
-                expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));
-                expect(hits[2].target.id).toBe('doc-a');
-                expect(hits[2].locator).toEqual(loc(5, 10));
-                expect(hits[2].score).toBeCloseTo(0);
-            });
-        });
-        test('truncates to topK', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(2);
-                expect(hits.map((h) => h.locator)).toEqual([loc(0, 5), loc(0, 5)]);
-                expect(hits[0].target.id).toBe('doc-a');
-                expect(hits[1].target.id).toBe('doc-b');
-            });
-        });
-        test('maxPerRecord caps fragments per record during selection (before the topK cut)', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            // doc-a has three fragments that all beat doc-b's single fragment.
-            (await index.addFragments(target('knowledge', 'doc-a'), [
-                frag(0, 5, [1, 0]),
-                frag(5, 10, [0.9, 0.1]),
-                frag(10, 15, [0.8, 0.2])
-            ])).orThrow();
-            (await index.addFragments(target('knowledge', 'doc-b'), [frag(0, 5, [0.7, 0.3])])).orThrow();
-            // Without a cap, top-2 would be doc-a twice. With maxPerRecord=1, doc-b surfaces.
-            expect(await index.query(Float32Array.from([1, 0]), 2, 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(2);
-                expect(hits.map((h) => h.target.id)).toEqual(['doc-a', 'doc-b']);
-                expect(hits[0].locator).toEqual(loc(0, 5));
-            });
-        });
-        test('maxPerRecord=0 yields no hits', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0]), 5, 0)).toSucceedWith([]);
-        });
-        test('maxPerRecord larger than any record leaves the ranking unchanged', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0]), 5, 10)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(3);
-                expect(hits[0].target.id).toBe('doc-a');
-            });
-        });
-        test('returns empty for a non-positive topK', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);
-            expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);
-        });
-        test('returns empty when the index is empty (no dimension check)', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);
-        });
-        test('fails loudly on a query-dimension mismatch', async () => {
-            const index = await seeded();
-            expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(/query dimension 3 does not match index dimension 2/i);
-        });
-        test('scores a degenerate (zero-magnitude) stored fragment as 0 rather than NaN', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc'), [frag(0, 5, [0, 0]), frag(5, 10, [1, 0])])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
-                expect(hits.map((h) => h.locator)).toEqual([loc(5, 10), loc(0, 5)]);
-                expect(hits[1].score).toBe(0);
-            });
-        });
-        test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc'), [frag(0, 5, [1, 0])])).orThrow();
-            expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].score).toBe(0);
-            });
-        });
-    });
-    describe('remove', () => {
-        test('removes every fragment of a record and is reflected in subsequent queries', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const a = target('knowledge', 'doc-a');
-            const b = target('knowledge', 'doc-b');
-            (await index.addFragments(a, [frag(0, 5, [1, 0]), frag(5, 10, [1, 0])])).orThrow();
-            (await index.addFragments(b, [frag(0, 5, [0, 1])])).orThrow();
-            expect(await index.remove(a)).toSucceedWith(a);
-            expect(index.recordCount).toBe(1);
-            expect(index.fragmentCount).toBe(1);
-            expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy((hits) => {
-                expect(hits.map((h) => h.target.id)).toEqual(['doc-b']);
-            });
-        });
-        test('removes only the scoped target — a same-stem record in another scope is left intact', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const a = target('conv-a', 'turn-3');
-            const b = target('conv-b', 'turn-3');
-            (await index.addFragments(a, [frag(0, 5, [1, 0])])).orThrow();
-            (await index.addFragments(b, [frag(0, 5, [0, 1])])).orThrow();
-            expect(await index.remove(a)).toSucceedWith(a);
-            expect(index.recordCount).toBe(1);
-            expect(await index.query(Float32Array.from([0, 1]), 5)).toSucceedAndSatisfy((hits) => {
-                expect(hits).toHaveLength(1);
-                expect(hits[0].target).toEqual(b);
-            });
-        });
-        test('is idempotent — removing an absent target still succeeds', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const t = target('knowledge', 'missing');
-            expect(await index.remove(t)).toSucceedWith(t);
-        });
-    });
-    describe('rebuild', () => {
-        // Deterministic: each record yields two fragments encoding the id's first char code.
-        const embed = (r) => {
-            const code = r.envelope.id.charCodeAt(0);
-            return Promise.resolve(succeed([frag(0, 5, [code, 1]), frag(5, 10, [1, code])]));
-        };
-        test('re-embeds every scoped record and reports the total fragment count', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const source = new FakeSource(succeed([scoped('knowledge', 'a'), scoped('knowledge', 'b')]));
-            expect(await index.rebuild(source, embed)).toSucceedWith(4);
-            expect(index.recordCount).toBe(2);
-            expect(index.fragmentCount).toBe(4);
-        });
-        test('keeps same-stem records under different scopes distinct across a rebuild', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const source = new FakeSource(succeed([scoped('conv-a', 'turn-3'), scoped('conv-b', 'turn-3')]));
-            expect(await index.rebuild(source, embed)).toSucceedWith(4);
-            expect(index.recordCount).toBe(2);
-        });
-        test('clears prior contents and re-establishes the dimension', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'old'), [frag(0, 5, [1, 2, 3])])).orThrow();
-            const source = new FakeSource(succeed([scoped('knowledge', 'a')]));
-            expect(await index.rebuild(source, embed)).toSucceedWith(2);
-            expect(index.recordCount).toBe(1);
-            expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();
-        });
-        test('fails loudly when the source list fails and rolls back to empty', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'seed'), [frag(0, 5, [1, 1])])).orThrow();
-            const source = new FakeSource(fail('disk gone'));
-            expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);
-            expect(index.recordCount).toBe(0);
-        });
-        test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'seed'), [frag(0, 5, [1, 1])])).orThrow();
-            let calls = 0;
-            const flakyEmbed = () => {
-                calls += 1;
-                return Promise.resolve(calls === 1 ? succeed([frag(0, 5, [1, 1])]) : fail('no model'));
-            };
-            const source = new FakeSource(succeed([scoped('conv-a', 'turn-1'), scoped('conv-b', 'turn-1')]));
-            expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'conv-b\0turn-1' failed: no model/i);
-            expect(index.recordCount).toBe(0);
-        });
-        test('fails loudly and rolls back to empty when adding an embedded fragment fails', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const source = new FakeSource(succeed([scoped('knowledge', 'a')]));
-            const emptyEmbed = () => Promise.resolve(succeed([frag(0, 5, [])]));
-            expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty fragment vector/i);
-            expect(index.recordCount).toBe(0);
-        });
-    });
-    describe('fragment identity', () => {
-        /** A fragment identified only by an opaque id — no honest body span. */
-        function idFrag(fragmentId, vector) {
-            return { fragmentId, vector: Float32Array.from(vector) };
-        }
-        test('rejects a fragment carrying neither a locator nor a fragmentId', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            expect(await index.addFragments(target('knowledge', 'doc-a'), [{ vector: Float32Array.from([1, 0]) }])).toFailWith(/at least one of 'locator' or 'fragmentId'/i);
-            expect(index.recordCount).toBe(0);
-        });
-        test('carries an opaque fragmentId through to the query hit verbatim', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            const opaque = 'urn:frag:9f8e::{not-parsed}';
-            (await index.addFragments(target('knowledge', 'doc-a'), [idFrag(opaque, [1, 0])])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].fragmentId).toBe(opaque);
-                expect(hits[0].locator).toBeUndefined();
-            });
-        });
-        test('carries both identities when a fragment supplies both', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc-a'), [
-                Object.assign(Object.assign({}, frag(2, 8, [1, 0])), { fragmentId: 'frag-1' })
-            ])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].locator).toEqual(loc(2, 8));
-                expect(hits[0].fragmentId).toBe('frag-1');
-            });
-        });
-        test('a locator-only fragment produces a hit with no fragmentId key at all', async () => {
-            // Byte-identical to what the index produced before `fragmentId` existed: the key
-            // is absent, not present-and-undefined, so an existing caller's structural
-            // comparisons are unaffected by the addition.
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc-a'), [frag(0, 5, [1, 0])])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(Object.keys(hits[0]).sort()).toEqual(['locator', 'score', 'target']);
-                expect(hits[0]).toStrictEqual({
-                    target: target('knowledge', 'doc-a'),
-                    score: hits[0].score,
-                    locator: loc(0, 5)
-                });
-            });
-        });
-        test('an id-only fragment produces a hit with no locator key at all', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc-a'), [idFrag('frag-1', [1, 0])])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
-                expect(Object.keys(hits[0]).sort()).toEqual(['fragmentId', 'score', 'target']);
-            });
-        });
-        test('mixes identity shapes within one record and within one query', async () => {
-            const index = InMemoryFragmentCosineIndex.create().orThrow();
-            (await index.addFragments(target('knowledge', 'doc-a'), [
-                frag(0, 5, [1, 0]),
-                idFrag('frag-rewritten', [0, 1])
-            ])).orThrow();
-            expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
-                expect(hits[0].locator).toEqual(loc(0, 5));
-                expect(hits[0].fragmentId).toBeUndefined();
-                expect(hits[1].fragmentId).toBe('frag-rewritten');
-                expect(hits[1].locator).toBeUndefined();
-            });
-        });
-    });
-});
-//# sourceMappingURL=inMemoryFragmentCosineIndex.test.js.map

package/dist/test/unit/vector/inMemoryFragmentCosineIndex.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"inMemoryFragmentCosineIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/inMemoryFragmentCosineIndex.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAAU,IAAI,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAQL,2BAA2B,EAG5B,MAAM,gBAAgB,CAAC;AAExB,0DAA0D;AAC1D,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU;IACvC,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED,6EAA6E;AAC7E,SAAS,GAAG,CAAC,KAAa,EAAE,GAAW;IACrC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AACxB,CAAC;AAED,0DAA0D;AAC1D,SAAS,IAAI,CAAC,KAAa,EAAE,GAAW,EAAE,MAAgB;IACxD,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;AACzE,CAAC;AAED,gFAAgF;AAChF,SAAS,MAAM,CAAC,EAAU,EAAE,OAAe,QAAQ,EAAE,EAAE;IACrD,OAAO;QACL,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAc,EAAwC;QACtE,IAAI;KACL,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU,EAAE,IAAa;IACtD,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU;IAEd,YAAmB,MAAkD;QACnE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACM,IAAI;QACT,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;CACF;AAED,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAI,CAAC,4EAA4E,EAAE,KAAK,IAAI,EAAE;YAC5F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAChG,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAChG,8DAA8D;YAC9D,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,wFAAwF;YACxF,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACnF,wBAAwB,CACzB,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iFAAiF,EAAE,KAAK,IAAI,EAAE;YACjG,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7F,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAC5F,wDAAwD,CACzD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8FAA8F,EAAE,KAAK,IAAI,EAAE;YAC9G,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,8EAA8E;YAC9E,4EAA4E;YAC5E,4EAA4E;YAC5E,MAAM,CACJ,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CACrG,CAAC,UAAU,CAAC,wDAAwD,CAAC,CAAC;YACvE,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,2EAA2E;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnG,CAAC,CACF,CAAC;YACF,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC5E,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2FAA2F,EAAE,KAAK,IAAI,EAAE;YAC3G,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CACjG,CAAC,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,KAAK,UAAU,MAAM;YACnB,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAClG,CAAC,OAAO,EAAE,CAAC;YACZ,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzF,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,wFAAwF,EAAE,KAAK,IAAI,EAAE;YACxG,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,uFAAuF;gBACvF,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,EAAE,KAAK,IAAI,EAAE;YACnC,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+EAA+E,EAAE,KAAK,IAAI,EAAE;YAC/F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,mEAAmE;YACnE,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE;gBACrD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aACzB,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;YACZ,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC7F,kFAAkF;YAClF,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC5E,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;gBACjE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;YAC/C,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;YAClF,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;YAC5E,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CACnE,qDAAqD,CACtD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;YAC3F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAChG,CAAC,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACvF,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;YAC3F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvC,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACnF,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9D,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC1D,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qFAAqF,EAAE,KAAK,IAAI,EAAE;YACrG,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACrC,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9D,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YAC1E,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CAAC,GAAG,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,qFAAqF;QACrF,MAAM,KAAK,GAAG,CAAC,CAAyB,EAAqD,EAAE;YAC7F,MAAM,IAAI,GAAY,CAAC,CAAC,QAAQ,CAAC,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,CAAC,CAAC;QAEF,IAAI,CAAC,oEAAoE,EAAE,KAAK,IAAI,EAAE;YACpF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7F,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC1F,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iEAAiE,EAAE,KAAK,IAAI,EAAE;YACjF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,oCAAoC,CAAC,CAAC;YAC5F,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxF,IAAI,KAAK,GAAW,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,GAAsD,EAAE;gBACzE,KAAK,IAAI,CAAC,CAAC;gBACX,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACzF,CAAC,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CACxD,8CAA8C,CAC/C,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6EAA6E,EAAE,KAAK,IAAI,EAAE;YAC7F,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,GAAsD,EAAE,CACzE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,wBAAwB,CAAC,CAAC;YACrF,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,wEAAwE;QACxE,SAAS,MAAM,CAAC,UAAkB,EAAE,MAAgB;YAClD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;YAChF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,CACJ,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAChG,CAAC,UAAU,CAAC,4CAA4C,CAAC,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;YAChF,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,6BAA6B,CAAC;YAC7C,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC7F,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;YACvE,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE;gDAChD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAE,UAAU,EAAE,QAAQ;aAC9C,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;YACtF,iFAAiF;YACjF,2EAA2E;YAC3E,8CAA8C;YAC9C,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzF,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;oBAC5B,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC;oBACpC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;oBACpB,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;iBACnB,CAAC,CAAC;YACL,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;YAC/E,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/F,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;YACjF,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8DAA8D,EAAE,KAAK,IAAI,EAAE;YAC9E,MAAM,KAAK,GAAG,2BAA2B,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7D,CACE,MAAM,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE;gBACrD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,gBAAgB,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACjC,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,aAAa,EAAE,CAAC;gBAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,CAAC;YAC1C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport {\n  IEdgeTarget,\n  IEmbeddedFragment,\n  IFragmentLocator,\n  IMemoryRecord,\n  IMemoryRecordSource,\n  IScopedMemoryRecord,\n  IVectorQueryHit,\n  InMemoryFragmentCosineIndex,\n  MemoryId,\n  MemoryScopeKey\n} from '../../../index';\n\n/** A scope-qualified target from a `(scope, id)` pair. */\nfunction target(scope: string, id: string): IEdgeTarget {\n  return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\n/** A locator over an arbitrary `[start, end)` span (opaque to the index). */\nfunction loc(start: number, end: number): IFragmentLocator {\n  return { start, end };\n}\n\n/** An embedded fragment from a locator + a raw vector. */\nfunction frag(start: number, end: number, vector: number[]): IEmbeddedFragment {\n  return { locator: loc(start, end), vector: Float32Array.from(vector) };\n}\n\n/** A trivial record carrying just the id + a marker body, for rebuild tests. */\nfunction record(id: string, body: string = `body-${id}`): IMemoryRecord<unknown> {\n  return {\n    envelope: { id: id as MemoryId } as IMemoryRecord<unknown>['envelope'],\n    body\n  };\n}\n\n/** A scope-qualified record entry for a rebuild source. */\nfunction scoped(scope: string, id: string, body?: string): IScopedMemoryRecord {\n  return { target: target(scope, id), record: record(id, body) };\n}\n\n/** A scripted record source for `rebuild`. */\nclass FakeSource implements IMemoryRecordSource {\n  private readonly _result: Result<ReadonlyArray<IScopedMemoryRecord>>;\n  public constructor(result: Result<ReadonlyArray<IScopedMemoryRecord>>) {\n    this._result = result;\n  }\n  public list(): Promise<Result<ReadonlyArray<IScopedMemoryRecord>>> {\n    return Promise.resolve(this._result);\n  }\n}\n\ndescribe('InMemoryFragmentCosineIndex', () => {\n  describe('addFragments', () => {\n    test('stores every fragment and reports the count; tracks record/fragment counts', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      expect(index.recordCount).toBe(0);\n      expect(index.fragmentCount).toBe(0);\n      const t = target('knowledge', 'doc-1');\n      expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])).toSucceedWith(2);\n      expect(index.recordCount).toBe(1);\n      expect(index.fragmentCount).toBe(2);\n    });\n\n    test('whole-record replace — a second addFragments drops the prior fragments', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const t = target('knowledge', 'doc-1');\n      expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])).toSucceedWith(2);\n      // Re-author with a single fragment: the old two must be gone.\n      expect(await index.addFragments(t, [frag(0, 3, [1, 1])])).toSucceedWith(1);\n      expect(index.recordCount).toBe(1);\n      expect(index.fragmentCount).toBe(1);\n      expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(1);\n          expect(hits[0].locator).toEqual(loc(0, 3));\n        }\n      );\n    });\n\n    test('an empty fragments array drops the record entirely', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const t = target('knowledge', 'doc-1');\n      expect(await index.addFragments(t, [frag(0, 5, [1, 0])])).toSucceedWith(1);\n      expect(await index.addFragments(t, [])).toSucceedWith(0);\n      expect(index.recordCount).toBe(0);\n      expect(index.fragmentCount).toBe(0);\n    });\n\n    test('same stem in different scopes are distinct entries', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const a = target('conv-a', 'turn-3');\n      const b = target('conv-b', 'turn-3');\n      expect(await index.addFragments(a, [frag(0, 5, [1, 0])])).toSucceedWith(1);\n      expect(await index.addFragments(b, [frag(0, 5, [0, 1])])).toSucceedWith(1);\n      expect(index.recordCount).toBe(2);\n      expect(await index.query(Float32Array.from([1, 1]), 5)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(2);\n          expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));\n        }\n      );\n    });\n\n    test('fails loudly on an empty fragment vector — and does not partially store', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const t = target('knowledge', 'doc-1');\n      // First fragment is fine, second is empty: whole-record-replace must be all-or-nothing.\n      expect(await index.addFragments(t, [frag(0, 5, [1, 0]), frag(5, 10, [])])).toFailWith(\n        /empty fragment vector/i\n      );\n      expect(index.recordCount).toBe(0);\n      expect(index.fragmentCount).toBe(0);\n    });\n\n    test('fails loudly on a fragment-dimension mismatch against the established dimension', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      expect(await index.addFragments(target('knowledge', 'a'), [frag(0, 5, [1, 0])])).toSucceed();\n      expect(await index.addFragments(target('knowledge', 'b'), [frag(0, 5, [1, 0, 0])])).toFailWith(\n        /fragment dimension 3 does not match index dimension 2/i\n      );\n    });\n\n    test('a failed multi-fragment add on a fresh index does not establish a dimension (all-or-nothing)', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      // Batch: first fragment (dim 2) would set the dimension, second (dim 3) fails\n      // the check. The failed add must leave the index wholly dimensionless — not\n      // half-committed to dim 2 — so a later legitimate dim-3 add still succeeds.\n      expect(\n        await index.addFragments(target('knowledge', 'doc-1'), [frag(0, 5, [1, 0]), frag(5, 10, [1, 0, 0])])\n      ).toFailWith(/fragment dimension 3 does not match index dimension 2/i);\n      expect(index.recordCount).toBe(0);\n      expect(index.fragmentCount).toBe(0);\n      // The dimension was never committed: a fresh dim-3 record indexes cleanly.\n      expect(await index.addFragments(target('knowledge', 'doc-2'), [frag(0, 5, [1, 0, 0])])).toSucceedWith(\n        1\n      );\n      expect(await index.query(Float32Array.from([1, 0, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].target.id).toBe('doc-2');\n          expect(hits[0].score).toBeCloseTo(1);\n        }\n      );\n    });\n\n    test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const buffer = Float32Array.from([1, 0]);\n      (\n        await index.addFragments(target('knowledge', 'doc-1'), [{ locator: loc(0, 5), vector: buffer }])\n      ).orThrow();\n      buffer[0] = 0;\n      buffer[1] = 1;\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].score).toBeCloseTo(1);\n        }\n      );\n    });\n  });\n\n  describe('query', () => {\n    async function seeded(): Promise<InMemoryFragmentCosineIndex> {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (\n        await index.addFragments(target('knowledge', 'doc-a'), [frag(0, 5, [1, 0]), frag(5, 10, [0, 1])])\n      ).orThrow();\n      (await index.addFragments(target('knowledge', 'doc-b'), [frag(0, 5, [1, 1])])).orThrow();\n      return index;\n    }\n\n    test('returns fragment hits in descending cosine-similarity order, each carrying its locator', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          // doc-a[0,5] matches [1,0] best (score 1), then doc-b (1/sqrt2), then doc-a[5,10] (0).\n          expect(hits[0].target.id).toBe('doc-a');\n          expect(hits[0].locator).toEqual(loc(0, 5));\n          expect(hits[0].score).toBeCloseTo(1);\n          expect(hits[1].target.id).toBe('doc-b');\n          expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));\n          expect(hits[2].target.id).toBe('doc-a');\n          expect(hits[2].locator).toEqual(loc(5, 10));\n          expect(hits[2].score).toBeCloseTo(0);\n        }\n      );\n    });\n\n    test('truncates to topK', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(2);\n          expect(hits.map((h) => h.locator)).toEqual([loc(0, 5), loc(0, 5)]);\n          expect(hits[0].target.id).toBe('doc-a');\n          expect(hits[1].target.id).toBe('doc-b');\n        }\n      );\n    });\n\n    test('maxPerRecord caps fragments per record during selection (before the topK cut)', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      // doc-a has three fragments that all beat doc-b's single fragment.\n      (\n        await index.addFragments(target('knowledge', 'doc-a'), [\n          frag(0, 5, [1, 0]),\n          frag(5, 10, [0.9, 0.1]),\n          frag(10, 15, [0.8, 0.2])\n        ])\n      ).orThrow();\n      (await index.addFragments(target('knowledge', 'doc-b'), [frag(0, 5, [0.7, 0.3])])).orThrow();\n      // Without a cap, top-2 would be doc-a twice. With maxPerRecord=1, doc-b surfaces.\n      expect(await index.query(Float32Array.from([1, 0]), 2, 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(2);\n          expect(hits.map((h) => h.target.id)).toEqual(['doc-a', 'doc-b']);\n          expect(hits[0].locator).toEqual(loc(0, 5));\n        }\n      );\n    });\n\n    test('maxPerRecord=0 yields no hits', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 5, 0)).toSucceedWith([]);\n    });\n\n    test('maxPerRecord larger than any record leaves the ranking unchanged', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 5, 10)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(3);\n          expect(hits[0].target.id).toBe('doc-a');\n        }\n      );\n    });\n\n    test('returns empty for a non-positive topK', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);\n      expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);\n    });\n\n    test('returns empty when the index is empty (no dimension check)', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);\n    });\n\n    test('fails loudly on a query-dimension mismatch', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(\n        /query dimension 3 does not match index dimension 2/i\n      );\n    });\n\n    test('scores a degenerate (zero-magnitude) stored fragment as 0 rather than NaN', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (\n        await index.addFragments(target('knowledge', 'doc'), [frag(0, 5, [0, 0]), frag(5, 10, [1, 0])])\n      ).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.locator)).toEqual([loc(5, 10), loc(0, 5)]);\n          expect(hits[1].score).toBe(0);\n        }\n      );\n    });\n\n    test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'doc'), [frag(0, 5, [1, 0])])).orThrow();\n      expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].score).toBe(0);\n        }\n      );\n    });\n  });\n\n  describe('remove', () => {\n    test('removes every fragment of a record and is reflected in subsequent queries', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const a = target('knowledge', 'doc-a');\n      const b = target('knowledge', 'doc-b');\n      (await index.addFragments(a, [frag(0, 5, [1, 0]), frag(5, 10, [1, 0])])).orThrow();\n      (await index.addFragments(b, [frag(0, 5, [0, 1])])).orThrow();\n      expect(await index.remove(a)).toSucceedWith(a);\n      expect(index.recordCount).toBe(1);\n      expect(index.fragmentCount).toBe(1);\n      expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.target.id)).toEqual(['doc-b']);\n        }\n      );\n    });\n\n    test('removes only the scoped target — a same-stem record in another scope is left intact', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const a = target('conv-a', 'turn-3');\n      const b = target('conv-b', 'turn-3');\n      (await index.addFragments(a, [frag(0, 5, [1, 0])])).orThrow();\n      (await index.addFragments(b, [frag(0, 5, [0, 1])])).orThrow();\n      expect(await index.remove(a)).toSucceedWith(a);\n      expect(index.recordCount).toBe(1);\n      expect(await index.query(Float32Array.from([0, 1]), 5)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits).toHaveLength(1);\n          expect(hits[0].target).toEqual(b);\n        }\n      );\n    });\n\n    test('is idempotent — removing an absent target still succeeds', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const t = target('knowledge', 'missing');\n      expect(await index.remove(t)).toSucceedWith(t);\n    });\n  });\n\n  describe('rebuild', () => {\n    // Deterministic: each record yields two fragments encoding the id's first char code.\n    const embed = (r: IMemoryRecord<unknown>): Promise<Result<ReadonlyArray<IEmbeddedFragment>>> => {\n      const code: number = (r.envelope.id as string).charCodeAt(0);\n      return Promise.resolve(succeed([frag(0, 5, [code, 1]), frag(5, 10, [1, code])]));\n    };\n\n    test('re-embeds every scoped record and reports the total fragment count', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const source = new FakeSource(succeed([scoped('knowledge', 'a'), scoped('knowledge', 'b')]));\n      expect(await index.rebuild(source, embed)).toSucceedWith(4);\n      expect(index.recordCount).toBe(2);\n      expect(index.fragmentCount).toBe(4);\n    });\n\n    test('keeps same-stem records under different scopes distinct across a rebuild', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const source = new FakeSource(succeed([scoped('conv-a', 'turn-3'), scoped('conv-b', 'turn-3')]));\n      expect(await index.rebuild(source, embed)).toSucceedWith(4);\n      expect(index.recordCount).toBe(2);\n    });\n\n    test('clears prior contents and re-establishes the dimension', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'old'), [frag(0, 5, [1, 2, 3])])).orThrow();\n      const source = new FakeSource(succeed([scoped('knowledge', 'a')]));\n      expect(await index.rebuild(source, embed)).toSucceedWith(2);\n      expect(index.recordCount).toBe(1);\n      expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();\n    });\n\n    test('fails loudly when the source list fails and rolls back to empty', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'seed'), [frag(0, 5, [1, 1])])).orThrow();\n      const source = new FakeSource(fail('disk gone'));\n      expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);\n      expect(index.recordCount).toBe(0);\n    });\n\n    test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'seed'), [frag(0, 5, [1, 1])])).orThrow();\n      let calls: number = 0;\n      const flakyEmbed = (): Promise<Result<ReadonlyArray<IEmbeddedFragment>>> => {\n        calls += 1;\n        return Promise.resolve(calls === 1 ? succeed([frag(0, 5, [1, 1])]) : fail('no model'));\n      };\n      const source = new FakeSource(succeed([scoped('conv-a', 'turn-1'), scoped('conv-b', 'turn-1')]));\n      expect(await index.rebuild(source, flakyEmbed)).toFailWith(\n        /embedding 'conv-b\\0turn-1' failed: no model/i\n      );\n      expect(index.recordCount).toBe(0);\n    });\n\n    test('fails loudly and rolls back to empty when adding an embedded fragment fails', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const source = new FakeSource(succeed([scoped('knowledge', 'a')]));\n      const emptyEmbed = (): Promise<Result<ReadonlyArray<IEmbeddedFragment>>> =>\n        Promise.resolve(succeed([frag(0, 5, [])]));\n      expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty fragment vector/i);\n      expect(index.recordCount).toBe(0);\n    });\n  });\n\n  describe('fragment identity', () => {\n    /** A fragment identified only by an opaque id — no honest body span. */\n    function idFrag(fragmentId: string, vector: number[]): IEmbeddedFragment {\n      return { fragmentId, vector: Float32Array.from(vector) };\n    }\n\n    test('rejects a fragment carrying neither a locator nor a fragmentId', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      expect(\n        await index.addFragments(target('knowledge', 'doc-a'), [{ vector: Float32Array.from([1, 0]) }])\n      ).toFailWith(/at least one of 'locator' or 'fragmentId'/i);\n      expect(index.recordCount).toBe(0);\n    });\n\n    test('carries an opaque fragmentId through to the query hit verbatim', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      const opaque = 'urn:frag:9f8e::{not-parsed}';\n      (await index.addFragments(target('knowledge', 'doc-a'), [idFrag(opaque, [1, 0])])).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].fragmentId).toBe(opaque);\n          expect(hits[0].locator).toBeUndefined();\n        }\n      );\n    });\n\n    test('carries both identities when a fragment supplies both', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (\n        await index.addFragments(target('knowledge', 'doc-a'), [\n          { ...frag(2, 8, [1, 0]), fragmentId: 'frag-1' }\n        ])\n      ).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].locator).toEqual(loc(2, 8));\n          expect(hits[0].fragmentId).toBe('frag-1');\n        }\n      );\n    });\n\n    test('a locator-only fragment produces a hit with no fragmentId key at all', async () => {\n      // Byte-identical to what the index produced before `fragmentId` existed: the key\n      // is absent, not present-and-undefined, so an existing caller's structural\n      // comparisons are unaffected by the addition.\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'doc-a'), [frag(0, 5, [1, 0])])).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(Object.keys(hits[0]).sort()).toEqual(['locator', 'score', 'target']);\n          expect(hits[0]).toStrictEqual({\n            target: target('knowledge', 'doc-a'),\n            score: hits[0].score,\n            locator: loc(0, 5)\n          });\n        }\n      );\n    });\n\n    test('an id-only fragment produces a hit with no locator key at all', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (await index.addFragments(target('knowledge', 'doc-a'), [idFrag('frag-1', [1, 0])])).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(Object.keys(hits[0]).sort()).toEqual(['fragmentId', 'score', 'target']);\n        }\n      );\n    });\n\n    test('mixes identity shapes within one record and within one query', async () => {\n      const index = InMemoryFragmentCosineIndex.create().orThrow();\n      (\n        await index.addFragments(target('knowledge', 'doc-a'), [\n          frag(0, 5, [1, 0]),\n          idFrag('frag-rewritten', [0, 1])\n        ])\n      ).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].locator).toEqual(loc(0, 5));\n          expect(hits[0].fragmentId).toBeUndefined();\n          expect(hits[1].fragmentId).toBe('frag-rewritten');\n          expect(hits[1].locator).toBeUndefined();\n        }\n      );\n    });\n  });\n});\n"]}

package/dist/test/unit/vector/vectorIndex.test.js

@@ -1,51 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-import '@fgv/ts-utils-jest';
-import { succeed } from '@fgv/ts-utils';
-import { edgeTargetKey } from '../../../index';
-function target(scope, id) {
-    return { scope: scope, id: id };
-}
-/**
- * A trivial conforming implementation, present to verify the {@link IVectorIndex}
- * seam is usable end-to-end with scope-qualified targets.
- */
-class StubVectorIndex {
-    constructor() {
-        this._vectors = new Map();
-    }
-    add(t, vector) {
-        const key = edgeTargetKey(t);
-        this._vectors.set(key, t);
-        return Promise.resolve(succeed(`ref-${key}`));
-    }
-    remove(t) {
-        this._vectors.delete(edgeTargetKey(t));
-        return Promise.resolve(succeed(t));
-    }
-    query(vector, topK) {
-        const hits = Array.from(this._vectors.values())
-            .map((t) => ({ target: t, score: vector.length }))
-            .slice(0, topK);
-        return Promise.resolve(succeed(hits));
-    }
-}
-describe('IVectorIndex seam', () => {
-    test('a conforming implementation supports add / query / remove on scoped targets', async () => {
-        const index = new StubVectorIndex();
-        const a = target('conv-a', 'turn-3');
-        const b = target('conv-b', 'turn-3');
-        expect(await index.add(a, Float32Array.from([1, 2, 3]))).toSucceedWith(`ref-${edgeTargetKey(a)}`);
-        expect(await index.add(b, Float32Array.from([4, 5, 6]))).toSucceedWith(`ref-${edgeTargetKey(b)}`);
-        expect(await index.query(Float32Array.from([0.1, 0.2]), 2)).toSucceedAndSatisfy((hits) => {
-            // Both same-stem-different-scope targets are distinct entries.
-            expect(hits).toHaveLength(2);
-            expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));
-            expect(hits[0].score).toBe(2);
-        });
-        expect(await index.remove(a)).toSucceedWith(a);
-    });
-});
-//# sourceMappingURL=vectorIndex.test.js.map

package/dist/test/unit/vector/vectorIndex.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"vectorIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/vectorIndex.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAAU,OAAO,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAML,aAAa,EACd,MAAM,gBAAgB,CAAC;AAExB,SAAS,MAAM,CAAC,KAAa,EAAE,EAAU;IACvC,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED;;;GAGG;AACH,MAAM,eAAe;IAArB;QACmB,aAAQ,GAA6B,IAAI,GAAG,EAAE,CAAC;IAmBlE,CAAC;IAjBQ,GAAG,CAAC,CAAc,EAAE,MAAoB;QAC7C,MAAM,GAAG,GAAW,aAAa,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAEM,MAAM,CAAC,CAAc;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAEM,KAAK,CAAC,MAAoB,EAAE,IAAY;QAC7C,MAAM,IAAI,GAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aAC/D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;aACjD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;CACF;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,6EAA6E,EAAE,KAAK,IAAI,EAAE;QAC7F,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClG,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClG,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,IAAoC,EAAE,EAAE;YACvC,+DAA+D;YAC/D,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CACF,CAAC;QACF,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, succeed } from '@fgv/ts-utils';\nimport {\n  IEdgeTarget,\n  IVectorIndex,\n  IVectorQueryHit,\n  MemoryId,\n  MemoryScopeKey,\n  edgeTargetKey\n} from '../../../index';\n\nfunction target(scope: string, id: string): IEdgeTarget {\n  return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\n/**\n * A trivial conforming implementation, present to verify the {@link IVectorIndex}\n * seam is usable end-to-end with scope-qualified targets.\n */\nclass StubVectorIndex implements IVectorIndex {\n  private readonly _vectors: Map<string, IEdgeTarget> = new Map();\n\n  public add(t: IEdgeTarget, vector: Float32Array): Promise<Result<string>> {\n    const key: string = edgeTargetKey(t);\n    this._vectors.set(key, t);\n    return Promise.resolve(succeed(`ref-${key}`));\n  }\n\n  public remove(t: IEdgeTarget): Promise<Result<IEdgeTarget>> {\n    this._vectors.delete(edgeTargetKey(t));\n    return Promise.resolve(succeed(t));\n  }\n\n  public query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n    const hits: IVectorQueryHit[] = Array.from(this._vectors.values())\n      .map((t) => ({ target: t, score: vector.length }))\n      .slice(0, topK);\n    return Promise.resolve(succeed(hits));\n  }\n}\n\ndescribe('IVectorIndex seam', () => {\n  test('a conforming implementation supports add / query / remove on scoped targets', async () => {\n    const index = new StubVectorIndex();\n    const a = target('conv-a', 'turn-3');\n    const b = target('conv-b', 'turn-3');\n    expect(await index.add(a, Float32Array.from([1, 2, 3]))).toSucceedWith(`ref-${edgeTargetKey(a)}`);\n    expect(await index.add(b, Float32Array.from([4, 5, 6]))).toSucceedWith(`ref-${edgeTargetKey(b)}`);\n    expect(await index.query(Float32Array.from([0.1, 0.2]), 2)).toSucceedAndSatisfy(\n      (hits: ReadonlyArray<IVectorQueryHit>) => {\n        // Both same-stem-different-scope targets are distinct entries.\n        expect(hits).toHaveLength(2);\n        expect(hits.map((h) => h.target)).toEqual(expect.arrayContaining([a, b]));\n        expect(hits[0].score).toBe(2);\n      }\n    );\n    expect(await index.remove(a)).toSucceedWith(a);\n  });\n});\n"]}

package/eslint.config.js

@@ -1,15 +0,0 @@
-// ESLint 9 flat config
-const nodeProfile = require('@rushstack/eslint-config/flat/profile/node');
-const packletsPlugin = require('@rushstack/eslint-config/flat/mixins/packlets');
-const tsdocPlugin = require('@rushstack/eslint-config/flat/mixins/tsdoc');
-
-module.exports = [
-  ...nodeProfile,
-  packletsPlugin,
-  ...tsdocPlugin,
-  {
-    rules: {
-      '@rushstack/packlets/mechanics': 'warn'
-    }
-  }
-];