@wildo-ai/saas-frontend-lib 1.1.9 → 1.1.11

package/dist/esm/core/flows-actors/graph-view.model.js

@@ -0,0 +1,414 @@
+import { FlowsActors_ElementKind, FlowsActors_Relation, FlowsActors_Status, FlowActorSystem_GraphNodeKind, Flow_Node_Type, listExecutionPlanStepDependencies, } from '@wildo-ai/saas-models';
+//===============================================================
+//  ONE GRAPH VIEW MODEL (#2529)
+//
+// Every graph the engine draws — a plan and its dependencies, an actor system's run, a flow, a choreography's rounds —
+// is first turned into this one model by a pure adapter, and only then drawn. Three renderers each built their own
+// nodes and edges from their own records before it, and each got something different wrong: a branch's edges all
+// left from one handle, an actor team grew edges its model does not declare, a waiting step had no status at all.
+//
+// The rule every adapter keeps: NOTHING IS DRAWN THAT THE DATA DOES NOT HOLD. An edge is a dependency, a flow edge or
+// the order of rounds a record states; a status is the one a record carries; a run waiting on a person is said about
+// the RUN, because a suspension names the run and not a step.
+//===============================================================
+/** What a node of a graph view stands for. */
+export var GraphViewNodeKind;
+(function (GraphViewNodeKind) {
+    /** A step of an execution plan, or a build-plan task projected as one (`projectBuildPlanAsExecutionPlanSteps`). */
+    GraphViewNodeKind["PLAN_STEP"] = "plan_step";
+    /** A task an actor system works on outside its plan (`standaloneTasks`). */
+    GraphViewNodeKind["TASK"] = "task";
+    /** What starts a flow. */
+    GraphViewNodeKind["FLOW_TRIGGER"] = "flow_trigger";
+    /** A step of a flow; its own kind (action, branch, switch, parallel…) is `flowStepKind`. */
+    GraphViewNodeKind["FLOW_STEP"] = "flow_step";
+    /** Where a flow ends. */
+    GraphViewNodeKind["FLOW_FINISH"] = "flow_finish";
+    /** One round of a choreography: a group the playbooks it ran are drawn inside. */
+    GraphViewNodeKind["CHOREOGRAPHY_ROUND"] = "choreography_round";
+    /** A playbook a choreography round ran. */
+    GraphViewNodeKind["PLAYBOOK_RUN"] = "playbook_run";
+    /** A playbook of a catalog: what may run, drawn with the families it reads, waits for and writes. */
+    GraphViewNodeKind["PLAYBOOK"] = "playbook";
+    /** An application specification family a playbook writes, reads or waits for. */
+    GraphViewNodeKind["SPECIFICATION_FAMILY"] = "specification_family";
+})(GraphViewNodeKind || (GraphViewNodeKind = {}));
+/** What an edge of a graph view states. */
+export var GraphViewEdgeKind;
+(function (GraphViewEdgeKind) {
+    /**
+     * The target needs the source done first (`FlowsActors_Relation.DEPENDS_ON`), drawn from the dependency to the step
+     * that waits on it. `BLOCKED_BY` is not one: it has no writer and is not read as a dependency
+     * (`selectReadyExecutionPlanSteps`).
+     */
+    GraphViewEdgeKind["DEPENDS_ON"] = "depends_on";
+    /** A flow goes from the source to the target, as the flow declares it. */
+    GraphViewEdgeKind["FLOW"] = "flow";
+    /** One choreography round followed another, by the round numbers the trace records. */
+    GraphViewEdgeKind["NEXT_ROUND"] = "next_round";
+    /** A round began from the same input state as an earlier one (`sameInputStateAsIteration`): a lane not converging. */
+    GraphViewEdgeKind["REPEATS_INPUT_STATE"] = "repeats_input_state";
+    /** A playbook writes a family: one of its declared outputs. Drawn from the playbook to the family. */
+    GraphViewEdgeKind["PRODUCES"] = "produces";
+    /** A playbook reads a family: one of its declared inputs. Drawn from the family to the playbook. */
+    GraphViewEdgeKind["READS"] = "reads";
+    /**
+     * A playbook waits for a family: one of its preconditions names it (the family must exist, be valid, be stale or
+     * decide). Drawn from the family to the playbook. Not a READS: a playbook can wait for a family it never reads, and
+     * read one it does not wait for.
+     */
+    GraphViewEdgeKind["GATES"] = "gates";
+    /**
+     * A family's DECISION decides whether one of a playbook's preconditions applies: an `artifact_expected` gate's `when`
+     * (#2670). The build decomposition expects a website plan only once the capability composition decided the website is
+     * NEEDED. Drawn from the family to the playbook's gate. Not a GATES: the playbook never waits for this family, which
+     * only decides what it waits for.
+     */
+    GraphViewEdgeKind["CONDITIONS"] = "conditions";
+    /** A composite playbook runs another as one of its children (`method.choreography.admits`). */
+    GraphViewEdgeKind["ADMITS"] = "admits";
+})(GraphViewEdgeKind || (GraphViewEdgeKind = {}));
+/** The port every node has for what comes in, and for what goes out when nothing distinguishes its outgoing edges. */
+export const GRAPH_VIEW_IN_PORT = 'in';
+export const GRAPH_VIEW_OUT_PORT = 'out';
+const SINGLE_IN = [{ id: GRAPH_VIEW_IN_PORT }];
+const SINGLE_OUT = [{ id: GRAPH_VIEW_OUT_PORT }];
+/**
+ * An edge's id: its kind and the two ports it joins. Unique in every graph an adapter builds, by construction: a
+ * dependency is drawn once however often it is declared, two flow edges leaving one node leave from two ports, and two
+ * rounds are joined by at most one edge of each kind.
+ */
+function edgeIdOf(kind, source, sourcePort, target, targetPort) {
+    return `${kind}:${source}.${sourcePort}->${target}.${targetPort}`;
+}
+/** A dependency is a relation between two steps: declared twice, it is still one dependency. */
+function distinct(values) {
+    return [...new Set(values)];
+}
+const isFlowsActorsStatus = (value) => Object.values(FlowsActors_Status).includes(value);
+/**
+ * A plan's steps as a graph: one node per step, one DEPENDS_ON edge per dependency the step declares, drawn from the
+ * dependency to the step that waits on it, and each step's `waitsOn` — its dependencies not done yet.
+ *
+ * What "done" means is the caller's, exactly as for `selectReadyExecutionPlanSteps`: a step row is done when
+ * `COMPLETED`, a build-plan task when its products are committed. A dependency on a step the plan does not hold is
+ * waited on (the predicate has never heard of it) but draws no edge, since there is no node to draw it from.
+ */
+export function executionPlanGraph(steps, isStepDone) {
+    const known = new Set(steps.map((step) => step._id));
+    const edges = [];
+    const nodes = steps.map((step) => {
+        const dependencies = distinct(listExecutionPlanStepDependencies(step));
+        for (const dependency of dependencies) {
+            if (!known.has(dependency))
+                continue;
+            edges.push({
+                id: edgeIdOf(GraphViewEdgeKind.DEPENDS_ON, dependency, GRAPH_VIEW_OUT_PORT, step._id, GRAPH_VIEW_IN_PORT),
+                kind: GraphViewEdgeKind.DEPENDS_ON,
+                source: dependency, sourcePort: GRAPH_VIEW_OUT_PORT, target: step._id, targetPort: GRAPH_VIEW_IN_PORT,
+            });
+        }
+        return {
+            id: step._id,
+            kind: GraphViewNodeKind.PLAN_STEP,
+            label: step.label,
+            ...(step.status ? { status: step.status } : {}),
+            waitsOn: isStepDone(step._id) ? [] : dependencies.filter((dependency) => !isStepDone(dependency)),
+            inPorts: SINGLE_IN,
+            outPorts: SINGLE_OUT,
+            sourceRef: step._id,
+        };
+    });
+    return { nodes, edges };
+}
+//===============================================================
+//  An actor system's run
+//===============================================================
+/** The task ids a task `DEPENDS_ON`, in authored order: the task-level twin of `listExecutionPlanStepDependencies`. */
+function listTaskDependencies(relationships) {
+    return relationships.flatMap((relationship) => relationship.kind === FlowsActors_ElementKind.TASK && relationship.relation === FlowsActors_Relation.DEPENDS_ON
+        ? [relationship.taskId]
+        : []);
+}
+/**
+ * One actor-system run as a graph: its plan's steps (with their dependencies) and its standalone tasks (with theirs),
+ * each node with the status the run records for it — a step's `stepStates` entry over the step's own status, a task's
+ * `standaloneTaskStates` entry over the task's — and the decision the run waits on, when it is suspended.
+ *
+ * The suspension is said of the RUN (`awaitingDecision`), never pinned on a node: it names the run and not a step, and
+ * marking "the current step" would be a guess. A step or task whose own recorded status is `AWAITING_APPROVAL` shows it.
+ */
+export function actorSystemExecutionGraph(execution) {
+    const stepStatus = new Map((execution.plan?.stepStates ?? []).map((state) => [state.planStepId, state.status]));
+    const steps = (execution.plan?.planSteps ?? []).map((step) => ({
+        _id: step._id,
+        relationships: step.relationships,
+        label: step.name ?? step.topic,
+        status: stepStatus.get(step._id) ?? step.status,
+    }));
+    const plan = executionPlanGraph(steps, (id) => (stepStatus.get(id) ?? steps.find((step) => step._id === id)?.status) === FlowsActors_Status.COMPLETED);
+    const taskStatus = new Map((execution.standaloneTaskStates ?? []).map((state) => [state.taskId, state.status]));
+    const statusOfTask = (taskId) => taskStatus.get(taskId) ?? execution.standaloneTasks.find((task) => task._id === taskId)?.status;
+    const knownTasks = new Set(execution.standaloneTasks.map((task) => task._id));
+    const taskEdges = [];
+    const taskNodes = execution.standaloneTasks.map((task) => {
+        const dependencies = distinct(listTaskDependencies(task.relationships));
+        for (const dependency of dependencies) {
+            if (!knownTasks.has(dependency))
+                continue;
+            taskEdges.push({
+                id: edgeIdOf(GraphViewEdgeKind.DEPENDS_ON, dependency, GRAPH_VIEW_OUT_PORT, task._id, GRAPH_VIEW_IN_PORT),
+                kind: GraphViewEdgeKind.DEPENDS_ON,
+                source: dependency, sourcePort: GRAPH_VIEW_OUT_PORT, target: task._id, targetPort: GRAPH_VIEW_IN_PORT,
+            });
+        }
+        const status = statusOfTask(task._id);
+        const done = status === FlowsActors_Status.COMPLETED;
+        return {
+            id: task._id,
+            kind: GraphViewNodeKind.TASK,
+            label: task.title,
+            ...(status ? { status } : {}),
+            waitsOn: done ? [] : dependencies.filter((dependency) => statusOfTask(dependency) !== FlowsActors_Status.COMPLETED),
+            inPorts: SINGLE_IN,
+            outPorts: SINGLE_OUT,
+            sourceRef: task._id,
+        };
+    });
+    const decision = execution.status === FlowsActors_Status.AWAITING_APPROVAL ? execution.suspension?.decision : undefined;
+    return {
+        nodes: [...plan.nodes, ...taskNodes],
+        edges: [...plan.edges, ...taskEdges],
+        ...(decision ? {
+            awaitingDecision: {
+                decisionId: decision.decisionId,
+                title: decision.title,
+                requestedAt: decision.requestedAt,
+                ...(decision.expiresAt ? { expiresAt: decision.expiresAt } : {}),
+            },
+        } : {}),
+    };
+}
+/** The graph kind of each node a flow declares. Total over `Flow_Node_Type`, so a node type added there must be placed here. */
+const FLOW_NODE_KIND = {
+    [Flow_Node_Type.TRIGGER]: GraphViewNodeKind.FLOW_TRIGGER,
+    [Flow_Node_Type.STEP]: GraphViewNodeKind.FLOW_STEP,
+    [Flow_Node_Type.FINISH]: GraphViewNodeKind.FLOW_FINISH,
+};
+/** A flow node's graph id: its type and its ref, which together are unique in a flow (a step and a finish may share a ref). */
+export function flowGraphNodeId(type, ref) {
+    return `${type}--${ref}`;
+}
+/**
+ * A flow as a graph. Each outgoing edge of a node that has SEVERAL gets a port of its own, in the order the flow lists
+ * them (`out-0`, `out-1`, …), so a branch's or a parallel's edges leave from distinct ports; a node with one outgoing
+ * edge keeps the single `out` port. The flow model names no port, so the order of its edges is the only thing that
+ * tells them apart, and it is what is used. An edge naming a node the flow does not declare draws nothing.
+ */
+export function flowGraph(flow) {
+    const states = new Map((flow.nodeStates ?? []).map((state) => [flowGraphNodeId(state.nodeType, state.nodeRef), state.status]));
+    const outgoingCount = new Map();
+    for (const edge of flow.edges) {
+        const source = flowGraphNodeId(edge.from.type, edge.from.ref);
+        outgoingCount.set(source, (outgoingCount.get(source) ?? 0) + 1);
+    }
+    const hasSeveralOut = (id) => (outgoingCount.get(id) ?? 0) > 1;
+    const node = (type, ref, label, flowStepKind) => {
+        const id = flowGraphNodeId(type, ref);
+        const raw = states.get(id);
+        const outCount = outgoingCount.get(id) ?? 0;
+        return {
+            id,
+            kind: FLOW_NODE_KIND[type],
+            label,
+            ...(isFlowsActorsStatus(raw) ? { status: raw } : {}),
+            waitsOn: [],
+            inPorts: type === Flow_Node_Type.TRIGGER ? [] : SINGLE_IN,
+            outPorts: type === Flow_Node_Type.FINISH
+                ? []
+                : hasSeveralOut(id) ? Array.from({ length: outCount }, (_unused, index) => ({ id: `${GRAPH_VIEW_OUT_PORT}-${index}` })) : SINGLE_OUT,
+            ...(flowStepKind !== undefined ? { flowStepKind } : {}),
+            sourceRef: ref,
+        };
+    };
+    const nodes = [
+        ...flow.triggers.map((trigger) => node(Flow_Node_Type.TRIGGER, trigger.ref, trigger.displayName)),
+        ...flow.steps.map((step) => node(Flow_Node_Type.STEP, step.ref, step.name, step.kind)),
+        ...flow.finishes.map((finish) => node(Flow_Node_Type.FINISH, finish.ref, finish.displayName ?? finish.ref)),
+    ];
+    const known = new Set(nodes.map((each) => each.id));
+    const portIndex = new Map();
+    const edges = flow.edges.flatMap((edge) => {
+        const source = flowGraphNodeId(edge.from.type, edge.from.ref);
+        const target = flowGraphNodeId(edge.to.type, edge.to.ref);
+        // The port index counts every outgoing edge, drawn or not, so a dropped edge never shifts its siblings' ports.
+        const index = portIndex.get(source) ?? 0;
+        portIndex.set(source, index + 1);
+        if (!known.has(source) || !known.has(target))
+            return [];
+        const sourcePort = hasSeveralOut(source) ? `${GRAPH_VIEW_OUT_PORT}-${index}` : GRAPH_VIEW_OUT_PORT;
+        return [{
+                id: edgeIdOf(GraphViewEdgeKind.FLOW, source, sourcePort, target, GRAPH_VIEW_IN_PORT),
+                kind: GraphViewEdgeKind.FLOW,
+                source, sourcePort, target, targetPort: GRAPH_VIEW_IN_PORT,
+            }];
+    });
+    return { nodes, edges };
+}
+/** The flow node type of each node kind a served flow graph carries; an actor node is no flow node. */
+const FLOW_NODE_TYPE_OF_GRAPH_KIND = {
+    [FlowActorSystem_GraphNodeKind.TRIGGER]: Flow_Node_Type.TRIGGER,
+    [FlowActorSystem_GraphNodeKind.STEP]: Flow_Node_Type.STEP,
+    [FlowActorSystem_GraphNodeKind.FINISH]: Flow_Node_Type.FINISH,
+};
+/**
+ * A FLOW's canvas input from the graph the backend serves for it (`FlowActorSystem_FrontendInfo.graph`, #676) and, for a
+ * run, the run's node states (`FlowRun_State.nodes`, the run's task output). A served flow graph keys every node by its
+ * ref, unique across the flow, so each edge's node types are read from the nodes it names; an edge naming no node is
+ * dropped, as `flowGraph` drops it.
+ */
+export function flowGraphInputOf(graph, nodeStates) {
+    const typeOf = new Map(graph.nodes.flatMap((node) => {
+        const type = FLOW_NODE_TYPE_OF_GRAPH_KIND[node.nodeKind];
+        return type ? [[node.id, type]] : [];
+    }));
+    return {
+        triggers: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.TRIGGER).map((node) => ({ ref: node.id, displayName: node.label })),
+        steps: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.STEP).map((node) => ({ ref: node.id, kind: node.stepKind ?? '', name: node.label })),
+        finishes: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.FINISH).map((node) => ({ ref: node.id, displayName: node.label })),
+        edges: graph.edges.flatMap((edge) => {
+            const fromType = typeOf.get(edge.from);
+            const toType = typeOf.get(edge.to);
+            return fromType && toType ? [{ from: { type: fromType, ref: edge.from }, to: { type: toType, ref: edge.to } }] : [];
+        }),
+        ...(nodeStates ? { nodeStates } : {}),
+    };
+}
+/**
+ * A choreography as a graph: one group per round, the playbooks it ran inside it, NEXT_ROUND edges in the order of the
+ * rounds' numbers, and a REPEATS_INPUT_STATE edge from a round that began from an earlier round's input state back to
+ * that round — the loop a lane that is not converging makes, drawn because the record states it.
+ *
+ * A playbook run is FAILED when the round records it failed and COMPLETED otherwise: landing nothing is a finished
+ * run that changed nothing, not a failure. A nested lane's own rounds are not expanded here.
+ */
+export function choreographyGraph(trace) {
+    const roundId = (iteration) => `round:${iteration}`;
+    const rounds = [...trace.rounds].sort((left, right) => left.iteration - right.iteration);
+    const known = new Set(rounds.map((round) => roundId(round.iteration)));
+    const nodes = [];
+    const edges = [];
+    rounds.forEach((round, index) => {
+        const id = roundId(round.iteration);
+        nodes.push({ id, kind: GraphViewNodeKind.CHOREOGRAPHY_ROUND, label: String(round.iteration), waitsOn: [], inPorts: SINGLE_IN, outPorts: SINGLE_OUT, sourceRef: String(round.iteration) });
+        round.children.forEach((child, childIndex) => {
+            nodes.push({
+                id: `${id}:${childIndex}:${child.playbookRef}`,
+                kind: GraphViewNodeKind.PLAYBOOK_RUN,
+                label: child.playbookRef,
+                status: child.failed ? FlowsActors_Status.FAILED : FlowsActors_Status.COMPLETED,
+                waitsOn: [], inPorts: [], outPorts: [],
+                parentId: id,
+                sourceRef: child.playbookRef,
+            });
+        });
+        const next = rounds[index + 1];
+        if (next) {
+            const target = roundId(next.iteration);
+            edges.push({ id: edgeIdOf(GraphViewEdgeKind.NEXT_ROUND, id, GRAPH_VIEW_OUT_PORT, target, GRAPH_VIEW_IN_PORT), kind: GraphViewEdgeKind.NEXT_ROUND, source: id, sourcePort: GRAPH_VIEW_OUT_PORT, target, targetPort: GRAPH_VIEW_IN_PORT });
+        }
+        if (round.sameInputStateAsIteration !== undefined && known.has(roundId(round.sameInputStateAsIteration))) {
+            const target = roundId(round.sameInputStateAsIteration);
+            edges.push({ id: edgeIdOf(GraphViewEdgeKind.REPEATS_INPUT_STATE, id, GRAPH_VIEW_OUT_PORT, target, GRAPH_VIEW_IN_PORT), kind: GraphViewEdgeKind.REPEATS_INPUT_STATE, source: id, sourcePort: GRAPH_VIEW_OUT_PORT, target, targetPort: GRAPH_VIEW_IN_PORT });
+        }
+    });
+    return { nodes, edges };
+}
+/**
+ * The port a playbook's GATES and CONDITIONS edges enter by, apart from its READS and ADMITS, so a family that both feeds
+ * and gates it shows both. A condition enters by the gate too, since it changes what the gate asks.
+ */
+export const GRAPH_VIEW_GATE_PORT = 'gate';
+/** The port a composite's ADMITS edges leave by, apart from the families it writes. */
+export const GRAPH_VIEW_ADMITS_PORT = 'admits';
+/** A catalog node's id: playbooks and families live in separate namespaces, since a ref and a family id may be spelled alike. */
+export function playbookCatalogNodeId(kind, ref) {
+    return `${kind}:${ref}`;
+}
+/**
+ * A playbook catalog as a graph: what unlocks what. One node per playbook and one per family any of them names, and
+ * the five relations a playbook declares: it PRODUCES the families it writes, READS its inputs, waits for the families
+ * its preconditions name (GATES), lets a family's decision decide what it waits for (CONDITIONS), and, as a composite,
+ * ADMITS its children.
+ *
+ * Nothing is drawn that the declarations do not hold. A playbook carries no status here: whether it may run now is a
+ * verdict the host owns and shows on the node's body. Nor does it wait on anything the graph can name: a precondition
+ * may ask for a family to exist, be valid, be stale or decide, and only the gate knows which, so `waitsOn` stays empty
+ * rather than guess. A child the catalog does not hold draws no edge, as a dependency on an unknown step does not.
+ *
+ * Each relation a node has more than one meaning for gets its own port: a playbook's GATES and CONDITIONS enter by the
+ * gate port and its READS and ADMITS by the main one, and a composite's ADMITS leave by the admits port. A family that both feeds a
+ * playbook and gates it therefore draws two visible arrows, not one hidden under the other.
+ */
+export function playbookCatalogGraph(input) {
+    const playbookId = (ref) => playbookCatalogNodeId(GraphViewNodeKind.PLAYBOOK, ref);
+    const familyId = (family) => playbookCatalogNodeId(GraphViewNodeKind.SPECIFICATION_FAMILY, family);
+    const catalog = new Set(input.playbooks.map((playbook) => playbook.playbookRef));
+    const families = [];
+    const seenFamilies = new Set();
+    const nameFamily = (family) => {
+        if (seenFamilies.has(family))
+            return;
+        seenFamilies.add(family);
+        families.push(family);
+    };
+    const edges = [];
+    const edge = (kind, source, sourcePort, target, targetPort) => {
+        edges.push({ id: edgeIdOf(kind, source, sourcePort, target, targetPort), kind, source, sourcePort, target, targetPort });
+    };
+    const playbookNodes = input.playbooks.map((playbook) => {
+        const id = playbookId(playbook.playbookRef);
+        const preconditions = distinct(playbook.preconditionFamilies);
+        const conditions = distinct(playbook.conditionFamilies);
+        const children = distinct(playbook.admits).filter((child) => catalog.has(child));
+        for (const family of distinct(playbook.inputFamilies)) {
+            nameFamily(family);
+            edge(GraphViewEdgeKind.READS, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_IN_PORT);
+        }
+        for (const family of preconditions) {
+            nameFamily(family);
+            edge(GraphViewEdgeKind.GATES, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_GATE_PORT);
+        }
+        for (const family of conditions) {
+            nameFamily(family);
+            edge(GraphViewEdgeKind.CONDITIONS, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_GATE_PORT);
+        }
+        for (const family of distinct(playbook.outputFamilies)) {
+            nameFamily(family);
+            edge(GraphViewEdgeKind.PRODUCES, id, GRAPH_VIEW_OUT_PORT, familyId(family), GRAPH_VIEW_IN_PORT);
+        }
+        for (const child of children) {
+            edge(GraphViewEdgeKind.ADMITS, id, GRAPH_VIEW_ADMITS_PORT, playbookId(child), GRAPH_VIEW_IN_PORT);
+        }
+        return {
+            id,
+            kind: GraphViewNodeKind.PLAYBOOK,
+            label: playbook.playbookRef,
+            waitsOn: [],
+            inPorts: preconditions.length > 0 || conditions.length > 0 ? [...SINGLE_IN, { id: GRAPH_VIEW_GATE_PORT }] : SINGLE_IN,
+            outPorts: children.length > 0 ? [...SINGLE_OUT, { id: GRAPH_VIEW_ADMITS_PORT }] : SINGLE_OUT,
+            sourceRef: playbook.playbookRef,
+        };
+    });
+    const familyNodes = families.map((family) => ({
+        id: familyId(family),
+        kind: GraphViewNodeKind.SPECIFICATION_FAMILY,
+        label: input.familyLabels?.get(family) ?? family,
+        waitsOn: [],
+        inPorts: SINGLE_IN,
+        outPorts: SINGLE_OUT,
+        sourceRef: family,
+    }));
+    return { nodes: [...playbookNodes, ...familyNodes], edges };
+}
+//# sourceMappingURL=graph-view.model.js.map

