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,411 @@
1
+ import { LEVELS, PROJECT_SUBCATEGORIES, TEXT_OUT, pick } from '../shared.js'
2
+ import { LINKS_SCHEMA } from '../linkflow.js'
3
+ import { cardTitle } from '../panel.js'
4
+ import { supersedeMode, supersedeAdvice, supersedeSuggestNote, supersedeApplyLead } from '../supersede.js'
5
+
6
+ // [macro-fusion 0.2.117] 取代关系:写新的同时,把被它顶掉的旧的标成 stale 并在正文留一句
7
+ // 「(已被取代:<新 id>「<新内容开头>」,<日期>)」。
8
+ //
9
+ // 为什么要有这个口子:dream 的冲突块从 0.2.114 起每轮都在说「取新的、旧的标『(已被取代:…)』或设
10
+ // stale」,但工具面里根本没有一步能同时做到——只能先 remember 再逐条 update,中间忘一步就变成两条并排
11
+ // 活着。主人对「遗忘」的态度也很明确:不删,只矫正。所以这里做的是**改写 + 降格**,不是删除:
12
+ // 旧条目仍在库里、仍可 memory_read、正文里指得到新的那条。
13
+ const SUPERSEDE_MAX = 5
14
+ const SUPERSEDE_MARK = '(已被取代:'
15
+ const SUPERSEDE_HEAD = 24
16
+
17
+ /** 把 caller 给的 supersedes 归一:去空、去重、限条数,并把「超出的条数」原样报回去(不许静默截断)。 */
18
+ function supersedeAskedOf(raw) {
19
+ if (raw === undefined || raw === null) return { ids: [], extra: [] }
20
+ const list = Array.isArray(raw) ? raw : [raw]
21
+ const asked = []
22
+ for (const one of list) {
23
+ if (typeof one !== 'string') continue
24
+ const id = one.trim()
25
+ if (id.length === 0) continue
26
+ if (!asked.includes(id)) asked.push(id)
27
+ }
28
+ return { ids: asked.slice(0, SUPERSEDE_MAX), extra: asked.slice(SUPERSEDE_MAX) }
29
+ }
30
+
31
+ function dayStamp(now = new Date()) {
32
+ const p = (n) => String(n).padStart(2, '0')
33
+ return `${now.getFullYear()}-${p(now.getMonth() + 1)}-${p(now.getDate())}`
34
+ }
35
+
36
+ /** 那半句取代话:只写「谁顶掉的、什么时候」,不写判决——正文归 caller,我们只加一句事实。 */
37
+ function supersedeLineOf({ newId, newHead, at }) {
38
+ const head = String(newHead ?? '').replace(/\s+/g, ' ').trim().slice(0, SUPERSEDE_HEAD)
39
+ const who = String(newId).slice(0, 8)
40
+ return `${SUPERSEDE_MARK}${who}${head ? `「${head}」` : ''},${dayStamp(at)})`
41
+ }
42
+
43
+ function shortId(id) {
44
+ return String(id ?? '').slice(0, 8)
45
+ }
46
+
47
+ // [macro-fusion 0.2.117] 短 id 的尴尬:meow 的 id 形如 `0mwowj2h2-<32 hex>`,前缀是时间编码——
48
+ // **同一秒里先后写下的两条,前 8 位会一模一样**。于是「拿刚记住的那条 id 前 8 位去取代它的前一条」
49
+ // 这个最自然的用法,恰好会把新条目自己也命中。memory_read 这时回 ambiguous,候选 id 就在它的
50
+ // candidates 文字里:把新条目排除掉之后如果只剩一条,那不是「替你挑」,是**排除法**。
51
+ const CANDIDATE_ID = /0m[0-9a-z]+-[0-9a-f]{32}/g
52
+
53
+ function candidateIdsOf(v) {
54
+ const out = []
55
+ for (const one of String(v?.candidates ?? '').match(CANDIDATE_ID) ?? []) if (!out.includes(one)) out.push(one)
56
+ return out
57
+ }
58
+
59
+ /** 歧义回执里到底命中几条:优先数候选 id,捞不到 id 时退回它自己那句「命中了 N 条」。 */
60
+ function ambiguousCountOf(v, ids) {
61
+ if (ids.length > 0) return ids.length
62
+ const m = /(\d+)\s*条/.exec(String(v?.note ?? ''))
63
+ return m ? Number(m[1]) : 0
64
+ }
65
+
66
+ /**
67
+ * 逐条把旧条目改写成「已被取代」。
68
+ *
69
+ * 每一种失败都必须单独说一句——尤其「没找到」和「没动它」:这两件事在回执里长得像是成功,
70
+ * 而它们恰恰是「旧条目还活着、还占着召回位」的那种状态。
71
+ */
72
+ // ── 写入端巩固(0.4.0 P2 / PLAN-0.4 §5 P2)────────────────────────────────────────────
73
+ //
74
+ // 为什么不是「同 project 同一天写到第 4 条就触发」:那是数数,不是信号。一天里写四条互不相干的
75
+ // 事也会触发,而同一件事连写三条(最该巩固的那种)反而不触发。按 CLS 的「巩固触发」改写为
76
+ // 三条件同时成立——
77
+ // ① 重复模式:同 project 内、keywords 交集 ≥ 2 的条目在近 7 天里 ≥ 3 条(同一模式反复暴露);
78
+ // ② 慢路有空位:该 project 近 7 天语义层(rules / fact)少于 cap 条才准新增;满了应该**并进
79
+ // 已有的那条**(memory_update append),而不是再造一条同义摘要;
80
+ // ③ 未巩固:这批条目正文里还没有巩固句(CONSOLIDATE_MARK),防同一批反复触发。
81
+ //
82
+ // 三档:off(一个字都不变)/ suggest(只贴材料,库里一个字没动)/ write(才自动落那条摘要)。
83
+ // 配置写坏一律当 off——退到最保守那一档。
84
+ const CONSOLIDATE_MAX = 3
85
+ const CONSOLIDATE_DAYS = 7
86
+ const CONSOLIDATE_MIN_REPEAT = 3
87
+ const CONSOLIDATE_MIN_SHARE = 2
88
+ const CONSOLIDATE_SEMANTIC_CAP = 8
89
+ const CONSOLIDATE_MARK = '(已巩固进:'
90
+ const CONSOLIDATE_HEAD = 40
91
+ const CONSOLIDATE_ROWS = 20
92
+ const CONSOLIDATE_CHARS = 300
93
+ const CONSOLIDATE_LEVELS = ['rules', 'fact']
94
+
95
+ export function consolidateMode(config = {}) {
96
+ const raw = config?.consolidate
97
+ // 没配就是默认那一档(suggest)——与 index.js 的 MACRO_DEFAULTS 对齐,免得「默认 suggest」只在
98
+ // schema 层成立、函数层回 off,两处说法打架。唯独显式写错才退到 off。
99
+ if (raw === undefined || raw === null) return 'suggest'
100
+ const mode = typeof raw === 'string' ? raw.trim().toLowerCase() : ''
101
+ return mode === 'suggest' || mode === 'write' || mode === 'off' ? mode : 'off'
102
+ }
103
+
104
+ function kwOf(list) {
105
+ const out = new Set()
106
+ for (const one of Array.isArray(list) ? list : []) {
107
+ const word = String(one).trim().toLowerCase()
108
+ if (word !== '') out.add(word)
109
+ }
110
+ return out
111
+ }
112
+
113
+ function headOf(text, n = CONSOLIDATE_HEAD) {
114
+ return String(text ?? '').replace(/\s+/g, ' ').trim().slice(0, n)
115
+ }
116
+
117
+ /**
118
+ * 纯函数:把检索回执里的 hits 变成巩固信号。不起 IO、不读时钟,判据可以逐条钉。
119
+ * `cap = 0` 表示不限(永远有空位)。
120
+ */
121
+ export function consolidateSignals({ hits = [], semanticHits = [], newId = '', keywords = [], cap = CONSOLIDATE_SEMANTIC_CAP } = {}) {
122
+ const mine = kwOf(keywords)
123
+ const rows = []
124
+ for (const hit of Array.isArray(hits) ? hits : []) {
125
+ const id = String(hit?.id ?? '')
126
+ if (id === '' || id === String(newId ?? '')) continue
127
+ const shared = [...kwOf(hit?.keywords)].filter((word) => mine.has(word))
128
+ if (shared.length < CONSOLIDATE_MIN_SHARE) continue
129
+ const body = String(hit?.content ?? '')
130
+ rows.push({
131
+ id,
132
+ id8: shortId(id),
133
+ level: String(hit?.level ?? ''),
134
+ day: String(hit?.created_at ?? hit?.createdAt ?? '').slice(0, 10),
135
+ head: headOf(body),
136
+ body,
137
+ consolidated: body.includes(CONSOLIDATE_MARK),
138
+ shared,
139
+ })
140
+ }
141
+ const semanticCount = Array.isArray(semanticHits) ? semanticHits.length : 0
142
+ const repeated = rows.length >= CONSOLIDATE_MIN_REPEAT
143
+ const room = Number(cap) === 0 || semanticCount < Number(cap)
144
+ const pending = rows.some((one) => !one.consolidated)
145
+ const kind = repeated && pending ? (room ? 'fire' : 'merge') : 'none'
146
+ return { rows, repeated, room, pending, semanticCount, cap: Number(cap), kind, fire: kind === 'fire' }
147
+ }
148
+
149
+ /** write 态落什么:规则版摘要。事件日期必须在正文开头——temporal 的收益全来自这里。 */
150
+ export function consolidateSummary({ rows = [], project = '', keywords = [], at = new Date() } = {}) {
151
+ const words = [...kwOf(keywords)].slice(0, 6).join('、')
152
+ const body = rows.slice(0, CONSOLIDATE_MAX).map((one) => `- ${one.head}`).join('\n')
153
+ const head = `${dayStamp(at)} · 巩固(${String(project || '全局').trim() || '全局'})${words ? `:${words}` : ''}`
154
+ return `${head}\n${body}`.slice(0, CONSOLIDATE_CHARS)
155
+ }
156
+
157
+ /** 巩固句:改动最小的一句话,只写「并进哪条、什么时候」,不写判决(与取代句同款形状)。 */
158
+ export function consolidateLineOf({ newId, newHead, at }) {
159
+ const head = headOf(newHead, SUPERSEDE_HEAD)
160
+ return `${CONSOLIDATE_MARK}${shortId(newId)}${head ? `「${head}」` : ''},${dayStamp(at)})`
161
+ }
162
+
163
+ /** suggest 那一段材料:只有「该做什么」和现成的调用形状,不含任何已落库的声明。 */
164
+ function consolidateNote({ signal, project, keywords }) {
165
+ if (!signal || signal.kind === 'none') return ''
166
+ const rows = signal.rows.slice(0, CONSOLIDATE_MAX)
167
+ const list = rows.map((one) => `${one.id8}(${one.level || '—'},${one.day || '日期未知'})「${one.head}」`).join('\n ')
168
+ if (signal.kind === 'merge') {
169
+ return [
170
+ `— 该并条,不是再加一条 —`,
171
+ `同 project 近 ${CONSOLIDATE_DAYS} 天里已经有 ${signal.semanticCount} 条语义层(rules/fact),到上限 ${signal.cap} 了。再写一条同义摘要只会让这一层更稀。`,
172
+ `这批:\n ${list}`,
173
+ `做法:memory_search 找到承载这件事的那条语义条目,用 memory_update append 把这次的增量补进去(不新增条目)。`,
174
+ ].join('\n')
175
+ }
176
+ const ids = rows.map((one) => `'${one.id8}'`).join(', ')
177
+ const words = [...kwOf(keywords)].slice(0, 6).join('、')
178
+ return [
179
+ `— 同一件事已经写了 ${signal.rows.length} 条,该巩固了 —`,
180
+ `这批:\n ${list}`,
181
+ `如果它们讲的是同一件事:写一条 topic(事件日期放正文开头),再用 supersedes 指向上面这几条(旧条不删,只加一句「已巩固进」)。`,
182
+ ` memory_remember(content: '${dayStamp(new Date())} · 谁 / 何时 / 为什么 / 结论', level: 'topic', project: '${String(project || '全局').trim() || '全局'}', keywords: [${words ? `'${words}'` : ''}], importance: 2, supersedes: [${ids}])`,
183
+ `(这段只是提示:库里这一个字都没动。要自动落,配置项 consolidate 设成 write。)`,
184
+ ].join('\n')
185
+ }
186
+
187
+ async function consolidateAfterWrite({ flow, exec, mode, newId, project, keywords }) {
188
+ const words = [...kwOf(keywords)].join(' ')
189
+ if (words === '') return ''
190
+ // internal: true —— 这两枪是我自己为了判「该不该巩固」打的,不是端给用户看的结果。
191
+ // 不关记账的话,写完一条紧接着问 memory_search({mode:'similar', id}) 会得到「候选一条都没有」
192
+ // (同话题的这批刚被记进 seen),而且 bumpHit 会把 hit_count 抬起来污染通胀体检。
193
+ const base = { query: words, project, k: CONSOLIDATE_ROWS, days: CONSOLIDATE_DAYS, status: 'active', content_max: 0, internal: true }
194
+ const got = await flow.tryCall('memory_search', base, exec, '巩固检查:同话题条目')
195
+ if (!got.value) return ''
196
+ const hits = Array.isArray(got.value.hits) ? got.value.hits : []
197
+ // 语义层条数:检索没有 importance 过滤,所以这里数的是 rules/fact 全部(偏严=更容易判「有空位」,
198
+ // 但绝不会把一个塞满的层看成空的)。
199
+ const sem = await flow.tryCall('memory_search', { ...base, level: CONSOLIDATE_LEVELS.join(','), k: CONSOLIDATE_ROWS }, exec, '巩固检查:语义层')
200
+ const signal = consolidateSignals({ hits, semanticHits: Array.isArray(sem.value?.hits) ? sem.value.hits : [], newId, keywords })
201
+ const note = consolidateNote({ signal, project, keywords })
202
+ if (note === '') return ''
203
+ if (mode !== 'write' || signal.kind !== 'fire') return note
204
+ // merge 态即使配了 write 也只回提示:语义层满了该并进已有那条,但「哪条承载这件事」不是规则能判的,
205
+ // 自动挑一条并进去比不并更糟(会把两件事焊在一起)。
206
+ // write:真落一条 topic,再给被合并的条目加一句巩固句(status 不动——巩固不是作废)。
207
+ const summary = consolidateSummary({ rows: signal.rows, project, keywords })
208
+ const wrote = await flow.tryCall('memory_remember', { content: summary, level: 'topic', project, keywords: [...kwOf(keywords)].slice(0, 8), importance: 2 }, exec, '落巩固摘要')
209
+ const newOne = String(wrote.value?.id ?? '')
210
+ if (newOne === '') return `${note}\n\n(这条提示没能自动落库:上游没回新条目 id。按上面的调用形状手动写一次即可。)`
211
+ const lines = [`已自动落一条巩固摘要 ${shortId(newOne)}:${summary.split('\n')[0]}`]
212
+ for (const one of signal.rows.slice(0, CONSOLIDATE_MAX)) {
213
+ if (one.consolidated) {
214
+ lines.push(`- ${one.id8} 正文里已经有一句「已巩固进」,没重复追加`)
215
+ continue
216
+ }
217
+ const next = `${one.body}${one.body.endsWith('\n') || one.body.length === 0 ? '' : ' '}${consolidateLineOf({ newId: newOne, newHead: summary, at: new Date() })}`
218
+ const patched = await flow.tryCall('memory_update', { id: one.id, content: next }, exec, '加巩固句')
219
+ lines.push(
220
+ patched.value?.ok === true
221
+ ? `- ${one.id8} 正文末尾加了一句「已巩固进」`
222
+ : `- ${one.id8} 没写进库(它还是原样,别当成已经并进去了)`,
223
+ )
224
+ }
225
+ return `${note}\n\n${lines.join('\n')}`
226
+ }
227
+
228
+ async function markSuperseded({ flow, exec, ids, extra, newId, newHead, lead = '' }) {
229
+ const lines = []
230
+ for (const asked of ids) {
231
+ // 「这条是不是就是刚写的那条」不能靠字符串前缀先判——同一秒写下的两条 id 前 8 位一模一样,
232
+ // 先判就会把真正要处置的旧条目也当自己跳过(0.2.117 探针就是这么红的)。先读,读出来再判。
233
+ const got = await flow.tryCall('memory_read', { id: asked }, exec, '读被取代的旧条目')
234
+ let v = got.value
235
+ let via = ''
236
+ if (v && v.ambiguous === true) {
237
+ const ids = candidateIdsOf(v)
238
+ const others = ids.filter((one) => one !== newId)
239
+ const n = ambiguousCountOf(v, ids)
240
+ if (ids.length > 0 && others.length === 1) {
241
+ const again = await flow.tryCall('memory_read', { id: others[0] }, exec, '读被取代的旧条目')
242
+ if (again.value?.id === others[0]) {
243
+ v = again.value
244
+ via = `短 id ${asked} 先把刚写的 ${shortId(newId)} 也命中了(一共 ${n} 条),把它排除后只剩 ${shortId(others[0])}——按这条办的`
245
+ }
246
+ }
247
+ if (!via) {
248
+ lines.push(`- ${asked} 短 id 命中 ${n} 条,没替你挑一条——换成完整 id 再来一次,这 ${n} 条都还没动`)
249
+ continue
250
+ }
251
+ }
252
+ if (v && v.id === newId) {
253
+ lines.push(`- ${shortId(newId)} 就是这次刚写的那一条,跳过了(一条记忆不能取代自己)`)
254
+ continue
255
+ }
256
+ if (!v || v.found === false || !v.id) {
257
+ lines.push(`- ${asked} 没找到(可能已归档或删除)——它没有被改`)
258
+ continue
259
+ }
260
+ const id8 = shortId(v.id)
261
+ const status = String(v.status ?? 'active')
262
+ if (status === 'archived') {
263
+ lines.push(`- ${id8}(${String(v.level ?? '')})已经是 archived(作废),没动它`)
264
+ continue
265
+ }
266
+ const oldText = String(v.content ?? '')
267
+ if (oldText.includes(SUPERSEDE_MARK)) {
268
+ lines.push(`- ${id8}(${String(v.level ?? '')})正文里已经有一句「已被取代」,没重复追加`)
269
+ continue
270
+ }
271
+ const next = `${oldText}${oldText.endsWith('\n') || oldText.length === 0 ? '' : ' '}${supersedeLineOf({ newId, newHead, at: new Date() })}`
272
+ const patched = await flow.tryCall('memory_update', { id: v.id, content: next, status: 'stale' }, exec, '标为已被取代')
273
+ const ok = patched.value?.ok === true
274
+ if (!ok) {
275
+ const why = String(patched.text ?? '').trim()
276
+ lines.push(`- ${id8}(${String(v.level ?? '')})找到了但没写进库${why ? `:${why.split('\n')[0]}` : ''}——它还是原样,别当成已经处置`)
277
+ continue
278
+ }
279
+ lines.push(
280
+ status === 'stale'
281
+ ? `- ${id8}(${String(v.level ?? '')})本来就是 stale,只补了一句「已被取代」`
282
+ : `- ${id8}(${String(v.level ?? '')})已标 stale,正文末尾补了一句「已被取代」`,
283
+ )
284
+ // 是靠排除法认出来的时候,必须把「为什么是这条」写出来——否则回执读起来像我替你挑了一条。
285
+ if (via) lines.push(` · ${via}`)
286
+ }
287
+ const head = [`取代(新写的 ${shortId(newId)} 接管这些条目的位置;旧条目一条都没删,只是不再算「在用」):`]
288
+ const tail = []
289
+ if (extra.length > 0) {
290
+ tail.push(`超出 ${SUPERSEDE_MAX} 条上限的 ${extra.length} 条这次没有处理:${extra.join('、')}——要一起处置就分两次调。`)
291
+ }
292
+ tail.push('反悔办法:旧条目都还在库里,memory_update 把 status 改回 active、再删掉那句取代话就恢复原样。')
293
+ const out = [...(lead ? [lead] : []), ...head, ...lines, ...tail]
294
+ return out.join('\n')
295
+ }
296
+
297
+ export function createRemember({ flow, config = {} }) {
298
+ return {
299
+ name: 'memory_remember',
300
+ description:
301
+ '把一条记忆写进宏记忆库(7 层 level + project 六子类)。与已有条目高度重复会自动合并;可用 links 顺手把关联固化进星图;被这次写入顶掉的旧条目用 supersedes 列出来,会标 stale 并在正文留下取代句(不删除)。',
302
+ parameters: {
303
+ type: 'object',
304
+ additionalProperties: false,
305
+ properties: {
306
+ content: { type: 'string', description: '要记住的内容。fact/lesson 一句话(≤60 字),topic ≤300 字;涉及用户原话必须保留措辞。' },
307
+ project: { type: 'string', description: "归属:'全局' 或项目名;同时属于多个项目用英文逗号分隔。" },
308
+ keywords: { type: 'array', items: { type: 'string' }, description: '8–13 个检索关键词,按「用户提到哪些词时该召回它」反向想。' },
309
+ importance: { type: 'integer', description: '4=红线致命 3=主人强调/全局适用 2=抽象决策 1=琐碎' },
310
+ level: { type: 'string', enum: LEVELS, description: '记忆层级,默认 fact。' },
311
+ subcategory: { type: 'string', enum: PROJECT_SUBCATEGORIES, description: 'level=project 专用子类。' },
312
+ goal: { type: 'string', description: 'topic 的目标句(这个窗口要把什么事做成)。' },
313
+ corrected: { type: 'boolean', description: '是否来自主人纠正(level=lesson 用)。' },
314
+ // [macro-fusion 0.2.87] 合并以前是「拿这次的参数把旧条目整条盖掉」:关键词被换掉、归属被搬走、
315
+ // 更短的内容把旧细节吃掉。现在合并只做加法(关键词并集 / 归属不动 / 变短默认不换),
316
+ // 这个开关是「我确实要压缩」的逃生口——不给这个口子,保护就变成了不能更新。
317
+ overwrite: {
318
+ type: 'boolean',
319
+ description: '合并时是否允许用这次的内容覆盖旧内容(默认 false)。默认只在「新内容更短且不是逐字同一句」时拒换;确实要压缩就传 true。',
320
+ },
321
+ // [macro-fusion 0.2.117] 取代不是删除:旧条目留着,只是降格成 stale 并在正文里指向新的那条。
322
+ supersedes: {
323
+ type: 'array',
324
+ items: { type: 'string' },
325
+ description: '这次写入顶掉的旧条目 id(最多 5 条,短 id 前 8 位也行)。被列出的条目会标 stale 并在正文末尾加一句「(已被取代:<新 id>「<新内容开头>」,<日期>)」——不删除、可 memory_read、可反悔。',
326
+ },
327
+ links: LINKS_SCHEMA,
328
+ },
329
+ required: ['content', 'project', 'keywords', 'importance'],
330
+ },
331
+ output: TEXT_OUT,
332
+ async execute(args, exec) {
333
+ const payload = pick(args, ['content', 'level', 'project', 'subcategory', 'goal', 'importance', 'corrected', 'keywords', 'overwrite'])
334
+ const main = await flow.call('memory_remember', payload, exec)
335
+ // [macro-fusion 0.2.50] 上游回执空掉时不能把「没写进去」当成功:这里先看一眼有没有字。
336
+ const said = String(main.text ?? '').trim()
337
+ const sup = supersedeAskedOf(args.supersedes)
338
+ if (said.length === 0) {
339
+ const skip =
340
+ sup.ids.length > 0 || sup.extra.length > 0
341
+ ? '\n\n取代这次一条都没做:新条目连 id 都没拿到,不能把旧的指向一个不存在的新条目。'
342
+ : ''
343
+ return `写入这次没有任何回执(既没说写进了哪一层,也没说为什么没写)——这不是「已经记住了」:先 memory_search 查一眼这条内容在不在库里,再决定要不要重试。${skip}`
344
+ }
345
+ const newId = main.value?.id
346
+ const out = [said]
347
+ if (sup.ids.length > 0 || sup.extra.length > 0) {
348
+ if (!newId) {
349
+ out.push('取代这次一条都没做:新条目没拿到 id(上游只回了文字),没有「新 id」可写进取代句。先用 memory_search 找到这条的新 id,再逐条 memory_update。')
350
+ } else {
351
+ out.push(
352
+ await markSuperseded({
353
+ flow,
354
+ exec,
355
+ ids: sup.ids,
356
+ extra: sup.extra,
357
+ newId,
358
+ newHead: typeof args.content === 'string' ? args.content : '',
359
+ }),
360
+ )
361
+ }
362
+ }
363
+ // [macro-fusion 0.4.0] P3:人没点名要取代时,替人看一眼「库里有没有同一件事的旧说法」。
364
+ // 默认 suggest 只把建议端出来(一个字不动库);apply 才真走 markSuperseded——两条路复用同一个处置
365
+ // 通道,免得「自动取代」和「人点名的取代」出现两套行为。off 连那一枪检索都不打。
366
+ const autoMode = supersedeMode(config)
367
+ if (autoMode !== 'off' && newId) {
368
+ const cands = await supersedeAdvice({
369
+ flow,
370
+ exec,
371
+ content: typeof args.content === 'string' ? args.content : '',
372
+ project: args.project,
373
+ level: args.level,
374
+ keywords: args.keywords,
375
+ newId,
376
+ // 人已经点名要取代的那几条不再重复建议:他刚刚已经处置过了。
377
+ skipIds: [...sup.ids, ...sup.extra],
378
+ })
379
+ if (cands.length > 0) {
380
+ if (autoMode === 'apply') {
381
+ out.push(
382
+ await markSuperseded({
383
+ flow,
384
+ exec,
385
+ ids: cands.map((one) => one.id),
386
+ extra: [],
387
+ newId,
388
+ newHead: typeof args.content === 'string' ? args.content : '',
389
+ lead: supersedeApplyLead(cands),
390
+ }),
391
+ )
392
+ } else {
393
+ out.push(supersedeSuggestNote(cands))
394
+ }
395
+ }
396
+ }
397
+ const linked = await flow.applyLinks(newId, args.links, exec, 'remember')
398
+ if (linked) out.push(linked)
399
+ // 巩固放在最后:此时新条已落库、id 已拿到,而且取代已经做完——巩固材料里不该再出现刚被顶掉的那条。
400
+ const mode = consolidateMode(config)
401
+ if (mode !== 'off' && newId) {
402
+ const note = await consolidateAfterWrite({ flow, exec, mode, newId, project: args.project, keywords: args.keywords })
403
+ if (note) out.push(note)
404
+ }
405
+ return out.join('\n\n')
406
+ },
407
+ presentCall(args) {
408
+ return { card: 'generic', title: cardTitle('写入记忆', args.project), kind: 'write' }
409
+ },
410
+ }
411
+ }