@fgv/ts-agent-memory 5.1.0-39 → 5.1.0-41

package/lib/test/unit/retrieve/retrievers.test.js

@@ -7,22 +7,15 @@ Object.defineProperty(exports, "__esModule", { value: true });
 require("@fgv/ts-utils-jest");
 const ts_utils_1 = require("@fgv/ts-utils");
 const index_1 = require("../../../index");
+/** A scope-qualified link-traversal seed for the retriever tests. */
+function et(id, scope = 'knowledge') {
+    return { scope: scope, id: id };
+}
 function makeEntry(spec) {
     var _a, _b, _c, _d, _e;
     const record = {
         envelope: index_1.envelopeConverter
-            .convert({
-            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: [],
-            created: 0,
-            updated: (_c = spec.updated) !== null && _c !== void 0 ? _c : 0,
-            seq: (_d = spec.seq) !== null && _d !== void 0 ? _d : 0,
-            contentHash: 'h',
-            provenance: { source: 'agent' }
-        })
+            .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: [], created: 0, updated: (_c = spec.updated) !== null && _c !== void 0 ? _c : 0, seq: (_d = spec.seq) !== null && _d !== void 0 ? _d : 0, contentHash: 'h' }, (spec.rank !== undefined ? { rank: spec.rank } : {})), { provenance: { source: 'agent' } }))
             .orThrow(),
         body: `body-${spec.id}`
     };