package/dist/esm/core/flows-actors/graph-view.model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-view.model.js","sourceRoot":"","sources":["../../../../../src/core/flows-actors/graph-view.model.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,kBAAkB,EAClB,6BAA6B,EAC7B,cAAc,EACd,iCAAiC,GAKlC,MAAM,uBAAuB,CAAC;AAE/B,iEAAiE;AACjE,gCAAgC;AAChC,EAAE;AACF,uHAAuH;AACvH,mHAAmH;AACnH,iHAAiH;AACjH,kHAAkH;AAClH,EAAE;AACF,sHAAsH;AACtH,qHAAqH;AACrH,8DAA8D;AAC9D,iEAAiE;AAEjE,8CAA8C;AAC9C,MAAM,CAAN,IAAY,iBAmBX;AAnBD,WAAY,iBAAiB;IAC3B,mHAAmH;IACnH,4CAAuB,CAAA;IACvB,4EAA4E;IAC5E,kCAAa,CAAA;IACb,0BAA0B;IAC1B,kDAA6B,CAAA;IAC7B,4FAA4F;IAC5F,4CAAuB,CAAA;IACvB,yBAAyB;IACzB,gDAA2B,CAAA;IAC3B,kFAAkF;IAClF,8DAAyC,CAAA;IACzC,2CAA2C;IAC3C,kDAA6B,CAAA;IAC7B,qGAAqG;IACrG,0CAAqB,CAAA;IACrB,iFAAiF;IACjF,kEAA6C,CAAA;AAC/C,CAAC,EAnBW,iBAAiB,KAAjB,iBAAiB,QAmB5B;AAED,2CAA2C;AAC3C,MAAM,CAAN,IAAY,iBAgCX;AAhCD,WAAY,iBAAiB;IAC3B;;;;OAIG;IACH,8CAAyB,CAAA;IACzB,0EAA0E;IAC1E,kCAAa,CAAA;IACb,uFAAuF;IACvF,8CAAyB,CAAA;IACzB,sHAAsH;IACtH,gEAA2C,CAAA;IAC3C,sGAAsG;IACtG,0CAAqB,CAAA;IACrB,oGAAoG;IACpG,oCAAe,CAAA;IACf;;;;OAIG;IACH,oCAAe,CAAA;IACf;;;;;OAKG;IACH,8CAAyB,CAAA;IACzB,+FAA+F;IAC/F,sCAAiB,CAAA;AACnB,CAAC,EAhCW,iBAAiB,KAAjB,iBAAiB,QAgC5B;AAsDD,sHAAsH;AACtH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AACvC,MAAM,CAAC,MAAM,mBAAmB,GAAG,KAAK,CAAC;AAEzC,MAAM,SAAS,GAA6B,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,CAAC,CAAC;AACzE,MAAM,UAAU,GAA6B,CAAC,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC,CAAC;AAE3E;;;;GAIG;AACH,SAAS,QAAQ,CAAC,IAAuB,EAAE,MAAc,EAAE,UAAkB,EAAE,MAAc,EAAE,UAAkB;IAC/G,OAAO,GAAG,IAAI,IAAI,MAAM,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,EAAE,CAAC;AACpE,CAAC;AAED,gGAAgG;AAChG,SAAS,QAAQ,CAAC,MAAyB;IACzC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,mBAAmB,GAAG,CAAC,KAAc,EAA+B,EAAE,CAC1E,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,KAA2B,CAAC,CAAC;AAY1E;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAmC,EAAE,UAA2C;IACjH,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAiB,EAAE;QAC9C,MAAM,YAAY,GAAG,QAAQ,CAAC,iCAAiC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YACrC,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,IAAI,CAAC,GAAG,EAAE,kBAAkB,CAAC;gBACzG,IAAI,EAAE,iBAAiB,CAAC,UAAU;gBAClC,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,kBAAkB;aACtG,CAAC,CAAC;QACL,CAAC;QACD,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,GAAG;YACZ,IAAI,EAAE,iBAAiB,CAAC,SAAS;YACjC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,OAAO,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YACjG,OAAO,EAAE,SAAS;YAClB,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,IAAI,CAAC,GAAG;SACpB,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,iEAAiE;AACjE,yBAAyB;AACzB,iEAAiE;AAEjE,uHAAuH;AACvH,SAAS,oBAAoB,CAAC,aAAkD;IAC9E,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE,CAC5C,YAAY,CAAC,IAAI,KAAK,uBAAuB,CAAC,IAAI,IAAI,YAAY,CAAC,QAAQ,KAAK,oBAAoB,CAAC,UAAU;QAC7G,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC;QACvB,CAAC,CAAC,EAAE,CAAC,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CACvC,SAAqH;IAErH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAU,CAAC,CAAC,CAAC;IACzH,MAAM,KAAK,GAAwB,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClF,GAAG,EAAE,IAAI,CAAC,GAAG;QACb,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;QAC9B,MAAM,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM;KAChD,CAAC,CAAC,CAAC;IACJ,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,MAAM,CAAC,KAAK,kBAAkB,CAAC,SAAS,CAAC,CAAC;IAEvJ,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAU,CAAC,CAAC,CAAC;IACzH,MAAM,YAAY,GAAG,CAAC,MAAc,EAAkC,EAAE,CACtE,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC;IAClG,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,MAAM,SAAS,GAAG,SAAS,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,IAAI,EAAiB,EAAE;QACtE,MAAM,YAAY,GAAG,QAAQ,CAAC,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QACxE,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YAC1C,SAAS,CAAC,IAAI,CAAC;gBACb,EAAE,EAAE,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,IAAI,CAAC,GAAG,EAAE,kBAAkB,CAAC;gBACzG,IAAI,EAAE,iBAAiB,CAAC,UAAU;gBAClC,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,kBAAkB;aACtG,CAAC,CAAC;QACL,CAAC;QACD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,MAAM,KAAK,kBAAkB,CAAC,SAAS,CAAC;QACrD,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,GAAG;YACZ,IAAI,EAAE,iBAAiB,CAAC,IAAI;YAC5B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,kBAAkB,CAAC,SAAS,CAAC;YACnH,OAAO,EAAE,SAAS;YAClB,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,IAAI,CAAC,GAAG;SACpB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,KAAK,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IACxH,OAAO;QACL,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC;QACpC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC;QACpC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;YACb,gBAAgB,EAAE;gBAChB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW,EAAE,QAAQ,CAAC,WAAW;gBACjC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACjE;SACF,CAAC,CAAC,CAAC,EAAE,CAAC;KACR,CAAC;AACJ,CAAC;AAgBD,gIAAgI;AAChI,MAAM,cAAc,GAAwD;IAC1E,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,iBAAiB,CAAC,YAAY;IACxD,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,iBAAiB,CAAC,SAAS;IAClD,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,iBAAiB,CAAC,WAAW;CACvD,CAAC;AAEF,+HAA+H;AAC/H,MAAM,UAAU,eAAe,CAAC,IAA6B,EAAE,GAAW;IACxE,OAAO,GAAG,IAAI,KAAK,GAAG,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAwB;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,CAAU,CAAC,CAAC,CAAC;IACxI,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,aAAa,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,CAAC,IAAoB,EAAE,GAAW,EAAE,KAAa,EAAE,YAAqB,EAAiB,EAAE;QACtG,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5C,OAAO;YACL,EAAE;YACF,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC;YAC1B,KAAK;YACL,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpD,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,IAAI,KAAK,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;YACzD,QAAQ,EAAE,IAAI,KAAK,cAAc,CAAC,MAAM;gBACtC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,mBAAmB,IAAI,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU;YACtI,GAAG,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,SAAS,EAAE,GAAG;SACf,CAAC;IACJ,CAAC,CAAC;IACF,MAAM,KAAK,GAAG;QACZ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;QACjG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACtF,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;KAC5G,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAmB,EAAE;QACzD,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1D,+GAA+G;QAC/G,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,CAAC;QACxD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,mBAAmB,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC;QACnG,OAAO,CAAC;gBACN,EAAE,EAAE,QAAQ,CAAC,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,kBAAkB,CAAC;gBACpF,IAAI,EAAE,iBAAiB,CAAC,IAAI;gBAC5B,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB;aAC3D,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,uGAAuG;AACvG,MAAM,4BAA4B,GAA6E;IAC7G,CAAC,6BAA6B,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,OAAO;IAC/D,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAE,cAAc,CAAC,IAAI;IACzD,CAAC,6BAA6B,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,MAAM;CAC9D,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAoC,EACpC,UAA6C;IAE7C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAClD,MAAM,IAAI,GAAG,4BAA4B,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAChD,CAAC,CAAC,CAAC,CAAC;IACJ,OAAO;QACL,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,6BAA6B,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC1J,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,6BAA6B,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACxK,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACzJ,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,OAAO,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtH,CAAC,CAAC;QACF,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtC,CAAC;AACJ,CAAC;AAqBD;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAiC;IACjE,MAAM,OAAO,GAAG,CAAC,SAAiB,EAAE,EAAE,CAAC,SAAS,SAAS,EAAE,CAAC;IAC5D,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IACzF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,iBAAiB,CAAC,kBAAkB,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC1L,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;YAC3C,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,GAAG,EAAE,IAAI,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE;gBAC9C,IAAI,EAAE,iBAAiB,CAAC,YAAY;gBACpC,KAAK,EAAE,KAAK,CAAC,WAAW;gBACxB,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,kBAAkB,CAAC,SAAS;gBAC/E,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE;gBACtC,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,KAAK,CAAC,WAAW;aAC7B,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC/B,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,EAAE,EAAE,mBAAmB,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,IAAI,EAAE,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAC3O,CAAC;QACD,IAAI,KAAK,CAAC,yBAAyB,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC;YACzG,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACxD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,iBAAiB,CAAC,mBAAmB,EAAE,EAAE,EAAE,mBAAmB,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,IAAI,EAAE,iBAAiB,CAAC,mBAAmB,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,EAAE,UAAU,EAAE,kBAAkB,EAAE,CAAC,CAAC;QAC7P,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AA2BD;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,MAAM,CAAC;AAC3C,uFAAuF;AACvF,MAAM,CAAC,MAAM,sBAAsB,GAAG,QAAQ,CAAC;AAE/C,iIAAiI;AACjI,MAAM,UAAU,qBAAqB,CAAC,IAAyE,EAAE,GAAW;IAC1H,OAAO,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAoC;IACvE,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,qBAAqB,CAAC,iBAAiB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC3F,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAE,EAAE,CAAC,qBAAqB,CAAC,iBAAiB,CAAC,oBAAoB,EAAE,MAAM,CAAC,CAAC;IAC3G,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,EAAE;QACpC,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QACrC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC,CAAC;IACF,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,IAAI,GAAG,CAAC,IAAuB,EAAE,MAAc,EAAE,UAAkB,EAAE,MAAc,EAAE,UAAkB,EAAE,EAAE;QAC/G,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3H,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAiB,EAAE;QACpE,MAAM,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACtD,UAAU,CAAC,MAAM,CAAC,CAAC;YACnB,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,EAAE,EAAE,kBAAkB,CAAC,CAAC;QAC/F,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,UAAU,CAAC,MAAM,CAAC,CAAC;YACnB,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,EAAE,EAAE,oBAAoB,CAAC,CAAC;QACjG,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,UAAU,CAAC,MAAM,CAAC,CAAC;YACnB,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,EAAE,EAAE,oBAAoB,CAAC,CAAC;QACtG,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YACvD,UAAU,CAAC,MAAM,CAAC,CAAC;YACnB,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,EAAE,EAAE,mBAAmB,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,kBAAkB,CAAC,CAAC;QAClG,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,EAAE,EAAE,sBAAsB,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACpG,CAAC;QACD,OAAO;YACL,EAAE;YACF,IAAI,EAAE,iBAAiB,CAAC,QAAQ;YAChC,KAAK,EAAE,QAAQ,CAAC,WAAW;YAC3B,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,oBAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;YACrH,QAAQ,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,EAAE,EAAE,EAAE,EAAE,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU;YAC5F,SAAS,EAAE,QAAQ,CAAC,WAAW;SAChC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAiB,EAAE,CAAC,CAAC;QAC3D,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC;QACpB,IAAI,EAAE,iBAAiB,CAAC,oBAAoB;QAC5C,KAAK,EAAE,KAAK,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM;QAChD,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,SAAS;QAClB,QAAQ,EAAE,UAAU;QACpB,SAAS,EAAE,MAAM;KAClB,CAAC,CAAC,CAAC;IACJ,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,aAAa,EAAE,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,CAAC;AAC9D,CAAC","sourcesContent":["import {\n  FlowsActors_ElementKind,\n  FlowsActors_Relation,\n  FlowsActors_Status,\n  FlowActorSystem_GraphNodeKind,\n  Flow_Node_Type,\n  listExecutionPlanStepDependencies,\n  type ActorSystem_Execution,\n  type FlowActorSystem_FrontendGraph,\n  type ExecutionPlanReadinessStep,\n  type FlowsActors_Relationship,\n} from '@wildo-ai/saas-models';\n\n//===============================================================\n//  ONE GRAPH VIEW MODEL (#2529)\n//\n// Every graph the engine draws — a plan and its dependencies, an actor system's run, a flow, a choreography's rounds —\n// is first turned into this one model by a pure adapter, and only then drawn. Three renderers each built their own\n// nodes and edges from their own records before it, and each got something different wrong: a branch's edges all\n// left from one handle, an actor team grew edges its model does not declare, a waiting step had no status at all.\n//\n// The rule every adapter keeps: NOTHING IS DRAWN THAT THE DATA DOES NOT HOLD. An edge is a dependency, a flow edge or\n// the order of rounds a record states; a status is the one a record carries; a run waiting on a person is said about\n// the RUN, because a suspension names the run and not a step.\n//===============================================================\n\n/** What a node of a graph view stands for. */\nexport enum GraphViewNodeKind {\n  /** A step of an execution plan, or a build-plan task projected as one (`projectBuildPlanAsExecutionPlanSteps`). */\n  PLAN_STEP = 'plan_step',\n  /** A task an actor system works on outside its plan (`standaloneTasks`). */\n  TASK = 'task',\n  /** What starts a flow. */\n  FLOW_TRIGGER = 'flow_trigger',\n  /** A step of a flow; its own kind (action, branch, switch, parallel…) is `flowStepKind`. */\n  FLOW_STEP = 'flow_step',\n  /** Where a flow ends. */\n  FLOW_FINISH = 'flow_finish',\n  /** One round of a choreography: a group the playbooks it ran are drawn inside. */\n  CHOREOGRAPHY_ROUND = 'choreography_round',\n  /** A playbook a choreography round ran. */\n  PLAYBOOK_RUN = 'playbook_run',\n  /** A playbook of a catalog: what may run, drawn with the families it reads, waits for and writes. */\n  PLAYBOOK = 'playbook',\n  /** An application specification family a playbook writes, reads or waits for. */\n  SPECIFICATION_FAMILY = 'specification_family',\n}\n\n/** What an edge of a graph view states. */\nexport enum GraphViewEdgeKind {\n  /**\n   * The target needs the source done first (`FlowsActors_Relation.DEPENDS_ON`), drawn from the dependency to the step\n   * that waits on it. `BLOCKED_BY` is not one: it has no writer and is not read as a dependency\n   * (`selectReadyExecutionPlanSteps`).\n   */\n  DEPENDS_ON = 'depends_on',\n  /** A flow goes from the source to the target, as the flow declares it. */\n  FLOW = 'flow',\n  /** One choreography round followed another, by the round numbers the trace records. */\n  NEXT_ROUND = 'next_round',\n  /** A round began from the same input state as an earlier one (`sameInputStateAsIteration`): a lane not converging. */\n  REPEATS_INPUT_STATE = 'repeats_input_state',\n  /** A playbook writes a family: one of its declared outputs. Drawn from the playbook to the family. */\n  PRODUCES = 'produces',\n  /** A playbook reads a family: one of its declared inputs. Drawn from the family to the playbook. */\n  READS = 'reads',\n  /**\n   * A playbook waits for a family: one of its preconditions names it (the family must exist, be valid, be stale or\n   * decide). Drawn from the family to the playbook. Not a READS: a playbook can wait for a family it never reads, and\n   * read one it does not wait for.\n   */\n  GATES = 'gates',\n  /**\n   * A family's DECISION decides whether one of a playbook's preconditions applies: an `artifact_expected` gate's `when`\n   * (#2670). The build decomposition expects a website plan only once the capability composition decided the website is\n   * NEEDED. Drawn from the family to the playbook's gate. Not a GATES: the playbook never waits for this family, which\n   * only decides what it waits for.\n   */\n  CONDITIONS = 'conditions',\n  /** A composite playbook runs another as one of its children (`method.choreography.admits`). */\n  ADMITS = 'admits',\n}\n\n/** One end an edge attaches to. A node with several outgoing edges of different meaning has one port per edge. */\nexport interface GraphViewPort {\n  readonly id: string;\n}\n\nexport interface GraphViewNode {\n  readonly id: string;\n  readonly kind: GraphViewNodeKind;\n  /** The node's name, from its record (a step's name or topic, a task's title, a playbook's ref): a value, not a UI word. */\n  readonly label: string;\n  /** The status its record carries, when it carries one. */\n  readonly status?: FlowsActors_Status;\n  /**\n   * The nodes this one still waits on: dependencies that are not done. Empty for a node free to start, a node done,\n   * and a node with no dependency.\n   */\n  readonly waitsOn: readonly string[];\n  readonly inPorts: readonly GraphViewPort[];\n  readonly outPorts: readonly GraphViewPort[];\n  /** The node this one is drawn inside: a playbook run's round. */\n  readonly parentId?: string;\n  /** For a flow step, its declared kind (action, branch, switch, parallel…), as the flow carries it. */\n  readonly flowStepKind?: string;\n  /** What the node stands for in its record (a plan-step id, a task id, a flow ref, a playbook ref), for a host's navigation. */\n  readonly sourceRef: string;\n}\n\nexport interface GraphViewEdge {\n  /** Unique in the graph, even for two edges between the same two nodes. */\n  readonly id: string;\n  readonly kind: GraphViewEdgeKind;\n  readonly source: string;\n  readonly sourcePort: string;\n  readonly target: string;\n  readonly targetPort: string;\n}\n\n/** The decision a run waits on, as its suspension records it. Absent when the run waits on nobody. */\nexport interface GraphViewAwaitingDecision {\n  readonly decisionId: string;\n  readonly title: string;\n  readonly requestedAt: string;\n  readonly expiresAt?: string;\n}\n\nexport interface GraphView {\n  readonly nodes: readonly GraphViewNode[];\n  readonly edges: readonly GraphViewEdge[];\n  /** Present when the run this graph draws waits on a person's decision. Said of the run: a suspension names no node. */\n  readonly awaitingDecision?: GraphViewAwaitingDecision;\n}\n\n/** The port every node has for what comes in, and for what goes out when nothing distinguishes its outgoing edges. */\nexport const GRAPH_VIEW_IN_PORT = 'in';\nexport const GRAPH_VIEW_OUT_PORT = 'out';\n\nconst SINGLE_IN: readonly GraphViewPort[] = [{ id: GRAPH_VIEW_IN_PORT }];\nconst SINGLE_OUT: readonly GraphViewPort[] = [{ id: GRAPH_VIEW_OUT_PORT }];\n\n/**\n * An edge's id: its kind and the two ports it joins. Unique in every graph an adapter builds, by construction: a\n * dependency is drawn once however often it is declared, two flow edges leaving one node leave from two ports, and two\n * rounds are joined by at most one edge of each kind.\n */\nfunction edgeIdOf(kind: GraphViewEdgeKind, source: string, sourcePort: string, target: string, targetPort: string): string {\n  return `${kind}:${source}.${sourcePort}->${target}.${targetPort}`;\n}\n\n/** A dependency is a relation between two steps: declared twice, it is still one dependency. */\nfunction distinct(values: readonly string[]): readonly string[] {\n  return [...new Set(values)];\n}\n\nconst isFlowsActorsStatus = (value: unknown): value is FlowsActors_Status =>\n  Object.values(FlowsActors_Status).includes(value as FlowsActors_Status);\n\n//===============================================================\n//  Execution plans (and build plans projected as one)\n//===============================================================\n\n/** A plan step as the plan adapter needs it: identity, dependencies, a name, and the status its record holds. */\nexport interface GraphViewPlanStep extends ExecutionPlanReadinessStep {\n  readonly label: string;\n  readonly status?: FlowsActors_Status;\n}\n\n/**\n * A plan's steps as a graph: one node per step, one DEPENDS_ON edge per dependency the step declares, drawn from the\n * dependency to the step that waits on it, and each step's `waitsOn` — its dependencies not done yet.\n *\n * What \"done\" means is the caller's, exactly as for `selectReadyExecutionPlanSteps`: a step row is done when\n * `COMPLETED`, a build-plan task when its products are committed. A dependency on a step the plan does not hold is\n * waited on (the predicate has never heard of it) but draws no edge, since there is no node to draw it from.\n */\nexport function executionPlanGraph(steps: readonly GraphViewPlanStep[], isStepDone: (planStepId: string) => boolean): GraphView {\n  const known = new Set(steps.map((step) => step._id));\n  const edges: GraphViewEdge[] = [];\n  const nodes = steps.map((step): GraphViewNode => {\n    const dependencies = distinct(listExecutionPlanStepDependencies(step));\n    for (const dependency of dependencies) {\n      if (!known.has(dependency)) continue;\n      edges.push({\n        id: edgeIdOf(GraphViewEdgeKind.DEPENDS_ON, dependency, GRAPH_VIEW_OUT_PORT, step._id, GRAPH_VIEW_IN_PORT),\n        kind: GraphViewEdgeKind.DEPENDS_ON,\n        source: dependency, sourcePort: GRAPH_VIEW_OUT_PORT, target: step._id, targetPort: GRAPH_VIEW_IN_PORT,\n      });\n    }\n    return {\n      id: step._id,\n      kind: GraphViewNodeKind.PLAN_STEP,\n      label: step.label,\n      ...(step.status ? { status: step.status } : {}),\n      waitsOn: isStepDone(step._id) ? [] : dependencies.filter((dependency) => !isStepDone(dependency)),\n      inPorts: SINGLE_IN,\n      outPorts: SINGLE_OUT,\n      sourceRef: step._id,\n    };\n  });\n  return { nodes, edges };\n}\n\n//===============================================================\n//  An actor system's run\n//===============================================================\n\n/** The task ids a task `DEPENDS_ON`, in authored order: the task-level twin of `listExecutionPlanStepDependencies`. */\nfunction listTaskDependencies(relationships: readonly FlowsActors_Relationship[]): readonly string[] {\n  return relationships.flatMap((relationship) =>\n    relationship.kind === FlowsActors_ElementKind.TASK && relationship.relation === FlowsActors_Relation.DEPENDS_ON\n      ? [relationship.taskId]\n      : []);\n}\n\n/**\n * One actor-system run as a graph: its plan's steps (with their dependencies) and its standalone tasks (with theirs),\n * each node with the status the run records for it — a step's `stepStates` entry over the step's own status, a task's\n * `standaloneTaskStates` entry over the task's — and the decision the run waits on, when it is suspended.\n *\n * The suspension is said of the RUN (`awaitingDecision`), never pinned on a node: it names the run and not a step, and\n * marking \"the current step\" would be a guess. A step or task whose own recorded status is `AWAITING_APPROVAL` shows it.\n */\nexport function actorSystemExecutionGraph(\n  execution: Pick<ActorSystem_Execution, 'status' | 'suspension' | 'plan' | 'standaloneTasks' | 'standaloneTaskStates'>,\n): GraphView {\n  const stepStatus = new Map((execution.plan?.stepStates ?? []).map((state) => [state.planStepId, state.status] as const));\n  const steps: GraphViewPlanStep[] = (execution.plan?.planSteps ?? []).map((step) => ({\n    _id: step._id,\n    relationships: step.relationships,\n    label: step.name ?? step.topic,\n    status: stepStatus.get(step._id) ?? step.status,\n  }));\n  const plan = executionPlanGraph(steps, (id) => (stepStatus.get(id) ?? steps.find((step) => step._id === id)?.status) === FlowsActors_Status.COMPLETED);\n\n  const taskStatus = new Map((execution.standaloneTaskStates ?? []).map((state) => [state.taskId, state.status] as const));\n  const statusOfTask = (taskId: string): FlowsActors_Status | undefined =>\n    taskStatus.get(taskId) ?? execution.standaloneTasks.find((task) => task._id === taskId)?.status;\n  const knownTasks = new Set(execution.standaloneTasks.map((task) => task._id));\n  const taskEdges: GraphViewEdge[] = [];\n  const taskNodes = execution.standaloneTasks.map((task): GraphViewNode => {\n    const dependencies = distinct(listTaskDependencies(task.relationships));\n    for (const dependency of dependencies) {\n      if (!knownTasks.has(dependency)) continue;\n      taskEdges.push({\n        id: edgeIdOf(GraphViewEdgeKind.DEPENDS_ON, dependency, GRAPH_VIEW_OUT_PORT, task._id, GRAPH_VIEW_IN_PORT),\n        kind: GraphViewEdgeKind.DEPENDS_ON,\n        source: dependency, sourcePort: GRAPH_VIEW_OUT_PORT, target: task._id, targetPort: GRAPH_VIEW_IN_PORT,\n      });\n    }\n    const status = statusOfTask(task._id);\n    const done = status === FlowsActors_Status.COMPLETED;\n    return {\n      id: task._id,\n      kind: GraphViewNodeKind.TASK,\n      label: task.title,\n      ...(status ? { status } : {}),\n      waitsOn: done ? [] : dependencies.filter((dependency) => statusOfTask(dependency) !== FlowsActors_Status.COMPLETED),\n      inPorts: SINGLE_IN,\n      outPorts: SINGLE_OUT,\n      sourceRef: task._id,\n    };\n  });\n\n  const decision = execution.status === FlowsActors_Status.AWAITING_APPROVAL ? execution.suspension?.decision : undefined;\n  return {\n    nodes: [...plan.nodes, ...taskNodes],\n    edges: [...plan.edges, ...taskEdges],\n    ...(decision ? {\n      awaitingDecision: {\n        decisionId: decision.decisionId,\n        title: decision.title,\n        requestedAt: decision.requestedAt,\n        ...(decision.expiresAt ? { expiresAt: decision.expiresAt } : {}),\n      },\n    } : {}),\n  };\n}\n\n//===============================================================\n//  A flow\n//===============================================================\n\n/** What a flow's canvas is given: the same records `AI_FlowExecutionCanvas` takes. */\nexport interface GraphViewFlowInput {\n  readonly triggers: readonly { readonly ref: string; readonly displayName: string }[];\n  readonly steps: readonly { readonly ref: string; readonly kind: string; readonly name: string }[];\n  readonly finishes: readonly { readonly ref: string; readonly displayName?: string }[];\n  readonly edges: readonly { readonly from: { readonly type: string; readonly ref: string }; readonly to: { readonly type: string; readonly ref: string } }[];\n  /** Each node's run status, as a raw value; a value that is not a `FlowsActors_Status` is not shown as one. */\n  readonly nodeStates?: readonly { readonly nodeRef: string; readonly nodeType: string; readonly status: string }[];\n}\n\n/** The graph kind of each node a flow declares. Total over `Flow_Node_Type`, so a node type added there must be placed here. */\nconst FLOW_NODE_KIND: Readonly<Record<Flow_Node_Type, GraphViewNodeKind>> = {\n  [Flow_Node_Type.TRIGGER]: GraphViewNodeKind.FLOW_TRIGGER,\n  [Flow_Node_Type.STEP]: GraphViewNodeKind.FLOW_STEP,\n  [Flow_Node_Type.FINISH]: GraphViewNodeKind.FLOW_FINISH,\n};\n\n/** A flow node's graph id: its type and its ref, which together are unique in a flow (a step and a finish may share a ref). */\nexport function flowGraphNodeId(type: Flow_Node_Type | string, ref: string): string {\n  return `${type}--${ref}`;\n}\n\n/**\n * A flow as a graph. Each outgoing edge of a node that has SEVERAL gets a port of its own, in the order the flow lists\n * them (`out-0`, `out-1`, …), so a branch's or a parallel's edges leave from distinct ports; a node with one outgoing\n * edge keeps the single `out` port. The flow model names no port, so the order of its edges is the only thing that\n * tells them apart, and it is what is used. An edge naming a node the flow does not declare draws nothing.\n */\nexport function flowGraph(flow: GraphViewFlowInput): GraphView {\n  const states = new Map((flow.nodeStates ?? []).map((state) => [flowGraphNodeId(state.nodeType, state.nodeRef), state.status] as const));\n  const outgoingCount = new Map<string, number>();\n  for (const edge of flow.edges) {\n    const source = flowGraphNodeId(edge.from.type, edge.from.ref);\n    outgoingCount.set(source, (outgoingCount.get(source) ?? 0) + 1);\n  }\n  const hasSeveralOut = (id: string) => (outgoingCount.get(id) ?? 0) > 1;\n  const node = (type: Flow_Node_Type, ref: string, label: string, flowStepKind?: string): GraphViewNode => {\n    const id = flowGraphNodeId(type, ref);\n    const raw = states.get(id);\n    const outCount = outgoingCount.get(id) ?? 0;\n    return {\n      id,\n      kind: FLOW_NODE_KIND[type],\n      label,\n      ...(isFlowsActorsStatus(raw) ? { status: raw } : {}),\n      waitsOn: [],\n      inPorts: type === Flow_Node_Type.TRIGGER ? [] : SINGLE_IN,\n      outPorts: type === Flow_Node_Type.FINISH\n        ? []\n        : hasSeveralOut(id) ? Array.from({ length: outCount }, (_unused, index) => ({ id: `${GRAPH_VIEW_OUT_PORT}-${index}` })) : SINGLE_OUT,\n      ...(flowStepKind !== undefined ? { flowStepKind } : {}),\n      sourceRef: ref,\n    };\n  };\n  const nodes = [\n    ...flow.triggers.map((trigger) => node(Flow_Node_Type.TRIGGER, trigger.ref, trigger.displayName)),\n    ...flow.steps.map((step) => node(Flow_Node_Type.STEP, step.ref, step.name, step.kind)),\n    ...flow.finishes.map((finish) => node(Flow_Node_Type.FINISH, finish.ref, finish.displayName ?? finish.ref)),\n  ];\n  const known = new Set(nodes.map((each) => each.id));\n  const portIndex = new Map<string, number>();\n  const edges = flow.edges.flatMap((edge): GraphViewEdge[] => {\n    const source = flowGraphNodeId(edge.from.type, edge.from.ref);\n    const target = flowGraphNodeId(edge.to.type, edge.to.ref);\n    // The port index counts every outgoing edge, drawn or not, so a dropped edge never shifts its siblings' ports.\n    const index = portIndex.get(source) ?? 0;\n    portIndex.set(source, index + 1);\n    if (!known.has(source) || !known.has(target)) return [];\n    const sourcePort = hasSeveralOut(source) ? `${GRAPH_VIEW_OUT_PORT}-${index}` : GRAPH_VIEW_OUT_PORT;\n    return [{\n      id: edgeIdOf(GraphViewEdgeKind.FLOW, source, sourcePort, target, GRAPH_VIEW_IN_PORT),\n      kind: GraphViewEdgeKind.FLOW,\n      source, sourcePort, target, targetPort: GRAPH_VIEW_IN_PORT,\n    }];\n  });\n  return { nodes, edges };\n}\n\n/** The flow node type of each node kind a served flow graph carries; an actor node is no flow node. */\nconst FLOW_NODE_TYPE_OF_GRAPH_KIND: Readonly<Partial<Record<FlowActorSystem_GraphNodeKind, Flow_Node_Type>>> = {\n  [FlowActorSystem_GraphNodeKind.TRIGGER]: Flow_Node_Type.TRIGGER,\n  [FlowActorSystem_GraphNodeKind.STEP]: Flow_Node_Type.STEP,\n  [FlowActorSystem_GraphNodeKind.FINISH]: Flow_Node_Type.FINISH,\n};\n\n/**\n * A FLOW's canvas input from the graph the backend serves for it (`FlowActorSystem_FrontendInfo.graph`, #676) and, for a\n * run, the run's node states (`FlowRun_State.nodes`, the run's task output). A served flow graph keys every node by its\n * ref, unique across the flow, so each edge's node types are read from the nodes it names; an edge naming no node is\n * dropped, as `flowGraph` drops it.\n */\nexport function flowGraphInputOf(\n  graph: FlowActorSystem_FrontendGraph,\n  nodeStates?: GraphViewFlowInput['nodeStates'],\n): GraphViewFlowInput {\n  const typeOf = new Map(graph.nodes.flatMap((node) => {\n    const type = FLOW_NODE_TYPE_OF_GRAPH_KIND[node.nodeKind];\n    return type ? [[node.id, type] as const] : [];\n  }));\n  return {\n    triggers: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.TRIGGER).map((node) => ({ ref: node.id, displayName: node.label })),\n    steps: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.STEP).map((node) => ({ ref: node.id, kind: node.stepKind ?? '', name: node.label })),\n    finishes: graph.nodes.filter((node) => node.nodeKind === FlowActorSystem_GraphNodeKind.FINISH).map((node) => ({ ref: node.id, displayName: node.label })),\n    edges: graph.edges.flatMap((edge) => {\n      const fromType = typeOf.get(edge.from);\n      const toType = typeOf.get(edge.to);\n      return fromType && toType ? [{ from: { type: fromType, ref: edge.from }, to: { type: toType, ref: edge.to } }] : [];\n    }),\n    ...(nodeStates ? { nodeStates } : {}),\n  };\n}\n\n//===============================================================\n//  A choreography's rounds\n//===============================================================\n\n/**\n * A choreography's rounds as the runs read serves them (the companion's round measurement, structurally): what each\n * round ran, whether each run failed, and which earlier round a repeat began from.\n */\nexport interface GraphViewChoreographyInput {\n  readonly rounds: readonly {\n    readonly iteration: number;\n    readonly sameInputStateAsIteration?: number;\n    readonly children: readonly {\n      readonly playbookRef: string;\n      readonly failed: boolean;\n    }[];\n  }[];\n}\n\n/**\n * A choreography as a graph: one group per round, the playbooks it ran inside it, NEXT_ROUND edges in the order of the\n * rounds' numbers, and a REPEATS_INPUT_STATE edge from a round that began from an earlier round's input state back to\n * that round — the loop a lane that is not converging makes, drawn because the record states it.\n *\n * A playbook run is FAILED when the round records it failed and COMPLETED otherwise: landing nothing is a finished\n * run that changed nothing, not a failure. A nested lane's own rounds are not expanded here.\n */\nexport function choreographyGraph(trace: GraphViewChoreographyInput): GraphView {\n  const roundId = (iteration: number) => `round:${iteration}`;\n  const rounds = [...trace.rounds].sort((left, right) => left.iteration - right.iteration);\n  const known = new Set(rounds.map((round) => roundId(round.iteration)));\n  const nodes: GraphViewNode[] = [];\n  const edges: GraphViewEdge[] = [];\n  rounds.forEach((round, index) => {\n    const id = roundId(round.iteration);\n    nodes.push({ id, kind: GraphViewNodeKind.CHOREOGRAPHY_ROUND, label: String(round.iteration), waitsOn: [], inPorts: SINGLE_IN, outPorts: SINGLE_OUT, sourceRef: String(round.iteration) });\n    round.children.forEach((child, childIndex) => {\n      nodes.push({\n        id: `${id}:${childIndex}:${child.playbookRef}`,\n        kind: GraphViewNodeKind.PLAYBOOK_RUN,\n        label: child.playbookRef,\n        status: child.failed ? FlowsActors_Status.FAILED : FlowsActors_Status.COMPLETED,\n        waitsOn: [], inPorts: [], outPorts: [],\n        parentId: id,\n        sourceRef: child.playbookRef,\n      });\n    });\n    const next = rounds[index + 1];\n    if (next) {\n      const target = roundId(next.iteration);\n      edges.push({ id: edgeIdOf(GraphViewEdgeKind.NEXT_ROUND, id, GRAPH_VIEW_OUT_PORT, target, GRAPH_VIEW_IN_PORT), kind: GraphViewEdgeKind.NEXT_ROUND, source: id, sourcePort: GRAPH_VIEW_OUT_PORT, target, targetPort: GRAPH_VIEW_IN_PORT });\n    }\n    if (round.sameInputStateAsIteration !== undefined && known.has(roundId(round.sameInputStateAsIteration))) {\n      const target = roundId(round.sameInputStateAsIteration);\n      edges.push({ id: edgeIdOf(GraphViewEdgeKind.REPEATS_INPUT_STATE, id, GRAPH_VIEW_OUT_PORT, target, GRAPH_VIEW_IN_PORT), kind: GraphViewEdgeKind.REPEATS_INPUT_STATE, source: id, sourcePort: GRAPH_VIEW_OUT_PORT, target, targetPort: GRAPH_VIEW_IN_PORT });\n    }\n  });\n  return { nodes, edges };\n}\n\n//===============================================================\n//  A playbook catalog\n//===============================================================\n\n/** A playbook as the catalog map needs it: its ref and the edges it declares, each a ref or a family id. */\nexport interface GraphViewCatalogPlaybook {\n  readonly playbookRef: string;\n  /** The families it writes: its declared outputs, not those of the children a composite runs. */\n  readonly outputFamilies: readonly string[];\n  /** The families its declared inputs read. */\n  readonly inputFamilies: readonly string[];\n  /** The families its preconditions name. */\n  readonly preconditionFamilies: readonly string[];\n  /** The families whose decision decides whether one of its preconditions applies; it never waits for them. */\n  readonly conditionFamilies: readonly string[];\n  /** The playbooks it runs as children when it is a composite, by ref; empty otherwise. */\n  readonly admits: readonly string[];\n}\n\nexport interface GraphViewPlaybookCatalogInput {\n  readonly playbooks: readonly GraphViewCatalogPlaybook[];\n  /** A family's name, from its own record; a family named nowhere is labelled by its id. */\n  readonly familyLabels?: ReadonlyMap<string, string>;\n}\n\n/**\n * The port a playbook's GATES and CONDITIONS edges enter by, apart from its READS and ADMITS, so a family that both feeds\n * and gates it shows both. A condition enters by the gate too, since it changes what the gate asks.\n */\nexport const GRAPH_VIEW_GATE_PORT = 'gate';\n/** The port a composite's ADMITS edges leave by, apart from the families it writes. */\nexport const GRAPH_VIEW_ADMITS_PORT = 'admits';\n\n/** A catalog node's id: playbooks and families live in separate namespaces, since a ref and a family id may be spelled alike. */\nexport function playbookCatalogNodeId(kind: GraphViewNodeKind.PLAYBOOK | GraphViewNodeKind.SPECIFICATION_FAMILY, ref: string): string {\n  return `${kind}:${ref}`;\n}\n\n/**\n * A playbook catalog as a graph: what unlocks what. One node per playbook and one per family any of them names, and\n * the five relations a playbook declares: it PRODUCES the families it writes, READS its inputs, waits for the families\n * its preconditions name (GATES), lets a family's decision decide what it waits for (CONDITIONS), and, as a composite,\n * ADMITS its children.\n *\n * Nothing is drawn that the declarations do not hold. A playbook carries no status here: whether it may run now is a\n * verdict the host owns and shows on the node's body. Nor does it wait on anything the graph can name: a precondition\n * may ask for a family to exist, be valid, be stale or decide, and only the gate knows which, so `waitsOn` stays empty\n * rather than guess. A child the catalog does not hold draws no edge, as a dependency on an unknown step does not.\n *\n * Each relation a node has more than one meaning for gets its own port: a playbook's GATES and CONDITIONS enter by the\n * gate port and its READS and ADMITS by the main one, and a composite's ADMITS leave by the admits port. A family that both feeds a\n * playbook and gates it therefore draws two visible arrows, not one hidden under the other.\n */\nexport function playbookCatalogGraph(input: GraphViewPlaybookCatalogInput): GraphView {\n  const playbookId = (ref: string) => playbookCatalogNodeId(GraphViewNodeKind.PLAYBOOK, ref);\n  const familyId = (family: string) => playbookCatalogNodeId(GraphViewNodeKind.SPECIFICATION_FAMILY, family);\n  const catalog = new Set(input.playbooks.map((playbook) => playbook.playbookRef));\n  const families: string[] = [];\n  const seenFamilies = new Set<string>();\n  const nameFamily = (family: string) => {\n    if (seenFamilies.has(family)) return;\n    seenFamilies.add(family);\n    families.push(family);\n  };\n  const edges: GraphViewEdge[] = [];\n  const edge = (kind: GraphViewEdgeKind, source: string, sourcePort: string, target: string, targetPort: string) => {\n    edges.push({ id: edgeIdOf(kind, source, sourcePort, target, targetPort), kind, source, sourcePort, target, targetPort });\n  };\n\n  const playbookNodes = input.playbooks.map((playbook): GraphViewNode => {\n    const id = playbookId(playbook.playbookRef);\n    const preconditions = distinct(playbook.preconditionFamilies);\n    const conditions = distinct(playbook.conditionFamilies);\n    const children = distinct(playbook.admits).filter((child) => catalog.has(child));\n    for (const family of distinct(playbook.inputFamilies)) {\n      nameFamily(family);\n      edge(GraphViewEdgeKind.READS, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_IN_PORT);\n    }\n    for (const family of preconditions) {\n      nameFamily(family);\n      edge(GraphViewEdgeKind.GATES, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_GATE_PORT);\n    }\n    for (const family of conditions) {\n      nameFamily(family);\n      edge(GraphViewEdgeKind.CONDITIONS, familyId(family), GRAPH_VIEW_OUT_PORT, id, GRAPH_VIEW_GATE_PORT);\n    }\n    for (const family of distinct(playbook.outputFamilies)) {\n      nameFamily(family);\n      edge(GraphViewEdgeKind.PRODUCES, id, GRAPH_VIEW_OUT_PORT, familyId(family), GRAPH_VIEW_IN_PORT);\n    }\n    for (const child of children) {\n      edge(GraphViewEdgeKind.ADMITS, id, GRAPH_VIEW_ADMITS_PORT, playbookId(child), GRAPH_VIEW_IN_PORT);\n    }\n    return {\n      id,\n      kind: GraphViewNodeKind.PLAYBOOK,\n      label: playbook.playbookRef,\n      waitsOn: [],\n      inPorts: preconditions.length > 0 || conditions.length > 0 ? [...SINGLE_IN, { id: GRAPH_VIEW_GATE_PORT }] : SINGLE_IN,\n      outPorts: children.length > 0 ? [...SINGLE_OUT, { id: GRAPH_VIEW_ADMITS_PORT }] : SINGLE_OUT,\n      sourceRef: playbook.playbookRef,\n    };\n  });\n  const familyNodes = families.map((family): GraphViewNode => ({\n    id: familyId(family),\n    kind: GraphViewNodeKind.SPECIFICATION_FAMILY,\n    label: input.familyLabels?.get(family) ?? family,\n    waitsOn: [],\n    inPorts: SINGLE_IN,\n    outPorts: SINGLE_OUT,\n    sourceRef: family,\n  }));\n  return { nodes: [...playbookNodes, ...familyNodes], edges };\n}\n"]}

