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,391 @@
1
+ /**
2
+ * 连线流程:写记忆时顺手连线、连不上就排队、读记忆时补。
3
+ *
4
+ * 这里只放「跨工具共用」的那部分(写路径 remember/update 与读路径 search/read/link 都要用),
5
+ * 8 个工具的定义在 `defs/*.js`(DESIGN §16)。
6
+ */
7
+ import { dropPending, flushPending, isLinkedText, isSelfPairText, queuePending, saysMissingNodes, LINK_BATCH_MS, LINK_CALL_MS, LINKS_PER_WRITE, MIN_STEP_MS, PENDING_REASONS, describeMs, isTimedOut, withBudget } from './links.js'
8
+ import { NODE_MISSING_MARK, inspectAnswerKind } from './contract.js'
9
+
10
+ export const LINK_NOTE = 'macro-memory: 写入时顺手固化的关联'
11
+
12
+ /** links 的入参形状:字符串 id,或 {id, note}(note 直接写进星图连线,留下「为什么连」)。 */
13
+ export const LINKS_SCHEMA = {
14
+ type: 'array',
15
+ description: '写入成功后顺手固化进星图的邻居记忆 id:可直接给 id 字符串,也可给 {id, note} 说明为什么要连。',
16
+ items: {
17
+ oneOf: [
18
+ { type: 'string' },
19
+ {
20
+ type: 'object',
21
+ additionalProperties: false,
22
+ properties: {
23
+ id: { type: 'string', description: '邻居记忆 id。' },
24
+ note: { type: 'string', description: '为什么要连(会写进连线,方便以后回看)。' },
25
+ },
26
+ required: ['id'],
27
+ },
28
+ ],
29
+ },
30
+ }
31
+
32
+ /**
33
+ * 把外面的 `links` 拆成「能用的条目」+「丢了几条、为什么」(0.2.78)。
34
+ *
35
+ * [macro-fusion 0.2.78] 旧写法(`const list = Array.isArray(links) ? links : []` 再逐条
36
+ * `continue`)的毛病是:丢的那几条**没有任何人知道**——面板上只剩「已连上 1 条」,
37
+ * 读者会以为 3 条全连了。所以这里把丢弃原因一起交出去,由 `linkDropNote()` 说给读者听。
38
+ */
39
+ export function linkArgs(links) {
40
+ const list = Array.isArray(links) ? links : []
41
+ const items = []
42
+ let notArray = 0
43
+ let blank = 0
44
+ let wrongShape = 0
45
+ if (links !== undefined && links !== null && !Array.isArray(links)) notArray = 1
46
+ for (const item of list) {
47
+ if (typeof item === 'string') {
48
+ const id = item.trim()
49
+ if (id.length > 0) items.push({ id, note: LINK_NOTE })
50
+ else blank += 1
51
+ continue
52
+ }
53
+ if (item && typeof item === 'object' && typeof item.id === 'string') {
54
+ const id = item.id.trim()
55
+ if (id.length === 0) {
56
+ blank += 1
57
+ continue
58
+ }
59
+ const note = typeof item.note === 'string' && item.note.trim().length > 0 ? item.note.trim() : LINK_NOTE
60
+ items.push({ id, note })
61
+ continue
62
+ }
63
+ wrongShape += 1
64
+ }
65
+ return { items, drop: { notArray, blank, wrongShape, total: notArray + blank + wrongShape } }
66
+ }
67
+
68
+ /** links 支持两种写法:`"id"` 或 `{ id, note }`(note 会写进星图连线,方便以后回看为什么连)。 */
69
+ export function normalizeLinks(links) {
70
+ return linkArgs(links).items
71
+ }
72
+
73
+ /**
74
+ * 「这次给的 links 有几条根本用不了」要说出口(0.2.78)。
75
+ *
76
+ * 两种情况都会让 `applyLinks()` 早退:条目全被筛掉、或者根本不知道锚点是谁。
77
+ * 早退时不说话=面板看起来跟没给 links 一样,而模型会认为「我已经连上了」。
78
+ */
79
+ export function linkDropNote(drop, anchorMissing = false) {
80
+ const d = drop && typeof drop === 'object' ? drop : {}
81
+ const total = Math.max(0, Math.trunc(Number(d.total) || 0))
82
+ if (total <= 0) return ''
83
+ const bits = []
84
+ if (Math.trunc(Number(d.notArray) || 0) > 0) bits.push('links 给的不是数组(整份用法没生效)')
85
+ const blank = Math.max(0, Math.trunc(Number(d.blank) || 0))
86
+ if (blank > 0) bits.push(`${blank} 条是空 id`)
87
+ const shape = Math.max(0, Math.trunc(Number(d.wrongShape) || 0))
88
+ if (shape > 0) bits.push(`${shape} 条既不是 id 字符串,也不是 {id, note}`)
89
+ const head = bits.length > 0 ? `links 里这 ${total} 条没法用:${bits.join(';')}` : `links 里这 ${total} 条一条都没连上`
90
+ return anchorMissing
91
+ ? `${head}——而且这次也不知道要连到哪条记忆(写入回执里没给 id),所以连排队都没法排:先用 memory_search 找到 id,再用 memory_link 手动连。`
92
+ : `${head}——这几条一条都没连、也没进排队:补成正经的 id 再试,别当成「已经连上了」。`
93
+ }
94
+
95
+ /**
96
+ * 「这条记忆还没进星图」的判据(0.2.29)。
97
+ *
98
+ * `nebula_inspect` 返回的是**文本**,不是结构,所以这里只能认措辞——这正是它脆的地方:
99
+ * 星图哪天改一句话,我们就从「等 12 秒再连」悄悄退化成「立刻去连、连不上再排队」,
100
+ * 而且**不会报错**,只是队列里多出一堆本该等一等就好的欠账。
101
+ *
102
+ * 字面量统一放在 `lib/macro/contract.js`(跨插件的字只有那一处),
103
+ * 由 verify 拿它去对 vendor 的源码(`vendor/dsh-memory-nebula/lib/index.js` 的 `星图里没有 id=`)——
104
+ * 对面一改措辞,断言先红,而不是等用户发现「怎么老是排队」。
105
+ */
106
+ export { NODE_MISSING_MARK } from './contract.js'
107
+
108
+ /** 星图这次回话是不是「还没这条记忆」。文本通道唯一的判据。 */
109
+ export function saysMissing(text) {
110
+ return String(text ?? '').includes(NODE_MISSING_MARK)
111
+ }
112
+
113
+ /**
114
+ * [macro-fusion 0.2.54] 「这条没连上」的三种真相,各一句话。
115
+ *
116
+ * 原来三处(memory_link 的 a/b、remember 的 links 参数、补连队列)共用一句
117
+ * 「找不到这条记忆(id 写错了,或它已经被合并掉)」——可短 id 撞车时它明明在,
118
+ * 只是前缀不够;meow 没接上时连「有没有」都不知道。把「你给短了」和「工具没就绪」
119
+ * 都说成「它没了」,读者只能去重新建一条,于是同一条记忆被写了两遍。
120
+ * 所以:撞车、没查成、真没有,三句分开;真没有那句才允许提「写错了 / 被合并」。
121
+ */
122
+ export const LINK_AMBIGUOUS_LINE =
123
+ '这个短 id 不止一条记忆,这次一条都没连——把 id 给够位数(至少 8 位,最好整条)再写一次。连错一条比没连上更难发现'
124
+ export const LINK_UNAVAILABLE_LINE =
125
+ '这次没查成(读记忆的工具没接上),没连——这不是「这条记忆不存在」,等它就绪再写一次'
126
+ export const LINK_MISSING_LINE =
127
+ '这个工作区里没有这条记忆,没连——id 可能写错了一位,或者它已经被合并/删除,用 memory_search 反查一下'
128
+
129
+ /**
130
+ * 后台补连与面板补连接的期限(0.2.33)。
131
+ *
132
+ * 这些数以前散在三处:`flushLinks` 里写 `1200, 8`,`flushNow` 的默认参数写 `1500, 20`,
133
+ * 面板还自己再传一遍 `{ budgetMs: 1500, limit: 20 }`——面板改一次要改两处,漂了也没人发现。
134
+ * 现在:常量只在这里,config 可覆盖,面板不写数(`flow.flushNow(exec)` 就是面板口径)。
135
+ */
136
+ export const FLUSH_LINKS_BUDGET_MS = 1200
137
+ export const FLUSH_LINKS_LIMIT = 8
138
+ export const FLUSH_NOW_BUDGET_MS = 1500
139
+ export const FLUSH_NOW_LIMIT = 20
140
+
141
+ /** 等星图建图的轮询粒度:约等于它一轮巡检(12s)的十分之一量级。 */
142
+ export const POLL_STEP_MS = 1500
143
+
144
+ /**
145
+ * 造一套「调用子插件 + 连线」的能力。返回值同时给 `defs/*.js` 用:
146
+ * `call` / `tryCall`(统一超时与失败文案)、`applyLinks`(写路径)、`flushLinks`(读路径节流补连)、
147
+ * `flushNow`(运维面板手动补一轮)。
148
+ */
149
+ export function createLinkFlow({ bridge, config = {} }) {
150
+ const toolWaitMs = config.toolWaitMs ?? 30000
151
+ const linkWaitMs = config.linkWaitMs ?? 14000
152
+ const flushThrottleMs = config.flushThrottleMs ?? 30000
153
+ // 前台一次写连线的上限(0.2.31):用户在等的这条路也必须有个头,不能跟着星图建图一起挂
154
+ const linkCallMs = config.linkCallMs ?? LINK_CALL_MS
155
+ // 一批的总账(0.2.32)与单批条数:单条有期限 ≠ 一批有期限,12 条各挂 20 秒还是 4 分钟
156
+ const linkBatchMs = config.linkBatchMs ?? LINK_BATCH_MS
157
+ const linksPerWrite = config.linksPerWrite ?? LINKS_PER_WRITE
158
+ // 补连的预算与条数(0.2.33):后台一条、面板一条,两条都不许自己写数
159
+ const flushBudgetMs = config.flushBudgetMs ?? FLUSH_LINKS_BUDGET_MS
160
+ const flushLimit = config.flushLimit ?? FLUSH_LINKS_LIMIT
161
+ const panelBudgetMs = config.panelBudgetMs ?? FLUSH_NOW_BUDGET_MS
162
+ const panelLimit = config.panelLimit ?? FLUSH_NOW_LIMIT
163
+ const pollStepMs = config.pollStepMs ?? POLL_STEP_MS
164
+
165
+ const call = (name, args, exec) => bridge.call(name, args, exec, toolWaitMs)
166
+ const tryCall = (name, args, exec, label) => bridge.tryCall(name, args, exec, toolWaitMs, label)
167
+
168
+ /**
169
+ * 星图是「可重建索引」:新写入的条目要等一轮建图(约 12s 巡检)才变成节点。
170
+ * 返回三态:'ready' 已入图 / 'pending' 还没入图(等得起,稍后再连)/ 'unavailable' 星图模块根本没接上。
171
+ * 三态必须分开——退化成二态会把「没装星图」错报成「等 12 秒就好」。
172
+ *
173
+ * 两个判据的性质完全不同,别混:
174
+ * - 'unavailable' 看的是**结构**(`probe.entry === undefined`,即桥根本没拿到这个工具),稳;
175
+ * - 'pending' 看的是**措辞**(`inspectAnswerKind`),脆,靠 verify 盯着 vendor 的原文。
176
+ */
177
+ async function graphState(id, exec, deadlineMs = linkWaitMs) {
178
+ const deadline = Date.now() + Math.max(0, deadlineMs)
179
+ for (;;) {
180
+ const probe = await tryCall('nebula_inspect', { id, neighbors: 0 }, exec, '星图')
181
+ if (probe.entry === undefined) return 'unavailable'
182
+ const text = String(probe.text ?? '')
183
+ // 只有「正常正文」才算 ready(0.2.42)。原来写的是「非空且不含 NODE_MISSING_MARK 就算 ready」,
184
+ // 于是 0.2.42 给 inspect 补的「图还是空的」那一支会被判成 ready:空图上每次写入都先去连、
185
+ // 连不上再落一条「失败」欠账——原因错(应为「节点待入图」),而且要多等一次读才补上。
186
+ if (text.length > 0 && inspectAnswerKind(text) === 'ok') return 'ready'
187
+ if (Date.now() >= deadline) return 'pending'
188
+ // 睡也不能睡过期限:轮询间隔 `pollStepMs` 是「建图一轮」的量级,
189
+ // 但调用方可能只给了 300ms(探针就是这么测的)——按剩余时间取小,别把等待做超。
190
+ await new Promise((r) => setTimeout(r, Math.min(pollStepMs, Math.max(0, deadline - Date.now()))))
191
+ }
192
+ }
193
+
194
+ /**
195
+ * 短 id 归一成完整 id。
196
+ *
197
+ * meow 的工具输出与快照只给前 8 位(`findById` 支持前缀),而星图 `resolveIds` 只认完整 id
198
+ * 或 `meow:<store>:<level>:<id>` 形式的节点 id。不归一就会出现「刚写完的记忆,连线说找不到」。
199
+ * 归不出来(记忆已被删/合并)返回 null,调用方据此判定为永久失败,不再排队重试。
200
+ */
201
+ const idCache = new Map()
202
+
203
+ /**
204
+ * [macro-fusion 0.2.54] 归一的结果不能只有「成 / 不成」两态。
205
+ *
206
+ * memory_read 从 0.2.52 起把「短 id 撞车」单独标成 `ambiguous`(列出候选、一条都不读);
207
+ * 从 0.2.53 起相似检索也这么办。可归一这边原来只回 `null`,于是三件完全不同的事被压成一句话
208
+ * 「找不到这条记忆(id 写错了,或它已经被合并掉)」:
209
+ * - 真没有(missing):这句才对;
210
+ * - 撞车(ambiguous):这条记忆**在**,只是前缀不够——这么说等于把「你给短了」说成「它没了」;
211
+ * - 这次没查成(unavailable,meow 没装配/超时/报错):连「有没有」都不知道,更不该下结论。
212
+ * 更糟的是补连队列:`flushPending` 见 `null` 就当「永远连不上」摘掉,面板还报「清掉 N 条(记忆已合并/删除)」。
213
+ * 所以归一必须回一个带 kind 的结构,让调用方各说各的话。
214
+ */
215
+ async function resolveIdDetail(id, exec) {
216
+ const raw = String(id ?? '').trim()
217
+ if (raw.length === 0) return { kind: 'missing', id: '', note: 'id 是空的' }
218
+ if (raw.length >= 36) return { kind: 'ok', id: raw }
219
+ const hit = idCache.get(raw)
220
+ if (hit !== undefined) return { kind: 'ok', id: hit }
221
+ const r = await tryCall('memory_read', { id: raw }, exec, '记忆')
222
+ const v = r.value
223
+ if (v && typeof v === 'object') {
224
+ if (v.ambiguous === true) {
225
+ // 原样带上 meow 的候选清单:口径只有一处,我们不重写它的措辞
226
+ return { kind: 'ambiguous', id: raw, note: String(v.note ?? '').trim(), candidates: String(v.candidates ?? '') }
227
+ }
228
+ if (v.found === true && typeof v.id === 'string') {
229
+ idCache.set(raw, v.id)
230
+ return { kind: 'ok', id: v.id }
231
+ }
232
+ return { kind: 'missing', id: raw, note: String(v.note ?? '').trim() }
233
+ }
234
+ // 没有可用的回执:工具没接上(桥拿不到 / 调用炸了),或者回来一个不是对象的东西。
235
+ // 这两种都只能算「没查成」——「找不到这条记忆」这个结论我们根本还没拿到依据。
236
+ return { kind: 'unavailable', id: raw, note: String(r.text ?? '').replace(/^未完成:/, '').slice(0, 120) }
237
+ }
238
+
239
+ /** 兼容旧调用点:只要完整 id 的地方用这个(拿不到就 null)。 */
240
+ async function resolveId(id, exec) {
241
+ const d = await resolveIdDetail(id, exec)
242
+ return d.kind === 'ok' ? d.id : null
243
+ }
244
+
245
+ /**
246
+ * 写记忆时顺手连线。三种「这次没连上」的情况都要落盘排队(见 lib/macro/links.js):
247
+ * 星图没接上 / 节点还没入图 / 单条连线报错。下次读记忆时自动补,不指望模型记得回来补。
248
+ */
249
+ async function applyLinks(anchorId, links, exec, label) {
250
+ const { items, drop } = linkArgs(links)
251
+ if (items.length === 0 && drop.total === 0) return ''
252
+ // 0.2.78:条目被筛光 / 不知道锚点是谁,这两种早退以前都是 `return ''`——
253
+ // 面板看起来跟没给 links 一样,而调用者以为「已经连上了」。
254
+ if (!anchorId) return linkDropNote({ ...drop, total: drop.total + items.length }, true)
255
+ if (items.length === 0) return linkDropNote(drop)
256
+ const anchor = (await resolveId(anchorId, exec)) ?? String(anchorId)
257
+ const state = await graphState(anchor, exec)
258
+ if (state !== 'ready') {
259
+ let queued = 0
260
+ // 排队不设条数上限(队列自己有 PENDING_MAX):星图还没就绪时,用户的每一条都得留下
261
+ for (const target of items) {
262
+ if (queuePending(anchor, target.id, target.note, state === 'unavailable' ? PENDING_REASONS.notReady : PENDING_REASONS.notBuilt)) queued += 1
263
+ }
264
+ const why =
265
+ state === 'unavailable'
266
+ ? '星图模块这次没接上(子插件未装配或配置关闭)'
267
+ : '星图还没建到这条记忆(约 12s 一轮巡检)'
268
+ const droppedNote = linkDropNote(drop)
269
+ const queuedText = `关联已排队 ${queued} 条(${why}):之后读记忆时自动补连,不用你再提醒;也可以现在就 memory_link(action="link", a="${anchor}", b="…") 手动连。`
270
+ return droppedNote ? `${queuedText}\n\n${droppedNote}` : queuedText
271
+ }
272
+ const lines = []
273
+ let queued = 0
274
+ // 单批条数(LINKS_PER_WRITE)与单批总时长(linkBatchMs)两道闸:超出的都排队,一条都不丢
275
+ const head = items.slice(0, linksPerWrite)
276
+ const overflow = items.slice(linksPerWrite)
277
+ const deadline = Date.now() + linkBatchMs
278
+ const later = []
279
+ for (let i = 0; i < head.length; i += 1) {
280
+ const target = head[i]
281
+ const left = deadline - Date.now()
282
+ if (left < MIN_STEP_MS) {
283
+ // 一批的总账到点了:这一条和后面的都排进队列,文案里如实说
284
+ later.push(...head.slice(i))
285
+ break
286
+ }
287
+ const d = await resolveIdDetail(target.id, exec)
288
+ // 0.2.54:三种「归不出来」各说各的,别一律说成「找不到(id 写错了/已被合并)」
289
+ if (d.kind === 'ambiguous') {
290
+ lines.push(`- ${target.id}:${LINK_AMBIGUOUS_LINE}`)
291
+ continue
292
+ }
293
+ if (d.kind === 'unavailable') {
294
+ const queued1 = queuePending(anchor, target.id, target.note, PENDING_REASONS.notReady)
295
+ if (queued1) queued += 1
296
+ lines.push(
297
+ `- ${target.id}:${LINK_UNAVAILABLE_LINE}${queued1 ? ',已排队等补连' : ''}`,
298
+ )
299
+ continue
300
+ }
301
+ if (d.kind !== 'ok') {
302
+ lines.push(`- ${target.id}:${LINK_MISSING_LINE}`)
303
+ continue
304
+ }
305
+ const full = d.id
306
+ const raw = await withBudget(tryCall('nebula_link', { action: 'link', a: anchor, b: full, note: target.note }, exec, '星图连线'), Math.min(linkCallMs, left))
307
+ if (isTimedOut(raw)) {
308
+ // 掐断不等于失败:星图可能已经把边写进去了(addLink 幂等),所以只说「这次没等到」,
309
+ // 记一条待补——用户填的 links 一个字都不能丢。
310
+ queuePending(anchor, full, target.note, PENDING_REASONS.slow)
311
+ queued += 1
312
+ lines.push(`- ${target.id}:星图 ${describeMs(Math.min(linkCallMs, left))}内没回应(多半在建图),已排队等补连`)
313
+ continue
314
+ }
315
+ const r = raw
316
+ if (isLinkedText(r.text)) {
317
+ lines.push(`- ${target.id}:已连上`)
318
+ continue
319
+ }
320
+ if (isSelfPairText(r.text)) {
321
+ // 自己连自己:星图明确拒绝,排队也没用,如实转述
322
+ lines.push(`- ${target.id}:${String(r.text).split('\n')[0]}`)
323
+ continue
324
+ }
325
+ // 「找不到这两条记忆」不是永久失败(0.2.30):记忆刚写完、星图还没建到节点时它也这么回。
326
+ // 这时**必须排队**——否则用户写了 links 等于没写,而且我们还会把责任说成「id 写错了」。
327
+ const notBuilt = saysMissingNodes(r.text)
328
+ if (queuePending(anchor, full, target.note, notBuilt ? PENDING_REASONS.notBuilt : PENDING_REASONS.failed)) queued += 1
329
+ lines.push(`- ${target.id}:${notBuilt ? '星图还没建到它(约 12s 一轮巡检),已排队等补连' : String(r.text).split('\n')[0]}`)
330
+ }
331
+ // 这一次没轮到的(超出单批条数 / 超出单批总时长)全部排队:宁可晚几分钟补上,也不能悄悄消失
332
+ for (const target of [...overflow, ...later]) {
333
+ if (queuePending(anchor, target.id, target.note, PENDING_REASONS.deferred)) queued += 1
334
+ }
335
+ const notes = []
336
+ // 0.2.78:筛掉的条目也要占一行——否则「连了 1 条」会被读成「3 条都连了」
337
+ const droppedNote = linkDropNote(drop)
338
+ if (droppedNote) notes.push(droppedNote)
339
+ if (queued > 0) notes.push(`另有 ${queued} 条排队等补连(读记忆时自动重试)。`)
340
+ if (overflow.length > 0) notes.push(`一次最多当场连 ${linksPerWrite} 条,多出来的 ${overflow.length} 条已排队。`)
341
+ if (later.length > 0) notes.push(`整批最多连 ${describeMs(linkBatchMs)},没连完的 ${later.length} 条已排队。`)
342
+ const tail = notes.length > 0 ? `\n${notes.join(' ')}` : ''
343
+ return `星图连线(${label}):\n${lines.join('\n')}${tail}`
344
+ }
345
+
346
+ let lastFlush = 0
347
+
348
+ /**
349
+ * 读路径顺手补连。节流 30s,预算 `flushBudgetMs`——宁可不补,也不能把一次读拖成几十秒。
350
+ * 星图整体不可用时立刻停手,不把队列当靶子打。
351
+ */
352
+ async function flushLinks(exec) {
353
+ if (Date.now() - lastFlush < flushThrottleMs) return
354
+ lastFlush = Date.now()
355
+ try {
356
+ await flushPending({ tryCall, isLinked: isLinkedText, resolve: resolveIdDetail, exec, budgetMs: flushBudgetMs, limit: flushLimit })
357
+ } catch {
358
+ /* 补连是锦上添花,失败不影响这次读 */
359
+ }
360
+ }
361
+
362
+ /** 运维面板手动补一轮(不节流,但同样有预算上限)。面板不传数,走的是同一条出口。 */
363
+ async function flushNow(exec, opts = {}) {
364
+ lastFlush = Date.now()
365
+ const budgetMs = opts.budgetMs ?? panelBudgetMs
366
+ const limit = opts.limit ?? panelLimit
367
+ return flushPending({ tryCall, isLinked: isLinkedText, resolve: resolveIdDetail, exec, budgetMs, limit })
368
+ }
369
+
370
+ return {
371
+ call,
372
+ tryCall,
373
+ toolWaitMs,
374
+ linkWaitMs,
375
+ flushThrottleMs,
376
+ linkCallMs,
377
+ linkBatchMs,
378
+ linksPerWrite,
379
+ flushBudgetMs,
380
+ flushLimit,
381
+ panelBudgetMs,
382
+ panelLimit,
383
+ pollStepMs,
384
+ graphState,
385
+ resolveId,
386
+ resolveIdDetail,
387
+ applyLinks,
388
+ flushLinks,
389
+ flushNow,
390
+ }
391
+ }