@particle-academy/fancy-flow 0.77.1 → 0.79.0

package/dist/{chunk-2VI24UPB.js → chunk-QMJVUT7C.js}

@@ -1,5 +1,5 @@
 import { applyNodeChanges, applyEdgeChanges, addEdge } from './chunk-OWENS2H5.js';
-import { runFlow, getNodeKind } from './chunk-EEIWAIXW.js';
+import { runFlow, getNodeKind } from './chunk-OZHBAXMA.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-2VI24UPB.js.map
-//# sourceMappingURL=chunk-2VI24UPB.js.map
+//# sourceMappingURL=chunk-QMJVUT7C.js.map
+//# sourceMappingURL=chunk-QMJVUT7C.js.map

package/dist/{chunk-2VI24UPB.js.map → chunk-QMJVUT7C.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-2VI24UPB.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-QMJVUT7C.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/{chunk-CQAMEPPI.js → chunk-R4G7SPLD.js}

@@ -1,4 +1,4 @@
-import { runFlow } from './chunk-EEIWAIXW.js';
+import { runFlow } from './chunk-OZHBAXMA.js';
 
 // src/runtime/run-cohort.ts
 async function runCohort(flows, executors, onEvent = () => {
@@ -46,5 +46,5 @@ function errorText(error) {
 }
 
 export { runCohort };
-//# sourceMappingURL=chunk-CQAMEPPI.js.map
-//# sourceMappingURL=chunk-CQAMEPPI.js.map
+//# sourceMappingURL=chunk-R4G7SPLD.js.map
+//# sourceMappingURL=chunk-R4G7SPLD.js.map

package/dist/{chunk-CQAMEPPI.js.map → chunk-R4G7SPLD.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/runtime/run-cohort.ts"],"names":[],"mappings":";;;AAoFA,eAAsB,SAAA,CACpB,KAAA,EACA,SAAA,EACA,OAAA,GAAoD,MAAM;AAAC,CAAA,EAC3D,OAAA,GAAyB,EAAC,EACD;AACzB,EAAA,MAAM,EAAE,MAAA,GAAS,gBAAA,EAAkB,OAAO,MAAA,EAAQ,GAAG,YAAW,GAAI,OAAA;AAEpE,EAAA,IAAI,WAAW,UAAA,EAAY;AACzB,IAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,MACb,KAAA,CAAM,GAAA,CAAI,OAAO,IAAA,EAAM,KAAA,MAAW;AAAA,QAChC,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,CAAC,CAAA,KAAM,OAAA,CAAQ,CAAA,EAAG,KAAK,CAAA,EAAG,UAAU,CAAA;AAAA,QACvE;AAAA,OACF,CAAE;AAAA,KACJ;AAAA,EACF;AAEA,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC3C,IAAA,IAAI,MAAA,KAAW,oBAAoB,KAAA,EAAO;AACxC,MAAA,MAAM,GAAA,GAAM,MAAM,MAAA,GAAS,IAAA,EAAM,KAAK,CAAA,IAAK,sCAAA;AAC3C,MAAA,IAAI,MAAA;AAEJ,MAAA,IAAI;AACF,QAAA,MAAA,GAAS,MAAM,KAAA,CAAM,IAAA,EAAM,KAAK,CAAA;AAAA,MAClC,SAAS,KAAA,EAAO;AAGd,QAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,UACX,EAAA,EAAI,KAAA;AAAA,UACJ,SAAS,EAAC;AAAA,UACV,KAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,aAAA,EAAe,CAAA,8BAAA,EAAiC,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,SACjE,CAAA;AACD,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,CAAC,MAAA,EAAQ;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAA,EAAI,KAAA,EAAO,OAAA,EAAS,EAAC,EAAG,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,aAAA,EAAe,GAAA,IAAO,CAAA;AACnF,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,CAAC,CAAA,KAAM,OAAA,CAAQ,CAAA,EAAG,KAAK,CAAA,EAAG,UAAU,CAAA;AAAA,MACvE;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,UAAU,KAAA,EAAwB;AACzC,EAAA,OAAO,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AAC9D","file":"chunk-CQAMEPPI.js","sourcesContent":["import type { ExecutorRegistry, FlowGraph, RunEvent } from \"../types\";\nimport { runFlow, type RunOptions, type RunResult } from \"./run-flow\";\n\n/**\n * How the flows one trigger fired should treat each other.\n *\n * - `serial-guarded` (default) — run in the declared order, one at a time,\n *   re-checking `guard` immediately before each. This is the safe default\n *   because it is the only one that notices when an earlier flow invalidated\n *   the state a later one was fired for.\n * - `serial` — ordered, one at a time, unguarded.\n * - `parallel` — all at once. Ordering is incidental and collisions are yours to\n *   handle; correct for fan-outs that share no state, and only those.\n */\nexport type CohortPolicy = \"serial-guarded\" | \"serial\" | \"parallel\";\n\n/**\n * The precondition re-checked just before each flow starts.\n *\n * Return `false` (or throw) to skip that flow. The engine cannot know what\n * \"still valid\" means for your data, so it asks you — right before the run,\n * not at dispatch, because the whole hazard is what changed in between.\n */\nexport type CohortGuard = (\n  flow: FlowGraph,\n  index: number,\n) => boolean | Promise<boolean>;\n\nexport type CohortOptions = RunOptions & {\n  policy?: CohortPolicy;\n  guard?: CohortGuard;\n  /** Why the guard said no — recorded on the skipped result. */\n  reason?: (flow: FlowGraph, index: number) => string;\n};\n\nexport type CohortResult = RunResult & {\n  index: number;\n  /** True when the flow never ran because its guard did not pass. */\n  skipped?: boolean;\n  skippedReason?: string;\n};\n\n/**\n * runCohort — run every flow that one trigger event fired, as a group.\n *\n * ## Why this exists\n *\n * `runFlow` runs one graph. A host that fans a single webhook, schedule, or\n * record change out to several flows usually loops it — and a loop, or worse a\n * `Promise.all`, has no answer for the case that actually bites: one of those\n * flows deletes or mutates the record they were ALL fired for. The others then\n * run against state that is no longer there and resolve `ok: true`, having done\n * nothing. Nothing throws. Nothing is logged. That silent success is the failure\n * mode this function exists to remove.\n *\n * ## What it does\n *\n * Runs the flows in the order you declared, one at a time, and calls `guard`\n * immediately before each. A flow whose guard does not pass is returned with\n * `skipped: true` and a reason instead of being run — and the cohort carries on\n * to the next one.\n *\n * ```ts\n * const results = await runCohort([enrich, archive, notify], executors, undefined, {\n *   initialInputs: { t: { deal } },          // snapshotted once, shared by all\n *   guard: async () => Boolean(await findDeal(deal.id)),\n *   reason: () => `deal ${deal.id} no longer exists`,\n * });\n * ```\n *\n * If `archive` deletes the deal, `notify` comes back skipped with that reason\n * rather than notifying about nothing.\n *\n * ## Failure does not cancel the cohort\n *\n * A flow that fails is reported and the next one still runs. \"The flow before me\n * threw\" is not an answer to \"is my input still there\" — the guard is, and it\n * gets asked either way.\n *\n * The Laravel twin (`FancyFlow::dispatchCohort()` in `fancy-flow-php`) is the\n * same contract across a queue, where each run is durable and hands on to its\n * successor when it settles. Same policies, same guard semantics, same\n * fail-closed rule.\n */\nexport async function runCohort(\n  flows: FlowGraph[],\n  executors: ExecutorRegistry,\n  onEvent: (event: RunEvent, index: number) => void = () => {},\n  options: CohortOptions = {},\n): Promise<CohortResult[]> {\n  const { policy = \"serial-guarded\", guard, reason, ...runOptions } = options;\n\n  if (policy === \"parallel\") {\n    return Promise.all(\n      flows.map(async (flow, index) => ({\n        ...(await runFlow(flow, executors, (e) => onEvent(e, index), runOptions)),\n        index,\n      })),\n    );\n  }\n\n  const results: CohortResult[] = [];\n\n  for (const [index, flow] of flows.entries()) {\n    if (policy === \"serial-guarded\" && guard) {\n      const why = () => reason?.(flow, index) ?? \"trigger precondition no longer holds\";\n      let passes: boolean;\n\n      try {\n        passes = await guard(flow, index);\n      } catch (error) {\n        // Fail CLOSED. A guard that cannot answer is not permission to proceed:\n        // a skip is visible and re-runnable, a run over missing state is neither.\n        results.push({\n          ok: false,\n          outputs: {},\n          index,\n          skipped: true,\n          skippedReason: `guard could not be evaluated: ${errorText(error)}`,\n        });\n        continue;\n      }\n\n      if (!passes) {\n        results.push({ ok: false, outputs: {}, index, skipped: true, skippedReason: why() });\n        continue;\n      }\n    }\n\n    results.push({\n      ...(await runFlow(flow, executors, (e) => onEvent(e, index), runOptions)),\n      index,\n    });\n  }\n\n  return results;\n}\n\nfunction errorText(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"]}
+{"version":3,"sources":["../src/runtime/run-cohort.ts"],"names":[],"mappings":";;;AAoFA,eAAsB,SAAA,CACpB,KAAA,EACA,SAAA,EACA,OAAA,GAAoD,MAAM;AAAC,CAAA,EAC3D,OAAA,GAAyB,EAAC,EACD;AACzB,EAAA,MAAM,EAAE,MAAA,GAAS,gBAAA,EAAkB,OAAO,MAAA,EAAQ,GAAG,YAAW,GAAI,OAAA;AAEpE,EAAA,IAAI,WAAW,UAAA,EAAY;AACzB,IAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,MACb,KAAA,CAAM,GAAA,CAAI,OAAO,IAAA,EAAM,KAAA,MAAW;AAAA,QAChC,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,CAAC,CAAA,KAAM,OAAA,CAAQ,CAAA,EAAG,KAAK,CAAA,EAAG,UAAU,CAAA;AAAA,QACvE;AAAA,OACF,CAAE;AAAA,KACJ;AAAA,EACF;AAEA,EAAA,MAAM,UAA0B,EAAC;AAEjC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,CAAA,IAAK,KAAA,CAAM,SAAQ,EAAG;AAC3C,IAAA,IAAI,MAAA,KAAW,oBAAoB,KAAA,EAAO;AACxC,MAAA,MAAM,GAAA,GAAM,MAAM,MAAA,GAAS,IAAA,EAAM,KAAK,CAAA,IAAK,sCAAA;AAC3C,MAAA,IAAI,MAAA;AAEJ,MAAA,IAAI;AACF,QAAA,MAAA,GAAS,MAAM,KAAA,CAAM,IAAA,EAAM,KAAK,CAAA;AAAA,MAClC,SAAS,KAAA,EAAO;AAGd,QAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,UACX,EAAA,EAAI,KAAA;AAAA,UACJ,SAAS,EAAC;AAAA,UACV,KAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,aAAA,EAAe,CAAA,8BAAA,EAAiC,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,SACjE,CAAA;AACD,QAAA;AAAA,MACF;AAEA,MAAA,IAAI,CAAC,MAAA,EAAQ;AACX,QAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,EAAA,EAAI,KAAA,EAAO,OAAA,EAAS,EAAC,EAAG,KAAA,EAAO,OAAA,EAAS,IAAA,EAAM,aAAA,EAAe,GAAA,IAAO,CAAA;AACnF,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,GAAI,MAAM,OAAA,CAAQ,IAAA,EAAM,SAAA,EAAW,CAAC,CAAA,KAAM,OAAA,CAAQ,CAAA,EAAG,KAAK,CAAA,EAAG,UAAU,CAAA;AAAA,MACvE;AAAA,KACD,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,UAAU,KAAA,EAAwB;AACzC,EAAA,OAAO,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AAC9D","file":"chunk-R4G7SPLD.js","sourcesContent":["import type { ExecutorRegistry, FlowGraph, RunEvent } from \"../types\";\nimport { runFlow, type RunOptions, type RunResult } from \"./run-flow\";\n\n/**\n * How the flows one trigger fired should treat each other.\n *\n * - `serial-guarded` (default) — run in the declared order, one at a time,\n *   re-checking `guard` immediately before each. This is the safe default\n *   because it is the only one that notices when an earlier flow invalidated\n *   the state a later one was fired for.\n * - `serial` — ordered, one at a time, unguarded.\n * - `parallel` — all at once. Ordering is incidental and collisions are yours to\n *   handle; correct for fan-outs that share no state, and only those.\n */\nexport type CohortPolicy = \"serial-guarded\" | \"serial\" | \"parallel\";\n\n/**\n * The precondition re-checked just before each flow starts.\n *\n * Return `false` (or throw) to skip that flow. The engine cannot know what\n * \"still valid\" means for your data, so it asks you — right before the run,\n * not at dispatch, because the whole hazard is what changed in between.\n */\nexport type CohortGuard = (\n  flow: FlowGraph,\n  index: number,\n) => boolean | Promise<boolean>;\n\nexport type CohortOptions = RunOptions & {\n  policy?: CohortPolicy;\n  guard?: CohortGuard;\n  /** Why the guard said no — recorded on the skipped result. */\n  reason?: (flow: FlowGraph, index: number) => string;\n};\n\nexport type CohortResult = RunResult & {\n  index: number;\n  /** True when the flow never ran because its guard did not pass. */\n  skipped?: boolean;\n  skippedReason?: string;\n};\n\n/**\n * runCohort — run every flow that one trigger event fired, as a group.\n *\n * ## Why this exists\n *\n * `runFlow` runs one graph. A host that fans a single webhook, schedule, or\n * record change out to several flows usually loops it — and a loop, or worse a\n * `Promise.all`, has no answer for the case that actually bites: one of those\n * flows deletes or mutates the record they were ALL fired for. The others then\n * run against state that is no longer there and resolve `ok: true`, having done\n * nothing. Nothing throws. Nothing is logged. That silent success is the failure\n * mode this function exists to remove.\n *\n * ## What it does\n *\n * Runs the flows in the order you declared, one at a time, and calls `guard`\n * immediately before each. A flow whose guard does not pass is returned with\n * `skipped: true` and a reason instead of being run — and the cohort carries on\n * to the next one.\n *\n * ```ts\n * const results = await runCohort([enrich, archive, notify], executors, undefined, {\n *   initialInputs: { t: { deal } },          // snapshotted once, shared by all\n *   guard: async () => Boolean(await findDeal(deal.id)),\n *   reason: () => `deal ${deal.id} no longer exists`,\n * });\n * ```\n *\n * If `archive` deletes the deal, `notify` comes back skipped with that reason\n * rather than notifying about nothing.\n *\n * ## Failure does not cancel the cohort\n *\n * A flow that fails is reported and the next one still runs. \"The flow before me\n * threw\" is not an answer to \"is my input still there\" — the guard is, and it\n * gets asked either way.\n *\n * The Laravel twin (`FancyFlow::dispatchCohort()` in `fancy-flow-php`) is the\n * same contract across a queue, where each run is durable and hands on to its\n * successor when it settles. Same policies, same guard semantics, same\n * fail-closed rule.\n */\nexport async function runCohort(\n  flows: FlowGraph[],\n  executors: ExecutorRegistry,\n  onEvent: (event: RunEvent, index: number) => void = () => {},\n  options: CohortOptions = {},\n): Promise<CohortResult[]> {\n  const { policy = \"serial-guarded\", guard, reason, ...runOptions } = options;\n\n  if (policy === \"parallel\") {\n    return Promise.all(\n      flows.map(async (flow, index) => ({\n        ...(await runFlow(flow, executors, (e) => onEvent(e, index), runOptions)),\n        index,\n      })),\n    );\n  }\n\n  const results: CohortResult[] = [];\n\n  for (const [index, flow] of flows.entries()) {\n    if (policy === \"serial-guarded\" && guard) {\n      const why = () => reason?.(flow, index) ?? \"trigger precondition no longer holds\";\n      let passes: boolean;\n\n      try {\n        passes = await guard(flow, index);\n      } catch (error) {\n        // Fail CLOSED. A guard that cannot answer is not permission to proceed:\n        // a skip is visible and re-runnable, a run over missing state is neither.\n        results.push({\n          ok: false,\n          outputs: {},\n          index,\n          skipped: true,\n          skippedReason: `guard could not be evaluated: ${errorText(error)}`,\n        });\n        continue;\n      }\n\n      if (!passes) {\n        results.push({ ok: false, outputs: {}, index, skipped: true, skippedReason: why() });\n        continue;\n      }\n    }\n\n    results.push({\n      ...(await runFlow(flow, executors, (e) => onEvent(e, index), runOptions)),\n      index,\n    });\n  }\n\n  return results;\n}\n\nfunction errorText(error: unknown): string {\n  return error instanceof Error ? error.message : String(error);\n}\n"]}

package/dist/connectors.d.cts

@@ -1,6 +1,6 @@
-import { C as ConfigField, N as NodeKindDefinition, O as OutputField } from './types-BdkXxjFh.cjs';
+import { C as ConfigField, N as NodeKindDefinition, O as OutputField } from './types-B1jftRa9.cjs';
 import 'react';
-import './types-B-Syk9-M.cjs';
+import './types-E48Dpesq.cjs';
 import '@xyflow/react';
 import './pause-9iT4tCEV.cjs';
 

package/dist/connectors.d.ts

@@ -1,6 +1,6 @@
-import { C as ConfigField, N as NodeKindDefinition, O as OutputField } from './types-CbekKMMO.js';
+import { C as ConfigField, N as NodeKindDefinition, O as OutputField } from './types-D5SBBpbe.js';
 import 'react';
-import './types-B-Syk9-M.js';
+import './types-E48Dpesq.js';
 import '@xyflow/react';
 import './pause-9iT4tCEV.js';
 

package/dist/durable/index.d.cts

@@ -1,5 +1,5 @@
-import { F as FlowGraph, R as RunEvent, c as RunIdentity, E as ExecutorRegistry, a as FlowNode, N as NodeExecutor, d as RunIdentityJson } from '../types-B-Syk9-M.cjs';
-import { a as RunResult } from '../run-flow-pW0PllaZ.cjs';
+import { F as FlowGraph, R as RunEvent, c as RunIdentity, E as ExecutorRegistry, a as FlowNode, N as NodeExecutor, d as RunIdentityJson } from '../types-E48Dpesq.cjs';
+import { a as RunResult } from '../run-flow-Bdrn4lQV.cjs';
 import { b as PauseSignal } from '../pause-9iT4tCEV.cjs';
 import '@xyflow/react';
 

package/dist/durable/index.d.ts

@@ -1,5 +1,5 @@
-import { F as FlowGraph, R as RunEvent, c as RunIdentity, E as ExecutorRegistry, a as FlowNode, N as NodeExecutor, d as RunIdentityJson } from '../types-B-Syk9-M.js';
-import { a as RunResult } from '../run-flow-BLP9rXfO.js';
+import { F as FlowGraph, R as RunEvent, c as RunIdentity, E as ExecutorRegistry, a as FlowNode, N as NodeExecutor, d as RunIdentityJson } from '../types-E48Dpesq.js';
+import { a as RunResult } from '../run-flow-D2iOjWsj.js';
 import { b as PauseSignal } from '../pause-9iT4tCEV.js';
 import '@xyflow/react';
 

package/dist/durable.cjs

@@ -835,6 +835,9 @@ async function runFlow(graph, executors, onEvent = () => {
             executors,
             depth,
             run,
+            // Structural executors derive a nested lane from the graph they are
+            // in; `for_each`'s `item` port cannot be implemented without it.
+            graph,
             terminal: terminalAccessorFor(node)
           })
         );
@@ -1276,6 +1279,7 @@ var branchExecutor = (ctx) => {
   const inputs = ctx.inputs;
   let taken;
   const raw = config.condition;
+  validateRoutingExpression(ctx, raw, "branch", "condition");
   if (typeof raw === "string" && raw.trim() !== "") {
     taken = truthy(resolve(raw, inputs));
     warnIfUnresolved(ctx, raw, taken ? "true" : "false");
@@ -1330,14 +1334,102 @@ var mergeExecutor = (ctx) => {
   }
   return merged;
 };
-var forEachExecutor = (ctx) => {
-  const source = resolve(configOf(ctx.node).source, ctx.inputs);
+var FOR_EACH_DEFAULT_MAX_ITEMS = 1e3;
+var FOR_EACH_HARD_MAX_ITEMS = 1e4;
+function reachable(adjacency, starts) {
+  const seen = /* @__PURE__ */ new Set();
+  const queue = [...starts];
+  for (let cursor = 0; cursor < queue.length; cursor += 1) {
+    const id = queue[cursor];
+    if (seen.has(id)) continue;
+    seen.add(id);
+    for (const target of adjacency.get(id) ?? []) queue.push(target);
+  }
+  return seen;
+}
+function forEachLane(graph, nodeId) {
+  const handleOf = (edge) => edge.sourceHandle ?? "out";
+  const itemEdges = graph.edges.filter((e) => e.source === nodeId && handleOf(e) === "item");
+  if (itemEdges.length === 0) return null;
+  const adjacency = /* @__PURE__ */ new Map();
+  for (const edge of graph.edges) {
+    const list = adjacency.get(edge.source) ?? [];
+    list.push(edge.target);
+    adjacency.set(edge.source, list);
+  }
+  const done = reachable(
+    adjacency,
+    graph.edges.filter((e) => e.source === nodeId && handleOf(e) === "done").map((e) => e.target)
+  );
+  const body = new Set(
+    [...reachable(adjacency, itemEdges.map((e) => e.target))].filter(
+      (id) => !done.has(id) && id !== nodeId
+    )
+  );
+  return {
+    graph: {
+      nodes: graph.nodes.filter((n) => body.has(n.id)),
+      edges: graph.edges.filter((e) => body.has(e.source) && body.has(e.target)),
+      ...graph.inputs === void 0 ? {} : { inputs: graph.inputs }
+    },
+    entries: itemEdges.filter((e) => body.has(e.target))
+  };
+}
+var forEachExecutor = async (ctx) => {
+  const config = configOf(ctx.node);
+  const source = resolve(config.source, ctx.inputs);
   let items;
   if (Array.isArray(source)) items = source;
   else if (source === null || source === void 0) items = [];
   else if (typeof source === "object") items = Object.values(source);
   else items = [source];
-  return { items, count: items.length };
+  const lane = ctx.graph ? forEachLane(ctx.graph, ctx.node.id) : null;
+  if (lane === null || config.mode === "collect") {
+    return { items, count: items.length };
+  }
+  if (lane.graph.nodes.length === 0) {
+    ctx.abort(`for_each "${ctx.node.id}" has an item edge but its derived lane is empty`);
+  }
+  const maxItems = Number(config.maxItems ?? FOR_EACH_DEFAULT_MAX_ITEMS);
+  if (!Number.isFinite(maxItems) || maxItems < 1 || maxItems > FOR_EACH_HARD_MAX_ITEMS) {
+    ctx.abort(`for_each "${ctx.node.id}" maxItems must be between 1 and ${FOR_EACH_HARD_MAX_ITEMS}`);
+  }
+  if (items.length > maxItems) {
+    ctx.abort(
+      `for_each "${ctx.node.id}" resolved ${items.length} items exceeds its maxItems cap of ${maxItems}`
+    );
+  }
+  const results = [];
+  const failures = [];
+  for (const [index, item] of items.entries()) {
+    const initialInputs = {};
+    for (const edge of lane.entries) {
+      initialInputs[edge.target] = {
+        ...initialInputs[edge.target] ?? {},
+        [edge.targetHandle ?? "in"]: item
+      };
+    }
+    const nested = await runFlow(lane.graph, { ...ctx.executors ?? {} }, () => {
+    }, {
+      initialInputs,
+      depth: (ctx.depth ?? 0) + 1,
+      // The index rides on the identity, so a node in iteration 3 cannot share
+      // an idempotency key with the same node in iteration 4.
+      run: ctx.run?.descend(ctx.node.id, index)
+    });
+    if (!nested.ok) {
+      const reason = nested.error ?? "unknown error";
+      if (decodePause(reason)) ctx.abort(reason);
+      results.push(null);
+      failures.push({ index, item, error: reason });
+      continue;
+    }
+    results.push(nested.outputs);
+  }
+  return {
+    __port: "done",
+    value: { items, results, failures, count: items.length }
+  };
 };
 var manualTriggerExecutor = (ctx) => ctx.inputs;
 var outputExecutor = (ctx) => {
@@ -1357,6 +1449,7 @@ var switchCaseExecutor = (ctx) => {
   const config = configOf(ctx.node);
   const inputs = ctx.inputs;
   const expression = config.value;
+  validateRoutingExpression(ctx, expression, "switch_case", "value");
   const value = text(resolve(expression, inputs));
   const cases = config.cases ?? {};
   const matched = Object.prototype.hasOwnProperty.call(cases, value);
@@ -1364,6 +1457,21 @@ var switchCaseExecutor = (ctx) => {
   warnIfUnresolved(ctx, expression, port, "value");
   return { __port: port, value: inputs.in ?? inputs };
 };
+function validateRoutingExpression(ctx, value, kind, field) {
+  if (typeof value !== "string" || value.trim() === "") return;
+  const bare = value.trim();
+  const subject = `${kind} "${ctx.node.id}" ${field} "${bare}"`;
+  if (!value.includes("{{")) {
+    ctx.abort(`${subject} is not an expression -- wrap it: {{ ${bare} }}`);
+  }
+  let open = 0;
+  for (const [delimiter] of value.matchAll(/\{\{|\}\}/g)) {
+    open = delimiter === "{{" ? open + 1 : Math.max(0, open - 1);
+  }
+  if (open > 0) {
+    ctx.abort(`${subject} has an unclosed expression -- close every {{ with }}`);
+  }
+}
 
 // src/registry/terminal-nodes.ts
 var DEFAULT_TIMEOUT_MS = 12e4;
@@ -1855,7 +1963,7 @@ var KINDS = [
         key: "condition",
         label: "Raw expression (advanced)",
         example: "{{ $json.active && $json.score > 10 }}",
-        description: "Escape hatch for logic the builder can't express. Overrides the conditions above when set."
+        description: "Escape hatch for logic the builder can't express. Overrides the conditions above when set. String values must be {{ }}-wrapped expressions; bare strings and unclosed templates abort the run."
       }
     ]
   },
@@ -1875,7 +1983,7 @@ var KINDS = [
     // moves the ports on the canvas and the ports the runtime activates.
     outputs: (config) => casePorts(config?.cases),
     configSchema: [
-      { type: "expression", key: "value", label: "Switch on", example: "{{ $json.kind }}", required: true },
+      { type: "expression", key: "value", label: "Switch on", description: "String values must be {{ }}-wrapped expressions; bare strings and unclosed templates abort the run.", example: "{{ $json.kind }}", required: true },
       {
         type: "keyvalue",
         key: "cases",
@@ -1894,6 +2002,15 @@ var KINDS = [
     name: "@particle-academy/for_each",
     outputShape: [
       { path: "items", type: "array" },
+      // `results` and `failures` are the WIRED shape -- what a lane produces
+      // when the `item` port is connected. Declared unconditionally because a
+      // declaration describes the kind, not one graph's use of it, and because
+      // the shared table requires them: fancy-conformance 0.30.0 added
+      // `results` and 0.31.0 added `failures`, both BREAKING, both so that a
+      // runtime which has not implemented iteration fails here rather than
+      // reporting surface parity it does not have.
+      { path: "results", type: "array" },
+      { path: "failures", type: "array" },
       { path: "count", type: "number" }
     ],
     aliases: ["for_each", "@fancy/for_each"],
@@ -1902,7 +2019,7 @@ var KINDS = [
     executor: forEachExecutor,
     category: "logic",
     label: "For Each",
-    description: "Publishes the resolved list and its size on BOTH `item` and `done`. Fan-out as DATA, not as jobs -- nothing runs per item.",
+    description: "Wire `item` to a lane and it runs once per item, aggregating `results` and `failures` on `done`. Leave `item` unwired (or set `mode: collect`) and it just publishes the list and its size -- one node, one checkpoint.",
     icon: "\u21BB",
     inputs: [{ id: "in" }],
     outputs: [{ id: "item", label: "item" }, { id: "done", label: "done" }],