@zmzai/agent-framework 0.5.2 → 0.9.0

package/dist/core/task/plan.js

@@ -0,0 +1,216 @@
+import { createHash } from "node:crypto";
+import { newEvidenceId, } from "./types.js";
+/** 运行时事实 → 任务契约的投影（规格 3 §6「`todo.updated` 可暂时作为步骤投影，
+ *  但不能继续作为唯一的任务来源」）。
+ *
+ * 分工：
+ * - 模型通过 `todo` 工具表达**计划**；这里把它投影成 `TaskRecord.steps`，
+ *   但 TaskRecord 是权威——todo 事件没了、乱序了、被压缩掉了，任务仍完整。
+ * - 工具调用结果由运行时（runner）观测后投影成 `TaskEvidence`。**模型不能
+ *   自己声明证据**，这也是「可信完成」里「可信」二字的落点。
+ *
+ * 本模块同样是纯函数，便于单测。 */
+/** 隐式验收条件的固定 id。简单问答不强制拆计划（规格 §4.2），它只有这
+ *  一条条件：用户的目标本身。id 固定是为了让「步骤全部完成 → 目标达成」
+ *  这条推导能在任意一次投影里被识别出来。 */
+export const IMPLICIT_CRITERION_ID = "crit_implicit";
+/** 任务没有显式验收条件时的隐式条件（规格 §6「简单问答可以只有一个隐式
+ *  验收条件，不强制生成复杂计划」）。 */
+export function defaultCriteriaFor(goal) {
+    return [{ id: IMPLICIT_CRITERION_ID, description: goal, required: true, status: "pending", evidenceIds: [] }];
+}
+/** 步骤 id 由 (taskId, todo 内容) 决定而不是随机生成：模型每轮重发整份
+ *  todo 列表是常态，随机 id 会让同一个步骤在每轮里「变成新步骤」，步骤数
+ *  无限膨胀、已完成的又对不上号。 */
+export function stepIdForContent(taskId, content) {
+    return `step_${createHash("sha256").update(`${taskId}\u0000${content}`).digest("hex").slice(0, 16)}`;
+}
+/** 把一份 todo 列表投影到步骤数组上。
+ *
+ * 【为什么消失的步骤标 cancelled 而不是删除】规格 §10.3 要求重启恢复时
+ * 「保留 TaskRecord 和已完成步骤」。已完成的必须留（那是交付依据）；没完成
+ * 但模型不再提及的，说明它被重新规划掉了——留成 pending 会让任务永远无法
+ * 通过 Completion Gate 的条件 2，删掉又丢掉了「曾经计划过」的信息。
+ * 标 cancelled 两者兼顾。 */
+export function projectTodos(input) {
+    const { taskId, now } = input;
+    const byId = new Map(input.steps.map((step) => [step.id, { ...step }]));
+    const seen = new Set();
+    let nextOrder = input.steps.reduce((max, step) => Math.max(max, step.order), -1) + 1;
+    for (const todo of input.todos) {
+        const id = stepIdForContent(taskId, todo.content);
+        seen.add(id);
+        const existing = byId.get(id);
+        const status = todo.status;
+        if (!existing) {
+            byId.set(id, {
+                id,
+                title: todo.content,
+                status,
+                order: nextOrder++,
+                evidenceIds: [],
+                ...(status === "in_progress" || status === "completed" ? { startedAt: now } : {}),
+                ...(status === "completed" ? { completedAt: now } : {}),
+            });
+            continue;
+        }
+        // 不做「已完成 → 待办」的回退：模型偶尔重发一份旧列表，把它照单接受
+        // 会让已经交付的步骤倒退，Completion Gate 又会把任务打回续跑。
+        if (existing.status === "completed" && status !== "completed")
+            continue;
+        existing.status = status;
+        if (status === "in_progress" && !existing.startedAt)
+            existing.startedAt = now;
+        if (status === "completed" && !existing.completedAt)
+            existing.completedAt = now;
+    }
+    for (const step of byId.values()) {
+        if (seen.has(step.id))
+            continue;
+        if (step.status === "completed" || step.status === "cancelled")
+            continue;
+        step.status = "cancelled";
+    }
+    return [...byId.values()].sort((a, b) => a.order - b.order);
+}
+/** 把一次交付声明投影进任务契约（规格 §9 条件 1/3、§14.1 四问）。
+ *
+ * 【为什么证据是「整份任务集合」而不是按条件挑】工具调用与验收条件之间没有可靠
+ * 映射：框架不知道第 3 次 `pnpm build` 服务的是哪一条条件。后果只有两种：全都挂
+ * 上，或都不挂。都不挂会让条件 3 永远不满足（每个 passed 条件至少要一条有效证据），
+ * 完成判定直接失效；全都挂是保守的那一侧——它不会让**不该通过**的条件通过，只会
+ * 让「有证据」这条判定比理想情况宽一点。而真正会骗人的那一步（把模型自己的话当
+ * 证据）另有约束：只有任务里**一条别的证据都没有**时，才用声明本身顶上。 */
+export function applyDelivery(input) {
+    const { criteria, delivery, evidence, declarationEvidenceId, observedChanges } = input;
+    // 空数组按「没给」处理：`criteria: []` 与省略是同一个意思，不该因为写了对方括号
+    // 就让隐式条件掉进「未声明」分支。
+    const declaredList = delivery.criteria?.length ? delivery.criteria : null;
+    const declared = new Map((declaredList ?? []).map((item) => [item.id, item]));
+    const known = new Set(criteria.map((criterion) => criterion.id));
+    const unknownCriterionIds = (declaredList ?? []).filter((item) => !known.has(item.id)).map((item) => item.id);
+    // 工具证据优先；一条都没有时（纯解释 / 写作 / 问答，规格 §9 末段）才用交付
+    // 声明本身。顺序不能反：反了就是「说过话」压过「做过事」。
+    const toolEvidenceIds = evidence.filter((item) => item.kind !== "model_observation").map((item) => item.id);
+    const attachable = toolEvidenceIds.length ? toolEvidenceIds : declarationEvidenceId ? [declarationEvidenceId] : [];
+    const next = criteria.map((criterion) => {
+        const item = declared.get(criterion.id);
+        if (!item) {
+            // 只有隐式条件、且模型没逐条写：`summary` + `verification` 已经回答了同一个
+            // 问题（描述就是用户的目标），视为通过。这是「省略 = 隐式条件通过」的实现处。
+            if (!declaredList && criterion.id === IMPLICIT_CRITERION_ID) {
+                return { ...criterion, status: "passed", evidenceIds: [...attachable] };
+            }
+            // 其余未覆盖的保持原状（pending）——门会以「验收条件未通过」打回续跑，
+            // 并在 advisory 里点名。不在这里自动补一个结论。
+            return { ...criterion };
+        }
+        // required 条件不接受 not_applicable：那等于用一句话把一整条验收条件抹掉，
+        // 而 §9 条件 1 要的是「所有 required 条件 passed」。非 required 条件（将来由
+        // 宿主显式添加）允许豁免。
+        if (item.status === "not_applicable") {
+            return criterion.required ? { ...criterion } : { ...criterion, status: "not_applicable", evidenceIds: [] };
+        }
+        if (item.status === "failed") {
+            // failed 不挂证据：挂上会让「这条条件有证据」与「这条条件没通过」同时为真，
+            // 而 §9 条件 3 只对 passed 的条件要求证据。
+            return { ...criterion, status: "failed", evidenceIds: [] };
+        }
+        return { ...criterion, status: "passed", evidenceIds: [...attachable] };
+    });
+    return {
+        criteria: next,
+        result: {
+            outcome: delivery.summary,
+            changes: delivery.changes?.length ? [...delivery.changes] : [...observedChanges],
+            verification: [...delivery.verification],
+            // §18.7：无剩余项时也要显式给空数组，"没写" 与 "没有" 不能糊在一起。
+            remaining: delivery.remaining ? [...delivery.remaining] : [],
+        },
+        unknownCriterionIds,
+        unfulfilledRequiredIds: next.filter((criterion) => criterion.required && criterion.status !== "passed").map((criterion) => criterion.id),
+    };
+}
+/** 工具 → 证据种类。没列出的工具（读文件、搜索、列目录等）返回 null：
+ *  **读取不是验证**。把 30 次 read 记成 30 条证据，会让「有证据」这个条件
+ *  退化成「调过工具」，规格 §9 条件 3 的意义就没了。 */
+const EVIDENCE_KIND_BY_TOOL = {
+    bash: "command",
+    terminal: "command",
+    edit: "file_diff",
+    write: "file_diff",
+    patch: "file_diff",
+    webfetch: "external_check",
+    websearch: "external_check",
+    read_attachment: "tool_result",
+    task: "tool_result",
+};
+export function evidenceKindForTool(tool) {
+    return EVIDENCE_KIND_BY_TOOL[tool] ?? null;
+}
+/** 证据上限。超出后淘汰最老的，并同步清掉一切指向它的引用（否则
+ *  Completion Gate 的条件 3 会因为悬空引用而永远不满足）。 */
+export const MAX_EVIDENCE = 96;
+export function appendEvidence(input) {
+    const { evidence, kind, summary, ref, now } = input;
+    // 去重维度 = (kind, ref ?? summary)。同一文件被改多次只保留最后一条，
+    // 否则一个格式化的批量编辑能塞满整份证据表，把「有证据」稀释成噪音。
+    const keyOf = (item) => `${item.kind}\u0000${item.ref ?? item.summary}`;
+    const key = `${kind}\u0000${ref ?? summary}`;
+    const existingIndex = evidence.findIndex((item) => keyOf(item) === key);
+    const item = {
+        id: existingIndex >= 0 ? evidence[existingIndex].id : newEvidenceId(),
+        kind,
+        summary,
+        ...(ref ? { ref } : {}),
+        createdAt: now,
+    };
+    const next = existingIndex >= 0
+        ? evidence.map((value, index) => (index === existingIndex ? item : value))
+        : [...evidence, item];
+    if (next.length <= MAX_EVIDENCE)
+        return { evidence: next, dropped: [] };
+    const overflow = next.length - MAX_EVIDENCE;
+    return { evidence: next.slice(overflow), dropped: next.slice(0, overflow).map((value) => value.id) };
+}
+/** 从 evidenceIds 里剔除被淘汰的证据 id。 */
+export function pruneEvidenceRefs(items, dropped) {
+    if (!dropped.length)
+        return [...items];
+    const gone = new Set(dropped);
+    return items.map((item) => (item.evidenceIds.some((id) => gone.has(id))
+        ? { ...item, evidenceIds: item.evidenceIds.filter((id) => !gone.has(id)) }
+        : item));
+}
+/** 新建一个空任务。`status` 从 `queued` 起——`running` 由 runner 认领时置位，
+ *  这样「任务已创建但还没被任何 runner 接管」是个可观测的中间态。 */
+export function newTaskRecord(input) {
+    return {
+        id: input.id,
+        sessionId: input.sessionId,
+        rootRequestId: input.rootRequestId,
+        rootUserMessageId: input.rootUserMessageId,
+        goal: input.goal,
+        status: "queued",
+        acceptanceCriteria: defaultCriteriaFor(input.goal),
+        steps: [],
+        evidence: [],
+        revision: 1,
+        attemptCount: 0,
+        noProgressCount: 0,
+        activeMs: 0,
+        constraints: [],
+        createdAt: input.now,
+        updatedAt: input.now,
+    };
+}
+/** 由目标文本推导一个后备步骤（模型没有调 todo 工具时）。
+ *
+ *  必要性：Completion Gate 的条件 2 在有步骤时要求全部完成。若模型从不拆解
+ *  步骤，`steps` 恒为空，条件 2 自动通过——这没问题；但这样一来「任务做到
+ *  哪了」在 UI 上没有任何可展示的进度。给一条与目标同名的单步，让进度条至少
+ *  有一个真实的锚点。 */
+export function fallbackStep(taskId, goal) {
+    return { id: stepIdForContent(taskId, goal), title: goal.slice(0, 80), status: "in_progress", order: 0, startedAt: new Date().toISOString(), evidenceIds: [] };
+}
+//# sourceMappingURL=plan.js.map

