dsh-macro-memory 0.0.0-stage → 0.4.0

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.
Files changed (132) hide show
  1. package/LICENSE +21 -0
  2. package/README.md +506 -2
  3. package/cordis.patch.yml +6 -0
  4. package/lib/client.js +3623 -0
  5. package/lib/index.js +502 -0
  6. package/lib/macro/brand.js +82 -0
  7. package/lib/macro/bridge.js +158 -0
  8. package/lib/macro/chain.js +206 -0
  9. package/lib/macro/contract.js +471 -0
  10. package/lib/macro/cost.js +164 -0
  11. package/lib/macro/defs/admin.js +442 -0
  12. package/lib/macro/defs/dream.js +24 -0
  13. package/lib/macro/defs/link.js +257 -0
  14. package/lib/macro/defs/project.js +25 -0
  15. package/lib/macro/defs/read.js +160 -0
  16. package/lib/macro/defs/remember.js +411 -0
  17. package/lib/macro/defs/search.js +871 -0
  18. package/lib/macro/defs/update.js +161 -0
  19. package/lib/macro/dreamledger.js +1398 -0
  20. package/lib/macro/facade.js +135 -0
  21. package/lib/macro/fusion.js +182 -0
  22. package/lib/macro/linkflow.js +391 -0
  23. package/lib/macro/links.js +448 -0
  24. package/lib/macro/neighbor.js +209 -0
  25. package/lib/macro/panel.js +96 -0
  26. package/lib/macro/prompt.js +139 -0
  27. package/lib/macro/provenance.js +148 -0
  28. package/lib/macro/render.js +35 -0
  29. package/lib/macro/revisions.js +253 -0
  30. package/lib/macro/shared.js +113 -0
  31. package/lib/macro/store.js +103 -0
  32. package/lib/macro/supersede.js +197 -0
  33. package/lib/macro/tokencost.js +90 -0
  34. package/lib/macro/tools.js +67 -0
  35. package/package.json +54 -4
  36. package/vendor/VENDOR.json +23 -0
  37. package/vendor/dsh-memory-nebula/CONTRIBUTING.md +48 -0
  38. package/vendor/dsh-memory-nebula/LICENSE +21 -0
  39. package/vendor/dsh-memory-nebula/README.en.md +203 -0
  40. package/vendor/dsh-memory-nebula/README.md +253 -0
  41. package/vendor/dsh-memory-nebula/SECURITY.md +43 -0
  42. package/vendor/dsh-memory-nebula/SUPPORT.md +33 -0
  43. package/vendor/dsh-memory-nebula/cordis.patch.yml +4 -0
  44. package/vendor/dsh-memory-nebula/lib/client.js +105 -0
  45. package/vendor/dsh-memory-nebula/lib/host/adapters/index.js +279 -0
  46. package/vendor/dsh-memory-nebula/lib/host/adapters/ingest.js +230 -0
  47. package/vendor/dsh-memory-nebula/lib/host/adapters/meow.js +320 -0
  48. package/vendor/dsh-memory-nebula/lib/host/adapters/notes.js +305 -0
  49. package/vendor/dsh-memory-nebula/lib/host/adapters/sqlite.js +287 -0
  50. package/vendor/dsh-memory-nebula/lib/host/adapters/util.js +231 -0
  51. package/vendor/dsh-memory-nebula/lib/host/bridge.js +351 -0
  52. package/vendor/dsh-memory-nebula/lib/host/compress.js +97 -0
  53. package/vendor/dsh-memory-nebula/lib/host/demo.js +357 -0
  54. package/vendor/dsh-memory-nebula/lib/host/diagnostics.js +125 -0
  55. package/vendor/dsh-memory-nebula/lib/host/doctor.js +270 -0
  56. package/vendor/dsh-memory-nebula/lib/host/entities.js +230 -0
  57. package/vendor/dsh-memory-nebula/lib/host/graph.js +1762 -0
  58. package/vendor/dsh-memory-nebula/lib/host/graphcache.js +290 -0
  59. package/vendor/dsh-memory-nebula/lib/host/http.js +993 -0
  60. package/vendor/dsh-memory-nebula/lib/host/injectcfg.js +95 -0
  61. package/vendor/dsh-memory-nebula/lib/host/ledger.js +175 -0
  62. package/vendor/dsh-memory-nebula/lib/host/live.js +204 -0
  63. package/vendor/dsh-memory-nebula/lib/host/nebula.js +2105 -0
  64. package/vendor/dsh-memory-nebula/lib/host/page.js +75 -0
  65. package/vendor/dsh-memory-nebula/lib/host/path.js +83 -0
  66. package/vendor/dsh-memory-nebula/lib/host/recall.js +524 -0
  67. package/vendor/dsh-memory-nebula/lib/host/share.js +633 -0
  68. package/vendor/dsh-memory-nebula/lib/host/sources.js +266 -0
  69. package/vendor/dsh-memory-nebula/lib/host/store.js +333 -0
  70. package/vendor/dsh-memory-nebula/lib/host/text.js +410 -0
  71. package/vendor/dsh-memory-nebula/lib/host/transcripts.js +396 -0
  72. package/vendor/dsh-memory-nebula/lib/index.js +782 -0
  73. package/vendor/dsh-memory-nebula/lib/standalone.mjs +315 -0
  74. package/vendor/dsh-memory-nebula/lib/web/api.js +426 -0
  75. package/vendor/dsh-memory-nebula/lib/web/app.js +4172 -0
  76. package/vendor/dsh-memory-nebula/lib/web/i18n.js +580 -0
  77. package/vendor/dsh-memory-nebula/lib/web/index.html +174 -0
  78. package/vendor/dsh-memory-nebula/lib/web/nav.js +132 -0
  79. package/vendor/dsh-memory-nebula/lib/web/render.js +1890 -0
  80. package/vendor/dsh-memory-nebula/lib/web/space3d.js +1883 -0
  81. package/vendor/dsh-memory-nebula/lib/web/style.css +1402 -0
  82. package/vendor/dsh-memory-nebula/locale/en.json +7 -0
  83. package/vendor/dsh-memory-nebula/locale/zh.json +7 -0
  84. package/vendor/dsh-memory-nebula/market/assets/icon-180.png +0 -0
  85. package/vendor/dsh-memory-nebula/market/assets/icon.svg +40 -0
  86. package/vendor/dsh-memory-nebula/market/index.json +101 -0
  87. package/vendor/dsh-memory-nebula/package.json +87 -0
  88. package/vendor/dsh-memory-nebula/sidecar.ps1 +119 -0
  89. package/vendor/meow-memory/LICENSE +21 -0
  90. package/vendor/meow-memory/README.en.md +192 -0
  91. package/vendor/meow-memory/README.md +174 -0
  92. package/vendor/meow-memory/README.pt-br.md +180 -0
  93. package/vendor/meow-memory/cordis.patch.yml +7 -0
  94. package/vendor/meow-memory/lib/client.js +3344 -0
  95. package/vendor/meow-memory/lib/client.js.map +7 -0
  96. package/vendor/meow-memory/lib/index.js +9802 -0
  97. package/vendor/meow-memory/lib/index.js.map +7 -0
  98. package/vendor/meow-memory/lib/prompts/README.md +65 -0
  99. package/vendor/meow-memory/lib/prompts/en/dream-atomic.md +36 -0
  100. package/vendor/meow-memory/lib/prompts/en/dream-header.md +9 -0
  101. package/vendor/meow-memory/lib/prompts/en/dream-project-summary.md +12 -0
  102. package/vendor/meow-memory/lib/prompts/en/dream-topic.md +27 -0
  103. package/vendor/meow-memory/lib/prompts/en/external-memory-notice.md +8 -0
  104. package/vendor/meow-memory/lib/prompts/en/first-create-notice.md +8 -0
  105. package/vendor/meow-memory/lib/prompts/en/labels.md +98 -0
  106. package/vendor/meow-memory/lib/prompts/en/reflect.md +31 -0
  107. package/vendor/meow-memory/lib/prompts/en/system-guide.md +121 -0
  108. package/vendor/meow-memory/lib/prompts/en/tools.md +83 -0
  109. package/vendor/meow-memory/lib/prompts/en/welcome-guide.md +12 -0
  110. package/vendor/meow-memory/lib/prompts/pt-br/dream-atomic.md +36 -0
  111. package/vendor/meow-memory/lib/prompts/pt-br/dream-header.md +9 -0
  112. package/vendor/meow-memory/lib/prompts/pt-br/dream-project-summary.md +12 -0
  113. package/vendor/meow-memory/lib/prompts/pt-br/dream-topic.md +27 -0
  114. package/vendor/meow-memory/lib/prompts/pt-br/external-memory-notice.md +8 -0
  115. package/vendor/meow-memory/lib/prompts/pt-br/first-create-notice.md +8 -0
  116. package/vendor/meow-memory/lib/prompts/pt-br/labels.md +98 -0
  117. package/vendor/meow-memory/lib/prompts/pt-br/reflect.md +31 -0
  118. package/vendor/meow-memory/lib/prompts/pt-br/system-guide.md +121 -0
  119. package/vendor/meow-memory/lib/prompts/pt-br/tools.md +83 -0
  120. package/vendor/meow-memory/lib/prompts/pt-br/welcome-guide.md +12 -0
  121. package/vendor/meow-memory/lib/prompts/zh/dream-atomic.md +36 -0
  122. package/vendor/meow-memory/lib/prompts/zh/dream-header.md +9 -0
  123. package/vendor/meow-memory/lib/prompts/zh/dream-project-summary.md +19 -0
  124. package/vendor/meow-memory/lib/prompts/zh/dream-topic.md +27 -0
  125. package/vendor/meow-memory/lib/prompts/zh/external-memory-notice.md +8 -0
  126. package/vendor/meow-memory/lib/prompts/zh/first-create-notice.md +8 -0
  127. package/vendor/meow-memory/lib/prompts/zh/labels.md +98 -0
  128. package/vendor/meow-memory/lib/prompts/zh/reflect.md +30 -0
  129. package/vendor/meow-memory/lib/prompts/zh/system-guide.md +119 -0
  130. package/vendor/meow-memory/lib/prompts/zh/tools.md +83 -0
  131. package/vendor/meow-memory/lib/prompts/zh/welcome-guide.md +12 -0
  132. package/vendor/meow-memory/package.json +64 -0
