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

package/lib/test/unit/index/memoryIndex.test.d.ts.map

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

package/lib/test/unit/index/memoryIndex.test.js

@@ -1,216 +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 index_1 = require("../../../index");
-/**
- * The scope every link target in this fixture lives under. Links are authored as
- * bare id strings and resolved to `{ scope: LINK_TARGET_SCOPE, id }`, so the
- * cross-scope source tests can share one target while their sources differ.
- */
-const LINK_TARGET_SCOPE = 'knowledge';
-/** A scope-qualified backlink-target query for the fixed link-target scope. */
-function bt(id) {
-    return { scope: LINK_TARGET_SCOPE, id: id };
-}
-/** Extract the bare ids from a set of scope-qualified targets (backlink results). */
-function targetIds(targets) {
-    return targets.map((t) => t.id);
-}
-function makeEntry(spec) {
-    var _a, _b, _c, _d, _e, _f;
-    const record = {
-        envelope: index_1.envelopeConverter
-            .convert(Object.assign(Object.assign({ id: spec.id, entityId: spec.id, kind: (_a = spec.kind) !== null && _a !== void 0 ? _a : 'knowledge', tags: (_b = spec.tags) !== null && _b !== void 0 ? _b : [], links: ((_c = spec.links) !== null && _c !== void 0 ? _c : []).map((target) => ({
-                type: 'rel',
-                target: { scope: LINK_TARGET_SCOPE, id: target }
-            })), created: 0, updated: (_d = spec.updated) !== null && _d !== void 0 ? _d : 0, seq: (_e = spec.seq) !== null && _e !== void 0 ? _e : 0, contentHash: 'h' }, (spec.rank !== undefined ? { rank: spec.rank } : {})), { provenance: { source: 'agent' } }))
-            .orThrow(),
-        body: `body-${spec.id}`
-    };
-    return { scope: ((_f = spec.scope) !== null && _f !== void 0 ? _f : 'knowledge'), record };
-}
-function ids(records) {
-    return records.map((r) => r.envelope.id);
-}
-describe('MemoryIndex', () => {
-    let index;
-    beforeEach(() => {
-        index = index_1.MemoryIndex.create().orThrow();
-    });
-    describe('create', () => {
-        test('starts empty', () => {
-            expect(index.entries()).toHaveLength(0);
-            expect(index.byKind('knowledge')).toHaveLength(0);
-            expect(index.byTag('any')).toHaveLength(0);
-            expect(index.byRecency()).toHaveLength(0);
-            expect(index.backlinks(bt('none'))).toHaveLength(0);
-        });
-    });
-    describe('rebuild', () => {
-        test('indexes every entry and reports the count', () => {
-            const entries = [
-                makeEntry({ id: 'a', tags: ['x'], links: ['b'] }),
-                makeEntry({ id: 'b', tags: ['x', 'y'] })
-            ];
-            expect(index.rebuild(entries)).toSucceedWith(2);
-            expect(index.entries()).toHaveLength(2);
-            expect([...ids(index.byKind('knowledge'))].sort()).toEqual(['a', 'b']);
-            expect([...ids(index.byTag('x'))].sort()).toEqual(['a', 'b']);
-            expect(ids(index.byTag('y'))).toEqual(['b']);
-            expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);
-        });
-        test('clears prior state', () => {
-            index.rebuild([makeEntry({ id: 'a', tags: ['x'] })]).orThrow();
-            expect(index.rebuild([makeEntry({ id: 'c', tags: ['z'] })])).toSucceedWith(1);
-            expect(ids(index.entries().map((e) => e.record))).toEqual(['c']);
-            expect(index.byTag('x')).toHaveLength(0);
-        });
-    });
-    describe('patch', () => {
-        test('put inserts a new entry and returns it', () => {
-            const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
-            expect(index.patch('put', entry)).toSucceedWith(entry);
-            expect(ids(index.byKind('knowledge'))).toEqual(['a']);
-            expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);
-        });
-        test('put on an existing key replaces stale associations', () => {
-            index.patch('put', makeEntry({ id: 'a', kind: 'knowledge', tags: ['old'], links: ['b'] })).orThrow();
-            index.patch('put', makeEntry({ id: 'a', kind: 'note', tags: ['new'], links: ['c'] })).orThrow();
-            expect(index.entries()).toHaveLength(1);
-            expect(index.byTag('old')).toHaveLength(0);
-            expect(ids(index.byTag('new'))).toEqual(['a']);
-            expect(index.byKind('knowledge')).toHaveLength(0);
-            expect(ids(index.byKind('note'))).toEqual(['a']);
-            expect(index.backlinks(bt('b'))).toHaveLength(0);
-            expect(targetIds(index.backlinks(bt('c')))).toEqual(['a']);
-        });
-        test('delete removes the entry and its associations', () => {
-            const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });
-            index.patch('put', entry).orThrow();
-            expect(index.patch('delete', entry)).toSucceedWith(entry);
-            expect(index.entries()).toHaveLength(0);
-            expect(index.byTag('x')).toHaveLength(0);
-            expect(index.backlinks(bt('b'))).toHaveLength(0);
-        });
-        test('delete of an absent key is a no-op that still succeeds', () => {
-            const entry = makeEntry({ id: 'ghost' });
-            expect(index.patch('delete', entry)).toSucceedWith(entry);
-            expect(index.entries()).toHaveLength(0);
-        });
-        test('distinguishes entries with the same id across scopes', () => {
-            index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c1' })).orThrow();
-            index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c2' })).orThrow();
-            expect(index.entries()).toHaveLength(2);
-        });
-    });
-    describe('byRecency', () => {
-        test('orders most-recently-updated first, breaking ties by seq', () => {
-            index
-                .rebuild([
-                makeEntry({ id: 'old', updated: 100, seq: 1 }),
-                makeEntry({ id: 'newest', updated: 300, seq: 3 }),
-                makeEntry({ id: 'tie-lo', updated: 200, seq: 4 }),
-                makeEntry({ id: 'tie-hi', updated: 200, seq: 9 })
-            ])
-                .orThrow();
-            expect(ids(index.byRecency())).toEqual(['newest', 'tie-hi', 'tie-lo', 'old']);
-        });
-    });
-    describe('byRank', () => {
-        test('orders by rank descending, absent-rank records last, recency tiebreak', () => {
-            index
-                .rebuild([
-                makeEntry({ id: 'mid', rank: 5, updated: 100, seq: 1 }),
-                makeEntry({ id: 'top', rank: 9, updated: 100, seq: 2 }),
-                makeEntry({ id: 'tie-lo', rank: 3, updated: 200, seq: 4 }),
-                makeEntry({ id: 'tie-hi', rank: 3, updated: 200, seq: 9 }),
-                makeEntry({ id: 'unranked-old', updated: 100, seq: 5 }),
-                makeEntry({ id: 'unranked-new', updated: 400, seq: 6 })
-            ])
-                .orThrow();
-            // ranked (desc): top(9), mid(5), tie-hi(3,seq9), tie-lo(3,seq4);
-            // then unranked by recency: unranked-new(updated400), unranked-old(updated100).
-            expect(ids(index.byRank())).toEqual(['top', 'mid', 'tie-hi', 'tie-lo', 'unranked-new', 'unranked-old']);
-        });
-        test('is empty on an empty index', () => {
-            expect(index.byRank()).toHaveLength(0);
-        });
-        test('sorts a ranked record ahead of an earlier-listed absent-rank record', () => {
-            // Input lists the absent-rank record first so the sort compares (ranked, absent),
-            // exercising the ranked-before-absent direction of the comparator.
-            index
-                .rebuild([
-                makeEntry({ id: 'unranked', updated: 100, seq: 1 }),
-                makeEntry({ id: 'ranked', rank: 5, updated: 100, seq: 2 })
-            ])
-                .orThrow();
-            expect(ids(index.byRank())).toEqual(['ranked', 'unranked']);
-        });
-        test('orders two absent-rank records by recency alone', () => {
-            index
-                .rebuild([makeEntry({ id: 'a', updated: 100, seq: 1 }), makeEntry({ id: 'b', updated: 300, seq: 2 })])
-                .orThrow();
-            expect(ids(index.byRank())).toEqual(['b', 'a']);
-        });
-        test("index byRank agrees pairwise with the retrieve packlet's rankCompare", () => {
-            // Guard against the two hand-duplicated comparators (index `_compareByRank`
-            // and retrieve `rankCompare`) drifting: a future tie-break edit to one that
-            // diverges from the other is caught here on a shared mixed fixture.
-            const fixture = [
-                makeEntry({ id: 'r-top', rank: 9, updated: 100, seq: 1 }),
-                makeEntry({ id: 'r-mid', rank: 5, updated: 400, seq: 2 }),
-                makeEntry({ id: 'r-tie-a', rank: 3, updated: 200, seq: 3 }),
-                makeEntry({ id: 'r-tie-b', rank: 3, updated: 200, seq: 8 }),
-                makeEntry({ id: 'absent-old', updated: 100, seq: 4 }),
-                makeEntry({ id: 'absent-new', updated: 500, seq: 5 })
-            ];
-            index.rebuild(fixture).orThrow();
-            const viaIndex = ids(index.byRank());
-            const viaRankCompare = ids(fixture.map((e) => e.record).sort(index_1.rankCompare));
-            expect(viaIndex).toEqual(viaRankCompare);
-            // And the shared expected ordering is what both must produce.
-            expect(viaIndex).toEqual(['r-top', 'r-mid', 'r-tie-b', 'r-tie-a', 'absent-new', 'absent-old']);
-        });
-    });
-    describe('backlinks', () => {
-        test('aggregates multiple sources pointing at one target', () => {
-            index
-                .rebuild([makeEntry({ id: 'a', links: ['target'] }), makeEntry({ id: 'b', links: ['target'] })])
-                .orThrow();
-            expect(targetIds(index.backlinks(bt('target'))).sort()).toEqual(['a', 'b']);
-        });
-        test('drops the target set once the last source is removed', () => {
-            const a = makeEntry({ id: 'a', links: ['target'] });
-            index.patch('put', a).orThrow();
-            index.patch('delete', a).orThrow();
-            expect(index.backlinks(bt('target'))).toHaveLength(0);
-        });
-        test('tracks same-id sources across scopes independently', () => {
-            // Two distinct records that share the id 'a' under different scopes, both
-            // linking 'target'. Removing one must NOT drop the other's inbound edge.
-            const a1 = makeEntry({ id: 'a', scope: 'conversations/c1', links: ['target'] });
-            const a2 = makeEntry({ id: 'a', scope: 'conversations/c2', links: ['target'] });
-            index.patch('put', a1).orThrow();
-            index.patch('put', a2).orThrow();
-            expect(targetIds(index.backlinks(bt('target')))).toEqual(['a', 'a']);
-            index.patch('delete', a1).orThrow();
-            expect(targetIds(index.backlinks(bt('target')))).toEqual(['a']);
-        });
-    });
-    describe('duplicate associations', () => {
-        test('a record with duplicate tags and links is cleaned up exactly once on delete', () => {
-            const entry = makeEntry({ id: 'a', tags: ['dup', 'dup'], links: ['t', 't'] });
-            index.patch('put', entry).orThrow();
-            expect(ids(index.byTag('dup'))).toEqual(['a']);
-            expect(targetIds(index.backlinks(bt('t')))).toEqual(['a']);
-            index.patch('delete', entry).orThrow();
-            expect(index.byTag('dup')).toHaveLength(0);
-            expect(index.backlinks(bt('t'))).toHaveLength(0);
-        });
-    });
-});
-//# sourceMappingURL=memoryIndex.test.js.map

