@particle-academy/fancy-flow 0.74.0 → 0.75.0

package/dist/{chunk-VAF2SWTC.js → chunk-XZFLPKO2.js}

@@ -1,4 +1,4 @@
-import { getNodeKind, kindIds } from './chunk-EX34GCKK.js';
+import { getNodeKind, kindIds } from './chunk-W7DMO3H7.js';
 
 // src/analysis/graph-connectivity.ts
 function checkGraphConnectivity(graph) {
@@ -50,5 +50,5 @@ function isTerminator(node) {
 }
 
 export { checkGraphConnectivity, mayFloat };
-//# sourceMappingURL=chunk-VAF2SWTC.js.map
-//# sourceMappingURL=chunk-VAF2SWTC.js.map
+//# sourceMappingURL=chunk-XZFLPKO2.js.map
+//# sourceMappingURL=chunk-XZFLPKO2.js.map

package/dist/{chunk-VAF2SWTC.js.map → chunk-XZFLPKO2.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/analysis/graph-connectivity.ts"],"names":[],"mappings":";;;AAsCO,SAAS,uBAAuB,KAAA,EAAiC;AACtE,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,KAAA;AACzB,EAAA,MAAM,SAAwB,EAAC;AAE/B,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,WAAA,CAAY,GAAA,CAAI,KAAK,MAAM,CAAA;AAC3B,IAAA,WAAA,CAAY,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAC7B;AAMA,EAAA,MAAM,MAAA,GAAS,MAAM,MAAA,KAAW,CAAA;AAEhC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,MAAA,IAAU,QAAA,CAAS,IAAI,CAAA,EAAG;AAE9B,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAC,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1D,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA,EAAO,OAAA;AAAA,QACP,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA,EACE,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,oSAAA;AAAA,OAInB,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAEhD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,YAAA,CAAa,MAAM,CAAA,EAAG;AAEtC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,KAAA,EAAO,OAAA;AAAA,MACP,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,OAAA,EACE,SAAS,IAAA,CAAK,EAAE,iBAAiB,IAAA,CAAK,MAAM,CAAA,6JAAA,EAET,IAAA,CAAK,MAAM,CAAA,kCAAA;AAAA,KACjD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,MAAA;AACT;AAyBO,SAAS,SAAS,IAAA,EAAyB;AAChD,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,EAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,IAAA;AAE5B,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,OAAO,OAAA,CAAQ,IAAI,CAAA,CAAE,QAAA,CAAS,MAAM,KAAK,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,IAAA,CAAK,QAAA,KAAa,QAAA;AAC/F;AAWA,SAAS,aAAa,IAAA,EAAyB;AAM7C,EAAA,MAAM,GAAA,GAAO,KAAK,IAAA,EAA8C,OAAA;AAChE,EAAA,IAAI,MAAM,OAAA,CAAQ,GAAG,CAAA,EAAG,OAAO,IAAI,MAAA,KAAW,CAAA;AAE9C,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA,GAAO,WAAA,CAAY,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAKlD,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAElB,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,IAAK,IAAA,CAAK,QAAQ,MAAA,KAAW,CAAA;AAChE","file":"chunk-VAF2SWTC.js","sourcesContent":["import { getNodeKind, kindIds } from \"../registry/registry\";\nimport type { FlowGraph, FlowNode } from \"../types\";\nimport type { ImportIssue } from \"../schema/workflow-schema\";\n\n/**\n * Refuse a graph whose nodes cannot take part in the workflow's dataflow.\n *\n * Two shapes, both of which import cleanly and then quietly do nothing. Neither\n * FAILS — which is what makes them worth refusing at authoring time, because a\n * run that reports success is the worst way for a workflow to be wrong. Both\n * were measured against the PHP twin's engine before this was written, and both\n * behave the same way here:\n *\n * ## 1. A FLOATING node — no inbound and no outbound edge\n *\n * It is NOT skipped. A node with no incoming edge is a root, so the topo sort\n * runs it: a three-node graph with one floating `log` executed `t,lonely,o`. It\n * runs disconnected — receiving nothing from the graph and reaching nobody in\n * it — which is precisely the state an author cannot see on a canvas.\n *\n * ## 2. An edge leaving a TERMINATOR\n *\n * A terminal kind — `output`, `log` — declares an EMPTY output port list. It\n * ends a chain. Measured: `t -> output -> log` imported clean and the `log` DID\n * run, with `{{ input }}` resolving to `\"\"`. `collectInputs` binds a payload\n * only when `\"<sourceId>:<handle>\"` exists, and a node publishing no ports never\n * creates that key — so the edge does not fail, it delivers nothing, and the\n * node downstream operates on a hole.\n *\n * That is the same silent-nothing the undelivered-edge diagnostic reports at run\n * time, but this one is decidable FROM THE DOCUMENT ALONE.\n *\n * ## What may float\n *\n * See {@link mayFloat}. Not only `note`: any `annotation` or `layout` kind (a\n * swimlane is never wired to anything — that is what a lane IS), and any kind\n * the registry does not know.\n */\nexport function checkGraphConnectivity(graph: FlowGraph): ImportIssue[] {\n  const { nodes, edges } = graph;\n  const issues: ImportIssue[] = [];\n\n  const hasIncoming = new Set<string>();\n  const hasOutgoing = new Set<string>();\n  for (const edge of edges) {\n    hasIncoming.add(edge.target);\n    hasOutgoing.add(edge.source);\n  }\n\n  // A single-node graph is not \"floating\" — it is a graph with one step, which\n  // is a legitimate (if small) workflow and what every graph looks like on the\n  // way to a bigger one. Refusing it would make the editor unusable from the\n  // first node placed.\n  const single = nodes.length === 1;\n\n  for (const node of nodes) {\n    if (single || mayFloat(node)) continue;\n\n    if (!hasIncoming.has(node.id) && !hasOutgoing.has(node.id)) {\n      issues.push({\n        level: \"error\",\n        nodeId: node.id,\n        message:\n          `Node \"${node.id}\" is connected to nothing — no inbound edge and no outbound edge. ` +\n          `It still RUNS (a node with no inbound edge is a root), but it receives nothing from ` +\n          `the graph and reaches nobody in it, so it is either unwired or left behind by a ` +\n          `deletion. Only a note, an annotation or a lane may float.`,\n      });\n    }\n  }\n\n  const byId = new Map(nodes.map((n) => [n.id, n]));\n\n  for (const edge of edges) {\n    const source = byId.get(edge.source);\n    if (!source || !isTerminator(source)) continue;\n\n    issues.push({\n      level: \"error\",\n      edgeId: edge.id,\n      message:\n        `Edge \"${edge.id}\" reads from \"${edge.source}\", which is a TERMINAL node and publishes ` +\n        `no output ports at all. Nothing can ever travel this edge: it does not fail at run ` +\n        `time, it delivers nothing, and \"${edge.target}\" runs anyway with an empty input.`,\n    });\n  }\n\n  return issues;\n}\n\n/**\n * Which nodes are allowed to sit unconnected.\n *\n * Three answers, and the third is the one that took a second pass — it was\n * missed in the PHP twin's first release and shipped as 0.48.1:\n *\n * 1. **`note`**, across every id the kind answers to, so a graph saved with the\n *    canonical `@particle-academy/note` stays an annotation rather than becoming\n *    an unwireable node.\n * 2. **Any `annotation` or `layout` kind.** A host may register its own note,\n *    and `@particle-academy/lane` is a swimlane the engine walks straight past.\n *    Neither is a step and neither is ever wired.\n * 3. **A kind the registry has never heard of.** Not a loophole — the honest\n *    answer. An unknown kind already produces its own issue, and we cannot know\n *    whether it is a step, an annotation or a lane. Claiming it must be wired\n *    would assert something unverifiable, and it lands hardest on the graphs\n *    that deserve it least: a laned graph loaded by a runtime without `lane`\n *    registered would report every swimlane twice, the second time wrongly.\n *\n * The note/annotation/layout half matches the test `run-flow` uses to skip a\n * node. The unknown-kind half deliberately does NOT — see the closing comment in\n * this file for why the two must not become one helper.\n */\nexport function mayFloat(node: FlowNode): boolean {\n  const type = node.type;\n  if (!type) return false;\n  if (type === \"note\") return true;\n\n  const kind = getNodeKind(type);\n  if (!kind) return true;\n\n  return kindIds(kind).includes(\"note\") || kind.category === \"annotation\" || kind.category === \"layout\";\n}\n\n/**\n * A kind that declares an EMPTY output list ends a chain.\n *\n * `[]` and `undefined` are different answers and only the first means this.\n * `undefined` is \"nobody declared what this publishes\", which resolves to `out`\n * and is most nodes in most graphs; `[]` is an explicit claim that there is\n * nothing to connect from. Reading them alike would refuse nearly every\n * workflow ever written.\n */\nfunction isTerminator(node: FlowNode): boolean {\n  // A node carrying its own ports overrides its kind — the engine reads these\n  // first, so an author who has said what this node publishes is believed.\n  // (The PHP twin's importer DROPS node-level ports, so this branch is reachable\n  // there only for a hand-built graph. Noted rather than smoothed over: the two\n  // importers genuinely differ here.)\n  const own = (node.data as { outputs?: unknown[] } | undefined)?.outputs;\n  if (Array.isArray(own)) return own.length === 0;\n\n  const kind = node.type ? getNodeKind(node.type) : null;\n\n  // An unregistered kind falls back to `out` in the engine, so it is not a\n  // terminator. Refusing here would break a host mid-registration, and would\n  // use \"I do not know\" as evidence.\n  if (!kind) return false;\n\n  return Array.isArray(kind.outputs) && kind.outputs.length === 0;\n}\n\n/**\n * NOT shared with `frontier`'s / `run-flow`'s annotation test, deliberately.\n *\n * The two predicates look identical and have OPPOSITE safe defaults, which is\n * exactly how a shared helper becomes a bug:\n *\n * - **Here** an unknown kind may float. Being permissive costs nothing — the\n *   unknown-kind issue already fires, and we would otherwise assert something\n *   unverifiable.\n * - **In the engine** an unknown kind must NOT be treated as an annotation.\n *   Being permissive there means SKIPPING a node the host meant to run, which\n *   is silent and unrecoverable.\n *\n * So the note/annotation/layout half is the same question and the unknown half\n * is a different one. Collapsing them into one function would read as tidier and\n * would make a host's unregistered kind stop executing.\n */\n"]}
+{"version":3,"sources":["../src/analysis/graph-connectivity.ts"],"names":[],"mappings":";;;AAsCO,SAAS,uBAAuB,KAAA,EAAiC;AACtE,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAM,GAAI,KAAA;AACzB,EAAA,MAAM,SAAwB,EAAC;AAE/B,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,WAAA,CAAY,GAAA,CAAI,KAAK,MAAM,CAAA;AAC3B,IAAA,WAAA,CAAY,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EAC7B;AAMA,EAAA,MAAM,MAAA,GAAS,MAAM,MAAA,KAAW,CAAA;AAEhC,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,MAAA,IAAU,QAAA,CAAS,IAAI,CAAA,EAAG;AAE9B,IAAA,IAAI,CAAC,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAC,WAAA,CAAY,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC1D,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACV,KAAA,EAAO,OAAA;AAAA,QACP,QAAQ,IAAA,CAAK,EAAA;AAAA,QACb,OAAA,EACE,CAAA,MAAA,EAAS,IAAA,CAAK,EAAE,CAAA,oSAAA;AAAA,OAInB,CAAA;AAAA,IACH;AAAA,EACF;AAEA,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAEhD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,YAAA,CAAa,MAAM,CAAA,EAAG;AAEtC,IAAA,MAAA,CAAO,IAAA,CAAK;AAAA,MACV,KAAA,EAAO,OAAA;AAAA,MACP,QAAQ,IAAA,CAAK,EAAA;AAAA,MACb,OAAA,EACE,SAAS,IAAA,CAAK,EAAE,iBAAiB,IAAA,CAAK,MAAM,CAAA,6JAAA,EAET,IAAA,CAAK,MAAM,CAAA,kCAAA;AAAA,KACjD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,MAAA;AACT;AAyBO,SAAS,SAAS,IAAA,EAAyB;AAChD,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,EAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,IAAA;AAE5B,EAAA,MAAM,IAAA,GAAO,YAAY,IAAI,CAAA;AAC7B,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,OAAO,OAAA,CAAQ,IAAI,CAAA,CAAE,QAAA,CAAS,MAAM,KAAK,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,IAAA,CAAK,QAAA,KAAa,QAAA;AAC/F;AAWA,SAAS,aAAa,IAAA,EAAyB;AAM7C,EAAA,MAAM,GAAA,GAAO,KAAK,IAAA,EAA8C,OAAA;AAChE,EAAA,IAAI,MAAM,OAAA,CAAQ,GAAG,CAAA,EAAG,OAAO,IAAI,MAAA,KAAW,CAAA;AAE9C,EAAA,MAAM,OAAO,IAAA,CAAK,IAAA,GAAO,WAAA,CAAY,IAAA,CAAK,IAAI,CAAA,GAAI,IAAA;AAKlD,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAElB,EAAA,OAAO,MAAM,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,IAAK,IAAA,CAAK,QAAQ,MAAA,KAAW,CAAA;AAChE","file":"chunk-XZFLPKO2.js","sourcesContent":["import { getNodeKind, kindIds } from \"../registry/registry\";\nimport type { FlowGraph, FlowNode } from \"../types\";\nimport type { ImportIssue } from \"../schema/workflow-schema\";\n\n/**\n * Refuse a graph whose nodes cannot take part in the workflow's dataflow.\n *\n * Two shapes, both of which import cleanly and then quietly do nothing. Neither\n * FAILS — which is what makes them worth refusing at authoring time, because a\n * run that reports success is the worst way for a workflow to be wrong. Both\n * were measured against the PHP twin's engine before this was written, and both\n * behave the same way here:\n *\n * ## 1. A FLOATING node — no inbound and no outbound edge\n *\n * It is NOT skipped. A node with no incoming edge is a root, so the topo sort\n * runs it: a three-node graph with one floating `log` executed `t,lonely,o`. It\n * runs disconnected — receiving nothing from the graph and reaching nobody in\n * it — which is precisely the state an author cannot see on a canvas.\n *\n * ## 2. An edge leaving a TERMINATOR\n *\n * A terminal kind — `output`, `log` — declares an EMPTY output port list. It\n * ends a chain. Measured: `t -> output -> log` imported clean and the `log` DID\n * run, with `{{ input }}` resolving to `\"\"`. `collectInputs` binds a payload\n * only when `\"<sourceId>:<handle>\"` exists, and a node publishing no ports never\n * creates that key — so the edge does not fail, it delivers nothing, and the\n * node downstream operates on a hole.\n *\n * That is the same silent-nothing the undelivered-edge diagnostic reports at run\n * time, but this one is decidable FROM THE DOCUMENT ALONE.\n *\n * ## What may float\n *\n * See {@link mayFloat}. Not only `note`: any `annotation` or `layout` kind (a\n * swimlane is never wired to anything — that is what a lane IS), and any kind\n * the registry does not know.\n */\nexport function checkGraphConnectivity(graph: FlowGraph): ImportIssue[] {\n  const { nodes, edges } = graph;\n  const issues: ImportIssue[] = [];\n\n  const hasIncoming = new Set<string>();\n  const hasOutgoing = new Set<string>();\n  for (const edge of edges) {\n    hasIncoming.add(edge.target);\n    hasOutgoing.add(edge.source);\n  }\n\n  // A single-node graph is not \"floating\" — it is a graph with one step, which\n  // is a legitimate (if small) workflow and what every graph looks like on the\n  // way to a bigger one. Refusing it would make the editor unusable from the\n  // first node placed.\n  const single = nodes.length === 1;\n\n  for (const node of nodes) {\n    if (single || mayFloat(node)) continue;\n\n    if (!hasIncoming.has(node.id) && !hasOutgoing.has(node.id)) {\n      issues.push({\n        level: \"error\",\n        nodeId: node.id,\n        message:\n          `Node \"${node.id}\" is connected to nothing — no inbound edge and no outbound edge. ` +\n          `It still RUNS (a node with no inbound edge is a root), but it receives nothing from ` +\n          `the graph and reaches nobody in it, so it is either unwired or left behind by a ` +\n          `deletion. Only a note, an annotation or a lane may float.`,\n      });\n    }\n  }\n\n  const byId = new Map(nodes.map((n) => [n.id, n]));\n\n  for (const edge of edges) {\n    const source = byId.get(edge.source);\n    if (!source || !isTerminator(source)) continue;\n\n    issues.push({\n      level: \"error\",\n      edgeId: edge.id,\n      message:\n        `Edge \"${edge.id}\" reads from \"${edge.source}\", which is a TERMINAL node and publishes ` +\n        `no output ports at all. Nothing can ever travel this edge: it does not fail at run ` +\n        `time, it delivers nothing, and \"${edge.target}\" runs anyway with an empty input.`,\n    });\n  }\n\n  return issues;\n}\n\n/**\n * Which nodes are allowed to sit unconnected.\n *\n * Three answers, and the third is the one that took a second pass — it was\n * missed in the PHP twin's first release and shipped as 0.48.1:\n *\n * 1. **`note`**, across every id the kind answers to, so a graph saved with the\n *    canonical `@particle-academy/note` stays an annotation rather than becoming\n *    an unwireable node.\n * 2. **Any `annotation` or `layout` kind.** A host may register its own note,\n *    and `@particle-academy/lane` is a swimlane the engine walks straight past.\n *    Neither is a step and neither is ever wired.\n * 3. **A kind the registry has never heard of.** Not a loophole — the honest\n *    answer. An unknown kind already produces its own issue, and we cannot know\n *    whether it is a step, an annotation or a lane. Claiming it must be wired\n *    would assert something unverifiable, and it lands hardest on the graphs\n *    that deserve it least: a laned graph loaded by a runtime without `lane`\n *    registered would report every swimlane twice, the second time wrongly.\n *\n * The note/annotation/layout half matches the test `run-flow` uses to skip a\n * node. The unknown-kind half deliberately does NOT — see the closing comment in\n * this file for why the two must not become one helper.\n */\nexport function mayFloat(node: FlowNode): boolean {\n  const type = node.type;\n  if (!type) return false;\n  if (type === \"note\") return true;\n\n  const kind = getNodeKind(type);\n  if (!kind) return true;\n\n  return kindIds(kind).includes(\"note\") || kind.category === \"annotation\" || kind.category === \"layout\";\n}\n\n/**\n * A kind that declares an EMPTY output list ends a chain.\n *\n * `[]` and `undefined` are different answers and only the first means this.\n * `undefined` is \"nobody declared what this publishes\", which resolves to `out`\n * and is most nodes in most graphs; `[]` is an explicit claim that there is\n * nothing to connect from. Reading them alike would refuse nearly every\n * workflow ever written.\n */\nfunction isTerminator(node: FlowNode): boolean {\n  // A node carrying its own ports overrides its kind — the engine reads these\n  // first, so an author who has said what this node publishes is believed.\n  // (The PHP twin's importer DROPS node-level ports, so this branch is reachable\n  // there only for a hand-built graph. Noted rather than smoothed over: the two\n  // importers genuinely differ here.)\n  const own = (node.data as { outputs?: unknown[] } | undefined)?.outputs;\n  if (Array.isArray(own)) return own.length === 0;\n\n  const kind = node.type ? getNodeKind(node.type) : null;\n\n  // An unregistered kind falls back to `out` in the engine, so it is not a\n  // terminator. Refusing here would break a host mid-registration, and would\n  // use \"I do not know\" as evidence.\n  if (!kind) return false;\n\n  return Array.isArray(kind.outputs) && kind.outputs.length === 0;\n}\n\n/**\n * NOT shared with `frontier`'s / `run-flow`'s annotation test, deliberately.\n *\n * The two predicates look identical and have OPPOSITE safe defaults, which is\n * exactly how a shared helper becomes a bug:\n *\n * - **Here** an unknown kind may float. Being permissive costs nothing — the\n *   unknown-kind issue already fires, and we would otherwise assert something\n *   unverifiable.\n * - **In the engine** an unknown kind must NOT be treated as an annotation.\n *   Being permissive there means SKIPPING a node the host meant to run, which\n *   is silent and unrecoverable.\n *\n * So the note/annotation/layout half is the same question and the unknown half\n * is a different one. Collapsing them into one function would read as tidier and\n * would make a host's unregistered kind stop executing.\n */\n"]}

