@modusensus/dsh-mneme 0.2.4 → 0.2.5
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 +10 -9
- package/lib/config.js +5 -2
- package/lib/dream/decisions.js +174 -62
- package/lib/dream.js +30 -5
- package/lib/index.js +3 -1
- package/lib/mirror.js +7 -1
- package/lib/service.js +117 -3
- package/lib/store.js +40 -0
- package/lib/tools.js +47 -4
- package/package.json +3 -1
- package/scripts/benchmark-embed.js +201 -0
- package/scripts/benchmark-rerank.js +166 -0
- package/scripts/e2e-dsh.js +216 -0
- package/scripts/stress-dsh.js +255 -0
- package/scripts/sync-lib.js +47 -0
- package/src/config.js +5 -2
- package/src/dream/decisions.js +174 -62
- package/src/dream.js +30 -5
- package/src/index.js +3 -1
- package/src/mirror.js +7 -1
- package/src/service.js +117 -3
- package/src/store.js +40 -0
- package/src/tools.js +47 -4
- package/test/api.test.js +385 -0
- package/test/audit.test.js +290 -0
- package/test/client.test.js +26 -0
- package/test/clustering.test.js +100 -0
- package/test/commands.test.js +69 -0
- package/test/config.test.js +31 -0
- package/test/dream.test.js +526 -0
- package/test/helpers/dream-mock.js +82 -0
- package/test/inject.test.js +82 -0
- package/test/local-embedder.test.js +227 -0
- package/test/mirror.test.js +249 -0
- package/test/reflection.test.js +226 -0
- package/test/reranker.test.js +197 -0
- package/test/semantic.test.js +123 -0
- package/test/service-search.test.js +169 -0
- package/test/service.test.js +198 -0
- package/test/settings.test.js +101 -0
- package/test/store.test.js +293 -0
- package/test/stress.test.js +209 -0
- package/test/summarize.test.js +156 -0
- package/test/tools.test.js +265 -0
- package/test/vector-index.test.js +205 -0
package/lib/store.js
CHANGED
|
@@ -223,6 +223,45 @@ export function createStore(path) {
|
|
|
223
223
|
db.prepare("DELETE FROM memories WHERE id = ?").run(id);
|
|
224
224
|
}
|
|
225
225
|
|
|
226
|
+
/**
|
|
227
|
+
* Atomic compare-and-set update: applies `patch` only when the row still
|
|
228
|
+
* carries `expectedUpdatedAt` (the version token read by the caller). Returns
|
|
229
|
+
* the updated memory on success, or undefined when the row changed since the
|
|
230
|
+
* caller read it — the caller must re-read and retry. The version guard lives
|
|
231
|
+
* in the UPDATE's WHERE clause, so a concurrent read-modify-write across
|
|
232
|
+
* connections cannot silently overwrite a newer value (lost update).
|
|
233
|
+
*/
|
|
234
|
+
function compareAndUpdate(id, expectedUpdatedAt, patch) {
|
|
235
|
+
const existing = getById(id);
|
|
236
|
+
if (!existing) throw new Error(`memory not found: ${id}`);
|
|
237
|
+
const type = patch.type ?? existing.type;
|
|
238
|
+
if (!TYPES.has(type)) throw new Error(`invalid memory type: ${type}`);
|
|
239
|
+
if (patch.tags !== undefined && !Array.isArray(patch.tags)) {
|
|
240
|
+
throw new Error("tags must be an array");
|
|
241
|
+
}
|
|
242
|
+
const now = nowIso();
|
|
243
|
+
const embedding = patch.embedding !== undefined
|
|
244
|
+
? (Array.isArray(patch.embedding) && patch.embedding.length ? JSON.stringify(patch.embedding) : null)
|
|
245
|
+
: existing.embedding ?? null;
|
|
246
|
+
const result = db.prepare(
|
|
247
|
+
`UPDATE memories SET type=?, title=?, content=?, tags=?, importance=?, source=?, embedding=?, updated_at=?
|
|
248
|
+
WHERE id=? AND updated_at=?`
|
|
249
|
+
).run(
|
|
250
|
+
type,
|
|
251
|
+
patch.title ?? existing.title,
|
|
252
|
+
patch.content ?? existing.content,
|
|
253
|
+
JSON.stringify(patch.tags ?? existing.tags),
|
|
254
|
+
Number.isInteger(patch.importance) ? patch.importance : existing.importance,
|
|
255
|
+
patch.source !== undefined ? patch.source : (existing.source ?? null),
|
|
256
|
+
embedding,
|
|
257
|
+
now,
|
|
258
|
+
id,
|
|
259
|
+
expectedUpdatedAt
|
|
260
|
+
);
|
|
261
|
+
if (result.changes === 0) return undefined; // CAS miss: a concurrent write won
|
|
262
|
+
return getById(id);
|
|
263
|
+
}
|
|
264
|
+
|
|
226
265
|
function setForget(id, forgotten) {
|
|
227
266
|
db.prepare("UPDATE memories SET forgotten = ?, updated_at = ? WHERE id = ?")
|
|
228
267
|
.run(forgotten === true || forgotten === 1 ? 1 : 0, nowIso(), id);
|
|
@@ -457,6 +496,7 @@ export function createStore(path) {
|
|
|
457
496
|
getById,
|
|
458
497
|
save,
|
|
459
498
|
update,
|
|
499
|
+
compareAndUpdate,
|
|
460
500
|
remove,
|
|
461
501
|
setForget,
|
|
462
502
|
setArchived,
|
package/lib/tools.js
CHANGED
|
@@ -98,11 +98,12 @@ export function createTools(ctx, service, config, embedder) {
|
|
|
98
98
|
|
|
99
99
|
defineTool({
|
|
100
100
|
name: "memory_list",
|
|
101
|
-
description: "List memory entries by type, high-importance first, then newest, paginated.",
|
|
101
|
+
description: "List memory entries by type, high-importance first, then newest, paginated. Set include_archived=true to also list archived (hidden) entries so they can be located and restored.",
|
|
102
102
|
parameters: {
|
|
103
103
|
type: { type: "string", enum: ["preference", "project", "decision", "history"], description: "Filter by type; omit for all" },
|
|
104
104
|
limit: { type: "integer", description: "Page size (default 50)" },
|
|
105
|
-
offset: { type: "integer", description: "Page offset (default 0)" }
|
|
105
|
+
offset: { type: "integer", description: "Page offset (default 0)" },
|
|
106
|
+
include_archived: { type: "boolean", description: "Include archived (hidden) entries so they can be found and restored (default false)" }
|
|
106
107
|
},
|
|
107
108
|
output: {
|
|
108
109
|
schema: {
|
|
@@ -119,8 +120,14 @@ export function createTools(ctx, service, config, embedder) {
|
|
|
119
120
|
render: (_args, value) => TEXT_OUTPUT(`${value.items.length} memory entries (of ${value.total}).`)
|
|
120
121
|
},
|
|
121
122
|
async execute(args) {
|
|
122
|
-
const
|
|
123
|
-
|
|
123
|
+
const includeArchived = args.include_archived === true;
|
|
124
|
+
const rows = service.toApiList(service.list({
|
|
125
|
+
type: args.type,
|
|
126
|
+
limit: args.limit ?? 50,
|
|
127
|
+
offset: args.offset ?? 0,
|
|
128
|
+
includeArchived
|
|
129
|
+
}));
|
|
130
|
+
return { items: rows, total: service.count(args.type, { includeArchived }) };
|
|
124
131
|
}
|
|
125
132
|
}),
|
|
126
133
|
|
|
@@ -220,6 +227,42 @@ export function createTools(ctx, service, config, embedder) {
|
|
|
220
227
|
const memory = service.setForget(args.id, args.forgotten ?? true);
|
|
221
228
|
return { memory: { id: memory.id, forgotten: memory.forgotten } };
|
|
222
229
|
}
|
|
230
|
+
}),
|
|
231
|
+
|
|
232
|
+
defineTool({
|
|
233
|
+
name: "memory_archive",
|
|
234
|
+
description:
|
|
235
|
+
"Archive a memory (hide it from active lists, search, injection and dream consolidation) or restore it. " +
|
|
236
|
+
"Archived entries stay in storage and are recoverable: pass archived=false to restore, and use memory_list with " +
|
|
237
|
+
"include_archived=true to find archived entries.",
|
|
238
|
+
parameters: {
|
|
239
|
+
id: { type: "string", required: true, description: "Memory id" },
|
|
240
|
+
archived: { type: "boolean", description: "Archive (true, default) or restore (false) the entry" }
|
|
241
|
+
},
|
|
242
|
+
output: {
|
|
243
|
+
schema: {
|
|
244
|
+
type: "object",
|
|
245
|
+
additionalProperties: false,
|
|
246
|
+
properties: {
|
|
247
|
+
memory: {
|
|
248
|
+
type: "object",
|
|
249
|
+
additionalProperties: false,
|
|
250
|
+
properties: {
|
|
251
|
+
id: { type: "string", required: true },
|
|
252
|
+
archived: { type: "boolean", required: true }
|
|
253
|
+
}
|
|
254
|
+
}
|
|
255
|
+
}
|
|
256
|
+
},
|
|
257
|
+
render: (_args, value) => TEXT_OUTPUT(`Memory ${value.memory.id} ${value.memory.archived ? "archived" : "restored"}.`)
|
|
258
|
+
},
|
|
259
|
+
async execute(args) {
|
|
260
|
+
if (service.getById(args.id) === undefined) {
|
|
261
|
+
throw new Error("memory not found");
|
|
262
|
+
}
|
|
263
|
+
const memory = service.setArchived(args.id, args.archived ?? true);
|
|
264
|
+
return { memory: { id: memory.id, archived: memory.archived } };
|
|
265
|
+
}
|
|
223
266
|
})
|
|
224
267
|
];
|
|
225
268
|
|
package/package.json
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@modusensus/dsh-mneme",
|
|
3
3
|
"description": "Cross-session memory plugin for DeepSeek Harness with autoDream consolidation: SQLite store, Markdown mirrors, 6 model tools, automatic injection, session summarization, user profile/rules, custom slash commands, vector (semantic) search, and a Web GUI panel",
|
|
4
|
-
"version": "0.2.
|
|
4
|
+
"version": "0.2.5",
|
|
5
5
|
"license": "MIT",
|
|
6
6
|
"type": "module",
|
|
7
7
|
"main": "lib/index.js",
|
|
@@ -17,6 +17,8 @@
|
|
|
17
17
|
"files": [
|
|
18
18
|
"lib",
|
|
19
19
|
"src",
|
|
20
|
+
"scripts",
|
|
21
|
+
"test",
|
|
20
22
|
"cordis.patch.yml"
|
|
21
23
|
],
|
|
22
24
|
"dsh": {
|
|
@@ -0,0 +1,201 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
// scripts/benchmark-embed.js
|
|
3
|
+
// 嵌入吞吐量基准:测量 LocalEmbedder(ONNX) / OllamaEmbedder / OpenAIEmbedder
|
|
4
|
+
// 的延迟与吞吐。src/local-embedder.js 可能尚在开发,这里用 await import() 动态
|
|
5
|
+
// 加载,失败时打印友好错误而非崩溃。
|
|
6
|
+
//
|
|
7
|
+
// 用法:
|
|
8
|
+
// node scripts/benchmark-embed.js # 默认 local
|
|
9
|
+
// node scripts/benchmark-embed.js --provider local --device cpu
|
|
10
|
+
// node scripts/benchmark-embed.js --provider ollama --model bge-m3
|
|
11
|
+
// node scripts/benchmark-embed.js --provider openai --base-url https://api.openai.com/v1 \
|
|
12
|
+
// --api-key sk-... --model text-embedding-3-small
|
|
13
|
+
// node scripts/benchmark-embed.js --texts 32 --batch-size 8 --warmup 2 --iters 5
|
|
14
|
+
// node scripts/benchmark-embed.js --help
|
|
15
|
+
//
|
|
16
|
+
// 环境变量(npm scripts 里可直接用):EMBED_PROVIDER / EMBED_MODEL /
|
|
17
|
+
// EMBED_DIMENSION / EMBED_DEVICE / EMBED_BATCH_SIZE / EMBED_BASE_URL /
|
|
18
|
+
// EMBED_API_KEY / EMBED_CACHE_DIR。命令行参数优先于环境变量。
|
|
19
|
+
|
|
20
|
+
const SAMPLE_TEXTS = [
|
|
21
|
+
"用户偏好使用中文交流,偶尔夹杂英文术语。",
|
|
22
|
+
"项目使用 SQLite 作为主存储,Markdown 作为人工可读镜像。",
|
|
23
|
+
"考研科目:公共管理学(631)与公共政策学(864)。",
|
|
24
|
+
"autoDream 在后台自动去重、合并、归档记忆。",
|
|
25
|
+
"本地模型支持 ONNX、Ollama 与 OpenAI 兼容三种后端。",
|
|
26
|
+
"Rerank 精排可以提升语义检索的 Top-K 准确率。",
|
|
27
|
+
"记忆库越大,向量检索的优势越明显。",
|
|
28
|
+
"今天完成了语义引擎的架构设计文档。",
|
|
29
|
+
];
|
|
30
|
+
|
|
31
|
+
function pad(s, n) {
|
|
32
|
+
const str = String(s);
|
|
33
|
+
return str.length >= n ? str : str + " ".repeat(n - str.length);
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
function parseArgs(argv) {
|
|
37
|
+
const args = {
|
|
38
|
+
provider: null, model: null, dimension: null, device: null,
|
|
39
|
+
batchSize: null, baseUrl: null, apiKey: null, cacheDir: null,
|
|
40
|
+
texts: 16, warmup: 1, iters: 5, help: false
|
|
41
|
+
};
|
|
42
|
+
const take = (key, i) => (argv[i + 1] !== undefined ? argv[i + 1] : null);
|
|
43
|
+
for (let i = 0; i < argv.length; i++) {
|
|
44
|
+
const a = argv[i];
|
|
45
|
+
if (a === "--help" || a === "-h") { args.help = true; break; }
|
|
46
|
+
if (a === "--provider") args.provider = take("provider", i++);
|
|
47
|
+
else if (a === "--model") args.model = take("model", i++);
|
|
48
|
+
else if (a === "--dimension") args.dimension = Number(take("dimension", i++)) || null;
|
|
49
|
+
else if (a === "--device") args.device = take("device", i++);
|
|
50
|
+
else if (a === "--batch-size") args.batchSize = Number(take("batch-size", i++)) || null;
|
|
51
|
+
else if (a === "--base-url") args.baseUrl = take("base-url", i++);
|
|
52
|
+
else if (a === "--api-key") args.apiKey = take("api-key", i++);
|
|
53
|
+
else if (a === "--cache-dir") args.cacheDir = take("cache-dir", i++);
|
|
54
|
+
else if (a === "--texts") args.texts = Number(take("texts", i++)) || args.texts;
|
|
55
|
+
else if (a === "--warmup") args.warmup = Number(take("warmup", i++)) || 0;
|
|
56
|
+
else if (a === "--iters") args.iters = Number(take("iters", i++)) || 1;
|
|
57
|
+
else { console.error(`未知参数:${a}(用 --help 查看用法)`); process.exit(2); }
|
|
58
|
+
}
|
|
59
|
+
// 环境变量兜底(命令行优先)
|
|
60
|
+
const env = process.env;
|
|
61
|
+
args.provider = args.provider ?? env.EMBED_PROVIDER ?? "local";
|
|
62
|
+
args.model = args.model ?? env.EMBED_MODEL ?? null;
|
|
63
|
+
args.dimension = args.dimension ?? (env.EMBED_DIMENSION ? Number(env.EMBED_DIMENSION) : null);
|
|
64
|
+
args.device = args.device ?? env.EMBED_DEVICE ?? "cpu";
|
|
65
|
+
args.batchSize = args.batchSize ?? (env.EMBED_BATCH_SIZE ? Number(env.EMBED_BATCH_SIZE) : 8);
|
|
66
|
+
args.baseUrl = args.baseUrl ?? env.EMBED_BASE_URL ?? "";
|
|
67
|
+
args.apiKey = args.apiKey ?? env.EMBED_API_KEY ?? "";
|
|
68
|
+
args.cacheDir = args.cacheDir ?? env.EMBED_CACHE_DIR ?? "";
|
|
69
|
+
return args;
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
function usage() {
|
|
73
|
+
console.log(`嵌入吞吐量基准(dsh-mneme)
|
|
74
|
+
|
|
75
|
+
用法:
|
|
76
|
+
node scripts/benchmark-embed.js [选项]
|
|
77
|
+
|
|
78
|
+
选项:
|
|
79
|
+
--provider <local|ollama|openai> 嵌入后端(默认 local,可由环境变量 EMBED_PROVIDER 覆盖)
|
|
80
|
+
--model <name> 模型名(local=HF 模型 id;ollama=Ollama 模型名;openai=API 模型名)
|
|
81
|
+
--dimension <n> 向量维度(不填则按后端推断)
|
|
82
|
+
--device <cpu|wasm|gpu> ONNX 设备(仅 local 生效,默认 cpu)
|
|
83
|
+
--batch-size <n> 分批嵌入条数(默认 8)
|
|
84
|
+
--base-url <url> openai/ollama 端点(ollama 默认 http://localhost:11434)
|
|
85
|
+
--api-key <key> openai 密钥
|
|
86
|
+
--cache-dir <dir> local 模型缓存目录
|
|
87
|
+
--texts <n> 生成样本文本条数(默认 16,从示例库循环)
|
|
88
|
+
--warmup <n> 预热轮数(默认 1)
|
|
89
|
+
--iters <n> 计时轮数(默认 5)
|
|
90
|
+
-h, --help 显示帮助并退出
|
|
91
|
+
|
|
92
|
+
环境变量:EMBED_PROVIDER / EMBED_MODEL / EMBED_DIMENSION / EMBED_DEVICE /
|
|
93
|
+
EMBED_BATCH_SIZE / EMBED_BASE_URL / EMBED_API_KEY / EMBED_CACHE_DIR
|
|
94
|
+
(命令行参数优先)
|
|
95
|
+
`);
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
function buildTexts(n) {
|
|
99
|
+
const out = [];
|
|
100
|
+
for (let i = 0; i < n; i++) out.push(SAMPLE_TEXTS[i % SAMPLE_TEXTS.length]);
|
|
101
|
+
return out;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
/** 安全读取维度:规避部分版本 getter 自递归的坑,取不到则回退 _dimension。 */
|
|
105
|
+
function safeDimension(embedder, fallback) {
|
|
106
|
+
try {
|
|
107
|
+
const d = embedder?.dimension;
|
|
108
|
+
return d > 0 ? d : fallback;
|
|
109
|
+
} catch {
|
|
110
|
+
return embedder?._dimension ?? fallback;
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
async function main() {
|
|
115
|
+
const args = parseArgs(process.argv.slice(2));
|
|
116
|
+
if (args.help) { usage(); process.exit(0); }
|
|
117
|
+
|
|
118
|
+
let mod;
|
|
119
|
+
try {
|
|
120
|
+
mod = await import("../src/local-embedder.js");
|
|
121
|
+
} catch (err) {
|
|
122
|
+
console.error("无法加载 src/local-embedder.js:");
|
|
123
|
+
console.error(` ${err.message}`);
|
|
124
|
+
console.error("该模块可能尚未创建。基准脚本依赖 createEmbedderByProvider(local/ollama/openai)。");
|
|
125
|
+
process.exit(1);
|
|
126
|
+
}
|
|
127
|
+
const { createEmbedderByProvider } = mod;
|
|
128
|
+
if (typeof createEmbedderByProvider !== "function") {
|
|
129
|
+
console.error("src/local-embedder.js 未导出 createEmbedderByProvider,请先实现该模块。");
|
|
130
|
+
process.exit(1);
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
// 构造后端
|
|
134
|
+
let embedder;
|
|
135
|
+
try {
|
|
136
|
+
embedder = createEmbedderByProvider(args.provider, {
|
|
137
|
+
model: args.model ?? undefined,
|
|
138
|
+
dimension: args.dimension ?? undefined,
|
|
139
|
+
device: args.device,
|
|
140
|
+
batchSize: args.batchSize,
|
|
141
|
+
baseUrl: args.baseUrl || undefined,
|
|
142
|
+
apiKey: args.apiKey || undefined,
|
|
143
|
+
cacheDir: args.cacheDir || undefined,
|
|
144
|
+
logger: null
|
|
145
|
+
});
|
|
146
|
+
await embedder.init();
|
|
147
|
+
} catch (err) {
|
|
148
|
+
console.error(`初始化 ${args.provider} 后端失败:${err.message}`);
|
|
149
|
+
console.error("请检查模型是否已下载 / Ollama 是否运行 / API 配置是否正确。");
|
|
150
|
+
process.exit(1);
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
const texts = buildTexts(args.texts);
|
|
154
|
+
const dim = safeDimension(embedder, args.dimension ?? 0);
|
|
155
|
+
console.log("══════ dsh-mneme 嵌入基准 ══════");
|
|
156
|
+
console.log(`后端:${args.provider} 模型:${embedder.model ?? "(默认)"} 维度:${dim || "未知"} 设备:${args.device}`);
|
|
157
|
+
console.log(`文本:${texts.length} 条 批次:${args.batchSize} 预热:${args.warmup} 计时:${args.iters}\n`);
|
|
158
|
+
|
|
159
|
+
// 预热(含首次推理/缓存填充)
|
|
160
|
+
for (let i = 0; i < args.warmup; i++) {
|
|
161
|
+
try { await embedder.embed(texts); } catch (err) { console.error(`预热失败:${err.message}`); process.exit(1); }
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
// 计时
|
|
165
|
+
const rows = [];
|
|
166
|
+
for (let i = 0; i < args.iters; i++) {
|
|
167
|
+
const t0 = process.hrtime.bigint();
|
|
168
|
+
try {
|
|
169
|
+
const vecs = await embedder.embed(texts);
|
|
170
|
+
if (!Array.isArray(vecs) || vecs.length !== texts.length) {
|
|
171
|
+
console.error(`第 ${i + 1} 轮返回 ${Array.isArray(vecs) ? vecs.length : "?"} 条向量,期望 ${texts.length}。`);
|
|
172
|
+
process.exit(1);
|
|
173
|
+
}
|
|
174
|
+
} catch (err) {
|
|
175
|
+
console.error(`第 ${i + 1} 轮嵌入失败:${err.message}`);
|
|
176
|
+
process.exit(1);
|
|
177
|
+
}
|
|
178
|
+
const ms = Number(process.hrtime.bigint() - t0) / 1e6;
|
|
179
|
+
rows.push({ iter: i + 1, ms, perText: ms / texts.length, tps: (texts.length * 1000) / ms });
|
|
180
|
+
}
|
|
181
|
+
|
|
182
|
+
// 结果表
|
|
183
|
+
console.log(`${pad("轮次", 6)}${pad("文本数", 8)}${pad("耗时(ms)", 12)}${pad("ms/条", 10)}${pad("条/秒", 12)}`);
|
|
184
|
+
for (const r of rows) {
|
|
185
|
+
console.log(`${pad(r.iter, 6)}${pad(texts.length, 8)}${pad(r.ms.toFixed(1), 12)}${pad(r.perText.toFixed(3), 10)}${pad(r.tps.toFixed(1), 12)}`);
|
|
186
|
+
}
|
|
187
|
+
const msArr = rows.map((r) => r.ms);
|
|
188
|
+
const avg = msArr.reduce((a, b) => a + b, 0) / msArr.length;
|
|
189
|
+
const min = Math.min(...msArr);
|
|
190
|
+
const max = Math.max(...msArr);
|
|
191
|
+
console.log("\n汇总(均值 / 最小 / 最大):");
|
|
192
|
+
console.log(` 耗时 ms:${avg.toFixed(1)} / ${min.toFixed(1)} / ${max.toFixed(1)}`);
|
|
193
|
+
console.log(` 吞吐:${(texts.length * 1000 / avg).toFixed(1)} 条/秒(平均每轮 ${texts.length} 条)`);
|
|
194
|
+
console.log("══════ 结束 ══════");
|
|
195
|
+
embedder.dispose?.();
|
|
196
|
+
}
|
|
197
|
+
|
|
198
|
+
main().catch((err) => {
|
|
199
|
+
console.error(`未预期错误:${err?.stack ?? err}`);
|
|
200
|
+
process.exit(1);
|
|
201
|
+
});
|
|
@@ -0,0 +1,166 @@
|
|
|
1
|
+
#!/usr/bin/env node
|
|
2
|
+
// scripts/benchmark-rerank.js
|
|
3
|
+
// Rerank 延迟基准:测量 LocalReranker(Xenova/bge-reranker-base,交叉编码)
|
|
4
|
+
// 在不同候选集规模下的精排延迟。src/reranker.js 尚在开发(Phase 2),这里用
|
|
5
|
+
// await import() 动态加载,失败时打印友好错误而非崩溃。
|
|
6
|
+
//
|
|
7
|
+
// 用法:
|
|
8
|
+
// node scripts/benchmark-rerank.js # 默认候选 [10,50,100,500]
|
|
9
|
+
// node scripts/benchmark-rerank.js --candidates 10,100,1000
|
|
10
|
+
// node scripts/benchmark-rerank.js --candidates 10 --top-k 3 --model Xenova/bge-reranker-base
|
|
11
|
+
// node scripts/benchmark-rerank.js --device cpu --batch-size 4
|
|
12
|
+
// node scripts/benchmark-rerank.js --help
|
|
13
|
+
//
|
|
14
|
+
// 环境变量:RERANK_MODEL / RERANK_DEVICE / RERANK_BATCH_SIZE / RERANK_CACHE_DIR。
|
|
15
|
+
|
|
16
|
+
function pad(s, n) {
|
|
17
|
+
const str = String(s);
|
|
18
|
+
return str.length >= n ? str : str + " ".repeat(n - str.length);
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
const QUERY = "如何为记忆插件配置本地语义搜索模型?";
|
|
22
|
+
|
|
23
|
+
// 与 benchmark-embed.js 同源的样本文本库,模拟记忆库候选。
|
|
24
|
+
const CANDIDATE_TEXTS = [
|
|
25
|
+
"用户偏好使用中文交流,偶尔夹杂英文术语。",
|
|
26
|
+
"项目使用 SQLite 作为主存储,Markdown 作为人工可读镜像。",
|
|
27
|
+
"考研科目:公共管理学(631)与公共政策学(864)。",
|
|
28
|
+
"autoDream 在后台自动去重、合并、归档记忆。",
|
|
29
|
+
"本地模型支持 ONNX、Ollama 与 OpenAI 兼容三种后端。",
|
|
30
|
+
"Rerank 精排可以提升语义检索的 Top-K 准确率。",
|
|
31
|
+
"记忆库越大,向量检索的优势越明显。",
|
|
32
|
+
"今天完成了语义引擎的架构设计文档。",
|
|
33
|
+
"Web 记忆面板支持按类型浏览与全文搜索。",
|
|
34
|
+
"用户每天 9-18 点在线上班,上午做深度工作。",
|
|
35
|
+
];
|
|
36
|
+
|
|
37
|
+
function parseArgs(argv) {
|
|
38
|
+
const args = {
|
|
39
|
+
candidates: [10, 50, 100, 500], topK: 5, model: null, device: null,
|
|
40
|
+
batchSize: null, cacheDir: null, query: QUERY, help: false
|
|
41
|
+
};
|
|
42
|
+
for (let i = 0; i < argv.length; i++) {
|
|
43
|
+
const a = argv[i];
|
|
44
|
+
const take = (n) => (argv[i + 1] !== undefined ? argv[i + 1] : null);
|
|
45
|
+
if (a === "--help" || a === "-h") { args.help = true; break; }
|
|
46
|
+
if (a === "--candidates") {
|
|
47
|
+
args.candidates = String(take("candidates", i++)).split(",").map(Number).filter((n) => n > 0);
|
|
48
|
+
if (!args.candidates.length) args.candidates = [10];
|
|
49
|
+
} else if (a === "--top-k") args.topK = Number(take("top-k", i++)) || args.topK;
|
|
50
|
+
else if (a === "--model") args.model = take("model", i++);
|
|
51
|
+
else if (a === "--device") args.device = take("device", i++);
|
|
52
|
+
else if (a === "--batch-size") args.batchSize = Number(take("batch-size", i++)) || null;
|
|
53
|
+
else if (a === "--cache-dir") args.cacheDir = take("cache-dir", i++);
|
|
54
|
+
else if (a === "--query") args.query = take("query", i++);
|
|
55
|
+
else { console.error(`未知参数:${a}(用 --help 查看用法)`); process.exit(2); }
|
|
56
|
+
}
|
|
57
|
+
const env = process.env;
|
|
58
|
+
args.model = args.model ?? env.RERANK_MODEL ?? null;
|
|
59
|
+
args.device = args.device ?? env.RERANK_DEVICE ?? "cpu";
|
|
60
|
+
args.batchSize = args.batchSize ?? (env.RERANK_BATCH_SIZE ? Number(env.RERANK_BATCH_SIZE) : 8);
|
|
61
|
+
args.cacheDir = args.cacheDir ?? env.RERANK_CACHE_DIR ?? "";
|
|
62
|
+
return args;
|
|
63
|
+
}
|
|
64
|
+
|
|
65
|
+
function usage() {
|
|
66
|
+
console.log(`Rerank 延迟基准(dsh-mneme)
|
|
67
|
+
|
|
68
|
+
用法:
|
|
69
|
+
node scripts/benchmark-rerank.js [选项]
|
|
70
|
+
|
|
71
|
+
选项:
|
|
72
|
+
--candidates <n1,n2,...> 候选集规模列表,逗号分隔(默认 10,50,100,500)
|
|
73
|
+
--top-k <n> 精排返回条数(默认 5)
|
|
74
|
+
--model <name> Rerank 模型(默认 Xenova/bge-reranker-base)
|
|
75
|
+
--device <cpu|wasm|gpu> ONNX 设备(默认 cpu)
|
|
76
|
+
--batch-size <n> 批大小(默认 8)
|
|
77
|
+
--cache-dir <dir> 模型缓存目录
|
|
78
|
+
--query <text> 检索 query(默认内置示例)
|
|
79
|
+
-h, --help 显示帮助并退出
|
|
80
|
+
|
|
81
|
+
环境变量:RERANK_MODEL / RERANK_DEVICE / RERANK_BATCH_SIZE / RERANK_CACHE_DIR
|
|
82
|
+
(命令行参数优先)
|
|
83
|
+
`);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
function buildCandidates(n) {
|
|
87
|
+
const out = [];
|
|
88
|
+
for (let i = 0; i < n; i++) {
|
|
89
|
+
const t = CANDIDATE_TEXTS[i % CANDIDATE_TEXTS.length];
|
|
90
|
+
out.push(i < CANDIDATE_TEXTS.length ? t : `${t} —— 变体 #${i + 1}`);
|
|
91
|
+
}
|
|
92
|
+
return out;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
async function main() {
|
|
96
|
+
const args = parseArgs(process.argv.slice(2));
|
|
97
|
+
if (args.help) { usage(); process.exit(0); }
|
|
98
|
+
|
|
99
|
+
let mod;
|
|
100
|
+
try {
|
|
101
|
+
mod = await import("../src/reranker.js");
|
|
102
|
+
} catch (err) {
|
|
103
|
+
console.error("无法加载 src/reranker.js:");
|
|
104
|
+
console.error(` ${err.message}`);
|
|
105
|
+
console.error("该模块属 Phase 2,可能尚未创建。基准脚本依赖导出 LocalReranker。");
|
|
106
|
+
process.exit(1);
|
|
107
|
+
}
|
|
108
|
+
const { LocalReranker } = mod;
|
|
109
|
+
if (typeof LocalReranker !== "function") {
|
|
110
|
+
console.error("src/reranker.js 未导出 LocalReranker,请先实现该模块。");
|
|
111
|
+
process.exit(1);
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
let reranker;
|
|
115
|
+
try {
|
|
116
|
+
reranker = new LocalReranker({
|
|
117
|
+
model: args.model ?? undefined,
|
|
118
|
+
device: args.device,
|
|
119
|
+
batchSize: args.batchSize,
|
|
120
|
+
cacheDir: args.cacheDir || undefined,
|
|
121
|
+
logger: null
|
|
122
|
+
});
|
|
123
|
+
await reranker.init();
|
|
124
|
+
} catch (err) {
|
|
125
|
+
console.error(`初始化 Reranker 失败:${err.message}`);
|
|
126
|
+
console.error("请检查模型是否已下载、设备配置是否正确。");
|
|
127
|
+
process.exit(1);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
console.log("══════ dsh-mneme Rerank 延迟基准 ══════");
|
|
131
|
+
console.log(`模型:${reranker.model ?? "(默认)"} 设备:${args.device} 候选规模:${args.candidates.join(", ")} Top-K:${args.topK}`);
|
|
132
|
+
console.log(`query:${args.query}\n`);
|
|
133
|
+
|
|
134
|
+
// 小规模预热(含首次加载推理)
|
|
135
|
+
try {
|
|
136
|
+
await reranker.rerank(args.query, buildCandidates(5), 3);
|
|
137
|
+
} catch (err) {
|
|
138
|
+
console.error(`预热失败:${err.message}`);
|
|
139
|
+
process.exit(1);
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
console.log(`${pad("候选数", 10)}${pad("Top-K", 8)}${pad("耗时(ms)", 12)}${pad("ms/候选", 10)}`);
|
|
143
|
+
for (const n of args.candidates) {
|
|
144
|
+
const candidates = buildCandidates(n);
|
|
145
|
+
const t0 = process.hrtime.bigint();
|
|
146
|
+
try {
|
|
147
|
+
const result = await reranker.rerank(args.query, candidates, args.topK);
|
|
148
|
+
if (!Array.isArray(result)) {
|
|
149
|
+
console.error(`候选 ${n} 时 rerank 返回非数组,请检查 LocalReranker.rerank 的返回约定。`);
|
|
150
|
+
process.exit(1);
|
|
151
|
+
}
|
|
152
|
+
} catch (err) {
|
|
153
|
+
console.error(`候选 ${n} 时 rerank 失败:${err.message}`);
|
|
154
|
+
process.exit(1);
|
|
155
|
+
}
|
|
156
|
+
const ms = Number(process.hrtime.bigint() - t0) / 1e6;
|
|
157
|
+
console.log(`${pad(n, 10)}${pad(args.topK, 8)}${pad(ms.toFixed(1), 12)}${pad((ms / n).toFixed(3), 10)}`);
|
|
158
|
+
}
|
|
159
|
+
console.log("══════ 结束 ══════");
|
|
160
|
+
reranker.dispose?.();
|
|
161
|
+
}
|
|
162
|
+
|
|
163
|
+
main().catch((err) => {
|
|
164
|
+
console.error(`未预期错误:${err?.stack ?? err}`);
|
|
165
|
+
process.exit(1);
|
|
166
|
+
});
|