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.
- package/LICENSE +21 -0
- package/README.md +506 -2
- package/cordis.patch.yml +6 -0
- package/lib/client.js +3623 -0
- package/lib/index.js +502 -0
- package/lib/macro/brand.js +82 -0
- package/lib/macro/bridge.js +158 -0
- package/lib/macro/chain.js +206 -0
- package/lib/macro/contract.js +471 -0
- package/lib/macro/cost.js +164 -0
- package/lib/macro/defs/admin.js +442 -0
- package/lib/macro/defs/dream.js +24 -0
- package/lib/macro/defs/link.js +257 -0
- package/lib/macro/defs/project.js +25 -0
- package/lib/macro/defs/read.js +160 -0
- package/lib/macro/defs/remember.js +411 -0
- package/lib/macro/defs/search.js +871 -0
- package/lib/macro/defs/update.js +161 -0
- package/lib/macro/dreamledger.js +1398 -0
- package/lib/macro/facade.js +135 -0
- package/lib/macro/fusion.js +182 -0
- package/lib/macro/linkflow.js +391 -0
- package/lib/macro/links.js +448 -0
- package/lib/macro/neighbor.js +209 -0
- package/lib/macro/panel.js +96 -0
- package/lib/macro/prompt.js +139 -0
- package/lib/macro/provenance.js +148 -0
- package/lib/macro/render.js +35 -0
- package/lib/macro/revisions.js +253 -0
- package/lib/macro/shared.js +113 -0
- package/lib/macro/store.js +103 -0
- package/lib/macro/supersede.js +197 -0
- package/lib/macro/tokencost.js +90 -0
- package/lib/macro/tools.js +67 -0
- package/package.json +54 -4
- package/vendor/VENDOR.json +23 -0
- package/vendor/dsh-memory-nebula/CONTRIBUTING.md +48 -0
- package/vendor/dsh-memory-nebula/LICENSE +21 -0
- package/vendor/dsh-memory-nebula/README.en.md +203 -0
- package/vendor/dsh-memory-nebula/README.md +253 -0
- package/vendor/dsh-memory-nebula/SECURITY.md +43 -0
- package/vendor/dsh-memory-nebula/SUPPORT.md +33 -0
- package/vendor/dsh-memory-nebula/cordis.patch.yml +4 -0
- package/vendor/dsh-memory-nebula/lib/client.js +105 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/index.js +279 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/ingest.js +230 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/meow.js +320 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/notes.js +305 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/sqlite.js +287 -0
- package/vendor/dsh-memory-nebula/lib/host/adapters/util.js +231 -0
- package/vendor/dsh-memory-nebula/lib/host/bridge.js +351 -0
- package/vendor/dsh-memory-nebula/lib/host/compress.js +97 -0
- package/vendor/dsh-memory-nebula/lib/host/demo.js +357 -0
- package/vendor/dsh-memory-nebula/lib/host/diagnostics.js +125 -0
- package/vendor/dsh-memory-nebula/lib/host/doctor.js +270 -0
- package/vendor/dsh-memory-nebula/lib/host/entities.js +230 -0
- package/vendor/dsh-memory-nebula/lib/host/graph.js +1762 -0
- package/vendor/dsh-memory-nebula/lib/host/graphcache.js +290 -0
- package/vendor/dsh-memory-nebula/lib/host/http.js +993 -0
- package/vendor/dsh-memory-nebula/lib/host/injectcfg.js +95 -0
- package/vendor/dsh-memory-nebula/lib/host/ledger.js +175 -0
- package/vendor/dsh-memory-nebula/lib/host/live.js +204 -0
- package/vendor/dsh-memory-nebula/lib/host/nebula.js +2105 -0
- package/vendor/dsh-memory-nebula/lib/host/page.js +75 -0
- package/vendor/dsh-memory-nebula/lib/host/path.js +83 -0
- package/vendor/dsh-memory-nebula/lib/host/recall.js +524 -0
- package/vendor/dsh-memory-nebula/lib/host/share.js +633 -0
- package/vendor/dsh-memory-nebula/lib/host/sources.js +266 -0
- package/vendor/dsh-memory-nebula/lib/host/store.js +333 -0
- package/vendor/dsh-memory-nebula/lib/host/text.js +410 -0
- package/vendor/dsh-memory-nebula/lib/host/transcripts.js +396 -0
- package/vendor/dsh-memory-nebula/lib/index.js +782 -0
- package/vendor/dsh-memory-nebula/lib/standalone.mjs +315 -0
- package/vendor/dsh-memory-nebula/lib/web/api.js +426 -0
- package/vendor/dsh-memory-nebula/lib/web/app.js +4172 -0
- package/vendor/dsh-memory-nebula/lib/web/i18n.js +580 -0
- package/vendor/dsh-memory-nebula/lib/web/index.html +174 -0
- package/vendor/dsh-memory-nebula/lib/web/nav.js +132 -0
- package/vendor/dsh-memory-nebula/lib/web/render.js +1890 -0
- package/vendor/dsh-memory-nebula/lib/web/space3d.js +1883 -0
- package/vendor/dsh-memory-nebula/lib/web/style.css +1402 -0
- package/vendor/dsh-memory-nebula/locale/en.json +7 -0
- package/vendor/dsh-memory-nebula/locale/zh.json +7 -0
- package/vendor/dsh-memory-nebula/market/assets/icon-180.png +0 -0
- package/vendor/dsh-memory-nebula/market/assets/icon.svg +40 -0
- package/vendor/dsh-memory-nebula/market/index.json +101 -0
- package/vendor/dsh-memory-nebula/package.json +87 -0
- package/vendor/dsh-memory-nebula/sidecar.ps1 +119 -0
- package/vendor/meow-memory/LICENSE +21 -0
- package/vendor/meow-memory/README.en.md +192 -0
- package/vendor/meow-memory/README.md +174 -0
- package/vendor/meow-memory/README.pt-br.md +180 -0
- package/vendor/meow-memory/cordis.patch.yml +7 -0
- package/vendor/meow-memory/lib/client.js +3344 -0
- package/vendor/meow-memory/lib/client.js.map +7 -0
- package/vendor/meow-memory/lib/index.js +9802 -0
- package/vendor/meow-memory/lib/index.js.map +7 -0
- package/vendor/meow-memory/lib/prompts/README.md +65 -0
- package/vendor/meow-memory/lib/prompts/en/dream-atomic.md +36 -0
- package/vendor/meow-memory/lib/prompts/en/dream-header.md +9 -0
- package/vendor/meow-memory/lib/prompts/en/dream-project-summary.md +12 -0
- package/vendor/meow-memory/lib/prompts/en/dream-topic.md +27 -0
- package/vendor/meow-memory/lib/prompts/en/external-memory-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/en/first-create-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/en/labels.md +98 -0
- package/vendor/meow-memory/lib/prompts/en/reflect.md +31 -0
- package/vendor/meow-memory/lib/prompts/en/system-guide.md +121 -0
- package/vendor/meow-memory/lib/prompts/en/tools.md +83 -0
- package/vendor/meow-memory/lib/prompts/en/welcome-guide.md +12 -0
- package/vendor/meow-memory/lib/prompts/pt-br/dream-atomic.md +36 -0
- package/vendor/meow-memory/lib/prompts/pt-br/dream-header.md +9 -0
- package/vendor/meow-memory/lib/prompts/pt-br/dream-project-summary.md +12 -0
- package/vendor/meow-memory/lib/prompts/pt-br/dream-topic.md +27 -0
- package/vendor/meow-memory/lib/prompts/pt-br/external-memory-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/pt-br/first-create-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/pt-br/labels.md +98 -0
- package/vendor/meow-memory/lib/prompts/pt-br/reflect.md +31 -0
- package/vendor/meow-memory/lib/prompts/pt-br/system-guide.md +121 -0
- package/vendor/meow-memory/lib/prompts/pt-br/tools.md +83 -0
- package/vendor/meow-memory/lib/prompts/pt-br/welcome-guide.md +12 -0
- package/vendor/meow-memory/lib/prompts/zh/dream-atomic.md +36 -0
- package/vendor/meow-memory/lib/prompts/zh/dream-header.md +9 -0
- package/vendor/meow-memory/lib/prompts/zh/dream-project-summary.md +19 -0
- package/vendor/meow-memory/lib/prompts/zh/dream-topic.md +27 -0
- package/vendor/meow-memory/lib/prompts/zh/external-memory-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/zh/first-create-notice.md +8 -0
- package/vendor/meow-memory/lib/prompts/zh/labels.md +98 -0
- package/vendor/meow-memory/lib/prompts/zh/reflect.md +30 -0
- package/vendor/meow-memory/lib/prompts/zh/system-guide.md +119 -0
- package/vendor/meow-memory/lib/prompts/zh/tools.md +83 -0
- package/vendor/meow-memory/lib/prompts/zh/welcome-guide.md +12 -0
- package/vendor/meow-memory/package.json +64 -0
|
@@ -0,0 +1,257 @@
|
|
|
1
|
+
import { TEXT_OUT } from '../shared.js'
|
|
2
|
+
import { pathAnswerKind } from '../contract.js'
|
|
3
|
+
import { cardTitle } from '../panel.js'
|
|
4
|
+
import {
|
|
5
|
+
LINK_CALL_MS,
|
|
6
|
+
PENDING_REASONS,
|
|
7
|
+
describeMs,
|
|
8
|
+
dropPending,
|
|
9
|
+
isLinkedText,
|
|
10
|
+
isNotReady,
|
|
11
|
+
isSelfPairText,
|
|
12
|
+
isTimedOut,
|
|
13
|
+
queuePending,
|
|
14
|
+
saysMissingNodes,
|
|
15
|
+
withBudget,
|
|
16
|
+
} from '../links.js'
|
|
17
|
+
|
|
18
|
+
/**
|
|
19
|
+
* [macro-fusion 0.2.59] 动作名和两端 id 都是「必填的枚举 / 必填的字段」,原来却是流水线自己往下走。
|
|
20
|
+
*
|
|
21
|
+
* `const action = String(args.action)` 只在**不认识**时抛错,`args.a` / `args.b` 干脆不校验:
|
|
22
|
+
* `resolveIdDetail(undefined)` 回 `{ kind: 'missing', id: '' }`,而下面那句
|
|
23
|
+
* `[ra === null ? args.a : null].filter(Boolean)` 会把 `undefined` 过滤掉——于是「缺参数」
|
|
24
|
+
* 假装成「两端都查到了」,payload 变成 `{ a: null, b: null }`,星图回一句「连线未完成」,
|
|
25
|
+
* 我们再把它读成「星图还没建到 / 暂时没落图」→ **排一条永远连不上的欠账**,还告诉用户
|
|
26
|
+
* 「已排队,读记忆时自动补」。缺参数是最常见的调用错误,却拿到了最像环境问题的那句话。
|
|
27
|
+
*/
|
|
28
|
+
const LINK_ACTIONS = ['link', 'unlink', 'mute', 'unmute', 'path']
|
|
29
|
+
|
|
30
|
+
/**
|
|
31
|
+
* [macro-fusion 0.2.60] 卡片上的中文名:动作键不是名字。
|
|
32
|
+
* 0.2.25 在 memory_admin 里已经修过一次同样的毛病(`记忆运维:stats` 没人看得懂),
|
|
33
|
+
* 这里漏了——`星图连线:path` 既不知道在做什么,还把只读的 path 标成了写操作。
|
|
34
|
+
*/
|
|
35
|
+
const LINK_ACTION_LABELS = {
|
|
36
|
+
link: '连一条手工线',
|
|
37
|
+
unlink: '断开手工线',
|
|
38
|
+
mute: '屏蔽自动关联',
|
|
39
|
+
unmute: '撤销屏蔽',
|
|
40
|
+
path: '看证据链',
|
|
41
|
+
}
|
|
42
|
+
|
|
43
|
+
/** 动作名归一:trim + 小写,空值=没给。不认识就一句都不动(和 0.2.58 的 mode 同一套规矩)。 */
|
|
44
|
+
function linkActionOf(args) {
|
|
45
|
+
const raw = args.action
|
|
46
|
+
if (typeof raw !== 'string' || raw.trim() === '') {
|
|
47
|
+
return { name: '', bad: true, missing: true, raw: raw === undefined ? '' : String(raw) }
|
|
48
|
+
}
|
|
49
|
+
const name = raw.trim().toLowerCase()
|
|
50
|
+
return { name, bad: !LINK_ACTIONS.includes(name), missing: false, raw: String(raw) }
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
function badActionText(act) {
|
|
54
|
+
const list = 'link / unlink / mute / unmute / path'
|
|
55
|
+
if (act.missing) {
|
|
56
|
+
return (
|
|
57
|
+
`memory_link 这次一条都没动:没给 action。\n` +
|
|
58
|
+
`要做的动作得写明:${list}(连一条手工线用 link,断开用 unlink,屏蔽推断错的自动关联用 mute,撤销屏蔽用 unmute,解释证据链用 path)。\n` +
|
|
59
|
+
'星图和记忆都没动——这不代表「连不上」,只是这一步还没开始。'
|
|
60
|
+
)
|
|
61
|
+
}
|
|
62
|
+
return (
|
|
63
|
+
`memory_link 这次一条都没动:action 给的是「${act.raw}」,这里只认 ${list}(大小写不敏感,前后空格会去掉)。\n` +
|
|
64
|
+
'这不代表「连不上」——是动作名没对上,星图和记忆都没动。\n' +
|
|
65
|
+
'对应关系:连一条手工线用 link;断开手工线用 unlink;屏蔽推断错的自动关联用 mute;撤销屏蔽用 unmute;解释两条记忆之间的证据链用 path(配 maxHops)。'
|
|
66
|
+
)
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
const LINK_END_FIELDS = [
|
|
70
|
+
['a', '起点记忆的 id'],
|
|
71
|
+
['b', '终点记忆的 id(path 的终点)'],
|
|
72
|
+
]
|
|
73
|
+
|
|
74
|
+
/** 缺哪端就说哪端。空串 / 纯空格也算没给——`String(undefined)` 曾经让这一支直接消失。 */
|
|
75
|
+
function missingEnds(args) {
|
|
76
|
+
const out = []
|
|
77
|
+
for (const [key, hint] of LINK_END_FIELDS) {
|
|
78
|
+
const v = args[key]
|
|
79
|
+
if (typeof v !== 'string' || v.trim() === '') out.push({ key, hint })
|
|
80
|
+
}
|
|
81
|
+
return out
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
function missingEndsText(act, ends) {
|
|
85
|
+
const which = ends.map((e) => `缺 ${e.key}(${e.hint})`).join(';')
|
|
86
|
+
return (
|
|
87
|
+
`memory_link(${act.name}) 这次一条都没动:${which}。\n` +
|
|
88
|
+
'id 从 memory_search / memory_read 的回执里抄,8 位短 id 也认。\n' +
|
|
89
|
+
'两端 id 没齐之前不会去动星图,也不会先排一条连不上的欠账——补上再调一次就行。'
|
|
90
|
+
)
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
/** 参数给错了动作:一样要说「这次没用上」,不能当没看见(0.2.57 / 0.2.58 的同一套口径)。 */
|
|
94
|
+
function linkNotes(action, args) {
|
|
95
|
+
const notes = []
|
|
96
|
+
if (args.maxHops !== undefined && action !== 'path') {
|
|
97
|
+
notes.push(`maxHops 只在 path 这个动作生效(这次是 ${action}),没用上。`)
|
|
98
|
+
}
|
|
99
|
+
if (typeof args.note === 'string' && args.note.trim() !== '' && action !== 'link' && action !== 'mute') {
|
|
100
|
+
notes.push(`note 只有 link / mute 会存下来(这次是 ${action}),这句理由没地方记。`)
|
|
101
|
+
}
|
|
102
|
+
return notes
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
export function createLink({ flow }) {
|
|
106
|
+
return {
|
|
107
|
+
name: 'memory_link',
|
|
108
|
+
description:
|
|
109
|
+
'管理星图(宏记忆 · 星图)里的连线:link 固化一条手工连线、unlink 断开手工线、mute 屏蔽推断错的自动关联(重建也不会再连)、unmute 撤销屏蔽、path 解释两条记忆之间的最短证据链。a/b 支持 8 位短 id。',
|
|
110
|
+
parameters: {
|
|
111
|
+
type: 'object',
|
|
112
|
+
additionalProperties: false,
|
|
113
|
+
properties: {
|
|
114
|
+
action: { type: 'string', enum: ['link', 'unlink', 'mute', 'unmute', 'path'], description: '要做的动作。' },
|
|
115
|
+
a: { type: 'string', description: '记忆 A 的 id(8 位短 id 也行)。' },
|
|
116
|
+
b: { type: 'string', description: '记忆 B 的 id(path 的终点,8 位短 id 也行)。' },
|
|
117
|
+
note: { type: 'string', description: '理由,方便以后回看为什么连/为什么屏蔽。' },
|
|
118
|
+
maxHops: { type: 'integer', description: 'path 最多几跳,默认 6。' },
|
|
119
|
+
},
|
|
120
|
+
required: ['action', 'a', 'b'],
|
|
121
|
+
},
|
|
122
|
+
output: TEXT_OUT,
|
|
123
|
+
async execute(args, exec) {
|
|
124
|
+
const act = linkActionOf(args)
|
|
125
|
+
if (act.bad) return badActionText(act)
|
|
126
|
+
const ends = missingEnds(args)
|
|
127
|
+
if (ends.length > 0) return missingEndsText(act, ends)
|
|
128
|
+
const text = await runLink(flow, act.name, args, exec)
|
|
129
|
+
const notes = linkNotes(act.name, args)
|
|
130
|
+
return notes.length > 0 ? `${text}\n\n${notes.join('\n')}` : text
|
|
131
|
+
},
|
|
132
|
+
presentCall(args) {
|
|
133
|
+
// [macro-fusion 0.2.60] 卡片标题也是口径:动作键(link/path)不是名字,
|
|
134
|
+
// 只读的 path 也不该被标成写操作。中文名与 kind 都从这里定,标题走 cardTitle()。
|
|
135
|
+
const act = linkActionOf(args)
|
|
136
|
+
if (act.bad) return { card: 'generic', title: cardTitle('星图连线', '动作名没对上'), kind: 'read' }
|
|
137
|
+
const ends = [args.a, args.b].filter((v) => typeof v === 'string' && v.trim() !== '').map((v) => v.trim())
|
|
138
|
+
const detail = ends.length > 0 ? `${LINK_ACTION_LABELS[act.name]} ${ends.join(' ↔ ')}` : LINK_ACTION_LABELS[act.name]
|
|
139
|
+
return { card: 'generic', title: cardTitle('星图连线', detail), kind: act.name === 'path' ? 'read' : 'write' }
|
|
140
|
+
},
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
/**
|
|
145
|
+
* 动作名与两端 id 都已校验过。[macro-fusion 0.2.59] 主体从 execute 搬到模块级函数:
|
|
146
|
+
* 对象方法里裸调模块级函数会解析到外层作用域(0.2.58 踩过),所以 flow 显式传进来。
|
|
147
|
+
*/
|
|
148
|
+
async function runLink(flow, action, args, exec) {
|
|
149
|
+
// 短 id → 完整 id:meow 输出只给 8 位前缀,星图节点 id 是完整 id。
|
|
150
|
+
// 0.2.54:归不出来有三种,各说各的——撞车(记忆在、前缀不够)/ 没查成(不知道有没有)/
|
|
151
|
+
// 真没有。原来一律报「找不到(id 写错了,或它已经被合并/删除)」,撞车和超时都被说成「它没了」。
|
|
152
|
+
const da = await flow.resolveIdDetail(args.a, exec)
|
|
153
|
+
const db = await flow.resolveIdDetail(args.b, exec)
|
|
154
|
+
const AMB = '星图连线这次没做:'
|
|
155
|
+
if (da.kind === 'ambiguous' || db.kind === 'ambiguous') {
|
|
156
|
+
const notes = [da, db]
|
|
157
|
+
.filter((d) => d.kind === 'ambiguous')
|
|
158
|
+
.map((d) => `「${d.id}」${d.note || 'id 给短了,落不到唯一一条'}`)
|
|
159
|
+
return (
|
|
160
|
+
`${AMB}${notes.join(';')}\n` +
|
|
161
|
+
`连错一条比没连上更难发现,所以这次一条都没连:把 id 给够位数(至少 8 位,最好整条)再试一次。`
|
|
162
|
+
)
|
|
163
|
+
}
|
|
164
|
+
if (da.kind === 'unavailable' || db.kind === 'unavailable') {
|
|
165
|
+
const notes = [da, db].filter((d) => d.kind === 'unavailable').map((d) => `「${d.id}」${d.note || '没查到'}`)
|
|
166
|
+
return (
|
|
167
|
+
`${AMB}这次没查成:${notes.join(';')}\n` +
|
|
168
|
+
`这不是「这条记忆不存在」——读记忆的工具这次没接上,等它就绪再试一次;连线一条都没动。`
|
|
169
|
+
)
|
|
170
|
+
}
|
|
171
|
+
const ra = da.kind === 'ok' ? da.id : null
|
|
172
|
+
const rb = db.kind === 'ok' ? db.id : null
|
|
173
|
+
const missing = [ra === null ? args.a : null, rb === null ? args.b : null].filter(Boolean)
|
|
174
|
+
if (missing.length > 0) {
|
|
175
|
+
return `这个工作区里没有这条记忆:${missing.join('、')}——id 可能写错了一位,或者它已经被合并/删除(合并会把旧 id 指到新条目上,旧的那条就查不到了)。用 memory_search 反查一下 id 再连。`
|
|
176
|
+
}
|
|
177
|
+
const payload = { action, a: ra, b: rb }
|
|
178
|
+
if (args.note !== undefined) payload.note = args.note
|
|
179
|
+
if (args.maxHops !== undefined) payload.maxHops = args.maxHops
|
|
180
|
+
|
|
181
|
+
if (action === 'link') {
|
|
182
|
+
await flow.flushLinks(exec)
|
|
183
|
+
const callMs = flow.linkCallMs ?? LINK_CALL_MS
|
|
184
|
+
const raw = await withBudget(flow.tryCall('nebula_link', payload, exec, '星图连线'), callMs)
|
|
185
|
+
if (isTimedOut(raw)) {
|
|
186
|
+
// 掐断不是失败(0.2.31):星图多半正在建图,`addLink` 幂等,排队重试不会写脏数据。
|
|
187
|
+
queuePending(ra, rb, typeof args.note === 'string' ? args.note : '', PENDING_REASONS.slow)
|
|
188
|
+
return (
|
|
189
|
+
`星图 ${describeMs(callMs)}内没回应(多半在建图),连线已排队,读记忆时会自动补;` +
|
|
190
|
+
`也可以稍后重试 memory_link(action="link", a="${ra}", b="${rb}")。`
|
|
191
|
+
)
|
|
192
|
+
}
|
|
193
|
+
const r = raw
|
|
194
|
+
if (r.entry) {
|
|
195
|
+
if (isLinkedText(r.text)) dropPending(ra, rb)
|
|
196
|
+
return r.text
|
|
197
|
+
}
|
|
198
|
+
const why = r.text.replace(/^星图连线未完成:/, '')
|
|
199
|
+
// 自己连自己:星图明确拒绝,排队也没用,别制造一条永远连不上的欠账
|
|
200
|
+
if (isSelfPairText(why)) return why.slice(0, 200)
|
|
201
|
+
// 其余都要排队(0.2.30 起含「找不到这两条记忆」):那句话可能是「节点还没建进图」,
|
|
202
|
+
// 不是「记忆不存在」——把它当永久失败,用户这次连线就白写了。
|
|
203
|
+
const notBuilt = saysMissingNodes(why)
|
|
204
|
+
const retry = `也可以稍后重试 memory_link(action="link", a="${ra}", b="${rb}")。`
|
|
205
|
+
queuePending(ra, rb, typeof args.note === 'string' ? args.note : '', notBuilt ? PENDING_REASONS.notBuilt : PENDING_REASONS.failed)
|
|
206
|
+
// 环境问题(星图没装配/没起)不转述内部错误:成功路径上出现「这项能力还没就绪」会让模型以为工具面坏了
|
|
207
|
+
if (isNotReady(why)) {
|
|
208
|
+
return `星图这次没接上,连线已排队,读记忆时会自动补;${retry}`
|
|
209
|
+
}
|
|
210
|
+
if (notBuilt) {
|
|
211
|
+
return `星图还没建到这两条记忆(约 12s 一轮巡检),连线已排队,读记忆时会自动补;${retry}`
|
|
212
|
+
}
|
|
213
|
+
return `连线暂时没落图(${why.slice(0, 120)}),已排队,之后读记忆时自动补连;${retry}`
|
|
214
|
+
}
|
|
215
|
+
const verb = { unlink: '断开连线', mute: '屏蔽自动关联', unmute: '撤销屏蔽', path: '解释证据链' }[action] || action
|
|
216
|
+
const callMs2 = flow.linkCallMs ?? LINK_CALL_MS
|
|
217
|
+
const raw2 = await withBudget(
|
|
218
|
+
flow.tryCall(
|
|
219
|
+
action === 'path' ? 'nebula_path' : 'nebula_link',
|
|
220
|
+
payload,
|
|
221
|
+
exec,
|
|
222
|
+
action === 'path' ? '星图路径' : '星图连线',
|
|
223
|
+
),
|
|
224
|
+
callMs2,
|
|
225
|
+
)
|
|
226
|
+
if (isTimedOut(raw2)) {
|
|
227
|
+
return (
|
|
228
|
+
`星图 ${describeMs(callMs2)}内没回应(多半在建图),${verb}这次没做成——` +
|
|
229
|
+
'等它建完再试一次就行,记忆本身没受影响。'
|
|
230
|
+
)
|
|
231
|
+
}
|
|
232
|
+
const r2 = raw2
|
|
233
|
+
if (r2.entry) {
|
|
234
|
+
// path 是唯一一个「星图的原话本身就是答案」的动作,但它的四句话里有两句
|
|
235
|
+
// 字面上像「没关系」、实际是「还没算」(0.2.37)。这一步只做翻译,不改星图的结论:
|
|
236
|
+
// 真没关系照原样转述(那是诚实),没算出来就说清「这不是答案」。
|
|
237
|
+
if (action !== 'path') return r2.text
|
|
238
|
+
const kind = pathAnswerKind(r2.text)
|
|
239
|
+
if (kind === 'missing') {
|
|
240
|
+
return (
|
|
241
|
+
'星图还没建到这两条记忆(约 12s 一轮巡检),所以现在看不出它们有没有关系——' +
|
|
242
|
+
'这不是「没关系」的答案,等它建完再问一次就行;记忆本身没受影响。'
|
|
243
|
+
)
|
|
244
|
+
}
|
|
245
|
+
if (kind === 'engineStale') {
|
|
246
|
+
return '星图这次的引擎还没带上路径搜索——要等宿主重启后才有,记忆和连线都没受影响。'
|
|
247
|
+
}
|
|
248
|
+
if (kind === 'emptyGraph') {
|
|
249
|
+
// 图还空着(0.2.45):这句话本身就是结论——「这次没算」,不是「没关系」,
|
|
250
|
+
// 星图的原文已经写清了,原样转述。
|
|
251
|
+
return r2.text
|
|
252
|
+
}
|
|
253
|
+
return r2.text
|
|
254
|
+
}
|
|
255
|
+
// 这几个动作改的是星图自己,落不了盘也没法先记账;说清楚「记忆没受影响」比报内部错误有用
|
|
256
|
+
return `星图这次没接上,${verb}没做成——这一步改的是星图自己,等它就绪再试一次就行,记忆本身没受影响。`
|
|
257
|
+
}
|
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
import { TEXT_OUT } from '../shared.js'
|
|
2
|
+
import { cardTitle } from '../panel.js'
|
|
3
|
+
|
|
4
|
+
export function createProject({ flow }) {
|
|
5
|
+
return {
|
|
6
|
+
name: 'memory_project',
|
|
7
|
+
description: '看某个项目的全景记忆:overview/structure/decisions/quotes/ops/todo 分组全给(已完结的 todo 单独列)。',
|
|
8
|
+
parameters: {
|
|
9
|
+
type: 'object',
|
|
10
|
+
additionalProperties: false,
|
|
11
|
+
properties: {
|
|
12
|
+
project: { type: 'string', description: '项目名。' },
|
|
13
|
+
},
|
|
14
|
+
required: ['project'],
|
|
15
|
+
},
|
|
16
|
+
output: TEXT_OUT,
|
|
17
|
+
async execute(args, exec) {
|
|
18
|
+
const r = await flow.call('memory_project', { project: args.project }, exec)
|
|
19
|
+
return r.text
|
|
20
|
+
},
|
|
21
|
+
presentCall(args) {
|
|
22
|
+
return { card: 'generic', title: cardTitle('项目全景', args.project), kind: 'read' }
|
|
23
|
+
},
|
|
24
|
+
}
|
|
25
|
+
}
|
|
@@ -0,0 +1,160 @@
|
|
|
1
|
+
import { TEXT_OUT, countParam, neighborSection, neighborGapNote } from '../shared.js'
|
|
2
|
+
import { cardTitle } from '../panel.js'
|
|
3
|
+
// [macro-fusion 0.2.138] 读到一条退位的记忆时,把「该去读哪一条」一起给出来。
|
|
4
|
+
import { workspaceOfExec } from '../dreamledger.js'
|
|
5
|
+
import { successionNote } from '../chain.js'
|
|
6
|
+
// [macro-fusion 0.2.156] 谱系的另一半:这条从哪来、为什么在库里、还有没有人用过。
|
|
7
|
+
import { provenanceNote } from '../provenance.js'
|
|
8
|
+
// [macro-fusion 0.2.109] 读一条连带邻居,是单次调用里最容易超预算的一支;够大就报成本。
|
|
9
|
+
// [macro-fusion 0.2.112] 这一支也吃 budget:正文一个字都不截,只能砍邻居——砍到底还放不下就只给骨架。
|
|
10
|
+
import { readCostTail, budgetOf, estTokens, fmtTokens } from '../tokencost.js'
|
|
11
|
+
|
|
12
|
+
/** 骨架只留正文第一行的前这么多字:够认出是哪条,又不会把半截正文卖成全貌。 */
|
|
13
|
+
const SKELETON_HEAD = 120
|
|
14
|
+
|
|
15
|
+
/** 砍邻居的阶梯:先照 caller 要的条数给,再 6 / 3 / 1 / 0,最多实测三次(每次都真取一次)。 */
|
|
16
|
+
const NEIGHBOR_LADDER = [6, 3, 1, 0]
|
|
17
|
+
const LADDER_TRIES = 3
|
|
18
|
+
|
|
19
|
+
/**
|
|
20
|
+
* [macro-fusion 0.4.0] 正文里带巩固句时,抬头先说清「它是材料,不是现状」。
|
|
21
|
+
*
|
|
22
|
+
* 与 successionNote 的区别是「退位」和「归档」的区别:取代会改 status(读到它基本是走错门),
|
|
23
|
+
* 巩固不改 status(这条还活着,细节只在这里,只是结论已经收到别处去了)。所以两句话不能合并:
|
|
24
|
+
* 把巩固说成「已作废」会让人不敢用这条的细节,把取代说成「已归档」会让人以为结论还在原处。
|
|
25
|
+
*/
|
|
26
|
+
const CONSOLIDATED_RE = /(已巩固进:([0-9a-z]{8})(?:「([^」]{0,40})」)?,(\d{4}-\d{2}-\d{2}))/i
|
|
27
|
+
export function consolidatedNote(content) {
|
|
28
|
+
const m = String(content ?? '').match(CONSOLIDATED_RE)
|
|
29
|
+
if (!m) return ''
|
|
30
|
+
const target = m[2] ? `${m[1]}「${m[2]}」` : m[1]
|
|
31
|
+
return `这条是历史材料(${m[3]} 被收进 ${target}):它没作废,细节只在这里;但要看现在的口径,读那一条。`
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
export function createRead({ flow, meowDir = () => '.dsh-meow' }) {
|
|
35
|
+
return {
|
|
36
|
+
name: 'memory_read',
|
|
37
|
+
description:
|
|
38
|
+
'读一条记忆的全文与元数据,并把星图里与它相连的记忆一起带出来(neighbors=0 可关掉邻域)。给 budget 就按预算收紧:只砍邻居,正文从不截断,砍到底还放不下就只给骨架。',
|
|
39
|
+
parameters: {
|
|
40
|
+
type: 'object',
|
|
41
|
+
additionalProperties: false,
|
|
42
|
+
properties: {
|
|
43
|
+
id: { type: 'string', description: '记忆 id。' },
|
|
44
|
+
neighbors: { type: 'integer', description: '带出多少条邻居,默认 12;0=不带。' },
|
|
45
|
+
budget: {
|
|
46
|
+
type: 'integer',
|
|
47
|
+
description: '这一读最多花多少 token(估算)。不给=不限额;给了就先砍邻居条数,正文不截断。',
|
|
48
|
+
},
|
|
49
|
+
},
|
|
50
|
+
required: ['id'],
|
|
51
|
+
},
|
|
52
|
+
output: TEXT_OUT,
|
|
53
|
+
async execute(args, exec) {
|
|
54
|
+
const main = await flow.call('memory_read', { id: args.id }, exec)
|
|
55
|
+
// [macro-fusion 0.2.52] 上游一个字都不给时,空字符串会被读成「这条记忆是空的」。
|
|
56
|
+
let said = String(main.text ?? '').trim()
|
|
57
|
+
if (said.length === 0) {
|
|
58
|
+
return '读取这次没有任何回执(既没有正文,也没说为什么没有)——这不是「这条记忆是空的」:先用 memory_search 或 memory_project 确认 id,再读一次。'
|
|
59
|
+
}
|
|
60
|
+
if (main.value?.found === false) return said
|
|
61
|
+
await flow.flushLinks(exec)
|
|
62
|
+
// [macro-fusion 0.2.138] 链上那两行并进正文:它属于「这条记忆现在是什么样」,
|
|
63
|
+
// 不是附加说明——预算按含链的长度算,砍邻居时也不会把它砍掉。
|
|
64
|
+
const chain = successionNote({
|
|
65
|
+
workspace: workspaceOfExec(exec),
|
|
66
|
+
dir: typeof meowDir === 'function' ? meowDir() : '.dsh-meow',
|
|
67
|
+
id: args.id,
|
|
68
|
+
})
|
|
69
|
+
// [macro-fusion 0.2.156] 来源一行同理并进正文:正文回答「它说了什么」,这一行回答
|
|
70
|
+
// 「凭什么信它、它从哪来」。同样按含它的长度算预算,砍邻居时不会被砍掉。
|
|
71
|
+
const prov = provenanceNote({
|
|
72
|
+
workspace: workspaceOfExec(exec),
|
|
73
|
+
dir: typeof meowDir === 'function' ? meowDir() : '.dsh-meow',
|
|
74
|
+
id: args.id,
|
|
75
|
+
})
|
|
76
|
+
const extras = [consolidatedNote(main.value?.content), prov, chain].filter(Boolean).join('\n')
|
|
77
|
+
if (extras.length > 0) said = `${said}\n\n${extras}`
|
|
78
|
+
// [macro-fusion 0.2.62] 以前这里先把 neighbors 塞进 Number(),再拿「不是有限数、或者
|
|
79
|
+
// 小于等于 0」做一句提前返回:非数字、负数、你自己要 0 三种情况压成同一个结果——
|
|
80
|
+
// 没有邻居段。读的人只会得到「这条记忆没有邻居」这个错结论(DESIGN §72)。
|
|
81
|
+
const nb = countParam('neighbors', args.neighbors, { min: 0, max: 40, def: 12 })
|
|
82
|
+
const budget = budgetOf(args.budget)
|
|
83
|
+
|
|
84
|
+
/** 按条数真取一次邻居段;0 条不打扰星图(问它要 0 条本来也问不出东西)。 */
|
|
85
|
+
const withNeighbors = async (count) => {
|
|
86
|
+
if (count <= 0) return { text: said, section: '' }
|
|
87
|
+
const inspect = await flow.tryCall('nebula_inspect', { id: args.id, neighbors: count }, exec, '星图邻居')
|
|
88
|
+
const section = neighborSection(inspect.text)
|
|
89
|
+
// [macro-fusion 0.2.77] 没拿到邻居段时以前一声不吭(那句失败说明被拼掉的),
|
|
90
|
+
// 读者会把「没带到」读成「这条记忆没有邻居」。三种情况三种话,见 neighborGapNote。
|
|
91
|
+
const gap = neighborGapNote(section, inspect.def !== undefined, inspect.text)
|
|
92
|
+
return { text: [said, section, gap].filter(Boolean).join('\n\n'), section }
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
// 没给预算:老样子,够大就报成本(省 token 的工具自己也要能报账)。
|
|
96
|
+
// budget 给的「不是数字 / 太小」也走这条路——那种 note 必须带出来,不然等于悄悄忽略了他给的数。
|
|
97
|
+
if (budget.value === null) {
|
|
98
|
+
if (nb.value <= 0) return [said, nb.note, budget.note].filter(Boolean).join('\n\n')
|
|
99
|
+
const got = await withNeighbors(nb.value)
|
|
100
|
+
return readCostTail([got.text, nb.note, budget.note].filter(Boolean).join('\n\n'))
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
const bodyEst = estTokens(said)
|
|
104
|
+
// 正文是 caller 要的东西,一个字都不能裁:裁一半他会当全文用。装不下就只给骨架。
|
|
105
|
+
if (bodyEst > budget.value) {
|
|
106
|
+
return skeletonOf(said, { budget: budget.value, bodyEst, budgetNote: budget.note, nbNote: nb.note })
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
// 正文装得下:从 caller 要的条数往下试,第一次装下就停——每一档都是一次真取、一次实测。
|
|
110
|
+
const ladder = [nb.value, ...NEIGHBOR_LADDER]
|
|
111
|
+
.filter((n, i, arr) => n <= nb.value && arr.indexOf(n) === i)
|
|
112
|
+
.slice(0, LADDER_TRIES)
|
|
113
|
+
let picked = null
|
|
114
|
+
for (const count of ladder) {
|
|
115
|
+
const got = await withNeighbors(count)
|
|
116
|
+
const text = [got.text, nb.note].filter(Boolean).join('\n\n')
|
|
117
|
+
if (estTokens(text) <= budget.value) {
|
|
118
|
+
picked = { count, text, est: estTokens(text) }
|
|
119
|
+
break
|
|
120
|
+
}
|
|
121
|
+
}
|
|
122
|
+
// nb=0 时阶梯只有 [0],正文已经过了预算,所以这里只是兜底:绝不返回半截正文。
|
|
123
|
+
if (picked === null) picked = { count: 0, text: said, est: bodyEst }
|
|
124
|
+
|
|
125
|
+
const cutNote = picked.count === nb.value ? '' : `邻居 ${nb.value}→${picked.count} 条才装下`
|
|
126
|
+
const costNote = `≈${fmtTokens(picked.est)} token/预算 ${budget.value}`
|
|
127
|
+
const withTail = `${picked.text}\n\n(${costNote}${cutNote ? `;${cutNote}` : ',装下了'})`
|
|
128
|
+
// 砍了邻居就必须说(改过就要交代);没砍时这句账要装得进预算才加——
|
|
129
|
+
// 正文已经装下,别为一句说明把它挤出去。
|
|
130
|
+
if (cutNote) return withTail
|
|
131
|
+
return estTokens(withTail) <= budget.value ? withTail : picked.text
|
|
132
|
+
},
|
|
133
|
+
presentCall(args) {
|
|
134
|
+
return { card: 'generic', title: cardTitle('读取记忆', args.id), kind: 'read' }
|
|
135
|
+
},
|
|
136
|
+
}
|
|
137
|
+
}
|
|
138
|
+
|
|
139
|
+
/**
|
|
140
|
+
* [macro-fusion 0.2.112] 预算连正文都装不下时的形态:一行标题 + 一句为什么没给全文。
|
|
141
|
+
*
|
|
142
|
+
* 为什么不像别的工具那样「缩到最小再给」:读的正文就是 caller 要的东西,缩了等于给假货——
|
|
143
|
+
* 半截记忆会被当成完整记忆用,这比不给更坏。所以这里给的是**指路**:正文多长、缺口多少、
|
|
144
|
+
* 怎么看到全文(抬预算 / 先搜摘要)。
|
|
145
|
+
*/
|
|
146
|
+
function skeletonOf(said, { budget, bodyEst, budgetNote, nbNote }) {
|
|
147
|
+
const first = said.split('\n').map((line) => line.trim()).find((line) => line.length > 0) ?? ''
|
|
148
|
+
const head = first.length > SKELETON_HEAD ? `${first.slice(0, SKELETON_HEAD)}…` : first
|
|
149
|
+
const over = estTokens(head) > budget
|
|
150
|
+
return [
|
|
151
|
+
head,
|
|
152
|
+
'',
|
|
153
|
+
`正文共 ${said.length} 字(≈${fmtTokens(bodyEst)} token),比你给的预算 ${budget} token 大——这次一个字都没裁给你:截一半你会把它当成全文。要看全文就把 budget 提到 ≥${bodyEst},或者先用 memory_search 看摘要挑一条。`,
|
|
154
|
+
over ? '连上面那一行标题都超过你给的预算了;但不写这句,你就会把骨架当成全文。' : '',
|
|
155
|
+
budgetNote,
|
|
156
|
+
nbNote,
|
|
157
|
+
]
|
|
158
|
+
.filter(Boolean)
|
|
159
|
+
.join('\n')
|
|
160
|
+
}
|