@@ -57,12 +50,12 @@ describe('retrieve helpers', () => {
             expect((0, index_1.guardRetrieverCapabilities)({ asOf: 5, kind: knowledge }, noCaps)).toFailWith(/none configured for kind knowledge/i);
         });
         test('fails loudly when a link-traversal axis is requested but unsupported', () => {
-            expect((0, index_1.guardRetrieverCapabilities)({ linkedTo: 'x' }, noCaps)).toFailWith(/link traversal requires a backlink index; none configured/i);
-            expect((0, index_1.guardRetrieverCapabilities)({ linkedFrom: 'x' }, noCaps)).toFailWith(/link traversal requires/i);
+            expect((0, index_1.guardRetrieverCapabilities)({ linkedTo: et('x') }, noCaps)).toFailWith(/link traversal requires a backlink index; none configured/i);
+            expect((0, index_1.guardRetrieverCapabilities)({ linkedFrom: et('x') }, noCaps)).toFailWith(/link traversal requires/i);
             expect((0, index_1.guardRetrieverCapabilities)({ hops: 2 }, noCaps)).toFailWith(/link traversal requires/i);
         });
         test('passes a link-traversal axis when the capability is supported', () => {
-            expect((0, index_1.guardRetrieverCapabilities)({ linkedTo: 'x' }, Object.assign(Object.assign({}, noCaps), { supportsLinkTraversal: true }))).toSucceed();
+            expect((0, index_1.guardRetrieverCapabilities)({ linkedTo: et('x') }, Object.assign(Object.assign({}, noCaps), { supportsLinkTraversal: true }))).toSucceed();
         });
     });
     describe('limitRecords', () => {
@@ -79,6 +72,25 @@ describe('retrieve helpers', () => {
             expect((0, index_1.limitRecords)(records, 0)).toEqual([]);
             expect((0, index_1.limitRecords)(records, -1)).toEqual([]);
         });
+        test('an absent offset is a no-op (byte-identical to today) — same reference returned', () => {
+            expect((0, index_1.limitRecords)(records, undefined, undefined)).toBe(records);
+            expect((0, index_1.limitRecords)(records, 2, undefined)).toHaveLength(2);
+            // A non-positive offset is guarded like a non-positive limit — no skip.
+            expect((0, index_1.limitRecords)(records, undefined, 0)).toBe(records);
+            expect(ids((0, index_1.limitRecords)(records, undefined, -5))).toEqual(['a', 'b', 'c']);
+        });
+        test('offset skips after ordering; { offset, limit } is a stable page window', () => {
+            expect(ids((0, index_1.limitRecords)(records, undefined, 1))).toEqual(['b', 'c']);
+            expect(ids((0, index_1.limitRecords)(records, 1, 1))).toEqual(['b']);
+            expect(ids((0, index_1.limitRecords)(records, 2, 1))).toEqual(['b', 'c']);
+        });
+        test('an offset past the end yields an empty page (never a throw)', () => {
+            expect((0, index_1.limitRecords)(records, undefined, 3)).toEqual([]);
+            expect((0, index_1.limitRecords)(records, 5, 99)).toEqual([]);
+        });
+        test('a non-positive limit still wins over an offset window', () => {
+            expect((0, index_1.limitRecords)(records, 0, 1)).toEqual([]);
+        });
     });
 });
 describe('RecencyRetriever', () => {
@@ -144,7 +156,200 @@ describe('RecencyRetriever', () => {
     });
     test('degrades loudly on a link-traversal request', async () => {
         const r = index_1.RecencyRetriever.create(buildIndex([{ id: 'a' }])).orThrow();
-        expect(await r.retrieve({ linkedTo: 'a' })).toFailWith(/link traversal requires/i);
+        expect(await r.retrieve({ linkedTo: et('a') })).toFailWith(/link traversal requires/i);
+    });
+});
+describe('orderBy: rank axis', () => {
+    const a1 = makeEntry({ id: 'a', rank: 1, updated: 100, seq: 1 }).record;
+    const b3 = makeEntry({ id: 'b', rank: 3, updated: 100, seq: 2 }).record;
+    const c2 = makeEntry({ id: 'c', rank: 2, updated: 100, seq: 3 }).record;
+    const unranked = makeEntry({ id: 'z', updated: 999, seq: 4 }).record;
+    describe('rankCompare', () => {
+        test('orders by rank descending', () => {
+            expect([a1, b3, c2]
+                .slice()
+                .sort(index_1.rankCompare)
+                .map((r) => r.envelope.id)).toEqual(['b', 'c', 'a']);
+        });
+        test('places an absent-rank record last regardless of recency', () => {
+            // `unranked` has the newest `updated`, but an absent rank sorts after every ranked record.
+            expect([unranked, a1, b3]
+                .slice()
+                .sort(index_1.rankCompare)
+                .map((r) => r.envelope.id)).toEqual(['b', 'a', 'z']);
+            // Symmetric: absent on the left side of the compare too.
+            expect([a1, unranked]
+                .slice()
+                .sort(index_1.rankCompare)
+                .map((r) => r.envelope.id)).toEqual(['a', 'z']);
+        });
+        test('breaks an equal-rank tie by recency', () => {
+            const b3b = makeEntry({ id: 'b2', rank: 3, updated: 50, seq: 9 }).record;
+            // Equal rank 3 → newer `updated` (b3 at 100) first.
+            expect([b3b, b3]
+                .slice()
+                .sort(index_1.rankCompare)
+                .map((r) => r.envelope.id)).toEqual(['b', 'b2']);
+        });
+    });
+    describe('orderingCompare', () => {
+        test("returns recencyCompare for absent orderBy and 'recency'", () => {
+            expect((0, index_1.orderingCompare)()).toBe(index_1.recencyCompare);
+            expect((0, index_1.orderingCompare)('recency')).toBe(index_1.recencyCompare);
+        });
+        test("returns rankCompare for 'rank'", () => {
+            expect((0, index_1.orderingCompare)('rank')).toBe(index_1.rankCompare);
+        });
+    });
+    describe.each([
+        ['RecencyRetriever', (index) => index_1.RecencyRetriever.create(index).orThrow()],
+        ['TagRetriever', (index) => index_1.TagRetriever.create(index).orThrow()],
+        [
+            'StructuredFilterRetriever',
+            (index) => index_1.StructuredFilterRetriever.create(index).orThrow()
+        ]
+    ])('%s honors orderBy', (name, make) => {
+        // Tag / structured-filter need their axis present to return anything.
+        const axis = name === 'TagRetriever'
+            ? { tag: 'x' }
+            : name === 'StructuredFilterRetriever'
+                ? { filter: () => true }
+                : {};
+        function orderedIndex() {
+            return buildIndex([
+                { id: 'a', rank: 1, tags: ['x'], updated: 100, seq: 1 },
+                { id: 'b', rank: 3, tags: ['x'], updated: 100, seq: 2 },
+                { id: 'c', rank: 2, tags: ['x'], updated: 100, seq: 3 },
+                { id: 'z', tags: ['x'], updated: 999, seq: 4 }
+            ]);
+        }
+        test("orderBy 'rank' orders by rank descending, absent last", async () => {
+            const r = make(orderedIndex());
+            expect(await r.retrieve(Object.assign(Object.assign({}, axis), { orderBy: 'rank' }))).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b', 'c', 'a', 'z']);
+            });
+        });
+        test('orderBy absent is unchanged recency order', async () => {
+            const r = make(orderedIndex());
+            expect(await r.retrieve(Object.assign({}, axis))).toSucceedAndSatisfy((records) => {
+                // `z` has the newest `updated`; the rest tie on `updated` and break by
+                // seq descending (c=3, b=2, a=1) — recency order regardless of rank.
+                expect(ids(records)).toEqual(['z', 'c', 'b', 'a']);
+            });
+        });
+        test('rank ordering composes with { limit, offset } for a bounded top-M page', async () => {
+            const r = make(orderedIndex());
+            expect(await r.retrieve(Object.assign(Object.assign({}, axis), { orderBy: 'rank', limit: 1, offset: 1 }))).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['c']);
+            });
+        });
+    });
+    test("HybridRetriever re-orders the merged set by rank for orderBy 'rank'", async () => {
+        const index = buildIndex([
+            { id: 'a', rank: 1, tags: ['x'], updated: 100, seq: 1 },
+            { id: 'b', rank: 3, tags: ['x'], updated: 100, seq: 2 },
+            { id: 'c', rank: 2, tags: ['x'], updated: 100, seq: 3 }
+        ]);
+        const hybrid = index_1.HybridRetriever.create([index_1.RecencyRetriever.create(index).orThrow(), index_1.TagRetriever.create(index).orThrow()], index_1.ScoreUnionMergeStrategy.create().orThrow()).orThrow();
+        expect(await hybrid.retrieve({ tag: 'x', orderBy: 'rank' })).toSucceedAndSatisfy((records) => {
+            // All three score 2 (surfaced by both children); orderBy rank re-sorts the merge.
+            expect(ids(records)).toEqual(['b', 'c', 'a']);
+        });
+    });
+    test("SemanticRetriever preserves vector-similarity order regardless of orderBy 'rank'", async () => {
+        const index = buildIndex([
+            { id: 'a', rank: 9, updated: 1 },
+            { id: 'b', rank: 1, updated: 1 }
+        ]);
+        const vectorIndex = {
+            add: (t) => Promise.resolve((0, ts_utils_1.succeed)(`ref-${t.id}`)),
+            remove: (t) => Promise.resolve((0, ts_utils_1.succeed)(t)),
+            query: () => Promise.resolve((0, ts_utils_1.succeed)([
+                { target: et('b'), score: 0.9 },
+                { target: et('a'), score: 0.5 }
+            ]))
+        };
+        const r = index_1.SemanticRetriever.create({
+            index,
+            backend: {
+                vectorIndex,
+                embedQuery: () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([0.1])))
+            }
+        }).orThrow();
+        // Even though `a` has the higher rank, semantic keeps the similarity order (b before a).
+        expect(await r.retrieve({ semantic: 'q', orderBy: 'rank' })).toSucceedAndSatisfy((records) => {
+            expect(ids(records)).toEqual(['b', 'a']);
+        });
+    });
+});
+describe('query axes: kinds (kind-set) and offset', () => {
+    function multiKindRetriever() {
+        return index_1.RecencyRetriever.create(buildIndex([
+            { id: 'k1', kind: 'knowledge', updated: 40 },
+            { id: 'n1', kind: 'note', updated: 30 },
+            { id: 'e1', kind: 'event', updated: 20 },
+            { id: 'k2', kind: 'knowledge', updated: 10 }
+        ])).orThrow();
+    }
+    describe('kinds', () => {
+        test("an absent kinds axis imposes no kind constraint (today's behavior)", async () => {
+            expect(await multiKindRetriever().retrieve({})).toSucceedAndSatisfy((records) => {
+                expect([...ids(records)].sort()).toEqual(['e1', 'k1', 'k2', 'n1']);
+            });
+        });
+        test('restricts to records in ANY of the listed kinds', async () => {
+            expect(await multiKindRetriever().retrieve({
+                kinds: ['knowledge', 'event']
+            })).toSucceedAndSatisfy((records) => {
+                expect([...ids(records)].sort()).toEqual(['e1', 'k1', 'k2']);
+            });
+        });
+        test('an explicit empty kinds array matches NOTHING (not match-all)', async () => {
+            expect(await multiKindRetriever().retrieve({ kinds: [] })).toSucceedWith([]);
+        });
+        test('kind and kinds compose as AND (kind must be a member of kinds)', async () => {
+            // kind=knowledge AND kinds includes knowledge → knowledge records only.
+            expect(await multiKindRetriever().retrieve({
+                kind: knowledge,
+                kinds: ['knowledge', 'note']
+            })).toSucceedAndSatisfy((records) => {
+                expect([...ids(records)].sort()).toEqual(['k1', 'k2']);
+            });
+            // kind=knowledge but kinds excludes knowledge → nothing can satisfy both.
+            expect(await multiKindRetriever().retrieve({
+                kind: knowledge,
+                kinds: ['note', 'event']
+            })).toSucceedWith([]);
+        });
+    });
+    describe('offset', () => {
+        function ordered() {
+            return index_1.RecencyRetriever.create(buildIndex([
+                { id: 'a', updated: 10 },
+                { id: 'b', updated: 40 },
+                { id: 'c', updated: 30 },
+                { id: 'd', updated: 20 }
+            ])).orThrow();
+        }
+        test('skips after ordering, forming a stable { offset, limit } page window', async () => {
+            // Recency order is [b, c, d, a].
+            expect(await ordered().retrieve({ offset: 1, limit: 2 })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['c', 'd']);
+            });
+        });
+        test('an absent offset is unchanged from today', async () => {
+            expect(await ordered().retrieve({ limit: 2 })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b', 'c']);
+            });
+        });
+        test('an offset past the end yields an empty page', async () => {
+            expect(await ordered().retrieve({ offset: 99 })).toSucceedWith([]);
+        });
+        test('a negative offset does not slip into slice (treated as no skip)', async () => {
+            expect(await ordered().retrieve({ offset: -3, limit: 2 })).toSucceedAndSatisfy((records) => {
+                expect(ids(records)).toEqual(['b', 'c']);
+            });
+        });
     });
 });
 /** A retriever with configurable capabilities that records the query it received. */