package/dist/esm/core/flows-actors/model-cost-money.frontend.utils.d.ts

@@ -0,0 +1,12 @@
+/**
+ * A model-cost total held in minor units (cents for USD, yen for JPY), as money in the reader's locale (#2528).
+ *
+ * The cost of model calls is stored and summed in the currency's minor units, so a screen must divide by the currency's
+ * own exponent before it can show an amount; printing `costMinor` raw shows 1 234 where 12,34 € is meant. `undefined`
+ * for a currency with no minor-unit exponent, which is the case of `XXX`: the calls no registered authority priced,
+ * counted apart as unpriced and never shown as an amount.
+ *
+ * One place for the conversion, so the cost of one run and the cost per case cannot round differently.
+ */
+export declare function formatModelCostMinorUnits(costMinor: number, currency: string, formatNumber: (value: number, options?: Intl.NumberFormatOptions) => string): string | undefined;
+//# sourceMappingURL=model-cost-money.frontend.utils.d.ts.map

package/dist/esm/core/flows-actors/model-cost-money.frontend.utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-cost-money.frontend.utils.d.ts","sourceRoot":"","sources":["../../../../../src/core/flows-actors/model-cost-money.frontend.utils.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CACvC,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,mBAAmB,KAAK,MAAM,GAC1E,MAAM,GAAG,SAAS,CAMpB"}

