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

package/lib/test/unit/store/indexInjection.test.js

@@ -1,434 +0,0 @@
-"use strict";
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-require("@fgv/ts-utils-jest");
-const ts_utils_1 = require("@fgv/ts-utils");
-const ts_json_base_1 = require("@fgv/ts-json-base");
-const index_1 = require("../../../index");
-const knowledgeKind = 'knowledge';
-const knowledgeScope = 'knowledge';
-function mutableRoot() {
-    const tree = ts_json_base_1.FileTree.inMemory([], { mutable: true }).orThrow();
-    const root = tree.getDirectory('/').orThrow();
-    if (!ts_json_base_1.FileTree.isMutableDirectoryItem(root)) {
-        throw new Error('expected a mutable root directory');
-    }
-    return root;
-}
-function knowledgeRecord(id, body, tags = []) {
-    return {
-        envelope: index_1.envelopeConverter
-            .convert({
-            id,
-            entityId: id,
-            kind: 'knowledge',
-            tags: [...tags],
-            links: [],
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: '',
-            provenance: { source: 'agent' }
-        })
-            .orThrow(),
-        body
-    };
-}
-function storeWith(index, root) {
-    const registry = index_1.BodyConverterRegistry.create().orThrow();
-    registry.register(knowledgeKind, ts_utils_1.Converters.string);
-    return index_1.FileTreeMemoryStore.create({
-        root: root !== null && root !== void 0 ? root : mutableRoot(),
-        registry,
-        codecs: new Map([[knowledgeKind, new index_1.KnowledgeIdentityCodec()]]),
-        index
-    }).orThrow();
-}
-/**
- * A counting/timing decorator over the shipped `MemoryIndex` — the exact shape
- * the injection seam exists to enable. Every call is delegated verbatim, so a
- * store wired with one behaves identically to a store using the default index;
- * the recorded counts are the measurement the consumer is after.
- */
-class RecordingMemoryIndex {
-    constructor(inner) {
-        this.rebuildSizes = [];
-        this.patchCalls = [];
-        this.entriesCalls = 0;
-        this._inner = inner;
-    }
-    static create() {
-        return index_1.MemoryIndex.create().onSuccess((inner) => (0, ts_utils_1.succeed)(new RecordingMemoryIndex(inner)));
-    }
-    rebuild(entries) {
-        this.rebuildSizes.push(entries.length);
-        return this._inner.rebuild(entries);
-    }
-    patch(op, entry) {
-        this.patchCalls.push({ op, scope: entry.scope, id: entry.record.envelope.id });
-        return this._inner.patch(op, entry);
-    }
-    entries() {
-        this.entriesCalls += 1;
-        return this._inner.entries();
-    }
-    byKind(kind) {
-        return this._inner.byKind(kind);
-    }
-    byTag(tag) {
-        return this._inner.byTag(tag);
-    }
-    byRecency() {
-        return this._inner.byRecency();
-    }
-    byRank() {
-        return this._inner.byRank();
-    }
-    backlinks(target) {
-        return this._inner.backlinks(target);
-    }
-}
-/**
- * An index that hides every record whose body contains `hidden` from the
- * `entries()` read surface. Not a realistic index — it exists to prove the store
- * reads from the INJECTED index rather than one it built for itself. A store
- * with a private index could not produce these results.
- */
-class HidingMemoryIndex {
-    constructor(inner) {
-        this._inner = inner;
-    }
-    static create() {
-        return index_1.MemoryIndex.create().onSuccess((inner) => (0, ts_utils_1.succeed)(new HidingMemoryIndex(inner)));
-    }
-    rebuild(entries) {
-        return this._inner.rebuild(entries);
-    }
-    patch(op, entry) {
-        return this._inner.patch(op, entry);
-    }
-    entries() {
-        return this._inner.entries().filter((e) => !String(e.record.body).includes('hidden'));
-    }
-    byKind(kind) {
-        return this._inner.byKind(kind);
-    }
-    byTag(tag) {
-        return this._inner.byTag(tag);
-    }
-    byRecency() {
-        return this._inner.byRecency();
-    }
-    byRank() {
-        return this._inner.byRank();
-    }
-    backlinks(target) {
-        return this._inner.backlinks(target);
-    }
-}
-// ---------------------------------------------------------------------------
-// Temporal (versioned) and cap-cull fixtures.
-//
-// The `index` param's TSDoc claims that an injected index decides which version a
-// versioned `put` supersedes, which versions a `delete` tombstones, and what a
-// cap-cull policy evicts — because all three derive their working set from
-// `entries()` rather than from the FileTree. These fixtures exist so those claims
-// are evidenced by test rather than only reasoned about from the implementation.
-// ---------------------------------------------------------------------------
-const factKind = 'fact';
-const factScope = 'facts/entities/fact-1';
-const mtmKind = 'mtm';
-let clockValue = 1000;
-const clock = () => clockValue;
-function factRecord(body) {
-    return {
-        envelope: index_1.envelopeConverter
-            .convert({
-            id: 'fact-1',
-            entityId: 'fact-1',
-            kind: 'fact',
-            tags: [],
-            links: [],
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: '',
-            provenance: { source: 'agent' }
-        })
-            .orThrow(),
-        body
-    };
-}
-function versionedStore(index) {
-    const registry = index_1.BodyConverterRegistry.create().orThrow();
-    registry.register(factKind, ts_utils_1.Converters.string);
-    return index_1.FileTreeMemoryStore.create({
-        root: mutableRoot(),
-        registry,
-        codecs: new Map([[factKind, index_1.TemporalIdentityCodec.create('facts').orThrow()]]),
-        writePolicies: new Map([[factKind, index_1.TemporalVersionedPolicy.create().orThrow()]]),
-        clock,
-        index
-    }).orThrow();
-}
-function turnRecord(turn, body) {
-    return {
-        envelope: index_1.envelopeConverter
-            .convert({
-            id: `turn-${turn}`,
-            entityId: `conv-1:${turn}`,
-            kind: 'mtm',
-            tags: [],
-            links: [],
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: '',
-            provenance: { source: 'agent' }
-        })
-            .orThrow(),
-        body
-    };
-}
-function cappedStore(index, maxRecords = 2) {
-    const registry = index_1.BodyConverterRegistry.create().orThrow();
-    registry.register(mtmKind, ts_utils_1.Converters.string);
-    return index_1.FileTreeMemoryStore.create({
-        root: mutableRoot(),
-        registry,
-        codecs: new Map([[mtmKind, new index_1.MtmIdentityCodec()]]),
-        writePolicies: new Map([
-            [
-                mtmKind,
-                index_1.MemoryCapCullPolicy.create({
-                    maxRecords,
-                    mutableFields: ['body', 'tags', 'links', 'provenance']
-                }).orThrow()
-            ]
-        ]),
-        clock,
-        index
-    }).orThrow();
-}
-describe('FileTreeMemoryStore index injection', () => {
-    describe('default (index omitted)', () => {
-        test('creates and serves reads from a default MemoryIndex', async () => {
-            const store = storeWith();
-            (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            (await store.put(knowledgeRecord('doc-b', 'beta'))).orThrow();
-            expect(await store.list()).toSucceedAndSatisfy((records) => {
-                expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);
-            });
-            expect(await store.get(knowledgeKind, 'doc-a')).toSucceedAndSatisfy((record) => {
-                expect(record === null || record === void 0 ? void 0 : record.body).toBe('alpha');
-            });
-            expect(await store.listScoped()).toSucceedAndSatisfy((scoped) => {
-                expect(scoped).toHaveLength(2);
-            });
-        });
-        test('reopening an existing vault re-indexes it and resumes seq', async () => {
-            const root = mutableRoot();
-            const first = storeWith(undefined, root);
-            (await first.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            const reopened = storeWith(undefined, root);
-            expect(await reopened.list()).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-                expect(records[0].envelope.id).toBe('doc-a');
-            });
-            // seq resumes past the persisted high-water mark rather than restarting at 1.
-            expect(await reopened.put(knowledgeRecord('doc-b', 'beta'))).toSucceedAndSatisfy((record) => {
-                expect(record.envelope.seq).toBe(2);
-            });
-        });
-    });
-    describe('absent index', () => {
-        test('a null index is treated as absent, matching every sibling optional param', async () => {
-            // `create()`'s other optional params all absorb absence with `??`, which takes
-            // null and undefined alike. A JS caller (or a TS caller through an `unknown`
-            // hatch) passing `null` here must get the default index too — installing
-            // `null` would instead fail later inside `entries()`, naming neither the param
-            // nor the cause.
-            const store = storeWith(null);
-            (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            expect(await store.list()).toSucceedAndSatisfy((records) => {
-                expect(records.map((r) => r.envelope.id)).toEqual(['doc-a']);
-            });
-        });
-    });
-    describe('injected index', () => {
-        test('receives the create() rebuild of an existing vault', async () => {
-            const root = mutableRoot();
-            const seeded = storeWith(undefined, root);
-            (await seeded.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            (await seeded.put(knowledgeRecord('doc-b', 'beta'))).orThrow();
-            const recording = RecordingMemoryIndex.create().orThrow();
-            const reopened = storeWith(recording, root);
-            // create() rebuilt the injected index exactly once, with both persisted records.
-            expect(recording.rebuildSizes).toEqual([2]);
-            expect(recording.patchCalls).toEqual([]);
-            expect(await reopened.list()).toSucceedAndSatisfy((records) => {
-                expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);
-            });
-        });
-        test('receives a put patch and a delete patch', async () => {
-            const recording = RecordingMemoryIndex.create().orThrow();
-            const store = storeWith(recording);
-            // The empty-vault open still rebuilds (with zero entries) and patches nothing.
-            expect(recording.rebuildSizes).toEqual([0]);
-            expect(recording.patchCalls).toEqual([]);
-            (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            expect(recording.patchCalls).toEqual([{ op: 'put', scope: knowledgeScope, id: 'doc-a' }]);
-            // A content revision of the same id is another 'put' patch, not a second entry.
-            (await store.put(knowledgeRecord('doc-a', 'alpha revised'))).orThrow();
-            expect(recording.patchCalls).toHaveLength(2);
-            expect(recording.patchCalls[1]).toEqual({ op: 'put', scope: knowledgeScope, id: 'doc-a' });
-            expect(await store.delete(knowledgeKind, 'doc-a')).toSucceedWith('doc-a');
-            expect(recording.patchCalls[2]).toEqual({ op: 'delete', scope: knowledgeScope, id: 'doc-a' });
-        });
-        test('serves the store read surface — no second index is built', async () => {
-            const recording = RecordingMemoryIndex.create().orThrow();
-            const store = storeWith(recording);
-            (await store.put(knowledgeRecord('doc-a', 'alpha', ['topic']))).orThrow();
-            const before = recording.entriesCalls;
-            expect(await store.list()).toSucceed();
-            expect(await store.listScoped()).toSucceed();
-            expect(recording.entriesCalls).toBeGreaterThan(before);
-            // The injected index really holds the store's records: its projection views
-            // (never touched by the store itself) answer from the patched state.
-            expect(recording.byKind(knowledgeKind).map((r) => r.envelope.id)).toEqual(['doc-a']);
-            expect(recording.byTag('topic').map((r) => r.envelope.id)).toEqual(['doc-a']);
-            expect(recording.byRecency().map((r) => r.envelope.id)).toEqual(['doc-a']);
-            expect(recording.byRank().map((r) => r.envelope.id)).toEqual(['doc-a']);
-            expect(recording.backlinks({ scope: knowledgeScope, id: 'doc-a' })).toEqual([]);
-        });
-        test('shares one index with a retriever built over the same instance', async () => {
-            const recording = RecordingMemoryIndex.create().orThrow();
-            const store = storeWith(recording);
-            (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            (await store.put(knowledgeRecord('doc-b', 'beta'))).orThrow();
-            // The consumer's real pattern: the store maintains the index, retrievers read it.
-            const retriever = index_1.RecencyRetriever.create(recording).orThrow();
-            expect(await retriever.retrieve({ kind: knowledgeKind })).toSucceedAndSatisfy((records) => {
-                expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);
-            });
-        });
-        test('the injected index — not a private one — determines what the store returns', async () => {
-            const hiding = HidingMemoryIndex.create().orThrow();
-            const store = storeWith(hiding);
-            (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();
-            (await store.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();
-            // Both records persisted, but the injected index hides one from `entries()`,
-            // and every store read that goes through the index reflects exactly that.
-            expect(await store.list()).toSucceedAndSatisfy((records) => {
-                expect(records.map((r) => r.envelope.id)).toEqual(['doc-a']);
-            });
-            expect(await store.listScoped()).toSucceedAndSatisfy((scoped) => {
-                expect(scoped.map((s) => s.target.id)).toEqual(['doc-a']);
-            });
-            // The file is still on disk — `getById` reads through to the FileTree, which
-            // remains the source of truth regardless of what the derived index projects.
-            expect(await store.getById(knowledgeScope, 'doc-b')).toSucceedAndSatisfy((record) => {
-                expect(record === null || record === void 0 ? void 0 : record.body).toBe('hidden beta');
-            });
-        });
-        test('an index that reshapes entries() changes write semantics, not just reads', async () => {
-            // The store's content-hash dedup and write-policy admission cohort both read
-            // the index's `entries()`, so an index that hides a record hides it from dedup
-            // too. This is the documented caveat on the `index` param — the reason to
-            // inject only a faithful delegating decorator.
-            const control = storeWith();
-            (await control.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();
-            // Default index: an identical body under a NEW id collapses onto the existing
-            // record (knowledge declares `dedupScope: 'content'`).
-            expect(await control.put(knowledgeRecord('doc-c', 'hidden beta'))).toSucceedAndSatisfy((record) => {
-                expect(record.envelope.id).toBe('doc-b');
-            });
-            const hiding = storeWith(HidingMemoryIndex.create().orThrow());
-            (await hiding.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();
-            // Hiding index: doc-b is invisible to `entries()`, so the content-hash lookup
-            // finds no duplicate and doc-c is written as a distinct record.
-            expect(await hiding.put(knowledgeRecord('doc-c', 'hidden beta'))).toSucceedAndSatisfy((record) => {
-                expect(record.envelope.id).toBe('doc-c');
-            });
-        });
-    });
-    describe('injected index — temporal and cap-cull write paths', () => {
-        beforeEach(() => {
-            clockValue = 1000;
-        });
-        test('the injected index decides which version a versioned put supersedes and a delete tombstones', async () => {
-            // Both the versioned put and the versioned delete resolve an entity's version
-            // history through `_versionsForEntity`, which is a scope filter over the
-            // index's `entries()`. A version the injected index hides is therefore
-            // invisible to both — it stays on disk, but the store will not supersede,
-            // invalidate, or tombstone it. That is the documented caveat, and the reason
-            // only a faithful delegating decorator is safe to inject.
-            const control = versionedStore();
-            (await control.put(factRecord('hidden blue'))).orThrow();
-            clockValue = 2000;
-            (await control.put(factRecord('grey'))).orThrow();
-            // Default index: v1 is visible, so the second put closes its world-truth
-            // interval at the new version's `valid_at`.
-            expect(await control.getById(factScope, 'fact-1-v1')).toSucceedAndSatisfy((v1) => {
-                var _a;
-                expect((_a = v1 === null || v1 === void 0 ? void 0 : v1.envelope.temporal) === null || _a === void 0 ? void 0 : _a.invalid_at).toBe(2000);
-            });
-            const hiding = versionedStore(HidingMemoryIndex.create().orThrow());
-            clockValue = 1000;
-            (await hiding.put(factRecord('hidden blue'))).orThrow();
-            clockValue = 2000;
-            (await hiding.put(factRecord('grey'))).orThrow();
-            // Hiding index: v1 is invisible to the version walk, so the second put sees no
-            // current version, is built as a FIRST version, and invalidates nothing. v1 is
-            // still on disk and still carries no `invalid_at` — two live currents.
-            expect(await hiding.getById(factScope, 'fact-1-v1')).toSucceedAndSatisfy((v1) => {
-                var _a;
-                expect(v1 === null || v1 === void 0 ? void 0 : v1.body).toBe('hidden blue');
-                expect((_a = v1 === null || v1 === void 0 ? void 0 : v1.envelope.temporal) === null || _a === void 0 ? void 0 : _a.invalid_at).toBeUndefined();
-            });
-            // The delete half of the same claim: a soft delete tombstones every version the
-            // index shows as current, so the hidden v1 survives it untouched.
-            clockValue = 3000;
-            expect(await hiding.delete(factKind, 'fact-1')).toSucceed();
-            expect(await hiding.getById(factScope, 'fact-1-v2')).toSucceedAndSatisfy((v2) => {
-                var _a;
-                expect((_a = v2 === null || v2 === void 0 ? void 0 : v2.envelope.temporal) === null || _a === void 0 ? void 0 : _a.invalid_at).toBe(3000);
-            });
-            expect(await hiding.getById(factScope, 'fact-1-v1')).toSucceedAndSatisfy((v1) => {
-                var _a;
-                expect((_a = v1 === null || v1 === void 0 ? void 0 : v1.envelope.temporal) === null || _a === void 0 ? void 0 : _a.invalid_at).toBeUndefined();
-            });
-        });
-        test('cap-cull patches the injected index, and a reshaped cohort changes what is evicted', async () => {
-            // `maxRecords: 2` over the shared conversations/conv-1 MTM scope. The third
-            // write's admission cohort is the two prior records, so it culls the oldest.
-            const recording = RecordingMemoryIndex.create().orThrow();
-            const recorded = cappedStore(recording);
-            for (let turn = 0; turn < 3; turn++) {
-                clockValue = 1000 + turn; // distinct `created`, so "oldest" is unambiguous
-                (await recorded.put(turnRecord(turn, turn === 0 ? 'hidden zero' : `turn ${turn}`))).orThrow();
-            }
-            // The eviction reaches the INJECTED index as a `delete` patch — the store keeps
-            // no private index it could have patched instead.
-            expect(recording.patchCalls.filter((c) => c.op === 'delete')).toEqual([
-                { op: 'delete', scope: 'conversations/conv-1', id: 'turn-0' }
-            ]);
-            expect(await recorded.get(mtmKind, 'conv-1:0')).toSucceedWith(undefined);
-            // Same writes, but an index that hides turn-0 shrinks the admission cohort to
-            // one, which is under the cap — so nothing is evicted and turn-0 survives.
-            // The cohort the policy sees is the index's projection, not the vault's.
-            const hidden = cappedStore(HidingMemoryIndex.create().orThrow());
-            for (let turn = 0; turn < 3; turn++) {
-                clockValue = 1000 + turn;
-                (await hidden.put(turnRecord(turn, turn === 0 ? 'hidden zero' : `turn ${turn}`))).orThrow();
-            }
-            expect(await hidden.get(mtmKind, 'conv-1:0')).toSucceedAndSatisfy((record) => {
-                expect(record === null || record === void 0 ? void 0 : record.body).toBe('hidden zero');
-            });
-        });
-    });
-});
-//# sourceMappingURL=indexInjection.test.js.map

package/lib/test/unit/store/indexInjection.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"indexInjection.test.js","sourceRoot":"","sources":["../../../../src/test/unit/store/indexInjection.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAA4D;AAC5D,oDAA6C;AAC7C,0CAwBwB;AAExB,MAAM,aAAa,GAAS,WAAmB,CAAC;AAChD,MAAM,cAAc,GAAmB,WAA6B,CAAC;AAErE,SAAS,WAAW;IAClB,MAAM,IAAI,GAAG,uBAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,IAAI,CAAC,uBAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,EAAU,EAAE,IAAY,EAAE,OAA8B,EAAE;IACjF,OAAO;QACL,QAAQ,EAAE,yBAAiB;aACxB,OAAO,CAAC;YACP,EAAE;YACF,QAAQ,EAAE,EAAE;YACZ,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;YACf,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,GAAG,EAAE,CAAC;YACN,WAAW,EAAE,EAAE;YACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC,CAAC;aACD,OAAO,EAAE;QACZ,IAAI;KACL,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,KAAoB,EAAE,IAA6C;IACpF,MAAM,QAAQ,GAA2B,6BAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAClF,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;IACpD,OAAO,2BAAmB,CAAC,MAAM,CAAC;QAChC,IAAI,EAAE,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAI,WAAW,EAAE;QAC3B,QAAQ;QACR,MAAM,EAAE,IAAI,GAAG,CAAuB,CAAC,CAAC,aAAa,EAAE,IAAI,8BAAsB,EAAE,CAAC,CAAC,CAAC;QACtF,KAAK;KACN,CAAC,CAAC,OAAO,EAAE,CAAC;AACf,CAAC;AASD;;;;;GAKG;AACH,MAAM,oBAAoB;IAOxB,YAAoB,KAAmB;QANvB,iBAAY,GAAa,EAAE,CAAC;QAC5B,eAAU,GAAiB,EAAE,CAAC;QACvC,iBAAY,GAAW,CAAC,CAAC;QAK9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAEM,MAAM,CAAC,MAAM;QAClB,OAAO,mBAAW,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7F,CAAC;IAEM,OAAO,CAAC,OAA4C;QACzD,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,EAAsB,EAAE,KAA2B;QAC9D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/E,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAEM,OAAO;QACZ,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAEM,MAAM,CAAC,IAAU;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAEM,KAAK,CAAC,GAAQ;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAEM,SAAS;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAEM,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;IAC9B,CAAC;IAEM,SAAS,CAAC,MAAmB;QAClC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,iBAAiB;IAGrB,YAAoB,KAAmB;QACrC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAEM,MAAM,CAAC,MAAM;QAClB,OAAO,mBAAW,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1F,CAAC;IAEM,OAAO,CAAC,OAA4C;QACzD,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,EAAsB,EAAE,KAA2B;QAC9D,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IACxF,CAAC;IAEM,MAAM,CAAC,IAAU;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAEM,KAAK,CAAC,GAAQ;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAEM,SAAS;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IACjC,CAAC;IAEM,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;IAC9B,CAAC;IAEM,SAAS,CAAC,MAAmB;QAClC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;CACF;AAED,8EAA8E;AAC9E,8CAA8C;AAC9C,EAAE;AACF,kFAAkF;AAClF,+EAA+E;AAC/E,2EAA2E;AAC3E,kFAAkF;AAClF,iFAAiF;AACjF,8EAA8E;AAE9E,MAAM,QAAQ,GAAS,MAAc,CAAC;AACtC,MAAM,SAAS,GAAmB,uBAAyC,CAAC;AAC5E,MAAM,OAAO,GAAS,KAAa,CAAC;AAEpC,IAAI,UAAU,GAAW,IAAI,CAAC;AAC9B,MAAM,KAAK,GAAG,GAAW,EAAE,CAAC,UAAU,CAAC;AAEvC,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO;QACL,QAAQ,EAAE,yBAAiB;aACxB,OAAO,CAAC;YACP,EAAE,EAAE,QAAQ;YACZ,QAAQ,EAAE,QAAQ;YAClB,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,GAAG,EAAE,CAAC;YACN,WAAW,EAAE,EAAE;YACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC,CAAC;aACD,OAAO,EAAE;QACZ,IAAI;KACL,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,KAAoB;IAC1C,MAAM,QAAQ,GAA2B,6BAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAClF,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;IAC/C,OAAO,2BAAmB,CAAC,MAAM,CAAC;QAChC,IAAI,EAAE,WAAW,EAAE;QACnB,QAAQ;QACR,MAAM,EAAE,IAAI,GAAG,CAAuB,CAAC,CAAC,QAAQ,EAAE,6BAAqB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpG,aAAa,EAAE,IAAI,GAAG,CAAqB,CAAC,CAAC,QAAQ,EAAE,+BAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACpG,KAAK;QACL,KAAK;KACN,CAAC,CAAC,OAAO,EAAE,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,IAAY,EAAE,IAAY;IAC5C,OAAO;QACL,QAAQ,EAAE,yBAAiB;aACxB,OAAO,CAAC;YACP,EAAE,EAAE,QAAQ,IAAI,EAAE;YAClB,QAAQ,EAAE,UAAU,IAAI,EAAE;YAC1B,IAAI,EAAE,KAAK;YACX,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,GAAG,EAAE,CAAC;YACN,WAAW,EAAE,EAAE;YACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC,CAAC;aACD,OAAO,EAAE;QACZ,IAAI;KACL,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,KAAoB,EAAE,aAAqB,CAAC;IAC/D,MAAM,QAAQ,GAA2B,6BAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAClF,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;IAC9C,OAAO,2BAAmB,CAAC,MAAM,CAAC;QAChC,IAAI,EAAE,WAAW,EAAE;QACnB,QAAQ;QACR,MAAM,EAAE,IAAI,GAAG,CAAuB,CAAC,CAAC,OAAO,EAAE,IAAI,wBAAgB,EAAE,CAAC,CAAC,CAAC;QAC1E,aAAa,EAAE,IAAI,GAAG,CAAqB;YACzC;gBACE,OAAO;gBACP,2BAAmB,CAAC,MAAM,CAAC;oBACzB,UAAU;oBACV,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,CAAC;iBACvD,CAAC,CAAC,OAAO,EAAE;aACb;SACF,CAAC;QACF,KAAK;QACL,KAAK;KACN,CAAC,CAAC,OAAO,EAAE,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACvC,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;YACrE,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;YAC1B,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE9D,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBAChG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;YAC/E,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,aAAa,EAAE,OAAmB,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,MAA0C,EAAE,EAAE;gBAC7C,MAAM,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrC,CAAC,CACF,CAAC;YACF,MAAM,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;gBAC9D,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;YAC3E,MAAM,IAAI,GAAG,WAAW,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACzC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE/D,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBACnG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YACH,8EAA8E;YAC9E,MAAM,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC9E,CAAC,MAA8B,EAAE,EAAE;gBACjC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,+EAA+E;YAC/E,6EAA6E;YAC7E,yEAAyE;YACzE,+EAA+E;YAC/E,iBAAiB;YACjB,MAAM,KAAK,GAAG,SAAS,CAAC,IAA+B,CAAC,CAAC;YACzD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE/D,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBAChG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,IAAI,GAAG,WAAW,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAC1C,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChE,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE/D,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAE5C,iFAAiF;YACjF,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBACnG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;YAC/E,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YAEnC,+EAA+E;YAC/E,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAEzC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAE1F,gFAAgF;YAChF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;YAE3F,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,OAAmB,CAAC,CAAC,CAAC,aAAa,CAAC,OAAmB,CAAC,CAAC;YAClG,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAChG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YAC1E,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACnC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE1E,MAAM,MAAM,GAAW,SAAS,CAAC,YAAY,CAAC;YAC9C,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7C,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAEvD,4EAA4E;YAC5E,qEAAqE;YACrE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACrF,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,OAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACrF,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACxE,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,cAAc,EAAE,EAAE,EAAE,OAAmB,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;YAChF,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACnC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAE9D,kFAAkF;YAClF,MAAM,SAAS,GAAG,wBAAgB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC3E,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;YAC/E,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4EAA4E,EAAE,KAAK,IAAI,EAAE;YAC5F,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YAChC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAErE,6EAA6E;YAC7E,0EAA0E;YAC1E,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBAChG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,EAAE,EAAE;gBAC9D,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC,CAAC;YACH,6EAA6E;YAC7E,6EAA6E;YAC7E,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,cAAc,EAAE,OAAmB,CAAC,CAAC,CAAC,mBAAmB,CAClF,CAAC,MAA0C,EAAE,EAAE;gBAC7C,MAAM,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,6EAA6E;YAC7E,+EAA+E;YAC/E,0EAA0E;YAC1E,+CAA+C;YAC/C,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC;YAC5B,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,8EAA8E;YAC9E,uDAAuD;YACvD,MAAM,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACpF,CAAC,MAA8B,EAAE,EAAE;gBACjC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;YAEF,MAAM,MAAM,GAAG,SAAS,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAC/D,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACtE,8EAA8E;YAC9E,gEAAgE;YAChE,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACnF,CAAC,MAA8B,EAAE,EAAE;gBACjC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAClE,UAAU,CAAC,GAAG,EAAE;YACd,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6FAA6F,EAAE,KAAK,IAAI,EAAE;YAC7G,8EAA8E;YAC9E,yEAAyE;YACzE,uEAAuE;YACvE,0EAA0E;YAC1E,6EAA6E;YAC7E,0DAA0D;YAC1D,MAAM,OAAO,GAAG,cAAc,EAAE,CAAC;YACjC,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzD,UAAU,GAAG,IAAI,CAAC;YAClB,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAElD,yEAAyE;YACzE,4CAA4C;YAC5C,MAAM,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,WAAuB,CAAC,CAAC,CAAC,mBAAmB,CACnF,CAAC,EAAsC,EAAE,EAAE;;gBACzC,MAAM,CAAC,MAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,0CAAE,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,CAAC,CACF,CAAC;YAEF,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YACpE,UAAU,GAAG,IAAI,CAAC;YAClB,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxD,UAAU,GAAG,IAAI,CAAC;YAClB,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAEjD,+EAA+E;YAC/E,+EAA+E;YAC/E,uEAAuE;YACvE,MAAM,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,WAAuB,CAAC,CAAC,CAAC,mBAAmB,CAClF,CAAC,EAAsC,EAAE,EAAE;;gBACzC,MAAM,CAAC,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACrC,MAAM,CAAC,MAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,0CAAE,UAAU,CAAC,CAAC,aAAa,EAAE,CAAC;YAC5D,CAAC,CACF,CAAC;YAEF,gFAAgF;YAChF,kEAAkE;YAClE,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM,CAAC,MAAM,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAoB,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YACxE,MAAM,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,WAAuB,CAAC,CAAC,CAAC,mBAAmB,CAClF,CAAC,EAAsC,EAAE,EAAE;;gBACzC,MAAM,CAAC,MAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,0CAAE,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,CAAC,CACF,CAAC;YACF,MAAM,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,WAAuB,CAAC,CAAC,CAAC,mBAAmB,CAClF,CAAC,EAAsC,EAAE,EAAE;;gBACzC,MAAM,CAAC,MAAA,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,0CAAE,UAAU,CAAC,CAAC,aAAa,EAAE,CAAC;YAC5D,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oFAAoF,EAAE,KAAK,IAAI,EAAE;YACpG,4EAA4E;YAC5E,6EAA6E;YAC7E,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1D,MAAM,QAAQ,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;YACxC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACpC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,iDAAiD;gBAC3E,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChG,CAAC;YAED,gFAAgF;YAChF,kDAAkD;YAClD,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;gBACpE,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,EAAE,QAAQ,EAAE;aAC9D,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,UAAsB,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAErF,8EAA8E;YAC9E,2EAA2E;YAC3E,yEAAyE;YACzE,MAAM,MAAM,GAAG,WAAW,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YACjE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBACpC,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC;gBACzB,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9F,CAAC;YAED,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,UAAsB,CAAC,CAAC,CAAC,mBAAmB,CAC3E,CAAC,MAA0C,EAAE,EAAE;gBAC7C,MAAM,CAAC,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC3C,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 { Converters, Result, succeed } from '@fgv/ts-utils';\nimport { FileTree } from '@fgv/ts-json-base';\nimport {\n  BodyConverterRegistry,\n  EntityId,\n  FileTreeMemoryStore,\n  IBodyConverterRegistry,\n  IEdgeTarget,\n  IIdentityCodec,\n  IIndexedMemoryRecord,\n  IMemoryIndex,\n  IMemoryRecord,\n  IWritePolicy,\n  Kind,\n  KnowledgeIdentityCodec,\n  MemoryCapCullPolicy,\n  MemoryId,\n  MemoryIndex,\n  MemoryIndexPatchOp,\n  MemoryScopeKey,\n  MtmIdentityCodec,\n  RecencyRetriever,\n  Tag,\n  TemporalIdentityCodec,\n  TemporalVersionedPolicy,\n  envelopeConverter\n} from '../../../index';\n\nconst knowledgeKind: Kind = 'knowledge' as Kind;\nconst knowledgeScope: MemoryScopeKey = 'knowledge' as MemoryScopeKey;\n\nfunction mutableRoot(): FileTree.IMutableFileTreeDirectoryItem {\n  const tree = FileTree.inMemory([], { mutable: true }).orThrow();\n  const root = tree.getDirectory('/').orThrow();\n  if (!FileTree.isMutableDirectoryItem(root)) {\n    throw new Error('expected a mutable root directory');\n  }\n  return root;\n}\n\nfunction knowledgeRecord(id: string, body: string, tags: ReadonlyArray<string> = []): IMemoryRecord<unknown> {\n  return {\n    envelope: envelopeConverter\n      .convert({\n        id,\n        entityId: id,\n        kind: 'knowledge',\n        tags: [...tags],\n        links: [],\n        created: 0,\n        updated: 0,\n        seq: 0,\n        contentHash: '',\n        provenance: { source: 'agent' }\n      })\n      .orThrow(),\n    body\n  };\n}\n\nfunction storeWith(index?: IMemoryIndex, root?: FileTree.IMutableFileTreeDirectoryItem): FileTreeMemoryStore {\n  const registry: IBodyConverterRegistry = BodyConverterRegistry.create().orThrow();\n  registry.register(knowledgeKind, Converters.string);\n  return FileTreeMemoryStore.create({\n    root: root ?? mutableRoot(),\n    registry,\n    codecs: new Map<Kind, IIdentityCodec>([[knowledgeKind, new KnowledgeIdentityCodec()]]),\n    index\n  }).orThrow();\n}\n\n/** One recorded {@link IMemoryIndex.patch} call. */\ninterface IPatchCall {\n  readonly op: MemoryIndexPatchOp;\n  readonly scope: MemoryScopeKey;\n  readonly id: string;\n}\n\n/**\n * A counting/timing decorator over the shipped `MemoryIndex` — the exact shape\n * the injection seam exists to enable. Every call is delegated verbatim, so a\n * store wired with one behaves identically to a store using the default index;\n * the recorded counts are the measurement the consumer is after.\n */\nclass RecordingMemoryIndex implements IMemoryIndex {\n  public readonly rebuildSizes: number[] = [];\n  public readonly patchCalls: IPatchCall[] = [];\n  public entriesCalls: number = 0;\n\n  private readonly _inner: IMemoryIndex;\n\n  private constructor(inner: IMemoryIndex) {\n    this._inner = inner;\n  }\n\n  public static create(): Result<RecordingMemoryIndex> {\n    return MemoryIndex.create().onSuccess((inner) => succeed(new RecordingMemoryIndex(inner)));\n  }\n\n  public rebuild(entries: ReadonlyArray<IIndexedMemoryRecord>): Result<number> {\n    this.rebuildSizes.push(entries.length);\n    return this._inner.rebuild(entries);\n  }\n\n  public patch(op: MemoryIndexPatchOp, entry: IIndexedMemoryRecord): Result<IIndexedMemoryRecord> {\n    this.patchCalls.push({ op, scope: entry.scope, id: entry.record.envelope.id });\n    return this._inner.patch(op, entry);\n  }\n\n  public entries(): ReadonlyArray<IIndexedMemoryRecord> {\n    this.entriesCalls += 1;\n    return this._inner.entries();\n  }\n\n  public byKind(kind: Kind): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byKind(kind);\n  }\n\n  public byTag(tag: Tag): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byTag(tag);\n  }\n\n  public byRecency(): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byRecency();\n  }\n\n  public byRank(): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byRank();\n  }\n\n  public backlinks(target: IEdgeTarget): ReadonlyArray<IEdgeTarget> {\n    return this._inner.backlinks(target);\n  }\n}\n\n/**\n * An index that hides every record whose body contains `hidden` from the\n * `entries()` read surface. Not a realistic index — it exists to prove the store\n * reads from the INJECTED index rather than one it built for itself. A store\n * with a private index could not produce these results.\n */\nclass HidingMemoryIndex implements IMemoryIndex {\n  private readonly _inner: IMemoryIndex;\n\n  private constructor(inner: IMemoryIndex) {\n    this._inner = inner;\n  }\n\n  public static create(): Result<HidingMemoryIndex> {\n    return MemoryIndex.create().onSuccess((inner) => succeed(new HidingMemoryIndex(inner)));\n  }\n\n  public rebuild(entries: ReadonlyArray<IIndexedMemoryRecord>): Result<number> {\n    return this._inner.rebuild(entries);\n  }\n\n  public patch(op: MemoryIndexPatchOp, entry: IIndexedMemoryRecord): Result<IIndexedMemoryRecord> {\n    return this._inner.patch(op, entry);\n  }\n\n  public entries(): ReadonlyArray<IIndexedMemoryRecord> {\n    return this._inner.entries().filter((e) => !String(e.record.body).includes('hidden'));\n  }\n\n  public byKind(kind: Kind): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byKind(kind);\n  }\n\n  public byTag(tag: Tag): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byTag(tag);\n  }\n\n  public byRecency(): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byRecency();\n  }\n\n  public byRank(): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._inner.byRank();\n  }\n\n  public backlinks(target: IEdgeTarget): ReadonlyArray<IEdgeTarget> {\n    return this._inner.backlinks(target);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Temporal (versioned) and cap-cull fixtures.\n//\n// The `index` param's TSDoc claims that an injected index decides which version a\n// versioned `put` supersedes, which versions a `delete` tombstones, and what a\n// cap-cull policy evicts — because all three derive their working set from\n// `entries()` rather than from the FileTree. These fixtures exist so those claims\n// are evidenced by test rather than only reasoned about from the implementation.\n// ---------------------------------------------------------------------------\n\nconst factKind: Kind = 'fact' as Kind;\nconst factScope: MemoryScopeKey = 'facts/entities/fact-1' as MemoryScopeKey;\nconst mtmKind: Kind = 'mtm' as Kind;\n\nlet clockValue: number = 1000;\nconst clock = (): number => clockValue;\n\nfunction factRecord(body: string): IMemoryRecord<unknown> {\n  return {\n    envelope: envelopeConverter\n      .convert({\n        id: 'fact-1',\n        entityId: 'fact-1',\n        kind: 'fact',\n        tags: [],\n        links: [],\n        created: 0,\n        updated: 0,\n        seq: 0,\n        contentHash: '',\n        provenance: { source: 'agent' }\n      })\n      .orThrow(),\n    body\n  };\n}\n\nfunction versionedStore(index?: IMemoryIndex): FileTreeMemoryStore {\n  const registry: IBodyConverterRegistry = BodyConverterRegistry.create().orThrow();\n  registry.register(factKind, Converters.string);\n  return FileTreeMemoryStore.create({\n    root: mutableRoot(),\n    registry,\n    codecs: new Map<Kind, IIdentityCodec>([[factKind, TemporalIdentityCodec.create('facts').orThrow()]]),\n    writePolicies: new Map<Kind, IWritePolicy>([[factKind, TemporalVersionedPolicy.create().orThrow()]]),\n    clock,\n    index\n  }).orThrow();\n}\n\nfunction turnRecord(turn: number, body: string): IMemoryRecord<unknown> {\n  return {\n    envelope: envelopeConverter\n      .convert({\n        id: `turn-${turn}`,\n        entityId: `conv-1:${turn}`,\n        kind: 'mtm',\n        tags: [],\n        links: [],\n        created: 0,\n        updated: 0,\n        seq: 0,\n        contentHash: '',\n        provenance: { source: 'agent' }\n      })\n      .orThrow(),\n    body\n  };\n}\n\nfunction cappedStore(index?: IMemoryIndex, maxRecords: number = 2): FileTreeMemoryStore {\n  const registry: IBodyConverterRegistry = BodyConverterRegistry.create().orThrow();\n  registry.register(mtmKind, Converters.string);\n  return FileTreeMemoryStore.create({\n    root: mutableRoot(),\n    registry,\n    codecs: new Map<Kind, IIdentityCodec>([[mtmKind, new MtmIdentityCodec()]]),\n    writePolicies: new Map<Kind, IWritePolicy>([\n      [\n        mtmKind,\n        MemoryCapCullPolicy.create({\n          maxRecords,\n          mutableFields: ['body', 'tags', 'links', 'provenance']\n        }).orThrow()\n      ]\n    ]),\n    clock,\n    index\n  }).orThrow();\n}\n\ndescribe('FileTreeMemoryStore index injection', () => {\n  describe('default (index omitted)', () => {\n    test('creates and serves reads from a default MemoryIndex', async () => {\n      const store = storeWith();\n      (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n      (await store.put(knowledgeRecord('doc-b', 'beta'))).orThrow();\n\n      expect(await store.list()).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n        expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);\n      });\n      expect(await store.get(knowledgeKind, 'doc-a' as EntityId)).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown> | undefined) => {\n          expect(record?.body).toBe('alpha');\n        }\n      );\n      expect(await store.listScoped()).toSucceedAndSatisfy((scoped) => {\n        expect(scoped).toHaveLength(2);\n      });\n    });\n\n    test('reopening an existing vault re-indexes it and resumes seq', async () => {\n      const root = mutableRoot();\n      const first = storeWith(undefined, root);\n      (await first.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n\n      const reopened = storeWith(undefined, root);\n      expect(await reopened.list()).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n        expect(records).toHaveLength(1);\n        expect(records[0].envelope.id).toBe('doc-a');\n      });\n      // seq resumes past the persisted high-water mark rather than restarting at 1.\n      expect(await reopened.put(knowledgeRecord('doc-b', 'beta'))).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown>) => {\n          expect(record.envelope.seq).toBe(2);\n        }\n      );\n    });\n  });\n\n  describe('absent index', () => {\n    test('a null index is treated as absent, matching every sibling optional param', async () => {\n      // `create()`'s other optional params all absorb absence with `??`, which takes\n      // null and undefined alike. A JS caller (or a TS caller through an `unknown`\n      // hatch) passing `null` here must get the default index too — installing\n      // `null` would instead fail later inside `entries()`, naming neither the param\n      // nor the cause.\n      const store = storeWith(null as unknown as IMemoryIndex);\n      (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n\n      expect(await store.list()).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n        expect(records.map((r) => r.envelope.id)).toEqual(['doc-a']);\n      });\n    });\n  });\n\n  describe('injected index', () => {\n    test('receives the create() rebuild of an existing vault', async () => {\n      const root = mutableRoot();\n      const seeded = storeWith(undefined, root);\n      (await seeded.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n      (await seeded.put(knowledgeRecord('doc-b', 'beta'))).orThrow();\n\n      const recording = RecordingMemoryIndex.create().orThrow();\n      const reopened = storeWith(recording, root);\n\n      // create() rebuilt the injected index exactly once, with both persisted records.\n      expect(recording.rebuildSizes).toEqual([2]);\n      expect(recording.patchCalls).toEqual([]);\n      expect(await reopened.list()).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n        expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);\n      });\n    });\n\n    test('receives a put patch and a delete patch', async () => {\n      const recording = RecordingMemoryIndex.create().orThrow();\n      const store = storeWith(recording);\n\n      // The empty-vault open still rebuilds (with zero entries) and patches nothing.\n      expect(recording.rebuildSizes).toEqual([0]);\n      expect(recording.patchCalls).toEqual([]);\n\n      (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n      expect(recording.patchCalls).toEqual([{ op: 'put', scope: knowledgeScope, id: 'doc-a' }]);\n\n      // A content revision of the same id is another 'put' patch, not a second entry.\n      (await store.put(knowledgeRecord('doc-a', 'alpha revised'))).orThrow();\n      expect(recording.patchCalls).toHaveLength(2);\n      expect(recording.patchCalls[1]).toEqual({ op: 'put', scope: knowledgeScope, id: 'doc-a' });\n\n      expect(await store.delete(knowledgeKind, 'doc-a' as EntityId)).toSucceedWith('doc-a' as MemoryId);\n      expect(recording.patchCalls[2]).toEqual({ op: 'delete', scope: knowledgeScope, id: 'doc-a' });\n    });\n\n    test('serves the store read surface — no second index is built', async () => {\n      const recording = RecordingMemoryIndex.create().orThrow();\n      const store = storeWith(recording);\n      (await store.put(knowledgeRecord('doc-a', 'alpha', ['topic']))).orThrow();\n\n      const before: number = recording.entriesCalls;\n      expect(await store.list()).toSucceed();\n      expect(await store.listScoped()).toSucceed();\n      expect(recording.entriesCalls).toBeGreaterThan(before);\n\n      // The injected index really holds the store's records: its projection views\n      // (never touched by the store itself) answer from the patched state.\n      expect(recording.byKind(knowledgeKind).map((r) => r.envelope.id)).toEqual(['doc-a']);\n      expect(recording.byTag('topic' as Tag).map((r) => r.envelope.id)).toEqual(['doc-a']);\n      expect(recording.byRecency().map((r) => r.envelope.id)).toEqual(['doc-a']);\n      expect(recording.byRank().map((r) => r.envelope.id)).toEqual(['doc-a']);\n      expect(recording.backlinks({ scope: knowledgeScope, id: 'doc-a' as MemoryId })).toEqual([]);\n    });\n\n    test('shares one index with a retriever built over the same instance', async () => {\n      const recording = RecordingMemoryIndex.create().orThrow();\n      const store = storeWith(recording);\n      (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n      (await store.put(knowledgeRecord('doc-b', 'beta'))).orThrow();\n\n      // The consumer's real pattern: the store maintains the index, retrievers read it.\n      const retriever = RecencyRetriever.create(recording).orThrow();\n      expect(await retriever.retrieve({ kind: knowledgeKind })).toSucceedAndSatisfy(\n        (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n          expect(records.map((r) => r.envelope.id).sort()).toEqual(['doc-a', 'doc-b']);\n        }\n      );\n    });\n\n    test('the injected index — not a private one — determines what the store returns', async () => {\n      const hiding = HidingMemoryIndex.create().orThrow();\n      const store = storeWith(hiding);\n      (await store.put(knowledgeRecord('doc-a', 'alpha'))).orThrow();\n      (await store.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();\n\n      // Both records persisted, but the injected index hides one from `entries()`,\n      // and every store read that goes through the index reflects exactly that.\n      expect(await store.list()).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n        expect(records.map((r) => r.envelope.id)).toEqual(['doc-a']);\n      });\n      expect(await store.listScoped()).toSucceedAndSatisfy((scoped) => {\n        expect(scoped.map((s) => s.target.id)).toEqual(['doc-a']);\n      });\n      // The file is still on disk — `getById` reads through to the FileTree, which\n      // remains the source of truth regardless of what the derived index projects.\n      expect(await store.getById(knowledgeScope, 'doc-b' as MemoryId)).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown> | undefined) => {\n          expect(record?.body).toBe('hidden beta');\n        }\n      );\n    });\n\n    test('an index that reshapes entries() changes write semantics, not just reads', async () => {\n      // The store's content-hash dedup and write-policy admission cohort both read\n      // the index's `entries()`, so an index that hides a record hides it from dedup\n      // too. This is the documented caveat on the `index` param — the reason to\n      // inject only a faithful delegating decorator.\n      const control = storeWith();\n      (await control.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();\n      // Default index: an identical body under a NEW id collapses onto the existing\n      // record (knowledge declares `dedupScope: 'content'`).\n      expect(await control.put(knowledgeRecord('doc-c', 'hidden beta'))).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown>) => {\n          expect(record.envelope.id).toBe('doc-b');\n        }\n      );\n\n      const hiding = storeWith(HidingMemoryIndex.create().orThrow());\n      (await hiding.put(knowledgeRecord('doc-b', 'hidden beta'))).orThrow();\n      // Hiding index: doc-b is invisible to `entries()`, so the content-hash lookup\n      // finds no duplicate and doc-c is written as a distinct record.\n      expect(await hiding.put(knowledgeRecord('doc-c', 'hidden beta'))).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown>) => {\n          expect(record.envelope.id).toBe('doc-c');\n        }\n      );\n    });\n  });\n\n  describe('injected index — temporal and cap-cull write paths', () => {\n    beforeEach(() => {\n      clockValue = 1000;\n    });\n\n    test('the injected index decides which version a versioned put supersedes and a delete tombstones', async () => {\n      // Both the versioned put and the versioned delete resolve an entity's version\n      // history through `_versionsForEntity`, which is a scope filter over the\n      // index's `entries()`. A version the injected index hides is therefore\n      // invisible to both — it stays on disk, but the store will not supersede,\n      // invalidate, or tombstone it. That is the documented caveat, and the reason\n      // only a faithful delegating decorator is safe to inject.\n      const control = versionedStore();\n      (await control.put(factRecord('hidden blue'))).orThrow();\n      clockValue = 2000;\n      (await control.put(factRecord('grey'))).orThrow();\n\n      // Default index: v1 is visible, so the second put closes its world-truth\n      // interval at the new version's `valid_at`.\n      expect(await control.getById(factScope, 'fact-1-v1' as MemoryId)).toSucceedAndSatisfy(\n        (v1: IMemoryRecord<unknown> | undefined) => {\n          expect(v1?.envelope.temporal?.invalid_at).toBe(2000);\n        }\n      );\n\n      const hiding = versionedStore(HidingMemoryIndex.create().orThrow());\n      clockValue = 1000;\n      (await hiding.put(factRecord('hidden blue'))).orThrow();\n      clockValue = 2000;\n      (await hiding.put(factRecord('grey'))).orThrow();\n\n      // Hiding index: v1 is invisible to the version walk, so the second put sees no\n      // current version, is built as a FIRST version, and invalidates nothing. v1 is\n      // still on disk and still carries no `invalid_at` — two live currents.\n      expect(await hiding.getById(factScope, 'fact-1-v1' as MemoryId)).toSucceedAndSatisfy(\n        (v1: IMemoryRecord<unknown> | undefined) => {\n          expect(v1?.body).toBe('hidden blue');\n          expect(v1?.envelope.temporal?.invalid_at).toBeUndefined();\n        }\n      );\n\n      // The delete half of the same claim: a soft delete tombstones every version the\n      // index shows as current, so the hidden v1 survives it untouched.\n      clockValue = 3000;\n      expect(await hiding.delete(factKind, 'fact-1' as EntityId)).toSucceed();\n      expect(await hiding.getById(factScope, 'fact-1-v2' as MemoryId)).toSucceedAndSatisfy(\n        (v2: IMemoryRecord<unknown> | undefined) => {\n          expect(v2?.envelope.temporal?.invalid_at).toBe(3000);\n        }\n      );\n      expect(await hiding.getById(factScope, 'fact-1-v1' as MemoryId)).toSucceedAndSatisfy(\n        (v1: IMemoryRecord<unknown> | undefined) => {\n          expect(v1?.envelope.temporal?.invalid_at).toBeUndefined();\n        }\n      );\n    });\n\n    test('cap-cull patches the injected index, and a reshaped cohort changes what is evicted', async () => {\n      // `maxRecords: 2` over the shared conversations/conv-1 MTM scope. The third\n      // write's admission cohort is the two prior records, so it culls the oldest.\n      const recording = RecordingMemoryIndex.create().orThrow();\n      const recorded = cappedStore(recording);\n      for (let turn = 0; turn < 3; turn++) {\n        clockValue = 1000 + turn; // distinct `created`, so \"oldest\" is unambiguous\n        (await recorded.put(turnRecord(turn, turn === 0 ? 'hidden zero' : `turn ${turn}`))).orThrow();\n      }\n\n      // The eviction reaches the INJECTED index as a `delete` patch — the store keeps\n      // no private index it could have patched instead.\n      expect(recording.patchCalls.filter((c) => c.op === 'delete')).toEqual([\n        { op: 'delete', scope: 'conversations/conv-1', id: 'turn-0' }\n      ]);\n      expect(await recorded.get(mtmKind, 'conv-1:0' as EntityId)).toSucceedWith(undefined);\n\n      // Same writes, but an index that hides turn-0 shrinks the admission cohort to\n      // one, which is under the cap — so nothing is evicted and turn-0 survives.\n      // The cohort the policy sees is the index's projection, not the vault's.\n      const hidden = cappedStore(HidingMemoryIndex.create().orThrow());\n      for (let turn = 0; turn < 3; turn++) {\n        clockValue = 1000 + turn;\n        (await hidden.put(turnRecord(turn, turn === 0 ? 'hidden zero' : `turn ${turn}`))).orThrow();\n      }\n\n      expect(await hidden.get(mtmKind, 'conv-1:0' as EntityId)).toSucceedAndSatisfy(\n        (record: IMemoryRecord<unknown> | undefined) => {\n          expect(record?.body).toBe('hidden zero');\n        }\n      );\n    });\n  });\n});\n"]}

package/lib/test/unit/store/lenientOpen.test.d.ts

@@ -1,2 +0,0 @@
-import '@fgv/ts-utils-jest';
-//# sourceMappingURL=lenientOpen.test.d.ts.map

package/lib/test/unit/store/lenientOpen.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"lenientOpen.test.d.ts","sourceRoot":"","sources":["../../../../src/test/unit/store/lenientOpen.test.ts"],"names":[],"mappings":"AAKA,OAAO,oBAAoB,CAAC"}