package/dist/{chunk-GQ5LEA7Q.js → chunk-ZBHIEKCN.js}

@@ -1,5 +1,5 @@
 import { applyNodeChanges, applyEdgeChanges, addEdge } from './chunk-OWENS2H5.js';
-import { runFlow, getNodeKind } from './chunk-EX34GCKK.js';
+import { runFlow, getNodeKind } from './chunk-W7DMO3H7.js';
 import { useState, useRef, useCallback, useMemo } from 'react';
 
 function useFlowRun({ maxFeed = 200 } = {}) {
@@ -235,5 +235,5 @@ function useFlowHistory(flow) {
 }
 
 export { applyOutputsToNodes, applyStatusesToNodes, createHistory, useFlowHistory, useFlowRun, useFlowState };
-//# sourceMappingURL=chunk-GQ5LEA7Q.js.map
-//# sourceMappingURL=chunk-GQ5LEA7Q.js.map
+//# sourceMappingURL=chunk-ZBHIEKCN.js.map
+//# sourceMappingURL=chunk-ZBHIEKCN.js.map

package/dist/{chunk-GQ5LEA7Q.js.map → chunk-ZBHIEKCN.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/runtime/use-flow-run.ts","../src/runtime/use-flow-state.ts","../src/runtime/history.ts","../src/runtime/use-flow-history.ts"],"names":["useState","useCallback","useRef"],"mappings":";;;;AA8DO,SAAS,WAAW,EAAE,OAAA,GAAU,GAAA,EAAI,GAAuB,EAAC,EAAqB;AACtF,EAAA,MAAM,CAAC,QAAA,EAAU,WAAW,CAAA,GAAI,QAAA,CAAwC,EAAE,CAAA;AAC1E,EAAA,MAAM,CAAC,UAAA,EAAY,aAAa,CAAA,GAAI,QAAA,CAA6C,EAAE,CAAA;AACnF,EAAA,MAAM,CAAC,YAAA,EAAc,eAAe,CAAA,GAAI,QAAA,CAA6C,EAAE,CAAA;AACvF,EAAA,MAAM,CAAC,OAAA,EAAS,UAAU,CAAA,GAAI,QAAA,CAAkC,EAAE,CAAA;AAClE,EAAA,MAAM,CAAC,IAAA,EAAM,OAAO,CAAA,GAAI,QAAA,CAA6B,EAAE,CAAA;AACvD,EAAA,MAAM,CAAC,OAAA,EAAS,UAAU,CAAA,GAAI,SAAS,KAAK,CAAA;AAC5C,EAAA,MAAM,CAAC,UAAA,EAAY,aAAa,CAAA,GAAI,SAA2B,IAAI,CAAA;AACnE,EAAA,MAAM,QAAA,GAAW,OAA+B,IAAI,CAAA;AAEpD,EAAA,MAAM,WAAA,GAAc,WAAA;AAAA,IAClB,CAAC,CAAA,KAAgB;AACf,MAAA,QAAQ,EAAE,IAAA;AAAM,QACd,KAAK,aAAA;AACH,UAAA,WAAA,CAAY,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,CAAA;AACnD,UAAA,aAAA,CAAc,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,IAAA,EAAK,CAAE,CAAA;AACnD,UAAA,UAAA,CAAW,EAAE,OAAO,QAAA,EAAU,IAAA,EAAM,GAAG,CAAA,CAAE,MAAM,CAAA,QAAA,EAAM,CAAA,CAAE,MAAM,CAAA,EAAG,EAAE,IAAA,GAAO,CAAA,EAAA,EAAK,EAAE,IAAI,CAAA,CAAA,CAAA,GAAM,EAAE,CAAA,CAAA,EAAI,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA;AAClH,UAAA;AAAA,QACF,KAAK,cAAA;AACH,UAAA,eAAA,CAAgB,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,OAAA,EAAQ,CAAE,CAAA;AACxD,UAAA,UAAA,CAAW,EAAE,OAAO,SAAA,EAAW,IAAA,EAAM,EAAE,OAAA,EAAS,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA;AAClE,UAAA;AAAA,QACF,KAAK,aAAA;AACH,UAAA,UAAA,CAAW,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,KAAA,EAAM,CAAE,CAAA;AACjD,UAAA,UAAA,CAAW,EAAE,OAAO,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,GAAA,EAAM,QAAQ,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,EAAI,MAAA,EAAQ,EAAE,MAAA,EAAQ,MAAA,EAAQ,CAAA,CAAE,KAAA,EAAO,CAAA;AACtH,UAAA;AAAA,QACF,KAAK,KAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,OAAA,EAAS,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,MAAA,EAAQ,CAAA,CAAE,QAAQ,CAAA;AAClF,UAAA;AAAA,QACF,KAAK,WAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,sBAAiB,CAAA;AACnD,UAAA;AAAA,QACF,KAAK,SAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,CAAA,CAAE,EAAA,GAAK,MAAA,GAAS,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,EAAA,GAAK,qBAAA,GAAmB,mBAAA,EAAgB,CAAA;AAC7F,UAAA;AAAA,QACF,KAAK,WAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,OAAO,CAAA;AAC5C,UAAA;AAAA;AAEJ,MAAA,SAAS,WAAW,OAAA,EAA8C;AAChE,QAAA,OAAA,CAAQ,CAAC,CAAA,KAAM;AACb,UAAA,MAAM,QAA0B,EAAE,EAAA,EAAI,CAAA,EAAG,IAAA,CAAK,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,IAAI,EAAA,EAAI,IAAA,CAAK,GAAA,EAAI,EAAG,GAAG,OAAA,EAAQ;AAC9F,UAAA,MAAM,IAAA,GAAO,CAAC,GAAG,CAAA,EAAG,KAAK,CAAA;AACzB,UAAA,OAAO,IAAA,CAAK,SAAS,OAAA,GAAU,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,GAAS,OAAO,CAAA,GAAI,IAAA;AAAA,QACrE,CAAC,CAAA;AAAA,MACH;AAAA,IACF,CAAA;AAAA,IACA,CAAC,OAAO;AAAA,GACV;AAEA,EAAA,MAAM,GAAA,GAAM,WAAA;AAAA,IACV,OAAO,KAAA,EAAkB,SAAA,EAA6B,OAAA,GAAsB,EAAC,KAAM;AACjF,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,SAAS,EAAC,EAAG,OAAO,oCAAA,EAAqC;AAAA,MAC/E;AACA,MAAA,MAAM,UAAA,GAAa,IAAI,eAAA,EAAgB;AACvC,MAAA,QAAA,CAAS,OAAA,GAAU,UAAA;AAEnB,MAAA,MAAM,eAA8C,EAAC;AACrD,MAAA,KAAA,MAAW,KAAK,KAAA,CAAM,KAAA,EAAO,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,MAAA;AAClD,MAAA,WAAA,CAAY,YAAY,CAAA;AACxB,MAAA,aAAA,CAAc,EAAE,CAAA;AAChB,MAAA,UAAA,CAAW,EAAE,CAAA;AACb,MAAA,UAAA,CAAW,IAAI,CAAA;AACf,MAAA,IAAI;AACF,QAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,KAAA,EAAO,SAAA,EAAW,WAAA,EAAa,EAAE,GAAG,OAAA,EAAS,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,CAAA;AACrG,QAAA,aAAA,CAAc,MAAM,CAAA;AACpB,QAAA,OAAO,MAAA;AAAA,MACT,CAAA,SAAE;AACA,QAAA,UAAA,CAAW,KAAK,CAAA;AAChB,QAAA,QAAA,CAAS,OAAA,GAAU,IAAA;AAAA,MACrB;AAAA,IACF,CAAA;AAAA,IACA,CAAC,aAAa,OAAO;AAAA,GACvB;AAEA,EAAA,MAAM,MAAA,GAAS,YAAY,MAAM,QAAA,CAAS,SAAS,KAAA,EAAM,EAAG,EAAE,CAAA;AAE9D,EAAA,MAAM,KAAA,GAAQ,YAAY,MAAM;AAC9B,IAAA,WAAA,CAAY,EAAE,CAAA;AACd,IAAA,aAAA,CAAc,EAAE,CAAA;AAChB,IAAA,UAAA,CAAW,EAAE,CAAA;AACb,IAAA,OAAA,CAAQ,EAAE,CAAA;AACV,IAAA,aAAA,CAAc,IAAI,CAAA;AAAA,EACpB,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,OAAO,EAAE,QAAA,EAAU,UAAA,EAAY,YAAA,EAAc,OAAA,EAAS,MAAM,OAAA,EAAS,UAAA,EAAY,GAAA,EAAK,MAAA,EAAQ,KAAA,EAAM;AACtG;AAOO,SAAS,mBAAA,CACd,OACA,OAAA,EACS;AACT,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM;AACtB,IAAA,MAAM,OAAO,WAAA,CAAa,CAAA,CAAE,MAAc,IAAA,IAAQ,CAAA,CAAE,QAAQ,EAAE,CAAA;AAC9D,IAAA,IAAI,CAAC,IAAA,EAAM,QAAA,IAAY,EAAE,CAAA,CAAE,EAAA,IAAM,UAAU,OAAO,CAAA;AAClD,IAAA,OAAO,EAAE,GAAG,CAAA,EAAG,IAAA,EAAM,EAAE,GAAG,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,CAAQ,CAAA,CAAE,EAAE,GAAE,EAAE;AAAA,EAC5D,CAAC,CAAA;AACH;AAGO,SAAS,oBAAA,CACd,KAAA,EACA,QAAA,EACA,UAAA,EACS;AACT,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IACvB,GAAG,CAAA;AAAA,IACH,IAAA,EAAM;AAAA,MACJ,GAAG,CAAA,CAAE,IAAA;AAAA,MACL,QAAQ,QAAA,CAAS,CAAA,CAAE,EAAE,CAAA,IAAK,CAAA,CAAE,MAAM,MAAA,IAAU,MAAA;AAAA,MAC5C,YAAY,UAAA,CAAW,CAAA,CAAE,EAAE,CAAA,IAAK,EAAE,IAAA,EAAM;AAAA;AAC1C,GACF,CAAE,CAAA;AACJ;AAEA,SAAS,QAAQ,CAAA,EAAoB;AACnC,EAAA,IAAI;AACF,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA;AAC1B,IAAA,OAAO,CAAA,IAAK,CAAA,CAAE,MAAA,GAAS,EAAA,GAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,GAAI,QAAA,GAAO,CAAA,IAAK,MAAA,CAAO,CAAC,CAAA;AAAA,EACnE,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,OAAO,CAAC,CAAA;AAAA,EACjB;AACF;AC3JO,SAAS,aAAa,OAAA,EAAwC;AACnE,EAAA,MAAM,CAAC,KAAA,EAAO,QAAQ,CAAA,GAAIA,QAAAA,CAAqB,QAAQ,KAAK,CAAA;AAC5D,EAAA,MAAM,CAAC,KAAA,EAAO,QAAQ,CAAA,GAAIA,QAAAA,CAAqB,QAAQ,KAAK,CAAA;AAE5D,EAAA,MAAM,aAAA,GAAgBC,WAAAA,CAAY,CAAC,OAAA,KAA0B;AAC3D,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,gBAAA,CAAiB,OAAA,EAAS,EAAE,CAAe,CAAA;AAAA,EAC9D,CAAA,EAAG,EAAE,CAAA;AACL,EAAA,MAAM,aAAA,GAAgBA,WAAAA,CAAY,CAAC,OAAA,KAA0B;AAC3D,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,gBAAA,CAAiB,OAAA,EAAS,EAAE,CAAC,CAAA;AAAA,EAChD,CAAA,EAAG,EAAE,CAAA;AACL,EAAA,MAAM,SAAA,GAAYA,WAAAA,CAAY,CAAC,UAAA,KAA2B;AACxD,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAW,CAAA;AAAA,EACpD,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,QAAA,GAAWA,WAAAA,CAAY,CAAC,KAAA,KAAqB;AAEjD,IAAA,QAAA,CAAS,MAAM,KAAK,CAAA;AACpB,IAAA,QAAA,CAAS,MAAM,KAAK,CAAA;AAAA,EACtB,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,OAAA,GAAUA,WAAAA,CAAY,OAAO,EAAE,KAAA,EAAO,OAAM,CAAA,EAAI,CAAC,KAAA,EAAO,KAAK,CAAC,CAAA;AAEpE,EAAA,OAAO,EAAE,OAAO,KAAA,EAAO,QAAA,EAAU,UAAU,QAAA,EAAU,aAAA,EAAe,aAAA,EAAe,SAAA,EAAW,OAAA,EAAQ;AACxG;;;ACjCO,SAAS,aAAA,CAAc,QAAQ,GAAA,EAAwB;AAC5D,EAAA,IAAI,OAAoB,EAAC;AACzB,EAAA,IAAI,SAAsB,EAAC;AAE3B,EAAA,OAAO;AAAA,IACL,KAAK,KAAA,EAAO;AACV,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AACf,MAAA,IAAI,IAAA,CAAK,MAAA,GAAS,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM;AACpC,MAAA,MAAA,GAAS,EAAC;AAAA,IACZ,CAAA;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,KAAK,GAAA,EAAI;AACtB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AACnB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,OAAO,GAAA,EAAI;AACxB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,MAAA,IAAA,CAAK,KAAK,OAAO,CAAA;AACjB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAAA,IACA,OAAA,EAAS,MAAM,IAAA,CAAK,MAAA,GAAS,CAAA;AAAA,IAC7B,OAAA,EAAS,MAAM,MAAA,CAAO,MAAA,GAAS,CAAA;AAAA,IAC/B,KAAA,GAAQ;AACN,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,MAAA,GAAS,EAAC;AAAA,IACZ,CAAA;AAAA,IACA,IAAA,EAAM,OAAO,EAAE,IAAA,EAAM,KAAK,MAAA,EAAQ,MAAA,EAAQ,OAAO,MAAA,EAAO;AAAA,GAC1D;AACF;;;ACxBO,SAAS,eAAe,IAAA,EAAgD;AAC7E,EAAA,MAAM,OAAA,GAAUC,MAAAA,CAAO,aAAA,EAAe,CAAA,CAAE,OAAA;AACxC,EAAA,MAAM,SAAA,GAAYA,OAAO,KAAK,CAAA;AAC9B,EAAA,MAAM,SAAA,GAAYA,OAAO,KAAK,CAAA;AAC9B,EAAA,MAAM,GAAG,IAAI,CAAA,GAAIF,SAAS,CAAC,CAAA;AAC3B,EAAA,MAAM,QAAA,GAAWC,WAAAA,CAAY,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,GAAI,CAAC,CAAA,EAAG,EAAE,CAAA;AAGzD,EAAA,MAAM,QAAA,GAAWC,OAAkB,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,CAAA;AAC3E,EAAA,QAAA,CAAS,UAAU,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AAE1D,EAAA,MAAM,OAAA,GAAUD,YAAY,MAAM;AAChC,IAAA,IAAI,SAAA,CAAU,OAAA,IAAW,SAAA,CAAU,OAAA,EAAS;AAC5C,IAAA,SAAA,CAAU,OAAA,GAAU,IAAA;AACpB,IAAA,cAAA,CAAe,MAAM;AACnB,MAAA,SAAA,CAAU,OAAA,GAAU,KAAA;AAAA,IACtB,CAAC,CAAA;AACD,IAAA,OAAA,CAAQ,IAAA,CAAK,SAAS,OAAO,CAAA;AAC7B,IAAA,QAAA,EAAS;AAAA,EACX,CAAA,EAAG,CAAC,OAAA,EAAS,QAAQ,CAAC,CAAA;AAEtB,EAAA,MAAM,OAAA,GAAUA,WAAAA;AAAA,IACd,CAAC,CAAA,KAAwB;AACvB,MAAA,IAAI,CAAC,CAAA,EAAG;AACR,MAAA,SAAA,CAAU,OAAA,GAAU,IAAA;AACpB,MAAA,IAAA,CAAK,SAAS,CAAC,CAAA;AACf,MAAA,cAAA,CAAe,MAAM;AACnB,QAAA,SAAA,CAAU,OAAA,GAAU,KAAA;AAAA,MACtB,CAAC,CAAA;AACD,MAAA,QAAA,EAAS;AAAA,IACX,CAAA;AAAA,IACA,CAAC,MAAM,QAAQ;AAAA,GACjB;AAEA,EAAA,MAAM,IAAA,GAAOA,WAAAA,CAAY,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAA,CAAK,QAAA,CAAS,OAAO,CAAC,CAAA,EAAG,CAAC,OAAA,EAAS,OAAO,CAAC,CAAA;AAC1F,EAAA,MAAM,IAAA,GAAOA,WAAAA,CAAY,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAA,CAAK,QAAA,CAAS,OAAO,CAAC,CAAA,EAAG,CAAC,OAAA,EAAS,OAAO,CAAC,CAAA;AAE1F,EAAA,MAAM,OAAA,GAAU,OAAA;AAAA,IACd,OAAO;AAAA,MACL,GAAG,IAAA;AAAA,MACH,QAAA,EAAU,CAAC,IAAA,KAAS;AAClB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,IAAI,CAAA;AAAA,MACpB,CAAA;AAAA,MACA,QAAA,EAAU,CAAC,IAAA,KAAS;AAClB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,IAAI,CAAA;AAAA,MACpB,CAAA;AAAA,MACA,QAAA,EAAU,CAAC,CAAA,KAAM;AACf,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,CAAC,CAAA;AAAA,MACjB,CAAA;AAAA,MACA,aAAA,EAAe,CAAC,OAAA,KAA0B;AAExC,QAAA,IAAI,CAAC,SAAA,CAAU,OAAA,IAAW,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,QAAQ,CAAA,EAAG,OAAA,EAAQ;AAC5E,QAAA,IAAA,CAAK,cAAc,OAAO,CAAA;AAAA,MAC5B,CAAA;AAAA,MACA,aAAA,EAAe,CAAC,OAAA,KAA0B;AACxC,QAAA,IAAI,CAAC,SAAA,CAAU,OAAA,IAAW,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,QAAQ,CAAA,EAAG,OAAA,EAAQ;AAC5E,QAAA,IAAA,CAAK,cAAc,OAAO,CAAA;AAAA,MAC5B,CAAA;AAAA,MACA,SAAA,EAAW,CAAC,IAAA,KAAS;AACnB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,UAAU,IAAI,CAAA;AAAA,MACrB;AAAA,KACF,CAAA;AAAA,IACA,CAAC,MAAM,OAAO;AAAA,GAChB;AAEA,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,OAAA;AAAA,IACN,IAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACzB,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACzB,OAAA;AAAA,IACA,eAAA,EAAiB;AAAA,GACnB;AACF","file":"chunk-GQ5LEA7Q.js","sourcesContent":["import { useCallback, useRef, useState } from \"react\";\nimport { runFlow, type RunOptions, type RunResult } from \"./run-flow\";\nimport { getNodeKind } from \"../registry/registry\";\nimport type {\n  ExecutorRegistry,\n  FlowGraph,\n  NodeRunStatus,\n  RunEvent,\n} from \"../types\";\n\nexport type FlowRunFeedEntry = {\n  id: string;\n  at: number;\n  /**\n   * `message` is a node's own human-facing announcement (`startingMsg` /\n   * `stoppingMsg`), kept distinct from `status` and `info` so a progress UI can\n   * show ONLY the narration. Folded in with diagnostics it would be unfindable,\n   * which is the same as not having it.\n   */\n  level: \"info\" | \"warn\" | \"error\" | \"status\" | \"message\";\n  text: string;\n  nodeId?: string;\n  detail?: unknown;\n};\n\nexport type UseFlowRunReturn = {\n  /** Status keyed by nodeId — drive the UI overlay from this. */\n  statuses: Record<string, NodeRunStatus>;\n  /** Per-node status text (e.g. error message). */\n  statusText: Record<string, string | undefined>;\n  /** Latest computed output value per node (for reactive kinds). */\n  outputs: Record<string, unknown>;\n  /**\n   * Latest status message per nodeId, from the node's own `startingMsg` /\n   * `stoppingMsg`. Undefined for the nodes that declared none, which is most\n   * of them by design.\n   */\n  nodeMessages: Record<string, string | undefined>;\n  /** Live event log (capped to last N). */\n  feed: FlowRunFeedEntry[];\n  /** Whether a run is currently in progress. */\n  running: boolean;\n  /** Last run result, or null. */\n  lastResult: RunResult | null;\n  /** Kick off a run with the provided graph + executors. */\n  run: (graph: FlowGraph, executors: ExecutorRegistry, options?: RunOptions) => Promise<RunResult>;\n  /** Cancel the current run (if any). */\n  cancel: () => void;\n  /** Reset all runtime state (statuses, feed, lastResult). */\n  reset: () => void;\n};\n\nexport type UseFlowRunOptions = {\n  /** Cap the in-memory feed to this many entries. Default 200. */\n  maxFeed?: number;\n};\n\n/**\n * useFlowRun — drives `runFlow` + maintains observability state. Pair with\n * `applyStatusesToNodes` (below) before passing nodes to `<FlowCanvas>` so\n * the per-node status badge renders.\n */\nexport function useFlowRun({ maxFeed = 200 }: UseFlowRunOptions = {}): UseFlowRunReturn {\n  const [statuses, setStatuses] = useState<Record<string, NodeRunStatus>>({});\n  const [statusText, setStatusText] = useState<Record<string, string | undefined>>({});\n  const [nodeMessages, setNodeMessages] = useState<Record<string, string | undefined>>({});\n  const [outputs, setOutputs] = useState<Record<string, unknown>>({});\n  const [feed, setFeed] = useState<FlowRunFeedEntry[]>([]);\n  const [running, setRunning] = useState(false);\n  const [lastResult, setLastResult] = useState<RunResult | null>(null);\n  const abortRef = useRef<AbortController | null>(null);\n\n  const handleEvent = useCallback(\n    (e: RunEvent) => {\n      switch (e.type) {\n        case \"node-status\":\n          setStatuses((s) => ({ ...s, [e.nodeId]: e.status }));\n          setStatusText((t) => ({ ...t, [e.nodeId]: e.text }));\n          appendFeed({ level: \"status\", text: `${e.nodeId} → ${e.status}${e.text ? ` (${e.text})` : \"\"}`, nodeId: e.nodeId });\n          break;\n        case \"node-message\":\n          setNodeMessages((m) => ({ ...m, [e.nodeId]: e.message }));\n          appendFeed({ level: \"message\", text: e.message, nodeId: e.nodeId });\n          break;\n        case \"node-output\":\n          setOutputs((o) => ({ ...o, [e.nodeId]: e.value }));\n          appendFeed({ level: \"info\", text: `${e.nodeId}.${e.portId} = ${preview(e.value)}`, nodeId: e.nodeId, detail: e.value });\n          break;\n        case \"log\":\n          appendFeed({ level: e.level, text: e.message, nodeId: e.nodeId, detail: e.detail });\n          break;\n        case \"run-start\":\n          appendFeed({ level: \"info\", text: \"▶ run started\" });\n          break;\n        case \"run-end\":\n          appendFeed({ level: e.ok ? \"info\" : \"error\", text: e.ok ? \"✓ run complete\" : \"✗ run failed\" });\n          break;\n        case \"run-error\":\n          appendFeed({ level: \"error\", text: e.error });\n          break;\n      }\n      function appendFeed(partial: Omit<FlowRunFeedEntry, \"id\" | \"at\">) {\n        setFeed((f) => {\n          const entry: FlowRunFeedEntry = { id: `${Date.now()}_${f.length}`, at: Date.now(), ...partial };\n          const next = [...f, entry];\n          return next.length > maxFeed ? next.slice(next.length - maxFeed) : next;\n        });\n      }\n    },\n    [maxFeed],\n  );\n\n  const run = useCallback(\n    async (graph: FlowGraph, executors: ExecutorRegistry, options: RunOptions = {}) => {\n      if (running) {\n        return { ok: false, outputs: {}, error: \"another run is already in progress\" } satisfies RunResult;\n      }\n      const controller = new AbortController();\n      abortRef.current = controller;\n      // Reset previous statuses for the nodes we're about to run.\n      const idleStatuses: Record<string, NodeRunStatus> = {};\n      for (const n of graph.nodes) idleStatuses[n.id] = \"idle\";\n      setStatuses(idleStatuses);\n      setStatusText({});\n      setOutputs({});\n      setRunning(true);\n      try {\n        const result = await runFlow(graph, executors, handleEvent, { ...options, signal: controller.signal });\n        setLastResult(result);\n        return result;\n      } finally {\n        setRunning(false);\n        abortRef.current = null;\n      }\n    },\n    [handleEvent, running],\n  );\n\n  const cancel = useCallback(() => abortRef.current?.abort(), []);\n\n  const reset = useCallback(() => {\n    setStatuses({});\n    setStatusText({});\n    setOutputs({});\n    setFeed([]);\n    setLastResult(null);\n  }, []);\n\n  return { statuses, statusText, nodeMessages, outputs, feed, running, lastResult, run, cancel, reset };\n}\n\n/**\n * Write each reactive kind's latest run output into its `data.output`, so its\n * card can render the computed value live. Non-reactive kinds are returned\n * untouched. Pair with `applyStatusesToNodes` before rendering.\n */\nexport function applyOutputsToNodes<TNode extends { id: string; type?: string; data: any }>(\n  nodes: TNode[],\n  outputs: Record<string, unknown>,\n): TNode[] {\n  return nodes.map((n) => {\n    const kind = getNodeKind((n.data as any)?.kind ?? n.type ?? \"\");\n    if (!kind?.reactive || !(n.id in outputs)) return n;\n    return { ...n, data: { ...n.data, output: outputs[n.id] } };\n  });\n}\n\n/** Merge runtime statuses into nodes for rendering. */\nexport function applyStatusesToNodes<TNode extends { id: string; data: any }>(\n  nodes: TNode[],\n  statuses: Record<string, NodeRunStatus>,\n  statusText: Record<string, string | undefined>,\n): TNode[] {\n  return nodes.map((n) => ({\n    ...n,\n    data: {\n      ...n.data,\n      status: statuses[n.id] ?? n.data?.status ?? \"idle\",\n      statusText: statusText[n.id] ?? n.data?.statusText,\n    },\n  }));\n}\n\nfunction preview(v: unknown): string {\n  try {\n    const s = JSON.stringify(v);\n    return s && s.length > 60 ? s.slice(0, 57) + \"…\" : (s ?? String(v));\n  } catch {\n    return String(v);\n  }\n}\n","import { useCallback, useState } from \"react\";\nimport {\n  addEdge,\n  applyEdgeChanges,\n  applyNodeChanges,\n  type Connection,\n  type Edge,\n  type EdgeChange,\n  type NodeChange,\n} from \"@xyflow/react\";\nimport type { FlowEdge, FlowGraph, FlowNode } from \"../types\";\n\nexport type UseFlowStateReturn = {\n  nodes: FlowNode[];\n  edges: FlowEdge[];\n  setNodes: React.Dispatch<React.SetStateAction<FlowNode[]>>;\n  setEdges: React.Dispatch<React.SetStateAction<FlowEdge[]>>;\n  /**\n   * Replace nodes AND edges atomically in a single commit. Use this for any op\n   * that touches both (delete-with-edge-prune, undo/redo restore, setGraph):\n   * calling `setNodes` then `setEdges` is NOT atomic in controlled mode (each\n   * closes over a stale `value`), so the second write clobbers the first.\n   */\n  setGraph: (graph: FlowGraph) => void;\n  onNodesChange: (changes: NodeChange[]) => void;\n  onEdgesChange: (changes: EdgeChange[]) => void;\n  onConnect: (connection: Connection) => void;\n  /** Snapshot the current graph (suitable for serialization). */\n  toGraph: () => FlowGraph;\n};\n\n/**\n * useFlowState — React Flow's standard controlled-state plumbing in one hook.\n * Spread into <FlowCanvas>.\n */\nexport function useFlowState(initial: FlowGraph): UseFlowStateReturn {\n  const [nodes, setNodes] = useState<FlowNode[]>(initial.nodes);\n  const [edges, setEdges] = useState<FlowEdge[]>(initial.edges);\n\n  const onNodesChange = useCallback((changes: NodeChange[]) => {\n    setNodes((ns) => applyNodeChanges(changes, ns) as FlowNode[]);\n  }, []);\n  const onEdgesChange = useCallback((changes: EdgeChange[]) => {\n    setEdges((es) => applyEdgeChanges(changes, es));\n  }, []);\n  const onConnect = useCallback((connection: Connection) => {\n    setEdges((es) => addEdge(connection, es) as Edge[]);\n  }, []);\n\n  const setGraph = useCallback((graph: FlowGraph) => {\n    // Two useState writes in one event are batched, so this IS atomic here.\n    setNodes(graph.nodes);\n    setEdges(graph.edges);\n  }, []);\n\n  const toGraph = useCallback(() => ({ nodes, edges }), [nodes, edges]);\n\n  return { nodes, edges, setNodes, setEdges, setGraph, onNodesChange, onEdgesChange, onConnect, toGraph };\n}\n","import type { FlowGraph } from \"../types\";\n\n/**\n * Undo/redo history — a pure, React-free snapshot controller. The editor pushes\n * a graph snapshot BEFORE each committing mutation; `undo`/`redo` swap snapshots\n * between the past/future stacks. Kept free of React so it can be unit-tested\n * and reused by any host (or a headless driver).\n *\n * Coalescing (collapsing a burst of setState calls from one logical op into a\n * single undo step) is the caller's job — see `useFlowHistory`.\n */\nexport type HistoryController = {\n  /** Record `graph` as an undo point. Clears the redo stack (new branch). */\n  push: (graph: FlowGraph) => void;\n  /** Pop the last undo point; `current` is pushed onto the redo stack. */\n  undo: (current: FlowGraph) => FlowGraph | null;\n  /** Pop the last redo point; `current` is pushed back onto the undo stack. */\n  redo: (current: FlowGraph) => FlowGraph | null;\n  canUndo: () => boolean;\n  canRedo: () => boolean;\n  clear: () => void;\n  /** Test/inspection helper — sizes of the two stacks. */\n  size: () => { past: number; future: number };\n};\n\nexport function createHistory(limit = 100): HistoryController {\n  let past: FlowGraph[] = [];\n  let future: FlowGraph[] = [];\n\n  return {\n    push(graph) {\n      past.push(graph);\n      if (past.length > limit) past.shift();\n      future = [];\n    },\n    undo(current) {\n      const prev = past.pop();\n      if (prev === undefined) return null;\n      future.push(current);\n      return prev;\n    },\n    redo(current) {\n      const next = future.pop();\n      if (next === undefined) return null;\n      past.push(current);\n      return next;\n    },\n    canUndo: () => past.length > 0,\n    canRedo: () => future.length > 0,\n    clear() {\n      past = [];\n      future = [];\n    },\n    size: () => ({ past: past.length, future: future.length }),\n  };\n}\n","import { useCallback, useMemo, useRef, useState } from \"react\";\nimport type { EdgeChange, NodeChange } from \"@xyflow/react\";\nimport type { FlowGraph } from \"../types\";\nimport { createHistory } from \"./history\";\nimport type { UseFlowStateReturn } from \"./use-flow-state\";\n\nexport type UseFlowHistoryReturn = {\n  /** The flow sink wrapped so committing mutations snapshot for undo first. */\n  flow: UseFlowStateReturn;\n  undo: () => void;\n  redo: () => void;\n  canUndo: boolean;\n  canRedo: boolean;\n  /** Snapshot the current graph as an undo point (before a programmatic edit). */\n  capture: () => void;\n  /** Wire to `<FlowCanvas onNodeDragStart>` — snapshots the pre-drag graph. */\n  onNodeDragStart: () => void;\n};\n\n/**\n * useFlowHistory — the commit/undo pipeline. Wraps a flow sink (the uncontrolled\n * `useFlowState` hook OR the controlled adapter) so every *committing* mutation\n * records a snapshot first, giving undo/redo without the editor threading\n * history through each call site. This is the single interception point the\n * two-sink architecture otherwise lacks.\n *\n * Granularity: a burst of setState calls from one logical op (e.g. a\n * delete = setNodes+setEdges) is coalesced into ONE undo step; transient\n * interactive changes (drag-move, dimension-measure, selection) are NOT captured\n * — a drag is captured once at `onNodeDragStart` instead.\n */\nexport function useFlowHistory(flow: UseFlowStateReturn): UseFlowHistoryReturn {\n  const history = useRef(createHistory()).current;\n  const restoring = useRef(false);\n  const coalesced = useRef(false);\n  const [, bump] = useState(0);\n  const rerender = useCallback(() => bump((n) => n + 1), []);\n\n  // Latest graph via a ref, so capture never reads a stale snapshot.\n  const graphRef = useRef<FlowGraph>({ nodes: flow.nodes, edges: flow.edges });\n  graphRef.current = { nodes: flow.nodes, edges: flow.edges };\n\n  const capture = useCallback(() => {\n    if (restoring.current || coalesced.current) return;\n    coalesced.current = true;\n    queueMicrotask(() => {\n      coalesced.current = false;\n    });\n    history.push(graphRef.current);\n    rerender();\n  }, [history, rerender]);\n\n  const restore = useCallback(\n    (g: FlowGraph | null) => {\n      if (!g) return;\n      restoring.current = true;\n      flow.setGraph(g);\n      queueMicrotask(() => {\n        restoring.current = false;\n      });\n      rerender();\n    },\n    [flow, rerender],\n  );\n\n  const undo = useCallback(() => restore(history.undo(graphRef.current)), [history, restore]);\n  const redo = useCallback(() => restore(history.redo(graphRef.current)), [history, restore]);\n\n  const wrapped = useMemo<UseFlowStateReturn>(\n    () => ({\n      ...flow,\n      setNodes: (next) => {\n        capture();\n        flow.setNodes(next);\n      },\n      setEdges: (next) => {\n        capture();\n        flow.setEdges(next);\n      },\n      setGraph: (g) => {\n        capture();\n        flow.setGraph(g);\n      },\n      onNodesChange: (changes: NodeChange[]) => {\n        // Only structural removes commit; position/dimensions/select are transient.\n        if (!restoring.current && changes.some((c) => c.type === \"remove\")) capture();\n        flow.onNodesChange(changes);\n      },\n      onEdgesChange: (changes: EdgeChange[]) => {\n        if (!restoring.current && changes.some((c) => c.type === \"remove\")) capture();\n        flow.onEdgesChange(changes);\n      },\n      onConnect: (conn) => {\n        capture();\n        flow.onConnect(conn);\n      },\n    }),\n    [flow, capture],\n  );\n\n  return {\n    flow: wrapped,\n    undo,\n    redo,\n    canUndo: history.canUndo(),\n    canRedo: history.canRedo(),\n    capture,\n    onNodeDragStart: capture,\n  };\n}\n"]}
+{"version":3,"sources":["../src/runtime/use-flow-run.ts","../src/runtime/use-flow-state.ts","../src/runtime/history.ts","../src/runtime/use-flow-history.ts"],"names":["useState","useCallback","useRef"],"mappings":";;;;AA8DO,SAAS,WAAW,EAAE,OAAA,GAAU,GAAA,EAAI,GAAuB,EAAC,EAAqB;AACtF,EAAA,MAAM,CAAC,QAAA,EAAU,WAAW,CAAA,GAAI,QAAA,CAAwC,EAAE,CAAA;AAC1E,EAAA,MAAM,CAAC,UAAA,EAAY,aAAa,CAAA,GAAI,QAAA,CAA6C,EAAE,CAAA;AACnF,EAAA,MAAM,CAAC,YAAA,EAAc,eAAe,CAAA,GAAI,QAAA,CAA6C,EAAE,CAAA;AACvF,EAAA,MAAM,CAAC,OAAA,EAAS,UAAU,CAAA,GAAI,QAAA,CAAkC,EAAE,CAAA;AAClE,EAAA,MAAM,CAAC,IAAA,EAAM,OAAO,CAAA,GAAI,QAAA,CAA6B,EAAE,CAAA;AACvD,EAAA,MAAM,CAAC,OAAA,EAAS,UAAU,CAAA,GAAI,SAAS,KAAK,CAAA;AAC5C,EAAA,MAAM,CAAC,UAAA,EAAY,aAAa,CAAA,GAAI,SAA2B,IAAI,CAAA;AACnE,EAAA,MAAM,QAAA,GAAW,OAA+B,IAAI,CAAA;AAEpD,EAAA,MAAM,WAAA,GAAc,WAAA;AAAA,IAClB,CAAC,CAAA,KAAgB;AACf,MAAA,QAAQ,EAAE,IAAA;AAAM,QACd,KAAK,aAAA;AACH,UAAA,WAAA,CAAY,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,MAAA,EAAO,CAAE,CAAA;AACnD,UAAA,aAAA,CAAc,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,IAAA,EAAK,CAAE,CAAA;AACnD,UAAA,UAAA,CAAW,EAAE,OAAO,QAAA,EAAU,IAAA,EAAM,GAAG,CAAA,CAAE,MAAM,CAAA,QAAA,EAAM,CAAA,CAAE,MAAM,CAAA,EAAG,EAAE,IAAA,GAAO,CAAA,EAAA,EAAK,EAAE,IAAI,CAAA,CAAA,CAAA,GAAM,EAAE,CAAA,CAAA,EAAI,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA;AAClH,UAAA;AAAA,QACF,KAAK,cAAA;AACH,UAAA,eAAA,CAAgB,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,OAAA,EAAQ,CAAE,CAAA;AACxD,UAAA,UAAA,CAAW,EAAE,OAAO,SAAA,EAAW,IAAA,EAAM,EAAE,OAAA,EAAS,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA;AAClE,UAAA;AAAA,QACF,KAAK,aAAA;AACH,UAAA,UAAA,CAAW,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAG,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,KAAA,EAAM,CAAE,CAAA;AACjD,UAAA,UAAA,CAAW,EAAE,OAAO,MAAA,EAAQ,IAAA,EAAM,GAAG,CAAA,CAAE,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,CAAA,GAAA,EAAM,QAAQ,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,EAAI,MAAA,EAAQ,EAAE,MAAA,EAAQ,MAAA,EAAQ,CAAA,CAAE,KAAA,EAAO,CAAA;AACtH,UAAA;AAAA,QACF,KAAK,KAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,CAAA,CAAE,KAAA,EAAO,IAAA,EAAM,CAAA,CAAE,OAAA,EAAS,MAAA,EAAQ,CAAA,CAAE,MAAA,EAAQ,MAAA,EAAQ,CAAA,CAAE,QAAQ,CAAA;AAClF,UAAA;AAAA,QACF,KAAK,WAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,sBAAiB,CAAA;AACnD,UAAA;AAAA,QACF,KAAK,SAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,CAAA,CAAE,EAAA,GAAK,MAAA,GAAS,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,EAAA,GAAK,qBAAA,GAAmB,mBAAA,EAAgB,CAAA;AAC7F,UAAA;AAAA,QACF,KAAK,WAAA;AACH,UAAA,UAAA,CAAW,EAAE,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,CAAA,CAAE,OAAO,CAAA;AAC5C,UAAA;AAAA;AAEJ,MAAA,SAAS,WAAW,OAAA,EAA8C;AAChE,QAAA,OAAA,CAAQ,CAAC,CAAA,KAAM;AACb,UAAA,MAAM,QAA0B,EAAE,EAAA,EAAI,CAAA,EAAG,IAAA,CAAK,KAAK,CAAA,CAAA,EAAI,CAAA,CAAE,MAAM,IAAI,EAAA,EAAI,IAAA,CAAK,GAAA,EAAI,EAAG,GAAG,OAAA,EAAQ;AAC9F,UAAA,MAAM,IAAA,GAAO,CAAC,GAAG,CAAA,EAAG,KAAK,CAAA;AACzB,UAAA,OAAO,IAAA,CAAK,SAAS,OAAA,GAAU,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,GAAS,OAAO,CAAA,GAAI,IAAA;AAAA,QACrE,CAAC,CAAA;AAAA,MACH;AAAA,IACF,CAAA;AAAA,IACA,CAAC,OAAO;AAAA,GACV;AAEA,EAAA,MAAM,GAAA,GAAM,WAAA;AAAA,IACV,OAAO,KAAA,EAAkB,SAAA,EAA6B,OAAA,GAAsB,EAAC,KAAM;AACjF,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,SAAS,EAAC,EAAG,OAAO,oCAAA,EAAqC;AAAA,MAC/E;AACA,MAAA,MAAM,UAAA,GAAa,IAAI,eAAA,EAAgB;AACvC,MAAA,QAAA,CAAS,OAAA,GAAU,UAAA;AAEnB,MAAA,MAAM,eAA8C,EAAC;AACrD,MAAA,KAAA,MAAW,KAAK,KAAA,CAAM,KAAA,EAAO,YAAA,CAAa,CAAA,CAAE,EAAE,CAAA,GAAI,MAAA;AAClD,MAAA,WAAA,CAAY,YAAY,CAAA;AACxB,MAAA,aAAA,CAAc,EAAE,CAAA;AAChB,MAAA,UAAA,CAAW,EAAE,CAAA;AACb,MAAA,UAAA,CAAW,IAAI,CAAA;AACf,MAAA,IAAI;AACF,QAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,KAAA,EAAO,SAAA,EAAW,WAAA,EAAa,EAAE,GAAG,OAAA,EAAS,MAAA,EAAQ,UAAA,CAAW,MAAA,EAAQ,CAAA;AACrG,QAAA,aAAA,CAAc,MAAM,CAAA;AACpB,QAAA,OAAO,MAAA;AAAA,MACT,CAAA,SAAE;AACA,QAAA,UAAA,CAAW,KAAK,CAAA;AAChB,QAAA,QAAA,CAAS,OAAA,GAAU,IAAA;AAAA,MACrB;AAAA,IACF,CAAA;AAAA,IACA,CAAC,aAAa,OAAO;AAAA,GACvB;AAEA,EAAA,MAAM,MAAA,GAAS,YAAY,MAAM,QAAA,CAAS,SAAS,KAAA,EAAM,EAAG,EAAE,CAAA;AAE9D,EAAA,MAAM,KAAA,GAAQ,YAAY,MAAM;AAC9B,IAAA,WAAA,CAAY,EAAE,CAAA;AACd,IAAA,aAAA,CAAc,EAAE,CAAA;AAChB,IAAA,UAAA,CAAW,EAAE,CAAA;AACb,IAAA,OAAA,CAAQ,EAAE,CAAA;AACV,IAAA,aAAA,CAAc,IAAI,CAAA;AAAA,EACpB,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,OAAO,EAAE,QAAA,EAAU,UAAA,EAAY,YAAA,EAAc,OAAA,EAAS,MAAM,OAAA,EAAS,UAAA,EAAY,GAAA,EAAK,MAAA,EAAQ,KAAA,EAAM;AACtG;AAOO,SAAS,mBAAA,CACd,OACA,OAAA,EACS;AACT,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM;AACtB,IAAA,MAAM,OAAO,WAAA,CAAa,CAAA,CAAE,MAAc,IAAA,IAAQ,CAAA,CAAE,QAAQ,EAAE,CAAA;AAC9D,IAAA,IAAI,CAAC,IAAA,EAAM,QAAA,IAAY,EAAE,CAAA,CAAE,EAAA,IAAM,UAAU,OAAO,CAAA;AAClD,IAAA,OAAO,EAAE,GAAG,CAAA,EAAG,IAAA,EAAM,EAAE,GAAG,CAAA,CAAE,IAAA,EAAM,MAAA,EAAQ,OAAA,CAAQ,CAAA,CAAE,EAAE,GAAE,EAAE;AAAA,EAC5D,CAAC,CAAA;AACH;AAGO,SAAS,oBAAA,CACd,KAAA,EACA,QAAA,EACA,UAAA,EACS;AACT,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IACvB,GAAG,CAAA;AAAA,IACH,IAAA,EAAM;AAAA,MACJ,GAAG,CAAA,CAAE,IAAA;AAAA,MACL,QAAQ,QAAA,CAAS,CAAA,CAAE,EAAE,CAAA,IAAK,CAAA,CAAE,MAAM,MAAA,IAAU,MAAA;AAAA,MAC5C,YAAY,UAAA,CAAW,CAAA,CAAE,EAAE,CAAA,IAAK,EAAE,IAAA,EAAM;AAAA;AAC1C,GACF,CAAE,CAAA;AACJ;AAEA,SAAS,QAAQ,CAAA,EAAoB;AACnC,EAAA,IAAI;AACF,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAA;AAC1B,IAAA,OAAO,CAAA,IAAK,CAAA,CAAE,MAAA,GAAS,EAAA,GAAK,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,GAAI,QAAA,GAAO,CAAA,IAAK,MAAA,CAAO,CAAC,CAAA;AAAA,EACnE,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,OAAO,CAAC,CAAA;AAAA,EACjB;AACF;AC3JO,SAAS,aAAa,OAAA,EAAwC;AACnE,EAAA,MAAM,CAAC,KAAA,EAAO,QAAQ,CAAA,GAAIA,QAAAA,CAAqB,QAAQ,KAAK,CAAA;AAC5D,EAAA,MAAM,CAAC,KAAA,EAAO,QAAQ,CAAA,GAAIA,QAAAA,CAAqB,QAAQ,KAAK,CAAA;AAE5D,EAAA,MAAM,aAAA,GAAgBC,WAAAA,CAAY,CAAC,OAAA,KAA0B;AAC3D,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,gBAAA,CAAiB,OAAA,EAAS,EAAE,CAAe,CAAA;AAAA,EAC9D,CAAA,EAAG,EAAE,CAAA;AACL,EAAA,MAAM,aAAA,GAAgBA,WAAAA,CAAY,CAAC,OAAA,KAA0B;AAC3D,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,gBAAA,CAAiB,OAAA,EAAS,EAAE,CAAC,CAAA;AAAA,EAChD,CAAA,EAAG,EAAE,CAAA;AACL,EAAA,MAAM,SAAA,GAAYA,WAAAA,CAAY,CAAC,UAAA,KAA2B;AACxD,IAAA,QAAA,CAAS,CAAC,EAAA,KAAO,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAW,CAAA;AAAA,EACpD,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,QAAA,GAAWA,WAAAA,CAAY,CAAC,KAAA,KAAqB;AAEjD,IAAA,QAAA,CAAS,MAAM,KAAK,CAAA;AACpB,IAAA,QAAA,CAAS,MAAM,KAAK,CAAA;AAAA,EACtB,CAAA,EAAG,EAAE,CAAA;AAEL,EAAA,MAAM,OAAA,GAAUA,WAAAA,CAAY,OAAO,EAAE,KAAA,EAAO,OAAM,CAAA,EAAI,CAAC,KAAA,EAAO,KAAK,CAAC,CAAA;AAEpE,EAAA,OAAO,EAAE,OAAO,KAAA,EAAO,QAAA,EAAU,UAAU,QAAA,EAAU,aAAA,EAAe,aAAA,EAAe,SAAA,EAAW,OAAA,EAAQ;AACxG;;;ACjCO,SAAS,aAAA,CAAc,QAAQ,GAAA,EAAwB;AAC5D,EAAA,IAAI,OAAoB,EAAC;AACzB,EAAA,IAAI,SAAsB,EAAC;AAE3B,EAAA,OAAO;AAAA,IACL,KAAK,KAAA,EAAO;AACV,MAAA,IAAA,CAAK,KAAK,KAAK,CAAA;AACf,MAAA,IAAI,IAAA,CAAK,MAAA,GAAS,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM;AACpC,MAAA,MAAA,GAAS,EAAC;AAAA,IACZ,CAAA;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,KAAK,GAAA,EAAI;AACtB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AACnB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,IAAA,GAAO,OAAO,GAAA,EAAI;AACxB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,MAAA,IAAA,CAAK,KAAK,OAAO,CAAA;AACjB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAAA,IACA,OAAA,EAAS,MAAM,IAAA,CAAK,MAAA,GAAS,CAAA;AAAA,IAC7B,OAAA,EAAS,MAAM,MAAA,CAAO,MAAA,GAAS,CAAA;AAAA,IAC/B,KAAA,GAAQ;AACN,MAAA,IAAA,GAAO,EAAC;AACR,MAAA,MAAA,GAAS,EAAC;AAAA,IACZ,CAAA;AAAA,IACA,IAAA,EAAM,OAAO,EAAE,IAAA,EAAM,KAAK,MAAA,EAAQ,MAAA,EAAQ,OAAO,MAAA,EAAO;AAAA,GAC1D;AACF;;;ACxBO,SAAS,eAAe,IAAA,EAAgD;AAC7E,EAAA,MAAM,OAAA,GAAUC,MAAAA,CAAO,aAAA,EAAe,CAAA,CAAE,OAAA;AACxC,EAAA,MAAM,SAAA,GAAYA,OAAO,KAAK,CAAA;AAC9B,EAAA,MAAM,SAAA,GAAYA,OAAO,KAAK,CAAA;AAC9B,EAAA,MAAM,GAAG,IAAI,CAAA,GAAIF,SAAS,CAAC,CAAA;AAC3B,EAAA,MAAM,QAAA,GAAWC,WAAAA,CAAY,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,GAAI,CAAC,CAAA,EAAG,EAAE,CAAA;AAGzD,EAAA,MAAM,QAAA,GAAWC,OAAkB,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,CAAA;AAC3E,EAAA,QAAA,CAAS,UAAU,EAAE,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,EAAO,KAAK,KAAA,EAAM;AAE1D,EAAA,MAAM,OAAA,GAAUD,YAAY,MAAM;AAChC,IAAA,IAAI,SAAA,CAAU,OAAA,IAAW,SAAA,CAAU,OAAA,EAAS;AAC5C,IAAA,SAAA,CAAU,OAAA,GAAU,IAAA;AACpB,IAAA,cAAA,CAAe,MAAM;AACnB,MAAA,SAAA,CAAU,OAAA,GAAU,KAAA;AAAA,IACtB,CAAC,CAAA;AACD,IAAA,OAAA,CAAQ,IAAA,CAAK,SAAS,OAAO,CAAA;AAC7B,IAAA,QAAA,EAAS;AAAA,EACX,CAAA,EAAG,CAAC,OAAA,EAAS,QAAQ,CAAC,CAAA;AAEtB,EAAA,MAAM,OAAA,GAAUA,WAAAA;AAAA,IACd,CAAC,CAAA,KAAwB;AACvB,MAAA,IAAI,CAAC,CAAA,EAAG;AACR,MAAA,SAAA,CAAU,OAAA,GAAU,IAAA;AACpB,MAAA,IAAA,CAAK,SAAS,CAAC,CAAA;AACf,MAAA,cAAA,CAAe,MAAM;AACnB,QAAA,SAAA,CAAU,OAAA,GAAU,KAAA;AAAA,MACtB,CAAC,CAAA;AACD,MAAA,QAAA,EAAS;AAAA,IACX,CAAA;AAAA,IACA,CAAC,MAAM,QAAQ;AAAA,GACjB;AAEA,EAAA,MAAM,IAAA,GAAOA,WAAAA,CAAY,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAA,CAAK,QAAA,CAAS,OAAO,CAAC,CAAA,EAAG,CAAC,OAAA,EAAS,OAAO,CAAC,CAAA;AAC1F,EAAA,MAAM,IAAA,GAAOA,WAAAA,CAAY,MAAM,OAAA,CAAQ,OAAA,CAAQ,IAAA,CAAK,QAAA,CAAS,OAAO,CAAC,CAAA,EAAG,CAAC,OAAA,EAAS,OAAO,CAAC,CAAA;AAE1F,EAAA,MAAM,OAAA,GAAU,OAAA;AAAA,IACd,OAAO;AAAA,MACL,GAAG,IAAA;AAAA,MACH,QAAA,EAAU,CAAC,IAAA,KAAS;AAClB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,IAAI,CAAA;AAAA,MACpB,CAAA;AAAA,MACA,QAAA,EAAU,CAAC,IAAA,KAAS;AAClB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,IAAI,CAAA;AAAA,MACpB,CAAA;AAAA,MACA,QAAA,EAAU,CAAC,CAAA,KAAM;AACf,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,SAAS,CAAC,CAAA;AAAA,MACjB,CAAA;AAAA,MACA,aAAA,EAAe,CAAC,OAAA,KAA0B;AAExC,QAAA,IAAI,CAAC,SAAA,CAAU,OAAA,IAAW,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,QAAQ,CAAA,EAAG,OAAA,EAAQ;AAC5E,QAAA,IAAA,CAAK,cAAc,OAAO,CAAA;AAAA,MAC5B,CAAA;AAAA,MACA,aAAA,EAAe,CAAC,OAAA,KAA0B;AACxC,QAAA,IAAI,CAAC,SAAA,CAAU,OAAA,IAAW,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,QAAQ,CAAA,EAAG,OAAA,EAAQ;AAC5E,QAAA,IAAA,CAAK,cAAc,OAAO,CAAA;AAAA,MAC5B,CAAA;AAAA,MACA,SAAA,EAAW,CAAC,IAAA,KAAS;AACnB,QAAA,OAAA,EAAQ;AACR,QAAA,IAAA,CAAK,UAAU,IAAI,CAAA;AAAA,MACrB;AAAA,KACF,CAAA;AAAA,IACA,CAAC,MAAM,OAAO;AAAA,GAChB;AAEA,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,OAAA;AAAA,IACN,IAAA;AAAA,IACA,IAAA;AAAA,IACA,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACzB,OAAA,EAAS,QAAQ,OAAA,EAAQ;AAAA,IACzB,OAAA;AAAA,IACA,eAAA,EAAiB;AAAA,GACnB;AACF","file":"chunk-ZBHIEKCN.js","sourcesContent":["import { useCallback, useRef, useState } from \"react\";\nimport { runFlow, type RunOptions, type RunResult } from \"./run-flow\";\nimport { getNodeKind } from \"../registry/registry\";\nimport type {\n  ExecutorRegistry,\n  FlowGraph,\n  NodeRunStatus,\n  RunEvent,\n} from \"../types\";\n\nexport type FlowRunFeedEntry = {\n  id: string;\n  at: number;\n  /**\n   * `message` is a node's own human-facing announcement (`startingMsg` /\n   * `stoppingMsg`), kept distinct from `status` and `info` so a progress UI can\n   * show ONLY the narration. Folded in with diagnostics it would be unfindable,\n   * which is the same as not having it.\n   */\n  level: \"info\" | \"warn\" | \"error\" | \"status\" | \"message\";\n  text: string;\n  nodeId?: string;\n  detail?: unknown;\n};\n\nexport type UseFlowRunReturn = {\n  /** Status keyed by nodeId — drive the UI overlay from this. */\n  statuses: Record<string, NodeRunStatus>;\n  /** Per-node status text (e.g. error message). */\n  statusText: Record<string, string | undefined>;\n  /** Latest computed output value per node (for reactive kinds). */\n  outputs: Record<string, unknown>;\n  /**\n   * Latest status message per nodeId, from the node's own `startingMsg` /\n   * `stoppingMsg`. Undefined for the nodes that declared none, which is most\n   * of them by design.\n   */\n  nodeMessages: Record<string, string | undefined>;\n  /** Live event log (capped to last N). */\n  feed: FlowRunFeedEntry[];\n  /** Whether a run is currently in progress. */\n  running: boolean;\n  /** Last run result, or null. */\n  lastResult: RunResult | null;\n  /** Kick off a run with the provided graph + executors. */\n  run: (graph: FlowGraph, executors: ExecutorRegistry, options?: RunOptions) => Promise<RunResult>;\n  /** Cancel the current run (if any). */\n  cancel: () => void;\n  /** Reset all runtime state (statuses, feed, lastResult). */\n  reset: () => void;\n};\n\nexport type UseFlowRunOptions = {\n  /** Cap the in-memory feed to this many entries. Default 200. */\n  maxFeed?: number;\n};\n\n/**\n * useFlowRun — drives `runFlow` + maintains observability state. Pair with\n * `applyStatusesToNodes` (below) before passing nodes to `<FlowCanvas>` so\n * the per-node status badge renders.\n */\nexport function useFlowRun({ maxFeed = 200 }: UseFlowRunOptions = {}): UseFlowRunReturn {\n  const [statuses, setStatuses] = useState<Record<string, NodeRunStatus>>({});\n  const [statusText, setStatusText] = useState<Record<string, string | undefined>>({});\n  const [nodeMessages, setNodeMessages] = useState<Record<string, string | undefined>>({});\n  const [outputs, setOutputs] = useState<Record<string, unknown>>({});\n  const [feed, setFeed] = useState<FlowRunFeedEntry[]>([]);\n  const [running, setRunning] = useState(false);\n  const [lastResult, setLastResult] = useState<RunResult | null>(null);\n  const abortRef = useRef<AbortController | null>(null);\n\n  const handleEvent = useCallback(\n    (e: RunEvent) => {\n      switch (e.type) {\n        case \"node-status\":\n          setStatuses((s) => ({ ...s, [e.nodeId]: e.status }));\n          setStatusText((t) => ({ ...t, [e.nodeId]: e.text }));\n          appendFeed({ level: \"status\", text: `${e.nodeId} → ${e.status}${e.text ? ` (${e.text})` : \"\"}`, nodeId: e.nodeId });\n          break;\n        case \"node-message\":\n          setNodeMessages((m) => ({ ...m, [e.nodeId]: e.message }));\n          appendFeed({ level: \"message\", text: e.message, nodeId: e.nodeId });\n          break;\n        case \"node-output\":\n          setOutputs((o) => ({ ...o, [e.nodeId]: e.value }));\n          appendFeed({ level: \"info\", text: `${e.nodeId}.${e.portId} = ${preview(e.value)}`, nodeId: e.nodeId, detail: e.value });\n          break;\n        case \"log\":\n          appendFeed({ level: e.level, text: e.message, nodeId: e.nodeId, detail: e.detail });\n          break;\n        case \"run-start\":\n          appendFeed({ level: \"info\", text: \"▶ run started\" });\n          break;\n        case \"run-end\":\n          appendFeed({ level: e.ok ? \"info\" : \"error\", text: e.ok ? \"✓ run complete\" : \"✗ run failed\" });\n          break;\n        case \"run-error\":\n          appendFeed({ level: \"error\", text: e.error });\n          break;\n      }\n      function appendFeed(partial: Omit<FlowRunFeedEntry, \"id\" | \"at\">) {\n        setFeed((f) => {\n          const entry: FlowRunFeedEntry = { id: `${Date.now()}_${f.length}`, at: Date.now(), ...partial };\n          const next = [...f, entry];\n          return next.length > maxFeed ? next.slice(next.length - maxFeed) : next;\n        });\n      }\n    },\n    [maxFeed],\n  );\n\n  const run = useCallback(\n    async (graph: FlowGraph, executors: ExecutorRegistry, options: RunOptions = {}) => {\n      if (running) {\n        return { ok: false, outputs: {}, error: \"another run is already in progress\" } satisfies RunResult;\n      }\n      const controller = new AbortController();\n      abortRef.current = controller;\n      // Reset previous statuses for the nodes we're about to run.\n      const idleStatuses: Record<string, NodeRunStatus> = {};\n      for (const n of graph.nodes) idleStatuses[n.id] = \"idle\";\n      setStatuses(idleStatuses);\n      setStatusText({});\n      setOutputs({});\n      setRunning(true);\n      try {\n        const result = await runFlow(graph, executors, handleEvent, { ...options, signal: controller.signal });\n        setLastResult(result);\n        return result;\n      } finally {\n        setRunning(false);\n        abortRef.current = null;\n      }\n    },\n    [handleEvent, running],\n  );\n\n  const cancel = useCallback(() => abortRef.current?.abort(), []);\n\n  const reset = useCallback(() => {\n    setStatuses({});\n    setStatusText({});\n    setOutputs({});\n    setFeed([]);\n    setLastResult(null);\n  }, []);\n\n  return { statuses, statusText, nodeMessages, outputs, feed, running, lastResult, run, cancel, reset };\n}\n\n/**\n * Write each reactive kind's latest run output into its `data.output`, so its\n * card can render the computed value live. Non-reactive kinds are returned\n * untouched. Pair with `applyStatusesToNodes` before rendering.\n */\nexport function applyOutputsToNodes<TNode extends { id: string; type?: string; data: any }>(\n  nodes: TNode[],\n  outputs: Record<string, unknown>,\n): TNode[] {\n  return nodes.map((n) => {\n    const kind = getNodeKind((n.data as any)?.kind ?? n.type ?? \"\");\n    if (!kind?.reactive || !(n.id in outputs)) return n;\n    return { ...n, data: { ...n.data, output: outputs[n.id] } };\n  });\n}\n\n/** Merge runtime statuses into nodes for rendering. */\nexport function applyStatusesToNodes<TNode extends { id: string; data: any }>(\n  nodes: TNode[],\n  statuses: Record<string, NodeRunStatus>,\n  statusText: Record<string, string | undefined>,\n): TNode[] {\n  return nodes.map((n) => ({\n    ...n,\n    data: {\n      ...n.data,\n      status: statuses[n.id] ?? n.data?.status ?? \"idle\",\n      statusText: statusText[n.id] ?? n.data?.statusText,\n    },\n  }));\n}\n\nfunction preview(v: unknown): string {\n  try {\n    const s = JSON.stringify(v);\n    return s && s.length > 60 ? s.slice(0, 57) + \"…\" : (s ?? String(v));\n  } catch {\n    return String(v);\n  }\n}\n","import { useCallback, useState } from \"react\";\nimport {\n  addEdge,\n  applyEdgeChanges,\n  applyNodeChanges,\n  type Connection,\n  type Edge,\n  type EdgeChange,\n  type NodeChange,\n} from \"@xyflow/react\";\nimport type { FlowEdge, FlowGraph, FlowNode } from \"../types\";\n\nexport type UseFlowStateReturn = {\n  nodes: FlowNode[];\n  edges: FlowEdge[];\n  setNodes: React.Dispatch<React.SetStateAction<FlowNode[]>>;\n  setEdges: React.Dispatch<React.SetStateAction<FlowEdge[]>>;\n  /**\n   * Replace nodes AND edges atomically in a single commit. Use this for any op\n   * that touches both (delete-with-edge-prune, undo/redo restore, setGraph):\n   * calling `setNodes` then `setEdges` is NOT atomic in controlled mode (each\n   * closes over a stale `value`), so the second write clobbers the first.\n   */\n  setGraph: (graph: FlowGraph) => void;\n  onNodesChange: (changes: NodeChange[]) => void;\n  onEdgesChange: (changes: EdgeChange[]) => void;\n  onConnect: (connection: Connection) => void;\n  /** Snapshot the current graph (suitable for serialization). */\n  toGraph: () => FlowGraph;\n};\n\n/**\n * useFlowState — React Flow's standard controlled-state plumbing in one hook.\n * Spread into <FlowCanvas>.\n */\nexport function useFlowState(initial: FlowGraph): UseFlowStateReturn {\n  const [nodes, setNodes] = useState<FlowNode[]>(initial.nodes);\n  const [edges, setEdges] = useState<FlowEdge[]>(initial.edges);\n\n  const onNodesChange = useCallback((changes: NodeChange[]) => {\n    setNodes((ns) => applyNodeChanges(changes, ns) as FlowNode[]);\n  }, []);\n  const onEdgesChange = useCallback((changes: EdgeChange[]) => {\n    setEdges((es) => applyEdgeChanges(changes, es));\n  }, []);\n  const onConnect = useCallback((connection: Connection) => {\n    setEdges((es) => addEdge(connection, es) as Edge[]);\n  }, []);\n\n  const setGraph = useCallback((graph: FlowGraph) => {\n    // Two useState writes in one event are batched, so this IS atomic here.\n    setNodes(graph.nodes);\n    setEdges(graph.edges);\n  }, []);\n\n  const toGraph = useCallback(() => ({ nodes, edges }), [nodes, edges]);\n\n  return { nodes, edges, setNodes, setEdges, setGraph, onNodesChange, onEdgesChange, onConnect, toGraph };\n}\n","import type { FlowGraph } from \"../types\";\n\n/**\n * Undo/redo history — a pure, React-free snapshot controller. The editor pushes\n * a graph snapshot BEFORE each committing mutation; `undo`/`redo` swap snapshots\n * between the past/future stacks. Kept free of React so it can be unit-tested\n * and reused by any host (or a headless driver).\n *\n * Coalescing (collapsing a burst of setState calls from one logical op into a\n * single undo step) is the caller's job — see `useFlowHistory`.\n */\nexport type HistoryController = {\n  /** Record `graph` as an undo point. Clears the redo stack (new branch). */\n  push: (graph: FlowGraph) => void;\n  /** Pop the last undo point; `current` is pushed onto the redo stack. */\n  undo: (current: FlowGraph) => FlowGraph | null;\n  /** Pop the last redo point; `current` is pushed back onto the undo stack. */\n  redo: (current: FlowGraph) => FlowGraph | null;\n  canUndo: () => boolean;\n  canRedo: () => boolean;\n  clear: () => void;\n  /** Test/inspection helper — sizes of the two stacks. */\n  size: () => { past: number; future: number };\n};\n\nexport function createHistory(limit = 100): HistoryController {\n  let past: FlowGraph[] = [];\n  let future: FlowGraph[] = [];\n\n  return {\n    push(graph) {\n      past.push(graph);\n      if (past.length > limit) past.shift();\n      future = [];\n    },\n    undo(current) {\n      const prev = past.pop();\n      if (prev === undefined) return null;\n      future.push(current);\n      return prev;\n    },\n    redo(current) {\n      const next = future.pop();\n      if (next === undefined) return null;\n      past.push(current);\n      return next;\n    },\n    canUndo: () => past.length > 0,\n    canRedo: () => future.length > 0,\n    clear() {\n      past = [];\n      future = [];\n    },\n    size: () => ({ past: past.length, future: future.length }),\n  };\n}\n","import { useCallback, useMemo, useRef, useState } from \"react\";\nimport type { EdgeChange, NodeChange } from \"@xyflow/react\";\nimport type { FlowGraph } from \"../types\";\nimport { createHistory } from \"./history\";\nimport type { UseFlowStateReturn } from \"./use-flow-state\";\n\nexport type UseFlowHistoryReturn = {\n  /** The flow sink wrapped so committing mutations snapshot for undo first. */\n  flow: UseFlowStateReturn;\n  undo: () => void;\n  redo: () => void;\n  canUndo: boolean;\n  canRedo: boolean;\n  /** Snapshot the current graph as an undo point (before a programmatic edit). */\n  capture: () => void;\n  /** Wire to `<FlowCanvas onNodeDragStart>` — snapshots the pre-drag graph. */\n  onNodeDragStart: () => void;\n};\n\n/**\n * useFlowHistory — the commit/undo pipeline. Wraps a flow sink (the uncontrolled\n * `useFlowState` hook OR the controlled adapter) so every *committing* mutation\n * records a snapshot first, giving undo/redo without the editor threading\n * history through each call site. This is the single interception point the\n * two-sink architecture otherwise lacks.\n *\n * Granularity: a burst of setState calls from one logical op (e.g. a\n * delete = setNodes+setEdges) is coalesced into ONE undo step; transient\n * interactive changes (drag-move, dimension-measure, selection) are NOT captured\n * — a drag is captured once at `onNodeDragStart` instead.\n */\nexport function useFlowHistory(flow: UseFlowStateReturn): UseFlowHistoryReturn {\n  const history = useRef(createHistory()).current;\n  const restoring = useRef(false);\n  const coalesced = useRef(false);\n  const [, bump] = useState(0);\n  const rerender = useCallback(() => bump((n) => n + 1), []);\n\n  // Latest graph via a ref, so capture never reads a stale snapshot.\n  const graphRef = useRef<FlowGraph>({ nodes: flow.nodes, edges: flow.edges });\n  graphRef.current = { nodes: flow.nodes, edges: flow.edges };\n\n  const capture = useCallback(() => {\n    if (restoring.current || coalesced.current) return;\n    coalesced.current = true;\n    queueMicrotask(() => {\n      coalesced.current = false;\n    });\n    history.push(graphRef.current);\n    rerender();\n  }, [history, rerender]);\n\n  const restore = useCallback(\n    (g: FlowGraph | null) => {\n      if (!g) return;\n      restoring.current = true;\n      flow.setGraph(g);\n      queueMicrotask(() => {\n        restoring.current = false;\n      });\n      rerender();\n    },\n    [flow, rerender],\n  );\n\n  const undo = useCallback(() => restore(history.undo(graphRef.current)), [history, restore]);\n  const redo = useCallback(() => restore(history.redo(graphRef.current)), [history, restore]);\n\n  const wrapped = useMemo<UseFlowStateReturn>(\n    () => ({\n      ...flow,\n      setNodes: (next) => {\n        capture();\n        flow.setNodes(next);\n      },\n      setEdges: (next) => {\n        capture();\n        flow.setEdges(next);\n      },\n      setGraph: (g) => {\n        capture();\n        flow.setGraph(g);\n      },\n      onNodesChange: (changes: NodeChange[]) => {\n        // Only structural removes commit; position/dimensions/select are transient.\n        if (!restoring.current && changes.some((c) => c.type === \"remove\")) capture();\n        flow.onNodesChange(changes);\n      },\n      onEdgesChange: (changes: EdgeChange[]) => {\n        if (!restoring.current && changes.some((c) => c.type === \"remove\")) capture();\n        flow.onEdgesChange(changes);\n      },\n      onConnect: (conn) => {\n        capture();\n        flow.onConnect(conn);\n      },\n    }),\n    [flow, capture],\n  );\n\n  return {\n    flow: wrapped,\n    undo,\n    redo,\n    canUndo: history.canUndo(),\n    canRedo: history.canRedo(),\n    capture,\n    onNodeDragStart: capture,\n  };\n}\n"]}