package/dist/esm/core/flows-actors/model-cost-money.frontend.utils.js

@@ -0,0 +1,20 @@
+import { currencyMinorUnitDecimals, fromMoneyAmount } from '@wildo-ai/zod-decorators';
+/**
+ * A model-cost total held in minor units (cents for USD, yen for JPY), as money in the reader's locale (#2528).
+ *
+ * The cost of model calls is stored and summed in the currency's minor units, so a screen must divide by the currency's
+ * own exponent before it can show an amount; printing `costMinor` raw shows 1 234 where 12,34 € is meant. `undefined`
+ * for a currency with no minor-unit exponent, which is the case of `XXX`: the calls no registered authority priced,
+ * counted apart as unpriced and never shown as an amount.
+ *
+ * One place for the conversion, so the cost of one run and the cost per case cannot round differently.
+ */
+export function formatModelCostMinorUnits(costMinor, currency, formatNumber) {
+    const decimals = currencyMinorUnitDecimals(currency);
+    if (decimals === undefined)
+        return undefined;
+    return formatNumber(fromMoneyAmount(BigInt(costMinor), decimals), {
+        style: 'currency', currency, minimumFractionDigits: decimals, maximumFractionDigits: decimals,
+    });
+}
+//# sourceMappingURL=model-cost-money.frontend.utils.js.map