@@ -199,11 +404,11 @@ class FakeVectorIndex {
         this._hits = hits;
         this._failQuery = failQuery;
     }
-    add(id) {
-        return Promise.resolve((0, ts_utils_1.succeed)(`ref-${id}`));
+    add(t) {
+        return Promise.resolve((0, ts_utils_1.succeed)(`ref-${t.id}`));
     }
-    remove(id) {
-        return Promise.resolve((0, ts_utils_1.succeed)(id));
+    remove(t) {
+        return Promise.resolve((0, ts_utils_1.succeed)(t));
     }
     query(__vector, topK) {
         this.lastTopK = topK;
@@ -245,8 +450,8 @@ describe('SemanticRetriever', () => {
             index,
             backend: {
                 vectorIndex: new FakeVectorIndex([
-                    { id: 'b', score: 0.9 },
-                    { id: 'a', score: 0.5 }
+                    { target: et('b'), score: 0.9 },
+                    { target: et('a'), score: 0.5 }
                 ]),
                 embedQuery: okEmbed
             }
@@ -265,9 +470,9 @@ describe('SemanticRetriever', () => {
             index,
             backend: {
                 vectorIndex: new FakeVectorIndex([
-                    { id: 'gone', score: 0.99 },
-                    { id: 'b', score: 0.8 },
-                    { id: 'a', score: 0.7 }
+                    { target: et('gone'), score: 0.99 },
+                    { target: et('b'), score: 0.8 },
+                    { target: et('a'), score: 0.7 }
                 ]),
                 embedQuery: okEmbed
             }
@@ -276,12 +481,37 @@ describe('SemanticRetriever', () => {
             expect(ids(records)).toEqual(['a']);
         });
     });
+    test('resolves a hit to the correctly-scoped record when two records share an id stem across scopes', async () => {
+        // Two records with the identical stem `turn-3` under different scopes — the
+        // exact same-stem-across-scopes collision the scope-qualified hit fixes. The
+        // retriever must re-resolve each hit through its full `(scope, id)` key, not a
+        // bare id (which would ambiguously match either record).
+        const index = buildIndex([
+            { id: 'turn-3', scope: 'conv-a', tags: ['from-a'] },
+            { id: 'turn-3', scope: 'conv-b', tags: ['from-b'] }
+        ]);
+        const r = index_1.SemanticRetriever.create({
+            index,
+            backend: {
+                // The vector backend scored the conv-b record; the retriever must return
+                // exactly that record, never the same-stem conv-a record.
+                vectorIndex: new FakeVectorIndex([{ target: et('turn-3', 'conv-b'), score: 0.9 }]),
+                embedQuery: okEmbed
+            }
+        }).orThrow();
+        expect(await r.retrieve({ semantic: 'q' })).toSucceedAndSatisfy((records) => {
+            expect(records).toHaveLength(1);
+            expect(records[0].envelope.id).toBe('turn-3');
+            // The tag proves it is the conv-b record, not the same-stem conv-a one.
+            expect(records[0].envelope.tags).toEqual(['from-b']);
+        });
+    });
     test('forwards topK to the vector index and applies the post-filter limit', async () => {
         const index = buildIndex([{ id: 'a' }, { id: 'b' }, { id: 'c' }]);
         const vectorIndex = new FakeVectorIndex([
-            { id: 'a', score: 0.9 },
-            { id: 'b', score: 0.8 },
-            { id: 'c', score: 0.7 }
+            { target: et('a'), score: 0.9 },
+            { target: et('b'), score: 0.8 },
+            { target: et('c'), score: 0.7 }
         ]);
         const r = index_1.SemanticRetriever.create({ index, backend: { vectorIndex, embedQuery: okEmbed } }).orThrow();
         expect(await r.retrieve({ semantic: 'q', topK: 2, limit: 2 })).toSucceedAndSatisfy((records) => {
@@ -291,7 +521,7 @@ describe('SemanticRetriever', () => {
         expect(vectorIndex.lastTopK).toBe(2);
     });
     test('defaults topK to 10 when the query omits it', async () => {
-        const vectorIndex = new FakeVectorIndex([{ id: 'a', score: 0.9 }]);
+        const vectorIndex = new FakeVectorIndex([{ target: et('a'), score: 0.9 }]);
         const r = index_1.SemanticRetriever.create({
             index: buildIndex([{ id: 'a' }]),
             backend: { vectorIndex, embedQuery: okEmbed }
@@ -329,8 +559,8 @@ describe('SemanticRetriever', () => {
     test('normalizes a rejecting vector backend into a Failure', async () => {
         // A vector index whose `query` rejects (throws) rather than returning a fail.
         const rejectingIndex = {
-            add: (id) => Promise.resolve((0, ts_utils_1.succeed)(`ref-${id}`)),
-            remove: (id) => Promise.resolve((0, ts_utils_1.succeed)(id)),
+            add: (t) => Promise.resolve((0, ts_utils_1.succeed)(`ref-${t.id}`)),
+            remove: (t) => Promise.resolve((0, ts_utils_1.succeed)(t)),
             query: () => Promise.reject(new Error('socket hangup'))
         };
         const r = index_1.SemanticRetriever.create({
@@ -415,7 +645,7 @@ describe('HybridRetriever', () => {
         const semantic = index_1.SemanticRetriever.create({
             index,
             backend: {
-                vectorIndex: new FakeVectorIndex([{ id: 'b', score: 0.9 }]),
+                vectorIndex: new FakeVectorIndex([{ target: et('b'), score: 0.9 }]),
                 embedQuery: () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1])))
             }
         }).orThrow();
@@ -442,9 +672,9 @@ describe('HybridRetriever', () => {
         const hybrid = index_1.HybridRetriever.create([linkChild, plainChild], index_1.ScoreUnionMergeStrategy.create().orThrow()).orThrow();
         expect(hybrid.capabilities.supportsLinkTraversal).toBe(true);
         // Union supports link traversal, so the hybrid does NOT loud-fail.
-        expect(await hybrid.retrieve({ linkedTo: 'a', hops: 2 })).toSucceed();
+        expect(await hybrid.retrieve({ linkedTo: et('a'), hops: 2 })).toSucceed();
         // The link-capable child keeps the axes; the plain child has them stripped.
-        expect((_a = linkChild.lastQuery) === null || _a === void 0 ? void 0 : _a.linkedTo).toBe('a');
+        expect((_a = linkChild.lastQuery) === null || _a === void 0 ? void 0 : _a.linkedTo).toEqual(et('a'));
         expect((_b = linkChild.lastQuery) === null || _b === void 0 ? void 0 : _b.hops).toBe(2);
         expect((_c = plainChild.lastQuery) === null || _c === void 0 ? void 0 : _c.linkedTo).toBeUndefined();
         expect((_d = plainChild.lastQuery) === null || _d === void 0 ? void 0 : _d.hops).toBeUndefined();
@@ -484,8 +714,8 @@ describe('HybridRetriever', () => {
             index,
             backend: {
                 vectorIndex: new FakeVectorIndex([
-                    { id: 'd', score: 0.9 },
-                    { id: 'a', score: 0.8 }
+                    { target: et('d'), score: 0.9 },
+                    { target: et('a'), score: 0.8 }
                 ]),
                 embedQuery: () => Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([1])))
             }
@@ -504,5 +734,37 @@ describe('HybridRetriever', () => {
             expect(records[0].envelope.id).toBe('b');
         });
     });
+    test('applies the { offset, limit } window after merge', async () => {
+        const { index } = build();
+        const recency = index_1.RecencyRetriever.create(index).orThrow();
+        const hybrid = index_1.HybridRetriever.create([recency], index_1.ScoreUnionMergeStrategy.create().orThrow()).orThrow();
+        // Merged recency order is [b(30), c(20), a(10)]; offset 1 + limit 1 → [c].
+        expect(await hybrid.retrieve({ offset: 1, limit: 1 })).toSucceedAndSatisfy((records) => {
+            expect(ids(records)).toEqual(['c']);
+        });
+    });
+    test('strips offset from child queries (offset is a post-merge concern)', async () => {
+        var _a, _b;
+        const child = new RecordingRetriever({
+            supportsSemanticRecall: false,
+            supportsTemporalQuery: false,
+            supportsLinkTraversal: false
+        });
+        const hybrid = index_1.HybridRetriever.create([child], index_1.ScoreUnionMergeStrategy.create().orThrow()).orThrow();
+        expect(await hybrid.retrieve({ offset: 2, limit: 3 })).toSucceed();
+        expect((_a = child.lastQuery) === null || _a === void 0 ? void 0 : _a.offset).toBeUndefined();
+        expect((_b = child.lastQuery) === null || _b === void 0 ? void 0 : _b.limit).toBeUndefined();
+    });
+    test('passes the kinds axis through to children (a shared pre-filter axis)', async () => {
+        var _a;
+        const child = new RecordingRetriever({
+            supportsSemanticRecall: false,
+            supportsTemporalQuery: false,
+            supportsLinkTraversal: false
+        });
+        const hybrid = index_1.HybridRetriever.create([child], index_1.ScoreUnionMergeStrategy.create().orThrow()).orThrow();
+        expect(await hybrid.retrieve({ kinds: ['knowledge'] })).toSucceed();
+        expect((_a = child.lastQuery) === null || _a === void 0 ? void 0 : _a.kinds).toEqual(['knowledge']);
+    });
 });
 //# sourceMappingURL=retrievers.test.js.map