@mu-crew/mu 3.13.3 → 4.1.0

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","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":[]}