@ordewell/core 0.4.23 → 0.5.1

package/dist/plan-utils.js

@@ -24,6 +24,7 @@ __export(plan_utils_exports, {
   canMergeTasks: () => canMergeTasks,
   canSetDependencies: () => canSetDependencies,
   canSplitTask: () => canSplitTask,
+  capConflictFiles: () => capConflictFiles,
   dependencyCandidates: () => dependencyCandidates,
   dependentsOf: () => dependentsOf,
   summarizeToolCall: () => summarizeToolCall,
@@ -171,12 +172,18 @@ function truncateCheckpointSummary(summary) {
   if (firstLine.length <= CHECKPOINT_TRUNCATE_LENGTH) return firstLine;
   return firstLine.slice(0, CHECKPOINT_TRUNCATE_LENGTH - 1) + "\u2026";
 }
+
+// src/services/isolationRecord.ts
+function capConflictFiles(files, max = 5) {
+  return files.length <= max ? files.join(", ") : `${files.slice(0, max).join(", ")}, +${files.length - max} more`;
+}
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   CHECKPOINT_TRUNCATE_LENGTH,
   canMergeTasks,
   canSetDependencies,
   canSplitTask,
+  capConflictFiles,
   dependencyCandidates,
   dependentsOf,
   summarizeToolCall,

package/dist/plan-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/plan-utils.ts","../src/services/TaskOps.ts","../src/services/researchStepSummary.ts","../src/services/SessionMessage.ts"],"sourcesContent":["/**\n * Browser-safe entry point: pure plan-validation utilities with no Node or\n * AI-service dependencies. UI surfaces (the VS Code webview runs in a browser)\n * import runtime values from here instead of the main barrel, which bundles the\n * Gemini/OpenAI services and their `fs`/`child_process` imports.\n */\nexport { canMergeTasks, canSplitTask, canSetDependencies, dependencyCandidates, dependentsOf } from './services/TaskOps';\nexport type { TaskRef } from './services/TaskOps';\nexport { summarizeToolCall } from './services/researchStepSummary';\nexport { truncateCheckpointSummary, CHECKPOINT_TRUNCATE_LENGTH } from './services/SessionMessage';\n","import { v4 as uuidv4 } from 'uuid';\nimport {\n  Task, RunnerId, flattenTasks,\n  addTaskToPlan, removeTaskFromPlan, updateTaskInPlan, renumberTasks,\n  createTask,\n} from '../models/Task';\nimport { extractObjectsWithKey, stripTrailingCommas, escapeControlCharsInStrings, PlanParseError, TASK_OPS_ENVELOPE_KEY } from './JsonExtractor';\nimport { validateTaskEdit, checkModelAndModeValidity, type EditCatalog } from './TaskEditValidator';\n\n/**\n * Targeted task edits emitted by the planner conversation (the 'task_ops'\n * ConversationTurn). Task references accept a task id, a \"#<order>\" ref, or a\n * bare order number — cheap models rarely echo UUIDs correctly.\n */\nexport type TaskOp =\n  | { op: 'update'; taskId: string; changes: Partial<Task> }\n  | { op: 'add'; task: Partial<Task>; handle?: string }\n  | { op: 'remove'; taskId: string }\n  | { op: 'reorder'; taskIds: string[] }\n  | { op: 'merge'; taskIds: string[]; merged: Partial<Task>; handle?: string }\n  | { op: 'split'; taskId: string; parts: Partial<Task>[]; handle?: string }\n  | { op: 'rearm'; taskId: string; changes?: Partial<Task> };\n\n/** Fields the planner may change on an existing task. Everything else (id, status, verdict…) is system-owned. */\nexport const UPDATABLE_FIELDS: (keyof Task)[] = [\n  'title', 'description', 'prompt', 'dependencies', 'assignedRunner', 'assignedModel', 'taskMode', 'thinkingEffort', 'type', 'userSteps', 'autonomy', 'sliceType',\n];\n\nexport function textHasTaskOps(text: string): boolean {\n  return text.includes(`\"${TASK_OPS_ENVELOPE_KEY}\"`);\n}\n\n/** Parse a `{\"taskOps\":[...]}` reply. Throws PlanParseError when the JSON is unusable. */\nexport function parseTaskOpsJson(text: string): TaskOp[] {\n  // Extract by the taskOps key specifically — a reply may also carry a\n  // tasks-keyed object (schema echo, example), which must not shadow the ops.\n  // Candidates are tried back to front: the last emission is the final answer.\n  const { matches, fallback } = extractObjectsWithKey(text, TASK_OPS_ENVELOPE_KEY);\n  const candidates = matches.length > 0 ? [...matches].reverse() : [fallback.json];\n\n  let lastError: PlanParseError | null = null;\n  for (const json of candidates) {\n    try {\n      return parseTaskOpsObject(json, text);\n    } catch (err) {\n      if (!(err instanceof PlanParseError)) throw err;\n      if (!lastError) lastError = err;\n    }\n  }\n  throw lastError ?? new PlanParseError('No JSON object found in task-ops reply', text);\n}\n\nfunction parseTaskOpsObject(json: string, text: string): TaskOp[] {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(escapeControlCharsInStrings(stripTrailingCommas(json)));\n  } catch (err) {\n    throw new PlanParseError(`Task-ops JSON is invalid: ${err instanceof Error ? err.message : String(err)}`, text);\n  }\n  const ops = (parsed as { taskOps?: unknown }).taskOps;\n  if (!Array.isArray(ops) || ops.length === 0) {\n    throw new PlanParseError('\"taskOps\" must be a non-empty array', text);\n  }\n  for (const op of ops) {\n    if (typeof op !== 'object' || op === null || typeof (op as { op?: unknown }).op !== 'string') {\n      throw new PlanParseError('Every task op needs an \"op\" field (update | add | remove | reorder | merge | split)', text);\n    }\n  }\n  return ops as TaskOp[];\n}\n\ntype RefResolution = { id: string } | { error: string };\n\n/**\n * Resolve a task reference (id, \"#3\", \"3\", or a batch handle) to a task id.\n *\n * `#order` and title matches are pinned to `originalScope` — the plan as it\n * stood before the batch began — so an earlier op's renumbering can never\n * make a later op's \"#4\" land on a different task than the planner saw. A\n * literal id has no such drift (ids are stable across mutations), so id\n * matches check `liveScope` — the batch's current, mutated tasks — which is\n * also how a later op reaches a task created earlier in the same batch\n * without a handle (e.g. a split's own chained parts).\n */\nfunction resolveRef(\n  ref: unknown,\n  originalScope: Task[],\n  liveScope: Task[],\n  handleOwner: Map<string, number>,\n  handleId: Map<string, string>,\n  opIndex: number,\n): RefResolution {\n  if (typeof ref !== 'string' && typeof ref !== 'number') return { error: `invalid reference \"${String(ref)}\"` };\n  const s = String(ref).trim();\n\n  const ownerIdx = handleOwner.get(s);\n  if (ownerIdx !== undefined) {\n    if (ownerIdx >= opIndex) {\n      return { error: `handle \"${s}\" is defined later in this batch (op ${ownerIdx + 1}) and cannot be referenced yet` };\n    }\n    const id = handleId.get(s);\n    if (!id) return { error: `handle \"${s}\" was never resolved` };\n    return { id };\n  }\n\n  const byLiveId = liveScope.find((t) => t.id === s);\n  if (byLiveId) return { id: byLiveId.id };\n  const orderStr = s.startsWith('#') ? s.slice(1) : s;\n  if (/^\\d+$/.test(orderStr)) {\n    const order = Number(orderStr);\n    const byOrder = originalScope.filter((t) => t.order === order);\n    if (byOrder.length === 1) return { id: byOrder[0].id };\n  }\n  const byTitle = originalScope.find((t) => t.title === s);\n  if (byTitle) return { id: byTitle.id };\n  return { error: `task \"${s}\" not found` };\n}\n\n/** Whether `name` already denotes an existing task by id, `#order`, or title. */\nfunction refCollidesWithExisting(name: string, originalFlatAll: Task[]): boolean {\n  if (originalFlatAll.some((t) => t.id === name)) return true;\n  const orderStr = name.startsWith('#') ? name.slice(1) : name;\n  if (/^\\d+$/.test(orderStr) && originalFlatAll.some((t) => t.order === Number(orderStr))) return true;\n  return originalFlatAll.some((t) => t.title === name);\n}\n\nfunction findInTasks(tasks: Task[], id: string): Task | undefined {\n  return flattenTasks(tasks).find((t) => t.id === id);\n}\n\nfunction findTopLevel(tasks: Task[], id: string): Task | undefined {\n  return tasks.find((t) => t.id === id);\n}\n\nfunction detectCycle(tasks: Task[]): string | null {\n  const byId = new Map(tasks.map((t) => [t.id, t]));\n  const visiting = new Set<string>();\n  const done = new Set<string>();\n  const visit = (id: string): string | null => {\n    if (done.has(id)) return null;\n    if (visiting.has(id)) return id;\n    visiting.add(id);\n    for (const dep of byId.get(id)?.dependencies ?? []) {\n      const hit = visit(dep);\n      if (hit) return hit;\n    }\n    visiting.delete(id);\n    done.add(id);\n    return null;\n  };\n  for (const t of tasks) {\n    const hit = visit(t.id);\n    if (hit) return byId.get(hit)?.title ?? hit;\n  }\n  return null;\n}\n\n/** A task the repair may not reposition: execution has already reached it. */\nfunction isPinned(t: Task): boolean {\n  return t.status === 'in_progress' || t.status === 'completed';\n}\n\n/**\n * Reorder top-level tasks so every dependency comes before its dependents,\n * moving as little as possible: pinned tasks keep the exact slot they are in,\n * and each free slot goes to the earliest-listed movable task whose\n * dependencies are already placed — so tasks the graph does not constrain keep\n * their relative order. Assumes an acyclic graph (the caller checks first).\n */\nfunction repairOrder(tasks: Task[]): { tasks: Task[] } | { error: string } {\n  const byId = new Map(tasks.map((t) => [t.id, t]));\n  const placed = new Set<string>();\n  const movable = tasks.filter((t) => !isPinned(t));\n  const result: Task[] = [];\n  // Dependencies outside this list (a subtask id) constrain nothing here.\n  const blockerOf = (t: Task): Task | undefined => {\n    const id = t.dependencies.find((d) => byId.has(d) && !placed.has(d));\n    return id ? byId.get(id) : undefined;\n  };\n  const place = (t: Task) => { result.push(t); placed.add(t.id); };\n\n  for (const occupant of tasks) {\n    if (isPinned(occupant)) {\n      const blocker = blockerOf(occupant);\n      if (blocker) return { error: pinnedRefusal(blocker, occupant, 'before') };\n      place(occupant);\n      continue;\n    }\n    const next = movable.findIndex((t) => !blockerOf(t));\n    if (next < 0) {\n      // Nothing is schedulable and the graph is acyclic, so every movable task\n      // left waits — directly or through others — on a pinned task further down\n      // that would have to come up to free this slot.\n      const [stuck, pin] = trailToPin(movable[0], blockerOf);\n      return { error: pinnedRefusal(stuck, pin, 'after') };\n    }\n    place(movable.splice(next, 1)[0]);\n  }\n  return { tasks: result };\n}\n\n/** Walk the waiting-on chain from `task` down to the pinned task holding it up. */\nfunction trailToPin(task: Task, blockerOf: (t: Task) => Task | undefined): [Task, Task] {\n  let at = task;\n  for (;;) {\n    const blocker = blockerOf(at);\n    if (!blocker || isPinned(blocker)) return [at, blocker ?? at];\n    at = blocker;\n  }\n}\n\n/** `\"B\" #2→#1, \"A\" #1→#3` for every task the repair actually moved, or null. */\nfunction describeMoves(before: Task[], after: Task[]): string | null {\n  const wasAt = new Map(before.map((t, i) => [t.id, i + 1]));\n  const moved = after\n    .map((t, i) => ({ t, from: wasAt.get(t.id)!, to: i + 1 }))\n    .filter((m) => m.from !== m.to);\n  return moved.length ? moved.map((m) => `\"${m.t.title}\" #${m.from}→#${m.to}`).join(', ') : null;\n}\n\nfunction pinnedRefusal(other: Task, pin: Task, side: 'before' | 'after'): string {\n  const word = pin.status === 'in_progress' ? 'running' : 'completed';\n  return `\"${other.title}\" would have to run ${side} \"${pin.title}\", which is ${word} and cannot be moved`;\n}\n\nexport interface ApplyTaskOpsResult {\n  ok: boolean;\n  tasks: Task[];\n  errors: string[];\n  /** Human-readable summary of what changed, for the chat transcript. */\n  summary: string[];\n}\n\n/**\n * Pre-flight check for a merge: would collapsing the selected tasks into one\n * (rewiring every dependent of any selected task to the survivor) keep the\n * dependency graph valid? Rejects locked tasks and merges whose rewiring would\n * introduce a cycle. Display order is NOT checked here — neither\n * consecutiveness (a UI concern) nor a dependency the merge pulls out of order,\n * which {@link applyTaskOps} repairs; refusing on order would make this\n * pre-flight stricter than the applier it stands in for.\n */\nexport function canMergeTasks(tasks: Task[], selectedIds: string[]): { ok: boolean; error?: string } {\n  if (selectedIds.length < 2) return { ok: false, error: 'Select at least two tasks to merge' };\n  const idSet = new Set(selectedIds);\n  const toMerge = tasks.filter((t) => idSet.has(t.id));\n  if (toMerge.length < 2) return { ok: false, error: 'At least two valid tasks are required to merge' };\n  for (const t of toMerge) {\n    if (t.status === 'in_progress') return { ok: false, error: `\"${t.title}\" is running and cannot be merged` };\n    if (t.status === 'completed') return { ok: false, error: `\"${t.title}\" is completed and cannot be merged` };\n  }\n  const ordered = [...toMerge].sort((a, b) => a.order - b.order);\n  const survivorId = '__merge_sim__';\n  const sim: Task[] = tasks\n    .filter((t) => !idSet.has(t.id))\n    .map((t) => ({ ...t, dependencies: t.dependencies.map((d) => (idSet.has(d) ? survivorId : d)).filter((d) => d !== t.id) }));\n  const unionDeps = [...new Set(toMerge.flatMap((t) => t.dependencies))].filter((d) => !idSet.has(d));\n  sim.push({ ...ordered[0], id: survivorId, title: '__merge_sim__', order: ordered[0].order, dependencies: unionDeps });\n  const cycle = detectCycle(sim);\n  if (cycle) return { ok: false, error: `Merging would create a dependency cycle involving \"${cycle}\"` };\n  return { ok: true };\n}\n\n/**\n * The shape the dependency helpers below read. Structural rather than `Task`,\n * because the TUI projects tasks into its own `TaskView`: a surface's\n * dependency picker and the API's validation must agree on which dependencies\n * are legal, and a signature only core can satisfy would have forced the TUI\n * to keep a second copy of the rule.\n */\nexport interface TaskRef {\n  id: string;\n  order: number;\n  title: string;\n  dependencies: string[];\n}\n\n/** The tasks listing `taskId` as a dependency — exactly what removing it detaches. */\nexport function dependentsOf<T extends Pick<TaskRef, 'id' | 'dependencies'>>(tasks: T[], taskId: string): T[] {\n  return tasks.filter((t) => t.id !== taskId && t.dependencies.includes(taskId));\n}\n\n/**\n * The tasks that may become dependencies of `taskId`: those displayed before it.\n *\n * Offering only earlier tasks is what keeps a hand-edited graph valid without a\n * cycle check — dependencies then only ever point backwards in display order,\n * the same invariant `applyTaskOps` enforces. Omit `taskId` for a task that does\n * not exist yet: it lands last, so every current task is a candidate.\n */\nexport function dependencyCandidates<T extends Pick<TaskRef, 'id' | 'order'>>(tasks: T[], taskId?: string): T[] {\n  if (!taskId) return [...tasks];\n  const target = tasks.find((t) => t.id === taskId);\n  return target ? tasks.filter((t) => t.order < target.order) : [];\n}\n\n/** Pre-flight check for a hand-edited dependency list: every id exists and comes earlier. */\nexport function canSetDependencies<T extends TaskRef>(\n  tasks: T[],\n  taskId: string,\n  dependencies: string[],\n): { ok: boolean; error?: string } {\n  const target = tasks.find((t) => t.id === taskId);\n  if (!target) return { ok: false, error: 'Task not found' };\n  const allowed = new Set(dependencyCandidates(tasks, taskId).map((t) => t.id));\n  for (const dep of dependencies) {\n    if (dep === taskId) return { ok: false, error: `\"${target.title}\" cannot depend on itself` };\n    const found = tasks.find((t) => t.id === dep);\n    if (!found) return { ok: false, error: `Unknown dependency \"${dep}\"` };\n    if (!allowed.has(dep)) {\n      return { ok: false, error: `\"${target.title}\" cannot depend on \"${found.title}\", which comes after it in the plan` };\n    }\n  }\n  return { ok: true };\n}\n\n/** Pre-flight check for a split: the task exists and is not locked by execution. */\nexport function canSplitTask(tasks: Task[], taskId: string): { ok: boolean; error?: string } {\n  const target = tasks.find((t) => t.id === taskId);\n  if (!target) return { ok: false, error: 'Task not found' };\n  if (target.status === 'in_progress') return { ok: false, error: `\"${target.title}\" is running and cannot be split` };\n  if (target.status === 'completed') return { ok: false, error: `\"${target.title}\" is completed and cannot be split` };\n  return { ok: true };\n}\n\n/**\n * Apply task ops to a snapshot of the plan, atomically: either every op\n * applies and the result validates (deps resolve, no cycles, running and\n * completed tasks untouched), or nothing is returned and `errors` explains\n * why. The caller commits `tasks` on ok.\n */\nexport function applyTaskOps(currentTasks: Task[], ops: TaskOp[], runners: RunnerId[], catalog?: EditCatalog): ApplyTaskOpsResult {\n  let tasks: Task[] = JSON.parse(JSON.stringify(currentTasks));\n  const errors: string[] = [];\n  const summary: string[] = [];\n\n  // Frozen snapshot every ref resolves `#order`/title matches against, so an\n  // earlier op's renumbering can never shift what a later op's \"#N\" means.\n  const originalFlatAll = flattenTasks(currentTasks);\n\n  // Batch handles: planner-chosen names for a task an add/merge/split op is\n  // about to create, so a later op in the same batch can reference it before\n  // it has a real id. Pre-scanned up front — a bad handle refuses the whole\n  // batch before anything mutates.\n  const handleOwner = new Map<string, number>();\n  const handleId = new Map<string, string>();\n  for (const [i, op] of ops.entries()) {\n    const handle = (op as { handle?: unknown }).handle;\n    if (handle === undefined) continue;\n    if (typeof handle !== 'string' || !handle.trim()) {\n      errors.push(`op ${i + 1} (${op.op}): handle must be a non-empty string`);\n      continue;\n    }\n    if (handleOwner.has(handle)) {\n      errors.push(`op ${i + 1} (${op.op}): handle \"${handle}\" is already used earlier in this batch`);\n      continue;\n    }\n    if (refCollidesWithExisting(handle, originalFlatAll)) {\n      errors.push(`op ${i + 1} (${op.op}): handle \"${handle}\" collides with an existing task reference`);\n      continue;\n    }\n    handleOwner.set(handle, i);\n  }\n  if (errors.length) return { ok: false, tasks: currentTasks, errors, summary: [] };\n\n  const resolveDeps = (deps: unknown, opIndex: number): { ids: string[]; bad: string[] } => {\n    const ids: string[] = [];\n    const bad: string[] = [];\n    const liveFlat = flattenTasks(tasks);\n    for (const d of Array.isArray(deps) ? deps : []) {\n      const r = resolveRef(d, originalFlatAll, liveFlat, handleOwner, handleId, opIndex);\n      if ('error' in r) { bad.push(`${String(d)} (${r.error})`); continue; }\n      if (!liveFlat.some((t) => t.id === r.id)) { bad.push(`${String(d)} (no longer exists in this batch)`); continue; }\n      ids.push(r.id);\n    }\n    return { ids, bad };\n  };\n\n  for (const [i, op] of ops.entries()) {\n    const label = `op ${i + 1} (${op.op})`;\n    switch (op.op) {\n      case 'update': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        const changes: Partial<Task> = {};\n        for (const key of UPDATABLE_FIELDS) {\n          if (op.changes && key in op.changes) (changes as Record<string, unknown>)[key] = (op.changes as Record<string, unknown>)[key];\n        }\n        if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n          errors.push(`${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]`);\n          break;\n        }\n        // Dependency refs are still unresolved (e.g. \"#3\") at this point, so\n        // this check runs on everything but them; resolveDeps below handles\n        // dependency well-formedness once they're real ids.\n        const changesForCheck: Partial<Task> = { ...changes };\n        delete changesForCheck.dependencies;\n        const check = validateTaskEdit('planner', flattenTasks(tasks), target.id, changesForCheck, catalog);\n        if (!check.ok) { errors.push(`${label}: ${check.error}`); break; }\n        for (const field of check.clear ?? []) (changes as Record<string, unknown>)[field] = undefined;\n        if ('dependencies' in changes) {\n          const { ids, bad } = resolveDeps(changes.dependencies, i);\n          if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n          changes.dependencies = ids.filter((id) => id !== target.id);\n        }\n        if (Object.keys(changes).length === 0) { errors.push(`${label}: no valid changes provided`); break; }\n        tasks = updateTaskInPlan(tasks, target.id, changes);\n        const clearedNote = check.clear?.length ? `; cleared ${check.clear.join(', ')}` : '';\n        summary.push(`Updated \"${target.title}\" (${Object.keys(changes).join(', ')})${clearedNote}`);\n        break;\n      }\n      case 'add': {\n        const spec = op.task ?? {};\n        if (!spec.title) { errors.push(`${label}: new task needs a title`); break; }\n        const { ids, bad } = resolveDeps(spec.dependencies, i);\n        if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n        const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : runners[0];\n        const validity = checkModelAndModeValidity(runner, spec.assignedModel, spec.taskMode, catalog);\n        if (!validity.ok) { errors.push(`${label}: ${validity.error}`); break; }\n        const newId = uuidv4();\n        tasks = addTaskToPlan(tasks, {\n          ...spec,\n          id: newId,\n          dependencies: ids,\n          assignedRunner: runner,\n          description: spec.description ?? spec.title,\n          prompt: spec.prompt ?? spec.description ?? spec.title,\n        });\n        if (op.handle) handleId.set(op.handle, newId);\n        summary.push(`Added \"${spec.title}\"`);\n        break;\n      }\n      case 'remove': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be removed`); break; }\n        if (target.status === 'completed') { errors.push(`${label}: \"${target.title}\" is completed and cannot be removed`); break; }\n        tasks = removeTaskFromPlan(tasks, target.id);\n        summary.push(`Removed \"${target.title}\"`);\n        break;\n      }\n      case 'reorder': {\n        const refs = (op.taskIds ?? []).map((r) => resolveRef(r, currentTasks, tasks, handleOwner, handleId, i));\n        const badRef = refs.find((r): r is { error: string } => 'error' in r);\n        if (badRef) { errors.push(`${label}: ${badRef.error}`); break; }\n        const resolved = (refs as { id: string }[]).map((r) => findTopLevel(tasks, r.id));\n        if (resolved.some((t) => !t)) { errors.push(`${label}: unknown task in reorder list`); break; }\n        const orderIds = resolved.map((t) => t!.id);\n        if (new Set(orderIds).size !== tasks.length) {\n          errors.push(`${label}: reorder must list every top-level task exactly once (${tasks.length} tasks)`);\n          break;\n        }\n        const byId = new Map(tasks.map((t) => [t.id, t]));\n        tasks = renumberTasks(orderIds.map((id) => byId.get(id)!));\n        summary.push('Reordered tasks');\n        break;\n      }\n      case 'merge': {\n        const refs = (op.taskIds ?? []).map((r) => resolveRef(r, currentTasks, tasks, handleOwner, handleId, i));\n        const badRef = refs.find((r): r is { error: string } => 'error' in r);\n        if (badRef) { errors.push(`${label}: ${badRef.error}`); break; }\n        const resolved = (refs as { id: string }[]).map((r) => findTopLevel(tasks, r.id));\n        if (resolved.some((t) => !t)) { errors.push(`${label}: unknown task in merge list (already removed, merged, or split by an earlier op)`); break; }\n        const toMerge = resolved.map((t) => t!).sort((a, b) => a.order - b.order);\n        if (toMerge.length < 2) { errors.push(`${label}: merge needs at least two tasks`); break; }\n        const locked = toMerge.find((t) => t.status === 'in_progress' || t.status === 'completed');\n        if (locked) {\n          errors.push(`${label}: \"${locked.title}\" is ${locked.status === 'in_progress' ? 'running' : 'completed'} and cannot be merged`);\n          break;\n        }\n        const idSet = new Set(toMerge.map((t) => t.id));\n        const unionDepsRaw = [...new Set(toMerge.flatMap((t) => t.dependencies))].filter((d) => !idSet.has(d));\n        const { ids, bad } = resolveDeps(unionDepsRaw, i);\n        if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n        const spec = op.merged ?? {};\n        if (!spec.title) { errors.push(`${label}: merged task needs a title`); break; }\n        const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : toMerge[0].assignedRunner;\n        const mergedTask = createTask({\n          title: spec.title,\n          description: spec.description ?? toMerge.map((t) => t.description).filter(Boolean).join('\\n\\n'),\n          prompt: spec.prompt ?? (toMerge.map((t) => t.prompt).filter(Boolean).join('\\n\\n---\\n\\n') || undefined),\n          type: spec.type ?? (toMerge.some((t) => t.type === 'user') ? 'user' : 'ai'),\n          dependencies: ids,\n          assignedRunner: runner,\n          assignedModel: spec.assignedModel ?? toMerge.find((t) => t.assignedModel)?.assignedModel,\n          thinkingEffort: spec.thinkingEffort ?? toMerge.find((t) => t.thinkingEffort)?.thinkingEffort,\n          taskMode: spec.taskMode ?? toMerge[0].taskMode,\n          autonomy: spec.autonomy ?? toMerge.find((t) => t.autonomy)?.autonomy,\n          sliceType: spec.sliceType ?? toMerge.find((t) => t.sliceType)?.sliceType,\n          userStoriesCovered: spec.userStoriesCovered ?? (toMerge.flatMap((t) => t.userStoriesCovered ?? []).length\n            ? [...new Set(toMerge.flatMap((t) => t.userStoriesCovered ?? []))]\n            : undefined),\n        });\n        const mergedId = mergedTask.id;\n        const firstId = toMerge[0].id;\n        const result: Task[] = [];\n        let inserted = false;\n        for (const t of tasks) {\n          if (idSet.has(t.id)) {\n            if (!inserted && t.id === firstId) { result.push(mergedTask); inserted = true; }\n            continue;\n          }\n          result.push({ ...t, dependencies: t.dependencies.map((d) => (idSet.has(d) ? mergedId : d)) });\n        }\n        if (!inserted) result.push(mergedTask);\n        tasks = renumberTasks(result);\n        if (op.handle) handleId.set(op.handle, mergedId);\n        summary.push(`Merged ${toMerge.length} tasks into \"${spec.title}\"`);\n        break;\n      }\n      case 'split': {\n        const ref = resolveRef(op.taskId, currentTasks, tasks, handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findTopLevel(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" not found`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be split`); break; }\n        if (target.status === 'completed') { errors.push(`${label}: \"${target.title}\" is completed and cannot be split`); break; }\n        const parts = op.parts ?? [];\n        if (parts.length < 2) { errors.push(`${label}: split needs at least two parts`); break; }\n        const newTasks: Task[] = [];\n        let prevId: string | undefined;\n        let buildError = false;\n        for (let p = 0; p < parts.length; p++) {\n          const spec = parts[p];\n          if (!spec || !spec.title) { errors.push(`${label}: split part ${p + 1} needs a title`); buildError = true; break; }\n          // Part 0 inherits the original's (external) dependencies, resolved\n          // against the current plan. Later parts chain onto the previous part\n          // — a sibling id created in this same op, so it needs no resolution.\n          let deps: string[];\n          if (p === 0) {\n            const { ids, bad } = resolveDeps(target.dependencies, i);\n            if (bad.length) { errors.push(`${label}: split part 1 unknown dependencies: ${bad.join(', ')}`); buildError = true; break; }\n            deps = ids;\n          } else {\n            deps = prevId ? [prevId] : [];\n          }\n          const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : target.assignedRunner;\n          const nt = createTask({\n            title: spec.title,\n            description: spec.description ?? spec.title,\n            prompt: spec.prompt ?? spec.description ?? spec.title,\n            type: spec.type ?? target.type,\n            dependencies: deps,\n            assignedRunner: runner,\n            assignedModel: spec.assignedModel ?? target.assignedModel,\n            taskMode: spec.taskMode ?? target.taskMode,\n            autonomy: spec.autonomy ?? target.autonomy,\n            sliceType: spec.sliceType ?? target.sliceType,\n            userStoriesCovered: spec.userStoriesCovered ?? target.userStoriesCovered,\n          });\n          newTasks.push(nt);\n          prevId = nt.id;\n        }\n        if (buildError) break;\n        const tailId = newTasks[newTasks.length - 1].id;\n        const result: Task[] = [];\n        for (const t of tasks) {\n          if (t.id === target.id) { result.push(...newTasks); continue; }\n          result.push({ ...t, dependencies: t.dependencies.map((d) => (d === target.id ? tailId : d)) });\n        }\n        tasks = renumberTasks(result);\n        if (op.handle) handleId.set(op.handle, tailId);\n        summary.push(`Split \"${target.title}\" into ${newTasks.length} tasks`);\n        break;\n      }\n      case 'rearm': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be re-armed`); break; }\n        const changes: Partial<Task> = {};\n        for (const key of UPDATABLE_FIELDS) {\n          if (op.changes && key in op.changes) (changes as Record<string, unknown>)[key] = (op.changes as Record<string, unknown>)[key];\n        }\n        if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n          errors.push(`${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]`);\n          break;\n        }\n        // Validated as a direct edit (not 'planner'): re-arming is the sanctioned\n        // exception to the planner lock — its whole point is to touch a task the\n        // lock would otherwise refuse. Well-formedness (type coherence, model/mode\n        // validity, dependency shape) still applies, same as every other edit.\n        const changesForCheck: Partial<Task> = { ...changes };\n        delete changesForCheck.dependencies;\n        const check = validateTaskEdit('direct', flattenTasks(tasks), target.id, changesForCheck, catalog);\n        if (!check.ok) { errors.push(`${label}: ${check.error}`); break; }\n        for (const field of check.clear ?? []) (changes as Record<string, unknown>)[field] = undefined;\n        if ('dependencies' in changes) {\n          const { ids, bad } = resolveDeps(changes.dependencies, i);\n          if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n          changes.dependencies = ids.filter((id) => id !== target.id);\n        }\n        tasks = updateTaskInPlan(tasks, target.id, { ...changes, status: 'pending', verdict: undefined, outputSummary: undefined });\n        // Dependents parked at 'blocked' by this task's earlier failure have\n        // nothing else to release them — the scheduler reads `status` directly,\n        // not a live recomputation of the dependency graph.\n        for (const dep of flattenTasks(tasks)) {\n          if (dep.status === 'blocked' && dep.dependencies.includes(target.id)) {\n            tasks = updateTaskInPlan(tasks, dep.id, { status: 'pending' });\n          }\n        }\n        const clearedNote = check.clear?.length ? `; cleared ${check.clear.join(', ')}` : '';\n        const changedNote = Object.keys(changes).length ? ` (${Object.keys(changes).join(', ')})` : '';\n        summary.push(`Re-armed \"${target.title}\"${changedNote}${clearedNote}`);\n        break;\n      }\n      default:\n        errors.push(`${label}: unknown op \"${(op as { op: string }).op}\"`);\n    }\n    if (errors.length) break;\n  }\n\n  if (!errors.length) {\n    const flat = flattenTasks(tasks);\n    const idSet = new Set(flat.map((t) => t.id));\n    for (const t of flat) {\n      for (const dep of t.dependencies) {\n        if (!idSet.has(dep)) errors.push(`\"${t.title}\" depends on a task that no longer exists (${dep})`);\n      }\n    }\n    const cycleAt = detectCycle(flat);\n    if (cycleAt) errors.push(`Dependency cycle detected involving \"${cycleAt}\"`);\n    // Display order is maintained, not demanded: whatever the batch produced,\n    // the plan comes back with dependencies ahead of their dependents. The\n    // planner never has to re-declare the whole order to move one task.\n    if (!errors.length) {\n      const repaired = repairOrder(tasks);\n      if ('error' in repaired) {\n        errors.push(repaired.error);\n      } else {\n        const moves = describeMoves(tasks, repaired.tasks);\n        if (moves) summary.push(`Reordered to keep dependencies first: ${moves}`);\n        tasks = renumberTasks(repaired.tasks);\n      }\n    }\n  }\n\n  return errors.length\n    ? { ok: false, tasks: currentTasks, errors, summary: [] }\n    : { ok: true, tasks, errors: [], summary };\n}\n","import type { ResearchStepOutcome } from '../models/Task';\n\n/**\n * One-line human summary of a research tool call, shared by every surface that\n * renders live planner progress (VS Code webview, CLI, TUI). Kept in core so\n * the arg-shape heuristics (file path vs. pattern vs. shell command) live in\n * one place instead of being re-derived per surface — which also means a new\n * tool becomes readable in all three UIs by being handled here once.\n */\n\nfunction ellipsize(text: string, max: number): string {\n  const oneLine = text.replace(/\\s+/g, ' ').trim();\n  return oneLine.length > max ? `${oneLine.slice(0, max)}…` : oneLine;\n}\n\n/**\n * @param toolLabel The agent's own name for the tool, when a harness planner\n * produced the call (ADR-0009). It replaces the member name in the summary, so\n * the timeline says `Edit` rather than the catch-all `agent_tool` — and says\n * `WebFetch` rather than claiming a shell command ran.\n */\nexport function summarizeToolCall(tool: string, argsJson: string, toolLabel?: string): string {\n  const display = toolLabel?.trim() || tool;\n  if (tool === 'agent_tool') {\n    // No Ordewell equivalent, so no arg shape to rely on: show the agent's name\n    // plus whichever conventional field the call happens to carry.\n    try {\n      const args = JSON.parse(argsJson);\n      const hint = args.path ?? args.file_path ?? args.filePath ?? args.pattern ?? args.query ?? args.url ?? args.command;\n      if (hint) return `${display} ${ellipsize(String(hint), 50)}`;\n    } catch {\n      // fall through to the bare name\n    }\n    return display;\n  }\n\n  if (tool === 'spawn_research_agent') {\n    try {\n      const args = JSON.parse(argsJson);\n      const prompt = typeof args.prompt === 'string' ? args.prompt : '';\n      const oneLine = prompt.replace(/\\s+/g, ' ').trim();\n      return `spawn: \"${oneLine.slice(0, 60)}${oneLine.length > 60 ? '…' : ''}\"`;\n    } catch {\n      return 'spawn_research_agent';\n    }\n  }\n\n  try {\n    const args = JSON.parse(argsJson);\n\n    // Ordered by specificity: a tool's defining argument wins over the generic\n    // `path`, which several of the newer tools also accept as a search root.\n    if (tool === 'find_symbol' && args.symbol) {\n      return `find_symbol ${args.symbol}${args.language ? ` [${args.language}]` : ''}`;\n    }\n    if (tool === 'web_search' && args.query) {\n      return `web_search \"${ellipsize(String(args.query), 50)}\"`;\n    }\n    if (tool === 'fetch' && args.url) {\n      return `fetch ${ellipsize(String(args.url), 60)}`;\n    }\n    // The pattern is what a glob is about; the generic `path` below is only its\n    // search root, and reporting that read as \"glob src\" for every call.\n    if (tool === 'glob' && args.pattern) {\n      return `glob ${ellipsize(String(args.pattern), 50)}`;\n    }\n    if (tool === 'grep' && args.pattern) {\n      const mode = args.output_mode && args.output_mode !== 'content' ? ` (${args.output_mode})` : '';\n      const scope = args.include ? ` in ${args.include}` : '';\n      return `grep ${ellipsize(String(args.pattern), 40)}${scope}${mode}`;\n    }\n\n    const path = args.filePath || args.file_path || args.path;\n    if (path) {\n      const basename = String(path).split('/').pop() || String(path);\n      return `${display} ${basename}`;\n    }\n    if (args.pattern) {\n      return `${display} ${args.pattern}`;\n    }\n    if (args.command) {\n      return `bash: ${String(args.command).slice(0, 40)}`;\n    }\n  } catch {\n    // fall through to the bare tool name below\n  }\n  return display;\n}\n\n/**\n * Classify a tool outcome from its result text and success flag, so a surface\n * can render a refused `rm` or a denied `npm test` distinctly from a\n * successful run without re-deriving the refusal signatures per surface. The\n * refusal/denial strings come from `commandPolicy.ts`, `BaseFileSystem.ts`,\n * and the research-subagent wrapper — keeping the matching here means the\n * signatures stay in one place alongside the human summary.\n */\nexport function classifyOutcome(success: boolean, output: string): ResearchStepOutcome {\n  if (!success) {\n    if (/^Command refused:/.test(output) || /is not available\\. You are a read-only research subagent/.test(output)) return 'refused';\n    if (/not approved/i.test(output) || /^Access denied:/.test(output) || /needs user approval/i.test(output)) return 'denied';\n    return 'failure';\n  }\n  return 'success';\n}\n","import type { LegacyPlanState, QueuedMessage, ResearchStep, RunnerId, Task, Verdict } from '../models/Task';\nimport type { ApprovalKind } from '../interfaces/IApproval';\nimport type { ApprovalSource } from './ApprovalPolicy';\n\nexport type SerializedTaskStatus = {\n  id: string;\n  status: string;\n  verdict: { outcome: 'pass' | 'fail'; reason: string; checks: Verdict['checks'] } | null;\n  /** Advisory silence timestamp from VerdictEngine — not part of task status semantics. */\n  idleSince?: string | null;\n};\n\nexport type SerializedTask = {\n  id: string;\n  order: number;\n  title: string;\n  type: string;\n  description: string;\n  dependencies: string[];\n  assignedRunner: RunnerId;\n  assignedModel: Task['assignedModel'] | null;\n  taskMode: string;\n  prompt: string | null;\n  subtasks: SerializedTask[];\n  userSteps: Task['userSteps'];\n  thinkingEffort: Task['thinkingEffort'];\n  autonomy: Task['autonomy'];\n  sliceType: Task['sliceType'];\n  userStoriesCovered: Task['userStoriesCovered'];\n};\n\nexport type SerializedPlan = {\n  tasks: SerializedTask[];\n  runners: RunnerId[];\n  generatedAt: string;\n  conversationHistory?: LegacyPlanState['conversationHistory'];\n  prdMarkdown?: string;\n  queuedMessages?: QueuedMessage[];\n};\n\nexport type SessionMessage =\n  | { type: 'plan_generated'; plan: SerializedPlan; goal: string; runners: RunnerId[] }\n  | { type: 'planner_message'; content: string; timestamp: string }\n  | { type: 'status_update'; tasks: SerializedTaskStatus[] }\n  | { type: 'review_needed'; tasks: SerializedTask[] }\n  | { type: 'review_approved' }\n  | { type: 'checkpoint'; taskId: string; taskTitle: string; summary: string }\n  | { type: 'execution_complete'; summary: { total: number; completed: number; failed: number } }\n  | { type: 'execution_stopped' }\n  | { type: 'queue_ready' }\n  | { type: 'task_updated'; taskId: string; changes: Record<string, unknown> }\n  | { type: 'task_started'; taskId: string; order: number; title: string; runner: RunnerId; modelId?: string }\n  | { type: 'task_output'; taskId: string; text: string }\n  | { type: 'plan_thinking'; text: string }\n  // Carries no content — see `ResearchProgress['liveness']`. Exists only so a\n  // surface's idle watchdog sees the harness process working even during a\n  // stretch that produces nothing visible.\n  | { type: 'planner_liveness' }\n  // `toolLabel` carries a harness planner's own name for the tool (ADR-0009) —\n  // always set when `tool` is `agent_tool`, so no surface has to render the\n  // catch-all member name at the user.\n  | { type: 'research_step'; tool: string; toolLabel?: string; args: string; subagentId?: string; toolCallId?: string }\n  | { type: 'plan_token'; token: string }\n  | { type: 'research_step_done'; step: ResearchStep; subagentId?: string }\n  // Planner research wants something outside its default envelope and is\n  // blocked until a human answers. Broadcast rather than returned, because the\n  // human may be on any surface (or several at once) and the request outlives\n  // whichever HTTP call triggered it.\n  | { type: 'approval_request'; id: string; kind: ApprovalKind; subject: string; scope: string; detail?: string }\n  | { type: 'approval_settled'; id: string; granted: boolean }\n  // A decision reached with no round-trip prompt: pre-approved via config,\n  // remembered from earlier in this session, or the operator's mode floor\n  // (allow/deny skipping the human entirely). The interactive path above\n  // already has full visibility via approval_request/approval_settled; this\n  // is the one that previously had none — a model silently auto-running\n  // `npm test` because the scope was already granted looked identical, from\n  // every UI, to it never having been asked in the first place.\n  | {\n      type: 'approval_decided';\n      kind: ApprovalKind;\n      subject: string;\n      scope: string;\n      detail?: string;\n      granted: boolean;\n      source: Exclude<ApprovalSource, 'asked'>;\n    };\n\nexport type SessionBroadcaster = (msg: SessionMessage) => void;\n\nexport function serializeTask(t: Task): SerializedTask {\n  return {\n    id: t.id,\n    order: t.order,\n    title: t.title,\n    type: t.type,\n    description: t.description,\n    dependencies: t.dependencies || [],\n    assignedRunner: t.assignedRunner,\n    assignedModel: t.assignedModel || null,\n    taskMode: t.taskMode || 'build',\n    prompt: t.prompt || null,\n    subtasks: (t.subtasks || []).map(serializeTask),\n    userSteps: t.userSteps || undefined,\n    thinkingEffort: t.thinkingEffort || undefined,\n    autonomy: t.autonomy || undefined,\n    sliceType: t.sliceType || undefined,\n    userStoriesCovered: t.userStoriesCovered || undefined,\n  };\n}\n\nexport function serializeTaskStatus(t: Task, idleSince: string | null = null): SerializedTaskStatus {\n  return {\n    id: t.id,\n    status: t.status,\n    verdict: t.verdict\n      ? { outcome: t.verdict.outcome, reason: t.verdict.reason, checks: t.verdict.checks || [] }\n      : null,\n    idleSince,\n  };\n}\n\nexport function serializePlan(plan: LegacyPlanState): SerializedPlan {\n  return {\n    tasks: plan.tasks.map(serializeTask),\n    runners: plan.runners,\n    generatedAt: plan.generatedAt,\n    conversationHistory: plan.conversationHistory,\n    prdMarkdown: plan.prdMarkdown,\n    queuedMessages: plan.queuedMessages,\n  };\n}\n\nexport function executionSummary(tasks: Task[]): { total: number; completed: number; failed: number } {\n  return {\n    total: tasks.length,\n    completed: tasks.filter((t) => t.status === 'completed').length,\n    failed: tasks.filter((t) => t.status === 'failed').length,\n  };\n}\n\nexport const CHECKPOINT_TRUNCATE_LENGTH = 120;\n\n/** Truncate a checkpoint summary to a single line of at most CHECKPOINT_TRUNCATE_LENGTH chars. */\nexport function truncateCheckpointSummary(summary: string): string {\n  // Take the first line only (checkpoint summaries often contain reasoning across lines)\n  const firstLine = summary.split('\\n')[0].trim();\n  if (firstLine.length <= CHECKPOINT_TRUNCATE_LENGTH) return firstLine;\n  return firstLine.slice(0, CHECKPOINT_TRUNCATE_LENGTH - 1) + '…';\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,kBAA6B;AAsI7B,SAAS,YAAY,OAA8B;AACjD,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAQ,CAAC,OAA8B;AAC3C,QAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,QAAI,SAAS,IAAI,EAAE,EAAG,QAAO;AAC7B,aAAS,IAAI,EAAE;AACf,eAAW,OAAO,KAAK,IAAI,EAAE,GAAG,gBAAgB,CAAC,GAAG;AAClD,YAAM,MAAM,MAAM,GAAG;AACrB,UAAI,IAAK,QAAO;AAAA,IAClB;AACA,aAAS,OAAO,EAAE;AAClB,SAAK,IAAI,EAAE;AACX,WAAO;AAAA,EACT;AACA,aAAW,KAAK,OAAO;AACrB,UAAM,MAAM,MAAM,EAAE,EAAE;AACtB,QAAI,IAAK,QAAO,KAAK,IAAI,GAAG,GAAG,SAAS;AAAA,EAC1C;AACA,SAAO;AACT;AAuFO,SAAS,cAAc,OAAe,aAAwD;AACnG,MAAI,YAAY,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO,qCAAqC;AAC5F,QAAM,QAAQ,IAAI,IAAI,WAAW;AACjC,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE,EAAE,CAAC;AACnD,MAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO,iDAAiD;AACpG,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,WAAW,cAAe,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,EAAE,KAAK,oCAAoC;AAC1G,QAAI,EAAE,WAAW,YAAa,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,EAAE,KAAK,sCAAsC;AAAA,EAC5G;AACA,QAAM,UAAU,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC7D,QAAM,aAAa;AACnB,QAAM,MAAc,MACjB,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC,EAC9B,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,cAAc,EAAE,aAAa,IAAI,CAAC,MAAO,MAAM,IAAI,CAAC,IAAI,aAAa,CAAE,EAAE,OAAO,CAAC,MAAM,MAAM,EAAE,EAAE,EAAE,EAAE;AAC5H,QAAM,YAAY,CAAC,GAAG,IAAI,IAAI,QAAQ,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;AAClG,MAAI,KAAK,EAAE,GAAG,QAAQ,CAAC,GAAG,IAAI,YAAY,OAAO,iBAAiB,OAAO,QAAQ,CAAC,EAAE,OAAO,cAAc,UAAU,CAAC;AACpH,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,MAAO,QAAO,EAAE,IAAI,OAAO,OAAO,sDAAsD,KAAK,IAAI;AACrG,SAAO,EAAE,IAAI,KAAK;AACpB;AAiBO,SAAS,aAA6D,OAAY,QAAqB;AAC5G,SAAO,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,UAAU,EAAE,aAAa,SAAS,MAAM,CAAC;AAC/E;AAUO,SAAS,qBAA8D,OAAY,QAAsB;AAC9G,MAAI,CAAC,OAAQ,QAAO,CAAC,GAAG,KAAK;AAC7B,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,SAAO,SAAS,MAAM,OAAO,CAAC,MAAM,EAAE,QAAQ,OAAO,KAAK,IAAI,CAAC;AACjE;AAGO,SAAS,mBACd,OACA,QACA,cACiC;AACjC,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,MAAI,CAAC,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,iBAAiB;AACzD,QAAM,UAAU,IAAI,IAAI,qBAAqB,OAAO,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC5E,aAAW,OAAO,cAAc;AAC9B,QAAI,QAAQ,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,4BAA4B;AAC3F,UAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,GAAG;AAC5C,QAAI,CAAC,MAAO,QAAO,EAAE,IAAI,OAAO,OAAO,uBAAuB,GAAG,IAAI;AACrE,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,aAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,uBAAuB,MAAM,KAAK,sCAAsC;AAAA,IACrH;AAAA,EACF;AACA,SAAO,EAAE,IAAI,KAAK;AACpB;AAGO,SAAS,aAAa,OAAe,QAAiD;AAC3F,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,MAAI,CAAC,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,iBAAiB;AACzD,MAAI,OAAO,WAAW,cAAe,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,mCAAmC;AACnH,MAAI,OAAO,WAAW,YAAa,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,qCAAqC;AACnH,SAAO,EAAE,IAAI,KAAK;AACpB;;;ACzTA,SAAS,UAAU,MAAc,KAAqB;AACpD,QAAM,UAAU,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAC/C,SAAO,QAAQ,SAAS,MAAM,GAAG,QAAQ,MAAM,GAAG,GAAG,CAAC,WAAM;AAC9D;AAQO,SAAS,kBAAkB,MAAc,UAAkB,WAA4B;AAC5F,QAAM,UAAU,WAAW,KAAK,KAAK;AACrC,MAAI,SAAS,cAAc;AAGzB,QAAI;AACF,YAAM,OAAO,KAAK,MAAM,QAAQ;AAChC,YAAM,OAAO,KAAK,QAAQ,KAAK,aAAa,KAAK,YAAY,KAAK,WAAW,KAAK,SAAS,KAAK,OAAO,KAAK;AAC5G,UAAI,KAAM,QAAO,GAAG,OAAO,IAAI,UAAU,OAAO,IAAI,GAAG,EAAE,CAAC;AAAA,IAC5D,QAAQ;AAAA,IAER;AACA,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,wBAAwB;AACnC,QAAI;AACF,YAAM,OAAO,KAAK,MAAM,QAAQ;AAChC,YAAM,SAAS,OAAO,KAAK,WAAW,WAAW,KAAK,SAAS;AAC/D,YAAM,UAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACjD,aAAO,WAAW,QAAQ,MAAM,GAAG,EAAE,CAAC,GAAG,QAAQ,SAAS,KAAK,WAAM,EAAE;AAAA,IACzE,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI;AACF,UAAM,OAAO,KAAK,MAAM,QAAQ;AAIhC,QAAI,SAAS,iBAAiB,KAAK,QAAQ;AACzC,aAAO,eAAe,KAAK,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK,QAAQ,MAAM,EAAE;AAAA,IAChF;AACA,QAAI,SAAS,gBAAgB,KAAK,OAAO;AACvC,aAAO,eAAe,UAAU,OAAO,KAAK,KAAK,GAAG,EAAE,CAAC;AAAA,IACzD;AACA,QAAI,SAAS,WAAW,KAAK,KAAK;AAChC,aAAO,SAAS,UAAU,OAAO,KAAK,GAAG,GAAG,EAAE,CAAC;AAAA,IACjD;AAGA,QAAI,SAAS,UAAU,KAAK,SAAS;AACnC,aAAO,QAAQ,UAAU,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC;AAAA,IACpD;AACA,QAAI,SAAS,UAAU,KAAK,SAAS;AACnC,YAAM,OAAO,KAAK,eAAe,KAAK,gBAAgB,YAAY,KAAK,KAAK,WAAW,MAAM;AAC7F,YAAM,QAAQ,KAAK,UAAU,OAAO,KAAK,OAAO,KAAK;AACrD,aAAO,QAAQ,UAAU,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI;AAAA,IACnE;AAEA,UAAM,OAAO,KAAK,YAAY,KAAK,aAAa,KAAK;AACrD,QAAI,MAAM;AACR,YAAM,WAAW,OAAO,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK,OAAO,IAAI;AAC7D,aAAO,GAAG,OAAO,IAAI,QAAQ;AAAA,IAC/B;AACA,QAAI,KAAK,SAAS;AAChB,aAAO,GAAG,OAAO,IAAI,KAAK,OAAO;AAAA,IACnC;AACA,QAAI,KAAK,SAAS;AAChB,aAAO,SAAS,OAAO,KAAK,OAAO,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IACnD;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;;;ACqDO,IAAM,6BAA6B;AAGnC,SAAS,0BAA0B,SAAyB;AAEjE,QAAM,YAAY,QAAQ,MAAM,IAAI,EAAE,CAAC,EAAE,KAAK;AAC9C,MAAI,UAAU,UAAU,2BAA4B,QAAO;AAC3D,SAAO,UAAU,MAAM,GAAG,6BAA6B,CAAC,IAAI;AAC9D;","names":[]}
+{"version":3,"sources":["../src/plan-utils.ts","../src/services/TaskOps.ts","../src/services/researchStepSummary.ts","../src/services/SessionMessage.ts","../src/services/isolationRecord.ts"],"sourcesContent":["/**\n * Browser-safe entry point: pure plan-validation utilities with no Node or\n * AI-service dependencies. UI surfaces (the VS Code webview runs in a browser)\n * import runtime values from here instead of the main barrel, which bundles the\n * Gemini/OpenAI services and their `fs`/`child_process` imports.\n */\nexport { canMergeTasks, canSplitTask, canSetDependencies, dependencyCandidates, dependentsOf } from './services/TaskOps';\nexport type { TaskRef } from './services/TaskOps';\nexport { summarizeToolCall } from './services/researchStepSummary';\nexport { truncateCheckpointSummary, CHECKPOINT_TRUNCATE_LENGTH } from './services/SessionMessage';\nexport { capConflictFiles } from './services/isolationRecord';\n","import { v4 as uuidv4 } from 'uuid';\nimport {\n  Task, RunnerId, flattenTasks,\n  addTaskToPlan, removeTaskFromPlan, updateTaskInPlan, renumberTasks,\n  createTask,\n} from '../models/Task';\nimport { extractObjectsWithKey, stripTrailingCommas, escapeControlCharsInStrings, PlanParseError, TASK_OPS_ENVELOPE_KEY } from './JsonExtractor';\nimport { validateTaskEdit, checkModelAndModeValidity, type EditCatalog } from './TaskEditValidator';\n\n/**\n * Targeted task edits emitted by the planner conversation (the 'task_ops'\n * ConversationTurn). Task references accept a task id, a \"#<order>\" ref, or a\n * bare order number — cheap models rarely echo UUIDs correctly.\n */\nexport type TaskOp =\n  | { op: 'update'; taskId: string; changes: Partial<Task> }\n  | { op: 'add'; task: Partial<Task>; handle?: string }\n  | { op: 'remove'; taskId: string }\n  | { op: 'reorder'; taskIds: string[] }\n  | { op: 'merge'; taskIds: string[]; merged: Partial<Task>; handle?: string }\n  | { op: 'split'; taskId: string; parts: Partial<Task>[]; handle?: string }\n  | { op: 'rearm'; taskId: string; changes?: Partial<Task> };\n\n/** Fields the planner may change on an existing task. Everything else (id, status, verdict…) is system-owned. */\nexport const UPDATABLE_FIELDS: (keyof Task)[] = [\n  'title', 'description', 'prompt', 'dependencies', 'assignedRunner', 'assignedModel', 'taskMode', 'thinkingEffort', 'type', 'userSteps', 'autonomy', 'sliceType',\n];\n\n/**\n * The edit protocol as the planner reads it, kept beside the applier so the\n * prose can never undersell (or oversell) what {@link applyTaskOps} accepts.\n * `executionNote` rides on the ordering rule because that is the rule a\n * running execution changes.\n */\nexport function taskOpsProtocol(executionNote = ''): string[] {\n  const updateChanges = UPDATABLE_FIELDS\n    .map((f) => (f === 'dependencies' ? '\"dependencies\"?:[\"<id or #order>\"]' : `\"${f}\"?`))\n    .join(',');\n  return [\n    '- To modify specific tasks, reply with ONLY this JSON object:',\n    '  {\"taskOps\": [',\n    `    {\"op\":\"update\",\"taskId\":\"<id or #order>\",\"changes\":{${updateChanges}}},`,\n    '    {\"op\":\"add\",\"task\":{\"title\",\"description\",\"prompt\",\"dependencies\":[\"<id or #order>\"],\"assignedRunner\"?,\"assignedModel\"?},\"handle\"?:\"<name>\"},',\n    '    {\"op\":\"remove\",\"taskId\":\"<id or #order>\"},',\n    '    {\"op\":\"reorder\",\"taskIds\":[\"<id or #order>\", \"... every task exactly once\"]},   // only to re-prioritise INDEPENDENT tasks',\n    '    {\"op\":\"merge\",\"taskIds\":[\"<id or #order>\", \"...\"],\"merged\":{\"title\",\"description\",\"prompt\"?,\"assignedRunner\"?,\"assignedModel\"?,...},\"handle\"?:\"<name>\"},',\n    '    {\"op\":\"split\",\"taskId\":\"<id or #order>\",\"parts\":[{\"title\",\"description\",\"prompt\"?,\"assignedRunner\"?,\"assignedModel\"?,...}, ...],\"handle\"?:\"<name>\"},',\n    `    {\"op\":\"rearm\",\"taskId\":\"<id or #order>\",\"changes\"?:{${updateChanges}}}`,\n    '  ]}',\n    '- For sweeping changes, you may instead emit a full {\"tasks\":[...]} plan JSON.',\n    'Every \"<id or #order>\" ref in a batch resolves against the plan shown above, before any op in the batch runs — an earlier remove/merge/split never shifts what a later \"#N\" means.',\n    'Give \"add\", \"merge\", or \"split\" a \"handle\" (any name you choose, unused elsewhere in this batch) to let a LATER op in the same batch reference the task it produces — for \"split\", the handle names its last part. A handle used before its defining op is rejected.',\n    'When creating or changing tasks, set \"assignedRunner\" and \"assignedModel\" ({\"modelId\",\"modelLabel\",\"thinkingEffort\"?}) using only the runners and models listed in <available_models>.',\n    'Keep dependencies consistent: no cycles, no references to removed tasks, and never touch running or completed tasks — \"rearm\" is the one exception, below.',\n    'Just declare the dependencies you want — display order is repaired for you afterwards, so a rewire or a newly added prerequisite never needs a \"reorder\" op. Only a task that is running or completed cannot be shifted, so an edit that would need one to move is rejected.' + executionNote,\n    'Flipping \"type\" between \"ai\" and \"user\" is a content change, not just a label: an update to \"user\" needs \"userSteps\" in the SAME op, and an update to \"ai\" needs \"prompt\" in the SAME op — the model/mode/effort/autonomy fields (flipping to \"user\") or the userSteps (flipping to \"ai\") are cleared automatically.',\n    '\"rearm\" puts a failed OR completed task back to pending — verdict and output summary are cleared, any dependents it had blocked are released, and it may carry field changes (e.g. a corrected \"prompt\") applied in the same op. A running task cannot be re-armed. Never rearm a task just to relabel it — only when it should actually run again.',\n  ];\n}\n\nexport function textHasTaskOps(text: string): boolean {\n  return text.includes(`\"${TASK_OPS_ENVELOPE_KEY}\"`);\n}\n\n/** Parse a `{\"taskOps\":[...]}` reply. Throws PlanParseError when the JSON is unusable. */\nexport function parseTaskOpsJson(text: string): TaskOp[] {\n  // Extract by the taskOps key specifically — a reply may also carry a\n  // tasks-keyed object (schema echo, example), which must not shadow the ops.\n  // Candidates are tried back to front: the last emission is the final answer.\n  const { matches, fallback } = extractObjectsWithKey(text, TASK_OPS_ENVELOPE_KEY);\n  const candidates = matches.length > 0 ? [...matches].reverse() : [fallback.json];\n\n  let lastError: PlanParseError | null = null;\n  for (const json of candidates) {\n    try {\n      return parseTaskOpsObject(json, text);\n    } catch (err) {\n      if (!(err instanceof PlanParseError)) throw err;\n      if (!lastError) lastError = err;\n    }\n  }\n  throw lastError ?? new PlanParseError('No JSON object found in task-ops reply', text);\n}\n\nfunction parseTaskOpsObject(json: string, text: string): TaskOp[] {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(escapeControlCharsInStrings(stripTrailingCommas(json)));\n  } catch (err) {\n    throw new PlanParseError(`Task-ops JSON is invalid: ${err instanceof Error ? err.message : String(err)}`, text);\n  }\n  const ops = (parsed as { taskOps?: unknown }).taskOps;\n  if (!Array.isArray(ops) || ops.length === 0) {\n    throw new PlanParseError('\"taskOps\" must be a non-empty array', text);\n  }\n  for (const op of ops) {\n    if (typeof op !== 'object' || op === null || typeof (op as { op?: unknown }).op !== 'string') {\n      throw new PlanParseError('Every task op needs an \"op\" field (update | add | remove | reorder | merge | split)', text);\n    }\n  }\n  return ops as TaskOp[];\n}\n\ntype RefResolution = { id: string } | { error: string };\n\n/**\n * Resolve a task reference (id, \"#3\", \"3\", or a batch handle) to a task id.\n *\n * `#order` and title matches are pinned to `originalScope` — the plan as it\n * stood before the batch began — so an earlier op's renumbering can never\n * make a later op's \"#4\" land on a different task than the planner saw. A\n * literal id has no such drift (ids are stable across mutations), so id\n * matches check `liveScope` — the batch's current, mutated tasks — which is\n * also how a later op reaches a task created earlier in the same batch\n * without a handle (e.g. a split's own chained parts).\n */\nfunction resolveRef(\n  ref: unknown,\n  originalScope: Task[],\n  liveScope: Task[],\n  handleOwner: Map<string, number>,\n  handleId: Map<string, string>,\n  opIndex: number,\n): RefResolution {\n  if (typeof ref !== 'string' && typeof ref !== 'number') return { error: `invalid reference \"${String(ref)}\"` };\n  const s = String(ref).trim();\n\n  const ownerIdx = handleOwner.get(s);\n  if (ownerIdx !== undefined) {\n    if (ownerIdx >= opIndex) {\n      return { error: `handle \"${s}\" is defined later in this batch (op ${ownerIdx + 1}) and cannot be referenced yet` };\n    }\n    const id = handleId.get(s);\n    if (!id) return { error: `handle \"${s}\" was never resolved` };\n    return { id };\n  }\n\n  const byLiveId = liveScope.find((t) => t.id === s);\n  if (byLiveId) return { id: byLiveId.id };\n  const orderStr = s.startsWith('#') ? s.slice(1) : s;\n  if (/^\\d+$/.test(orderStr)) {\n    const order = Number(orderStr);\n    const byOrder = originalScope.filter((t) => t.order === order);\n    if (byOrder.length === 1) return { id: byOrder[0].id };\n  }\n  const byTitle = originalScope.find((t) => t.title === s);\n  if (byTitle) return { id: byTitle.id };\n  return { error: `task \"${s}\" not found` };\n}\n\n/** Whether `name` already denotes an existing task by id, `#order`, or title. */\nfunction refCollidesWithExisting(name: string, originalFlatAll: Task[]): boolean {\n  if (originalFlatAll.some((t) => t.id === name)) return true;\n  const orderStr = name.startsWith('#') ? name.slice(1) : name;\n  if (/^\\d+$/.test(orderStr) && originalFlatAll.some((t) => t.order === Number(orderStr))) return true;\n  return originalFlatAll.some((t) => t.title === name);\n}\n\nfunction findInTasks(tasks: Task[], id: string): Task | undefined {\n  return flattenTasks(tasks).find((t) => t.id === id);\n}\n\nfunction findTopLevel(tasks: Task[], id: string): Task | undefined {\n  return tasks.find((t) => t.id === id);\n}\n\nfunction detectCycle(tasks: Task[]): string | null {\n  const byId = new Map(tasks.map((t) => [t.id, t]));\n  const visiting = new Set<string>();\n  const done = new Set<string>();\n  const visit = (id: string): string | null => {\n    if (done.has(id)) return null;\n    if (visiting.has(id)) return id;\n    visiting.add(id);\n    for (const dep of byId.get(id)?.dependencies ?? []) {\n      const hit = visit(dep);\n      if (hit) return hit;\n    }\n    visiting.delete(id);\n    done.add(id);\n    return null;\n  };\n  for (const t of tasks) {\n    const hit = visit(t.id);\n    if (hit) return byId.get(hit)?.title ?? hit;\n  }\n  return null;\n}\n\n/** A task the repair may not reposition: execution has already reached it. */\nfunction isPinned(t: Task): boolean {\n  return t.status === 'in_progress' || t.status === 'completed';\n}\n\n/**\n * Reorder top-level tasks so every dependency comes before its dependents,\n * moving as little as possible: pinned tasks keep the exact slot they are in,\n * and each free slot goes to the earliest-listed movable task whose\n * dependencies are already placed — so tasks the graph does not constrain keep\n * their relative order. Assumes an acyclic graph (the caller checks first).\n */\nfunction repairOrder(tasks: Task[]): { tasks: Task[] } | { error: string } {\n  const byId = new Map(tasks.map((t) => [t.id, t]));\n  const placed = new Set<string>();\n  const movable = tasks.filter((t) => !isPinned(t));\n  const result: Task[] = [];\n  // Dependencies outside this list (a subtask id) constrain nothing here.\n  const blockerOf = (t: Task): Task | undefined => {\n    const id = t.dependencies.find((d) => byId.has(d) && !placed.has(d));\n    return id ? byId.get(id) : undefined;\n  };\n  const place = (t: Task) => { result.push(t); placed.add(t.id); };\n\n  for (const occupant of tasks) {\n    if (isPinned(occupant)) {\n      const blocker = blockerOf(occupant);\n      if (blocker) return { error: pinnedRefusal(blocker, occupant, 'before') };\n      place(occupant);\n      continue;\n    }\n    const next = movable.findIndex((t) => !blockerOf(t));\n    if (next < 0) {\n      // Nothing is schedulable and the graph is acyclic, so every movable task\n      // left waits — directly or through others — on a pinned task further down\n      // that would have to come up to free this slot.\n      const [stuck, pin] = trailToPin(movable[0], blockerOf);\n      return { error: pinnedRefusal(stuck, pin, 'after') };\n    }\n    place(movable.splice(next, 1)[0]);\n  }\n  return { tasks: result };\n}\n\n/** Walk the waiting-on chain from `task` down to the pinned task holding it up. */\nfunction trailToPin(task: Task, blockerOf: (t: Task) => Task | undefined): [Task, Task] {\n  let at = task;\n  for (;;) {\n    const blocker = blockerOf(at);\n    if (!blocker || isPinned(blocker)) return [at, blocker ?? at];\n    at = blocker;\n  }\n}\n\n/** `\"B\" #2→#1, \"A\" #1→#3` for every task the repair actually moved, or null. */\nfunction describeMoves(before: Task[], after: Task[]): string | null {\n  const wasAt = new Map(before.map((t, i) => [t.id, i + 1]));\n  const moved = after\n    .map((t, i) => ({ t, from: wasAt.get(t.id)!, to: i + 1 }))\n    .filter((m) => m.from !== m.to);\n  return moved.length ? moved.map((m) => `\"${m.t.title}\" #${m.from}→#${m.to}`).join(', ') : null;\n}\n\nfunction pinnedRefusal(other: Task, pin: Task, side: 'before' | 'after'): string {\n  const word = pin.status === 'in_progress' ? 'running' : 'completed';\n  return `\"${other.title}\" would have to run ${side} \"${pin.title}\", which is ${word} and cannot be moved`;\n}\n\nexport interface ApplyTaskOpsResult {\n  ok: boolean;\n  tasks: Task[];\n  errors: string[];\n  /** Human-readable summary of what changed, for the chat transcript. */\n  summary: string[];\n}\n\n/**\n * Pre-flight check for a merge: would collapsing the selected tasks into one\n * (rewiring every dependent of any selected task to the survivor) keep the\n * dependency graph valid? Rejects locked tasks and merges whose rewiring would\n * introduce a cycle. Display order is NOT checked here — neither\n * consecutiveness (a UI concern) nor a dependency the merge pulls out of order,\n * which {@link applyTaskOps} repairs; refusing on order would make this\n * pre-flight stricter than the applier it stands in for.\n */\nexport function canMergeTasks(tasks: Task[], selectedIds: string[]): { ok: boolean; error?: string } {\n  if (selectedIds.length < 2) return { ok: false, error: 'Select at least two tasks to merge' };\n  const idSet = new Set(selectedIds);\n  const toMerge = tasks.filter((t) => idSet.has(t.id));\n  if (toMerge.length < 2) return { ok: false, error: 'At least two valid tasks are required to merge' };\n  for (const t of toMerge) {\n    if (t.status === 'in_progress') return { ok: false, error: `\"${t.title}\" is running and cannot be merged` };\n    if (t.status === 'completed') return { ok: false, error: `\"${t.title}\" is completed and cannot be merged` };\n  }\n  const ordered = [...toMerge].sort((a, b) => a.order - b.order);\n  const survivorId = '__merge_sim__';\n  const sim: Task[] = tasks\n    .filter((t) => !idSet.has(t.id))\n    .map((t) => ({ ...t, dependencies: t.dependencies.map((d) => (idSet.has(d) ? survivorId : d)).filter((d) => d !== t.id) }));\n  const unionDeps = [...new Set(toMerge.flatMap((t) => t.dependencies))].filter((d) => !idSet.has(d));\n  sim.push({ ...ordered[0], id: survivorId, title: '__merge_sim__', order: ordered[0].order, dependencies: unionDeps });\n  const cycle = detectCycle(sim);\n  if (cycle) return { ok: false, error: `Merging would create a dependency cycle involving \"${cycle}\"` };\n  return { ok: true };\n}\n\n/**\n * The shape the dependency helpers below read. Structural rather than `Task`,\n * because the TUI projects tasks into its own `TaskView`: a surface's\n * dependency picker and the API's validation must agree on which dependencies\n * are legal, and a signature only core can satisfy would have forced the TUI\n * to keep a second copy of the rule.\n */\nexport interface TaskRef {\n  id: string;\n  order: number;\n  title: string;\n  dependencies: string[];\n}\n\n/** The tasks listing `taskId` as a dependency — exactly what removing it detaches. */\nexport function dependentsOf<T extends Pick<TaskRef, 'id' | 'dependencies'>>(tasks: T[], taskId: string): T[] {\n  return tasks.filter((t) => t.id !== taskId && t.dependencies.includes(taskId));\n}\n\n/**\n * The tasks that may become dependencies of `taskId`: those displayed before it.\n *\n * Offering only earlier tasks is what keeps a hand-edited graph valid without a\n * cycle check — dependencies then only ever point backwards in display order,\n * the same invariant `applyTaskOps` enforces. Omit `taskId` for a task that does\n * not exist yet: it lands last, so every current task is a candidate.\n */\nexport function dependencyCandidates<T extends Pick<TaskRef, 'id' | 'order'>>(tasks: T[], taskId?: string): T[] {\n  if (!taskId) return [...tasks];\n  const target = tasks.find((t) => t.id === taskId);\n  return target ? tasks.filter((t) => t.order < target.order) : [];\n}\n\n/** Pre-flight check for a hand-edited dependency list: every id exists and comes earlier. */\nexport function canSetDependencies<T extends TaskRef>(\n  tasks: T[],\n  taskId: string,\n  dependencies: string[],\n): { ok: boolean; error?: string } {\n  const target = tasks.find((t) => t.id === taskId);\n  if (!target) return { ok: false, error: 'Task not found' };\n  const allowed = new Set(dependencyCandidates(tasks, taskId).map((t) => t.id));\n  for (const dep of dependencies) {\n    if (dep === taskId) return { ok: false, error: `\"${target.title}\" cannot depend on itself` };\n    const found = tasks.find((t) => t.id === dep);\n    if (!found) return { ok: false, error: `Unknown dependency \"${dep}\"` };\n    if (!allowed.has(dep)) {\n      return { ok: false, error: `\"${target.title}\" cannot depend on \"${found.title}\", which comes after it in the plan` };\n    }\n  }\n  return { ok: true };\n}\n\n/** Pre-flight check for a split: the task exists and is not locked by execution. */\nexport function canSplitTask(tasks: Task[], taskId: string): { ok: boolean; error?: string } {\n  const target = tasks.find((t) => t.id === taskId);\n  if (!target) return { ok: false, error: 'Task not found' };\n  if (target.status === 'in_progress') return { ok: false, error: `\"${target.title}\" is running and cannot be split` };\n  if (target.status === 'completed') return { ok: false, error: `\"${target.title}\" is completed and cannot be split` };\n  return { ok: true };\n}\n\n/**\n * Apply task ops to a snapshot of the plan, atomically: either every op\n * applies and the result validates (deps resolve, no cycles, running and\n * completed tasks untouched), or nothing is returned and `errors` explains\n * why. The caller commits `tasks` on ok.\n */\nexport function applyTaskOps(currentTasks: Task[], ops: TaskOp[], runners: RunnerId[], catalog?: EditCatalog): ApplyTaskOpsResult {\n  let tasks: Task[] = JSON.parse(JSON.stringify(currentTasks));\n  const errors: string[] = [];\n  const summary: string[] = [];\n\n  // Frozen snapshot every ref resolves `#order`/title matches against, so an\n  // earlier op's renumbering can never shift what a later op's \"#N\" means.\n  const originalFlatAll = flattenTasks(currentTasks);\n\n  // Batch handles: planner-chosen names for a task an add/merge/split op is\n  // about to create, so a later op in the same batch can reference it before\n  // it has a real id. Pre-scanned up front — a bad handle refuses the whole\n  // batch before anything mutates.\n  const handleOwner = new Map<string, number>();\n  const handleId = new Map<string, string>();\n  for (const [i, op] of ops.entries()) {\n    const handle = (op as { handle?: unknown }).handle;\n    if (handle === undefined) continue;\n    if (typeof handle !== 'string' || !handle.trim()) {\n      errors.push(`op ${i + 1} (${op.op}): handle must be a non-empty string`);\n      continue;\n    }\n    if (handleOwner.has(handle)) {\n      errors.push(`op ${i + 1} (${op.op}): handle \"${handle}\" is already used earlier in this batch`);\n      continue;\n    }\n    if (refCollidesWithExisting(handle, originalFlatAll)) {\n      errors.push(`op ${i + 1} (${op.op}): handle \"${handle}\" collides with an existing task reference`);\n      continue;\n    }\n    handleOwner.set(handle, i);\n  }\n  if (errors.length) return { ok: false, tasks: currentTasks, errors, summary: [] };\n\n  const resolveDeps = (deps: unknown, opIndex: number): { ids: string[]; bad: string[] } => {\n    const ids: string[] = [];\n    const bad: string[] = [];\n    const liveFlat = flattenTasks(tasks);\n    for (const d of Array.isArray(deps) ? deps : []) {\n      const r = resolveRef(d, originalFlatAll, liveFlat, handleOwner, handleId, opIndex);\n      if ('error' in r) { bad.push(`${String(d)} (${r.error})`); continue; }\n      if (!liveFlat.some((t) => t.id === r.id)) { bad.push(`${String(d)} (no longer exists in this batch)`); continue; }\n      ids.push(r.id);\n    }\n    return { ids, bad };\n  };\n\n  for (const [i, op] of ops.entries()) {\n    const label = `op ${i + 1} (${op.op})`;\n    switch (op.op) {\n      case 'update': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        const changes: Partial<Task> = {};\n        for (const key of UPDATABLE_FIELDS) {\n          if (op.changes && key in op.changes) (changes as Record<string, unknown>)[key] = (op.changes as Record<string, unknown>)[key];\n        }\n        if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n          errors.push(`${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]`);\n          break;\n        }\n        // Dependency refs are still unresolved (e.g. \"#3\") at this point, so\n        // this check runs on everything but them; resolveDeps below handles\n        // dependency well-formedness once they're real ids.\n        const changesForCheck: Partial<Task> = { ...changes };\n        delete changesForCheck.dependencies;\n        const check = validateTaskEdit('planner', flattenTasks(tasks), target.id, changesForCheck, catalog);\n        if (!check.ok) { errors.push(`${label}: ${check.error}`); break; }\n        for (const field of check.clear ?? []) (changes as Record<string, unknown>)[field] = undefined;\n        if ('dependencies' in changes) {\n          const { ids, bad } = resolveDeps(changes.dependencies, i);\n          if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n          changes.dependencies = ids.filter((id) => id !== target.id);\n        }\n        if (Object.keys(changes).length === 0) { errors.push(`${label}: no valid changes provided`); break; }\n        tasks = updateTaskInPlan(tasks, target.id, changes);\n        const clearedNote = check.clear?.length ? `; cleared ${check.clear.join(', ')}` : '';\n        summary.push(`Updated \"${target.title}\" (${Object.keys(changes).join(', ')})${clearedNote}`);\n        break;\n      }\n      case 'add': {\n        const spec = op.task ?? {};\n        if (!spec.title) { errors.push(`${label}: new task needs a title`); break; }\n        const { ids, bad } = resolveDeps(spec.dependencies, i);\n        if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n        const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : runners[0];\n        const validity = checkModelAndModeValidity(runner, spec.assignedModel, spec.taskMode, catalog);\n        if (!validity.ok) { errors.push(`${label}: ${validity.error}`); break; }\n        const newId = uuidv4();\n        tasks = addTaskToPlan(tasks, {\n          ...spec,\n          id: newId,\n          dependencies: ids,\n          assignedRunner: runner,\n          description: spec.description ?? spec.title,\n          prompt: spec.prompt ?? spec.description ?? spec.title,\n        });\n        if (op.handle) handleId.set(op.handle, newId);\n        summary.push(`Added \"${spec.title}\"`);\n        break;\n      }\n      case 'remove': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be removed`); break; }\n        if (target.status === 'completed') { errors.push(`${label}: \"${target.title}\" is completed and cannot be removed`); break; }\n        tasks = removeTaskFromPlan(tasks, target.id);\n        summary.push(`Removed \"${target.title}\"`);\n        break;\n      }\n      case 'reorder': {\n        const refs = (op.taskIds ?? []).map((r) => resolveRef(r, currentTasks, tasks, handleOwner, handleId, i));\n        const badRef = refs.find((r): r is { error: string } => 'error' in r);\n        if (badRef) { errors.push(`${label}: ${badRef.error}`); break; }\n        const resolved = (refs as { id: string }[]).map((r) => findTopLevel(tasks, r.id));\n        if (resolved.some((t) => !t)) { errors.push(`${label}: unknown task in reorder list`); break; }\n        const orderIds = resolved.map((t) => t!.id);\n        if (new Set(orderIds).size !== tasks.length) {\n          errors.push(`${label}: reorder must list every top-level task exactly once (${tasks.length} tasks)`);\n          break;\n        }\n        const byId = new Map(tasks.map((t) => [t.id, t]));\n        tasks = renumberTasks(orderIds.map((id) => byId.get(id)!));\n        summary.push('Reordered tasks');\n        break;\n      }\n      case 'merge': {\n        const refs = (op.taskIds ?? []).map((r) => resolveRef(r, currentTasks, tasks, handleOwner, handleId, i));\n        const badRef = refs.find((r): r is { error: string } => 'error' in r);\n        if (badRef) { errors.push(`${label}: ${badRef.error}`); break; }\n        const resolved = (refs as { id: string }[]).map((r) => findTopLevel(tasks, r.id));\n        if (resolved.some((t) => !t)) { errors.push(`${label}: unknown task in merge list (already removed, merged, or split by an earlier op)`); break; }\n        const toMerge = resolved.map((t) => t!).sort((a, b) => a.order - b.order);\n        if (toMerge.length < 2) { errors.push(`${label}: merge needs at least two tasks`); break; }\n        const locked = toMerge.find((t) => t.status === 'in_progress' || t.status === 'completed');\n        if (locked) {\n          errors.push(`${label}: \"${locked.title}\" is ${locked.status === 'in_progress' ? 'running' : 'completed'} and cannot be merged`);\n          break;\n        }\n        const idSet = new Set(toMerge.map((t) => t.id));\n        const unionDepsRaw = [...new Set(toMerge.flatMap((t) => t.dependencies))].filter((d) => !idSet.has(d));\n        const { ids, bad } = resolveDeps(unionDepsRaw, i);\n        if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n        const spec = op.merged ?? {};\n        if (!spec.title) { errors.push(`${label}: merged task needs a title`); break; }\n        const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : toMerge[0].assignedRunner;\n        const mergedTask = createTask({\n          title: spec.title,\n          description: spec.description ?? toMerge.map((t) => t.description).filter(Boolean).join('\\n\\n'),\n          prompt: spec.prompt ?? (toMerge.map((t) => t.prompt).filter(Boolean).join('\\n\\n---\\n\\n') || undefined),\n          type: spec.type ?? (toMerge.some((t) => t.type === 'user') ? 'user' : 'ai'),\n          dependencies: ids,\n          assignedRunner: runner,\n          assignedModel: spec.assignedModel ?? toMerge.find((t) => t.assignedModel)?.assignedModel,\n          thinkingEffort: spec.thinkingEffort ?? toMerge.find((t) => t.thinkingEffort)?.thinkingEffort,\n          taskMode: spec.taskMode ?? toMerge[0].taskMode,\n          autonomy: spec.autonomy ?? toMerge.find((t) => t.autonomy)?.autonomy,\n          sliceType: spec.sliceType ?? toMerge.find((t) => t.sliceType)?.sliceType,\n          userStoriesCovered: spec.userStoriesCovered ?? (toMerge.flatMap((t) => t.userStoriesCovered ?? []).length\n            ? [...new Set(toMerge.flatMap((t) => t.userStoriesCovered ?? []))]\n            : undefined),\n        });\n        const mergedId = mergedTask.id;\n        const firstId = toMerge[0].id;\n        const result: Task[] = [];\n        let inserted = false;\n        for (const t of tasks) {\n          if (idSet.has(t.id)) {\n            if (!inserted && t.id === firstId) { result.push(mergedTask); inserted = true; }\n            continue;\n          }\n          result.push({ ...t, dependencies: t.dependencies.map((d) => (idSet.has(d) ? mergedId : d)) });\n        }\n        if (!inserted) result.push(mergedTask);\n        tasks = renumberTasks(result);\n        if (op.handle) handleId.set(op.handle, mergedId);\n        summary.push(`Merged ${toMerge.length} tasks into \"${spec.title}\"`);\n        break;\n      }\n      case 'split': {\n        const ref = resolveRef(op.taskId, currentTasks, tasks, handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findTopLevel(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" not found`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be split`); break; }\n        if (target.status === 'completed') { errors.push(`${label}: \"${target.title}\" is completed and cannot be split`); break; }\n        const parts = op.parts ?? [];\n        if (parts.length < 2) { errors.push(`${label}: split needs at least two parts`); break; }\n        const newTasks: Task[] = [];\n        let prevId: string | undefined;\n        let buildError = false;\n        for (let p = 0; p < parts.length; p++) {\n          const spec = parts[p];\n          if (!spec || !spec.title) { errors.push(`${label}: split part ${p + 1} needs a title`); buildError = true; break; }\n          // Part 0 inherits the original's (external) dependencies, resolved\n          // against the current plan. Later parts chain onto the previous part\n          // — a sibling id created in this same op, so it needs no resolution.\n          let deps: string[];\n          if (p === 0) {\n            const { ids, bad } = resolveDeps(target.dependencies, i);\n            if (bad.length) { errors.push(`${label}: split part 1 unknown dependencies: ${bad.join(', ')}`); buildError = true; break; }\n            deps = ids;\n          } else {\n            deps = prevId ? [prevId] : [];\n          }\n          const runner = spec.assignedRunner && runners.includes(spec.assignedRunner) ? spec.assignedRunner : target.assignedRunner;\n          const nt = createTask({\n            title: spec.title,\n            description: spec.description ?? spec.title,\n            prompt: spec.prompt ?? spec.description ?? spec.title,\n            type: spec.type ?? target.type,\n            dependencies: deps,\n            assignedRunner: runner,\n            assignedModel: spec.assignedModel ?? target.assignedModel,\n            taskMode: spec.taskMode ?? target.taskMode,\n            autonomy: spec.autonomy ?? target.autonomy,\n            sliceType: spec.sliceType ?? target.sliceType,\n            userStoriesCovered: spec.userStoriesCovered ?? target.userStoriesCovered,\n          });\n          newTasks.push(nt);\n          prevId = nt.id;\n        }\n        if (buildError) break;\n        const tailId = newTasks[newTasks.length - 1].id;\n        const result: Task[] = [];\n        for (const t of tasks) {\n          if (t.id === target.id) { result.push(...newTasks); continue; }\n          result.push({ ...t, dependencies: t.dependencies.map((d) => (d === target.id ? tailId : d)) });\n        }\n        tasks = renumberTasks(result);\n        if (op.handle) handleId.set(op.handle, tailId);\n        summary.push(`Split \"${target.title}\" into ${newTasks.length} tasks`);\n        break;\n      }\n      case 'rearm': {\n        const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, i);\n        if ('error' in ref) { errors.push(`${label}: ${ref.error}`); break; }\n        const target = findInTasks(tasks, ref.id);\n        if (!target) { errors.push(`${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)`); break; }\n        if (target.status === 'in_progress') { errors.push(`${label}: \"${target.title}\" is running and cannot be re-armed`); break; }\n        const changes: Partial<Task> = {};\n        for (const key of UPDATABLE_FIELDS) {\n          if (op.changes && key in op.changes) (changes as Record<string, unknown>)[key] = (op.changes as Record<string, unknown>)[key];\n        }\n        if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n          errors.push(`${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]`);\n          break;\n        }\n        // Validated as a direct edit (not 'planner'): re-arming is the sanctioned\n        // exception to the planner lock — its whole point is to touch a task the\n        // lock would otherwise refuse. Well-formedness (type coherence, model/mode\n        // validity, dependency shape) still applies, same as every other edit.\n        const changesForCheck: Partial<Task> = { ...changes };\n        delete changesForCheck.dependencies;\n        const check = validateTaskEdit('direct', flattenTasks(tasks), target.id, changesForCheck, catalog);\n        if (!check.ok) { errors.push(`${label}: ${check.error}`); break; }\n        for (const field of check.clear ?? []) (changes as Record<string, unknown>)[field] = undefined;\n        if ('dependencies' in changes) {\n          const { ids, bad } = resolveDeps(changes.dependencies, i);\n          if (bad.length) { errors.push(`${label}: unknown dependencies: ${bad.join(', ')}`); break; }\n          changes.dependencies = ids.filter((id) => id !== target.id);\n        }\n        tasks = updateTaskInPlan(tasks, target.id, { ...changes, status: 'pending', verdict: undefined, outputSummary: undefined });\n        // Dependents parked at 'blocked' by this task's earlier failure have\n        // nothing else to release them — the scheduler reads `status` directly,\n        // not a live recomputation of the dependency graph.\n        for (const dep of flattenTasks(tasks)) {\n          if (dep.status === 'blocked' && dep.dependencies.includes(target.id)) {\n            tasks = updateTaskInPlan(tasks, dep.id, { status: 'pending' });\n          }\n        }\n        const clearedNote = check.clear?.length ? `; cleared ${check.clear.join(', ')}` : '';\n        const changedNote = Object.keys(changes).length ? ` (${Object.keys(changes).join(', ')})` : '';\n        summary.push(`Re-armed \"${target.title}\"${changedNote}${clearedNote}`);\n        break;\n      }\n      default:\n        errors.push(`${label}: unknown op \"${(op as { op: string }).op}\"`);\n    }\n    if (errors.length) break;\n  }\n\n  if (!errors.length) {\n    const flat = flattenTasks(tasks);\n    const idSet = new Set(flat.map((t) => t.id));\n    for (const t of flat) {\n      for (const dep of t.dependencies) {\n        if (!idSet.has(dep)) errors.push(`\"${t.title}\" depends on a task that no longer exists (${dep})`);\n      }\n    }\n    const cycleAt = detectCycle(flat);\n    if (cycleAt) errors.push(`Dependency cycle detected involving \"${cycleAt}\"`);\n    // Display order is maintained, not demanded: whatever the batch produced,\n    // the plan comes back with dependencies ahead of their dependents. The\n    // planner never has to re-declare the whole order to move one task.\n    if (!errors.length) {\n      const repaired = repairOrder(tasks);\n      if ('error' in repaired) {\n        errors.push(repaired.error);\n      } else {\n        const moves = describeMoves(tasks, repaired.tasks);\n        if (moves) summary.push(`Reordered to keep dependencies first: ${moves}`);\n        tasks = renumberTasks(repaired.tasks);\n      }\n    }\n  }\n\n  return errors.length\n    ? { ok: false, tasks: currentTasks, errors, summary: [] }\n    : { ok: true, tasks, errors: [], summary };\n}\n","import type { ResearchStepOutcome } from '../models/Task';\n\n/**\n * One-line human summary of a research tool call, shared by every surface that\n * renders live planner progress (VS Code webview, CLI, TUI). Kept in core so\n * the arg-shape heuristics (file path vs. pattern vs. shell command) live in\n * one place instead of being re-derived per surface — which also means a new\n * tool becomes readable in all three UIs by being handled here once.\n */\n\nfunction ellipsize(text: string, max: number): string {\n  const oneLine = text.replace(/\\s+/g, ' ').trim();\n  return oneLine.length > max ? `${oneLine.slice(0, max)}…` : oneLine;\n}\n\n/**\n * @param toolLabel The agent's own name for the tool, when a harness planner\n * produced the call (ADR-0009). It replaces the member name in the summary, so\n * the timeline says `Edit` rather than the catch-all `agent_tool` — and says\n * `WebFetch` rather than claiming a shell command ran.\n */\nexport function summarizeToolCall(tool: string, argsJson: string, toolLabel?: string): string {\n  const display = toolLabel?.trim() || tool;\n  if (tool === 'agent_tool') {\n    // No Ordewell equivalent, so no arg shape to rely on: show the agent's name\n    // plus whichever conventional field the call happens to carry.\n    try {\n      const args = JSON.parse(argsJson);\n      const hint = args.path ?? args.file_path ?? args.filePath ?? args.pattern ?? args.query ?? args.url ?? args.command;\n      if (hint) return `${display} ${ellipsize(String(hint), 50)}`;\n    } catch {\n      // fall through to the bare name\n    }\n    return display;\n  }\n\n  if (tool === 'spawn_research_agent') {\n    try {\n      const args = JSON.parse(argsJson);\n      const prompt = typeof args.prompt === 'string' ? args.prompt : '';\n      const oneLine = prompt.replace(/\\s+/g, ' ').trim();\n      return `spawn: \"${oneLine.slice(0, 60)}${oneLine.length > 60 ? '…' : ''}\"`;\n    } catch {\n      return 'spawn_research_agent';\n    }\n  }\n\n  try {\n    const args = JSON.parse(argsJson);\n\n    // Ordered by specificity: a tool's defining argument wins over the generic\n    // `path`, which several of the newer tools also accept as a search root.\n    if (tool === 'find_symbol' && args.symbol) {\n      return `find_symbol ${args.symbol}${args.language ? ` [${args.language}]` : ''}`;\n    }\n    if (tool === 'web_search' && args.query) {\n      return `web_search \"${ellipsize(String(args.query), 50)}\"`;\n    }\n    if (tool === 'fetch' && args.url) {\n      return `fetch ${ellipsize(String(args.url), 60)}`;\n    }\n    // The pattern is what a glob is about; the generic `path` below is only its\n    // search root, and reporting that read as \"glob src\" for every call.\n    if (tool === 'glob' && args.pattern) {\n      return `glob ${ellipsize(String(args.pattern), 50)}`;\n    }\n    if (tool === 'grep' && args.pattern) {\n      const mode = args.output_mode && args.output_mode !== 'content' ? ` (${args.output_mode})` : '';\n      const scope = args.include ? ` in ${args.include}` : '';\n      return `grep ${ellipsize(String(args.pattern), 40)}${scope}${mode}`;\n    }\n\n    const path = args.filePath || args.file_path || args.path;\n    if (path) {\n      const basename = String(path).split('/').pop() || String(path);\n      return `${display} ${basename}`;\n    }\n    if (args.pattern) {\n      return `${display} ${args.pattern}`;\n    }\n    if (args.command) {\n      return `bash: ${String(args.command).slice(0, 40)}`;\n    }\n  } catch {\n    // fall through to the bare tool name below\n  }\n  return display;\n}\n\n/**\n * Classify a tool outcome from its result text and success flag, so a surface\n * can render a refused `rm` or a denied `npm test` distinctly from a\n * successful run without re-deriving the refusal signatures per surface. The\n * refusal/denial strings come from `commandPolicy.ts`, `BaseFileSystem.ts`,\n * and the research-subagent wrapper — keeping the matching here means the\n * signatures stay in one place alongside the human summary.\n */\nexport function classifyOutcome(success: boolean, output: string): ResearchStepOutcome {\n  if (!success) {\n    if (/^Command refused:/.test(output) || /is not available\\. You are a read-only research subagent/.test(output)) return 'refused';\n    if (/not approved/i.test(output) || /^Access denied:/.test(output) || /needs user approval/i.test(output)) return 'denied';\n    return 'failure';\n  }\n  return 'success';\n}\n","import type { LegacyPlanState, QueuedMessage, ResearchStep, RunnerId, Task, Verdict } from '../models/Task';\nimport type { ApprovalKind } from '../interfaces/IApproval';\nimport type { ApprovalSource } from './ApprovalPolicy';\nimport type { IsolationHandoff, IsolationMergeResult, TaskIsolation } from '../interfaces/IWorktreeIsolation';\n\nexport type SerializedTaskStatus = {\n  id: string;\n  status: string;\n  verdict: { outcome: 'pass' | 'fail'; reason: string; checks: Verdict['checks'] } | null;\n  /** Advisory silence timestamp from VerdictEngine — not part of task status semantics. */\n  idleSince?: string | null;\n  /** Absent unless the plan has an isolation run, so a shared-root plan's updates are unchanged. */\n  isolation?: TaskIsolation;\n};\n\nexport type SerializedTask = {\n  id: string;\n  order: number;\n  title: string;\n  type: string;\n  description: string;\n  dependencies: string[];\n  assignedRunner: RunnerId;\n  assignedModel: Task['assignedModel'] | null;\n  taskMode: string;\n  prompt: string | null;\n  subtasks: SerializedTask[];\n  userSteps: Task['userSteps'];\n  thinkingEffort: Task['thinkingEffort'];\n  autonomy: Task['autonomy'];\n  sliceType: Task['sliceType'];\n  userStoriesCovered: Task['userStoriesCovered'];\n};\n\nexport type SerializedPlan = {\n  tasks: SerializedTask[];\n  runners: RunnerId[];\n  generatedAt: string;\n  conversationHistory?: LegacyPlanState['conversationHistory'];\n  prdMarkdown?: string;\n  queuedMessages?: QueuedMessage[];\n};\n\nexport type SessionMessage =\n  | { type: 'plan_generated'; plan: SerializedPlan; goal: string; runners: RunnerId[] }\n  | { type: 'planner_message'; content: string; timestamp: string }\n  | { type: 'status_update'; tasks: SerializedTaskStatus[] }\n  | { type: 'review_needed'; tasks: SerializedTask[] }\n  | { type: 'review_approved' }\n  | { type: 'checkpoint'; taskId: string; taskTitle: string; summary: string }\n  | { type: 'execution_complete'; summary: { total: number; completed: number; failed: number } }\n  | { type: 'execution_stopped' }\n  | { type: 'queue_ready' }\n  | { type: 'task_updated'; taskId: string; changes: Record<string, unknown> }\n  | { type: 'task_started'; taskId: string; order: number; title: string; runner: RunnerId; modelId?: string }\n  | { type: 'task_output'; taskId: string; text: string }\n  // A run did not start because tracked files are modified. It waits for the\n  // user to stash (`continueWithStash`) or to run without isolation this once\n  // (`continueWithoutIsolation`); nothing is spawned until then. `repos` names\n  // the dirty repos of a group; a group of one names none.\n  | { type: 'isolation_blocked'; reason: 'dirty'; repos?: string[]; message: string }\n  // An isolated run settled: for each repo, the branch its work landed on and\n  // the commit that branch forked from; and what landed, in plan order. Sent\n  // before `execution_complete`, which surfaces treat as the end of the stream.\n  | { type: 'isolation_handoff'; repos: IsolationHandoff['repos']; landed: IsolationHandoff['landed'] }\n  // What \"Merge all\" did, for every surface watching rather than only the one\n  // that asked: merged, blocked with each repo and why, or stopped part-way\n  // with the repos that stay merged.\n  | { type: 'isolation_merge'; result: IsolationMergeResult }\n  | { type: 'plan_thinking'; text: string }\n  // Carries no content — see `ResearchProgress['liveness']`. Exists only so a\n  // surface's idle watchdog sees the harness process working even during a\n  // stretch that produces nothing visible.\n  | { type: 'planner_liveness' }\n  // `toolLabel` carries a harness planner's own name for the tool (ADR-0009) —\n  // always set when `tool` is `agent_tool`, so no surface has to render the\n  // catch-all member name at the user.\n  | { type: 'research_step'; tool: string; toolLabel?: string; args: string; subagentId?: string; toolCallId?: string }\n  | { type: 'plan_token'; token: string }\n  | { type: 'research_step_done'; step: ResearchStep; subagentId?: string }\n  // Planner research wants something outside its default envelope and is\n  // blocked until a human answers. Broadcast rather than returned, because the\n  // human may be on any surface (or several at once) and the request outlives\n  // whichever HTTP call triggered it.\n  | { type: 'approval_request'; id: string; kind: ApprovalKind; subject: string; scope: string; detail?: string }\n  | { type: 'approval_settled'; id: string; granted: boolean }\n  // A decision reached with no round-trip prompt: pre-approved via config,\n  // remembered from earlier in this session, or the operator's mode floor\n  // (allow/deny skipping the human entirely). The interactive path above\n  // already has full visibility via approval_request/approval_settled; this\n  // is the one that previously had none — a model silently auto-running\n  // `npm test` because the scope was already granted looked identical, from\n  // every UI, to it never having been asked in the first place.\n  | {\n      type: 'approval_decided';\n      kind: ApprovalKind;\n      subject: string;\n      scope: string;\n      detail?: string;\n      granted: boolean;\n      source: Exclude<ApprovalSource, 'asked'>;\n    };\n\n/**\n * A line a run wants the user to read — how it isolates, what it shares. Not a\n * {@link SessionMessage}: hosts that show notices as toasts already do, and\n * widening the union would break every exhaustive switch over it. A host with\n * no toast channel (the daemon) hands these to its clients by its own means.\n */\nexport type SessionNotice = { type: 'notice'; level: 'info' | 'warn'; message: string };\n\nexport type SessionBroadcaster = (msg: SessionMessage) => void;\n\nexport function serializeTask(t: Task): SerializedTask {\n  return {\n    id: t.id,\n    order: t.order,\n    title: t.title,\n    type: t.type,\n    description: t.description,\n    dependencies: t.dependencies || [],\n    assignedRunner: t.assignedRunner,\n    assignedModel: t.assignedModel || null,\n    taskMode: t.taskMode || 'build',\n    prompt: t.prompt || null,\n    subtasks: (t.subtasks || []).map(serializeTask),\n    userSteps: t.userSteps || undefined,\n    thinkingEffort: t.thinkingEffort || undefined,\n    autonomy: t.autonomy || undefined,\n    sliceType: t.sliceType || undefined,\n    userStoriesCovered: t.userStoriesCovered || undefined,\n  };\n}\n\nexport function serializeTaskStatus(t: Task, idleSince: string | null = null, isolation: TaskIsolation | null = null): SerializedTaskStatus {\n  return {\n    id: t.id,\n    status: t.status,\n    verdict: t.verdict\n      ? { outcome: t.verdict.outcome, reason: t.verdict.reason, checks: t.verdict.checks || [] }\n      : null,\n    idleSince,\n    ...(isolation ? { isolation } : {}),\n  };\n}\n\nexport function serializePlan(plan: LegacyPlanState): SerializedPlan {\n  return {\n    tasks: plan.tasks.map(serializeTask),\n    runners: plan.runners,\n    generatedAt: plan.generatedAt,\n    conversationHistory: plan.conversationHistory,\n    prdMarkdown: plan.prdMarkdown,\n    queuedMessages: plan.queuedMessages,\n  };\n}\n\nexport function executionSummary(tasks: Task[]): { total: number; completed: number; failed: number } {\n  return {\n    total: tasks.length,\n    completed: tasks.filter((t) => t.status === 'completed').length,\n    failed: tasks.filter((t) => t.status === 'failed').length,\n  };\n}\n\nexport const CHECKPOINT_TRUNCATE_LENGTH = 120;\n\n/** Truncate a checkpoint summary to a single line of at most CHECKPOINT_TRUNCATE_LENGTH chars. */\nexport function truncateCheckpointSummary(summary: string): string {\n  // Take the first line only (checkpoint summaries often contain reasoning across lines)\n  const firstLine = summary.split('\\n')[0].trim();\n  if (firstLine.length <= CHECKPOINT_TRUNCATE_LENGTH) return firstLine;\n  return firstLine.slice(0, CHECKPOINT_TRUNCATE_LENGTH - 1) + '…';\n}\n","import * as path from 'path';\nimport type {\n  IsolationHandoff,\n  IsolationLandedTask,\n  IsolationRepo,\n  IsolationRun,\n  IsolationTaskRecord,\n  IsolationTaskStatus,\n  PlanIsolation,\n  RepoGroupLayout,\n  TaskIsolation,\n} from '../interfaces/IWorktreeIsolation';\n\n/** The path of the repo in a workspace that is itself the repository. */\nexport const SELF_REPO = '.';\n\nexport function integrationBranchFor(runId: string): string {\n  return `ordewell/${runId}/integration`;\n}\n\nexport function repoRootOf(workspaceRoot: string, repoPath: string): string {\n  return path.join(workspaceRoot, repoPath);\n}\n\n/** The group a run isolates, as the planner is told it. */\nexport function layoutOf(run: IsolationRun): RepoGroupLayout {\n  return { repos: run.repos.map((r) => r.path), shared: [...run.shared] };\n}\n\n/** The run's integration branch for a one-line notice: every repo's has the same name. */\nexport function integrationBranchNameOf(run: IsolationRun): string {\n  return [...new Set(run.repos.map((r) => r.integrationBranch))].join(', ');\n}\n\nconst ISOLATION_STATE: Record<IsolationTaskStatus, Exclude<TaskIsolation['state'], 'none'>> = {\n  active: 'active',\n  merged: 'integrated',\n  conflict: 'conflict',\n  repairing: 'repairing',\n  kept: 'kept',\n  failed: 'kept',\n};\n\n/** `repairLimit` is `conflictRepairAttempts` as it stands now, which is what the next repair will be held to. */\nexport function taskIsolationOf(record: IsolationTaskRecord, repairLimit: number): TaskIsolation {\n  return {\n    state: ISOLATION_STATE[record.status],\n    branch: record.branch,\n    worktree: record.workspace,\n    repos: Object.entries(record.repos).filter(([, r]) => r.changed).map(([repoPath]) => repoPath),\n    ...(record.conflictRepo ? { conflictRepo: record.conflictRepo } : {}),\n    ...(record.conflictFiles?.length ? { conflictFiles: record.conflictFiles } : {}),\n    ...(record.repairs ? { repair: { attempt: record.repairs, limit: repairLimit } } : {}),\n    ...(record.repairedFiles?.length ? { repairedFiles: record.repairedFiles } : {}),\n  };\n}\n\n/** A conflict's files as one surface shows them: every one, up to `max`, then how many more. */\nexport function capConflictFiles(files: string[], max = 5): string {\n  return files.length <= max ? files.join(', ') : `${files.slice(0, max).join(', ')}, +${files.length - max} more`;\n}\n\n/** What a run hands over: each repo's integration branch and base, and what landed, in plan order. */\nexport function handoffOf(run: IsolationRun): IsolationHandoff {\n  const merged = Object.values(run.tasks)\n    .filter((r) => r.status === 'merged')\n    .sort((a, b) => a.order - b.order);\n  const entry = (r: IsolationTaskRecord): IsolationLandedTask => ({\n    taskId: r.taskId, order: r.order, title: r.title,\n    ...(r.repairedFiles?.length ? { repairedFiles: r.repairedFiles } : {}),\n  });\n  return {\n    repos: run.repos.map((repo) => ({\n      path: repo.path,\n      integrationBranch: repo.integrationBranch,\n      baseRef: repo.baseRef,\n      landed: merged.filter((r) => r.repos[repo.path]?.changed).map(entry),\n    })),\n    landed: merged.map(entry),\n  };\n}\n\n/** A task record as ADR-0013 persisted it, for one repository. */\nexport interface Adr0013TaskRecord {\n  taskId: string;\n  order: number;\n  title: string;\n  branch: string;\n  worktree: string;\n  status: IsolationTaskStatus;\n  linked: string[];\n}\n\n/** A run as ADR-0013 persisted it (0.4.23): one repository, its refs on the run itself. */\nexport interface Adr0013IsolationRun {\n  id: string;\n  workspaceRoot: string;\n  baseRef: string;\n  baseBranch?: string;\n  integrationBranch: string;\n  tasks: Record<string, Adr0013TaskRecord>;\n}\n\nexport interface Adr0013PlanIsolation {\n  run: Adr0013IsolationRun;\n  resolvers: Record<string, string>;\n}\n\nfunction isAdr0013(run: IsolationRun | Adr0013IsolationRun): run is Adr0013IsolationRun {\n  return 'integrationBranch' in run && typeof run.integrationBranch === 'string';\n}\n\nfunction fromAdr0013Task(r: Adr0013TaskRecord): IsolationTaskRecord {\n  return {\n    taskId: r.taskId,\n    order: r.order,\n    title: r.title,\n    branch: r.branch,\n    workspace: r.worktree,\n    status: r.status,\n    // A merged task's branch was merged into the one repo there was; what it\n    // changed was never recorded, and landing is what `changed` stands for.\n    repos: { [SELF_REPO]: { worktree: r.worktree, linked: r.linked ?? [], ...(r.status === 'merged' ? { changed: true } : {}) } },\n    ...(r.status === 'conflict' ? { conflictRepo: SELF_REPO } : {}),\n  };\n}\n\n/**\n * A persisted plan isolation in today's shape. A run saved in the ADR-0013\n * format — recognised by its own `integrationBranch` — becomes a group of one\n * at `.`, keeping its branches, so a session saved by 0.4.23 resumes and hands\n * off exactly as it would have.\n */\nexport function migratePlanIsolation(state: PlanIsolation | Adr0013PlanIsolation): PlanIsolation {\n  const { run, resolvers } = state;\n  if (!isAdr0013(run)) return { run, resolvers: resolvers ?? {} };\n  const repo: IsolationRepo = {\n    path: SELF_REPO,\n    root: repoRootOf(run.workspaceRoot, SELF_REPO),\n    baseRef: run.baseRef,\n    ...(run.baseBranch ? { baseBranch: run.baseBranch } : {}),\n    integrationBranch: run.integrationBranch,\n  };\n  const tasks = Object.fromEntries(Object.entries(run.tasks ?? {}).map(([id, r]) => [id, fromAdr0013Task(r)]));\n  return { run: { id: run.id, workspaceRoot: run.workspaceRoot, repos: [repo], shared: [], sharedRepos: [], tasks }, resolvers: resolvers ?? {} };\n}\n\n/** Bring a loaded plan's isolation record, if any, to today's shape in place. */\nexport function migratePlanStateIsolation(plan: { isolation?: PlanIsolation | Adr0013PlanIsolation }): void {\n  if (plan.isolation?.run) plan.isolation = migratePlanIsolation(plan.isolation);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,kBAA6B;AAsK7B,SAAS,YAAY,OAA8B;AACjD,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,QAAQ,CAAC,OAA8B;AAC3C,QAAI,KAAK,IAAI,EAAE,EAAG,QAAO;AACzB,QAAI,SAAS,IAAI,EAAE,EAAG,QAAO;AAC7B,aAAS,IAAI,EAAE;AACf,eAAW,OAAO,KAAK,IAAI,EAAE,GAAG,gBAAgB,CAAC,GAAG;AAClD,YAAM,MAAM,MAAM,GAAG;AACrB,UAAI,IAAK,QAAO;AAAA,IAClB;AACA,aAAS,OAAO,EAAE;AAClB,SAAK,IAAI,EAAE;AACX,WAAO;AAAA,EACT;AACA,aAAW,KAAK,OAAO;AACrB,UAAM,MAAM,MAAM,EAAE,EAAE;AACtB,QAAI,IAAK,QAAO,KAAK,IAAI,GAAG,GAAG,SAAS;AAAA,EAC1C;AACA,SAAO;AACT;AAuFO,SAAS,cAAc,OAAe,aAAwD;AACnG,MAAI,YAAY,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO,qCAAqC;AAC5F,QAAM,QAAQ,IAAI,IAAI,WAAW;AACjC,QAAM,UAAU,MAAM,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE,EAAE,CAAC;AACnD,MAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO,iDAAiD;AACpG,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,WAAW,cAAe,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,EAAE,KAAK,oCAAoC;AAC1G,QAAI,EAAE,WAAW,YAAa,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,EAAE,KAAK,sCAAsC;AAAA,EAC5G;AACA,QAAM,UAAU,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC7D,QAAM,aAAa;AACnB,QAAM,MAAc,MACjB,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC,EAC9B,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,cAAc,EAAE,aAAa,IAAI,CAAC,MAAO,MAAM,IAAI,CAAC,IAAI,aAAa,CAAE,EAAE,OAAO,CAAC,MAAM,MAAM,EAAE,EAAE,EAAE,EAAE;AAC5H,QAAM,YAAY,CAAC,GAAG,IAAI,IAAI,QAAQ,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;AAClG,MAAI,KAAK,EAAE,GAAG,QAAQ,CAAC,GAAG,IAAI,YAAY,OAAO,iBAAiB,OAAO,QAAQ,CAAC,EAAE,OAAO,cAAc,UAAU,CAAC;AACpH,QAAM,QAAQ,YAAY,GAAG;AAC7B,MAAI,MAAO,QAAO,EAAE,IAAI,OAAO,OAAO,sDAAsD,KAAK,IAAI;AACrG,SAAO,EAAE,IAAI,KAAK;AACpB;AAiBO,SAAS,aAA6D,OAAY,QAAqB;AAC5G,SAAO,MAAM,OAAO,CAAC,MAAM,EAAE,OAAO,UAAU,EAAE,aAAa,SAAS,MAAM,CAAC;AAC/E;AAUO,SAAS,qBAA8D,OAAY,QAAsB;AAC9G,MAAI,CAAC,OAAQ,QAAO,CAAC,GAAG,KAAK;AAC7B,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,SAAO,SAAS,MAAM,OAAO,CAAC,MAAM,EAAE,QAAQ,OAAO,KAAK,IAAI,CAAC;AACjE;AAGO,SAAS,mBACd,OACA,QACA,cACiC;AACjC,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,MAAI,CAAC,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,iBAAiB;AACzD,QAAM,UAAU,IAAI,IAAI,qBAAqB,OAAO,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC5E,aAAW,OAAO,cAAc;AAC9B,QAAI,QAAQ,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,4BAA4B;AAC3F,UAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,GAAG;AAC5C,QAAI,CAAC,MAAO,QAAO,EAAE,IAAI,OAAO,OAAO,uBAAuB,GAAG,IAAI;AACrE,QAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;AACrB,aAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,uBAAuB,MAAM,KAAK,sCAAsC;AAAA,IACrH;AAAA,EACF;AACA,SAAO,EAAE,IAAI,KAAK;AACpB;AAGO,SAAS,aAAa,OAAe,QAAiD;AAC3F,QAAM,SAAS,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAChD,MAAI,CAAC,OAAQ,QAAO,EAAE,IAAI,OAAO,OAAO,iBAAiB;AACzD,MAAI,OAAO,WAAW,cAAe,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,mCAAmC;AACnH,MAAI,OAAO,WAAW,YAAa,QAAO,EAAE,IAAI,OAAO,OAAO,IAAI,OAAO,KAAK,qCAAqC;AACnH,SAAO,EAAE,IAAI,KAAK;AACpB;;;ACzVA,SAAS,UAAU,MAAc,KAAqB;AACpD,QAAM,UAAU,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAC/C,SAAO,QAAQ,SAAS,MAAM,GAAG,QAAQ,MAAM,GAAG,GAAG,CAAC,WAAM;AAC9D;AAQO,SAAS,kBAAkB,MAAc,UAAkB,WAA4B;AAC5F,QAAM,UAAU,WAAW,KAAK,KAAK;AACrC,MAAI,SAAS,cAAc;AAGzB,QAAI;AACF,YAAM,OAAO,KAAK,MAAM,QAAQ;AAChC,YAAM,OAAO,KAAK,QAAQ,KAAK,aAAa,KAAK,YAAY,KAAK,WAAW,KAAK,SAAS,KAAK,OAAO,KAAK;AAC5G,UAAI,KAAM,QAAO,GAAG,OAAO,IAAI,UAAU,OAAO,IAAI,GAAG,EAAE,CAAC;AAAA,IAC5D,QAAQ;AAAA,IAER;AACA,WAAO;AAAA,EACT;AAEA,MAAI,SAAS,wBAAwB;AACnC,QAAI;AACF,YAAM,OAAO,KAAK,MAAM,QAAQ;AAChC,YAAM,SAAS,OAAO,KAAK,WAAW,WAAW,KAAK,SAAS;AAC/D,YAAM,UAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACjD,aAAO,WAAW,QAAQ,MAAM,GAAG,EAAE,CAAC,GAAG,QAAQ,SAAS,KAAK,WAAM,EAAE;AAAA,IACzE,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI;AACF,UAAM,OAAO,KAAK,MAAM,QAAQ;AAIhC,QAAI,SAAS,iBAAiB,KAAK,QAAQ;AACzC,aAAO,eAAe,KAAK,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK,QAAQ,MAAM,EAAE;AAAA,IAChF;AACA,QAAI,SAAS,gBAAgB,KAAK,OAAO;AACvC,aAAO,eAAe,UAAU,OAAO,KAAK,KAAK,GAAG,EAAE,CAAC;AAAA,IACzD;AACA,QAAI,SAAS,WAAW,KAAK,KAAK;AAChC,aAAO,SAAS,UAAU,OAAO,KAAK,GAAG,GAAG,EAAE,CAAC;AAAA,IACjD;AAGA,QAAI,SAAS,UAAU,KAAK,SAAS;AACnC,aAAO,QAAQ,UAAU,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC;AAAA,IACpD;AACA,QAAI,SAAS,UAAU,KAAK,SAAS;AACnC,YAAM,OAAO,KAAK,eAAe,KAAK,gBAAgB,YAAY,KAAK,KAAK,WAAW,MAAM;AAC7F,YAAM,QAAQ,KAAK,UAAU,OAAO,KAAK,OAAO,KAAK;AACrD,aAAO,QAAQ,UAAU,OAAO,KAAK,OAAO,GAAG,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI;AAAA,IACnE;AAEA,UAAM,OAAO,KAAK,YAAY,KAAK,aAAa,KAAK;AACrD,QAAI,MAAM;AACR,YAAM,WAAW,OAAO,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI,KAAK,OAAO,IAAI;AAC7D,aAAO,GAAG,OAAO,IAAI,QAAQ;AAAA,IAC/B;AACA,QAAI,KAAK,SAAS;AAChB,aAAO,GAAG,OAAO,IAAI,KAAK,OAAO;AAAA,IACnC;AACA,QAAI,KAAK,SAAS;AAChB,aAAO,SAAS,OAAO,KAAK,OAAO,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IACnD;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;;;AC8EO,IAAM,6BAA6B;AAGnC,SAAS,0BAA0B,SAAyB;AAEjE,QAAM,YAAY,QAAQ,MAAM,IAAI,EAAE,CAAC,EAAE,KAAK;AAC9C,MAAI,UAAU,UAAU,2BAA4B,QAAO;AAC3D,SAAO,UAAU,MAAM,GAAG,6BAA6B,CAAC,IAAI;AAC9D;;;ACnHO,SAAS,iBAAiB,OAAiB,MAAM,GAAW;AACjE,SAAO,MAAM,UAAU,MAAM,MAAM,KAAK,IAAI,IAAI,GAAG,MAAM,MAAM,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,MAAM,MAAM,SAAS,GAAG;AAC3G;","names":[]}

package/dist/plan-utils.mjs

@@ -7,14 +7,18 @@ import {
   dependentsOf,
   summarizeToolCall,
   truncateCheckpointSummary
-} from "./chunk-O2MFTRHA.mjs";
-import "./chunk-T4KGVP4N.mjs";
+} from "./chunk-GWPIYDQW.mjs";
+import "./chunk-JVMDEHRQ.mjs";
 import "./chunk-HPNUFBIT.mjs";
+import {
+  capConflictFiles
+} from "./chunk-T2S5O36I.mjs";
 export {
   CHECKPOINT_TRUNCATE_LENGTH,
   canMergeTasks,
   canSetDependencies,
   canSplitTask,
+  capConflictFiles,
   dependencyCandidates,
   dependentsOf,
   summarizeToolCall,

package/dist/testing.d.mts

@@ -1,6 +1,6 @@
-import { i as ITerminalSession, I as IConfig, f as IFileSystem } from './ITerminalRunner-CuNYBnqK.mjs';
+import { i as ITerminalSession, I as IConfig, f as IFileSystem } from './ITerminalRunner-DCjsa2-I.mjs';
+import { b as IntegrationDisposal, I as IWorktreeIsolation, c as IsolationAvailability, k as IsolationMergeResult, l as IsolationOutcome, R as RepairEvidence, n as IsolationRun, T as Task, v as PreparedTask, d as IsolationHandoff } from './Task-BxQkPlXO.mjs';
 import './ApprovalPolicy-BVhGdECT.mjs';
-import './Task-4rDGr8Su.mjs';
 
 declare function fakeConfig(overrides?: Partial<IConfig>): IConfig;
 /**
@@ -25,5 +25,95 @@ declare class FakeTerminalSession implements ITerminalSession {
     emitOutput(text: string): void;
     emitExit(code: number): void;
 }
+type FakeIsolationCall = {
+    op: 'isActive';
+    workspaceRoot: string;
+} | {
+    op: 'stash';
+    workspaceRoot: string;
+} | {
+    op: 'startRun';
+    workspaceRoot: string;
+} | {
+    op: 'prepare' | 'reopen' | 'verifyRepair';
+    taskId: string;
+} | {
+    op: 'integrate';
+    taskId: string;
+} | {
+    op: 'release';
+    taskId: string;
+    keep: boolean;
+} | {
+    op: 'handoff' | 'pruneOrphans' | 'reviewDiff' | 'mergeIntoCheckedOut' | 'sweep';
+} | {
+    op: 'discard';
+    integration: IntegrationDisposal;
+};
+/**
+ * An in-memory {@link IWorktreeIsolation} for scheduling tests: no git, no
+ * filesystem. Every call is logged in `calls`; `prepare` hands back a
+ * deterministic fake cwd. Set `availability` to exercise the fallbacks, `outcomes`
+ * to script a conflict, and `holdIntegration` to keep a task un-integrated so a
+ * test can observe that its dependents wait. `repos` makes the run a group of
+ * several; `changes` and `stopsIn` say which of them a task changes and where
+ * its landing stops. `repairEvidence` scripts what a conflict repair's
+ * evidence check finds.
+ */
+declare class FakeWorktreeIsolation implements IWorktreeIsolation {
+    availability: IsolationAvailability;
+    /** The repo paths `startRun` groups: a group of one at `.` unless set. */
+    repos: string[];
+    /** Per task id, the repos it changes; every repo of the group when not listed. */
+    changes: Map<string, string[]>;
+    /** Per task id, the repo its landing stops in when its outcome is not `merged`; its first changed repo when not listed. */
+    stopsIn: Map<string, string>;
+    /** Per task id, the files a `conflict` outcome names; empty when not listed. */
+    conflictFiles: Map<string, string[]>;
+    /** What `mergeIntoCheckedOut` answers. */
+    mergeResult: IsolationMergeResult;
+    /** What `startRun` shares and `prepare` copies, to exercise their notices. */
+    shared: string[];
+    sharedRepos: string[];
+    copied: string[];
+    /** Set to make `startRun` throw, as git does when no repo of the group can be isolated. */
+    startRunError: Error | null;
+    /** Set to make `discard` / `sweep` throw after logging the call. */
+    discardError: Error | null;
+    sweepError: Error | null;
+    /** Per task id; a task not listed integrates as `merged`. */
+    outcomes: Map<string, IsolationOutcome>;
+    /** Per task id, what `verifyRepair` finds; a task not listed passes. */
+    repairEvidence: Map<string, RepairEvidence>;
+    calls: FakeIsolationCall[];
+    private holds;
+    private runCount;
+    private log;
+    /** Task ids in the order `op` was called for them. */
+    taskIdsFor(op: 'prepare' | 'reopen' | 'verifyRepair' | 'integrate' | 'release'): string[];
+    /** Make `integrate` for this task wait until the returned function is called. */
+    holdIntegration(taskId: string): () => void;
+    isActive(workspaceRoot: string): Promise<IsolationAvailability>;
+    /** Like git: once the tracked changes are stashed, the tree is no longer dirty. */
+    stash(workspaceRoot: string): Promise<void>;
+    startRun(workspaceRoot: string): Promise<IsolationRun>;
+    prepare(task: Task, run: IsolationRun): Promise<PreparedTask>;
+    /** Like git: the same cwd, each changed repo's tip recorded, the repair counted. */
+    reopen(task: Task, run: IsolationRun): Promise<PreparedTask>;
+    verifyRepair(task: Task, _run: IsolationRun): Promise<RepairEvidence>;
+    /** Like git: the landing is recorded and persisted before the (held) merge, and cleared once it settles. */
+    integrate(task: Task, run: IsolationRun, persist?: () => void): Promise<IsolationOutcome>;
+    release(run: IsolationRun, taskId: string, opts: {
+        keep: boolean;
+    }): Promise<void>;
+    handoff(run: IsolationRun): Promise<IsolationHandoff>;
+    pruneOrphans(): Promise<void>;
+    reviewDiff(): Promise<string>;
+    mergeIntoCheckedOut(): Promise<IsolationMergeResult>;
+    discard(_run: IsolationRun, opts: {
+        integration: IntegrationDisposal;
+    }): Promise<void>;
+    sweep(): Promise<void>;
+}
 
-export { FakeTerminalSession, fakeConfig, fakeFileSystem };
+export { type FakeIsolationCall, FakeTerminalSession, FakeWorktreeIsolation, fakeConfig, fakeFileSystem };

package/dist/testing.d.ts

@@ -1,6 +1,6 @@
-import { i as ITerminalSession, I as IConfig, f as IFileSystem } from './ITerminalRunner-Da1gIAFX.js';
+import { i as ITerminalSession, I as IConfig, f as IFileSystem } from './ITerminalRunner-H1yT8LTy.js';
+import { b as IntegrationDisposal, I as IWorktreeIsolation, c as IsolationAvailability, k as IsolationMergeResult, l as IsolationOutcome, R as RepairEvidence, n as IsolationRun, T as Task, v as PreparedTask, d as IsolationHandoff } from './Task-BxQkPlXO.js';
 import './ApprovalPolicy-BVhGdECT.js';
-import './Task-4rDGr8Su.js';
 
 declare function fakeConfig(overrides?: Partial<IConfig>): IConfig;
 /**
@@ -25,5 +25,95 @@ declare class FakeTerminalSession implements ITerminalSession {
     emitOutput(text: string): void;
     emitExit(code: number): void;
 }
+type FakeIsolationCall = {
+    op: 'isActive';
+    workspaceRoot: string;
+} | {
+    op: 'stash';
+    workspaceRoot: string;
+} | {
+    op: 'startRun';
+    workspaceRoot: string;
+} | {
+    op: 'prepare' | 'reopen' | 'verifyRepair';
+    taskId: string;
+} | {
+    op: 'integrate';
+    taskId: string;
+} | {
+    op: 'release';
+    taskId: string;
+    keep: boolean;
+} | {
+    op: 'handoff' | 'pruneOrphans' | 'reviewDiff' | 'mergeIntoCheckedOut' | 'sweep';
+} | {
+    op: 'discard';
+    integration: IntegrationDisposal;
+};
+/**
+ * An in-memory {@link IWorktreeIsolation} for scheduling tests: no git, no
+ * filesystem. Every call is logged in `calls`; `prepare` hands back a
+ * deterministic fake cwd. Set `availability` to exercise the fallbacks, `outcomes`
+ * to script a conflict, and `holdIntegration` to keep a task un-integrated so a
+ * test can observe that its dependents wait. `repos` makes the run a group of
+ * several; `changes` and `stopsIn` say which of them a task changes and where
+ * its landing stops. `repairEvidence` scripts what a conflict repair's
+ * evidence check finds.
+ */
+declare class FakeWorktreeIsolation implements IWorktreeIsolation {
+    availability: IsolationAvailability;
+    /** The repo paths `startRun` groups: a group of one at `.` unless set. */
+    repos: string[];
+    /** Per task id, the repos it changes; every repo of the group when not listed. */
+    changes: Map<string, string[]>;
+    /** Per task id, the repo its landing stops in when its outcome is not `merged`; its first changed repo when not listed. */
+    stopsIn: Map<string, string>;
+    /** Per task id, the files a `conflict` outcome names; empty when not listed. */
+    conflictFiles: Map<string, string[]>;
+    /** What `mergeIntoCheckedOut` answers. */
+    mergeResult: IsolationMergeResult;
+    /** What `startRun` shares and `prepare` copies, to exercise their notices. */
+    shared: string[];
+    sharedRepos: string[];
+    copied: string[];
+    /** Set to make `startRun` throw, as git does when no repo of the group can be isolated. */
+    startRunError: Error | null;
+    /** Set to make `discard` / `sweep` throw after logging the call. */
+    discardError: Error | null;
+    sweepError: Error | null;
+    /** Per task id; a task not listed integrates as `merged`. */
+    outcomes: Map<string, IsolationOutcome>;
+    /** Per task id, what `verifyRepair` finds; a task not listed passes. */
+    repairEvidence: Map<string, RepairEvidence>;
+    calls: FakeIsolationCall[];
+    private holds;
+    private runCount;
+    private log;
+    /** Task ids in the order `op` was called for them. */
+    taskIdsFor(op: 'prepare' | 'reopen' | 'verifyRepair' | 'integrate' | 'release'): string[];
+    /** Make `integrate` for this task wait until the returned function is called. */
+    holdIntegration(taskId: string): () => void;
+    isActive(workspaceRoot: string): Promise<IsolationAvailability>;
+    /** Like git: once the tracked changes are stashed, the tree is no longer dirty. */
+    stash(workspaceRoot: string): Promise<void>;
+    startRun(workspaceRoot: string): Promise<IsolationRun>;
+    prepare(task: Task, run: IsolationRun): Promise<PreparedTask>;
+    /** Like git: the same cwd, each changed repo's tip recorded, the repair counted. */
+    reopen(task: Task, run: IsolationRun): Promise<PreparedTask>;
+    verifyRepair(task: Task, _run: IsolationRun): Promise<RepairEvidence>;
+    /** Like git: the landing is recorded and persisted before the (held) merge, and cleared once it settles. */
+    integrate(task: Task, run: IsolationRun, persist?: () => void): Promise<IsolationOutcome>;
+    release(run: IsolationRun, taskId: string, opts: {
+        keep: boolean;
+    }): Promise<void>;
+    handoff(run: IsolationRun): Promise<IsolationHandoff>;
+    pruneOrphans(): Promise<void>;
+    reviewDiff(): Promise<string>;
+    mergeIntoCheckedOut(): Promise<IsolationMergeResult>;
+    discard(_run: IsolationRun, opts: {
+        integration: IntegrationDisposal;
+    }): Promise<void>;
+    sweep(): Promise<void>;
+}
 
-export { FakeTerminalSession, fakeConfig, fakeFileSystem };
+export { type FakeIsolationCall, FakeTerminalSession, FakeWorktreeIsolation, fakeConfig, fakeFileSystem };