package/dist/core/task/plan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plan.js","sourceRoot":"","sources":["../../../src/core/task/plan.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAEL,aAAa,GAWd,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;qBASqB;AAErB;;0BAE0B;AAC1B,MAAM,CAAC,MAAM,qBAAqB,GAAG,eAAe,CAAC;AAErD;wBACwB;AACxB,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,CAAC,EAAE,EAAE,EAAE,qBAAqB,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;AAChH,CAAC;AAED;;sBAEsB;AACtB,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,OAAe;IAC9D,OAAO,QAAQ,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,MAAM,SAAS,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACvG,CAAC;AAID;;;;;;uBAMuB;AACvB,MAAM,UAAU,YAAY,CAAC,KAK5B;IACC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAErF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAwB,CAAC;QAC7C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;gBACX,EAAE;gBACF,KAAK,EAAE,IAAI,CAAC,OAAO;gBACnB,MAAM;gBACN,KAAK,EAAE,SAAS,EAAE;gBAClB,WAAW,EAAE,EAAE;gBACf,GAAG,CAAC,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjF,GAAG,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACxD,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,qCAAqC;QACrC,yCAAyC;QACzC,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,WAAW;YAAE,SAAS;QACxE,QAAQ,CAAC,MAAM,GAAG,MAAM,CAAC;QACzB,IAAI,MAAM,KAAK,aAAa,IAAI,CAAC,QAAQ,CAAC,SAAS;YAAE,QAAQ,CAAC,SAAS,GAAG,GAAG,CAAC;QAC9E,IAAI,MAAM,KAAK,WAAW,IAAI,CAAC,QAAQ,CAAC,WAAW;YAAE,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC;IAClF,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW;YAAE,SAAS;QACzE,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC;AA2BD;;;;;;;2CAO2C;AAC3C,MAAM,UAAU,aAAa,CAAC,KAQ7B;IACC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,qBAAqB,EAAE,eAAe,EAAE,GAAG,KAAK,CAAC;IACvF,iDAAiD;IACjD,mBAAmB;IACnB,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,mBAAmB,GAAG,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE9G,4CAA4C;IAC5C,+BAA+B;IAC/B,MAAM,eAAe,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,mBAAmB,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5G,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAEnH,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QACtC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,qDAAqD;YACrD,0CAA0C;YAC1C,IAAI,CAAC,YAAY,IAAI,SAAS,CAAC,EAAE,KAAK,qBAAqB,EAAE,CAAC;gBAC5D,OAAO,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,QAAiB,EAAE,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;YACnF,CAAC;YACD,yCAAyC;YACzC,+BAA+B;YAC/B,OAAO,EAAE,GAAG,SAAS,EAAE,CAAC;QAC1B,CAAC;QACD,mDAAmD;QACnD,yDAAyD;QACzD,eAAe;QACf,IAAI,IAAI,CAAC,MAAM,KAAK,gBAAgB,EAAE,CAAC;YACrC,OAAO,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,gBAAyB,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACtH,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC7B,2CAA2C;YAC3C,+BAA+B;YAC/B,OAAO,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,QAAiB,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACtE,CAAC;QACD,OAAO,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,QAAiB,EAAE,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,MAAM,EAAE;YACN,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC;YAChF,YAAY,EAAE,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC;YACxC,0CAA0C;YAC1C,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE;SAC7D;QACD,mBAAmB;QACnB,sBAAsB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;KACzI,CAAC;AACJ,CAAC;AAED;;mCAEmC;AACnC,MAAM,qBAAqB,GAAqC;IAC9D,IAAI,EAAE,SAAS;IACf,QAAQ,EAAE,SAAS;IACnB,IAAI,EAAE,WAAW;IACjB,KAAK,EAAE,WAAW;IAClB,KAAK,EAAE,WAAW;IAClB,QAAQ,EAAE,gBAAgB;IAC1B,SAAS,EAAE,gBAAgB;IAC3B,eAAe,EAAE,aAAa;IAC9B,IAAI,EAAE,aAAa;CACpB,CAAC;AAEF,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,qBAAqB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;AAC7C,CAAC;AAED;4CAC4C;AAC5C,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC;AAQ/B,MAAM,UAAU,cAAc,CAAC,KAM9B;IACC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IACpD,iDAAiD;IACjD,oCAAoC;IACpC,MAAM,KAAK,GAAG,CAAC,IAA+D,EAAU,EAAE,CACxF,GAAG,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;IAClD,MAAM,GAAG,GAAG,GAAG,IAAI,SAAS,GAAG,IAAI,OAAO,EAAE,CAAC;IAC7C,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACxE,MAAM,IAAI,GAAiB;QACzB,EAAE,EAAE,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,EAAE;QACtE,IAAI;QACJ,OAAO;QACP,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvB,SAAS,EAAE,GAAG;KACf,CAAC;IACF,MAAM,IAAI,GAAG,aAAa,IAAI,CAAC;QAC7B,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE,IAAI,CAAC,CAAC;IACxB,IAAI,IAAI,CAAC,MAAM,IAAI,YAAY;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxE,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC;IAC5C,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;AACvG,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,iBAAiB,CAAsC,KAAmB,EAAE,OAA0B;IACpH,IAAI,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE;QAC1E,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACb,CAAC;AAED;0CAC0C;AAC1C,MAAM,UAAU,aAAa,CAAC,KAO7B;IACC,OAAO;QACL,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;QAC1C,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM,EAAE,QAAQ;QAChB,kBAAkB,EAAE,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC;QAClD,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,CAAC;QACX,YAAY,EAAE,CAAC;QACf,eAAe,EAAE,CAAC;QAClB,QAAQ,EAAE,CAAC;QACX,WAAW,EAAE,EAAE;QACf,SAAS,EAAE,KAAK,CAAC,GAAG;QACpB,SAAS,EAAE,KAAK,CAAC,GAAG;KACrB,CAAC;AACJ,CAAC;AAED;;;;;gBAKgB;AAChB,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,IAAY;IACvD,OAAO,EAAE,EAAE,EAAE,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;AACjK,CAAC"}

