@mu-crew/mu 4.1.1 → 4.2.0

package/dist/index.js

@@ -2,7 +2,7 @@ import { createRequire as __muCreateRequire } from "node:module"; const require
 import {
   STALLED_TOOL_MS,
   loadDashboard
-} from "./chunk-LBBZAG5C.js";
+} from "./chunk-UL2QE43S.js";
 import {
   AGENT_STATE_GLYPH,
   DEFAULT_CTL_STUCK_AFTER_MS,
@@ -64,7 +64,7 @@ import {
   transitionActionReceipt,
   waitForEvents,
   waitWithActions
-} from "./chunk-B74N2EAS.js";
+} from "./chunk-3ZLI6YTV.js";
 import {
   COURSE_CHECK_AGE_MS,
   COURSE_CHECK_CLOSED,
@@ -137,7 +137,7 @@ import {
   syncEnabled,
   syncPass,
   verifyAgainstManifest
-} from "./chunk-DEYBQDTO.js";
+} from "./chunk-RVWNQLFE.js";
 import {
   AgentAbortNeedsCtlError,
   AgentAbortTimeoutError,
@@ -164,6 +164,11 @@ import {
   CAPTURE_TRIGGER_DDL,
   CAPTURE_VERSION,
   CURRENT_SCHEMA_VERSION,
+  CarrierJobKeptError,
+  CarrierJobUnresolvedError,
+  CarrierJobUnstoppedError,
+  CarrierStopFailedError,
+  CarrierStopRefusedError,
   ClaimerNotRegisteredError,
   CloseNeedsEvidenceError,
   CrossWorkstreamEdgeError,
@@ -178,11 +183,13 @@ import {
   GroupNotFoundError,
   HOST_ENV_KEYS,
   HOST_PLACEHOLDERS,
+  HOST_TRANSPORTS,
   HlcOverflowError,
   HlcParseError,
   HostChannelBusyError,
   HostCheckFailedError,
   HostExistsError,
+  HostHandbackError,
   HostInUseError,
   HostNotFoundError,
   HostProfileError,
@@ -190,6 +197,10 @@ import {
   HostTemplateError,
   HumanTaskError,
   InvalidSubstateError,
+  JOB_HANDLE_RE,
+  LeaseJobInvalidError,
+  LeaseJobTimeoutError,
+  LeaseJobUnreadableError,
   LogKindReservedError,
   MACHINE_LOCAL_ENTITIES,
   MACHINE_LOCAL_TABLES,
@@ -252,6 +263,7 @@ import {
   WorktreeHeldError,
   WorktreePathNotEmptyError,
   WorktreeVcsRequiredError,
+  abandonCarrierJob,
   abortAgent,
   acceptTask,
   activeMux,
@@ -267,6 +279,7 @@ import {
   assertRevision,
   assertValidPaneId,
   beginWait,
+  bindCarrierJobAgent,
   bindHostChannel,
   capture,
   captureTriggersCurrent,
@@ -294,12 +307,16 @@ import {
   envVarNameForCli,
   expandHostTemplate,
   expectsCtl,
+  fillCarrierJob,
   finishDelegate,
   forgetWorktree,
   formatHlc,
   formatPair,
   getAgent,
   getAgentByPane,
+  getCarrierJob,
+  getCarrierJobByAgent,
+  getCarrierJobByName,
   getDelegateCall,
   getHost,
   getPrerequisites,
@@ -310,6 +327,7 @@ import {
   getWorktreeAt,
   getWorktreeFor,
   hostEnvWords,
+  hostMuleStarter,
   hostStarter,
   idFromTitle,
   idFromTitleVerbose,
@@ -328,6 +346,8 @@ import {
   latestSeq,
   listAgents,
   listBlocked,
+  listCarrierJobs,
+  listCarrierJobsByName,
   listDelegates,
   listDelegatesOf,
   listGoals,
@@ -347,11 +367,13 @@ import {
   listWorktrees,
   locksDir,
   mapLegacyStatus,
+  markCarrierLaunch,
   markDelegate,
   murmurAvailable,
   muxByName,
   mux_exports,
   nextHlc,
+  noteCarrierJob,
   observationFromReading,
   observeAgentStates,
   openDb,
@@ -360,6 +382,7 @@ import {
   parkTask,
   parseHlc,
   parseVerdict,
+  placeholderUses,
   previewClose,
   readAgent,
   readAgentStates,
@@ -370,11 +393,13 @@ import {
   receiveHlc,
   reclaimWorktreePath,
   reconcile,
+  recordCarrierPane,
   recordCursors,
   recoveriesFor,
   registerDelegateCall,
   registerOwnedWait,
   registerWorktree,
+  releaseCarrierJob,
   releaseHostChannel,
   releaseHostChannelsForAgent,
   releaseTask,
@@ -383,6 +408,7 @@ import {
   removeHost,
   removeWorktree,
   reparentTask,
+  reserveCarrierJob,
   reserveHostChannel,
   resetCommandResolverForTests,
   resetMux,
@@ -393,6 +419,7 @@ import {
   resolveCliCommandWithSource,
   resolvePair,
   runHostTemplate,
+  runStop,
   selectRemoteRecovery,
   selectTaskNotes,
   sendToAgent,
@@ -430,7 +457,7 @@ import {
   worktreePath,
   worktreeState,
   worktreesRoot
-} from "./chunk-L7I3BLXP.js";
+} from "./chunk-SFV5RPZW.js";
 import {
   defaultStateDir
 } from "./chunk-PZ5GOCWH.js";
@@ -581,6 +608,11 @@ export {
   COURSE_CHECK_AGE_MS,
   COURSE_CHECK_CLOSED,
   CURRENT_SCHEMA_VERSION,
+  CarrierJobKeptError,
+  CarrierJobUnresolvedError,
+  CarrierJobUnstoppedError,
+  CarrierStopFailedError,
+  CarrierStopRefusedError,
   ClaimerNotRegisteredError,
   CloseNeedsEvidenceError,
   CrossWorkstreamEdgeError,
@@ -603,12 +635,14 @@ export {
   GroupNotFoundError,
   HOST_ENV_KEYS,
   HOST_PLACEHOLDERS,
+  HOST_TRANSPORTS,
   HazardFailError,
   HlcOverflowError,
   HlcParseError,
   HostChannelBusyError,
   HostCheckFailedError,
   HostExistsError,
+  HostHandbackError,
   HostInUseError,
   HostNotFoundError,
   HostProfileError,
@@ -617,8 +651,12 @@ export {
   HumanNeededInvalidError,
   HumanTaskError,
   InvalidSubstateError,
+  JOB_HANDLE_RE,
   KNOWN_INTENTS,
   KNOWN_VERBS,
+  LeaseJobInvalidError,
+  LeaseJobTimeoutError,
+  LeaseJobUnreadableError,
   LogKindReservedError,
   MACHINE_LOCAL_ENTITIES,
   MACHINE_LOCAL_TABLES,
@@ -712,6 +750,7 @@ export {
   WorktreeHeldError,
   WorktreePathNotEmptyError,
   WorktreeVcsRequiredError,
+  abandonCarrierJob,
   abortAgent,
   acceptTask,
   activeMux,
@@ -739,6 +778,7 @@ export {
   authorizeTasks,
   autoPermitted,
   beginWait,
+  bindCarrierJobAgent,
   bindHostChannel,
   buildTaskBrief,
   callerWorkstreams,
@@ -788,6 +828,7 @@ export {
   executeNext,
   expandHostTemplate,
   expectsCtl,
+  fillCarrierJob,
   findCaseCollisions,
   finishDelegate,
   flushSegment,
@@ -799,6 +840,9 @@ export {
   getAgent,
   getAgentByPane,
   getAutoConfig,
+  getCarrierJob,
+  getCarrierJobByAgent,
+  getCarrierJobByName,
   getDelegateCall,
   getHost,
   getParallelTracks,
@@ -811,6 +855,7 @@ export {
   getWorktreeAt,
   getWorktreeFor,
   hostEnvWords,
+  hostMuleStarter,
   hostStarter,
   idFromTitle,
   idFromTitleVerbose,
@@ -832,6 +877,8 @@ export {
   latestSeq,
   listAgents,
   listBlocked,
+  listCarrierJobs,
+  listCarrierJobsByName,
   listDelegates,
   listDelegatesOf,
   listGoals,
@@ -855,12 +902,14 @@ export {
   localMachineId,
   locksDir,
   mapLegacyStatus,
+  markCarrierLaunch,
   markDelegate,
   migratePi,
   murmurAvailable,
   mux_exports as mux,
   muxByName,
   nextHlc,
+  noteCarrierJob,
   observationFromReading,
   observeAgentStates,
   opSubject,
@@ -875,6 +924,7 @@ export {
   parseVerdict,
   peerStatuses,
   pendingAttempts,
+  placeholderUses,
   planAttempt,
   previewClose,
   probeFilesystem,
@@ -889,12 +939,14 @@ export {
   receiveHlc,
   reclaimWorktreePath,
   reconcile,
+  recordCarrierPane,
   recordCursors,
   recordHumanNeeded,
   recoveriesFor,
   registerDelegateCall,
   registerOwnedWait,
   registerWorktree,
+  releaseCarrierJob,
   releaseHostChannel,
   releaseHostChannelsForAgent,
   releaseStall,
@@ -913,6 +965,7 @@ export {
   reparentTask,
   reserveActionReceipt,
   reserveAttempt,
+  reserveCarrierJob,
   reserveHostChannel,
   resetCommandResolverForTests,
   resetMux,
@@ -925,6 +978,7 @@ export {
   resolvePair,
   resolvePeerRef,
   runHostTemplate,
+  runStop,
   saveResume,
   segmentLineCount,
   segmentPath,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/tracks.ts"],"sourcesContent":["// mu — parallel-track detection via union-find with diamond merge.\n//\n// Port of a parallel-tracks union-find algorithm cribbed from a\n// prior internal multi-agent runtime. The killer feature: when two goals share a prerequisite, their subgraphs\n// overlap and they collapse into ONE track, so two agents are never\n// assigned tasks that share a dependency.\n//\n//     goal_a    goal_b           goal_a   goal_b\n//        \\      /                  \\     /\n//        shared          →          shared          (1 track)\n//          |                          |\n//        leaf                       leaf\n//\n// Algorithm:\n//   1. Get all open goals (tasks with no outgoing edges, not CLOSED).\n//   2. In one recursive query, compute each goal's prerequisite subgraph\n//      (everything transitively reachable via reverse edges).\n//   3. Build union-find: merge goals while observing shared tasks.\n//   4. Each connected component is one Track.\n\nimport { compareStrings } from \"./compare.js\";\nimport type { Db } from \"./db.js\";\nimport { listGoals, listReady, type TaskRow } from \"./tasks.js\";\n\nexport interface Track {\n  /** Goal tasks (no outgoing edges) belonging to this track. */\n  roots: TaskRow[];\n  /** Every task id reachable as a prerequisite of any root in this track. */\n  taskIds: ReadonlySet<string>;\n  /** Number of READY tasks (per the SQL view) within this track's subgraph. */\n  readyCount: number;\n  /** True when every non-CLOSED task in the track is OPEN/parked: the\n   *  track holds work, but none of it is schedulable. */\n  parked: boolean;\n}\n\n/**\n * Identify independent task subtrees suitable for parallel assignment\n * within a workstream. Open goals only; CLOSED goals are excluded as\n * they no longer represent work to schedule.\n *\n * Scoping: only goals belonging to `workstream` are considered.\n * Cross-workstream edges are forbidden by addTask, so a goal's\n * prerequisite subgraph is naturally workstream-internal.\n */\nexport function getParallelTracks(db: Db, workstream: string): Track[] {\n  // listGoals already filters via the SQL view (status <> CLOSED),\n  // but defence-in-depth: a stale db snapshot or future view tweak\n  // shouldn't let closed goals leak into track count.\n  const goals = listGoals(db, workstream).filter((g) => g.status !== \"CLOSED\");\n  if (goals.length === 0) return [];\n\n  // 2. Compute every goal's prerequisite subgraph in one traversal.\n  // Running one recursive query per goal made the TUI's fast tick scale\n  // with the number of goals. The goal id carried through this CTE keeps\n  // the same inclusive per-goal sets in one SQLite round-trip.\n  const reach = db\n    .prepare(\n      `WITH RECURSIVE\n         active_goals(id, local_id) AS (\n           SELECT g.id, g.local_id\n             FROM goals g\n             JOIN workstreams ws ON ws.id = g.workstream_id\n            WHERE ws.name = ?\n         ),\n         reach(goal_id, node_id) AS (\n           SELECT id, id FROM active_goals\n           UNION\n           SELECT r.goal_id, e.from_task_id\n             FROM reach r\n             JOIN task_edges e ON e.to_task_id = r.node_id\n         )\n       SELECT goal.local_id AS goal_id, node.local_id AS task_id,\n              node.status AS status, node.substate AS substate\n         FROM reach r\n         JOIN tasks goal ON goal.id = r.goal_id\n         JOIN tasks node ON node.id = r.node_id`,\n    )\n    .all(workstream) as Array<{\n    goal_id: string;\n    task_id: string;\n    status: string;\n    substate: string;\n  }>;\n\n  const subgraphs = new Map(goals.map((goal) => [goal.name, new Set<string>()]));\n  const uf = new UnionFind(goals.map((goal) => goal.name));\n  const firstGoalByTask = new Map<string, string>();\n  // Substate of every non-CLOSED task reached, for the per-track `parked` flag.\n  const openSubstate = new Map<string, string>();\n  for (const row of reach) {\n    if (row.status !== \"CLOSED\") openSubstate.set(row.task_id, row.substate);\n    subgraphs.get(row.goal_id)?.add(row.task_id);\n    const firstGoal = firstGoalByTask.get(row.task_id);\n    if (firstGoal === undefined) firstGoalByTask.set(row.task_id, row.goal_id);\n    else uf.union(firstGoal, row.goal_id);\n  }\n\n  // 4. Group goals + subgraph task ids by union-find root.\n  const componentTaskIds = new Map<string, Set<string>>();\n  const componentRoots = new Map<string, TaskRow[]>();\n  for (const goal of goals) {\n    const root = uf.find(goal.name);\n    let bucket = componentTaskIds.get(root);\n    if (!bucket) {\n      bucket = new Set<string>();\n      componentTaskIds.set(root, bucket);\n      componentRoots.set(root, []);\n    }\n    componentRoots.get(root)?.push(goal);\n    const sub = subgraphs.get(goal.name);\n    if (sub) {\n      for (const id of sub) bucket.add(id);\n    }\n  }\n\n  // 5. Compute ready counts per track.\n  const readyIds = new Set(listReady(db, workstream).map((t) => t.name));\n  const tracks: Track[] = [];\n  for (const [root, taskIds] of componentTaskIds) {\n    const trackRoots = componentRoots.get(root) ?? [];\n    let readyCount = 0;\n    let openCount = 0;\n    let parkedCount = 0;\n    for (const id of taskIds) {\n      if (readyIds.has(id)) readyCount++;\n      const sub = openSubstate.get(id);\n      if (sub === undefined) continue;\n      openCount++;\n      if (sub === \"parked\") parkedCount++;\n    }\n    const parked = openCount > 0 && parkedCount === openCount;\n    tracks.push({ roots: trackRoots, taskIds, readyCount, parked });\n  }\n\n  // Stable order: by primary root's localId so output is deterministic.\n  tracks.sort((a, b) => {\n    const an = a.roots[0]?.name ?? \"\";\n    const bn = b.roots[0]?.name ?? \"\";\n    return compareStrings(an, bn);\n  });\n  return tracks;\n}\n\nclass UnionFind {\n  private readonly parent = new Map<string, string>();\n  private readonly rank = new Map<string, number>();\n\n  constructor(items: readonly string[]) {\n    for (const item of items) {\n      this.parent.set(item, item);\n      this.rank.set(item, 0);\n    }\n  }\n\n  find(x: string): string {\n    let root = x;\n    while (true) {\n      const next = this.parent.get(root);\n      if (next === undefined || next === root) break;\n      root = next;\n    }\n    // Path compression.\n    let curr = x;\n    while (curr !== root) {\n      const next = this.parent.get(curr);\n      if (next === undefined) break;\n      this.parent.set(curr, root);\n      curr = next;\n    }\n    return root;\n  }\n\n  union(a: string, b: string): void {\n    const rootA = this.find(a);\n    const rootB = this.find(b);\n    if (rootA === rootB) return;\n    const rankA = this.rank.get(rootA) ?? 0;\n    const rankB = this.rank.get(rootB) ?? 0;\n    if (rankA < rankB) {\n      this.parent.set(rootA, rootB);\n    } else if (rankA > rankB) {\n      this.parent.set(rootB, rootA);\n    } else {\n      this.parent.set(rootB, rootA);\n      this.rank.set(rootA, rankA + 1);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,SAAS,kBAAkB,IAAQ,YAA6B;AAIrE,QAAM,QAAQ,UAAU,IAAI,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,QAAQ;AAC3E,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAMhC,QAAM,QAAQ,GACX;AAAA,IACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBF,EACC,IAAI,UAAU;AAOjB,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,oBAAI,IAAY,CAAC,CAAC,CAAC;AAC7E,QAAM,KAAK,IAAI,UAAU,MAAM,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC;AACvD,QAAM,kBAAkB,oBAAI,IAAoB;AAEhD,QAAM,eAAe,oBAAI,IAAoB;AAC7C,aAAW,OAAO,OAAO;AACvB,QAAI,IAAI,WAAW,SAAU,cAAa,IAAI,IAAI,SAAS,IAAI,QAAQ;AACvE,cAAU,IAAI,IAAI,OAAO,GAAG,IAAI,IAAI,OAAO;AAC3C,UAAM,YAAY,gBAAgB,IAAI,IAAI,OAAO;AACjD,QAAI,cAAc,OAAW,iBAAgB,IAAI,IAAI,SAAS,IAAI,OAAO;AAAA,QACpE,IAAG,MAAM,WAAW,IAAI,OAAO;AAAA,EACtC;AAGA,QAAM,mBAAmB,oBAAI,IAAyB;AACtD,QAAM,iBAAiB,oBAAI,IAAuB;AAClD,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,GAAG,KAAK,KAAK,IAAI;AAC9B,QAAI,SAAS,iBAAiB,IAAI,IAAI;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,oBAAI,IAAY;AACzB,uBAAiB,IAAI,MAAM,MAAM;AACjC,qBAAe,IAAI,MAAM,CAAC,CAAC;AAAA,IAC7B;AACA,mBAAe,IAAI,IAAI,GAAG,KAAK,IAAI;AACnC,UAAM,MAAM,UAAU,IAAI,KAAK,IAAI;AACnC,QAAI,KAAK;AACP,iBAAW,MAAM,IAAK,QAAO,IAAI,EAAE;AAAA,IACrC;AAAA,EACF;AAGA,QAAM,WAAW,IAAI,IAAI,UAAU,IAAI,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACrE,QAAM,SAAkB,CAAC;AACzB,aAAW,CAAC,MAAM,OAAO,KAAK,kBAAkB;AAC9C,UAAM,aAAa,eAAe,IAAI,IAAI,KAAK,CAAC;AAChD,QAAI,aAAa;AACjB,QAAI,YAAY;AAChB,QAAI,cAAc;AAClB,eAAW,MAAM,SAAS;AACxB,UAAI,SAAS,IAAI,EAAE,EAAG;AACtB,YAAM,MAAM,aAAa,IAAI,EAAE;AAC/B,UAAI,QAAQ,OAAW;AACvB;AACA,UAAI,QAAQ,SAAU;AAAA,IACxB;AACA,UAAM,SAAS,YAAY,KAAK,gBAAgB;AAChD,WAAO,KAAK,EAAE,OAAO,YAAY,SAAS,YAAY,OAAO,CAAC;AAAA,EAChE;AAGA,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ;AAC/B,UAAM,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ;AAC/B,WAAO,eAAe,IAAI,EAAE;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAEA,IAAM,YAAN,MAAgB;AAAA,EACG,SAAS,oBAAI,IAAoB;AAAA,EACjC,OAAO,oBAAI,IAAoB;AAAA,EAEhD,YAAY,OAA0B;AACpC,eAAW,QAAQ,OAAO;AACxB,WAAK,OAAO,IAAI,MAAM,IAAI;AAC1B,WAAK,KAAK,IAAI,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,KAAK,GAAmB;AACtB,QAAI,OAAO;AACX,WAAO,MAAM;AACX,YAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AACjC,UAAI,SAAS,UAAa,SAAS,KAAM;AACzC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO;AACX,WAAO,SAAS,MAAM;AACpB,YAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AACjC,UAAI,SAAS,OAAW;AACxB,WAAK,OAAO,IAAI,MAAM,IAAI;AAC1B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,GAAW,GAAiB;AAChC,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,QAAI,UAAU,MAAO;AACrB,UAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,KAAK;AACtC,UAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,KAAK;AACtC,QAAI,QAAQ,OAAO;AACjB,WAAK,OAAO,IAAI,OAAO,KAAK;AAAA,IAC9B,WAAW,QAAQ,OAAO;AACxB,WAAK,OAAO,IAAI,OAAO,KAAK;AAAA,IAC9B,OAAO;AACL,WAAK,OAAO,IAAI,OAAO,KAAK;AAC5B,WAAK,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAChC;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../src/tracks.ts"],"sourcesContent":["// mu — parallel-track detection via union-find with diamond merge.\n//\n// Port of a parallel-tracks union-find algorithm cribbed from a\n// prior internal multi-agent runtime. The killer feature: when two goals share a prerequisite, their subgraphs\n// overlap and they collapse into ONE track, so two agents are never\n// assigned tasks that share a dependency.\n//\n//     goal_a    goal_b           goal_a   goal_b\n//        \\      /                  \\     /\n//        shared          →          shared          (1 track)\n//          |                          |\n//        leaf                       leaf\n//\n// Algorithm:\n//   1. Get all open goals (tasks with no outgoing edges, not CLOSED).\n//   2. In one recursive query, compute each goal's prerequisite subgraph\n//      (everything transitively reachable via reverse edges).\n//   3. Build union-find: merge goals while observing shared tasks.\n//   4. Each connected component is one Track.\n\nimport { compareStrings } from \"./compare.js\";\nimport type { Db } from \"./db.js\";\nimport { listGoals, listReady, type TaskRow } from \"./tasks.js\";\n\nexport interface Track {\n  /** Goal tasks (no outgoing edges) belonging to this track. */\n  roots: TaskRow[];\n  /** Every task id reachable as a prerequisite of any root in this track. */\n  taskIds: ReadonlySet<string>;\n  /** Number of READY tasks (per the SQL view) within this track's subgraph. */\n  readyCount: number;\n  /** True when every non-CLOSED task in the track is OPEN/parked: the\n   *  track holds work, but none of it is schedulable. */\n  parked: boolean;\n}\n\n/**\n * Identify independent task subtrees suitable for parallel assignment\n * within a workstream. Open goals only; CLOSED goals are excluded as\n * they no longer represent work to schedule.\n *\n * Scoping: only goals belonging to `workstream` are considered.\n * Cross-workstream edges are forbidden by addTask, so a goal's\n * prerequisite subgraph is naturally workstream-internal.\n */\nexport function getParallelTracks(db: Db, workstream: string): Track[] {\n  // listGoals already filters via the SQL view (status <> CLOSED),\n  // but defence-in-depth: a stale db snapshot or future view tweak\n  // shouldn't let closed goals leak into track count.\n  const goals = listGoals(db, workstream).filter((g) => g.status !== \"CLOSED\");\n  if (goals.length === 0) return [];\n\n  // 2. Compute every goal's prerequisite subgraph in one traversal.\n  // Running one recursive query per goal made the TUI's fast tick scale\n  // with the number of goals. The goal id carried through this CTE keeps\n  // the same inclusive per-goal sets in one SQLite round-trip.\n  const reach = db\n    .prepare(\n      `WITH RECURSIVE\n         active_goals(id, local_id) AS (\n           SELECT g.id, g.local_id\n             FROM goals g\n             JOIN workstreams ws ON ws.id = g.workstream_id\n            WHERE ws.name = ?\n         ),\n         reach(goal_id, node_id) AS (\n           SELECT id, id FROM active_goals\n           UNION\n           SELECT r.goal_id, e.from_task_id\n             FROM reach r\n             JOIN task_edges e ON e.to_task_id = r.node_id\n         )\n       SELECT goal.local_id AS goal_id, node.local_id AS task_id,\n              node.status AS status, node.substate AS substate\n         FROM reach r\n         JOIN tasks goal ON goal.id = r.goal_id\n         JOIN tasks node ON node.id = r.node_id`,\n    )\n    .all(workstream) as Array<{\n    goal_id: string;\n    task_id: string;\n    status: string;\n    substate: string;\n  }>;\n\n  const subgraphs = new Map(goals.map((goal) => [goal.name, new Set<string>()]));\n  const uf = new UnionFind(goals.map((goal) => goal.name));\n  const firstGoalByTask = new Map<string, string>();\n  // Substate of every non-CLOSED task reached, for the per-track `parked` flag.\n  const openSubstate = new Map<string, string>();\n  for (const row of reach) {\n    if (row.status !== \"CLOSED\") openSubstate.set(row.task_id, row.substate);\n    subgraphs.get(row.goal_id)?.add(row.task_id);\n    const firstGoal = firstGoalByTask.get(row.task_id);\n    if (firstGoal === undefined) firstGoalByTask.set(row.task_id, row.goal_id);\n    else uf.union(firstGoal, row.goal_id);\n  }\n\n  // 4. Group goals + subgraph task ids by union-find root.\n  const componentTaskIds = new Map<string, Set<string>>();\n  const componentRoots = new Map<string, TaskRow[]>();\n  for (const goal of goals) {\n    const root = uf.find(goal.name);\n    let bucket = componentTaskIds.get(root);\n    if (!bucket) {\n      bucket = new Set<string>();\n      componentTaskIds.set(root, bucket);\n      componentRoots.set(root, []);\n    }\n    componentRoots.get(root)?.push(goal);\n    const sub = subgraphs.get(goal.name);\n    if (sub) {\n      for (const id of sub) bucket.add(id);\n    }\n  }\n\n  // 5. Compute ready counts per track.\n  const readyIds = new Set(listReady(db, workstream).map((t) => t.name));\n  const tracks: Track[] = [];\n  for (const [root, taskIds] of componentTaskIds) {\n    const trackRoots = componentRoots.get(root) ?? [];\n    let readyCount = 0;\n    let openCount = 0;\n    let parkedCount = 0;\n    for (const id of taskIds) {\n      if (readyIds.has(id)) readyCount++;\n      const sub = openSubstate.get(id);\n      if (sub === undefined) continue;\n      openCount++;\n      if (sub === \"parked\") parkedCount++;\n    }\n    const parked = openCount > 0 && parkedCount === openCount;\n    tracks.push({ roots: trackRoots, taskIds, readyCount, parked });\n  }\n\n  // Stable order: by primary root's localId so output is deterministic.\n  tracks.sort((a, b) => {\n    const an = a.roots[0]?.name ?? \"\";\n    const bn = b.roots[0]?.name ?? \"\";\n    return compareStrings(an, bn);\n  });\n  return tracks;\n}\n\nclass UnionFind {\n  private readonly parent = new Map<string, string>();\n  private readonly rank = new Map<string, number>();\n\n  constructor(items: readonly string[]) {\n    for (const item of items) {\n      this.parent.set(item, item);\n      this.rank.set(item, 0);\n    }\n  }\n\n  find(x: string): string {\n    let root = x;\n    while (true) {\n      const next = this.parent.get(root);\n      if (next === undefined || next === root) break;\n      root = next;\n    }\n    // Path compression.\n    let curr = x;\n    while (curr !== root) {\n      const next = this.parent.get(curr);\n      if (next === undefined) break;\n      this.parent.set(curr, root);\n      curr = next;\n    }\n    return root;\n  }\n\n  union(a: string, b: string): void {\n    const rootA = this.find(a);\n    const rootB = this.find(b);\n    if (rootA === rootB) return;\n    const rankA = this.rank.get(rootA) ?? 0;\n    const rankB = this.rank.get(rootB) ?? 0;\n    if (rankA < rankB) {\n      this.parent.set(rootA, rootB);\n    } else if (rankA > rankB) {\n      this.parent.set(rootB, rootA);\n    } else {\n      this.parent.set(rootB, rootA);\n      this.rank.set(rootA, rankA + 1);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CO,SAAS,kBAAkB,IAAQ,YAA6B;AAIrE,QAAM,QAAQ,UAAU,IAAI,UAAU,EAAE,OAAO,CAAC,MAAM,EAAE,WAAW,QAAQ;AAC3E,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAMhC,QAAM,QAAQ,GACX;AAAA,IACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBF,EACC,IAAI,UAAU;AAOjB,QAAM,YAAY,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,oBAAI,IAAY,CAAC,CAAC,CAAC;AAC7E,QAAM,KAAK,IAAI,UAAU,MAAM,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC;AACvD,QAAM,kBAAkB,oBAAI,IAAoB;AAEhD,QAAM,eAAe,oBAAI,IAAoB;AAC7C,aAAW,OAAO,OAAO;AACvB,QAAI,IAAI,WAAW,SAAU,cAAa,IAAI,IAAI,SAAS,IAAI,QAAQ;AACvE,cAAU,IAAI,IAAI,OAAO,GAAG,IAAI,IAAI,OAAO;AAC3C,UAAM,YAAY,gBAAgB,IAAI,IAAI,OAAO;AACjD,QAAI,cAAc,OAAW,iBAAgB,IAAI,IAAI,SAAS,IAAI,OAAO;AAAA,QACpE,IAAG,MAAM,WAAW,IAAI,OAAO;AAAA,EACtC;AAGA,QAAM,mBAAmB,oBAAI,IAAyB;AACtD,QAAM,iBAAiB,oBAAI,IAAuB;AAClD,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,GAAG,KAAK,KAAK,IAAI;AAC9B,QAAI,SAAS,iBAAiB,IAAI,IAAI;AACtC,QAAI,CAAC,QAAQ;AACX,eAAS,oBAAI,IAAY;AACzB,uBAAiB,IAAI,MAAM,MAAM;AACjC,qBAAe,IAAI,MAAM,CAAC,CAAC;AAAA,IAC7B;AACA,mBAAe,IAAI,IAAI,GAAG,KAAK,IAAI;AACnC,UAAM,MAAM,UAAU,IAAI,KAAK,IAAI;AACnC,QAAI,KAAK;AACP,iBAAW,MAAM,IAAK,QAAO,IAAI,EAAE;AAAA,IACrC;AAAA,EACF;AAGA,QAAM,WAAW,IAAI,IAAI,UAAU,IAAI,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACrE,QAAM,SAAkB,CAAC;AACzB,aAAW,CAAC,MAAM,OAAO,KAAK,kBAAkB;AAC9C,UAAM,aAAa,eAAe,IAAI,IAAI,KAAK,CAAC;AAChD,QAAI,aAAa;AACjB,QAAI,YAAY;AAChB,QAAI,cAAc;AAClB,eAAW,MAAM,SAAS;AACxB,UAAI,SAAS,IAAI,EAAE,EAAG;AACtB,YAAM,MAAM,aAAa,IAAI,EAAE;AAC/B,UAAI,QAAQ,OAAW;AACvB;AACA,UAAI,QAAQ,SAAU;AAAA,IACxB;AACA,UAAM,SAAS,YAAY,KAAK,gBAAgB;AAChD,WAAO,KAAK,EAAE,OAAO,YAAY,SAAS,YAAY,OAAO,CAAC;AAAA,EAChE;AAGA,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ;AAC/B,UAAM,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ;AAC/B,WAAO,eAAe,IAAI,EAAE;AAAA,EAC9B,CAAC;AACD,SAAO;AACT;AAEA,IAAM,YAAN,MAAgB;AAAA,EACG,SAAS,oBAAI,IAAoB;AAAA,EACjC,OAAO,oBAAI,IAAoB;AAAA,EAEhD,YAAY,OAA0B;AACpC,eAAW,QAAQ,OAAO;AACxB,WAAK,OAAO,IAAI,MAAM,IAAI;AAC1B,WAAK,KAAK,IAAI,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AAAA,EAEA,KAAK,GAAmB;AACtB,QAAI,OAAO;AACX,WAAO,MAAM;AACX,YAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AACjC,UAAI,SAAS,UAAa,SAAS,KAAM;AACzC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO;AACX,WAAO,SAAS,MAAM;AACpB,YAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AACjC,UAAI,SAAS,OAAW;AACxB,WAAK,OAAO,IAAI,MAAM,IAAI;AAC1B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,GAAW,GAAiB;AAChC,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,UAAM,QAAQ,KAAK,KAAK,CAAC;AACzB,QAAI,UAAU,MAAO;AACrB,UAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,KAAK;AACtC,UAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,KAAK;AACtC,QAAI,QAAQ,OAAO;AACjB,WAAK,OAAO,IAAI,OAAO,KAAK;AAAA,IAC9B,WAAW,QAAQ,OAAO;AACxB,WAAK,OAAO,IAAI,OAAO,KAAK;AAAA,IAC9B,OAAO;AACL,WAAK,OAAO,IAAI,OAAO,KAAK;AAC5B,WAAK,KAAK,IAAI,OAAO,QAAQ,CAAC;AAAA,IAChC;AAAA,EACF;AACF;","names":[]}

package/dist/{tui-EN2CDP6G.js → tui-3ZPLSLDW.js}

@@ -3,14 +3,14 @@ import {
   formatElapsed,
   loadDashboard,
   matches
-} from "./chunk-LBBZAG5C.js";
+} from "./chunk-UL2QE43S.js";
 import {
   KNOWN_VERBS,
   ambientIngest,
   currentCallers,
   parseOpKey,
   syncEnabled
-} from "./chunk-DEYBQDTO.js";
+} from "./chunk-RVWNQLFE.js";
 import {
   DEFAULT_SUBSTATE,
   TASK_STATUSES,
@@ -27,7 +27,7 @@ import {
   spawnerFromEnv,
   tmuxAttachMode,
   verdictLineLabel
-} from "./chunk-L7I3BLXP.js";
+} from "./chunk-SFV5RPZW.js";
 import "./chunk-PZ5GOCWH.js";
 
 // src/cli/tui/index.ts
@@ -667,8 +667,8 @@ function taskLine(t) {
 function useYank() {
   const { stdout } = useStdout();
   return async (target, all = false) => {
-    const plan = target.kind === "scrollback" ? await planAttach(target) : null;
-    const command = copyCommand(target, { all, attachLine: plan?.line ?? null });
+    const plan = typeof target !== "string" && target.kind === "scrollback" ? await planAttach(target) : null;
+    const command = typeof target === "string" ? target : copyCommand(target, { all, attachLine: plan?.line ?? null });
     const y = yankSequence(command);
     const why = plan !== null && !plan.ok ? `  (attach unavailable: ${plan.reason})` : "";
     if (!y.ok) return `not copied (${y.why}): ${command}${why}`;
@@ -1240,17 +1240,16 @@ function attentionStrip(attention, ws) {
     ])
   ];
 }
-var attentionRole = (a) => a.kind === "dead" || a.kind === "delegate" && a.text.startsWith("delegate failed") ? "bad" : "warn";
+var attentionRole = (a) => a.kind === "dead" ? "bad" : "warn";
 function attentionRows(snap, ws) {
   return snap.attention.map((a) => {
     const agent = snap.agents.find((x) => x.key === a.target);
     const id = a.kind === "human" || a.kind === "delegate" ? a.target?.slice((a.workstream?.length ?? 0) + 1) : void 0;
     const drill = agent ? scrollbackOf(agent) : a.workstream !== null && id ? { kind: "notes", workstream: a.workstream, id, title: a.text } : void 0;
-    return rowOf(
-      a.key,
-      [{ text: attentionLabel(a, ws), role: attentionRole(a) }],
-      drill ? { drill } : {}
-    );
+    return rowOf(a.key, [{ text: attentionLabel(a, ws), role: attentionRole(a) }], {
+      ...drill ? { drill } : {},
+      ...a.fix !== void 0 ? { fix: a.fix } : {}
+    });
   });
 }
 function waveText(w) {
@@ -1481,7 +1480,7 @@ function layout(rows, lines = FIXED_BY_PRIORITY) {
   return { shown, height: Math.max(0, rows - TOP_LINES - shown.size) };
 }
 var HINT_HEAD = `\u2190/\u2192 tab  q quit  [/] workstream  ${NAV_HINT} move`;
-var HINT_OVERVIEW = `${HINT_HEAD}  Enter open  y copy  +/- rate`;
+var HINT_OVERVIEW = `${HINT_HEAD}  Enter open  y copy fix  +/- rate`;
 var HINT = `${HINT_HEAD}  Enter open  / filter  c clear  y copy  +/- rate`;
 var HINT_TASKS = `${HINT_HEAD}  Enter open  s sort  o status  / filter  c clear  y copy  +/- rate`;
 var hintAgents = (attachKey) => `${HINT_HEAD}  Enter scrollback  ${attachKey}  / filter  c clear  y copy  +/- rate`;
@@ -1660,7 +1659,7 @@ function App({
         const target = all[sel]?.drill;
         if (target?.kind === "scrollback") void attach(target);
       } else if (input === "y") {
-        const target = all[sel]?.drill;
+        const target = all[sel]?.fix ?? all[sel]?.drill;
         if (target !== void 0) void yank(target).then(setFlash);
       }
     },
@@ -1845,4 +1844,4 @@ async function runDashboard(opts) {
 export {
   runDashboard
 };
-//# sourceMappingURL=tui-EN2CDP6G.js.map
+//# sourceMappingURL=tui-3ZPLSLDW.js.map