package/dist/durable.cjs

@@ -775,8 +775,9 @@ async function runFlow(graph, executors, onEvent = () => {
         outputs[node.id] = stored;
         const activated = activatedPorts(node, stored);
         for (const portId of activated.ports) {
-          portValues.set(`${node.id}:${portId}`, activated.value);
-          onEvent({ type: "node-output", nodeId: node.id, portId, value: activated.value });
+          const value = portValueOf(activated, portId);
+          portValues.set(`${node.id}:${portId}`, value);
+          onEvent({ type: "node-output", nodeId: node.id, portId, value });
         }
         completed.add(node.id);
         onEvent({ type: "node-status", nodeId: node.id, status: "done", text: "resumed" });
@@ -839,8 +840,9 @@ async function runFlow(graph, executors, onEvent = () => {
         outputs[node.id] = result;
         const activated = activatedPorts(node, result);
         for (const portId of activated.ports) {
-          portValues.set(`${node.id}:${portId}`, activated.value);
-          onEvent({ type: "node-output", nodeId: node.id, portId, value: activated.value });
+          const value = portValueOf(activated, portId);
+          portValues.set(`${node.id}:${portId}`, value);
+          onEvent({ type: "node-output", nodeId: node.id, portId, value });
         }
         completed.add(node.id);
         onEvent({ type: "node-status", nodeId: node.id, status: "done" });
@@ -946,6 +948,13 @@ function activatedPorts(node, result) {
     if (typeof r.__port === "string") {
       return { ports: [r.__port], value: r.value };
     }
+    if (Array.isArray(r.__ports)) {
+      return { ports: r.__ports.filter((p) => typeof p === "string"), value: r.value };
+    }
+    if (r.__ports && typeof r.__ports === "object") {
+      const values = r.__ports;
+      return { ports: Object.keys(values), value: r.value, values };
+    }
     if (typeof r.branch === "string") {
       return { ports: [r.branch], value: Object.prototype.hasOwnProperty.call(r, "value") ? r.value : r };
     }
@@ -954,6 +963,9 @@ function activatedPorts(node, result) {
   const declared = resolveNodePorts(node, kind).outputs?.map((p) => p.id);
   return { ports: declared?.length ? declared : ["out"], value: result };
 }
+function portValueOf(activated, portId) {
+  return activated.values && Object.prototype.hasOwnProperty.call(activated.values, portId) ? activated.values[portId] : activated.value;
+}
 function announce(onEvent, node, phase) {
   const data = node.data;
   const raw = phase === "start" ? data?.startingMsg : data?.stoppingMsg;