package/dist/core/task/progress.d.ts

@@ -0,0 +1,43 @@
+import type { TaskRecord } from "./types.js";
+/** 跨 Attempt 的进度指纹与空转检测（规格 3 §10.1）。
+ *
+ * 【为什么不能把 TaskRecord.revision 算进指纹】规格 §10.1 列出的指纹要素里
+ * 第一条是「Task revision」。照字面实现会让 no-progress 保护彻底失效：每次
+ * Attempt 收尾都要把状态写回（running → verifying → running），revision 必然
+ * 自增，于是「两轮之间没有进展」这个条件永远不成立，§10.1 的 1/2/3 档保护
+ * 全成了死代码。
+ *
+ * 规格要防的是「模型原地打转」，而原地打转的客观表现是：步骤状态没动、验收
+ * 状态没动、没有新证据、没有新改动。所以指纹取这些**语义要素**，revision
+ * 只作为「谁改过」的元数据保留在 TaskRecord 上供 CAS 用。 */
+export type ProgressFingerprintInput = {
+    task: TaskRecord;
+    /** 本轮 Attempt 编辑/写入过的文件路径（已去重）。 */
+    editedFiles: readonly string[];
+    /** 本轮 Attempt 的工具调用次数。 */
+    toolCalls: number;
+};
+/**
+ * 计算本次 Attempt 结束后的进度指纹。
+ *
+ * 刻意**不含**工具调用次数：模型完全可以用 30 次无意义的 read 把计数刷上去。
+ * 工具调用只在「产生了上面这些可观测变化」时才意味着进展。
+ */
+export declare function taskFingerprint(input: ProgressFingerprintInput): string;
+export type ProgressAdvance = {
+    /** 指纹是否与上一轮不同（true = 有进展）。 */
+    progressed: boolean;
+    /** 下一次比较用的指纹。 */
+    fingerprint: string;
+    /** 更新后的 noProgressCount（有进展清零）。 */
+    noProgressCount: number;
+};
+/**
+ * 比较本轮指纹与 `task.lastFingerprint`，给出新的 noProgressCount。
+ *
+ * 纯函数——不改 task，由调用方决定何时落库（CAS 更新）。
+ * 首次指纹（lastFingerprint 为 undefined）视为有进展：任务刚起步，
+ * 第一轮就计一次「无进展」会让所有任务都从 1 开始倒数。
+ */
+export declare function advanceProgress(task: TaskRecord, input: Omit<ProgressFingerprintInput, "task">): ProgressAdvance;
+//# sourceMappingURL=progress.d.ts.map

