@ordewell/core 0.8.1 → 0.9.0

package/dist/plan-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/plan-utils.ts","../src/services/TaskOps.ts","../src/models/Task.ts","../src/conversation/skillTokens.ts","../src/order-labels.ts","../src/taskRow/status.ts","../src/services/researchStepSummary.ts","../src/conversation/format.ts","../src/services/harness/agentTools.ts","../src/conversation/records.ts","../src/services/SessionMessage.ts","../src/services/conflictFiles.ts","../src/models/Usage.ts","../src/conversation/lanes.ts","../src/conversation/reduce.ts","../src/conversation/transcript.ts","../src/conversation/taskLog.ts","../src/conversation/promptHold.ts","../src/conversation/turnGate.ts","../src/conversation/detail.ts","../src/conversation/notices.ts","../src/taskRow/actions.ts","../src/taskRow/view.ts","../src/taskRow/texts.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/conflictFiles';\n// The shared conversation view (#51) is pure too, so every surface — a webview\n// included — draws from the same reducer.\nexport * from './conversation';\n// The task row view is pure for the same reason: the webview draws a task card\n// from the facts the TUI paints its plan row from.\nexport * from './taskRow';\nexport { taskOrderLabel, taskRef, titledTaskRef } from './order-labels';\n// The one runner default, shared with the webview so its initial state cannot\n// drift from the plans the host builds.\nexport { DEFAULT_RUNNERS } from './models/Task';\n","import { v4 as uuidv4 } from 'uuid';\nimport {\n  Task, RunnerId, flattenTasks,\n  addTaskToPlan, removeTaskFromPlan, updateTaskInPlan, renumberTasks,\n  createTask, opsFlag, inheritedOps, inheritedSkills, skillNames,\n} from '../models/Task';\nimport { extractObjectsWithKey, stripTrailingCommas, escapeControlCharsInStrings, PlanParseError, TASK_OPS_ENVELOPE_KEY } from './JsonExtractor';\nimport { validateTaskEdit, checkModelAndModeValidity, type EditCatalog, type TaskEditActor, type TaskEditCheck } 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', 'ops', 'skills',\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 = '', tools = false): string[] {\n  const updateChanges = UPDATABLE_FIELDS\n    .map((f) => (f === 'dependencies' ? '\"dependencies\"?:[\"<id or #order>\"]' : `\"${f}\"?`))\n    .join(',');\n  return [\n    tools ? '- To modify specific tasks, call edit_plan, never a JSON reply. Its argument is:' : '- To modify specific tasks, reply with ONLY this JSON object:',\n    tools ? '  {\"ops\": [' : '  {\"taskOps\": [',\n    `    {\"op\":\"update\",\"taskId\":\"<id or #order>\",\"changes\":{${updateChanges}}},`,\n    '    {\"op\":\"add\",\"task\":{\"title\",\"description\",\"prompt\",\"dependencies\":[\"<id or #order>\"],\"assignedRunner\"?,\"assignedModel\"?,\"ops\"?},\"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    tools ? '- For sweeping changes, you may instead call submit_plan with the full plan.' : '- 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 ${tools ? 'list_runners and list_models return' : '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    ...(tools ? ['edit_plan checks the batch when you call it and answers with what it will change, or with the error to fix — call it again in the same reply. The edit is applied when your reply ends; edits you make in one reply join one batch.'] : []),\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    '\"skills\" in \"changes\" REPLACES the task\\'s whole skill list. To add one, send the names the plan block shows in its skills:[...] plus the new one; to drop one, send the rest; [] removes them all.',\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: readonly 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/**\n * The task references an op carries, before a batch handle resolves; an `add`\n * names none. Used to tell whether a batch reaches a task a runner is running.\n */\nexport function taskOpRefs(op: TaskOp): string[] {\n  switch (op.op) {\n    case 'update':\n    case 'remove':\n    case 'split':\n    case 'rearm':\n      return [op.taskId];\n    case 'merge':\n    case 'reorder':\n      return op.taskIds;\n    case 'add':\n      return [];\n  }\n}\n\n/** Whether a written reference names `task` by id, `#order`, bare order, or title. */\nexport function refMatchesTask(ref: unknown, task: Pick<Task, 'id' | 'order' | 'title'>): boolean {\n  if (typeof ref !== 'string' && typeof ref !== 'number') return false;\n  const s = String(ref).trim();\n  if (task.id === s) return true;\n  const orderStr = s.startsWith('#') ? s.slice(1) : s;\n  return (/^\\d+$/.test(orderStr) && task.order === Number(orderStr)) || task.title === s;\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\n/** The fields of a planner's `changes` it may set, with the ops flag read as every entry point reads it. */\nfunction updatableChanges(raw: Partial<Task> | undefined): Partial<Task> {\n  const changes: Partial<Task> = {};\n  for (const key of UPDATABLE_FIELDS) {\n    if (raw && key in raw) (changes as Record<string, unknown>)[key] = (raw as Record<string, unknown>)[key];\n  }\n  if ('ops' in changes) changes.ops = opsFlag(changes.ops);\n  if ('skills' in changes) changes.skills = skillNames(changes.skills);\n  return changes;\n}\n\n/**\n * An added task's subtasks, kept as given but with their skills stored as a\n * task's are: the edit's skill check warned that a name no skill could have\n * was not attached, so it must not be.\n */\nfunction withSkillNames(subtasks: Task[] | undefined): Task[] | undefined {\n  if (!Array.isArray(subtasks)) return subtasks;\n  return subtasks.map((sub: unknown) => {\n    if (typeof sub !== 'object' || sub === null) return sub as Task;\n    const { skills, ...rest } = sub as Task;\n    const names = skillNames(skills);\n    return {\n      ...rest,\n      ...(names ? { skills: names } : {}),\n      ...('subtasks' in rest ? { subtasks: withSkillNames(rest.subtasks) as Task[] } : {}),\n    };\n  });\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: readonly 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: readonly 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: readonly 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: readonly 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: readonly 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: readonly 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  /**\n   * The resolve-and-validate half shared by \"update\" and \"rearm\": resolve the\n   * target, apply the field allowlist and runner check, run the edit validator\n   * under the op's audience, then resolve any dependency refs. `refuseRunning`\n   * is rearm's extra lock check, kept before the field work so its message wins.\n   */\n  const prepareEdit = (\n    op: { taskId: string; changes?: Partial<Task> },\n    opIndex: number,\n    label: string,\n    audience: TaskEditActor,\n    refuseRunning = false,\n  ): { target: Task; changes: Partial<Task>; check: TaskEditCheck } | { error: string } => {\n    const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, opIndex);\n    if ('error' in ref) return { error: `${label}: ${ref.error}` };\n    const target = findInTasks(tasks, ref.id);\n    if (!target) return { error: `${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)` };\n    if (refuseRunning && target.status === 'in_progress') return { error: `${label}: \"${target.title}\" is running and cannot be re-armed` };\n    const changes = updatableChanges(op.changes);\n    if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n      return { error: `${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]` };\n    }\n    // Dependency refs are still unresolved (e.g. \"#3\") at this point, so the\n    // check runs on everything but them; resolveDeps below handles them once\n    // they're real ids.\n    const changesForCheck: Partial<Task> = { ...changes };\n    delete changesForCheck.dependencies;\n    const check = validateTaskEdit(audience, flattenTasks(tasks), target.id, changesForCheck, catalog);\n    if (!check.ok) return { error: `${label}: ${check.error}` };\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, opIndex);\n      if (bad.length) return { error: `${label}: unknown dependencies: ${bad.join(', ')}` };\n      changes.dependencies = ids.filter((id) => id !== target.id);\n    }\n    return { target, changes, check };\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 prep = prepareEdit(op, i, label, 'planner');\n        if ('error' in prep) { errors.push(prep.error); break; }\n        const { target, changes, check } = prep;\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          subtasks: withSkillNames(spec.subtasks),\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 = [...new Map(resolved.map((t) => [t!.id, t!])).values()].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          ops: inheritedOps(toMerge, spec.ops),\n          skills: inheritedSkills(spec.skills, toMerge.flatMap((t) => t.skills ?? [])),\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            ops: inheritedOps([target], spec.ops),\n            skills: inheritedSkills(spec.skills, target.skills),\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        // Re-arming is the sanctioned exception to the planner lock — its whole\n        // point is to touch a task the lock would otherwise refuse — so it\n        // validates as a direct edit; well-formedness still applies.\n        const prep = prepareEdit(op, i, label, 'direct', true);\n        if ('error' in prep) { errors.push(prep.error); break; }\n        const { target, changes, check } = prep;\n        tasks = updateTaskInPlan(tasks, target.id, { ...changes, status: 'pending', verdict: undefined, outputSummary: undefined, awaitingReason: 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 { v4 as uuidv4 } from 'uuid';\nimport type { PlanIsolation } from '../interfaces/IWorktreeIsolation';\nimport type { PlannerUsage, UsageRecord, UsageTotals } from './Usage';\nimport type { SkillSource } from '../services/SkillsService';\nimport { SKILL_NAME_PATTERN } from '../conversation/skillTokens';\n\nexport interface UserStep {\n  order: number;\n  instruction: string;\n  completed: boolean;\n}\n\n/** One deterministic signal gathered while verifying a completed task. `completion_marker` is only in verdicts saved before completion was reported through `task_complete` alone. */\nexport interface VerificationCheck {\n  name: 'exit_code' | 'completion_marker' | 'task_complete' | 'manual';\n  passed: boolean;\n  /** A check that did not apply. Skipped checks don't affect the verdict. */\n  skipped: boolean;\n  detail: string;\n}\n\n/** Evidence-based verdict for a completed task. Single end-to-end outcome produced by verification. */\nexport interface Verdict {\n  outcome: 'pass' | 'fail';\n  reason: string;\n  checks: VerificationCheck[];\n  decidedAt: string;\n}\n\nexport interface TaskOutputSummary {\n  reviewReason: string;\n  logTail: string;\n  capturedAt: string;\n}\n\nexport type TaskType = 'ai' | 'user';\nexport type TaskStatus = 'pending' | 'approved' | 'in_progress' | 'completed' | 'failed' | 'blocked' | 'awaiting_user';\nexport type TaskMode = string;\n\n/**\n * Why an `awaiting_user` task waits (ADR-0018, W1): a structured turn that\n * ended without a `task_complete` call, a checkpoint question, work that did not\n * land, or an ops task that changed tracked files (ADR-0020). Saved, so no\n * surface has to guess it from whether an attempt is live.\n */\nexport type AwaitingReason = 'input' | 'checkpoint' | 'conflict' | 'files-changed';\n\nexport function isAwaitingReason(value: unknown): value is AwaitingReason {\n  return value === 'input' || value === 'checkpoint' || value === 'conflict' || value === 'files-changed';\n}\n\nexport interface TaskModelAssignment {\n  modelId: string;\n  modelLabel: string;\n  thinkingEffort?: string;\n  /**\n   * All variant ids the model offered when this assignment was made. Carried\n   * on the assignment because runners need it at spawn time (opencode's TUI\n   * only honors an assigned variant when the others are config-disabled) and\n   * the discovery catalog isn't available there.\n   */\n  availableVariants?: string[];\n}\n\nexport type RunnerId = string;\n\n/**\n * Bring loaded tasks to the structured-only shape, in place. A task saved\n * while the terminal transport existed may say it ran there, and why; neither\n * means anything now, and such a task left no session to continue. Its\n * completion marker id went with the text markers: completion is reported\n * only through `task_complete`.\n */\nexport function migrateLoadedTasks(tasks: readonly Task[]): void {\n  for (const task of tasks) {\n    if (typeof task.runnerSessionId !== 'string') delete task.runnerSessionId;\n    const legacy = task as Task & { transport?: { kind?: unknown; nativeSessionId?: unknown } };\n    if (!task.runnerSessionId && legacy.transport?.kind === 'structured' && typeof legacy.transport.nativeSessionId === 'string') {\n      task.runnerSessionId = legacy.transport.nativeSessionId;\n    }\n    delete legacy.transport;\n    delete (task as { completionMarker?: unknown }).completionMarker;\n    migrateLoadedTasks(task.subtasks ?? []);\n  }\n}\n\n/**\n * A task skill as one attempt received it: read from the task's own worktree\n * (or global) at spawn, kept so the user can see what the runner was told\n * even after the skill's file changes.\n */\nexport interface TaskSkillSnapshot {\n  name: string;\n  source: SkillSource;\n  path: string;\n  content: string;\n}\n\n/** A task skill as a surface is told of it: the body stays in the task's log file and the session. */\nexport type TaskSkillNotice = Omit<TaskSkillSnapshot, 'content'>;\n\nexport interface Task {\n  id: string;\n  order: number;\n  title: string;\n  description: string;\n  type: TaskType;\n  status: TaskStatus;\n  dependencies: string[];\n  prompt?: string;\n  userSteps?: UserStep[];\n  subtasks: Task[];\n  verdict?: Verdict;\n  outputSummary?: TaskOutputSummary;\n  assignedModel?: TaskModelAssignment;\n  assignedRunner: RunnerId;\n  thinkingEffort?: string;\n  taskMode?: TaskMode;\n  autonomy?: 'AFK' | 'HITL';\n  sliceType?: 'HITL' | 'AFK';\n  userStoriesCovered?: string[];\n  /** The runner's saved session for a later continue; cleared when a fresh attempt starts. */\n  runnerSessionId?: string;\n  /** Set only while `status` is `awaiting_user`, and not always then — a usage-limit pause has none. */\n  awaitingReason?: AwaitingReason;\n  /**\n   * An ops task (ADR-0020): it changes no repository files, runs at the\n   * workspace root rather than in a worktree, and waits for the change tasks\n   * it depends on to be merged into the user's branch. Top-level AI tasks\n   * only; absent means a change task.\n   */\n  ops?: boolean;\n  /**\n   * The dependencies, by title, whose work was not merged into the user's\n   * branch when the user force-started this task past its merge gate\n   * (ADR-0020). Cleared when the task is retried.\n   */\n  forcedPastGate?: string[];\n  /**\n   * Task skills (`applies-to: task`) attached by name. Their bodies are put in\n   * the runner's prompt at spawn, resolved where the task runs — a subtask's\n   * are its own, never its parent's. Absent means none.\n   */\n  skills?: string[];\n  /** The skills the latest attempt was given, as read when it spawned. */\n  attemptSkills?: TaskSkillSnapshot[];\n}\n\nexport interface DiscoveredMode {\n  id: string;\n  label: string;\n  description: string;\n}\n\nexport type ResearchToolType =\n  | 'read_file' | 'read_files' | 'glob' | 'grep' | 'find_symbol' | 'list_dir'\n  | 'bash' | 'fetch' | 'web_search' | 'spawn_research_agent'\n  /**\n   * A tool belonging to a harness planner's own toolbox (ADR-0009) that has no\n   * Ordewell equivalent — Edit, WebFetch, TodoWrite, whatever a coding agent\n   * ships next. The real name travels in `toolLabel` rather than being\n   * relabelled as a tool it is not; the union stays closed so the\n   * exhaustiveness checks in every surface's icon/label switch survive.\n   */\n  | 'agent_tool';\n\n/**\n * What happened when a research tool call ran, for honest per-surface\n * rendering. The broadcast seam carries this on every `research_step_done` so\n * surfaces do not have to pattern-match refusal text to tell a refused `rm`\n * from a successful `rm` — the old render path flipped a `✓` for both.\n */\nexport type ResearchStepOutcome = 'success' | 'failure' | 'refused' | 'denied' | 'not_executed';\n\nexport interface ResearchStep {\n  id: string;\n  tool: ResearchToolType;\n  /** The tool's own name when it came from a harness planner — always set for `agent_tool`. */\n  toolLabel?: string;\n  args: string;\n  result: string;\n  success: boolean;\n  outcome: ResearchStepOutcome;\n  /** The model's tool_call id, so a surface can match `tool_result` to the\n   * pending `tool_call` it announced — robust under parallel same-tool rounds. */\n  toolCallId?: string;\n  /** The research subagent that ran the call, so a reload regroups it under that subagent. */\n  subagentId?: string;\n  timestamp: string;\n  thinkingText?: string;\n}\n\nexport interface UserPromptEntry {\n  id: string;\n  type: 'user_prompt' | 'system';\n  content: string;\n  timestamp: string;\n}\n\nexport type SubagentOutcome = 'done' | 'failed' | 'stopped';\n\n/**\n * One subagent's whole run, logged when it finishes: what it was asked, how it\n * ended and what it reported. Its steps stay separate entries carrying the same\n * `subagentId`, so an older reader that knows only steps still shows them.\n */\nexport interface SubagentLogEntry {\n  id: string;\n  type: 'subagent';\n  subagentId: string;\n  brief: string;\n  model?: string;\n  outcome: SubagentOutcome;\n  digest: string;\n  usage?: UsageTotals;\n  timestamp: string;\n}\n\nexport type ResearchLogEntry = ResearchStep | UserPromptEntry | SubagentLogEntry;\n\nexport interface ResearchProgress {\n  // 'liveness' carries no content: a raw-line signal from the harness process\n  // (ADR-0009) that reaches a surface even when a turn is producing nothing\n  // visible — a subagent's filtered chatter, most often — so an idle watchdog\n  // downstream doesn't mistake \"nothing to show\" for \"nothing happening\".\n  //\n  // The turn-scoped kinds below carry one planner turn's stream (#47); see the\n  // matching SessionMessage variants for the invariants each one keeps.\n  // 'text_delta' is reply text as the model streams it (`text`, `segmentId`),\n  // an envelope included: the turn's owner routes each segment to prose or to\n  // the plan display, so no backend has to tell them apart. 'text_retracted'\n  // takes back an attempt's text: `segmentId`'s, or when absent everything the\n  // backend call that sends it has streamed.\n  // 'usage' reports one model call (`record`). 'subagent_started' carries\n  // `brief` and `model`; 'subagent_finished' carries `outcome`, `digest` and\n  // `usage`.\n  type:\n    | 'thinking' | 'tool_call' | 'tool_result' | 'plan_token' | 'interrupted' | 'liveness'\n    | 'text_delta' | 'text_retracted' | 'usage' | 'subagent_started' | 'subagent_finished';\n  /** Minted by whoever runs the turn and passed through untouched; absent outside a turn. */\n  turnId?: string;\n  /** One continuous run of model text — text before a tool call is its own segment. */\n  segmentId?: string;\n  text?: string;\n  tool?: string;\n  /** Harness planners (ADR-0009): the agent's own name for a tool Ordewell has no member for. */\n  toolLabel?: string;\n  toolArgs?: string;\n  toolResult?: string;\n  planToken?: string;\n  step?: ResearchStep;\n  /** The model's tool_call id, threaded on tool_call and tool_result so a\n   * surface can match the result to its pending call — robust under parallel\n   * same-tool rounds where LIFO-by-name matching mislabels summaries. */\n  toolCallId?: string;\n  /** Present when this event originates from (or reports on) one spawned research subagent (issue #34). */\n  subagentId?: string;\n  record?: UsageRecord;\n  brief?: string;\n  model?: string;\n  outcome?: SubagentOutcome;\n  digest?: string;\n  usage?: UsageTotals;\n}\n\nexport interface ThinkingBlock {\n  id: string;\n  text: string;\n}\n\nexport interface StreamThinkingEvent {\n  type: 'thinking';\n  block: ThinkingBlock;\n}\n\nexport interface StreamStepEvent {\n  type: 'step';\n  step: ResearchStep;\n}\n\nexport type StreamEvent = StreamThinkingEvent | StreamStepEvent;\n\nexport interface DiscoveredModel {\n  modelId: string;\n  modelLabel: string;\n  runnerProvider?: string;\n  /**\n   * Human-facing provider name as the runner itself reports it (e.g.\n   * \"OpenCode Zen\" for `runnerProvider: 'opencode'`). Populated from the\n   * runner's own provider catalog when available; when absent the UI derives a\n   * label from `runnerProvider` by title-casing.\n   */\n  runnerProviderLabel?: string;\n  /**\n   * The runner whose catalog listed this model. Stamped once, at the single\n   * `ModelDiscovery.discover` choke point, so a flat cross-runner list can\n   * still say where each entry came from — `runnerProvider` alone cannot:\n   * OpenCode reports most of its catalog as `openrouter`, which names the\n   * serving backend, not the agent Ordewell would spawn.\n   */\n  runnerId?: string;\n  /** The runner's display name (`OpenCode`), from its manifest. */\n  runnerLabel?: string;\n  variants: { id: string; label: string }[];\n  /**\n   * The model's context window when the runner or catalog reports it (#49).\n   * Read by the planner-model lookup so context fill can be shown; absent when\n   * unknown rather than defaulted to zero.\n   */\n  contextWindow?: number;\n}\n\nexport type PlanStatus = 'draft' | 'approved' | 'rejected' | 'running' | 'completed';\n\n/**\n * One entry of the planner's persisted dialogue (ADR-0002). The single source\n * of truth for both UI redisplay and conversational context. Tool-call results\n * are NOT stored here — they live in the AI service's tool-use history;\n * `researchLog` remains the persisted tool trace for the UI.\n */\nexport interface ConversationMessage {\n  role: 'user' | 'assistant';\n  content: string;\n  timestamp: string;\n  /**\n   * Timeline marker: 'plan_generated' records the point in the dialogue where\n   * the plan was committed (the UI anchors the plan card there on restore);\n   * 'system' is a host-injected notice; 'compaction' is the summary a\n   * user-triggered compaction left in place of the earlier messages — always\n   * the transcript's first entry. 'skill_load' is a skill loaded into the\n   * conversation, its snapshot in `skill`; one the user invoked follows the\n   * message that named it. Absent for ordinary chat turns, so sessions saved\n   * before markers existed degrade gracefully.\n   */\n  kind?: 'plan_generated' | 'system' | 'compaction' | 'skill_load';\n  /** Present exactly when `kind` is 'skill_load'. */\n  skill?: SkillLoad;\n}\n\n/**\n * A skill's SKILL.md as it was when loaded into a planner conversation. A\n * snapshot rather than a reference: a resumed, forked or rewound conversation\n * replays the body the planner originally saw, even after the file changed or\n * was deleted.\n */\nexport interface SkillLoad {\n  invokedBy: 'user' | 'planner';\n  name: string;\n  source: SkillSource;\n  /** The SKILL.md that won, home-abbreviated (`~/...`): which copy loaded is what a reader needs from it. */\n  path: string;\n  content: string;\n  /**\n   * Set when the user named a task skill: it is not loaded into the planner's\n   * context, which is only told to attach it to the tasks it fits. `content`\n   * is empty; the description is what the planner's directive quotes.\n   */\n  attaches?: { description: string };\n}\n\n/** A skill load as a surface announces it — the body stays with the transcript. */\nexport type SkillLoadNotice = Omit<SkillLoad, 'content'>;\n\n/** A message the user sent, as opposed to a skill load their message caused. */\nexport function isUserMessage(entry: ConversationMessage): boolean {\n  return entry.role === 'user' && entry.kind !== 'skill_load';\n}\n\nexport interface QueuedMessage {\n  id: string;\n  text: string;\n  timestamp: string;\n  /** What its `/name` tokens loaded when it was sent: the drain composes them with the text, as a live send does. */\n  skills?: SkillLoad[];\n}\n\nexport interface PlanModificationWarnings {\n  deletedCompleted: string[];\n  changedCompleted: string[];\n  deletedInProgress: string[];\n  modifiedInProgress: string[];\n  brokenDependencies: string[];\n}\n\nexport function emptyWarnings(): PlanModificationWarnings {\n  return { deletedCompleted: [], changedCompleted: [], deletedInProgress: [], modifiedInProgress: [], brokenDependencies: [] };\n}\n\nexport interface LegacyPlanState {\n  tasks: Task[];\n  generatedAt: string;\n  status: PlanStatus;\n  runners: RunnerId[];\n  lastUpdated: string;\n  researchLog?: ResearchLogEntry[];\n  /** The planner dialogue — user messages and assistant messages, in order (ADR-0002). */\n  conversationHistory?: ConversationMessage[];\n  /** Full markdown PRD once written by the planner (PRD mode), also saved to .scratch/<slug>/PRD.md. */\n  prdMarkdown?: string;\n  /** Follow-ups queued while tasks execute — applied as plan modifications between batches. */\n  queuedMessages?: QueuedMessage[];\n  /**\n   * The plan's isolation run (ADR-0013), written from the orchestrator at\n   * persist time and read back only when a saved plan is adopted. It names\n   * branches and worktrees that belong to this plan alone: a fork of the plan\n   * must leave it behind rather than share it.\n   */\n  isolation?: PlanIsolation;\n  /** Kept so a reopened session shows the same token line (#49). */\n  plannerUsage?: PlannerUsage;\n}\n\nexport interface Message {\n  id: string;\n  role: 'user' | 'planner' | 'system';\n  content: string;\n  timestamp: number;\n}\n\nexport interface TaskSnapshot extends Task {\n  completedAt: number;\n  verdict?: Verdict;\n  retryCount: number;\n  finalized: boolean;\n}\n\nexport type PlanState =\n  | {\n      phase: 'planning';\n      history: Message[];\n      message: string;\n      pendingTasks: Task[];\n    }\n  | {\n      phase: 'executing';\n      history: Message[];\n      message: string;\n      executionLog: TaskSnapshot[];\n      pendingTasks: Task[];\n      goal: string;\n      runners: string[];\n      status: PlanStatus;\n    };\n\nfunction hasPhase(raw: unknown): raw is PlanState {\n  return typeof raw === 'object' && raw !== null && 'phase' in raw;\n}\n\nfunction hasTasks(raw: unknown): raw is LegacyPlanState {\n  return typeof raw === 'object' && raw !== null && 'tasks' in raw && Array.isArray((raw as Record<string, unknown>).tasks);\n}\n\nfunction logEntryToMessage(entry: ResearchLogEntry): Message {\n  const timestamp = new Date(entry.timestamp).getTime();\n  if (!('type' in entry)) {\n    return { id: entry.id, role: 'system', content: JSON.stringify({ tool: entry.tool, args: entry.args, result: entry.result }), timestamp };\n  }\n  if (entry.type === 'subagent') {\n    const { subagentId, brief, outcome, digest } = entry;\n    return { id: entry.id, role: 'system', content: JSON.stringify({ subagentId, brief, outcome, digest }), timestamp };\n  }\n  return { id: entry.id, role: entry.type === 'user_prompt' ? 'user' : 'system', content: entry.content, timestamp };\n}\n\nfunction migrateHistory(raw: LegacyPlanState): Message[] {\n  const messages: Message[] = [];\n\n  if (raw.researchLog) {\n    messages.push(...raw.researchLog.map(logEntryToMessage));\n  }\n\n  if (raw.queuedMessages) {\n    for (const qm of raw.queuedMessages) {\n      messages.push({\n        id: qm.id,\n        role: 'system',\n        content: qm.text,\n        timestamp: new Date(qm.timestamp).getTime(),\n      });\n    }\n  }\n\n  return messages;\n}\n\nexport function migratePlanState(raw: unknown): PlanState {\n  if (hasPhase(raw)) return raw;\n\n  if (!hasTasks(raw)) {\n    return {\n      phase: 'planning',\n      history: [],\n      message: '',\n      pendingTasks: [],\n    };\n  }\n\n  const hasExecution = raw.tasks.some(\n    (t) => t.status === 'completed' || t.status === 'failed',\n  );\n\n  const messages = migrateHistory(raw);\n\n  if (hasExecution) {\n    const executionLog: TaskSnapshot[] = raw.tasks\n      .filter((t) => t.status === 'completed' || t.status === 'failed')\n      .map((t) => ({\n        ...t,\n        completedAt: new Date(raw.lastUpdated).getTime(),\n        verdict: t.verdict,\n        retryCount: 0,\n        finalized: true,\n      }));\n\n    const pendingTasks = raw.tasks.filter(\n      (t) => t.status !== 'completed' && t.status !== 'failed' && t.status !== 'blocked',\n    );\n\n    return {\n      phase: 'executing',\n      history: messages,\n      message: '',\n      executionLog,\n      pendingTasks,\n      goal: '',\n      runners: raw.runners,\n      status: raw.status,\n    };\n  }\n\n  return {\n    phase: 'planning',\n    history: messages,\n    message: '',\n    pendingTasks: raw.tasks,\n  };\n}\n\nexport function migrateLegacyPlan(legacy: LegacyPlanState): PlanState {\n  const messages: Message[] = [];\n\n  if (legacy.researchLog) {\n    messages.push(...legacy.researchLog.map(logEntryToMessage));\n  }\n\n  if (legacy.queuedMessages) {\n    for (const qm of legacy.queuedMessages) {\n      messages.push({\n        id: qm.id,\n        role: 'system',\n        content: qm.text,\n        timestamp: new Date(qm.timestamp).getTime(),\n      });\n    }\n  }\n\n  const isPlanning = legacy.status === 'draft' || legacy.status === 'approved' || legacy.status === 'rejected';\n\n  if (isPlanning) {\n    return {\n      phase: 'planning',\n      history: messages,\n      message: 'Plan generation',\n      pendingTasks: legacy.tasks.filter((t) => t.status === 'pending' || t.status === ('draft' as never)),\n    };\n  }\n\n  const nonCompletedTasks = legacy.tasks.filter(\n    (t) => t.status !== 'completed' && t.status !== 'failed' && t.status !== 'blocked'\n  );\n\n  const completedSnapshot: TaskSnapshot[] = legacy.tasks\n    .filter((t) => t.status === 'completed' || t.status === 'failed')\n    .map((t) => ({\n      ...t,\n      completedAt: new Date(legacy.lastUpdated).getTime(),\n      verdict: t.verdict,\n      retryCount: 0,\n      finalized: true,\n    }));\n\n  return {\n    phase: 'executing',\n    history: messages,\n    message: 'Plan migration',\n    executionLog: completedSnapshot,\n    pendingTasks: nonCompletedTasks,\n    goal: 'Plan migration',\n    runners: legacy.runners,\n    status: legacy.status,\n  };\n}\n\nexport { taskOrderLabel, taskRef, titledTaskRef, resolveOrderLabel } from '../order-labels';\n\nexport function createTask(overrides: Partial<Task> = {}): Task {\n  const skills = skillNames(overrides.skills);\n  return {\n    id: overrides.id ?? uuidv4(),\n    order: overrides.order ?? 0,\n    title: overrides.title ?? '',\n    description: overrides.description ?? '',\n    type: overrides.type ?? 'ai',\n    status: overrides.status ?? 'pending',\n    dependencies: overrides.dependencies ?? [],\n    prompt: overrides.prompt,\n    userSteps: overrides.userSteps,\n    subtasks: overrides.subtasks ?? [],\n    verdict: overrides.verdict,\n    outputSummary: overrides.outputSummary,\n    assignedModel: overrides.assignedModel,\n    assignedRunner: overrides.assignedRunner ?? 'claude-code',\n    thinkingEffort: overrides.thinkingEffort,\n    taskMode: overrides.taskMode ?? 'build',\n    autonomy: overrides.autonomy,\n    sliceType: overrides.sliceType,\n    userStoriesCovered: overrides.userStoriesCovered,\n    ...(opsFlag(overrides.ops, overrides.type) ? { ops: true } : {}),\n    ...(skills ? { skills } : {}),\n  };\n}\n\n/**\n * A name a skill can have, lower-cased as `/name` is. Anything else — a path\n * separator, `..` — is joined into a path and could only reach outside the\n * skill dirs.\n */\nconst SKILL_NAME = new RegExp(`^${SKILL_NAME_PATTERN}$`);\n\nexport function isSkillName(name: string): boolean {\n  return SKILL_NAME.test(name);\n}\n\n/**\n * The `skills` field as a task stores it, however it arrived: the planner's\n * JSON is untyped. Names are trimmed, lower-cased and deduplicated, and one\n * no skill could have is dropped; none at all is stored absent, so a plan\n * without skills reads exactly as it did before them.\n */\nexport function skillNames(value: unknown): string[] | undefined {\n  if (!Array.isArray(value)) return undefined;\n  const names = [...new Set(value.filter((v): v is string => typeof v === 'string').map((v) => v.trim().toLowerCase()).filter(isSkillName))];\n  return names.length > 0 ? names : undefined;\n}\n\n/**\n * The skills of a task a merge or a split makes from others: what the edit\n * chose when it named any, none when it chose an explicit `[]`, else what the\n * tasks it came from had — a malformed value is not a request to drop them.\n */\nexport function inheritedSkills(chosen: unknown, inherited: readonly string[] | undefined): string[] | undefined {\n  if (Array.isArray(chosen) && chosen.length === 0) return undefined;\n  return skillNames(chosen) ?? skillNames(inherited);\n}\n\n/**\n * The `ops` flag as a task stores it (ADR-0020), however it arrived. Only a\n * literal `true` on an AI task marks an ops task: the planner's JSON is\n * untyped, and a quoted \"true\" read as ops would move a task out of its\n * worktree. Anything else is a change task, stored absent so saved plans need\n * no migration. Whether the task may be ops at all — a subtask may not — is\n * for whoever knows where it sits: parsing drops the flag, an edit refuses it.\n */\nexport function opsFlag(value: unknown, type: Task['type'] = 'ai'): true | undefined {\n  return value === true && type === 'ai' ? true : undefined;\n}\n\n/**\n * The flag of a task a merge or a split makes from others: what the edit\n * chose, else ops only when every task it came from was. A merge that takes\n * in a change edits files, so it is a change; a split part runs where its\n * task did.\n */\nexport function inheritedOps(from: readonly Pick<Task, 'ops'>[], chosen?: boolean): boolean {\n  return chosen ?? from.every((t) => opsFlag(t.ops) === true);\n}\n\n/** The runner set a plan has until one is chosen: the one runner every host ships. */\nexport const DEFAULT_RUNNERS: readonly RunnerId[] = ['claude-code'];\n\nexport function createEmptyPlan(): LegacyPlanState {\n  return {\n    tasks: [],\n    generatedAt: new Date().toISOString(),\n    status: 'draft',\n    runners: [...DEFAULT_RUNNERS],\n    lastUpdated: new Date().toISOString(),\n  };\n}\n\nexport function flattenTasks(tasks: readonly Task[]): Task[] {\n  return tasks.flatMap((t) => [t, ...flattenTasks(t.subtasks ?? [])]);\n}\n\n/** A flattened task with the parent it hangs under, null for a top-level task. */\nexport interface TaskWithParent {\n  task: Task;\n  parent: Task | null;\n}\n\nexport function flattenTasksWithParents(tasks: readonly Task[]): TaskWithParent[] {\n  const rows: TaskWithParent[] = [];\n  const walk = (t: Task, parent: Task | null) => {\n    rows.push({ task: t, parent });\n    for (const sub of t.subtasks ?? []) walk(sub, t);\n  };\n  for (const t of tasks) walk(t, null);\n  return rows;\n}\n\nexport function migrateTask(task: Record<string, unknown>): Task {\n  if (!task.assignedModel) {\n    task.assignedModel = undefined;\n  }\n  if (!task.assignedRunner) {\n    task.assignedRunner = 'claude-code';\n  }\n  if (!task.thinkingEffort) {\n    task.thinkingEffort = undefined;\n  }\n  if (task.verdict && task.verification) {\n    delete task.verification;\n  }\n  if (!task.autonomy) {\n    task.autonomy = undefined;\n  }\n  if (!task.sliceType) {\n    task.sliceType = undefined;\n  }\n  if (!task.userStoriesCovered) {\n    task.userStoriesCovered = undefined;\n  }\n  return task as unknown as Task;\n}\n\nexport function addTaskToPlan(tasks: readonly Task[], partial: Partial<Task>): Task[] {\n  const maxOrder = tasks.reduce((max, t) => Math.max(max, t.order), 0);\n  const newTask = createTask({\n    ...partial,\n    order: partial.order ?? maxOrder + 1,\n    status: 'pending',\n  });\n  return renumberTasks([...tasks, newTask]);\n}\n\nexport function removeTaskFromPlan(tasks: readonly Task[], taskId: string): Task[] {\n  const result = tasks\n    .filter((t) => t.id !== taskId)\n    .map((t) => ({\n      ...t,\n      dependencies: t.dependencies.filter((depId) => depId !== taskId),\n      subtasks: removeTaskFromPlan(t.subtasks, taskId),\n    }));\n  return renumberTasks(result);\n}\n\nexport function updateTaskInPlan(tasks: readonly Task[], taskId: string, changes: Partial<Task>): Task[] {\n  return renumberTasks(\n    tasks.map((t) => {\n      if (t.id === taskId) return { ...t, ...changes, id: t.id };\n      return { ...t, subtasks: updateTaskInPlan(t.subtasks, taskId, changes) };\n    })\n  );\n}\n\nexport function renumberTasks(tasks: readonly Task[]): Task[] {\n  return tasks.map((t, i) => ({\n    ...t,\n    order: i + 1,\n    subtasks: renumberTasks(t.subtasks),\n  }));\n}\n\n/** Done, running, or held for the user: execution state only a runner or the user can change. */\nconst SETTLED_STATUSES: ReadonlySet<TaskStatus> = new Set<TaskStatus>(['completed', 'in_progress', 'awaiting_user']);\n\nfunction holdsSettledWork(task: Task): boolean {\n  return SETTLED_STATUSES.has(task.status) || (task.subtasks ?? []).some(holdsSettledWork);\n}\n\n/**\n * Lay a planner-written task list over the plan it rewrites without letting it\n * change execution state. A planner restates tasks; it never witnessed one run,\n * so the status it writes is not evidence. A settled task is kept exactly as\n * it stands wherever the rewrite names it, and put back beside its old\n * neighbour where the rewrite leaves it out. Every other task keeps the status\n * it had; a task the rewrite adds starts pending.\n */\nexport function keepExecutionState(current: readonly Task[], rewrite: Task[]): Task[] {\n  const existing = new Map(flattenTasks(current).map((t) => [t.id, t]));\n  const named = new Set(flattenTasks(rewrite).map((t) => t.id));\n\n  const overlay = (tasks: Task[], was: readonly Task[]): Task[] => {\n    const result = tasks.map((t): Task => {\n      const prior = existing.get(t.id);\n      if (prior && SETTLED_STATUSES.has(prior.status)) return { ...prior };\n      return {\n        ...t,\n        status: prior?.status ?? 'pending',\n        verdict: prior?.verdict,\n        outputSummary: prior?.outputSummary,\n        runnerSessionId: prior?.runnerSessionId,\n        attemptSkills: prior?.attemptSkills,\n        // Where a task that has run ran is fixed, like its runner session (ADR-0020).\n        ...(prior?.status === 'failed' ? { ops: prior.ops } : {}),\n        forcedPastGate: prior?.forcedPastGate,\n        subtasks: overlay(t.subtasks ?? [], prior?.subtasks ?? []),\n      };\n    });\n    was.forEach((left, i) => {\n      if (named.has(left.id) || !holdsSettledWork(left)) return;\n      const neighbour = was.slice(0, i).reverse().find((t) => result.some((r) => r.id === t.id));\n      const at = neighbour ? result.findIndex((r) => r.id === neighbour.id) + 1 : 0;\n      result.splice(at, 0, { ...left });\n    });\n    return result;\n  };\n\n  return renumberTasks(overlay(rewrite, current));\n}\n\n/** What only execution reads; {@link keepExecutionState} puts it back on whatever a planner returns. */\nconst EXECUTION_ONLY = ['attemptSkills', 'runnerSessionId', 'awaitingReason', 'forcedPastGate', 'outputSummary'] as const satisfies readonly (keyof Task)[];\n\nexport type PlannerTaskView = Omit<Task, typeof EXECUTION_ONLY[number] | 'subtasks'> & { subtasks: PlannerTaskView[] };\n\n/**\n * A task as a planner prompt carries it. An attempt's skill snapshots are\n * whole SKILL.md bodies and an output summary holds a log tail: sent on every\n * planner call, they cost tokens and invite the planner to edit state it does\n * not own.\n */\nexport function plannerTaskView(task: Task): PlannerTaskView {\n  const view: Record<string, unknown> = { ...task, subtasks: (task.subtasks ?? []).map(plannerTaskView) };\n  for (const key of EXECUTION_ONLY) delete view[key];\n  return view as PlannerTaskView;\n}\n\nexport function validateModifiedPlan(original: Task[], modified: Task[]): PlanModificationWarnings {\n  const allOriginal = flattenTasks(original);\n  const allModified = flattenTasks(modified);\n  const warnings = emptyWarnings();\n  const originalMap = new Map(allOriginal.map((t) => [t.id, t]));\n  const modifiedIds = new Set(allModified.map((t) => t.id));\n\n  for (const ot of originalMap.values()) {\n    if (ot.status === 'completed' && !modifiedIds.has(ot.id)) {\n      warnings.deletedCompleted.push(ot.title);\n    } else if (ot.status === 'in_progress' && !modifiedIds.has(ot.id)) {\n      warnings.deletedInProgress.push(ot.title);\n    }\n  }\n\n  for (const mt of allModified) {\n    const orig = originalMap.get(mt.id);\n    if (orig) {\n      if (orig.status === 'completed' && mt.status !== 'completed') {\n        warnings.changedCompleted.push(orig.title);\n      }\n      if (orig.status === 'in_progress' && (mt.status !== 'in_progress' || mt.prompt !== orig.prompt)) {\n        warnings.modifiedInProgress.push(orig.title);\n      }\n      if (orig.status === 'failed' && mt.status === 'pending') {\n        for (const dt of allModified) {\n          if (dt.dependencies.includes(mt.id) && dt.status === 'blocked') {\n            dt.status = 'pending';\n          }\n        }\n      }\n    }\n  }\n\n  for (const t of allModified) {\n    for (const depId of t.dependencies) {\n      if (!modifiedIds.has(depId)) {\n        warnings.brokenDependencies.push(`${t.title} → ${depId}`);\n      }\n    }\n  }\n\n  return warnings;\n}\n\nexport interface ActiveTaskSession {\n  id: string;\n  taskId: string;\n}\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nexport interface ValidationContext {\n  executionLog: TaskSnapshot[];\n  oldPending: Task[];\n  newPending: Task[];\n  activeSessions: Map<string, ActiveTaskSession>;\n}\n\nexport type ValidationCheck = (ctx: ValidationContext) => ValidationResult;\n\nexport function warningsText(w: PlanModificationWarnings): string | null {\n  const lines: string[] = [];\n  if (w.deletedCompleted.length) lines.push(`Completed tasks deleted: ${w.deletedCompleted.join(', ')}`);\n  if (w.changedCompleted.length) lines.push(`Completed tasks modified: ${w.changedCompleted.join(', ')}`);\n  if (w.deletedInProgress.length) lines.push(`In-progress tasks deleted: ${w.deletedInProgress.join(', ')}`);\n  if (w.modifiedInProgress.length) lines.push(`In-progress tasks modified: ${w.modifiedInProgress.join(', ')}`);\n  if (w.brokenDependencies.length) lines.push(`Broken dependencies: ${w.brokenDependencies.join(', ')}`);\n  return lines.length > 0 ? lines.join('\\n') : null;\n}\n","/** A name a skill can have, lower-cased: the one pattern for a `/name` token and for a skill folder. */\nexport const SKILL_NAME_PATTERN = '[a-z0-9][a-z0-9_-]*';\n\n/**\n * A `/skill-name` token anywhere in a message: whitespace (or string start)\n * before it, a skill name in any case, optional trailing punctuation that\n * isn't part of the name, then whitespace (or string end). The punctuation\n * group is what lets \"/grilling,\" name \"grilling\".\n */\nconst SKILL_TOKEN = new RegExp(`(^|\\\\s)\\\\/(${SKILL_NAME_PATTERN})([,.!?;:]*)(?=\\\\s|$)`, 'gi');\n\n/** Where a skill name is invoked: `start` is its `/`, `end` is just past the name, before any punctuation. */\nexport interface SkillToken {\n  name: string;\n  start: number;\n  end: number;\n}\n\n/**\n * The first `/name` token for each name in `text`, names lower-cased. Only\n * the first counts because a skill loads once per message however often it is\n * named, so a later repeat is plain text.\n */\nexport function skillTokens(text: string): SkillToken[] {\n  const tokens: SkillToken[] = [];\n  const seen = new Set<string>();\n  for (const match of text.matchAll(SKILL_TOKEN)) {\n    const name = match[2].toLowerCase();\n    if (seen.has(name)) continue;\n    seen.add(name);\n    const start = match.index + match[1].length;\n    tokens.push({ name, start, end: start + 1 + match[2].length });\n  }\n  return tokens;\n}\n\n/** The tokens in a sent message that loaded one of `loaded` — what a surface highlights in the user's bubble. */\nexport function loadedSkillTokens(text: string, loaded: readonly string[]): SkillToken[] {\n  return skillTokens(text).filter((t) => loaded.includes(t.name));\n}\n","import type { Task } from './models/Task';\n\n/**\n * Parent-scoped dotted order label for a task, e.g. \"2.1\" for the first subtask\n * of task 2. Kept in its own module (no Node imports) so a browser-bundled\n * surface — the VS Code webview — can import it via `@ordewell/core/order-labels`\n * without dragging the rest of core in.\n */\nexport function taskOrderLabel(task: { order: number }, parent?: { order: number }): string {\n  return parent ? `${parent.order}.${task.order}` : String(task.order);\n}\n\n/** How a surface refers to a task in prose: \"#2\", or \"#2.1\" for a subtask. */\nexport function taskRef(task: { order: number }, parent?: { order: number }): string {\n  return `#${taskOrderLabel(task, parent)}`;\n}\n\n/** A task named in full, as a confirmation or a picker title does: \"#2 Deploy\". */\nexport function titledTaskRef(task: { order: number; title: string }, parent?: { order: number }): string {\n  return `${taskRef(task, parent)} ${task.title}`;\n}\n\n/** Resolve a dotted label to a task in a plan's top-level task list. */\nexport function resolveOrderLabel(tasks: Task[], label: string): Task | undefined {\n  const parts = label.split('.');\n  if (parts.length > 2 || parts.some((p) => !/^\\d+$/.test(p))) return undefined;\n  const [topOrder, childOrder] = parts.map(Number);\n  const top = tasks.find((t) => t.order === topOrder);\n  if (!top) return undefined;\n  if (childOrder === undefined) return top;\n  return top.subtasks.find((s) => s.order === childOrder);\n}","import type { AwaitingReason } from '../models/Task';\n\n/**\n * What a row's status means to a reader, before any surface picks a word,\n * icon or colour for it. `quiet` is a running task whose runner has printed\n * nothing for a while — the status is still `in_progress`, so only the row,\n * never the store, tells the two apart.\n */\nexport type TaskStatusKind = 'todo' | 'running' | 'quiet' | 'awaiting' | 'blocked' | 'failed' | 'done';\n\n/** A task with a runner live behind it. `in_progress` is the store's own status. */\nexport const isTaskRunning = (task: { status: string }): boolean =>\n  task.status === 'in_progress' || task.status === 'running';\n\n/** Statuses of a task that has not started: what can still be started by hand, or flipped between change and ops (ADR-0020). */\nexport const NOT_STARTED: ReadonlySet<string> = new Set(['pending', 'approved', 'blocked']);\n\nexport function taskStatusKind(task: { status: string; idleSince?: string | null }): TaskStatusKind {\n  switch (task.status) {\n    case 'completed': return 'done';\n    case 'failed': return 'failed';\n    case 'blocked': return 'blocked';\n    case 'awaiting_user': return 'awaiting';\n  }\n  if (!isTaskRunning(task)) return 'todo';\n  return task.status === 'in_progress' && task.idleSince ? 'quiet' : 'running';\n}\n\nconst AWAITING_LABELS: Record<AwaitingReason, string> = {\n  input: 'Waiting for your input',\n  checkpoint: 'Checkpoint',\n  conflict: 'Merge conflict',\n  'files-changed': 'Changed tracked files',\n};\n\n/** What an awaiting_user task waits on (ADR-0018, W1); null when no reason was saved. */\nexport function awaitingLabel(task: { status: string; awaitingReason?: AwaitingReason }): string | null {\n  return task.status === 'awaiting_user' && task.awaitingReason ? AWAITING_LABELS[task.awaitingReason] : null;\n}\n\n/** Runner requests a task waits on (ADR-0018, A1); null when none do. */\nexport function approvalLabel(count: number | undefined): string | null {\n  if (!count) return null;\n  return count > 1 ? `Waiting for approval (${count})` : 'Waiting for approval';\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 { DiffStat, ToolHeadline } from './blocks';\n\n// eslint-disable-next-line no-control-regex\nconst ANSI_OR_CTRL_RE = /\\x1b\\[[0-9;?]*[A-Za-z]|\\x1b\\][^\\x07\\x1b]*(?:\\x07|\\x1b\\\\)?|\\x1b[()][AB012]|\\x1b[=>]|[\\x00-\\x08\\x0b-\\x1f\\x7f]/g;\n\n/**\n * How a command row names an Ordewell research tool. A harness planner's call\n * keeps the agent's own name instead (`toolLabel`, ADR-0009), so the row says\n * which tool actually ran.\n */\nconst DISPLAY_NAMES: Record<string, string> = {\n  read_file: 'Read',\n  read_files: 'Read',\n  list_dir: 'List',\n  glob: 'Glob',\n  grep: 'Grep',\n  find_symbol: 'Symbol',\n  bash: 'Bash',\n  fetch: 'Fetch',\n  web_search: 'WebSearch',\n  spawn_research_agent: 'Agent',\n};\n\n// Tried in order for a tool with no rule of its own: the field that names what\n// a call is about comes before the free text around it.\nconst HINT_FIELDS = ['file_path', 'filePath', 'path', 'url', 'pattern', 'query', 'command', 'description', 'prompt'] as const;\n\nfunction parseArgs(args: string): Record<string, unknown> | null {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    return parsed && typeof parsed === 'object' && !Array.isArray(parsed) ? parsed as Record<string, unknown> : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction oneLine(text: string): string {\n  return text.replace(/\\s+/g, ' ').trim();\n}\n\n// A command's later lines can change what it does (a heredoc body, a chained\n// step), so they are counted rather than folded into the first.\nfunction firstLineOf(command: string): string {\n  const lines = command.trim().split(/\\r?\\n/);\n  const more = lines.length - 1;\n  return more > 0 ? `${lines[0]} … +${more} line${more === 1 ? '' : 's'}` : lines[0];\n}\n\nfunction text(value: unknown): string {\n  return typeof value === 'string' ? value : '';\n}\n\nfunction searchArg(pattern: string, path: string, include = ''): string {\n  return `${pattern}${path ? ` in ${path}` : ''}${include ? ` (${include})` : ''}`;\n}\n\nfunction hintArg(args: Record<string, unknown>): string {\n  for (const field of HINT_FIELDS) {\n    const value = text(args[field]);\n    if (value) return field === 'command' ? firstLineOf(value) : oneLine(value);\n  }\n  const firstText = Object.values(args).find((v): v is string => typeof v === 'string' && v.trim() !== '');\n  return firstText ? oneLine(firstText) : '';\n}\n\nfunction keyArgOf(tool: string, args: Record<string, unknown>): string {\n  switch (tool) {\n    case 'bash':\n      return firstLineOf(text(args.command));\n    case 'read_file':\n    case 'list_dir':\n      return text(args.path);\n    case 'read_files':\n      return Array.isArray(args.paths) ? args.paths.map(String).join(', ') : '';\n    case 'glob':\n      return searchArg(text(args.pattern), text(args.path));\n    case 'grep':\n      return searchArg(text(args.pattern), text(args.path), text(args.include));\n    case 'find_symbol':\n      return `${text(args.symbol)}${text(args.language) ? ` [${text(args.language)}]` : ''}`;\n    case 'fetch':\n      return text(args.url);\n    case 'web_search':\n      return oneLine(text(args.query));\n    case 'spawn_research_agent':\n      return oneLine(text(args.prompt));\n    default:\n      return hintArg(args);\n  }\n}\n\n/**\n * The one-line head of a command row, shared by every surface: the tool's name\n * and the argument that says what the call is about.\n *\n * @param args The call's arguments as announced (JSON). Anything that is not a\n * JSON object is shown as it came, on one line.\n * @param toolLabel A harness planner's own name for the tool (ADR-0009).\n */\nexport function toolHeadline(tool: string, args: string, toolLabel?: string): ToolHeadline {\n  const name = toolLabel?.trim() || DISPLAY_NAMES[tool] || tool;\n  const parsed = parseArgs(args);\n  return { name, keyArg: parsed ? keyArgOf(tool, parsed) : oneLine(args) };\n}\n\nexport interface OutputPreview {\n  lines: string[];\n  hiddenLineCount: number;\n}\n\n/** The lines of a tool's output as a reader sees them — what {@link outputPreview} shows and counts. */\nexport function outputLines(output: string): string[] {\n  // Line endings first: CR is itself a control character the escape pass drops.\n  const lines = output.replace(/\\r\\n?/g, '\\n').replace(ANSI_OR_CTRL_RE, '').split('\\n');\n  while (lines.length > 0 && lines[lines.length - 1].trim() === '') lines.pop();\n  return lines;\n}\n\n/** The head of a tool's output for a collapsed row, and how many lines it leaves out. */\nexport function outputPreview(output: string, maxLines: number): OutputPreview {\n  const lines = outputLines(output);\n  const shown = lines.slice(0, Math.max(0, maxLines));\n  return { lines: shown, hiddenLineCount: lines.length - shown.length };\n}\n\n/**\n * The lines a diff adds and removes, or null when `output` is not one: every\n * line a hunk header, context, an addition or a removal, and at least one of\n * the last two.\n */\nexport function diffStat(output: string): DiffStat | null {\n  const lines = outputLines(output);\n  let added = 0;\n  let removed = 0;\n  for (const line of lines) {\n    if (line.startsWith('+')) added += 1;\n    else if (line.startsWith('-')) removed += 1;\n    else if (!(line.startsWith('@@') || line.startsWith(' ') || line === '' || line.startsWith('\\\\'))) return null;\n  }\n  return added + removed > 0 ? { added, removed } : null;\n}\n\n/** `gap` stands between two hunks, for the lines a diff leaves out. */\nexport type DiffRowKind = 'added' | 'removed' | 'context' | 'gap';\n\nexport interface DiffRow {\n  kind: DiffRowKind;\n  /** The line in the file: the old file's for a removal, the new file's otherwise. */\n  line?: number;\n  text: string;\n}\n\nconst HUNK_RANGE = /^@@ -(\\d+)(?:,\\d+)? \\+(\\d+)(?:,\\d+)? @@/;\n\n/** A diff as the rows a surface draws, numbered as an editor would number them. */\nexport function diffRows(output: string): DiffRow[] {\n  const rows: DiffRow[] = [];\n  let oldLine = 1;\n  let newLine = 1;\n  for (const line of outputLines(output)) {\n    const range = HUNK_RANGE.exec(line);\n    if (range) {\n      if (rows.length > 0) rows.push({ kind: 'gap', text: '' });\n      oldLine = Number(range[1]);\n      newLine = Number(range[2]);\n    } else if (line.startsWith('+')) {\n      rows.push({ kind: 'added', line: newLine++, text: line.slice(1) });\n    } else if (line.startsWith('-')) {\n      rows.push({ kind: 'removed', line: oldLine++, text: line.slice(1) });\n    } else if (!line.startsWith('\\\\')) {\n      rows.push({ kind: 'context', line: newLine, text: line.slice(1) });\n      oldLine += 1;\n      newLine += 1;\n    }\n  }\n  return rows;\n}\n\nfunction lines(count: number): string {\n  return `${count} line${count === 1 ? '' : 's'}`;\n}\n\n/** \"Added 2 lines, removed 1 line\": the summary every surface puts on an edit's row. */\nexport function diffSummary({ added, removed }: DiffStat): string {\n  if (!removed) return `Added ${lines(added)}`;\n  if (!added) return `Removed ${lines(removed)}`;\n  return `Added ${lines(added)}, removed ${lines(removed)}`;\n}\n","import type { ResearchToolType } from '../../models/Task';\n\n/**\n * Map a coding agent's own tool name onto Ordewell's research vocabulary\n * (ADR-0009, T5).\n *\n * A harness planner brings its own toolbox, and most of it overlaps ours: a\n * `Read` is a `read_file`, a `Grep` is a `grep`. Those map onto existing\n * members and render in every surface through the code path that is already\n * there. Everything else — `Edit`, `WebFetch`, `TodoWrite`, `Task`, whatever\n * ships next — becomes `agent_tool` carrying its real name.\n *\n * Nothing is relabelled as a tool it is not. Calling a web fetch a `bash` to\n * avoid adding a union member would put a lie in the timeline, which is the\n * point ADR-0008 spent its effort establishing.\n */\nconst KNOWN_TOOLS: Record<string, ResearchToolType> = {\n  // Claude Code\n  read: 'read_file',\n  grep: 'grep',\n  glob: 'glob',\n  bash: 'bash',\n  ls: 'list_dir',\n  webfetch: 'fetch',\n  websearch: 'web_search',\n  // Codex — its sandboxed command tool is a shell by another name\n  shell: 'bash',\n  exec_command: 'bash',\n  local_shell: 'bash',\n  // OpenCode\n  list: 'list_dir',\n  fetch: 'fetch',\n};\n\n/**\n * The tools that write a file, by their normalized names: Claude Code's,\n * OpenCode's, and the change kinds a Codex row is named for. Their output is\n * a diff (see `fileDiff.ts`) when the runner reported one.\n */\nconst FILE_EDIT_TOOLS = new Set(['edit', 'write', 'multiedit', 'notebookedit', 'applypatch', 'patch', 'add', 'update', 'delete', 'filechange']);\n\nexport function isFileEditTool(name: string): boolean {\n  return FILE_EDIT_TOOLS.has(name.trim().toLowerCase().replace(/[_-]/g, ''));\n}\n\nexport interface MappedTool {\n  tool: ResearchToolType;\n  /** The agent's own name, kept whenever it differs from the member it mapped to. */\n  toolLabel?: string;\n}\n\n/**\n * Classify one agent tool name. Case- and separator-insensitive, because the\n * three agents disagree on `Read` vs `read` vs `read_file` for the same thing.\n */\nexport function mapAgentTool(name: string): MappedTool {\n  const normalized = name.trim().toLowerCase().replace(/[_-]/g, '');\n  const direct = KNOWN_TOOLS[normalized] ?? KNOWN_TOOLS[name.trim().toLowerCase()];\n  if (direct) {\n    // The label survives even on a mapped tool: `Read` and `read_file` render\n    // the same way, but the transcript should still say which one ran.\n    return { tool: direct, toolLabel: name };\n  }\n  return { tool: 'agent_tool', toolLabel: name };\n}\n\n/**\n * Normalize an agent's tool arguments into the shapes `summarizeToolCall`\n * already knows how to read, so a harness `Read` gets a one-line summary\n * instead of a bare tool name. Unknown keys are preserved — the raw args stay\n * visible under the surfaces' output chevron.\n */\nexport function normalizeAgentArgs(tool: ResearchToolType, args: Record<string, unknown>): Record<string, unknown> {\n  const out = { ...args };\n  const alias = (from: string, to: string) => {\n    if (out[to] === undefined && out[from] !== undefined) out[to] = out[from];\n  };\n  if (tool === 'read_file' || tool === 'list_dir') {\n    alias('filePath', 'path');\n    alias('file_path', 'path');\n    alias('target', 'path');\n  }\n  if (tool === 'bash') {\n    alias('cmd', 'command');\n    alias('script', 'command');\n    // Codex hands the command over as an argv array; the summary wants a string.\n    if (typeof out.command !== 'string' && Array.isArray(out.command)) {\n      out.command = (out.command as unknown[]).join(' ');\n    }\n  }\n  if (tool === 'fetch') alias('uri', 'url');\n  if (tool === 'web_search') alias('q', 'query');\n  return out;\n}\n","import type { ResearchStep, ResearchStepOutcome, SkillLoadNotice } from '../models/Task';\nimport type { UsageLine } from '../models/Usage';\nimport type { MessageBlock, MessageRole, PlanMarkerStatus, SkillLoadBlock, SubagentBlock, ToolBlock, ToolStatus, UsageBlock } from './blocks';\nimport { diffStat, outputLines, toolHeadline } from './format';\nimport { isFileEditTool } from '../services/harness/agentTools';\n\n/*\n * How the session's records — messages, research steps, subagents, transcript\n * markers, usage totals — read as blocks. Shared by the live view and the\n * reload, so the two cannot disagree about what a record shows.\n */\n\n/** A line that is done: nothing streams into it any more. */\nexport function settledMessage(id: string, role: MessageRole, text: string, turnId?: string): MessageBlock {\n  return { type: 'message', id, role, text, streaming: false, ...(turnId ? { turnId } : {}) };\n}\n\n/** The user's message, marked with the skills it loaded when it loaded any. */\nexport function userMessage(id: string, text: string, skills: readonly SkillLoadNotice[], turnId?: string): MessageBlock {\n  const block = settledMessage(id, 'user', text, turnId);\n  return skills.length > 0 ? { ...block, skills: skills.map((s) => s.name) } : block;\n}\n\n/** What a surface is told of a load: everything but the body, which only the planner is sent. */\nexport function skillLoadNotice({ invokedBy, name, source, path, attaches }: SkillLoadNotice): SkillLoadNotice {\n  return { invokedBy, name, source, path, ...(attaches ? { attaches } : {}) };\n}\n\n/** `load_skill` as each harness names it: bare, `mcp__ordewell__load_skill`, `ordewell_load_skill`. */\nconst LOAD_SKILL_TOOL = /(?:^|_)load_skill$/;\n\n/**\n * A research step as a surface is sent it. A `load_skill` result is a skill's\n * body, which only the planner is sent; the session keeps it in the skill-load\n * entry, so the step need only say which skill loaded.\n */\nexport function surfaceStep(step: ResearchStep): ResearchStep {\n  if (!step.success || !LOAD_SKILL_TOOL.test(step.toolLabel ?? step.tool)) return step;\n  const name = loadedSkillName(step.args);\n  return { ...step, result: name ? `Loaded skill ${name}.` : 'Loaded a skill.' };\n}\n\nfunction loadedSkillName(args: string): string | undefined {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    const name = typeof parsed === 'object' && parsed !== null && 'name' in parsed ? parsed.name : undefined;\n    return typeof name === 'string' ? name : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\nexport function skillLoadBlock(id: string, { invokedBy, name, source, path, attaches }: SkillLoadNotice, turnId?: string): SkillLoadBlock {\n  return { type: 'skill_load', id, invokedBy, name, source, path, ...(attaches ? { attaches } : {}), ...(turnId ? { turnId } : {}) };\n}\n\ntype SubagentFields = Omit<SubagentBlock, 'type' | 'id' | 'toolCallId' | 'model' | 'usage' | 'turnId'>\n  & { toolCallId?: string; model?: string; usage?: SubagentBlock['usage']; turnId?: string };\n\nexport function subagentBlock(id: string, { toolCallId, model, usage, turnId, ...fields }: SubagentFields): SubagentBlock {\n  return {\n    type: 'subagent', id, ...fields,\n    ...(toolCallId ? { toolCallId } : {}),\n    ...(model ? { model } : {}),\n    ...(usage ? { usage } : {}),\n    ...(turnId ? { turnId } : {}),\n  };\n}\n\nexport function usageBlock(id: string, { totals, bySubagent, contextFill }: UsageLine): UsageBlock {\n  return { type: 'usage', id, totals, ...(bySubagent ? { bySubagent } : {}), ...(contextFill ? { contextFill } : {}) };\n}\n\nconst STATUS_OF_OUTCOME: Record<ResearchStepOutcome, ToolStatus> = {\n  success: 'ok',\n  failure: 'error',\n  refused: 'denied',\n  denied: 'denied',\n  not_executed: 'interrupted',\n};\n\nexport function finishedTool(call: ToolBlock, output: string, outcome: ResearchStepOutcome): ToolBlock {\n  const diff = outcome === 'success' && isFileEditTool(call.toolLabel ?? call.tool) ? diffStat(output) : null;\n  return { ...call, status: STATUS_OF_OUTCOME[outcome], outcome, output, outputLineCount: outputLines(output).length, ...(diff ? { diff } : {}) };\n}\n\nexport function settledTool(call: ToolBlock, step: ResearchStep): ToolBlock {\n  return finishedTool(call, step.result, step.outcome);\n}\n\nexport interface AnnouncedCall {\n  tool: string;\n  toolLabel?: string;\n  args: string;\n  toolCallId?: string;\n  turnId?: string;\n}\n\nexport function pendingTool(id: string, { tool, toolLabel, args, toolCallId, turnId }: AnnouncedCall): ToolBlock {\n  return {\n    type: 'tool', id, tool, headline: toolHeadline(tool, args, toolLabel), args, status: 'pending', output: '', outputLineCount: 0,\n    ...(toolCallId ? { toolCallId } : {}),\n    ...(toolLabel ? { toolLabel } : {}),\n    ...(turnId ? { turnId } : {}),\n  };\n}\n\n/** The row of a call known only from its result — a reload, or a result whose call was never announced. */\nexport function toolFromStep(id: string, step: ResearchStep, turnId?: string): ToolBlock {\n  return settledTool(pendingTool(id, { ...step, turnId }), step);\n}\n\n/**\n * What a plan marker says, read from the transcript entry `PlannerConversation`\n * writes for it (\"Plan generated with 2 tasks.\", \"Plan updated — now 1 task.\").\n * That entry is the only record of the marker a reload has, so the live view\n * reads the same text rather than counting tasks itself.\n */\nexport function planMarker(content: string): { status: Exclude<PlanMarkerStatus, 'building'>; taskCount?: number } {\n  const count = /(\\d+) tasks?\\b/.exec(content);\n  return { status: content.startsWith('Plan updated') ? 'updated' : 'generated', ...(count ? { taskCount: Number(count[1]) } : {}) };\n}\n","import type { AwaitingReason, ConversationMessage, LegacyPlanState, PlanState, QueuedMessage, ResearchStep, RunnerId, SkillLoadNotice, SubagentOutcome, Task, TaskSkillNotice, TaskSnapshot, Verdict } from '../models/Task';\nimport type { UsageTotals } from '../models/Usage';\nimport type { TaskLogEvent } from '../models/TaskLog';\nimport type { ApprovalKind } from '../interfaces/IApproval';\nimport type { ApprovalSource } from './ApprovalPolicy';\nimport type { IsolationHandoff, IsolationMergeResult, TaskIsolation } from '../interfaces/IWorktreeIsolation';\nimport type { QueuedTaskMessage } from '../interfaces/IRunner';\nimport { canContinue } from './continuation';\nimport { skillLoadNotice, surfaceStep } from '../conversation/records';\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  /** What an `awaiting_user` task waits on, when it was saved (ADR-0018, W1). */\n  awaitingReason?: AwaitingReason;\n  /** The whole question of the checkpoint the task waits at; absent when it waits at none. */\n  checkpoint?: string;\n  /** Messages waiting for a structured task's turn to end, oldest first; absent when there are none. */\n  queued?: QueuedTaskMessage[];\n  /** Set when the task can be continued in its saved runner session (ADR-0018, K1); the id itself stays in the daemon. */\n  continuable?: true;\n  /**\n   * How many of a structured task's runner requests wait for an answer\n   * (ADR-0018, A1) — \"waiting for approval\", which leaves `status` alone.\n   * Absent when none do.\n   */\n  awaitingApproval?: number;\n  /**\n   * The dependencies an ops or user task waits on at its merge gate: their\n   * work has landed but is not merged into the user's branch (ADR-0020).\n   * Absent when it waits for no Merge all.\n   */\n  mergeGate?: string[];\n  /** The dependencies, by title, a force start went past the merge gate of (ADR-0020). */\n  forcedPastGate?: string[];\n};\n\n/**\n * A run with tasks at a merge gate (ADR-0020), as a surface offers Merge all\n * mid-run: what has landed and is not merged yet, and whether nothing else is\n * running, so the run waits on the user alone.\n */\nexport interface MergeGateView {\n  paused: boolean;\n  repos: IsolationHandoff['repos'];\n  landed: IsolationHandoff['landed'];\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  /** Set only on an ops task (ADR-0020). */\n  ops?: true;\n  /** Task skills attached by name; absent when none. */\n  skills?: string[];\n};\n\n/** Skill loads go out as notices: their bodies are for the planner, and stay in the session. */\nexport type SerializedConversationMessage = Omit<ConversationMessage, 'skill'> & { skill?: SkillLoadNotice };\nexport type SerializedQueuedMessage = Omit<QueuedMessage, 'skills'> & { skills?: SkillLoadNotice[] };\n\n/**\n * A task as a surface is sent it: its attempt's skills are notices, whole in\n * the session only, and its runner session id stays there too — no surface shows it,\n * and only a continue reads the runner's own session id.\n */\nexport type SurfaceTask<T extends Task = Task> = Omit<T, 'attemptSkills' | 'subtasks' | 'runnerSessionId'> & {\n  attemptSkills?: TaskSkillNotice[];\n  subtasks: SurfaceTask[];\n};\n\n/** A plan as the daemon and the VS Code webview are sent it: the session's own state, minus every skill body. */\nexport type SurfacePlan = Omit<LegacyPlanState, 'tasks' | 'conversationHistory' | 'queuedMessages'> & {\n  tasks: SurfaceTask[];\n  conversationHistory?: SerializedConversationMessage[];\n  queuedMessages?: SerializedQueuedMessage[];\n};\n\n/** The phase-tagged shape of {@link SurfacePlan}. */\nexport type SurfacePlanState =\n  | (Omit<Extract<PlanState, { phase: 'planning' }>, 'pendingTasks'> & { pendingTasks: SurfaceTask[] })\n  | (Omit<Extract<PlanState, { phase: 'executing' }>, 'pendingTasks' | 'executionLog'> & { pendingTasks: SurfaceTask[]; executionLog: SurfaceTask<TaskSnapshot>[] });\n\nexport type SerializedPlan = {\n  tasks: SerializedTask[];\n  runners: RunnerId[];\n  generatedAt: string;\n  conversationHistory?: SerializedConversationMessage[];\n  prdMarkdown?: string;\n  queuedMessages?: SerializedQueuedMessage[];\n};\n\n/** How a planner turn ended: the reply kind it settled on, a user stop, or a failure. */\nexport type PlannerTurnOutcome = 'message' | 'plan' | 'task_ops' | 'stopped' | 'error';\n\n/**\n * Everything a session tells its surfaces, over one broadcast seam.\n *\n * A planner turn (#47) streams between `planner_turn_started` and\n * `planner_turn_ended` with the same `turnId`; every turn-scoped message in\n * between carries it. The stream is provisional and the settled messages are\n * authoritative:\n * - `planner_message` replaces the streamed text of the turn's final segment —\n *   a surface drops what it accumulated and shows the message instead.\n * - A reply that is a JSON envelope (plan, taskOps, taskQuery) never arrives\n *   as `planner_text_delta`; it streams as `plan_token`, the \"building plan\"\n *   display.\n * - A subagent's own text never appears in the reply; its activity arrives\n *   tagged with its `subagentId`.\n */\nexport type SessionMessage =\n  /**\n   * The plan, whole. `turnId` names the planner turn whose commit this\n   * broadcast carries, so the turn's building plan becomes the marker; it is\n   * absent on every other broadcast of the plan.\n   */\n  | { type: 'plan_generated'; plan: SerializedPlan; goal: string; runners: RunnerId[]; turnId?: string }\n  /**\n   * The settled reply of a planner turn, emitted by the session once the turn\n   * is classified. Authoritative over any `planner_text_delta` of its turn's\n   * final segment. `turnId` is absent for replies sent outside a streamed turn.\n   */\n  | { type: 'planner_message'; content: string; timestamp: string; turnId?: string }\n  /**\n   * A planner turn began. Emitted once per turn by whoever runs the turn,\n   * before any other message carrying its `turnId`. `prompt` is the user's\n   * message, as typed, when the turn answers one; `skills` are what its\n   * `/name` tokens loaded, absent when none did.\n   */\n  | { type: 'planner_turn_started'; turnId: string; prompt?: string; skills?: SkillLoadNotice[] }\n  | { type: 'planner_skill_loaded'; turnId: string; skill: SkillLoadNotice }\n  /**\n   * A planner turn is over; nothing more carries its `turnId`. Emitted exactly\n   * once per `planner_turn_started`, stop and failure included, after the\n   * turn's `planner_message` when it has one.\n   */\n  | { type: 'planner_turn_ended'; turnId: string; outcome: PlannerTurnOutcome }\n  /**\n   * Reply prose as it streams, appended in order within its segment. A segment\n   * is one continuous run of model text; text before a tool call is its own\n   * segment, and a later segment never rewrites an earlier one. Never carries\n   * a JSON envelope or a subagent's text (see the union's invariants).\n   */\n  | { type: 'planner_text_delta'; turnId: string; segmentId: string; text: string }\n  /**\n   * Exposed reasoning as it streams, from the planner or — tagged with\n   * `subagentId` — from one of its subagents. Never part of the reply. The one\n   * thinking message for every backend: `segmentId` is set only where the\n   * backend streams thinking in segments (the API loops; harness planners do\n   * not), and `turnId` is absent for thinking outside a turn (one-shot plans).\n   */\n  | { type: 'planner_thinking_delta'; turnId?: string; segmentId?: string; subagentId?: string; text: string }\n  /**\n   * Text streamed for an attempt the turn discarded (a corrective retry) is\n   * taken back: a surface removes it. With `segmentId`, only that segment;\n   * without, all of the turn's text not yet settled by a `planner_message`.\n   * A segment that streamed to the plan display (`plan_token`) takes the\n   * turn's building plan with it.\n   */\n  | { type: 'planner_text_retracted'; turnId: string; segmentId?: string }\n  /**\n   * The planner's running usage for the session, subagents included, emitted\n   * after a model call reports usage. `totals` already contains every\n   * `bySubagent` entry. `contextFill` is the last planner prompt against the\n   * model's window, omitted when the window is unknown. Cost appears only as\n   * reported by a provider or runner (see `UsageRecord`).\n   */\n  | {\n      type: 'planner_usage';\n      turnId?: string;\n      totals: UsageTotals;\n      bySubagent?: Record<string, UsageTotals>;\n      contextFill?: { usedTokens: number; windowTokens: number };\n    }\n  /**\n   * A subagent began work on `brief`. Emitted by the planner backend that\n   * spawned it (ADR-0005 research agents, or a harness planner's own), before\n   * any message tagged with its `subagentId`.\n   */\n  | { type: 'subagent_started'; turnId?: string; subagentId: string; brief: string; model?: string }\n  /**\n   * A subagent is done; nothing more is tagged with its `subagentId`. Emitted\n   * once per `subagent_started`. `digest` is what it handed back to the\n   * planner; `usage` is its own share, already counted in `planner_usage`.\n   */\n  | { type: 'subagent_finished'; turnId?: string; subagentId: string; outcome: SubagentOutcome; digest: string; usage?: UsageTotals }\n  // `gate` is present while a task waits at a merge gate (ADR-0020): what Merge\n  // all would merge now, and whether the run is paused there with nothing else\n  // running.\n  | { type: 'status_update'; tasks: SerializedTaskStatus[]; gate?: MergeGateView }\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: '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  /**\n   * A structured task's log as it happens (ADR-0018, P1): the next events of\n   * the task's attempt `attempt`, in order — the same ones appended to that\n   * attempt's file, so a surface folding these and one replaying the file\n   * draw the same blocks.\n   */\n  | { type: 'task_log'; taskId: string; attempt: number; events: TaskLogEvent[] }\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  // 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; turnId?: string }\n  // The \"building plan\" display only: a JSON envelope as it streams, never\n  // reply prose. `turnId` is absent for a one-shot plan, which has no turn.\n  // `segmentId` names the segment the envelope streams in; a turn's next\n  // envelope is a new segment, and the display starts over with it.\n  | { type: 'plan_token'; token: string; turnId?: string; segmentId?: string }\n  | { type: 'research_step_done'; step: ResearchStep; subagentId?: string; turnId?: 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; turnId?: 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' | 'error'; 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    ...(t.ops ? { ops: true as const } : {}),\n    ...(t.skills?.length ? { skills: [...t.skills] } : {}),\n  };\n}\n\nexport function serializeTaskStatus(\n  t: Task,\n  idleSince: string | null = null,\n  isolation: TaskIsolation | null = null,\n  queued: readonly QueuedTaskMessage[] = [],\n  awaitingApproval = 0,\n  mergeGate: readonly string[] = [],\n  checkpoint = '',\n): 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    ...(t.status === 'awaiting_user' && t.awaitingReason ? { awaitingReason: t.awaitingReason } : {}),\n    ...(t.status === 'awaiting_user' && t.awaitingReason === 'checkpoint' && checkpoint ? { checkpoint } : {}),\n    ...(queued.length > 0 ? { queued: queued.map((m) => ({ ...m })) } : {}),\n    ...(canContinue(t) ? { continuable: true as const } : {}),\n    ...(awaitingApproval > 0 ? { awaitingApproval } : {}),\n    ...(mergeGate.length > 0 ? { mergeGate: [...mergeGate] } : {}),\n    ...(t.forcedPastGate?.length ? { forcedPastGate: [...t.forcedPastGate] } : {}),\n  };\n}\n\nfunction surfaceConversation(history: LegacyPlanState['conversationHistory']): SerializedConversationMessage[] | undefined {\n  return history?.map(({ skill, ...m }) => (skill ? { ...m, skill: skillLoadNotice(skill) } : m));\n}\n\nfunction surfaceQueued(queued: LegacyPlanState['queuedMessages']): SerializedQueuedMessage[] | undefined {\n  return queued?.map(({ skills, ...m }) => (skills ? { ...m, skills: skills.map(skillLoadNotice) } : m));\n}\n\nfunction surfaceTask<T extends Task>({ attemptSkills, subtasks, runnerSessionId: _runnerSessionId, ...task }: T): SurfaceTask<T> {\n  return {\n    ...task,\n    ...(attemptSkills ? { attemptSkills: attemptSkills.map(({ name, source, path }): TaskSkillNotice => ({ name, source, path })) } : {}),\n    subtasks: (subtasks ?? []).map(surfaceTask),\n  };\n}\n\n/** The one place a plan's skill bodies come off before it leaves the session: every wire path that carries plan state goes through here. */\nexport function surfacePlan(plan: LegacyPlanState): SurfacePlan {\n  return {\n    ...plan,\n    tasks: plan.tasks.map(surfaceTask),\n    conversationHistory: surfaceConversation(plan.conversationHistory),\n    queuedMessages: surfaceQueued(plan.queuedMessages),\n    researchLog: plan.researchLog?.map((e) => ('type' in e ? e : surfaceStep(e))),\n  };\n}\n\nexport function surfacePlanState(state: PlanState): SurfacePlanState {\n  return state.phase === 'planning'\n    ? { ...state, pendingTasks: state.pendingTasks.map(surfaceTask) }\n    : { ...state, pendingTasks: state.pendingTasks.map(surfaceTask), executionLog: state.executionLog.map(surfaceTask) };\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: surfaceConversation(plan.conversationHistory),\n    prdMarkdown: plan.prdMarkdown,\n    queuedMessages: surfaceQueued(plan.queuedMessages),\n  };\n}\n\nexport function executionSummary(tasks: readonly 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","/**\n * Pure, no-imports helper so a browser surface can format a conflict's files\n * without pulling `isolationRecord` — and its `path` import — into a webview\n * bundle. Kept out of `isolationRecord.ts` for exactly that reason.\n */\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 one model call consumed, as its provider or runner reported it. Shared\n * by the planner's usage line (#49) and per-attempt task usage (#26): a record\n * says nothing about who asked for the call, so either can hold a list of them.\n *\n * Every measure is optional because backends report different subsets. An\n * absent field means \"not reported\" — never zero — so a total can tell the two\n * apart.\n */\nexport interface UsageRecord {\n  /** The provider or runner id that reported the call — `openai`, `claude-code`, … */\n  source: string;\n  model?: string;\n  inputTokens?: number;\n  outputTokens?: number;\n  /** The share of `inputTokens` served from the provider's prompt cache. */\n  cachedInputTokens?: number;\n  /**\n   * Filled only from a provider's or runner's own report, never from a price\n   * table or an estimate: prices go stale, and a subscription runner has no\n   * per-token price at all. No report means no cost, not a guessed one.\n   */\n  reportedCost?: { amount: number; currency: string };\n  /** The model's context window, when the runner itself reports it. */\n  contextWindow?: number;\n  /** Set when a subagent made the call; its usage still counts toward the total. */\n  subagentId?: string;\n}\n\n/**\n * A running sum of {@link UsageRecord}s. A measure stays absent until some\n * record reports it. Cost is kept per currency: two runners may bill in\n * different ones, and there is no honest exchange rate to fold them together.\n */\nexport interface UsageTotals {\n  inputTokens?: number;\n  outputTokens?: number;\n  cachedInputTokens?: number;\n  reportedCost?: Record<string, number>;\n}\n\n/**\n * The input side of a call whose provider reports its prompt in parts — the\n * uncached tail, with cache reads and cache writes beside it rather than inside\n * it (Anthropic, and OpenCode after it). The prompt the model saw is all three;\n * only the reads were served from cache, since a write is billed as fresh\n * input. A part left unreported adds nothing, and with no part reported there\n * is no measure at all.\n */\nexport function partedPromptUsage(parts: { uncached?: number; cacheRead?: number; cacheWrite?: number }): Pick<UsageRecord, 'inputTokens' | 'cachedInputTokens'> {\n  const reported = [parts.uncached, parts.cacheRead, parts.cacheWrite].filter((n): n is number => n !== undefined);\n  return {\n    ...(reported.length > 0 ? { inputTokens: reported.reduce((a, b) => a + b, 0) } : {}),\n    ...(parts.cacheRead !== undefined ? { cachedInputTokens: parts.cacheRead } : {}),\n  };\n}\n\nconst TOKEN_FIELDS = ['inputTokens', 'outputTokens', 'cachedInputTokens'] as const;\n\nexport function addUsage(totals: UsageTotals, record: UsageRecord): UsageTotals {\n  const next: UsageTotals = { ...totals };\n  for (const field of TOKEN_FIELDS) {\n    const reported = record[field];\n    if (reported !== undefined) next[field] = (totals[field] ?? 0) + reported;\n  }\n  if (record.reportedCost) {\n    const { amount, currency } = record.reportedCost;\n    next.reportedCost = { ...totals.reportedCost, [currency]: (totals.reportedCost?.[currency] ?? 0) + amount };\n  }\n  return next;\n}\n\n/**\n * What the planner has consumed over a session (#49). `totals` includes every\n * `bySubagent` entry. `lastPromptTokens` and `contextWindow` track the\n * planner's own calls only — a subagent runs its own model, whose window says\n * nothing about the planner's.\n */\nexport interface PlannerUsage {\n  totals: UsageTotals;\n  bySubagent?: Record<string, UsageTotals>;\n  lastPromptTokens?: number;\n  contextWindow?: number;\n}\n\nexport function addPlannerUsage(usage: PlannerUsage, record: UsageRecord): PlannerUsage {\n  const next: PlannerUsage = { ...usage, totals: addUsage(usage.totals, record) };\n  if (record.subagentId) {\n    next.bySubagent = { ...usage.bySubagent, [record.subagentId]: addUsage(usage.bySubagent?.[record.subagentId] ?? {}, record) };\n    return next;\n  }\n  if (record.inputTokens !== undefined) next.lastPromptTokens = record.inputTokens;\n  // A reported window of 0 means \"not known\", not \"no room\": keep it out so the\n  // fill is omitted rather than shown against a guessed zero.\n  if (record.contextWindow !== undefined && record.contextWindow > 0) next.contextWindow = record.contextWindow;\n  return next;\n}\n\n/** Whether any measure was reported: a token line of nothing but blanks says nothing. */\nexport function isMeasured(totals: UsageTotals): boolean {\n  return totals.inputTokens !== undefined || totals.outputTokens !== undefined || totals.cachedInputTokens !== undefined\n    || Object.keys(totals.reportedCost ?? {}).length > 0;\n}\n\n/** What the token line shows of a ledger — live from its broadcast, or reloaded from the saved one. */\nexport interface UsageLine {\n  totals: UsageTotals;\n  bySubagent?: Record<string, UsageTotals>;\n  contextFill?: { usedTokens: number; windowTokens: number };\n}\n\nexport function usageLine(usage: PlannerUsage): UsageLine {\n  const contextFill = plannerContextFill(usage);\n  return {\n    totals: usage.totals,\n    ...(usage.bySubagent ? { bySubagent: usage.bySubagent } : {}),\n    ...(contextFill ? { contextFill } : {}),\n  };\n}\n\n/**\n * The last planner prompt against its window, or undefined while either is\n * unknown. `usedTokens` is the prompt total as reported, cached tokens\n * included: a cached token still occupies the window, so subtracting the\n * cached share would understate how full the context is. A window of 0 is\n * treated as unknown — never guessed.\n */\nexport function plannerContextFill(usage: PlannerUsage): { usedTokens: number; windowTokens: number } | undefined {\n  if (usage.lastPromptTokens === undefined || usage.contextWindow === undefined || usage.contextWindow <= 0) return undefined;\n  return { usedTokens: usage.lastPromptTokens, windowTokens: usage.contextWindow };\n}\n","import type { UsageLine } from '../models/Usage';\nimport type { DisplayBlock, SubagentBlock, SubagentChild, SubagentStatus } from './blocks';\nimport { subagentBlock, usageBlock } from './records';\n\n/*\n * The block-list operations both reducers are built from — the planner\n * conversation (`reduce.ts`) and a structured task's log (`taskLog.ts`) — so\n * a subagent, a streaming run of text or the usage line behaves the same in\n * either view.\n */\n\n/** What every view over display blocks holds; each view adds its own state beside it. */\nexport interface BlockList {\n  readonly blocks: readonly DisplayBlock[];\n  readonly nextId: number;\n}\n\n/** The top level of the view (`null`), or the index of the subagent whose children are meant. */\nexport type Lane = number | null;\n\nexport function findLastIndex<T>(items: readonly T[], match: (item: T) => boolean): number {\n  for (let i = items.length - 1; i >= 0; i--) if (match(items[i])) return i;\n  return -1;\n}\n\nexport function replaceAt<T>(items: readonly T[], index: number, item: T): T[] {\n  const next = items.slice();\n  next[index] = item;\n  return next;\n}\n\n// The usage line always sits last, so everything else lands above it.\nfunction insertTop(blocks: readonly DisplayBlock[], block: DisplayBlock): DisplayBlock[] {\n  const last = blocks[blocks.length - 1];\n  return last?.type === 'usage' ? [...blocks.slice(0, -1), block, last] : [...blocks, block];\n}\n\nexport function append<V extends BlockList>(view: V, make: (id: string) => DisplayBlock): V {\n  return { ...view, blocks: insertTop(view.blocks, make(`b${view.nextId}`)), nextId: view.nextId + 1 };\n}\n\nexport function subagentAt(view: BlockList, lane: number): SubagentBlock {\n  const block = view.blocks[lane];\n  if (block.type !== 'subagent') throw new Error(`block ${lane} is not a subagent`);\n  return block;\n}\n\nexport function laneBlocks(view: BlockList, lane: Lane): readonly DisplayBlock[] {\n  return lane === null ? view.blocks : subagentAt(view, lane).children;\n}\n\nfunction setChildren<V extends BlockList>(view: V, lane: number, children: readonly SubagentChild[]): V {\n  return { ...view, blocks: replaceAt(view.blocks, lane, { ...subagentAt(view, lane), children }) };\n}\n\nexport function laneReplace<V extends BlockList>(view: V, lane: Lane, index: number, block: SubagentChild): V {\n  if (lane === null) return { ...view, blocks: replaceAt(view.blocks, index, block) };\n  return setChildren(view, lane, replaceAt(subagentAt(view, lane).children, index, block));\n}\n\nexport function laneAppend<V extends BlockList>(view: V, lane: Lane, make: (id: string) => SubagentChild): V {\n  if (lane === null) return append(view, make);\n  const children = [...subagentAt(view, lane).children, make(`b${view.nextId}`)];\n  return { ...setChildren(view, lane, children), nextId: view.nextId + 1 };\n}\n\nfunction isStreaming(block: DisplayBlock): boolean {\n  return (block.type === 'message' || block.type === 'thinking') && block.streaming;\n}\n\nexport function sealed<B extends DisplayBlock>(block: B): B {\n  return isStreaming(block) ? { ...block, streaming: false } : block;\n}\n\n/**\n * Output landed at `keep` in the lane, so nothing else there is still\n * streaming: one lane has one voice at a time, and a block left marked as\n * streaming would keep its cursor after its text had moved on.\n */\nexport function sealLane<V extends BlockList>(view: V, lane: Lane, keep: number): V {\n  const blocks = laneBlocks(view, lane);\n  if (!blocks.some((b, i) => i !== keep && isStreaming(b))) return view;\n  if (lane === null) return { ...view, blocks: view.blocks.map((b, i) => (i === keep ? b : sealed(b))) };\n  return setChildren(view, lane, subagentAt(view, lane).children.map((b, i) => (i === keep ? b : sealed(b))));\n}\n\n/** Append output to the lane, which then speaks through it alone. */\nexport function appendOutput<V extends BlockList>(view: V, lane: Lane, make: (id: string) => SubagentChild): V {\n  const next = laneAppend(view, lane, make);\n  return sealLane(next, lane, findLastIndex(laneBlocks(next, lane), (b) => b.type !== 'usage'));\n}\n\n/**\n * The subagent's block, created on first sighting: its activity can arrive\n * before (or without) its start. The call that spawns it becomes the block,\n * keeping the call's id and position — the call and the subagent are one\n * thing on screen.\n */\nexport function subagentLane<V extends BlockList>(view: V, subagentId: string, turnId?: string): [V, number] {\n  const existing = findLastIndex(view.blocks, (b) => b.type === 'subagent' && b.subagentId === subagentId);\n  if (existing >= 0) return [view, existing];\n  const spawn = findLastIndex(view.blocks, (b) => b.type === 'tool' && (b.spawns === subagentId || b.toolCallId === subagentId));\n  const call = view.blocks[spawn];\n  if (call?.type === 'tool') {\n    const block = subagentBlock(call.id, {\n      subagentId, brief: call.headline.keyArg, status: 'running', children: [], digest: '', toolCallId: call.toolCallId, turnId: call.turnId,\n    });\n    return [{ ...view, blocks: replaceAt(view.blocks, spawn, block) }, spawn];\n  }\n  const next = append(view, (id) => subagentBlock(id, { subagentId, brief: '', status: 'running', children: [], digest: '', turnId }));\n  return [next, findLastIndex(next.blocks, (b) => b.type === 'subagent' && b.subagentId === subagentId)];\n}\n\nexport function updateSubagent<V extends BlockList>(view: V, subagentId: string, turnId: string | undefined, update: (block: SubagentBlock) => SubagentBlock): V {\n  const [next, lane] = subagentLane(view, subagentId, turnId);\n  return { ...next, blocks: replaceAt(next.blocks, lane, update(subagentAt(next, lane))) };\n}\n\n/** The lane a subagent's activity lands in: its own block's children, or the top level. */\nexport function laneOf<V extends BlockList>(view: V, subagentId: string | undefined, turnId?: string): [V, Lane] {\n  return subagentId ? subagentLane(view, subagentId, turnId) : [view, null];\n}\n\nexport function think<V extends BlockList>(view: V, text: string, turnId?: string, segmentId?: string, subagentId?: string): V {\n  const [placed, lane] = laneOf(view, subagentId, turnId);\n  const blocks = laneBlocks(placed, lane);\n  const lastIndex = findLastIndex(blocks, (b) => b.type !== 'usage');\n  const last = blocks[lastIndex];\n  if (last?.type === 'thinking' && last.streaming && last.segmentId === segmentId) {\n    return laneReplace(placed, lane, lastIndex, { ...last, text: last.text + text });\n  }\n  return appendOutput(placed, lane, (id) => ({\n    type: 'thinking', id, text, streaming: true,\n    ...(turnId ? { turnId } : {}),\n    ...(segmentId ? { segmentId } : {}),\n    ...(subagentId ? { subagentId } : {}),\n  }));\n}\n\n/** The one usage line, replaced in place or added as the last block. */\nexport function setUsageLine<V extends BlockList>(view: V, line: UsageLine): V {\n  const last = view.blocks[view.blocks.length - 1];\n  const block = usageBlock(last?.type === 'usage' ? last.id : `b${view.nextId}`, line);\n  if (last?.type === 'usage') return { ...view, blocks: replaceAt(view.blocks, view.blocks.length - 1, block) };\n  return { ...view, blocks: [...view.blocks, block], nextId: view.nextId + 1 };\n}\n\nfunction closeBlock<B extends DisplayBlock>(block: B, interrupted: boolean): B {\n  return interrupted && block.type === 'tool' && block.status === 'pending' ? { ...block, status: 'interrupted' } : sealed(block);\n}\n\nfunction closeSubagent(block: SubagentBlock, cut: SubagentStatus | null): SubagentBlock {\n  const children = block.children.map((c) => closeBlock(c, cut !== null));\n  const status = cut && block.status === 'running' ? cut : block.status;\n  return status === block.status && children.every((c, i) => c === block.children[i]) ? block : { ...block, status, children };\n}\n\n/**\n * A turn is over, so whatever it left open is closed: streaming stops, and\n * when the turn was cut short (`cut`), its unanswered calls and running\n * subagents say so.\n */\nexport function closeOpenBlocks<V extends BlockList>(view: V, cut: SubagentStatus | null): V {\n  const blocks = view.blocks.map((b) => (b.type === 'subagent' ? closeSubagent(b, cut) : closeBlock(b, cut !== null)));\n  return blocks.every((b, i) => b === view.blocks[i]) ? view : { ...view, blocks };\n}\n","import type { ResearchStep } from '../models/Task';\nimport type { SessionMessage } from '../services/SessionMessage';\nimport { isMeasured } from '../models/Usage';\nimport type { DisplayBlock, MessageBlock, PlanBlock, ToolBlock } from './blocks';\nimport { pendingTool, planMarker, settledMessage, settledTool, skillLoadBlock, toolFromStep, userMessage } from './records';\nimport {\n  append, appendOutput, closeOpenBlocks, findLastIndex, laneBlocks, laneOf, laneAppend, laneReplace, replaceAt, sealLane, sealed, setUsageLine,\n  think, updateSubagent, type BlockList,\n} from './lanes';\n\n/**\n * A line a surface adds to the conversation itself rather than receiving from\n * the session: the user's prompt as it is sent, a notice, an error.\n */\nexport interface LocalEntry {\n  type: 'local_entry';\n  role: 'user' | 'system' | 'error';\n  text: string;\n}\n\nexport type ConversationInput = SessionMessage | LocalEntry;\n\nexport interface ConversationView extends BlockList {\n  /**\n   * The newest transcript entry the view accounts for. Plan markers and system\n   * notes reach a surface only inside the transcript a `plan_generated`\n   * carries, so entries after this one are what is new in it.\n   */\n  readonly transcriptAt?: string;\n}\n\nexport const EMPTY_CONVERSATION: ConversationView = { blocks: [], nextId: 1 };\n\ntype Message<T extends SessionMessage['type']> = Extract<SessionMessage, { type: T }>;\n\nfunction isUnsettledSegment(block: DisplayBlock, turnId: string): block is MessageBlock {\n  return block.type === 'message' && block.turnId === turnId && block.segmentId !== undefined;\n}\n\nfunction isBuildingPlan(block: DisplayBlock, turnId: string | undefined): block is PlanBlock {\n  return block.type === 'plan' && block.status === 'building' && block.turnId === turnId;\n}\n\n/**\n * Where the turn's final segment is, if its text streamed: the turn's latest\n * block, when that is streamed text. Anything the turn did after a segment —\n * a tool call, a plan envelope — means a later segment follows it, and a later\n * segment never rewrites an earlier one. `pastPlan` looks past the turn's plan\n * block, for a plan that settled after its own text.\n */\nfunction finalSegmentIndex(blocks: readonly DisplayBlock[], turnId: string, pastPlan = false): number {\n  for (let i = blocks.length - 1; i >= 0; i--) {\n    const block = blocks[i];\n    if (block.type === 'usage' || block.type === 'thinking' || block.type === 'approval' || (pastPlan && block.type === 'plan')) continue;\n    if (block.turnId !== turnId) continue;\n    return isUnsettledSegment(block, turnId) ? i : -1;\n  }\n  return -1;\n}\n\nfunction openTurn(view: ConversationView, { turnId, prompt = '', skills = [] }: Message<'planner_turn_started'>): ConversationView {\n  // A surface shows its user's prompt the moment it is sent; the turn that\n  // answers it adopts that line rather than repeating it.\n  const i = findLastIndex(view.blocks, (b) => b.type === 'message' && b.role === 'user');\n  const sent = view.blocks[i];\n  const adopted = sent?.type === 'message' && sent.turnId === undefined && sent.text === prompt;\n  const said: ConversationView = adopted\n    ? { ...view, blocks: replaceAt(view.blocks, i, userMessage(sent.id, prompt, skills, turnId)) }\n    : append(view, (id) => userMessage(id, prompt, skills, turnId));\n  if (skills.length === 0) return said;\n  // Directly under the message that loaded them, wherever that line sits.\n  const at = adopted ? i + 1 : findLastIndex(said.blocks, (b) => b.type === 'message' && b.role === 'user') + 1;\n  const loads = skills.map((skill, n) => skillLoadBlock(`b${said.nextId + n}`, skill, turnId));\n  return { ...said, blocks: [...said.blocks.slice(0, at), ...loads, ...said.blocks.slice(at)], nextId: said.nextId + loads.length };\n}\n\nfunction streamText(view: ConversationView, { turnId, segmentId, text }: Message<'planner_text_delta'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => isUnsettledSegment(b, turnId) && b.segmentId === segmentId);\n  const segment = view.blocks[i];\n  if (segment?.type === 'message') {\n    return sealLane(laneReplace(view, null, i, { ...segment, text: segment.text + text, streaming: true }), null, i);\n  }\n  return appendOutput(view, null, (id) => ({ type: 'message', id, role: 'planner', text, streaming: true, turnId, segmentId }));\n}\n\n/**\n * Drop the turn's plan display while it is still building: whatever streamed\n * there did not become a plan — a task-ops or task-query envelope, or, from a\n * daemon older than turns, the reply's prose.\n */\nfunction dropBuildingPlan(view: ConversationView, turnId: string | undefined, segmentId?: string): ConversationView {\n  const blocks = view.blocks.filter((b) => !(isBuildingPlan(b, turnId) && (segmentId === undefined || b.segmentId === segmentId)));\n  return blocks.length === view.blocks.length ? view : { ...view, blocks };\n}\n\nfunction settleReply(view: ConversationView, { content, turnId }: Message<'planner_message'>): ConversationView {\n  if (turnId !== undefined) {\n    const i = finalSegmentIndex(view.blocks, turnId);\n    if (i >= 0) {\n      return dropBuildingPlan({ ...view, blocks: replaceAt(view.blocks, i, settledMessage(view.blocks[i].id, 'planner', content, turnId)) }, turnId);\n    }\n  }\n  return append(dropBuildingPlan(view, turnId), (id) => settledMessage(id, 'planner', content, turnId));\n}\n\n// A retracted envelope takes the turn's plan display with it, or its retry\n// would build on the botched JSON and the partial-plan rows read both.\nfunction retractText(view: ConversationView, { turnId, segmentId }: Message<'planner_text_retracted'>): ConversationView {\n  const blocks = view.blocks.filter((b) => !(isUnsettledSegment(b, turnId) && (segmentId === undefined || b.segmentId === segmentId)));\n  return dropBuildingPlan(blocks.length === view.blocks.length ? view : { ...view, blocks }, turnId, segmentId);\n}\n\nfunction startSubagent(view: ConversationView, { subagentId, brief, model, turnId }: Message<'subagent_started'>): ConversationView {\n  return updateSubagent(view, subagentId, turnId, (block) => ({ ...block, ...(brief ? { brief } : {}), ...(model ? { model } : {}) }));\n}\n\nfunction finishSubagent(view: ConversationView, { subagentId, outcome, digest, usage, turnId }: Message<'subagent_finished'>): ConversationView {\n  return updateSubagent(view, subagentId, turnId, (block) => ({\n    ...block, status: outcome, digest, children: block.children.map(sealed), ...(usage ? { usage } : {}),\n  }));\n}\n\nfunction announceTool(view: ConversationView, call: Message<'research_step'>): ConversationView {\n  // A spawn call names the subagent it starts; any other call tagged with a\n  // subagent is that subagent's own.\n  const spawns = call.tool === 'spawn_research_agent' ? call.subagentId : undefined;\n  const [placed, lane] = laneOf(view, spawns ? undefined : call.subagentId, call.turnId);\n  return appendOutput(placed, lane, (id) => ({ ...pendingTool(id, call), ...(spawns ? { spawns } : {}) }));\n}\n\n// By the call's id: results of a parallel round return in any order, and a\n// name match would put one call's output on another's row (ADR-0008). The\n// name scan survives only for calls that announced no id.\nfunction isPendingCallOf(block: DisplayBlock, step: ResearchStep): block is ToolBlock {\n  if (block.type !== 'tool' || block.status !== 'pending') return false;\n  return step.toolCallId ? block.toolCallId === step.toolCallId : block.toolCallId === undefined && block.tool === step.tool;\n}\n\nfunction settleTool(view: ConversationView, { step, turnId }: Message<'research_step_done'>): ConversationView {\n  const [placed, lane] = laneOf(view, step.subagentId, turnId);\n  const blocks = laneBlocks(placed, lane);\n  const i = findLastIndex(blocks, (b) => isPendingCallOf(b, step));\n  const pending = blocks[i];\n  if (pending?.type === 'tool') return laneReplace(placed, lane, i, settledTool(pending, step));\n  // The call that spawned a subagent is shown by the subagent's block, and\n  // only the subagent's own finish settles it: a backgrounded agent's call\n  // returns at launch, long before the work ends.\n  if (lane === null && step.toolCallId && blocks.some((b) => b.type === 'subagent' && b.toolCallId === step.toolCallId)) return view;\n  return laneAppend(placed, lane, (id) => toolFromStep(id, step, turnId));\n}\n\n/**\n * The building display shows one envelope: the segment streaming now. A turn's\n * later envelope (a plan after a read it asked for) starts it over, below\n * whatever the turn did in between, rather than running on from the last one.\n */\nfunction streamPlan(view: ConversationView, { token, turnId, segmentId }: Message<'plan_token'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => isBuildingPlan(b, turnId));\n  const building = view.blocks[i];\n  if (building?.type === 'plan' && building.segmentId === segmentId) {\n    return { ...view, blocks: replaceAt(view.blocks, i, { ...building, text: building.text + token }) };\n  }\n  return append(dropBuildingPlan(view, turnId), (id) => ({\n    type: 'plan', id, status: 'building', text: token, ...(turnId ? { turnId } : {}), ...(segmentId ? { segmentId } : {}),\n  }));\n}\n\n/** A plan landed: the building display of the turn that committed it becomes its marker. */\nfunction markPlan(view: ConversationView, content: string, turnId: string | undefined): ConversationView {\n  const marker = planMarker(content);\n  const i = findLastIndex(view.blocks, (b) => isBuildingPlan(b, turnId));\n  const building = view.blocks[i];\n  if (building?.type === 'plan') {\n    const settled: PlanBlock = { type: 'plan', id: building.id, ...marker, text: '', ...(building.turnId ? { turnId: building.turnId } : {}) };\n    return { ...view, blocks: replaceAt(view.blocks, i, settled) };\n  }\n  return append(view, (id) => ({ type: 'plan', id, text: '', ...marker }));\n}\n\nfunction requestApproval(view: ConversationView, { id: approvalId, kind, subject, scope, detail, turnId }: Message<'approval_request'>): ConversationView {\n  return append(view, (id) => ({\n    type: 'approval', id, approvalId, kind, subject, scope, status: 'pending',\n    ...(detail ? { detail } : {}),\n    ...(turnId ? { turnId } : {}),\n  }));\n}\n\nfunction settleApproval(view: ConversationView, { id, granted }: Message<'approval_settled'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'approval' && b.approvalId === id);\n  const request = view.blocks[i];\n  if (request?.type !== 'approval') return view;\n  return { ...view, blocks: replaceAt(view.blocks, i, { ...request, status: granted ? 'granted' : 'denied', decidedBy: 'asked' }) };\n}\n\nfunction decideApproval(view: ConversationView, { kind, subject, scope, detail, granted, source }: Message<'approval_decided'>): ConversationView {\n  return append(view, (id) => ({\n    type: 'approval', id, kind, subject, scope, status: granted ? 'granted' : 'denied', decidedBy: source,\n    ...(detail ? { detail } : {}),\n  }));\n}\n\nfunction reportUsage(view: ConversationView, message: Message<'planner_usage'>): ConversationView {\n  return isMeasured(message.totals) ? setUsageLine(view, message) : view;\n}\n\n/**\n * Nothing carries the turn's id after this, so whatever it left open is closed:\n * streaming stops, and on a stop or failure its unanswered calls and running\n * subagents say they were cut short. A plan reply that streamed as text (a\n * prose preamble decides a segment's route) gives way to its plan block, as a\n * settled message would have replaced it.\n */\nfunction endTurn(view: ConversationView, { turnId, outcome }: Message<'planner_turn_ended'>): ConversationView {\n  let next = dropBuildingPlan(view, turnId);\n  const planText = outcome === 'plan' ? finalSegmentIndex(next.blocks, turnId, true) : -1;\n  if (planText >= 0) next = { ...next, blocks: next.blocks.filter((_, i) => i !== planText) };\n  return closeOpenBlocks(next, outcome === 'stopped' ? 'stopped' : outcome === 'error' ? 'failed' : null);\n}\n\n// The summary is announced as a planner message before the transcript it now\n// heads arrives; the transcript records it as a notice, and so does the view.\nfunction markCompaction(view: ConversationView, summary: string): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'message' && b.role === 'planner' && b.turnId === undefined && b.text === summary);\n  const announced = view.blocks[i];\n  if (announced?.type === 'message') return { ...view, blocks: replaceAt(view.blocks, i, { ...announced, role: 'system' }) };\n  return append(view, (id) => settledMessage(id, 'system', summary));\n}\n\nfunction syncTranscript(view: ConversationView, { plan, turnId }: Message<'plan_generated'>): ConversationView {\n  const history = plan.conversationHistory ?? [];\n  // Only the newest marker can be the committing turn's; older ones a surface\n  // is only now catching up on belong to turns long over.\n  const committed = findLastIndex(history, (e) => e.kind === 'plan_generated');\n  let next = view;\n  let latest = view.transcriptAt;\n  for (const [i, entry] of history.entries()) {\n    const isNew = view.transcriptAt === undefined || entry.timestamp > view.transcriptAt;\n    if (isNew && entry.kind === 'plan_generated') next = markPlan(next, entry.content, i === committed ? turnId : undefined);\n    if (isNew && entry.kind === 'system') next = append(next, (id) => settledMessage(id, 'system', entry.content));\n    if (isNew && entry.kind === 'compaction') next = markCompaction(next, entry.content);\n    if (latest === undefined || entry.timestamp > latest) latest = entry.timestamp;\n  }\n  return next === view && latest === view.transcriptAt ? view : { ...next, transcriptAt: latest };\n}\n\n/**\n * Fold one input into the view. Pure and incremental: blocks the input does\n * not touch keep their identity, and an input that changes nothing returns\n * `view` itself — surfaces memoize their drawing on that, and text deltas\n * arrive quickly.\n */\nexport function reduceConversation(view: ConversationView, input: ConversationInput): ConversationView {\n  switch (input.type) {\n    case 'local_entry':\n      return append(view, (id) => settledMessage(id, input.role, input.text));\n    case 'planner_turn_started':\n      return input.prompt === undefined ? view : openTurn(view, input);\n    case 'planner_skill_loaded':\n      return append(sealLane(view, null, -1), (id) => skillLoadBlock(id, input.skill, input.turnId));\n    case 'planner_text_delta':\n      return streamText(view, input);\n    case 'planner_message':\n      return settleReply(view, input);\n    case 'planner_text_retracted':\n      return retractText(view, input);\n    case 'planner_thinking_delta':\n      return think(view, input.text, input.turnId, input.segmentId, input.subagentId);\n    case 'research_step':\n      return announceTool(view, input);\n    case 'research_step_done':\n      return settleTool(view, input);\n    case 'subagent_started':\n      return startSubagent(view, input);\n    case 'subagent_finished':\n      return finishSubagent(view, input);\n    case 'plan_token':\n      return streamPlan(view, input);\n    case 'plan_generated':\n      return syncTranscript(view, input);\n    case 'planner_turn_ended':\n      return endTurn(view, input);\n    case 'approval_request':\n      return requestApproval(view, input);\n    case 'approval_settled':\n      return settleApproval(view, input);\n    case 'approval_decided':\n      return decideApproval(view, input);\n    case 'planner_usage':\n      return reportUsage(view, input);\n    default:\n      return view;\n  }\n}\n","import type { ResearchLogEntry, ResearchStep, SkillLoadNotice, SubagentLogEntry } from '../models/Task';\nimport type { SerializedConversationMessage } from '../services/SessionMessage';\nimport { isMeasured, usageLine, type PlannerUsage } from '../models/Usage';\nimport type { DisplayBlock } from './blocks';\nimport { planMarker, settledMessage, skillLoadBlock, skillLoadNotice, subagentBlock, toolFromStep, usageBlock, userMessage } from './records';\nimport type { ConversationView } from './reduce';\n\n/** One top-level block before it has an id, and where it falls in time. */\ninterface Placed {\n  at: string;\n  /** Breaks a tie in `at`: a user's message, then the research it caused, then what the turn settled on. */\n  rank: number;\n  build: (nextId: () => string) => DisplayBlock;\n}\n\nconst USER = 0;\nconst RESEARCH = 1;\nconst SETTLED = 2;\n\n/** `loaded`: the skills the entries after a user's message say it loaded. */\nfunction fromEntry(entry: SerializedConversationMessage, loaded: readonly SkillLoadNotice[] = []): Placed['build'] {\n  if (entry.kind === 'plan_generated') return (id) => ({ type: 'plan', id: id(), text: '', ...planMarker(entry.content) });\n  if (entry.kind === 'skill_load' && entry.skill) {\n    const { skill } = entry;\n    return (id) => skillLoadBlock(id(), skillLoadNotice(skill));\n  }\n  if (entry.role === 'user' && !entry.kind) return (id) => userMessage(id(), entry.content, loaded.map(skillLoadNotice));\n  const role = entry.kind === 'system' || entry.kind === 'compaction' ? 'system' : entry.role === 'user' ? 'user' : 'planner';\n  return (id) => settledMessage(id(), role, entry.content);\n}\n\nfunction loadsAfter(entries: readonly SerializedConversationMessage[], index: number): SkillLoadNotice[] {\n  const loads: SkillLoadNotice[] = [];\n  for (let i = index + 1; i < entries.length && entries[i].kind === 'skill_load'; i++) {\n    const { skill } = entries[i];\n    if (skill?.invokedBy === 'user') loads.push(skill);\n  }\n  return loads;\n}\n\n// A skill load ranks with the message that caused it: same time, same rank,\n// and the stable sort keeps it right under the message.\nfunction rankOf(entry: SerializedConversationMessage): number {\n  return entry.role === 'user' && (!entry.kind || entry.kind === 'skill_load') ? USER : SETTLED;\n}\n\nfunction spawnBrief(step: ResearchStep): string | undefined {\n  try {\n    const args: unknown = JSON.parse(step.args);\n    const prompt = args && typeof args === 'object' ? (args as Record<string, unknown>).prompt : undefined;\n    return typeof prompt === 'string' ? prompt.trim() : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\n/**\n * Which subagent a planner step started, if it did. The log keeps no link: a\n * harness planner's subagent takes its call's id, and an ADR-0005 research\n * agent is briefed with its spawn call's prompt, trimmed.\n */\nfunction spawnedBy(step: ResearchStep, unclaimed: SubagentLogEntry[]): SubagentLogEntry | undefined {\n  const byId = unclaimed.find((e) => e.subagentId === step.toolCallId);\n  if (byId) return byId;\n  if (step.tool !== 'spawn_research_agent') return undefined;\n  const brief = spawnBrief(step);\n  return brief === undefined ? undefined : unclaimed.find((e) => e.brief === brief);\n}\n\nfunction research(log: readonly ResearchLogEntry[]): Placed[] {\n  const subagents = log.filter((e): e is SubagentLogEntry => 'type' in e && e.type === 'subagent');\n  const ownSubagent = new Set(subagents.map((e) => e.subagentId));\n  const unclaimed = [...subagents];\n  const spawnCall = new Map<string, string | undefined>();\n  const placed: Placed[] = [];\n\n  for (const entry of log) {\n    if ('type' in entry) {\n      if (entry.type === 'system') placed.push({ at: entry.timestamp, rank: RESEARCH, build: (id) => settledMessage(id(), 'system', entry.content) });\n      continue;\n    }\n    if (entry.subagentId && ownSubagent.has(entry.subagentId)) continue;\n    const spawned = spawnedBy(entry, unclaimed);\n    if (spawned) {\n      unclaimed.splice(unclaimed.indexOf(spawned), 1);\n      spawnCall.set(spawned.subagentId, entry.toolCallId);\n      continue;\n    }\n    placed.push({ at: entry.timestamp, rank: RESEARCH, build: (id) => toolFromStep(id(), entry) });\n  }\n\n  // A subagent stands where it started, which is where its spawn call was\n  // announced; the call's own record is written only once the subagent is done.\n  for (const entry of subagents) {\n    const toolCallId = spawnCall.get(entry.subagentId);\n    const steps = log.filter((e): e is ResearchStep => !('type' in e) && e.subagentId === entry.subagentId);\n    placed.push({\n      at: entry.timestamp,\n      rank: RESEARCH,\n      build: (id) => subagentBlock(id(), {\n        subagentId: entry.subagentId, brief: entry.brief, status: entry.outcome, digest: entry.digest,\n        children: steps.map((step) => toolFromStep(id(), step)),\n        toolCallId, model: entry.model, usage: entry.usage,\n      }),\n    });\n  }\n  return placed;\n}\n\n/**\n * The view a saved session reopens with: what its transcript and research log\n * kept, in the order it happened — messages, notices and the compaction\n * summary, plan markers, tool calls with each subagent's calls nested under\n * it, and the token line. Reasoning and streamed text were never saved, so a\n * reload has none.\n *\n * The research log interleaves with the transcript by time. Entries older than\n * a compaction's first kept message went with the turns it condensed.\n */\nexport function fromTranscript(\n  conversationHistory: readonly SerializedConversationMessage[] | undefined,\n  researchLog: readonly ResearchLogEntry[] | undefined,\n  plannerUsage?: PlannerUsage,\n): ConversationView {\n  const history = conversationHistory ?? [];\n  const compacted = history[0]?.kind === 'compaction' ? history[0] : undefined;\n  const kept = compacted ? history.slice(1) : history;\n  const cutoff = compacted ? (kept[0]?.timestamp ?? compacted.timestamp) : '';\n\n  const placed: Placed[] = [\n    ...kept.map((entry, i) => ({ at: entry.timestamp, rank: rankOf(entry), build: fromEntry(entry, loadsAfter(kept, i)) })),\n    ...research(researchLog ?? []).filter((item) => item.at >= cutoff),\n  ];\n  placed.sort((a, b) => (a.at < b.at ? -1 : a.at > b.at ? 1 : a.rank - b.rank));\n  // The summary stands where the condensed turns were, ahead of everything kept.\n  if (compacted) placed.unshift({ at: '', rank: SETTLED, build: fromEntry(compacted) });\n\n  let nextId = 1;\n  const id = () => `b${nextId++}`;\n  const blocks = placed.map((item) => item.build(id));\n\n  if (plannerUsage && isMeasured(plannerUsage.totals)) blocks.push(usageBlock(id(), usageLine(plannerUsage)));\n\n  const transcriptAt = history.reduce<string | undefined>((latest, e) => (latest === undefined || e.timestamp > latest ? e.timestamp : latest), undefined);\n  return { blocks, nextId, ...(transcriptAt ? { transcriptAt } : {}) };\n}\n","import type { QueuedTaskMessage, StructuredTurnEnd } from '../interfaces/IRunner';\nimport type { TaskLogEvent } from '../models/TaskLog';\nimport { addPlannerUsage, isMeasured, usageLine, type PlannerUsage } from '../models/Usage';\nimport { mapAgentTool, normalizeAgentArgs } from '../services/harness/agentTools';\nimport type { ApprovalBlock, MessageBlock, SubagentChild, SubagentStatus, ThinkingDisplayBlock } from './blocks';\nimport { toolHeadline } from './format';\nimport {\n  append, appendOutput, replaceAt, closeOpenBlocks, findLastIndex, laneAppend, laneBlocks, laneOf, laneReplace, setUsageLine, updateSubagent, sealed,\n  type BlockList, type Lane,\n} from './lanes';\nimport { finishedTool, pendingTool, settledMessage } from './records';\n\n/**\n * What a surface draws for one attempt of a structured task (ADR-0018, O1b):\n * the same display blocks as the planner conversation, built from the task's\n * {@link TaskLogEvent}s. No planner turn ids — a task's turns are its own,\n * one at a time.\n */\nexport interface TaskLogView extends BlockList {\n  /** Messages not yet delivered, oldest first; `handedOver` marks the ones the runner already has. */\n  readonly queued: readonly QueuedTaskMessage[];\n  /** A turn is running. */\n  readonly working: boolean;\n  /** How the last turn ended; absent before the first one does. */\n  readonly lastTurnEnd?: StructuredTurnEnd;\n  /** What the runner reported over the attempt, subagents included. */\n  readonly usage?: PlannerUsage;\n  /**\n   * The block each run of deltas streams into, keyed by stream, so the run's\n   * authoritative copy replaces it instead of repeating it below.\n   */\n  readonly streams: Readonly<Record<string, string>>;\n}\n\nexport const EMPTY_TASK_LOG: TaskLogView = { blocks: [], nextId: 1, queued: [], working: false, streams: {} };\n\ntype Event<T extends TaskLogEvent['type']> = Extract<TaskLogEvent, { type: T }>;\n\nconst TEXT_STREAM = 'text';\nconst thinkingStream = (subagentId: string | undefined) => `thinking:${subagentId ?? ''}`;\n\nfunction withoutStream(view: TaskLogView, key: string): TaskLogView {\n  if (!(key in view.streams)) return view;\n  return { ...view, streams: Object.fromEntries(Object.entries(view.streams).filter(([k]) => k !== key)) };\n}\n\n// A later text block of the same turn opens with a paragraph break (the\n// adapter joins a turn's messages that way); as a block of its own it needs none.\nfunction blockText(text: string): string {\n  return text.replace(/^\\n+/, '');\n}\n\ntype Streamed = MessageBlock | ThinkingDisplayBlock;\n\n/** The lane's streaming block for `key`, while it is still the lane's latest output and still streaming. */\nfunction openStream(view: TaskLogView, lane: Lane, key: string): number {\n  const id = view.streams[key];\n  if (id === undefined) return -1;\n  const blocks = laneBlocks(view, lane);\n  const i = findLastIndex(blocks, (b) => b.type !== 'usage');\n  const block = blocks[i];\n  return block?.id === id && (block.type === 'message' || block.type === 'thinking') && block.streaming ? i : -1;\n}\n\nfunction streamDelta(view: TaskLogView, lane: Lane, key: string, text: string, make: (id: string, text: string) => Streamed): TaskLogView {\n  const i = openStream(view, lane, key);\n  const open = laneBlocks(view, lane)[i];\n  if (open?.type === 'message' || open?.type === 'thinking') return laneReplace(view, lane, i, { ...open, text: open.text + text });\n  const next = appendOutput(view, lane, (id) => make(id, blockText(text)));\n  return { ...next, streams: { ...next.streams, [key]: `b${view.nextId}` } };\n}\n\n/**\n * A run's authoritative copy: it replaces the text its deltas built, wherever\n * that block now sits in the lane, and is added whole when nothing streamed.\n */\nfunction streamWhole(view: TaskLogView, lane: Lane, key: string, text: string, make: (id: string) => SubagentChild): TaskLogView {\n  const id = view.streams[key];\n  const blocks = laneBlocks(view, lane);\n  const i = id === undefined ? -1 : findLastIndex(blocks, (b) => b.id === id);\n  const streamed = blocks[i];\n  const next = withoutStream(view, key);\n  if (streamed?.type === 'message' || streamed?.type === 'thinking') {\n    return laneReplace(next, lane, i, { ...streamed, text: blockText(text), streaming: false });\n  }\n  return appendOutput(next, lane, make);\n}\n\nfunction agentText(view: TaskLogView, text: string): TaskLogView {\n  return streamWhole(view, null, TEXT_STREAM, text, (id) => settledMessage(id, 'agent', blockText(text)));\n}\n\nfunction agentTextDelta(view: TaskLogView, text: string): TaskLogView {\n  return streamDelta(view, null, TEXT_STREAM, text, (id, t) => ({ type: 'message', id, role: 'agent', text: t, streaming: true }));\n}\n\nfunction thinkingBlock(id: string, text: string, streaming: boolean, subagentId: string | undefined): ThinkingDisplayBlock {\n  return { type: 'thinking', id, text, streaming, ...(subagentId ? { subagentId } : {}) };\n}\n\nfunction thinkingDelta(view: TaskLogView, { text, subagentId }: Event<'thinking_delta'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  return streamDelta(placed, lane, thinkingStream(subagentId), text, (id, t) => thinkingBlock(id, t, true, subagentId));\n}\n\nfunction thinkingWhole(view: TaskLogView, { text, subagentId }: Event<'thinking'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  return streamWhole(placed, lane, thinkingStream(subagentId), text, (id) => thinkingBlock(id, blockText(text), false, subagentId));\n}\n\nfunction announceTool(view: TaskLogView, { id: toolCallId, name, args, subagentId }: Event<'tool_call'>): TaskLogView {\n  const { tool, toolLabel } = mapAgentTool(name);\n  const [placed, lane] = laneOf(view, subagentId);\n  return appendOutput(placed, lane, (id) => {\n    const call = pendingTool(id, { tool, toolLabel, args, toolCallId });\n    const parsed = parseArgs(args);\n    // Headline from the normalized arguments, as the harness planner's rows\n    // are, so a `Read` or a Codex argv reads the same in both views.\n    return parsed ? { ...call, headline: toolHeadline(tool, JSON.stringify(normalizeAgentArgs(tool, parsed)), toolLabel) } : call;\n  });\n}\n\nfunction parseArgs(args: string): Record<string, unknown> | null {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    return parsed && typeof parsed === 'object' && !Array.isArray(parsed) ? parsed as Record<string, unknown> : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction settleTool(view: TaskLogView, { id: toolCallId, output, success, subagentId }: Event<'tool_result'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  const blocks = laneBlocks(placed, lane);\n  const i = findLastIndex(blocks, (b) => b.type === 'tool' && b.status === 'pending' && b.toolCallId === toolCallId);\n  const pending = blocks[i];\n  const outcome = success ? 'success' : 'failure';\n  if (pending?.type === 'tool') return laneReplace(placed, lane, i, finishedTool(pending, output, outcome));\n  // The call that spawned a subagent is shown by the subagent's block, and\n  // only the subagent's own finish settles it: a backgrounded agent's call\n  // returns at launch, long before the work ends.\n  if (lane === null && blocks.some((b) => b.type === 'subagent' && b.toolCallId === toolCallId)) return view;\n  return laneAppend(placed, lane, (id) => finishedTool(pendingTool(id, { tool: 'agent_tool', toolLabel: 'Tool', args: '', toolCallId }), output, outcome));\n}\n\nfunction startSubagent(view: TaskLogView, { subagentId, brief, model }: Event<'subagent_started'>): TaskLogView {\n  return updateSubagent(view, subagentId, undefined, (block) => ({ ...block, ...(brief ? { brief } : {}), ...(model ? { model } : {}) }));\n}\n\nfunction finishSubagent(view: TaskLogView, { subagentId, outcome, digest }: Event<'subagent_finished'>): TaskLogView {\n  const usage = view.usage?.bySubagent?.[subagentId];\n  const next = updateSubagent(view, subagentId, undefined, (block) => ({\n    ...block, status: outcome, digest, children: block.children.map(sealed), ...(usage ? { usage } : {}),\n  }));\n  return withoutStream(next, thinkingStream(subagentId));\n}\n\nfunction reportUsage(view: TaskLogView, { record }: Event<'usage'>): TaskLogView {\n  const usage = addPlannerUsage(view.usage ?? { totals: {} }, record);\n  const next = { ...view, usage };\n  return isMeasured(usage.totals) ? setUsageLine(next, usageLine(usage)) : next;\n}\n\n/** A runner's tool request, read the way its call's row reads: `Bash(npm test)`. */\nexport function runnerToolSubject(tool: string, args: string): string {\n  const { tool: mapped, toolLabel } = mapAgentTool(tool);\n  const parsed = parseArgs(args);\n  const headline = toolHeadline(mapped, parsed ? JSON.stringify(normalizeAgentArgs(mapped, parsed)) : args, toolLabel);\n  return headline.keyArg ? `${headline.name}(${headline.keyArg})` : headline.name;\n}\n\nfunction requestApproval(view: TaskLogView, { approvalId, tool, args, allowForTask, toolCallId }: Event<'approval_requested'>): TaskLogView {\n  if (view.blocks.some((b) => b.type === 'approval' && b.approvalId === approvalId)) return view;\n  return append(view, (id) => ({\n    type: 'approval', id, approvalId, kind: 'runner_tool',\n    subject: runnerToolSubject(tool, args),\n    scope: tool,\n    status: 'pending',\n    ...(allowForTask ? { allowForTask } : {}),\n    ...(toolCallId ? { toolCallId } : {}),\n  }));\n}\n\nfunction settleApproval(view: TaskLogView, approvalId: string, settle: (block: ApprovalBlock) => ApprovalBlock): TaskLogView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'approval' && b.approvalId === approvalId);\n  const block = view.blocks[i];\n  if (block?.type !== 'approval' || block.status !== 'pending') return view;\n  return { ...view, blocks: replaceAt(view.blocks, i, settle(block)) };\n}\n\nfunction decideApproval(view: TaskLogView, { approvalId, decision, note }: Event<'approval_decided'>): TaskLogView {\n  return settleApproval(view, approvalId, (block) => ({\n    ...block,\n    status: decision === 'deny' ? 'denied' : 'granted',\n    decidedBy: 'asked',\n    ...(decision === 'allowForTask' ? { forTask: true } : {}),\n    ...(note ? { note } : {}),\n  }));\n}\n\nfunction startTurn(view: TaskLogView, { message, messageId }: Event<'turn_start'>): TaskLogView {\n  const queued = messageId ? view.queued.filter((m) => m.id !== messageId) : view.queued;\n  const working = { ...view, queued, working: true };\n  // A turn the runner opened itself has no user message to show.\n  return message ? append(working, (id) => settledMessage(id, 'user', message)) : working;\n}\n\nconst CUT: Record<StructuredTurnEnd, SubagentStatus | null> = { completed: null, interrupted: 'stopped', failed: 'failed' };\n\nfunction endTurn(view: TaskLogView, { reason }: Event<'turn_end'>): TaskLogView {\n  const closed = closeOpenBlocks({ ...view, working: false, lastTurnEnd: reason, streams: {} }, CUT[reason]);\n  return reason === 'interrupted' ? append(closed, (id) => settledMessage(id, 'system', 'Interrupted.')) : closed;\n}\n\nfunction queueMessage(view: TaskLogView, { messageId, text, forced }: Event<'message_queued'>): TaskLogView {\n  const listed = view.queued.find((m) => m.id === messageId);\n  if (forced) {\n    // The session's own order (ADR-0023, F2): behind earlier forced messages, ahead of the rest.\n    const rest = view.queued.filter((m) => m !== listed);\n    const at = rest.findIndex((m) => !m.forced);\n    const placed = at < 0 ? rest.length : at;\n    return { ...view, queued: [...rest.slice(0, placed), { id: messageId, text, forced: true }, ...rest.slice(placed)] };\n  }\n  if (!listed) return { ...view, queued: [...view.queued, { id: messageId, text }] };\n  if (!listed.handedOver) return view;\n  return { ...view, queued: view.queued.map((m) => (m === listed ? { id: m.id, text: m.text } : m)) };\n}\n\nfunction handOver(view: TaskLogView, { messageId }: Event<'message_handed_over'>): TaskLogView {\n  const listed = view.queued.find((m) => m.id === messageId);\n  if (!listed || listed.handedOver) return view;\n  return { ...view, queued: view.queued.map((m) => (m === listed ? { ...m, handedOver: true } : m)) };\n}\n\n/** The message joins the transcript where the runner read it, between the steps around it. */\nfunction deliverMidTurn(view: TaskLogView, event: Event<'message_delivered'>): TaskLogView {\n  return appendOutput(unqueueMessage(view, event), null, (id) => settledMessage(id, 'user', event.text));\n}\n\nfunction unqueueMessage(view: TaskLogView, { messageId }: { messageId: string }): TaskLogView {\n  const queued = view.queued.filter((m) => m.id !== messageId);\n  return queued.length === view.queued.length ? view : { ...view, queued };\n}\n\n/**\n * Fold one task-log event into the view. Pure and incremental, like\n * `reduceConversation`: an event that changes nothing returns `view` itself,\n * and an event of a type this build does not know is skipped — a log written\n * by a newer Ordewell still reads.\n */\nexport function reduceTaskLog(view: TaskLogView, event: TaskLogEvent): TaskLogView {\n  switch (event.type) {\n    case 'task_skills': return append(view, (id) => settledMessage(id, 'system', `Skills: ${event.skills.map((s) => `${s.name} (${s.path})`).join(', ')}`));\n    case 'turn_start': return startTurn(view, event);\n    case 'turn_end': return endTurn(view, event);\n    case 'text_delta': return agentTextDelta(view, event.text);\n    case 'text': return agentText(view, event.text);\n    case 'thinking_delta': return thinkingDelta(view, event);\n    case 'thinking': return thinkingWhole(view, event);\n    case 'tool_call': return announceTool(view, event);\n    case 'tool_result': return settleTool(view, event);\n    case 'subagent_started': return startSubagent(view, event);\n    case 'subagent_finished': return finishSubagent(view, event);\n    case 'usage': return reportUsage(view, event);\n    case 'message_queued': return queueMessage(view, event);\n    case 'message_removed': return unqueueMessage(view, event);\n    case 'message_handed_over': return handOver(view, event);\n    case 'message_delivered': return deliverMidTurn(view, event);\n    case 'message_undelivered': return append(unqueueMessage(view, event), (id) => settledMessage(id, 'system', `${event.text} · not delivered`));\n    case 'error': return appendOutput(view, null, (id) => settledMessage(id, 'error', event.message));\n    case 'approval_requested': return requestApproval(view, event);\n    case 'approval_decided': return decideApproval(view, event);\n    case 'approval_withdrawn': return settleApproval(view, event.approvalId, (block) => ({ ...block, status: 'withdrawn' }));\n    default: return view;\n  }\n}\n\n/** A whole attempt's events, folded from the start — what a reload shows. */\nexport function replayTaskLog(events: readonly TaskLogEvent[], from: TaskLogView = EMPTY_TASK_LOG): TaskLogView {\n  return events.reduce(reduceTaskLog, from);\n}\n","/**\n * Prompts the user sent while a planner turn was in flight, waiting to be the\n * next turn's input. The hold is a plain immutable list, oldest first, so a\n * pure reducer can keep it in state and a host can keep it in a field — and\n * either can draw it as is.\n */\nexport type PromptHold = readonly string[];\n\nexport const EMPTY_HOLD: PromptHold = [];\n\n/** One prompt taken out of the hold, and what is left behind. */\nexport interface TakenPrompt {\n  text: string;\n  rest: PromptHold;\n}\n\nexport function holdPrompt(hold: PromptHold, text: string): PromptHold {\n  return [...hold, text];\n}\n\n/** The prompt a settled turn sends next: the oldest, so they go in the order typed. */\nexport function drainNext(hold: PromptHold): TakenPrompt | undefined {\n  const [text, ...rest] = hold;\n  return text === undefined ? undefined : { text, rest };\n}\n\n/**\n * Takes back the newest prompt — the one the user most likely just regretted —\n * while the older ones stay queued behind the turn.\n */\nexport function unsendLatest(hold: PromptHold): TakenPrompt | undefined {\n  if (hold.length === 0) return undefined;\n  return { text: hold[hold.length - 1], rest: hold.slice(0, -1) };\n}\n\n/**\n * A stopped turn takes its queue with it: the prompts were written against a\n * turn that no longer exists, so they come back as one draft to edit and\n * resend rather than firing off after the stop.\n */\nexport function unsendAll(hold: PromptHold): TakenPrompt | undefined {\n  if (hold.length === 0) return undefined;\n  return { text: hold.join('\\n'), rest: EMPTY_HOLD };\n}\n\n/** Where an unsent prompt lands in the drafting input: above what is being typed, never replacing it. */\nexport function aheadOfDraft(text: string, draft: string): string {\n  return draft ? `${text}\\n${draft}` : text;\n}\n","import type { SessionMessage } from '../services/SessionMessage';\nimport { reduceConversation, type ConversationInput, type ConversationView } from './reduce';\n\n/**\n * The planner turn a surface has open, and the one its user stopped. Kept\n * beside the view rather than in it: the view is what a turn drew, this is\n * whether the surface still wants to hear from it.\n */\nexport interface TurnGate {\n  readonly open: string | null;\n  readonly stopped: string | null;\n}\n\nexport const NO_TURN: TurnGate = { open: null, stopped: null };\n\nexport interface GatedConversation {\n  view: ConversationView;\n  gate: TurnGate;\n}\n\n/** What a turn streams — everything a stop cuts off. Usage, approvals and transcript markers are facts and still land. */\nconst TURN_STREAM = new Set<SessionMessage['type']>([\n  'planner_text_delta', 'planner_thinking_delta', 'planner_text_retracted', 'planner_message', 'plan_token',\n  'research_step', 'research_step_done', 'subagent_started', 'subagent_finished', 'planner_turn_ended',\n  'planner_skill_loaded',\n]);\n\n// A message with no turn id while a stop stands can only be the stopped\n// turn's: a new turn announces itself first, and that lifts the stop.\nfunction cutOff(gate: TurnGate, input: ConversationInput): boolean {\n  if (gate.stopped === null || !TURN_STREAM.has(input.type as SessionMessage['type'])) return false;\n  const turnId = 'turnId' in input ? input.turnId : undefined;\n  return turnId === undefined || turnId === gate.stopped;\n}\n\nfunction withGate(live: GatedConversation, gate: TurnGate): GatedConversation {\n  return gate.open === live.gate.open && gate.stopped === live.gate.stopped ? live : { ...live, gate };\n}\n\n/**\n * One input into the view, the stop rule applied: a turn the user stopped is\n * over on screen, and whatever it streams until the backend notices is\n * dropped. An input that changes nothing hands back the same view and gate.\n */\nexport function followTurn(view: ConversationView, gate: TurnGate, input: ConversationInput): GatedConversation {\n  const live = { view, gate };\n  if (input.type === 'planner_turn_started') {\n    return withGate({ view: reduceConversation(view, input), gate }, { open: input.turnId, stopped: null });\n  }\n  if (cutOff(gate, input)) {\n    return input.type === 'planner_turn_ended' ? withGate(live, { ...gate, stopped: null }) : live;\n  }\n  const next = { view: reduceConversation(view, input), gate };\n  return input.type === 'planner_turn_ended' && input.turnId === gate.open ? withGate(next, { ...gate, open: null }) : next;\n}\n\n/**\n * The user stopped the planner. The turn ends on screen now rather than when\n * the backend notices the abort, so the surface is free at once and the\n * turn's late output never lands. Nothing changes when no turn is open.\n */\nexport function stopTurn(view: ConversationView, gate: TurnGate): GatedConversation {\n  if (gate.open === null) return { view, gate };\n  return {\n    view: reduceConversation(view, { type: 'planner_turn_ended', turnId: gate.open, outcome: 'stopped' }),\n    gate: { open: null, stopped: gate.open },\n  };\n}\n","import type { DisplayBlock } from './blocks';\n\n/**\n * Whether the conversation holds anything the collapsed view hides — thinking,\n * a command row's arguments and output, a subagent's children and digest. The\n * detail toggle is the only expansion control (ADR-0017, X1), so a surface\n * offers it only when it would do something.\n */\nexport function hasHiddenDetail(blocks: readonly DisplayBlock[]): boolean {\n  return blocks.some((b) => b.type === 'thinking' || b.type === 'tool' || b.type === 'subagent');\n}\n","/** The conversation line for a task starting, worded the same on every surface. */\nexport function taskStartedNotice(title: string, runner?: string): string {\n  return runner ? `Started \"${title}\" · ${runner}` : `Started \"${title}\"`;\n}\n","import { NOT_STARTED } from './status';\n\n/** What a user can do to one task from its row. */\nexport type TaskRowAction = 'cancel' | 'skip' | 'force-start' | 'complete' | 'uncomplete';\n\n/** A subtask runs with its parent, so its row offers a different set than a top-level task's. */\nexport type TaskRowPlacement = 'task' | 'subtask';\n\ninterface ActionSubject {\n  status: string;\n  type: 'ai' | 'user';\n}\n\ntype Rule = readonly [TaskRowAction, (task: ActionSubject) => boolean];\n\nconst UNSTARTED_AI = (t: ActionSubject): boolean => t.type === 'ai' && NOT_STARTED.has(t.status);\nconst QUEUED = (t: ActionSubject): boolean => t.status === 'pending' || t.status === 'approved';\n\n// Order is the order a surface lays the actions out in.\nconst TASK_RULES: readonly Rule[] = [\n  ['cancel', (t) => t.status === 'in_progress'],\n  ['skip', (t) => t.status === 'blocked'],\n  ['force-start', UNSTARTED_AI],\n  // A manual task has no runner to report it done, so it can always be marked.\n  ['complete', (t) => t.status === 'awaiting_user' || t.type === 'user'],\n  ['uncomplete', (t) => t.status === 'completed'],\n];\n\nconst SUBTASK_RULES: readonly Rule[] = [\n  ['cancel', (t) => t.status === 'in_progress'],\n  ['complete', (t) => t.status === 'in_progress' && t.type === 'ai'],\n  ['force-start', (t) => t.type === 'ai' && QUEUED(t)],\n  ['skip', QUEUED],\n  ['complete', (t) => t.status === 'awaiting_user'],\n  ['uncomplete', (t) => t.status === 'completed'],\n];\n\n/** The actions a task's row offers while a plan runs, in the order they are laid out. */\nexport function taskRowActions(task: ActionSubject, placement: TaskRowPlacement = 'task'): TaskRowAction[] {\n  const rules = placement === 'subtask' ? SUBTASK_RULES : TASK_RULES;\n  return rules.filter(([, applies]) => applies(task)).map(([action]) => action);\n}\n\n/**\n * One toggle in both directions: a done task is taken back, anything else is\n * marked done. A second control for the reverse is one nobody remembers.\n */\nexport function markAction(task: { status: string }): 'complete' | 'uncomplete' {\n  return task.status === 'completed' ? 'uncomplete' : 'complete';\n}\n\n/**\n * The mark an action asks the session for, or null when it is not a mark.\n * Skip has no request of its own: a skipped task is marked complete, so the\n * run moves on past it.\n */\nexport function markRequestFor(action: string): 'complete' | 'uncomplete' | null {\n  if (action === 'complete' || action === 'skip') return 'complete';\n  if (action === 'uncomplete') return 'uncomplete';\n  return null;\n}\n\n/** Change versus ops can still be flipped (ADR-0020): an AI task that has not started. */\nexport function opsEditable(task: ActionSubject): boolean {\n  return UNSTARTED_AI(task);\n}\n","import type { AwaitingReason } from '../models/Task';\nimport type { TaskIsolationState } from '../interfaces/IWorktreeIsolation';\nimport { taskOrderLabel, taskRef } from '../order-labels';\nimport { capConflictFiles } from '../services/conflictFiles';\nimport { approvalLabel, awaitingLabel, isTaskRunning, taskStatusKind, type TaskStatusKind } from './status';\nimport { markAction, opsEditable, taskRowActions, type TaskRowAction, type TaskRowPlacement } from './actions';\n\n/**\n * A task as both surfaces hold it, with the live state each tracks beside it\n * (silence, approvals, isolation, the merge gate). Structural, because the TUI\n * projects tasks into its own shape.\n */\nexport interface TaskRowSubject {\n  id: string;\n  order: number;\n  type: 'ai' | 'user';\n  status: string;\n  dependencies: readonly string[];\n  taskMode?: string;\n  ops?: boolean;\n  idleSince?: string | null;\n  awaitingReason?: AwaitingReason;\n  awaitingApproval?: number;\n  isolation?: TaskRowIsolation | null;\n  mergeGate?: readonly string[];\n  forcedPastGate?: readonly string[];\n}\n\nexport interface TaskRowIsolation {\n  state: TaskIsolationState;\n  repos?: string[];\n  conflictRepo?: string;\n  conflictFiles?: string[];\n  repair?: { attempt: number; limit: number };\n  repairedFiles?: string[];\n}\n\nexport interface TaskRowContext {\n  /** Set for a subtask: it is labelled by its dotted order. */\n  parent?: { order: number } | null;\n  /** Which action set the row offers; a row with a parent is a subtask's unless told otherwise. */\n  placement?: TaskRowPlacement;\n  /** Order of each task a dependency or gate may name; one missing from it is shown by id. */\n  orderOf?: ReadonlyMap<string, number>;\n  /** The modes the task's runner declares; autonomy is a tag on one of them (ADR-0001). */\n  modes?: readonly { id: string; autonomous?: boolean }[];\n}\n\n/** Whether the row stands for an AI task, a manual one, or an ops task (ADR-0020). */\nexport type TaskRowKind = 'ai' | 'user' | 'ops';\n\nexport interface TaskRowView {\n  /** \"2\", or \"2.1\" for a subtask. */\n  orderLabel: string;\n  kind: TaskRowKind;\n  status: TaskStatusKind;\n  /** A runner is live behind it — `quiet` included. */\n  running: boolean;\n  /** What an awaiting task waits on, in sentence case; null when nothing was saved. */\n  awaiting: string | null;\n  /** Runner requests waiting on the user, in sentence case; null when none do. */\n  approvals: string | null;\n  /** The task's mode is tagged autonomous: it runs without permission prompts. */\n  autonomous: boolean;\n  /** The repos its isolated work changed, by path; empty for a group of one. */\n  repos: string[];\n  /** Integration stopped on a conflict: the one isolation state that needs the user. */\n  conflict: { repo: string | null; files: string | null } | null;\n  /** A conflict repair in flight (ADR-0015) — progress, not a blocker. */\n  repairing: { files: string | null; attempt: { attempt: number; limit: number } | null } | null;\n  /** The files a conflict repair was started for; `landed` once the task is integrated. */\n  repaired: { files: string; landed: boolean } | null;\n  /** The dependencies, by reference, whose work is not merged into the user's branch yet. */\n  mergeGate: string[] | null;\n  /** An ops task changed tracked files in the user's checkout and nothing was committed. */\n  opsChangedFiles: boolean;\n  /** The dependencies, by title, a force start went past the merge gate of. */\n  forcedPastGate: readonly string[] | null;\n  /** The task's dependencies, by reference. */\n  dependencies: string[];\n  /** What the row offers while a plan runs. */\n  actions: TaskRowAction[];\n  /** The one mark its toggle sets. */\n  mark: 'complete' | 'uncomplete';\n  opsEditable: boolean;\n}\n\nconst refsOf = (ids: readonly string[], orderOf: ReadonlyMap<string, number> | undefined): string[] =>\n  ids.map((id) => {\n    const order = orderOf?.get(id);\n    return order === undefined ? id : taskRef({ order });\n  });\n\n/** A lone repository at the workspace root is not named: a group of one reads as it did before repo groups. */\nconst namedRepo = (repo: string | undefined): string | null => (repo && repo !== '.' ? repo : null);\n\n/** The repos a task changed, for a row that names them; none for a group of one. */\nexport const namedRepos = (repos: readonly string[] | undefined): string[] => (repos ?? []).filter((r) => r !== '.');\n\nconst filesOf = (files: string[] | undefined): string | null => (files?.length ? capConflictFiles(files) : null);\n\n/**\n * Everything a plan row says about one task, decided once: each surface picks\n * its own words, glyphs and casing for these facts, and derives none of them.\n */\nexport function taskRowView(task: TaskRowSubject, context: TaskRowContext = {}): TaskRowView {\n  const parent = context.parent ?? undefined;\n  const isolation = task.isolation && task.isolation.state !== 'none' ? task.isolation : null;\n  return {\n    orderLabel: taskOrderLabel(task, parent),\n    kind: task.type === 'user' ? 'user' : task.ops ? 'ops' : 'ai',\n    status: taskStatusKind(task),\n    running: isTaskRunning(task),\n    awaiting: awaitingLabel(task),\n    approvals: approvalLabel(task.awaitingApproval),\n    autonomous: task.type === 'ai' && context.modes?.find((m) => m.id === task.taskMode)?.autonomous === true,\n    repos: namedRepos(isolation?.repos),\n    conflict: isolation?.state === 'conflict'\n      ? { repo: namedRepo(isolation.conflictRepo), files: filesOf(isolation.conflictFiles) }\n      : null,\n    repairing: isolation?.state === 'repairing'\n      ? { files: filesOf(isolation.conflictFiles), attempt: isolation.repair ?? null }\n      : null,\n    repaired: isolation?.repairedFiles?.length\n      ? { files: capConflictFiles(isolation.repairedFiles), landed: isolation.state === 'integrated' }\n      : null,\n    mergeGate: task.mergeGate?.length ? refsOf(task.mergeGate, context.orderOf) : null,\n    opsChangedFiles: task.status === 'awaiting_user' && task.awaitingReason === 'files-changed',\n    forcedPastGate: task.forcedPastGate?.length ? task.forcedPastGate : null,\n    dependencies: refsOf(task.dependencies, context.orderOf),\n    actions: taskRowActions(task, context.placement ?? (parent ? 'subtask' : 'task')),\n    mark: markAction(task),\n    opsEditable: opsEditable(task),\n  };\n}\n","import { titledTaskRef } from '../order-labels';\n\ninterface Named {\n  id: string;\n  order: number;\n  title: string;\n  subtasks?: readonly Named[];\n}\n\nfunction findNamed(tasks: readonly Named[], id: string): Named | undefined {\n  for (const task of tasks) {\n    if (task.id === id) return task;\n    const nested = findNamed(task.subtasks ?? [], id);\n    if (nested) return nested;\n  }\n  return undefined;\n}\n\n/** Each id as \"#N title\", subtasks included; one the plan no longer holds stays a bare id. */\nexport function titledRefs(ids: readonly string[], tasks: readonly Named[]): string[] {\n  return ids.map((id) => {\n    const task = findNamed(tasks, id);\n    return task ? titledTaskRef(task) : id;\n  });\n}\n\n/**\n * What removing a task does to the tasks that depend on it, or null when none\n * do. Named rather than counted: the removal rewrites their dependency lists,\n * and a bare \"Remove task?\" would hide that.\n */\nexport function dependentsNotice(dependents: readonly { order: number; title: string }[]): string | null {\n  if (dependents.length === 0) return null;\n  const subject = dependents.length === 1 ? '1 task depends' : `${dependents.length} tasks depend`;\n  return `${subject} on it and will lose that dependency: ${dependents.map((t) => titledTaskRef(t)).join(', ')}.`;\n}\n\n/**\n * What a start past a merge gate is asked with (ADR-0020): the work the task\n * would act without, named. `subject` is how the asking surface refers to the\n * task — \"It\" under a title that already names it.\n */\nexport function pastGateConfirmation(unmerged: readonly string[], subject = 'This task'): string {\n  return `${subject} waits for Merge all: the work of ${unmerged.join(', ')} is not merged into your branch yet, so it would act without it. Starting it now is kept on the task.`;\n}\n\nexport interface NewTaskFields {\n  title: string;\n  description: string;\n  prompt: string;\n  type: 'ai';\n}\n\n/**\n * What a hand-added task starts as: an AI task whose description is its title\n * and whose prompt, unless one was typed, is too. Null for a title with nothing\n * in it, rather than a nameless task. Assignments are left for the session to\n * derive from the runner's catalog.\n */\nexport function newTaskFields(title: string, prompt?: string): NewTaskFields | null {\n  const name = title.trim();\n  if (!name) return null;\n  return { title: name, description: name, prompt: prompt?.trim() ? prompt : name, type: 'ai' };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,IAAAA,eAA6B;;;ACA7B,kBAA6B;;;ACCtB,IAAM,qBAAqB;AAQlC,IAAM,cAAc,IAAI,OAAO,cAAc,kBAAkB,yBAAyB,IAAI;AAcrF,SAAS,YAAYC,OAA4B;AACtD,QAAM,SAAuB,CAAC;AAC9B,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,SAASA,MAAK,SAAS,WAAW,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC,EAAE,YAAY;AAClC,QAAI,KAAK,IAAI,IAAI,EAAG;AACpB,SAAK,IAAI,IAAI;AACb,UAAM,QAAQ,MAAM,QAAQ,MAAM,CAAC,EAAE;AACrC,WAAO,KAAK,EAAE,MAAM,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,EAAE,OAAO,CAAC;AAAA,EAC/D;AACA,SAAO;AACT;AAGO,SAAS,kBAAkBA,OAAc,QAAyC;AACvF,SAAO,YAAYA,KAAI,EAAE,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,IAAI,CAAC;AAChE;;;AC/BO,SAAS,eAAe,MAAyB,QAAoC;AAC1F,SAAO,SAAS,GAAG,OAAO,KAAK,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK;AACrE;AAGO,SAAS,QAAQ,MAAyB,QAAoC;AACnF,SAAO,IAAI,eAAe,MAAM,MAAM,CAAC;AACzC;AAGO,SAAS,cAAc,MAAwC,QAAoC;AACxG,SAAO,GAAG,QAAQ,MAAM,MAAM,CAAC,IAAI,KAAK,KAAK;AAC/C;;;AF+lBA,IAAM,aAAa,IAAI,OAAO,IAAI,kBAAkB,GAAG;AAmDhD,IAAM,kBAAuC,CAAC,aAAa;;;AG3pB3D,IAAM,gBAAgB,CAAC,SAC5B,KAAK,WAAW,iBAAiB,KAAK,WAAW;AAG5C,IAAM,cAAmC,oBAAI,IAAI,CAAC,WAAW,YAAY,SAAS,CAAC;AAEnF,SAAS,eAAe,MAAqE;AAClG,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAU,aAAO;AAAA,IACtB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAiB,aAAO;AAAA,EAC/B;AACA,MAAI,CAAC,cAAc,IAAI,EAAG,QAAO;AACjC,SAAO,KAAK,WAAW,iBAAiB,KAAK,YAAY,UAAU;AACrE;AAEA,IAAM,kBAAkD;AAAA,EACtD,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,iBAAiB;AACnB;AAGO,SAAS,cAAc,MAA0E;AACtG,SAAO,KAAK,WAAW,mBAAmB,KAAK,iBAAiB,gBAAgB,KAAK,cAAc,IAAI;AACzG;AAGO,SAAS,cAAc,OAA0C;AACtE,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,QAAQ,IAAI,yBAAyB,KAAK,MAAM;AACzD;;;AJsLA,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,OAAwB,aAAwD;AAC5G,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,OAAqB,QAAsB;AACvH,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,OAAwB,QAAiD;AACpG,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;;;AKrZA,SAAS,UAAUC,OAAc,KAAqB;AACpD,QAAMC,WAAUD,MAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAC/C,SAAOC,SAAQ,SAAS,MAAM,GAAGA,SAAQ,MAAM,GAAG,GAAG,CAAC,WAAMA;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,YAAMA,WAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACjD,aAAO,WAAWA,SAAQ,MAAM,GAAG,EAAE,CAAC,GAAGA,SAAQ,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;;;ACpFA,IAAM,kBAAkB;AAOxB,IAAM,gBAAwC;AAAA,EAC5C,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,MAAM;AAAA,EACN,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM;AAAA,EACN,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,sBAAsB;AACxB;AAIA,IAAM,cAAc,CAAC,aAAa,YAAY,QAAQ,OAAO,WAAW,SAAS,WAAW,eAAe,QAAQ;AAEnH,SAAS,UAAU,MAA8C;AAC/D,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,IAAI;AACvC,WAAO,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,IAAI,SAAoC;AAAA,EAC9G,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,QAAQC,OAAsB;AACrC,SAAOA,MAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACxC;AAIA,SAAS,YAAY,SAAyB;AAC5C,QAAMC,SAAQ,QAAQ,KAAK,EAAE,MAAM,OAAO;AAC1C,QAAM,OAAOA,OAAM,SAAS;AAC5B,SAAO,OAAO,IAAI,GAAGA,OAAM,CAAC,CAAC,YAAO,IAAI,QAAQ,SAAS,IAAI,KAAK,GAAG,KAAKA,OAAM,CAAC;AACnF;AAEA,SAAS,KAAK,OAAwB;AACpC,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC7C;AAEA,SAAS,UAAU,SAAiB,MAAc,UAAU,IAAY;AACtE,SAAO,GAAG,OAAO,GAAG,OAAO,OAAO,IAAI,KAAK,EAAE,GAAG,UAAU,KAAK,OAAO,MAAM,EAAE;AAChF;AAEA,SAAS,QAAQ,MAAuC;AACtD,aAAW,SAAS,aAAa;AAC/B,UAAM,QAAQ,KAAK,KAAK,KAAK,CAAC;AAC9B,QAAI,MAAO,QAAO,UAAU,YAAY,YAAY,KAAK,IAAI,QAAQ,KAAK;AAAA,EAC5E;AACA,QAAM,YAAY,OAAO,OAAO,IAAI,EAAE,KAAK,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM,EAAE;AACvG,SAAO,YAAY,QAAQ,SAAS,IAAI;AAC1C;AAEA,SAAS,SAAS,MAAc,MAAuC;AACrE,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,YAAY,KAAK,KAAK,OAAO,CAAC;AAAA,IACvC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,KAAK,KAAK,IAAI;AAAA,IACvB,KAAK;AACH,aAAO,MAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,MAAM,EAAE,KAAK,IAAI,IAAI;AAAA,IACzE,KAAK;AACH,aAAO,UAAU,KAAK,KAAK,OAAO,GAAG,KAAK,KAAK,IAAI,CAAC;AAAA,IACtD,KAAK;AACH,aAAO,UAAU,KAAK,KAAK,OAAO,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,CAAC;AAAA,IAC1E,KAAK;AACH,aAAO,GAAG,KAAK,KAAK,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,KAAK,QAAQ,CAAC,MAAM,EAAE;AAAA,IACtF,KAAK;AACH,aAAO,KAAK,KAAK,GAAG;AAAA,IACtB,KAAK;AACH,aAAO,QAAQ,KAAK,KAAK,KAAK,CAAC;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,KAAK,KAAK,MAAM,CAAC;AAAA,IAClC;AACE,aAAO,QAAQ,IAAI;AAAA,EACvB;AACF;AAUO,SAAS,aAAa,MAAc,MAAc,WAAkC;AACzF,QAAM,OAAO,WAAW,KAAK,KAAK,cAAc,IAAI,KAAK;AACzD,QAAM,SAAS,UAAU,IAAI;AAC7B,SAAO,EAAE,MAAM,QAAQ,SAAS,SAAS,MAAM,MAAM,IAAI,QAAQ,IAAI,EAAE;AACzE;AAQO,SAAS,YAAY,QAA0B;AAEpD,QAAMA,SAAQ,OAAO,QAAQ,UAAU,IAAI,EAAE,QAAQ,iBAAiB,EAAE,EAAE,MAAM,IAAI;AACpF,SAAOA,OAAM,SAAS,KAAKA,OAAMA,OAAM,SAAS,CAAC,EAAE,KAAK,MAAM,GAAI,CAAAA,OAAM,IAAI;AAC5E,SAAOA;AACT;AAGO,SAAS,cAAc,QAAgB,UAAiC;AAC7E,QAAMA,SAAQ,YAAY,MAAM;AAChC,QAAM,QAAQA,OAAM,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC;AAClD,SAAO,EAAE,OAAO,OAAO,iBAAiBA,OAAM,SAAS,MAAM,OAAO;AACtE;AAOO,SAAS,SAAS,QAAiC;AACxD,QAAMA,SAAQ,YAAY,MAAM;AAChC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,aAAW,QAAQA,QAAO;AACxB,QAAI,KAAK,WAAW,GAAG,EAAG,UAAS;AAAA,aAC1B,KAAK,WAAW,GAAG,EAAG,YAAW;AAAA,aACjC,EAAE,KAAK,WAAW,IAAI,KAAK,KAAK,WAAW,GAAG,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,GAAI,QAAO;AAAA,EAC5G;AACA,SAAO,QAAQ,UAAU,IAAI,EAAE,OAAO,QAAQ,IAAI;AACpD;AAYA,IAAM,aAAa;AAGZ,SAAS,SAAS,QAA2B;AAClD,QAAM,OAAkB,CAAC;AACzB,MAAI,UAAU;AACd,MAAI,UAAU;AACd,aAAW,QAAQ,YAAY,MAAM,GAAG;AACtC,UAAM,QAAQ,WAAW,KAAK,IAAI;AAClC,QAAI,OAAO;AACT,UAAI,KAAK,SAAS,EAAG,MAAK,KAAK,EAAE,MAAM,OAAO,MAAM,GAAG,CAAC;AACxD,gBAAU,OAAO,MAAM,CAAC,CAAC;AACzB,gBAAU,OAAO,MAAM,CAAC,CAAC;AAAA,IAC3B,WAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,WAAK,KAAK,EAAE,MAAM,SAAS,MAAM,WAAW,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AAAA,IACnE,WAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,WAAK,KAAK,EAAE,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AAAA,IACrE,WAAW,CAAC,KAAK,WAAW,IAAI,GAAG;AACjC,WAAK,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AACjE,iBAAW;AACX,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,MAAM,OAAuB;AACpC,SAAO,GAAG,KAAK,QAAQ,UAAU,IAAI,KAAK,GAAG;AAC/C;AAGO,SAAS,YAAY,EAAE,OAAO,QAAQ,GAAqB;AAChE,MAAI,CAAC,QAAS,QAAO,SAAS,MAAM,KAAK,CAAC;AAC1C,MAAI,CAAC,MAAO,QAAO,WAAW,MAAM,OAAO,CAAC;AAC5C,SAAO,SAAS,MAAM,KAAK,CAAC,aAAa,MAAM,OAAO,CAAC;AACzD;;;AC3KA,IAAM,cAAgD;AAAA;AAAA,EAEpD,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,UAAU;AAAA,EACV,WAAW;AAAA;AAAA,EAEX,OAAO;AAAA,EACP,cAAc;AAAA,EACd,aAAa;AAAA;AAAA,EAEb,MAAM;AAAA,EACN,OAAO;AACT;AAOA,IAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,SAAS,aAAa,gBAAgB,cAAc,SAAS,OAAO,UAAU,UAAU,YAAY,CAAC;AAEvI,SAAS,eAAe,MAAuB;AACpD,SAAO,gBAAgB,IAAI,KAAK,KAAK,EAAE,YAAY,EAAE,QAAQ,SAAS,EAAE,CAAC;AAC3E;AAYO,SAAS,aAAa,MAA0B;AACrD,QAAM,aAAa,KAAK,KAAK,EAAE,YAAY,EAAE,QAAQ,SAAS,EAAE;AAChE,QAAM,SAAS,YAAY,UAAU,KAAK,YAAY,KAAK,KAAK,EAAE,YAAY,CAAC;AAC/E,MAAI,QAAQ;AAGV,WAAO,EAAE,MAAM,QAAQ,WAAW,KAAK;AAAA,EACzC;AACA,SAAO,EAAE,MAAM,cAAc,WAAW,KAAK;AAC/C;AAQO,SAAS,mBAAmB,MAAwB,MAAwD;AACjH,QAAM,MAAM,EAAE,GAAG,KAAK;AACtB,QAAM,QAAQ,CAAC,MAAc,OAAe;AAC1C,QAAI,IAAI,EAAE,MAAM,UAAa,IAAI,IAAI,MAAM,OAAW,KAAI,EAAE,IAAI,IAAI,IAAI;AAAA,EAC1E;AACA,MAAI,SAAS,eAAe,SAAS,YAAY;AAC/C,UAAM,YAAY,MAAM;AACxB,UAAM,aAAa,MAAM;AACzB,UAAM,UAAU,MAAM;AAAA,EACxB;AACA,MAAI,SAAS,QAAQ;AACnB,UAAM,OAAO,SAAS;AACtB,UAAM,UAAU,SAAS;AAEzB,QAAI,OAAO,IAAI,YAAY,YAAY,MAAM,QAAQ,IAAI,OAAO,GAAG;AACjE,UAAI,UAAW,IAAI,QAAsB,KAAK,GAAG;AAAA,IACnD;AAAA,EACF;AACA,MAAI,SAAS,QAAS,OAAM,OAAO,KAAK;AACxC,MAAI,SAAS,aAAc,OAAM,KAAK,OAAO;AAC7C,SAAO;AACT;;;AChFO,SAAS,eAAe,IAAY,MAAmBC,OAAc,QAA+B;AACzG,SAAO,EAAE,MAAM,WAAW,IAAI,MAAM,MAAAA,OAAM,WAAW,OAAO,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AAC5F;AAGO,SAAS,YAAY,IAAYA,OAAc,QAAoC,QAA+B;AACvH,QAAM,QAAQ,eAAe,IAAI,QAAQA,OAAM,MAAM;AACrD,SAAO,OAAO,SAAS,IAAI,EAAE,GAAG,OAAO,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI;AAC/E;AAGO,SAAS,gBAAgB,EAAE,WAAW,MAAM,QAAQ,MAAM,SAAS,GAAqC;AAC7G,SAAO,EAAE,WAAW,MAAM,QAAQ,MAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC,EAAG;AAC5E;AA0BO,SAAS,eAAe,IAAY,EAAE,WAAW,MAAM,QAAQ,MAAM,SAAS,GAAoB,QAAiC;AACxI,SAAO,EAAE,MAAM,cAAc,IAAI,WAAW,MAAM,QAAQ,MAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC,GAAI,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AACnI;AAKO,SAAS,cAAc,IAAY,EAAE,YAAY,OAAO,OAAO,QAAQ,GAAG,OAAO,GAAkC;AACxH,SAAO;AAAA,IACL,MAAM;AAAA,IAAY;AAAA,IAAI,GAAG;AAAA,IACzB,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,IACnC,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,IACzB,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,IACzB,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B;AACF;AAEO,SAAS,WAAW,IAAY,EAAE,QAAQ,YAAY,YAAY,GAA0B;AACjG,SAAO,EAAE,MAAM,SAAS,IAAI,QAAQ,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC,GAAI,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC,EAAG;AACrH;AAEA,IAAM,oBAA6D;AAAA,EACjE,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,cAAc;AAChB;AAEO,SAAS,aAAa,MAAiB,QAAgB,SAAyC;AACrG,QAAM,OAAO,YAAY,aAAa,eAAe,KAAK,aAAa,KAAK,IAAI,IAAI,SAAS,MAAM,IAAI;AACvG,SAAO,EAAE,GAAG,MAAM,QAAQ,kBAAkB,OAAO,GAAG,SAAS,QAAQ,iBAAiB,YAAY,MAAM,EAAE,QAAQ,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC,EAAG;AAChJ;AAEO,SAAS,YAAY,MAAiB,MAA+B;AAC1E,SAAO,aAAa,MAAM,KAAK,QAAQ,KAAK,OAAO;AACrD;AAUO,SAAS,YAAY,IAAY,EAAE,MAAM,WAAW,MAAM,YAAY,OAAO,GAA6B;AAC/G,SAAO;AAAA,IACL,MAAM;AAAA,IAAQ;AAAA,IAAI;AAAA,IAAM,UAAU,aAAa,MAAM,MAAM,SAAS;AAAA,IAAG;AAAA,IAAM,QAAQ;AAAA,IAAW,QAAQ;AAAA,IAAI,iBAAiB;AAAA,IAC7H,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,IACnC,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,IACjC,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B;AACF;AAGO,SAAS,aAAa,IAAY,MAAoB,QAA4B;AACvF,SAAO,YAAY,YAAY,IAAI,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,IAAI;AAC/D;AAQO,SAAS,WAAW,SAAwF;AACjH,QAAM,QAAQ,iBAAiB,KAAK,OAAO;AAC3C,SAAO,EAAE,QAAQ,QAAQ,WAAW,cAAc,IAAI,YAAY,aAAa,GAAI,QAAQ,EAAE,WAAW,OAAO,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,EAAG;AACnI;;;ACyQO,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;;;ACrYO,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;;;ACkDA,IAAM,eAAe,CAAC,eAAe,gBAAgB,mBAAmB;AAEjE,SAAS,SAAS,QAAqB,QAAkC;AAC9E,QAAM,OAAoB,EAAE,GAAG,OAAO;AACtC,aAAW,SAAS,cAAc;AAChC,UAAM,WAAW,OAAO,KAAK;AAC7B,QAAI,aAAa,OAAW,MAAK,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,EACnE;AACA,MAAI,OAAO,cAAc;AACvB,UAAM,EAAE,QAAQ,SAAS,IAAI,OAAO;AACpC,SAAK,eAAe,EAAE,GAAG,OAAO,cAAc,CAAC,QAAQ,IAAI,OAAO,eAAe,QAAQ,KAAK,KAAK,OAAO;AAAA,EAC5G;AACA,SAAO;AACT;AAeO,SAAS,gBAAgB,OAAqB,QAAmC;AACtF,QAAM,OAAqB,EAAE,GAAG,OAAO,QAAQ,SAAS,MAAM,QAAQ,MAAM,EAAE;AAC9E,MAAI,OAAO,YAAY;AACrB,SAAK,aAAa,EAAE,GAAG,MAAM,YAAY,CAAC,OAAO,UAAU,GAAG,SAAS,MAAM,aAAa,OAAO,UAAU,KAAK,CAAC,GAAG,MAAM,EAAE;AAC5H,WAAO;AAAA,EACT;AACA,MAAI,OAAO,gBAAgB,OAAW,MAAK,mBAAmB,OAAO;AAGrE,MAAI,OAAO,kBAAkB,UAAa,OAAO,gBAAgB,EAAG,MAAK,gBAAgB,OAAO;AAChG,SAAO;AACT;AAGO,SAAS,WAAW,QAA8B;AACvD,SAAO,OAAO,gBAAgB,UAAa,OAAO,iBAAiB,UAAa,OAAO,sBAAsB,UACxG,OAAO,KAAK,OAAO,gBAAgB,CAAC,CAAC,EAAE,SAAS;AACvD;AASO,SAAS,UAAU,OAAgC;AACxD,QAAM,cAAc,mBAAmB,KAAK;AAC5C,SAAO;AAAA,IACL,QAAQ,MAAM;AAAA,IACd,GAAI,MAAM,aAAa,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;AAAA,IAC3D,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,EACvC;AACF;AASO,SAAS,mBAAmB,OAA+E;AAChH,MAAI,MAAM,qBAAqB,UAAa,MAAM,kBAAkB,UAAa,MAAM,iBAAiB,EAAG,QAAO;AAClH,SAAO,EAAE,YAAY,MAAM,kBAAkB,cAAc,MAAM,cAAc;AACjF;;;AC9GO,SAAS,cAAiB,OAAqB,OAAqC;AACzF,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,IAAK,KAAI,MAAM,MAAM,CAAC,CAAC,EAAG,QAAO;AACxE,SAAO;AACT;AAEO,SAAS,UAAa,OAAqB,OAAe,MAAc;AAC7E,QAAM,OAAO,MAAM,MAAM;AACzB,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAGA,SAAS,UAAU,QAAiC,OAAqC;AACvF,QAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,SAAO,MAAM,SAAS,UAAU,CAAC,GAAG,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK;AAC3F;AAEO,SAAS,OAA4B,MAAS,MAAuC;AAC1F,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,KAAK,IAAI,KAAK,MAAM,EAAE,CAAC,GAAG,QAAQ,KAAK,SAAS,EAAE;AACrG;AAEO,SAAS,WAAW,MAAiB,MAA6B;AACvE,QAAM,QAAQ,KAAK,OAAO,IAAI;AAC9B,MAAI,MAAM,SAAS,WAAY,OAAM,IAAI,MAAM,SAAS,IAAI,oBAAoB;AAChF,SAAO;AACT;AAEO,SAAS,WAAW,MAAiB,MAAqC;AAC/E,SAAO,SAAS,OAAO,KAAK,SAAS,WAAW,MAAM,IAAI,EAAE;AAC9D;AAEA,SAAS,YAAiC,MAAS,MAAc,UAAuC;AACtG,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,MAAM,EAAE,GAAG,WAAW,MAAM,IAAI,GAAG,SAAS,CAAC,EAAE;AAClG;AAEO,SAAS,YAAiC,MAAS,MAAY,OAAe,OAAyB;AAC5G,MAAI,SAAS,KAAM,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,OAAO,KAAK,EAAE;AAClF,SAAO,YAAY,MAAM,MAAM,UAAU,WAAW,MAAM,IAAI,EAAE,UAAU,OAAO,KAAK,CAAC;AACzF;AAEO,SAAS,WAAgC,MAAS,MAAY,MAAwC;AAC3G,MAAI,SAAS,KAAM,QAAO,OAAO,MAAM,IAAI;AAC3C,QAAM,WAAW,CAAC,GAAG,WAAW,MAAM,IAAI,EAAE,UAAU,KAAK,IAAI,KAAK,MAAM,EAAE,CAAC;AAC7E,SAAO,EAAE,GAAG,YAAY,MAAM,MAAM,QAAQ,GAAG,QAAQ,KAAK,SAAS,EAAE;AACzE;AAEA,SAAS,YAAY,OAA8B;AACjD,UAAQ,MAAM,SAAS,aAAa,MAAM,SAAS,eAAe,MAAM;AAC1E;AAEO,SAAS,OAA+B,OAAa;AAC1D,SAAO,YAAY,KAAK,IAAI,EAAE,GAAG,OAAO,WAAW,MAAM,IAAI;AAC/D;AAOO,SAAS,SAA8B,MAAS,MAAY,MAAiB;AAClF,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,MAAI,CAAC,OAAO,KAAK,CAAC,GAAG,MAAM,MAAM,QAAQ,YAAY,CAAC,CAAC,EAAG,QAAO;AACjE,MAAI,SAAS,KAAM,QAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,GAAG,MAAO,MAAM,OAAO,IAAI,OAAO,CAAC,CAAE,EAAE;AACrG,SAAO,YAAY,MAAM,MAAM,WAAW,MAAM,IAAI,EAAE,SAAS,IAAI,CAAC,GAAG,MAAO,MAAM,OAAO,IAAI,OAAO,CAAC,CAAE,CAAC;AAC5G;AAGO,SAAS,aAAkC,MAAS,MAAY,MAAwC;AAC7G,QAAM,OAAO,WAAW,MAAM,MAAM,IAAI;AACxC,SAAO,SAAS,MAAM,MAAM,cAAc,WAAW,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC;AAC9F;AAQO,SAAS,aAAkC,MAAS,YAAoB,QAA8B;AAC3G,QAAM,WAAW,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU;AACvG,MAAI,YAAY,EAAG,QAAO,CAAC,MAAM,QAAQ;AACzC,QAAM,QAAQ,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,WAAW,cAAc,EAAE,eAAe,WAAW;AAC7H,QAAM,OAAO,KAAK,OAAO,KAAK;AAC9B,MAAI,MAAM,SAAS,QAAQ;AACzB,UAAM,QAAQ,cAAc,KAAK,IAAI;AAAA,MACnC;AAAA,MAAY,OAAO,KAAK,SAAS;AAAA,MAAQ,QAAQ;AAAA,MAAW,UAAU,CAAC;AAAA,MAAG,QAAQ;AAAA,MAAI,YAAY,KAAK;AAAA,MAAY,QAAQ,KAAK;AAAA,IAClI,CAAC;AACD,WAAO,CAAC,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,OAAO,KAAK,EAAE,GAAG,KAAK;AAAA,EAC1E;AACA,QAAM,OAAO,OAAO,MAAM,CAAC,OAAO,cAAc,IAAI,EAAE,YAAY,OAAO,IAAI,QAAQ,WAAW,UAAU,CAAC,GAAG,QAAQ,IAAI,OAAO,CAAC,CAAC;AACnI,SAAO,CAAC,MAAM,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,CAAC;AACvG;AAEO,SAAS,eAAoC,MAAS,YAAoB,QAA4B,QAAoD;AAC/J,QAAM,CAAC,MAAM,IAAI,IAAI,aAAa,MAAM,YAAY,MAAM;AAC1D,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,MAAM,OAAO,WAAW,MAAM,IAAI,CAAC,CAAC,EAAE;AACzF;AAGO,SAAS,OAA4B,MAAS,YAAgC,QAA4B;AAC/G,SAAO,aAAa,aAAa,MAAM,YAAY,MAAM,IAAI,CAAC,MAAM,IAAI;AAC1E;AAEO,SAAS,MAA2B,MAASC,OAAc,QAAiB,WAAoB,YAAwB;AAC7H,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,YAAY,MAAM;AACtD,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,YAAY,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO;AACjE,QAAM,OAAO,OAAO,SAAS;AAC7B,MAAI,MAAM,SAAS,cAAc,KAAK,aAAa,KAAK,cAAc,WAAW;AAC/E,WAAO,YAAY,QAAQ,MAAM,WAAW,EAAE,GAAG,MAAM,MAAM,KAAK,OAAOA,MAAK,CAAC;AAAA,EACjF;AACA,SAAO,aAAa,QAAQ,MAAM,CAAC,QAAQ;AAAA,IACzC,MAAM;AAAA,IAAY;AAAA,IAAI,MAAAA;AAAA,IAAM,WAAW;AAAA,IACvC,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,IACjC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,EACrC,EAAE;AACJ;AAGO,SAAS,aAAkC,MAAS,MAAoB;AAC7E,QAAM,OAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAC/C,QAAM,QAAQ,WAAW,MAAM,SAAS,UAAU,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI;AACnF,MAAI,MAAM,SAAS,QAAS,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,KAAK,OAAO,SAAS,GAAG,KAAK,EAAE;AAC5G,SAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,QAAQ,KAAK,GAAG,QAAQ,KAAK,SAAS,EAAE;AAC7E;AAEA,SAAS,WAAmC,OAAU,aAAyB;AAC7E,SAAO,eAAe,MAAM,SAAS,UAAU,MAAM,WAAW,YAAY,EAAE,GAAG,OAAO,QAAQ,cAAc,IAAI,OAAO,KAAK;AAChI;AAEA,SAAS,cAAc,OAAsB,KAA2C;AACtF,QAAM,WAAW,MAAM,SAAS,IAAI,CAAC,MAAM,WAAW,GAAG,QAAQ,IAAI,CAAC;AACtE,QAAM,SAAS,OAAO,MAAM,WAAW,YAAY,MAAM,MAAM;AAC/D,SAAO,WAAW,MAAM,UAAU,SAAS,MAAM,CAAC,GAAG,MAAM,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,QAAQ,EAAE,GAAG,OAAO,QAAQ,SAAS;AAC7H;AAOO,SAAS,gBAAqC,MAAS,KAA+B;AAC3F,QAAM,SAAS,KAAK,OAAO,IAAI,CAAC,MAAO,EAAE,SAAS,aAAa,cAAc,GAAG,GAAG,IAAI,WAAW,GAAG,QAAQ,IAAI,CAAE;AACnH,SAAO,OAAO,MAAM,CAAC,GAAG,MAAM,MAAM,KAAK,OAAO,CAAC,CAAC,IAAI,OAAO,EAAE,GAAG,MAAM,OAAO;AACjF;;;ACtIO,IAAM,qBAAuC,EAAE,QAAQ,CAAC,GAAG,QAAQ,EAAE;AAI5E,SAAS,mBAAmB,OAAqB,QAAuC;AACtF,SAAO,MAAM,SAAS,aAAa,MAAM,WAAW,UAAU,MAAM,cAAc;AACpF;AAEA,SAAS,eAAe,OAAqB,QAAgD;AAC3F,SAAO,MAAM,SAAS,UAAU,MAAM,WAAW,cAAc,MAAM,WAAW;AAClF;AASA,SAAS,kBAAkB,QAAiC,QAAgB,WAAW,OAAe;AACpG,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,MAAM,SAAS,WAAW,MAAM,SAAS,cAAc,MAAM,SAAS,cAAe,YAAY,MAAM,SAAS,OAAS;AAC7H,QAAI,MAAM,WAAW,OAAQ;AAC7B,WAAO,mBAAmB,OAAO,MAAM,IAAI,IAAI;AAAA,EACjD;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAAwB,EAAE,QAAQ,SAAS,IAAI,SAAS,CAAC,EAAE,GAAsD;AAGjI,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,MAAM;AACrF,QAAM,OAAO,KAAK,OAAO,CAAC;AAC1B,QAAM,UAAU,MAAM,SAAS,aAAa,KAAK,WAAW,UAAa,KAAK,SAAS;AACvF,QAAM,OAAyB,UAC3B,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,YAAY,KAAK,IAAI,QAAQ,QAAQ,MAAM,CAAC,EAAE,IAC3F,OAAO,MAAM,CAAC,OAAO,YAAY,IAAI,QAAQ,QAAQ,MAAM,CAAC;AAChE,MAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,QAAM,KAAK,UAAU,IAAI,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,MAAM,IAAI;AAC5G,QAAM,QAAQ,OAAO,IAAI,CAAC,OAAO,MAAM,eAAe,IAAI,KAAK,SAAS,CAAC,IAAI,OAAO,MAAM,CAAC;AAC3F,SAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG,GAAG,OAAO,GAAG,KAAK,OAAO,MAAM,EAAE,CAAC,GAAG,QAAQ,KAAK,SAAS,MAAM,OAAO;AAClI;AAEA,SAAS,WAAW,MAAwB,EAAE,QAAQ,WAAW,MAAAC,MAAK,GAAoD;AACxH,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,mBAAmB,GAAG,MAAM,KAAK,EAAE,cAAc,SAAS;AACtG,QAAM,UAAU,KAAK,OAAO,CAAC;AAC7B,MAAI,SAAS,SAAS,WAAW;AAC/B,WAAO,SAAS,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,SAAS,MAAM,QAAQ,OAAOA,OAAM,WAAW,KAAK,CAAC,GAAG,MAAM,CAAC;AAAA,EACjH;AACA,SAAO,aAAa,MAAM,MAAM,CAAC,QAAQ,EAAE,MAAM,WAAW,IAAI,MAAM,WAAW,MAAAA,OAAM,WAAW,MAAM,QAAQ,UAAU,EAAE;AAC9H;AAOA,SAAS,iBAAiB,MAAwB,QAA4B,WAAsC;AAClH,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,MAAM,cAAc,UAAa,EAAE,cAAc,WAAW;AAC/H,SAAO,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO;AACzE;AAEA,SAAS,YAAY,MAAwB,EAAE,SAAS,OAAO,GAAiD;AAC9G,MAAI,WAAW,QAAW;AACxB,UAAM,IAAI,kBAAkB,KAAK,QAAQ,MAAM;AAC/C,QAAI,KAAK,GAAG;AACV,aAAO,iBAAiB,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,eAAe,KAAK,OAAO,CAAC,EAAE,IAAI,WAAW,SAAS,MAAM,CAAC,EAAE,GAAG,MAAM;AAAA,IAC/I;AAAA,EACF;AACA,SAAO,OAAO,iBAAiB,MAAM,MAAM,GAAG,CAAC,OAAO,eAAe,IAAI,WAAW,SAAS,MAAM,CAAC;AACtG;AAIA,SAAS,YAAY,MAAwB,EAAE,QAAQ,UAAU,GAAwD;AACvH,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,mBAAmB,GAAG,MAAM,MAAM,cAAc,UAAa,EAAE,cAAc,WAAW;AACnI,SAAO,iBAAiB,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO,GAAG,QAAQ,SAAS;AAC9G;AAEA,SAAS,cAAc,MAAwB,EAAE,YAAY,OAAO,OAAO,OAAO,GAAkD;AAClI,SAAO,eAAe,MAAM,YAAY,QAAQ,CAAC,WAAW,EAAE,GAAG,OAAO,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,GAAI,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,EAAG,EAAE;AACrI;AAEA,SAAS,eAAe,MAAwB,EAAE,YAAY,SAAS,QAAQ,OAAO,OAAO,GAAmD;AAC9I,SAAO,eAAe,MAAM,YAAY,QAAQ,CAAC,WAAW;AAAA,IAC1D,GAAG;AAAA,IAAO,QAAQ;AAAA,IAAS;AAAA,IAAQ,UAAU,MAAM,SAAS,IAAI,MAAM;AAAA,IAAG,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,EACpG,EAAE;AACJ;AAEA,SAAS,aAAa,MAAwB,MAAkD;AAG9F,QAAM,SAAS,KAAK,SAAS,yBAAyB,KAAK,aAAa;AACxE,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,SAAS,SAAY,KAAK,YAAY,KAAK,MAAM;AACrF,SAAO,aAAa,QAAQ,MAAM,CAAC,QAAQ,EAAE,GAAG,YAAY,IAAI,IAAI,GAAG,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG,EAAE;AACzG;AAKA,SAAS,gBAAgB,OAAqB,MAAwC;AACpF,MAAI,MAAM,SAAS,UAAU,MAAM,WAAW,UAAW,QAAO;AAChE,SAAO,KAAK,aAAa,MAAM,eAAe,KAAK,aAAa,MAAM,eAAe,UAAa,MAAM,SAAS,KAAK;AACxH;AAEA,SAAS,WAAW,MAAwB,EAAE,MAAM,OAAO,GAAoD;AAC7G,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,KAAK,YAAY,MAAM;AAC3D,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAC/D,QAAM,UAAU,OAAO,CAAC;AACxB,MAAI,SAAS,SAAS,OAAQ,QAAO,YAAY,QAAQ,MAAM,GAAG,YAAY,SAAS,IAAI,CAAC;AAI5F,MAAI,SAAS,QAAQ,KAAK,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,KAAK,UAAU,EAAG,QAAO;AAC9H,SAAO,WAAW,QAAQ,MAAM,CAAC,OAAO,aAAa,IAAI,MAAM,MAAM,CAAC;AACxE;AAOA,SAAS,WAAW,MAAwB,EAAE,OAAO,QAAQ,UAAU,GAA4C;AACjH,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC;AACrE,QAAM,WAAW,KAAK,OAAO,CAAC;AAC9B,MAAI,UAAU,SAAS,UAAU,SAAS,cAAc,WAAW;AACjE,WAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,UAAU,MAAM,SAAS,OAAO,MAAM,CAAC,EAAE;AAAA,EACpG;AACA,SAAO,OAAO,iBAAiB,MAAM,MAAM,GAAG,CAAC,QAAQ;AAAA,IACrD,MAAM;AAAA,IAAQ;AAAA,IAAI,QAAQ;AAAA,IAAY,MAAM;AAAA,IAAO,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAAI,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,EACrH,EAAE;AACJ;AAGA,SAAS,SAAS,MAAwB,SAAiB,QAA8C;AACvG,QAAM,SAAS,WAAW,OAAO;AACjC,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC;AACrE,QAAM,WAAW,KAAK,OAAO,CAAC;AAC9B,MAAI,UAAU,SAAS,QAAQ;AAC7B,UAAM,UAAqB,EAAE,MAAM,QAAQ,IAAI,SAAS,IAAI,GAAG,QAAQ,MAAM,IAAI,GAAI,SAAS,SAAS,EAAE,QAAQ,SAAS,OAAO,IAAI,CAAC,EAAG;AACzI,WAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,OAAO,EAAE;AAAA,EAC/D;AACA,SAAO,OAAO,MAAM,CAAC,QAAQ,EAAE,MAAM,QAAQ,IAAI,MAAM,IAAI,GAAG,OAAO,EAAE;AACzE;AAEA,SAAS,gBAAgB,MAAwB,EAAE,IAAI,YAAY,MAAM,SAAS,OAAO,QAAQ,OAAO,GAAkD;AACxJ,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAY;AAAA,IAAM;AAAA,IAAS;AAAA,IAAO,QAAQ;AAAA,IAChE,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B,EAAE;AACJ;AAEA,SAAS,eAAe,MAAwB,EAAE,IAAI,QAAQ,GAAkD;AAC9G,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,EAAE;AACxF,QAAM,UAAU,KAAK,OAAO,CAAC;AAC7B,MAAI,SAAS,SAAS,WAAY,QAAO;AACzC,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,SAAS,QAAQ,UAAU,YAAY,UAAU,WAAW,QAAQ,CAAC,EAAE;AAClI;AAEA,SAAS,eAAe,MAAwB,EAAE,MAAM,SAAS,OAAO,QAAQ,SAAS,OAAO,GAAkD;AAChJ,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAM;AAAA,IAAS;AAAA,IAAO,QAAQ,UAAU,YAAY;AAAA,IAAU,WAAW;AAAA,IAC/F,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B,EAAE;AACJ;AAEA,SAAS,YAAY,MAAwB,SAAqD;AAChG,SAAO,WAAW,QAAQ,MAAM,IAAI,aAAa,MAAM,OAAO,IAAI;AACpE;AASA,SAAS,QAAQ,MAAwB,EAAE,QAAQ,QAAQ,GAAoD;AAC7G,MAAI,OAAO,iBAAiB,MAAM,MAAM;AACxC,QAAM,WAAW,YAAY,SAAS,kBAAkB,KAAK,QAAQ,QAAQ,IAAI,IAAI;AACrF,MAAI,YAAY,EAAG,QAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,QAAQ,EAAE;AAC1F,SAAO,gBAAgB,MAAM,YAAY,YAAY,YAAY,YAAY,UAAU,WAAW,IAAI;AACxG;AAIA,SAAS,eAAe,MAAwB,SAAmC;AACjF,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,aAAa,EAAE,WAAW,UAAa,EAAE,SAAS,OAAO;AACxI,QAAM,YAAY,KAAK,OAAO,CAAC;AAC/B,MAAI,WAAW,SAAS,UAAW,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,WAAW,MAAM,SAAS,CAAC,EAAE;AACzH,SAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,OAAO,CAAC;AACnE;AAEA,SAAS,eAAe,MAAwB,EAAE,MAAM,OAAO,GAAgD;AAC7G,QAAM,UAAU,KAAK,uBAAuB,CAAC;AAG7C,QAAM,YAAY,cAAc,SAAS,CAAC,MAAM,EAAE,SAAS,gBAAgB;AAC3E,MAAI,OAAO;AACX,MAAI,SAAS,KAAK;AAClB,aAAW,CAAC,GAAG,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC1C,UAAM,QAAQ,KAAK,iBAAiB,UAAa,MAAM,YAAY,KAAK;AACxE,QAAI,SAAS,MAAM,SAAS,iBAAkB,QAAO,SAAS,MAAM,MAAM,SAAS,MAAM,YAAY,SAAS,MAAS;AACvH,QAAI,SAAS,MAAM,SAAS,SAAU,QAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,MAAM,OAAO,CAAC;AAC7G,QAAI,SAAS,MAAM,SAAS,aAAc,QAAO,eAAe,MAAM,MAAM,OAAO;AACnF,QAAI,WAAW,UAAa,MAAM,YAAY,OAAQ,UAAS,MAAM;AAAA,EACvE;AACA,SAAO,SAAS,QAAQ,WAAW,KAAK,eAAe,OAAO,EAAE,GAAG,MAAM,cAAc,OAAO;AAChG;AAQO,SAAS,mBAAmB,MAAwB,OAA4C;AACrG,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AACH,aAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,MAAM,MAAM,MAAM,IAAI,CAAC;AAAA,IACxE,KAAK;AACH,aAAO,MAAM,WAAW,SAAY,OAAO,SAAS,MAAM,KAAK;AAAA,IACjE,KAAK;AACH,aAAO,OAAO,SAAS,MAAM,MAAM,EAAE,GAAG,CAAC,OAAO,eAAe,IAAI,MAAM,OAAO,MAAM,MAAM,CAAC;AAAA,IAC/F,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC,KAAK;AACH,aAAO,MAAM,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,WAAW,MAAM,UAAU;AAAA,IAChF,KAAK;AACH,aAAO,aAAa,MAAM,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,cAAc,MAAM,KAAK;AAAA,IAClC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,QAAQ,MAAM,KAAK;AAAA,IAC5B,KAAK;AACH,aAAO,gBAAgB,MAAM,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC;AACE,aAAO;AAAA,EACX;AACF;;;ACrRA,IAAM,OAAO;AACb,IAAM,WAAW;AACjB,IAAM,UAAU;AAGhB,SAAS,UAAU,OAAsC,SAAqC,CAAC,GAAoB;AACjH,MAAI,MAAM,SAAS,iBAAkB,QAAO,CAAC,QAAQ,EAAE,MAAM,QAAQ,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,WAAW,MAAM,OAAO,EAAE;AACtH,MAAI,MAAM,SAAS,gBAAgB,MAAM,OAAO;AAC9C,UAAM,EAAE,MAAM,IAAI;AAClB,WAAO,CAAC,OAAO,eAAe,GAAG,GAAG,gBAAgB,KAAK,CAAC;AAAA,EAC5D;AACA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,KAAM,QAAO,CAAC,OAAO,YAAY,GAAG,GAAG,MAAM,SAAS,OAAO,IAAI,eAAe,CAAC;AACrH,QAAM,OAAO,MAAM,SAAS,YAAY,MAAM,SAAS,eAAe,WAAW,MAAM,SAAS,SAAS,SAAS;AAClH,SAAO,CAAC,OAAO,eAAe,GAAG,GAAG,MAAM,MAAM,OAAO;AACzD;AAEA,SAAS,WAAW,SAAmD,OAAkC;AACvG,QAAM,QAA2B,CAAC;AAClC,WAAS,IAAI,QAAQ,GAAG,IAAI,QAAQ,UAAU,QAAQ,CAAC,EAAE,SAAS,cAAc,KAAK;AACnF,UAAM,EAAE,MAAM,IAAI,QAAQ,CAAC;AAC3B,QAAI,OAAO,cAAc,OAAQ,OAAM,KAAK,KAAK;AAAA,EACnD;AACA,SAAO;AACT;AAIA,SAAS,OAAO,OAA8C;AAC5D,SAAO,MAAM,SAAS,WAAW,CAAC,MAAM,QAAQ,MAAM,SAAS,gBAAgB,OAAO;AACxF;AAEA,SAAS,WAAW,MAAwC;AAC1D,MAAI;AACF,UAAM,OAAgB,KAAK,MAAM,KAAK,IAAI;AAC1C,UAAM,SAAS,QAAQ,OAAO,SAAS,WAAY,KAAiC,SAAS;AAC7F,WAAO,OAAO,WAAW,WAAW,OAAO,KAAK,IAAI;AAAA,EACtD,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,SAAS,UAAU,MAAoB,WAA6D;AAClG,QAAM,OAAO,UAAU,KAAK,CAAC,MAAM,EAAE,eAAe,KAAK,UAAU;AACnE,MAAI,KAAM,QAAO;AACjB,MAAI,KAAK,SAAS,uBAAwB,QAAO;AACjD,QAAM,QAAQ,WAAW,IAAI;AAC7B,SAAO,UAAU,SAAY,SAAY,UAAU,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK;AAClF;AAEA,SAAS,SAAS,KAA4C;AAC5D,QAAM,YAAY,IAAI,OAAO,CAAC,MAA6B,UAAU,KAAK,EAAE,SAAS,UAAU;AAC/F,QAAM,cAAc,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;AAC9D,QAAM,YAAY,CAAC,GAAG,SAAS;AAC/B,QAAM,YAAY,oBAAI,IAAgC;AACtD,QAAM,SAAmB,CAAC;AAE1B,aAAW,SAAS,KAAK;AACvB,QAAI,UAAU,OAAO;AACnB,UAAI,MAAM,SAAS,SAAU,QAAO,KAAK,EAAE,IAAI,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,OAAO,eAAe,GAAG,GAAG,UAAU,MAAM,OAAO,EAAE,CAAC;AAC9I;AAAA,IACF;AACA,QAAI,MAAM,cAAc,YAAY,IAAI,MAAM,UAAU,EAAG;AAC3D,UAAM,UAAU,UAAU,OAAO,SAAS;AAC1C,QAAI,SAAS;AACX,gBAAU,OAAO,UAAU,QAAQ,OAAO,GAAG,CAAC;AAC9C,gBAAU,IAAI,QAAQ,YAAY,MAAM,UAAU;AAClD;AAAA,IACF;AACA,WAAO,KAAK,EAAE,IAAI,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,OAAO,aAAa,GAAG,GAAG,KAAK,EAAE,CAAC;AAAA,EAC/F;AAIA,aAAW,SAAS,WAAW;AAC7B,UAAM,aAAa,UAAU,IAAI,MAAM,UAAU;AACjD,UAAM,QAAQ,IAAI,OAAO,CAAC,MAAyB,EAAE,UAAU,MAAM,EAAE,eAAe,MAAM,UAAU;AACtG,WAAO,KAAK;AAAA,MACV,IAAI,MAAM;AAAA,MACV,MAAM;AAAA,MACN,OAAO,CAAC,OAAO,cAAc,GAAG,GAAG;AAAA,QACjC,YAAY,MAAM;AAAA,QAAY,OAAO,MAAM;AAAA,QAAO,QAAQ,MAAM;AAAA,QAAS,QAAQ,MAAM;AAAA,QACvF,UAAU,MAAM,IAAI,CAAC,SAAS,aAAa,GAAG,GAAG,IAAI,CAAC;AAAA,QACtD;AAAA,QAAY,OAAO,MAAM;AAAA,QAAO,OAAO,MAAM;AAAA,MAC/C,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAYO,SAAS,eACd,qBACA,aACA,cACkB;AAClB,QAAM,UAAU,uBAAuB,CAAC;AACxC,QAAM,YAAY,QAAQ,CAAC,GAAG,SAAS,eAAe,QAAQ,CAAC,IAAI;AACnE,QAAM,OAAO,YAAY,QAAQ,MAAM,CAAC,IAAI;AAC5C,QAAM,SAAS,YAAa,KAAK,CAAC,GAAG,aAAa,UAAU,YAAa;AAEzE,QAAM,SAAmB;AAAA,IACvB,GAAG,KAAK,IAAI,CAAC,OAAO,OAAO,EAAE,IAAI,MAAM,WAAW,MAAM,OAAO,KAAK,GAAG,OAAO,UAAU,OAAO,WAAW,MAAM,CAAC,CAAC,EAAE,EAAE;AAAA,IACtH,GAAG,SAAS,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,KAAK,MAAM,MAAM;AAAA,EACnE;AACA,SAAO,KAAK,CAAC,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,OAAO,EAAE,IAAK;AAE5E,MAAI,UAAW,QAAO,QAAQ,EAAE,IAAI,IAAI,MAAM,SAAS,OAAO,UAAU,SAAS,EAAE,CAAC;AAEpF,MAAI,SAAS;AACb,QAAM,KAAK,MAAM,IAAI,QAAQ;AAC7B,QAAM,SAAS,OAAO,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;AAElD,MAAI,gBAAgB,WAAW,aAAa,MAAM,EAAG,QAAO,KAAK,WAAW,GAAG,GAAG,UAAU,YAAY,CAAC,CAAC;AAE1G,QAAM,eAAe,QAAQ,OAA2B,CAAC,QAAQ,MAAO,WAAW,UAAa,EAAE,YAAY,SAAS,EAAE,YAAY,QAAS,MAAS;AACvJ,SAAO,EAAE,QAAQ,QAAQ,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC,EAAG;AACrE;;;AC/GO,IAAM,iBAA8B,EAAE,QAAQ,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,SAAS,OAAO,SAAS,CAAC,EAAE;AAI5G,IAAM,cAAc;AACpB,IAAM,iBAAiB,CAAC,eAAmC,YAAY,cAAc,EAAE;AAEvF,SAAS,cAAc,MAAmB,KAA0B;AAClE,MAAI,EAAE,OAAO,KAAK,SAAU,QAAO;AACnC,SAAO,EAAE,GAAG,MAAM,SAAS,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,MAAM,GAAG,CAAC,EAAE;AACzG;AAIA,SAAS,UAAUC,OAAsB;AACvC,SAAOA,MAAK,QAAQ,QAAQ,EAAE;AAChC;AAKA,SAAS,WAAW,MAAmB,MAAY,KAAqB;AACtE,QAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,MAAI,OAAO,OAAW,QAAO;AAC7B,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,QAAM,QAAQ,OAAO,CAAC;AACtB,SAAO,OAAO,OAAO,OAAO,MAAM,SAAS,aAAa,MAAM,SAAS,eAAe,MAAM,YAAY,IAAI;AAC9G;AAEA,SAAS,YAAY,MAAmB,MAAY,KAAaA,OAAc,MAA2D;AACxI,QAAM,IAAI,WAAW,MAAM,MAAM,GAAG;AACpC,QAAM,OAAO,WAAW,MAAM,IAAI,EAAE,CAAC;AACrC,MAAI,MAAM,SAAS,aAAa,MAAM,SAAS,WAAY,QAAO,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM,MAAM,KAAK,OAAOA,MAAK,CAAC;AAChI,QAAM,OAAO,aAAa,MAAM,MAAM,CAAC,OAAO,KAAK,IAAI,UAAUA,KAAI,CAAC,CAAC;AACvE,SAAO,EAAE,GAAG,MAAM,SAAS,EAAE,GAAG,KAAK,SAAS,CAAC,GAAG,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE;AAC3E;AAMA,SAAS,YAAY,MAAmB,MAAY,KAAaA,OAAc,MAAkD;AAC/H,QAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,QAAM,IAAI,OAAO,SAAY,KAAK,cAAc,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE;AAC1E,QAAM,WAAW,OAAO,CAAC;AACzB,QAAM,OAAO,cAAc,MAAM,GAAG;AACpC,MAAI,UAAU,SAAS,aAAa,UAAU,SAAS,YAAY;AACjE,WAAO,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,UAAU,MAAM,UAAUA,KAAI,GAAG,WAAW,MAAM,CAAC;AAAA,EAC5F;AACA,SAAO,aAAa,MAAM,MAAM,IAAI;AACtC;AAEA,SAAS,UAAU,MAAmBA,OAA2B;AAC/D,SAAO,YAAY,MAAM,MAAM,aAAaA,OAAM,CAAC,OAAO,eAAe,IAAI,SAAS,UAAUA,KAAI,CAAC,CAAC;AACxG;AAEA,SAAS,eAAe,MAAmBA,OAA2B;AACpE,SAAO,YAAY,MAAM,MAAM,aAAaA,OAAM,CAAC,IAAI,OAAO,EAAE,MAAM,WAAW,IAAI,MAAM,SAAS,MAAM,GAAG,WAAW,KAAK,EAAE;AACjI;AAEA,SAAS,cAAc,IAAYA,OAAc,WAAoB,YAAsD;AACzH,SAAO,EAAE,MAAM,YAAY,IAAI,MAAAA,OAAM,WAAW,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC,EAAG;AACxF;AAEA,SAAS,cAAc,MAAmB,EAAE,MAAAA,OAAM,WAAW,GAAyC;AACpG,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,YAAY,QAAQ,MAAM,eAAe,UAAU,GAAGA,OAAM,CAAC,IAAI,MAAM,cAAc,IAAI,GAAG,MAAM,UAAU,CAAC;AACtH;AAEA,SAAS,cAAc,MAAmB,EAAE,MAAAA,OAAM,WAAW,GAAmC;AAC9F,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,YAAY,QAAQ,MAAM,eAAe,UAAU,GAAGA,OAAM,CAAC,OAAO,cAAc,IAAI,UAAUA,KAAI,GAAG,OAAO,UAAU,CAAC;AAClI;AAEA,SAASC,cAAa,MAAmB,EAAE,IAAI,YAAY,MAAM,MAAM,WAAW,GAAoC;AACpH,QAAM,EAAE,MAAM,UAAU,IAAI,aAAa,IAAI;AAC7C,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,aAAa,QAAQ,MAAM,CAAC,OAAO;AACxC,UAAM,OAAO,YAAY,IAAI,EAAE,MAAM,WAAW,MAAM,WAAW,CAAC;AAClE,UAAM,SAASC,WAAU,IAAI;AAG7B,WAAO,SAAS,EAAE,GAAG,MAAM,UAAU,aAAa,MAAM,KAAK,UAAU,mBAAmB,MAAM,MAAM,CAAC,GAAG,SAAS,EAAE,IAAI;AAAA,EAC3H,CAAC;AACH;AAEA,SAASA,WAAU,MAA8C;AAC/D,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,IAAI;AACvC,WAAO,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,IAAI,SAAoC;AAAA,EAC9G,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAASC,YAAW,MAAmB,EAAE,IAAI,YAAY,QAAQ,SAAS,WAAW,GAAsC;AACzH,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,WAAW,aAAa,EAAE,eAAe,UAAU;AACjH,QAAM,UAAU,OAAO,CAAC;AACxB,QAAM,UAAU,UAAU,YAAY;AACtC,MAAI,SAAS,SAAS,OAAQ,QAAO,YAAY,QAAQ,MAAM,GAAG,aAAa,SAAS,QAAQ,OAAO,CAAC;AAIxG,MAAI,SAAS,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,EAAG,QAAO;AACtG,SAAO,WAAW,QAAQ,MAAM,CAAC,OAAO,aAAa,YAAY,IAAI,EAAE,MAAM,cAAc,WAAW,QAAQ,MAAM,IAAI,WAAW,CAAC,GAAG,QAAQ,OAAO,CAAC;AACzJ;AAEA,SAASC,eAAc,MAAmB,EAAE,YAAY,OAAO,MAAM,GAA2C;AAC9G,SAAO,eAAe,MAAM,YAAY,QAAW,CAAC,WAAW,EAAE,GAAG,OAAO,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,GAAI,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,EAAG,EAAE;AACxI;AAEA,SAASC,gBAAe,MAAmB,EAAE,YAAY,SAAS,OAAO,GAA4C;AACnH,QAAM,QAAQ,KAAK,OAAO,aAAa,UAAU;AACjD,QAAM,OAAO,eAAe,MAAM,YAAY,QAAW,CAAC,WAAW;AAAA,IACnE,GAAG;AAAA,IAAO,QAAQ;AAAA,IAAS;AAAA,IAAQ,UAAU,MAAM,SAAS,IAAI,MAAM;AAAA,IAAG,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,EACpG,EAAE;AACF,SAAO,cAAc,MAAM,eAAe,UAAU,CAAC;AACvD;AAEA,SAASC,aAAY,MAAmB,EAAE,OAAO,GAAgC;AAC/E,QAAM,QAAQ,gBAAgB,KAAK,SAAS,EAAE,QAAQ,CAAC,EAAE,GAAG,MAAM;AAClE,QAAM,OAAO,EAAE,GAAG,MAAM,MAAM;AAC9B,SAAO,WAAW,MAAM,MAAM,IAAI,aAAa,MAAM,UAAU,KAAK,CAAC,IAAI;AAC3E;AAGO,SAAS,kBAAkB,MAAc,MAAsB;AACpE,QAAM,EAAE,MAAM,QAAQ,UAAU,IAAI,aAAa,IAAI;AACrD,QAAM,SAASJ,WAAU,IAAI;AAC7B,QAAM,WAAW,aAAa,QAAQ,SAAS,KAAK,UAAU,mBAAmB,QAAQ,MAAM,CAAC,IAAI,MAAM,SAAS;AACnH,SAAO,SAAS,SAAS,GAAG,SAAS,IAAI,IAAI,SAAS,MAAM,MAAM,SAAS;AAC7E;AAEA,SAASK,iBAAgB,MAAmB,EAAE,YAAY,MAAM,MAAM,cAAc,WAAW,GAA6C;AAC1I,MAAI,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,EAAG,QAAO;AAC1F,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAY,MAAM;AAAA,IACxC,SAAS,kBAAkB,MAAM,IAAI;AAAA,IACrC,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC;AAAA,IACvC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,EACrC,EAAE;AACJ;AAEA,SAASC,gBAAe,MAAmB,YAAoB,QAA8D;AAC3H,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU;AAChG,QAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,MAAI,OAAO,SAAS,cAAc,MAAM,WAAW,UAAW,QAAO;AACrE,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,OAAO,KAAK,CAAC,EAAE;AACrE;AAEA,SAASC,gBAAe,MAAmB,EAAE,YAAY,UAAU,KAAK,GAA2C;AACjH,SAAOD,gBAAe,MAAM,YAAY,CAAC,WAAW;AAAA,IAClD,GAAG;AAAA,IACH,QAAQ,aAAa,SAAS,WAAW;AAAA,IACzC,WAAW;AAAA,IACX,GAAI,aAAa,iBAAiB,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,IACvD,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,EACzB,EAAE;AACJ;AAEA,SAAS,UAAU,MAAmB,EAAE,SAAS,UAAU,GAAqC;AAC9F,QAAM,SAAS,YAAY,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS,IAAI,KAAK;AAChF,QAAM,UAAU,EAAE,GAAG,MAAM,QAAQ,SAAS,KAAK;AAEjD,SAAO,UAAU,OAAO,SAAS,CAAC,OAAO,eAAe,IAAI,QAAQ,OAAO,CAAC,IAAI;AAClF;AAEA,IAAM,MAAwD,EAAE,WAAW,MAAM,aAAa,WAAW,QAAQ,SAAS;AAE1H,SAASE,SAAQ,MAAmB,EAAE,OAAO,GAAmC;AAC9E,QAAM,SAAS,gBAAgB,EAAE,GAAG,MAAM,SAAS,OAAO,aAAa,QAAQ,SAAS,CAAC,EAAE,GAAG,IAAI,MAAM,CAAC;AACzG,SAAO,WAAW,gBAAgB,OAAO,QAAQ,CAAC,OAAO,eAAe,IAAI,UAAU,cAAc,CAAC,IAAI;AAC3G;AAEA,SAAS,aAAa,MAAmB,EAAE,WAAW,MAAAV,OAAM,OAAO,GAAyC;AAC1G,QAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS;AACzD,MAAI,QAAQ;AAEV,UAAM,OAAO,KAAK,OAAO,OAAO,CAAC,MAAM,MAAM,MAAM;AACnD,UAAM,KAAK,KAAK,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM;AAC1C,UAAM,SAAS,KAAK,IAAI,KAAK,SAAS;AACtC,WAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,IAAI,WAAW,MAAAA,OAAM,QAAQ,KAAK,GAAG,GAAG,KAAK,MAAM,MAAM,CAAC,EAAE;AAAA,EACrH;AACA,MAAI,CAAC,OAAQ,QAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,QAAQ,EAAE,IAAI,WAAW,MAAAA,MAAK,CAAC,EAAE;AACjF,MAAI,CAAC,OAAO,WAAY,QAAO;AAC/B,SAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAO,MAAM,SAAS,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,KAAK,IAAI,CAAE,EAAE;AACpG;AAEA,SAAS,SAAS,MAAmB,EAAE,UAAU,GAA8C;AAC7F,QAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS;AACzD,MAAI,CAAC,UAAU,OAAO,WAAY,QAAO;AACzC,SAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAO,MAAM,SAAS,EAAE,GAAG,GAAG,YAAY,KAAK,IAAI,CAAE,EAAE;AACpG;AAGA,SAAS,eAAe,MAAmB,OAAgD;AACzF,SAAO,aAAa,eAAe,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,eAAe,IAAI,QAAQ,MAAM,IAAI,CAAC;AACvG;AAEA,SAAS,eAAe,MAAmB,EAAE,UAAU,GAAuC;AAC5F,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS;AAC3D,SAAO,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO;AACzE;AAQO,SAAS,cAAc,MAAmB,OAAkC;AACjF,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AAAe,aAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,WAAW,MAAM,OAAO,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;AAAA,IACtJ,KAAK;AAAc,aAAO,UAAU,MAAM,KAAK;AAAA,IAC/C,KAAK;AAAY,aAAOU,SAAQ,MAAM,KAAK;AAAA,IAC3C,KAAK;AAAc,aAAO,eAAe,MAAM,MAAM,IAAI;AAAA,IACzD,KAAK;AAAQ,aAAO,UAAU,MAAM,MAAM,IAAI;AAAA,IAC9C,KAAK;AAAkB,aAAO,cAAc,MAAM,KAAK;AAAA,IACvD,KAAK;AAAY,aAAO,cAAc,MAAM,KAAK;AAAA,IACjD,KAAK;AAAa,aAAOT,cAAa,MAAM,KAAK;AAAA,IACjD,KAAK;AAAe,aAAOE,YAAW,MAAM,KAAK;AAAA,IACjD,KAAK;AAAoB,aAAOC,eAAc,MAAM,KAAK;AAAA,IACzD,KAAK;AAAqB,aAAOC,gBAAe,MAAM,KAAK;AAAA,IAC3D,KAAK;AAAS,aAAOC,aAAY,MAAM,KAAK;AAAA,IAC5C,KAAK;AAAkB,aAAO,aAAa,MAAM,KAAK;AAAA,IACtD,KAAK;AAAmB,aAAO,eAAe,MAAM,KAAK;AAAA,IACzD,KAAK;AAAuB,aAAO,SAAS,MAAM,KAAK;AAAA,IACvD,KAAK;AAAqB,aAAO,eAAe,MAAM,KAAK;AAAA,IAC3D,KAAK;AAAuB,aAAO,OAAO,eAAe,MAAM,KAAK,GAAG,CAAC,OAAO,eAAe,IAAI,UAAU,GAAG,MAAM,IAAI,qBAAkB,CAAC;AAAA,IAC5I,KAAK;AAAS,aAAO,aAAa,MAAM,MAAM,CAAC,OAAO,eAAe,IAAI,SAAS,MAAM,OAAO,CAAC;AAAA,IAChG,KAAK;AAAsB,aAAOC,iBAAgB,MAAM,KAAK;AAAA,IAC7D,KAAK;AAAoB,aAAOE,gBAAe,MAAM,KAAK;AAAA,IAC1D,KAAK;AAAsB,aAAOD,gBAAe,MAAM,MAAM,YAAY,CAAC,WAAW,EAAE,GAAG,OAAO,QAAQ,YAAY,EAAE;AAAA,IACvH;AAAS,aAAO;AAAA,EAClB;AACF;AAGO,SAAS,cAAc,QAAiC,OAAoB,gBAA6B;AAC9G,SAAO,OAAO,OAAO,eAAe,IAAI;AAC1C;;;AChRO,IAAM,aAAyB,CAAC;AAQhC,SAAS,WAAW,MAAkBG,OAA0B;AACrE,SAAO,CAAC,GAAG,MAAMA,KAAI;AACvB;AAGO,SAAS,UAAU,MAA2C;AACnE,QAAM,CAACA,OAAM,GAAG,IAAI,IAAI;AACxB,SAAOA,UAAS,SAAY,SAAY,EAAE,MAAAA,OAAM,KAAK;AACvD;AAMO,SAAS,aAAa,MAA2C;AACtE,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,KAAK,KAAK,SAAS,CAAC,GAAG,MAAM,KAAK,MAAM,GAAG,EAAE,EAAE;AAChE;AAOO,SAAS,UAAU,MAA2C;AACnE,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,KAAK,KAAK,IAAI,GAAG,MAAM,WAAW;AACnD;AAGO,SAAS,aAAaA,OAAc,OAAuB;AAChE,SAAO,QAAQ,GAAGA,KAAI;AAAA,EAAK,KAAK,KAAKA;AACvC;;;ACnCO,IAAM,UAAoB,EAAE,MAAM,MAAM,SAAS,KAAK;AAQ7D,IAAM,cAAc,oBAAI,IAA4B;AAAA,EAClD;AAAA,EAAsB;AAAA,EAA0B;AAAA,EAA0B;AAAA,EAAmB;AAAA,EAC7F;AAAA,EAAiB;AAAA,EAAsB;AAAA,EAAoB;AAAA,EAAqB;AAAA,EAChF;AACF,CAAC;AAID,SAAS,OAAO,MAAgB,OAAmC;AACjE,MAAI,KAAK,YAAY,QAAQ,CAAC,YAAY,IAAI,MAAM,IAA8B,EAAG,QAAO;AAC5F,QAAM,SAAS,YAAY,QAAQ,MAAM,SAAS;AAClD,SAAO,WAAW,UAAa,WAAW,KAAK;AACjD;AAEA,SAAS,SAAS,MAAyB,MAAmC;AAC5E,SAAO,KAAK,SAAS,KAAK,KAAK,QAAQ,KAAK,YAAY,KAAK,KAAK,UAAU,OAAO,EAAE,GAAG,MAAM,KAAK;AACrG;AAOO,SAAS,WAAW,MAAwB,MAAgB,OAA6C;AAC9G,QAAM,OAAO,EAAE,MAAM,KAAK;AAC1B,MAAI,MAAM,SAAS,wBAAwB;AACzC,WAAO,SAAS,EAAE,MAAM,mBAAmB,MAAM,KAAK,GAAG,KAAK,GAAG,EAAE,MAAM,MAAM,QAAQ,SAAS,KAAK,CAAC;AAAA,EACxG;AACA,MAAI,OAAO,MAAM,KAAK,GAAG;AACvB,WAAO,MAAM,SAAS,uBAAuB,SAAS,MAAM,EAAE,GAAG,MAAM,SAAS,KAAK,CAAC,IAAI;AAAA,EAC5F;AACA,QAAM,OAAO,EAAE,MAAM,mBAAmB,MAAM,KAAK,GAAG,KAAK;AAC3D,SAAO,MAAM,SAAS,wBAAwB,MAAM,WAAW,KAAK,OAAO,SAAS,MAAM,EAAE,GAAG,MAAM,MAAM,KAAK,CAAC,IAAI;AACvH;AAOO,SAAS,SAAS,MAAwB,MAAmC;AAClF,MAAI,KAAK,SAAS,KAAM,QAAO,EAAE,MAAM,KAAK;AAC5C,SAAO;AAAA,IACL,MAAM,mBAAmB,MAAM,EAAE,MAAM,sBAAsB,QAAQ,KAAK,MAAM,SAAS,UAAU,CAAC;AAAA,IACpG,MAAM,EAAE,MAAM,MAAM,SAAS,KAAK,KAAK;AAAA,EACzC;AACF;;;AC3DO,SAAS,gBAAgB,QAA0C;AACxE,SAAO,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,SAAS,UAAU,EAAE,SAAS,UAAU;AAC/F;;;ACTO,SAAS,kBAAkB,OAAe,QAAyB;AACxE,SAAO,SAAS,YAAY,KAAK,UAAO,MAAM,KAAK,YAAY,KAAK;AACtE;;;ACYA,IAAM,eAAe,CAAC,MAA8B,EAAE,SAAS,QAAQ,YAAY,IAAI,EAAE,MAAM;AAC/F,IAAM,SAAS,CAAC,MAA8B,EAAE,WAAW,aAAa,EAAE,WAAW;AAGrF,IAAM,aAA8B;AAAA,EAClC,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,aAAa;AAAA,EAC5C,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,SAAS;AAAA,EACtC,CAAC,eAAe,YAAY;AAAA;AAAA,EAE5B,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,mBAAmB,EAAE,SAAS,MAAM;AAAA,EACrE,CAAC,cAAc,CAAC,MAAM,EAAE,WAAW,WAAW;AAChD;AAEA,IAAM,gBAAiC;AAAA,EACrC,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,aAAa;AAAA,EAC5C,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,iBAAiB,EAAE,SAAS,IAAI;AAAA,EACjE,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,QAAQ,OAAO,CAAC,CAAC;AAAA,EACnD,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,eAAe;AAAA,EAChD,CAAC,cAAc,CAAC,MAAM,EAAE,WAAW,WAAW;AAChD;AAGO,SAAS,eAAe,MAAqB,YAA8B,QAAyB;AACzG,QAAM,QAAQ,cAAc,YAAY,gBAAgB;AACxD,SAAO,MAAM,OAAO,CAAC,CAAC,EAAE,OAAO,MAAM,QAAQ,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,MAAM,MAAM;AAC9E;AAMO,SAAS,WAAW,MAAqD;AAC9E,SAAO,KAAK,WAAW,cAAc,eAAe;AACtD;AAOO,SAAS,eAAe,QAAkD;AAC/E,MAAI,WAAW,cAAc,WAAW,OAAQ,QAAO;AACvD,MAAI,WAAW,aAAc,QAAO;AACpC,SAAO;AACT;AAGO,SAAS,YAAY,MAA8B;AACxD,SAAO,aAAa,IAAI;AAC1B;;;ACsBA,IAAM,SAAS,CAAC,KAAwB,YACtC,IAAI,IAAI,CAAC,OAAO;AACd,QAAM,QAAQ,SAAS,IAAI,EAAE;AAC7B,SAAO,UAAU,SAAY,KAAK,QAAQ,EAAE,MAAM,CAAC;AACrD,CAAC;AAGH,IAAM,YAAY,CAAC,SAA6C,QAAQ,SAAS,MAAM,OAAO;AAGvF,IAAM,aAAa,CAAC,WAAoD,SAAS,CAAC,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AAEnH,IAAM,UAAU,CAAC,UAAgD,OAAO,SAAS,iBAAiB,KAAK,IAAI;AAMpG,SAAS,YAAY,MAAsB,UAA0B,CAAC,GAAgB;AAC3F,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,YAAY,KAAK,aAAa,KAAK,UAAU,UAAU,SAAS,KAAK,YAAY;AACvF,SAAO;AAAA,IACL,YAAY,eAAe,MAAM,MAAM;AAAA,IACvC,MAAM,KAAK,SAAS,SAAS,SAAS,KAAK,MAAM,QAAQ;AAAA,IACzD,QAAQ,eAAe,IAAI;AAAA,IAC3B,SAAS,cAAc,IAAI;AAAA,IAC3B,UAAU,cAAc,IAAI;AAAA,IAC5B,WAAW,cAAc,KAAK,gBAAgB;AAAA,IAC9C,YAAY,KAAK,SAAS,QAAQ,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,KAAK,QAAQ,GAAG,eAAe;AAAA,IACrG,OAAO,WAAW,WAAW,KAAK;AAAA,IAClC,UAAU,WAAW,UAAU,aAC3B,EAAE,MAAM,UAAU,UAAU,YAAY,GAAG,OAAO,QAAQ,UAAU,aAAa,EAAE,IACnF;AAAA,IACJ,WAAW,WAAW,UAAU,cAC5B,EAAE,OAAO,QAAQ,UAAU,aAAa,GAAG,SAAS,UAAU,UAAU,KAAK,IAC7E;AAAA,IACJ,UAAU,WAAW,eAAe,SAChC,EAAE,OAAO,iBAAiB,UAAU,aAAa,GAAG,QAAQ,UAAU,UAAU,aAAa,IAC7F;AAAA,IACJ,WAAW,KAAK,WAAW,SAAS,OAAO,KAAK,WAAW,QAAQ,OAAO,IAAI;AAAA,IAC9E,iBAAiB,KAAK,WAAW,mBAAmB,KAAK,mBAAmB;AAAA,IAC5E,gBAAgB,KAAK,gBAAgB,SAAS,KAAK,iBAAiB;AAAA,IACpE,cAAc,OAAO,KAAK,cAAc,QAAQ,OAAO;AAAA,IACvD,SAAS,eAAe,MAAM,QAAQ,cAAc,SAAS,YAAY,OAAO;AAAA,IAChF,MAAM,WAAW,IAAI;AAAA,IACrB,aAAa,YAAY,IAAI;AAAA,EAC/B;AACF;;;AC7HA,SAAS,UAAU,OAAyB,IAA+B;AACzE,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,OAAO,GAAI,QAAO;AAC3B,UAAM,SAAS,UAAU,KAAK,YAAY,CAAC,GAAG,EAAE;AAChD,QAAI,OAAQ,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,KAAwB,OAAmC;AACpF,SAAO,IAAI,IAAI,CAAC,OAAO;AACrB,UAAM,OAAO,UAAU,OAAO,EAAE;AAChC,WAAO,OAAO,cAAc,IAAI,IAAI;AAAA,EACtC,CAAC;AACH;AAOO,SAAS,iBAAiB,YAAwE;AACvG,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,UAAU,WAAW,WAAW,IAAI,mBAAmB,GAAG,WAAW,MAAM;AACjF,SAAO,GAAG,OAAO,yCAAyC,WAAW,IAAI,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAC9G;AAOO,SAAS,qBAAqB,UAA6B,UAAU,aAAqB;AAC/F,SAAO,GAAG,OAAO,qCAAqC,SAAS,KAAK,IAAI,CAAC;AAC3E;AAeO,SAAS,cAAc,OAAe,QAAuC;AAClF,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,CAAC,KAAM,QAAO;AAClB,SAAO,EAAE,OAAO,MAAM,aAAa,MAAM,QAAQ,QAAQ,KAAK,IAAI,SAAS,MAAM,MAAM,KAAK;AAC9F;","names":["import_uuid","text","text","oneLine","text","lines","text","text","text","text","announceTool","parseArgs","settleTool","startSubagent","finishSubagent","reportUsage","requestApproval","settleApproval","decideApproval","endTurn","text"]}
+{"version":3,"sources":["../src/plan-utils.ts","../src/services/TaskOps.ts","../src/models/Task.ts","../src/conversation/skillTokens.ts","../src/order-labels.ts","../src/taskRow/status.ts","../src/services/researchStepSummary.ts","../src/conversation/format.ts","../src/services/harness/agentTools.ts","../src/conversation/records.ts","../src/services/SessionMessage.ts","../src/services/conflictFiles.ts","../src/models/Usage.ts","../src/conversation/lanes.ts","../src/conversation/reduce.ts","../src/conversation/transcript.ts","../src/conversation/taskLog.ts","../src/conversation/promptHold.ts","../src/conversation/turnGate.ts","../src/conversation/detail.ts","../src/conversation/notices.ts","../src/taskRow/actions.ts","../src/taskRow/view.ts","../src/taskRow/texts.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/conflictFiles';\n// The shared conversation view (#51) is pure too, so every surface — a webview\n// included — draws from the same reducer.\nexport * from './conversation';\n// The task row view is pure for the same reason: the webview draws a task card\n// from the facts the TUI paints its plan row from.\nexport * from './taskRow';\nexport { taskOrderLabel, taskRef, titledTaskRef } from './order-labels';\n// The one runner default, shared with the webview so its initial state cannot\n// drift from the plans the host builds.\nexport { DEFAULT_RUNNERS } from './models/Task';\n","import { v4 as uuidv4 } from 'uuid';\nimport {\n  Task, RunnerId, flattenTasks,\n  addTaskToPlan, removeTaskFromPlan, updateTaskInPlan, renumberTasks,\n  createTask, opsFlag, inheritedOps, inheritedSkills, skillNames,\n} from '../models/Task';\nimport { extractObjectsWithKey, stripTrailingCommas, escapeControlCharsInStrings, PlanParseError, TASK_OPS_ENVELOPE_KEY } from './JsonExtractor';\nimport { validateTaskEdit, checkModelAndModeValidity, type EditCatalog, type TaskEditActor, type TaskEditCheck } 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', 'ops', 'skills',\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 = '', tools = false): string[] {\n  const updateChanges = UPDATABLE_FIELDS\n    .map((f) => (f === 'dependencies' ? '\"dependencies\"?:[\"<id or #order>\"]' : `\"${f}\"?`))\n    .join(',');\n  return [\n    tools ? '- To modify specific tasks, call edit_plan, never a JSON reply. Its argument is:' : '- To modify specific tasks, reply with ONLY this JSON object:',\n    tools ? '  {\"ops\": [' : '  {\"taskOps\": [',\n    `    {\"op\":\"update\",\"taskId\":\"<id or #order>\",\"changes\":{${updateChanges}}},`,\n    '    {\"op\":\"add\",\"task\":{\"title\",\"description\",\"prompt\",\"dependencies\":[\"<id or #order>\"],\"assignedRunner\"?,\"assignedModel\"?,\"ops\"?},\"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    tools ? '- For sweeping changes, you may instead call submit_plan with the full plan.' : '- 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 ${tools ? 'list_runners and list_models return' : '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    ...(tools ? ['edit_plan checks the batch when you call it and answers with what it will change, or with the error to fix — call it again in the same reply. The edit is applied when your reply ends; edits you make in one reply join one batch.'] : []),\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    '\"skills\" in \"changes\" REPLACES the task\\'s whole skill list. To add one, send the names the plan block shows in its skills:[...] plus the new one; to drop one, send the rest; [] removes them all.',\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: readonly 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/**\n * The task references an op carries, before a batch handle resolves; an `add`\n * names none. Used to tell whether a batch reaches a task a runner is running.\n */\nexport function taskOpRefs(op: TaskOp): string[] {\n  switch (op.op) {\n    case 'update':\n    case 'remove':\n    case 'split':\n    case 'rearm':\n      return [op.taskId];\n    case 'merge':\n    case 'reorder':\n      return op.taskIds;\n    case 'add':\n      return [];\n  }\n}\n\n/** Whether a written reference names `task` by id, `#order`, bare order, or title. */\nexport function refMatchesTask(ref: unknown, task: Pick<Task, 'id' | 'order' | 'title'>): boolean {\n  if (typeof ref !== 'string' && typeof ref !== 'number') return false;\n  const s = String(ref).trim();\n  if (task.id === s) return true;\n  const orderStr = s.startsWith('#') ? s.slice(1) : s;\n  return (/^\\d+$/.test(orderStr) && task.order === Number(orderStr)) || task.title === s;\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\n/** The fields of a planner's `changes` it may set, with the ops flag read as every entry point reads it. */\nfunction updatableChanges(raw: Partial<Task> | undefined): Partial<Task> {\n  const changes: Partial<Task> = {};\n  for (const key of UPDATABLE_FIELDS) {\n    if (raw && key in raw) (changes as Record<string, unknown>)[key] = (raw as Record<string, unknown>)[key];\n  }\n  if ('ops' in changes) changes.ops = opsFlag(changes.ops);\n  if ('skills' in changes) changes.skills = skillNames(changes.skills);\n  return changes;\n}\n\n/**\n * An added task's subtasks, kept as given but with their skills stored as a\n * task's are: the edit's skill check warned that a name no skill could have\n * was not attached, so it must not be.\n */\nfunction withSkillNames(subtasks: Task[] | undefined): Task[] | undefined {\n  if (!Array.isArray(subtasks)) return subtasks;\n  return subtasks.map((sub: unknown) => {\n    if (typeof sub !== 'object' || sub === null) return sub as Task;\n    const { skills, ...rest } = sub as Task;\n    const names = skillNames(skills);\n    return {\n      ...rest,\n      ...(names ? { skills: names } : {}),\n      ...('subtasks' in rest ? { subtasks: withSkillNames(rest.subtasks) as Task[] } : {}),\n    };\n  });\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: readonly 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: readonly 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: readonly 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: readonly 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: readonly 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: readonly 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  /**\n   * The resolve-and-validate half shared by \"update\" and \"rearm\": resolve the\n   * target, apply the field allowlist and runner check, run the edit validator\n   * under the op's audience, then resolve any dependency refs. `refuseRunning`\n   * is rearm's extra lock check, kept before the field work so its message wins.\n   */\n  const prepareEdit = (\n    op: { taskId: string; changes?: Partial<Task> },\n    opIndex: number,\n    label: string,\n    audience: TaskEditActor,\n    refuseRunning = false,\n  ): { target: Task; changes: Partial<Task>; check: TaskEditCheck } | { error: string } => {\n    const ref = resolveRef(op.taskId, originalFlatAll, flattenTasks(tasks), handleOwner, handleId, opIndex);\n    if ('error' in ref) return { error: `${label}: ${ref.error}` };\n    const target = findInTasks(tasks, ref.id);\n    if (!target) return { error: `${label}: task \"${op.taskId}\" no longer exists in this batch (removed, merged, or split by an earlier op)` };\n    if (refuseRunning && target.status === 'in_progress') return { error: `${label}: \"${target.title}\" is running and cannot be re-armed` };\n    const changes = updatableChanges(op.changes);\n    if (changes.assignedRunner && !runners.includes(changes.assignedRunner)) {\n      return { error: `${label}: runner \"${changes.assignedRunner}\" is not in this plan's runner set [${runners.join(', ')}]` };\n    }\n    // Dependency refs are still unresolved (e.g. \"#3\") at this point, so the\n    // check runs on everything but them; resolveDeps below handles them once\n    // they're real ids.\n    const changesForCheck: Partial<Task> = { ...changes };\n    delete changesForCheck.dependencies;\n    const check = validateTaskEdit(audience, flattenTasks(tasks), target.id, changesForCheck, catalog);\n    if (!check.ok) return { error: `${label}: ${check.error}` };\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, opIndex);\n      if (bad.length) return { error: `${label}: unknown dependencies: ${bad.join(', ')}` };\n      changes.dependencies = ids.filter((id) => id !== target.id);\n    }\n    return { target, changes, check };\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 prep = prepareEdit(op, i, label, 'planner');\n        if ('error' in prep) { errors.push(prep.error); break; }\n        const { target, changes, check } = prep;\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          subtasks: withSkillNames(spec.subtasks),\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 = [...new Map(resolved.map((t) => [t!.id, t!])).values()].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          ops: inheritedOps(toMerge, spec.ops),\n          skills: inheritedSkills(spec.skills, toMerge.flatMap((t) => t.skills ?? [])),\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            ops: inheritedOps([target], spec.ops),\n            skills: inheritedSkills(spec.skills, target.skills),\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        // Re-arming is the sanctioned exception to the planner lock — its whole\n        // point is to touch a task the lock would otherwise refuse — so it\n        // validates as a direct edit; well-formedness still applies.\n        const prep = prepareEdit(op, i, label, 'direct', true);\n        if ('error' in prep) { errors.push(prep.error); break; }\n        const { target, changes, check } = prep;\n        tasks = updateTaskInPlan(tasks, target.id, { ...changes, status: 'pending', verdict: undefined, outputSummary: undefined, awaitingReason: 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 { v4 as uuidv4 } from 'uuid';\nimport type { PlanIsolation } from '../interfaces/IWorktreeIsolation';\nimport type { PlannerUsage, UsageRecord, UsageTotals } from './Usage';\nimport type { SkillSource } from '../services/SkillsService';\nimport { SKILL_NAME_PATTERN } from '../conversation/skillTokens';\n\nexport interface UserStep {\n  order: number;\n  instruction: string;\n  completed: boolean;\n}\n\n/** One deterministic signal gathered while verifying a completed task. `completion_marker` is only in verdicts saved before completion was reported through `task_complete` alone. */\nexport interface VerificationCheck {\n  name: 'exit_code' | 'completion_marker' | 'task_complete' | 'manual';\n  passed: boolean;\n  /** A check that did not apply. Skipped checks don't affect the verdict. */\n  skipped: boolean;\n  detail: string;\n}\n\n/** Evidence-based verdict for a completed task. Single end-to-end outcome produced by verification. */\nexport interface Verdict {\n  outcome: 'pass' | 'fail';\n  reason: string;\n  checks: VerificationCheck[];\n  decidedAt: string;\n}\n\nexport interface TaskOutputSummary {\n  reviewReason: string;\n  logTail: string;\n  capturedAt: string;\n}\n\nexport type TaskType = 'ai' | 'user';\nexport type TaskStatus = 'pending' | 'approved' | 'in_progress' | 'completed' | 'failed' | 'blocked' | 'awaiting_user';\nexport type TaskMode = string;\n\n/**\n * Why an `awaiting_user` task waits (ADR-0018, W1): a structured turn that\n * ended without a `task_complete` call, a checkpoint question, work that did not\n * land, or an ops task that changed tracked files (ADR-0020). Saved, so no\n * surface has to guess it from whether an attempt is live.\n */\nexport type AwaitingReason = 'input' | 'checkpoint' | 'conflict' | 'files-changed';\n\nexport function isAwaitingReason(value: unknown): value is AwaitingReason {\n  return value === 'input' || value === 'checkpoint' || value === 'conflict' || value === 'files-changed';\n}\n\nexport interface TaskModelAssignment {\n  modelId: string;\n  modelLabel: string;\n  thinkingEffort?: string;\n  /**\n   * All variant ids the model offered when this assignment was made. Carried\n   * on the assignment because runners need it at spawn time (opencode's TUI\n   * only honors an assigned variant when the others are config-disabled) and\n   * the discovery catalog isn't available there.\n   */\n  availableVariants?: string[];\n}\n\nexport type RunnerId = string;\n\n/**\n * Bring loaded tasks to the structured-only shape, in place. A task saved\n * while the terminal transport existed may say it ran there, and why; neither\n * means anything now, and such a task left no session to continue. Its\n * completion marker id went with the text markers: completion is reported\n * only through `task_complete`.\n */\nexport function migrateLoadedTasks(tasks: readonly Task[]): void {\n  for (const task of tasks) {\n    if (typeof task.runnerSessionId !== 'string') delete task.runnerSessionId;\n    const legacy = task as Task & { transport?: { kind?: unknown; nativeSessionId?: unknown } };\n    if (!task.runnerSessionId && legacy.transport?.kind === 'structured' && typeof legacy.transport.nativeSessionId === 'string') {\n      task.runnerSessionId = legacy.transport.nativeSessionId;\n    }\n    delete legacy.transport;\n    delete (task as { completionMarker?: unknown }).completionMarker;\n    migrateLoadedTasks(task.subtasks ?? []);\n  }\n}\n\n/**\n * A task skill as one attempt received it: read from the task's own worktree\n * (or global) at spawn, kept so the user can see what the runner was told\n * even after the skill's file changes.\n */\nexport interface TaskSkillSnapshot {\n  name: string;\n  source: SkillSource;\n  path: string;\n  content: string;\n}\n\n/** A task skill as a surface is told of it: the body stays in the task's log file and the session. */\nexport type TaskSkillNotice = Omit<TaskSkillSnapshot, 'content'>;\n\nexport interface Task {\n  id: string;\n  order: number;\n  title: string;\n  description: string;\n  type: TaskType;\n  status: TaskStatus;\n  dependencies: string[];\n  prompt?: string;\n  userSteps?: UserStep[];\n  subtasks: Task[];\n  verdict?: Verdict;\n  outputSummary?: TaskOutputSummary;\n  assignedModel?: TaskModelAssignment;\n  assignedRunner: RunnerId;\n  thinkingEffort?: string;\n  taskMode?: TaskMode;\n  autonomy?: 'AFK' | 'HITL';\n  sliceType?: 'HITL' | 'AFK';\n  userStoriesCovered?: string[];\n  /** The runner's saved session for a later continue; cleared when a fresh attempt starts. */\n  runnerSessionId?: string;\n  /** Set only while `status` is `awaiting_user`, and not always then — a usage-limit pause has none. */\n  awaitingReason?: AwaitingReason;\n  /**\n   * An ops task (ADR-0020): it changes no repository files, runs at the\n   * workspace root rather than in a worktree, and waits for the change tasks\n   * it depends on to be merged into the user's branch. Top-level AI tasks\n   * only; absent means a change task.\n   */\n  ops?: boolean;\n  /**\n   * The dependencies, by title, whose work was not merged into the user's\n   * branch when the user force-started this task past its merge gate\n   * (ADR-0020). Cleared when the task is retried.\n   */\n  forcedPastGate?: string[];\n  /**\n   * Task skills (`applies-to: task`) attached by name. Their bodies are put in\n   * the runner's prompt at spawn, resolved where the task runs — a subtask's\n   * are its own, never its parent's. Absent means none.\n   */\n  skills?: string[];\n  /** The skills the latest attempt was given, as read when it spawned. */\n  attemptSkills?: TaskSkillSnapshot[];\n}\n\nexport interface DiscoveredMode {\n  id: string;\n  label: string;\n  description: string;\n}\n\nexport type ResearchToolType =\n  | 'read_file' | 'read_files' | 'glob' | 'grep' | 'find_symbol' | 'list_dir'\n  | 'bash' | 'fetch' | 'web_search' | 'spawn_research_agent'\n  /**\n   * A tool belonging to a harness planner's own toolbox (ADR-0009) that has no\n   * Ordewell equivalent — Edit, WebFetch, TodoWrite, whatever a coding agent\n   * ships next. The real name travels in `toolLabel` rather than being\n   * relabelled as a tool it is not; the union stays closed so the\n   * exhaustiveness checks in every surface's icon/label switch survive.\n   */\n  | 'agent_tool';\n\n/**\n * What happened when a research tool call ran, for honest per-surface\n * rendering. The broadcast seam carries this on every `research_step_done` so\n * surfaces do not have to pattern-match refusal text to tell a refused `rm`\n * from a successful `rm` — the old render path flipped a `✓` for both.\n */\nexport type ResearchStepOutcome = 'success' | 'failure' | 'refused' | 'denied' | 'not_executed';\n\nexport interface ResearchStep {\n  id: string;\n  tool: ResearchToolType;\n  /** The tool's own name when it came from a harness planner — always set for `agent_tool`. */\n  toolLabel?: string;\n  args: string;\n  result: string;\n  success: boolean;\n  outcome: ResearchStepOutcome;\n  /** The model's tool_call id, so a surface can match `tool_result` to the\n   * pending `tool_call` it announced — robust under parallel same-tool rounds. */\n  toolCallId?: string;\n  /** The research subagent that ran the call, so a reload regroups it under that subagent. */\n  subagentId?: string;\n  timestamp: string;\n  thinkingText?: string;\n}\n\nexport interface UserPromptEntry {\n  id: string;\n  type: 'user_prompt' | 'system';\n  content: string;\n  timestamp: string;\n}\n\nexport type SubagentOutcome = 'done' | 'failed' | 'stopped';\n\n/**\n * One subagent's whole run, logged when it finishes: what it was asked, how it\n * ended and what it reported. Its steps stay separate entries carrying the same\n * `subagentId`, so an older reader that knows only steps still shows them.\n */\nexport interface SubagentLogEntry {\n  id: string;\n  type: 'subagent';\n  subagentId: string;\n  brief: string;\n  model?: string;\n  outcome: SubagentOutcome;\n  digest: string;\n  usage?: UsageTotals;\n  timestamp: string;\n}\n\nexport type ResearchLogEntry = ResearchStep | UserPromptEntry | SubagentLogEntry;\n\nexport interface ResearchProgress {\n  // 'liveness' carries no content: a raw-line signal from the harness process\n  // (ADR-0009) that reaches a surface even when a turn is producing nothing\n  // visible — a subagent's filtered chatter, most often — so an idle watchdog\n  // downstream doesn't mistake \"nothing to show\" for \"nothing happening\".\n  //\n  // The turn-scoped kinds below carry one planner turn's stream (#47); see the\n  // matching SessionMessage variants for the invariants each one keeps.\n  // 'text_delta' is reply text as the model streams it (`text`, `segmentId`),\n  // an envelope included: the turn's owner routes each segment to prose or to\n  // the plan display, so no backend has to tell them apart. 'text_retracted'\n  // takes back an attempt's text: `segmentId`'s, or when absent everything the\n  // backend call that sends it has streamed.\n  // 'usage' reports one model call (`record`). 'subagent_started' carries\n  // `brief` and `model`; 'subagent_finished' carries `outcome`, `digest` and\n  // `usage`.\n  type:\n    | 'thinking' | 'tool_call' | 'tool_result' | 'plan_token' | 'interrupted' | 'liveness'\n    | 'text_delta' | 'text_retracted' | 'usage' | 'subagent_started' | 'subagent_finished';\n  /** Minted by whoever runs the turn and passed through untouched; absent outside a turn. */\n  turnId?: string;\n  /** One continuous run of model text — text before a tool call is its own segment. */\n  segmentId?: string;\n  text?: string;\n  tool?: string;\n  /** Harness planners (ADR-0009): the agent's own name for a tool Ordewell has no member for. */\n  toolLabel?: string;\n  toolArgs?: string;\n  toolResult?: string;\n  planToken?: string;\n  step?: ResearchStep;\n  /** The model's tool_call id, threaded on tool_call and tool_result so a\n   * surface can match the result to its pending call — robust under parallel\n   * same-tool rounds where LIFO-by-name matching mislabels summaries. */\n  toolCallId?: string;\n  /** Present when this event originates from (or reports on) one spawned research subagent (issue #34). */\n  subagentId?: string;\n  record?: UsageRecord;\n  brief?: string;\n  model?: string;\n  outcome?: SubagentOutcome;\n  digest?: string;\n  usage?: UsageTotals;\n}\n\nexport interface ThinkingBlock {\n  id: string;\n  text: string;\n}\n\nexport interface StreamThinkingEvent {\n  type: 'thinking';\n  block: ThinkingBlock;\n}\n\nexport interface StreamStepEvent {\n  type: 'step';\n  step: ResearchStep;\n}\n\nexport type StreamEvent = StreamThinkingEvent | StreamStepEvent;\n\nexport interface DiscoveredModel {\n  modelId: string;\n  modelLabel: string;\n  runnerProvider?: string;\n  /**\n   * Human-facing provider name as the runner itself reports it (e.g.\n   * \"OpenCode Zen\" for `runnerProvider: 'opencode'`). Populated from the\n   * runner's own provider catalog when available; when absent the UI derives a\n   * label from `runnerProvider` by title-casing.\n   */\n  runnerProviderLabel?: string;\n  /**\n   * The runner whose catalog listed this model. Stamped once, at the single\n   * `ModelDiscovery.discover` choke point, so a flat cross-runner list can\n   * still say where each entry came from — `runnerProvider` alone cannot:\n   * OpenCode reports most of its catalog as `openrouter`, which names the\n   * serving backend, not the agent Ordewell would spawn.\n   */\n  runnerId?: string;\n  /** The runner's display name (`OpenCode`), from its manifest. */\n  runnerLabel?: string;\n  variants: { id: string; label: string }[];\n  /**\n   * The model's context window when the runner or catalog reports it (#49).\n   * Read by the planner-model lookup so context fill can be shown; absent when\n   * unknown rather than defaulted to zero.\n   */\n  contextWindow?: number;\n}\n\nexport type PlanStatus = 'draft' | 'approved' | 'rejected' | 'running' | 'completed';\n\n/**\n * One entry of the planner's persisted dialogue (ADR-0002). The single source\n * of truth for both UI redisplay and conversational context. Tool-call results\n * are NOT stored here — they live in the AI service's tool-use history;\n * `researchLog` remains the persisted tool trace for the UI.\n */\nexport interface ConversationMessage {\n  role: 'user' | 'assistant';\n  content: string;\n  timestamp: string;\n  /**\n   * Timeline marker: 'plan_generated' records the point in the dialogue where\n   * the plan was committed (the UI anchors the plan card there on restore);\n   * 'system' is a host-injected notice; 'compaction' is the summary a\n   * user-triggered compaction left in place of the earlier messages — always\n   * the transcript's first entry. 'skill_load' is a skill loaded into the\n   * conversation, its snapshot in `skill`; one the user invoked follows the\n   * message that named it. Absent for ordinary chat turns, so sessions saved\n   * before markers existed degrade gracefully.\n   */\n  kind?: 'plan_generated' | 'system' | 'compaction' | 'skill_load';\n  /** Present exactly when `kind` is 'skill_load'. */\n  skill?: SkillLoad;\n}\n\n/**\n * A skill's SKILL.md as it was when loaded into a planner conversation. A\n * snapshot rather than a reference: a resumed, forked or rewound conversation\n * replays the body the planner originally saw, even after the file changed or\n * was deleted.\n */\nexport interface SkillLoad {\n  invokedBy: 'user' | 'planner';\n  name: string;\n  source: SkillSource;\n  /** The SKILL.md that won, home-abbreviated (`~/...`): which copy loaded is what a reader needs from it. */\n  path: string;\n  content: string;\n  /**\n   * Set when the user named a task skill: it is not loaded into the planner's\n   * context, which is only told to attach it to the tasks it fits. `content`\n   * is empty; the description is what the planner's directive quotes.\n   */\n  attaches?: { description: string };\n}\n\n/** A skill load as a surface announces it — the body stays with the transcript. */\nexport type SkillLoadNotice = Omit<SkillLoad, 'content'>;\n\n/** A message the user sent, as opposed to a skill load their message caused. */\nexport function isUserMessage(entry: ConversationMessage): boolean {\n  return entry.role === 'user' && entry.kind !== 'skill_load';\n}\n\nexport interface QueuedMessage {\n  id: string;\n  text: string;\n  timestamp: string;\n  /** What its `/name` tokens loaded when it was sent: the drain composes them with the text, as a live send does. */\n  skills?: SkillLoad[];\n}\n\nexport interface PlanModificationWarnings {\n  deletedCompleted: string[];\n  changedCompleted: string[];\n  deletedInProgress: string[];\n  modifiedInProgress: string[];\n  brokenDependencies: string[];\n}\n\nexport function emptyWarnings(): PlanModificationWarnings {\n  return { deletedCompleted: [], changedCompleted: [], deletedInProgress: [], modifiedInProgress: [], brokenDependencies: [] };\n}\n\nexport interface LegacyPlanState {\n  tasks: Task[];\n  generatedAt: string;\n  status: PlanStatus;\n  runners: RunnerId[];\n  lastUpdated: string;\n  researchLog?: ResearchLogEntry[];\n  /** The planner dialogue — user messages and assistant messages, in order (ADR-0002). */\n  conversationHistory?: ConversationMessage[];\n  /** Full markdown PRD once written by the planner (PRD mode), also saved to .scratch/<slug>/PRD.md. */\n  prdMarkdown?: string;\n  /** Follow-ups queued while tasks execute — applied as plan modifications between batches. */\n  queuedMessages?: QueuedMessage[];\n  /**\n   * The plan's isolation run (ADR-0013), written from the orchestrator at\n   * persist time and read back only when a saved plan is adopted. It names\n   * branches and worktrees that belong to this plan alone: a fork of the plan\n   * must leave it behind rather than share it.\n   */\n  isolation?: PlanIsolation;\n  /** Kept so a reopened session shows the same token line (#49). */\n  plannerUsage?: PlannerUsage;\n}\n\nexport interface Message {\n  id: string;\n  role: 'user' | 'planner' | 'system';\n  content: string;\n  timestamp: number;\n}\n\nexport interface TaskSnapshot extends Task {\n  completedAt: number;\n  verdict?: Verdict;\n  retryCount: number;\n  finalized: boolean;\n}\n\nexport type PlanState =\n  | {\n      phase: 'planning';\n      history: Message[];\n      message: string;\n      pendingTasks: Task[];\n    }\n  | {\n      phase: 'executing';\n      history: Message[];\n      message: string;\n      executionLog: TaskSnapshot[];\n      pendingTasks: Task[];\n      goal: string;\n      runners: string[];\n      status: PlanStatus;\n    };\n\nfunction hasPhase(raw: unknown): raw is PlanState {\n  return typeof raw === 'object' && raw !== null && 'phase' in raw;\n}\n\nfunction hasTasks(raw: unknown): raw is LegacyPlanState {\n  return typeof raw === 'object' && raw !== null && 'tasks' in raw && Array.isArray((raw as Record<string, unknown>).tasks);\n}\n\nfunction logEntryToMessage(entry: ResearchLogEntry): Message {\n  const timestamp = new Date(entry.timestamp).getTime();\n  if (!('type' in entry)) {\n    return { id: entry.id, role: 'system', content: JSON.stringify({ tool: entry.tool, args: entry.args, result: entry.result }), timestamp };\n  }\n  if (entry.type === 'subagent') {\n    const { subagentId, brief, outcome, digest } = entry;\n    return { id: entry.id, role: 'system', content: JSON.stringify({ subagentId, brief, outcome, digest }), timestamp };\n  }\n  return { id: entry.id, role: entry.type === 'user_prompt' ? 'user' : 'system', content: entry.content, timestamp };\n}\n\nfunction migrateHistory(raw: LegacyPlanState): Message[] {\n  const messages: Message[] = [];\n\n  if (raw.researchLog) {\n    messages.push(...raw.researchLog.map(logEntryToMessage));\n  }\n\n  if (raw.queuedMessages) {\n    for (const qm of raw.queuedMessages) {\n      messages.push({\n        id: qm.id,\n        role: 'system',\n        content: qm.text,\n        timestamp: new Date(qm.timestamp).getTime(),\n      });\n    }\n  }\n\n  return messages;\n}\n\nexport function migratePlanState(raw: unknown): PlanState {\n  if (hasPhase(raw)) return raw;\n\n  if (!hasTasks(raw)) {\n    return {\n      phase: 'planning',\n      history: [],\n      message: '',\n      pendingTasks: [],\n    };\n  }\n\n  const hasExecution = raw.tasks.some(\n    (t) => t.status === 'completed' || t.status === 'failed',\n  );\n\n  const messages = migrateHistory(raw);\n\n  if (hasExecution) {\n    const executionLog: TaskSnapshot[] = raw.tasks\n      .filter((t) => t.status === 'completed' || t.status === 'failed')\n      .map((t) => ({\n        ...t,\n        completedAt: new Date(raw.lastUpdated).getTime(),\n        verdict: t.verdict,\n        retryCount: 0,\n        finalized: true,\n      }));\n\n    const pendingTasks = raw.tasks.filter(\n      (t) => t.status !== 'completed' && t.status !== 'failed' && t.status !== 'blocked',\n    );\n\n    return {\n      phase: 'executing',\n      history: messages,\n      message: '',\n      executionLog,\n      pendingTasks,\n      goal: '',\n      runners: raw.runners,\n      status: raw.status,\n    };\n  }\n\n  return {\n    phase: 'planning',\n    history: messages,\n    message: '',\n    pendingTasks: raw.tasks,\n  };\n}\n\nexport function migrateLegacyPlan(legacy: LegacyPlanState): PlanState {\n  const messages: Message[] = [];\n\n  if (legacy.researchLog) {\n    messages.push(...legacy.researchLog.map(logEntryToMessage));\n  }\n\n  if (legacy.queuedMessages) {\n    for (const qm of legacy.queuedMessages) {\n      messages.push({\n        id: qm.id,\n        role: 'system',\n        content: qm.text,\n        timestamp: new Date(qm.timestamp).getTime(),\n      });\n    }\n  }\n\n  const isPlanning = legacy.status === 'draft' || legacy.status === 'approved' || legacy.status === 'rejected';\n\n  if (isPlanning) {\n    return {\n      phase: 'planning',\n      history: messages,\n      message: 'Plan generation',\n      pendingTasks: legacy.tasks.filter((t) => t.status === 'pending' || t.status === ('draft' as never)),\n    };\n  }\n\n  const nonCompletedTasks = legacy.tasks.filter(\n    (t) => t.status !== 'completed' && t.status !== 'failed' && t.status !== 'blocked'\n  );\n\n  const completedSnapshot: TaskSnapshot[] = legacy.tasks\n    .filter((t) => t.status === 'completed' || t.status === 'failed')\n    .map((t) => ({\n      ...t,\n      completedAt: new Date(legacy.lastUpdated).getTime(),\n      verdict: t.verdict,\n      retryCount: 0,\n      finalized: true,\n    }));\n\n  return {\n    phase: 'executing',\n    history: messages,\n    message: 'Plan migration',\n    executionLog: completedSnapshot,\n    pendingTasks: nonCompletedTasks,\n    goal: 'Plan migration',\n    runners: legacy.runners,\n    status: legacy.status,\n  };\n}\n\nexport { taskOrderLabel, taskRef, titledTaskRef, resolveOrderLabel } from '../order-labels';\n\nexport function createTask(overrides: Partial<Task> = {}): Task {\n  const skills = skillNames(overrides.skills);\n  return {\n    id: overrides.id ?? uuidv4(),\n    order: overrides.order ?? 0,\n    title: overrides.title ?? '',\n    description: overrides.description ?? '',\n    type: overrides.type ?? 'ai',\n    status: overrides.status ?? 'pending',\n    dependencies: overrides.dependencies ?? [],\n    prompt: overrides.prompt,\n    userSteps: overrides.userSteps,\n    subtasks: overrides.subtasks ?? [],\n    verdict: overrides.verdict,\n    outputSummary: overrides.outputSummary,\n    assignedModel: overrides.assignedModel,\n    assignedRunner: overrides.assignedRunner ?? 'claude-code',\n    thinkingEffort: overrides.thinkingEffort,\n    taskMode: overrides.taskMode ?? 'build',\n    autonomy: overrides.autonomy,\n    sliceType: overrides.sliceType,\n    userStoriesCovered: overrides.userStoriesCovered,\n    ...(opsFlag(overrides.ops, overrides.type) ? { ops: true } : {}),\n    ...(skills ? { skills } : {}),\n  };\n}\n\n/**\n * A name a skill can have, lower-cased as `/name` is. Anything else — a path\n * separator, `..` — is joined into a path and could only reach outside the\n * skill dirs.\n */\nconst SKILL_NAME = new RegExp(`^${SKILL_NAME_PATTERN}$`);\n\nexport function isSkillName(name: string): boolean {\n  return SKILL_NAME.test(name);\n}\n\n/**\n * The `skills` field as a task stores it, however it arrived: the planner's\n * JSON is untyped. Names are trimmed, lower-cased and deduplicated, and one\n * no skill could have is dropped; none at all is stored absent, so a plan\n * without skills reads exactly as it did before them.\n */\nexport function skillNames(value: unknown): string[] | undefined {\n  if (!Array.isArray(value)) return undefined;\n  const names = [...new Set(value.filter((v): v is string => typeof v === 'string').map((v) => v.trim().toLowerCase()).filter(isSkillName))];\n  return names.length > 0 ? names : undefined;\n}\n\n/**\n * The skills of a task a merge or a split makes from others: what the edit\n * chose when it named any, none when it chose an explicit `[]`, else what the\n * tasks it came from had — a malformed value is not a request to drop them.\n */\nexport function inheritedSkills(chosen: unknown, inherited: readonly string[] | undefined): string[] | undefined {\n  if (Array.isArray(chosen) && chosen.length === 0) return undefined;\n  return skillNames(chosen) ?? skillNames(inherited);\n}\n\n/**\n * The `ops` flag as a task stores it (ADR-0020), however it arrived. Only a\n * literal `true` on an AI task marks an ops task: the planner's JSON is\n * untyped, and a quoted \"true\" read as ops would move a task out of its\n * worktree. Anything else is a change task, stored absent so saved plans need\n * no migration. Whether the task may be ops at all — a subtask may not — is\n * for whoever knows where it sits: parsing drops the flag, an edit refuses it.\n */\nexport function opsFlag(value: unknown, type: Task['type'] = 'ai'): true | undefined {\n  return value === true && type === 'ai' ? true : undefined;\n}\n\n/**\n * The flag of a task a merge or a split makes from others: what the edit\n * chose, else ops only when every task it came from was. A merge that takes\n * in a change edits files, so it is a change; a split part runs where its\n * task did.\n */\nexport function inheritedOps(from: readonly Pick<Task, 'ops'>[], chosen?: boolean): boolean {\n  return chosen ?? from.every((t) => opsFlag(t.ops) === true);\n}\n\n/** The runner set a plan has until one is chosen: the one runner every host ships. */\nexport const DEFAULT_RUNNERS: readonly RunnerId[] = ['claude-code'];\n\nexport function createEmptyPlan(): LegacyPlanState {\n  return {\n    tasks: [],\n    generatedAt: new Date().toISOString(),\n    status: 'draft',\n    runners: [...DEFAULT_RUNNERS],\n    lastUpdated: new Date().toISOString(),\n  };\n}\n\nexport function flattenTasks(tasks: readonly Task[]): Task[] {\n  return tasks.flatMap((t) => [t, ...flattenTasks(t.subtasks ?? [])]);\n}\n\n/** A flattened task with the parent it hangs under, null for a top-level task. */\nexport interface TaskWithParent {\n  task: Task;\n  parent: Task | null;\n}\n\nexport function flattenTasksWithParents(tasks: readonly Task[]): TaskWithParent[] {\n  const rows: TaskWithParent[] = [];\n  const walk = (t: Task, parent: Task | null) => {\n    rows.push({ task: t, parent });\n    for (const sub of t.subtasks ?? []) walk(sub, t);\n  };\n  for (const t of tasks) walk(t, null);\n  return rows;\n}\n\nexport function migrateTask(task: Record<string, unknown>): Task {\n  if (!task.assignedModel) {\n    task.assignedModel = undefined;\n  }\n  if (!task.assignedRunner) {\n    task.assignedRunner = 'claude-code';\n  }\n  if (!task.thinkingEffort) {\n    task.thinkingEffort = undefined;\n  }\n  if (task.verdict && task.verification) {\n    delete task.verification;\n  }\n  if (!task.autonomy) {\n    task.autonomy = undefined;\n  }\n  if (!task.sliceType) {\n    task.sliceType = undefined;\n  }\n  if (!task.userStoriesCovered) {\n    task.userStoriesCovered = undefined;\n  }\n  return task as unknown as Task;\n}\n\nexport function addTaskToPlan(tasks: readonly Task[], partial: Partial<Task>): Task[] {\n  const maxOrder = tasks.reduce((max, t) => Math.max(max, t.order), 0);\n  const newTask = createTask({\n    ...partial,\n    order: partial.order ?? maxOrder + 1,\n    status: 'pending',\n  });\n  return renumberTasks([...tasks, newTask]);\n}\n\nexport function removeTaskFromPlan(tasks: readonly Task[], taskId: string): Task[] {\n  const result = tasks\n    .filter((t) => t.id !== taskId)\n    .map((t) => ({\n      ...t,\n      dependencies: t.dependencies.filter((depId) => depId !== taskId),\n      subtasks: removeTaskFromPlan(t.subtasks, taskId),\n    }));\n  return renumberTasks(result);\n}\n\nexport function updateTaskInPlan(tasks: readonly Task[], taskId: string, changes: Partial<Task>): Task[] {\n  return renumberTasks(\n    tasks.map((t) => {\n      if (t.id === taskId) return { ...t, ...changes, id: t.id };\n      return { ...t, subtasks: updateTaskInPlan(t.subtasks, taskId, changes) };\n    })\n  );\n}\n\nexport function renumberTasks(tasks: readonly Task[]): Task[] {\n  return tasks.map((t, i) => ({\n    ...t,\n    order: i + 1,\n    subtasks: renumberTasks(t.subtasks),\n  }));\n}\n\n/** Done, running, or held for the user: execution state only a runner or the user can change. */\nconst SETTLED_STATUSES: ReadonlySet<TaskStatus> = new Set<TaskStatus>(['completed', 'in_progress', 'awaiting_user']);\n\nfunction holdsSettledWork(task: Task): boolean {\n  return SETTLED_STATUSES.has(task.status) || (task.subtasks ?? []).some(holdsSettledWork);\n}\n\n/**\n * Lay a planner-written task list over the plan it rewrites without letting it\n * change execution state. A planner restates tasks; it never witnessed one run,\n * so the status it writes is not evidence. A settled task is kept exactly as\n * it stands wherever the rewrite names it, and put back beside its old\n * neighbour where the rewrite leaves it out. Every other task keeps the status\n * it had; a task the rewrite adds starts pending.\n */\nexport function keepExecutionState(current: readonly Task[], rewrite: Task[]): Task[] {\n  const existing = new Map(flattenTasks(current).map((t) => [t.id, t]));\n  const named = new Set(flattenTasks(rewrite).map((t) => t.id));\n\n  const overlay = (tasks: Task[], was: readonly Task[]): Task[] => {\n    const result = tasks.map((t): Task => {\n      const prior = existing.get(t.id);\n      if (prior && SETTLED_STATUSES.has(prior.status)) return { ...prior };\n      return {\n        ...t,\n        status: prior?.status ?? 'pending',\n        verdict: prior?.verdict,\n        outputSummary: prior?.outputSummary,\n        runnerSessionId: prior?.runnerSessionId,\n        attemptSkills: prior?.attemptSkills,\n        // Where a task that has run ran is fixed, like its runner session (ADR-0020).\n        ...(prior?.status === 'failed' ? { ops: prior.ops } : {}),\n        forcedPastGate: prior?.forcedPastGate,\n        subtasks: overlay(t.subtasks ?? [], prior?.subtasks ?? []),\n      };\n    });\n    was.forEach((left, i) => {\n      if (named.has(left.id) || !holdsSettledWork(left)) return;\n      const neighbour = was.slice(0, i).reverse().find((t) => result.some((r) => r.id === t.id));\n      const at = neighbour ? result.findIndex((r) => r.id === neighbour.id) + 1 : 0;\n      result.splice(at, 0, { ...left });\n    });\n    return result;\n  };\n\n  return renumberTasks(overlay(rewrite, current));\n}\n\n/** What only execution reads; {@link keepExecutionState} puts it back on whatever a planner returns. */\nconst EXECUTION_ONLY = ['attemptSkills', 'runnerSessionId', 'awaitingReason', 'forcedPastGate', 'outputSummary'] as const satisfies readonly (keyof Task)[];\n\nexport type PlannerTaskView = Omit<Task, typeof EXECUTION_ONLY[number] | 'subtasks'> & { subtasks: PlannerTaskView[] };\n\n/**\n * A task as a planner prompt carries it. An attempt's skill snapshots are\n * whole SKILL.md bodies and an output summary holds a log tail: sent on every\n * planner call, they cost tokens and invite the planner to edit state it does\n * not own.\n */\nexport function plannerTaskView(task: Task): PlannerTaskView {\n  const view: Record<string, unknown> = { ...task, subtasks: (task.subtasks ?? []).map(plannerTaskView) };\n  for (const key of EXECUTION_ONLY) delete view[key];\n  return view as PlannerTaskView;\n}\n\nexport function validateModifiedPlan(original: Task[], modified: Task[]): PlanModificationWarnings {\n  const allOriginal = flattenTasks(original);\n  const allModified = flattenTasks(modified);\n  const warnings = emptyWarnings();\n  const originalMap = new Map(allOriginal.map((t) => [t.id, t]));\n  const modifiedIds = new Set(allModified.map((t) => t.id));\n\n  for (const ot of originalMap.values()) {\n    if (ot.status === 'completed' && !modifiedIds.has(ot.id)) {\n      warnings.deletedCompleted.push(ot.title);\n    } else if (ot.status === 'in_progress' && !modifiedIds.has(ot.id)) {\n      warnings.deletedInProgress.push(ot.title);\n    }\n  }\n\n  for (const mt of allModified) {\n    const orig = originalMap.get(mt.id);\n    if (orig) {\n      if (orig.status === 'completed' && mt.status !== 'completed') {\n        warnings.changedCompleted.push(orig.title);\n      }\n      if (orig.status === 'in_progress' && (mt.status !== 'in_progress' || mt.prompt !== orig.prompt)) {\n        warnings.modifiedInProgress.push(orig.title);\n      }\n      if (orig.status === 'failed' && mt.status === 'pending') {\n        for (const dt of allModified) {\n          if (dt.dependencies.includes(mt.id) && dt.status === 'blocked') {\n            dt.status = 'pending';\n          }\n        }\n      }\n    }\n  }\n\n  for (const t of allModified) {\n    for (const depId of t.dependencies) {\n      if (!modifiedIds.has(depId)) {\n        warnings.brokenDependencies.push(`${t.title} → ${depId}`);\n      }\n    }\n  }\n\n  return warnings;\n}\n\nexport interface ActiveTaskSession {\n  id: string;\n  taskId: string;\n}\n\nexport interface ValidationResult {\n  valid: boolean;\n  errors: string[];\n}\n\nexport interface ValidationContext {\n  executionLog: TaskSnapshot[];\n  oldPending: Task[];\n  newPending: Task[];\n  activeSessions: Map<string, ActiveTaskSession>;\n}\n\nexport type ValidationCheck = (ctx: ValidationContext) => ValidationResult;\n\nexport function warningsText(w: PlanModificationWarnings): string | null {\n  const lines: string[] = [];\n  if (w.deletedCompleted.length) lines.push(`Completed tasks deleted: ${w.deletedCompleted.join(', ')}`);\n  if (w.changedCompleted.length) lines.push(`Completed tasks modified: ${w.changedCompleted.join(', ')}`);\n  if (w.deletedInProgress.length) lines.push(`In-progress tasks deleted: ${w.deletedInProgress.join(', ')}`);\n  if (w.modifiedInProgress.length) lines.push(`In-progress tasks modified: ${w.modifiedInProgress.join(', ')}`);\n  if (w.brokenDependencies.length) lines.push(`Broken dependencies: ${w.brokenDependencies.join(', ')}`);\n  return lines.length > 0 ? lines.join('\\n') : null;\n}\n","/** A name a skill can have, lower-cased: the one pattern for a `/name` token and for a skill folder. */\nexport const SKILL_NAME_PATTERN = '[a-z0-9][a-z0-9_-]*';\n\n/**\n * A `/skill-name` token anywhere in a message: whitespace (or string start)\n * before it, a skill name in any case, optional trailing punctuation that\n * isn't part of the name, then whitespace (or string end). The punctuation\n * group is what lets \"/grilling,\" name \"grilling\".\n */\nconst SKILL_TOKEN = new RegExp(`(^|\\\\s)\\\\/(${SKILL_NAME_PATTERN})([,.!?;:]*)(?=\\\\s|$)`, 'gi');\n\n/** Where a skill name is invoked: `start` is its `/`, `end` is just past the name, before any punctuation. */\nexport interface SkillToken {\n  name: string;\n  start: number;\n  end: number;\n}\n\n/**\n * The first `/name` token for each name in `text`, names lower-cased. Only\n * the first counts because a skill loads once per message however often it is\n * named, so a later repeat is plain text.\n */\nexport function skillTokens(text: string): SkillToken[] {\n  const tokens: SkillToken[] = [];\n  const seen = new Set<string>();\n  for (const match of text.matchAll(SKILL_TOKEN)) {\n    const name = match[2].toLowerCase();\n    if (seen.has(name)) continue;\n    seen.add(name);\n    const start = match.index + match[1].length;\n    tokens.push({ name, start, end: start + 1 + match[2].length });\n  }\n  return tokens;\n}\n\n/** The tokens in a sent message that loaded one of `loaded` — what a surface highlights in the user's bubble. */\nexport function loadedSkillTokens(text: string, loaded: readonly string[]): SkillToken[] {\n  return skillTokens(text).filter((t) => loaded.includes(t.name));\n}\n","import type { Task } from './models/Task';\n\n/**\n * Parent-scoped dotted order label for a task, e.g. \"2.1\" for the first subtask\n * of task 2. Kept in its own module (no Node imports) so a browser-bundled\n * surface — the VS Code webview — can import it via `@ordewell/core/order-labels`\n * without dragging the rest of core in.\n */\nexport function taskOrderLabel(task: { order: number }, parent?: { order: number }): string {\n  return parent ? `${parent.order}.${task.order}` : String(task.order);\n}\n\n/** How a surface refers to a task in prose: \"#2\", or \"#2.1\" for a subtask. */\nexport function taskRef(task: { order: number }, parent?: { order: number }): string {\n  return `#${taskOrderLabel(task, parent)}`;\n}\n\n/** A task named in full, as a confirmation or a picker title does: \"#2 Deploy\". */\nexport function titledTaskRef(task: { order: number; title: string }, parent?: { order: number }): string {\n  return `${taskRef(task, parent)} ${task.title}`;\n}\n\n/** Resolve a dotted label to a task in a plan's top-level task list. */\nexport function resolveOrderLabel(tasks: Task[], label: string): Task | undefined {\n  const parts = label.split('.');\n  if (parts.length > 2 || parts.some((p) => !/^\\d+$/.test(p))) return undefined;\n  const [topOrder, childOrder] = parts.map(Number);\n  const top = tasks.find((t) => t.order === topOrder);\n  if (!top) return undefined;\n  if (childOrder === undefined) return top;\n  return top.subtasks.find((s) => s.order === childOrder);\n}","import type { AwaitingReason } from '../models/Task';\n\n/**\n * What a row's status means to a reader, before any surface picks a word,\n * icon or colour for it. `quiet` is a running task whose runner has printed\n * nothing for a while — the status is still `in_progress`, so only the row,\n * never the store, tells the two apart.\n */\nexport type TaskStatusKind = 'todo' | 'running' | 'quiet' | 'awaiting' | 'blocked' | 'failed' | 'done';\n\n/** A task with a runner live behind it. `in_progress` is the store's own status. */\nexport const isTaskRunning = (task: { status: string }): boolean =>\n  task.status === 'in_progress' || task.status === 'running';\n\n/** Statuses of a task that has not started: what can still be started by hand, or flipped between change and ops (ADR-0020). */\nexport const NOT_STARTED: ReadonlySet<string> = new Set(['pending', 'approved', 'blocked']);\n\nexport function taskStatusKind(task: { status: string; idleSince?: string | null }): TaskStatusKind {\n  switch (task.status) {\n    case 'completed': return 'done';\n    case 'failed': return 'failed';\n    case 'blocked': return 'blocked';\n    case 'awaiting_user': return 'awaiting';\n  }\n  if (!isTaskRunning(task)) return 'todo';\n  return task.status === 'in_progress' && task.idleSince ? 'quiet' : 'running';\n}\n\nconst AWAITING_LABELS: Record<AwaitingReason, string> = {\n  input: 'Waiting for your input',\n  checkpoint: 'Checkpoint',\n  conflict: 'Merge conflict',\n  'files-changed': 'Changed tracked files',\n};\n\n/** What an awaiting_user task waits on (ADR-0018, W1); null when no reason was saved. */\nexport function awaitingLabel(task: { status: string; awaitingReason?: AwaitingReason }): string | null {\n  return task.status === 'awaiting_user' && task.awaitingReason ? AWAITING_LABELS[task.awaitingReason] : null;\n}\n\n/** Runner requests a task waits on (ADR-0018, A1); null when none do. */\nexport function approvalLabel(count: number | undefined): string | null {\n  if (!count) return null;\n  return count > 1 ? `Waiting for approval (${count})` : 'Waiting for approval';\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 { DiffStat, ToolHeadline } from './blocks';\n\n// eslint-disable-next-line no-control-regex\nconst ANSI_OR_CTRL_RE = /\\x1b\\[[0-9;?]*[A-Za-z]|\\x1b\\][^\\x07\\x1b]*(?:\\x07|\\x1b\\\\)?|\\x1b[()][AB012]|\\x1b[=>]|[\\x00-\\x08\\x0b-\\x1f\\x7f]/g;\n\n/**\n * How a command row names an Ordewell research tool. A harness planner's call\n * keeps the agent's own name instead (`toolLabel`, ADR-0009), so the row says\n * which tool actually ran.\n */\nconst DISPLAY_NAMES: Record<string, string> = {\n  read_file: 'Read',\n  read_files: 'Read',\n  list_dir: 'List',\n  glob: 'Glob',\n  grep: 'Grep',\n  find_symbol: 'Symbol',\n  bash: 'Bash',\n  fetch: 'Fetch',\n  web_search: 'WebSearch',\n  spawn_research_agent: 'Agent',\n};\n\n// Tried in order for a tool with no rule of its own: the field that names what\n// a call is about comes before the free text around it.\nconst HINT_FIELDS = ['file_path', 'filePath', 'path', 'url', 'pattern', 'query', 'command', 'description', 'prompt'] as const;\n\nfunction parseArgs(args: string): Record<string, unknown> | null {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    return parsed && typeof parsed === 'object' && !Array.isArray(parsed) ? parsed as Record<string, unknown> : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction oneLine(text: string): string {\n  return text.replace(/\\s+/g, ' ').trim();\n}\n\n// A command's later lines can change what it does (a heredoc body, a chained\n// step), so they are counted rather than folded into the first.\nfunction firstLineOf(command: string): string {\n  const lines = command.trim().split(/\\r?\\n/);\n  const more = lines.length - 1;\n  return more > 0 ? `${lines[0]} … +${more} line${more === 1 ? '' : 's'}` : lines[0];\n}\n\nfunction text(value: unknown): string {\n  return typeof value === 'string' ? value : '';\n}\n\nfunction searchArg(pattern: string, path: string, include = ''): string {\n  return `${pattern}${path ? ` in ${path}` : ''}${include ? ` (${include})` : ''}`;\n}\n\nfunction hintArg(args: Record<string, unknown>): string {\n  for (const field of HINT_FIELDS) {\n    const value = text(args[field]);\n    if (value) return field === 'command' ? firstLineOf(value) : oneLine(value);\n  }\n  const firstText = Object.values(args).find((v): v is string => typeof v === 'string' && v.trim() !== '');\n  return firstText ? oneLine(firstText) : '';\n}\n\nfunction keyArgOf(tool: string, args: Record<string, unknown>): string {\n  switch (tool) {\n    case 'bash':\n      return firstLineOf(text(args.command));\n    case 'read_file':\n    case 'list_dir':\n      return text(args.path);\n    case 'read_files':\n      return Array.isArray(args.paths) ? args.paths.map(String).join(', ') : '';\n    case 'glob':\n      return searchArg(text(args.pattern), text(args.path));\n    case 'grep':\n      return searchArg(text(args.pattern), text(args.path), text(args.include));\n    case 'find_symbol':\n      return `${text(args.symbol)}${text(args.language) ? ` [${text(args.language)}]` : ''}`;\n    case 'fetch':\n      return text(args.url);\n    case 'web_search':\n      return oneLine(text(args.query));\n    case 'spawn_research_agent':\n      return oneLine(text(args.prompt));\n    default:\n      return hintArg(args);\n  }\n}\n\n/**\n * The one-line head of a command row, shared by every surface: the tool's name\n * and the argument that says what the call is about.\n *\n * @param args The call's arguments as announced (JSON). Anything that is not a\n * JSON object is shown as it came, on one line.\n * @param toolLabel A harness planner's own name for the tool (ADR-0009).\n */\nexport function toolHeadline(tool: string, args: string, toolLabel?: string): ToolHeadline {\n  const name = toolLabel?.trim() || DISPLAY_NAMES[tool] || tool;\n  const parsed = parseArgs(args);\n  return { name, keyArg: parsed ? keyArgOf(tool, parsed) : oneLine(args) };\n}\n\nexport interface OutputPreview {\n  lines: string[];\n  hiddenLineCount: number;\n}\n\n/** The lines of a tool's output as a reader sees them — what {@link outputPreview} shows and counts. */\nexport function outputLines(output: string): string[] {\n  // Line endings first: CR is itself a control character the escape pass drops.\n  const lines = output.replace(/\\r\\n?/g, '\\n').replace(ANSI_OR_CTRL_RE, '').split('\\n');\n  while (lines.length > 0 && lines[lines.length - 1].trim() === '') lines.pop();\n  return lines;\n}\n\n/** The head of a tool's output for a collapsed row, and how many lines it leaves out. */\nexport function outputPreview(output: string, maxLines: number): OutputPreview {\n  const lines = outputLines(output);\n  const shown = lines.slice(0, Math.max(0, maxLines));\n  return { lines: shown, hiddenLineCount: lines.length - shown.length };\n}\n\n/**\n * The lines a diff adds and removes, or null when `output` is not one: every\n * line a hunk header, context, an addition or a removal, and at least one of\n * the last two.\n */\nexport function diffStat(output: string): DiffStat | null {\n  const lines = outputLines(output);\n  let added = 0;\n  let removed = 0;\n  for (const line of lines) {\n    if (line.startsWith('+')) added += 1;\n    else if (line.startsWith('-')) removed += 1;\n    else if (!(line.startsWith('@@') || line.startsWith(' ') || line === '' || line.startsWith('\\\\'))) return null;\n  }\n  return added + removed > 0 ? { added, removed } : null;\n}\n\n/** `gap` stands between two hunks, for the lines a diff leaves out. */\nexport type DiffRowKind = 'added' | 'removed' | 'context' | 'gap';\n\nexport interface DiffRow {\n  kind: DiffRowKind;\n  /** The line in the file: the old file's for a removal, the new file's otherwise. */\n  line?: number;\n  text: string;\n}\n\nconst HUNK_RANGE = /^@@ -(\\d+)(?:,\\d+)? \\+(\\d+)(?:,\\d+)? @@/;\n\n/** A diff as the rows a surface draws, numbered as an editor would number them. */\nexport function diffRows(output: string): DiffRow[] {\n  const rows: DiffRow[] = [];\n  let oldLine = 1;\n  let newLine = 1;\n  for (const line of outputLines(output)) {\n    const range = HUNK_RANGE.exec(line);\n    if (range) {\n      if (rows.length > 0) rows.push({ kind: 'gap', text: '' });\n      oldLine = Number(range[1]);\n      newLine = Number(range[2]);\n    } else if (line.startsWith('+')) {\n      rows.push({ kind: 'added', line: newLine++, text: line.slice(1) });\n    } else if (line.startsWith('-')) {\n      rows.push({ kind: 'removed', line: oldLine++, text: line.slice(1) });\n    } else if (!line.startsWith('\\\\')) {\n      rows.push({ kind: 'context', line: newLine, text: line.slice(1) });\n      oldLine += 1;\n      newLine += 1;\n    }\n  }\n  return rows;\n}\n\nfunction lines(count: number): string {\n  return `${count} line${count === 1 ? '' : 's'}`;\n}\n\n/** \"Added 2 lines, removed 1 line\": the summary every surface puts on an edit's row. */\nexport function diffSummary({ added, removed }: DiffStat): string {\n  if (!removed) return `Added ${lines(added)}`;\n  if (!added) return `Removed ${lines(removed)}`;\n  return `Added ${lines(added)}, removed ${lines(removed)}`;\n}\n","import type { ResearchToolType } from '../../models/Task';\n\n/**\n * Map a coding agent's own tool name onto Ordewell's research vocabulary\n * (ADR-0009, T5).\n *\n * A harness planner brings its own toolbox, and most of it overlaps ours: a\n * `Read` is a `read_file`, a `Grep` is a `grep`. Those map onto existing\n * members and render in every surface through the code path that is already\n * there. Everything else — `Edit`, `WebFetch`, `TodoWrite`, `Task`, whatever\n * ships next — becomes `agent_tool` carrying its real name.\n *\n * Nothing is relabelled as a tool it is not. Calling a web fetch a `bash` to\n * avoid adding a union member would put a lie in the timeline, which is the\n * point ADR-0008 spent its effort establishing.\n */\nconst KNOWN_TOOLS: Record<string, ResearchToolType> = {\n  // Claude Code\n  read: 'read_file',\n  grep: 'grep',\n  glob: 'glob',\n  bash: 'bash',\n  ls: 'list_dir',\n  webfetch: 'fetch',\n  websearch: 'web_search',\n  // Codex — its sandboxed command tool is a shell by another name\n  shell: 'bash',\n  exec_command: 'bash',\n  local_shell: 'bash',\n  // OpenCode\n  list: 'list_dir',\n  fetch: 'fetch',\n  // Ordewell's own research shell (ADR-0026), under every runner's name for it\n  runcommand: 'bash',\n};\n\n/**\n * Claude Code and Codex call it `mcp__ordewell__<tool>`, OpenCode `ordewell_<tool>`.\n * Spelled out rather than built from `ORDEWELL_MCP_SERVER_NAME`: the webview\n * bundles this file, and `../mcp` brings the Node-only server with it.\n */\nconst ORDEWELL_TOOL_PREFIX = /^(mcp__ordewell__|ordewell_)/i;\n\n/**\n * The tools that write a file, by their normalized names: Claude Code's,\n * OpenCode's, and the change kinds a Codex row is named for. Their output is\n * a diff (see `fileDiff.ts`) when the runner reported one.\n */\nconst FILE_EDIT_TOOLS = new Set(['edit', 'write', 'multiedit', 'notebookedit', 'applypatch', 'patch', 'add', 'update', 'delete', 'filechange']);\n\nexport function isFileEditTool(name: string): boolean {\n  return FILE_EDIT_TOOLS.has(name.trim().toLowerCase().replace(/[_-]/g, ''));\n}\n\nexport interface MappedTool {\n  tool: ResearchToolType;\n  /** The agent's own name, kept whenever it differs from the member it mapped to. */\n  toolLabel?: string;\n}\n\n/**\n * Classify one agent tool name. Case- and separator-insensitive, because the\n * three agents disagree on `Read` vs `read` vs `read_file` for the same thing.\n */\nexport function mapAgentTool(name: string): MappedTool {\n  const normalized = name.trim().replace(ORDEWELL_TOOL_PREFIX, '').toLowerCase().replace(/[_-]/g, '');\n  const direct = KNOWN_TOOLS[normalized] ?? KNOWN_TOOLS[name.trim().toLowerCase()];\n  if (direct) {\n    // The label survives even on a mapped tool: `Read` and `read_file` render\n    // the same way, but the transcript should still say which one ran.\n    return { tool: direct, toolLabel: name };\n  }\n  return { tool: 'agent_tool', toolLabel: name };\n}\n\n/**\n * Normalize an agent's tool arguments into the shapes `summarizeToolCall`\n * already knows how to read, so a harness `Read` gets a one-line summary\n * instead of a bare tool name. Unknown keys are preserved — the raw args stay\n * visible under the surfaces' output chevron.\n */\nexport function normalizeAgentArgs(tool: ResearchToolType, args: Record<string, unknown>): Record<string, unknown> {\n  const out = { ...args };\n  const alias = (from: string, to: string) => {\n    if (out[to] === undefined && out[from] !== undefined) out[to] = out[from];\n  };\n  if (tool === 'read_file' || tool === 'list_dir') {\n    alias('filePath', 'path');\n    alias('file_path', 'path');\n    alias('target', 'path');\n  }\n  if (tool === 'bash') {\n    alias('cmd', 'command');\n    alias('script', 'command');\n    // Codex hands the command over as an argv array; the summary wants a string.\n    if (typeof out.command !== 'string' && Array.isArray(out.command)) {\n      out.command = (out.command as unknown[]).join(' ');\n    }\n  }\n  if (tool === 'fetch') alias('uri', 'url');\n  if (tool === 'web_search') alias('q', 'query');\n  return out;\n}\n","import type { ResearchStep, ResearchStepOutcome, SkillLoadNotice } from '../models/Task';\nimport type { UsageLine } from '../models/Usage';\nimport type { MessageBlock, MessageRole, PlanMarkerStatus, SkillLoadBlock, SubagentBlock, ToolBlock, ToolStatus, UsageBlock } from './blocks';\nimport { diffStat, outputLines, toolHeadline } from './format';\nimport { isFileEditTool } from '../services/harness/agentTools';\n\n/*\n * How the session's records — messages, research steps, subagents, transcript\n * markers, usage totals — read as blocks. Shared by the live view and the\n * reload, so the two cannot disagree about what a record shows.\n */\n\n/** A line that is done: nothing streams into it any more. */\nexport function settledMessage(id: string, role: MessageRole, text: string, turnId?: string): MessageBlock {\n  return { type: 'message', id, role, text, streaming: false, ...(turnId ? { turnId } : {}) };\n}\n\n/** The user's message, marked with the skills it loaded when it loaded any. */\nexport function userMessage(id: string, text: string, skills: readonly SkillLoadNotice[], turnId?: string): MessageBlock {\n  const block = settledMessage(id, 'user', text, turnId);\n  return skills.length > 0 ? { ...block, skills: skills.map((s) => s.name) } : block;\n}\n\n/** What a surface is told of a load: everything but the body, which only the planner is sent. */\nexport function skillLoadNotice({ invokedBy, name, source, path, attaches }: SkillLoadNotice): SkillLoadNotice {\n  return { invokedBy, name, source, path, ...(attaches ? { attaches } : {}) };\n}\n\n/** `load_skill` as each harness names it: bare, `mcp__ordewell__load_skill`, `ordewell_load_skill`. */\nconst LOAD_SKILL_TOOL = /(?:^|_)load_skill$/;\n\n/**\n * A research step as a surface is sent it. A `load_skill` result is a skill's\n * body, which only the planner is sent; the session keeps it in the skill-load\n * entry, so the step need only say which skill loaded.\n */\nexport function surfaceStep(step: ResearchStep): ResearchStep {\n  if (!step.success || !LOAD_SKILL_TOOL.test(step.toolLabel ?? step.tool)) return step;\n  const name = loadedSkillName(step.args);\n  return { ...step, result: name ? `Loaded skill ${name}.` : 'Loaded a skill.' };\n}\n\nfunction loadedSkillName(args: string): string | undefined {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    const name = typeof parsed === 'object' && parsed !== null && 'name' in parsed ? parsed.name : undefined;\n    return typeof name === 'string' ? name : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\nexport function skillLoadBlock(id: string, { invokedBy, name, source, path, attaches }: SkillLoadNotice, turnId?: string): SkillLoadBlock {\n  return { type: 'skill_load', id, invokedBy, name, source, path, ...(attaches ? { attaches } : {}), ...(turnId ? { turnId } : {}) };\n}\n\ntype SubagentFields = Omit<SubagentBlock, 'type' | 'id' | 'toolCallId' | 'model' | 'usage' | 'turnId'>\n  & { toolCallId?: string; model?: string; usage?: SubagentBlock['usage']; turnId?: string };\n\nexport function subagentBlock(id: string, { toolCallId, model, usage, turnId, ...fields }: SubagentFields): SubagentBlock {\n  return {\n    type: 'subagent', id, ...fields,\n    ...(toolCallId ? { toolCallId } : {}),\n    ...(model ? { model } : {}),\n    ...(usage ? { usage } : {}),\n    ...(turnId ? { turnId } : {}),\n  };\n}\n\nexport function usageBlock(id: string, { totals, bySubagent, contextFill }: UsageLine): UsageBlock {\n  return { type: 'usage', id, totals, ...(bySubagent ? { bySubagent } : {}), ...(contextFill ? { contextFill } : {}) };\n}\n\nconst STATUS_OF_OUTCOME: Record<ResearchStepOutcome, ToolStatus> = {\n  success: 'ok',\n  failure: 'error',\n  refused: 'denied',\n  denied: 'denied',\n  not_executed: 'interrupted',\n};\n\nexport function finishedTool(call: ToolBlock, output: string, outcome: ResearchStepOutcome): ToolBlock {\n  const diff = outcome === 'success' && isFileEditTool(call.toolLabel ?? call.tool) ? diffStat(output) : null;\n  return { ...call, status: STATUS_OF_OUTCOME[outcome], outcome, output, outputLineCount: outputLines(output).length, ...(diff ? { diff } : {}) };\n}\n\nexport function settledTool(call: ToolBlock, step: ResearchStep): ToolBlock {\n  return finishedTool(call, step.result, step.outcome);\n}\n\nexport interface AnnouncedCall {\n  tool: string;\n  toolLabel?: string;\n  args: string;\n  toolCallId?: string;\n  turnId?: string;\n}\n\nexport function pendingTool(id: string, { tool, toolLabel, args, toolCallId, turnId }: AnnouncedCall): ToolBlock {\n  return {\n    type: 'tool', id, tool, headline: toolHeadline(tool, args, toolLabel), args, status: 'pending', output: '', outputLineCount: 0,\n    ...(toolCallId ? { toolCallId } : {}),\n    ...(toolLabel ? { toolLabel } : {}),\n    ...(turnId ? { turnId } : {}),\n  };\n}\n\n/** The row of a call known only from its result — a reload, or a result whose call was never announced. */\nexport function toolFromStep(id: string, step: ResearchStep, turnId?: string): ToolBlock {\n  return settledTool(pendingTool(id, { ...step, turnId }), step);\n}\n\n/**\n * What a plan marker says, read from the transcript entry `PlannerConversation`\n * writes for it (\"Plan generated with 2 tasks.\", \"Plan updated — now 1 task.\").\n * That entry is the only record of the marker a reload has, so the live view\n * reads the same text rather than counting tasks itself.\n */\nexport function planMarker(content: string): { status: Exclude<PlanMarkerStatus, 'building'>; taskCount?: number } {\n  const count = /(\\d+) tasks?\\b/.exec(content);\n  return { status: content.startsWith('Plan updated') ? 'updated' : 'generated', ...(count ? { taskCount: Number(count[1]) } : {}) };\n}\n","import type { AwaitingReason, ConversationMessage, LegacyPlanState, PlanState, QueuedMessage, ResearchStep, RunnerId, SkillLoadNotice, SubagentOutcome, Task, TaskSkillNotice, TaskSnapshot, Verdict } from '../models/Task';\nimport type { UsageTotals } from '../models/Usage';\nimport type { TaskLogEvent } from '../models/TaskLog';\nimport type { ApprovalKind } from '../interfaces/IApproval';\nimport type { ApprovalSource } from './ApprovalPolicy';\nimport type { IsolationHandoff, IsolationMergeResult, TaskIsolation } from '../interfaces/IWorktreeIsolation';\nimport type { QueuedTaskMessage } from '../interfaces/IRunner';\nimport { canContinue } from './continuation';\nimport { skillLoadNotice, surfaceStep } from '../conversation/records';\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  /** What an `awaiting_user` task waits on, when it was saved (ADR-0018, W1). */\n  awaitingReason?: AwaitingReason;\n  /** The whole question of the checkpoint the task waits at; absent when it waits at none. */\n  checkpoint?: string;\n  /** Messages waiting for a structured task's turn to end, oldest first; absent when there are none. */\n  queued?: QueuedTaskMessage[];\n  /** Set when the task can be continued in its saved runner session (ADR-0018, K1); the id itself stays in the daemon. */\n  continuable?: true;\n  /**\n   * How many of a structured task's runner requests wait for an answer\n   * (ADR-0018, A1) — \"waiting for approval\", which leaves `status` alone.\n   * Absent when none do.\n   */\n  awaitingApproval?: number;\n  /**\n   * The dependencies an ops or user task waits on at its merge gate: their\n   * work has landed but is not merged into the user's branch (ADR-0020).\n   * Absent when it waits for no Merge all.\n   */\n  mergeGate?: string[];\n  /** The dependencies, by title, a force start went past the merge gate of (ADR-0020). */\n  forcedPastGate?: string[];\n};\n\n/**\n * A run with tasks at a merge gate (ADR-0020), as a surface offers Merge all\n * mid-run: what has landed and is not merged yet, and whether nothing else is\n * running, so the run waits on the user alone.\n */\nexport interface MergeGateView {\n  paused: boolean;\n  repos: IsolationHandoff['repos'];\n  landed: IsolationHandoff['landed'];\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  /** Set only on an ops task (ADR-0020). */\n  ops?: true;\n  /** Task skills attached by name; absent when none. */\n  skills?: string[];\n};\n\n/** Skill loads go out as notices: their bodies are for the planner, and stay in the session. */\nexport type SerializedConversationMessage = Omit<ConversationMessage, 'skill'> & { skill?: SkillLoadNotice };\nexport type SerializedQueuedMessage = Omit<QueuedMessage, 'skills'> & { skills?: SkillLoadNotice[] };\n\n/**\n * A task as a surface is sent it: its attempt's skills are notices, whole in\n * the session only, and its runner session id stays there too — no surface shows it,\n * and only a continue reads the runner's own session id.\n */\nexport type SurfaceTask<T extends Task = Task> = Omit<T, 'attemptSkills' | 'subtasks' | 'runnerSessionId'> & {\n  attemptSkills?: TaskSkillNotice[];\n  subtasks: SurfaceTask[];\n};\n\n/** A plan as the daemon and the VS Code webview are sent it: the session's own state, minus every skill body. */\nexport type SurfacePlan = Omit<LegacyPlanState, 'tasks' | 'conversationHistory' | 'queuedMessages'> & {\n  tasks: SurfaceTask[];\n  conversationHistory?: SerializedConversationMessage[];\n  queuedMessages?: SerializedQueuedMessage[];\n};\n\n/** The phase-tagged shape of {@link SurfacePlan}. */\nexport type SurfacePlanState =\n  | (Omit<Extract<PlanState, { phase: 'planning' }>, 'pendingTasks'> & { pendingTasks: SurfaceTask[] })\n  | (Omit<Extract<PlanState, { phase: 'executing' }>, 'pendingTasks' | 'executionLog'> & { pendingTasks: SurfaceTask[]; executionLog: SurfaceTask<TaskSnapshot>[] });\n\nexport type SerializedPlan = {\n  tasks: SerializedTask[];\n  runners: RunnerId[];\n  generatedAt: string;\n  conversationHistory?: SerializedConversationMessage[];\n  prdMarkdown?: string;\n  queuedMessages?: SerializedQueuedMessage[];\n};\n\n/** How a planner turn ended: the reply kind it settled on, a user stop, or a failure. */\nexport type PlannerTurnOutcome = 'message' | 'plan' | 'task_ops' | 'stopped' | 'error';\n\n/**\n * Everything a session tells its surfaces, over one broadcast seam.\n *\n * A planner turn (#47) streams between `planner_turn_started` and\n * `planner_turn_ended` with the same `turnId`; every turn-scoped message in\n * between carries it. The stream is provisional and the settled messages are\n * authoritative:\n * - `planner_message` replaces the streamed text of the turn's final segment —\n *   a surface drops what it accumulated and shows the message instead.\n * - A reply that is a JSON envelope (plan, taskOps, taskQuery) never arrives\n *   as `planner_text_delta`; it streams as `plan_token`, the \"building plan\"\n *   display.\n * - A subagent's own text never appears in the reply; its activity arrives\n *   tagged with its `subagentId`.\n */\nexport type SessionMessage =\n  /**\n   * The plan, whole. `turnId` names the planner turn whose commit this\n   * broadcast carries, so the turn's building plan becomes the marker; it is\n   * absent on every other broadcast of the plan.\n   */\n  | { type: 'plan_generated'; plan: SerializedPlan; goal: string; runners: RunnerId[]; turnId?: string }\n  /**\n   * The settled reply of a planner turn, emitted by the session once the turn\n   * is classified. Authoritative over any `planner_text_delta` of its turn's\n   * final segment. `turnId` is absent for replies sent outside a streamed turn.\n   */\n  | { type: 'planner_message'; content: string; timestamp: string; turnId?: string }\n  /**\n   * A planner turn began. Emitted once per turn by whoever runs the turn,\n   * before any other message carrying its `turnId`. `prompt` is the user's\n   * message, as typed, when the turn answers one; `skills` are what its\n   * `/name` tokens loaded, absent when none did.\n   */\n  | { type: 'planner_turn_started'; turnId: string; prompt?: string; skills?: SkillLoadNotice[] }\n  | { type: 'planner_skill_loaded'; turnId: string; skill: SkillLoadNotice }\n  /**\n   * A planner turn is over; nothing more carries its `turnId`. Emitted exactly\n   * once per `planner_turn_started`, stop and failure included, after the\n   * turn's `planner_message` when it has one.\n   */\n  | { type: 'planner_turn_ended'; turnId: string; outcome: PlannerTurnOutcome }\n  /**\n   * Reply prose as it streams, appended in order within its segment. A segment\n   * is one continuous run of model text; text before a tool call is its own\n   * segment, and a later segment never rewrites an earlier one. Never carries\n   * a JSON envelope or a subagent's text (see the union's invariants).\n   */\n  | { type: 'planner_text_delta'; turnId: string; segmentId: string; text: string }\n  /**\n   * Exposed reasoning as it streams, from the planner or — tagged with\n   * `subagentId` — from one of its subagents. Never part of the reply. The one\n   * thinking message for every backend: `segmentId` is set only where the\n   * backend streams thinking in segments (the API loops; harness planners do\n   * not), and `turnId` is absent for thinking outside a turn (one-shot plans).\n   */\n  | { type: 'planner_thinking_delta'; turnId?: string; segmentId?: string; subagentId?: string; text: string }\n  /**\n   * Text streamed for an attempt the turn discarded (a corrective retry) is\n   * taken back: a surface removes it. With `segmentId`, only that segment;\n   * without, all of the turn's text not yet settled by a `planner_message`.\n   * A segment that streamed to the plan display (`plan_token`) takes the\n   * turn's building plan with it.\n   */\n  | { type: 'planner_text_retracted'; turnId: string; segmentId?: string }\n  /**\n   * The planner's running usage for the session, subagents included, emitted\n   * after a model call reports usage. `totals` already contains every\n   * `bySubagent` entry. `contextFill` is the last planner prompt against the\n   * model's window, omitted when the window is unknown. Cost appears only as\n   * reported by a provider or runner (see `UsageRecord`).\n   */\n  | {\n      type: 'planner_usage';\n      turnId?: string;\n      totals: UsageTotals;\n      bySubagent?: Record<string, UsageTotals>;\n      contextFill?: { usedTokens: number; windowTokens: number };\n    }\n  /**\n   * A subagent began work on `brief`. Emitted by the planner backend that\n   * spawned it (ADR-0005 research agents, or a harness planner's own), before\n   * any message tagged with its `subagentId`.\n   */\n  | { type: 'subagent_started'; turnId?: string; subagentId: string; brief: string; model?: string }\n  /**\n   * A subagent is done; nothing more is tagged with its `subagentId`. Emitted\n   * once per `subagent_started`. `digest` is what it handed back to the\n   * planner; `usage` is its own share, already counted in `planner_usage`.\n   */\n  | { type: 'subagent_finished'; turnId?: string; subagentId: string; outcome: SubagentOutcome; digest: string; usage?: UsageTotals }\n  // `gate` is present while a task waits at a merge gate (ADR-0020): what Merge\n  // all would merge now, and whether the run is paused there with nothing else\n  // running.\n  | { type: 'status_update'; tasks: SerializedTaskStatus[]; gate?: MergeGateView }\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: '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  /**\n   * A structured task's log as it happens (ADR-0018, P1): the next events of\n   * the task's attempt `attempt`, in order — the same ones appended to that\n   * attempt's file, so a surface folding these and one replaying the file\n   * draw the same blocks.\n   */\n  | { type: 'task_log'; taskId: string; attempt: number; events: TaskLogEvent[] }\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  // 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; turnId?: string }\n  // The \"building plan\" display only: a JSON envelope as it streams, never\n  // reply prose. `turnId` is absent for a one-shot plan, which has no turn.\n  // `segmentId` names the segment the envelope streams in; a turn's next\n  // envelope is a new segment, and the display starts over with it.\n  | { type: 'plan_token'; token: string; turnId?: string; segmentId?: string }\n  | { type: 'research_step_done'; step: ResearchStep; subagentId?: string; turnId?: 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; turnId?: 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' | 'error'; 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    ...(t.ops ? { ops: true as const } : {}),\n    ...(t.skills?.length ? { skills: [...t.skills] } : {}),\n  };\n}\n\nexport function serializeTaskStatus(\n  t: Task,\n  idleSince: string | null = null,\n  isolation: TaskIsolation | null = null,\n  queued: readonly QueuedTaskMessage[] = [],\n  awaitingApproval = 0,\n  mergeGate: readonly string[] = [],\n  checkpoint = '',\n): 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    ...(t.status === 'awaiting_user' && t.awaitingReason ? { awaitingReason: t.awaitingReason } : {}),\n    ...(t.status === 'awaiting_user' && t.awaitingReason === 'checkpoint' && checkpoint ? { checkpoint } : {}),\n    ...(queued.length > 0 ? { queued: queued.map((m) => ({ ...m })) } : {}),\n    ...(canContinue(t) ? { continuable: true as const } : {}),\n    ...(awaitingApproval > 0 ? { awaitingApproval } : {}),\n    ...(mergeGate.length > 0 ? { mergeGate: [...mergeGate] } : {}),\n    ...(t.forcedPastGate?.length ? { forcedPastGate: [...t.forcedPastGate] } : {}),\n  };\n}\n\nfunction surfaceConversation(history: LegacyPlanState['conversationHistory']): SerializedConversationMessage[] | undefined {\n  return history?.map(({ skill, ...m }) => (skill ? { ...m, skill: skillLoadNotice(skill) } : m));\n}\n\nfunction surfaceQueued(queued: LegacyPlanState['queuedMessages']): SerializedQueuedMessage[] | undefined {\n  return queued?.map(({ skills, ...m }) => (skills ? { ...m, skills: skills.map(skillLoadNotice) } : m));\n}\n\nfunction surfaceTask<T extends Task>({ attemptSkills, subtasks, runnerSessionId: _runnerSessionId, ...task }: T): SurfaceTask<T> {\n  return {\n    ...task,\n    ...(attemptSkills ? { attemptSkills: attemptSkills.map(({ name, source, path }): TaskSkillNotice => ({ name, source, path })) } : {}),\n    subtasks: (subtasks ?? []).map(surfaceTask),\n  };\n}\n\n/** The one place a plan's skill bodies come off before it leaves the session: every wire path that carries plan state goes through here. */\nexport function surfacePlan(plan: LegacyPlanState): SurfacePlan {\n  return {\n    ...plan,\n    tasks: plan.tasks.map(surfaceTask),\n    conversationHistory: surfaceConversation(plan.conversationHistory),\n    queuedMessages: surfaceQueued(plan.queuedMessages),\n    researchLog: plan.researchLog?.map((e) => ('type' in e ? e : surfaceStep(e))),\n  };\n}\n\nexport function surfacePlanState(state: PlanState): SurfacePlanState {\n  return state.phase === 'planning'\n    ? { ...state, pendingTasks: state.pendingTasks.map(surfaceTask) }\n    : { ...state, pendingTasks: state.pendingTasks.map(surfaceTask), executionLog: state.executionLog.map(surfaceTask) };\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: surfaceConversation(plan.conversationHistory),\n    prdMarkdown: plan.prdMarkdown,\n    queuedMessages: surfaceQueued(plan.queuedMessages),\n  };\n}\n\nexport function executionSummary(tasks: readonly 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","/**\n * Pure, no-imports helper so a browser surface can format a conflict's files\n * without pulling `isolationRecord` — and its `path` import — into a webview\n * bundle. Kept out of `isolationRecord.ts` for exactly that reason.\n */\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 one model call consumed, as its provider or runner reported it. Shared\n * by the planner's usage line (#49) and per-attempt task usage (#26): a record\n * says nothing about who asked for the call, so either can hold a list of them.\n *\n * Every measure is optional because backends report different subsets. An\n * absent field means \"not reported\" — never zero — so a total can tell the two\n * apart.\n */\nexport interface UsageRecord {\n  /** The provider or runner id that reported the call — `openai`, `claude-code`, … */\n  source: string;\n  model?: string;\n  inputTokens?: number;\n  outputTokens?: number;\n  /** The share of `inputTokens` served from the provider's prompt cache. */\n  cachedInputTokens?: number;\n  /**\n   * Filled only from a provider's or runner's own report, never from a price\n   * table or an estimate: prices go stale, and a subscription runner has no\n   * per-token price at all. No report means no cost, not a guessed one.\n   */\n  reportedCost?: { amount: number; currency: string };\n  /** The model's context window, when the runner itself reports it. */\n  contextWindow?: number;\n  /** Set when a subagent made the call; its usage still counts toward the total. */\n  subagentId?: string;\n}\n\n/**\n * A running sum of {@link UsageRecord}s. A measure stays absent until some\n * record reports it. Cost is kept per currency: two runners may bill in\n * different ones, and there is no honest exchange rate to fold them together.\n */\nexport interface UsageTotals {\n  inputTokens?: number;\n  outputTokens?: number;\n  cachedInputTokens?: number;\n  reportedCost?: Record<string, number>;\n}\n\n/**\n * The input side of a call whose provider reports its prompt in parts — the\n * uncached tail, with cache reads and cache writes beside it rather than inside\n * it (Anthropic, and OpenCode after it). The prompt the model saw is all three;\n * only the reads were served from cache, since a write is billed as fresh\n * input. A part left unreported adds nothing, and with no part reported there\n * is no measure at all.\n */\nexport function partedPromptUsage(parts: { uncached?: number; cacheRead?: number; cacheWrite?: number }): Pick<UsageRecord, 'inputTokens' | 'cachedInputTokens'> {\n  const reported = [parts.uncached, parts.cacheRead, parts.cacheWrite].filter((n): n is number => n !== undefined);\n  return {\n    ...(reported.length > 0 ? { inputTokens: reported.reduce((a, b) => a + b, 0) } : {}),\n    ...(parts.cacheRead !== undefined ? { cachedInputTokens: parts.cacheRead } : {}),\n  };\n}\n\nconst TOKEN_FIELDS = ['inputTokens', 'outputTokens', 'cachedInputTokens'] as const;\n\nexport function addUsage(totals: UsageTotals, record: UsageRecord): UsageTotals {\n  const next: UsageTotals = { ...totals };\n  for (const field of TOKEN_FIELDS) {\n    const reported = record[field];\n    if (reported !== undefined) next[field] = (totals[field] ?? 0) + reported;\n  }\n  if (record.reportedCost) {\n    const { amount, currency } = record.reportedCost;\n    next.reportedCost = { ...totals.reportedCost, [currency]: (totals.reportedCost?.[currency] ?? 0) + amount };\n  }\n  return next;\n}\n\n/**\n * What the planner has consumed over a session (#49). `totals` includes every\n * `bySubagent` entry. `lastPromptTokens` and `contextWindow` track the\n * planner's own calls only — a subagent runs its own model, whose window says\n * nothing about the planner's.\n */\nexport interface PlannerUsage {\n  totals: UsageTotals;\n  bySubagent?: Record<string, UsageTotals>;\n  lastPromptTokens?: number;\n  contextWindow?: number;\n}\n\nexport function addPlannerUsage(usage: PlannerUsage, record: UsageRecord): PlannerUsage {\n  const next: PlannerUsage = { ...usage, totals: addUsage(usage.totals, record) };\n  if (record.subagentId) {\n    next.bySubagent = { ...usage.bySubagent, [record.subagentId]: addUsage(usage.bySubagent?.[record.subagentId] ?? {}, record) };\n    return next;\n  }\n  if (record.inputTokens !== undefined) next.lastPromptTokens = record.inputTokens;\n  // A reported window of 0 means \"not known\", not \"no room\": keep it out so the\n  // fill is omitted rather than shown against a guessed zero.\n  if (record.contextWindow !== undefined && record.contextWindow > 0) next.contextWindow = record.contextWindow;\n  return next;\n}\n\n/** Whether any measure was reported: a token line of nothing but blanks says nothing. */\nexport function isMeasured(totals: UsageTotals): boolean {\n  return totals.inputTokens !== undefined || totals.outputTokens !== undefined || totals.cachedInputTokens !== undefined\n    || Object.keys(totals.reportedCost ?? {}).length > 0;\n}\n\n/** What the token line shows of a ledger — live from its broadcast, or reloaded from the saved one. */\nexport interface UsageLine {\n  totals: UsageTotals;\n  bySubagent?: Record<string, UsageTotals>;\n  contextFill?: { usedTokens: number; windowTokens: number };\n}\n\nexport function usageLine(usage: PlannerUsage): UsageLine {\n  const contextFill = plannerContextFill(usage);\n  return {\n    totals: usage.totals,\n    ...(usage.bySubagent ? { bySubagent: usage.bySubagent } : {}),\n    ...(contextFill ? { contextFill } : {}),\n  };\n}\n\n/**\n * The last planner prompt against its window, or undefined while either is\n * unknown. `usedTokens` is the prompt total as reported, cached tokens\n * included: a cached token still occupies the window, so subtracting the\n * cached share would understate how full the context is. A window of 0 is\n * treated as unknown — never guessed.\n */\nexport function plannerContextFill(usage: PlannerUsage): { usedTokens: number; windowTokens: number } | undefined {\n  if (usage.lastPromptTokens === undefined || usage.contextWindow === undefined || usage.contextWindow <= 0) return undefined;\n  return { usedTokens: usage.lastPromptTokens, windowTokens: usage.contextWindow };\n}\n","import type { UsageLine } from '../models/Usage';\nimport type { DisplayBlock, SubagentBlock, SubagentChild, SubagentStatus } from './blocks';\nimport { subagentBlock, usageBlock } from './records';\n\n/*\n * The block-list operations both reducers are built from — the planner\n * conversation (`reduce.ts`) and a structured task's log (`taskLog.ts`) — so\n * a subagent, a streaming run of text or the usage line behaves the same in\n * either view.\n */\n\n/** What every view over display blocks holds; each view adds its own state beside it. */\nexport interface BlockList {\n  readonly blocks: readonly DisplayBlock[];\n  readonly nextId: number;\n}\n\n/** The top level of the view (`null`), or the index of the subagent whose children are meant. */\nexport type Lane = number | null;\n\nexport function findLastIndex<T>(items: readonly T[], match: (item: T) => boolean): number {\n  for (let i = items.length - 1; i >= 0; i--) if (match(items[i])) return i;\n  return -1;\n}\n\nexport function replaceAt<T>(items: readonly T[], index: number, item: T): T[] {\n  const next = items.slice();\n  next[index] = item;\n  return next;\n}\n\n// The usage line always sits last, so everything else lands above it.\nfunction insertTop(blocks: readonly DisplayBlock[], block: DisplayBlock): DisplayBlock[] {\n  const last = blocks[blocks.length - 1];\n  return last?.type === 'usage' ? [...blocks.slice(0, -1), block, last] : [...blocks, block];\n}\n\nexport function append<V extends BlockList>(view: V, make: (id: string) => DisplayBlock): V {\n  return { ...view, blocks: insertTop(view.blocks, make(`b${view.nextId}`)), nextId: view.nextId + 1 };\n}\n\nexport function subagentAt(view: BlockList, lane: number): SubagentBlock {\n  const block = view.blocks[lane];\n  if (block.type !== 'subagent') throw new Error(`block ${lane} is not a subagent`);\n  return block;\n}\n\nexport function laneBlocks(view: BlockList, lane: Lane): readonly DisplayBlock[] {\n  return lane === null ? view.blocks : subagentAt(view, lane).children;\n}\n\nfunction setChildren<V extends BlockList>(view: V, lane: number, children: readonly SubagentChild[]): V {\n  return { ...view, blocks: replaceAt(view.blocks, lane, { ...subagentAt(view, lane), children }) };\n}\n\nexport function laneReplace<V extends BlockList>(view: V, lane: Lane, index: number, block: SubagentChild): V {\n  if (lane === null) return { ...view, blocks: replaceAt(view.blocks, index, block) };\n  return setChildren(view, lane, replaceAt(subagentAt(view, lane).children, index, block));\n}\n\nexport function laneAppend<V extends BlockList>(view: V, lane: Lane, make: (id: string) => SubagentChild): V {\n  if (lane === null) return append(view, make);\n  const children = [...subagentAt(view, lane).children, make(`b${view.nextId}`)];\n  return { ...setChildren(view, lane, children), nextId: view.nextId + 1 };\n}\n\nfunction isStreaming(block: DisplayBlock): boolean {\n  return (block.type === 'message' || block.type === 'thinking') && block.streaming;\n}\n\nexport function sealed<B extends DisplayBlock>(block: B): B {\n  return isStreaming(block) ? { ...block, streaming: false } : block;\n}\n\n/**\n * Output landed at `keep` in the lane, so nothing else there is still\n * streaming: one lane has one voice at a time, and a block left marked as\n * streaming would keep its cursor after its text had moved on.\n */\nexport function sealLane<V extends BlockList>(view: V, lane: Lane, keep: number): V {\n  const blocks = laneBlocks(view, lane);\n  if (!blocks.some((b, i) => i !== keep && isStreaming(b))) return view;\n  if (lane === null) return { ...view, blocks: view.blocks.map((b, i) => (i === keep ? b : sealed(b))) };\n  return setChildren(view, lane, subagentAt(view, lane).children.map((b, i) => (i === keep ? b : sealed(b))));\n}\n\n/** Append output to the lane, which then speaks through it alone. */\nexport function appendOutput<V extends BlockList>(view: V, lane: Lane, make: (id: string) => SubagentChild): V {\n  const next = laneAppend(view, lane, make);\n  return sealLane(next, lane, findLastIndex(laneBlocks(next, lane), (b) => b.type !== 'usage'));\n}\n\n/**\n * The subagent's block, created on first sighting: its activity can arrive\n * before (or without) its start. The call that spawns it becomes the block,\n * keeping the call's id and position — the call and the subagent are one\n * thing on screen.\n */\nexport function subagentLane<V extends BlockList>(view: V, subagentId: string, turnId?: string): [V, number] {\n  const existing = findLastIndex(view.blocks, (b) => b.type === 'subagent' && b.subagentId === subagentId);\n  if (existing >= 0) return [view, existing];\n  const spawn = findLastIndex(view.blocks, (b) => b.type === 'tool' && (b.spawns === subagentId || b.toolCallId === subagentId));\n  const call = view.blocks[spawn];\n  if (call?.type === 'tool') {\n    const block = subagentBlock(call.id, {\n      subagentId, brief: call.headline.keyArg, status: 'running', children: [], digest: '', toolCallId: call.toolCallId, turnId: call.turnId,\n    });\n    return [{ ...view, blocks: replaceAt(view.blocks, spawn, block) }, spawn];\n  }\n  const next = append(view, (id) => subagentBlock(id, { subagentId, brief: '', status: 'running', children: [], digest: '', turnId }));\n  return [next, findLastIndex(next.blocks, (b) => b.type === 'subagent' && b.subagentId === subagentId)];\n}\n\nexport function updateSubagent<V extends BlockList>(view: V, subagentId: string, turnId: string | undefined, update: (block: SubagentBlock) => SubagentBlock): V {\n  const [next, lane] = subagentLane(view, subagentId, turnId);\n  return { ...next, blocks: replaceAt(next.blocks, lane, update(subagentAt(next, lane))) };\n}\n\n/** The lane a subagent's activity lands in: its own block's children, or the top level. */\nexport function laneOf<V extends BlockList>(view: V, subagentId: string | undefined, turnId?: string): [V, Lane] {\n  return subagentId ? subagentLane(view, subagentId, turnId) : [view, null];\n}\n\nexport function think<V extends BlockList>(view: V, text: string, turnId?: string, segmentId?: string, subagentId?: string): V {\n  const [placed, lane] = laneOf(view, subagentId, turnId);\n  const blocks = laneBlocks(placed, lane);\n  const lastIndex = findLastIndex(blocks, (b) => b.type !== 'usage');\n  const last = blocks[lastIndex];\n  if (last?.type === 'thinking' && last.streaming && last.segmentId === segmentId) {\n    return laneReplace(placed, lane, lastIndex, { ...last, text: last.text + text });\n  }\n  return appendOutput(placed, lane, (id) => ({\n    type: 'thinking', id, text, streaming: true,\n    ...(turnId ? { turnId } : {}),\n    ...(segmentId ? { segmentId } : {}),\n    ...(subagentId ? { subagentId } : {}),\n  }));\n}\n\n/** The one usage line, replaced in place or added as the last block. */\nexport function setUsageLine<V extends BlockList>(view: V, line: UsageLine): V {\n  const last = view.blocks[view.blocks.length - 1];\n  const block = usageBlock(last?.type === 'usage' ? last.id : `b${view.nextId}`, line);\n  if (last?.type === 'usage') return { ...view, blocks: replaceAt(view.blocks, view.blocks.length - 1, block) };\n  return { ...view, blocks: [...view.blocks, block], nextId: view.nextId + 1 };\n}\n\nfunction closeBlock<B extends DisplayBlock>(block: B, interrupted: boolean): B {\n  return interrupted && block.type === 'tool' && block.status === 'pending' ? { ...block, status: 'interrupted' } : sealed(block);\n}\n\nfunction closeSubagent(block: SubagentBlock, cut: SubagentStatus | null): SubagentBlock {\n  const children = block.children.map((c) => closeBlock(c, cut !== null));\n  const status = cut && block.status === 'running' ? cut : block.status;\n  return status === block.status && children.every((c, i) => c === block.children[i]) ? block : { ...block, status, children };\n}\n\n/**\n * A turn is over, so whatever it left open is closed: streaming stops, and\n * when the turn was cut short (`cut`), its unanswered calls and running\n * subagents say so.\n */\nexport function closeOpenBlocks<V extends BlockList>(view: V, cut: SubagentStatus | null): V {\n  const blocks = view.blocks.map((b) => (b.type === 'subagent' ? closeSubagent(b, cut) : closeBlock(b, cut !== null)));\n  return blocks.every((b, i) => b === view.blocks[i]) ? view : { ...view, blocks };\n}\n","import type { ResearchStep } from '../models/Task';\nimport type { SessionMessage } from '../services/SessionMessage';\nimport { isMeasured } from '../models/Usage';\nimport type { DisplayBlock, MessageBlock, PlanBlock, ToolBlock } from './blocks';\nimport { pendingTool, planMarker, settledMessage, settledTool, skillLoadBlock, toolFromStep, userMessage } from './records';\nimport {\n  append, appendOutput, closeOpenBlocks, findLastIndex, laneBlocks, laneOf, laneAppend, laneReplace, replaceAt, sealLane, sealed, setUsageLine,\n  think, updateSubagent, type BlockList,\n} from './lanes';\n\n/**\n * A line a surface adds to the conversation itself rather than receiving from\n * the session: the user's prompt as it is sent, a notice, an error.\n */\nexport interface LocalEntry {\n  type: 'local_entry';\n  role: 'user' | 'system' | 'error';\n  text: string;\n}\n\nexport type ConversationInput = SessionMessage | LocalEntry;\n\nexport interface ConversationView extends BlockList {\n  /**\n   * The newest transcript entry the view accounts for. Plan markers and system\n   * notes reach a surface only inside the transcript a `plan_generated`\n   * carries, so entries after this one are what is new in it.\n   */\n  readonly transcriptAt?: string;\n}\n\nexport const EMPTY_CONVERSATION: ConversationView = { blocks: [], nextId: 1 };\n\ntype Message<T extends SessionMessage['type']> = Extract<SessionMessage, { type: T }>;\n\nfunction isUnsettledSegment(block: DisplayBlock, turnId: string): block is MessageBlock {\n  return block.type === 'message' && block.turnId === turnId && block.segmentId !== undefined;\n}\n\nfunction isBuildingPlan(block: DisplayBlock, turnId: string | undefined): block is PlanBlock {\n  return block.type === 'plan' && block.status === 'building' && block.turnId === turnId;\n}\n\n/**\n * Where the turn's final segment is, if its text streamed: the turn's latest\n * block, when that is streamed text. Anything the turn did after a segment —\n * a tool call, a plan envelope — means a later segment follows it, and a later\n * segment never rewrites an earlier one. `pastPlan` looks past the turn's plan\n * block, for a plan that settled after its own text.\n */\nfunction finalSegmentIndex(blocks: readonly DisplayBlock[], turnId: string, pastPlan = false): number {\n  for (let i = blocks.length - 1; i >= 0; i--) {\n    const block = blocks[i];\n    if (block.type === 'usage' || block.type === 'thinking' || block.type === 'approval' || (pastPlan && block.type === 'plan')) continue;\n    if (block.turnId !== turnId) continue;\n    return isUnsettledSegment(block, turnId) ? i : -1;\n  }\n  return -1;\n}\n\nfunction openTurn(view: ConversationView, { turnId, prompt = '', skills = [] }: Message<'planner_turn_started'>): ConversationView {\n  // A surface shows its user's prompt the moment it is sent; the turn that\n  // answers it adopts that line rather than repeating it.\n  const i = findLastIndex(view.blocks, (b) => b.type === 'message' && b.role === 'user');\n  const sent = view.blocks[i];\n  const adopted = sent?.type === 'message' && sent.turnId === undefined && sent.text === prompt;\n  const said: ConversationView = adopted\n    ? { ...view, blocks: replaceAt(view.blocks, i, userMessage(sent.id, prompt, skills, turnId)) }\n    : append(view, (id) => userMessage(id, prompt, skills, turnId));\n  if (skills.length === 0) return said;\n  // Directly under the message that loaded them, wherever that line sits.\n  const at = adopted ? i + 1 : findLastIndex(said.blocks, (b) => b.type === 'message' && b.role === 'user') + 1;\n  const loads = skills.map((skill, n) => skillLoadBlock(`b${said.nextId + n}`, skill, turnId));\n  return { ...said, blocks: [...said.blocks.slice(0, at), ...loads, ...said.blocks.slice(at)], nextId: said.nextId + loads.length };\n}\n\nfunction streamText(view: ConversationView, { turnId, segmentId, text }: Message<'planner_text_delta'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => isUnsettledSegment(b, turnId) && b.segmentId === segmentId);\n  const segment = view.blocks[i];\n  if (segment?.type === 'message') {\n    return sealLane(laneReplace(view, null, i, { ...segment, text: segment.text + text, streaming: true }), null, i);\n  }\n  return appendOutput(view, null, (id) => ({ type: 'message', id, role: 'planner', text, streaming: true, turnId, segmentId }));\n}\n\n/**\n * Drop the turn's plan display while it is still building: whatever streamed\n * there did not become a plan — a task-ops or task-query envelope, or, from a\n * daemon older than turns, the reply's prose.\n */\nfunction dropBuildingPlan(view: ConversationView, turnId: string | undefined, segmentId?: string): ConversationView {\n  const blocks = view.blocks.filter((b) => !(isBuildingPlan(b, turnId) && (segmentId === undefined || b.segmentId === segmentId)));\n  return blocks.length === view.blocks.length ? view : { ...view, blocks };\n}\n\nfunction settleReply(view: ConversationView, { content, turnId }: Message<'planner_message'>): ConversationView {\n  if (turnId !== undefined) {\n    const i = finalSegmentIndex(view.blocks, turnId);\n    if (i >= 0) {\n      return dropBuildingPlan({ ...view, blocks: replaceAt(view.blocks, i, settledMessage(view.blocks[i].id, 'planner', content, turnId)) }, turnId);\n    }\n  }\n  return append(dropBuildingPlan(view, turnId), (id) => settledMessage(id, 'planner', content, turnId));\n}\n\n// A retracted envelope takes the turn's plan display with it, or its retry\n// would build on the botched JSON and the partial-plan rows read both.\nfunction retractText(view: ConversationView, { turnId, segmentId }: Message<'planner_text_retracted'>): ConversationView {\n  const blocks = view.blocks.filter((b) => !(isUnsettledSegment(b, turnId) && (segmentId === undefined || b.segmentId === segmentId)));\n  return dropBuildingPlan(blocks.length === view.blocks.length ? view : { ...view, blocks }, turnId, segmentId);\n}\n\nfunction startSubagent(view: ConversationView, { subagentId, brief, model, turnId }: Message<'subagent_started'>): ConversationView {\n  return updateSubagent(view, subagentId, turnId, (block) => ({ ...block, ...(brief ? { brief } : {}), ...(model ? { model } : {}) }));\n}\n\nfunction finishSubagent(view: ConversationView, { subagentId, outcome, digest, usage, turnId }: Message<'subagent_finished'>): ConversationView {\n  return updateSubagent(view, subagentId, turnId, (block) => ({\n    ...block, status: outcome, digest, children: block.children.map(sealed), ...(usage ? { usage } : {}),\n  }));\n}\n\nfunction announceTool(view: ConversationView, call: Message<'research_step'>): ConversationView {\n  // A spawn call names the subagent it starts; any other call tagged with a\n  // subagent is that subagent's own.\n  const spawns = call.tool === 'spawn_research_agent' ? call.subagentId : undefined;\n  const [placed, lane] = laneOf(view, spawns ? undefined : call.subagentId, call.turnId);\n  return appendOutput(placed, lane, (id) => ({ ...pendingTool(id, call), ...(spawns ? { spawns } : {}) }));\n}\n\n// By the call's id: results of a parallel round return in any order, and a\n// name match would put one call's output on another's row (ADR-0008). The\n// name scan survives only for calls that announced no id.\nfunction isPendingCallOf(block: DisplayBlock, step: ResearchStep): block is ToolBlock {\n  if (block.type !== 'tool' || block.status !== 'pending') return false;\n  return step.toolCallId ? block.toolCallId === step.toolCallId : block.toolCallId === undefined && block.tool === step.tool;\n}\n\nfunction settleTool(view: ConversationView, { step, turnId }: Message<'research_step_done'>): ConversationView {\n  const [placed, lane] = laneOf(view, step.subagentId, turnId);\n  const blocks = laneBlocks(placed, lane);\n  const i = findLastIndex(blocks, (b) => isPendingCallOf(b, step));\n  const pending = blocks[i];\n  if (pending?.type === 'tool') return laneReplace(placed, lane, i, settledTool(pending, step));\n  // The call that spawned a subagent is shown by the subagent's block, and\n  // only the subagent's own finish settles it: a backgrounded agent's call\n  // returns at launch, long before the work ends.\n  if (lane === null && step.toolCallId && blocks.some((b) => b.type === 'subagent' && b.toolCallId === step.toolCallId)) return view;\n  return laneAppend(placed, lane, (id) => toolFromStep(id, step, turnId));\n}\n\n/**\n * The building display shows one envelope: the segment streaming now. A turn's\n * later envelope (a plan after a read it asked for) starts it over, below\n * whatever the turn did in between, rather than running on from the last one.\n */\nfunction streamPlan(view: ConversationView, { token, turnId, segmentId }: Message<'plan_token'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => isBuildingPlan(b, turnId));\n  const building = view.blocks[i];\n  if (building?.type === 'plan' && building.segmentId === segmentId) {\n    return { ...view, blocks: replaceAt(view.blocks, i, { ...building, text: building.text + token }) };\n  }\n  return append(dropBuildingPlan(view, turnId), (id) => ({\n    type: 'plan', id, status: 'building', text: token, ...(turnId ? { turnId } : {}), ...(segmentId ? { segmentId } : {}),\n  }));\n}\n\n/** A plan landed: the building display of the turn that committed it becomes its marker. */\nfunction markPlan(view: ConversationView, content: string, turnId: string | undefined): ConversationView {\n  const marker = planMarker(content);\n  const i = findLastIndex(view.blocks, (b) => isBuildingPlan(b, turnId));\n  const building = view.blocks[i];\n  if (building?.type === 'plan') {\n    const settled: PlanBlock = { type: 'plan', id: building.id, ...marker, text: '', ...(building.turnId ? { turnId: building.turnId } : {}) };\n    return { ...view, blocks: replaceAt(view.blocks, i, settled) };\n  }\n  return append(view, (id) => ({ type: 'plan', id, text: '', ...marker }));\n}\n\nfunction requestApproval(view: ConversationView, { id: approvalId, kind, subject, scope, detail, turnId }: Message<'approval_request'>): ConversationView {\n  return append(view, (id) => ({\n    type: 'approval', id, approvalId, kind, subject, scope, status: 'pending',\n    ...(detail ? { detail } : {}),\n    ...(turnId ? { turnId } : {}),\n  }));\n}\n\nfunction settleApproval(view: ConversationView, { id, granted }: Message<'approval_settled'>): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'approval' && b.approvalId === id);\n  const request = view.blocks[i];\n  if (request?.type !== 'approval') return view;\n  return { ...view, blocks: replaceAt(view.blocks, i, { ...request, status: granted ? 'granted' : 'denied', decidedBy: 'asked' }) };\n}\n\nfunction decideApproval(view: ConversationView, { kind, subject, scope, detail, granted, source }: Message<'approval_decided'>): ConversationView {\n  return append(view, (id) => ({\n    type: 'approval', id, kind, subject, scope, status: granted ? 'granted' : 'denied', decidedBy: source,\n    ...(detail ? { detail } : {}),\n  }));\n}\n\nfunction reportUsage(view: ConversationView, message: Message<'planner_usage'>): ConversationView {\n  return isMeasured(message.totals) ? setUsageLine(view, message) : view;\n}\n\n/**\n * Nothing carries the turn's id after this, so whatever it left open is closed:\n * streaming stops, and on a stop or failure its unanswered calls and running\n * subagents say they were cut short. A plan reply that streamed as text (a\n * prose preamble decides a segment's route) gives way to its plan block, as a\n * settled message would have replaced it.\n */\nfunction endTurn(view: ConversationView, { turnId, outcome }: Message<'planner_turn_ended'>): ConversationView {\n  let next = dropBuildingPlan(view, turnId);\n  const planText = outcome === 'plan' ? finalSegmentIndex(next.blocks, turnId, true) : -1;\n  if (planText >= 0) next = { ...next, blocks: next.blocks.filter((_, i) => i !== planText) };\n  return closeOpenBlocks(next, outcome === 'stopped' ? 'stopped' : outcome === 'error' ? 'failed' : null);\n}\n\n// The summary is announced as a planner message before the transcript it now\n// heads arrives; the transcript records it as a notice, and so does the view.\nfunction markCompaction(view: ConversationView, summary: string): ConversationView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'message' && b.role === 'planner' && b.turnId === undefined && b.text === summary);\n  const announced = view.blocks[i];\n  if (announced?.type === 'message') return { ...view, blocks: replaceAt(view.blocks, i, { ...announced, role: 'system' }) };\n  return append(view, (id) => settledMessage(id, 'system', summary));\n}\n\nfunction syncTranscript(view: ConversationView, { plan, turnId }: Message<'plan_generated'>): ConversationView {\n  const history = plan.conversationHistory ?? [];\n  // Only the newest marker can be the committing turn's; older ones a surface\n  // is only now catching up on belong to turns long over.\n  const committed = findLastIndex(history, (e) => e.kind === 'plan_generated');\n  let next = view;\n  let latest = view.transcriptAt;\n  for (const [i, entry] of history.entries()) {\n    const isNew = view.transcriptAt === undefined || entry.timestamp > view.transcriptAt;\n    if (isNew && entry.kind === 'plan_generated') next = markPlan(next, entry.content, i === committed ? turnId : undefined);\n    if (isNew && entry.kind === 'system') next = append(next, (id) => settledMessage(id, 'system', entry.content));\n    if (isNew && entry.kind === 'compaction') next = markCompaction(next, entry.content);\n    if (latest === undefined || entry.timestamp > latest) latest = entry.timestamp;\n  }\n  return next === view && latest === view.transcriptAt ? view : { ...next, transcriptAt: latest };\n}\n\n/**\n * Fold one input into the view. Pure and incremental: blocks the input does\n * not touch keep their identity, and an input that changes nothing returns\n * `view` itself — surfaces memoize their drawing on that, and text deltas\n * arrive quickly.\n */\nexport function reduceConversation(view: ConversationView, input: ConversationInput): ConversationView {\n  switch (input.type) {\n    case 'local_entry':\n      return append(view, (id) => settledMessage(id, input.role, input.text));\n    case 'planner_turn_started':\n      return input.prompt === undefined ? view : openTurn(view, input);\n    case 'planner_skill_loaded':\n      return append(sealLane(view, null, -1), (id) => skillLoadBlock(id, input.skill, input.turnId));\n    case 'planner_text_delta':\n      return streamText(view, input);\n    case 'planner_message':\n      return settleReply(view, input);\n    case 'planner_text_retracted':\n      return retractText(view, input);\n    case 'planner_thinking_delta':\n      return think(view, input.text, input.turnId, input.segmentId, input.subagentId);\n    case 'research_step':\n      return announceTool(view, input);\n    case 'research_step_done':\n      return settleTool(view, input);\n    case 'subagent_started':\n      return startSubagent(view, input);\n    case 'subagent_finished':\n      return finishSubagent(view, input);\n    case 'plan_token':\n      return streamPlan(view, input);\n    case 'plan_generated':\n      return syncTranscript(view, input);\n    case 'planner_turn_ended':\n      return endTurn(view, input);\n    case 'approval_request':\n      return requestApproval(view, input);\n    case 'approval_settled':\n      return settleApproval(view, input);\n    case 'approval_decided':\n      return decideApproval(view, input);\n    case 'planner_usage':\n      return reportUsage(view, input);\n    default:\n      return view;\n  }\n}\n","import type { ResearchLogEntry, ResearchStep, SkillLoadNotice, SubagentLogEntry } from '../models/Task';\nimport type { SerializedConversationMessage } from '../services/SessionMessage';\nimport { isMeasured, usageLine, type PlannerUsage } from '../models/Usage';\nimport type { DisplayBlock } from './blocks';\nimport { planMarker, settledMessage, skillLoadBlock, skillLoadNotice, subagentBlock, toolFromStep, usageBlock, userMessage } from './records';\nimport type { ConversationView } from './reduce';\n\n/** One top-level block before it has an id, and where it falls in time. */\ninterface Placed {\n  at: string;\n  /** Breaks a tie in `at`: a user's message, then the research it caused, then what the turn settled on. */\n  rank: number;\n  build: (nextId: () => string) => DisplayBlock;\n}\n\nconst USER = 0;\nconst RESEARCH = 1;\nconst SETTLED = 2;\n\n/** `loaded`: the skills the entries after a user's message say it loaded. */\nfunction fromEntry(entry: SerializedConversationMessage, loaded: readonly SkillLoadNotice[] = []): Placed['build'] {\n  if (entry.kind === 'plan_generated') return (id) => ({ type: 'plan', id: id(), text: '', ...planMarker(entry.content) });\n  if (entry.kind === 'skill_load' && entry.skill) {\n    const { skill } = entry;\n    return (id) => skillLoadBlock(id(), skillLoadNotice(skill));\n  }\n  if (entry.role === 'user' && !entry.kind) return (id) => userMessage(id(), entry.content, loaded.map(skillLoadNotice));\n  const role = entry.kind === 'system' || entry.kind === 'compaction' ? 'system' : entry.role === 'user' ? 'user' : 'planner';\n  return (id) => settledMessage(id(), role, entry.content);\n}\n\nfunction loadsAfter(entries: readonly SerializedConversationMessage[], index: number): SkillLoadNotice[] {\n  const loads: SkillLoadNotice[] = [];\n  for (let i = index + 1; i < entries.length && entries[i].kind === 'skill_load'; i++) {\n    const { skill } = entries[i];\n    if (skill?.invokedBy === 'user') loads.push(skill);\n  }\n  return loads;\n}\n\n// A skill load ranks with the message that caused it: same time, same rank,\n// and the stable sort keeps it right under the message.\nfunction rankOf(entry: SerializedConversationMessage): number {\n  return entry.role === 'user' && (!entry.kind || entry.kind === 'skill_load') ? USER : SETTLED;\n}\n\nfunction spawnBrief(step: ResearchStep): string | undefined {\n  try {\n    const args: unknown = JSON.parse(step.args);\n    const prompt = args && typeof args === 'object' ? (args as Record<string, unknown>).prompt : undefined;\n    return typeof prompt === 'string' ? prompt.trim() : undefined;\n  } catch {\n    return undefined;\n  }\n}\n\n/**\n * Which subagent a planner step started, if it did. The log keeps no link: a\n * harness planner's subagent takes its call's id, and an ADR-0005 research\n * agent is briefed with its spawn call's prompt, trimmed.\n */\nfunction spawnedBy(step: ResearchStep, unclaimed: SubagentLogEntry[]): SubagentLogEntry | undefined {\n  const byId = unclaimed.find((e) => e.subagentId === step.toolCallId);\n  if (byId) return byId;\n  if (step.tool !== 'spawn_research_agent') return undefined;\n  const brief = spawnBrief(step);\n  return brief === undefined ? undefined : unclaimed.find((e) => e.brief === brief);\n}\n\nfunction research(log: readonly ResearchLogEntry[]): Placed[] {\n  const subagents = log.filter((e): e is SubagentLogEntry => 'type' in e && e.type === 'subagent');\n  const ownSubagent = new Set(subagents.map((e) => e.subagentId));\n  const unclaimed = [...subagents];\n  const spawnCall = new Map<string, string | undefined>();\n  const placed: Placed[] = [];\n\n  for (const entry of log) {\n    if ('type' in entry) {\n      if (entry.type === 'system') placed.push({ at: entry.timestamp, rank: RESEARCH, build: (id) => settledMessage(id(), 'system', entry.content) });\n      continue;\n    }\n    if (entry.subagentId && ownSubagent.has(entry.subagentId)) continue;\n    const spawned = spawnedBy(entry, unclaimed);\n    if (spawned) {\n      unclaimed.splice(unclaimed.indexOf(spawned), 1);\n      spawnCall.set(spawned.subagentId, entry.toolCallId);\n      continue;\n    }\n    placed.push({ at: entry.timestamp, rank: RESEARCH, build: (id) => toolFromStep(id(), entry) });\n  }\n\n  // A subagent stands where it started, which is where its spawn call was\n  // announced; the call's own record is written only once the subagent is done.\n  for (const entry of subagents) {\n    const toolCallId = spawnCall.get(entry.subagentId);\n    const steps = log.filter((e): e is ResearchStep => !('type' in e) && e.subagentId === entry.subagentId);\n    placed.push({\n      at: entry.timestamp,\n      rank: RESEARCH,\n      build: (id) => subagentBlock(id(), {\n        subagentId: entry.subagentId, brief: entry.brief, status: entry.outcome, digest: entry.digest,\n        children: steps.map((step) => toolFromStep(id(), step)),\n        toolCallId, model: entry.model, usage: entry.usage,\n      }),\n    });\n  }\n  return placed;\n}\n\n/**\n * The view a saved session reopens with: what its transcript and research log\n * kept, in the order it happened — messages, notices and the compaction\n * summary, plan markers, tool calls with each subagent's calls nested under\n * it, and the token line. Reasoning and streamed text were never saved, so a\n * reload has none.\n *\n * The research log interleaves with the transcript by time. Entries older than\n * a compaction's first kept message went with the turns it condensed.\n */\nexport function fromTranscript(\n  conversationHistory: readonly SerializedConversationMessage[] | undefined,\n  researchLog: readonly ResearchLogEntry[] | undefined,\n  plannerUsage?: PlannerUsage,\n): ConversationView {\n  const history = conversationHistory ?? [];\n  const compacted = history[0]?.kind === 'compaction' ? history[0] : undefined;\n  const kept = compacted ? history.slice(1) : history;\n  const cutoff = compacted ? (kept[0]?.timestamp ?? compacted.timestamp) : '';\n\n  const placed: Placed[] = [\n    ...kept.map((entry, i) => ({ at: entry.timestamp, rank: rankOf(entry), build: fromEntry(entry, loadsAfter(kept, i)) })),\n    ...research(researchLog ?? []).filter((item) => item.at >= cutoff),\n  ];\n  placed.sort((a, b) => (a.at < b.at ? -1 : a.at > b.at ? 1 : a.rank - b.rank));\n  // The summary stands where the condensed turns were, ahead of everything kept.\n  if (compacted) placed.unshift({ at: '', rank: SETTLED, build: fromEntry(compacted) });\n\n  let nextId = 1;\n  const id = () => `b${nextId++}`;\n  const blocks = placed.map((item) => item.build(id));\n\n  if (plannerUsage && isMeasured(plannerUsage.totals)) blocks.push(usageBlock(id(), usageLine(plannerUsage)));\n\n  const transcriptAt = history.reduce<string | undefined>((latest, e) => (latest === undefined || e.timestamp > latest ? e.timestamp : latest), undefined);\n  return { blocks, nextId, ...(transcriptAt ? { transcriptAt } : {}) };\n}\n","import type { QueuedTaskMessage, StructuredTurnEnd } from '../interfaces/IRunner';\nimport type { TaskLogEvent } from '../models/TaskLog';\nimport { addPlannerUsage, isMeasured, usageLine, type PlannerUsage } from '../models/Usage';\nimport { mapAgentTool, normalizeAgentArgs } from '../services/harness/agentTools';\nimport type { ApprovalBlock, MessageBlock, SubagentChild, SubagentStatus, ThinkingDisplayBlock } from './blocks';\nimport { toolHeadline } from './format';\nimport {\n  append, appendOutput, replaceAt, closeOpenBlocks, findLastIndex, laneAppend, laneBlocks, laneOf, laneReplace, setUsageLine, updateSubagent, sealed,\n  type BlockList, type Lane,\n} from './lanes';\nimport { finishedTool, pendingTool, settledMessage } from './records';\n\n/**\n * What a surface draws for one attempt of a structured task (ADR-0018, O1b):\n * the same display blocks as the planner conversation, built from the task's\n * {@link TaskLogEvent}s. No planner turn ids — a task's turns are its own,\n * one at a time.\n */\nexport interface TaskLogView extends BlockList {\n  /** Messages not yet delivered, oldest first; `handedOver` marks the ones the runner already has. */\n  readonly queued: readonly QueuedTaskMessage[];\n  /** A turn is running. */\n  readonly working: boolean;\n  /** How the last turn ended; absent before the first one does. */\n  readonly lastTurnEnd?: StructuredTurnEnd;\n  /** What the runner reported over the attempt, subagents included. */\n  readonly usage?: PlannerUsage;\n  /**\n   * The block each run of deltas streams into, keyed by stream, so the run's\n   * authoritative copy replaces it instead of repeating it below.\n   */\n  readonly streams: Readonly<Record<string, string>>;\n}\n\nexport const EMPTY_TASK_LOG: TaskLogView = { blocks: [], nextId: 1, queued: [], working: false, streams: {} };\n\ntype Event<T extends TaskLogEvent['type']> = Extract<TaskLogEvent, { type: T }>;\n\nconst TEXT_STREAM = 'text';\nconst thinkingStream = (subagentId: string | undefined) => `thinking:${subagentId ?? ''}`;\n\nfunction withoutStream(view: TaskLogView, key: string): TaskLogView {\n  if (!(key in view.streams)) return view;\n  return { ...view, streams: Object.fromEntries(Object.entries(view.streams).filter(([k]) => k !== key)) };\n}\n\n// A later text block of the same turn opens with a paragraph break (the\n// adapter joins a turn's messages that way); as a block of its own it needs none.\nfunction blockText(text: string): string {\n  return text.replace(/^\\n+/, '');\n}\n\ntype Streamed = MessageBlock | ThinkingDisplayBlock;\n\n/** The lane's streaming block for `key`, while it is still the lane's latest output and still streaming. */\nfunction openStream(view: TaskLogView, lane: Lane, key: string): number {\n  const id = view.streams[key];\n  if (id === undefined) return -1;\n  const blocks = laneBlocks(view, lane);\n  const i = findLastIndex(blocks, (b) => b.type !== 'usage');\n  const block = blocks[i];\n  return block?.id === id && (block.type === 'message' || block.type === 'thinking') && block.streaming ? i : -1;\n}\n\nfunction streamDelta(view: TaskLogView, lane: Lane, key: string, text: string, make: (id: string, text: string) => Streamed): TaskLogView {\n  const i = openStream(view, lane, key);\n  const open = laneBlocks(view, lane)[i];\n  if (open?.type === 'message' || open?.type === 'thinking') return laneReplace(view, lane, i, { ...open, text: open.text + text });\n  const next = appendOutput(view, lane, (id) => make(id, blockText(text)));\n  return { ...next, streams: { ...next.streams, [key]: `b${view.nextId}` } };\n}\n\n/**\n * A run's authoritative copy: it replaces the text its deltas built, wherever\n * that block now sits in the lane, and is added whole when nothing streamed.\n */\nfunction streamWhole(view: TaskLogView, lane: Lane, key: string, text: string, make: (id: string) => SubagentChild): TaskLogView {\n  const id = view.streams[key];\n  const blocks = laneBlocks(view, lane);\n  const i = id === undefined ? -1 : findLastIndex(blocks, (b) => b.id === id);\n  const streamed = blocks[i];\n  const next = withoutStream(view, key);\n  if (streamed?.type === 'message' || streamed?.type === 'thinking') {\n    return laneReplace(next, lane, i, { ...streamed, text: blockText(text), streaming: false });\n  }\n  return appendOutput(next, lane, make);\n}\n\nfunction agentText(view: TaskLogView, text: string): TaskLogView {\n  return streamWhole(view, null, TEXT_STREAM, text, (id) => settledMessage(id, 'agent', blockText(text)));\n}\n\nfunction agentTextDelta(view: TaskLogView, text: string): TaskLogView {\n  return streamDelta(view, null, TEXT_STREAM, text, (id, t) => ({ type: 'message', id, role: 'agent', text: t, streaming: true }));\n}\n\nfunction thinkingBlock(id: string, text: string, streaming: boolean, subagentId: string | undefined): ThinkingDisplayBlock {\n  return { type: 'thinking', id, text, streaming, ...(subagentId ? { subagentId } : {}) };\n}\n\nfunction thinkingDelta(view: TaskLogView, { text, subagentId }: Event<'thinking_delta'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  return streamDelta(placed, lane, thinkingStream(subagentId), text, (id, t) => thinkingBlock(id, t, true, subagentId));\n}\n\nfunction thinkingWhole(view: TaskLogView, { text, subagentId }: Event<'thinking'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  return streamWhole(placed, lane, thinkingStream(subagentId), text, (id) => thinkingBlock(id, blockText(text), false, subagentId));\n}\n\nfunction announceTool(view: TaskLogView, { id: toolCallId, name, args, subagentId }: Event<'tool_call'>): TaskLogView {\n  const { tool, toolLabel } = mapAgentTool(name);\n  const [placed, lane] = laneOf(view, subagentId);\n  return appendOutput(placed, lane, (id) => {\n    const call = pendingTool(id, { tool, toolLabel, args, toolCallId });\n    const parsed = parseArgs(args);\n    // Headline from the normalized arguments, as the harness planner's rows\n    // are, so a `Read` or a Codex argv reads the same in both views.\n    return parsed ? { ...call, headline: toolHeadline(tool, JSON.stringify(normalizeAgentArgs(tool, parsed)), toolLabel) } : call;\n  });\n}\n\nfunction parseArgs(args: string): Record<string, unknown> | null {\n  try {\n    const parsed: unknown = JSON.parse(args);\n    return parsed && typeof parsed === 'object' && !Array.isArray(parsed) ? parsed as Record<string, unknown> : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction settleTool(view: TaskLogView, { id: toolCallId, output, success, subagentId }: Event<'tool_result'>): TaskLogView {\n  const [placed, lane] = laneOf(view, subagentId);\n  const blocks = laneBlocks(placed, lane);\n  const i = findLastIndex(blocks, (b) => b.type === 'tool' && b.status === 'pending' && b.toolCallId === toolCallId);\n  const pending = blocks[i];\n  const outcome = success ? 'success' : 'failure';\n  if (pending?.type === 'tool') return laneReplace(placed, lane, i, finishedTool(pending, output, outcome));\n  // The call that spawned a subagent is shown by the subagent's block, and\n  // only the subagent's own finish settles it: a backgrounded agent's call\n  // returns at launch, long before the work ends.\n  if (lane === null && blocks.some((b) => b.type === 'subagent' && b.toolCallId === toolCallId)) return view;\n  return laneAppend(placed, lane, (id) => finishedTool(pendingTool(id, { tool: 'agent_tool', toolLabel: 'Tool', args: '', toolCallId }), output, outcome));\n}\n\nfunction startSubagent(view: TaskLogView, { subagentId, brief, model }: Event<'subagent_started'>): TaskLogView {\n  return updateSubagent(view, subagentId, undefined, (block) => ({ ...block, ...(brief ? { brief } : {}), ...(model ? { model } : {}) }));\n}\n\nfunction finishSubagent(view: TaskLogView, { subagentId, outcome, digest }: Event<'subagent_finished'>): TaskLogView {\n  const usage = view.usage?.bySubagent?.[subagentId];\n  const next = updateSubagent(view, subagentId, undefined, (block) => ({\n    ...block, status: outcome, digest, children: block.children.map(sealed), ...(usage ? { usage } : {}),\n  }));\n  return withoutStream(next, thinkingStream(subagentId));\n}\n\nfunction reportUsage(view: TaskLogView, { record }: Event<'usage'>): TaskLogView {\n  const usage = addPlannerUsage(view.usage ?? { totals: {} }, record);\n  const next = { ...view, usage };\n  return isMeasured(usage.totals) ? setUsageLine(next, usageLine(usage)) : next;\n}\n\n/** A runner's tool request, read the way its call's row reads: `Bash(npm test)`. */\nexport function runnerToolSubject(tool: string, args: string): string {\n  const { tool: mapped, toolLabel } = mapAgentTool(tool);\n  const parsed = parseArgs(args);\n  const headline = toolHeadline(mapped, parsed ? JSON.stringify(normalizeAgentArgs(mapped, parsed)) : args, toolLabel);\n  return headline.keyArg ? `${headline.name}(${headline.keyArg})` : headline.name;\n}\n\nfunction requestApproval(view: TaskLogView, { approvalId, tool, args, allowForTask, toolCallId }: Event<'approval_requested'>): TaskLogView {\n  if (view.blocks.some((b) => b.type === 'approval' && b.approvalId === approvalId)) return view;\n  return append(view, (id) => ({\n    type: 'approval', id, approvalId, kind: 'runner_tool',\n    subject: runnerToolSubject(tool, args),\n    scope: tool,\n    status: 'pending',\n    ...(allowForTask ? { allowForTask } : {}),\n    ...(toolCallId ? { toolCallId } : {}),\n  }));\n}\n\nfunction settleApproval(view: TaskLogView, approvalId: string, settle: (block: ApprovalBlock) => ApprovalBlock): TaskLogView {\n  const i = findLastIndex(view.blocks, (b) => b.type === 'approval' && b.approvalId === approvalId);\n  const block = view.blocks[i];\n  if (block?.type !== 'approval' || block.status !== 'pending') return view;\n  return { ...view, blocks: replaceAt(view.blocks, i, settle(block)) };\n}\n\nfunction decideApproval(view: TaskLogView, { approvalId, decision, note }: Event<'approval_decided'>): TaskLogView {\n  return settleApproval(view, approvalId, (block) => ({\n    ...block,\n    status: decision === 'deny' ? 'denied' : 'granted',\n    decidedBy: 'asked',\n    ...(decision === 'allowForTask' ? { forTask: true } : {}),\n    ...(note ? { note } : {}),\n  }));\n}\n\nfunction startTurn(view: TaskLogView, { message, messageId }: Event<'turn_start'>): TaskLogView {\n  const queued = messageId ? view.queued.filter((m) => m.id !== messageId) : view.queued;\n  const working = { ...view, queued, working: true };\n  // A turn the runner opened itself has no user message to show.\n  return message ? append(working, (id) => settledMessage(id, 'user', message)) : working;\n}\n\nconst CUT: Record<StructuredTurnEnd, SubagentStatus | null> = { completed: null, interrupted: 'stopped', failed: 'failed' };\n\nfunction endTurn(view: TaskLogView, { reason }: Event<'turn_end'>): TaskLogView {\n  const closed = closeOpenBlocks({ ...view, working: false, lastTurnEnd: reason, streams: {} }, CUT[reason]);\n  return reason === 'interrupted' ? append(closed, (id) => settledMessage(id, 'system', 'Interrupted.')) : closed;\n}\n\nfunction queueMessage(view: TaskLogView, { messageId, text, forced }: Event<'message_queued'>): TaskLogView {\n  const listed = view.queued.find((m) => m.id === messageId);\n  if (forced) {\n    // The session's own order (ADR-0023, F2): behind earlier forced messages, ahead of the rest.\n    const rest = view.queued.filter((m) => m !== listed);\n    const at = rest.findIndex((m) => !m.forced);\n    const placed = at < 0 ? rest.length : at;\n    return { ...view, queued: [...rest.slice(0, placed), { id: messageId, text, forced: true }, ...rest.slice(placed)] };\n  }\n  if (!listed) return { ...view, queued: [...view.queued, { id: messageId, text }] };\n  if (!listed.handedOver) return view;\n  return { ...view, queued: view.queued.map((m) => (m === listed ? { id: m.id, text: m.text } : m)) };\n}\n\nfunction handOver(view: TaskLogView, { messageId }: Event<'message_handed_over'>): TaskLogView {\n  const listed = view.queued.find((m) => m.id === messageId);\n  if (!listed || listed.handedOver) return view;\n  return { ...view, queued: view.queued.map((m) => (m === listed ? { ...m, handedOver: true } : m)) };\n}\n\n/** The message joins the transcript where the runner read it, between the steps around it. */\nfunction deliverMidTurn(view: TaskLogView, event: Event<'message_delivered'>): TaskLogView {\n  return appendOutput(unqueueMessage(view, event), null, (id) => settledMessage(id, 'user', event.text));\n}\n\nfunction unqueueMessage(view: TaskLogView, { messageId }: { messageId: string }): TaskLogView {\n  const queued = view.queued.filter((m) => m.id !== messageId);\n  return queued.length === view.queued.length ? view : { ...view, queued };\n}\n\n/**\n * Fold one task-log event into the view. Pure and incremental, like\n * `reduceConversation`: an event that changes nothing returns `view` itself,\n * and an event of a type this build does not know is skipped — a log written\n * by a newer Ordewell still reads.\n */\nexport function reduceTaskLog(view: TaskLogView, event: TaskLogEvent): TaskLogView {\n  switch (event.type) {\n    case 'task_skills': return append(view, (id) => settledMessage(id, 'system', `Skills: ${event.skills.map((s) => `${s.name} (${s.path})`).join(', ')}`));\n    case 'turn_start': return startTurn(view, event);\n    case 'turn_end': return endTurn(view, event);\n    case 'text_delta': return agentTextDelta(view, event.text);\n    case 'text': return agentText(view, event.text);\n    case 'thinking_delta': return thinkingDelta(view, event);\n    case 'thinking': return thinkingWhole(view, event);\n    case 'tool_call': return announceTool(view, event);\n    case 'tool_result': return settleTool(view, event);\n    case 'subagent_started': return startSubagent(view, event);\n    case 'subagent_finished': return finishSubagent(view, event);\n    case 'usage': return reportUsage(view, event);\n    case 'message_queued': return queueMessage(view, event);\n    case 'message_removed': return unqueueMessage(view, event);\n    case 'message_handed_over': return handOver(view, event);\n    case 'message_delivered': return deliverMidTurn(view, event);\n    case 'message_undelivered': return append(unqueueMessage(view, event), (id) => settledMessage(id, 'system', `${event.text} · not delivered`));\n    case 'error': return appendOutput(view, null, (id) => settledMessage(id, 'error', event.message));\n    case 'approval_requested': return requestApproval(view, event);\n    case 'approval_decided': return decideApproval(view, event);\n    case 'approval_withdrawn': return settleApproval(view, event.approvalId, (block) => ({ ...block, status: 'withdrawn' }));\n    default: return view;\n  }\n}\n\n/** A whole attempt's events, folded from the start — what a reload shows. */\nexport function replayTaskLog(events: readonly TaskLogEvent[], from: TaskLogView = EMPTY_TASK_LOG): TaskLogView {\n  return events.reduce(reduceTaskLog, from);\n}\n","/**\n * Prompts the user sent while a planner turn was in flight, waiting to be the\n * next turn's input. The hold is a plain immutable list, oldest first, so a\n * pure reducer can keep it in state and a host can keep it in a field — and\n * either can draw it as is.\n */\nexport type PromptHold = readonly string[];\n\nexport const EMPTY_HOLD: PromptHold = [];\n\n/** One prompt taken out of the hold, and what is left behind. */\nexport interface TakenPrompt {\n  text: string;\n  rest: PromptHold;\n}\n\nexport function holdPrompt(hold: PromptHold, text: string): PromptHold {\n  return [...hold, text];\n}\n\n/** The prompt a settled turn sends next: the oldest, so they go in the order typed. */\nexport function drainNext(hold: PromptHold): TakenPrompt | undefined {\n  const [text, ...rest] = hold;\n  return text === undefined ? undefined : { text, rest };\n}\n\n/**\n * Takes back the newest prompt — the one the user most likely just regretted —\n * while the older ones stay queued behind the turn.\n */\nexport function unsendLatest(hold: PromptHold): TakenPrompt | undefined {\n  if (hold.length === 0) return undefined;\n  return { text: hold[hold.length - 1], rest: hold.slice(0, -1) };\n}\n\n/**\n * A stopped turn takes its queue with it: the prompts were written against a\n * turn that no longer exists, so they come back as one draft to edit and\n * resend rather than firing off after the stop.\n */\nexport function unsendAll(hold: PromptHold): TakenPrompt | undefined {\n  if (hold.length === 0) return undefined;\n  return { text: hold.join('\\n'), rest: EMPTY_HOLD };\n}\n\n/** Where an unsent prompt lands in the drafting input: above what is being typed, never replacing it. */\nexport function aheadOfDraft(text: string, draft: string): string {\n  return draft ? `${text}\\n${draft}` : text;\n}\n","import type { SessionMessage } from '../services/SessionMessage';\nimport { reduceConversation, type ConversationInput, type ConversationView } from './reduce';\n\n/**\n * The planner turn a surface has open, and the one its user stopped. Kept\n * beside the view rather than in it: the view is what a turn drew, this is\n * whether the surface still wants to hear from it.\n */\nexport interface TurnGate {\n  readonly open: string | null;\n  readonly stopped: string | null;\n}\n\nexport const NO_TURN: TurnGate = { open: null, stopped: null };\n\nexport interface GatedConversation {\n  view: ConversationView;\n  gate: TurnGate;\n}\n\n/** What a turn streams — everything a stop cuts off. Usage, approvals and transcript markers are facts and still land. */\nconst TURN_STREAM = new Set<SessionMessage['type']>([\n  'planner_text_delta', 'planner_thinking_delta', 'planner_text_retracted', 'planner_message', 'plan_token',\n  'research_step', 'research_step_done', 'subagent_started', 'subagent_finished', 'planner_turn_ended',\n  'planner_skill_loaded',\n]);\n\n// A message with no turn id while a stop stands can only be the stopped\n// turn's: a new turn announces itself first, and that lifts the stop.\nfunction cutOff(gate: TurnGate, input: ConversationInput): boolean {\n  if (gate.stopped === null || !TURN_STREAM.has(input.type as SessionMessage['type'])) return false;\n  const turnId = 'turnId' in input ? input.turnId : undefined;\n  return turnId === undefined || turnId === gate.stopped;\n}\n\nfunction withGate(live: GatedConversation, gate: TurnGate): GatedConversation {\n  return gate.open === live.gate.open && gate.stopped === live.gate.stopped ? live : { ...live, gate };\n}\n\n/**\n * One input into the view, the stop rule applied: a turn the user stopped is\n * over on screen, and whatever it streams until the backend notices is\n * dropped. An input that changes nothing hands back the same view and gate.\n */\nexport function followTurn(view: ConversationView, gate: TurnGate, input: ConversationInput): GatedConversation {\n  const live = { view, gate };\n  if (input.type === 'planner_turn_started') {\n    return withGate({ view: reduceConversation(view, input), gate }, { open: input.turnId, stopped: null });\n  }\n  if (cutOff(gate, input)) {\n    return input.type === 'planner_turn_ended' ? withGate(live, { ...gate, stopped: null }) : live;\n  }\n  const next = { view: reduceConversation(view, input), gate };\n  return input.type === 'planner_turn_ended' && input.turnId === gate.open ? withGate(next, { ...gate, open: null }) : next;\n}\n\n/**\n * The user stopped the planner. The turn ends on screen now rather than when\n * the backend notices the abort, so the surface is free at once and the\n * turn's late output never lands. Nothing changes when no turn is open.\n */\nexport function stopTurn(view: ConversationView, gate: TurnGate): GatedConversation {\n  if (gate.open === null) return { view, gate };\n  return {\n    view: reduceConversation(view, { type: 'planner_turn_ended', turnId: gate.open, outcome: 'stopped' }),\n    gate: { open: null, stopped: gate.open },\n  };\n}\n","import type { DisplayBlock } from './blocks';\n\n/**\n * Whether the conversation holds anything the collapsed view hides — thinking,\n * a command row's arguments and output, a subagent's children and digest. The\n * detail toggle is the only expansion control (ADR-0017, X1), so a surface\n * offers it only when it would do something.\n */\nexport function hasHiddenDetail(blocks: readonly DisplayBlock[]): boolean {\n  return blocks.some((b) => b.type === 'thinking' || b.type === 'tool' || b.type === 'subagent');\n}\n","/** The conversation line for a task starting, worded the same on every surface. */\nexport function taskStartedNotice(title: string, runner?: string): string {\n  return runner ? `Started \"${title}\" · ${runner}` : `Started \"${title}\"`;\n}\n","import { NOT_STARTED } from './status';\n\n/** What a user can do to one task from its row. */\nexport type TaskRowAction = 'cancel' | 'skip' | 'force-start' | 'complete' | 'uncomplete';\n\n/** A subtask runs with its parent, so its row offers a different set than a top-level task's. */\nexport type TaskRowPlacement = 'task' | 'subtask';\n\ninterface ActionSubject {\n  status: string;\n  type: 'ai' | 'user';\n}\n\ntype Rule = readonly [TaskRowAction, (task: ActionSubject) => boolean];\n\nconst UNSTARTED_AI = (t: ActionSubject): boolean => t.type === 'ai' && NOT_STARTED.has(t.status);\nconst QUEUED = (t: ActionSubject): boolean => t.status === 'pending' || t.status === 'approved';\n\n// Order is the order a surface lays the actions out in.\nconst TASK_RULES: readonly Rule[] = [\n  ['cancel', (t) => t.status === 'in_progress'],\n  ['skip', (t) => t.status === 'blocked'],\n  ['force-start', UNSTARTED_AI],\n  // A manual task has no runner to report it done, so it can always be marked.\n  ['complete', (t) => t.status === 'awaiting_user' || t.type === 'user'],\n  ['uncomplete', (t) => t.status === 'completed'],\n];\n\nconst SUBTASK_RULES: readonly Rule[] = [\n  ['cancel', (t) => t.status === 'in_progress'],\n  ['complete', (t) => t.status === 'in_progress' && t.type === 'ai'],\n  ['force-start', (t) => t.type === 'ai' && QUEUED(t)],\n  ['skip', QUEUED],\n  ['complete', (t) => t.status === 'awaiting_user'],\n  ['uncomplete', (t) => t.status === 'completed'],\n];\n\n/** The actions a task's row offers while a plan runs, in the order they are laid out. */\nexport function taskRowActions(task: ActionSubject, placement: TaskRowPlacement = 'task'): TaskRowAction[] {\n  const rules = placement === 'subtask' ? SUBTASK_RULES : TASK_RULES;\n  return rules.filter(([, applies]) => applies(task)).map(([action]) => action);\n}\n\n/**\n * One toggle in both directions: a done task is taken back, anything else is\n * marked done. A second control for the reverse is one nobody remembers.\n */\nexport function markAction(task: { status: string }): 'complete' | 'uncomplete' {\n  return task.status === 'completed' ? 'uncomplete' : 'complete';\n}\n\n/**\n * The mark an action asks the session for, or null when it is not a mark.\n * Skip has no request of its own: a skipped task is marked complete, so the\n * run moves on past it.\n */\nexport function markRequestFor(action: string): 'complete' | 'uncomplete' | null {\n  if (action === 'complete' || action === 'skip') return 'complete';\n  if (action === 'uncomplete') return 'uncomplete';\n  return null;\n}\n\n/** Change versus ops can still be flipped (ADR-0020): an AI task that has not started. */\nexport function opsEditable(task: ActionSubject): boolean {\n  return UNSTARTED_AI(task);\n}\n","import type { AwaitingReason } from '../models/Task';\nimport type { TaskIsolationState } from '../interfaces/IWorktreeIsolation';\nimport { taskOrderLabel, taskRef } from '../order-labels';\nimport { capConflictFiles } from '../services/conflictFiles';\nimport { approvalLabel, awaitingLabel, isTaskRunning, taskStatusKind, type TaskStatusKind } from './status';\nimport { markAction, opsEditable, taskRowActions, type TaskRowAction, type TaskRowPlacement } from './actions';\n\n/**\n * A task as both surfaces hold it, with the live state each tracks beside it\n * (silence, approvals, isolation, the merge gate). Structural, because the TUI\n * projects tasks into its own shape.\n */\nexport interface TaskRowSubject {\n  id: string;\n  order: number;\n  type: 'ai' | 'user';\n  status: string;\n  dependencies: readonly string[];\n  taskMode?: string;\n  ops?: boolean;\n  idleSince?: string | null;\n  awaitingReason?: AwaitingReason;\n  awaitingApproval?: number;\n  isolation?: TaskRowIsolation | null;\n  mergeGate?: readonly string[];\n  forcedPastGate?: readonly string[];\n}\n\nexport interface TaskRowIsolation {\n  state: TaskIsolationState;\n  repos?: string[];\n  conflictRepo?: string;\n  conflictFiles?: string[];\n  repair?: { attempt: number; limit: number };\n  repairedFiles?: string[];\n}\n\nexport interface TaskRowContext {\n  /** Set for a subtask: it is labelled by its dotted order. */\n  parent?: { order: number } | null;\n  /** Which action set the row offers; a row with a parent is a subtask's unless told otherwise. */\n  placement?: TaskRowPlacement;\n  /** Order of each task a dependency or gate may name; one missing from it is shown by id. */\n  orderOf?: ReadonlyMap<string, number>;\n  /** The modes the task's runner declares; autonomy is a tag on one of them (ADR-0001). */\n  modes?: readonly { id: string; autonomous?: boolean }[];\n}\n\n/** Whether the row stands for an AI task, a manual one, or an ops task (ADR-0020). */\nexport type TaskRowKind = 'ai' | 'user' | 'ops';\n\nexport interface TaskRowView {\n  /** \"2\", or \"2.1\" for a subtask. */\n  orderLabel: string;\n  kind: TaskRowKind;\n  status: TaskStatusKind;\n  /** A runner is live behind it — `quiet` included. */\n  running: boolean;\n  /** What an awaiting task waits on, in sentence case; null when nothing was saved. */\n  awaiting: string | null;\n  /** Runner requests waiting on the user, in sentence case; null when none do. */\n  approvals: string | null;\n  /** The task's mode is tagged autonomous: it runs without permission prompts. */\n  autonomous: boolean;\n  /** The repos its isolated work changed, by path; empty for a group of one. */\n  repos: string[];\n  /** Integration stopped on a conflict: the one isolation state that needs the user. */\n  conflict: { repo: string | null; files: string | null } | null;\n  /** A conflict repair in flight (ADR-0015) — progress, not a blocker. */\n  repairing: { files: string | null; attempt: { attempt: number; limit: number } | null } | null;\n  /** The files a conflict repair was started for; `landed` once the task is integrated. */\n  repaired: { files: string; landed: boolean } | null;\n  /** The dependencies, by reference, whose work is not merged into the user's branch yet. */\n  mergeGate: string[] | null;\n  /** An ops task changed tracked files in the user's checkout and nothing was committed. */\n  opsChangedFiles: boolean;\n  /** The dependencies, by title, a force start went past the merge gate of. */\n  forcedPastGate: readonly string[] | null;\n  /** The task's dependencies, by reference. */\n  dependencies: string[];\n  /** What the row offers while a plan runs. */\n  actions: TaskRowAction[];\n  /** The one mark its toggle sets. */\n  mark: 'complete' | 'uncomplete';\n  opsEditable: boolean;\n}\n\nconst refsOf = (ids: readonly string[], orderOf: ReadonlyMap<string, number> | undefined): string[] =>\n  ids.map((id) => {\n    const order = orderOf?.get(id);\n    return order === undefined ? id : taskRef({ order });\n  });\n\n/** A lone repository at the workspace root is not named: a group of one reads as it did before repo groups. */\nconst namedRepo = (repo: string | undefined): string | null => (repo && repo !== '.' ? repo : null);\n\n/** The repos a task changed, for a row that names them; none for a group of one. */\nexport const namedRepos = (repos: readonly string[] | undefined): string[] => (repos ?? []).filter((r) => r !== '.');\n\nconst filesOf = (files: string[] | undefined): string | null => (files?.length ? capConflictFiles(files) : null);\n\n/**\n * Everything a plan row says about one task, decided once: each surface picks\n * its own words, glyphs and casing for these facts, and derives none of them.\n */\nexport function taskRowView(task: TaskRowSubject, context: TaskRowContext = {}): TaskRowView {\n  const parent = context.parent ?? undefined;\n  const isolation = task.isolation && task.isolation.state !== 'none' ? task.isolation : null;\n  return {\n    orderLabel: taskOrderLabel(task, parent),\n    kind: task.type === 'user' ? 'user' : task.ops ? 'ops' : 'ai',\n    status: taskStatusKind(task),\n    running: isTaskRunning(task),\n    awaiting: awaitingLabel(task),\n    approvals: approvalLabel(task.awaitingApproval),\n    autonomous: task.type === 'ai' && context.modes?.find((m) => m.id === task.taskMode)?.autonomous === true,\n    repos: namedRepos(isolation?.repos),\n    conflict: isolation?.state === 'conflict'\n      ? { repo: namedRepo(isolation.conflictRepo), files: filesOf(isolation.conflictFiles) }\n      : null,\n    repairing: isolation?.state === 'repairing'\n      ? { files: filesOf(isolation.conflictFiles), attempt: isolation.repair ?? null }\n      : null,\n    repaired: isolation?.repairedFiles?.length\n      ? { files: capConflictFiles(isolation.repairedFiles), landed: isolation.state === 'integrated' }\n      : null,\n    mergeGate: task.mergeGate?.length ? refsOf(task.mergeGate, context.orderOf) : null,\n    opsChangedFiles: task.status === 'awaiting_user' && task.awaitingReason === 'files-changed',\n    forcedPastGate: task.forcedPastGate?.length ? task.forcedPastGate : null,\n    dependencies: refsOf(task.dependencies, context.orderOf),\n    actions: taskRowActions(task, context.placement ?? (parent ? 'subtask' : 'task')),\n    mark: markAction(task),\n    opsEditable: opsEditable(task),\n  };\n}\n","import { titledTaskRef } from '../order-labels';\n\ninterface Named {\n  id: string;\n  order: number;\n  title: string;\n  subtasks?: readonly Named[];\n}\n\nfunction findNamed(tasks: readonly Named[], id: string): Named | undefined {\n  for (const task of tasks) {\n    if (task.id === id) return task;\n    const nested = findNamed(task.subtasks ?? [], id);\n    if (nested) return nested;\n  }\n  return undefined;\n}\n\n/** Each id as \"#N title\", subtasks included; one the plan no longer holds stays a bare id. */\nexport function titledRefs(ids: readonly string[], tasks: readonly Named[]): string[] {\n  return ids.map((id) => {\n    const task = findNamed(tasks, id);\n    return task ? titledTaskRef(task) : id;\n  });\n}\n\n/**\n * What removing a task does to the tasks that depend on it, or null when none\n * do. Named rather than counted: the removal rewrites their dependency lists,\n * and a bare \"Remove task?\" would hide that.\n */\nexport function dependentsNotice(dependents: readonly { order: number; title: string }[]): string | null {\n  if (dependents.length === 0) return null;\n  const subject = dependents.length === 1 ? '1 task depends' : `${dependents.length} tasks depend`;\n  return `${subject} on it and will lose that dependency: ${dependents.map((t) => titledTaskRef(t)).join(', ')}.`;\n}\n\n/**\n * What a start past a merge gate is asked with (ADR-0020): the work the task\n * would act without, named. `subject` is how the asking surface refers to the\n * task — \"It\" under a title that already names it.\n */\nexport function pastGateConfirmation(unmerged: readonly string[], subject = 'This task'): string {\n  return `${subject} waits for Merge all: the work of ${unmerged.join(', ')} is not merged into your branch yet, so it would act without it. Starting it now is kept on the task.`;\n}\n\nexport interface NewTaskFields {\n  title: string;\n  description: string;\n  prompt: string;\n  type: 'ai';\n}\n\n/**\n * What a hand-added task starts as: an AI task whose description is its title\n * and whose prompt, unless one was typed, is too. Null for a title with nothing\n * in it, rather than a nameless task. Assignments are left for the session to\n * derive from the runner's catalog.\n */\nexport function newTaskFields(title: string, prompt?: string): NewTaskFields | null {\n  const name = title.trim();\n  if (!name) return null;\n  return { title: name, description: name, prompt: prompt?.trim() ? prompt : name, type: 'ai' };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,IAAAA,eAA6B;;;ACA7B,kBAA6B;;;ACCtB,IAAM,qBAAqB;AAQlC,IAAM,cAAc,IAAI,OAAO,cAAc,kBAAkB,yBAAyB,IAAI;AAcrF,SAAS,YAAYC,OAA4B;AACtD,QAAM,SAAuB,CAAC;AAC9B,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,SAASA,MAAK,SAAS,WAAW,GAAG;AAC9C,UAAM,OAAO,MAAM,CAAC,EAAE,YAAY;AAClC,QAAI,KAAK,IAAI,IAAI,EAAG;AACpB,SAAK,IAAI,IAAI;AACb,UAAM,QAAQ,MAAM,QAAQ,MAAM,CAAC,EAAE;AACrC,WAAO,KAAK,EAAE,MAAM,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,EAAE,OAAO,CAAC;AAAA,EAC/D;AACA,SAAO;AACT;AAGO,SAAS,kBAAkBA,OAAc,QAAyC;AACvF,SAAO,YAAYA,KAAI,EAAE,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,IAAI,CAAC;AAChE;;;AC/BO,SAAS,eAAe,MAAyB,QAAoC;AAC1F,SAAO,SAAS,GAAG,OAAO,KAAK,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK;AACrE;AAGO,SAAS,QAAQ,MAAyB,QAAoC;AACnF,SAAO,IAAI,eAAe,MAAM,MAAM,CAAC;AACzC;AAGO,SAAS,cAAc,MAAwC,QAAoC;AACxG,SAAO,GAAG,QAAQ,MAAM,MAAM,CAAC,IAAI,KAAK,KAAK;AAC/C;;;AF+lBA,IAAM,aAAa,IAAI,OAAO,IAAI,kBAAkB,GAAG;AAmDhD,IAAM,kBAAuC,CAAC,aAAa;;;AG3pB3D,IAAM,gBAAgB,CAAC,SAC5B,KAAK,WAAW,iBAAiB,KAAK,WAAW;AAG5C,IAAM,cAAmC,oBAAI,IAAI,CAAC,WAAW,YAAY,SAAS,CAAC;AAEnF,SAAS,eAAe,MAAqE;AAClG,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK;AAAa,aAAO;AAAA,IACzB,KAAK;AAAU,aAAO;AAAA,IACtB,KAAK;AAAW,aAAO;AAAA,IACvB,KAAK;AAAiB,aAAO;AAAA,EAC/B;AACA,MAAI,CAAC,cAAc,IAAI,EAAG,QAAO;AACjC,SAAO,KAAK,WAAW,iBAAiB,KAAK,YAAY,UAAU;AACrE;AAEA,IAAM,kBAAkD;AAAA,EACtD,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,iBAAiB;AACnB;AAGO,SAAS,cAAc,MAA0E;AACtG,SAAO,KAAK,WAAW,mBAAmB,KAAK,iBAAiB,gBAAgB,KAAK,cAAc,IAAI;AACzG;AAGO,SAAS,cAAc,OAA0C;AACtE,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO,QAAQ,IAAI,yBAAyB,KAAK,MAAM;AACzD;;;AJsLA,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,OAAwB,aAAwD;AAC5G,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,OAAqB,QAAsB;AACvH,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,OAAwB,QAAiD;AACpG,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;;;AKrZA,SAAS,UAAUC,OAAc,KAAqB;AACpD,QAAMC,WAAUD,MAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAC/C,SAAOC,SAAQ,SAAS,MAAM,GAAGA,SAAQ,MAAM,GAAG,GAAG,CAAC,WAAMA;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,YAAMA,WAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACjD,aAAO,WAAWA,SAAQ,MAAM,GAAG,EAAE,CAAC,GAAGA,SAAQ,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;;;ACpFA,IAAM,kBAAkB;AAOxB,IAAM,gBAAwC;AAAA,EAC5C,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,MAAM;AAAA,EACN,MAAM;AAAA,EACN,aAAa;AAAA,EACb,MAAM;AAAA,EACN,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,sBAAsB;AACxB;AAIA,IAAM,cAAc,CAAC,aAAa,YAAY,QAAQ,OAAO,WAAW,SAAS,WAAW,eAAe,QAAQ;AAEnH,SAAS,UAAU,MAA8C;AAC/D,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,IAAI;AACvC,WAAO,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,IAAI,SAAoC;AAAA,EAC9G,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,QAAQC,OAAsB;AACrC,SAAOA,MAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACxC;AAIA,SAAS,YAAY,SAAyB;AAC5C,QAAMC,SAAQ,QAAQ,KAAK,EAAE,MAAM,OAAO;AAC1C,QAAM,OAAOA,OAAM,SAAS;AAC5B,SAAO,OAAO,IAAI,GAAGA,OAAM,CAAC,CAAC,YAAO,IAAI,QAAQ,SAAS,IAAI,KAAK,GAAG,KAAKA,OAAM,CAAC;AACnF;AAEA,SAAS,KAAK,OAAwB;AACpC,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC7C;AAEA,SAAS,UAAU,SAAiB,MAAc,UAAU,IAAY;AACtE,SAAO,GAAG,OAAO,GAAG,OAAO,OAAO,IAAI,KAAK,EAAE,GAAG,UAAU,KAAK,OAAO,MAAM,EAAE;AAChF;AAEA,SAAS,QAAQ,MAAuC;AACtD,aAAW,SAAS,aAAa;AAC/B,UAAM,QAAQ,KAAK,KAAK,KAAK,CAAC;AAC9B,QAAI,MAAO,QAAO,UAAU,YAAY,YAAY,KAAK,IAAI,QAAQ,KAAK;AAAA,EAC5E;AACA,QAAM,YAAY,OAAO,OAAO,IAAI,EAAE,KAAK,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,KAAK,MAAM,EAAE;AACvG,SAAO,YAAY,QAAQ,SAAS,IAAI;AAC1C;AAEA,SAAS,SAAS,MAAc,MAAuC;AACrE,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,YAAY,KAAK,KAAK,OAAO,CAAC;AAAA,IACvC,KAAK;AAAA,IACL,KAAK;AACH,aAAO,KAAK,KAAK,IAAI;AAAA,IACvB,KAAK;AACH,aAAO,MAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,MAAM,EAAE,KAAK,IAAI,IAAI;AAAA,IACzE,KAAK;AACH,aAAO,UAAU,KAAK,KAAK,OAAO,GAAG,KAAK,KAAK,IAAI,CAAC;AAAA,IACtD,KAAK;AACH,aAAO,UAAU,KAAK,KAAK,OAAO,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,OAAO,CAAC;AAAA,IAC1E,KAAK;AACH,aAAO,GAAG,KAAK,KAAK,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,KAAK,QAAQ,CAAC,MAAM,EAAE;AAAA,IACtF,KAAK;AACH,aAAO,KAAK,KAAK,GAAG;AAAA,IACtB,KAAK;AACH,aAAO,QAAQ,KAAK,KAAK,KAAK,CAAC;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,KAAK,KAAK,MAAM,CAAC;AAAA,IAClC;AACE,aAAO,QAAQ,IAAI;AAAA,EACvB;AACF;AAUO,SAAS,aAAa,MAAc,MAAc,WAAkC;AACzF,QAAM,OAAO,WAAW,KAAK,KAAK,cAAc,IAAI,KAAK;AACzD,QAAM,SAAS,UAAU,IAAI;AAC7B,SAAO,EAAE,MAAM,QAAQ,SAAS,SAAS,MAAM,MAAM,IAAI,QAAQ,IAAI,EAAE;AACzE;AAQO,SAAS,YAAY,QAA0B;AAEpD,QAAMA,SAAQ,OAAO,QAAQ,UAAU,IAAI,EAAE,QAAQ,iBAAiB,EAAE,EAAE,MAAM,IAAI;AACpF,SAAOA,OAAM,SAAS,KAAKA,OAAMA,OAAM,SAAS,CAAC,EAAE,KAAK,MAAM,GAAI,CAAAA,OAAM,IAAI;AAC5E,SAAOA;AACT;AAGO,SAAS,cAAc,QAAgB,UAAiC;AAC7E,QAAMA,SAAQ,YAAY,MAAM;AAChC,QAAM,QAAQA,OAAM,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC;AAClD,SAAO,EAAE,OAAO,OAAO,iBAAiBA,OAAM,SAAS,MAAM,OAAO;AACtE;AAOO,SAAS,SAAS,QAAiC;AACxD,QAAMA,SAAQ,YAAY,MAAM;AAChC,MAAI,QAAQ;AACZ,MAAI,UAAU;AACd,aAAW,QAAQA,QAAO;AACxB,QAAI,KAAK,WAAW,GAAG,EAAG,UAAS;AAAA,aAC1B,KAAK,WAAW,GAAG,EAAG,YAAW;AAAA,aACjC,EAAE,KAAK,WAAW,IAAI,KAAK,KAAK,WAAW,GAAG,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,GAAI,QAAO;AAAA,EAC5G;AACA,SAAO,QAAQ,UAAU,IAAI,EAAE,OAAO,QAAQ,IAAI;AACpD;AAYA,IAAM,aAAa;AAGZ,SAAS,SAAS,QAA2B;AAClD,QAAM,OAAkB,CAAC;AACzB,MAAI,UAAU;AACd,MAAI,UAAU;AACd,aAAW,QAAQ,YAAY,MAAM,GAAG;AACtC,UAAM,QAAQ,WAAW,KAAK,IAAI;AAClC,QAAI,OAAO;AACT,UAAI,KAAK,SAAS,EAAG,MAAK,KAAK,EAAE,MAAM,OAAO,MAAM,GAAG,CAAC;AACxD,gBAAU,OAAO,MAAM,CAAC,CAAC;AACzB,gBAAU,OAAO,MAAM,CAAC,CAAC;AAAA,IAC3B,WAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,WAAK,KAAK,EAAE,MAAM,SAAS,MAAM,WAAW,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AAAA,IACnE,WAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,WAAK,KAAK,EAAE,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AAAA,IACrE,WAAW,CAAC,KAAK,WAAW,IAAI,GAAG;AACjC,WAAK,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC;AACjE,iBAAW;AACX,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,MAAM,OAAuB;AACpC,SAAO,GAAG,KAAK,QAAQ,UAAU,IAAI,KAAK,GAAG;AAC/C;AAGO,SAAS,YAAY,EAAE,OAAO,QAAQ,GAAqB;AAChE,MAAI,CAAC,QAAS,QAAO,SAAS,MAAM,KAAK,CAAC;AAC1C,MAAI,CAAC,MAAO,QAAO,WAAW,MAAM,OAAO,CAAC;AAC5C,SAAO,SAAS,MAAM,KAAK,CAAC,aAAa,MAAM,OAAO,CAAC;AACzD;;;AC3KA,IAAM,cAAgD;AAAA;AAAA,EAEpD,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,UAAU;AAAA,EACV,WAAW;AAAA;AAAA,EAEX,OAAO;AAAA,EACP,cAAc;AAAA,EACd,aAAa;AAAA;AAAA,EAEb,MAAM;AAAA,EACN,OAAO;AAAA;AAAA,EAEP,YAAY;AACd;AAOA,IAAM,uBAAuB;AAO7B,IAAM,kBAAkB,oBAAI,IAAI,CAAC,QAAQ,SAAS,aAAa,gBAAgB,cAAc,SAAS,OAAO,UAAU,UAAU,YAAY,CAAC;AAEvI,SAAS,eAAe,MAAuB;AACpD,SAAO,gBAAgB,IAAI,KAAK,KAAK,EAAE,YAAY,EAAE,QAAQ,SAAS,EAAE,CAAC;AAC3E;AAYO,SAAS,aAAa,MAA0B;AACrD,QAAM,aAAa,KAAK,KAAK,EAAE,QAAQ,sBAAsB,EAAE,EAAE,YAAY,EAAE,QAAQ,SAAS,EAAE;AAClG,QAAM,SAAS,YAAY,UAAU,KAAK,YAAY,KAAK,KAAK,EAAE,YAAY,CAAC;AAC/E,MAAI,QAAQ;AAGV,WAAO,EAAE,MAAM,QAAQ,WAAW,KAAK;AAAA,EACzC;AACA,SAAO,EAAE,MAAM,cAAc,WAAW,KAAK;AAC/C;AAQO,SAAS,mBAAmB,MAAwB,MAAwD;AACjH,QAAM,MAAM,EAAE,GAAG,KAAK;AACtB,QAAM,QAAQ,CAAC,MAAc,OAAe;AAC1C,QAAI,IAAI,EAAE,MAAM,UAAa,IAAI,IAAI,MAAM,OAAW,KAAI,EAAE,IAAI,IAAI,IAAI;AAAA,EAC1E;AACA,MAAI,SAAS,eAAe,SAAS,YAAY;AAC/C,UAAM,YAAY,MAAM;AACxB,UAAM,aAAa,MAAM;AACzB,UAAM,UAAU,MAAM;AAAA,EACxB;AACA,MAAI,SAAS,QAAQ;AACnB,UAAM,OAAO,SAAS;AACtB,UAAM,UAAU,SAAS;AAEzB,QAAI,OAAO,IAAI,YAAY,YAAY,MAAM,QAAQ,IAAI,OAAO,GAAG;AACjE,UAAI,UAAW,IAAI,QAAsB,KAAK,GAAG;AAAA,IACnD;AAAA,EACF;AACA,MAAI,SAAS,QAAS,OAAM,OAAO,KAAK;AACxC,MAAI,SAAS,aAAc,OAAM,KAAK,OAAO;AAC7C,SAAO;AACT;;;ACzFO,SAAS,eAAe,IAAY,MAAmBC,OAAc,QAA+B;AACzG,SAAO,EAAE,MAAM,WAAW,IAAI,MAAM,MAAAA,OAAM,WAAW,OAAO,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AAC5F;AAGO,SAAS,YAAY,IAAYA,OAAc,QAAoC,QAA+B;AACvH,QAAM,QAAQ,eAAe,IAAI,QAAQA,OAAM,MAAM;AACrD,SAAO,OAAO,SAAS,IAAI,EAAE,GAAG,OAAO,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI;AAC/E;AAGO,SAAS,gBAAgB,EAAE,WAAW,MAAM,QAAQ,MAAM,SAAS,GAAqC;AAC7G,SAAO,EAAE,WAAW,MAAM,QAAQ,MAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC,EAAG;AAC5E;AA0BO,SAAS,eAAe,IAAY,EAAE,WAAW,MAAM,QAAQ,MAAM,SAAS,GAAoB,QAAiC;AACxI,SAAO,EAAE,MAAM,cAAc,IAAI,WAAW,MAAM,QAAQ,MAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC,GAAI,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AACnI;AAKO,SAAS,cAAc,IAAY,EAAE,YAAY,OAAO,OAAO,QAAQ,GAAG,OAAO,GAAkC;AACxH,SAAO;AAAA,IACL,MAAM;AAAA,IAAY;AAAA,IAAI,GAAG;AAAA,IACzB,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,IACnC,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,IACzB,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,IACzB,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B;AACF;AAEO,SAAS,WAAW,IAAY,EAAE,QAAQ,YAAY,YAAY,GAA0B;AACjG,SAAO,EAAE,MAAM,SAAS,IAAI,QAAQ,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC,GAAI,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC,EAAG;AACrH;AAEA,IAAM,oBAA6D;AAAA,EACjE,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,cAAc;AAChB;AAEO,SAAS,aAAa,MAAiB,QAAgB,SAAyC;AACrG,QAAM,OAAO,YAAY,aAAa,eAAe,KAAK,aAAa,KAAK,IAAI,IAAI,SAAS,MAAM,IAAI;AACvG,SAAO,EAAE,GAAG,MAAM,QAAQ,kBAAkB,OAAO,GAAG,SAAS,QAAQ,iBAAiB,YAAY,MAAM,EAAE,QAAQ,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC,EAAG;AAChJ;AAEO,SAAS,YAAY,MAAiB,MAA+B;AAC1E,SAAO,aAAa,MAAM,KAAK,QAAQ,KAAK,OAAO;AACrD;AAUO,SAAS,YAAY,IAAY,EAAE,MAAM,WAAW,MAAM,YAAY,OAAO,GAA6B;AAC/G,SAAO;AAAA,IACL,MAAM;AAAA,IAAQ;AAAA,IAAI;AAAA,IAAM,UAAU,aAAa,MAAM,MAAM,SAAS;AAAA,IAAG;AAAA,IAAM,QAAQ;AAAA,IAAW,QAAQ;AAAA,IAAI,iBAAiB;AAAA,IAC7H,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,IACnC,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,IACjC,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B;AACF;AAGO,SAAS,aAAa,IAAY,MAAoB,QAA4B;AACvF,SAAO,YAAY,YAAY,IAAI,EAAE,GAAG,MAAM,OAAO,CAAC,GAAG,IAAI;AAC/D;AAQO,SAAS,WAAW,SAAwF;AACjH,QAAM,QAAQ,iBAAiB,KAAK,OAAO;AAC3C,SAAO,EAAE,QAAQ,QAAQ,WAAW,cAAc,IAAI,YAAY,aAAa,GAAI,QAAQ,EAAE,WAAW,OAAO,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,EAAG;AACnI;;;ACyQO,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;;;ACrYO,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;;;ACkDA,IAAM,eAAe,CAAC,eAAe,gBAAgB,mBAAmB;AAEjE,SAAS,SAAS,QAAqB,QAAkC;AAC9E,QAAM,OAAoB,EAAE,GAAG,OAAO;AACtC,aAAW,SAAS,cAAc;AAChC,UAAM,WAAW,OAAO,KAAK;AAC7B,QAAI,aAAa,OAAW,MAAK,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK;AAAA,EACnE;AACA,MAAI,OAAO,cAAc;AACvB,UAAM,EAAE,QAAQ,SAAS,IAAI,OAAO;AACpC,SAAK,eAAe,EAAE,GAAG,OAAO,cAAc,CAAC,QAAQ,IAAI,OAAO,eAAe,QAAQ,KAAK,KAAK,OAAO;AAAA,EAC5G;AACA,SAAO;AACT;AAeO,SAAS,gBAAgB,OAAqB,QAAmC;AACtF,QAAM,OAAqB,EAAE,GAAG,OAAO,QAAQ,SAAS,MAAM,QAAQ,MAAM,EAAE;AAC9E,MAAI,OAAO,YAAY;AACrB,SAAK,aAAa,EAAE,GAAG,MAAM,YAAY,CAAC,OAAO,UAAU,GAAG,SAAS,MAAM,aAAa,OAAO,UAAU,KAAK,CAAC,GAAG,MAAM,EAAE;AAC5H,WAAO;AAAA,EACT;AACA,MAAI,OAAO,gBAAgB,OAAW,MAAK,mBAAmB,OAAO;AAGrE,MAAI,OAAO,kBAAkB,UAAa,OAAO,gBAAgB,EAAG,MAAK,gBAAgB,OAAO;AAChG,SAAO;AACT;AAGO,SAAS,WAAW,QAA8B;AACvD,SAAO,OAAO,gBAAgB,UAAa,OAAO,iBAAiB,UAAa,OAAO,sBAAsB,UACxG,OAAO,KAAK,OAAO,gBAAgB,CAAC,CAAC,EAAE,SAAS;AACvD;AASO,SAAS,UAAU,OAAgC;AACxD,QAAM,cAAc,mBAAmB,KAAK;AAC5C,SAAO;AAAA,IACL,QAAQ,MAAM;AAAA,IACd,GAAI,MAAM,aAAa,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;AAAA,IAC3D,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,EACvC;AACF;AASO,SAAS,mBAAmB,OAA+E;AAChH,MAAI,MAAM,qBAAqB,UAAa,MAAM,kBAAkB,UAAa,MAAM,iBAAiB,EAAG,QAAO;AAClH,SAAO,EAAE,YAAY,MAAM,kBAAkB,cAAc,MAAM,cAAc;AACjF;;;AC9GO,SAAS,cAAiB,OAAqB,OAAqC;AACzF,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,IAAK,KAAI,MAAM,MAAM,CAAC,CAAC,EAAG,QAAO;AACxE,SAAO;AACT;AAEO,SAAS,UAAa,OAAqB,OAAe,MAAc;AAC7E,QAAM,OAAO,MAAM,MAAM;AACzB,OAAK,KAAK,IAAI;AACd,SAAO;AACT;AAGA,SAAS,UAAU,QAAiC,OAAqC;AACvF,QAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,SAAO,MAAM,SAAS,UAAU,CAAC,GAAG,OAAO,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK;AAC3F;AAEO,SAAS,OAA4B,MAAS,MAAuC;AAC1F,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,KAAK,IAAI,KAAK,MAAM,EAAE,CAAC,GAAG,QAAQ,KAAK,SAAS,EAAE;AACrG;AAEO,SAAS,WAAW,MAAiB,MAA6B;AACvE,QAAM,QAAQ,KAAK,OAAO,IAAI;AAC9B,MAAI,MAAM,SAAS,WAAY,OAAM,IAAI,MAAM,SAAS,IAAI,oBAAoB;AAChF,SAAO;AACT;AAEO,SAAS,WAAW,MAAiB,MAAqC;AAC/E,SAAO,SAAS,OAAO,KAAK,SAAS,WAAW,MAAM,IAAI,EAAE;AAC9D;AAEA,SAAS,YAAiC,MAAS,MAAc,UAAuC;AACtG,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,MAAM,EAAE,GAAG,WAAW,MAAM,IAAI,GAAG,SAAS,CAAC,EAAE;AAClG;AAEO,SAAS,YAAiC,MAAS,MAAY,OAAe,OAAyB;AAC5G,MAAI,SAAS,KAAM,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,OAAO,KAAK,EAAE;AAClF,SAAO,YAAY,MAAM,MAAM,UAAU,WAAW,MAAM,IAAI,EAAE,UAAU,OAAO,KAAK,CAAC;AACzF;AAEO,SAAS,WAAgC,MAAS,MAAY,MAAwC;AAC3G,MAAI,SAAS,KAAM,QAAO,OAAO,MAAM,IAAI;AAC3C,QAAM,WAAW,CAAC,GAAG,WAAW,MAAM,IAAI,EAAE,UAAU,KAAK,IAAI,KAAK,MAAM,EAAE,CAAC;AAC7E,SAAO,EAAE,GAAG,YAAY,MAAM,MAAM,QAAQ,GAAG,QAAQ,KAAK,SAAS,EAAE;AACzE;AAEA,SAAS,YAAY,OAA8B;AACjD,UAAQ,MAAM,SAAS,aAAa,MAAM,SAAS,eAAe,MAAM;AAC1E;AAEO,SAAS,OAA+B,OAAa;AAC1D,SAAO,YAAY,KAAK,IAAI,EAAE,GAAG,OAAO,WAAW,MAAM,IAAI;AAC/D;AAOO,SAAS,SAA8B,MAAS,MAAY,MAAiB;AAClF,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,MAAI,CAAC,OAAO,KAAK,CAAC,GAAG,MAAM,MAAM,QAAQ,YAAY,CAAC,CAAC,EAAG,QAAO;AACjE,MAAI,SAAS,KAAM,QAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,GAAG,MAAO,MAAM,OAAO,IAAI,OAAO,CAAC,CAAE,EAAE;AACrG,SAAO,YAAY,MAAM,MAAM,WAAW,MAAM,IAAI,EAAE,SAAS,IAAI,CAAC,GAAG,MAAO,MAAM,OAAO,IAAI,OAAO,CAAC,CAAE,CAAC;AAC5G;AAGO,SAAS,aAAkC,MAAS,MAAY,MAAwC;AAC7G,QAAM,OAAO,WAAW,MAAM,MAAM,IAAI;AACxC,SAAO,SAAS,MAAM,MAAM,cAAc,WAAW,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,SAAS,OAAO,CAAC;AAC9F;AAQO,SAAS,aAAkC,MAAS,YAAoB,QAA8B;AAC3G,QAAM,WAAW,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU;AACvG,MAAI,YAAY,EAAG,QAAO,CAAC,MAAM,QAAQ;AACzC,QAAM,QAAQ,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,WAAW,cAAc,EAAE,eAAe,WAAW;AAC7H,QAAM,OAAO,KAAK,OAAO,KAAK;AAC9B,MAAI,MAAM,SAAS,QAAQ;AACzB,UAAM,QAAQ,cAAc,KAAK,IAAI;AAAA,MACnC;AAAA,MAAY,OAAO,KAAK,SAAS;AAAA,MAAQ,QAAQ;AAAA,MAAW,UAAU,CAAC;AAAA,MAAG,QAAQ;AAAA,MAAI,YAAY,KAAK;AAAA,MAAY,QAAQ,KAAK;AAAA,IAClI,CAAC;AACD,WAAO,CAAC,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,OAAO,KAAK,EAAE,GAAG,KAAK;AAAA,EAC1E;AACA,QAAM,OAAO,OAAO,MAAM,CAAC,OAAO,cAAc,IAAI,EAAE,YAAY,OAAO,IAAI,QAAQ,WAAW,UAAU,CAAC,GAAG,QAAQ,IAAI,OAAO,CAAC,CAAC;AACnI,SAAO,CAAC,MAAM,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,CAAC;AACvG;AAEO,SAAS,eAAoC,MAAS,YAAoB,QAA4B,QAAoD;AAC/J,QAAM,CAAC,MAAM,IAAI,IAAI,aAAa,MAAM,YAAY,MAAM;AAC1D,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,MAAM,OAAO,WAAW,MAAM,IAAI,CAAC,CAAC,EAAE;AACzF;AAGO,SAAS,OAA4B,MAAS,YAAgC,QAA4B;AAC/G,SAAO,aAAa,aAAa,MAAM,YAAY,MAAM,IAAI,CAAC,MAAM,IAAI;AAC1E;AAEO,SAAS,MAA2B,MAASC,OAAc,QAAiB,WAAoB,YAAwB;AAC7H,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,YAAY,MAAM;AACtD,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,YAAY,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO;AACjE,QAAM,OAAO,OAAO,SAAS;AAC7B,MAAI,MAAM,SAAS,cAAc,KAAK,aAAa,KAAK,cAAc,WAAW;AAC/E,WAAO,YAAY,QAAQ,MAAM,WAAW,EAAE,GAAG,MAAM,MAAM,KAAK,OAAOA,MAAK,CAAC;AAAA,EACjF;AACA,SAAO,aAAa,QAAQ,MAAM,CAAC,QAAQ;AAAA,IACzC,MAAM;AAAA,IAAY;AAAA,IAAI,MAAAA;AAAA,IAAM,WAAW;AAAA,IACvC,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,IACjC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,EACrC,EAAE;AACJ;AAGO,SAAS,aAAkC,MAAS,MAAoB;AAC7E,QAAM,OAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAC/C,QAAM,QAAQ,WAAW,MAAM,SAAS,UAAU,KAAK,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI;AACnF,MAAI,MAAM,SAAS,QAAS,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,KAAK,OAAO,SAAS,GAAG,KAAK,EAAE;AAC5G,SAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,QAAQ,KAAK,GAAG,QAAQ,KAAK,SAAS,EAAE;AAC7E;AAEA,SAAS,WAAmC,OAAU,aAAyB;AAC7E,SAAO,eAAe,MAAM,SAAS,UAAU,MAAM,WAAW,YAAY,EAAE,GAAG,OAAO,QAAQ,cAAc,IAAI,OAAO,KAAK;AAChI;AAEA,SAAS,cAAc,OAAsB,KAA2C;AACtF,QAAM,WAAW,MAAM,SAAS,IAAI,CAAC,MAAM,WAAW,GAAG,QAAQ,IAAI,CAAC;AACtE,QAAM,SAAS,OAAO,MAAM,WAAW,YAAY,MAAM,MAAM;AAC/D,SAAO,WAAW,MAAM,UAAU,SAAS,MAAM,CAAC,GAAG,MAAM,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,QAAQ,EAAE,GAAG,OAAO,QAAQ,SAAS;AAC7H;AAOO,SAAS,gBAAqC,MAAS,KAA+B;AAC3F,QAAM,SAAS,KAAK,OAAO,IAAI,CAAC,MAAO,EAAE,SAAS,aAAa,cAAc,GAAG,GAAG,IAAI,WAAW,GAAG,QAAQ,IAAI,CAAE;AACnH,SAAO,OAAO,MAAM,CAAC,GAAG,MAAM,MAAM,KAAK,OAAO,CAAC,CAAC,IAAI,OAAO,EAAE,GAAG,MAAM,OAAO;AACjF;;;ACtIO,IAAM,qBAAuC,EAAE,QAAQ,CAAC,GAAG,QAAQ,EAAE;AAI5E,SAAS,mBAAmB,OAAqB,QAAuC;AACtF,SAAO,MAAM,SAAS,aAAa,MAAM,WAAW,UAAU,MAAM,cAAc;AACpF;AAEA,SAAS,eAAe,OAAqB,QAAgD;AAC3F,SAAO,MAAM,SAAS,UAAU,MAAM,WAAW,cAAc,MAAM,WAAW;AAClF;AASA,SAAS,kBAAkB,QAAiC,QAAgB,WAAW,OAAe;AACpG,WAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AAC3C,UAAM,QAAQ,OAAO,CAAC;AACtB,QAAI,MAAM,SAAS,WAAW,MAAM,SAAS,cAAc,MAAM,SAAS,cAAe,YAAY,MAAM,SAAS,OAAS;AAC7H,QAAI,MAAM,WAAW,OAAQ;AAC7B,WAAO,mBAAmB,OAAO,MAAM,IAAI,IAAI;AAAA,EACjD;AACA,SAAO;AACT;AAEA,SAAS,SAAS,MAAwB,EAAE,QAAQ,SAAS,IAAI,SAAS,CAAC,EAAE,GAAsD;AAGjI,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,MAAM;AACrF,QAAM,OAAO,KAAK,OAAO,CAAC;AAC1B,QAAM,UAAU,MAAM,SAAS,aAAa,KAAK,WAAW,UAAa,KAAK,SAAS;AACvF,QAAM,OAAyB,UAC3B,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,YAAY,KAAK,IAAI,QAAQ,QAAQ,MAAM,CAAC,EAAE,IAC3F,OAAO,MAAM,CAAC,OAAO,YAAY,IAAI,QAAQ,QAAQ,MAAM,CAAC;AAChE,MAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,QAAM,KAAK,UAAU,IAAI,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,MAAM,IAAI;AAC5G,QAAM,QAAQ,OAAO,IAAI,CAAC,OAAO,MAAM,eAAe,IAAI,KAAK,SAAS,CAAC,IAAI,OAAO,MAAM,CAAC;AAC3F,SAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,OAAO,MAAM,GAAG,EAAE,GAAG,GAAG,OAAO,GAAG,KAAK,OAAO,MAAM,EAAE,CAAC,GAAG,QAAQ,KAAK,SAAS,MAAM,OAAO;AAClI;AAEA,SAAS,WAAW,MAAwB,EAAE,QAAQ,WAAW,MAAAC,MAAK,GAAoD;AACxH,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,mBAAmB,GAAG,MAAM,KAAK,EAAE,cAAc,SAAS;AACtG,QAAM,UAAU,KAAK,OAAO,CAAC;AAC7B,MAAI,SAAS,SAAS,WAAW;AAC/B,WAAO,SAAS,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,SAAS,MAAM,QAAQ,OAAOA,OAAM,WAAW,KAAK,CAAC,GAAG,MAAM,CAAC;AAAA,EACjH;AACA,SAAO,aAAa,MAAM,MAAM,CAAC,QAAQ,EAAE,MAAM,WAAW,IAAI,MAAM,WAAW,MAAAA,OAAM,WAAW,MAAM,QAAQ,UAAU,EAAE;AAC9H;AAOA,SAAS,iBAAiB,MAAwB,QAA4B,WAAsC;AAClH,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM,MAAM,cAAc,UAAa,EAAE,cAAc,WAAW;AAC/H,SAAO,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO;AACzE;AAEA,SAAS,YAAY,MAAwB,EAAE,SAAS,OAAO,GAAiD;AAC9G,MAAI,WAAW,QAAW;AACxB,UAAM,IAAI,kBAAkB,KAAK,QAAQ,MAAM;AAC/C,QAAI,KAAK,GAAG;AACV,aAAO,iBAAiB,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,eAAe,KAAK,OAAO,CAAC,EAAE,IAAI,WAAW,SAAS,MAAM,CAAC,EAAE,GAAG,MAAM;AAAA,IAC/I;AAAA,EACF;AACA,SAAO,OAAO,iBAAiB,MAAM,MAAM,GAAG,CAAC,OAAO,eAAe,IAAI,WAAW,SAAS,MAAM,CAAC;AACtG;AAIA,SAAS,YAAY,MAAwB,EAAE,QAAQ,UAAU,GAAwD;AACvH,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,mBAAmB,GAAG,MAAM,MAAM,cAAc,UAAa,EAAE,cAAc,WAAW;AACnI,SAAO,iBAAiB,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO,GAAG,QAAQ,SAAS;AAC9G;AAEA,SAAS,cAAc,MAAwB,EAAE,YAAY,OAAO,OAAO,OAAO,GAAkD;AAClI,SAAO,eAAe,MAAM,YAAY,QAAQ,CAAC,WAAW,EAAE,GAAG,OAAO,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,GAAI,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,EAAG,EAAE;AACrI;AAEA,SAAS,eAAe,MAAwB,EAAE,YAAY,SAAS,QAAQ,OAAO,OAAO,GAAmD;AAC9I,SAAO,eAAe,MAAM,YAAY,QAAQ,CAAC,WAAW;AAAA,IAC1D,GAAG;AAAA,IAAO,QAAQ;AAAA,IAAS;AAAA,IAAQ,UAAU,MAAM,SAAS,IAAI,MAAM;AAAA,IAAG,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,EACpG,EAAE;AACJ;AAEA,SAAS,aAAa,MAAwB,MAAkD;AAG9F,QAAM,SAAS,KAAK,SAAS,yBAAyB,KAAK,aAAa;AACxE,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,SAAS,SAAY,KAAK,YAAY,KAAK,MAAM;AACrF,SAAO,aAAa,QAAQ,MAAM,CAAC,QAAQ,EAAE,GAAG,YAAY,IAAI,IAAI,GAAG,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG,EAAE;AACzG;AAKA,SAAS,gBAAgB,OAAqB,MAAwC;AACpF,MAAI,MAAM,SAAS,UAAU,MAAM,WAAW,UAAW,QAAO;AAChE,SAAO,KAAK,aAAa,MAAM,eAAe,KAAK,aAAa,MAAM,eAAe,UAAa,MAAM,SAAS,KAAK;AACxH;AAEA,SAAS,WAAW,MAAwB,EAAE,MAAM,OAAO,GAAoD;AAC7G,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,KAAK,YAAY,MAAM;AAC3D,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAC/D,QAAM,UAAU,OAAO,CAAC;AACxB,MAAI,SAAS,SAAS,OAAQ,QAAO,YAAY,QAAQ,MAAM,GAAG,YAAY,SAAS,IAAI,CAAC;AAI5F,MAAI,SAAS,QAAQ,KAAK,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,KAAK,UAAU,EAAG,QAAO;AAC9H,SAAO,WAAW,QAAQ,MAAM,CAAC,OAAO,aAAa,IAAI,MAAM,MAAM,CAAC;AACxE;AAOA,SAAS,WAAW,MAAwB,EAAE,OAAO,QAAQ,UAAU,GAA4C;AACjH,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC;AACrE,QAAM,WAAW,KAAK,OAAO,CAAC;AAC9B,MAAI,UAAU,SAAS,UAAU,SAAS,cAAc,WAAW;AACjE,WAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,UAAU,MAAM,SAAS,OAAO,MAAM,CAAC,EAAE;AAAA,EACpG;AACA,SAAO,OAAO,iBAAiB,MAAM,MAAM,GAAG,CAAC,QAAQ;AAAA,IACrD,MAAM;AAAA,IAAQ;AAAA,IAAI,QAAQ;AAAA,IAAY,MAAM;AAAA,IAAO,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAAI,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC;AAAA,EACrH,EAAE;AACJ;AAGA,SAAS,SAAS,MAAwB,SAAiB,QAA8C;AACvG,QAAM,SAAS,WAAW,OAAO;AACjC,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,eAAe,GAAG,MAAM,CAAC;AACrE,QAAM,WAAW,KAAK,OAAO,CAAC;AAC9B,MAAI,UAAU,SAAS,QAAQ;AAC7B,UAAM,UAAqB,EAAE,MAAM,QAAQ,IAAI,SAAS,IAAI,GAAG,QAAQ,MAAM,IAAI,GAAI,SAAS,SAAS,EAAE,QAAQ,SAAS,OAAO,IAAI,CAAC,EAAG;AACzI,WAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,OAAO,EAAE;AAAA,EAC/D;AACA,SAAO,OAAO,MAAM,CAAC,QAAQ,EAAE,MAAM,QAAQ,IAAI,MAAM,IAAI,GAAG,OAAO,EAAE;AACzE;AAEA,SAAS,gBAAgB,MAAwB,EAAE,IAAI,YAAY,MAAM,SAAS,OAAO,QAAQ,OAAO,GAAkD;AACxJ,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAY;AAAA,IAAM;AAAA,IAAS;AAAA,IAAO,QAAQ;AAAA,IAChE,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,IAC3B,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B,EAAE;AACJ;AAEA,SAAS,eAAe,MAAwB,EAAE,IAAI,QAAQ,GAAkD;AAC9G,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,EAAE;AACxF,QAAM,UAAU,KAAK,OAAO,CAAC;AAC7B,MAAI,SAAS,SAAS,WAAY,QAAO;AACzC,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,SAAS,QAAQ,UAAU,YAAY,UAAU,WAAW,QAAQ,CAAC,EAAE;AAClI;AAEA,SAAS,eAAe,MAAwB,EAAE,MAAM,SAAS,OAAO,QAAQ,SAAS,OAAO,GAAkD;AAChJ,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAM;AAAA,IAAS;AAAA,IAAO,QAAQ,UAAU,YAAY;AAAA,IAAU,WAAW;AAAA,IAC/F,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC;AAAA,EAC7B,EAAE;AACJ;AAEA,SAAS,YAAY,MAAwB,SAAqD;AAChG,SAAO,WAAW,QAAQ,MAAM,IAAI,aAAa,MAAM,OAAO,IAAI;AACpE;AASA,SAAS,QAAQ,MAAwB,EAAE,QAAQ,QAAQ,GAAoD;AAC7G,MAAI,OAAO,iBAAiB,MAAM,MAAM;AACxC,QAAM,WAAW,YAAY,SAAS,kBAAkB,KAAK,QAAQ,QAAQ,IAAI,IAAI;AACrF,MAAI,YAAY,EAAG,QAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,QAAQ,EAAE;AAC1F,SAAO,gBAAgB,MAAM,YAAY,YAAY,YAAY,YAAY,UAAU,WAAW,IAAI;AACxG;AAIA,SAAS,eAAe,MAAwB,SAAmC;AACjF,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,aAAa,EAAE,SAAS,aAAa,EAAE,WAAW,UAAa,EAAE,SAAS,OAAO;AACxI,QAAM,YAAY,KAAK,OAAO,CAAC;AAC/B,MAAI,WAAW,SAAS,UAAW,QAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,EAAE,GAAG,WAAW,MAAM,SAAS,CAAC,EAAE;AACzH,SAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,OAAO,CAAC;AACnE;AAEA,SAAS,eAAe,MAAwB,EAAE,MAAM,OAAO,GAAgD;AAC7G,QAAM,UAAU,KAAK,uBAAuB,CAAC;AAG7C,QAAM,YAAY,cAAc,SAAS,CAAC,MAAM,EAAE,SAAS,gBAAgB;AAC3E,MAAI,OAAO;AACX,MAAI,SAAS,KAAK;AAClB,aAAW,CAAC,GAAG,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC1C,UAAM,QAAQ,KAAK,iBAAiB,UAAa,MAAM,YAAY,KAAK;AACxE,QAAI,SAAS,MAAM,SAAS,iBAAkB,QAAO,SAAS,MAAM,MAAM,SAAS,MAAM,YAAY,SAAS,MAAS;AACvH,QAAI,SAAS,MAAM,SAAS,SAAU,QAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,MAAM,OAAO,CAAC;AAC7G,QAAI,SAAS,MAAM,SAAS,aAAc,QAAO,eAAe,MAAM,MAAM,OAAO;AACnF,QAAI,WAAW,UAAa,MAAM,YAAY,OAAQ,UAAS,MAAM;AAAA,EACvE;AACA,SAAO,SAAS,QAAQ,WAAW,KAAK,eAAe,OAAO,EAAE,GAAG,MAAM,cAAc,OAAO;AAChG;AAQO,SAAS,mBAAmB,MAAwB,OAA4C;AACrG,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AACH,aAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,MAAM,MAAM,MAAM,IAAI,CAAC;AAAA,IACxE,KAAK;AACH,aAAO,MAAM,WAAW,SAAY,OAAO,SAAS,MAAM,KAAK;AAAA,IACjE,KAAK;AACH,aAAO,OAAO,SAAS,MAAM,MAAM,EAAE,GAAG,CAAC,OAAO,eAAe,IAAI,MAAM,OAAO,MAAM,MAAM,CAAC;AAAA,IAC/F,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC,KAAK;AACH,aAAO,MAAM,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,WAAW,MAAM,UAAU;AAAA,IAChF,KAAK;AACH,aAAO,aAAa,MAAM,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,cAAc,MAAM,KAAK;AAAA,IAClC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,WAAW,MAAM,KAAK;AAAA,IAC/B,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,QAAQ,MAAM,KAAK;AAAA,IAC5B,KAAK;AACH,aAAO,gBAAgB,MAAM,KAAK;AAAA,IACpC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,eAAe,MAAM,KAAK;AAAA,IACnC,KAAK;AACH,aAAO,YAAY,MAAM,KAAK;AAAA,IAChC;AACE,aAAO;AAAA,EACX;AACF;;;ACrRA,IAAM,OAAO;AACb,IAAM,WAAW;AACjB,IAAM,UAAU;AAGhB,SAAS,UAAU,OAAsC,SAAqC,CAAC,GAAoB;AACjH,MAAI,MAAM,SAAS,iBAAkB,QAAO,CAAC,QAAQ,EAAE,MAAM,QAAQ,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,WAAW,MAAM,OAAO,EAAE;AACtH,MAAI,MAAM,SAAS,gBAAgB,MAAM,OAAO;AAC9C,UAAM,EAAE,MAAM,IAAI;AAClB,WAAO,CAAC,OAAO,eAAe,GAAG,GAAG,gBAAgB,KAAK,CAAC;AAAA,EAC5D;AACA,MAAI,MAAM,SAAS,UAAU,CAAC,MAAM,KAAM,QAAO,CAAC,OAAO,YAAY,GAAG,GAAG,MAAM,SAAS,OAAO,IAAI,eAAe,CAAC;AACrH,QAAM,OAAO,MAAM,SAAS,YAAY,MAAM,SAAS,eAAe,WAAW,MAAM,SAAS,SAAS,SAAS;AAClH,SAAO,CAAC,OAAO,eAAe,GAAG,GAAG,MAAM,MAAM,OAAO;AACzD;AAEA,SAAS,WAAW,SAAmD,OAAkC;AACvG,QAAM,QAA2B,CAAC;AAClC,WAAS,IAAI,QAAQ,GAAG,IAAI,QAAQ,UAAU,QAAQ,CAAC,EAAE,SAAS,cAAc,KAAK;AACnF,UAAM,EAAE,MAAM,IAAI,QAAQ,CAAC;AAC3B,QAAI,OAAO,cAAc,OAAQ,OAAM,KAAK,KAAK;AAAA,EACnD;AACA,SAAO;AACT;AAIA,SAAS,OAAO,OAA8C;AAC5D,SAAO,MAAM,SAAS,WAAW,CAAC,MAAM,QAAQ,MAAM,SAAS,gBAAgB,OAAO;AACxF;AAEA,SAAS,WAAW,MAAwC;AAC1D,MAAI;AACF,UAAM,OAAgB,KAAK,MAAM,KAAK,IAAI;AAC1C,UAAM,SAAS,QAAQ,OAAO,SAAS,WAAY,KAAiC,SAAS;AAC7F,WAAO,OAAO,WAAW,WAAW,OAAO,KAAK,IAAI;AAAA,EACtD,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAOA,SAAS,UAAU,MAAoB,WAA6D;AAClG,QAAM,OAAO,UAAU,KAAK,CAAC,MAAM,EAAE,eAAe,KAAK,UAAU;AACnE,MAAI,KAAM,QAAO;AACjB,MAAI,KAAK,SAAS,uBAAwB,QAAO;AACjD,QAAM,QAAQ,WAAW,IAAI;AAC7B,SAAO,UAAU,SAAY,SAAY,UAAU,KAAK,CAAC,MAAM,EAAE,UAAU,KAAK;AAClF;AAEA,SAAS,SAAS,KAA4C;AAC5D,QAAM,YAAY,IAAI,OAAO,CAAC,MAA6B,UAAU,KAAK,EAAE,SAAS,UAAU;AAC/F,QAAM,cAAc,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;AAC9D,QAAM,YAAY,CAAC,GAAG,SAAS;AAC/B,QAAM,YAAY,oBAAI,IAAgC;AACtD,QAAM,SAAmB,CAAC;AAE1B,aAAW,SAAS,KAAK;AACvB,QAAI,UAAU,OAAO;AACnB,UAAI,MAAM,SAAS,SAAU,QAAO,KAAK,EAAE,IAAI,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,OAAO,eAAe,GAAG,GAAG,UAAU,MAAM,OAAO,EAAE,CAAC;AAC9I;AAAA,IACF;AACA,QAAI,MAAM,cAAc,YAAY,IAAI,MAAM,UAAU,EAAG;AAC3D,UAAM,UAAU,UAAU,OAAO,SAAS;AAC1C,QAAI,SAAS;AACX,gBAAU,OAAO,UAAU,QAAQ,OAAO,GAAG,CAAC;AAC9C,gBAAU,IAAI,QAAQ,YAAY,MAAM,UAAU;AAClD;AAAA,IACF;AACA,WAAO,KAAK,EAAE,IAAI,MAAM,WAAW,MAAM,UAAU,OAAO,CAAC,OAAO,aAAa,GAAG,GAAG,KAAK,EAAE,CAAC;AAAA,EAC/F;AAIA,aAAW,SAAS,WAAW;AAC7B,UAAM,aAAa,UAAU,IAAI,MAAM,UAAU;AACjD,UAAM,QAAQ,IAAI,OAAO,CAAC,MAAyB,EAAE,UAAU,MAAM,EAAE,eAAe,MAAM,UAAU;AACtG,WAAO,KAAK;AAAA,MACV,IAAI,MAAM;AAAA,MACV,MAAM;AAAA,MACN,OAAO,CAAC,OAAO,cAAc,GAAG,GAAG;AAAA,QACjC,YAAY,MAAM;AAAA,QAAY,OAAO,MAAM;AAAA,QAAO,QAAQ,MAAM;AAAA,QAAS,QAAQ,MAAM;AAAA,QACvF,UAAU,MAAM,IAAI,CAAC,SAAS,aAAa,GAAG,GAAG,IAAI,CAAC;AAAA,QACtD;AAAA,QAAY,OAAO,MAAM;AAAA,QAAO,OAAO,MAAM;AAAA,MAC/C,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAYO,SAAS,eACd,qBACA,aACA,cACkB;AAClB,QAAM,UAAU,uBAAuB,CAAC;AACxC,QAAM,YAAY,QAAQ,CAAC,GAAG,SAAS,eAAe,QAAQ,CAAC,IAAI;AACnE,QAAM,OAAO,YAAY,QAAQ,MAAM,CAAC,IAAI;AAC5C,QAAM,SAAS,YAAa,KAAK,CAAC,GAAG,aAAa,UAAU,YAAa;AAEzE,QAAM,SAAmB;AAAA,IACvB,GAAG,KAAK,IAAI,CAAC,OAAO,OAAO,EAAE,IAAI,MAAM,WAAW,MAAM,OAAO,KAAK,GAAG,OAAO,UAAU,OAAO,WAAW,MAAM,CAAC,CAAC,EAAE,EAAE;AAAA,IACtH,GAAG,SAAS,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,KAAK,MAAM,MAAM;AAAA,EACnE;AACA,SAAO,KAAK,CAAC,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,OAAO,EAAE,IAAK;AAE5E,MAAI,UAAW,QAAO,QAAQ,EAAE,IAAI,IAAI,MAAM,SAAS,OAAO,UAAU,SAAS,EAAE,CAAC;AAEpF,MAAI,SAAS;AACb,QAAM,KAAK,MAAM,IAAI,QAAQ;AAC7B,QAAM,SAAS,OAAO,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;AAElD,MAAI,gBAAgB,WAAW,aAAa,MAAM,EAAG,QAAO,KAAK,WAAW,GAAG,GAAG,UAAU,YAAY,CAAC,CAAC;AAE1G,QAAM,eAAe,QAAQ,OAA2B,CAAC,QAAQ,MAAO,WAAW,UAAa,EAAE,YAAY,SAAS,EAAE,YAAY,QAAS,MAAS;AACvJ,SAAO,EAAE,QAAQ,QAAQ,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC,EAAG;AACrE;;;AC/GO,IAAM,iBAA8B,EAAE,QAAQ,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,SAAS,OAAO,SAAS,CAAC,EAAE;AAI5G,IAAM,cAAc;AACpB,IAAM,iBAAiB,CAAC,eAAmC,YAAY,cAAc,EAAE;AAEvF,SAAS,cAAc,MAAmB,KAA0B;AAClE,MAAI,EAAE,OAAO,KAAK,SAAU,QAAO;AACnC,SAAO,EAAE,GAAG,MAAM,SAAS,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,MAAM,GAAG,CAAC,EAAE;AACzG;AAIA,SAAS,UAAUC,OAAsB;AACvC,SAAOA,MAAK,QAAQ,QAAQ,EAAE;AAChC;AAKA,SAAS,WAAW,MAAmB,MAAY,KAAqB;AACtE,QAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,MAAI,OAAO,OAAW,QAAO;AAC7B,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,OAAO;AACzD,QAAM,QAAQ,OAAO,CAAC;AACtB,SAAO,OAAO,OAAO,OAAO,MAAM,SAAS,aAAa,MAAM,SAAS,eAAe,MAAM,YAAY,IAAI;AAC9G;AAEA,SAAS,YAAY,MAAmB,MAAY,KAAaA,OAAc,MAA2D;AACxI,QAAM,IAAI,WAAW,MAAM,MAAM,GAAG;AACpC,QAAM,OAAO,WAAW,MAAM,IAAI,EAAE,CAAC;AACrC,MAAI,MAAM,SAAS,aAAa,MAAM,SAAS,WAAY,QAAO,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,MAAM,MAAM,KAAK,OAAOA,MAAK,CAAC;AAChI,QAAM,OAAO,aAAa,MAAM,MAAM,CAAC,OAAO,KAAK,IAAI,UAAUA,KAAI,CAAC,CAAC;AACvE,SAAO,EAAE,GAAG,MAAM,SAAS,EAAE,GAAG,KAAK,SAAS,CAAC,GAAG,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE;AAC3E;AAMA,SAAS,YAAY,MAAmB,MAAY,KAAaA,OAAc,MAAkD;AAC/H,QAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,QAAM,SAAS,WAAW,MAAM,IAAI;AACpC,QAAM,IAAI,OAAO,SAAY,KAAK,cAAc,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE;AAC1E,QAAM,WAAW,OAAO,CAAC;AACzB,QAAM,OAAO,cAAc,MAAM,GAAG;AACpC,MAAI,UAAU,SAAS,aAAa,UAAU,SAAS,YAAY;AACjE,WAAO,YAAY,MAAM,MAAM,GAAG,EAAE,GAAG,UAAU,MAAM,UAAUA,KAAI,GAAG,WAAW,MAAM,CAAC;AAAA,EAC5F;AACA,SAAO,aAAa,MAAM,MAAM,IAAI;AACtC;AAEA,SAAS,UAAU,MAAmBA,OAA2B;AAC/D,SAAO,YAAY,MAAM,MAAM,aAAaA,OAAM,CAAC,OAAO,eAAe,IAAI,SAAS,UAAUA,KAAI,CAAC,CAAC;AACxG;AAEA,SAAS,eAAe,MAAmBA,OAA2B;AACpE,SAAO,YAAY,MAAM,MAAM,aAAaA,OAAM,CAAC,IAAI,OAAO,EAAE,MAAM,WAAW,IAAI,MAAM,SAAS,MAAM,GAAG,WAAW,KAAK,EAAE;AACjI;AAEA,SAAS,cAAc,IAAYA,OAAc,WAAoB,YAAsD;AACzH,SAAO,EAAE,MAAM,YAAY,IAAI,MAAAA,OAAM,WAAW,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC,EAAG;AACxF;AAEA,SAAS,cAAc,MAAmB,EAAE,MAAAA,OAAM,WAAW,GAAyC;AACpG,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,YAAY,QAAQ,MAAM,eAAe,UAAU,GAAGA,OAAM,CAAC,IAAI,MAAM,cAAc,IAAI,GAAG,MAAM,UAAU,CAAC;AACtH;AAEA,SAAS,cAAc,MAAmB,EAAE,MAAAA,OAAM,WAAW,GAAmC;AAC9F,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,YAAY,QAAQ,MAAM,eAAe,UAAU,GAAGA,OAAM,CAAC,OAAO,cAAc,IAAI,UAAUA,KAAI,GAAG,OAAO,UAAU,CAAC;AAClI;AAEA,SAASC,cAAa,MAAmB,EAAE,IAAI,YAAY,MAAM,MAAM,WAAW,GAAoC;AACpH,QAAM,EAAE,MAAM,UAAU,IAAI,aAAa,IAAI;AAC7C,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,SAAO,aAAa,QAAQ,MAAM,CAAC,OAAO;AACxC,UAAM,OAAO,YAAY,IAAI,EAAE,MAAM,WAAW,MAAM,WAAW,CAAC;AAClE,UAAM,SAASC,WAAU,IAAI;AAG7B,WAAO,SAAS,EAAE,GAAG,MAAM,UAAU,aAAa,MAAM,KAAK,UAAU,mBAAmB,MAAM,MAAM,CAAC,GAAG,SAAS,EAAE,IAAI;AAAA,EAC3H,CAAC;AACH;AAEA,SAASA,WAAU,MAA8C;AAC/D,MAAI;AACF,UAAM,SAAkB,KAAK,MAAM,IAAI;AACvC,WAAO,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,IAAI,SAAoC;AAAA,EAC9G,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAASC,YAAW,MAAmB,EAAE,IAAI,YAAY,QAAQ,SAAS,WAAW,GAAsC;AACzH,QAAM,CAAC,QAAQ,IAAI,IAAI,OAAO,MAAM,UAAU;AAC9C,QAAM,SAAS,WAAW,QAAQ,IAAI;AACtC,QAAM,IAAI,cAAc,QAAQ,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,WAAW,aAAa,EAAE,eAAe,UAAU;AACjH,QAAM,UAAU,OAAO,CAAC;AACxB,QAAM,UAAU,UAAU,YAAY;AACtC,MAAI,SAAS,SAAS,OAAQ,QAAO,YAAY,QAAQ,MAAM,GAAG,aAAa,SAAS,QAAQ,OAAO,CAAC;AAIxG,MAAI,SAAS,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,EAAG,QAAO;AACtG,SAAO,WAAW,QAAQ,MAAM,CAAC,OAAO,aAAa,YAAY,IAAI,EAAE,MAAM,cAAc,WAAW,QAAQ,MAAM,IAAI,WAAW,CAAC,GAAG,QAAQ,OAAO,CAAC;AACzJ;AAEA,SAASC,eAAc,MAAmB,EAAE,YAAY,OAAO,MAAM,GAA2C;AAC9G,SAAO,eAAe,MAAM,YAAY,QAAW,CAAC,WAAW,EAAE,GAAG,OAAO,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,GAAI,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC,EAAG,EAAE;AACxI;AAEA,SAASC,gBAAe,MAAmB,EAAE,YAAY,SAAS,OAAO,GAA4C;AACnH,QAAM,QAAQ,KAAK,OAAO,aAAa,UAAU;AACjD,QAAM,OAAO,eAAe,MAAM,YAAY,QAAW,CAAC,WAAW;AAAA,IACnE,GAAG;AAAA,IAAO,QAAQ;AAAA,IAAS;AAAA,IAAQ,UAAU,MAAM,SAAS,IAAI,MAAM;AAAA,IAAG,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,EACpG,EAAE;AACF,SAAO,cAAc,MAAM,eAAe,UAAU,CAAC;AACvD;AAEA,SAASC,aAAY,MAAmB,EAAE,OAAO,GAAgC;AAC/E,QAAM,QAAQ,gBAAgB,KAAK,SAAS,EAAE,QAAQ,CAAC,EAAE,GAAG,MAAM;AAClE,QAAM,OAAO,EAAE,GAAG,MAAM,MAAM;AAC9B,SAAO,WAAW,MAAM,MAAM,IAAI,aAAa,MAAM,UAAU,KAAK,CAAC,IAAI;AAC3E;AAGO,SAAS,kBAAkB,MAAc,MAAsB;AACpE,QAAM,EAAE,MAAM,QAAQ,UAAU,IAAI,aAAa,IAAI;AACrD,QAAM,SAASJ,WAAU,IAAI;AAC7B,QAAM,WAAW,aAAa,QAAQ,SAAS,KAAK,UAAU,mBAAmB,QAAQ,MAAM,CAAC,IAAI,MAAM,SAAS;AACnH,SAAO,SAAS,SAAS,GAAG,SAAS,IAAI,IAAI,SAAS,MAAM,MAAM,SAAS;AAC7E;AAEA,SAASK,iBAAgB,MAAmB,EAAE,YAAY,MAAM,MAAM,cAAc,WAAW,GAA6C;AAC1I,MAAI,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU,EAAG,QAAO;AAC1F,SAAO,OAAO,MAAM,CAAC,QAAQ;AAAA,IAC3B,MAAM;AAAA,IAAY;AAAA,IAAI;AAAA,IAAY,MAAM;AAAA,IACxC,SAAS,kBAAkB,MAAM,IAAI;AAAA,IACrC,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC;AAAA,IACvC,GAAI,aAAa,EAAE,WAAW,IAAI,CAAC;AAAA,EACrC,EAAE;AACJ;AAEA,SAASC,gBAAe,MAAmB,YAAoB,QAA8D;AAC3H,QAAM,IAAI,cAAc,KAAK,QAAQ,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,eAAe,UAAU;AAChG,QAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,MAAI,OAAO,SAAS,cAAc,MAAM,WAAW,UAAW,QAAO;AACrE,SAAO,EAAE,GAAG,MAAM,QAAQ,UAAU,KAAK,QAAQ,GAAG,OAAO,KAAK,CAAC,EAAE;AACrE;AAEA,SAASC,gBAAe,MAAmB,EAAE,YAAY,UAAU,KAAK,GAA2C;AACjH,SAAOD,gBAAe,MAAM,YAAY,CAAC,WAAW;AAAA,IAClD,GAAG;AAAA,IACH,QAAQ,aAAa,SAAS,WAAW;AAAA,IACzC,WAAW;AAAA,IACX,GAAI,aAAa,iBAAiB,EAAE,SAAS,KAAK,IAAI,CAAC;AAAA,IACvD,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,EACzB,EAAE;AACJ;AAEA,SAAS,UAAU,MAAmB,EAAE,SAAS,UAAU,GAAqC;AAC9F,QAAM,SAAS,YAAY,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS,IAAI,KAAK;AAChF,QAAM,UAAU,EAAE,GAAG,MAAM,QAAQ,SAAS,KAAK;AAEjD,SAAO,UAAU,OAAO,SAAS,CAAC,OAAO,eAAe,IAAI,QAAQ,OAAO,CAAC,IAAI;AAClF;AAEA,IAAM,MAAwD,EAAE,WAAW,MAAM,aAAa,WAAW,QAAQ,SAAS;AAE1H,SAASE,SAAQ,MAAmB,EAAE,OAAO,GAAmC;AAC9E,QAAM,SAAS,gBAAgB,EAAE,GAAG,MAAM,SAAS,OAAO,aAAa,QAAQ,SAAS,CAAC,EAAE,GAAG,IAAI,MAAM,CAAC;AACzG,SAAO,WAAW,gBAAgB,OAAO,QAAQ,CAAC,OAAO,eAAe,IAAI,UAAU,cAAc,CAAC,IAAI;AAC3G;AAEA,SAAS,aAAa,MAAmB,EAAE,WAAW,MAAAV,OAAM,OAAO,GAAyC;AAC1G,QAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS;AACzD,MAAI,QAAQ;AAEV,UAAM,OAAO,KAAK,OAAO,OAAO,CAAC,MAAM,MAAM,MAAM;AACnD,UAAM,KAAK,KAAK,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM;AAC1C,UAAM,SAAS,KAAK,IAAI,KAAK,SAAS;AACtC,WAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,MAAM,GAAG,MAAM,GAAG,EAAE,IAAI,WAAW,MAAAA,OAAM,QAAQ,KAAK,GAAG,GAAG,KAAK,MAAM,MAAM,CAAC,EAAE;AAAA,EACrH;AACA,MAAI,CAAC,OAAQ,QAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,GAAG,KAAK,QAAQ,EAAE,IAAI,WAAW,MAAAA,MAAK,CAAC,EAAE;AACjF,MAAI,CAAC,OAAO,WAAY,QAAO;AAC/B,SAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAO,MAAM,SAAS,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,KAAK,IAAI,CAAE,EAAE;AACpG;AAEA,SAAS,SAAS,MAAmB,EAAE,UAAU,GAA8C;AAC7F,QAAM,SAAS,KAAK,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS;AACzD,MAAI,CAAC,UAAU,OAAO,WAAY,QAAO;AACzC,SAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAO,MAAM,SAAS,EAAE,GAAG,GAAG,YAAY,KAAK,IAAI,CAAE,EAAE;AACpG;AAGA,SAAS,eAAe,MAAmB,OAAgD;AACzF,SAAO,aAAa,eAAe,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,eAAe,IAAI,QAAQ,MAAM,IAAI,CAAC;AACvG;AAEA,SAAS,eAAe,MAAmB,EAAE,UAAU,GAAuC;AAC5F,QAAM,SAAS,KAAK,OAAO,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS;AAC3D,SAAO,OAAO,WAAW,KAAK,OAAO,SAAS,OAAO,EAAE,GAAG,MAAM,OAAO;AACzE;AAQO,SAAS,cAAc,MAAmB,OAAkC;AACjF,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK;AAAe,aAAO,OAAO,MAAM,CAAC,OAAO,eAAe,IAAI,UAAU,WAAW,MAAM,OAAO,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;AAAA,IACtJ,KAAK;AAAc,aAAO,UAAU,MAAM,KAAK;AAAA,IAC/C,KAAK;AAAY,aAAOU,SAAQ,MAAM,KAAK;AAAA,IAC3C,KAAK;AAAc,aAAO,eAAe,MAAM,MAAM,IAAI;AAAA,IACzD,KAAK;AAAQ,aAAO,UAAU,MAAM,MAAM,IAAI;AAAA,IAC9C,KAAK;AAAkB,aAAO,cAAc,MAAM,KAAK;AAAA,IACvD,KAAK;AAAY,aAAO,cAAc,MAAM,KAAK;AAAA,IACjD,KAAK;AAAa,aAAOT,cAAa,MAAM,KAAK;AAAA,IACjD,KAAK;AAAe,aAAOE,YAAW,MAAM,KAAK;AAAA,IACjD,KAAK;AAAoB,aAAOC,eAAc,MAAM,KAAK;AAAA,IACzD,KAAK;AAAqB,aAAOC,gBAAe,MAAM,KAAK;AAAA,IAC3D,KAAK;AAAS,aAAOC,aAAY,MAAM,KAAK;AAAA,IAC5C,KAAK;AAAkB,aAAO,aAAa,MAAM,KAAK;AAAA,IACtD,KAAK;AAAmB,aAAO,eAAe,MAAM,KAAK;AAAA,IACzD,KAAK;AAAuB,aAAO,SAAS,MAAM,KAAK;AAAA,IACvD,KAAK;AAAqB,aAAO,eAAe,MAAM,KAAK;AAAA,IAC3D,KAAK;AAAuB,aAAO,OAAO,eAAe,MAAM,KAAK,GAAG,CAAC,OAAO,eAAe,IAAI,UAAU,GAAG,MAAM,IAAI,qBAAkB,CAAC;AAAA,IAC5I,KAAK;AAAS,aAAO,aAAa,MAAM,MAAM,CAAC,OAAO,eAAe,IAAI,SAAS,MAAM,OAAO,CAAC;AAAA,IAChG,KAAK;AAAsB,aAAOC,iBAAgB,MAAM,KAAK;AAAA,IAC7D,KAAK;AAAoB,aAAOE,gBAAe,MAAM,KAAK;AAAA,IAC1D,KAAK;AAAsB,aAAOD,gBAAe,MAAM,MAAM,YAAY,CAAC,WAAW,EAAE,GAAG,OAAO,QAAQ,YAAY,EAAE;AAAA,IACvH;AAAS,aAAO;AAAA,EAClB;AACF;AAGO,SAAS,cAAc,QAAiC,OAAoB,gBAA6B;AAC9G,SAAO,OAAO,OAAO,eAAe,IAAI;AAC1C;;;AChRO,IAAM,aAAyB,CAAC;AAQhC,SAAS,WAAW,MAAkBG,OAA0B;AACrE,SAAO,CAAC,GAAG,MAAMA,KAAI;AACvB;AAGO,SAAS,UAAU,MAA2C;AACnE,QAAM,CAACA,OAAM,GAAG,IAAI,IAAI;AACxB,SAAOA,UAAS,SAAY,SAAY,EAAE,MAAAA,OAAM,KAAK;AACvD;AAMO,SAAS,aAAa,MAA2C;AACtE,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,KAAK,KAAK,SAAS,CAAC,GAAG,MAAM,KAAK,MAAM,GAAG,EAAE,EAAE;AAChE;AAOO,SAAS,UAAU,MAA2C;AACnE,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,SAAO,EAAE,MAAM,KAAK,KAAK,IAAI,GAAG,MAAM,WAAW;AACnD;AAGO,SAAS,aAAaA,OAAc,OAAuB;AAChE,SAAO,QAAQ,GAAGA,KAAI;AAAA,EAAK,KAAK,KAAKA;AACvC;;;ACnCO,IAAM,UAAoB,EAAE,MAAM,MAAM,SAAS,KAAK;AAQ7D,IAAM,cAAc,oBAAI,IAA4B;AAAA,EAClD;AAAA,EAAsB;AAAA,EAA0B;AAAA,EAA0B;AAAA,EAAmB;AAAA,EAC7F;AAAA,EAAiB;AAAA,EAAsB;AAAA,EAAoB;AAAA,EAAqB;AAAA,EAChF;AACF,CAAC;AAID,SAAS,OAAO,MAAgB,OAAmC;AACjE,MAAI,KAAK,YAAY,QAAQ,CAAC,YAAY,IAAI,MAAM,IAA8B,EAAG,QAAO;AAC5F,QAAM,SAAS,YAAY,QAAQ,MAAM,SAAS;AAClD,SAAO,WAAW,UAAa,WAAW,KAAK;AACjD;AAEA,SAAS,SAAS,MAAyB,MAAmC;AAC5E,SAAO,KAAK,SAAS,KAAK,KAAK,QAAQ,KAAK,YAAY,KAAK,KAAK,UAAU,OAAO,EAAE,GAAG,MAAM,KAAK;AACrG;AAOO,SAAS,WAAW,MAAwB,MAAgB,OAA6C;AAC9G,QAAM,OAAO,EAAE,MAAM,KAAK;AAC1B,MAAI,MAAM,SAAS,wBAAwB;AACzC,WAAO,SAAS,EAAE,MAAM,mBAAmB,MAAM,KAAK,GAAG,KAAK,GAAG,EAAE,MAAM,MAAM,QAAQ,SAAS,KAAK,CAAC;AAAA,EACxG;AACA,MAAI,OAAO,MAAM,KAAK,GAAG;AACvB,WAAO,MAAM,SAAS,uBAAuB,SAAS,MAAM,EAAE,GAAG,MAAM,SAAS,KAAK,CAAC,IAAI;AAAA,EAC5F;AACA,QAAM,OAAO,EAAE,MAAM,mBAAmB,MAAM,KAAK,GAAG,KAAK;AAC3D,SAAO,MAAM,SAAS,wBAAwB,MAAM,WAAW,KAAK,OAAO,SAAS,MAAM,EAAE,GAAG,MAAM,MAAM,KAAK,CAAC,IAAI;AACvH;AAOO,SAAS,SAAS,MAAwB,MAAmC;AAClF,MAAI,KAAK,SAAS,KAAM,QAAO,EAAE,MAAM,KAAK;AAC5C,SAAO;AAAA,IACL,MAAM,mBAAmB,MAAM,EAAE,MAAM,sBAAsB,QAAQ,KAAK,MAAM,SAAS,UAAU,CAAC;AAAA,IACpG,MAAM,EAAE,MAAM,MAAM,SAAS,KAAK,KAAK;AAAA,EACzC;AACF;;;AC3DO,SAAS,gBAAgB,QAA0C;AACxE,SAAO,OAAO,KAAK,CAAC,MAAM,EAAE,SAAS,cAAc,EAAE,SAAS,UAAU,EAAE,SAAS,UAAU;AAC/F;;;ACTO,SAAS,kBAAkB,OAAe,QAAyB;AACxE,SAAO,SAAS,YAAY,KAAK,UAAO,MAAM,KAAK,YAAY,KAAK;AACtE;;;ACYA,IAAM,eAAe,CAAC,MAA8B,EAAE,SAAS,QAAQ,YAAY,IAAI,EAAE,MAAM;AAC/F,IAAM,SAAS,CAAC,MAA8B,EAAE,WAAW,aAAa,EAAE,WAAW;AAGrF,IAAM,aAA8B;AAAA,EAClC,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,aAAa;AAAA,EAC5C,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,SAAS;AAAA,EACtC,CAAC,eAAe,YAAY;AAAA;AAAA,EAE5B,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,mBAAmB,EAAE,SAAS,MAAM;AAAA,EACrE,CAAC,cAAc,CAAC,MAAM,EAAE,WAAW,WAAW;AAChD;AAEA,IAAM,gBAAiC;AAAA,EACrC,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,aAAa;AAAA,EAC5C,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,iBAAiB,EAAE,SAAS,IAAI;AAAA,EACjE,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,QAAQ,OAAO,CAAC,CAAC;AAAA,EACnD,CAAC,QAAQ,MAAM;AAAA,EACf,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,eAAe;AAAA,EAChD,CAAC,cAAc,CAAC,MAAM,EAAE,WAAW,WAAW;AAChD;AAGO,SAAS,eAAe,MAAqB,YAA8B,QAAyB;AACzG,QAAM,QAAQ,cAAc,YAAY,gBAAgB;AACxD,SAAO,MAAM,OAAO,CAAC,CAAC,EAAE,OAAO,MAAM,QAAQ,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,MAAM,MAAM;AAC9E;AAMO,SAAS,WAAW,MAAqD;AAC9E,SAAO,KAAK,WAAW,cAAc,eAAe;AACtD;AAOO,SAAS,eAAe,QAAkD;AAC/E,MAAI,WAAW,cAAc,WAAW,OAAQ,QAAO;AACvD,MAAI,WAAW,aAAc,QAAO;AACpC,SAAO;AACT;AAGO,SAAS,YAAY,MAA8B;AACxD,SAAO,aAAa,IAAI;AAC1B;;;ACsBA,IAAM,SAAS,CAAC,KAAwB,YACtC,IAAI,IAAI,CAAC,OAAO;AACd,QAAM,QAAQ,SAAS,IAAI,EAAE;AAC7B,SAAO,UAAU,SAAY,KAAK,QAAQ,EAAE,MAAM,CAAC;AACrD,CAAC;AAGH,IAAM,YAAY,CAAC,SAA6C,QAAQ,SAAS,MAAM,OAAO;AAGvF,IAAM,aAAa,CAAC,WAAoD,SAAS,CAAC,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AAEnH,IAAM,UAAU,CAAC,UAAgD,OAAO,SAAS,iBAAiB,KAAK,IAAI;AAMpG,SAAS,YAAY,MAAsB,UAA0B,CAAC,GAAgB;AAC3F,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,YAAY,KAAK,aAAa,KAAK,UAAU,UAAU,SAAS,KAAK,YAAY;AACvF,SAAO;AAAA,IACL,YAAY,eAAe,MAAM,MAAM;AAAA,IACvC,MAAM,KAAK,SAAS,SAAS,SAAS,KAAK,MAAM,QAAQ;AAAA,IACzD,QAAQ,eAAe,IAAI;AAAA,IAC3B,SAAS,cAAc,IAAI;AAAA,IAC3B,UAAU,cAAc,IAAI;AAAA,IAC5B,WAAW,cAAc,KAAK,gBAAgB;AAAA,IAC9C,YAAY,KAAK,SAAS,QAAQ,QAAQ,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,KAAK,QAAQ,GAAG,eAAe;AAAA,IACrG,OAAO,WAAW,WAAW,KAAK;AAAA,IAClC,UAAU,WAAW,UAAU,aAC3B,EAAE,MAAM,UAAU,UAAU,YAAY,GAAG,OAAO,QAAQ,UAAU,aAAa,EAAE,IACnF;AAAA,IACJ,WAAW,WAAW,UAAU,cAC5B,EAAE,OAAO,QAAQ,UAAU,aAAa,GAAG,SAAS,UAAU,UAAU,KAAK,IAC7E;AAAA,IACJ,UAAU,WAAW,eAAe,SAChC,EAAE,OAAO,iBAAiB,UAAU,aAAa,GAAG,QAAQ,UAAU,UAAU,aAAa,IAC7F;AAAA,IACJ,WAAW,KAAK,WAAW,SAAS,OAAO,KAAK,WAAW,QAAQ,OAAO,IAAI;AAAA,IAC9E,iBAAiB,KAAK,WAAW,mBAAmB,KAAK,mBAAmB;AAAA,IAC5E,gBAAgB,KAAK,gBAAgB,SAAS,KAAK,iBAAiB;AAAA,IACpE,cAAc,OAAO,KAAK,cAAc,QAAQ,OAAO;AAAA,IACvD,SAAS,eAAe,MAAM,QAAQ,cAAc,SAAS,YAAY,OAAO;AAAA,IAChF,MAAM,WAAW,IAAI;AAAA,IACrB,aAAa,YAAY,IAAI;AAAA,EAC/B;AACF;;;AC7HA,SAAS,UAAU,OAAyB,IAA+B;AACzE,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,OAAO,GAAI,QAAO;AAC3B,UAAM,SAAS,UAAU,KAAK,YAAY,CAAC,GAAG,EAAE;AAChD,QAAI,OAAQ,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,KAAwB,OAAmC;AACpF,SAAO,IAAI,IAAI,CAAC,OAAO;AACrB,UAAM,OAAO,UAAU,OAAO,EAAE;AAChC,WAAO,OAAO,cAAc,IAAI,IAAI;AAAA,EACtC,CAAC;AACH;AAOO,SAAS,iBAAiB,YAAwE;AACvG,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,UAAU,WAAW,WAAW,IAAI,mBAAmB,GAAG,WAAW,MAAM;AACjF,SAAO,GAAG,OAAO,yCAAyC,WAAW,IAAI,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAC9G;AAOO,SAAS,qBAAqB,UAA6B,UAAU,aAAqB;AAC/F,SAAO,GAAG,OAAO,qCAAqC,SAAS,KAAK,IAAI,CAAC;AAC3E;AAeO,SAAS,cAAc,OAAe,QAAuC;AAClF,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,CAAC,KAAM,QAAO;AAClB,SAAO,EAAE,OAAO,MAAM,aAAa,MAAM,QAAQ,QAAQ,KAAK,IAAI,SAAS,MAAM,MAAM,KAAK;AAC9F;","names":["import_uuid","text","text","oneLine","text","lines","text","text","text","text","announceTool","parseArgs","settleTool","startSubagent","finishSubagent","reportUsage","requestApproval","settleApproval","decideApproval","endTurn","text"]}