package/dist/esm/core/flows-actors/model-cost-money.frontend.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-cost-money.frontend.utils.js","sourceRoot":"","sources":["../../../../../src/core/flows-actors/model-cost-money.frontend.utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,yBAAyB,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAEtF;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CACvC,SAAiB,EACjB,QAAgB,EAChB,YAA2E;IAE3E,MAAM,QAAQ,GAAG,yBAAyB,CAAC,QAAQ,CAAC,CAAC;IACrD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC7C,OAAO,YAAY,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,QAAQ,CAAC,EAAE;QAChE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,qBAAqB,EAAE,QAAQ,EAAE,qBAAqB,EAAE,QAAQ;KAC9F,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { currencyMinorUnitDecimals, fromMoneyAmount } from '@wildo-ai/zod-decorators';\n\n/**\n * A model-cost total held in minor units (cents for USD, yen for JPY), as money in the reader's locale (#2528).\n *\n * The cost of model calls is stored and summed in the currency's minor units, so a screen must divide by the currency's\n * own exponent before it can show an amount; printing `costMinor` raw shows 1 234 where 12,34 € is meant. `undefined`\n * for a currency with no minor-unit exponent, which is the case of `XXX`: the calls no registered authority priced,\n * counted apart as unpriced and never shown as an amount.\n *\n * One place for the conversion, so the cost of one run and the cost per case cannot round differently.\n */\nexport function formatModelCostMinorUnits(\n  costMinor: number,\n  currency: string,\n  formatNumber: (value: number, options?: Intl.NumberFormatOptions) => string,\n): string | undefined {\n  const decimals = currencyMinorUnitDecimals(currency);\n  if (decimals === undefined) return undefined;\n  return formatNumber(fromMoneyAmount(BigInt(costMinor), decimals), {\n    style: 'currency', currency, minimumFractionDigits: decimals, maximumFractionDigits: decimals,\n  });\n}\n"]}