package/dist/core/task/progress.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"progress.d.ts","sourceRoot":"","sources":["../../../src/core/task/progress.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAA+C,MAAM,YAAY,CAAC;AAE1F;;;;;;;;;;0CAU0C;AAE1C,MAAM,MAAM,wBAAwB,GAAG;IACrC,IAAI,EAAE,UAAU,CAAC;IACjB,mCAAmC;IACnC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IAC/B,0BAA0B;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB,CAAC;AAsCF;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,wBAAwB,GAAG,MAAM,CASvE;AAED,MAAM,MAAM,eAAe,GAAG;IAC5B,8BAA8B;IAC9B,UAAU,EAAE,OAAO,CAAC;IACpB,iBAAiB;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,mCAAmC;IACnC,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,wBAAwB,EAAE,MAAM,CAAC,GAAG,eAAe,CAQhH"}

package/dist/core/task/progress.js

@@ -0,0 +1,66 @@
+import { createHash } from "node:crypto";
+/** 稳定序列化：步骤与条件按 id 排序，避免「顺序变了但内容没变」被误判成进展。 */
+function canonical(parts) {
+    return JSON.stringify(parts.map(([key, value]) => [key, value]));
+}
+function stepShape(steps) {
+    return [...steps]
+        .sort((a, b) => a.id.localeCompare(b.id))
+        .map((step) => [step.id, `${step.status}:${step.evidenceIds.length}`]);
+}
+function criterionShape(criteria) {
+    return [...criteria]
+        .sort((a, b) => a.id.localeCompare(b.id))
+        .map((criterion) => [criterion.id, `${criterion.status}:${criterion.evidenceIds.length}`]);
+}
+/** 证据的形状：只看**它是什么、对着谁**，不看它被分配的随机 id。
+ *
+ *  【为什么不带 id】id 是 uuid，任何一条新证据都会让指纹变化——包括模型每轮
+ *  重新说一遍自己的答案。那等于把「模型又开口了」算成进展，no-progress 保护
+ *  就永远触发不了（实测：一个纯聊天的模型可以这样刷满 24 轮 Attempt 上限）。
+ *  按 (kind, ref) 取值后，「又跑了一遍同一个 pnpm build」不再算进展，而
+ *  「改了另一个文件」仍然算——这才是 §10.1 想抓的语义差别。
+ *
+ *  【为什么排除 model_observation】它是完成判定的口子（规格 §9 末段：没有工具
+ *  可跑的任务，最终内容本身是唯一可验证的东西），但它**恰恰是没有外部验证**的
+ *  那一类。让它进指纹，上面那个洞会原样复现。它的作用是满足「每个关键条件有
+ *  一条证据」，不是证明任务在前进——两个目的，两类处理。 */
+function evidenceShape(evidence) {
+    return [...evidence]
+        .filter((item) => item.kind !== "model_observation")
+        .sort((a, b) => `${a.kind}\u0000${a.ref ?? ""}`.localeCompare(`${b.kind}\u0000${b.ref ?? ""}`))
+        .map((item) => [item.kind, item.ref ?? null]);
+}
+/**
+ * 计算本次 Attempt 结束后的进度指纹。
+ *
+ * 刻意**不含**工具调用次数：模型完全可以用 30 次无意义的 read 把计数刷上去。
+ * 工具调用只在「产生了上面这些可观测变化」时才意味着进展。
+ */
+export function taskFingerprint(input) {
+    const { task } = input;
+    const payload = canonical([
+        ["steps", stepShape(task.steps)],
+        ["criteria", criterionShape(task.acceptanceCriteria)],
+        ["evidence", evidenceShape(task.evidence)],
+        ["files", [...input.editedFiles].sort()],
+    ]);
+    return createHash("sha256").update(payload).digest("hex");
+}
+/**
+ * 比较本轮指纹与 `task.lastFingerprint`，给出新的 noProgressCount。
+ *
+ * 纯函数——不改 task，由调用方决定何时落库（CAS 更新）。
+ * 首次指纹（lastFingerprint 为 undefined）视为有进展：任务刚起步，
+ * 第一轮就计一次「无进展」会让所有任务都从 1 开始倒数。
+ */
+export function advanceProgress(task, input) {
+    const fingerprint = taskFingerprint({ task, ...input });
+    const progressed = task.lastFingerprint === undefined || task.lastFingerprint !== fingerprint;
+    return {
+        progressed,
+        fingerprint,
+        noProgressCount: progressed ? 0 : task.noProgressCount + 1,
+    };
+}
+//# sourceMappingURL=progress.js.map

