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

package/dist/test/unit/retrieve/linkTraversalRetriever.test.js

@@ -1,257 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-import '@fgv/ts-utils-jest';
-import { LinkTraversalRetriever, LINK_TRAVERSAL_NO_SEED_MESSAGE, LINK_TRAVERSAL_UNWIRED_MESSAGE, MemoryIndex, envelopeConverter } from '../../../index';
-const DEFAULT_SCOPE = 'experience';
-/** A scope-qualified traversal seed (defaults to the fixture's default scope). */
-function seed(id, scope = DEFAULT_SCOPE) {
-    return { scope: scope, id: id };
-}
-function makeEntry(spec) {
-    var _a, _b, _c, _d, _e, _f;
-    const scope = (_a = spec.scope) !== null && _a !== void 0 ? _a : DEFAULT_SCOPE;
-    const record = {
-        envelope: envelopeConverter
-            .convert(Object.assign(Object.assign({ id: spec.id, entityId: spec.id, kind: (_b = spec.kind) !== null && _b !== void 0 ? _b : 'experience', tags: (_c = spec.tags) !== null && _c !== void 0 ? _c : [], 
-            // A bare link id defaults its target scope to the source record's own
-            // scope (the same-conversation case); an object carries an explicit scope.
-            links: ((_d = spec.links) !== null && _d !== void 0 ? _d : []).map((l) => typeof l === 'string'
-                ? { type: 'rel', target: { scope, id: l } }
-                : { type: 'rel', target: { scope: l.scope, id: l.id } }), created: 0, updated: (_e = spec.updated) !== null && _e !== void 0 ? _e : 0, seq: (_f = spec.seq) !== null && _f !== void 0 ? _f : 0, contentHash: 'h' }, (spec.rank !== undefined ? { rank: spec.rank } : {})), { provenance: { source: 'agent' } }))
-            .orThrow(),
-        body: `body-${spec.id}`
-    };
-    return { scope: scope, record };
-}
-function buildIndex(specs) {
-    const index = MemoryIndex.create().orThrow();
-    index.rebuild(specs.map(makeEntry)).orThrow();
-    return index;
-}
-function ids(records) {
-    return records.map((r) => r.envelope.id);
-}
-describe('LinkTraversalRetriever', () => {
-    test('reports the link-traversal capability', () => {
-        const index = buildIndex([]);
-        const retriever = LinkTraversalRetriever.create(index).orThrow();
-        expect(retriever.capabilities).toEqual({
-            supportsSemanticRecall: false,
-            supportsTemporalQuery: false,
-            supportsLinkTraversal: true
-        });
-    });
-    describe('outbound traversal (linkedFrom)', () => {
-        test('returns the direct outbound neighbors at the default single hop', async () => {
-            const index = buildIndex([
-                { id: 'a', links: ['b', 'c'] },
-                { id: 'b', updated: 20 },
-                { id: 'c', updated: 10 }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
-                // Recency-ordered: b (updated 20) before c (updated 10). 'a' (the seed) excluded.
-                expect(ids(records)).toEqual(['b', 'c']);
-            });
-        });
-        test('stops at the default single hop (does not reach 2-hop neighbors)', async () => {
-            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['b']);
-            });
-        });
-        test('follows multiple hops when hops is raised', async () => {
-            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 2 })).toSucceedAndSatisfy((records) => {
-                expect(ids(records).sort()).toEqual(['b', 'c']);
-            });
-        });
-    });
-    describe('orderBy axis', () => {
-        function seedIndex() {
-            // Seed 'a' links to three ranked neighbors. `rank` and `updated` are
-            // deliberately INVERTED so the rank order (n3,n2,n1) is the exact reverse of
-            // the recency order (n1,n2,n3) — proving orderBy actually re-sorts.
-            return buildIndex([
-                { id: 'a', links: ['n1', 'n3', 'n2'] },
-                { id: 'n1', rank: 1, updated: 300, seq: 1 },
-                { id: 'n3', rank: 3, updated: 100, seq: 3 },
-                { id: 'n2', rank: 2, updated: 200, seq: 2 }
-            ]);
-        }
-        test("orderBy 'rank' orders reached records by rank descending", async () => {
-            const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank' })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['n3', 'n2', 'n1']);
-            });
-        });
-        test('orderBy absent is unchanged recency order', async () => {
-            const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {
-                // Recency: most-recently-updated first → n1(300), n2(200), n3(100).
-                expect(ids(records)).toEqual(['n1', 'n2', 'n3']);
-            });
-        });
-        test("orderBy 'rank' composes with { limit, offset }", async () => {
-            const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank', limit: 1, offset: 1 })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['n2']);
-            });
-        });
-    });
-    describe('inbound traversal (linkedTo)', () => {
-        test('returns the records whose edges point at the seed (backlinks)', async () => {
-            const index = buildIndex([
-                { id: 'a', links: ['target'], updated: 30 },
-                { id: 'b', links: ['target'], updated: 10 },
-                { id: 'target' }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedTo: seed('target') })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['a', 'b']);
-            });
-        });
-        test('reaches ONLY the same-scope inbound source when a TARGET stem is reused across scopes', async () => {
-            // 'shared' exists in scope a and scope b; src-a@a links {a, shared} and
-            // src-b@b links {b, shared}. Seeding linkedTo {a, shared} must reach ONLY
-            // src-a — backlinks disambiguate on the target's (scope, id), not a bare id.
-            const index = buildIndex([
-                { id: 'src-a', scope: 'a', links: ['shared'], tags: ['src-a'] },
-                { id: 'src-b', scope: 'b', links: ['shared'], tags: ['src-b'] },
-                { id: 'shared', scope: 'a' },
-                { id: 'shared', scope: 'b' }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedTo: seed('shared', 'a') })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-                expect(records[0].envelope.tags).toEqual(['src-a']);
-            });
-            // Symmetric: seeding the b-scope target reaches only src-b.
-            expect(await retriever.retrieve({ linkedTo: seed('shared', 'b') })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-                expect(records[0].envelope.tags).toEqual(['src-b']);
-            });
-        });
-    });
-    describe('cycle safety', () => {
-        test('terminates on a self-loop and excludes the seed', async () => {
-            const index = buildIndex([{ id: 'a', links: ['a'] }]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 5 })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(0);
-            });
-        });
-        test('terminates on a multi-hop cycle without revisiting', async () => {
-            const index = buildIndex([
-                { id: 'a', links: ['b'] },
-                { id: 'b', links: ['c'] },
-                { id: 'c', links: ['a'] }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 10 })).toSucceedAndSatisfy((records) => {
-                // a→b→c→a: reaches b and c, then the edge back to the seed is pruned.
-                expect(ids(records).sort()).toEqual(['b', 'c']);
-            });
-        });
-    });
-    test('traverses a cross-kind edge (experience derivedFrom a knowledge doc)', async () => {
-        const index = buildIndex([
-            {
-                id: 'turn-5',
-                scope: 'conversations/conv-1',
-                kind: 'summarized-turn',
-                links: [{ id: 'doc-1', scope: 'knowledge' }]
-            },
-            { id: 'doc-1', scope: 'knowledge', kind: 'knowledge' }
-        ]);
-        const retriever = LinkTraversalRetriever.create(index).orThrow();
-        expect(await retriever.retrieve({ linkedFrom: seed('turn-5', 'conversations/conv-1') })).toSucceedAndSatisfy((records) => {
-            expect(ids(records)).toEqual(['doc-1']);
-            expect(records[0].envelope.kind).toBe('knowledge');
-        });
-    });
-    describe('post-filtering and bounds', () => {
-        test('applies the kind pre-filter to the reached records', async () => {
-            const index = buildIndex([
-                { id: 'a', links: ['b', 'c'] },
-                { id: 'b', kind: 'keep' },
-                { id: 'c', kind: 'drop' }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), kind: 'keep' })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['b']);
-            });
-        });
-        test('applies the limit after ordering', async () => {
-            const index = buildIndex([
-                { id: 'a', links: ['b', 'c', 'd'] },
-                { id: 'b', updated: 30 },
-                { id: 'c', updated: 20 },
-                { id: 'd', updated: 10 }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('a'), limit: 2 })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['b', 'c']);
-            });
-        });
-        test('returns empty when the seed is not in the index', async () => {
-            const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('missing') })).toSucceedWith([]);
-        });
-        test('reaches ONLY the same-scope target when an id is reused across scopes', async () => {
-            // 'seed' (scope a) links a bare 'dup' → the edge target is {scope a, id dup}.
-            // Two records share the stem 'dup' (scopes a and b); the scoped edge must
-            // reach ONLY dup@a, never dup@b — the whole point of scope-qualified targets.
-            const index = buildIndex([
-                { id: 'seed', scope: 'a', links: ['dup'] },
-                { id: 'dup', scope: 'a', tags: ['in-a'] },
-                { id: 'dup', scope: 'b', tags: ['in-b'] }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-                expect(records[0].envelope.tags).toEqual(['in-a']);
-            });
-        });
-        test('an explicit cross-scope edge reaches the other scope', async () => {
-            // The same fixture, but the edge names dup@b explicitly → traversal follows
-            // it to the b-scope record, proving explicit scope is honored verbatim.
-            const index = buildIndex([
-                { id: 'seed', scope: 'a', links: [{ id: 'dup', scope: 'b' }] },
-                { id: 'dup', scope: 'a', tags: ['in-a'] },
-                { id: 'dup', scope: 'b', tags: ['in-b'] }
-            ]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-                expect(records[0].envelope.tags).toEqual(['in-b']);
-            });
-        });
-    });
-    describe('loud degradation', () => {
-        test('fails when no seed (linkedFrom / linkedTo) is supplied', async () => {
-            const index = buildIndex([{ id: 'a' }]);
-            const retriever = LinkTraversalRetriever.create(index).orThrow();
-            expect(await retriever.retrieve({ hops: 2 })).toFailWith(LINK_TRAVERSAL_NO_SEED_MESSAGE);
-        });
-    });
-});
-describe('LINK_TRAVERSAL_UNWIRED_MESSAGE constant', () => {
-    test('has the stable public message non-link retrievers use to degrade loudly', () => {
-        // The link-traversal retriever supports the axis, so it never emits this
-        // message; the constant is the shared one the non-link v1 retrievers raise
-        // (asserted here to keep the public string stable).
-        expect(LINK_TRAVERSAL_UNWIRED_MESSAGE).toMatch(/link traversal requires a backlink index/i);
-    });
-    test('a link query against the link-capable retriever still succeeds', async () => {
-        const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);
-        const retriever = LinkTraversalRetriever.create(index).orThrow();
-        expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceed();
-    });
-});
-//# sourceMappingURL=linkTraversalRetriever.test.js.map

