@modusensus/dsh-mneme 0.5.0 → 0.5.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +419 -397
- package/lib/api.js +516 -516
- package/lib/commands.js +64 -64
- package/lib/config.js +252 -252
- package/lib/dream.js +817 -817
- package/lib/embedding.js +154 -154
- package/lib/hot-memory.js +7 -0
- package/lib/index.js +341 -341
- package/lib/inject.js +208 -208
- package/lib/local-embedder.js +282 -282
- package/lib/reranker.js +218 -215
- package/lib/service.js +1489 -1484
- package/lib/store.js +6 -2
- package/lib/summarize.js +5 -1
- package/lib/tools.js +7 -2
- package/package.json +1 -1
- package/scripts/sync-lib.js +7 -2
- package/src/hot-memory.js +53 -46
- package/src/reranker.js +218 -215
- package/src/service.js +1489 -1484
- package/src/store.js +6 -2
- package/src/summarize.js +5 -1
- package/src/tools.js +7 -2
- package/test/hot-memory.test.js +174 -145
- package/test/provenance.test.js +103 -0
- package/test/reranker.test.js +240 -197
- package/test/service-search.test.js +199 -174
|
@@ -1,174 +1,199 @@
|
|
|
1
|
-
import test from "node:test";
|
|
2
|
-
import assert from "node:assert/strict";
|
|
3
|
-
import { createStore } from "../src/store.js";
|
|
4
|
-
import { createService } from "../src/service.js";
|
|
5
|
-
import { createVectorIndex } from "../src/vector-index.js";
|
|
6
|
-
|
|
7
|
-
// Mock embedder from the pipeline spec: every query maps to the fixed vector
|
|
8
|
-
// [1,0,0], so vector recall surfaces any row embedded at [1,0,0] (cosine 1)
|
|
9
|
-
// and ignores rows embedded elsewhere (cosine 0).
|
|
10
|
-
const embedder = {
|
|
11
|
-
embedSingle: async () => [1, 0, 0],
|
|
12
|
-
embed: async () => [1, 0, 0],
|
|
13
|
-
schedule: () => {}, // legacy path: scheduleEmbed uses schedule when present, so saveWithDedupe never calls embedSingle here
|
|
14
|
-
modelHash: "mock#1",
|
|
15
|
-
dimension: 3
|
|
16
|
-
};
|
|
17
|
-
|
|
18
|
-
// Mock reranker: scores candidates by their merge order (0,1,2,...) then sorts
|
|
19
|
-
// descending — i.e. it reverses the incoming order. Deterministic, so tests can
|
|
20
|
-
// assert the on/off difference precisely.
|
|
21
|
-
const reranker = {
|
|
22
|
-
rerank: async (q, cands) =>
|
|
23
|
-
cands.map((c, i) => ({ id: c.id, score: i })).sort((a, b) => b.score - a.score)
|
|
24
|
-
};
|
|
25
|
-
|
|
26
|
-
// Real store + service, wired with the mock embedder and a vector index over
|
|
27
|
-
// the same store (the service's vector path prefers vectorIndex when set).
|
|
28
|
-
// The v0.5.0 recall fusion extras (BM25 third path, search-time semantic
|
|
29
|
-
// dedup) are disabled per-test when the assertion targets the legacy blend
|
|
30
|
-
// mechanics — the toy embedder pins every vector hit to the same [1,0,0],
|
|
31
|
-
// which semantic dedup would legitimately collapse.
|
|
32
|
-
function setup({ withEmbedder = true, config = {} } = {}) {
|
|
33
|
-
const store = createStore(":memory:");
|
|
34
|
-
const service = createService({ store, mirror: null, config });
|
|
35
|
-
const vectorIndex = createVectorIndex({ store });
|
|
36
|
-
if (withEmbedder) {
|
|
37
|
-
service.setEmbedder(embedder);
|
|
38
|
-
service.setVectorIndex(vectorIndex);
|
|
39
|
-
}
|
|
40
|
-
return { store, service, vectorIndex };
|
|
41
|
-
}
|
|
42
|
-
|
|
43
|
-
test("hybrid merges vector + keyword recalls and dedups shared memories", async () => {
|
|
44
|
-
const { service, vectorIndex } = setup();
|
|
45
|
-
// keyword-only hit: literal query in the title, embedding far from [1,0,0].
|
|
46
|
-
const kw = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门", importance: 5 });
|
|
47
|
-
vectorIndex.saveEmbedding(kw.memory.id, [0, 1, 0]);
|
|
48
|
-
// vector-only hit: no literal match, but embedded exactly at the query vector.
|
|
49
|
-
const vec = service.saveWithDedupe({ type: "project", title: "猫", content: "喜欢猫" });
|
|
50
|
-
vectorIndex.saveEmbedding(vec.memory.id, [1, 0, 0]);
|
|
51
|
-
// both: literal match AND embedded at [1,0,0] -> must appear exactly once.
|
|
52
|
-
const both = service.saveWithDedupe({ type: "decision", title: "量子计算笔记", content: "量子计算实践" });
|
|
53
|
-
vectorIndex.saveEmbedding(both.memory.id, [1, 0, 0]);
|
|
54
|
-
|
|
55
|
-
const rows = await service.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
56
|
-
const ids = rows.map((r) => r.id);
|
|
57
|
-
assert.ok(ids.includes(vec.memory.id), "vector recall surfaces the semantic-only hit");
|
|
58
|
-
assert.ok(ids.includes(kw.memory.id), "keyword recall surfaces the literal hit");
|
|
59
|
-
assert.equal(ids.filter((id) => id === both.memory.id).length, 1, "overlap row is deduped to a single entry");
|
|
60
|
-
assert.ok(rows.some((m) => m.id === both.memory.id && m.vector), "shared row is flagged as a vector hit");
|
|
61
|
-
assert.equal(ids[0], vec.memory.id, "vector leads the hybrid blend");
|
|
62
|
-
});
|
|
63
|
-
|
|
64
|
-
test("hybrid blend honors configured vector/keyword weights", async () => {
|
|
65
|
-
const { service, vectorIndex } = setup();
|
|
66
|
-
const both = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门" });
|
|
67
|
-
vectorIndex.saveEmbedding(both.memory.id, [1, 0, 0]);
|
|
68
|
-
|
|
69
|
-
// Title hit scores 1 * (0.5 + 3/10) = 0.8; vector cosine = 1.0.
|
|
70
|
-
// Default weights (0.6/0.4) -> 0.6 + 0.32 = 0.92.
|
|
71
|
-
const defaults = await service.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
72
|
-
const d = defaults.find((m) => m.id === both.memory.id);
|
|
73
|
-
assert.ok(Math.abs(d.score - 0.92) < 1e-9, `default blend ${d.score}`);
|
|
74
|
-
|
|
75
|
-
// Even 0.5/0.5 -> 0.5 + 0.4 = 0.9.
|
|
76
|
-
const store = createStore(":memory:");
|
|
77
|
-
const tuned = createService({ store, mirror: null, config: { hybridSearchVectorWeight: 0.5, hybridSearchKeywordWeight: 0.5 } });
|
|
78
|
-
const vi = createVectorIndex({ store });
|
|
79
|
-
tuned.setEmbedder(embedder);
|
|
80
|
-
tuned.setVectorIndex(vi);
|
|
81
|
-
const m = tuned.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门" });
|
|
82
|
-
vi.saveEmbedding(m.memory.id, [1, 0, 0]);
|
|
83
|
-
const rows = await tuned.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
84
|
-
const t = rows.find((r) => r.id === m.memory.id);
|
|
85
|
-
assert.ok(Math.abs(t.score - 0.9) < 1e-9, `tuned blend ${t.score}`);
|
|
86
|
-
});
|
|
87
|
-
|
|
88
|
-
test("
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
});
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
const {
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
const
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
service
|
|
115
|
-
const
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
service.
|
|
121
|
-
const
|
|
122
|
-
assert.
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
const { service, vectorIndex } = setup();
|
|
129
|
-
service.
|
|
130
|
-
|
|
131
|
-
service.saveWithDedupe({ type: "preference", title: "
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
assert.equal(
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
const
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
const
|
|
147
|
-
assert.equal(
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
const { service, vectorIndex } = setup();
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
}
|
|
172
|
-
|
|
173
|
-
assert.equal(rows.
|
|
174
|
-
|
|
1
|
+
import test from "node:test";
|
|
2
|
+
import assert from "node:assert/strict";
|
|
3
|
+
import { createStore } from "../src/store.js";
|
|
4
|
+
import { createService } from "../src/service.js";
|
|
5
|
+
import { createVectorIndex } from "../src/vector-index.js";
|
|
6
|
+
|
|
7
|
+
// Mock embedder from the pipeline spec: every query maps to the fixed vector
|
|
8
|
+
// [1,0,0], so vector recall surfaces any row embedded at [1,0,0] (cosine 1)
|
|
9
|
+
// and ignores rows embedded elsewhere (cosine 0).
|
|
10
|
+
const embedder = {
|
|
11
|
+
embedSingle: async () => [1, 0, 0],
|
|
12
|
+
embed: async () => [1, 0, 0],
|
|
13
|
+
schedule: () => {}, // legacy path: scheduleEmbed uses schedule when present, so saveWithDedupe never calls embedSingle here
|
|
14
|
+
modelHash: "mock#1",
|
|
15
|
+
dimension: 3
|
|
16
|
+
};
|
|
17
|
+
|
|
18
|
+
// Mock reranker: scores candidates by their merge order (0,1,2,...) then sorts
|
|
19
|
+
// descending — i.e. it reverses the incoming order. Deterministic, so tests can
|
|
20
|
+
// assert the on/off difference precisely.
|
|
21
|
+
const reranker = {
|
|
22
|
+
rerank: async (q, cands) =>
|
|
23
|
+
cands.map((c, i) => ({ id: c.id, score: i })).sort((a, b) => b.score - a.score)
|
|
24
|
+
};
|
|
25
|
+
|
|
26
|
+
// Real store + service, wired with the mock embedder and a vector index over
|
|
27
|
+
// the same store (the service's vector path prefers vectorIndex when set).
|
|
28
|
+
// The v0.5.0 recall fusion extras (BM25 third path, search-time semantic
|
|
29
|
+
// dedup) are disabled per-test when the assertion targets the legacy blend
|
|
30
|
+
// mechanics — the toy embedder pins every vector hit to the same [1,0,0],
|
|
31
|
+
// which semantic dedup would legitimately collapse.
|
|
32
|
+
function setup({ withEmbedder = true, config = {} } = {}) {
|
|
33
|
+
const store = createStore(":memory:");
|
|
34
|
+
const service = createService({ store, mirror: null, config });
|
|
35
|
+
const vectorIndex = createVectorIndex({ store });
|
|
36
|
+
if (withEmbedder) {
|
|
37
|
+
service.setEmbedder(embedder);
|
|
38
|
+
service.setVectorIndex(vectorIndex);
|
|
39
|
+
}
|
|
40
|
+
return { store, service, vectorIndex };
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
test("hybrid merges vector + keyword recalls and dedups shared memories", async () => {
|
|
44
|
+
const { service, vectorIndex } = setup();
|
|
45
|
+
// keyword-only hit: literal query in the title, embedding far from [1,0,0].
|
|
46
|
+
const kw = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门", importance: 5 });
|
|
47
|
+
vectorIndex.saveEmbedding(kw.memory.id, [0, 1, 0]);
|
|
48
|
+
// vector-only hit: no literal match, but embedded exactly at the query vector.
|
|
49
|
+
const vec = service.saveWithDedupe({ type: "project", title: "猫", content: "喜欢猫" });
|
|
50
|
+
vectorIndex.saveEmbedding(vec.memory.id, [1, 0, 0]);
|
|
51
|
+
// both: literal match AND embedded at [1,0,0] -> must appear exactly once.
|
|
52
|
+
const both = service.saveWithDedupe({ type: "decision", title: "量子计算笔记", content: "量子计算实践" });
|
|
53
|
+
vectorIndex.saveEmbedding(both.memory.id, [1, 0, 0]);
|
|
54
|
+
|
|
55
|
+
const rows = await service.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
56
|
+
const ids = rows.map((r) => r.id);
|
|
57
|
+
assert.ok(ids.includes(vec.memory.id), "vector recall surfaces the semantic-only hit");
|
|
58
|
+
assert.ok(ids.includes(kw.memory.id), "keyword recall surfaces the literal hit");
|
|
59
|
+
assert.equal(ids.filter((id) => id === both.memory.id).length, 1, "overlap row is deduped to a single entry");
|
|
60
|
+
assert.ok(rows.some((m) => m.id === both.memory.id && m.vector), "shared row is flagged as a vector hit");
|
|
61
|
+
assert.equal(ids[0], vec.memory.id, "vector leads the hybrid blend");
|
|
62
|
+
});
|
|
63
|
+
|
|
64
|
+
test("hybrid blend honors configured vector/keyword weights", async () => {
|
|
65
|
+
const { service, vectorIndex } = setup();
|
|
66
|
+
const both = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门" });
|
|
67
|
+
vectorIndex.saveEmbedding(both.memory.id, [1, 0, 0]);
|
|
68
|
+
|
|
69
|
+
// Title hit scores 1 * (0.5 + 3/10) = 0.8; vector cosine = 1.0.
|
|
70
|
+
// Default weights (0.6/0.4) -> 0.6 + 0.32 = 0.92.
|
|
71
|
+
const defaults = await service.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
72
|
+
const d = defaults.find((m) => m.id === both.memory.id);
|
|
73
|
+
assert.ok(Math.abs(d.score - 0.92) < 1e-9, `default blend ${d.score}`);
|
|
74
|
+
|
|
75
|
+
// Even 0.5/0.5 -> 0.5 + 0.4 = 0.9.
|
|
76
|
+
const store = createStore(":memory:");
|
|
77
|
+
const tuned = createService({ store, mirror: null, config: { hybridSearchVectorWeight: 0.5, hybridSearchKeywordWeight: 0.5 } });
|
|
78
|
+
const vi = createVectorIndex({ store });
|
|
79
|
+
tuned.setEmbedder(embedder);
|
|
80
|
+
tuned.setVectorIndex(vi);
|
|
81
|
+
const m = tuned.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门" });
|
|
82
|
+
vi.saveEmbedding(m.memory.id, [1, 0, 0]);
|
|
83
|
+
const rows = await tuned.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
84
|
+
const t = rows.find((r) => r.id === m.memory.id);
|
|
85
|
+
assert.ok(Math.abs(t.score - 0.9) < 1e-9, `tuned blend ${t.score}`);
|
|
86
|
+
});
|
|
87
|
+
|
|
88
|
+
test("hybrid fusion clamps blended scores into [0,1]", async () => {
|
|
89
|
+
// Weights summing above 1 (1.0 + 1.0) push a same-memory blend over 1.0:
|
|
90
|
+
// title hit (importance 5) = 1 * (0.5 + 0.5) = 1.0, vector cosine = 1.0 →
|
|
91
|
+
// raw blend 1.0*1 + 1.0*1 = 2.0. The fused score must be clamped so
|
|
92
|
+
// consumers never see a score outside [0,1].
|
|
93
|
+
const store = createStore(":memory:");
|
|
94
|
+
const service = createService({ store, mirror: null, config: {
|
|
95
|
+
hybridSearchVectorWeight: 1,
|
|
96
|
+
hybridSearchKeywordWeight: 1,
|
|
97
|
+
adaptiveThresholdEnabled: false,
|
|
98
|
+
searchSemanticDedup: false
|
|
99
|
+
} });
|
|
100
|
+
const vi = createVectorIndex({ store });
|
|
101
|
+
service.setEmbedder(embedder);
|
|
102
|
+
service.setVectorIndex(vi);
|
|
103
|
+
const m = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门", importance: 5 });
|
|
104
|
+
vi.saveEmbedding(m.memory.id, [1, 0, 0]);
|
|
105
|
+
|
|
106
|
+
const rows = await service.searchMemories("量子计算", { mode: "hybrid", topK: 10 });
|
|
107
|
+
const hit = rows.find((r) => r.id === m.memory.id);
|
|
108
|
+
assert.ok(hit, "blended row is recalled");
|
|
109
|
+
assert.equal(hit.score, 1, `over-weight blend clamped to 1 (got ${hit.score})`);
|
|
110
|
+
assert.ok(hit.score >= 0 && hit.score <= 1);
|
|
111
|
+
});
|
|
112
|
+
|
|
113
|
+
test("auto = keyword leads, vector fills the remaining slots", async () => {
|
|
114
|
+
const { service, vectorIndex } = setup();
|
|
115
|
+
const kw = service.saveWithDedupe({ type: "preference", title: "量子计算", content: "量子计算入门" });
|
|
116
|
+
vectorIndex.saveEmbedding(kw.memory.id, [0, 1, 0]);
|
|
117
|
+
const vec = service.saveWithDedupe({ type: "preference", title: "猫", content: "喜欢猫" });
|
|
118
|
+
vectorIndex.saveEmbedding(vec.memory.id, [1, 0, 0]);
|
|
119
|
+
|
|
120
|
+
const rows = await service.searchMemories("量子计算", { mode: "auto", topK: 10 });
|
|
121
|
+
const ids = rows.map((r) => r.id);
|
|
122
|
+
assert.ok(ids.includes(kw.memory.id), "keyword hit present");
|
|
123
|
+
assert.ok(ids.includes(vec.memory.id), "vector fills a free slot");
|
|
124
|
+
assert.equal(ids[0], kw.memory.id, "keyword stays first in auto mode");
|
|
125
|
+
});
|
|
126
|
+
|
|
127
|
+
test("reranker on/off: rerank reorders by score, off keeps merge order", async () => {
|
|
128
|
+
const { service, vectorIndex } = setup();
|
|
129
|
+
const a = service.saveWithDedupe({ type: "preference", title: "猫", content: "喜欢猫", importance: 5 });
|
|
130
|
+
vectorIndex.saveEmbedding(a.memory.id, [0, 1, 0]);
|
|
131
|
+
const b = service.saveWithDedupe({ type: "preference", title: "猫猫", content: "猫粮", importance: 3 });
|
|
132
|
+
vectorIndex.saveEmbedding(b.memory.id, [0, 1, 0]);
|
|
133
|
+
|
|
134
|
+
// No reranker: keyword order (importance desc) is preserved.
|
|
135
|
+
const off = await service.searchMemories("猫", { mode: "keyword", topK: 10 });
|
|
136
|
+
assert.equal(off[0].id, a.memory.id, "without a reranker merge order is kept");
|
|
137
|
+
|
|
138
|
+
// Mock reranker installed: it reverses the merge order by score.
|
|
139
|
+
service.setReranker(reranker);
|
|
140
|
+
const on = await service.searchMemories("猫", { mode: "keyword", topK: 10 });
|
|
141
|
+
assert.equal(on[0].id, b.memory.id, "rerank reorders to the highest score first");
|
|
142
|
+
assert.equal(typeof on[0].score, "number", "reranked rows carry a score");
|
|
143
|
+
|
|
144
|
+
// Clearing the reranker restores merge order.
|
|
145
|
+
service.setReranker(null);
|
|
146
|
+
const after = await service.searchMemories("猫", { mode: "keyword", topK: 10 });
|
|
147
|
+
assert.equal(after[0].id, a.memory.id, "clearing the reranker restores original order");
|
|
148
|
+
});
|
|
149
|
+
|
|
150
|
+
test("keyword mode never calls the embedder", async () => {
|
|
151
|
+
let calls = 0;
|
|
152
|
+
const counting = { ...embedder, embedSingle: async () => { calls++; return [1, 0, 0]; } };
|
|
153
|
+
const { service, vectorIndex } = setup();
|
|
154
|
+
service.setEmbedder(counting);
|
|
155
|
+
service.setVectorIndex(vectorIndex);
|
|
156
|
+
service.saveWithDedupe({ type: "preference", title: "语言", content: "中文交流" });
|
|
157
|
+
|
|
158
|
+
const rows = await service.searchMemories("中文", { mode: "keyword", topK: 10 });
|
|
159
|
+
assert.equal(rows.length, 1);
|
|
160
|
+
assert.equal(rows[0].title, "语言");
|
|
161
|
+
assert.equal(calls, 0, "keyword mode must never embed the query");
|
|
162
|
+
});
|
|
163
|
+
|
|
164
|
+
test("embedder failure degrades to keyword results", async () => {
|
|
165
|
+
const broken = { ...embedder, embedSingle: async () => { throw new Error("model unavailable"); } };
|
|
166
|
+
const { service, vectorIndex } = setup();
|
|
167
|
+
service.setEmbedder(broken);
|
|
168
|
+
service.setVectorIndex(vectorIndex);
|
|
169
|
+
service.saveWithDedupe({ type: "preference", title: "语言", content: "中文交流" });
|
|
170
|
+
|
|
171
|
+
const rows = await service.searchMemories("中文", { mode: "auto", topK: 10 });
|
|
172
|
+
assert.equal(rows.length, 1, "keyword fallback still returns matches");
|
|
173
|
+
assert.equal(rows[0].title, "语言");
|
|
174
|
+
assert.ok(!rows.some((m) => m.vector), "no rows claim the vector path after a failure");
|
|
175
|
+
});
|
|
176
|
+
|
|
177
|
+
test("vector mode returns semantic hits, and falls back to keyword without an embedder", async () => {
|
|
178
|
+
const { service, vectorIndex } = setup();
|
|
179
|
+
const hit = service.saveWithDedupe({ type: "preference", title: "猫", content: "喜欢猫" });
|
|
180
|
+
vectorIndex.saveEmbedding(hit.memory.id, [1, 0, 0]);
|
|
181
|
+
const rows = await service.searchMemories("猫", { mode: "vector", topK: 10 });
|
|
182
|
+
assert.ok(rows.some((m) => m.id === hit.memory.id && m.vector), "vector-only recall surfaces the embedded hit");
|
|
183
|
+
|
|
184
|
+
// No embedder/vector index: vector mode falls back to literal keyword.
|
|
185
|
+
const bare = setup({ withEmbedder: false });
|
|
186
|
+
const m = bare.service.saveWithDedupe({ type: "preference", title: "语言", content: "中文交流" });
|
|
187
|
+
const fallback = await bare.service.searchMemories("中文", { mode: "vector", topK: 10 });
|
|
188
|
+
assert.ok(fallback.some((x) => x.id === m.memory.id), "keyword fallback when vector is unavailable");
|
|
189
|
+
});
|
|
190
|
+
|
|
191
|
+
test("topK caps the merged result set", async () => {
|
|
192
|
+
const { service, vectorIndex } = setup();
|
|
193
|
+
for (let i = 0; i < 5; i++) {
|
|
194
|
+
const m = service.saveWithDedupe({ type: "preference", title: `猫${i}`, content: "猫" });
|
|
195
|
+
vectorIndex.saveEmbedding(m.memory.id, [1, 0, 0]);
|
|
196
|
+
}
|
|
197
|
+
const rows = await service.searchMemories("猫", { mode: "auto", topK: 3 });
|
|
198
|
+
assert.equal(rows.length, 3, "merged list is trimmed to topK");
|
|
199
|
+
});
|