package/dist/core/task/progress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"progress.js","sourceRoot":"","sources":["../../../src/core/task/progress.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAwBzC,8CAA8C;AAC9C,SAAS,SAAS,CAAC,KAA8C;IAC/D,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,SAAS,CAAC,KAA0B;IAC3C,OAAO,CAAC,GAAG,KAAK,CAAC;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAU,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,cAAc,CAAC,QAAwC;IAC9D,OAAO,CAAC,GAAG,QAAQ,CAAC;SACjB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACxC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,GAAG,SAAS,CAAC,MAAM,IAAI,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAU,CAAC,CAAC;AACxG,CAAC;AAED;;;;;;;;;;;kCAWkC;AAClC,SAAS,aAAa,CAAC,QAAiC;IACtD,OAAO,CAAC,GAAG,QAAQ,CAAC;SACjB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,mBAAmB,CAAC;SACnD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC;SAC9F,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAU,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAA+B;IAC7D,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;IACvB,MAAM,OAAO,GAAG,SAAS,CAAC;QACxB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC,UAAU,EAAE,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACrD,CAAC,UAAU,EAAE,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;KACzC,CAAC,CAAC;IACH,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC5D,CAAC;AAWD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,IAAgB,EAAE,KAA6C;IAC7F,MAAM,WAAW,GAAG,eAAe,CAAC,EAAE,IAAI,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,KAAK,SAAS,IAAI,IAAI,CAAC,eAAe,KAAK,WAAW,CAAC;IAC9F,OAAO;QACL,UAAU;QACV,WAAW;QACX,eAAe,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC;KAC3D,CAAC;AACJ,CAAC"}