package/dist/esm/core/flows-actors/usePendingDecisions.d.ts

@@ -1,9 +1,33 @@
-import { type HumanDecision_Act, type HumanDecision_ActOutcome, type HumanDecision_ActRequest, type HumanDecision_PendingCard, type HumanDecision_ReassignCandidate } from '@wildo-ai/saas-models';
+import { type HumanDecision_Act, type HumanDecision_ActOutcome, type HumanDecision_ActRequest, type HumanDecision_PendingCard, type HumanDecision_ReassignCandidate, type WS_FlowsActorsDecisionWithdrawnPayload } from '@wildo-ai/saas-models';
+/**
+ * The cards a withdrawal leaves standing (#2569): every card but the one for that decision at a route version older
+ * than the one it moved to (any version, when it ended). A card already at the new version was re-read after the move
+ * and is current, so the person who claimed a decision keeps it while their colleagues lose it.
+ */
+export declare function cardsAfterWithdrawal(cards: readonly HumanDecision_PendingCard[], withdrawn: WS_FlowsActorsDecisionWithdrawnPayload): readonly HumanDecision_PendingCard[];
+/**
+ * Where the inbox's read of the server list stands (#2526). Three states a reader must be able to tell apart, because each
+ * calls for something different from them: wait, retry, or nothing to do.
+ */
+export declare enum PendingDecisionsReadState {
+    /** No read has settled yet. An inbox shows a placeholder, never "nothing pending". */
+    LOADING = "loading",
+    /** The last read succeeded: `decisions` is what the server listed. */
+    READY = "ready",
+    /**
+     * The last read failed. `decisions` keeps what an earlier read listed (empty when none succeeded), so an inbox can say
+     * the list may be out of date and offer `refresh`. Every act is re-checked by the server, so acting on it stays safe.
+     */
+    FAILED = "failed"
+}
 export interface PendingDecisionsState {
     /** The decisions the signed-in person may act on, soonest deadline first, as the server lists them. */
     readonly decisions: readonly HumanDecision_PendingCard[];
+    /** Whether a read is in flight — any read, including a refresh while a list is already shown. */
     readonly isLoading: boolean;
-    /** Re-read the list — after an act, and whenever a decision is routed to this person. */
+    /** Where the last read stands (#2526). */
+    readonly readState: PendingDecisionsReadState;
+    /** Re-read the list — after an act, and whenever a decision is routed to this person or leaves them (#2569). */
     readonly refresh: () => Promise<void>;
     /** One act on one decision. Resolves to what it came to; a refusal is an outcome, never a thrown error. */
     readonly act: (decisionRef: string, act: HumanDecision_Act, request: HumanDecision_ActRequest) => Promise<HumanDecision_ActOutcome>;
@@ -18,15 +42,16 @@ export interface PendingDecisionsState {
  * one source: it covers every conversation, it re-checks each card with the rule an act is checked with,
  * and it survives a reload.
  *
- * Refreshed when the server announces a decision routed to this person (`flows-actors:decision-routed`,
- * sent to their own room only) and after every act this hook sends.
+ * Refreshed when the server announces a decision routed to this person (`flows-actors:decision-routed`: to their own
+ * room for one assigned to them or raised by them, to their role's room for one waiting on a role they hold) and after
+ * every act this hook sends. When the server announces a decision LEFT this
+ * person (`flows-actors:decision-withdrawn`, #2569: claimed by a colleague, moved, answered, stopped or lapsed), its
+ * card goes at once — before the re-read, so nobody acts on it in between — and the list is re-read. Except while this
+ * hook is acting on that decision itself: the act re-reads when it returns, and the person acting keeps their card.
  *
- * `list: false` is for a component that ANSWERS one decision it already holds (a named-option decision, a
- * free-text question): it acts, and neither reads nor subscribes to the inbox it does not show.
+ * It had a `list: false` mode for a component that answered one named-option or free-text decision it held. Both
+ * such components were folded into the inbox (#2526), which answers a named-option decision from its own card, and
+ * the mode went with them.
  */
-export interface UsePendingDecisionsOptions {
-    /** Read and follow the inbox list. Defaults to true. */
-    readonly list?: boolean;
-}
-export declare function usePendingDecisions(options?: UsePendingDecisionsOptions): PendingDecisionsState;
+export declare function usePendingDecisions(): PendingDecisionsState;
 //# sourceMappingURL=usePendingDecisions.d.ts.map