@agimon-ai/doompi-task 0.0.1-alpha.7 → 0.0.1-alpha.71

package/dist/{store/reconcile.d.mts → services/reconcile/index.d.mts}

@@ -1,13 +1,13 @@
-import { Task, TaskDocument } from "./types.mjs";
-//#region src/store/reconcile.d.ts
-declare const ERR_ORPHANED_BY_RESTART = "Delegation orphaned by harness restart";
-declare const ERR_ORPHANED_BY_SESSION = "Delegation orphaned by session restart";
-interface ReconcileResult {
+import { Task, TaskDocument } from "../../models/task.mjs";
+//#region src/services/reconcile/index.d.ts
+export declare const ERR_ORPHANED_BY_RESTART = "Delegation orphaned by harness restart";
+export declare const ERR_ORPHANED_BY_SESSION = "Delegation orphaned by session restart";
+export interface ReconcileResult {
   document: TaskDocument;
   orphaned: Task[];
 }
 /** The delegations this process can still settle, used to spot its own leftovers. */
-interface ReconcileSelf {
+export interface ReconcileSelf {
   pid: number;
   liveRequestIds: ReadonlySet<string>;
 }
@@ -28,7 +28,6 @@ interface ReconcileSelf {
  * Delegations owned by a different, still-running pid belong to a parallel
  * session and are left untouched.
  */
-declare function reconcileOrphanedDelegations(document: TaskDocument, now?: string, isAlive?: (pid: number) => boolean, self?: ReconcileSelf): ReconcileResult;
+export declare function reconcileOrphanedDelegations(document: TaskDocument, now?: string, isAlive?: (pid: number) => boolean, self?: ReconcileSelf): ReconcileResult;
 //#endregion
-export { ERR_ORPHANED_BY_RESTART, ERR_ORPHANED_BY_SESSION, ReconcileResult, ReconcileSelf, reconcileOrphanedDelegations };
-//# sourceMappingURL=reconcile.d.mts.map
+//# sourceMappingURL=index.d.mts.map

package/dist/services/reconcile/index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.mts","names":[],"sources":["../../../src/services/reconcile/index.ts"],"mappings":";;qBAGa;qBACA;iBAEI;EACf,UAAU;EACV,UAAU;;;iBAIK;EACf;EACA,gBAAgB;;;;;;;;;;;;;;;;;;;wBAoBF,6BACd,UAAU,cACV,cACA,WAAU,yBACV,OAAO,gBACN"}

package/dist/services/reconcile/index.mjs

@@ -0,0 +1,2 @@
+import{isProcessAlive as e}from"../processLiveness/index.mjs";import{isDelegationActive as t}from"../../models/task.mjs";const n=`Delegation orphaned by harness restart`,r=`Delegation orphaned by session restart`;function i(i,a=new Date().toISOString(),o=e,s){let c=[],l=i.tasks.map(e=>{if(!t(e))return e;let i=e.delegation?.pid;if(i===void 0)return e;let l=s!==void 0&&i===s.pid&&!s.liveRequestIds.has(e.delegation.requestId);if(!l&&o(i))return e;let u={...e,status:`pending`,updatedAt:a,delegation:{...e.delegation,state:`failed`,endedAt:a,result:{status:`failed`,error:l?r:n}}};return c.push(u),u});return c.length===0?{document:i,orphaned:c}:{document:{...i,tasks:l},orphaned:c}}export{n as ERR_ORPHANED_BY_RESTART,r as ERR_ORPHANED_BY_SESSION,i as reconcileOrphanedDelegations};
+//# sourceMappingURL=index.mjs.map

package/dist/services/reconcile/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../src/services/reconcile/index.ts"],"sourcesContent":["import { isDelegationActive, type Task, type TaskDocument } from '../../models/task';\nimport { isProcessAlive } from '../processLiveness';\n\nexport const ERR_ORPHANED_BY_RESTART = 'Delegation orphaned by harness restart';\nexport const ERR_ORPHANED_BY_SESSION = 'Delegation orphaned by session restart';\n\nexport interface ReconcileResult {\n  document: TaskDocument;\n  orphaned: Task[];\n}\n\n/** The delegations this process can still settle, used to spot its own leftovers. */\nexport interface ReconcileSelf {\n  pid: number;\n  liveRequestIds: ReadonlySet<string>;\n}\n\n/**\n * Recover tasks that no longer have anyone able to finish them.\n *\n * A subagent run dies with the harness that spawned it, but the store file\n * outlives both, so a crash leaves tasks stuck in `in_progress` forever. Two\n * kinds of delegation qualify as dead:\n *\n * - the owning pid is gone, so nothing is left to report a result;\n * - the owning pid is *this* process, yet the request is absent from the live\n *   set. Settling requires an in-memory record, so an in-process session\n *   restart (which clears that map without writing to the store) leaves rows\n *   nothing can ever resolve. Checking pid liveness alone misses these, because\n *   the pid is our own and very much alive.\n *\n * Delegations owned by a different, still-running pid belong to a parallel\n * session and are left untouched.\n */\nexport function reconcileOrphanedDelegations(\n  document: TaskDocument,\n  now: string = new Date().toISOString(),\n  isAlive: (pid: number) => boolean = isProcessAlive,\n  self?: ReconcileSelf,\n): ReconcileResult {\n  const orphaned: Task[] = [];\n\n  const tasks = document.tasks.map((task) => {\n    if (!isDelegationActive(task)) return task;\n    const pid = task.delegation?.pid;\n    if (pid === undefined) return task;\n\n    const ownedByThisSession = self !== undefined && pid === self.pid;\n    const abandonedHere = ownedByThisSession && !self.liveRequestIds.has(task.delegation!.requestId);\n    if (!abandonedHere && isAlive(pid)) return task;\n\n    const recovered: Task = {\n      ...task,\n      status: 'pending',\n      updatedAt: now,\n      delegation: {\n        ...task.delegation!,\n        state: 'failed',\n        endedAt: now,\n        result: {\n          status: 'failed',\n          error: abandonedHere ? ERR_ORPHANED_BY_SESSION : ERR_ORPHANED_BY_RESTART,\n        },\n      },\n    };\n    orphaned.push(recovered);\n    return recovered;\n  });\n\n  if (orphaned.length === 0) return { document, orphaned };\n  return { document: { ...document, tasks }, orphaned };\n}\n"],"mappings":"yHAGA,MAAa,EAA0B,yCAC1B,EAA0B,yCA8BvC,SAAgB,EACd,EACA,EAAc,IAAI,KAAK,CAAA,CAAE,YAAY,EACrC,EAAoC,EACpC,EACiB,CACjB,IAAM,EAAmB,CAAC,EAEpB,EAAQ,EAAS,MAAM,IAAK,GAAS,CACzC,GAAI,CAAC,EAAmB,CAAI,EAAG,OAAO,EACtC,IAAM,EAAM,EAAK,YAAY,IAC7B,GAAI,IAAQ,IAAA,GAAW,OAAO,EAG9B,IAAM,EADqB,IAAS,IAAA,IAAa,IAAQ,EAAK,KAClB,CAAC,EAAK,eAAe,IAAI,EAAK,WAAY,SAAS,EAC/F,GAAI,CAAC,GAAiB,EAAQ,CAAG,EAAG,OAAO,EAE3C,IAAM,EAAkB,CACtB,GAAG,EACH,OAAQ,UACR,UAAW,EACX,WAAY,CACV,GAAG,EAAK,WACR,MAAO,SACP,QAAS,EACT,OAAQ,CACN,OAAQ,SACR,MAAO,EAAgB,EAA0B,CACnD,CACF,CACF,EAEA,OADA,EAAS,KAAK,CAAS,EAChB,CACT,CAAC,EAGD,OADI,EAAS,SAAW,EAAU,CAAE,WAAU,UAAS,EAChD,CAAE,SAAU,CAAE,GAAG,EAAU,OAAM,EAAG,UAAS,CACtD"}

package/dist/services/reducer/index.cjs

@@ -0,0 +1,3 @@
+const e=require("../../models/taskGraph.cjs"),t=require("../../models/task.cjs"),n=require("../invariants/index.cjs"),r=/^[A-Za-z][A-Za-z0-9_-]{0,31}$/;function i(e){switch(e.kind){case`error`:case`list`:case`get`:return!1;case`upsert`:return e.items.some(e=>e.kind===`created`||e.kind===`updated`);case`delete`:case`clear`:return!0}}function a(e){return e.items.filter(e=>e.kind===`failed`).map(e=>`item[${e.index}]: ${e.message}`).join(`
+`)}function o(e){return e.kind===`upsert`?e.items[0]:void 0}function s(e,t){return{document:e,op:{kind:`error`,message:t}}}function c(e,t){let n=e??[],r=t??[];return n.length===r.length&&n.every((e,t)=>e===r[t])}function l(e,t){return JSON.stringify(e??null)===JSON.stringify(t??null)}function u(e,t){return e.subject!==t.subject||e.status!==t.status||e.description!==t.description||e.activeForm!==t.activeForm||e.owner!==t.owner||!c(e.blockedBy,t.blockedBy)||!l(e.metadata,t.metadata)}function d(e,t,n=e.nextId){return{...e,tasks:t,nextId:n}}function f(e,t){let n={...e};for(let[e,r]of Object.entries(t))r===null?delete n[e]:n[e]=r;return Object.keys(n).length?n:void 0}function p(e,t){if(t.subject!==void 0&&(e.subject=t.subject),t.description!==void 0&&(e.description=t.description),t.activeForm!==void 0&&(e.activeForm=t.activeForm),t.owner!==void 0&&(e.owner=t.owner),t.metadata!==void 0){let n=f(e.metadata,t.metadata);n===void 0?delete e.metadata:e.metadata=n}}function m(e,t,n){if(typeof n==`number`)return{ok:!0,id:n};if(!r.test(n))return{ok:!1,message:`${t}: "${n}" is not a valid ref; pass an existing task id as a number`};let i=e.refIds.get(n);if(i!==void 0)return{ok:!0,id:i};let a=e.failedRefs.get(n);return a===void 0?{ok:!1,message:`${t}: unknown ref "${n}" — a ref must be declared by an earlier entry in the same call`}:{ok:!1,message:`${t}: ref "${n}" refers to item[${a}], which failed`}}function h(e){return{ok:!1,message:e}}function g(e,t){if(t.ref!==void 0){if(t.id!==void 0)return`ref is only valid when creating a task; drop the id, or drop the ref`;if(!r.test(t.ref))return`ref "${t.ref}" is invalid: a ref must start with a letter and contain only letters, digits, - or _`;if(e.refIds.get(t.ref)!==void 0||e.failedRefs.has(t.ref))return`duplicate ref "${t.ref}": it was already declared by an earlier entry`}}function _(e,t,n,r){if(t.subject===void 0)return h(`subject is required when the entry has no id`);if(!t.subject.trim())return h(`subject must not be blank`);if(t.addBlockedBy!==void 0||t.removeBlockedBy!==void 0)return h(`addBlockedBy / removeBlockedBy are only for an entry with an id; a new task uses blockedBy`);if(t.status===`deleted`)return h(`cannot create a task with status deleted; create it, then use action delete`);if(e.tasks.filter(e=>e.status!==`deleted`).length>=e.maxTasks)return h(`task limit of ${e.maxTasks} reached; delete completed tasks first before creating new tasks`);let i=[];for(let n of t.blockedBy??[]){let t=m(e,`blockedBy`,n);if(!t.ok)return h(t.message);let r=e.tasks.find(e=>e.id===t.id);if(!r)return h(`blockedBy: #${t.id} not found`);if(r.status===`deleted`)return h(`blockedBy: #${t.id} is deleted`);i.includes(t.id)||i.push(t.id)}let a={id:e.nextId,subject:t.subject,status:t.status??`pending`,createdAt:r,updatedAt:r};return p(a,t),i.length&&(a.blockedBy=i),e.nextId+=1,e.tasks.push(a),t.ref&&e.refIds.set(t.ref,a.id),{ok:!0,outcome:{index:n,kind:`created`,id:a.id,subject:a.subject,status:a.status,...t.ref?{ref:t.ref}:{},...i.length?{blockedBy:i}:{}}}}function v(t,r,i,a){let o=r.id,s=t.tasks.findIndex(e=>e.id===o);if(s===-1)return h(`#${o} not found`);if(r.blockedBy!==void 0)return h(`blockedBy is only for a new entry; use addBlockedBy / removeBlockedBy on an entry that has an id`);if(!(r.subject!==void 0||r.description!==void 0||r.activeForm!==void 0||r.status!==void 0||r.owner!==void 0||r.metadata!==void 0||r.addBlockedBy?.length||r.removeBlockedBy?.length))return h(`nothing to change: provide at least one of subject, description, activeForm, status, owner, metadata, addBlockedBy, or removeBlockedBy`);let c=t.tasks[s];if(r.subject!==void 0&&!r.subject.trim())return h(`subject must not be blank`);let l=c.status;if(r.status!==void 0){if(!n.isTransitionValid(c.status,r.status))return h(`illegal transition ${c.status} -> ${r.status}`);l=r.status}let d=c.blockedBy?[...c.blockedBy]:[];for(let e of r.removeBlockedBy??[]){let n=m(t,`removeBlockedBy`,e);if(!n.ok)return h(n.message);d=d.filter(e=>e!==n.id)}for(let e of r.addBlockedBy??[]){let n=m(t,`addBlockedBy`,e);if(!n.ok)return h(n.message);if(n.id===o)return h(`cannot block #${o} on itself`);let r=t.tasks.find(e=>e.id===n.id);if(!r)return h(`addBlockedBy: #${n.id} not found`);if(r.status===`deleted`)return h(`addBlockedBy: #${n.id} is deleted`);d.includes(n.id)||d.push(n.id)}let f={...c,status:l};p(f,r),d.length?f.blockedBy=d:delete f.blockedBy;let g=[...t.tasks];if(g[s]=f,r.addBlockedBy?.length&&e.detectCycle(g,o,d))return h(`addBlockedBy would create a cycle in the blockedBy graph`);let _=u(c,f);return _&&(f.updatedAt=a),t.tasks=g,{ok:!0,outcome:_?{index:i,kind:`updated`,id:o,fromStatus:c.status,toStatus:l}:{index:i,kind:`unchanged`,id:o,status:l}}}function y(e,t,n,i){let a={tasks:[...e.tasks],nextId:e.nextId,maxTasks:i,refIds:new Map,failedRefs:new Map},o=[],s=0;for(let[e,i]of t.entries()){let t=g(a,i),c=t?h(t):i.id===void 0?_(a,i,e,n):v(a,i,e,n);if(c.ok){o.push(c.outcome),s+=1;continue}i.ref&&r.test(i.ref)&&!a.refIds.has(i.ref)&&a.failedRefs.set(i.ref,e),o.push({index:e,kind:`failed`,message:c.message,...i.id===void 0?{}:{id:i.id},...i.ref?{ref:i.ref}:{}})}return{document:s>0?d(e,a.tasks,a.nextId):e,op:{kind:`upsert`,items:o,applied:s,failed:o.length-s}}}function b(e,n,r,i=new Date().toISOString(),a=15){switch(n){case`upsert`:{let t=r.tasks;return!Array.isArray(t)||t.length===0?s(e,`upsert requires a non-empty tasks array, e.g. {"action":"upsert","tasks":[{"subject":"Write tests"}]}`):t.length>100?s(e,`upsert accepts at most 100 entries per call (received ${t.length})`):y(e,t,i,a)}case`list`:return{document:e,op:{kind:`list`,includeDeleted:r.includeDeleted===!0,...r.status===void 0?{}:{statusFilter:r.status}}};case`get`:{if(r.id===void 0)return s(e,`id required for get`);let t=e.tasks.find(e=>e.id===r.id);return t?{document:e,op:{kind:`get`,task:t}}:s(e,`#${r.id} not found`)}case`delete`:{if(r.id===void 0)return s(e,`id required for delete`);let n=e.tasks.findIndex(e=>e.id===r.id);if(n===-1)return s(e,`#${r.id} not found`);let a=e.tasks[n];if(a.status===`deleted`)return s(e,`#${a.id} is already deleted`);if(t.isDelegationActive(a))return s(e,`#${a.id} has a running delegation — cancel it before deleting`);let o=[...e.tasks];return o[n]={...a,status:t.DELETED_STATUS,updatedAt:i},{document:d(e,o),op:{kind:`delete`,id:a.id,subject:a.subject}}}case`clear`:{let n=e.tasks.filter(t.isDelegationActive);if(n.length>0)return s(e,`cannot clear while delegations are running (${n.map(e=>`#${e.id}`).join(`, `)}) — cancel them first`);let r=e.tasks.length;return{document:d(e,[],1),op:{kind:`clear`,count:r}}}}}exports.MAX_UPSERT_ITEMS=100,exports.REF_PATTERN=r,exports.applyTaskMutation=b,exports.formatUpsertFailure=a,exports.isCommittingOp=i,exports.singleItemOutcome=o;
+//# sourceMappingURL=index.cjs.map

package/dist/services/reducer/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":["isTransitionValid","detectCycle","isDelegationActive","DELETED_STATUS"],"sources":["../../../src/services/reducer/index.ts"],"sourcesContent":["import {\n  DELETED_STATUS,\n  type DepToken,\n  isDelegationActive,\n  type Task,\n  type TaskAction,\n  type TaskDocument,\n  type TaskItemMutation,\n  type TaskMutationParams,\n  type TaskStatus,\n  type UpsertItemOutcome,\n} from '../../models/task';\nimport { detectCycle } from '../../models/taskGraph';\nimport { isTransitionValid } from '../invariants';\n\n/** Default board capacity when a caller does not provide a configured limit. */\nconst DEFAULT_REDUCER_MAX_TASKS = 15;\n\n/** Bounds the work one call can do, and with it the size of one committed write. */\nexport const MAX_UPSERT_ITEMS = 100;\n\n/**\n * A ref must start with a letter, which makes it structurally unconfusable with\n * a stringified id. That is why resolving a dependency token is just a `typeof`\n * check with no coercion heuristics.\n */\nexport const REF_PATTERN = /^[A-Za-z][A-Za-z0-9_-]{0,31}$/;\n\n/**\n * Reducer outcome. Closed tagged union: adding an action requires extending\n * this union and the response formatter, which the compiler enforces.\n *\n * `upsert` carries one outcome per request item. It is returned even when every\n * item failed — `error` is reserved for whole-call faults — so the tool layer\n * still has the per-item messages to report.\n */\nexport type Op =\n  | { kind: 'upsert'; items: UpsertItemOutcome[]; applied: number; failed: number }\n  | { kind: 'delete'; id: number; subject: string }\n  | { kind: 'list'; statusFilter?: TaskStatus; includeDeleted: boolean }\n  | { kind: 'get'; task: Task }\n  | { kind: 'clear'; count: number }\n  | { kind: 'error'; message: string };\n\nexport interface ApplyResult {\n  document: TaskDocument;\n  op: Op;\n}\n\n/** Actions the reducer owns. `assign`/`cancel` are handled by the delegation manager. */\nexport type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;\n\n/**\n * Does this op represent state that must reach disk?\n *\n * The exhaustive switch is the point: a future `Op` variant cannot be added\n * without declaring its persistence intent, so nothing silently starts or stops\n * bumping `rev`.\n */\nexport function isCommittingOp(op: Op): boolean {\n  switch (op.kind) {\n    case 'error':\n    case 'list':\n    case 'get':\n      return false;\n    case 'upsert':\n      return op.items.some((item) => item.kind === 'created' || item.kind === 'updated');\n    case 'delete':\n    case 'clear':\n      return true;\n  }\n}\n\n/** Joined per-item failures, for the thrown error when an upsert applied nothing. */\nexport function formatUpsertFailure(op: Extract<Op, { kind: 'upsert' }>): string {\n  return op.items\n    .filter((item) => item.kind === 'failed')\n    .map((item) => `item[${item.index}]: ${item.message}`)\n    .join('\\n');\n}\n\n/** The single item's outcome, for callers that only ever send a batch of one. */\nexport function singleItemOutcome(op: Op): UpsertItemOutcome | undefined {\n  return op.kind === 'upsert' ? op.items[0] : undefined;\n}\n\nfunction errorResult(document: TaskDocument, message: string): ApplyResult {\n  return { document, op: { kind: 'error', message } };\n}\n\nfunction sameNumberList(a: number[] | undefined, b: number[] | undefined): boolean {\n  const x = a ?? [];\n  const y = b ?? [];\n  return x.length === y.length && x.every((value, index) => value === y[index]);\n}\n\nfunction sameRecord(a: Record<string, unknown> | undefined, b: Record<string, unknown> | undefined): boolean {\n  return JSON.stringify(a ?? null) === JSON.stringify(b ?? null);\n}\n\n/**\n * Did this update change anything? A no-effect update (status re-set to its\n * current value, fields re-sent unchanged) reports \"No change\" rather than\n * \"Updated #N\" — without the distinction a model can loop re-issuing the same\n * call believing it never landed.\n */\nfunction taskChanged(before: Task, after: Task): boolean {\n  return (\n    before.subject !== after.subject ||\n    before.status !== after.status ||\n    before.description !== after.description ||\n    before.activeForm !== after.activeForm ||\n    before.owner !== after.owner ||\n    !sameNumberList(before.blockedBy, after.blockedBy) ||\n    !sameRecord(before.metadata, after.metadata)\n  );\n}\n\nfunction withTasks(document: TaskDocument, tasks: Task[], nextId = document.nextId): TaskDocument {\n  return { ...document, tasks, nextId };\n}\n\n/** Merge incoming metadata over a base; a `null` value deletes its key. */\nfunction mergeMetadata(\n  base: Record<string, unknown> | undefined,\n  incoming: Record<string, unknown>,\n): Record<string, unknown> | undefined {\n  const merged: Record<string, unknown> = { ...base };\n  for (const [key, value] of Object.entries(incoming)) {\n    if (value === null) delete merged[key];\n    else merged[key] = value;\n  }\n  return Object.keys(merged).length ? merged : undefined;\n}\n\n/** Copy the optional scalar fields an item may set onto a task, in place. */\nfunction assignScalars(target: Task, item: TaskItemMutation): void {\n  if (item.subject !== undefined) target.subject = item.subject;\n  if (item.description !== undefined) target.description = item.description;\n  if (item.activeForm !== undefined) target.activeForm = item.activeForm;\n  if (item.owner !== undefined) target.owner = item.owner;\n  if (item.metadata !== undefined) {\n    const merged = mergeMetadata(target.metadata, item.metadata);\n    if (merged === undefined) delete target.metadata;\n    else target.metadata = merged;\n  }\n}\n\n/**\n * Working state threaded item to item, so entry N observes every effect of\n * entries 1..N-1. `refIds` and `failedRefs` are what make the cascade work:\n * refs resolve backward only, so an entry that names a failed sibling is always\n * processed after the failure that killed it.\n */\ninterface UpsertContext {\n  tasks: Task[];\n  nextId: number;\n  maxTasks: number;\n  refIds: Map<string, number>;\n  failedRefs: Map<string, number>;\n}\n\ntype Resolved = { ok: true; id: number } | { ok: false; message: string };\n\nfunction resolveDep(context: UpsertContext, field: string, token: DepToken): Resolved {\n  if (typeof token === 'number') return { ok: true, id: token };\n  if (!REF_PATTERN.test(token)) {\n    return { ok: false, message: `${field}: \"${token}\" is not a valid ref; pass an existing task id as a number` };\n  }\n  const id = context.refIds.get(token);\n  if (id !== undefined) return { ok: true, id };\n  const failedAt = context.failedRefs.get(token);\n  if (failedAt !== undefined) {\n    return { ok: false, message: `${field}: ref \"${token}\" refers to item[${failedAt}], which failed` };\n  }\n  return {\n    ok: false,\n    message: `${field}: unknown ref \"${token}\" — a ref must be declared by an earlier entry in the same call`,\n  };\n}\n\ntype ItemResult = { ok: true; outcome: UpsertItemOutcome } | { ok: false; message: string };\n\nfunction fail(message: string): ItemResult {\n  return { ok: false, message };\n}\n\n/** Structural checks that apply to every entry, whichever kind it is. */\nfunction checkShape(context: UpsertContext, item: TaskItemMutation): string | undefined {\n  if (item.ref !== undefined) {\n    if (item.id !== undefined) return 'ref is only valid when creating a task; drop the id, or drop the ref';\n    if (!REF_PATTERN.test(item.ref)) {\n      return `ref \"${item.ref}\" is invalid: a ref must start with a letter and contain only letters, digits, - or _`;\n    }\n    const owner = context.refIds.get(item.ref) !== undefined || context.failedRefs.has(item.ref);\n    if (owner) return `duplicate ref \"${item.ref}\": it was already declared by an earlier entry`;\n  }\n  return undefined;\n}\n\nfunction applyCreateItem(context: UpsertContext, item: TaskItemMutation, index: number, now: string): ItemResult {\n  if (item.subject === undefined) return fail('subject is required when the entry has no id');\n  if (!item.subject.trim()) return fail('subject must not be blank');\n  if (item.addBlockedBy !== undefined || item.removeBlockedBy !== undefined) {\n    return fail('addBlockedBy / removeBlockedBy are only for an entry with an id; a new task uses blockedBy');\n  }\n  // A task created as a tombstone is invisible to every view and can never\n  // leave `deleted`, so it would be a write-only black hole.\n  if (item.status === DELETED_STATUS) {\n    return fail('cannot create a task with status deleted; create it, then use action delete');\n  }\n\n  const taskCount = context.tasks.filter((task) => task.status !== DELETED_STATUS).length;\n  if (taskCount >= context.maxTasks) {\n    return fail(`task limit of ${context.maxTasks} reached; delete completed tasks first before creating new tasks`);\n  }\n\n  const blockedBy: number[] = [];\n  for (const token of item.blockedBy ?? []) {\n    const resolved = resolveDep(context, 'blockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    const dep = context.tasks.find((task) => task.id === resolved.id);\n    if (!dep) return fail(`blockedBy: #${resolved.id} not found`);\n    if (dep.status === DELETED_STATUS) return fail(`blockedBy: #${resolved.id} is deleted`);\n    if (!blockedBy.includes(resolved.id)) blockedBy.push(resolved.id);\n  }\n\n  // No cycle check is needed: the id is freshly allocated, so nothing already\n  // in the document can point at it yet.\n  const created: Task = {\n    id: context.nextId,\n    subject: item.subject,\n    status: item.status ?? 'pending',\n    createdAt: now,\n    updatedAt: now,\n  };\n  assignScalars(created, item);\n  if (blockedBy.length) created.blockedBy = blockedBy;\n\n  context.nextId += 1;\n  context.tasks.push(created);\n  if (item.ref) context.refIds.set(item.ref, created.id);\n\n  return {\n    ok: true,\n    outcome: {\n      index,\n      kind: 'created',\n      id: created.id,\n      subject: created.subject,\n      status: created.status,\n      ...(item.ref ? { ref: item.ref } : {}),\n      ...(blockedBy.length ? { blockedBy } : {}),\n    },\n  };\n}\n\nfunction applyUpdateItem(context: UpsertContext, item: TaskItemMutation, index: number, now: string): ItemResult {\n  const id = item.id as number;\n  const at = context.tasks.findIndex((task) => task.id === id);\n  if (at === -1) return fail(`#${id} not found`);\n  if (item.blockedBy !== undefined) {\n    return fail('blockedBy is only for a new entry; use addBlockedBy / removeBlockedBy on an entry that has an id');\n  }\n\n  const hasMutation =\n    item.subject !== undefined ||\n    item.description !== undefined ||\n    item.activeForm !== undefined ||\n    item.status !== undefined ||\n    item.owner !== undefined ||\n    item.metadata !== undefined ||\n    Boolean(item.addBlockedBy?.length) ||\n    Boolean(item.removeBlockedBy?.length);\n  if (!hasMutation) {\n    return fail(\n      'nothing to change: provide at least one of subject, description, activeForm, status, owner, metadata, addBlockedBy, or removeBlockedBy',\n    );\n  }\n\n  const current = context.tasks[at];\n\n  // The Task Space overlay commits free text from an inline editor, so a blank\n  // subject reaches the reducer as a real update rather than as a missing\n  // field. Persisting it would leave an unidentifiable row.\n  if (item.subject !== undefined && !item.subject.trim()) return fail('subject must not be blank');\n\n  let newStatus = current.status;\n  if (item.status !== undefined) {\n    if (!isTransitionValid(current.status, item.status)) {\n      return fail(`illegal transition ${current.status} -> ${item.status}`);\n    }\n    newStatus = item.status;\n  }\n\n  let newBlockedBy = current.blockedBy ? [...current.blockedBy] : [];\n  for (const token of item.removeBlockedBy ?? []) {\n    const resolved = resolveDep(context, 'removeBlockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    // Removing an id that is not there is a well-defined no-op, so unlike the\n    // add path this deliberately skips the existence check.\n    newBlockedBy = newBlockedBy.filter((dep) => dep !== resolved.id);\n  }\n  for (const token of item.addBlockedBy ?? []) {\n    const resolved = resolveDep(context, 'addBlockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    if (resolved.id === id) return fail(`cannot block #${id} on itself`);\n    const dep = context.tasks.find((task) => task.id === resolved.id);\n    if (!dep) return fail(`addBlockedBy: #${resolved.id} not found`);\n    if (dep.status === DELETED_STATUS) return fail(`addBlockedBy: #${resolved.id} is deleted`);\n    if (!newBlockedBy.includes(resolved.id)) newBlockedBy.push(resolved.id);\n  }\n\n  const updated: Task = { ...current, status: newStatus };\n  assignScalars(updated, item);\n  if (newBlockedBy.length) updated.blockedBy = newBlockedBy;\n  else delete updated.blockedBy;\n\n  // The candidate is written before the check because `detectCycle` unions the\n  // node's stored edges with the ones passed in: checking against the old array\n  // would resurrect an edge `removeBlockedBy` just stripped and reject a\n  // remove+add that legitimately breaks a cycle.\n  const candidate = [...context.tasks];\n  candidate[at] = updated;\n  if (item.addBlockedBy?.length && detectCycle(candidate, id, newBlockedBy)) {\n    return fail('addBlockedBy would create a cycle in the blockedBy graph');\n  }\n\n  const changed = taskChanged(current, updated);\n  if (changed) updated.updatedAt = now;\n  context.tasks = candidate;\n\n  return {\n    ok: true,\n    outcome: changed\n      ? { index, kind: 'updated', id, fromStatus: current.status, toStatus: newStatus }\n      : { index, kind: 'unchanged', id, status: newStatus },\n  };\n}\n\n/**\n * Apply every entry in request order, threading the document.\n *\n * Each entry lands completely or not at all: a create whose dependencies fail\n * is not kept dependency-free, because handing back an unblocked task the\n * caller asked to be blocked is a lie it may immediately act on.\n */\nfunction applyUpsert(document: TaskDocument, items: TaskItemMutation[], now: string, maxTasks: number): ApplyResult {\n  const context: UpsertContext = {\n    tasks: [...document.tasks],\n    nextId: document.nextId,\n    maxTasks,\n    refIds: new Map(),\n    failedRefs: new Map(),\n  };\n  const outcomes: UpsertItemOutcome[] = [];\n  let applied = 0;\n\n  for (const [index, item] of items.entries()) {\n    const shapeError = checkShape(context, item);\n    const result = shapeError\n      ? fail(shapeError)\n      : item.id === undefined\n        ? applyCreateItem(context, item, index, now)\n        : applyUpdateItem(context, item, index, now);\n\n    if (result.ok) {\n      outcomes.push(result.outcome);\n      applied += 1;\n      continue;\n    }\n    // A ref whose owner failed must not read as a typo to the entries that\n    // depend on it, so the dead ref is recorded rather than left unknown.\n    if (item.ref && REF_PATTERN.test(item.ref) && !context.refIds.has(item.ref)) {\n      context.failedRefs.set(item.ref, index);\n    }\n    outcomes.push({\n      index,\n      kind: 'failed',\n      message: result.message,\n      ...(item.id === undefined ? {} : { id: item.id }),\n      ...(item.ref ? { ref: item.ref } : {}),\n    });\n  }\n\n  return {\n    // Nothing applied means nothing to write: returning the original object by\n    // reference keeps the caller's write-skip path identical to a hard error.\n    document: applied > 0 ? withTasks(document, context.tasks, context.nextId) : document,\n    op: { kind: 'upsert', items: outcomes, applied, failed: outcomes.length - applied },\n  };\n}\n\n/**\n * Pure reducer: (document, action, params) -> (document, op).\n *\n * All validation is in-line: structural guards plus state-aware checks\n * (transition legality, dangling or deleted blockedBy, self-block, cycles,\n * in-flight delegations). The caller owns persistence and formatting.\n */\nexport function applyTaskMutation(\n  document: TaskDocument,\n  action: ReducerAction,\n  params: TaskMutationParams,\n  now: string = new Date().toISOString(),\n  maxTasks = DEFAULT_REDUCER_MAX_TASKS,\n): ApplyResult {\n  switch (action) {\n    case 'upsert': {\n      const items = params.tasks;\n      if (!Array.isArray(items) || items.length === 0) {\n        return errorResult(\n          document,\n          'upsert requires a non-empty tasks array, e.g. {\"action\":\"upsert\",\"tasks\":[{\"subject\":\"Write tests\"}]}',\n        );\n      }\n      if (items.length > MAX_UPSERT_ITEMS) {\n        return errorResult(\n          document,\n          `upsert accepts at most ${MAX_UPSERT_ITEMS} entries per call (received ${items.length})`,\n        );\n      }\n      return applyUpsert(document, items, now, maxTasks);\n    }\n\n    case 'list': {\n      return {\n        document,\n        op: {\n          kind: 'list',\n          includeDeleted: params.includeDeleted === true,\n          ...(params.status !== undefined ? { statusFilter: params.status } : {}),\n        },\n      };\n    }\n\n    case 'get': {\n      if (params.id === undefined) return errorResult(document, 'id required for get');\n      const task = document.tasks.find((candidate) => candidate.id === params.id);\n      if (!task) return errorResult(document, `#${params.id} not found`);\n      return { document, op: { kind: 'get', task } };\n    }\n\n    case 'delete': {\n      if (params.id === undefined) return errorResult(document, 'id required for delete');\n      const index = document.tasks.findIndex((task) => task.id === params.id);\n      if (index === -1) return errorResult(document, `#${params.id} not found`);\n      const current = document.tasks[index];\n      if (current.status === DELETED_STATUS) return errorResult(document, `#${current.id} is already deleted`);\n      if (isDelegationActive(current)) {\n        return errorResult(document, `#${current.id} has a running delegation — cancel it before deleting`);\n      }\n\n      const tasks = [...document.tasks];\n      tasks[index] = { ...current, status: DELETED_STATUS, updatedAt: now };\n      return {\n        document: withTasks(document, tasks),\n        op: { kind: 'delete', id: current.id, subject: current.subject },\n      };\n    }\n\n    case 'clear': {\n      const active = document.tasks.filter(isDelegationActive);\n      if (active.length > 0) {\n        const ids = active.map((task) => `#${task.id}`).join(', ');\n        return errorResult(document, `cannot clear while delegations are running (${ids}) — cancel them first`);\n      }\n      const count = document.tasks.length;\n      return {\n        document: withTasks(document, [], 1),\n        op: { kind: 'clear', count },\n      };\n    }\n  }\n}\n"],"mappings":"sHA0Ba,EAAc,gCAiC3B,SAAgB,EAAe,EAAiB,CAC9C,OAAQ,EAAG,KAAX,CACE,IAAK,QACL,IAAK,OACL,IAAK,MACH,MAAO,GACT,IAAK,SACH,OAAO,EAAG,MAAM,KAAM,GAAS,EAAK,OAAS,WAAa,EAAK,OAAS,SAAS,EACnF,IAAK,SACL,IAAK,QACH,MAAO,EACX,CACF,CAGA,SAAgB,EAAoB,EAA6C,CAC/E,OAAO,EAAG,MACP,OAAQ,GAAS,EAAK,OAAS,QAAQ,CAAC,CACxC,IAAK,GAAS,QAAQ,EAAK,MAAM,KAAK,EAAK,SAAS,CAAC,CACrD,KAAK;CAAI,CACd,CAGA,SAAgB,EAAkB,EAAuC,CACvE,OAAO,EAAG,OAAS,SAAW,EAAG,MAAM,GAAK,IAAA,EAC9C,CAEA,SAAS,EAAY,EAAwB,EAA8B,CACzE,MAAO,CAAE,WAAU,GAAI,CAAE,KAAM,QAAS,SAAQ,CAAE,CACpD,CAEA,SAAS,EAAe,EAAyB,EAAkC,CACjF,IAAM,EAAI,GAAK,CAAC,EACV,EAAI,GAAK,CAAC,EAChB,OAAO,EAAE,SAAW,EAAE,QAAU,EAAE,OAAO,EAAO,IAAU,IAAU,EAAE,EAAM,CAC9E,CAEA,SAAS,EAAW,EAAwC,EAAiD,CAC3G,OAAO,KAAK,UAAU,GAAK,IAAI,IAAM,KAAK,UAAU,GAAK,IAAI,CAC/D,CAQA,SAAS,EAAY,EAAc,EAAsB,CACvD,OACE,EAAO,UAAY,EAAM,SACzB,EAAO,SAAW,EAAM,QACxB,EAAO,cAAgB,EAAM,aAC7B,EAAO,aAAe,EAAM,YAC5B,EAAO,QAAU,EAAM,OACvB,CAAC,EAAe,EAAO,UAAW,EAAM,SAAS,GACjD,CAAC,EAAW,EAAO,SAAU,EAAM,QAAQ,CAE/C,CAEA,SAAS,EAAU,EAAwB,EAAe,EAAS,EAAS,OAAsB,CAChG,MAAO,CAAE,GAAG,EAAU,QAAO,QAAO,CACtC,CAGA,SAAS,EACP,EACA,EACqC,CACrC,IAAM,EAAkC,CAAE,GAAG,CAAK,EAClD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,CAAQ,EAC5C,IAAU,KAAM,OAAO,EAAO,GAC7B,EAAO,GAAO,EAErB,OAAO,OAAO,KAAK,CAAM,CAAC,CAAC,OAAS,EAAS,IAAA,EAC/C,CAGA,SAAS,EAAc,EAAc,EAA8B,CAKjE,GAJI,EAAK,UAAY,IAAA,KAAW,EAAO,QAAU,EAAK,SAClD,EAAK,cAAgB,IAAA,KAAW,EAAO,YAAc,EAAK,aAC1D,EAAK,aAAe,IAAA,KAAW,EAAO,WAAa,EAAK,YACxD,EAAK,QAAU,IAAA,KAAW,EAAO,MAAQ,EAAK,OAC9C,EAAK,WAAa,IAAA,GAAW,CAC/B,IAAM,EAAS,EAAc,EAAO,SAAU,EAAK,QAAQ,EACvD,IAAW,IAAA,GAAW,OAAO,EAAO,SACnC,EAAO,SAAW,CACzB,CACF,CAkBA,SAAS,EAAW,EAAwB,EAAe,EAA2B,CACpF,GAAI,OAAO,GAAU,SAAU,MAAO,CAAE,GAAI,GAAM,GAAI,CAAM,EAC5D,GAAI,CAAC,EAAY,KAAK,CAAK,EACzB,MAAO,CAAE,GAAI,GAAO,QAAS,GAAG,EAAM,KAAK,EAAM,2DAA4D,EAE/G,IAAM,EAAK,EAAQ,OAAO,IAAI,CAAK,EACnC,GAAI,IAAO,IAAA,GAAW,MAAO,CAAE,GAAI,GAAM,IAAG,EAC5C,IAAM,EAAW,EAAQ,WAAW,IAAI,CAAK,EAI7C,OAHI,IAAa,IAAA,GAGV,CACL,GAAI,GACJ,QAAS,GAAG,EAAM,iBAAiB,EAAM,gEAC3C,EALS,CAAE,GAAI,GAAO,QAAS,GAAG,EAAM,SAAS,EAAM,mBAAmB,EAAS,gBAAiB,CAMtG,CAIA,SAAS,EAAK,EAA6B,CACzC,MAAO,CAAE,GAAI,GAAO,SAAQ,CAC9B,CAGA,SAAS,EAAW,EAAwB,EAA4C,CACtF,GAAI,EAAK,MAAQ,IAAA,GAAW,CAC1B,GAAI,EAAK,KAAO,IAAA,GAAW,MAAO,uEAClC,GAAI,CAAC,EAAY,KAAK,EAAK,GAAG,EAC5B,MAAO,QAAQ,EAAK,IAAI,uFAG1B,GADc,EAAQ,OAAO,IAAI,EAAK,GAAG,IAAM,IAAA,IAAa,EAAQ,WAAW,IAAI,EAAK,GAAG,EAChF,MAAO,kBAAkB,EAAK,IAAI,+CAC/C,CAEF,CAEA,SAAS,EAAgB,EAAwB,EAAwB,EAAe,EAAyB,CAC/G,GAAI,EAAK,UAAY,IAAA,GAAW,OAAO,EAAK,8CAA8C,EAC1F,GAAI,CAAC,EAAK,QAAQ,KAAK,EAAG,OAAO,EAAK,2BAA2B,EACjE,GAAI,EAAK,eAAiB,IAAA,IAAa,EAAK,kBAAoB,IAAA,GAC9D,OAAO,EAAK,4FAA4F,EAI1G,GAAI,EAAK,SAAA,UACP,OAAO,EAAK,6EAA6E,EAI3F,GADkB,EAAQ,MAAM,OAAQ,GAAS,EAAK,SAAA,SAAyB,CAAC,CAAC,QAChE,EAAQ,SACvB,OAAO,EAAK,iBAAiB,EAAQ,SAAS,iEAAiE,EAGjH,IAAM,EAAsB,CAAC,EAC7B,IAAK,IAAM,KAAS,EAAK,WAAa,CAAC,EAAG,CACxC,IAAM,EAAW,EAAW,EAAS,YAAa,CAAK,EACvD,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAC9C,IAAM,EAAM,EAAQ,MAAM,KAAM,GAAS,EAAK,KAAO,EAAS,EAAE,EAChE,GAAI,CAAC,EAAK,OAAO,EAAK,eAAe,EAAS,GAAG,WAAW,EAC5D,GAAI,EAAI,SAAA,UAA2B,OAAO,EAAK,eAAe,EAAS,GAAG,YAAY,EACjF,EAAU,SAAS,EAAS,EAAE,GAAG,EAAU,KAAK,EAAS,EAAE,CAClE,CAIA,IAAM,EAAgB,CACpB,GAAI,EAAQ,OACZ,QAAS,EAAK,QACd,OAAQ,EAAK,QAAU,UACvB,UAAW,EACX,UAAW,CACb,EAQA,OAPA,EAAc,EAAS,CAAI,EACvB,EAAU,SAAQ,EAAQ,UAAY,GAE1C,EAAQ,QAAU,EAClB,EAAQ,MAAM,KAAK,CAAO,EACtB,EAAK,KAAK,EAAQ,OAAO,IAAI,EAAK,IAAK,EAAQ,EAAE,EAE9C,CACL,GAAI,GACJ,QAAS,CACP,QACA,KAAM,UACN,GAAI,EAAQ,GACZ,QAAS,EAAQ,QACjB,OAAQ,EAAQ,OAChB,GAAI,EAAK,IAAM,CAAE,IAAK,EAAK,GAAI,EAAI,CAAC,EACpC,GAAI,EAAU,OAAS,CAAE,WAAU,EAAI,CAAC,CAC1C,CACF,CACF,CAEA,SAAS,EAAgB,EAAwB,EAAwB,EAAe,EAAyB,CAC/G,IAAM,EAAK,EAAK,GACV,EAAK,EAAQ,MAAM,UAAW,GAAS,EAAK,KAAO,CAAE,EAC3D,GAAI,IAAO,GAAI,OAAO,EAAK,IAAI,EAAG,WAAW,EAC7C,GAAI,EAAK,YAAc,IAAA,GACrB,OAAO,EAAK,kGAAkG,EAYhH,GAAI,EARF,EAAK,UAAY,IAAA,IACjB,EAAK,cAAgB,IAAA,IACrB,EAAK,aAAe,IAAA,IACpB,EAAK,SAAW,IAAA,IAChB,EAAK,QAAU,IAAA,IACf,EAAK,WAAa,IAAA,IACV,EAAK,cAAc,QACnB,EAAK,iBAAiB,QAE9B,OAAO,EACL,wIACF,EAGF,IAAM,EAAU,EAAQ,MAAM,GAK9B,GAAI,EAAK,UAAY,IAAA,IAAa,CAAC,EAAK,QAAQ,KAAK,EAAG,OAAO,EAAK,2BAA2B,EAE/F,IAAI,EAAY,EAAQ,OACxB,GAAI,EAAK,SAAW,IAAA,GAAW,CAC7B,GAAI,CAACA,EAAAA,kBAAkB,EAAQ,OAAQ,EAAK,MAAM,EAChD,OAAO,EAAK,sBAAsB,EAAQ,OAAO,MAAM,EAAK,QAAQ,EAEtE,EAAY,EAAK,MACnB,CAEA,IAAI,EAAe,EAAQ,UAAY,CAAC,GAAG,EAAQ,SAAS,EAAI,CAAC,EACjE,IAAK,IAAM,KAAS,EAAK,iBAAmB,CAAC,EAAG,CAC9C,IAAM,EAAW,EAAW,EAAS,kBAAmB,CAAK,EAC7D,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAG9C,EAAe,EAAa,OAAQ,GAAQ,IAAQ,EAAS,EAAE,CACjE,CACA,IAAK,IAAM,KAAS,EAAK,cAAgB,CAAC,EAAG,CAC3C,IAAM,EAAW,EAAW,EAAS,eAAgB,CAAK,EAC1D,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAC9C,GAAI,EAAS,KAAO,EAAI,OAAO,EAAK,iBAAiB,EAAG,WAAW,EACnE,IAAM,EAAM,EAAQ,MAAM,KAAM,GAAS,EAAK,KAAO,EAAS,EAAE,EAChE,GAAI,CAAC,EAAK,OAAO,EAAK,kBAAkB,EAAS,GAAG,WAAW,EAC/D,GAAI,EAAI,SAAA,UAA2B,OAAO,EAAK,kBAAkB,EAAS,GAAG,YAAY,EACpF,EAAa,SAAS,EAAS,EAAE,GAAG,EAAa,KAAK,EAAS,EAAE,CACxE,CAEA,IAAM,EAAgB,CAAE,GAAG,EAAS,OAAQ,CAAU,EACtD,EAAc,EAAS,CAAI,EACvB,EAAa,OAAQ,EAAQ,UAAY,EACxC,OAAO,EAAQ,UAMpB,IAAM,EAAY,CAAC,GAAG,EAAQ,KAAK,EAEnC,GADA,EAAU,GAAM,EACZ,EAAK,cAAc,QAAUC,EAAAA,YAAY,EAAW,EAAI,CAAY,EACtE,OAAO,EAAK,0DAA0D,EAGxE,IAAM,EAAU,EAAY,EAAS,CAAO,EAI5C,OAHI,IAAS,EAAQ,UAAY,GACjC,EAAQ,MAAQ,EAET,CACL,GAAI,GACJ,QAAS,EACL,CAAE,QAAO,KAAM,UAAW,KAAI,WAAY,EAAQ,OAAQ,SAAU,CAAU,EAC9E,CAAE,QAAO,KAAM,YAAa,KAAI,OAAQ,CAAU,CACxD,CACF,CASA,SAAS,EAAY,EAAwB,EAA2B,EAAa,EAA+B,CAClH,IAAM,EAAyB,CAC7B,MAAO,CAAC,GAAG,EAAS,KAAK,EACzB,OAAQ,EAAS,OACjB,WACA,OAAQ,IAAI,IACZ,WAAY,IAAI,GAClB,EACM,EAAgC,CAAC,EACnC,EAAU,EAEd,IAAK,GAAM,CAAC,EAAO,KAAS,EAAM,QAAQ,EAAG,CAC3C,IAAM,EAAa,EAAW,EAAS,CAAI,EACrC,EAAS,EACX,EAAK,CAAU,EACf,EAAK,KAAO,IAAA,GACV,EAAgB,EAAS,EAAM,EAAO,CAAG,EACzC,EAAgB,EAAS,EAAM,EAAO,CAAG,EAE/C,GAAI,EAAO,GAAI,CACb,EAAS,KAAK,EAAO,OAAO,EAC5B,GAAW,EACX,QACF,CAGI,EAAK,KAAO,EAAY,KAAK,EAAK,GAAG,GAAK,CAAC,EAAQ,OAAO,IAAI,EAAK,GAAG,GACxE,EAAQ,WAAW,IAAI,EAAK,IAAK,CAAK,EAExC,EAAS,KAAK,CACZ,QACA,KAAM,SACN,QAAS,EAAO,QAChB,GAAI,EAAK,KAAO,IAAA,GAAY,CAAC,EAAI,CAAE,GAAI,EAAK,EAAG,EAC/C,GAAI,EAAK,IAAM,CAAE,IAAK,EAAK,GAAI,EAAI,CAAC,CACtC,CAAC,CACH,CAEA,MAAO,CAGL,SAAU,EAAU,EAAI,EAAU,EAAU,EAAQ,MAAO,EAAQ,MAAM,EAAI,EAC7E,GAAI,CAAE,KAAM,SAAU,MAAO,EAAU,UAAS,OAAQ,EAAS,OAAS,CAAQ,CACpF,CACF,CASA,SAAgB,EACd,EACA,EACA,EACA,EAAc,IAAI,KAAK,CAAA,CAAE,YAAY,EACrC,EAAW,GACE,CACb,OAAQ,EAAR,CACE,IAAK,SAAU,CACb,IAAM,EAAQ,EAAO,MAarB,MAZI,CAAC,MAAM,QAAQ,CAAK,GAAK,EAAM,SAAW,EACrC,EACL,EACA,uGACF,EAEE,EAAM,OAAA,IACD,EACL,EACA,yDAAyE,EAAM,OAAO,EACxF,EAEK,EAAY,EAAU,EAAO,EAAK,CAAQ,CACnD,CAEA,IAAK,OACH,MAAO,CACL,WACA,GAAI,CACF,KAAM,OACN,eAAgB,EAAO,iBAAmB,GAC1C,GAAI,EAAO,SAAW,IAAA,GAA8C,CAAC,EAAnC,CAAE,aAAc,EAAO,MAAO,CAClE,CACF,EAGF,IAAK,MAAO,CACV,GAAI,EAAO,KAAO,IAAA,GAAW,OAAO,EAAY,EAAU,qBAAqB,EAC/E,IAAM,EAAO,EAAS,MAAM,KAAM,GAAc,EAAU,KAAO,EAAO,EAAE,EAE1E,OADK,EACE,CAAE,WAAU,GAAI,CAAE,KAAM,MAAO,MAAK,CAAE,EAD3B,EAAY,EAAU,IAAI,EAAO,GAAG,WAAW,CAEnE,CAEA,IAAK,SAAU,CACb,GAAI,EAAO,KAAO,IAAA,GAAW,OAAO,EAAY,EAAU,wBAAwB,EAClF,IAAM,EAAQ,EAAS,MAAM,UAAW,GAAS,EAAK,KAAO,EAAO,EAAE,EACtE,GAAI,IAAU,GAAI,OAAO,EAAY,EAAU,IAAI,EAAO,GAAG,WAAW,EACxE,IAAM,EAAU,EAAS,MAAM,GAC/B,GAAI,EAAQ,SAAA,UAA2B,OAAO,EAAY,EAAU,IAAI,EAAQ,GAAG,oBAAoB,EACvG,GAAIC,EAAAA,mBAAmB,CAAO,EAC5B,OAAO,EAAY,EAAU,IAAI,EAAQ,GAAG,sDAAsD,EAGpG,IAAM,EAAQ,CAAC,GAAG,EAAS,KAAK,EAEhC,MADA,GAAM,GAAS,CAAE,GAAG,EAAS,OAAQC,EAAAA,eAAgB,UAAW,CAAI,EAC7D,CACL,SAAU,EAAU,EAAU,CAAK,EACnC,GAAI,CAAE,KAAM,SAAU,GAAI,EAAQ,GAAI,QAAS,EAAQ,OAAQ,CACjE,CACF,CAEA,IAAK,QAAS,CACZ,IAAM,EAAS,EAAS,MAAM,OAAOD,EAAAA,kBAAkB,EACvD,GAAI,EAAO,OAAS,EAElB,OAAO,EAAY,EAAU,+CADjB,EAAO,IAAK,GAAS,IAAI,EAAK,IAAI,CAAC,CAAC,KAAK,IACyB,EAAE,sBAAsB,EAExG,IAAM,EAAQ,EAAS,MAAM,OAC7B,MAAO,CACL,SAAU,EAAU,EAAU,CAAC,EAAG,CAAC,EACnC,GAAI,CAAE,KAAM,QAAS,OAAM,CAC7B,CACF,CACF,CACF"}

package/dist/{store/reducer.d.cts → services/reducer/index.d.cts}

@@ -1,13 +1,13 @@
-import { Task, TaskAction, TaskDocument, TaskMutationParams, TaskStatus, UpsertItemOutcome } from "./types.cjs";
-//#region src/store/reducer.d.ts
+import { Task, TaskAction, TaskDocument, TaskMutationParams, TaskStatus, UpsertItemOutcome } from "../../models/task.cjs";
+//#region src/services/reducer/index.d.ts
 /** Bounds the work one call can do, and with it the size of one committed write. */
-declare const MAX_UPSERT_ITEMS = 100;
+export declare const MAX_UPSERT_ITEMS = 100;
 /**
  * A ref must start with a letter, which makes it structurally unconfusable with
  * a stringified id. That is why resolving a dependency token is just a `typeof`
  * check with no coercion heuristics.
  */
-declare const REF_PATTERN: RegExp;
+export declare const REF_PATTERN: RegExp;
 /**
  * Reducer outcome. Closed tagged union: adding an action requires extending
  * this union and the response formatter, which the compiler enforces.
@@ -16,7 +16,7 @@ declare const REF_PATTERN: RegExp;
  * item failed — `error` is reserved for whole-call faults — so the tool layer
  * still has the per-item messages to report.
  */
-type Op = {
+export type Op = {
   kind: 'upsert';
   items: UpsertItemOutcome[];
   applied: number;
@@ -39,12 +39,12 @@ type Op = {
   kind: 'error';
   message: string;
 };
-interface ApplyResult {
+export interface ApplyResult {
   document: TaskDocument;
   op: Op;
 }
 /** Actions the reducer owns. `assign`/`cancel` are handled by the delegation manager. */
-type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
+export type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
 /**
  * Does this op represent state that must reach disk?
  *
@@ -52,13 +52,13 @@ type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
  * without declaring its persistence intent, so nothing silently starts or stops
  * bumping `rev`.
  */
-declare function isCommittingOp(op: Op): boolean;
+export declare function isCommittingOp(op: Op): boolean;
 /** Joined per-item failures, for the thrown error when an upsert applied nothing. */
-declare function formatUpsertFailure(op: Extract<Op, {
+export declare function formatUpsertFailure(op: Extract<Op, {
   kind: 'upsert';
 }>): string;
 /** The single item's outcome, for callers that only ever send a batch of one. */
-declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
+export declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
 /**
  * Pure reducer: (document, action, params) -> (document, op).
  *
@@ -66,7 +66,6 @@ declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
  * (transition legality, dangling or deleted blockedBy, self-block, cycles,
  * in-flight delegations). The caller owns persistence and formatting.
  */
-declare function applyTaskMutation(document: TaskDocument, action: ReducerAction, params: TaskMutationParams, now?: string): ApplyResult;
+export declare function applyTaskMutation(document: TaskDocument, action: ReducerAction, params: TaskMutationParams, now?: string, maxTasks?: number): ApplyResult;
 //#endregion
-export { ApplyResult, MAX_UPSERT_ITEMS, Op, REF_PATTERN, ReducerAction, applyTaskMutation, formatUpsertFailure, isCommittingOp, singleItemOutcome };
-//# sourceMappingURL=reducer.d.cts.map
+//# sourceMappingURL=index.d.cts.map

package/dist/services/reducer/index.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.cts","names":[],"sources":["../../../src/services/reducer/index.ts"],"mappings":";;;qBAmBa;;;;;;qBAOA,aAAW;;;;;;;;;YAUZ;EACN;EAAgB,OAAO;EAAqB;EAAiB;;EAC7D;EAAgB;EAAY;;EAC5B;EAAc,eAAe;EAAY;;EACzC;EAAa,MAAM;;EACnB;EAAe;;EACf;EAAe;;iBAEJ;EACf,UAAU;EACV,IAAI;;;YAIM,gBAAgB,QAAQ;;;;;;;;wBASpB,eAAe,IAAI;;wBAenB,oBAAoB,IAAI,QAAQ;EAAM;;;wBAQtC,kBAAkB,IAAI,KAAK;;;;;;;;wBA8T3B,kBACd,UAAU,cACV,QAAQ,eACR,QAAQ,oBACR,cACA,oBACC"}

package/dist/{store/reducer.d.mts → services/reducer/index.d.mts}

@@ -1,13 +1,13 @@
-import { Task, TaskAction, TaskDocument, TaskMutationParams, TaskStatus, UpsertItemOutcome } from "./types.mjs";
-//#region src/store/reducer.d.ts
+import { Task, TaskAction, TaskDocument, TaskMutationParams, TaskStatus, UpsertItemOutcome } from "../../models/task.mjs";
+//#region src/services/reducer/index.d.ts
 /** Bounds the work one call can do, and with it the size of one committed write. */
-declare const MAX_UPSERT_ITEMS = 100;
+export declare const MAX_UPSERT_ITEMS = 100;
 /**
  * A ref must start with a letter, which makes it structurally unconfusable with
  * a stringified id. That is why resolving a dependency token is just a `typeof`
  * check with no coercion heuristics.
  */
-declare const REF_PATTERN: RegExp;
+export declare const REF_PATTERN: RegExp;
 /**
  * Reducer outcome. Closed tagged union: adding an action requires extending
  * this union and the response formatter, which the compiler enforces.
@@ -16,7 +16,7 @@ declare const REF_PATTERN: RegExp;
  * item failed — `error` is reserved for whole-call faults — so the tool layer
  * still has the per-item messages to report.
  */
-type Op = {
+export type Op = {
   kind: 'upsert';
   items: UpsertItemOutcome[];
   applied: number;
@@ -39,12 +39,12 @@ type Op = {
   kind: 'error';
   message: string;
 };
-interface ApplyResult {
+export interface ApplyResult {
   document: TaskDocument;
   op: Op;
 }
 /** Actions the reducer owns. `assign`/`cancel` are handled by the delegation manager. */
-type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
+export type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
 /**
  * Does this op represent state that must reach disk?
  *
@@ -52,13 +52,13 @@ type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;
  * without declaring its persistence intent, so nothing silently starts or stops
  * bumping `rev`.
  */
-declare function isCommittingOp(op: Op): boolean;
+export declare function isCommittingOp(op: Op): boolean;
 /** Joined per-item failures, for the thrown error when an upsert applied nothing. */
-declare function formatUpsertFailure(op: Extract<Op, {
+export declare function formatUpsertFailure(op: Extract<Op, {
   kind: 'upsert';
 }>): string;
 /** The single item's outcome, for callers that only ever send a batch of one. */
-declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
+export declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
 /**
  * Pure reducer: (document, action, params) -> (document, op).
  *
@@ -66,7 +66,6 @@ declare function singleItemOutcome(op: Op): UpsertItemOutcome | undefined;
  * (transition legality, dangling or deleted blockedBy, self-block, cycles,
  * in-flight delegations). The caller owns persistence and formatting.
  */
-declare function applyTaskMutation(document: TaskDocument, action: ReducerAction, params: TaskMutationParams, now?: string): ApplyResult;
+export declare function applyTaskMutation(document: TaskDocument, action: ReducerAction, params: TaskMutationParams, now?: string, maxTasks?: number): ApplyResult;
 //#endregion
-export { ApplyResult, MAX_UPSERT_ITEMS, Op, REF_PATTERN, ReducerAction, applyTaskMutation, formatUpsertFailure, isCommittingOp, singleItemOutcome };
-//# sourceMappingURL=reducer.d.mts.map
+//# sourceMappingURL=index.d.mts.map

package/dist/services/reducer/index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.mts","names":[],"sources":["../../../src/services/reducer/index.ts"],"mappings":";;;qBAmBa;;;;;;qBAOA,aAAW;;;;;;;;;YAUZ;EACN;EAAgB,OAAO;EAAqB;EAAiB;;EAC7D;EAAgB;EAAY;;EAC5B;EAAc,eAAe;EAAY;;EACzC;EAAa,MAAM;;EACnB;EAAe;;EACf;EAAe;;iBAEJ;EACf,UAAU;EACV,IAAI;;;YAIM,gBAAgB,QAAQ;;;;;;;;wBASpB,eAAe,IAAI;;wBAenB,oBAAoB,IAAI,QAAQ;EAAM;;;wBAQtC,kBAAkB,IAAI,KAAK;;;;;;;;wBA8T3B,kBACd,UAAU,cACV,QAAQ,eACR,QAAQ,oBACR,cACA,oBACC"}

package/dist/services/reducer/index.mjs

@@ -0,0 +1,3 @@
+import{detectCycle as e}from"../../models/taskGraph.mjs";import{DELETED_STATUS as t,isDelegationActive as n}from"../../models/task.mjs";import{isTransitionValid as r}from"../invariants/index.mjs";const i=100,a=/^[A-Za-z][A-Za-z0-9_-]{0,31}$/;function o(e){switch(e.kind){case`error`:case`list`:case`get`:return!1;case`upsert`:return e.items.some(e=>e.kind===`created`||e.kind===`updated`);case`delete`:case`clear`:return!0}}function s(e){return e.items.filter(e=>e.kind===`failed`).map(e=>`item[${e.index}]: ${e.message}`).join(`
+`)}function c(e){return e.kind===`upsert`?e.items[0]:void 0}function l(e,t){return{document:e,op:{kind:`error`,message:t}}}function u(e,t){let n=e??[],r=t??[];return n.length===r.length&&n.every((e,t)=>e===r[t])}function d(e,t){return JSON.stringify(e??null)===JSON.stringify(t??null)}function f(e,t){return e.subject!==t.subject||e.status!==t.status||e.description!==t.description||e.activeForm!==t.activeForm||e.owner!==t.owner||!u(e.blockedBy,t.blockedBy)||!d(e.metadata,t.metadata)}function p(e,t,n=e.nextId){return{...e,tasks:t,nextId:n}}function m(e,t){let n={...e};for(let[e,r]of Object.entries(t))r===null?delete n[e]:n[e]=r;return Object.keys(n).length?n:void 0}function h(e,t){if(t.subject!==void 0&&(e.subject=t.subject),t.description!==void 0&&(e.description=t.description),t.activeForm!==void 0&&(e.activeForm=t.activeForm),t.owner!==void 0&&(e.owner=t.owner),t.metadata!==void 0){let n=m(e.metadata,t.metadata);n===void 0?delete e.metadata:e.metadata=n}}function g(e,t,n){if(typeof n==`number`)return{ok:!0,id:n};if(!a.test(n))return{ok:!1,message:`${t}: "${n}" is not a valid ref; pass an existing task id as a number`};let r=e.refIds.get(n);if(r!==void 0)return{ok:!0,id:r};let i=e.failedRefs.get(n);return i===void 0?{ok:!1,message:`${t}: unknown ref "${n}" — a ref must be declared by an earlier entry in the same call`}:{ok:!1,message:`${t}: ref "${n}" refers to item[${i}], which failed`}}function _(e){return{ok:!1,message:e}}function v(e,t){if(t.ref!==void 0){if(t.id!==void 0)return`ref is only valid when creating a task; drop the id, or drop the ref`;if(!a.test(t.ref))return`ref "${t.ref}" is invalid: a ref must start with a letter and contain only letters, digits, - or _`;if(e.refIds.get(t.ref)!==void 0||e.failedRefs.has(t.ref))return`duplicate ref "${t.ref}": it was already declared by an earlier entry`}}function y(e,t,n,r){if(t.subject===void 0)return _(`subject is required when the entry has no id`);if(!t.subject.trim())return _(`subject must not be blank`);if(t.addBlockedBy!==void 0||t.removeBlockedBy!==void 0)return _(`addBlockedBy / removeBlockedBy are only for an entry with an id; a new task uses blockedBy`);if(t.status===`deleted`)return _(`cannot create a task with status deleted; create it, then use action delete`);if(e.tasks.filter(e=>e.status!==`deleted`).length>=e.maxTasks)return _(`task limit of ${e.maxTasks} reached; delete completed tasks first before creating new tasks`);let i=[];for(let n of t.blockedBy??[]){let t=g(e,`blockedBy`,n);if(!t.ok)return _(t.message);let r=e.tasks.find(e=>e.id===t.id);if(!r)return _(`blockedBy: #${t.id} not found`);if(r.status===`deleted`)return _(`blockedBy: #${t.id} is deleted`);i.includes(t.id)||i.push(t.id)}let a={id:e.nextId,subject:t.subject,status:t.status??`pending`,createdAt:r,updatedAt:r};return h(a,t),i.length&&(a.blockedBy=i),e.nextId+=1,e.tasks.push(a),t.ref&&e.refIds.set(t.ref,a.id),{ok:!0,outcome:{index:n,kind:`created`,id:a.id,subject:a.subject,status:a.status,...t.ref?{ref:t.ref}:{},...i.length?{blockedBy:i}:{}}}}function b(t,n,i,a){let o=n.id,s=t.tasks.findIndex(e=>e.id===o);if(s===-1)return _(`#${o} not found`);if(n.blockedBy!==void 0)return _(`blockedBy is only for a new entry; use addBlockedBy / removeBlockedBy on an entry that has an id`);if(!(n.subject!==void 0||n.description!==void 0||n.activeForm!==void 0||n.status!==void 0||n.owner!==void 0||n.metadata!==void 0||n.addBlockedBy?.length||n.removeBlockedBy?.length))return _(`nothing to change: provide at least one of subject, description, activeForm, status, owner, metadata, addBlockedBy, or removeBlockedBy`);let c=t.tasks[s];if(n.subject!==void 0&&!n.subject.trim())return _(`subject must not be blank`);let l=c.status;if(n.status!==void 0){if(!r(c.status,n.status))return _(`illegal transition ${c.status} -> ${n.status}`);l=n.status}let u=c.blockedBy?[...c.blockedBy]:[];for(let e of n.removeBlockedBy??[]){let n=g(t,`removeBlockedBy`,e);if(!n.ok)return _(n.message);u=u.filter(e=>e!==n.id)}for(let e of n.addBlockedBy??[]){let n=g(t,`addBlockedBy`,e);if(!n.ok)return _(n.message);if(n.id===o)return _(`cannot block #${o} on itself`);let r=t.tasks.find(e=>e.id===n.id);if(!r)return _(`addBlockedBy: #${n.id} not found`);if(r.status===`deleted`)return _(`addBlockedBy: #${n.id} is deleted`);u.includes(n.id)||u.push(n.id)}let d={...c,status:l};h(d,n),u.length?d.blockedBy=u:delete d.blockedBy;let p=[...t.tasks];if(p[s]=d,n.addBlockedBy?.length&&e(p,o,u))return _(`addBlockedBy would create a cycle in the blockedBy graph`);let m=f(c,d);return m&&(d.updatedAt=a),t.tasks=p,{ok:!0,outcome:m?{index:i,kind:`updated`,id:o,fromStatus:c.status,toStatus:l}:{index:i,kind:`unchanged`,id:o,status:l}}}function x(e,t,n,r){let i={tasks:[...e.tasks],nextId:e.nextId,maxTasks:r,refIds:new Map,failedRefs:new Map},o=[],s=0;for(let[e,r]of t.entries()){let t=v(i,r),c=t?_(t):r.id===void 0?y(i,r,e,n):b(i,r,e,n);if(c.ok){o.push(c.outcome),s+=1;continue}r.ref&&a.test(r.ref)&&!i.refIds.has(r.ref)&&i.failedRefs.set(r.ref,e),o.push({index:e,kind:`failed`,message:c.message,...r.id===void 0?{}:{id:r.id},...r.ref?{ref:r.ref}:{}})}return{document:s>0?p(e,i.tasks,i.nextId):e,op:{kind:`upsert`,items:o,applied:s,failed:o.length-s}}}function S(e,r,i,a=new Date().toISOString(),o=15){switch(r){case`upsert`:{let t=i.tasks;return!Array.isArray(t)||t.length===0?l(e,`upsert requires a non-empty tasks array, e.g. {"action":"upsert","tasks":[{"subject":"Write tests"}]}`):t.length>100?l(e,`upsert accepts at most 100 entries per call (received ${t.length})`):x(e,t,a,o)}case`list`:return{document:e,op:{kind:`list`,includeDeleted:i.includeDeleted===!0,...i.status===void 0?{}:{statusFilter:i.status}}};case`get`:{if(i.id===void 0)return l(e,`id required for get`);let t=e.tasks.find(e=>e.id===i.id);return t?{document:e,op:{kind:`get`,task:t}}:l(e,`#${i.id} not found`)}case`delete`:{if(i.id===void 0)return l(e,`id required for delete`);let r=e.tasks.findIndex(e=>e.id===i.id);if(r===-1)return l(e,`#${i.id} not found`);let o=e.tasks[r];if(o.status===`deleted`)return l(e,`#${o.id} is already deleted`);if(n(o))return l(e,`#${o.id} has a running delegation — cancel it before deleting`);let s=[...e.tasks];return s[r]={...o,status:t,updatedAt:a},{document:p(e,s),op:{kind:`delete`,id:o.id,subject:o.subject}}}case`clear`:{let t=e.tasks.filter(n);if(t.length>0)return l(e,`cannot clear while delegations are running (${t.map(e=>`#${e.id}`).join(`, `)}) — cancel them first`);let r=e.tasks.length;return{document:p(e,[],1),op:{kind:`clear`,count:r}}}}}export{i as MAX_UPSERT_ITEMS,a as REF_PATTERN,S as applyTaskMutation,s as formatUpsertFailure,o as isCommittingOp,c as singleItemOutcome};
+//# sourceMappingURL=index.mjs.map

package/dist/services/reducer/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../src/services/reducer/index.ts"],"sourcesContent":["import {\n  DELETED_STATUS,\n  type DepToken,\n  isDelegationActive,\n  type Task,\n  type TaskAction,\n  type TaskDocument,\n  type TaskItemMutation,\n  type TaskMutationParams,\n  type TaskStatus,\n  type UpsertItemOutcome,\n} from '../../models/task';\nimport { detectCycle } from '../../models/taskGraph';\nimport { isTransitionValid } from '../invariants';\n\n/** Default board capacity when a caller does not provide a configured limit. */\nconst DEFAULT_REDUCER_MAX_TASKS = 15;\n\n/** Bounds the work one call can do, and with it the size of one committed write. */\nexport const MAX_UPSERT_ITEMS = 100;\n\n/**\n * A ref must start with a letter, which makes it structurally unconfusable with\n * a stringified id. That is why resolving a dependency token is just a `typeof`\n * check with no coercion heuristics.\n */\nexport const REF_PATTERN = /^[A-Za-z][A-Za-z0-9_-]{0,31}$/;\n\n/**\n * Reducer outcome. Closed tagged union: adding an action requires extending\n * this union and the response formatter, which the compiler enforces.\n *\n * `upsert` carries one outcome per request item. It is returned even when every\n * item failed — `error` is reserved for whole-call faults — so the tool layer\n * still has the per-item messages to report.\n */\nexport type Op =\n  | { kind: 'upsert'; items: UpsertItemOutcome[]; applied: number; failed: number }\n  | { kind: 'delete'; id: number; subject: string }\n  | { kind: 'list'; statusFilter?: TaskStatus; includeDeleted: boolean }\n  | { kind: 'get'; task: Task }\n  | { kind: 'clear'; count: number }\n  | { kind: 'error'; message: string };\n\nexport interface ApplyResult {\n  document: TaskDocument;\n  op: Op;\n}\n\n/** Actions the reducer owns. `assign`/`cancel` are handled by the delegation manager. */\nexport type ReducerAction = Exclude<TaskAction, 'assign' | 'cancel'>;\n\n/**\n * Does this op represent state that must reach disk?\n *\n * The exhaustive switch is the point: a future `Op` variant cannot be added\n * without declaring its persistence intent, so nothing silently starts or stops\n * bumping `rev`.\n */\nexport function isCommittingOp(op: Op): boolean {\n  switch (op.kind) {\n    case 'error':\n    case 'list':\n    case 'get':\n      return false;\n    case 'upsert':\n      return op.items.some((item) => item.kind === 'created' || item.kind === 'updated');\n    case 'delete':\n    case 'clear':\n      return true;\n  }\n}\n\n/** Joined per-item failures, for the thrown error when an upsert applied nothing. */\nexport function formatUpsertFailure(op: Extract<Op, { kind: 'upsert' }>): string {\n  return op.items\n    .filter((item) => item.kind === 'failed')\n    .map((item) => `item[${item.index}]: ${item.message}`)\n    .join('\\n');\n}\n\n/** The single item's outcome, for callers that only ever send a batch of one. */\nexport function singleItemOutcome(op: Op): UpsertItemOutcome | undefined {\n  return op.kind === 'upsert' ? op.items[0] : undefined;\n}\n\nfunction errorResult(document: TaskDocument, message: string): ApplyResult {\n  return { document, op: { kind: 'error', message } };\n}\n\nfunction sameNumberList(a: number[] | undefined, b: number[] | undefined): boolean {\n  const x = a ?? [];\n  const y = b ?? [];\n  return x.length === y.length && x.every((value, index) => value === y[index]);\n}\n\nfunction sameRecord(a: Record<string, unknown> | undefined, b: Record<string, unknown> | undefined): boolean {\n  return JSON.stringify(a ?? null) === JSON.stringify(b ?? null);\n}\n\n/**\n * Did this update change anything? A no-effect update (status re-set to its\n * current value, fields re-sent unchanged) reports \"No change\" rather than\n * \"Updated #N\" — without the distinction a model can loop re-issuing the same\n * call believing it never landed.\n */\nfunction taskChanged(before: Task, after: Task): boolean {\n  return (\n    before.subject !== after.subject ||\n    before.status !== after.status ||\n    before.description !== after.description ||\n    before.activeForm !== after.activeForm ||\n    before.owner !== after.owner ||\n    !sameNumberList(before.blockedBy, after.blockedBy) ||\n    !sameRecord(before.metadata, after.metadata)\n  );\n}\n\nfunction withTasks(document: TaskDocument, tasks: Task[], nextId = document.nextId): TaskDocument {\n  return { ...document, tasks, nextId };\n}\n\n/** Merge incoming metadata over a base; a `null` value deletes its key. */\nfunction mergeMetadata(\n  base: Record<string, unknown> | undefined,\n  incoming: Record<string, unknown>,\n): Record<string, unknown> | undefined {\n  const merged: Record<string, unknown> = { ...base };\n  for (const [key, value] of Object.entries(incoming)) {\n    if (value === null) delete merged[key];\n    else merged[key] = value;\n  }\n  return Object.keys(merged).length ? merged : undefined;\n}\n\n/** Copy the optional scalar fields an item may set onto a task, in place. */\nfunction assignScalars(target: Task, item: TaskItemMutation): void {\n  if (item.subject !== undefined) target.subject = item.subject;\n  if (item.description !== undefined) target.description = item.description;\n  if (item.activeForm !== undefined) target.activeForm = item.activeForm;\n  if (item.owner !== undefined) target.owner = item.owner;\n  if (item.metadata !== undefined) {\n    const merged = mergeMetadata(target.metadata, item.metadata);\n    if (merged === undefined) delete target.metadata;\n    else target.metadata = merged;\n  }\n}\n\n/**\n * Working state threaded item to item, so entry N observes every effect of\n * entries 1..N-1. `refIds` and `failedRefs` are what make the cascade work:\n * refs resolve backward only, so an entry that names a failed sibling is always\n * processed after the failure that killed it.\n */\ninterface UpsertContext {\n  tasks: Task[];\n  nextId: number;\n  maxTasks: number;\n  refIds: Map<string, number>;\n  failedRefs: Map<string, number>;\n}\n\ntype Resolved = { ok: true; id: number } | { ok: false; message: string };\n\nfunction resolveDep(context: UpsertContext, field: string, token: DepToken): Resolved {\n  if (typeof token === 'number') return { ok: true, id: token };\n  if (!REF_PATTERN.test(token)) {\n    return { ok: false, message: `${field}: \"${token}\" is not a valid ref; pass an existing task id as a number` };\n  }\n  const id = context.refIds.get(token);\n  if (id !== undefined) return { ok: true, id };\n  const failedAt = context.failedRefs.get(token);\n  if (failedAt !== undefined) {\n    return { ok: false, message: `${field}: ref \"${token}\" refers to item[${failedAt}], which failed` };\n  }\n  return {\n    ok: false,\n    message: `${field}: unknown ref \"${token}\" — a ref must be declared by an earlier entry in the same call`,\n  };\n}\n\ntype ItemResult = { ok: true; outcome: UpsertItemOutcome } | { ok: false; message: string };\n\nfunction fail(message: string): ItemResult {\n  return { ok: false, message };\n}\n\n/** Structural checks that apply to every entry, whichever kind it is. */\nfunction checkShape(context: UpsertContext, item: TaskItemMutation): string | undefined {\n  if (item.ref !== undefined) {\n    if (item.id !== undefined) return 'ref is only valid when creating a task; drop the id, or drop the ref';\n    if (!REF_PATTERN.test(item.ref)) {\n      return `ref \"${item.ref}\" is invalid: a ref must start with a letter and contain only letters, digits, - or _`;\n    }\n    const owner = context.refIds.get(item.ref) !== undefined || context.failedRefs.has(item.ref);\n    if (owner) return `duplicate ref \"${item.ref}\": it was already declared by an earlier entry`;\n  }\n  return undefined;\n}\n\nfunction applyCreateItem(context: UpsertContext, item: TaskItemMutation, index: number, now: string): ItemResult {\n  if (item.subject === undefined) return fail('subject is required when the entry has no id');\n  if (!item.subject.trim()) return fail('subject must not be blank');\n  if (item.addBlockedBy !== undefined || item.removeBlockedBy !== undefined) {\n    return fail('addBlockedBy / removeBlockedBy are only for an entry with an id; a new task uses blockedBy');\n  }\n  // A task created as a tombstone is invisible to every view and can never\n  // leave `deleted`, so it would be a write-only black hole.\n  if (item.status === DELETED_STATUS) {\n    return fail('cannot create a task with status deleted; create it, then use action delete');\n  }\n\n  const taskCount = context.tasks.filter((task) => task.status !== DELETED_STATUS).length;\n  if (taskCount >= context.maxTasks) {\n    return fail(`task limit of ${context.maxTasks} reached; delete completed tasks first before creating new tasks`);\n  }\n\n  const blockedBy: number[] = [];\n  for (const token of item.blockedBy ?? []) {\n    const resolved = resolveDep(context, 'blockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    const dep = context.tasks.find((task) => task.id === resolved.id);\n    if (!dep) return fail(`blockedBy: #${resolved.id} not found`);\n    if (dep.status === DELETED_STATUS) return fail(`blockedBy: #${resolved.id} is deleted`);\n    if (!blockedBy.includes(resolved.id)) blockedBy.push(resolved.id);\n  }\n\n  // No cycle check is needed: the id is freshly allocated, so nothing already\n  // in the document can point at it yet.\n  const created: Task = {\n    id: context.nextId,\n    subject: item.subject,\n    status: item.status ?? 'pending',\n    createdAt: now,\n    updatedAt: now,\n  };\n  assignScalars(created, item);\n  if (blockedBy.length) created.blockedBy = blockedBy;\n\n  context.nextId += 1;\n  context.tasks.push(created);\n  if (item.ref) context.refIds.set(item.ref, created.id);\n\n  return {\n    ok: true,\n    outcome: {\n      index,\n      kind: 'created',\n      id: created.id,\n      subject: created.subject,\n      status: created.status,\n      ...(item.ref ? { ref: item.ref } : {}),\n      ...(blockedBy.length ? { blockedBy } : {}),\n    },\n  };\n}\n\nfunction applyUpdateItem(context: UpsertContext, item: TaskItemMutation, index: number, now: string): ItemResult {\n  const id = item.id as number;\n  const at = context.tasks.findIndex((task) => task.id === id);\n  if (at === -1) return fail(`#${id} not found`);\n  if (item.blockedBy !== undefined) {\n    return fail('blockedBy is only for a new entry; use addBlockedBy / removeBlockedBy on an entry that has an id');\n  }\n\n  const hasMutation =\n    item.subject !== undefined ||\n    item.description !== undefined ||\n    item.activeForm !== undefined ||\n    item.status !== undefined ||\n    item.owner !== undefined ||\n    item.metadata !== undefined ||\n    Boolean(item.addBlockedBy?.length) ||\n    Boolean(item.removeBlockedBy?.length);\n  if (!hasMutation) {\n    return fail(\n      'nothing to change: provide at least one of subject, description, activeForm, status, owner, metadata, addBlockedBy, or removeBlockedBy',\n    );\n  }\n\n  const current = context.tasks[at];\n\n  // The Task Space overlay commits free text from an inline editor, so a blank\n  // subject reaches the reducer as a real update rather than as a missing\n  // field. Persisting it would leave an unidentifiable row.\n  if (item.subject !== undefined && !item.subject.trim()) return fail('subject must not be blank');\n\n  let newStatus = current.status;\n  if (item.status !== undefined) {\n    if (!isTransitionValid(current.status, item.status)) {\n      return fail(`illegal transition ${current.status} -> ${item.status}`);\n    }\n    newStatus = item.status;\n  }\n\n  let newBlockedBy = current.blockedBy ? [...current.blockedBy] : [];\n  for (const token of item.removeBlockedBy ?? []) {\n    const resolved = resolveDep(context, 'removeBlockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    // Removing an id that is not there is a well-defined no-op, so unlike the\n    // add path this deliberately skips the existence check.\n    newBlockedBy = newBlockedBy.filter((dep) => dep !== resolved.id);\n  }\n  for (const token of item.addBlockedBy ?? []) {\n    const resolved = resolveDep(context, 'addBlockedBy', token);\n    if (!resolved.ok) return fail(resolved.message);\n    if (resolved.id === id) return fail(`cannot block #${id} on itself`);\n    const dep = context.tasks.find((task) => task.id === resolved.id);\n    if (!dep) return fail(`addBlockedBy: #${resolved.id} not found`);\n    if (dep.status === DELETED_STATUS) return fail(`addBlockedBy: #${resolved.id} is deleted`);\n    if (!newBlockedBy.includes(resolved.id)) newBlockedBy.push(resolved.id);\n  }\n\n  const updated: Task = { ...current, status: newStatus };\n  assignScalars(updated, item);\n  if (newBlockedBy.length) updated.blockedBy = newBlockedBy;\n  else delete updated.blockedBy;\n\n  // The candidate is written before the check because `detectCycle` unions the\n  // node's stored edges with the ones passed in: checking against the old array\n  // would resurrect an edge `removeBlockedBy` just stripped and reject a\n  // remove+add that legitimately breaks a cycle.\n  const candidate = [...context.tasks];\n  candidate[at] = updated;\n  if (item.addBlockedBy?.length && detectCycle(candidate, id, newBlockedBy)) {\n    return fail('addBlockedBy would create a cycle in the blockedBy graph');\n  }\n\n  const changed = taskChanged(current, updated);\n  if (changed) updated.updatedAt = now;\n  context.tasks = candidate;\n\n  return {\n    ok: true,\n    outcome: changed\n      ? { index, kind: 'updated', id, fromStatus: current.status, toStatus: newStatus }\n      : { index, kind: 'unchanged', id, status: newStatus },\n  };\n}\n\n/**\n * Apply every entry in request order, threading the document.\n *\n * Each entry lands completely or not at all: a create whose dependencies fail\n * is not kept dependency-free, because handing back an unblocked task the\n * caller asked to be blocked is a lie it may immediately act on.\n */\nfunction applyUpsert(document: TaskDocument, items: TaskItemMutation[], now: string, maxTasks: number): ApplyResult {\n  const context: UpsertContext = {\n    tasks: [...document.tasks],\n    nextId: document.nextId,\n    maxTasks,\n    refIds: new Map(),\n    failedRefs: new Map(),\n  };\n  const outcomes: UpsertItemOutcome[] = [];\n  let applied = 0;\n\n  for (const [index, item] of items.entries()) {\n    const shapeError = checkShape(context, item);\n    const result = shapeError\n      ? fail(shapeError)\n      : item.id === undefined\n        ? applyCreateItem(context, item, index, now)\n        : applyUpdateItem(context, item, index, now);\n\n    if (result.ok) {\n      outcomes.push(result.outcome);\n      applied += 1;\n      continue;\n    }\n    // A ref whose owner failed must not read as a typo to the entries that\n    // depend on it, so the dead ref is recorded rather than left unknown.\n    if (item.ref && REF_PATTERN.test(item.ref) && !context.refIds.has(item.ref)) {\n      context.failedRefs.set(item.ref, index);\n    }\n    outcomes.push({\n      index,\n      kind: 'failed',\n      message: result.message,\n      ...(item.id === undefined ? {} : { id: item.id }),\n      ...(item.ref ? { ref: item.ref } : {}),\n    });\n  }\n\n  return {\n    // Nothing applied means nothing to write: returning the original object by\n    // reference keeps the caller's write-skip path identical to a hard error.\n    document: applied > 0 ? withTasks(document, context.tasks, context.nextId) : document,\n    op: { kind: 'upsert', items: outcomes, applied, failed: outcomes.length - applied },\n  };\n}\n\n/**\n * Pure reducer: (document, action, params) -> (document, op).\n *\n * All validation is in-line: structural guards plus state-aware checks\n * (transition legality, dangling or deleted blockedBy, self-block, cycles,\n * in-flight delegations). The caller owns persistence and formatting.\n */\nexport function applyTaskMutation(\n  document: TaskDocument,\n  action: ReducerAction,\n  params: TaskMutationParams,\n  now: string = new Date().toISOString(),\n  maxTasks = DEFAULT_REDUCER_MAX_TASKS,\n): ApplyResult {\n  switch (action) {\n    case 'upsert': {\n      const items = params.tasks;\n      if (!Array.isArray(items) || items.length === 0) {\n        return errorResult(\n          document,\n          'upsert requires a non-empty tasks array, e.g. {\"action\":\"upsert\",\"tasks\":[{\"subject\":\"Write tests\"}]}',\n        );\n      }\n      if (items.length > MAX_UPSERT_ITEMS) {\n        return errorResult(\n          document,\n          `upsert accepts at most ${MAX_UPSERT_ITEMS} entries per call (received ${items.length})`,\n        );\n      }\n      return applyUpsert(document, items, now, maxTasks);\n    }\n\n    case 'list': {\n      return {\n        document,\n        op: {\n          kind: 'list',\n          includeDeleted: params.includeDeleted === true,\n          ...(params.status !== undefined ? { statusFilter: params.status } : {}),\n        },\n      };\n    }\n\n    case 'get': {\n      if (params.id === undefined) return errorResult(document, 'id required for get');\n      const task = document.tasks.find((candidate) => candidate.id === params.id);\n      if (!task) return errorResult(document, `#${params.id} not found`);\n      return { document, op: { kind: 'get', task } };\n    }\n\n    case 'delete': {\n      if (params.id === undefined) return errorResult(document, 'id required for delete');\n      const index = document.tasks.findIndex((task) => task.id === params.id);\n      if (index === -1) return errorResult(document, `#${params.id} not found`);\n      const current = document.tasks[index];\n      if (current.status === DELETED_STATUS) return errorResult(document, `#${current.id} is already deleted`);\n      if (isDelegationActive(current)) {\n        return errorResult(document, `#${current.id} has a running delegation — cancel it before deleting`);\n      }\n\n      const tasks = [...document.tasks];\n      tasks[index] = { ...current, status: DELETED_STATUS, updatedAt: now };\n      return {\n        document: withTasks(document, tasks),\n        op: { kind: 'delete', id: current.id, subject: current.subject },\n      };\n    }\n\n    case 'clear': {\n      const active = document.tasks.filter(isDelegationActive);\n      if (active.length > 0) {\n        const ids = active.map((task) => `#${task.id}`).join(', ');\n        return errorResult(document, `cannot clear while delegations are running (${ids}) — cancel them first`);\n      }\n      const count = document.tasks.length;\n      return {\n        document: withTasks(document, [], 1),\n        op: { kind: 'clear', count },\n      };\n    }\n  }\n}\n"],"mappings":"oMAgBA,MAGa,EAAmB,IAOnB,EAAc,gCAiC3B,SAAgB,EAAe,EAAiB,CAC9C,OAAQ,EAAG,KAAX,CACE,IAAK,QACL,IAAK,OACL,IAAK,MACH,MAAO,GACT,IAAK,SACH,OAAO,EAAG,MAAM,KAAM,GAAS,EAAK,OAAS,WAAa,EAAK,OAAS,SAAS,EACnF,IAAK,SACL,IAAK,QACH,MAAO,EACX,CACF,CAGA,SAAgB,EAAoB,EAA6C,CAC/E,OAAO,EAAG,MACP,OAAQ,GAAS,EAAK,OAAS,QAAQ,CAAC,CACxC,IAAK,GAAS,QAAQ,EAAK,MAAM,KAAK,EAAK,SAAS,CAAC,CACrD,KAAK;CAAI,CACd,CAGA,SAAgB,EAAkB,EAAuC,CACvE,OAAO,EAAG,OAAS,SAAW,EAAG,MAAM,GAAK,IAAA,EAC9C,CAEA,SAAS,EAAY,EAAwB,EAA8B,CACzE,MAAO,CAAE,WAAU,GAAI,CAAE,KAAM,QAAS,SAAQ,CAAE,CACpD,CAEA,SAAS,EAAe,EAAyB,EAAkC,CACjF,IAAM,EAAI,GAAK,CAAC,EACV,EAAI,GAAK,CAAC,EAChB,OAAO,EAAE,SAAW,EAAE,QAAU,EAAE,OAAO,EAAO,IAAU,IAAU,EAAE,EAAM,CAC9E,CAEA,SAAS,EAAW,EAAwC,EAAiD,CAC3G,OAAO,KAAK,UAAU,GAAK,IAAI,IAAM,KAAK,UAAU,GAAK,IAAI,CAC/D,CAQA,SAAS,EAAY,EAAc,EAAsB,CACvD,OACE,EAAO,UAAY,EAAM,SACzB,EAAO,SAAW,EAAM,QACxB,EAAO,cAAgB,EAAM,aAC7B,EAAO,aAAe,EAAM,YAC5B,EAAO,QAAU,EAAM,OACvB,CAAC,EAAe,EAAO,UAAW,EAAM,SAAS,GACjD,CAAC,EAAW,EAAO,SAAU,EAAM,QAAQ,CAE/C,CAEA,SAAS,EAAU,EAAwB,EAAe,EAAS,EAAS,OAAsB,CAChG,MAAO,CAAE,GAAG,EAAU,QAAO,QAAO,CACtC,CAGA,SAAS,EACP,EACA,EACqC,CACrC,IAAM,EAAkC,CAAE,GAAG,CAAK,EAClD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,CAAQ,EAC5C,IAAU,KAAM,OAAO,EAAO,GAC7B,EAAO,GAAO,EAErB,OAAO,OAAO,KAAK,CAAM,CAAC,CAAC,OAAS,EAAS,IAAA,EAC/C,CAGA,SAAS,EAAc,EAAc,EAA8B,CAKjE,GAJI,EAAK,UAAY,IAAA,KAAW,EAAO,QAAU,EAAK,SAClD,EAAK,cAAgB,IAAA,KAAW,EAAO,YAAc,EAAK,aAC1D,EAAK,aAAe,IAAA,KAAW,EAAO,WAAa,EAAK,YACxD,EAAK,QAAU,IAAA,KAAW,EAAO,MAAQ,EAAK,OAC9C,EAAK,WAAa,IAAA,GAAW,CAC/B,IAAM,EAAS,EAAc,EAAO,SAAU,EAAK,QAAQ,EACvD,IAAW,IAAA,GAAW,OAAO,EAAO,SACnC,EAAO,SAAW,CACzB,CACF,CAkBA,SAAS,EAAW,EAAwB,EAAe,EAA2B,CACpF,GAAI,OAAO,GAAU,SAAU,MAAO,CAAE,GAAI,GAAM,GAAI,CAAM,EAC5D,GAAI,CAAC,EAAY,KAAK,CAAK,EACzB,MAAO,CAAE,GAAI,GAAO,QAAS,GAAG,EAAM,KAAK,EAAM,2DAA4D,EAE/G,IAAM,EAAK,EAAQ,OAAO,IAAI,CAAK,EACnC,GAAI,IAAO,IAAA,GAAW,MAAO,CAAE,GAAI,GAAM,IAAG,EAC5C,IAAM,EAAW,EAAQ,WAAW,IAAI,CAAK,EAI7C,OAHI,IAAa,IAAA,GAGV,CACL,GAAI,GACJ,QAAS,GAAG,EAAM,iBAAiB,EAAM,gEAC3C,EALS,CAAE,GAAI,GAAO,QAAS,GAAG,EAAM,SAAS,EAAM,mBAAmB,EAAS,gBAAiB,CAMtG,CAIA,SAAS,EAAK,EAA6B,CACzC,MAAO,CAAE,GAAI,GAAO,SAAQ,CAC9B,CAGA,SAAS,EAAW,EAAwB,EAA4C,CACtF,GAAI,EAAK,MAAQ,IAAA,GAAW,CAC1B,GAAI,EAAK,KAAO,IAAA,GAAW,MAAO,uEAClC,GAAI,CAAC,EAAY,KAAK,EAAK,GAAG,EAC5B,MAAO,QAAQ,EAAK,IAAI,uFAG1B,GADc,EAAQ,OAAO,IAAI,EAAK,GAAG,IAAM,IAAA,IAAa,EAAQ,WAAW,IAAI,EAAK,GAAG,EAChF,MAAO,kBAAkB,EAAK,IAAI,+CAC/C,CAEF,CAEA,SAAS,EAAgB,EAAwB,EAAwB,EAAe,EAAyB,CAC/G,GAAI,EAAK,UAAY,IAAA,GAAW,OAAO,EAAK,8CAA8C,EAC1F,GAAI,CAAC,EAAK,QAAQ,KAAK,EAAG,OAAO,EAAK,2BAA2B,EACjE,GAAI,EAAK,eAAiB,IAAA,IAAa,EAAK,kBAAoB,IAAA,GAC9D,OAAO,EAAK,4FAA4F,EAI1G,GAAI,EAAK,SAAA,UACP,OAAO,EAAK,6EAA6E,EAI3F,GADkB,EAAQ,MAAM,OAAQ,GAAS,EAAK,SAAA,SAAyB,CAAC,CAAC,QAChE,EAAQ,SACvB,OAAO,EAAK,iBAAiB,EAAQ,SAAS,iEAAiE,EAGjH,IAAM,EAAsB,CAAC,EAC7B,IAAK,IAAM,KAAS,EAAK,WAAa,CAAC,EAAG,CACxC,IAAM,EAAW,EAAW,EAAS,YAAa,CAAK,EACvD,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAC9C,IAAM,EAAM,EAAQ,MAAM,KAAM,GAAS,EAAK,KAAO,EAAS,EAAE,EAChE,GAAI,CAAC,EAAK,OAAO,EAAK,eAAe,EAAS,GAAG,WAAW,EAC5D,GAAI,EAAI,SAAA,UAA2B,OAAO,EAAK,eAAe,EAAS,GAAG,YAAY,EACjF,EAAU,SAAS,EAAS,EAAE,GAAG,EAAU,KAAK,EAAS,EAAE,CAClE,CAIA,IAAM,EAAgB,CACpB,GAAI,EAAQ,OACZ,QAAS,EAAK,QACd,OAAQ,EAAK,QAAU,UACvB,UAAW,EACX,UAAW,CACb,EAQA,OAPA,EAAc,EAAS,CAAI,EACvB,EAAU,SAAQ,EAAQ,UAAY,GAE1C,EAAQ,QAAU,EAClB,EAAQ,MAAM,KAAK,CAAO,EACtB,EAAK,KAAK,EAAQ,OAAO,IAAI,EAAK,IAAK,EAAQ,EAAE,EAE9C,CACL,GAAI,GACJ,QAAS,CACP,QACA,KAAM,UACN,GAAI,EAAQ,GACZ,QAAS,EAAQ,QACjB,OAAQ,EAAQ,OAChB,GAAI,EAAK,IAAM,CAAE,IAAK,EAAK,GAAI,EAAI,CAAC,EACpC,GAAI,EAAU,OAAS,CAAE,WAAU,EAAI,CAAC,CAC1C,CACF,CACF,CAEA,SAAS,EAAgB,EAAwB,EAAwB,EAAe,EAAyB,CAC/G,IAAM,EAAK,EAAK,GACV,EAAK,EAAQ,MAAM,UAAW,GAAS,EAAK,KAAO,CAAE,EAC3D,GAAI,IAAO,GAAI,OAAO,EAAK,IAAI,EAAG,WAAW,EAC7C,GAAI,EAAK,YAAc,IAAA,GACrB,OAAO,EAAK,kGAAkG,EAYhH,GAAI,EARF,EAAK,UAAY,IAAA,IACjB,EAAK,cAAgB,IAAA,IACrB,EAAK,aAAe,IAAA,IACpB,EAAK,SAAW,IAAA,IAChB,EAAK,QAAU,IAAA,IACf,EAAK,WAAa,IAAA,IACV,EAAK,cAAc,QACnB,EAAK,iBAAiB,QAE9B,OAAO,EACL,wIACF,EAGF,IAAM,EAAU,EAAQ,MAAM,GAK9B,GAAI,EAAK,UAAY,IAAA,IAAa,CAAC,EAAK,QAAQ,KAAK,EAAG,OAAO,EAAK,2BAA2B,EAE/F,IAAI,EAAY,EAAQ,OACxB,GAAI,EAAK,SAAW,IAAA,GAAW,CAC7B,GAAI,CAAC,EAAkB,EAAQ,OAAQ,EAAK,MAAM,EAChD,OAAO,EAAK,sBAAsB,EAAQ,OAAO,MAAM,EAAK,QAAQ,EAEtE,EAAY,EAAK,MACnB,CAEA,IAAI,EAAe,EAAQ,UAAY,CAAC,GAAG,EAAQ,SAAS,EAAI,CAAC,EACjE,IAAK,IAAM,KAAS,EAAK,iBAAmB,CAAC,EAAG,CAC9C,IAAM,EAAW,EAAW,EAAS,kBAAmB,CAAK,EAC7D,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAG9C,EAAe,EAAa,OAAQ,GAAQ,IAAQ,EAAS,EAAE,CACjE,CACA,IAAK,IAAM,KAAS,EAAK,cAAgB,CAAC,EAAG,CAC3C,IAAM,EAAW,EAAW,EAAS,eAAgB,CAAK,EAC1D,GAAI,CAAC,EAAS,GAAI,OAAO,EAAK,EAAS,OAAO,EAC9C,GAAI,EAAS,KAAO,EAAI,OAAO,EAAK,iBAAiB,EAAG,WAAW,EACnE,IAAM,EAAM,EAAQ,MAAM,KAAM,GAAS,EAAK,KAAO,EAAS,EAAE,EAChE,GAAI,CAAC,EAAK,OAAO,EAAK,kBAAkB,EAAS,GAAG,WAAW,EAC/D,GAAI,EAAI,SAAA,UAA2B,OAAO,EAAK,kBAAkB,EAAS,GAAG,YAAY,EACpF,EAAa,SAAS,EAAS,EAAE,GAAG,EAAa,KAAK,EAAS,EAAE,CACxE,CAEA,IAAM,EAAgB,CAAE,GAAG,EAAS,OAAQ,CAAU,EACtD,EAAc,EAAS,CAAI,EACvB,EAAa,OAAQ,EAAQ,UAAY,EACxC,OAAO,EAAQ,UAMpB,IAAM,EAAY,CAAC,GAAG,EAAQ,KAAK,EAEnC,GADA,EAAU,GAAM,EACZ,EAAK,cAAc,QAAU,EAAY,EAAW,EAAI,CAAY,EACtE,OAAO,EAAK,0DAA0D,EAGxE,IAAM,EAAU,EAAY,EAAS,CAAO,EAI5C,OAHI,IAAS,EAAQ,UAAY,GACjC,EAAQ,MAAQ,EAET,CACL,GAAI,GACJ,QAAS,EACL,CAAE,QAAO,KAAM,UAAW,KAAI,WAAY,EAAQ,OAAQ,SAAU,CAAU,EAC9E,CAAE,QAAO,KAAM,YAAa,KAAI,OAAQ,CAAU,CACxD,CACF,CASA,SAAS,EAAY,EAAwB,EAA2B,EAAa,EAA+B,CAClH,IAAM,EAAyB,CAC7B,MAAO,CAAC,GAAG,EAAS,KAAK,EACzB,OAAQ,EAAS,OACjB,WACA,OAAQ,IAAI,IACZ,WAAY,IAAI,GAClB,EACM,EAAgC,CAAC,EACnC,EAAU,EAEd,IAAK,GAAM,CAAC,EAAO,KAAS,EAAM,QAAQ,EAAG,CAC3C,IAAM,EAAa,EAAW,EAAS,CAAI,EACrC,EAAS,EACX,EAAK,CAAU,EACf,EAAK,KAAO,IAAA,GACV,EAAgB,EAAS,EAAM,EAAO,CAAG,EACzC,EAAgB,EAAS,EAAM,EAAO,CAAG,EAE/C,GAAI,EAAO,GAAI,CACb,EAAS,KAAK,EAAO,OAAO,EAC5B,GAAW,EACX,QACF,CAGI,EAAK,KAAO,EAAY,KAAK,EAAK,GAAG,GAAK,CAAC,EAAQ,OAAO,IAAI,EAAK,GAAG,GACxE,EAAQ,WAAW,IAAI,EAAK,IAAK,CAAK,EAExC,EAAS,KAAK,CACZ,QACA,KAAM,SACN,QAAS,EAAO,QAChB,GAAI,EAAK,KAAO,IAAA,GAAY,CAAC,EAAI,CAAE,GAAI,EAAK,EAAG,EAC/C,GAAI,EAAK,IAAM,CAAE,IAAK,EAAK,GAAI,EAAI,CAAC,CACtC,CAAC,CACH,CAEA,MAAO,CAGL,SAAU,EAAU,EAAI,EAAU,EAAU,EAAQ,MAAO,EAAQ,MAAM,EAAI,EAC7E,GAAI,CAAE,KAAM,SAAU,MAAO,EAAU,UAAS,OAAQ,EAAS,OAAS,CAAQ,CACpF,CACF,CASA,SAAgB,EACd,EACA,EACA,EACA,EAAc,IAAI,KAAK,CAAA,CAAE,YAAY,EACrC,EAAW,GACE,CACb,OAAQ,EAAR,CACE,IAAK,SAAU,CACb,IAAM,EAAQ,EAAO,MAarB,MAZI,CAAC,MAAM,QAAQ,CAAK,GAAK,EAAM,SAAW,EACrC,EACL,EACA,uGACF,EAEE,EAAM,OAAA,IACD,EACL,EACA,yDAAyE,EAAM,OAAO,EACxF,EAEK,EAAY,EAAU,EAAO,EAAK,CAAQ,CACnD,CAEA,IAAK,OACH,MAAO,CACL,WACA,GAAI,CACF,KAAM,OACN,eAAgB,EAAO,iBAAmB,GAC1C,GAAI,EAAO,SAAW,IAAA,GAA8C,CAAC,EAAnC,CAAE,aAAc,EAAO,MAAO,CAClE,CACF,EAGF,IAAK,MAAO,CACV,GAAI,EAAO,KAAO,IAAA,GAAW,OAAO,EAAY,EAAU,qBAAqB,EAC/E,IAAM,EAAO,EAAS,MAAM,KAAM,GAAc,EAAU,KAAO,EAAO,EAAE,EAE1E,OADK,EACE,CAAE,WAAU,GAAI,CAAE,KAAM,MAAO,MAAK,CAAE,EAD3B,EAAY,EAAU,IAAI,EAAO,GAAG,WAAW,CAEnE,CAEA,IAAK,SAAU,CACb,GAAI,EAAO,KAAO,IAAA,GAAW,OAAO,EAAY,EAAU,wBAAwB,EAClF,IAAM,EAAQ,EAAS,MAAM,UAAW,GAAS,EAAK,KAAO,EAAO,EAAE,EACtE,GAAI,IAAU,GAAI,OAAO,EAAY,EAAU,IAAI,EAAO,GAAG,WAAW,EACxE,IAAM,EAAU,EAAS,MAAM,GAC/B,GAAI,EAAQ,SAAA,UAA2B,OAAO,EAAY,EAAU,IAAI,EAAQ,GAAG,oBAAoB,EACvG,GAAI,EAAmB,CAAO,EAC5B,OAAO,EAAY,EAAU,IAAI,EAAQ,GAAG,sDAAsD,EAGpG,IAAM,EAAQ,CAAC,GAAG,EAAS,KAAK,EAEhC,MADA,GAAM,GAAS,CAAE,GAAG,EAAS,OAAQ,EAAgB,UAAW,CAAI,EAC7D,CACL,SAAU,EAAU,EAAU,CAAK,EACnC,GAAI,CAAE,KAAM,SAAU,GAAI,EAAQ,GAAI,QAAS,EAAQ,OAAQ,CACjE,CACF,CAEA,IAAK,QAAS,CACZ,IAAM,EAAS,EAAS,MAAM,OAAO,CAAkB,EACvD,GAAI,EAAO,OAAS,EAElB,OAAO,EAAY,EAAU,+CADjB,EAAO,IAAK,GAAS,IAAI,EAAK,IAAI,CAAC,CAAC,KAAK,IACyB,EAAE,sBAAsB,EAExG,IAAM,EAAQ,EAAS,MAAM,OAC7B,MAAO,CACL,SAAU,EAAU,EAAU,CAAC,EAAG,CAAC,EACnC,GAAI,CAAE,KAAM,QAAS,OAAM,CAC7B,CACF,CACF,CACF"}

package/dist/services/taskNarration/index.cjs

@@ -0,0 +1,2 @@
+const e=`completed`,t=`cancelled`;function n(e){return e.tasks.filter(e=>e.status!==`deleted`)}function r(e,t){return`${e} ${t.map(e=>`Task ${e.id}: ${e.subject}`).join(`. `)}.`}function i(i,a,o){let s=new Map(a.tasks.map(e=>[e.id,e])),c=n(o).filter(e=>!s.has(e.id));if(c.length>0){let e=n(a).length===0?`Task list created.`:`Task list updated.`;i.narrate(r(e,c))}for(let n of o.tasks){let r=s.get(n.id);r&&(r.status!==e&&n.status===e&&i.narrate(`Task completed: ${n.subject}.`),r.delegation?.state!==t&&n.delegation?.state===t&&i.narrate(`Task cancelled: ${n.subject}.`))}}exports.narrateTaskCommit=i;
+//# sourceMappingURL=index.cjs.map

package/dist/services/taskNarration/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":[],"sources":["../../../src/services/taskNarration/index.ts"],"sourcesContent":["import type { Task, TaskDocument } from '../../models/task';\n\n/** Package-local narration sink; the Pi adapter binds it to the injected Cordis service. */\nexport interface TaskNarrationSink {\n  narrate(text: string): void;\n}\n\nconst COMPLETED_STATUS = 'completed';\nconst CANCELLED_STATE = 'cancelled';\nconst DELETED_STATUS = 'deleted';\n\nfunction visibleTasks(document: TaskDocument): Task[] {\n  return document.tasks.filter((task) => task.status !== DELETED_STATUS);\n}\n\nfunction formatTasks(prefix: string, tasks: Task[]): string {\n  const entries = tasks.map((task) => `Task ${task.id}: ${task.subject}`);\n  return `${prefix} ${entries.join('. ')}.`;\n}\n\n/**\n * Translate committed task-domain transitions into generic speech requests.\n * Voice remains unaware of tasks; this service owns all task-specific wording.\n */\nexport function narrateTaskCommit(requester: TaskNarrationSink, previous: TaskDocument, committed: TaskDocument): void {\n  const previousById = new Map(previous.tasks.map((task) => [task.id, task]));\n  const created = visibleTasks(committed).filter((task) => !previousById.has(task.id));\n  if (created.length > 0) {\n    const prefix = visibleTasks(previous).length === 0 ? 'Task list created.' : 'Task list updated.';\n    requester.narrate(formatTasks(prefix, created));\n  }\n\n  for (const task of committed.tasks) {\n    const prior = previousById.get(task.id);\n    if (!prior) continue;\n    if (prior.status !== COMPLETED_STATUS && task.status === COMPLETED_STATUS) {\n      requester.narrate(`Task completed: ${task.subject}.`);\n    }\n    if (prior.delegation?.state !== CANCELLED_STATE && task.delegation?.state === CANCELLED_STATE) {\n      requester.narrate(`Task cancelled: ${task.subject}.`);\n    }\n  }\n}\n"],"mappings":"AAOA,MAAM,EAAmB,YACnB,EAAkB,YAGxB,SAAS,EAAa,EAAgC,CACpD,OAAO,EAAS,MAAM,OAAQ,GAAS,EAAK,SAAW,SAAc,CACvE,CAEA,SAAS,EAAY,EAAgB,EAAuB,CAE1D,MAAO,GAAG,EAAO,GADD,EAAM,IAAK,GAAS,QAAQ,EAAK,GAAG,IAAI,EAAK,SACnC,CAAC,CAAC,KAAK,IAAI,EAAE,EACzC,CAMA,SAAgB,EAAkB,EAA8B,EAAwB,EAA+B,CACrH,IAAM,EAAe,IAAI,IAAI,EAAS,MAAM,IAAK,GAAS,CAAC,EAAK,GAAI,CAAI,CAAC,CAAC,EACpE,EAAU,EAAa,CAAS,CAAC,CAAC,OAAQ,GAAS,CAAC,EAAa,IAAI,EAAK,EAAE,CAAC,EACnF,GAAI,EAAQ,OAAS,EAAG,CACtB,IAAM,EAAS,EAAa,CAAQ,CAAC,CAAC,SAAW,EAAI,qBAAuB,qBAC5E,EAAU,QAAQ,EAAY,EAAQ,CAAO,CAAC,CAChD,CAEA,IAAK,IAAM,KAAQ,EAAU,MAAO,CAClC,IAAM,EAAQ,EAAa,IAAI,EAAK,EAAE,EACjC,IACD,EAAM,SAAW,GAAoB,EAAK,SAAW,GACvD,EAAU,QAAQ,mBAAmB,EAAK,QAAQ,EAAE,EAElD,EAAM,YAAY,QAAU,GAAmB,EAAK,YAAY,QAAU,GAC5E,EAAU,QAAQ,mBAAmB,EAAK,QAAQ,EAAE,EAExD,CACF"}

package/dist/services/taskNarration/index.mjs

@@ -0,0 +1,2 @@
+const e=`completed`,t=`cancelled`;function n(e){return e.tasks.filter(e=>e.status!==`deleted`)}function r(e,t){return`${e} ${t.map(e=>`Task ${e.id}: ${e.subject}`).join(`. `)}.`}function i(i,a,o){let s=new Map(a.tasks.map(e=>[e.id,e])),c=n(o).filter(e=>!s.has(e.id));if(c.length>0){let e=n(a).length===0?`Task list created.`:`Task list updated.`;i.narrate(r(e,c))}for(let n of o.tasks){let r=s.get(n.id);r&&(r.status!==e&&n.status===e&&i.narrate(`Task completed: ${n.subject}.`),r.delegation?.state!==t&&n.delegation?.state===t&&i.narrate(`Task cancelled: ${n.subject}.`))}}export{i as narrateTaskCommit};
+//# sourceMappingURL=index.mjs.map

package/dist/services/taskNarration/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../src/services/taskNarration/index.ts"],"sourcesContent":["import type { Task, TaskDocument } from '../../models/task';\n\n/** Package-local narration sink; the Pi adapter binds it to the injected Cordis service. */\nexport interface TaskNarrationSink {\n  narrate(text: string): void;\n}\n\nconst COMPLETED_STATUS = 'completed';\nconst CANCELLED_STATE = 'cancelled';\nconst DELETED_STATUS = 'deleted';\n\nfunction visibleTasks(document: TaskDocument): Task[] {\n  return document.tasks.filter((task) => task.status !== DELETED_STATUS);\n}\n\nfunction formatTasks(prefix: string, tasks: Task[]): string {\n  const entries = tasks.map((task) => `Task ${task.id}: ${task.subject}`);\n  return `${prefix} ${entries.join('. ')}.`;\n}\n\n/**\n * Translate committed task-domain transitions into generic speech requests.\n * Voice remains unaware of tasks; this service owns all task-specific wording.\n */\nexport function narrateTaskCommit(requester: TaskNarrationSink, previous: TaskDocument, committed: TaskDocument): void {\n  const previousById = new Map(previous.tasks.map((task) => [task.id, task]));\n  const created = visibleTasks(committed).filter((task) => !previousById.has(task.id));\n  if (created.length > 0) {\n    const prefix = visibleTasks(previous).length === 0 ? 'Task list created.' : 'Task list updated.';\n    requester.narrate(formatTasks(prefix, created));\n  }\n\n  for (const task of committed.tasks) {\n    const prior = previousById.get(task.id);\n    if (!prior) continue;\n    if (prior.status !== COMPLETED_STATUS && task.status === COMPLETED_STATUS) {\n      requester.narrate(`Task completed: ${task.subject}.`);\n    }\n    if (prior.delegation?.state !== CANCELLED_STATE && task.delegation?.state === CANCELLED_STATE) {\n      requester.narrate(`Task cancelled: ${task.subject}.`);\n    }\n  }\n}\n"],"mappings":"AAOA,MAAM,EAAmB,YACnB,EAAkB,YAGxB,SAAS,EAAa,EAAgC,CACpD,OAAO,EAAS,MAAM,OAAQ,GAAS,EAAK,SAAW,SAAc,CACvE,CAEA,SAAS,EAAY,EAAgB,EAAuB,CAE1D,MAAO,GAAG,EAAO,GADD,EAAM,IAAK,GAAS,QAAQ,EAAK,GAAG,IAAI,EAAK,SACnC,CAAC,CAAC,KAAK,IAAI,EAAE,EACzC,CAMA,SAAgB,EAAkB,EAA8B,EAAwB,EAA+B,CACrH,IAAM,EAAe,IAAI,IAAI,EAAS,MAAM,IAAK,GAAS,CAAC,EAAK,GAAI,CAAI,CAAC,CAAC,EACpE,EAAU,EAAa,CAAS,CAAC,CAAC,OAAQ,GAAS,CAAC,EAAa,IAAI,EAAK,EAAE,CAAC,EACnF,GAAI,EAAQ,OAAS,EAAG,CACtB,IAAM,EAAS,EAAa,CAAQ,CAAC,CAAC,SAAW,EAAI,qBAAuB,qBAC5E,EAAU,QAAQ,EAAY,EAAQ,CAAO,CAAC,CAChD,CAEA,IAAK,IAAM,KAAQ,EAAU,MAAO,CAClC,IAAM,EAAQ,EAAa,IAAI,EAAK,EAAE,EACjC,IACD,EAAM,SAAW,GAAoB,EAAK,SAAW,GACvD,EAAU,QAAQ,mBAAmB,EAAK,QAAQ,EAAE,EAElD,EAAM,YAAY,QAAU,GAAmB,EAAK,YAAY,QAAU,GAC5E,EAAU,QAAQ,mBAAmB,EAAK,QAAQ,EAAE,EAExD,CACF"}

package/dist/services/taskResult/index.cjs

@@ -0,0 +1,7 @@
+const e=require("../../models/taskGraph.cjs"),t=`All tasks are completed. Review the full task list once more, then close it with task {"action":"clear"}.`,n=`The applied entries are committed. Resend only the failed entries, corrected — a failed entry changed nothing, so a corrected retry is safe. Do not resend an entry that already applied: an entry without an id creates a second task.`,r=`No task changed, so the whole call can be resent once corrected.`,i=`Successful assignments are already running. Retry only the failed entries after correcting their task state or arguments; do not resend successful entries.`;function a(e){if(e.length===1)return e[0].message;let t=e.filter(e=>e.ok).length,n=e.length-t,r=[`Assigned ${t}/${e.length} tasks${n>0?`; ${n} failed`:``}.`,...e.map(e=>e.ok?`- [${e.index}] Delegated #${e.id} to ${e.agent}`:`- [${e.index}] Failed #${e.id} → ${e.agent}: ${e.message}`)];return n>0&&t>0&&r.push(``,i),n===0&&r.push(``,`All assignments are running independently in the background. Continue non-overlapping work, or end your turn.`),r.join(`
+`)}function o(e){let t=e.blockedBy?.length?` ⛓ ${e.blockedBy.map(e=>`#${e}`).join(`,`)}`:``,n=e.status===`in_progress`&&e.activeForm?` (${e.activeForm})`:``,r=e.delegation&&e.delegation.state!==`cancelled`?` [${e.delegation.agent}]`:``;return`[${e.status}] #${e.id} ${e.subject}${n}${r}${t}`}function s(e){let t=e.delegation;if(!t)return[];let n=[`  delegated to: ${t.agent} (${t.state})`];return t.model&&n.push(`  model: ${t.model}`),t.result?.error&&n.push(`  error: ${t.result.error}`),t.result?.outputPath&&n.push(`  output file: ${t.result.outputPath}`),t.result?.output&&n.push(`  output: ${t.result.output}`),n}function c(t,n){let r=e.deriveBlocks(n.tasks).get(t.id)??[],i=[`#${t.id} [${t.status}] ${t.subject}`];return t.description&&i.push(`  description: ${t.description}`),t.activeForm&&i.push(`  activeForm: ${t.activeForm}`),t.blockedBy?.length&&i.push(`  blockedBy: ${t.blockedBy.map(e=>`#${e}`).join(`, `)}`),r.length&&i.push(`  blocks: ${r.map(e=>`#${e}`).join(`, `)}`),t.owner&&i.push(`  owner: ${t.owner}`),i.push(...s(t)),i.join(`
+`)}function l(e){switch(e.kind){case`created`:{let t=e.ref?` (ref "${e.ref}")`:``,n=e.blockedBy?.length?` — blocked by ${e.blockedBy.map(e=>`#${e}`).join(`, `)}`:``;return`Created #${e.id}${t}: ${e.subject} (${e.status})${n}`}case`updated`:{let t=e.fromStatus===e.toStatus?``:` (${e.fromStatus} -> ${e.toStatus})`;return`Updated #${e.id}${t}`}case`unchanged`:return`No change: #${e.id} already matches the requested values (status: ${e.status})`;case`failed`:return`Failed${e.id===void 0?``:` #${e.id}`}: ${e.message}`}}function u(e){return e.items.length===1?e.items[0].kind===`failed`?e.items[0].message:`no entry was applied`:[`no entry was applied.`,...e.items.map(e=>`- [${e.index}] ${l(e)}`),r].join(`
+`)}function d(r,i){switch(r.kind){case`upsert`:{let a=r.items.length===1?[l(r.items[0])]:[`Upsert applied ${r.applied}/${r.items.length} entries${r.failed>0?`; ${r.failed} failed`:``}.`,...r.items.map(e=>`- [${e.index}] ${l(e)}`),...r.failed>0?[``,n]:[]];return r.applied>0&&e.isTaskListComplete(i.tasks)&&a.push(t),a.join(`
+`)}case`delete`:return`Deleted #${r.id}: ${r.subject}`;case`clear`:return`Closed task list (cleared ${r.count} tasks)`;case`list`:{let e=i.tasks;return r.includeDeleted||(e=e.filter(e=>e.status!==`deleted`)),r.statusFilter&&(e=e.filter(e=>e.status===r.statusFilter)),e.length===0?`No tasks`:e.map(o).join(`
+`)}case`get`:return c(r.task,i);case`error`:return`Error: ${r.message}`}}function f(e,t,n,r){return{content:[{type:`text`,text:d(r,n)}],details:{action:e,params:t,tasks:n.tasks,nextId:n.nextId,rev:n.rev,...r.kind===`error`?{error:r.message}:{},...r.kind===`upsert`?{upsert:{applied:r.items.flatMap(e=>e.kind===`failed`?[]:[e.id]),failed:r.failed}}:{}}}}function p(e,t,n,r){return{content:[{type:`text`,text:n}],details:{action:`assign`,params:e,tasks:t.tasks,nextId:t.nextId,rev:t.rev,assignment:r}}}function m(e,t,n,r,i){return{content:[{type:`text`,text:i?`Error: ${i}`:r}],details:{action:e,params:t,tasks:n.tasks,nextId:n.nextId,rev:n.rev,...i?{error:i}:{}}}}exports.MSG_ALL_COMPLETE_CLEAR=t,exports.MSG_ASSIGN_PARTIAL=i,exports.MSG_UPSERT_NONE_APPLIED=r,exports.MSG_UPSERT_PARTIAL=n,exports.buildAssignmentResult=p,exports.buildTextResult=m,exports.buildToolResult=f,exports.formatAssignmentResults=a,exports.formatContent=d,exports.formatUpsertFailureText=u;
+//# sourceMappingURL=index.cjs.map

package/dist/services/taskResult/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","names":["deriveBlocks","isTaskListComplete"],"sources":["../../../src/services/taskResult/index.ts"],"sourcesContent":["import type {\n  AssignmentSummary,\n  Task,\n  TaskAction,\n  TaskDetails,\n  TaskDocument,\n  TaskMutationParams,\n  UpsertItemOutcome,\n} from '../../models/task';\nimport { deriveBlocks, isTaskListComplete } from '../../models/taskGraph';\nimport type { Op } from '../reducer';\n\nexport const MSG_ALL_COMPLETE_CLEAR =\n  'All tasks are completed. Review the full task list once more, then close it with task {\"action\":\"clear\"}.';\n\n/**\n * Steering for a mixed batch. Unlike a batch of spawned subagents, a failed\n * entry here had no side effect at all, so retrying the failures is the safe\n * move and the model must be told so or it will do nothing. The hazard is the\n * other half: resending an applied create would make a second task.\n */\nexport const MSG_UPSERT_PARTIAL =\n  'The applied entries are committed. Resend only the failed entries, corrected — a failed entry changed nothing, so a corrected retry is safe. Do not resend an entry that already applied: an entry without an id creates a second task.';\n\nexport const MSG_UPSERT_NONE_APPLIED = 'No task changed, so the whole call can be resent once corrected.';\n\nexport const MSG_ASSIGN_PARTIAL =\n  'Successful assignments are already running. Retry only the failed entries after correcting their task state or arguments; do not resend successful entries.';\n\nexport interface AssignmentItemResult {\n  index: number;\n  id: number;\n  agent: string;\n  ok: boolean;\n  message: string;\n}\n\n/** LLM-facing report for a native assignment batch. */\nexport function formatAssignmentResults(items: readonly AssignmentItemResult[]): string {\n  if (items.length === 1) return items[0].message;\n\n  const succeeded = items.filter((item) => item.ok).length;\n  const failed = items.length - succeeded;\n  const lines = [\n    `Assigned ${succeeded}/${items.length} tasks${failed > 0 ? `; ${failed} failed` : ''}.`,\n    ...items.map((item) =>\n      item.ok\n        ? `- [${item.index}] Delegated #${item.id} to ${item.agent}`\n        : `- [${item.index}] Failed #${item.id} → ${item.agent}: ${item.message}`,\n    ),\n  ];\n\n  if (failed > 0 && succeeded > 0) lines.push('', MSG_ASSIGN_PARTIAL);\n  if (failed === 0) {\n    lines.push(\n      '',\n      'All assignments are running independently in the background. Continue non-overlapping work, or end your turn.',\n    );\n  }\n  return lines.join('\\n');\n}\n\n/** `[status] #id subject (activeForm) [agent] ⛓ #dep` — the `list` line format. */\nfunction formatListLine(task: Task): string {\n  const block = task.blockedBy?.length ? ` ⛓ ${task.blockedBy.map((id) => `#${id}`).join(',')}` : '';\n  const form = task.status === 'in_progress' && task.activeForm ? ` (${task.activeForm})` : '';\n  const delegated = task.delegation && task.delegation.state !== 'cancelled' ? ` [${task.delegation.agent}]` : '';\n  return `[${task.status}] #${task.id} ${task.subject}${form}${delegated}${block}`;\n}\n\nfunction formatDelegationLines(task: Task): string[] {\n  const delegation = task.delegation;\n  if (!delegation) return [];\n\n  const lines = [`  delegated to: ${delegation.agent} (${delegation.state})`];\n  if (delegation.model) lines.push(`  model: ${delegation.model}`);\n  if (delegation.result?.error) lines.push(`  error: ${delegation.result.error}`);\n  if (delegation.result?.outputPath) lines.push(`  output file: ${delegation.result.outputPath}`);\n  if (delegation.result?.output) lines.push(`  output: ${delegation.result.output}`);\n  return lines;\n}\n\nfunction formatGetLines(task: Task, document: TaskDocument): string {\n  const blocks = deriveBlocks(document.tasks).get(task.id) ?? [];\n  const lines = [`#${task.id} [${task.status}] ${task.subject}`];\n  if (task.description) lines.push(`  description: ${task.description}`);\n  if (task.activeForm) lines.push(`  activeForm: ${task.activeForm}`);\n  if (task.blockedBy?.length) lines.push(`  blockedBy: ${task.blockedBy.map((id) => `#${id}`).join(', ')}`);\n  if (blocks.length) lines.push(`  blocks: ${blocks.map((id) => `#${id}`).join(', ')}`);\n  if (task.owner) lines.push(`  owner: ${task.owner}`);\n  lines.push(...formatDelegationLines(task));\n  return lines.join('\\n');\n}\n\n/** One entry's outcome. Batch lines prefix this with `- [n] `. */\nfunction formatUpsertItem(item: UpsertItemOutcome): string {\n  switch (item.kind) {\n    case 'created': {\n      const ref = item.ref ? ` (ref \"${item.ref}\")` : '';\n      const deps = item.blockedBy?.length ? ` — blocked by ${item.blockedBy.map((id) => `#${id}`).join(', ')}` : '';\n      return `Created #${item.id}${ref}: ${item.subject} (${item.status})${deps}`;\n    }\n    case 'updated': {\n      const transition = item.fromStatus === item.toStatus ? '' : ` (${item.fromStatus} -> ${item.toStatus})`;\n      return `Updated #${item.id}${transition}`;\n    }\n    case 'unchanged':\n      return `No change: #${item.id} already matches the requested values (status: ${item.status})`;\n    case 'failed':\n      return `Failed${item.id === undefined ? '' : ` #${item.id}`}: ${item.message}`;\n  }\n}\n\n/**\n * The thrown message when an upsert applied nothing. Kept separate from\n * `formatContent` because the caller wraps it in the actionable Options block\n * rather than returning it as a successful result.\n */\nexport function formatUpsertFailureText(op: Extract<Op, { kind: 'upsert' }>): string {\n  if (op.items.length === 1) return op.items[0].kind === 'failed' ? op.items[0].message : 'no entry was applied';\n  return [\n    'no entry was applied.',\n    ...op.items.map((item) => `- [${item.index}] ${formatUpsertItem(item)}`),\n    MSG_UPSERT_NONE_APPLIED,\n  ].join('\\n');\n}\n\n/**\n * Pure formatter: `(op, document) -> string`. The switch is closed over `Op`,\n * so a new reducer variant fails to compile until it is handled here.\n */\nexport function formatContent(op: Op, document: TaskDocument): string {\n  switch (op.kind) {\n    case 'upsert': {\n      // A batch of one is the common case and must not read like a bulk\n      // report, so it keeps the exact single-line shape it has always had.\n      const lines =\n        op.items.length === 1\n          ? [formatUpsertItem(op.items[0])]\n          : [\n              `Upsert applied ${op.applied}/${op.items.length} entries${op.failed > 0 ? `; ${op.failed} failed` : ''}.`,\n              ...op.items.map((item) => `- [${item.index}] ${formatUpsertItem(item)}`),\n              ...(op.failed > 0 ? ['', MSG_UPSERT_PARTIAL] : []),\n            ];\n      // Once, last, and only when something landed: emitting it per entry\n      // would repeat it for every completion in a batch.\n      if (op.applied > 0 && isTaskListComplete(document.tasks)) lines.push(MSG_ALL_COMPLETE_CLEAR);\n      return lines.join('\\n');\n    }\n    case 'delete':\n      return `Deleted #${op.id}: ${op.subject}`;\n    case 'clear':\n      return `Closed task list (cleared ${op.count} tasks)`;\n    case 'list': {\n      let view = document.tasks;\n      if (!op.includeDeleted) view = view.filter((task) => task.status !== 'deleted');\n      if (op.statusFilter) view = view.filter((task) => task.status === op.statusFilter);\n      return view.length === 0 ? 'No tasks' : view.map(formatListLine).join('\\n');\n    }\n    case 'get':\n      return formatGetLines(op.task, document);\n    case 'error':\n      return `Error: ${op.message}`;\n  }\n}\n\nexport interface ToolResult {\n  content: Array<{ type: 'text'; text: string }>;\n  details: TaskDetails;\n}\n\n/** Build the LLM-facing envelope. `details` carries the post-mutation snapshot. */\nexport function buildToolResult(\n  action: TaskAction,\n  params: TaskMutationParams,\n  document: TaskDocument,\n  op: Op,\n): ToolResult {\n  return {\n    content: [{ type: 'text', text: formatContent(op, document) }],\n    details: {\n      action,\n      params: params as Record<string, unknown>,\n      tasks: document.tasks,\n      nextId: document.nextId,\n      rev: document.rev,\n      ...(op.kind === 'error' ? { error: op.message } : {}),\n      // Deliberately no `error` on a partial success: renderResult treats\n      // `details.error` as total failure and would hide the rows for the\n      // entries that did land.\n      ...(op.kind === 'upsert'\n        ? {\n            upsert: {\n              applied: op.items.flatMap((item) => (item.kind === 'failed' ? [] : [item.id])),\n              failed: op.failed,\n            },\n          }\n        : {}),\n    },\n  };\n}\n\n/** Envelope for a native assignment batch, including ids used by the consolidated TUI result. */\nexport function buildAssignmentResult(\n  params: TaskMutationParams,\n  document: TaskDocument,\n  text: string,\n  assignment: AssignmentSummary,\n): ToolResult {\n  return {\n    content: [{ type: 'text', text }],\n    details: {\n      action: 'assign',\n      params: params as Record<string, unknown>,\n      tasks: document.tasks,\n      nextId: document.nextId,\n      rev: document.rev,\n      assignment,\n    },\n  };\n}\n\n/** Envelope for delegation actions, which do not flow through the reducer. */\nexport function buildTextResult(\n  action: TaskAction,\n  params: TaskMutationParams,\n  document: TaskDocument,\n  text: string,\n  error?: string,\n): ToolResult {\n  return {\n    content: [{ type: 'text', text: error ? `Error: ${error}` : text }],\n    details: {\n      action,\n      params: params as Record<string, unknown>,\n      tasks: document.tasks,\n      nextId: document.nextId,\n      rev: document.rev,\n      ...(error ? { error } : {}),\n    },\n  };\n}\n"],"mappings":"8CAYa,EACX,4GAQW,EACX,0OAEW,EAA0B,mEAE1B,EACX,8JAWF,SAAgB,EAAwB,EAAgD,CACtF,GAAI,EAAM,SAAW,EAAG,OAAO,EAAM,EAAE,CAAC,QAExC,IAAM,EAAY,EAAM,OAAQ,GAAS,EAAK,EAAE,CAAC,CAAC,OAC5C,EAAS,EAAM,OAAS,EACxB,EAAQ,CACZ,YAAY,EAAU,GAAG,EAAM,OAAO,QAAQ,EAAS,EAAI,KAAK,EAAO,SAAW,GAAG,GACrF,GAAG,EAAM,IAAK,GACZ,EAAK,GACD,MAAM,EAAK,MAAM,eAAe,EAAK,GAAG,MAAM,EAAK,QACnD,MAAM,EAAK,MAAM,YAAY,EAAK,GAAG,KAAK,EAAK,MAAM,IAAI,EAAK,SACpE,CACF,EASA,OAPI,EAAS,GAAK,EAAY,GAAG,EAAM,KAAK,GAAI,CAAkB,EAC9D,IAAW,GACb,EAAM,KACJ,GACA,+GACF,EAEK,EAAM,KAAK;CAAI,CACxB,CAGA,SAAS,EAAe,EAAoB,CAC1C,IAAM,EAAQ,EAAK,WAAW,OAAS,MAAM,EAAK,UAAU,IAAK,GAAO,IAAI,GAAI,CAAC,CAAC,KAAK,GAAG,IAAM,GAC1F,EAAO,EAAK,SAAW,eAAiB,EAAK,WAAa,KAAK,EAAK,WAAW,GAAK,GACpF,EAAY,EAAK,YAAc,EAAK,WAAW,QAAU,YAAc,KAAK,EAAK,WAAW,MAAM,GAAK,GAC7G,MAAO,IAAI,EAAK,OAAO,KAAK,EAAK,GAAG,GAAG,EAAK,UAAU,IAAO,IAAY,GAC3E,CAEA,SAAS,EAAsB,EAAsB,CACnD,IAAM,EAAa,EAAK,WACxB,GAAI,CAAC,EAAY,MAAO,CAAC,EAEzB,IAAM,EAAQ,CAAC,mBAAmB,EAAW,MAAM,IAAI,EAAW,MAAM,EAAE,EAK1E,OAJI,EAAW,OAAO,EAAM,KAAK,YAAY,EAAW,OAAO,EAC3D,EAAW,QAAQ,OAAO,EAAM,KAAK,YAAY,EAAW,OAAO,OAAO,EAC1E,EAAW,QAAQ,YAAY,EAAM,KAAK,kBAAkB,EAAW,OAAO,YAAY,EAC1F,EAAW,QAAQ,QAAQ,EAAM,KAAK,aAAa,EAAW,OAAO,QAAQ,EAC1E,CACT,CAEA,SAAS,EAAe,EAAY,EAAgC,CAClE,IAAM,EAASA,EAAAA,aAAa,EAAS,KAAK,CAAC,CAAC,IAAI,EAAK,EAAE,GAAK,CAAC,EACvD,EAAQ,CAAC,IAAI,EAAK,GAAG,IAAI,EAAK,OAAO,IAAI,EAAK,SAAS,EAO7D,OANI,EAAK,aAAa,EAAM,KAAK,kBAAkB,EAAK,aAAa,EACjE,EAAK,YAAY,EAAM,KAAK,iBAAiB,EAAK,YAAY,EAC9D,EAAK,WAAW,QAAQ,EAAM,KAAK,gBAAgB,EAAK,UAAU,IAAK,GAAO,IAAI,GAAI,CAAC,CAAC,KAAK,IAAI,GAAG,EACpG,EAAO,QAAQ,EAAM,KAAK,aAAa,EAAO,IAAK,GAAO,IAAI,GAAI,CAAC,CAAC,KAAK,IAAI,GAAG,EAChF,EAAK,OAAO,EAAM,KAAK,YAAY,EAAK,OAAO,EACnD,EAAM,KAAK,GAAG,EAAsB,CAAI,CAAC,EAClC,EAAM,KAAK;CAAI,CACxB,CAGA,SAAS,EAAiB,EAAiC,CACzD,OAAQ,EAAK,KAAb,CACE,IAAK,UAAW,CACd,IAAM,EAAM,EAAK,IAAM,UAAU,EAAK,IAAI,IAAM,GAC1C,EAAO,EAAK,WAAW,OAAS,iBAAiB,EAAK,UAAU,IAAK,GAAO,IAAI,GAAI,CAAC,CAAC,KAAK,IAAI,IAAM,GAC3G,MAAO,YAAY,EAAK,KAAK,EAAI,IAAI,EAAK,QAAQ,IAAI,EAAK,OAAO,GAAG,GACvE,CACA,IAAK,UAAW,CACd,IAAM,EAAa,EAAK,aAAe,EAAK,SAAW,GAAK,KAAK,EAAK,WAAW,MAAM,EAAK,SAAS,GACrG,MAAO,YAAY,EAAK,KAAK,GAC/B,CACA,IAAK,YACH,MAAO,eAAe,EAAK,GAAG,iDAAiD,EAAK,OAAO,GAC7F,IAAK,SACH,MAAO,SAAS,EAAK,KAAO,IAAA,GAAY,GAAK,KAAK,EAAK,KAAK,IAAI,EAAK,SACzE,CACF,CAOA,SAAgB,EAAwB,EAA6C,CAEnF,OADI,EAAG,MAAM,SAAW,EAAU,EAAG,MAAM,EAAE,CAAC,OAAS,SAAW,EAAG,MAAM,EAAE,CAAC,QAAU,uBACjF,CACL,wBACA,GAAG,EAAG,MAAM,IAAK,GAAS,MAAM,EAAK,MAAM,IAAI,EAAiB,CAAI,GAAG,EACvE,CACF,CAAC,CAAC,KAAK;CAAI,CACb,CAMA,SAAgB,EAAc,EAAQ,EAAgC,CACpE,OAAQ,EAAG,KAAX,CACE,IAAK,SAAU,CAGb,IAAM,EACJ,EAAG,MAAM,SAAW,EAChB,CAAC,EAAiB,EAAG,MAAM,EAAE,CAAC,EAC9B,CACE,kBAAkB,EAAG,QAAQ,GAAG,EAAG,MAAM,OAAO,UAAU,EAAG,OAAS,EAAI,KAAK,EAAG,OAAO,SAAW,GAAG,GACvG,GAAG,EAAG,MAAM,IAAK,GAAS,MAAM,EAAK,MAAM,IAAI,EAAiB,CAAI,GAAG,EACvE,GAAI,EAAG,OAAS,EAAI,CAAC,GAAI,CAAkB,EAAI,CAAC,CAClD,EAIN,OADI,EAAG,QAAU,GAAKC,EAAAA,mBAAmB,EAAS,KAAK,GAAG,EAAM,KAAK,CAAsB,EACpF,EAAM,KAAK;CAAI,CACxB,CACA,IAAK,SACH,MAAO,YAAY,EAAG,GAAG,IAAI,EAAG,UAClC,IAAK,QACH,MAAO,6BAA6B,EAAG,MAAM,SAC/C,IAAK,OAAQ,CACX,IAAI,EAAO,EAAS,MAGpB,OAFK,EAAG,iBAAgB,EAAO,EAAK,OAAQ,GAAS,EAAK,SAAW,SAAS,GAC1E,EAAG,eAAc,EAAO,EAAK,OAAQ,GAAS,EAAK,SAAW,EAAG,YAAY,GAC1E,EAAK,SAAW,EAAI,WAAa,EAAK,IAAI,CAAc,CAAC,CAAC,KAAK;CAAI,CAC5E,CACA,IAAK,MACH,OAAO,EAAe,EAAG,KAAM,CAAQ,EACzC,IAAK,QACH,MAAO,UAAU,EAAG,SACxB,CACF,CAQA,SAAgB,EACd,EACA,EACA,EACA,EACY,CACZ,MAAO,CACL,QAAS,CAAC,CAAE,KAAM,OAAQ,KAAM,EAAc,EAAI,CAAQ,CAAE,CAAC,EAC7D,QAAS,CACP,SACQ,SACR,MAAO,EAAS,MAChB,OAAQ,EAAS,OACjB,IAAK,EAAS,IACd,GAAI,EAAG,OAAS,QAAU,CAAE,MAAO,EAAG,OAAQ,EAAI,CAAC,EAInD,GAAI,EAAG,OAAS,SACZ,CACE,OAAQ,CACN,QAAS,EAAG,MAAM,QAAS,GAAU,EAAK,OAAS,SAAW,CAAC,EAAI,CAAC,EAAK,EAAE,CAAE,EAC7E,OAAQ,EAAG,MACb,CACF,EACA,CAAC,CACP,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EACA,EACY,CACZ,MAAO,CACL,QAAS,CAAC,CAAE,KAAM,OAAQ,MAAK,CAAC,EAChC,QAAS,CACP,OAAQ,SACA,SACR,MAAO,EAAS,MAChB,OAAQ,EAAS,OACjB,IAAK,EAAS,IACd,YACF,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EACA,EACA,EACY,CACZ,MAAO,CACL,QAAS,CAAC,CAAE,KAAM,OAAQ,KAAM,EAAQ,UAAU,IAAU,CAAK,CAAC,EAClE,QAAS,CACP,SACQ,SACR,MAAO,EAAS,MAChB,OAAQ,EAAS,OACjB,IAAK,EAAS,IACd,GAAI,EAAQ,CAAE,OAAM,EAAI,CAAC,CAC3B,CACF,CACF"}

package/dist/services/taskResult/index.d.cts

@@ -0,0 +1,50 @@
+import { AssignmentSummary, TaskAction, TaskDetails, TaskDocument, TaskMutationParams } from "../../models/task.cjs";
+import { Op } from "../reducer/index.cjs";
+//#region src/services/taskResult/index.d.ts
+export declare const MSG_ALL_COMPLETE_CLEAR = "All tasks are completed. Review the full task list once more, then close it with task {\"action\":\"clear\"}.";
+/**
+ * Steering for a mixed batch. Unlike a batch of spawned subagents, a failed
+ * entry here had no side effect at all, so retrying the failures is the safe
+ * move and the model must be told so or it will do nothing. The hazard is the
+ * other half: resending an applied create would make a second task.
+ */
+export declare const MSG_UPSERT_PARTIAL = "The applied entries are committed. Resend only the failed entries, corrected — a failed entry changed nothing, so a corrected retry is safe. Do not resend an entry that already applied: an entry without an id creates a second task.";
+export declare const MSG_UPSERT_NONE_APPLIED = "No task changed, so the whole call can be resent once corrected.";
+export declare const MSG_ASSIGN_PARTIAL = "Successful assignments are already running. Retry only the failed entries after correcting their task state or arguments; do not resend successful entries.";
+export interface AssignmentItemResult {
+  index: number;
+  id: number;
+  agent: string;
+  ok: boolean;
+  message: string;
+}
+/** LLM-facing report for a native assignment batch. */
+export declare function formatAssignmentResults(items: readonly AssignmentItemResult[]): string;
+/**
+ * The thrown message when an upsert applied nothing. Kept separate from
+ * `formatContent` because the caller wraps it in the actionable Options block
+ * rather than returning it as a successful result.
+ */
+export declare function formatUpsertFailureText(op: Extract<Op, {
+  kind: 'upsert';
+}>): string;
+/**
+ * Pure formatter: `(op, document) -> string`. The switch is closed over `Op`,
+ * so a new reducer variant fails to compile until it is handled here.
+ */
+export declare function formatContent(op: Op, document: TaskDocument): string;
+export interface ToolResult {
+  content: Array<{
+    type: 'text';
+    text: string;
+  }>;
+  details: TaskDetails;
+}
+/** Build the LLM-facing envelope. `details` carries the post-mutation snapshot. */
+export declare function buildToolResult(action: TaskAction, params: TaskMutationParams, document: TaskDocument, op: Op): ToolResult;
+/** Envelope for a native assignment batch, including ids used by the consolidated TUI result. */
+export declare function buildAssignmentResult(params: TaskMutationParams, document: TaskDocument, text: string, assignment: AssignmentSummary): ToolResult;
+/** Envelope for delegation actions, which do not flow through the reducer. */
+export declare function buildTextResult(action: TaskAction, params: TaskMutationParams, document: TaskDocument, text: string, error?: string): ToolResult;
+//#endregion
+//# sourceMappingURL=index.d.cts.map

package/dist/services/taskResult/index.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.cts","names":[],"sources":["../../../src/services/taskResult/index.ts"],"mappings":";;;qBAYa;;;;;;;qBASA;qBAGA;qBAEA;iBAGI;EACf;EACA;EACA;EACA;EACA;;;wBAIc,wBAAwB,gBAAgB;;;;;;wBAgFxC,wBAAwB,IAAI,QAAQ;EAAM;;;;;;wBAa1C,cAAc,IAAI,IAAI,UAAU;iBAmC/B;EACf,SAAS;IAAQ;IAAc;;EAC/B,SAAS;;;wBAIK,gBACd,QAAQ,YACR,QAAQ,oBACR,UAAU,cACV,IAAI,KACH;;wBA0Ba,sBACd,QAAQ,oBACR,UAAU,cACV,cACA,YAAY,oBACX;;wBAea,gBACd,QAAQ,YACR,QAAQ,oBACR,UAAU,cACV,cACA,iBACC"}

package/dist/services/taskResult/index.d.mts

@@ -0,0 +1,50 @@
+import { AssignmentSummary, TaskAction, TaskDetails, TaskDocument, TaskMutationParams } from "../../models/task.mjs";
+import { Op } from "../reducer/index.mjs";
+//#region src/services/taskResult/index.d.ts
+export declare const MSG_ALL_COMPLETE_CLEAR = "All tasks are completed. Review the full task list once more, then close it with task {\"action\":\"clear\"}.";
+/**
+ * Steering for a mixed batch. Unlike a batch of spawned subagents, a failed
+ * entry here had no side effect at all, so retrying the failures is the safe
+ * move and the model must be told so or it will do nothing. The hazard is the
+ * other half: resending an applied create would make a second task.
+ */
+export declare const MSG_UPSERT_PARTIAL = "The applied entries are committed. Resend only the failed entries, corrected — a failed entry changed nothing, so a corrected retry is safe. Do not resend an entry that already applied: an entry without an id creates a second task.";
+export declare const MSG_UPSERT_NONE_APPLIED = "No task changed, so the whole call can be resent once corrected.";
+export declare const MSG_ASSIGN_PARTIAL = "Successful assignments are already running. Retry only the failed entries after correcting their task state or arguments; do not resend successful entries.";
+export interface AssignmentItemResult {
+  index: number;
+  id: number;
+  agent: string;
+  ok: boolean;
+  message: string;
+}
+/** LLM-facing report for a native assignment batch. */
+export declare function formatAssignmentResults(items: readonly AssignmentItemResult[]): string;
+/**
+ * The thrown message when an upsert applied nothing. Kept separate from
+ * `formatContent` because the caller wraps it in the actionable Options block
+ * rather than returning it as a successful result.
+ */
+export declare function formatUpsertFailureText(op: Extract<Op, {
+  kind: 'upsert';
+}>): string;
+/**
+ * Pure formatter: `(op, document) -> string`. The switch is closed over `Op`,
+ * so a new reducer variant fails to compile until it is handled here.
+ */
+export declare function formatContent(op: Op, document: TaskDocument): string;
+export interface ToolResult {
+  content: Array<{
+    type: 'text';
+    text: string;
+  }>;
+  details: TaskDetails;
+}
+/** Build the LLM-facing envelope. `details` carries the post-mutation snapshot. */
+export declare function buildToolResult(action: TaskAction, params: TaskMutationParams, document: TaskDocument, op: Op): ToolResult;
+/** Envelope for a native assignment batch, including ids used by the consolidated TUI result. */
+export declare function buildAssignmentResult(params: TaskMutationParams, document: TaskDocument, text: string, assignment: AssignmentSummary): ToolResult;
+/** Envelope for delegation actions, which do not flow through the reducer. */
+export declare function buildTextResult(action: TaskAction, params: TaskMutationParams, document: TaskDocument, text: string, error?: string): ToolResult;
+//#endregion
+//# sourceMappingURL=index.d.mts.map

package/dist/services/taskResult/index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.mts","names":[],"sources":["../../../src/services/taskResult/index.ts"],"mappings":";;;qBAYa;;;;;;;qBASA;qBAGA;qBAEA;iBAGI;EACf;EACA;EACA;EACA;EACA;;;wBAIc,wBAAwB,gBAAgB;;;;;;wBAgFxC,wBAAwB,IAAI,QAAQ;EAAM;;;;;;wBAa1C,cAAc,IAAI,IAAI,UAAU;iBAmC/B;EACf,SAAS;IAAQ;IAAc;;EAC/B,SAAS;;;wBAIK,gBACd,QAAQ,YACR,QAAQ,oBACR,UAAU,cACV,IAAI,KACH;;wBA0Ba,sBACd,QAAQ,oBACR,UAAU,cACV,cACA,YAAY,oBACX;;wBAea,gBACd,QAAQ,YACR,QAAQ,oBACR,UAAU,cACV,cACA,iBACC"}

package/dist/services/taskResult/index.mjs

@@ -0,0 +1,7 @@
+import{deriveBlocks as e,isTaskListComplete as t}from"../../models/taskGraph.mjs";const n=`All tasks are completed. Review the full task list once more, then close it with task {"action":"clear"}.`,r=`The applied entries are committed. Resend only the failed entries, corrected — a failed entry changed nothing, so a corrected retry is safe. Do not resend an entry that already applied: an entry without an id creates a second task.`,i=`No task changed, so the whole call can be resent once corrected.`,a=`Successful assignments are already running. Retry only the failed entries after correcting their task state or arguments; do not resend successful entries.`;function o(e){if(e.length===1)return e[0].message;let t=e.filter(e=>e.ok).length,n=e.length-t,r=[`Assigned ${t}/${e.length} tasks${n>0?`; ${n} failed`:``}.`,...e.map(e=>e.ok?`- [${e.index}] Delegated #${e.id} to ${e.agent}`:`- [${e.index}] Failed #${e.id} → ${e.agent}: ${e.message}`)];return n>0&&t>0&&r.push(``,a),n===0&&r.push(``,`All assignments are running independently in the background. Continue non-overlapping work, or end your turn.`),r.join(`
+`)}function s(e){let t=e.blockedBy?.length?` ⛓ ${e.blockedBy.map(e=>`#${e}`).join(`,`)}`:``,n=e.status===`in_progress`&&e.activeForm?` (${e.activeForm})`:``,r=e.delegation&&e.delegation.state!==`cancelled`?` [${e.delegation.agent}]`:``;return`[${e.status}] #${e.id} ${e.subject}${n}${r}${t}`}function c(e){let t=e.delegation;if(!t)return[];let n=[`  delegated to: ${t.agent} (${t.state})`];return t.model&&n.push(`  model: ${t.model}`),t.result?.error&&n.push(`  error: ${t.result.error}`),t.result?.outputPath&&n.push(`  output file: ${t.result.outputPath}`),t.result?.output&&n.push(`  output: ${t.result.output}`),n}function l(t,n){let r=e(n.tasks).get(t.id)??[],i=[`#${t.id} [${t.status}] ${t.subject}`];return t.description&&i.push(`  description: ${t.description}`),t.activeForm&&i.push(`  activeForm: ${t.activeForm}`),t.blockedBy?.length&&i.push(`  blockedBy: ${t.blockedBy.map(e=>`#${e}`).join(`, `)}`),r.length&&i.push(`  blocks: ${r.map(e=>`#${e}`).join(`, `)}`),t.owner&&i.push(`  owner: ${t.owner}`),i.push(...c(t)),i.join(`
+`)}function u(e){switch(e.kind){case`created`:{let t=e.ref?` (ref "${e.ref}")`:``,n=e.blockedBy?.length?` — blocked by ${e.blockedBy.map(e=>`#${e}`).join(`, `)}`:``;return`Created #${e.id}${t}: ${e.subject} (${e.status})${n}`}case`updated`:{let t=e.fromStatus===e.toStatus?``:` (${e.fromStatus} -> ${e.toStatus})`;return`Updated #${e.id}${t}`}case`unchanged`:return`No change: #${e.id} already matches the requested values (status: ${e.status})`;case`failed`:return`Failed${e.id===void 0?``:` #${e.id}`}: ${e.message}`}}function d(e){return e.items.length===1?e.items[0].kind===`failed`?e.items[0].message:`no entry was applied`:[`no entry was applied.`,...e.items.map(e=>`- [${e.index}] ${u(e)}`),i].join(`
+`)}function f(e,i){switch(e.kind){case`upsert`:{let a=e.items.length===1?[u(e.items[0])]:[`Upsert applied ${e.applied}/${e.items.length} entries${e.failed>0?`; ${e.failed} failed`:``}.`,...e.items.map(e=>`- [${e.index}] ${u(e)}`),...e.failed>0?[``,r]:[]];return e.applied>0&&t(i.tasks)&&a.push(n),a.join(`
+`)}case`delete`:return`Deleted #${e.id}: ${e.subject}`;case`clear`:return`Closed task list (cleared ${e.count} tasks)`;case`list`:{let t=i.tasks;return e.includeDeleted||(t=t.filter(e=>e.status!==`deleted`)),e.statusFilter&&(t=t.filter(t=>t.status===e.statusFilter)),t.length===0?`No tasks`:t.map(s).join(`
+`)}case`get`:return l(e.task,i);case`error`:return`Error: ${e.message}`}}function p(e,t,n,r){return{content:[{type:`text`,text:f(r,n)}],details:{action:e,params:t,tasks:n.tasks,nextId:n.nextId,rev:n.rev,...r.kind===`error`?{error:r.message}:{},...r.kind===`upsert`?{upsert:{applied:r.items.flatMap(e=>e.kind===`failed`?[]:[e.id]),failed:r.failed}}:{}}}}function m(e,t,n,r){return{content:[{type:`text`,text:n}],details:{action:`assign`,params:e,tasks:t.tasks,nextId:t.nextId,rev:t.rev,assignment:r}}}function h(e,t,n,r,i){return{content:[{type:`text`,text:i?`Error: ${i}`:r}],details:{action:e,params:t,tasks:n.tasks,nextId:n.nextId,rev:n.rev,...i?{error:i}:{}}}}export{n as MSG_ALL_COMPLETE_CLEAR,a as MSG_ASSIGN_PARTIAL,i as MSG_UPSERT_NONE_APPLIED,r as MSG_UPSERT_PARTIAL,m as buildAssignmentResult,h as buildTextResult,p as buildToolResult,o as formatAssignmentResults,f as formatContent,d as formatUpsertFailureText};
+//# sourceMappingURL=index.mjs.map