package/dist/core/task/store.d.ts

@@ -0,0 +1,36 @@
+import { type CreateTaskInput, type TaskPatch, type TaskRecord } from "./types.js";
+/** TaskStore（规格 3 §13.4）。
+ *
+ * 与 `SessionStore`/`WorkflowStore` 并列，通过 `SessionStore.task` 暴露。
+ * 三个必须由实现保证的不变量：
+ *
+ * 1. **CAS**：`updateTask` 带 `expectedRevision`，版本不符即抛错。两个 runner
+ *    同时推进同一任务时，慢的那个必须失败而不是覆盖——否则步骤状态会互相
+ *    回退，Completion Gate 读到的是一个从未真实存在过的中间态。
+ * 2. **同 session 最多一个 active root task**（规格 §6 / §18.9）：两个活跃
+ *    任务会并行改同一个工作区。
+ * 3. **requestId 幂等**（规格 §13.1 / §17.1.11）：重复提交返回同一个任务，
+ *    不创建第二个，也不追加第二条用户消息。 */
+export interface TaskStore {
+    createTask(input: CreateTaskInput): Promise<TaskRecord>;
+    getTask(taskId: string): Promise<TaskRecord | null>;
+    /** 当前活跃任务（未进终态）。无则 null。 */
+    getActiveTask(sessionId: string): Promise<TaskRecord | null>;
+    /** 最近一个进入终态的任务（`GET /task` 在无活跃任务时回退到它）。 */
+    getLatestTask(sessionId: string): Promise<TaskRecord | null>;
+    /** CAS 更新；`expectedRevision` 不匹配时抛 `TASK_REVISION_CONFLICT`。 */
+    updateTask(taskId: string, expectedRevision: number, patch: TaskPatch): Promise<TaskRecord>;
+    listTasks(sessionId: string): Promise<TaskRecord[]>;
+    /** 按 rootRequestId 查（幂等键）。 */
+    findTaskByRequestId(sessionId: string, requestId: string): Promise<TaskRecord | null>;
+}
+export declare const TASK_REVISION_CONFLICT = "TASK_REVISION_CONFLICT";
+/** 应用补丁 + 递增 revision。纯函数——各个 store 实现共用，避免三处各写一份
+ *  递增逻辑（漏掉一处就会出现「某些路径不更新 revision」的隐性 CAS 失效）。 */
+export declare function applyTaskPatch(task: TaskRecord, patch: TaskPatch, now: string): TaskRecord;
+export declare function createTaskRecord(input: CreateTaskInput, now: string): TaskRecord;
+/** 内存实现：参考实现 + 单测用。语义与 SQLite 实现逐条对齐。 */
+export declare function createMemoryTaskStore(options?: {
+    now?: () => string;
+}): TaskStore;
+//# sourceMappingURL=store.d.ts.map