package/dist/test/unit/retrieve/linkTraversalRetriever.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"linkTraversalRetriever.test.js","sourceRoot":"","sources":["../../../../src/test/unit/retrieve/linkTraversalRetriever.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAKL,sBAAsB,EACtB,8BAA8B,EAC9B,8BAA8B,EAE9B,WAAW,EAEX,iBAAiB,EAClB,MAAM,gBAAgB,CAAC;AAExB,MAAM,aAAa,GAAW,YAAY,CAAC;AAgB3C,kFAAkF;AAClF,SAAS,IAAI,CAAC,EAAU,EAAE,QAAgB,aAAa;IACrD,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED,SAAS,SAAS,CAAC,IAAgB;;IACjC,MAAM,KAAK,GAAW,MAAA,IAAI,CAAC,KAAK,mCAAI,aAAa,CAAC;IAClD,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,iBAAiB;aACxB,OAAO,+BACN,EAAE,EAAE,IAAI,CAAC,EAAE,EACX,QAAQ,EAAE,IAAI,CAAC,EAAE,EACjB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,YAAY,EAC/B,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,EAAE;YACrB,sEAAsE;YACtE,2EAA2E;YAC3E,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,OAAO,CAAC,KAAK,QAAQ;gBACnB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC3C,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAC1D,EACD,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,KAAuB,EAAE,MAAM,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,UAAU,CAAC,KAAgC;IAClD,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,OAAO,KAAK,CAAC;AACf,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,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;YACrC,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,IAAI;SAC5B,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC/C,IAAI,CAAC,iEAAiE,EAAE,KAAK,IAAI,EAAE;YACjF,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAC9B,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;aACzB,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC1F,kFAAkF;gBAClF,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;YAClF,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9F,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC1F,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9F,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACnG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,SAAS,SAAS;YAChB,qEAAqE;YACrE,6EAA6E;YAC7E,oEAAoE;YACpE,OAAO,UAAU,CAAC;gBAChB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;gBACtC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC3C,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC3C,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;aAC5C,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;YAC1E,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC9F,CAAC,OAAO,EAAE,EAAE;gBACV,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACnD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC1F,oEAAoE;gBACpE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACnD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;YAChE,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACvE,MAAM,CACJ,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAC1F,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAChC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC5C,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;YAC/E,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;gBAC3C,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;gBAC3C,EAAE,EAAE,EAAE,QAAQ,EAAE;aACjB,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC7F,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uFAAuF,EAAE,KAAK,IAAI,EAAE;YACvG,wEAAwE;YACxE,0EAA0E;YAC1E,6EAA6E;YAC7E,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;gBAC/D,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;gBAC/D,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;gBAC5B,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE;aAC7B,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;YACH,4DAA4D;YAC5D,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;YACjE,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACnG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;gBACzB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;gBACzB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;aAC1B,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACpG,sEAAsE;gBACtE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;QACtF,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB;gBACE,EAAE,EAAE,QAAQ;gBACZ,KAAK,EAAE,sBAAsB;gBAC7B,IAAI,EAAE,iBAAiB;gBACvB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;aAC7C;YACD,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE;SACvD,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACjE,MAAM,CACJ,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,sBAAsB,CAAC,EAAE,CAAC,CACjF,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACzC,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAC9B,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE;gBACzB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE;aAC1B,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CACJ,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAyB,EAAE,CAAC,CACrF,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAChC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;YAClD,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;gBACnC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;aACzB,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACpG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;YACjE,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACtF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uEAAuE,EAAE,KAAK,IAAI,EAAE;YACvF,8EAA8E;YAC9E,0EAA0E;YAC1E,8EAA8E;YAC9E,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,EAAE;gBAC1C,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE;gBACzC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE;aAC1C,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;YACtE,4EAA4E;YAC5E,wEAAwE;YACxE,MAAM,KAAK,GAAG,UAAU,CAAC;gBACvB,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC9D,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE;gBACzC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE;aAC1C,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,8BAA8B,CAAC,CAAC;QAC3F,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAI,CAAC,yEAAyE,EAAE,GAAG,EAAE;QACnF,yEAAyE;QACzE,2EAA2E;QAC3E,oDAAoD;QACpD,MAAM,CAAC,8BAA8B,CAAC,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAChF,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACnE,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACjE,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC1E,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  LinkTraversalRetriever,\n  LINK_TRAVERSAL_NO_SEED_MESSAGE,\n  LINK_TRAVERSAL_UNWIRED_MESSAGE,\n  MemoryId,\n  MemoryIndex,\n  MemoryScopeKey,\n  envelopeConverter\n} from '../../../index';\n\nconst DEFAULT_SCOPE: string = 'experience';\n\n/** A link target authored either as a bare id (same-scope) or an explicit `(scope, id)`. */\ntype LinkSpec = string | { readonly id: string; readonly scope: string };\n\ninterface IEntrySpec {\n  readonly id: string;\n  readonly scope?: string;\n  readonly kind?: string;\n  readonly tags?: ReadonlyArray<string>;\n  readonly updated?: number;\n  readonly seq?: number;\n  readonly links?: ReadonlyArray<LinkSpec>;\n  readonly rank?: number;\n}\n\n/** A scope-qualified traversal seed (defaults to the fixture's default scope). */\nfunction seed(id: string, scope: string = DEFAULT_SCOPE): IEdgeTarget {\n  return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\nfunction makeEntry(spec: IEntrySpec): IIndexedMemoryRecord {\n  const scope: string = spec.scope ?? DEFAULT_SCOPE;\n  const record: IMemoryRecord<unknown> = {\n    envelope: envelopeConverter\n      .convert({\n        id: spec.id,\n        entityId: spec.id,\n        kind: spec.kind ?? 'experience',\n        tags: spec.tags ?? [],\n        // A bare link id defaults its target scope to the source record's own\n        // scope (the same-conversation case); an object carries an explicit scope.\n        links: (spec.links ?? []).map((l) =>\n          typeof l === 'string'\n            ? { type: 'rel', target: { scope, id: l } }\n            : { type: 'rel', target: { scope: l.scope, id: l.id } }\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: scope as MemoryScopeKey, record };\n}\n\nfunction buildIndex(specs: ReadonlyArray<IEntrySpec>): MemoryIndex {\n  const index = MemoryIndex.create().orThrow();\n  index.rebuild(specs.map(makeEntry)).orThrow();\n  return index;\n}\n\nfunction ids(records: ReadonlyArray<IMemoryRecord<unknown>>): string[] {\n  return records.map((r) => r.envelope.id as string);\n}\n\ndescribe('LinkTraversalRetriever', () => {\n  test('reports the link-traversal capability', () => {\n    const index = buildIndex([]);\n    const retriever = LinkTraversalRetriever.create(index).orThrow();\n    expect(retriever.capabilities).toEqual({\n      supportsSemanticRecall: false,\n      supportsTemporalQuery: false,\n      supportsLinkTraversal: true\n    });\n  });\n\n  describe('outbound traversal (linkedFrom)', () => {\n    test('returns the direct outbound neighbors at the default single hop', async () => {\n      const index = buildIndex([\n        { id: 'a', links: ['b', 'c'] },\n        { id: 'b', updated: 20 },\n        { id: 'c', updated: 10 }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {\n        // Recency-ordered: b (updated 20) before c (updated 10). 'a' (the seed) excluded.\n        expect(ids(records)).toEqual(['b', 'c']);\n      });\n    });\n\n    test('stops at the default single hop (does not reach 2-hop neighbors)', async () => {\n      const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {\n        expect(ids(records)).toEqual(['b']);\n      });\n    });\n\n    test('follows multiple hops when hops is raised', async () => {\n      const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b', links: ['c'] }, { id: 'c' }]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 2 })).toSucceedAndSatisfy((records) => {\n        expect(ids(records).sort()).toEqual(['b', 'c']);\n      });\n    });\n  });\n\n  describe('orderBy axis', () => {\n    function seedIndex(): MemoryIndex {\n      // Seed 'a' links to three ranked neighbors. `rank` and `updated` are\n      // deliberately INVERTED so the rank order (n3,n2,n1) is the exact reverse of\n      // the recency order (n1,n2,n3) — proving orderBy actually re-sorts.\n      return buildIndex([\n        { id: 'a', links: ['n1', 'n3', 'n2'] },\n        { id: 'n1', rank: 1, updated: 300, seq: 1 },\n        { id: 'n3', rank: 3, updated: 100, seq: 3 },\n        { id: 'n2', rank: 2, updated: 200, seq: 2 }\n      ]);\n    }\n\n    test(\"orderBy 'rank' orders reached records by rank descending\", async () => {\n      const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank' })).toSucceedAndSatisfy(\n        (records) => {\n          expect(ids(records)).toEqual(['n3', 'n2', 'n1']);\n        }\n      );\n    });\n\n    test('orderBy absent is unchanged recency order', async () => {\n      const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceedAndSatisfy((records) => {\n        // Recency: most-recently-updated first → n1(300), n2(200), n3(100).\n        expect(ids(records)).toEqual(['n1', 'n2', 'n3']);\n      });\n    });\n\n    test(\"orderBy 'rank' composes with { limit, offset }\", async () => {\n      const retriever = LinkTraversalRetriever.create(seedIndex()).orThrow();\n      expect(\n        await retriever.retrieve({ linkedFrom: seed('a'), orderBy: 'rank', limit: 1, offset: 1 })\n      ).toSucceedAndSatisfy((records) => {\n        expect(ids(records)).toEqual(['n2']);\n      });\n    });\n  });\n\n  describe('inbound traversal (linkedTo)', () => {\n    test('returns the records whose edges point at the seed (backlinks)', async () => {\n      const index = buildIndex([\n        { id: 'a', links: ['target'], updated: 30 },\n        { id: 'b', links: ['target'], updated: 10 },\n        { id: 'target' }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedTo: seed('target') })).toSucceedAndSatisfy((records) => {\n        expect(ids(records)).toEqual(['a', 'b']);\n      });\n    });\n\n    test('reaches ONLY the same-scope inbound source when a TARGET stem is reused across scopes', async () => {\n      // 'shared' exists in scope a and scope b; src-a@a links {a, shared} and\n      // src-b@b links {b, shared}. Seeding linkedTo {a, shared} must reach ONLY\n      // src-a — backlinks disambiguate on the target's (scope, id), not a bare id.\n      const index = buildIndex([\n        { id: 'src-a', scope: 'a', links: ['shared'], tags: ['src-a'] },\n        { id: 'src-b', scope: 'b', links: ['shared'], tags: ['src-b'] },\n        { id: 'shared', scope: 'a' },\n        { id: 'shared', scope: 'b' }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedTo: seed('shared', 'a') })).toSucceedAndSatisfy((records) => {\n        expect(records).toHaveLength(1);\n        expect(records[0].envelope.tags).toEqual(['src-a']);\n      });\n      // Symmetric: seeding the b-scope target reaches only src-b.\n      expect(await retriever.retrieve({ linkedTo: seed('shared', 'b') })).toSucceedAndSatisfy((records) => {\n        expect(records).toHaveLength(1);\n        expect(records[0].envelope.tags).toEqual(['src-b']);\n      });\n    });\n  });\n\n  describe('cycle safety', () => {\n    test('terminates on a self-loop and excludes the seed', async () => {\n      const index = buildIndex([{ id: 'a', links: ['a'] }]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 5 })).toSucceedAndSatisfy((records) => {\n        expect(records).toHaveLength(0);\n      });\n    });\n\n    test('terminates on a multi-hop cycle without revisiting', async () => {\n      const index = buildIndex([\n        { id: 'a', links: ['b'] },\n        { id: 'b', links: ['c'] },\n        { id: 'c', links: ['a'] }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a'), hops: 10 })).toSucceedAndSatisfy((records) => {\n        // a→b→c→a: reaches b and c, then the edge back to the seed is pruned.\n        expect(ids(records).sort()).toEqual(['b', 'c']);\n      });\n    });\n  });\n\n  test('traverses a cross-kind edge (experience derivedFrom a knowledge doc)', async () => {\n    const index = buildIndex([\n      {\n        id: 'turn-5',\n        scope: 'conversations/conv-1',\n        kind: 'summarized-turn',\n        links: [{ id: 'doc-1', scope: 'knowledge' }]\n      },\n      { id: 'doc-1', scope: 'knowledge', kind: 'knowledge' }\n    ]);\n    const retriever = LinkTraversalRetriever.create(index).orThrow();\n    expect(\n      await retriever.retrieve({ linkedFrom: seed('turn-5', 'conversations/conv-1') })\n    ).toSucceedAndSatisfy((records) => {\n      expect(ids(records)).toEqual(['doc-1']);\n      expect(records[0].envelope.kind).toBe('knowledge');\n    });\n  });\n\n  describe('post-filtering and bounds', () => {\n    test('applies the kind pre-filter to the reached records', async () => {\n      const index = buildIndex([\n        { id: 'a', links: ['b', 'c'] },\n        { id: 'b', kind: 'keep' },\n        { id: 'c', kind: 'drop' }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(\n        await retriever.retrieve({ linkedFrom: seed('a'), kind: 'keep' as unknown as Kind })\n      ).toSucceedAndSatisfy((records) => {\n        expect(ids(records)).toEqual(['b']);\n      });\n    });\n\n    test('applies the limit after ordering', async () => {\n      const index = buildIndex([\n        { id: 'a', links: ['b', 'c', 'd'] },\n        { id: 'b', updated: 30 },\n        { id: 'c', updated: 20 },\n        { id: 'd', updated: 10 }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('a'), limit: 2 })).toSucceedAndSatisfy((records) => {\n        expect(ids(records)).toEqual(['b', 'c']);\n      });\n    });\n\n    test('returns empty when the seed is not in the index', async () => {\n      const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('missing') })).toSucceedWith([]);\n    });\n\n    test('reaches ONLY the same-scope target when an id is reused across scopes', async () => {\n      // 'seed' (scope a) links a bare 'dup' → the edge target is {scope a, id dup}.\n      // Two records share the stem 'dup' (scopes a and b); the scoped edge must\n      // reach ONLY dup@a, never dup@b — the whole point of scope-qualified targets.\n      const index = buildIndex([\n        { id: 'seed', scope: 'a', links: ['dup'] },\n        { id: 'dup', scope: 'a', tags: ['in-a'] },\n        { id: 'dup', scope: 'b', tags: ['in-b'] }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {\n        expect(records).toHaveLength(1);\n        expect(records[0].envelope.tags).toEqual(['in-a']);\n      });\n    });\n\n    test('an explicit cross-scope edge reaches the other scope', async () => {\n      // The same fixture, but the edge names dup@b explicitly → traversal follows\n      // it to the b-scope record, proving explicit scope is honored verbatim.\n      const index = buildIndex([\n        { id: 'seed', scope: 'a', links: [{ id: 'dup', scope: 'b' }] },\n        { id: 'dup', scope: 'a', tags: ['in-a'] },\n        { id: 'dup', scope: 'b', tags: ['in-b'] }\n      ]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ linkedFrom: seed('seed', 'a') })).toSucceedAndSatisfy((records) => {\n        expect(records).toHaveLength(1);\n        expect(records[0].envelope.tags).toEqual(['in-b']);\n      });\n    });\n  });\n\n  describe('loud degradation', () => {\n    test('fails when no seed (linkedFrom / linkedTo) is supplied', async () => {\n      const index = buildIndex([{ id: 'a' }]);\n      const retriever = LinkTraversalRetriever.create(index).orThrow();\n      expect(await retriever.retrieve({ hops: 2 })).toFailWith(LINK_TRAVERSAL_NO_SEED_MESSAGE);\n    });\n  });\n});\n\ndescribe('LINK_TRAVERSAL_UNWIRED_MESSAGE constant', () => {\n  test('has the stable public message non-link retrievers use to degrade loudly', () => {\n    // The link-traversal retriever supports the axis, so it never emits this\n    // message; the constant is the shared one the non-link v1 retrievers raise\n    // (asserted here to keep the public string stable).\n    expect(LINK_TRAVERSAL_UNWIRED_MESSAGE).toMatch(/link traversal requires a backlink index/i);\n  });\n\n  test('a link query against the link-capable retriever still succeeds', async () => {\n    const index = buildIndex([{ id: 'a', links: ['b'] }, { id: 'b' }]);\n    const retriever = LinkTraversalRetriever.create(index).orThrow();\n    expect(await retriever.retrieve({ linkedFrom: seed('a') })).toSucceed();\n  });\n});\n"]}