@memberjunction/ng-task-graph-editor 6.1.0-edge.2 → 6.1.0-edge.4

package/dist/lib/task-graph-canvas-adapter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"task-graph-canvas-adapter.d.ts","sourceRoot":"","sources":["../../src/lib/task-graph-canvas-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAKH,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,EAC3B,MAAM,8BAA8B,CAAC;AACtC,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAEjI;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG,YAAY,GAAG,WAAW,CAAC;AAEzE;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,iBAAiB,GAAG,YAAY,GAAG,aAAa,GAAG,WAAW,GAAG,cAAc,CAAC;AAElH,qEAAqE;AACrE,MAAM,MAAM,uBAAuB,GAAG,kBAAkB,GAAG;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,CAAC;AAEvF;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,mBAAmB,GAAG,IAAI,IAAI,iBAAiB,CAEzF;AAED,gFAAgF;AAChF,MAAM,MAAM,yBAAyB,GAAG,kBAAkB,GAAG;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,CAAC;AAO3F,kFAAkF;AAClF,eAAO,MAAM,qBAAqB,EAAE,SAAS,uBAAuB,EAyBnE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,EAAE,SAAS,yBAAyB,EAMvE,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,yBAAyB,GAAG,IAAI,CAEhF;AAED,sEAAsE;AACtE,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;AAE3E,8EAA8E;AAC9E,MAAM,MAAM,qBAAqB,GAC3B,SAAS,GACT,aAAa,GACb,UAAU,GACV,QAAQ,GACR,SAAS,GACT,WAAW,GACX,UAAU,CAAC;AAEjB;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,qBAAqB,GAAG,SAAS,GAAG,cAAc,CAWjG;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,OAAO,CAE5D;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,iBAAiB,GAAG,mBAAmB,CAY5E;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAC/B,IAAI,EAAE,aAAa,EACnB,IAAI,EAAE,iBAAiB,EACvB,QAAQ,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GAC3D,iBAAiB,CAenB;AASD,iGAAiG;AACjG,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,EAAE,CAE7D;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAAC,IAAI,EAAE,iBAAiB,GAAG,mBAAmB,EAAE,CAE9E;AAED,iFAAiF;AACjF,wBAAgB,aAAa,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAI3E;AAOD;;;;;;GAMG;AACH;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CACvB,IAAI,EAAE,aAAa,EACnB,OAAO,CAAC,EAAE,sBAAsB,EAChC,SAAS,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,GAC9C,QAAQ,EAAE,CAuBZ;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,iBAAiB,EAAE,IAAI,GAAE,mBAA2C,GAAG,MAAM,CAc/G;AAWD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,aAAa,GAAG,cAAc,EAAE,CA0BvE;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,aAAa,CAa1H;AAED,kDAAkD;AAClD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CASzG;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,aAAa,CAO7E;AAED,yCAAyC;AACzC,wBAAgB,OAAO,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAEnF;AAED,kEAAkE;AAClE,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAEtG;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAmBnG;AAED,qEAAqE;AACrE,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,SAAS,GAAG,MAAM,CAKvE"}
+{"version":3,"file":"task-graph-canvas-adapter.d.ts","sourceRoot":"","sources":["../../src/lib/task-graph-canvas-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAKH,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,mBAAmB,EAC3B,MAAM,8BAA8B,CAAC;AACtC,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,gCAAgC,CAAC;AAEjI;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,iBAAiB,GAAG,WAAW,GAAG,YAAY,GAAG,WAAW,CAAC;AAEzE;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,iBAAiB,GAAG,YAAY,GAAG,aAAa,GAAG,WAAW,GAAG,cAAc,CAAC;AAElH,qEAAqE;AACrE,MAAM,MAAM,uBAAuB,GAAG,kBAAkB,GAAG;IAAE,IAAI,EAAE,iBAAiB,CAAA;CAAE,CAAC;AAEvF;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,mBAAmB,GAAG,IAAI,IAAI,iBAAiB,CAEzF;AAED,gFAAgF;AAChF,MAAM,MAAM,yBAAyB,GAAG,kBAAkB,GAAG;IAAE,IAAI,EAAE,mBAAmB,CAAA;CAAE,CAAC;AAE3F;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAElD;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEnD;AAYD,kFAAkF;AAClF,eAAO,MAAM,qBAAqB,EAAE,SAAS,uBAAuB,EAyBnE,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,uBAAuB,EAAE,SAAS,yBAAyB,EAMvE,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,yBAAyB,GAAG,IAAI,CAEhF;AAED,sEAAsE;AACtE,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;AAE3E,8EAA8E;AAC9E,MAAM,MAAM,qBAAqB,GAC3B,SAAS,GACT,aAAa,GACb,UAAU,GACV,QAAQ,GACR,SAAS,GACT,WAAW,GACX,UAAU,GAGV,SAAS,CAAC;AAEhB;;;;;;;GAOG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,qBAAqB,GAAG,SAAS,GAAG,cAAc,CAejG;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,OAAO,CAE5D;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,iBAAiB,GAAG,mBAAmB,CAY5E;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CAC/B,IAAI,EAAE,aAAa,EACnB,IAAI,EAAE,iBAAiB,EACvB,QAAQ,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GAC3D,iBAAiB,CAenB;AASD,iGAAiG;AACjG,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,EAAE,CAE7D;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAAC,IAAI,EAAE,iBAAiB,GAAG,mBAAmB,EAAE,CAE9E;AAED,iFAAiF;AACjF,wBAAgB,aAAa,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAI3E;AAOD;;;;;;GAMG;AACH;;;;;;;;GAQG;AACH;;;;;;;GAOG;AACH,MAAM,MAAM,qBAAqB,GAAG;IAChC,WAAW,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,uFAAuF;IACvF,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,aAAa,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC;IAC3D,qFAAqF;IACrF,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,0EAA0E;IAC1E,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC,CAAC;AAEF,wBAAgB,WAAW,CACvB,IAAI,EAAE,aAAa,EACnB,OAAO,CAAC,EAAE,sBAAsB,EAChC,SAAS,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,EAC7C,KAAK,CAAC,EAAE,qBAAqB,GAC9B,QAAQ,EAAE,CA+BZ;AAED,sFAAsF;AACtF,wBAAgB,eAAe,CAC3B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,EAChC,KAAK,CAAC,EAAE,qBAAqB,EAC7B,OAAO,CAAC,EAAE,sBAAsB,EAChC,QAAQ,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC/B,QAAQ,CAAC,QAAQ,CAAC,CAmBpB;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,iBAAiB,EAAE,IAAI,GAAE,mBAA2C,GAAG,MAAM,CAc/G;AAWD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAC7B,IAAI,EAAE,aAAa,EACnB,OAAO,CAAC,EAAE,sBAAsB,EAChC,KAAK,CAAC,EAAE,qBAAqB,GAC9B,cAAc,EAAE,CA6BlB;AAED,sGAAsG;AACtG,wBAAgB,iBAAiB,CAC7B,GAAG,EAAE,mBAAmB,EACxB,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM,GAAG,OAAO,EAC3B,cAAc,GAAE,OAAe,EAC/B,OAAO,GAAE,OAAe,EACxB,QAAQ,GAAE,OAAe,GAC1B,cAAc,CAiChB;AAuFD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,aAAa,CAa1H;AAED,kDAAkD;AAClD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,aAAa,CASzG;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,aAAa,CAO7E;AAED,yCAAyC;AACzC,wBAAgB,OAAO,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAEnF;AAED,kEAAkE;AAClE,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAEtG;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAmBnG;AAED,qEAAqE;AACrE,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,SAAS,GAAG,MAAM,CAKvE"}

package/dist/lib/task-graph-canvas-adapter.js

@@ -26,6 +26,30 @@ import { ConfigOf, NormalizeDependency, TaskNode, } from '@memberjunction/ai-cor
 export function IsAuthorableNodeType(type) {
     return type === 'AgentTask' || type === 'ActionTask' || type === 'HumanTask';
 }
+/**
+ * Port ids are scoped to their NODE, and must be.
+ *
+ * The canvas resolves a connection by looking its `fOutputId` / `fInputId` up among all registered
+ * ports — a flat, graph-wide namespace. Giving every node ports literally called `in` and `out` made
+ * every node's ports collide with every other node's, so a connection could not name which node's
+ * port it meant. The result was a workflow that drew its boxes correctly and **no edges at all**:
+ * nothing errored, because an unresolvable port is simply a connection with nowhere to attach.
+ *
+ * The Flow Agent editor — the other consumer of this canvas, whose edges have always drawn — scopes
+ * its ports the same way (`${stepId}-input` / `${stepId}-output`). This is that convention, named,
+ * so a future producer cannot reintroduce the collision by writing the obvious literal.
+ */
+export function InputPortID(tempId) {
+    return `${tempId}-in`;
+}
+export function OutputPortID(tempId) {
+    return `${tempId}-out`;
+}
+/**
+ * Palette defaults. These carry the bare names because a palette entry describes a node TYPE, not a
+ * placed node — there is no id to scope them to yet. {@link SpecToNodes} assigns the real, scoped
+ * ids when a node is actually placed on the canvas.
+ */
 const TASK_GRAPH_PORTS = [
     { ID: 'in', Direction: 'input', Side: 'top', Multiple: true },
     { ID: 'out', Direction: 'output', Side: 'bottom', Multiple: true },
@@ -94,6 +118,10 @@ export function RuntimeStateToNodeStatus(state) {
         case 'Failed': return 'error';
         case 'Blocked': return 'warning';
         case 'Cancelled': return 'disabled';
+        // Its own state, not a shade of disabled: a branch the workflow did not take is a normal
+        // outcome. Falling through to 'default' — which is what happened before — drew it as an
+        // ordinary node, so a conditional workflow looked like it had run every branch.
+        case 'Skipped': return 'skipped';
         case 'Deferred': return 'pending';
         case 'Pending': return 'pending';
         default: return 'default';
@@ -181,45 +209,58 @@ export function GetDependents(spec, tempId) {
 function edgeId(fromTempId, toTempId) {
     return `${fromTempId}->${toTempId}`;
 }
-/**
- * Projects the spec onto canvas nodes.
- *
- * Positions are left at the origin: layout is the canvas's job (Dagre), and a spec carries no
- * geometry precisely because a task graph is a *logical* structure. An agent that emitted one never
- * had an opinion about where the boxes go.
- */
-/**
- * Projects the spec onto canvas nodes.
- *
- * `positions` carries geometry the spec cannot hold. `TaskGraphSpec` is an execution contract with
- * no layout field, so without a caller-held map every re-projection would return every node to the
- * origin — which is what previously forced a full re-arrange (and a viewport re-zoom) after every
- * single edit. Unknown ids fall back to the origin, which is also the correct starting state for a
- * graph that has never been laid out.
- */
-export function SpecToNodes(spec, runtime, positions) {
+export function SpecToNodes(spec, runtime, positions, debug) {
     const entryIds = new Set(GetEntryTempIds(spec));
+    const breakpoints = new Set(debug?.breakpoints ?? []);
     return (spec.tasks ?? []).map((task) => {
         const type = GetTaskNodeType(task);
         const known = positions?.get(task.tempId);
+        const awaiting = isAwaitingUser(task.tempId, entryIds, runtime, debug);
+        const nextToRun = isNextToRun(task, runtime, debug, entryIds);
+        const running = runtime?.[task.tempId] === 'In Progress';
         return {
             ID: task.tempId,
             Type: type,
             Label: task.name,
             Subtitle: TaskSubtitle(task, type),
             Icon: GetNodeTypeConfig(type)?.Icon ?? 'fa-circle-nodes',
+            IconColor: awaiting || nextToRun || running ? 'var(--mj-brand-primary)' : undefined,
+            // Keep the real runtime status. Mapping "paused here" to `running` drew a spinner
+            // on a step that is waiting for the operator — it read as "this is executing".
             Status: RuntimeStateToNodeStatus(runtime?.[task.tempId]),
             StatusMessage: task.description,
             IsStartNode: entryIds.has(task.tempId),
+            Badges: NodeDebugBadges(task.tempId, breakpoints, debug, runtime, entryIds),
             Position: known ? { ...known } : { X: 0, Y: 0 },
             Ports: [
-                { ID: 'in', Direction: 'input', Side: 'top', Multiple: true },
-                { ID: 'out', Direction: 'output', Side: 'bottom', Multiple: true },
+                { ID: InputPortID(task.tempId), Direction: 'input', Side: 'top', Multiple: true },
+                { ID: OutputPortID(task.tempId), Direction: 'output', Side: 'bottom', Multiple: true },
             ],
-            Data: { TempId: task.tempId },
+            Data: { TempId: task.tempId, AwaitingUser: awaiting, NextToRun: nextToRun },
         };
     });
 }
+/** Badge pills for an armed breakpoint and the step the graph actually stopped on. */
+export function NodeDebugBadges(taskID, breakpoints, debug, runtime, entryIds) {
+    const badges = [];
+    if (isAwaitingUser(taskID, entryIds ?? new Set(), runtime, debug)) {
+        badges.push({
+            Label: 'Waiting on you — Continue or Step to run this step',
+            Value: 'Waiting here',
+            Icon: 'fa-pause',
+            Color: 'var(--mj-brand-primary)',
+        });
+    }
+    if (breakpoints.has(taskID)) {
+        badges.push({
+            Label: 'Breakpoint',
+            Value: 'break',
+            Icon: 'fa-circle',
+            Color: 'var(--mj-status-error)',
+        });
+    }
+    return badges.length > 0 ? badges : undefined;
+}
 /**
  * The one line under a node's name: who or what runs it.
  *
@@ -259,32 +300,130 @@ function LoopBodyLabel(op) {
  * validator reports them as `UnknownDependency`, and rendering a connection to nowhere would be a
  * second, worse way of saying the same thing.
  */
-export function SpecToConnections(spec) {
+export function SpecToConnections(spec, runtime, debug) {
     const known = new Set((spec.tasks ?? []).map((t) => t.tempId));
+    const entryIds = new Set(GetEntryTempIds(spec));
     const connections = [];
     for (const task of spec.tasks ?? []) {
         for (const dep of GetDependencies(task)) {
             if (!known.has(dep.tempId))
                 continue;
-            const conditional = !!dep.condition?.trim();
-            connections.push({
-                ID: edgeId(dep.tempId, task.tempId),
-                // Reversed: dependsOn points back at the prerequisite, the drawn arrow points forward.
-                SourceNodeID: dep.tempId,
-                SourcePortID: 'out',
-                TargetNodeID: task.tempId,
-                TargetPortID: 'in',
-                Label: conditional ? 'if' : undefined,
-                LabelDetail: dep.condition ?? undefined,
-                LabelIcon: conditional ? 'fa-code-branch' : undefined,
-                Condition: dep.condition ?? undefined,
-                Style: conditional ? 'dashed' : 'solid',
-                Data: { FromTempId: dep.tempId, ToTempId: task.tempId },
-            });
+            const override = dep.id ? debug?.edgeOverrides?.[dep.id] : undefined;
+            const eitherSkipped = runtime
+                && (runtime[task.tempId] === 'Skipped' || runtime[dep.tempId] === 'Skipped');
+            // RUN MODE DRAWS ONLY THE PATH TAKEN — except an operator-forced edge, which must stay
+            // visible or the history lies about why a branch ran (or did not).
+            if (eitherSkipped && !override)
+                continue;
+            const destQueued = isNextToRun(task, runtime, debug, entryIds);
+            const flowing = destQueued || isFlowingEdge(dep.tempId, task.tempId, runtime, debug);
+            connections.push(ProjectConnection(dep, task.tempId, override, debug?.showConditions === true, flowing, !flowing && isTraveledEdge(dep.tempId, task.tempId, runtime)));
         }
     }
     return connections;
 }
+/** One canvas connection, including the override styling that must never look like a real verdict. */
+export function ProjectConnection(dep, toTempId, override, showConditions = false, flowing = false, traveled = false) {
+    const conditional = !!dep.condition?.trim();
+    const forced = override === 'true' || override === 'false';
+    const conditionLabel = dep.condition?.trim()
+        ? TruncateCondition(dep.condition.trim())
+        : undefined;
+    return {
+        ID: edgeId(dep.tempId, toTempId),
+        SourceNodeID: dep.tempId,
+        SourcePortID: OutputPortID(dep.tempId),
+        TargetNodeID: toTempId,
+        TargetPortID: InputPortID(toTempId),
+        Label: forced
+            ? (override === 'true' ? 'forced yes' : 'forced no')
+            : (conditional ? (showConditions && conditionLabel ? conditionLabel : 'if') : undefined),
+        LabelDetail: forced
+            ? `Operator set this path to ${override}${dep.condition ? ` — ${dep.condition}` : ''}`
+            : (dep.condition ?? undefined),
+        LabelIcon: forced ? 'fa-hand' : (conditional ? 'fa-code-branch' : undefined),
+        LabelIconColor: forced ? 'var(--mj-status-warning)' : undefined,
+        Condition: dep.condition ?? undefined,
+        // Dotted is the override. Dashed means "only sometimes" until the path is taken —
+        // after that the condition stays on the label, but the stroke is solid so a finished
+        // branch does not still look tentative.
+        Style: forced ? 'dotted' : (conditional && !traveled ? 'dashed' : 'solid'),
+        Color: flowing
+            ? 'var(--mj-brand-primary)'
+            : (forced ? 'var(--mj-status-warning)' : (traveled ? 'var(--mj-status-success)' : undefined)),
+        StrokeWidth: flowing ? 4.5 : (traveled || forced ? 3 : undefined),
+        Animated: flowing,
+        Data: { FromTempId: dep.tempId, ToTempId: toTempId, EdgeID: dep.id },
+    };
+}
+const TERMINAL_RUNTIME = new Set(['Complete', 'Failed', 'Cancelled', 'Skipped']);
+function isPausedHere(taskID, runtime, debug) {
+    if (debug?.pausedAtTaskID !== taskID)
+        return false;
+    const state = runtime?.[taskID];
+    return !state || !TERMINAL_RUNTIME.has(state);
+}
+/**
+ * The step the operator has to act on: the breakpoint we stopped at, or — at start-paused
+ * before any claim — the entry node.
+ */
+function isAwaitingUser(taskID, entryIds, runtime, debug) {
+    if (isPausedHere(taskID, runtime, debug))
+        return true;
+    if (!debug?.paused || debug.pausedAtTaskID)
+        return false;
+    if (!entryIds.has(taskID))
+        return false;
+    const state = runtime?.[taskID];
+    return !state || !TERMINAL_RUNTIME.has(state);
+}
+/**
+ * The next claimable step: prerequisites are done (or it is an entry) and the engine has not
+ * started it. Distinct from "waiting on you" — this one is waiting on the dispatcher.
+ */
+function isNextToRun(task, runtime, debug, entryIds) {
+    if (isAwaitingUser(task.tempId, entryIds ?? new Set(), runtime, debug))
+        return false;
+    const state = runtime?.[task.tempId];
+    if (state === 'In Progress' || (state && TERMINAL_RUNTIME.has(state)))
+        return false;
+    const incoming = GetDependencies(task);
+    if (incoming.length === 0)
+        return true;
+    const live = incoming.filter((d) => runtime?.[d.tempId] !== 'Skipped');
+    if (live.length === 0)
+        return false;
+    return live.every((d) => runtime?.[d.tempId] === 'Complete');
+}
+function isFlowingEdge(fromTempId, toTempId, runtime, debug) {
+    if (isPausedHere(toTempId, runtime, debug))
+        return true;
+    if (debug?.activeEdgeIDs?.includes(edgeId(fromTempId, toTempId)))
+        return true;
+    if (!runtime)
+        return false;
+    return runtime[fromTempId] === 'Complete' && runtime[toTempId] === 'In Progress';
+}
+const TAKEN_ORIGIN = new Set(['Complete', 'Failed', 'Cancelled']);
+const TAKEN_DEST = new Set(['In Progress', 'Complete', 'Failed', 'Cancelled']);
+/**
+ * Path already taken — origin finished AND dest has actually started. Pending dests are still
+ * candidates (a gate has not fired), so they stay dashed until one is claimed and the rest skip.
+ */
+function isTraveledEdge(fromTempId, toTempId, runtime) {
+    if (!runtime)
+        return false;
+    const fromState = runtime[fromTempId];
+    const toState = runtime[toTempId];
+    if (!fromState || !TAKEN_ORIGIN.has(fromState))
+        return false;
+    if (!toState || !TAKEN_DEST.has(toState))
+        return false;
+    return true;
+}
+function TruncateCondition(text, max = 28) {
+    return text.length <= max ? text : `${text.slice(0, max - 1)}…`;
+}
 /**
  * Adds a dependency to the spec, returning a NEW spec.
  *

package/dist/lib/task-graph-canvas-adapter.js.map

@@ -1 +1 @@
-{"version":3,"file":"task-graph-canvas-adapter.js","sourceRoot":"","sources":["../../src/lib/task-graph-canvas-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EACH,QAAQ,EACR,mBAAmB,EACnB,QAAQ,GAKX,MAAM,8BAA8B,CAAC;AA6BtC;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAyB;IAC1D,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,WAAW,CAAC;AACjF,CAAC;AAKD,MAAM,gBAAgB,GAAuC;IACzD,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE;IAC7D,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;CACrE,CAAC;AAEF,kFAAkF;AAClF,MAAM,CAAC,MAAM,qBAAqB,GAAuC;IACrE;QACI,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,YAAY;QACnB,IAAI,EAAE,UAAU;QAChB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;IACD;QACI,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,aAAa;QACpB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;IACD;QACI,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,aAAa;QACpB,IAAI,EAAE,eAAe;QACrB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;CACJ,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAyC;IACzE,GAAG,qBAAqB;IACxB,EAAE,IAAI,EAAE,YAAY,EAAI,KAAK,EAAE,aAAa,EAAI,IAAI,EAAE,iBAAiB,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,aAAa,EAAG,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,WAAW,EAAQ,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,WAAW,EAAK,KAAK,EAAE,YAAY,EAAK,IAAI,EAAE,WAAW,EAAQ,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,+BAA+B,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;CAC/J,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC1C,OAAO,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC;AACxE,CAAC;AAeD;;;;;;;GAOG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAwC;IAC7E,QAAQ,KAAK,EAAE,CAAC;QACZ,KAAK,aAAa,CAAC,CAAC,OAAO,SAAS,CAAC;QACrC,KAAK,UAAU,CAAC,CAAI,OAAO,SAAS,CAAC;QACrC,KAAK,QAAQ,CAAC,CAAM,OAAO,OAAO,CAAC;QACnC,KAAK,SAAS,CAAC,CAAK,OAAO,SAAS,CAAC;QACrC,KAAK,WAAW,CAAC,CAAG,OAAO,UAAU,CAAC;QACtC,KAAK,UAAU,CAAC,CAAI,OAAO,SAAS,CAAC;QACrC,KAAK,SAAS,CAAC,CAAK,OAAO,SAAS,CAAC;QACrC,OAAO,CAAC,CAAY,OAAO,SAAS,CAAC;IACzC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IAC/C,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;AACjC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,IAAuB;IACnD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,OAAO,CAAC,CAAI,OAAO,WAAW,CAAC;QACpC,KAAK,QAAQ,CAAC,CAAG,OAAO,YAAY,CAAC;QACrC,KAAK,QAAQ,CAAC,CAAG,OAAO,YAAY,CAAC;QACrC,KAAK,SAAS,CAAC,CAAE,OAAO,aAAa,CAAC;QACtC,KAAK,OAAO,CAAC,CAAI,OAAO,WAAW,CAAC;QACpC,KAAK,UAAU,CAAC,CAAC,OAAO,cAAc,CAAC;QACvC,0FAA0F;QAC1F,kFAAkF;QAClF,OAAO,CAAC,CAAS,OAAO,WAAW,CAAC;IACxC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CAC/B,IAAmB,EACnB,IAAuB,EACvB,WAAwD,EAAE;IAE1D,MAAM,IAAI,GAAiB;QACvB,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC;QACxB,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC;QAC1B,WAAW,EAAE,EAAE;QACf,SAAS,EAAE,EAAE;KAChB,CAAC;IACF,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,WAAW,CAAC,CAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/C,wFAAwF;QACxF,0FAA0F;QAC1F,kDAAkD;QAClD,KAAK,YAAY,CAAC,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3F,OAAO,CAAC,CAAW,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC,CAAC;IAC5F,CAAC;AACL,CAAC;AAED,qFAAqF;AACrF,MAAM,cAAc,GAAsC;IACtD,SAAS,EAAE,gBAAgB;IAC3B,UAAU,EAAE,iBAAiB;IAC7B,SAAS,EAAE,iBAAiB;CAC/B,CAAC;AAEF,iGAAiG;AACjG,MAAM,UAAU,eAAe,CAAC,IAAmB;IAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,eAAe,CAAC,IAAuB;IACnD,OAAO,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;AAC3D,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,aAAa,CAAC,IAAmB,EAAE,MAAc;IAC7D,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;SAClE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,+EAA+E;AAC/E,SAAS,MAAM,CAAC,UAAkB,EAAE,QAAgB;IAChD,OAAO,GAAG,UAAU,KAAK,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED;;;;;;GAMG;AACH;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CACvB,IAAmB,EACnB,OAAgC,EAChC,SAA6C;IAE7C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IAEhD,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,OAAO;YACH,EAAE,EAAE,IAAI,CAAC,MAAM;YACf,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,QAAQ,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;YAClC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,iBAAiB;YACxD,MAAM,EAAE,wBAAwB,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxD,aAAa,EAAE,IAAI,CAAC,WAAW;YAC/B,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YACtC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;YAC/C,KAAK,EAAE;gBACH,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE;gBAC7D,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;aACrE;YACD,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;SAChC,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAuB,EAAE,OAA4B,eAAe,CAAC,IAAI,CAAC;IACnG,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,WAAW,CAAC,CAAI,OAAO,qBAAqB,CAAC;QAClD,KAAK,YAAY,CAAC,CAAG,OAAO,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,sBAAsB,CAAC;QAC3F,KAAK,YAAY,CAAC,CAAG,OAAO,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,sBAAsB,CAAC;QAC3F,oFAAoF;QACpF,KAAK,aAAa,CAAC,CAAE,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,uBAAuB,CAAC;QAChG,KAAK,WAAW,CAAC,CAAI,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,sCAAsC,CAAC;QAC7G,KAAK,cAAc,CAAC,CAAC,OAAO,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,MAAM,IAAI,gCAAgC,CAAC;QACnG,uFAAuF;QACvF,uFAAuF;QACvF,gEAAgE;QAChE,OAAO,CAAC,CAAa,OAAO,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,IAAI,qBAAqB,CAAC;IAC5F,CAAC;AACL,CAAC;AAED,yCAAyC;AACzC,SAAS,aAAa,CAClB,EAA4G;IAE5G,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC;IACrE,OAAO,IAAI,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAmB;IACjD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,WAAW,GAAqB,EAAE,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAErC,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;YAC5C,WAAW,CAAC,IAAI,CAAC;gBACb,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;gBACnC,uFAAuF;gBACvF,YAAY,EAAE,GAAG,CAAC,MAAM;gBACxB,YAAY,EAAE,KAAK;gBACnB,YAAY,EAAE,IAAI,CAAC,MAAM;gBACzB,YAAY,EAAE,IAAI;gBAClB,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;gBACrC,WAAW,EAAE,GAAG,CAAC,SAAS,IAAI,SAAS;gBACvC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS;gBACrD,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,SAAS;gBACrC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO;gBACvC,IAAI,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE;aAC1D,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IACD,OAAO,WAAW,CAAC;AACvB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB,EAAE,SAAkB;IACvG,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACnC,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC/D,MAAM,IAAI,GAAiC,SAAS,EAAE,IAAI,EAAE;gBACxD,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE;gBACnC,CAAC,CAAC,UAAU,CAAC;YACjB,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;QACrE,CAAC,CAAC;KACL,CAAC;AACN,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,gBAAgB,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB;IACtF,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACnC,IAAI,CAAC,MAAM,KAAK,QAAQ;YACpB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,EAAE,CACnH;KACJ,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAc;IAC1D,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;KACtH,CAAC;AACN,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,OAAO,CAAC,IAAmB,EAAE,IAAuB;IAChE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AAC7D,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAc,EAAE,IAAuB;IACnF,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/F,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB;IACtF,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEzC,2FAA2F;IAC3F,oDAAoD;IACpD,MAAM,cAAc,GAAG,IAAI,GAAG,CAC1B,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CACrF,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,IAAI,OAAO,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAM,GAAG,MAAM;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;QAAE,CAAC,EAAE,CAAC;IACvC,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;AAC3B,CAAC","sourcesContent":["/**\n * @fileoverview Projects a `TaskGraphSpec` onto the generic canvas shapes, and back.\n *\n * **Kept pure and separate from the component on purpose.** Everything interesting about rendering a\n * task graph — which node is an entry point, which edge is conditional, how a runtime status maps to\n * a visual one, whether removing a node orphans an edge — is decidable from data alone. Putting it\n * in a component would make it reachable only through a TestBed, and the resulting tests would be\n * about Angular rather than about graphs.\n *\n * **The direction flip, again.** A `TaskGraphSpec` edge points *backwards* (`dependsOn`: \"I wait for\n * X\"); a canvas connection points *forwards* (source → target). Same edge, opposite authoring\n * convention — the graph is written by whoever knows the prerequisites, the canvas drawn by whoever\n * follows the arrows. This is the second place in the program that inversion appears (Save as\n * Workflow is the first), which is why it is stated rather than left implicit.\n *\n * @module @memberjunction/ng-task-graph-editor\n */\nimport {\n    ConfigOf,\n    NormalizeDependency,\n    TaskNode,\n    type TaskNodeBase,\n    type TaskGraphSpec,\n    type TaskGraphSpecNode,\n    type TaskGraphDependency,\n} from '@memberjunction/ai-core-plus';\nimport type { FlowConnection, FlowNode, FlowNodeStatus, FlowNodeTypeConfig, FlowPosition } from '@memberjunction/ng-flow-editor';\n\n/**\n * The shapes this canvas can DRAW.\n *\n * Three of the spec's seven `kind`s, and the choice is the canvas's: these are the shapes a person\n * authors. `Prompt`, `ForEach`, `While` and `External` are expressible in the spec but have no\n * authoring affordance here — a palette entry that cannot be configured would be worse than none.\n *\n * **Drawing and RENDERING are different questions**, which this type used to conflate. A run's\n * graph is displayed on the same canvas, and it contains kinds nobody can draw — so mapping them\n * all to `AgentTask` made a fully-configured ForEach render as \"AGENT STEP · No agent chosen yet\",\n * which is not merely imprecise: it says the step is broken. See {@link TaskGraphRenderType}.\n */\nexport type TaskGraphNodeType = 'AgentTask' | 'ActionTask' | 'HumanTask';\n\n/**\n * The shapes this canvas can SHOW — a superset of what it can draw.\n *\n * Display-only kinds exist because a task graph is rendered in two places: the editor, where a\n * person builds one, and a run view, where one that already ran is shown. The second must be able\n * to depict every kind the dispatcher can execute, whether or not the palette offers it.\n */\nexport type TaskGraphRenderType = TaskGraphNodeType | 'PromptTask' | 'ForEachTask' | 'WhileTask' | 'ExternalTask';\n\n/** A palette entry, pinned to one of the three authorable shapes. */\nexport type TaskGraphNodeTypeConfig = FlowNodeTypeConfig & { Type: TaskGraphNodeType };\n\n/**\n * Whether a shape is one a person can actually author here.\n *\n * The authoring paths — the palette, `NewTaskFromNodeType`, the properties panel — only handle the\n * three drawable shapes. Rendering handles more. This is the seam between the two, stated as a type\n * guard so the compiler enforces it rather than a cast pretending the distinction does not exist.\n */\nexport function IsAuthorableNodeType(type: TaskGraphRenderType): type is TaskGraphNodeType {\n    return type === 'AgentTask' || type === 'ActionTask' || type === 'HumanTask';\n}\n\n/** A rendering entry — every shape the canvas can depict, authorable or not. */\nexport type TaskGraphRenderTypeConfig = FlowNodeTypeConfig & { Type: TaskGraphRenderType };\n\nconst TASK_GRAPH_PORTS: FlowNodeTypeConfig['DefaultPorts'] = [\n    { ID: 'in', Direction: 'input', Side: 'top', Multiple: true },\n    { ID: 'out', Direction: 'output', Side: 'bottom', Multiple: true },\n];\n\n/** What the palette offers — one entry per assignment shape the spec supports. */\nexport const TASK_GRAPH_NODE_TYPES: readonly TaskGraphNodeTypeConfig[] = [\n    {\n        Type: 'AgentTask',\n        Label: 'Agent Step',\n        Icon: 'fa-robot',\n        Color: '#4A6FA5',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n    {\n        Type: 'ActionTask',\n        Label: 'Action Step',\n        Icon: 'fa-bolt',\n        Color: '#3B82F6',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n    {\n        Type: 'HumanTask',\n        Label: 'Person Step',\n        Icon: 'fa-user-check',\n        Color: '#7B1FA2',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n];\n\n/**\n * Everything the canvas can DEPICT: the palette, plus the kinds that only ever arrive from a run.\n *\n * Deliberately a superset rather than an extension of the palette — adding these to\n * `TASK_GRAPH_NODE_TYPES` would put un-configurable entries in the authoring toolbox.\n */\nexport const TASK_GRAPH_RENDER_TYPES: readonly TaskGraphRenderTypeConfig[] = [\n    ...TASK_GRAPH_NODE_TYPES,\n    { Type: 'PromptTask',   Label: 'Prompt Step',   Icon: 'fa-comment-dots', Color: '#8B5CF6', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'ForEachTask',  Label: 'For Each Step', Icon: 'fa-repeat',       Color: '#D97706', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'WhileTask',    Label: 'While Step',    Icon: 'fa-rotate',       Color: '#D97706', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'ExternalTask', Label: 'External Step', Icon: 'fa-arrow-up-right-from-square', Color: '#0891B2', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n];\n\n/**\n * The config for a node type, or null when the type is not one of ours.\n *\n * Searches the RENDER set, so a run's ForEach resolves to its own icon and label instead of\n * silently falling back to the agent shape.\n */\nexport function GetNodeTypeConfig(type: string): TaskGraphRenderTypeConfig | null {\n    return TASK_GRAPH_RENDER_TYPES.find((c) => c.Type === type) ?? null;\n}\n\n/** Live per-task state for the runtime overlay, keyed by `tempId`. */\nexport type TaskGraphRuntimeStatus = Record<string, TaskGraphRuntimeState>;\n\n/** What a task is doing right now, in the durable engine's own vocabulary. */\nexport type TaskGraphRuntimeState =\n    | 'Pending'\n    | 'In Progress'\n    | 'Complete'\n    | 'Failed'\n    | 'Blocked'\n    | 'Cancelled'\n    | 'Deferred';\n\n/**\n * Maps a durable task state onto the canvas's visual vocabulary.\n *\n * Two mappings are worth explaining. `Blocked` renders as a **warning**, not an error: nothing went\n * wrong, the graph simply cannot reach it — showing it as a failure would send someone hunting for a\n * bug that does not exist. `Deferred` renders as `pending` because, to the person watching, waiting\n * on a schedule and waiting on a prerequisite look and mean the same thing.\n */\nexport function RuntimeStateToNodeStatus(state: TaskGraphRuntimeState | undefined): FlowNodeStatus {\n    switch (state) {\n        case 'In Progress': return 'running';\n        case 'Complete':    return 'success';\n        case 'Failed':      return 'error';\n        case 'Blocked':     return 'warning';\n        case 'Cancelled':   return 'disabled';\n        case 'Deferred':    return 'pending';\n        case 'Pending':     return 'pending';\n        default:            return 'default';\n    }\n}\n\n/**\n * True when the node is a person's step.\n *\n * One field decides it now: spec v2 gives every node exactly one `kind`, so \"is this a person's\n * step\" stopped being an inference over three optional flags and became a comparison.\n */\nexport function IsHumanTask(node: TaskGraphSpecNode): boolean {\n    return node.kind === 'Human';\n}\n\n/**\n * Which of the three shapes a node is, for rendering.\n *\n * An unassigned node (just added, nothing picked yet) reads as an agent step: it is the commonest\n * intent, and the validator is already telling the author, in words, that it needs an assignee.\n * Guessing \"person\" instead — which is what the old `!agentName` rule did — put a step in the\n * graph that claimed to be waiting on someone when nobody had said so.\n */\nexport function GetTaskNodeType(node: TaskGraphSpecNode): TaskGraphRenderType {\n    switch (node.kind) {\n        case 'Human':    return 'HumanTask';\n        case 'Action':   return 'ActionTask';\n        case 'Prompt':   return 'PromptTask';\n        case 'ForEach':  return 'ForEachTask';\n        case 'While':    return 'WhileTask';\n        case 'External': return 'ExternalTask';\n        // An unassigned node — just added, nothing picked — reads as an agent step: the commonest\n        // intent, and the validator is already saying in words that it needs an assignee.\n        default:         return 'AgentTask';\n    }\n}\n\n/**\n * Builds the task a palette entry stands for.\n *\n * Pure, and here rather than in the component, because \"what does clicking *Person Step* actually\n * put in the graph\" is a fact about the spec — testable without a TestBed, and the one place the\n * assignment xor is honoured on creation.\n *\n * `defaultAgentName` / `defaultActionName` are what the host has to offer. When it has nothing, the\n * step is created unassigned on purpose: inventing an agent name that may not exist would produce a\n * graph that passes the canvas and fails at submission, whereas an unassigned step is reported\n * immediately by the same validator the engine runs.\n */\nexport function NewTaskFromNodeType(\n    spec: TaskGraphSpec,\n    type: TaskGraphNodeType,\n    defaults: { agentName?: string; actionName?: string } = {},\n): TaskGraphSpecNode {\n    const base: TaskNodeBase = {\n        tempId: NextTempId(spec),\n        name: NEW_TASK_NAMES[type],\n        description: '',\n        dependsOn: [],\n    };\n    switch (type) {\n        case 'HumanTask':  return TaskNode.Human(base);\n        // A step created before the host has any names to offer is created with an empty one on\n        // purpose: the validator reports it immediately, whereas inventing a name would produce a\n        // graph that passes here and fails at submission.\n        case 'ActionTask': return TaskNode.Action(base, { actionName: defaults.actionName ?? '' });\n        default:           return TaskNode.Agent(base, { agentName: defaults.agentName ?? '' });\n    }\n}\n\n/** Default step names, so a new box says what it is before the author renames it. */\nconst NEW_TASK_NAMES: Record<TaskGraphNodeType, string> = {\n    AgentTask: 'New agent step',\n    ActionTask: 'New action step',\n    HumanTask: 'New person step',\n};\n\n/** Entry points: nodes nothing else has to finish first. Same rule the traversal engine uses. */\nexport function GetEntryTempIds(spec: TaskGraphSpec): string[] {\n    return (spec.tasks ?? []).filter((t) => (t.dependsOn ?? []).length === 0).map((t) => t.tempId);\n}\n\n/** Every dependency of a node, in normalized object form. */\nexport function GetDependencies(node: TaskGraphSpecNode): TaskGraphDependency[] {\n    return (node.dependsOn ?? []).map(NormalizeDependency);\n}\n\n/** The `tempId`s that depend on `tempId` — i.e. what breaks if it is removed. */\nexport function GetDependents(spec: TaskGraphSpec, tempId: string): string[] {\n    return (spec.tasks ?? [])\n        .filter((t) => GetDependencies(t).some((d) => d.tempId === tempId))\n        .map((t) => t.tempId);\n}\n\n/** Deterministic id for a canvas edge, so re-renders don't churn selection. */\nfunction edgeId(fromTempId: string, toTempId: string): string {\n    return `${fromTempId}->${toTempId}`;\n}\n\n/**\n * Projects the spec onto canvas nodes.\n *\n * Positions are left at the origin: layout is the canvas's job (Dagre), and a spec carries no\n * geometry precisely because a task graph is a *logical* structure. An agent that emitted one never\n * had an opinion about where the boxes go.\n */\n/**\n * Projects the spec onto canvas nodes.\n *\n * `positions` carries geometry the spec cannot hold. `TaskGraphSpec` is an execution contract with\n * no layout field, so without a caller-held map every re-projection would return every node to the\n * origin — which is what previously forced a full re-arrange (and a viewport re-zoom) after every\n * single edit. Unknown ids fall back to the origin, which is also the correct starting state for a\n * graph that has never been laid out.\n */\nexport function SpecToNodes(\n    spec: TaskGraphSpec,\n    runtime?: TaskGraphRuntimeStatus,\n    positions?: ReadonlyMap<string, FlowPosition>,\n): FlowNode[] {\n    const entryIds = new Set(GetEntryTempIds(spec));\n\n    return (spec.tasks ?? []).map((task) => {\n        const type = GetTaskNodeType(task);\n        const known = positions?.get(task.tempId);\n        return {\n            ID: task.tempId,\n            Type: type,\n            Label: task.name,\n            Subtitle: TaskSubtitle(task, type),\n            Icon: GetNodeTypeConfig(type)?.Icon ?? 'fa-circle-nodes',\n            Status: RuntimeStateToNodeStatus(runtime?.[task.tempId]),\n            StatusMessage: task.description,\n            IsStartNode: entryIds.has(task.tempId),\n            Position: known ? { ...known } : { X: 0, Y: 0 },\n            Ports: [\n                { ID: 'in', Direction: 'input', Side: 'top', Multiple: true },\n                { ID: 'out', Direction: 'output', Side: 'bottom', Multiple: true },\n            ],\n            Data: { TempId: task.tempId },\n        };\n    });\n}\n\n/**\n * The one line under a node's name: who or what runs it.\n *\n * An unassigned step says so rather than showing nothing — a blank subtitle looks like a step that\n * is fine, and this one is the reason the validation banner is complaining.\n */\nexport function TaskSubtitle(task: TaskGraphSpecNode, type: TaskGraphRenderType = GetTaskNodeType(task)): string {\n    switch (type) {\n        case 'HumanTask':    return 'Waiting on a person';\n        case 'ActionTask':   return ConfigOf(task, 'Action')?.actionName || 'No action chosen yet';\n        case 'PromptTask':   return ConfigOf(task, 'Prompt')?.promptName || 'No prompt chosen yet';\n        // A loop's subtitle is what it REPEATS — the one fact that makes the node readable.\n        case 'ForEachTask':  return LoopBodyLabel(ConfigOf(task, 'ForEach')) ?? 'Repeats for each item';\n        case 'WhileTask':    return LoopBodyLabel(ConfigOf(task, 'While')) ?? 'Repeats until its condition is false';\n        case 'ExternalTask': return ConfigOf(task, 'External')?.domain || 'Completed by an outside system';\n        // Only a genuinely unassigned node reaches this now. It used to catch Prompt, ForEach,\n        // While and External too — so a fully-configured loop displayed \"No agent chosen yet\",\n        // which reads as a broken step rather than an unrecognised one.\n        default:             return ConfigOf(task, 'Agent')?.agentName || 'No agent chosen yet';\n    }\n}\n\n/** What a loop repeats, when it says. */\nfunction LoopBodyLabel(\n    op: { action?: { name: string }; subAgent?: { name: string }; prompt?: { name: string } } | null | undefined,\n): string | null {\n    if (!op) return null;\n    const body = op.action?.name ?? op.subAgent?.name ?? op.prompt?.name;\n    return body ? `Repeats: ${body}` : null;\n}\n\n/**\n * Projects the spec's dependencies onto canvas connections, reversing their direction.\n *\n * A conditional edge is drawn dashed and labeled with its condition, because the difference between\n * \"always\" and \"only sometimes\" is the single most consequential thing about an edge and the one a\n * reader is most likely to miss when scanning a diagram.\n *\n * Edges naming a task that is not in the graph are skipped rather than drawn dangling — the\n * validator reports them as `UnknownDependency`, and rendering a connection to nowhere would be a\n * second, worse way of saying the same thing.\n */\nexport function SpecToConnections(spec: TaskGraphSpec): FlowConnection[] {\n    const known = new Set((spec.tasks ?? []).map((t) => t.tempId));\n    const connections: FlowConnection[] = [];\n\n    for (const task of spec.tasks ?? []) {\n        for (const dep of GetDependencies(task)) {\n            if (!known.has(dep.tempId)) continue;\n\n            const conditional = !!dep.condition?.trim();\n            connections.push({\n                ID: edgeId(dep.tempId, task.tempId),\n                // Reversed: dependsOn points back at the prerequisite, the drawn arrow points forward.\n                SourceNodeID: dep.tempId,\n                SourcePortID: 'out',\n                TargetNodeID: task.tempId,\n                TargetPortID: 'in',\n                Label: conditional ? 'if' : undefined,\n                LabelDetail: dep.condition ?? undefined,\n                LabelIcon: conditional ? 'fa-code-branch' : undefined,\n                Condition: dep.condition ?? undefined,\n                Style: conditional ? 'dashed' : 'solid',\n                Data: { FromTempId: dep.tempId, ToTempId: task.tempId },\n            });\n        }\n    }\n    return connections;\n}\n\n/**\n * Adds a dependency to the spec, returning a NEW spec.\n *\n * Immutable because the component emits the result to a host that may keep it, diff it, or reject\n * it; mutating the input would let a canceled edit leak into the host's copy anyway. A duplicate\n * edge is a no-op rather than an error — dragging the same connection twice is a slip, not a\n * request to corrupt the graph.\n */\nexport function AddDependency(spec: TaskGraphSpec, fromTempId: string, toTempId: string, condition?: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? []).map((task) => {\n            if (task.tempId !== toTempId) return task;\n            const existing = GetDependencies(task);\n            if (existing.some((d) => d.tempId === fromTempId)) return task;\n            const next: TaskGraphDependency | string = condition?.trim()\n                ? { tempId: fromTempId, condition }\n                : fromTempId;\n            return { ...task, dependsOn: [...(task.dependsOn ?? []), next] };\n        }),\n    };\n}\n\n/** Removes a dependency, returning a NEW spec. */\nexport function RemoveDependency(spec: TaskGraphSpec, fromTempId: string, toTempId: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? []).map((task) =>\n            task.tempId !== toTempId\n                ? task\n                : { ...task, dependsOn: (task.dependsOn ?? []).filter((d) => NormalizeDependency(d).tempId !== fromTempId) },\n        ),\n    };\n}\n\n/**\n * Removes a task AND every edge into it, returning a NEW spec.\n *\n * Severing the inbound edges is not a convenience — leaving them would produce a graph whose\n * `dependsOn` names a task that no longer exists, which the validator rejects as\n * `UnknownDependency`. Deleting a box on a canvas should not make the graph invalid.\n */\nexport function RemoveTask(spec: TaskGraphSpec, tempId: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? [])\n            .filter((t) => t.tempId !== tempId)\n            .map((t) => ({ ...t, dependsOn: (t.dependsOn ?? []).filter((d) => NormalizeDependency(d).tempId !== tempId) })),\n    };\n}\n\n/** Adds a task, returning a NEW spec. */\nexport function AddTask(spec: TaskGraphSpec, task: TaskGraphSpecNode): TaskGraphSpec {\n    return { ...spec, tasks: [...(spec.tasks ?? []), task] };\n}\n\n/** Replaces a task in place by `tempId`, returning a NEW spec. */\nexport function UpdateTask(spec: TaskGraphSpec, tempId: string, next: TaskGraphSpecNode): TaskGraphSpec {\n    return { ...spec, tasks: (spec.tasks ?? []).map((t) => (t.tempId === tempId ? next : t)) };\n}\n\n/**\n * Would adding `from → to` create a cycle?\n *\n * Answered before the edge exists, so the canvas can refuse it rather than create an invalid graph\n * and report it afterwards. A self-edge is the degenerate case and is caught first.\n *\n * Iterative rather than recursive: the graph may come from an LLM, and a deeply-chained spec should\n * produce a refusal, not a stack overflow.\n */\nexport function WouldCreateCycle(spec: TaskGraphSpec, fromTempId: string, toTempId: string): boolean {\n    if (fromTempId === toTempId) return true;\n\n    // A cycle appears iff `from` is already reachable from `to` by following dependsOn edges —\n    // i.e. `to` already (transitively) waits on `from`.\n    const dependenciesOf = new Map<string, string[]>(\n        (spec.tasks ?? []).map((t) => [t.tempId, GetDependencies(t).map((d) => d.tempId)]),\n    );\n\n    const stack = [...(dependenciesOf.get(fromTempId) ?? [])];\n    const seen = new Set<string>();\n    while (stack.length > 0) {\n        const current = stack.pop()!;\n        if (current === toTempId) return true;\n        if (seen.has(current)) continue;\n        seen.add(current);\n        stack.push(...(dependenciesOf.get(current) ?? []));\n    }\n    return false;\n}\n\n/** A unique `tempId` for a newly added task, stable and readable. */\nexport function NextTempId(spec: TaskGraphSpec, prefix = 'task'): string {\n    const taken = new Set((spec.tasks ?? []).map((t) => t.tempId));\n    let n = (spec.tasks ?? []).length + 1;\n    while (taken.has(`${prefix}${n}`)) n++;\n    return `${prefix}${n}`;\n}\n"]}
+{"version":3,"file":"task-graph-canvas-adapter.js","sourceRoot":"","sources":["../../src/lib/task-graph-canvas-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EACH,QAAQ,EACR,mBAAmB,EACnB,QAAQ,GAKX,MAAM,8BAA8B,CAAC;AA6BtC;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAyB;IAC1D,OAAO,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,WAAW,CAAC;AACjF,CAAC;AAKD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc;IACtC,OAAO,GAAG,MAAM,KAAK,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,MAAc;IACvC,OAAO,GAAG,MAAM,MAAM,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,gBAAgB,GAAuC;IACzD,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE;IAC7D,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;CACrE,CAAC;AAEF,kFAAkF;AAClF,MAAM,CAAC,MAAM,qBAAqB,GAAuC;IACrE;QACI,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,YAAY;QACnB,IAAI,EAAE,UAAU;QAChB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;IACD;QACI,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,aAAa;QACpB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;IACD;QACI,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,aAAa;QACpB,IAAI,EAAE,eAAe;QACrB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,OAAO;QACjB,YAAY,EAAE,gBAAgB;KACjC;CACJ,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAyC;IACzE,GAAG,qBAAqB;IACxB,EAAE,IAAI,EAAE,YAAY,EAAI,KAAK,EAAE,aAAa,EAAI,IAAI,EAAE,iBAAiB,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,aAAa,EAAG,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,WAAW,EAAQ,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,WAAW,EAAK,KAAK,EAAE,YAAY,EAAK,IAAI,EAAE,WAAW,EAAQ,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;IAC9I,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,+BAA+B,EAAE,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE;CAC/J,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC1C,OAAO,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC;AACxE,CAAC;AAkBD;;;;;;;GAOG;AACH,MAAM,UAAU,wBAAwB,CAAC,KAAwC;IAC7E,QAAQ,KAAK,EAAE,CAAC;QACZ,KAAK,aAAa,CAAC,CAAC,OAAO,SAAS,CAAC;QACrC,KAAK,UAAU,CAAC,CAAI,OAAO,SAAS,CAAC;QACrC,KAAK,QAAQ,CAAC,CAAM,OAAO,OAAO,CAAC;QACnC,KAAK,SAAS,CAAC,CAAK,OAAO,SAAS,CAAC;QACrC,KAAK,WAAW,CAAC,CAAG,OAAO,UAAU,CAAC;QACtC,yFAAyF;QACzF,wFAAwF;QACxF,gFAAgF;QAChF,KAAK,SAAS,CAAC,CAAK,OAAO,SAAS,CAAC;QACrC,KAAK,UAAU,CAAC,CAAI,OAAO,SAAS,CAAC;QACrC,KAAK,SAAS,CAAC,CAAK,OAAO,SAAS,CAAC;QACrC,OAAO,CAAC,CAAY,OAAO,SAAS,CAAC;IACzC,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAAuB;IAC/C,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;AACjC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,IAAuB;IACnD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAChB,KAAK,OAAO,CAAC,CAAI,OAAO,WAAW,CAAC;QACpC,KAAK,QAAQ,CAAC,CAAG,OAAO,YAAY,CAAC;QACrC,KAAK,QAAQ,CAAC,CAAG,OAAO,YAAY,CAAC;QACrC,KAAK,SAAS,CAAC,CAAE,OAAO,aAAa,CAAC;QACtC,KAAK,OAAO,CAAC,CAAI,OAAO,WAAW,CAAC;QACpC,KAAK,UAAU,CAAC,CAAC,OAAO,cAAc,CAAC;QACvC,0FAA0F;QAC1F,kFAAkF;QAClF,OAAO,CAAC,CAAS,OAAO,WAAW,CAAC;IACxC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,mBAAmB,CAC/B,IAAmB,EACnB,IAAuB,EACvB,WAAwD,EAAE;IAE1D,MAAM,IAAI,GAAiB;QACvB,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC;QACxB,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC;QAC1B,WAAW,EAAE,EAAE;QACf,SAAS,EAAE,EAAE;KAChB,CAAC;IACF,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,WAAW,CAAC,CAAE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/C,wFAAwF;QACxF,0FAA0F;QAC1F,kDAAkD;QAClD,KAAK,YAAY,CAAC,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3F,OAAO,CAAC,CAAW,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC,CAAC;IAC5F,CAAC;AACL,CAAC;AAED,qFAAqF;AACrF,MAAM,cAAc,GAAsC;IACtD,SAAS,EAAE,gBAAgB;IAC3B,UAAU,EAAE,iBAAiB;IAC7B,SAAS,EAAE,iBAAiB;CAC/B,CAAC;AAEF,iGAAiG;AACjG,MAAM,UAAU,eAAe,CAAC,IAAmB;IAC/C,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,eAAe,CAAC,IAAuB;IACnD,OAAO,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;AAC3D,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,aAAa,CAAC,IAAmB,EAAE,MAAc;IAC7D,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;SAClE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,+EAA+E;AAC/E,SAAS,MAAM,CAAC,UAAkB,EAAE,QAAgB;IAChD,OAAO,GAAG,UAAU,KAAK,QAAQ,EAAE,CAAC;AACxC,CAAC;AAsCD,MAAM,UAAU,WAAW,CACvB,IAAmB,EACnB,OAAgC,EAChC,SAA6C,EAC7C,KAA6B;IAE7B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,EAAE,WAAW,IAAI,EAAE,CAAC,CAAC;IAEtD,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACnC,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,aAAa,CAAC;QACzD,OAAO;YACH,EAAE,EAAE,IAAI,CAAC,MAAM;YACf,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,QAAQ,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;YAClC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,iBAAiB;YACxD,SAAS,EAAE,QAAQ,IAAI,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,SAAS;YACnF,kFAAkF;YAClF,+EAA+E;YAC/E,MAAM,EAAE,wBAAwB,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxD,aAAa,EAAE,IAAI,CAAC,WAAW;YAC/B,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YACtC,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC;YAC3E,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;YAC/C,KAAK,EAAE;gBACH,EAAE,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE;gBACjF,EAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE;aACzF;YACD,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE;SAC9E,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,eAAe,CAC3B,MAAc,EACd,WAAgC,EAChC,KAA6B,EAC7B,OAAgC,EAChC,QAA8B;IAE9B,MAAM,MAAM,GAAoC,EAAE,CAAC;IACnD,IAAI,cAAc,CAAC,MAAM,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QAChE,MAAM,CAAC,IAAI,CAAC;YACR,KAAK,EAAE,oDAAoD;YAC3D,KAAK,EAAE,cAAc;YACrB,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,yBAAyB;SACnC,CAAC,CAAC;IACP,CAAC;IACD,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAI,CAAC;YACR,KAAK,EAAE,YAAY;YACnB,KAAK,EAAE,OAAO;YACd,IAAI,EAAE,WAAW;YACjB,KAAK,EAAE,wBAAwB;SAClC,CAAC,CAAC;IACP,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAuB,EAAE,OAA4B,eAAe,CAAC,IAAI,CAAC;IACnG,QAAQ,IAAI,EAAE,CAAC;QACX,KAAK,WAAW,CAAC,CAAI,OAAO,qBAAqB,CAAC;QAClD,KAAK,YAAY,CAAC,CAAG,OAAO,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,sBAAsB,CAAC;QAC3F,KAAK,YAAY,CAAC,CAAG,OAAO,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,sBAAsB,CAAC;QAC3F,oFAAoF;QACpF,KAAK,aAAa,CAAC,CAAE,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,uBAAuB,CAAC;QAChG,KAAK,WAAW,CAAC,CAAI,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,sCAAsC,CAAC;QAC7G,KAAK,cAAc,CAAC,CAAC,OAAO,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,MAAM,IAAI,gCAAgC,CAAC;QACnG,uFAAuF;QACvF,uFAAuF;QACvF,gEAAgE;QAChE,OAAO,CAAC,CAAa,OAAO,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,SAAS,IAAI,qBAAqB,CAAC;IAC5F,CAAC;AACL,CAAC;AAED,yCAAyC;AACzC,SAAS,aAAa,CAClB,EAA4G;IAE5G,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC;IACrE,OAAO,IAAI,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC7B,IAAmB,EACnB,OAAgC,EAChC,KAA6B;IAE7B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;IAChD,MAAM,WAAW,GAAqB,EAAE,CAAC;IAEzC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAErC,MAAM,QAAQ,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACrE,MAAM,aAAa,GAAG,OAAO;mBACtB,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC;YACjF,uFAAuF;YACvF,mEAAmE;YACnE,IAAI,aAAa,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAEzC,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,UAAU,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;YACrF,WAAW,CAAC,IAAI,CAAC,iBAAiB,CAC9B,GAAG,EACH,IAAI,CAAC,MAAM,EACX,QAAQ,EACR,KAAK,EAAE,cAAc,KAAK,IAAI,EAC9B,OAAO,EACP,CAAC,OAAO,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAC/D,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IACD,OAAO,WAAW,CAAC;AACvB,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,iBAAiB,CAC7B,GAAwB,EACxB,QAAgB,EAChB,QAA2B,EAC3B,iBAA0B,KAAK,EAC/B,UAAmB,KAAK,EACxB,WAAoB,KAAK;IAEzB,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC;IAC5C,MAAM,MAAM,GAAG,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,OAAO,CAAC;IAC3D,MAAM,cAAc,GAAG,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE;QACxC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACzC,CAAC,CAAC,SAAS,CAAC;IAEhB,OAAO;QACH,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC;QAChC,YAAY,EAAE,GAAG,CAAC,MAAM;QACxB,YAAY,EAAE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;QACtC,YAAY,EAAE,QAAQ;QACtB,YAAY,EAAE,WAAW,CAAC,QAAQ,CAAC;QACnC,KAAK,EAAE,MAAM;YACT,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC;YACpD,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5F,WAAW,EAAE,MAAM;YACf,CAAC,CAAC,6BAA6B,QAAQ,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;YACtF,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC;QAClC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,SAAS;QAC/D,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,SAAS;QACrC,kFAAkF;QAClF,qFAAqF;QACrF,wCAAwC;QACxC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;QAC1E,KAAK,EAAE,OAAO;YACV,CAAC,CAAC,yBAAyB;YAC3B,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACjG,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjE,QAAQ,EAAE,OAAO;QACjB,IAAI,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE;KACvE,CAAC;AACN,CAAC;AAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAwB,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;AAExG,SAAS,YAAY,CACjB,MAAc,EACd,OAAgC,EAChC,KAAqD;IAErD,IAAI,KAAK,EAAE,cAAc,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC;IACnD,MAAM,KAAK,GAAG,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,CAAC,KAAK,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACnB,MAAc,EACd,QAA6B,EAC7B,OAAgC,EAChC,KAA6B;IAE7B,IAAI,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,IAAI,CAAC,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,cAAc;QAAE,OAAO,KAAK,CAAC;IACzD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,MAAM,KAAK,GAAG,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC;IAChC,OAAO,CAAC,KAAK,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAChB,IAAuB,EACvB,OAAgC,EAChC,KAA6B,EAC7B,QAA8B;IAE9B,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrF,MAAM,KAAK,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,KAAK,KAAK,aAAa,IAAI,CAAC,KAAK,IAAI,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACpF,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC;IACvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,UAAU,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,aAAa,CAClB,UAAkB,EAClB,QAAgB,EAChB,OAAgC,EAChC,KAA6B;IAE7B,IAAI,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACxD,IAAI,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9E,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,OAAO,OAAO,CAAC,UAAU,CAAC,KAAK,UAAU,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,aAAa,CAAC;AACrF,CAAC;AAED,MAAM,YAAY,GAAG,IAAI,GAAG,CAAwB,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC;AACzF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAwB,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC;AAEtG;;;GAGG;AACH,SAAS,cAAc,CACnB,UAAkB,EAClB,QAAgB,EAChB,OAAgC;IAEhC,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAI,CAAC,SAAS,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,IAAI,CAAC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IACvD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY,EAAE,MAAc,EAAE;IACrD,OAAO,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;AACpE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB,EAAE,SAAkB;IACvG,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACnC,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC/D,MAAM,IAAI,GAAiC,SAAS,EAAE,IAAI,EAAE;gBACxD,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE;gBACnC,CAAC,CAAC,UAAU,CAAC;YACjB,OAAO,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;QACrE,CAAC,CAAC;KACL,CAAC;AACN,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,gBAAgB,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB;IACtF,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACnC,IAAI,CAAC,MAAM,KAAK,QAAQ;YACpB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,EAAE,CACnH;KACJ,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAc;IAC1D,OAAO;QACH,GAAG,IAAI;QACP,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;KACtH,CAAC;AACN,CAAC;AAED,yCAAyC;AACzC,MAAM,UAAU,OAAO,CAAC,IAAmB,EAAE,IAAuB;IAChE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AAC7D,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAc,EAAE,IAAuB;IACnF,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/F,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAmB,EAAE,UAAkB,EAAE,QAAgB;IACtF,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEzC,2FAA2F;IAC3F,oDAAoD;IACpD,MAAM,cAAc,GAAG,IAAI,GAAG,CAC1B,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CACrF,CAAC;IAEF,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,IAAI,OAAO,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,SAAS;QAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,UAAU,CAAC,IAAmB,EAAE,MAAM,GAAG,MAAM;IAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;QAAE,CAAC,EAAE,CAAC;IACvC,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;AAC3B,CAAC","sourcesContent":["/**\n * @fileoverview Projects a `TaskGraphSpec` onto the generic canvas shapes, and back.\n *\n * **Kept pure and separate from the component on purpose.** Everything interesting about rendering a\n * task graph — which node is an entry point, which edge is conditional, how a runtime status maps to\n * a visual one, whether removing a node orphans an edge — is decidable from data alone. Putting it\n * in a component would make it reachable only through a TestBed, and the resulting tests would be\n * about Angular rather than about graphs.\n *\n * **The direction flip, again.** A `TaskGraphSpec` edge points *backwards* (`dependsOn`: \"I wait for\n * X\"); a canvas connection points *forwards* (source → target). Same edge, opposite authoring\n * convention — the graph is written by whoever knows the prerequisites, the canvas drawn by whoever\n * follows the arrows. This is the second place in the program that inversion appears (Save as\n * Workflow is the first), which is why it is stated rather than left implicit.\n *\n * @module @memberjunction/ng-task-graph-editor\n */\nimport {\n    ConfigOf,\n    NormalizeDependency,\n    TaskNode,\n    type TaskNodeBase,\n    type TaskGraphSpec,\n    type TaskGraphSpecNode,\n    type TaskGraphDependency,\n} from '@memberjunction/ai-core-plus';\nimport type { FlowConnection, FlowNode, FlowNodeStatus, FlowNodeTypeConfig, FlowPosition } from '@memberjunction/ng-flow-editor';\n\n/**\n * The shapes this canvas can DRAW.\n *\n * Three of the spec's seven `kind`s, and the choice is the canvas's: these are the shapes a person\n * authors. `Prompt`, `ForEach`, `While` and `External` are expressible in the spec but have no\n * authoring affordance here — a palette entry that cannot be configured would be worse than none.\n *\n * **Drawing and RENDERING are different questions**, which this type used to conflate. A run's\n * graph is displayed on the same canvas, and it contains kinds nobody can draw — so mapping them\n * all to `AgentTask` made a fully-configured ForEach render as \"AGENT STEP · No agent chosen yet\",\n * which is not merely imprecise: it says the step is broken. See {@link TaskGraphRenderType}.\n */\nexport type TaskGraphNodeType = 'AgentTask' | 'ActionTask' | 'HumanTask';\n\n/**\n * The shapes this canvas can SHOW — a superset of what it can draw.\n *\n * Display-only kinds exist because a task graph is rendered in two places: the editor, where a\n * person builds one, and a run view, where one that already ran is shown. The second must be able\n * to depict every kind the dispatcher can execute, whether or not the palette offers it.\n */\nexport type TaskGraphRenderType = TaskGraphNodeType | 'PromptTask' | 'ForEachTask' | 'WhileTask' | 'ExternalTask';\n\n/** A palette entry, pinned to one of the three authorable shapes. */\nexport type TaskGraphNodeTypeConfig = FlowNodeTypeConfig & { Type: TaskGraphNodeType };\n\n/**\n * Whether a shape is one a person can actually author here.\n *\n * The authoring paths — the palette, `NewTaskFromNodeType`, the properties panel — only handle the\n * three drawable shapes. Rendering handles more. This is the seam between the two, stated as a type\n * guard so the compiler enforces it rather than a cast pretending the distinction does not exist.\n */\nexport function IsAuthorableNodeType(type: TaskGraphRenderType): type is TaskGraphNodeType {\n    return type === 'AgentTask' || type === 'ActionTask' || type === 'HumanTask';\n}\n\n/** A rendering entry — every shape the canvas can depict, authorable or not. */\nexport type TaskGraphRenderTypeConfig = FlowNodeTypeConfig & { Type: TaskGraphRenderType };\n\n/**\n * Port ids are scoped to their NODE, and must be.\n *\n * The canvas resolves a connection by looking its `fOutputId` / `fInputId` up among all registered\n * ports — a flat, graph-wide namespace. Giving every node ports literally called `in` and `out` made\n * every node's ports collide with every other node's, so a connection could not name which node's\n * port it meant. The result was a workflow that drew its boxes correctly and **no edges at all**:\n * nothing errored, because an unresolvable port is simply a connection with nowhere to attach.\n *\n * The Flow Agent editor — the other consumer of this canvas, whose edges have always drawn — scopes\n * its ports the same way (`${stepId}-input` / `${stepId}-output`). This is that convention, named,\n * so a future producer cannot reintroduce the collision by writing the obvious literal.\n */\nexport function InputPortID(tempId: string): string {\n    return `${tempId}-in`;\n}\n\nexport function OutputPortID(tempId: string): string {\n    return `${tempId}-out`;\n}\n\n/**\n * Palette defaults. These carry the bare names because a palette entry describes a node TYPE, not a\n * placed node — there is no id to scope them to yet. {@link SpecToNodes} assigns the real, scoped\n * ids when a node is actually placed on the canvas.\n */\nconst TASK_GRAPH_PORTS: FlowNodeTypeConfig['DefaultPorts'] = [\n    { ID: 'in', Direction: 'input', Side: 'top', Multiple: true },\n    { ID: 'out', Direction: 'output', Side: 'bottom', Multiple: true },\n];\n\n/** What the palette offers — one entry per assignment shape the spec supports. */\nexport const TASK_GRAPH_NODE_TYPES: readonly TaskGraphNodeTypeConfig[] = [\n    {\n        Type: 'AgentTask',\n        Label: 'Agent Step',\n        Icon: 'fa-robot',\n        Color: '#4A6FA5',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n    {\n        Type: 'ActionTask',\n        Label: 'Action Step',\n        Icon: 'fa-bolt',\n        Color: '#3B82F6',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n    {\n        Type: 'HumanTask',\n        Label: 'Person Step',\n        Icon: 'fa-user-check',\n        Color: '#7B1FA2',\n        Category: 'Steps',\n        DefaultPorts: TASK_GRAPH_PORTS,\n    },\n];\n\n/**\n * Everything the canvas can DEPICT: the palette, plus the kinds that only ever arrive from a run.\n *\n * Deliberately a superset rather than an extension of the palette — adding these to\n * `TASK_GRAPH_NODE_TYPES` would put un-configurable entries in the authoring toolbox.\n */\nexport const TASK_GRAPH_RENDER_TYPES: readonly TaskGraphRenderTypeConfig[] = [\n    ...TASK_GRAPH_NODE_TYPES,\n    { Type: 'PromptTask',   Label: 'Prompt Step',   Icon: 'fa-comment-dots', Color: '#8B5CF6', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'ForEachTask',  Label: 'For Each Step', Icon: 'fa-repeat',       Color: '#D97706', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'WhileTask',    Label: 'While Step',    Icon: 'fa-rotate',       Color: '#D97706', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n    { Type: 'ExternalTask', Label: 'External Step', Icon: 'fa-arrow-up-right-from-square', Color: '#0891B2', Category: 'Steps', DefaultPorts: TASK_GRAPH_PORTS },\n];\n\n/**\n * The config for a node type, or null when the type is not one of ours.\n *\n * Searches the RENDER set, so a run's ForEach resolves to its own icon and label instead of\n * silently falling back to the agent shape.\n */\nexport function GetNodeTypeConfig(type: string): TaskGraphRenderTypeConfig | null {\n    return TASK_GRAPH_RENDER_TYPES.find((c) => c.Type === type) ?? null;\n}\n\n/** Live per-task state for the runtime overlay, keyed by `tempId`. */\nexport type TaskGraphRuntimeStatus = Record<string, TaskGraphRuntimeState>;\n\n/** What a task is doing right now, in the durable engine's own vocabulary. */\nexport type TaskGraphRuntimeState =\n    | 'Pending'\n    | 'In Progress'\n    | 'Complete'\n    | 'Failed'\n    | 'Blocked'\n    | 'Cancelled'\n    | 'Deferred'\n    // A branch the workflow did not take. Absent from this union until now, which is why it fell\n    // through to the default rendering and a not-taken step drew as an ordinary one.\n    | 'Skipped';\n\n/**\n * Maps a durable task state onto the canvas's visual vocabulary.\n *\n * Two mappings are worth explaining. `Blocked` renders as a **warning**, not an error: nothing went\n * wrong, the graph simply cannot reach it — showing it as a failure would send someone hunting for a\n * bug that does not exist. `Deferred` renders as `pending` because, to the person watching, waiting\n * on a schedule and waiting on a prerequisite look and mean the same thing.\n */\nexport function RuntimeStateToNodeStatus(state: TaskGraphRuntimeState | undefined): FlowNodeStatus {\n    switch (state) {\n        case 'In Progress': return 'running';\n        case 'Complete':    return 'success';\n        case 'Failed':      return 'error';\n        case 'Blocked':     return 'warning';\n        case 'Cancelled':   return 'disabled';\n        // Its own state, not a shade of disabled: a branch the workflow did not take is a normal\n        // outcome. Falling through to 'default' — which is what happened before — drew it as an\n        // ordinary node, so a conditional workflow looked like it had run every branch.\n        case 'Skipped':     return 'skipped';\n        case 'Deferred':    return 'pending';\n        case 'Pending':     return 'pending';\n        default:            return 'default';\n    }\n}\n\n/**\n * True when the node is a person's step.\n *\n * One field decides it now: spec v2 gives every node exactly one `kind`, so \"is this a person's\n * step\" stopped being an inference over three optional flags and became a comparison.\n */\nexport function IsHumanTask(node: TaskGraphSpecNode): boolean {\n    return node.kind === 'Human';\n}\n\n/**\n * Which of the three shapes a node is, for rendering.\n *\n * An unassigned node (just added, nothing picked yet) reads as an agent step: it is the commonest\n * intent, and the validator is already telling the author, in words, that it needs an assignee.\n * Guessing \"person\" instead — which is what the old `!agentName` rule did — put a step in the\n * graph that claimed to be waiting on someone when nobody had said so.\n */\nexport function GetTaskNodeType(node: TaskGraphSpecNode): TaskGraphRenderType {\n    switch (node.kind) {\n        case 'Human':    return 'HumanTask';\n        case 'Action':   return 'ActionTask';\n        case 'Prompt':   return 'PromptTask';\n        case 'ForEach':  return 'ForEachTask';\n        case 'While':    return 'WhileTask';\n        case 'External': return 'ExternalTask';\n        // An unassigned node — just added, nothing picked — reads as an agent step: the commonest\n        // intent, and the validator is already saying in words that it needs an assignee.\n        default:         return 'AgentTask';\n    }\n}\n\n/**\n * Builds the task a palette entry stands for.\n *\n * Pure, and here rather than in the component, because \"what does clicking *Person Step* actually\n * put in the graph\" is a fact about the spec — testable without a TestBed, and the one place the\n * assignment xor is honoured on creation.\n *\n * `defaultAgentName` / `defaultActionName` are what the host has to offer. When it has nothing, the\n * step is created unassigned on purpose: inventing an agent name that may not exist would produce a\n * graph that passes the canvas and fails at submission, whereas an unassigned step is reported\n * immediately by the same validator the engine runs.\n */\nexport function NewTaskFromNodeType(\n    spec: TaskGraphSpec,\n    type: TaskGraphNodeType,\n    defaults: { agentName?: string; actionName?: string } = {},\n): TaskGraphSpecNode {\n    const base: TaskNodeBase = {\n        tempId: NextTempId(spec),\n        name: NEW_TASK_NAMES[type],\n        description: '',\n        dependsOn: [],\n    };\n    switch (type) {\n        case 'HumanTask':  return TaskNode.Human(base);\n        // A step created before the host has any names to offer is created with an empty one on\n        // purpose: the validator reports it immediately, whereas inventing a name would produce a\n        // graph that passes here and fails at submission.\n        case 'ActionTask': return TaskNode.Action(base, { actionName: defaults.actionName ?? '' });\n        default:           return TaskNode.Agent(base, { agentName: defaults.agentName ?? '' });\n    }\n}\n\n/** Default step names, so a new box says what it is before the author renames it. */\nconst NEW_TASK_NAMES: Record<TaskGraphNodeType, string> = {\n    AgentTask: 'New agent step',\n    ActionTask: 'New action step',\n    HumanTask: 'New person step',\n};\n\n/** Entry points: nodes nothing else has to finish first. Same rule the traversal engine uses. */\nexport function GetEntryTempIds(spec: TaskGraphSpec): string[] {\n    return (spec.tasks ?? []).filter((t) => (t.dependsOn ?? []).length === 0).map((t) => t.tempId);\n}\n\n/** Every dependency of a node, in normalized object form. */\nexport function GetDependencies(node: TaskGraphSpecNode): TaskGraphDependency[] {\n    return (node.dependsOn ?? []).map(NormalizeDependency);\n}\n\n/** The `tempId`s that depend on `tempId` — i.e. what breaks if it is removed. */\nexport function GetDependents(spec: TaskGraphSpec, tempId: string): string[] {\n    return (spec.tasks ?? [])\n        .filter((t) => GetDependencies(t).some((d) => d.tempId === tempId))\n        .map((t) => t.tempId);\n}\n\n/** Deterministic id for a canvas edge, so re-renders don't churn selection. */\nfunction edgeId(fromTempId: string, toTempId: string): string {\n    return `${fromTempId}->${toTempId}`;\n}\n\n/**\n * Projects the spec onto canvas nodes.\n *\n * Positions are left at the origin: layout is the canvas's job (Dagre), and a spec carries no\n * geometry precisely because a task graph is a *logical* structure. An agent that emitted one never\n * had an opinion about where the boxes go.\n */\n/**\n * Projects the spec onto canvas nodes.\n *\n * `positions` carries geometry the spec cannot hold. `TaskGraphSpec` is an execution contract with\n * no layout field, so without a caller-held map every re-projection would return every node to the\n * origin — which is what previously forced a full re-arrange (and a viewport re-zoom) after every\n * single edit. Unknown ids fall back to the origin, which is also the correct starting state for a\n * graph that has never been laid out.\n */\n/**\n * Debug overlay the run view hands the adapter. Paint only — the widget never calls an operation.\n *\n * Breakpoints and the paused-at step become badges. Overrides restyle connections (dotted, never\n * dashed — dashed already means \"this edge is conditional\"). Held/forced edges stay visible even\n * when a skip cascade would otherwise drop them, so the run history cannot lie about why a branch\n * ran.\n */\nexport type TaskGraphDebugOverlay = {\n    breakpoints?: readonly string[];\n    pausedAtTaskID?: string | null;\n    /** Graph is claim-gated. With no paused-at step, the entry node is what is waiting. */\n    paused?: boolean;\n    edgeOverrides?: Readonly<Record<string, 'true' | 'false'>>;\n    /** Show the condition expression on the connection label, not just the word \"if\". */\n    showConditions?: boolean;\n    /** Edge IDs (or from→to) currently flowing — painted animated + brand. */\n    activeEdgeIDs?: readonly string[];\n};\n\nexport function SpecToNodes(\n    spec: TaskGraphSpec,\n    runtime?: TaskGraphRuntimeStatus,\n    positions?: ReadonlyMap<string, FlowPosition>,\n    debug?: TaskGraphDebugOverlay,\n): FlowNode[] {\n    const entryIds = new Set(GetEntryTempIds(spec));\n    const breakpoints = new Set(debug?.breakpoints ?? []);\n\n    return (spec.tasks ?? []).map((task) => {\n        const type = GetTaskNodeType(task);\n        const known = positions?.get(task.tempId);\n        const awaiting = isAwaitingUser(task.tempId, entryIds, runtime, debug);\n        const nextToRun = isNextToRun(task, runtime, debug, entryIds);\n        const running = runtime?.[task.tempId] === 'In Progress';\n        return {\n            ID: task.tempId,\n            Type: type,\n            Label: task.name,\n            Subtitle: TaskSubtitle(task, type),\n            Icon: GetNodeTypeConfig(type)?.Icon ?? 'fa-circle-nodes',\n            IconColor: awaiting || nextToRun || running ? 'var(--mj-brand-primary)' : undefined,\n            // Keep the real runtime status. Mapping \"paused here\" to `running` drew a spinner\n            // on a step that is waiting for the operator — it read as \"this is executing\".\n            Status: RuntimeStateToNodeStatus(runtime?.[task.tempId]),\n            StatusMessage: task.description,\n            IsStartNode: entryIds.has(task.tempId),\n            Badges: NodeDebugBadges(task.tempId, breakpoints, debug, runtime, entryIds),\n            Position: known ? { ...known } : { X: 0, Y: 0 },\n            Ports: [\n                { ID: InputPortID(task.tempId), Direction: 'input', Side: 'top', Multiple: true },\n                { ID: OutputPortID(task.tempId), Direction: 'output', Side: 'bottom', Multiple: true },\n            ],\n            Data: { TempId: task.tempId, AwaitingUser: awaiting, NextToRun: nextToRun },\n        };\n    });\n}\n\n/** Badge pills for an armed breakpoint and the step the graph actually stopped on. */\nexport function NodeDebugBadges(\n    taskID: string,\n    breakpoints: ReadonlySet<string>,\n    debug?: TaskGraphDebugOverlay,\n    runtime?: TaskGraphRuntimeStatus,\n    entryIds?: ReadonlySet<string>,\n): FlowNode['Badges'] {\n    const badges: NonNullable<FlowNode['Badges']> = [];\n    if (isAwaitingUser(taskID, entryIds ?? new Set(), runtime, debug)) {\n        badges.push({\n            Label: 'Waiting on you — Continue or Step to run this step',\n            Value: 'Waiting here',\n            Icon: 'fa-pause',\n            Color: 'var(--mj-brand-primary)',\n        });\n    }\n    if (breakpoints.has(taskID)) {\n        badges.push({\n            Label: 'Breakpoint',\n            Value: 'break',\n            Icon: 'fa-circle',\n            Color: 'var(--mj-status-error)',\n        });\n    }\n    return badges.length > 0 ? badges : undefined;\n}\n\n/**\n * The one line under a node's name: who or what runs it.\n *\n * An unassigned step says so rather than showing nothing — a blank subtitle looks like a step that\n * is fine, and this one is the reason the validation banner is complaining.\n */\nexport function TaskSubtitle(task: TaskGraphSpecNode, type: TaskGraphRenderType = GetTaskNodeType(task)): string {\n    switch (type) {\n        case 'HumanTask':    return 'Waiting on a person';\n        case 'ActionTask':   return ConfigOf(task, 'Action')?.actionName || 'No action chosen yet';\n        case 'PromptTask':   return ConfigOf(task, 'Prompt')?.promptName || 'No prompt chosen yet';\n        // A loop's subtitle is what it REPEATS — the one fact that makes the node readable.\n        case 'ForEachTask':  return LoopBodyLabel(ConfigOf(task, 'ForEach')) ?? 'Repeats for each item';\n        case 'WhileTask':    return LoopBodyLabel(ConfigOf(task, 'While')) ?? 'Repeats until its condition is false';\n        case 'ExternalTask': return ConfigOf(task, 'External')?.domain || 'Completed by an outside system';\n        // Only a genuinely unassigned node reaches this now. It used to catch Prompt, ForEach,\n        // While and External too — so a fully-configured loop displayed \"No agent chosen yet\",\n        // which reads as a broken step rather than an unrecognised one.\n        default:             return ConfigOf(task, 'Agent')?.agentName || 'No agent chosen yet';\n    }\n}\n\n/** What a loop repeats, when it says. */\nfunction LoopBodyLabel(\n    op: { action?: { name: string }; subAgent?: { name: string }; prompt?: { name: string } } | null | undefined,\n): string | null {\n    if (!op) return null;\n    const body = op.action?.name ?? op.subAgent?.name ?? op.prompt?.name;\n    return body ? `Repeats: ${body}` : null;\n}\n\n/**\n * Projects the spec's dependencies onto canvas connections, reversing their direction.\n *\n * A conditional edge is drawn dashed and labeled with its condition, because the difference between\n * \"always\" and \"only sometimes\" is the single most consequential thing about an edge and the one a\n * reader is most likely to miss when scanning a diagram.\n *\n * Edges naming a task that is not in the graph are skipped rather than drawn dangling — the\n * validator reports them as `UnknownDependency`, and rendering a connection to nowhere would be a\n * second, worse way of saying the same thing.\n */\nexport function SpecToConnections(\n    spec: TaskGraphSpec,\n    runtime?: TaskGraphRuntimeStatus,\n    debug?: TaskGraphDebugOverlay,\n): FlowConnection[] {\n    const known = new Set((spec.tasks ?? []).map((t) => t.tempId));\n    const entryIds = new Set(GetEntryTempIds(spec));\n    const connections: FlowConnection[] = [];\n\n    for (const task of spec.tasks ?? []) {\n        for (const dep of GetDependencies(task)) {\n            if (!known.has(dep.tempId)) continue;\n\n            const override = dep.id ? debug?.edgeOverrides?.[dep.id] : undefined;\n            const eitherSkipped = runtime\n                && (runtime[task.tempId] === 'Skipped' || runtime[dep.tempId] === 'Skipped');\n            // RUN MODE DRAWS ONLY THE PATH TAKEN — except an operator-forced edge, which must stay\n            // visible or the history lies about why a branch ran (or did not).\n            if (eitherSkipped && !override) continue;\n\n            const destQueued = isNextToRun(task, runtime, debug, entryIds);\n            const flowing = destQueued || isFlowingEdge(dep.tempId, task.tempId, runtime, debug);\n            connections.push(ProjectConnection(\n                dep,\n                task.tempId,\n                override,\n                debug?.showConditions === true,\n                flowing,\n                !flowing && isTraveledEdge(dep.tempId, task.tempId, runtime),\n            ));\n        }\n    }\n    return connections;\n}\n\n/** One canvas connection, including the override styling that must never look like a real verdict. */\nexport function ProjectConnection(\n    dep: TaskGraphDependency,\n    toTempId: string,\n    override?: 'true' | 'false',\n    showConditions: boolean = false,\n    flowing: boolean = false,\n    traveled: boolean = false,\n): FlowConnection {\n    const conditional = !!dep.condition?.trim();\n    const forced = override === 'true' || override === 'false';\n    const conditionLabel = dep.condition?.trim()\n        ? TruncateCondition(dep.condition.trim())\n        : undefined;\n\n    return {\n        ID: edgeId(dep.tempId, toTempId),\n        SourceNodeID: dep.tempId,\n        SourcePortID: OutputPortID(dep.tempId),\n        TargetNodeID: toTempId,\n        TargetPortID: InputPortID(toTempId),\n        Label: forced\n            ? (override === 'true' ? 'forced yes' : 'forced no')\n            : (conditional ? (showConditions && conditionLabel ? conditionLabel : 'if') : undefined),\n        LabelDetail: forced\n            ? `Operator set this path to ${override}${dep.condition ? ` — ${dep.condition}` : ''}`\n            : (dep.condition ?? undefined),\n        LabelIcon: forced ? 'fa-hand' : (conditional ? 'fa-code-branch' : undefined),\n        LabelIconColor: forced ? 'var(--mj-status-warning)' : undefined,\n        Condition: dep.condition ?? undefined,\n        // Dotted is the override. Dashed means \"only sometimes\" until the path is taken —\n        // after that the condition stays on the label, but the stroke is solid so a finished\n        // branch does not still look tentative.\n        Style: forced ? 'dotted' : (conditional && !traveled ? 'dashed' : 'solid'),\n        Color: flowing\n            ? 'var(--mj-brand-primary)'\n            : (forced ? 'var(--mj-status-warning)' : (traveled ? 'var(--mj-status-success)' : undefined)),\n        StrokeWidth: flowing ? 4.5 : (traveled || forced ? 3 : undefined),\n        Animated: flowing,\n        Data: { FromTempId: dep.tempId, ToTempId: toTempId, EdgeID: dep.id },\n    };\n}\n\nconst TERMINAL_RUNTIME = new Set<TaskGraphRuntimeState>(['Complete', 'Failed', 'Cancelled', 'Skipped']);\n\nfunction isPausedHere(\n    taskID: string,\n    runtime?: TaskGraphRuntimeStatus,\n    debug?: Pick<TaskGraphDebugOverlay, 'pausedAtTaskID'>,\n): boolean {\n    if (debug?.pausedAtTaskID !== taskID) return false;\n    const state = runtime?.[taskID];\n    return !state || !TERMINAL_RUNTIME.has(state);\n}\n\n/**\n * The step the operator has to act on: the breakpoint we stopped at, or — at start-paused\n * before any claim — the entry node.\n */\nfunction isAwaitingUser(\n    taskID: string,\n    entryIds: ReadonlySet<string>,\n    runtime?: TaskGraphRuntimeStatus,\n    debug?: TaskGraphDebugOverlay,\n): boolean {\n    if (isPausedHere(taskID, runtime, debug)) return true;\n    if (!debug?.paused || debug.pausedAtTaskID) return false;\n    if (!entryIds.has(taskID)) return false;\n    const state = runtime?.[taskID];\n    return !state || !TERMINAL_RUNTIME.has(state);\n}\n\n/**\n * The next claimable step: prerequisites are done (or it is an entry) and the engine has not\n * started it. Distinct from \"waiting on you\" — this one is waiting on the dispatcher.\n */\nfunction isNextToRun(\n    task: TaskGraphSpecNode,\n    runtime?: TaskGraphRuntimeStatus,\n    debug?: TaskGraphDebugOverlay,\n    entryIds?: ReadonlySet<string>,\n): boolean {\n    if (isAwaitingUser(task.tempId, entryIds ?? new Set(), runtime, debug)) return false;\n    const state = runtime?.[task.tempId];\n    if (state === 'In Progress' || (state && TERMINAL_RUNTIME.has(state))) return false;\n    const incoming = GetDependencies(task);\n    if (incoming.length === 0) return true;\n    const live = incoming.filter((d) => runtime?.[d.tempId] !== 'Skipped');\n    if (live.length === 0) return false;\n    return live.every((d) => runtime?.[d.tempId] === 'Complete');\n}\n\nfunction isFlowingEdge(\n    fromTempId: string,\n    toTempId: string,\n    runtime?: TaskGraphRuntimeStatus,\n    debug?: TaskGraphDebugOverlay,\n): boolean {\n    if (isPausedHere(toTempId, runtime, debug)) return true;\n    if (debug?.activeEdgeIDs?.includes(edgeId(fromTempId, toTempId))) return true;\n    if (!runtime) return false;\n    return runtime[fromTempId] === 'Complete' && runtime[toTempId] === 'In Progress';\n}\n\nconst TAKEN_ORIGIN = new Set<TaskGraphRuntimeState>(['Complete', 'Failed', 'Cancelled']);\nconst TAKEN_DEST = new Set<TaskGraphRuntimeState>(['In Progress', 'Complete', 'Failed', 'Cancelled']);\n\n/**\n * Path already taken — origin finished AND dest has actually started. Pending dests are still\n * candidates (a gate has not fired), so they stay dashed until one is claimed and the rest skip.\n */\nfunction isTraveledEdge(\n    fromTempId: string,\n    toTempId: string,\n    runtime?: TaskGraphRuntimeStatus,\n): boolean {\n    if (!runtime) return false;\n    const fromState = runtime[fromTempId];\n    const toState = runtime[toTempId];\n    if (!fromState || !TAKEN_ORIGIN.has(fromState)) return false;\n    if (!toState || !TAKEN_DEST.has(toState)) return false;\n    return true;\n}\n\nfunction TruncateCondition(text: string, max: number = 28): string {\n    return text.length <= max ? text : `${text.slice(0, max - 1)}…`;\n}\n\n/**\n * Adds a dependency to the spec, returning a NEW spec.\n *\n * Immutable because the component emits the result to a host that may keep it, diff it, or reject\n * it; mutating the input would let a canceled edit leak into the host's copy anyway. A duplicate\n * edge is a no-op rather than an error — dragging the same connection twice is a slip, not a\n * request to corrupt the graph.\n */\nexport function AddDependency(spec: TaskGraphSpec, fromTempId: string, toTempId: string, condition?: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? []).map((task) => {\n            if (task.tempId !== toTempId) return task;\n            const existing = GetDependencies(task);\n            if (existing.some((d) => d.tempId === fromTempId)) return task;\n            const next: TaskGraphDependency | string = condition?.trim()\n                ? { tempId: fromTempId, condition }\n                : fromTempId;\n            return { ...task, dependsOn: [...(task.dependsOn ?? []), next] };\n        }),\n    };\n}\n\n/** Removes a dependency, returning a NEW spec. */\nexport function RemoveDependency(spec: TaskGraphSpec, fromTempId: string, toTempId: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? []).map((task) =>\n            task.tempId !== toTempId\n                ? task\n                : { ...task, dependsOn: (task.dependsOn ?? []).filter((d) => NormalizeDependency(d).tempId !== fromTempId) },\n        ),\n    };\n}\n\n/**\n * Removes a task AND every edge into it, returning a NEW spec.\n *\n * Severing the inbound edges is not a convenience — leaving them would produce a graph whose\n * `dependsOn` names a task that no longer exists, which the validator rejects as\n * `UnknownDependency`. Deleting a box on a canvas should not make the graph invalid.\n */\nexport function RemoveTask(spec: TaskGraphSpec, tempId: string): TaskGraphSpec {\n    return {\n        ...spec,\n        tasks: (spec.tasks ?? [])\n            .filter((t) => t.tempId !== tempId)\n            .map((t) => ({ ...t, dependsOn: (t.dependsOn ?? []).filter((d) => NormalizeDependency(d).tempId !== tempId) })),\n    };\n}\n\n/** Adds a task, returning a NEW spec. */\nexport function AddTask(spec: TaskGraphSpec, task: TaskGraphSpecNode): TaskGraphSpec {\n    return { ...spec, tasks: [...(spec.tasks ?? []), task] };\n}\n\n/** Replaces a task in place by `tempId`, returning a NEW spec. */\nexport function UpdateTask(spec: TaskGraphSpec, tempId: string, next: TaskGraphSpecNode): TaskGraphSpec {\n    return { ...spec, tasks: (spec.tasks ?? []).map((t) => (t.tempId === tempId ? next : t)) };\n}\n\n/**\n * Would adding `from → to` create a cycle?\n *\n * Answered before the edge exists, so the canvas can refuse it rather than create an invalid graph\n * and report it afterwards. A self-edge is the degenerate case and is caught first.\n *\n * Iterative rather than recursive: the graph may come from an LLM, and a deeply-chained spec should\n * produce a refusal, not a stack overflow.\n */\nexport function WouldCreateCycle(spec: TaskGraphSpec, fromTempId: string, toTempId: string): boolean {\n    if (fromTempId === toTempId) return true;\n\n    // A cycle appears iff `from` is already reachable from `to` by following dependsOn edges —\n    // i.e. `to` already (transitively) waits on `from`.\n    const dependenciesOf = new Map<string, string[]>(\n        (spec.tasks ?? []).map((t) => [t.tempId, GetDependencies(t).map((d) => d.tempId)]),\n    );\n\n    const stack = [...(dependenciesOf.get(fromTempId) ?? [])];\n    const seen = new Set<string>();\n    while (stack.length > 0) {\n        const current = stack.pop()!;\n        if (current === toTempId) return true;\n        if (seen.has(current)) continue;\n        seen.add(current);\n        stack.push(...(dependenciesOf.get(current) ?? []));\n    }\n    return false;\n}\n\n/** A unique `tempId` for a newly added task, stable and readable. */\nexport function NextTempId(spec: TaskGraphSpec, prefix = 'task'): string {\n    const taken = new Set((spec.tasks ?? []).map((t) => t.tempId));\n    let n = (spec.tasks ?? []).length + 1;\n    while (taken.has(`${prefix}${n}`)) n++;\n    return `${prefix}${n}`;\n}\n"]}

package/dist/lib/task-graph-debug-toolbar.component.d.ts

@@ -0,0 +1,27 @@
+/**
+ * VS Code-style debug chrome: Continue / Pause / Step Over / Step Into / Stop.
+ *
+ * Intent only. The host owns Pause/Resume/Step Remote Operations. This widget never imports
+ * a transport, so the same bar can sit in the test harness and on the Explorer run console.
+ */
+import { EventEmitter } from '@angular/core';
+import * as i0 from "@angular/core";
+export declare class TaskGraphDebugToolbarComponent {
+    /** Graph is claim-gated. Continue / Step show; Pause hides. */
+    Paused: boolean;
+    /** A control is in flight — buttons disable, they do not vanish. */
+    Busy: boolean;
+    /** False when the graph has settled or there is nothing to drive. */
+    Enabled: boolean;
+    /** Every step is terminal — Play/Step hide; Finished is the state. */
+    Settled: boolean;
+    Pause: EventEmitter<void>;
+    Resume: EventEmitter<void>;
+    Step: EventEmitter<void>;
+    StepWave: EventEmitter<void>;
+    Cancel: EventEmitter<void>;
+    OnHotkey(event: KeyboardEvent): void;
+    static ɵfac: i0.ɵɵFactoryDeclaration<TaskGraphDebugToolbarComponent, never>;
+    static ɵcmp: i0.ɵɵComponentDeclaration<TaskGraphDebugToolbarComponent, "mj-task-graph-debug-toolbar", never, { "Paused": { "alias": "Paused"; "required": false; }; "Busy": { "alias": "Busy"; "required": false; }; "Enabled": { "alias": "Enabled"; "required": false; }; "Settled": { "alias": "Settled"; "required": false; }; }, { "Pause": "Pause"; "Resume": "Resume"; "Step": "Step"; "StepWave": "StepWave"; "Cancel": "Cancel"; }, never, never, true, never>;
+}
+//# sourceMappingURL=task-graph-debug-toolbar.component.d.ts.map

package/dist/lib/task-graph-debug-toolbar.component.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-graph-debug-toolbar.component.d.ts","sourceRoot":"","sources":["../../src/lib/task-graph-debug-toolbar.component.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAsC,YAAY,EAA+B,MAAM,eAAe,CAAC;;AAE9G,qBAOa,8BAA8B;IACvC,+DAA+D;IAC/C,MAAM,UAAS;IAC/B,oEAAoE;IACpD,IAAI,UAAS;IAC7B,qEAAqE;IACrD,OAAO,UAAQ;IAC/B,sEAAsE;IACtD,OAAO,UAAS;IAEf,KAAK,qBAA4B;IACjC,MAAM,qBAA4B;IAClC,IAAI,qBAA4B;IAChC,QAAQ,qBAA4B;IACpC,MAAM,qBAA4B;IAG5C,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;yCAjBlC,8BAA8B;2CAA9B,8BAA8B;CAyC1C"}