package/dist/core/task/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../../src/core/task/store.ts"],"names":[],"mappings":"AAAA,OAAO,EAA+C,KAAK,eAAe,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,MAAM,YAAY,CAAC;AAGhI;;;;;;;;;;;4BAW4B;AAC5B,MAAM,WAAW,SAAS;IACxB,UAAU,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACxD,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACpD,4BAA4B;IAC5B,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAC7D,4CAA4C;IAC5C,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAC7D,gEAAgE;IAChE,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAC5F,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IACpD,8BAA8B;IAC9B,mBAAmB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;CACvF;AAED,eAAO,MAAM,sBAAsB,2BAA2B,CAAC;AAE/D;kDACkD;AAClD,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAc1F;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAchF;AAED,yCAAyC;AACzC,wBAAgB,qBAAqB,CAAC,OAAO,CAAC,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;CAAE,GAAG,SAAS,CA+DjF"}

package/dist/core/task/store.js

@@ -0,0 +1,104 @@
+import { isActiveStatus, isTerminalStatus, newTaskId } from "./types.js";
+import { defaultCriteriaFor, newTaskRecord } from "./plan.js";
+export const TASK_REVISION_CONFLICT = "TASK_REVISION_CONFLICT";
+/** 应用补丁 + 递增 revision。纯函数——各个 store 实现共用，避免三处各写一份
+ *  递增逻辑（漏掉一处就会出现「某些路径不更新 revision」的隐性 CAS 失效）。 */
+export function applyTaskPatch(task, patch, now) {
+    const merged = {
+        ...task,
+        ...patch,
+        id: task.id,
+        sessionId: task.sessionId,
+        createdAt: task.createdAt,
+        revision: task.revision + 1,
+        updatedAt: now,
+    };
+    // blocker 用 undefined 显式清除；展开运算会把它带成 undefined 字段，
+    // 序列化后仍占一个键。统一归一化，保证「无阻塞」只有一种表示。
+    if (patch.blocker === undefined)
+        delete merged.blocker;
+    return merged;
+}
+export function createTaskRecord(input, now) {
+    const base = newTaskRecord({
+        id: newTaskId(),
+        sessionId: input.sessionId,
+        rootRequestId: input.rootRequestId,
+        rootUserMessageId: input.rootUserMessageId,
+        goal: input.goal,
+        now,
+    });
+    return {
+        ...base,
+        ...(input.steps?.length ? { steps: [...input.steps] } : {}),
+        acceptanceCriteria: input.acceptanceCriteria?.length ? [...input.acceptanceCriteria] : defaultCriteriaFor(input.goal),
+    };
+}
+/** 内存实现：参考实现 + 单测用。语义与 SQLite 实现逐条对齐。 */
+export function createMemoryTaskStore(options) {
+    const tasks = new Map();
+    const now = options?.now ?? (() => new Date().toISOString());
+    function cloneOf(task) {
+        return structuredClone(task);
+    }
+    function activeOf(sessionId) {
+        for (const task of tasks.values()) {
+            if (task.sessionId === sessionId && isActiveStatus(task.status))
+                return task;
+        }
+        return null;
+    }
+    return {
+        async createTask(input) {
+            const existing = await this.findTaskByRequestId(input.sessionId, input.rootRequestId);
+            if (existing)
+                return existing;
+            // 同一 session 已有活跃任务时不新建（调用方应先做 steering/排队判定）
+            const active = activeOf(input.sessionId);
+            if (active && active.rootRequestId !== input.rootRequestId) {
+                throw new Error("TASK_ALREADY_ACTIVE");
+            }
+            const record = createTaskRecord(input, now());
+            tasks.set(record.id, record);
+            return cloneOf(record);
+        },
+        async getTask(taskId) {
+            const task = tasks.get(taskId);
+            return task ? cloneOf(task) : null;
+        },
+        async getActiveTask(sessionId) {
+            const task = activeOf(sessionId);
+            return task ? cloneOf(task) : null;
+        },
+        async getLatestTask(sessionId) {
+            const candidates = [...tasks.values()]
+                .filter((task) => task.sessionId === sessionId && isTerminalStatus(task.status))
+                .sort((a, b) => b.updatedAt.localeCompare(a.updatedAt));
+            return candidates[0] ? cloneOf(candidates[0]) : null;
+        },
+        async updateTask(taskId, expectedRevision, patch) {
+            const current = tasks.get(taskId);
+            if (!current)
+                throw new Error("TASK_NOT_FOUND");
+            if (current.revision !== expectedRevision)
+                throw new Error(TASK_REVISION_CONFLICT);
+            const updated = applyTaskPatch(current, patch, now());
+            tasks.set(taskId, updated);
+            return cloneOf(updated);
+        },
+        async listTasks(sessionId) {
+            return [...tasks.values()]
+                .filter((task) => task.sessionId === sessionId)
+                .sort((a, b) => a.createdAt.localeCompare(b.createdAt))
+                .map(cloneOf);
+        },
+        async findTaskByRequestId(sessionId, requestId) {
+            for (const task of tasks.values()) {
+                if (task.sessionId === sessionId && task.rootRequestId === requestId)
+                    return cloneOf(task);
+            }
+            return null;
+        },
+    };
+}
+//# sourceMappingURL=store.js.map