package/lib/test/unit/index/memoryIndex.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoryIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/index/memoryIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,0CAWwB;AAExB;;;;GAIG;AACH,MAAM,iBAAiB,GAAW,WAAW,CAAC;AAE9C,+EAA+E;AAC/E,SAAS,EAAE,CAAC,EAAU;IACpB,OAAO,EAAE,KAAK,EAAE,iBAAmC,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAC5E,CAAC;AAED,qFAAqF;AACrF,SAAS,SAAS,CAAC,OAAmC;IACpD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC;AAC5C,CAAC;AAaD,SAAS,SAAS,CAAC,IAAiB;;IAClC,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,yBAAiB;aACxB,OAAO,+BACN,EAAE,EAAE,IAAI,CAAC,EAAE,EACX,QAAQ,EAAE,IAAI,CAAC,EAAE,EACjB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,WAAW,EAC9B,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,EAAE,EACrB,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBACzC,IAAI,EAAE,KAAK;gBACX,MAAM,EAAE,EAAE,KAAK,EAAE,iBAAiB,EAAE,EAAE,EAAE,MAAM,EAAE;aACjD,CAAC,CAAC,EACH,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,MAAA,IAAI,CAAC,OAAO,mCAAI,CAAC,EAC1B,GAAG,EAAE,MAAA,IAAI,CAAC,GAAG,mCAAI,CAAC,EAClB,WAAW,EAAE,GAAG,IACb,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KACvD,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAC/B;aACD,OAAO,EAAE;QACZ,IAAI,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE;KACxB,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,WAAW,CAAmB,EAAE,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,GAAG,CAAC,OAA8C;IACzD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAY,CAAC,CAAC;AACrD,CAAC;AAED,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAI,KAAkB,CAAC;IAEvB,UAAU,CAAC,GAAG,EAAE;QACd,KAAK,GAAG,mBAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,cAAc,EAAE,GAAG,EAAE;YACxB,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACrD,MAAM,OAAO,GAAG;gBACd,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;aACzC,CAAC;YACF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC/E,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,KAAK,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAClD,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACvD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChG,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAmB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAc,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACzD,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,GAAG,EAAE;YAClE,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrF,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,0DAA0D,EAAE,GAAG,EAAE;YACpE,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC9C,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACjD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aAClD,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,uEAAuE,EAAE,GAAG,EAAE;YACjF,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC1D,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC1D,SAAS,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aACxD,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,iEAAiE;YACjE,gFAAgF;YAChF,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC/E,kFAAkF;YAClF,mEAAmE;YACnE,KAAK;iBACF,OAAO,CAAC;gBACP,SAAS,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACnD,SAAS,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aAC3D,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC3D,KAAK;iBACF,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBACrG,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAChF,4EAA4E;YAC5E,4EAA4E;YAC5E,oEAAoE;YACpE,MAAM,OAAO,GAAG;gBACd,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACzD,SAAS,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC3D,SAAS,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBAC3D,SAAS,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;gBACrD,SAAS,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;aACtD,CAAC;YACF,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YACrC,MAAM,cAAc,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,mBAAW,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,8DAA8D;YAC9D,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC;QACjG,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,KAAK;iBACF,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC/F,OAAO,EAAE,CAAC;YACb,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACpD,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,0EAA0E;YAC1E,yEAAyE;YACzE,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChF,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrE,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACtC,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;YACvF,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9E,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,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 {\n  IEdgeTarget,\n  IIndexedMemoryRecord,\n  IMemoryRecord,\n  Kind,\n  MemoryId,\n  MemoryIndex,\n  MemoryScopeKey,\n  Tag,\n  envelopeConverter,\n  rankCompare\n} from '../../../index';\n\n/**\n * The scope every link target in this fixture lives under. Links are authored as\n * bare id strings and resolved to `{ scope: LINK_TARGET_SCOPE, id }`, so the\n * cross-scope source tests can share one target while their sources differ.\n */\nconst LINK_TARGET_SCOPE: string = 'knowledge';\n\n/** A scope-qualified backlink-target query for the fixed link-target scope. */\nfunction bt(id: string): IEdgeTarget {\n  return { scope: LINK_TARGET_SCOPE as MemoryScopeKey, id: id as MemoryId };\n}\n\n/** Extract the bare ids from a set of scope-qualified targets (backlink results). */\nfunction targetIds(targets: ReadonlyArray<IEdgeTarget>): string[] {\n  return targets.map((t) => t.id as string);\n}\n\ninterface IRecordSpec {\n  readonly id: string;\n  readonly scope?: string;\n  readonly kind?: string;\n  readonly tags?: ReadonlyArray<string>;\n  readonly links?: ReadonlyArray<string>;\n  readonly updated?: number;\n  readonly seq?: number;\n  readonly rank?: number;\n}\n\nfunction makeEntry(spec: IRecordSpec): IIndexedMemoryRecord {\n  const record: IMemoryRecord<unknown> = {\n    envelope: envelopeConverter\n      .convert({\n        id: spec.id,\n        entityId: spec.id,\n        kind: spec.kind ?? 'knowledge',\n        tags: spec.tags ?? [],\n        links: (spec.links ?? []).map((target) => ({\n          type: 'rel',\n          target: { scope: LINK_TARGET_SCOPE, id: target }\n        })),\n        created: 0,\n        updated: spec.updated ?? 0,\n        seq: spec.seq ?? 0,\n        contentHash: 'h',\n        ...(spec.rank !== undefined ? { rank: spec.rank } : {}),\n        provenance: { source: 'agent' }\n      })\n      .orThrow(),\n    body: `body-${spec.id}`\n  };\n  return { scope: (spec.scope ?? 'knowledge') as MemoryScopeKey, record };\n}\n\nfunction ids(records: ReadonlyArray<IMemoryRecord<unknown>>): ReadonlyArray<string> {\n  return records.map((r) => r.envelope.id as string);\n}\n\ndescribe('MemoryIndex', () => {\n  let index: MemoryIndex;\n\n  beforeEach(() => {\n    index = MemoryIndex.create().orThrow();\n  });\n\n  describe('create', () => {\n    test('starts empty', () => {\n      expect(index.entries()).toHaveLength(0);\n      expect(index.byKind('knowledge' as Kind)).toHaveLength(0);\n      expect(index.byTag('any' as Tag)).toHaveLength(0);\n      expect(index.byRecency()).toHaveLength(0);\n      expect(index.backlinks(bt('none'))).toHaveLength(0);\n    });\n  });\n\n  describe('rebuild', () => {\n    test('indexes every entry and reports the count', () => {\n      const entries = [\n        makeEntry({ id: 'a', tags: ['x'], links: ['b'] }),\n        makeEntry({ id: 'b', tags: ['x', 'y'] })\n      ];\n      expect(index.rebuild(entries)).toSucceedWith(2);\n      expect(index.entries()).toHaveLength(2);\n      expect([...ids(index.byKind('knowledge' as Kind))].sort()).toEqual(['a', 'b']);\n      expect([...ids(index.byTag('x' as Tag))].sort()).toEqual(['a', 'b']);\n      expect(ids(index.byTag('y' as Tag))).toEqual(['b']);\n      expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);\n    });\n\n    test('clears prior state', () => {\n      index.rebuild([makeEntry({ id: 'a', tags: ['x'] })]).orThrow();\n      expect(index.rebuild([makeEntry({ id: 'c', tags: ['z'] })])).toSucceedWith(1);\n      expect(ids(index.entries().map((e) => e.record))).toEqual(['c']);\n      expect(index.byTag('x' as Tag)).toHaveLength(0);\n    });\n  });\n\n  describe('patch', () => {\n    test('put inserts a new entry and returns it', () => {\n      const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });\n      expect(index.patch('put', entry)).toSucceedWith(entry);\n      expect(ids(index.byKind('knowledge' as Kind))).toEqual(['a']);\n      expect(targetIds(index.backlinks(bt('b')))).toEqual(['a']);\n    });\n\n    test('put on an existing key replaces stale associations', () => {\n      index.patch('put', makeEntry({ id: 'a', kind: 'knowledge', tags: ['old'], links: ['b'] })).orThrow();\n      index.patch('put', makeEntry({ id: 'a', kind: 'note', tags: ['new'], links: ['c'] })).orThrow();\n      expect(index.entries()).toHaveLength(1);\n      expect(index.byTag('old' as Tag)).toHaveLength(0);\n      expect(ids(index.byTag('new' as Tag))).toEqual(['a']);\n      expect(index.byKind('knowledge' as Kind)).toHaveLength(0);\n      expect(ids(index.byKind('note' as Kind))).toEqual(['a']);\n      expect(index.backlinks(bt('b'))).toHaveLength(0);\n      expect(targetIds(index.backlinks(bt('c')))).toEqual(['a']);\n    });\n\n    test('delete removes the entry and its associations', () => {\n      const entry = makeEntry({ id: 'a', tags: ['x'], links: ['b'] });\n      index.patch('put', entry).orThrow();\n      expect(index.patch('delete', entry)).toSucceedWith(entry);\n      expect(index.entries()).toHaveLength(0);\n      expect(index.byTag('x' as Tag)).toHaveLength(0);\n      expect(index.backlinks(bt('b'))).toHaveLength(0);\n    });\n\n    test('delete of an absent key is a no-op that still succeeds', () => {\n      const entry = makeEntry({ id: 'ghost' });\n      expect(index.patch('delete', entry)).toSucceedWith(entry);\n      expect(index.entries()).toHaveLength(0);\n    });\n\n    test('distinguishes entries with the same id across scopes', () => {\n      index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c1' })).orThrow();\n      index.patch('put', makeEntry({ id: 'turn-0', scope: 'conversations/c2' })).orThrow();\n      expect(index.entries()).toHaveLength(2);\n    });\n  });\n\n  describe('byRecency', () => {\n    test('orders most-recently-updated first, breaking ties by seq', () => {\n      index\n        .rebuild([\n          makeEntry({ id: 'old', updated: 100, seq: 1 }),\n          makeEntry({ id: 'newest', updated: 300, seq: 3 }),\n          makeEntry({ id: 'tie-lo', updated: 200, seq: 4 }),\n          makeEntry({ id: 'tie-hi', updated: 200, seq: 9 })\n        ])\n        .orThrow();\n      expect(ids(index.byRecency())).toEqual(['newest', 'tie-hi', 'tie-lo', 'old']);\n    });\n  });\n\n  describe('byRank', () => {\n    test('orders by rank descending, absent-rank records last, recency tiebreak', () => {\n      index\n        .rebuild([\n          makeEntry({ id: 'mid', rank: 5, updated: 100, seq: 1 }),\n          makeEntry({ id: 'top', rank: 9, updated: 100, seq: 2 }),\n          makeEntry({ id: 'tie-lo', rank: 3, updated: 200, seq: 4 }),\n          makeEntry({ id: 'tie-hi', rank: 3, updated: 200, seq: 9 }),\n          makeEntry({ id: 'unranked-old', updated: 100, seq: 5 }),\n          makeEntry({ id: 'unranked-new', updated: 400, seq: 6 })\n        ])\n        .orThrow();\n      // ranked (desc): top(9), mid(5), tie-hi(3,seq9), tie-lo(3,seq4);\n      // then unranked by recency: unranked-new(updated400), unranked-old(updated100).\n      expect(ids(index.byRank())).toEqual(['top', 'mid', 'tie-hi', 'tie-lo', 'unranked-new', 'unranked-old']);\n    });\n\n    test('is empty on an empty index', () => {\n      expect(index.byRank()).toHaveLength(0);\n    });\n\n    test('sorts a ranked record ahead of an earlier-listed absent-rank record', () => {\n      // Input lists the absent-rank record first so the sort compares (ranked, absent),\n      // exercising the ranked-before-absent direction of the comparator.\n      index\n        .rebuild([\n          makeEntry({ id: 'unranked', updated: 100, seq: 1 }),\n          makeEntry({ id: 'ranked', rank: 5, updated: 100, seq: 2 })\n        ])\n        .orThrow();\n      expect(ids(index.byRank())).toEqual(['ranked', 'unranked']);\n    });\n\n    test('orders two absent-rank records by recency alone', () => {\n      index\n        .rebuild([makeEntry({ id: 'a', updated: 100, seq: 1 }), makeEntry({ id: 'b', updated: 300, seq: 2 })])\n        .orThrow();\n      expect(ids(index.byRank())).toEqual(['b', 'a']);\n    });\n\n    test(\"index byRank agrees pairwise with the retrieve packlet's rankCompare\", () => {\n      // Guard against the two hand-duplicated comparators (index `_compareByRank`\n      // and retrieve `rankCompare`) drifting: a future tie-break edit to one that\n      // diverges from the other is caught here on a shared mixed fixture.\n      const fixture = [\n        makeEntry({ id: 'r-top', rank: 9, updated: 100, seq: 1 }),\n        makeEntry({ id: 'r-mid', rank: 5, updated: 400, seq: 2 }),\n        makeEntry({ id: 'r-tie-a', rank: 3, updated: 200, seq: 3 }),\n        makeEntry({ id: 'r-tie-b', rank: 3, updated: 200, seq: 8 }),\n        makeEntry({ id: 'absent-old', updated: 100, seq: 4 }),\n        makeEntry({ id: 'absent-new', updated: 500, seq: 5 })\n      ];\n      index.rebuild(fixture).orThrow();\n      const viaIndex = ids(index.byRank());\n      const viaRankCompare = ids(fixture.map((e) => e.record).sort(rankCompare));\n      expect(viaIndex).toEqual(viaRankCompare);\n      // And the shared expected ordering is what both must produce.\n      expect(viaIndex).toEqual(['r-top', 'r-mid', 'r-tie-b', 'r-tie-a', 'absent-new', 'absent-old']);\n    });\n  });\n\n  describe('backlinks', () => {\n    test('aggregates multiple sources pointing at one target', () => {\n      index\n        .rebuild([makeEntry({ id: 'a', links: ['target'] }), makeEntry({ id: 'b', links: ['target'] })])\n        .orThrow();\n      expect(targetIds(index.backlinks(bt('target'))).sort()).toEqual(['a', 'b']);\n    });\n\n    test('drops the target set once the last source is removed', () => {\n      const a = makeEntry({ id: 'a', links: ['target'] });\n      index.patch('put', a).orThrow();\n      index.patch('delete', a).orThrow();\n      expect(index.backlinks(bt('target'))).toHaveLength(0);\n    });\n\n    test('tracks same-id sources across scopes independently', () => {\n      // Two distinct records that share the id 'a' under different scopes, both\n      // linking 'target'. Removing one must NOT drop the other's inbound edge.\n      const a1 = makeEntry({ id: 'a', scope: 'conversations/c1', links: ['target'] });\n      const a2 = makeEntry({ id: 'a', scope: 'conversations/c2', links: ['target'] });\n      index.patch('put', a1).orThrow();\n      index.patch('put', a2).orThrow();\n      expect(targetIds(index.backlinks(bt('target')))).toEqual(['a', 'a']);\n      index.patch('delete', a1).orThrow();\n      expect(targetIds(index.backlinks(bt('target')))).toEqual(['a']);\n    });\n  });\n\n  describe('duplicate associations', () => {\n    test('a record with duplicate tags and links is cleaned up exactly once on delete', () => {\n      const entry = makeEntry({ id: 'a', tags: ['dup', 'dup'], links: ['t', 't'] });\n      index.patch('put', entry).orThrow();\n      expect(ids(index.byTag('dup' as Tag))).toEqual(['a']);\n      expect(targetIds(index.backlinks(bt('t')))).toEqual(['a']);\n      index.patch('delete', entry).orThrow();\n      expect(index.byTag('dup' as Tag)).toHaveLength(0);\n      expect(index.backlinks(bt('t'))).toHaveLength(0);\n    });\n  });\n});\n"]}

package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts

@@ -1,9 +0,0 @@
-/**
- * Antagonist torture tests — cycle guard adversarial graphs (target class 6) and
- * enum-branch parity (target class 7), exercised at the ORCHESTRATOR/integration
- * level over a real {@link FileTreeMemoryStore}, complementing the pure-function
- * unit tests in `cycleGuard.test.ts` and the per-verdict tests in
- * `orchestrator.test.ts`.
- */
-import '@fgv/ts-utils-jest';
-//# sourceMappingURL=antagonistCycleAndParity.test.d.ts.map

package/lib/test/unit/ingest/antagonistCycleAndParity.test.d.ts.map

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

package/lib/test/unit/ingest/antagonistCycleAndParity.test.js

@@ -1,279 +0,0 @@
-"use strict";
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * Antagonist torture tests — cycle guard adversarial graphs (target class 6) and
- * enum-branch parity (target class 7), exercised at the ORCHESTRATOR/integration
- * level over a real {@link FileTreeMemoryStore}, complementing the pure-function
- * unit tests in `cycleGuard.test.ts` and the per-verdict tests in
- * `orchestrator.test.ts`.
- */
-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 noteKind = 'note';
-/** A scope-qualified target for the note fixtures (all under the knowledge scope). */
-function kt(id) {
-    return { scope: 'knowledge', id: id };
-}
-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 registry() {
-    const reg = index_1.BodyConverterRegistry.create().orThrow();
-    reg.register(noteKind, ts_utils_1.Converters.string);
-    return reg;
-}
-const codecs = new Map([
-    [noteKind, new index_1.KnowledgeIdentityCodec()]
-]);
-function buildStore() {
-    return index_1.FileTreeMemoryStore.create({ root: mutableRoot(), registry: registry(), codecs }).orThrow();
-}
-async function putFull(store, entityId, body, links = []) {
-    const rec = {
-        envelope: {
-            id: entityId,
-            entityId: entityId,
-            kind: noteKind,
-            tags: [],
-            links,
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: '',
-            provenance: { source: 'agent' }
-        },
-        body
-    };
-    (await store.put(rec)).orThrow();
-}
-function classifier(fn) {
-    return { classify: (item) => Promise.resolve(fn(item)) };
-}
-function extractor(fn) {
-    return { extract: (item, c) => Promise.resolve(fn(item, c)) };
-}
-function relater(fn) {
-    return { relate: (ctx) => Promise.resolve(fn(ctx)) };
-}
-function resolver(fn) {
-    return { resolve: (candidate, similar) => Promise.resolve(fn(candidate, similar)) };
-}
-const classifyNote = classifier(() => (0, ts_utils_1.succeed)({ kind: noteKind }));
-function candidate(entityId, body, links = []) {
-    return {
-        envelope: {
-            entityId: entityId,
-            kind: noteKind,
-            tags: [],
-            links,
-            provenance: { source: 'agent' }
-        },
-        body
-    };
-}
-function candEdge(source, type, target) {
-    return { source: kt(source), edge: { type: type, target: kt(target) } };
-}
-function buildOrchestrator(params) {
-    return index_1.MemoryIngestOrchestrator.create({
-        store: params.store,
-        registry: registry(),
-        codecs,
-        classifier: classifyNote,
-        extractor: params.extractor,
-        relationExtractor: params.relationExtractor,
-        entityResolver: params.entityResolver
-    }).orThrow();
-}
-describe('antagonist — cycle guard through EXISTING store edges (integration)', () => {
-    // Wrong impl this catches: an orchestrator that only feeds the cycle guard the
-    // proposed-edge batch (as its own pure-function unit tests do) and forgets to
-    // fold in the store snapshot's existing edges, so a cycle that closes THROUGH
-    // an already-persisted edge is silently admitted.
-    test('a proposed edge that closes a cycle through a pre-existing on-disk edge is rejected', async () => {
-        const store = buildStore();
-        // Existing on-disk edge: doc-a -> doc-b (persisted before this ingest runs).
-        await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: kt('doc-b') }]);
-        await putFull(store, 'doc-b', 'anchor-b');
-        // This ingest re-writes doc-b (a 'new'-verdict same-id update, since no
-        // resolver is wired) and proposes doc-b -> doc-a, which — unioned with the
-        // EXISTING doc-a -> doc-b edge — closes a 2-cycle that exists ONLY because of
-        // the on-disk edge, not anything proposed in this batch.
-        const orch = buildOrchestrator({
-            store,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('doc-b', 'anchor-b-v2')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([candEdge('doc-b', 'rel', 'doc-a')]))
-        });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/would create a cycle/);
-        // Confirm the guard fired BEFORE any write — doc-b's content must be unchanged.
-        expect(await store.get(noteKind, 'doc-b')).toSucceedAndSatisfy((rec) => expect(rec === null || rec === void 0 ? void 0 : rec.body).toBe('anchor-b'));
-    });
-    test('a long existing chain plus one proposed edge closing the loop is rejected', async () => {
-        const store = buildStore();
-        // Existing chain: a -> b -> c -> d (four pre-existing on-disk edges spanning
-        // three hops), persisted before this ingest.
-        await putFull(store, 'chain-a', 'a', [{ type: 'rel', target: kt('chain-b') }]);
-        await putFull(store, 'chain-b', 'b', [{ type: 'rel', target: kt('chain-c') }]);
-        await putFull(store, 'chain-c', 'c', [{ type: 'rel', target: kt('chain-d') }]);
-        await putFull(store, 'chain-d', 'd');
-        // Proposed: chain-d -> chain-a, closing the whole loop through the existing chain.
-        const orch = buildOrchestrator({
-            store,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('chain-d', 'd-v2')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([candEdge('chain-d', 'rel', 'chain-a')]))
-        });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/would create a cycle/);
-    });
-    test('cycleGuard "off" admits a cycle that closes through an existing edge', async () => {
-        const store = buildStore();
-        await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel', target: kt('doc-b') }]);
-        await putFull(store, 'doc-b', 'anchor-b');
-        const orch = index_1.MemoryIngestOrchestrator.create({
-            store,
-            registry: registry(),
-            codecs,
-            classifier: classifyNote,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('doc-b', 'anchor-b-v2')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([candEdge('doc-b', 'rel', 'doc-a')])),
-            cycleGuard: 'off'
-        }).orThrow();
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
-            var _a;
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: kt('doc-a') }]);
-        });
-    });
-});
-describe('antagonist — resolver target need not be a surfaced `similar` candidate (structural-only gate)', () => {
-    // Documents (and locks in) the actual contract: fgv validates a target-bearing
-    // verdict STRUCTURALLY (exists in the store + matching kind), uniformly across
-    // all three target-bearing verdicts, regardless of whether the resolver's
-    // choice was among the `similar` candidates it was shown. Wrong impl this
-    // guards against: fgv silently restricting itself to `similar` membership
-    // (which would incorrectly reject a host resolver with external knowledge), OR
-    // fgv skipping the structural check for one of the three verdicts.
-    test.each(['duplicate-of', 'supersede', 'merge-into'])("verdict '%s' targeting a valid existing record OUTSIDE the surfaced similar set is accepted", async (verdict) => {
-        const store = buildStore();
-        await putFull(store, 'doc-a', 'apple pie'); // will be surfaced as `similar`
-        await putFull(store, 'doc-q', 'unrelated target'); // exists, but never surfaced
-        const vectorIndex = index_1.InMemoryCosineIndex.create().orThrow();
-        const embed = () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1, 0, 0])));
-        // Only doc-a is embedded/indexed; doc-q is never surfaced by similarity —
-        // it can only be reached by the resolver's own out-of-band choice.
-        (await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();
-        const orch = index_1.MemoryIngestOrchestrator.create({
-            store,
-            registry: registry(),
-            codecs,
-            classifier: classifyNote,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('doc-b', 'apple tart')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
-            vectorIndex,
-            embed,
-            entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('doc-q') }))
-        }).orThrow();
-        const result = await orch.ingestItem({ id: 'i', content: 'x' });
-        if (verdict === 'duplicate-of') {
-            expect(result).toSucceedAndSatisfy((r) => {
-                expect(r.records[0].disposition).toBe('deduped');
-                expect(r.records[0].id).toBe('doc-q');
-            });
-        }
-        else if (verdict === 'supersede') {
-            expect(result).toSucceedAndSatisfy((r) => {
-                expect(r.records[0].disposition).toBe('written');
-                expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: kt('doc-q') });
-            });
-        }
-        else {
-            expect(result).toSucceedAndSatisfy((r) => {
-                expect(r.records[0].disposition).toBe('merged');
-                expect(r.records[0].id).toBe('doc-q');
-            });
-        }
-    });
-});
-describe('antagonist — enum-branch parity: uniform structural rejection across target-bearing verdicts', () => {
-    // A single table-driven test locking in that EVERY target-bearing verdict arm
-    // shares the SAME two structural checks (existence, then kind match) in the
-    // SAME order — the exact class of hole ("only merge-into checked") that a
-    // prior review caught. Wrong impl this guards against: a future edit that adds
-    // a fourth verdict or refactors validation per-branch and re-introduces an
-    // asymmetric gap.
-    const verdicts = ['duplicate-of', 'supersede', 'merge-into'];
-    test.each(verdicts)("verdict '%s' rejects a nonexistent target with the SAME message shape", async (verdict) => {
-        const store = buildStore();
-        await putFull(store, 'doc-a', 'apple pie');
-        const vectorIndex = index_1.InMemoryCosineIndex.create().orThrow();
-        const embed = () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1, 0, 0])));
-        const orch = index_1.MemoryIngestOrchestrator.create({
-            store,
-            registry: registry(),
-            codecs,
-            classifier: classifyNote,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('doc-b', 'apple tart')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
-            vectorIndex,
-            embed,
-            entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('ghost') }))
-        }).orThrow();
-        (await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'knowledge/ghost' does not exist in the store`);
-    });
-    test.each(verdicts)("verdict '%s' rejects a foreign-kind target with the SAME message shape", async (verdict) => {
-        const otherKind = 'other';
-        const reg = registry();
-        reg.register(otherKind, ts_utils_1.Converters.string);
-        const otherCodecs = new Map([
-            ...codecs,
-            [otherKind, new index_1.KnowledgeIdentityCodec()]
-        ]);
-        const store = index_1.FileTreeMemoryStore.create({
-            root: mutableRoot(),
-            registry: reg,
-            codecs: otherCodecs
-        }).orThrow();
-        const foreignRec = {
-            envelope: {
-                id: 'foreign-1',
-                entityId: 'foreign-1',
-                kind: otherKind,
-                tags: [],
-                links: [],
-                created: 0,
-                updated: 0,
-                seq: 0,
-                contentHash: '',
-                provenance: { source: 'agent' }
-            },
-            body: 'apple pie'
-        };
-        (await store.put(foreignRec)).orThrow();
-        const vectorIndex = index_1.InMemoryCosineIndex.create().orThrow();
-        const embed = () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1, 0, 0])));
-        const orch = index_1.MemoryIngestOrchestrator.create({
-            store,
-            registry: reg,
-            codecs: otherCodecs,
-            classifier: classifyNote,
-            extractor: extractor(() => (0, ts_utils_1.succeed)([candidate('doc-b', 'apple tart')])),
-            relationExtractor: relater(() => (0, ts_utils_1.succeed)([])),
-            vectorIndex,
-            embed,
-            entityResolver: resolver(() => (0, ts_utils_1.succeed)({ verdict, target: kt('foreign-1') }))
-        }).orThrow();
-        (await vectorIndex.add(kt('foreign-1'), Float32Array.from([1, 0, 0]))).orThrow();
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(`ingest 'i': ${verdict} target 'knowledge/foreign-1' is kind 'other' but the candidate is kind 'note'`);
-    });
-});
-//# sourceMappingURL=antagonistCycleAndParity.test.js.map

package/lib/test/unit/ingest/antagonistCycleAndParity.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"antagonistCycleAndParity.test.js","sourceRoot":"","sources":["../../../../src/test/unit/ingest/antagonistCycleAndParity.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH;;;;;;GAMG;AAEH,8BAA4B;AAC5B,4CAA4D;AAC5D,oDAA6C;AAC7C,0CA4BwB;AAExB,MAAM,QAAQ,GAAS,MAAc,CAAC;AAEtC,sFAAsF;AACtF,SAAS,EAAE,CAAC,EAAU;IACpB,OAAO,EAAE,KAAK,EAAE,WAA6B,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AACtE,CAAC;AAED,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,QAAQ;IACf,MAAM,GAAG,GAAG,6BAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IACrD,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,MAAM,GAAsC,IAAI,GAAG,CAAuB;IAC9E,CAAC,QAAQ,EAAE,IAAI,8BAAsB,EAAE,CAAC;CACzC,CAAC,CAAC;AAEH,SAAS,UAAU;IACjB,OAAO,2BAAmB,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;AACrG,CAAC;AAED,KAAK,UAAU,OAAO,CACpB,KAA0B,EAC1B,QAAgB,EAChB,IAAY,EACZ,QAAkC,EAAE;IAEpC,MAAM,GAAG,GAA2B;QAClC,QAAQ,EAAE;YACR,EAAE,EAAE,QAAoB;YACxB,QAAQ,EAAE,QAAoB;YAC9B,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,EAAE;YACR,KAAK;YACL,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,GAAG,EAAE,CAAC;YACN,WAAW,EAAE,EAAE;YACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC;QACD,IAAI;KACL,CAAC;IACF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,UAAU,CAAC,EAAwD;IAC1E,OAAO,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;AAC3D,CAAC;AACD,SAAS,SAAS,CAChB,EAA4F;IAE5F,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AAChE,CAAC;AACD,SAAS,OAAO,CAAC,EAAoE;IACnF,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;AACvD,CAAC;AACD,SAAS,QAAQ,CACf,EAG8B;IAE9B,OAAO,EAAE,OAAO,EAAE,CAAC,SAAS,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;AACtF,CAAC;AAED,MAAM,YAAY,GAAsB,UAAU,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AAEtF,SAAS,SAAS,CAChB,QAAgB,EAChB,IAAa,EACb,QAA+C,EAAE;IAEjD,OAAO;QACL,QAAQ,EAAE;YACR,QAAQ,EAAE,QAAoB;YAC9B,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,EAAE;YACR,KAAK;YACL,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC;QACD,IAAI;KACL,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc,EAAE,IAAY,EAAE,MAAc;IAC5D,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,IAAa,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;AACnF,CAAC;AAED,SAAS,iBAAiB,CAAC,MAK1B;IACC,OAAO,gCAAwB,CAAC,MAAM,CAAC;QACrC,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,QAAQ,EAAE,QAAQ,EAAE;QACpB,MAAM;QACN,UAAU,EAAE,YAAY;QACxB,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;QAC3C,cAAc,EAAE,MAAM,CAAC,cAAc;KACtC,CAAC,CAAC,OAAO,EAAE,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,qEAAqE,EAAE,GAAG,EAAE;IACnF,+EAA+E;IAC/E,8EAA8E;IAC9E,8EAA8E;IAC9E,kDAAkD;IAClD,IAAI,CAAC,qFAAqF,EAAE,KAAK,IAAI,EAAE;QACrG,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;QAC3B,6EAA6E;QAC7E,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,KAAc,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3F,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAE1C,wEAAwE;QACxE,2EAA2E;QAC3E,8EAA8E;QAC9E,yDAAyD;QACzD,MAAM,IAAI,GAAG,iBAAiB,CAAC;YAC7B,KAAK;YACL,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;YACxE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;SAC/E,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;QAE5F,gFAAgF;QAChF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAmB,CAAC,CAAC,CAAC,mBAAmB,CACxE,CAAC,GAAuC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAChF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;QAC3F,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;QAC3B,6EAA6E;QAC7E,6CAA6C;QAC7C,MAAM,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAc,EAAE,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QACxF,MAAM,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAc,EAAE,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QACxF,MAAM,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAc,EAAE,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QACxF,MAAM,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAErC,mFAAmF;QACnF,MAAM,IAAI,GAAG,iBAAiB,CAAC;YAC7B,KAAK;YACL,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YACnE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;SACnF,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;QACtF,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,KAAc,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3F,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,gCAAwB,CAAC,MAAM,CAAC;YAC3C,KAAK;YACL,QAAQ,EAAE,QAAQ,EAAE;YACpB,MAAM;YACN,UAAU,EAAE,YAAY;YACxB,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;YACxE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9E,UAAU,EAAE,KAAK;SAClB,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAoB,EAAE,EAAE;;YACpG,MAAM,CAAC,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,0CAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9F,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gGAAgG,EAAE,GAAG,EAAE;IAC9G,+EAA+E;IAC/E,+EAA+E;IAC/E,0EAA0E;IAC1E,0EAA0E;IAC1E,0EAA0E;IAC1E,+EAA+E;IAC/E,mEAAmE;IACnE,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc,EAAE,WAAW,EAAE,YAAY,CAAU,CAAC,CAC7D,6FAA6F,EAC7F,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,gCAAgC;QAC5E,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,kBAAkB,CAAC,CAAC,CAAC,6BAA6B;QAEhF,MAAM,WAAW,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,GAAkC,EAAE,CAChD,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,0EAA0E;QAC1E,mEAAmE;QACnE,CAAC,MAAM,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAE7E,MAAM,IAAI,GAAG,gCAAwB,CAAC,MAAM,CAAC;YAC3C,KAAK;YACL,QAAQ,EAAE,QAAQ,EAAE;YACpB,MAAM;YACN,UAAU,EAAE,YAAY;YACxB,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC;YAC7C,WAAW;YACX,KAAK;YACL,cAAc,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAuB,CAAC,CAAC;SAC/F,CAAC,CAAC,OAAO,EAAE,CAAC;QAEb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QAChE,IAAI,OAAO,KAAK,cAAc,EAAE,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAoB,EAAE,EAAE;gBAC1D,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACjD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,KAAK,WAAW,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAoB,EAAE,EAAE;gBAC1D,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACjD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACzF,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAoB,EAAE,EAAE;gBAC1D,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,8FAA8F,EAAE,GAAG,EAAE;IAC5G,8EAA8E;IAC9E,4EAA4E;IAC5E,0EAA0E;IAC1E,+EAA+E;IAC/E,2EAA2E;IAC3E,kBAAkB;IAClB,MAAM,QAAQ,GAAG,CAAC,cAAc,EAAE,WAAW,EAAE,YAAY,CAAU,CAAC;IAEtE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CACjB,uEAAuE,EACvE,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,MAAM,KAAK,GAAG,UAAU,EAAE,CAAC;QAC3B,MAAM,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,GAAkC,EAAE,CAChD,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,gCAAwB,CAAC,MAAM,CAAC;YAC3C,KAAK;YACL,QAAQ,EAAE,QAAQ,EAAE;YACpB,MAAM;YACN,UAAU,EAAE,YAAY;YACxB,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC;YAC7C,WAAW;YACX,KAAK;YACL,cAAc,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAuB,CAAC,CAAC;SAC/F,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,CAAC,MAAM,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC7E,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CACjE,eAAe,OAAO,uDAAuD,CAC9E,CAAC;IACJ,CAAC,CACF,CAAC;IAEF,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CACjB,wEAAwE,EACxE,KAAK,EAAE,OAAO,EAAE,EAAE;QAChB,MAAM,SAAS,GAAS,OAAe,CAAC;QACxC,MAAM,GAAG,GAAG,QAAQ,EAAE,CAAC;QACvB,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,qBAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAsC,IAAI,GAAG,CAAuB;YACnF,GAAG,MAAM;YACT,CAAC,SAAS,EAAE,IAAI,8BAAsB,EAAE,CAAC;SAC1C,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,CAAC;YACvC,IAAI,EAAE,WAAW,EAAE;YACnB,QAAQ,EAAE,GAAG;YACb,MAAM,EAAE,WAAW;SACpB,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,UAAU,GAA2B;YACzC,QAAQ,EAAE;gBACR,EAAE,EAAE,WAAuB;gBAC3B,QAAQ,EAAE,WAAuB;gBACjC,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,EAAwB;gBAC9B,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,CAAC;gBACV,GAAG,EAAE,CAAC;gBACN,WAAW,EAAE,EAAE;gBACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;aAChC;YACD,IAAI,EAAE,WAAW;SAClB,CAAC;QACF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxC,MAAM,WAAW,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAG,GAAkC,EAAE,CAChD,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,gCAAwB,CAAC,MAAM,CAAC;YAC3C,KAAK;YACL,QAAQ,EAAE,GAAG;YACb,MAAM,EAAE,WAAW;YACnB,UAAU,EAAE,YAAY;YACxB,SAAS,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC;YAC7C,WAAW;YACX,KAAK;YACL,cAAc,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,WAAW,CAAC,EAAuB,CAAC,CAAC;SACnG,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,CAAC,MAAM,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACjF,MAAM,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CACjE,eAAe,OAAO,gFAAgF,CACvG,CAAC;IACJ,CAAC,CACF,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\n/**\n * Antagonist torture tests — cycle guard adversarial graphs (target class 6) and\n * enum-branch parity (target class 7), exercised at the ORCHESTRATOR/integration\n * level over a real {@link FileTreeMemoryStore}, complementing the pure-function\n * unit tests in `cycleGuard.test.ts` and the per-verdict tests in\n * `orchestrator.test.ts`.\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  ICandidateEdge,\n  ICandidateRecord,\n  IEdgeTarget,\n  IEntityResolutionCandidate,\n  IEntityResolver,\n  IFactExtractor,\n  IIdentityCodec,\n  IIngestItem,\n  IIngestItemResult,\n  IMemoryClassification,\n  IMemoryClassifier,\n  IMemoryEnvelope,\n  IMemoryRecord,\n  IRelationContext,\n  IRelationExtractor,\n  InMemoryCosineIndex,\n  Kind,\n  KnowledgeIdentityCodec,\n  MemoryId,\n  MemoryIngestOrchestrator,\n  MemoryScopeKey,\n  ResolutionVerdict,\n  Tag\n} from '../../../index';\n\nconst noteKind: Kind = 'note' as Kind;\n\n/** A scope-qualified target for the note fixtures (all under the knowledge scope). */\nfunction kt(id: string): IEdgeTarget {\n  return { scope: 'knowledge' as MemoryScopeKey, id: id as MemoryId };\n}\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 registry(): IBodyConverterRegistry {\n  const reg = BodyConverterRegistry.create().orThrow();\n  reg.register(noteKind, Converters.string);\n  return reg;\n}\n\nconst codecs: ReadonlyMap<Kind, IIdentityCodec> = new Map<Kind, IIdentityCodec>([\n  [noteKind, new KnowledgeIdentityCodec()]\n]);\n\nfunction buildStore(): FileTreeMemoryStore {\n  return FileTreeMemoryStore.create({ root: mutableRoot(), registry: registry(), codecs }).orThrow();\n}\n\nasync function putFull(\n  store: FileTreeMemoryStore,\n  entityId: string,\n  body: string,\n  links: IMemoryEnvelope['links'] = []\n): Promise<void> {\n  const rec: IMemoryRecord<unknown> = {\n    envelope: {\n      id: entityId as MemoryId,\n      entityId: entityId as EntityId,\n      kind: noteKind,\n      tags: [],\n      links,\n      created: 0,\n      updated: 0,\n      seq: 0,\n      contentHash: '',\n      provenance: { source: 'agent' }\n    },\n    body\n  };\n  (await store.put(rec)).orThrow();\n}\n\nfunction classifier(fn: (item: IIngestItem) => Result<IMemoryClassification>): IMemoryClassifier {\n  return { classify: (item) => Promise.resolve(fn(item)) };\n}\nfunction extractor(\n  fn: (item: IIngestItem, c: IMemoryClassification) => Result<ReadonlyArray<ICandidateRecord>>\n): IFactExtractor {\n  return { extract: (item, c) => Promise.resolve(fn(item, c)) };\n}\nfunction relater(fn: (ctx: IRelationContext) => Result<ReadonlyArray<ICandidateEdge>>): IRelationExtractor {\n  return { relate: (ctx) => Promise.resolve(fn(ctx)) };\n}\nfunction resolver(\n  fn: (\n    candidate: ICandidateRecord,\n    similar: ReadonlyArray<IEntityResolutionCandidate>\n  ) => Result<ResolutionVerdict>\n): IEntityResolver {\n  return { resolve: (candidate, similar) => Promise.resolve(fn(candidate, similar)) };\n}\n\nconst classifyNote: IMemoryClassifier = classifier(() => succeed({ kind: noteKind }));\n\nfunction candidate(\n  entityId: string,\n  body: unknown,\n  links: ICandidateRecord['envelope']['links'] = []\n): ICandidateRecord {\n  return {\n    envelope: {\n      entityId: entityId as EntityId,\n      kind: noteKind,\n      tags: [],\n      links,\n      provenance: { source: 'agent' }\n    },\n    body\n  };\n}\n\nfunction candEdge(source: string, type: string, target: string): ICandidateEdge {\n  return { source: kt(source), edge: { type: type as never, target: kt(target) } };\n}\n\nfunction buildOrchestrator(params: {\n  store: FileTreeMemoryStore;\n  extractor: IFactExtractor;\n  relationExtractor: IRelationExtractor;\n  entityResolver?: IEntityResolver;\n}): MemoryIngestOrchestrator {\n  return MemoryIngestOrchestrator.create({\n    store: params.store,\n    registry: registry(),\n    codecs,\n    classifier: classifyNote,\n    extractor: params.extractor,\n    relationExtractor: params.relationExtractor,\n    entityResolver: params.entityResolver\n  }).orThrow();\n}\n\ndescribe('antagonist — cycle guard through EXISTING store edges (integration)', () => {\n  // Wrong impl this catches: an orchestrator that only feeds the cycle guard the\n  // proposed-edge batch (as its own pure-function unit tests do) and forgets to\n  // fold in the store snapshot's existing edges, so a cycle that closes THROUGH\n  // an already-persisted edge is silently admitted.\n  test('a proposed edge that closes a cycle through a pre-existing on-disk edge is rejected', async () => {\n    const store = buildStore();\n    // Existing on-disk edge: doc-a -> doc-b (persisted before this ingest runs).\n    await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel' as never, target: kt('doc-b') }]);\n    await putFull(store, 'doc-b', 'anchor-b');\n\n    // This ingest re-writes doc-b (a 'new'-verdict same-id update, since no\n    // resolver is wired) and proposes doc-b -> doc-a, which — unioned with the\n    // EXISTING doc-a -> doc-b edge — closes a 2-cycle that exists ONLY because of\n    // the on-disk edge, not anything proposed in this batch.\n    const orch = buildOrchestrator({\n      store,\n      extractor: extractor(() => succeed([candidate('doc-b', 'anchor-b-v2')])),\n      relationExtractor: relater(() => succeed([candEdge('doc-b', 'rel', 'doc-a')]))\n    });\n    expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/would create a cycle/);\n\n    // Confirm the guard fired BEFORE any write — doc-b's content must be unchanged.\n    expect(await store.get(noteKind, 'doc-b' as EntityId)).toSucceedAndSatisfy(\n      (rec: IMemoryRecord<unknown> | undefined) => expect(rec?.body).toBe('anchor-b')\n    );\n  });\n\n  test('a long existing chain plus one proposed edge closing the loop is rejected', async () => {\n    const store = buildStore();\n    // Existing chain: a -> b -> c -> d (four pre-existing on-disk edges spanning\n    // three hops), persisted before this ingest.\n    await putFull(store, 'chain-a', 'a', [{ type: 'rel' as never, target: kt('chain-b') }]);\n    await putFull(store, 'chain-b', 'b', [{ type: 'rel' as never, target: kt('chain-c') }]);\n    await putFull(store, 'chain-c', 'c', [{ type: 'rel' as never, target: kt('chain-d') }]);\n    await putFull(store, 'chain-d', 'd');\n\n    // Proposed: chain-d -> chain-a, closing the whole loop through the existing chain.\n    const orch = buildOrchestrator({\n      store,\n      extractor: extractor(() => succeed([candidate('chain-d', 'd-v2')])),\n      relationExtractor: relater(() => succeed([candEdge('chain-d', 'rel', 'chain-a')]))\n    });\n    expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/would create a cycle/);\n  });\n\n  test('cycleGuard \"off\" admits a cycle that closes through an existing edge', async () => {\n    const store = buildStore();\n    await putFull(store, 'doc-a', 'anchor-a', [{ type: 'rel' as never, target: kt('doc-b') }]);\n    await putFull(store, 'doc-b', 'anchor-b');\n    const orch = MemoryIngestOrchestrator.create({\n      store,\n      registry: registry(),\n      codecs,\n      classifier: classifyNote,\n      extractor: extractor(() => succeed([candidate('doc-b', 'anchor-b-v2')])),\n      relationExtractor: relater(() => succeed([candEdge('doc-b', 'rel', 'doc-a')])),\n      cycleGuard: 'off'\n    }).orThrow();\n    expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r: IIngestItemResult) => {\n      expect(r.records[0].record?.envelope.links).toEqual([{ type: 'rel', target: kt('doc-a') }]);\n    });\n  });\n});\n\ndescribe('antagonist — resolver target need not be a surfaced `similar` candidate (structural-only gate)', () => {\n  // Documents (and locks in) the actual contract: fgv validates a target-bearing\n  // verdict STRUCTURALLY (exists in the store + matching kind), uniformly across\n  // all three target-bearing verdicts, regardless of whether the resolver's\n  // choice was among the `similar` candidates it was shown. Wrong impl this\n  // guards against: fgv silently restricting itself to `similar` membership\n  // (which would incorrectly reject a host resolver with external knowledge), OR\n  // fgv skipping the structural check for one of the three verdicts.\n  test.each(['duplicate-of', 'supersede', 'merge-into'] as const)(\n    \"verdict '%s' targeting a valid existing record OUTSIDE the surfaced similar set is accepted\",\n    async (verdict) => {\n      const store = buildStore();\n      await putFull(store, 'doc-a', 'apple pie'); // will be surfaced as `similar`\n      await putFull(store, 'doc-q', 'unrelated target'); // exists, but never surfaced\n\n      const vectorIndex = InMemoryCosineIndex.create().orThrow();\n      const embed = (): Promise<Result<Float32Array>> =>\n        Promise.resolve(succeed(Float32Array.from([1, 0, 0])));\n      // Only doc-a is embedded/indexed; doc-q is never surfaced by similarity —\n      // it can only be reached by the resolver's own out-of-band choice.\n      (await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();\n\n      const orch = MemoryIngestOrchestrator.create({\n        store,\n        registry: registry(),\n        codecs,\n        classifier: classifyNote,\n        extractor: extractor(() => succeed([candidate('doc-b', 'apple tart')])),\n        relationExtractor: relater(() => succeed([])),\n        vectorIndex,\n        embed,\n        entityResolver: resolver(() => succeed({ verdict, target: kt('doc-q') } as ResolutionVerdict))\n      }).orThrow();\n\n      const result = await orch.ingestItem({ id: 'i', content: 'x' });\n      if (verdict === 'duplicate-of') {\n        expect(result).toSucceedAndSatisfy((r: IIngestItemResult) => {\n          expect(r.records[0].disposition).toBe('deduped');\n          expect(r.records[0].id).toBe('doc-q');\n        });\n      } else if (verdict === 'supersede') {\n        expect(result).toSucceedAndSatisfy((r: IIngestItemResult) => {\n          expect(r.records[0].disposition).toBe('written');\n          expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: kt('doc-q') });\n        });\n      } else {\n        expect(result).toSucceedAndSatisfy((r: IIngestItemResult) => {\n          expect(r.records[0].disposition).toBe('merged');\n          expect(r.records[0].id).toBe('doc-q');\n        });\n      }\n    }\n  );\n});\n\ndescribe('antagonist — enum-branch parity: uniform structural rejection across target-bearing verdicts', () => {\n  // A single table-driven test locking in that EVERY target-bearing verdict arm\n  // shares the SAME two structural checks (existence, then kind match) in the\n  // SAME order — the exact class of hole (\"only merge-into checked\") that a\n  // prior review caught. Wrong impl this guards against: a future edit that adds\n  // a fourth verdict or refactors validation per-branch and re-introduces an\n  // asymmetric gap.\n  const verdicts = ['duplicate-of', 'supersede', 'merge-into'] as const;\n\n  test.each(verdicts)(\n    \"verdict '%s' rejects a nonexistent target with the SAME message shape\",\n    async (verdict) => {\n      const store = buildStore();\n      await putFull(store, 'doc-a', 'apple pie');\n      const vectorIndex = InMemoryCosineIndex.create().orThrow();\n      const embed = (): Promise<Result<Float32Array>> =>\n        Promise.resolve(succeed(Float32Array.from([1, 0, 0])));\n      const orch = MemoryIngestOrchestrator.create({\n        store,\n        registry: registry(),\n        codecs,\n        classifier: classifyNote,\n        extractor: extractor(() => succeed([candidate('doc-b', 'apple tart')])),\n        relationExtractor: relater(() => succeed([])),\n        vectorIndex,\n        embed,\n        entityResolver: resolver(() => succeed({ verdict, target: kt('ghost') } as ResolutionVerdict))\n      }).orThrow();\n      (await vectorIndex.add(kt('doc-a'), Float32Array.from([1, 0, 0]))).orThrow();\n      expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(\n        `ingest 'i': ${verdict} target 'knowledge/ghost' does not exist in the store`\n      );\n    }\n  );\n\n  test.each(verdicts)(\n    \"verdict '%s' rejects a foreign-kind target with the SAME message shape\",\n    async (verdict) => {\n      const otherKind: Kind = 'other' as Kind;\n      const reg = registry();\n      reg.register(otherKind, Converters.string);\n      const otherCodecs: ReadonlyMap<Kind, IIdentityCodec> = new Map<Kind, IIdentityCodec>([\n        ...codecs,\n        [otherKind, new KnowledgeIdentityCodec()]\n      ]);\n      const store = FileTreeMemoryStore.create({\n        root: mutableRoot(),\n        registry: reg,\n        codecs: otherCodecs\n      }).orThrow();\n      const foreignRec: IMemoryRecord<unknown> = {\n        envelope: {\n          id: 'foreign-1' as MemoryId,\n          entityId: 'foreign-1' as EntityId,\n          kind: otherKind,\n          tags: [] as ReadonlyArray<Tag>,\n          links: [],\n          created: 0,\n          updated: 0,\n          seq: 0,\n          contentHash: '',\n          provenance: { source: 'agent' }\n        },\n        body: 'apple pie'\n      };\n      (await store.put(foreignRec)).orThrow();\n      const vectorIndex = InMemoryCosineIndex.create().orThrow();\n      const embed = (): Promise<Result<Float32Array>> =>\n        Promise.resolve(succeed(Float32Array.from([1, 0, 0])));\n      const orch = MemoryIngestOrchestrator.create({\n        store,\n        registry: reg,\n        codecs: otherCodecs,\n        classifier: classifyNote,\n        extractor: extractor(() => succeed([candidate('doc-b', 'apple tart')])),\n        relationExtractor: relater(() => succeed([])),\n        vectorIndex,\n        embed,\n        entityResolver: resolver(() => succeed({ verdict, target: kt('foreign-1') } as ResolutionVerdict))\n      }).orThrow();\n      (await vectorIndex.add(kt('foreign-1'), Float32Array.from([1, 0, 0]))).orThrow();\n      expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(\n        `ingest 'i': ${verdict} target 'knowledge/foreign-1' is kind 'other' but the candidate is kind 'note'`\n      );\n    }\n  );\n});\n"]}

package/lib/test/unit/ingest/cycleGuard.test.d.ts

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