@@ -0,0 +1,270 @@
1
+ /**
2
+ * 安装体检:在一个可能还没跑起来的机器上,回答「为什么装不上」。
3
+ *
4
+ * 和 `--diagnose` 不同:诊断假设插件已经在跑,拿的是运行时事实;
5
+ * doctor 在启动之前读文件、读 profile、读记忆库,最多再 ping 一下端口。
6
+ * 全部只读,不改 profile、不写记忆库。
7
+ */
8
+
9
+ import { existsSync, readFileSync, statSync } from 'node:fs'
10
+ import { dirname, join, resolve } from 'node:path'
11
+ import { fileURLToPath } from 'node:url'
12
+ import { DatabaseSync } from 'node:sqlite'
13
+ import { discoverStores } from './sources.js'
14
+
15
+ export const PACKAGE_ROOT = resolve(dirname(fileURLToPath(import.meta.url)), '../..')
16
+
17
+ /**
18
+ * Node 下界只有一个来源:package.json 的 engines.node。
19
+ *
20
+ * 这里以前写死 '22.13.0',而 engines 从 1.11.43 起是 >=24.0.0 —— 于是「装不上时
21
+ * 最先告诉你原因的那个工具」自己说的下界是错的:用户照它升到 22 仍然起不来。
22
+ * 读包里的 engines 就再也不会分家(读不到才回落到代码里这个常量)。
23
+ */
24
+ function readEnginesFloor() {
25
+ try {
26
+ const pkg = JSON.parse(readFileSync(join(PACKAGE_ROOT, 'package.json'), 'utf8'))
27
+ const m = String(pkg?.engines?.node || '').match(/(\d+)\.(\d+)\.(\d+)/)
28
+ if (m) return m[1] + '.' + m[2] + '.' + m[3]
29
+ } catch {
30
+ /* 读不到就回落到下面的常量 */
31
+ }
32
+ return ''
33
+ }
34
+
35
+ export const MIN_NODE = readEnginesFloor() || '24.0.0'
36
+
37
+ const REQUIRED_FILES = [
38
+ 'package.json',
39
+ 'lib/index.js',
40
+ 'lib/host/http.js',
41
+ 'lib/web/index.html',
42
+ 'cordis.patch.yml',
43
+ 'docs/distribution.md',
44
+ ]
45
+
46
+ /** @returns {[number,number,number]|null} */
47
+ export function parseVersion(value) {
48
+ const m = String(value || '').trim().replace(/^v/i, '').match(/^(\d+)\.(\d+)\.(\d+)/)
49
+ return m ? [Number(m[1]), Number(m[2]), Number(m[3])] : null
50
+ }
51
+
52
+ export function versionAtLeast(version, min) {
53
+ const a = parseVersion(version)
54
+ const b = parseVersion(min)
55
+ if (!a || !b) return false
56
+ for (let i = 0; i < 3; i++) {
57
+ if (a[i] > b[i]) return true
58
+ if (a[i] < b[i]) return false
59
+ }
60
+ return true
61
+ }
62
+
63
+ function item(name, status, detail, hint = '') {
64
+ return { name, status, detail: String(detail || ''), hint: String(hint || '') }
65
+ }
66
+
67
+ export function checkRuntime(version = process.versions.node, platform = process.platform, arch = process.arch) {
68
+ const ok = versionAtLeast(version, MIN_NODE)
69
+ return item(
70
+ 'runtime',
71
+ ok ? 'ok' : 'fail',
72
+ `node ${version} / ${platform} ${arch}`,
73
+ ok ? '' : `需要 Node >= ${MIN_NODE};升级 Node 后重开终端`,
74
+ )
75
+ }
76
+
77
+ export function checkPackage(root = PACKAGE_ROOT) {
78
+ const items = []
79
+ let pkg = null
80
+ try {
81
+ pkg = JSON.parse(readFileSync(join(root, 'package.json'), 'utf8'))
82
+ items.push(item('package.json', 'ok', `${pkg.name || '?'} ${pkg.version || '?'}`))
83
+ } catch (err) {
84
+ items.push(item('package.json', 'fail', String(err.message || err), '确认安装目录完整;重新解包 tgz'))
85
+ }
86
+ const missing = []
87
+ for (const rel of REQUIRED_FILES) {
88
+ if (!existsSync(join(root, rel))) missing.push(rel)
89
+ }
90
+ if (missing.length) {
91
+ items.push(item('files', 'fail', `缺少 ${missing.join(', ')}`, '重新解包 tgz,不要只拷 lib/'))
92
+ } else {
93
+ items.push(item('files', 'ok', `${REQUIRED_FILES.length} 个关键文件齐全`))
94
+ }
95
+ const ok = items.every((x) => x.status !== 'fail')
96
+ return { ok, items, version: pkg?.version || '' }
97
+ }
98
+
99
+ export function checkProfile(profileDir) {
100
+ const dir = resolve(String(profileDir || ''))
101
+ const items = []
102
+ let pkg = null
103
+ try {
104
+ pkg = JSON.parse(readFileSync(join(dir, 'package.json'), 'utf8'))
105
+ items.push(item('profile', 'ok', join(dir, 'package.json')))
106
+ } catch (err) {
107
+ items.push(
108
+ item('profile', 'fail', String(err.message || err), '指向 profile 目录(里面有 package.json),不是 plugins 目录'),
109
+ )
110
+ return { ok: false, items }
111
+ }
112
+
113
+ const dep = pkg.dependencies?.['dsh-memory-nebula'] || pkg.devDependencies?.['dsh-memory-nebula'] || ''
114
+ const bundles = Array.isArray(pkg.dsh?.profile?.bundles) ? pkg.dsh.profile.bundles : []
115
+ const listed = bundles.includes('dsh-memory-nebula')
116
+
117
+ if (dep && listed) {
118
+ items.push(item('dependency', 'ok', `dependencies: ${dep}`))
119
+ items.push(item('bundle', 'ok', 'dsh.profile.bundles 已包含 dsh-memory-nebula'))
120
+ } else if (dep && !listed) {
121
+ items.push(item('dependency', 'ok', `dependencies: ${dep}`))
122
+ items.push(
123
+ item('bundle', 'warn', 'dsh.profile.bundles 没有列它', '只装依赖不会加载;把名字加进 bundles 后重启 DSH'),
124
+ )
125
+ } else if (!dep && listed) {
126
+ items.push(item('dependency', 'warn', ' bundles 有,但 dependencies 没声明', '补 dependencies 或 link 后重新安装'))
127
+ items.push(item('bundle', 'ok', 'dsh.profile.bundles 已包含 dsh-memory-nebula'))
128
+ } else {
129
+ items.push(item('dependency', 'fail', 'profile 没有声明 dsh-memory-nebula', '按 docs/distribution.md 的安装步骤加入依赖与 bundles'))
130
+ items.push(item('bundle', 'fail', 'dsh.profile.bundles 没有列它', '把 dsh-memory-nebula 加进 bundles 后重启 DSH'))
131
+ }
132
+
133
+ const installedPkg = join(dir, 'node_modules', 'dsh-memory-nebula', 'package.json')
134
+ if (existsSync(installedPkg)) {
135
+ try {
136
+ const ip = JSON.parse(readFileSync(installedPkg, 'utf8'))
137
+ items.push(item('installed', 'ok', `node_modules 里是 ${ip.version || '?'}`))
138
+ if (pkg.dsh?.profile?.bundles && !existsSync(join(dir, 'node_modules', 'dsh-memory-nebula', 'cordis.patch.yml'))) {
139
+ items.push(item('patch', 'warn', '缺 cordis.patch.yml', '包可能被裁剪;重新 npm install'))
140
+ }
141
+ } catch (err) {
142
+ items.push(item('installed', 'fail', String(err.message || err), '删掉 node_modules/dsh-memory-nebula 后重新安装'))
143
+ }
144
+ } else {
145
+ items.push(item('installed', 'warn', 'node_modules 里没有 dsh-memory-nebula', '在 profile 目录运行 npm install'))
146
+ }
147
+
148
+ return { ok: items.every((x) => x.status !== 'fail'), items }
149
+ }
150
+
151
+ export function checkSources(opts = {}) {
152
+ try {
153
+ const stores = discoverStores({ extraRoots: opts.roots || [] })
154
+ const names = stores.slice(0, 6).map((s) => s.title || s.key)
155
+ const detail = stores.length ? `${stores.length} 个记忆库:${names.join(' / ')}${stores.length > 6 ? ' …' : ''}` : '没有找到记忆库'
156
+ // 文件存在 ≠ 能读:截断/半拷贝/根本不是 SQLite 的库会让一个工作区安静地显示 0 条,
157
+ // 而用户只会觉得「我的记忆没了」。这里逐个探一次,坏的就点名并给原文错误。
158
+ const bad = []
159
+ for (const s of stores) {
160
+ // discoverStores 返回的 store 不一定带 adapter 字段(它是发现层,不是适配器层),
161
+ // 所以只按「有 dbPath 就探」来判断,别用 adapter 过滤——否则一个都探不到。
162
+ if (!s.dbPath) continue
163
+ try {
164
+ const db = new DatabaseSync(s.dbPath, { readOnly: true })
165
+ try {
166
+ db.prepare('SELECT count(*) AS n FROM sqlite_master').get()
167
+ } finally {
168
+ try {
169
+ db.close()
170
+ } catch {
171
+ /* ignore */
172
+ }
173
+ }
174
+ } catch (err) {
175
+ bad.push(`${s.title || s.key}(${String(err?.message || err).slice(0, 80)})`)
176
+ }
177
+ }
178
+ if (bad.length) {
179
+ return item('sources', 'fail', `${bad.length} 个记忆库读不动:${bad.join(' / ')}`, '把坏库挪走或从备份恢复;其余来源不受影响')
180
+ }
181
+ return item('sources', stores.length ? 'ok' : 'warn', detail, stores.length ? '' : '先在对话里写几条记忆,或确认 .dsh-meow/memory.db 的位置')
182
+ } catch (err) {
183
+ return item('sources', 'warn', String(err.message || err), '检查 DSH 工作区注册表与目录权限')
184
+ }
185
+ }
186
+
187
+ /**
188
+ * @param {string} base
189
+ * @param {number} timeoutMs
190
+ * @param {string} [token] standalone `--token` 的本机口令;只放进 Authorization,不打印
191
+ */
192
+ export async function checkEndpoint(base, timeoutMs = 3000, token = '') {
193
+ const url = String(base || '').replace(/\/+$/, '') + '/ping'
194
+ const ctl = new AbortController()
195
+ const timer = setTimeout(() => ctl.abort(), timeoutMs)
196
+ try {
197
+ const headers = { accept: 'application/json' }
198
+ if (token) headers.authorization = 'Bearer ' + token
199
+ const res = await fetch(url, { signal: ctl.signal, headers })
200
+ const body = await res.json().catch(() => ({}))
201
+ if (!res.ok) return item('endpoint', 'warn', `${url} → HTTP ${res.status}`, '看 DSH 日志或 standalone 控制台;口令模式下确认 --token 正确')
202
+ const out = item(
203
+ 'endpoint',
204
+ 'ok',
205
+ `${url} → ${body.version || '?'} / ${body.mode || '?'} / ${body.stats?.nodes ?? '?'} memories`,
206
+ )
207
+ out.version = String(body.version || '')
208
+ return out
209
+ } catch (err) {
210
+ const reason = err?.name === 'AbortError' ? `超时 ${timeoutMs}ms` : String(err.message || err)
211
+ return item('endpoint', 'warn', `${url} → ${reason}`, '插件没在跑、端口不对,或被别的进程占用')
212
+ } finally {
213
+ clearTimeout(timer)
214
+ }
215
+ }
216
+
217
+ /**
218
+ * 装的是新代码、跑的还是旧代码:这是宿主最常见的「升级后没生效」。
219
+ * 只提醒,不阻断;页面通常仍兼容,但新路由/新能力不会出现。
220
+ */
221
+ export function checkVersionDrift(installed, running) {
222
+ const have = String(installed || '')
223
+ const live = String(running || '')
224
+ if (!have || !live || have === live) return null
225
+ return item(
226
+ 'version',
227
+ 'warn',
228
+ `installed ${have}, running host ${live}`,
229
+ '重启 DSH 让宿主加载新代码;只刷新页面不会换掉后端',
230
+ )
231
+ }
232
+
233
+ /**
234
+ * @param {{profile?:string, roots?:string[], base?:string, token?:string}} opts
235
+ */
236
+ export async function runDoctor(opts = {}) {
237
+ const pkg = checkPackage(opts.root || PACKAGE_ROOT)
238
+ const checks = [checkRuntime(), ...pkg.items]
239
+ if (opts.profile) checks.push(...checkProfile(opts.profile).items)
240
+ checks.push(checkSources({ roots: opts.roots || [] }))
241
+ if (opts.base) {
242
+ const endpoint = await checkEndpoint(opts.base, 3000, opts.token || '')
243
+ checks.push(endpoint)
244
+ const drift = checkVersionDrift(pkg.version, endpoint.version)
245
+ if (drift) checks.push(drift)
246
+ }
247
+ const counts = { ok: 0, warn: 0, fail: 0, skip: 0 }
248
+ for (const c of checks) counts[c.status] = (counts[c.status] || 0) + 1
249
+ return { ok: counts.fail === 0, counts, checks }
250
+ }
251
+
252
+ export function formatDoctor(report, opts = {}) {
253
+ const en = opts.lang === 'en'
254
+ const lines = [
255
+ 'memory-nebula doctor',
256
+ en ? '# read-only checks; nothing is installed or changed' : '# 只读检查;不安装、不改 profile、不写记忆库',
257
+ ]
258
+ for (const c of report.checks || []) {
259
+ lines.push(`[${c.status}] ${c.name}: ${c.detail}`)
260
+ if (c.hint) lines.push(` → ${c.hint}`)
261
+ }
262
+ const n = report.counts || {}
263
+ lines.push(
264
+ en
265
+ ? `summary: ${n.ok || 0} ok / ${n.warn || 0} warn / ${n.fail || 0} fail`
266
+ : `summary: ${n.ok || 0} 通过 / ${n.warn || 0} 提醒 / ${n.fail || 0} 失败`,
267
+ )
268
+ if (report.ok === false) lines.push(en ? 'Fix failures above, then run doctor again.' : '先处理上面的 fail,再跑一次 doctor。')
269
+ return lines.join('\n')
270
+ }
@@ -0,0 +1,230 @@
1
+ /**
2
+ * 实体层(P4):把「同一件事的锚点」从记忆里单独抽出来,供星图按实体找。
3
+ *
4
+ * [macro-fusion 0.4.0] 这一段是我们加的,不在上游 dsh-memory-nebula 里;
5
+ * 上游升级会整文件覆盖,冲掉之后召回不会报错、只会静默退回「只按词面找邻居」。
6
+ *
7
+ * 为什么单独成层,而不是把实体做成节点:
8
+ * - `nodes` 是「记忆」的口径:度数、聚类、orphans、面板条数、召回结果位全按它算。
9
+ * 混进实体节点,`1804 条记忆` 会变成 `2200 条`,召回还得处处过滤——等于给每次读数
10
+ * 加一个「这算不算记忆」的判断题。
11
+ * - 回滚只要一条配置:读层关掉,图里就当它不存在,一条记忆都不用重写、不用重建。
12
+ *
13
+ * 只收四类(都是硬事实,不是语义猜测):
14
+ * - `project`:记忆自带的 `project` 字段(人写的,最可信)
15
+ * - `path`:`D:\x\y.js` / `lib/macro/defs/search.js:67` 这种带行号的文件路径
16
+ * - `tool`:`memory_search` / `nebula_recall` 这类工具名
17
+ * - `version`:`0.4.0` 这种三段版本号
18
+ *
19
+ * 刻意不收:人名、机构名、普通名词。那些要靠分词与统计,抽错一次就把两条无关记忆连上,
20
+ * 而星图的错边比缺边贵得多——缺边只是少一条路,错边会让「关于 X 的一切」混进别的东西。
21
+ */
22
+
23
+ /** 只有被 ≥2 条记忆共享的实体才进层:只出现一次的「实体」是索引噪声,只涨体积。 */
24
+ export const ENTITY_MIN_MEMBERS = 2
25
+ /** 层的上限:再多就不叫「锚点」了。按成员数排前 400 个。 */
26
+ export const ENTITY_MAX = 400
27
+ /** 实体当种子时的能量:低于文本种子(1.0),高于「弱关联」(0.2 以下会被当噪声)。 */
28
+ export const ENTITY_SEED = 0.6
29
+ /** 一条记忆最多贡献几个实体当种子(防「一条水词很多的记忆」把半个图点亮)。 */
30
+ export const ENTITY_PER_NODE = 6
31
+ /** 实体名短于这个长度不参与「查询里含实体名」的包含匹配(`0.4` 这种太短)。 */
32
+ export const ENTITY_MIN_LABEL = 4
33
+
34
+ /** 实体层收的类型(与 text.js 的 `type|value` 键前缀对齐)。 */
35
+ export const ENTITY_KINDS = new Set(['project', 'path', 'tool', 'version'])
36
+
37
+ /**
38
+ * 带盘符或 ≥2 段斜杠的文件路径,末尾可带 `:行号`。
39
+ * 例:`d:\a\b\c.js`、`lib/macro/defs/search.js:67`、`./docs/PLAN-0.4.md`
40
+ */
41
+ const PATH_RE = /(?:[a-z]:[\\/]|\.{1,2}[\\/]|(?:^|[\s((`'"[{])[\w@.-]+[\\/])[\w@.\\/-]{2,}\.(?:js|mjs|cjs|ts|tsx|jsx|json|jsonc|md|mdx|py|rs|go|java|kt|cs|cpp|cc|h|hpp|sql|yml|yaml|toml|ini|cfg|sh|ps1|bat|cmd|html|css|db|sqlite|log)(?::\d{1,5})?/g
42
+
43
+ /** 工具名:`memory_*` / `nebula_*` 这类下划线命名的专名。 */
44
+ const TOOL_RE = /\b(?:memory|nebula|macro|dsh)_[a-z][a-z0-9_]{2,28}\b/g
45
+
46
+ /** 版本号:三段或四段,`v` 前缀可有。 */
47
+ const VERSION_RE = /\bv?\d+\.\d+\.\d+(?:-[0-9a-z.]{1,12})?\b/g
48
+
49
+ /** 尾巴上的标点剪掉(路径后面常跟着逗号、右括号)。 */
50
+ function trimTail(s) {
51
+ let end = s.length
52
+ while (end > 0) {
53
+ const c = s.charCodeAt(end - 1)
54
+ if (c === 44 || c === 46 || c === 59 || c === 58 || c === 41 || c === 93 || c === 125 || c === 34 || c === 39 || c === 96 || c === 92) end--
55
+ else break
56
+ }
57
+ return end === s.length ? s : s.slice(0, end)
58
+ }
59
+
60
+ /**
61
+ * 从一条记忆里抽四类实体。
62
+ * @param {object} node buildGraph 产出的节点(有 `blob` 小写全文与 `project` 字段)
63
+ * @returns {Map<string,string>} `type|value` -> type
64
+ */
65
+ export function entitiesOfNode(node) {
66
+ const out = new Map()
67
+ const put = (type, raw) => {
68
+ const v = trimTail(String(raw || '').trim().toLowerCase())
69
+ if (v.length < ENTITY_MIN_LABEL) return
70
+ if (type === 'version' && !/^\d+\.\d+\.\d+/.test(v.replace(/^v/, ''))) return
71
+ out.set(type + '|' + v, type)
72
+ }
73
+ const project = typeof node?.project === 'string' ? node.project.trim() : ''
74
+ if (project) put('project', project)
75
+ const blob = typeof node?.blob === 'string' ? node.blob : ''
76
+ if (blob) {
77
+ for (const m of blob.matchAll(PATH_RE)) put('path', m[0])
78
+ for (const m of blob.matchAll(TOOL_RE)) put('tool', m[0])
79
+ for (const m of blob.matchAll(VERSION_RE)) put('version', m[0])
80
+ }
81
+ return out
82
+ }
83
+
84
+ /**
85
+ * 建整层:哪些实体被哪几条记忆提到。
86
+ *
87
+ * @param {object[]} nodes buildGraph 的节点(已带 `i` 下标与 `blob`)
88
+ * @param {{minMembers?:number,max?:number}} [opts]
89
+ * @returns {{list:object[],byKey:Map<string,object>,byNode:Map<number,string[]>,stats:object}}
90
+ */
91
+ export function collectEntities(nodes, opts = {}) {
92
+ const minMembers = opts.minMembers ?? ENTITY_MIN_MEMBERS
93
+ const max = opts.max ?? ENTITY_MAX
94
+ /** @type {Map<string,{key:string,type:string,label:string,members:number[]}>} */
95
+ const byKey = new Map()
96
+ /** @type {Map<number,string[]>} */
97
+ const byNode = new Map()
98
+
99
+ for (const node of nodes || []) {
100
+ if (!node || typeof node.i !== 'number') continue
101
+ const ents = entitiesOfNode(node)
102
+ const mine = []
103
+ for (const [key, type] of ents) {
104
+ const cut = key.indexOf('|')
105
+ const label = cut < 0 ? key : key.slice(cut + 1)
106
+ let rec = byKey.get(key)
107
+ if (!rec) {
108
+ rec = { key, type, label, members: [] }
109
+ byKey.set(key, rec)
110
+ }
111
+ rec.members.push(node.i)
112
+ mine.push(key)
113
+ }
114
+ if (mine.length) byNode.set(node.i, mine)
115
+ }
116
+
117
+ // 成员数不够的整条丢掉(只在一条记忆里出现 = 索引噪声)
118
+ const list = [...byKey.values()].filter((e) => e.members.length >= minMembers)
119
+ list.sort((a, b) => b.members.length - a.members.length || a.label.localeCompare(b.label))
120
+ const kept = list.slice(0, max)
121
+ const keepKeys = new Set(kept.map((e) => e.key))
122
+ const byKeyKept = new Map(kept.map((e) => [e.key, e]))
123
+
124
+ // byNode 也收紧到留下的实体;并且每条记忆最多 ENTITY_PER_NODE 个(按实体成员数降序)
125
+ /** @type {Map<number,string[]>} */
126
+ const byNodeKept = new Map()
127
+ for (const [i, keys] of byNode) {
128
+ const alive = keys.filter((k) => keepKeys.has(k))
129
+ if (!alive.length) continue
130
+ alive.sort((a, b) => (byKeyKept.get(b)?.members.length || 0) - (byKeyKept.get(a)?.members.length || 0))
131
+ byNodeKept.set(i, alive.slice(0, ENTITY_PER_NODE))
132
+ }
133
+
134
+ const byType = {}
135
+ for (const e of kept) byType[e.type] = (byType[e.type] || 0) + 1
136
+
137
+ return {
138
+ list: kept,
139
+ byKey: byKeyKept,
140
+ byNode: byNodeKept,
141
+ stats: {
142
+ entities: kept.length,
143
+ dropped: byKey.size - kept.length,
144
+ byType,
145
+ mentioned: byNodeKept.size,
146
+ },
147
+ }
148
+ }
149
+
150
+ /**
151
+ * 从 `list` 重建索引(`byKey` / `byNode`)。
152
+ *
153
+ * 为什么要这一步:图的缓存是 JSON——Map 存不住,落盘再读回来只剩 `list`。
154
+ * 400 个实体的索引重建是微秒级,比给缓存加一套 Map 序列化协议便宜得多,
155
+ * 也让「盘上读回来的图」与「刚建好的图」走同一条代码。
156
+ */
157
+ export function indexOf(layer) {
158
+ const byKey = new Map()
159
+ const byNode = new Map()
160
+ for (const e of layer?.list || []) {
161
+ byKey.set(e.key, e)
162
+ for (const i of e.members || []) {
163
+ const arr = byNode.get(i)
164
+ if (arr) arr.push(e.key)
165
+ else byNode.set(i, [e.key])
166
+ }
167
+ }
168
+ return { byKey, byNode }
169
+ }
170
+
171
+ /** 拿到可用的索引:已在就用,缺了现建。 */
172
+ export function ensureLayer(layer) {
173
+ if (!layer || !Array.isArray(layer.list)) return null
174
+ if (layer.byKey instanceof Map) return layer
175
+ return { ...layer, ...indexOf(layer) }
176
+ }
177
+
178
+ /**
179
+ * 查询里出现了哪些实体名?命中的实体把成员节点全带上。
180
+ *
181
+ * 匹配规则故意保守:要求「查询里包含完整的实体名」(label 在 query 里,且 label ≥ 4 字)。
182
+ * 反向包含(query 在 label 里)只在 query ≥ 3 字时允许——否则问「星图」会把
183
+ * `nebula_recall` 之类的长实体全拉进来,把一次精确提问变成一次泛泛扩散。
184
+ *
185
+ * @param {string} query
186
+ * @param {object} layer collectEntities 的产物
187
+ * @param {{limit?:number}} [opts]
188
+ * @returns {{i:number,key:string,label:string,type:string,members:number,weight:number}[]}
189
+ */
190
+ export function entitySeedsOf(query, layer, opts = {}) {
191
+ const q = String(query || '').trim().toLowerCase()
192
+ const ready = ensureLayer(layer)
193
+ if (!q || !ready || ready.list.length === 0) return []
194
+ const limit = Math.max(1, Math.min(20, opts.limit ?? 8))
195
+ const out = []
196
+ for (const e of ready.list) {
197
+ const label = e.label
198
+ if (label.length < ENTITY_MIN_LABEL) continue
199
+ const forward = q.includes(label)
200
+ const backward = !forward && q.length >= 3 && label.includes(q)
201
+ if (!forward && !backward) continue
202
+ // 正向命中(查询里点名了这个实体)比反向(只沾到一段)可信
203
+ const weight = forward ? 1 : 0.6
204
+ out.push({ i: -1, key: e.key, label, type: e.type, members: e.members.length, weight })
205
+ }
206
+ out.sort((a, b) => b.weight - a.weight || b.members - a.members)
207
+ return out.slice(0, limit)
208
+ }
209
+
210
+ /**
211
+ * 让实体种子落到具体节点上(查询命中的实体 → 它的成员)。
212
+ * @param {object[]} hits entitySeedsOf 的结果
213
+ * @param {object} layer
214
+ * @returns {{i:number,key:string,label:string,energy:number}[]}
215
+ */
216
+ export function entitySeedNodes(hits, layer) {
217
+ const ready = ensureLayer(layer)
218
+ const out = []
219
+ const seen = new Set()
220
+ for (const hit of hits || []) {
221
+ const rec = ready?.byKey?.get(hit.key)
222
+ if (!rec) continue
223
+ for (const i of rec.members) {
224
+ if (seen.has(i)) continue
225
+ seen.add(i)
226
+ out.push({ i, key: hit.key, label: rec.label, energy: ENTITY_SEED * (hit.weight || 1) })
227
+ }
228
+ }
229
+ return out
230
+ }