package/dist/core/task/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../../src/core/task/store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,SAAS,EAAyD,MAAM,YAAY,CAAC;AAChI,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AA4B9D,MAAM,CAAC,MAAM,sBAAsB,GAAG,wBAAwB,CAAC;AAE/D;kDACkD;AAClD,MAAM,UAAU,cAAc,CAAC,IAAgB,EAAE,KAAgB,EAAE,GAAW;IAC5E,MAAM,MAAM,GAAe;QACzB,GAAG,IAAI;QACP,GAAG,KAAK;QACR,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC;QAC3B,SAAS,EAAE,GAAG;KACf,CAAC;IACF,mDAAmD;IACnD,iCAAiC;IACjC,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC;IACvD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAsB,EAAE,GAAW;IAClE,MAAM,IAAI,GAAG,aAAa,CAAC;QACzB,EAAE,EAAE,SAAS,EAAE;QACf,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;QAC1C,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,GAAG;KACJ,CAAC,CAAC;IACH,OAAO;QACL,GAAG,IAAI;QACP,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC;KACtH,CAAC;AACJ,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,qBAAqB,CAAC,OAAgC;IACpE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC5C,MAAM,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;IAE7D,SAAS,OAAO,CAAC,IAAgB;QAC/B,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,SAAS,QAAQ,CAAC,SAAiB;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC/E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,KAAK,CAAC,UAAU,CAAC,KAAK;YACpB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;YACtF,IAAI,QAAQ;gBAAE,OAAO,QAAQ,CAAC;YAC9B,8CAA8C;YAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,MAAM,IAAI,MAAM,CAAC,aAAa,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;gBAC3D,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACzC,CAAC;YACD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9C,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAC7B,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,MAAM;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrC,CAAC;QACD,KAAK,CAAC,aAAa,CAAC,SAAS;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrC,CAAC;QACD,KAAK,CAAC,aAAa,CAAC,SAAS;YAC3B,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;iBACnC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;iBAC/E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACvD,CAAC;QACD,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,gBAAgB,EAAE,KAAK;YAC9C,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,OAAO;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,QAAQ,KAAK,gBAAgB;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;YACnF,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACtD,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC3B,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,SAAS,CAAC,SAAS;YACvB,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;iBACvB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;iBACtD,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,CAAC;QACD,KAAK,CAAC,mBAAmB,CAAC,SAAS,EAAE,SAAS;YAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS;oBAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7F,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;KACF,CAAC;AACJ,CAAC"}