flowcraft 1.0.0 → 2.1.0

package/dist/chunk-3YMBNZ77.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/builder/graph/graph.ts","../src/builder/graph/runner.ts"],"names":["result"],"mappings":";;;;;;;;AAqCO,SAAS,mBAGd,QAAA,EAA+D;AAChE,EAAA,MAAM,aAAA,uBAAkC,GAAA,EAAI;AAE5C,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC3B,IAAA,IAAI,MAAA,CAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,UAAU,GAAG,CAAA;AACrD,MAAA,aAAA,CAAc,GAAA,CAAI,GAAA,EAAK,QAAA,CAAS,GAAG,CAAC,CAAA;AAAA,EACtC;AAEA,EAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,2BAA2B,CAAA;AACjD,IAAA,aAAA,CAAc,GAAA,CAAI,6BAA6B,gBAAuB,CAAA;AACvE,EAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,4BAA4B,CAAA;AAClD,IAAA,aAAA,CAAc,GAAA,CAAI,8BAA8B,iBAAwB,CAAA;AACzE,EAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,qCAAqC,CAAA;AAC3D,IAAA,aAAA,CAAc,GAAA,CAAI,uCAAuC,wBAA+B,CAAA;AACzF,EAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,+BAA+B,CAAA;AACrD,IAAA,aAAA,CAAc,GAAA,CAAI,iCAAiC,mBAA0B,CAAA;AAC9E,EAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,iCAAiC,CAAA;AACvD,IAAA,aAAA,CAAc,GAAA,CAAI,mCAAmC,uBAA8B,CAAA;AAEpF,EAAA,OAAO,aAAA;AACR;AAQO,IAAM,eAAN,MAGL;AAAA;AAAA,EAkBD,WAAA,CACC,QAAA,EACQ,kBAAA,GAAqD,EAAC,EAC9D,OAAA,GAA+B,EAAC,EAChC,MAAA,GAAiB,IAAI,UAAA,EAAW,EAC/B;AAHO,IAAA,IAAA,CAAA,kBAAA,GAAA,kBAAA;AAIR,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA,YAAoB,GAAA,GACjC,QAAA,GACA,mBAAmB,QAAiD,CAAA;AACvE,IAAA,IAAA,CAAK,oBAAA,GAAuB,OAAA,CAAQ,oBAAA,IAAwB,EAAC;AAC7D,IAAA,IAAA,CAAK,oBAAA,GAAuB,OAAA,CAAQ,oBAAA,IAAwB,EAAC;AAC7D,IAAA,IAAA,CAAK,sBAAsB,OAAA,CAAQ,mBAAA;AAAA,EACpC;AAAA,EA9BQ,QAAA;AAAA,EACA,oBAAA;AAAA,EACA,oBAAA;AAAA,EACA,mBAAA;AAAA,EACA,MAAA;AAAA,EA4BA,YAAY,IAAA,EAAY;AAC/B,IAAA,IAAI,EAAE,IAAA,CAAK,MAAA,YAAkB,UAAA,CAAA,EAAa;AACzC,MAAA,IAAA,CAAK,MAAA,CAAO,KAAK,gCAAgC,CAAA;AACjD,MAAA,MAAM,OAAA,GAAU,qBAAqB,IAAI,CAAA;AACzC,MAAA,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA,CAAE,OAAA,CAAQ,UAAQ,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,IAC3D;AAAA,EACD;AAAA,EAEQ,aAAA,CAAc,KAAA,EAAsB,QAAA,GAAW,EAAA,EAAmB;AACzE,IAAA,MAAM,aAA0B,EAAC;AACjC,IAAA,MAAM,aAA0B,EAAC;AAEjC,IAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,KAAA,CAAM,MAAM,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AAEvD,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC/B,MAAA,MAAM,cAAA,GAAiB,CAAA,EAAG,QAAQ,CAAA,EAAG,KAAK,EAAE,CAAA,CAAA;AAC5C,MAAA,MAAM,WAAA,GAAc,eAAe,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAA,CAAE,OAAA,CAAQ,OAAO,EAAE,CAAA;AAEvE,MAAA,MAAM,uBAAA,GAA0B,IAAA,CAAK,oBAAA,CAAqB,QAAA,CAAS,KAAK,IAAI,CAAA;AAC5E,MAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,IAAA,IAAQ,YAAA,IAAgB,IAAA,CAAK,IAAA;AACxD,MAAA,MAAM,WAAA,GAAc,KAAK,KAAA,CAAM,IAAA,CAAK,UAAU,IAAA,CAAK,IAAA,IAAQ,EAAE,CAAC,CAAA;AAE9D,MAAA,IAAI,YAAY,MAAA,EAAQ;AACvB,QAAA,MAAM,SAAS,WAAA,CAAY,MAAA;AAC3B,QAAA,KAAA,MAAW,CAAC,WAAA,EAAa,iBAAiB,KAAK,MAAA,CAAO,OAAA,CAAQ,MAAM,CAAA,EAAG;AACtE,UAAA,MAAM,cAAc,KAAA,CAAM,OAAA,CAAQ,iBAAiB,CAAA,GAAI,iBAAA,GAAoB,CAAC,iBAAiB,CAAA;AAC7F,UAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,GAAA,CAAI,CAAC,UAAA,KAAe;AACtD,YAAA,IAAI,YAAA,CAAa,IAAI,UAAU,CAAA;AAC9B,cAAA,OAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,UAAU,CAAA,CAAA;AAChC,YAAA,OAAO,UAAA;AAAA,UACR,CAAC,CAAA;AACD,UAAA,MAAA,CAAO,WAAW,IAAI,KAAA,CAAM,OAAA,CAAQ,iBAAiB,CAAA,GAAI,cAAA,GAAiB,eAAe,CAAC,CAAA;AAAA,QAC3F;AAAA,MACD;AAEA,MAAA,IAAI,uBAAA,EAAyB;AAC5B,QAAA,IAAI,CAAC,IAAA,CAAK,mBAAA;AACT,UAAA,MAAM,IAAI,MAAM,0FAA0F,CAAA;AAE3G,QAAA,MAAM,kBAAkB,IAAA,CAAK,IAAA;AAC7B,QAAA,MAAM,gBAAgB,eAAA,CAAgB,UAAA;AACtC,QAAA,MAAM,QAAA,GAAsC,IAAA,CAAK,mBAAA,CAAoB,QAAA,CAAS,aAAa,CAAA;AAC3F,QAAA,IAAI,CAAC,QAAA;AACJ,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,qBAAA,EAAwB,aAAa,CAAA,uBAAA,CAAyB,CAAA;AAE/E,QAAA,UAAA,CAAW,IAAA,CAAK;AAAA,UACf,EAAA,EAAI,cAAA;AAAA,UACJ,IAAA,EAAM,qCAAA;AAAA,UACN,MAAM,EAAE,GAAG,WAAA,EAAa,UAAA,EAAY,KAAK,EAAA;AAAG,SAC5C,CAAA;AAED,QAAA,MAAM,aAAA,GAAgB,GAAG,WAAW,CAAA,aAAA,CAAA;AACpC,QAAA,MAAM,cAAA,GAAiB,GAAG,WAAW,CAAA,cAAA,CAAA;AACrC,QAAA,UAAA,CAAW,IAAA,CAAK;AAAA,UACf,EAAA,EAAI,aAAA;AAAA,UACJ,IAAA,EAAM,2BAAA;AAAA,UACN,IAAA,EAAM,EAAE,GAAI,eAAA,CAAgB,UAAU,EAAC,EAAI,UAAA,EAAY,IAAA,CAAK,EAAA;AAAG,SAC/D,CAAA;AACD,QAAA,UAAA,CAAW,IAAA,CAAK;AAAA,UACf,EAAA,EAAI,cAAA;AAAA,UACJ,IAAA,EAAM,4BAAA;AAAA,UACN,IAAA,EAAM,EAAE,GAAI,eAAA,CAAgB,WAAW,EAAC,EAAI,UAAA,EAAY,IAAA,CAAK,EAAA;AAAG,SAChE,CAAA;AAED,QAAA,MAAM,kBAAkB,IAAA,CAAK,aAAA,CAAc,QAAA,EAAU,CAAA,EAAG,cAAc,CAAA,CAAA,CAAG,CAAA;AACzE,QAAA,MAAM,qBAAA,GAAwB,eAAA,CAAgB,KAAA,CAAM,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,UAC7D,GAAG,CAAA;AAAA,UACH,IAAA,EAAM,EAAE,GAAI,CAAA,CAAE,QAAQ,EAAC,EAAI,eAAe,IAAA;AAAK,SAChD,CAAE,CAAA;AACF,QAAA,UAAA,CAAW,IAAA,CAAK,GAAG,qBAAqB,CAAA;AACxC,QAAA,UAAA,CAAW,IAAA,CAAK,GAAG,eAAA,CAAgB,KAAK,CAAA;AAExC,QAAA,UAAA,CAAW,KAAK,EAAE,MAAA,EAAQ,cAAA,EAAgB,MAAA,EAAQ,eAAe,CAAA;AAEjE,QAAA,MAAM,mBAAmB,eAAA,CAAgB,KAAA,CAAM,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAA,CAAE,MAAA,CAAO,CAAA,EAAA,KAAM,CAAC,gBAAgB,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,MAAA,KAAW,EAAE,CAAC,CAAA;AAC5H,QAAA,KAAA,MAAW,OAAA,IAAW,gBAAA;AACrB,UAAA,UAAA,CAAW,KAAK,EAAE,MAAA,EAAQ,aAAA,EAAe,MAAA,EAAQ,SAAS,CAAA;AAE3D,QAAA,MAAM,sBAAsB,eAAA,CAAgB,KAAA,CAAM,IAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAA,CAAE,MAAA,CAAO,CAAA,EAAA,KAAM,CAAC,gBAAgB,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,MAAA,KAAW,EAAE,CAAC,CAAA;AAC/H,QAAA,KAAA,MAAW,UAAA,IAAc,mBAAA;AACxB,UAAA,UAAA,CAAW,KAAK,EAAE,MAAA,EAAQ,UAAA,EAAY,MAAA,EAAQ,gBAAgB,CAAA;AAAA,MAChE,WACS,aAAA,EAAe;AACvB,QAAA,MAAM,IAAI,MAAM,CAAA,cAAA,EAAiB,IAAA,CAAK,EAAE,CAAA,mCAAA,EAAsC,IAAA,CAAK,IAAI,CAAA,mCAAA,CAAqC,CAAA;AAAA,MAC7H,CAAA,MACK;AACJ,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,GAAG,IAAA,EAAM,IAAI,cAAA,EAAgB,IAAA,EAAM,EAAE,GAAG,WAAA,EAAa,UAAA,EAAY,IAAA,CAAK,EAAA,IAAM,CAAA;AAAA,MAC/F;AAAA,IACD;AAGA,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC/B,MAAA,MAAM,UAAA,GAAa,MAAM,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AAC7D,MAAA,MAAM,gBAAA,GAAmB,CAAA,EAAG,QAAQ,CAAA,EAAG,KAAK,MAAM,CAAA,CAAA;AAClD,MAAA,MAAM,gBAAA,GAAmB,CAAA,EAAG,QAAQ,CAAA,EAAG,KAAK,MAAM,CAAA,CAAA;AAElD,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,oBAAA,CAAqB,QAAA,CAAS,WAAW,IAAI,CAAA;AACtE,MAAA,MAAM,iBAAA,GAAoB,iBAAiB,OAAA,CAAQ,IAAA,EAAM,GAAG,CAAA,CAAE,OAAA,CAAQ,OAAO,EAAE,CAAA;AAE/E,MAAA,IAAI,WAAA;AACH,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,GAAG,IAAA,EAAM,MAAA,EAAQ,GAAG,iBAAiB,CAAA,cAAA,CAAA,EAAkB,MAAA,EAAQ,gBAAA,EAAkB,CAAA;AAAA;AAEnG,QAAA,UAAA,CAAW,IAAA,CAAK,EAAE,GAAG,IAAA,EAAM,QAAQ,gBAAA,EAAkB,MAAA,EAAQ,kBAAkB,CAAA;AAAA,IACjF;AACA,IAAA,OAAO,EAAE,KAAA,EAAO,UAAA,EAAY,KAAA,EAAO,UAAA,EAAW;AAAA,EAC/C;AAAA,EAUO,KAAA,CAAM,OAAqD,GAAA,EAA4B;AAC7F,IAAA,MAAM,EAAE,SAAA,EAAU,GAAI,IAAA,CAAK,eAAe,KAAsB,CAAA;AAChE,IAAA,MAAM,WAAW,IAAI,iBAAA,CAAkB,WAAW,IAAA,CAAK,QAAA,EAAU,KAAK,kBAAkB,CAAA;AAExF,IAAA,IAAI,GAAA;AACH,MAAA,IAAA,CAAK,WAAA,CAAY,SAAS,IAAI,CAAA;AAE/B,IAAA,OAAO;AAAA,MACN,MAAM,QAAA,CAAS,IAAA;AAAA,MACf,SAAS,QAAA,CAAS,OAAA;AAAA,MAClB,qBAAqB,IAAI,GAAA,CAAI,OAAO,OAAA,CAAQ,SAAA,CAAU,mBAAmB,CAAC,CAAA;AAAA,MAC1E,kBAAkB,IAAI,GAAA,CAAI,OAAO,OAAA,CAAQ,SAAA,CAAU,wBAAwB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,GAAG,CAAC,CAAA,KAAM,CAAC,CAAA,EAAG,CAAC,CAAC,CAAC,CAAA;AAAA,MACpG,0BAA0B,IAAI,GAAA,CAAI,OAAO,OAAA,CAAQ,SAAA,CAAU,wBAAwB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,GAAG,CAAC,CAAA,KAAM,CAAC,CAAA,EAAG,CAAC,CAAC,CAAC;AAAA,KAC7G;AAAA,EACD;AAAA;AAAA,EAaO,eAAe,KAAA,EAA2E;AAChG,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,aAAA,CAAc,KAAsB,CAAA;AAE3D,IAAA,MAAM,gBAAA,GAAmB,SAAA,CAAU,KAAA,CAAM,MAAA,CAAO,CAAA,CAAA,KAAK,KAAK,oBAAA,CAAqB,QAAA,CAAS,CAAA,CAAE,IAAI,CAAC,CAAA;AAC/F,IAAA,KAAA,MAAW,mBAAmB,gBAAA,EAAkB;AAC/C,MAAA,MAAM,QAAA,GAAW,SAAA,CAAU,KAAA,CACzB,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,KAAW,eAAA,CAAgB,EAAE,CAAA,CAC3C,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,MAAM,CAAA;AAEnB,MAAA,IAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AACxB,QAAA,MAAM,mBAAA,GAAsB,IAAA,CAAK,2BAAA,CAA4B,QAAA,EAAU,SAAS,CAAA;AAChF,QAAA,IAAI,mBAAA,EAAqB;AACxB,UAAA,MAAM,UAAA,GAAa,CAAA,EAAG,eAAA,CAAgB,EAAE,CAAA,kBAAA,CAAA;AACxC,UAAA,IAAI,CAAC,UAAU,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,EAAA,KAAO,UAAU,CAAA,EAAG;AACpD,YAAA,IAAA,CAAK,OAAO,KAAA,CAAM,CAAA,oDAAA,EAAuD,gBAAgB,EAAE,CAAA,iBAAA,EAAoB,mBAAmB,CAAA,CAAA,CAAG,CAAA;AACrI,YAAA,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,UAAA,EAAY,MAAM,+BAAA,EAAiC,IAAA,EAAM,EAAC,EAAG,CAAA;AACxF,YAAA,MAAM,iBAAA,GAAoB,IAAA,CAAK,oBAAA,CAAqB,QAAA,EAAU,qBAAqB,SAAS,CAAA;AAC5F,YAAA,MAAM,kBAAA,GAAqB,IAAI,GAAA,CAAI,iBAAiB,CAAA;AACpD,YAAA,IAAI,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,KAAW,eAAA,CAAgB,EAAA,IAAM,CAAA,CAAE,MAAA,KAAW,mBAAmB,CAAA,EAAG;AACnG,cAAA,kBAAA,CAAmB,GAAA,CAAI,gBAAgB,EAAE,CAAA;AAAA,YAC1C;AACA,YAAA,KAAA,MAAW,cAAc,kBAAA,EAAoB;AAC5C,cAAA,MAAM,aAAA,GAAgB,SAAA,CAAU,KAAA,CAAM,MAAA,CAAO,CAAA,CAAA,KAAK,EAAE,MAAA,KAAW,UAAA,IAAc,CAAA,CAAE,MAAA,KAAW,mBAAmB,CAAA;AAC7G,cAAA,KAAA,MAAW,QAAQ,aAAA,EAAe;AACjC,gBAAA,IAAA,CAAK,MAAA,GAAS,UAAA;AAAA,cACf;AAAA,YACD;AACA,YAAA,SAAA,CAAU,MAAM,IAAA,CAAK,EAAE,QAAQ,UAAA,EAAY,MAAA,EAAQ,qBAAqB,CAAA;AAAA,UACzE;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAEA,IAAA,MAAM,aAAa,SAAA,CAAU,KAAA,CAAM,MAAA,CAAO,CAAC,KAAK,IAAA,KAAS;AACxD,MAAA,IAAI,CAAC,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACvB,QAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAA,kBAAQ,IAAI,KAAK,CAAA;AAC/B,MAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACzC,MAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,cAAA;AAC9B,MAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA;AAC5B,QAAA,aAAA,CAAc,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA;AAC7B,MAAA,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAC3C,MAAA,OAAO,GAAA;AAAA,IACR,CAAA,kBAAG,IAAI,GAAA,EAAiC,CAAA;AAExC,IAAA,MAAM,cAAA,GAAiB,CAAC,GAAG,SAAA,CAAU,KAAK,CAAA;AAC1C,IAAA,KAAA,MAAW,cAAc,cAAA,EAAgB;AACxC,MAAA,MAAM,OAAA,GAAU,UAAA,CAAW,GAAA,CAAI,UAAA,CAAW,EAAE,CAAA;AAC5C,MAAA,IAAI,CAAC,OAAA;AACJ,QAAA;AAED,MAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,UAAU,CAAA,IAAK,OAAA,CAAQ,SAAQ,EAAG;AACrD,QAAA,IAAI,UAAA,CAAW,SAAS,CAAA,IAAK,CAAC,KAAK,oBAAA,CAAqB,QAAA,CAAS,UAAA,CAAW,IAAI,CAAA,EAAG;AAClF,UAAA,MAAM,cAAA,GAAiB,CAAA,EAAG,UAAA,CAAW,EAAE,CAAA,oBAAA,CAAA;AACvC,UAAA,IAAI,CAAC,UAAU,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,EAAA,KAAO,cAAc,CAAA,EAAG;AACxD,YAAA,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,cAAA,EAAgB,MAAM,iCAAA,EAAmC,IAAA,EAAM,EAAC,EAAG,CAAA;AAC9F,YAAA,MAAM,cAAA,GAAiB,SAAA,CAAU,KAAA,CAAM,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,KAAW,UAAA,CAAW,EAAA,IAAA,CAAO,CAAA,CAAE,MAAA,IAAU,cAAA,MAAoB,MAAM,CAAA;AACxH,YAAA,SAAA,CAAU,KAAA,GAAQ,UAAU,KAAA,CAAM,MAAA,CAAO,OAAK,CAAC,cAAA,CAAe,QAAA,CAAS,CAAC,CAAC,CAAA;AACzE,YAAA,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,WAAW,EAAA,EAAI,MAAA,EAAQ,cAAA,EAAgB,MAAA,EAAQ,WAAW,cAAA,GAAiB,MAAA,GAAY,MAAA,CAAO,MAAM,GAAG,CAAA;AACtI,YAAA,UAAA,CAAW,OAAA,CAAQ,CAAA,MAAA,KAAU,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,cAAA,EAAgB,MAAA,EAAQ,MAAA,EAAQ,CAAC,CAAA;AAAA,UAC9F;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAEA,IAAA,MAAM,EAAE,gBAAA,EAAkB,wBAAA,EAAyB,GAAI,IAAA,CAAK,yBAAyB,SAAS,CAAA;AAC9F,IAAA,MAAM,mBAAA,uBAA0B,GAAA,EAAoB;AACpD,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,GAAG,CAAA,IAAK,gBAAA,CAAiB,SAAQ,EAAG;AACpD,MAAA,mBAAA,CAAoB,GAAA,CAAI,GAAA,EAAK,GAAA,CAAI,MAAM,CAAA;AAAA,IACxC;AAEA,IAAA,MAAM,UAAA,GAAa,IAAI,GAAA,CAAI,SAAA,CAAU,MAAM,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,EAAE,CAAC,CAAA;AACzD,IAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC5B,MAAA,IAAI,CAAC,mBAAA,CAAoB,GAAA,CAAI,EAAE,CAAA;AAC9B,QAAA,mBAAA,CAAoB,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,IAC/B;AAEA,IAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,SAAA,CAAU,MAAM,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,MAAM,CAAC,CAAA;AAC/D,IAAA,MAAM,YAAA,GAAe,CAAC,GAAG,UAAU,CAAA,CAAE,MAAA,CAAO,CAAA,EAAA,KAAM,CAAC,YAAA,CAAa,GAAA,CAAI,EAAE,CAAC,CAAA;AACvE,IAAA,IAAI,WAAA;AAEJ,IAAA,IAAI,YAAA,CAAa,MAAA,KAAW,CAAA,IAAK,UAAA,CAAW,IAAA,GAAO,CAAA;AAClD,MAAA,MAAM,IAAI,MAAM,+DAA+D,CAAA;AAEhF,IAAA,IAAI,YAAA,CAAa,WAAW,CAAA,EAAG;AAC9B,MAAA,WAAA,GAAc,aAAa,CAAC,CAAA;AAAA,IAC7B,CAAA,MACK;AACJ,MAAA,WAAA,GAAc,uBAAA;AACd,MAAA,IAAI,CAAC,UAAU,KAAA,CAAM,IAAA,CAAK,OAAK,CAAA,CAAE,EAAA,KAAO,WAAW,CAAA,EAAG;AACrD,QAAA,SAAA,CAAU,KAAA,CAAM,IAAA,CAAK,EAAE,EAAA,EAAI,WAAA,EAAa,MAAM,iCAAA,EAAmC,IAAA,EAAM,EAAC,EAAG,CAAA;AAC3F,QAAA,KAAA,MAAW,EAAA,IAAM,YAAA;AAChB,UAAA,SAAA,CAAU,MAAM,IAAA,CAAK,EAAE,QAAQ,WAAA,EAAa,MAAA,EAAQ,IAAI,CAAA;AAAA,MAC1D;AAAA,IACD;AAEA,IAAA,MAAM,SAAA,GAA+B;AAAA,MACpC,OAAO,SAAA,CAAU,KAAA;AAAA,MACjB,OAAO,SAAA,CAAU,KAAA;AAAA,MACjB,WAAA;AAAA,MACA,mBAAA,EAAqB,MAAA,CAAO,WAAA,CAAY,mBAAA,CAAoB,SAAS,CAAA;AAAA,MACrE,wBAAA,EAA0B,MAAA,CAAO,WAAA,CAAY,wBAAA,CAAyB,SAAS;AAAA,KAChF;AAEA,IAAA,OAAO,EAAE,SAAA,EAAU;AAAA,EACpB;AAAA,EAEQ,yBACP,KAAA,EAC6F;AAC7F,IAAA,MAAM,gBAAA,uBAAyC,GAAA,EAAI;AACnD,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,KAAA,EAAO;AAC/B,MAAA,IAAI,CAAC,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA;AACpC,QAAA,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAA;AACrC,MAAA,gBAAA,CAAiB,IAAI,IAAA,CAAK,MAAM,CAAA,CAAG,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IACpD;AAEA,IAAA,MAAM,wBAAA,uBAAyD,GAAA,EAAI;AACnE,IAAA,MAAM,WAAA,GAAc,IAAI,GAAA,CAAI,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,CAAA,CAAA,KAAK,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAC3D,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAsB;AAEvC,IAAA,MAAM,qBAAA,GAAwB,CAAC,MAAA,KAA6B;AAC3D,MAAA,IAAI,IAAA,CAAK,IAAI,MAAM,CAAA;AAClB,QAAA,OAAO,IAAA,CAAK,IAAI,MAAM,CAAA;AAEvB,MAAA,MAAM,QAAA,GAAW,WAAA,CAAY,GAAA,CAAI,MAAM,CAAA;AACvC,MAAA,IAAI,CAAC,QAAA;AACJ,QAAA,OAAO,EAAC;AAET,MAAA,MAAM,WAAW,QAAA,CAAS,IAAA;AAC1B,MAAA,MAAM,cAAA,GAAiB,QAAA,CAAS,IAAA,EAAM,UAAA,IAAc,MAAA;AAGpD,MAAA,IAAI,CAAC,QAAA,CAAS,UAAA,CAAW,aAAa,CAAA,EAAG;AACxC,QAAA,MAAMA,OAAAA,GAAS,CAAC,cAAc,CAAA;AAC9B,QAAA,IAAA,CAAK,GAAA,CAAI,QAAQA,OAAM,CAAA;AACvB,QAAA,OAAOA,OAAAA;AAAA,MACR;AAIA,MAAA,IAAI,aAAa,4BAAA,EAA8B;AAE9C,QAAA,MAAMA,OAAAA,GAAS,CAAC,cAAc,CAAA;AAC9B,QAAA,IAAA,CAAK,GAAA,CAAI,QAAQA,OAAM,CAAA;AACvB,QAAA,OAAOA,OAAAA;AAAA,MACR;AAIA,MAAA,MAAM,kBAAA,GAAqB,gBAAA,CAAiB,GAAA,CAAI,MAAM,KAAK,EAAC;AAC5D,MAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,MAAA,KAAA,MAAW,UAAU,kBAAA,EAAoB;AACxC,QAAA,qBAAA,CAAsB,MAAM,CAAA,CAAE,OAAA,CAAQ,OAAK,SAAA,CAAU,GAAA,CAAI,CAAC,CAAC,CAAA;AAAA,MAC5D;AAEA,MAAA,MAAM,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,SAAS,CAAA;AACnC,MAAA,IAAA,CAAK,GAAA,CAAI,QAAQ,MAAM,CAAA;AACvB,MAAA,OAAO,MAAA;AAAA,IACR,CAAA;AAEA,IAAA,KAAA,MAAW,QAAA,IAAY,WAAA,CAAY,IAAA,EAAK,EAAG;AAC1C,MAAA,MAAM,MAAA,GAAS,QAAA;AAEf,MAAA,MAAM,kBAAA,GAAqB,gBAAA,CAAiB,GAAA,CAAI,QAAQ,KAAK,EAAC;AAC9D,MAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,MAAA,KAAA,MAAW,MAAA,IAAU,kBAAA;AACpB,QAAA,qBAAA,CAAsB,MAAM,CAAA,CAAE,OAAA,CAAQ,OAAK,SAAA,CAAU,GAAA,CAAI,CAAC,CAAC,CAAA;AAE5D,MAAA,IAAI,UAAU,IAAA,GAAO,CAAA;AACpB,QAAA,wBAAA,CAAyB,GAAA,CAAI,MAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,SAAS,CAAC,CAAA;AAAA,IAC5D;AAEA,IAAA,OAAO,EAAE,kBAAkB,wBAAA,EAAyB;AAAA,EACrD;AAAA,EAEQ,oBAAA,CAAqB,YAAA,EAAwB,QAAA,EAAkB,KAAA,EAAgC;AACtG,IAAA,MAAM,YAAsB,EAAC;AAC7B,IAAA,KAAA,MAAW,SAAS,YAAA,EAAc;AACjC,MAAA,MAAM,KAAA,GAAkB,CAAC,KAAK,CAAA;AAC9B,MAAA,MAAM,eAAA,uBAAsB,GAAA,EAAY;AAExC,MAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,QAAA,MAAM,SAAA,GAAY,MAAM,KAAA,EAAM;AAC9B,QAAA,IAAI,eAAA,CAAgB,IAAI,SAAS,CAAA;AAChC,UAAA;AACD,QAAA,eAAA,CAAgB,IAAI,SAAS,CAAA;AAE7B,QAAA,MAAM,UAAA,GAAa,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,KAAW,SAAS,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,MAAM,CAAA;AAEpF,QAAA,IAAI,UAAA,CAAW,QAAA,CAAS,QAAQ,CAAA,EAAG;AAClC,UAAA,IAAI,CAAC,SAAA,CAAU,QAAA,CAAS,SAAS,CAAA,EAAG;AACnC,YAAA,SAAA,CAAU,KAAK,SAAS,CAAA;AAAA,UACzB;AAAA,QACD,CAAA,MACK;AACJ,UAAA,KAAA,MAAW,eAAe,UAAA,EAAY;AACrC,YAAA,IAAI,CAAC,eAAA,CAAgB,GAAA,CAAI,WAAW,CAAA,EAAG;AACtC,cAAA,KAAA,CAAM,KAAK,WAAW,CAAA;AAAA,YACvB;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA,IAAA,OAAO,SAAA;AAAA,EACR;AAAA,EAEQ,2BAAA,CAA4B,cAAwB,KAAA,EAA0C;AACrG,IAAA,IAAI,aAAa,MAAA,IAAU,CAAA;AAC1B,MAAA,OAAO,MAAA;AAER,IAAA,MAAM,KAAA,GAAkB,CAAC,GAAG,YAAY,CAAA;AAExC,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAyB;AAC/C,IAAA,YAAA,CAAa,OAAA,CAAQ,CAAA,OAAA,KAAW,SAAA,CAAU,GAAA,CAAI,OAAA,kBAAS,IAAI,GAAA,CAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AAE1E,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,OAAO,IAAA,GAAO,MAAM,MAAA,EAAQ;AAC3B,MAAA,MAAM,SAAA,GAAY,MAAM,IAAA,EAAM,CAAA;AAC9B,MAAA,MAAM,UAAA,GAAa,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,MAAA,KAAW,SAAS,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,MAAM,CAAA;AAEpF,MAAA,KAAA,MAAW,eAAe,UAAA,EAAY;AACrC,QAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,WAAW,CAAA;AAC7B,UAAA,SAAA,CAAU,GAAA,CAAI,WAAA,kBAAa,IAAI,GAAA,EAAK,CAAA;AAErC,QAAA,MAAM,UAAA,GAAa,SAAA,CAAU,GAAA,CAAI,WAAW,CAAA;AAC5C,QAAA,MAAM,6BAAA,GAAgC,SAAA,CAAU,GAAA,CAAI,SAAS,CAAA;AAE7D,QAAA,KAAA,MAAW,WAAA,IAAe,6BAAA;AACzB,UAAA,UAAA,CAAW,IAAI,WAAW,CAAA;AAG3B,QAAA,IAAI,UAAA,CAAW,SAAS,YAAA,CAAa,MAAA;AACpC,UAAA,OAAO,WAAA;AAER,QAAA,IAAI,CAAC,KAAA,CAAM,QAAA,CAAS,WAAW,CAAA;AAC9B,UAAA,KAAA,CAAM,KAAK,WAAW,CAAA;AAAA,MACxB;AAAA,IACD;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AACD;;;ACvdO,IAAM,oBAAN,MAA6C;AAAA,EAKnD,WAAA,CACS,SAAA,EACR,QAAA,EACQ,kBAAA,GAA0C,EAAC,EAClD;AAHO,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAEA,IAAA,IAAA,CAAA,kBAAA,GAAA,kBAAA;AAER,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA,YAAoB,GAAA,GAAM,QAAA,GAAW,mBAAmB,QAAQ,CAAA;AAChF,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA,CAAK,cAAA,CAAe,SAAA,CAAU,KAAK,CAAA;AAClD,IAAA,IAAA,CAAK,UAAA,EAAW;AAChB,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,UAAU,WAAW,CAAA;AACxD,IAAA,IAAI,CAAC,SAAA;AACJ,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,SAAA,CAAU,WAAW,CAAA,iCAAA,CAAmC,CAAA;AAE1G,IAAA,IAAA,CAAK,IAAA,GAAO,IAAI,IAAA,CAAK,SAAS,CAAA;AAC9B,IAAA,IAAA,CAAK,mBAAA,EAAoB;AAAA,EAC1B;AAAA,EAlBgB,IAAA;AAAA,EACA,OAAA;AAAA,EACC,QAAA;AAAA,EAkBT,mBAAA,GAA4B;AACnC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO,EAAG;AACzC,MAAA,IAAI,IAAA,YAAgB,uBAAA;AACnB,QAAA,IAAA,CAAK,UAAA,GAAa,MAAM,IAAA,CAAK,IAAA,CAAK,WAAW,MAAA,EAAQ,EAAE,IAAA,EAAK;AAAA,IAC9D;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQO,QAAQ,MAAA,EAA0C;AACxD,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eAAe,KAAA,EAA+C;AACrE,IAAA,MAAM,OAAA,uBAAc,GAAA,EAA0B;AAC9C,IAAA,KAAA,MAAW,aAAa,KAAA,EAAO;AAC9B,MAAA,MAAM,SAAA,GAAY,IAAA,CAAK,QAAA,CAAS,GAAA,CAAI,UAAU,IAAI,CAAA;AAClD,MAAA,IAAI,CAAC,SAAA;AACJ,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,SAAA,CAAU,IAAI,CAAA,wBAAA,CAA0B,CAAA;AAE1F,MAAA,MAAM,WAAA,GAAc;AAAA,QACnB,GAAG,IAAA,CAAK,kBAAA;AAAA,QACR,MAAM,EAAE,GAAG,UAAU,IAAA,EAAM,MAAA,EAAQ,UAAU,EAAA;AAAG,OACjD;AACA,MAAA,MAAM,cAAA,GAAiB,IAAI,SAAA,CAAU,WAAW,CAAA,CAAE,OAAO,SAAA,CAAU,EAAE,CAAA,CAAE,aAAA,CAAc,SAAS,CAAA;AAC9F,MAAA,OAAA,CAAQ,GAAA,CAAI,SAAA,CAAU,EAAA,EAAI,cAAc,CAAA;AAAA,IACzC;AACA,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,UAAA,GAAmB;AAC1B,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAsC;AAC7D,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO;AACxC,MAAA,MAAM,WAAW,IAAA,CAAK,MAAA;AACtB,MAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,cAAA;AAC9B,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,KAAK,MAAM,CAAA;AAC/C,MAAA,IAAI,CAAC,UAAA;AACJ,QAAA;AAED,MAAA,IAAI,CAAC,UAAA,CAAW,GAAA,CAAI,QAAQ,CAAA;AAC3B,QAAA,UAAA,CAAW,GAAA,CAAI,QAAA,kBAAU,IAAI,GAAA,EAAK,CAAA;AACnC,MAAA,MAAM,aAAA,GAAgB,UAAA,CAAW,GAAA,CAAI,QAAQ,CAAA;AAC7C,MAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA;AAC5B,QAAA,aAAA,CAAc,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA;AAC7B,MAAA,aAAA,CAAc,GAAA,CAAI,MAAM,CAAA,CAAG,IAAA,CAAK,UAAU,CAAA;AAAA,IAC3C;AAEA,IAAA,KAAA,MAAW,CAAC,QAAA,EAAU,OAAO,CAAA,IAAK,UAAA,CAAW,SAAQ,EAAG;AACvD,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,QAAQ,CAAA;AAC5C,MAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,UAAU,CAAA,IAAK,OAAA,CAAQ,SAAQ,EAAG;AACrD,QAAA,KAAA,MAAW,SAAA,IAAa,UAAA;AACvB,UAAA,UAAA,CAAW,IAAA,CAAK,WAAW,MAAM,CAAA;AAAA,MACnC;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAa,GAAA,CAAO,IAAA,EAAoB,OAAA,EAAkB,OAAA,EAAkC;AAC3F,IAAA,IAAI,IAAA,KAAS,KAAK,IAAA,EAAM;AACvB,MAAA,MAAM,IAAI,KAAA;AAAA,QACT;AAAA,OAED;AAAA,IACD;AAEA,IAAA,MAAM,gBAAA,GAAmB,IAAI,gBAAA,EAAiB;AAC9C,IAAA,MAAM,YAAA,GAAe,EAAE,GAAG,OAAA,EAAS,UAAU,IAAA,EAAK;AAClD,IAAA,OAAO,gBAAA,CAAiB,GAAA,CAAI,IAAA,CAAK,IAAA,EAAM,SAAS,YAAY,CAAA;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,WAAA,CAAY,MAAoB,MAAA,EAAuC;AAG7E,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI,CAAC,CAAA;AAAA,EACvC;AACD","file":"chunk-3YMBNZ77.js","sourcesContent":["import type { Logger } from '../../logger'\nimport type { AbstractNode, Flow } from '../../workflow/index'\nimport type {\n\tBlueprintBuildResult,\n\tBuildResult,\n\tGraphBuilderOptions,\n\tGraphEdge,\n\tGraphNode,\n\tNodeRegistry,\n\tNodeTypeMap,\n\tOriginalPredecessorIdMap,\n\tPredecessorIdMap,\n\tSubWorkflowResolver,\n\tTypedNodeRegistry,\n\tTypedWorkflowGraph,\n\tWorkflowBlueprint,\n\tWorkflowGraph,\n} from './types'\nimport { NullLogger } from '../../logger'\nimport { DEFAULT_ACTION } from '../../types'\nimport { generateMermaidGraph } from '../../utils/mermaid'\nimport {\n\tConditionalJoinNode,\n\tInputMappingNode,\n\tOutputMappingNode,\n\tParallelBranchContainer,\n\tSubWorkflowContainerNode,\n} from './internal-nodes'\nimport { BlueprintExecutor } from './runner'\n\n/**\n * A smart factory that takes an object of custom node classes and returns a fully\n * prepared `NodeRegistry` map with all internal nodes required by the GraphBuilder.\n *\n * @param registry An object where keys are node type strings and values are the corresponding Node constructors.\n * @returns A `Map` instance ready to be used by the `GraphBuilder` or a custom executor.\n */\nexport function createNodeRegistry<\n\tTNodeMap extends NodeTypeMap,\n\tTContext = object,\n>(registry: TypedNodeRegistry<TNodeMap, TContext>): NodeRegistry {\n\tconst finalRegistry: NodeRegistry = new Map()\n\n\tfor (const key in registry) {\n\t\tif (Object.prototype.hasOwnProperty.call(registry, key))\n\t\t\tfinalRegistry.set(key, registry[key])\n\t}\n\n\tif (!finalRegistry.has('__internal_input_mapper__'))\n\t\tfinalRegistry.set('__internal_input_mapper__', InputMappingNode as any)\n\tif (!finalRegistry.has('__internal_output_mapper__'))\n\t\tfinalRegistry.set('__internal_output_mapper__', OutputMappingNode as any)\n\tif (!finalRegistry.has('__internal_sub_workflow_container__'))\n\t\tfinalRegistry.set('__internal_sub_workflow_container__', SubWorkflowContainerNode as any)\n\tif (!finalRegistry.has('__internal_conditional_join__'))\n\t\tfinalRegistry.set('__internal_conditional_join__', ConditionalJoinNode as any)\n\tif (!finalRegistry.has('__internal_parallel_container__'))\n\t\tfinalRegistry.set('__internal_parallel_container__', ParallelBranchContainer as any)\n\n\treturn finalRegistry\n}\n\n/**\n * Constructs a serializable `WorkflowBlueprint` from a declarative `WorkflowGraph` definition.\n * The blueprint is a static, storable artifact that can be executed by a `BlueprintExecutor`.\n * @template TNodeMap A `NodeTypeMap` for validating type-safe graph definitions.\n * @template TContext The shape of the dependency injection context object.\n */\nexport class GraphBuilder<\n\tTNodeMap extends NodeTypeMap,\n\tTContext extends object = object,\n> {\n\tprivate registry: Map<string, new (...args: any[]) => AbstractNode>\n\tprivate subWorkflowNodeTypes: string[]\n\tprivate conditionalNodeTypes: string[]\n\tprivate subWorkflowResolver?: SubWorkflowResolver\n\tprivate logger: Logger\n\n\t/**\n\t * @param registry A type-safe object or a `Map` where keys are node `type` strings and\n\t * values are the corresponding `Node` class constructors. For type-safety, use `createNodeRegistry`.\n\t * @param nodeOptionsContext An optional object that is passed to every node's\n\t * constructor, useful for dependency injection (e.g., passing a database client or the builder itself).\n\t */\n\t// type-safe overload\n\tconstructor(registry: TypedNodeRegistry<TNodeMap, TContext>, nodeOptionsContext?: TContext, options?: GraphBuilderOptions, logger?: Logger)\n\t// untyped overload\n\tconstructor(registry: NodeRegistry, nodeOptionsContext?: Record<string, any>, options?: GraphBuilderOptions, logger?: Logger)\n\t// handle both cases\n\tconstructor(\n\t\tregistry: TypedNodeRegistry<TNodeMap, TContext> | NodeRegistry,\n\t\tprivate nodeOptionsContext: TContext | Record<string, any> = {},\n\t\toptions: GraphBuilderOptions = {},\n\t\tlogger: Logger = new NullLogger(),\n\t) {\n\t\tthis.logger = logger\n\t\tthis.registry = registry instanceof Map\n\t\t\t? registry\n\t\t\t: createNodeRegistry(registry as TypedNodeRegistry<TNodeMap, TContext>)\n\t\tthis.subWorkflowNodeTypes = options.subWorkflowNodeTypes ?? []\n\t\tthis.conditionalNodeTypes = options.conditionalNodeTypes ?? []\n\t\tthis.subWorkflowResolver = options.subWorkflowResolver\n\t}\n\n\tprivate _logMermaid(flow: Flow) {\n\t\tif (!(this.logger instanceof NullLogger)) {\n\t\t\tthis.logger.info('[GraphBuilder] Flattened Graph')\n\t\t\tconst mermaid = generateMermaidGraph(flow)\n\t\t\tmermaid.split('\\n').forEach(line => this.logger.info(line))\n\t\t}\n\t}\n\n\tprivate _flattenGraph(graph: WorkflowGraph, idPrefix = ''): WorkflowGraph {\n\t\tconst finalNodes: GraphNode[] = []\n\t\tconst finalEdges: GraphEdge[] = []\n\n\t\tconst localNodeIds = new Set(graph.nodes.map(n => n.id))\n\n\t\tfor (const node of graph.nodes) {\n\t\t\tconst prefixedNodeId = `${idPrefix}${node.id}`\n\t\t\tconst sanitizedId = prefixedNodeId.replace(/:/g, '_').replace(/\\W/g, '')\n\n\t\t\tconst isRegisteredSubWorkflow = this.subWorkflowNodeTypes.includes(node.type)\n\t\t\tconst hasWorkflowId = node.data && 'workflowId' in node.data\n\t\t\tconst newNodeData = JSON.parse(JSON.stringify(node.data || {}))\n\n\t\t\tif (newNodeData.inputs) {\n\t\t\t\tconst inputs = newNodeData.inputs as Record<string, string | string[]>\n\t\t\t\tfor (const [templateKey, sourcePathOrPaths] of Object.entries(inputs)) {\n\t\t\t\t\tconst sourcePaths = Array.isArray(sourcePathOrPaths) ? sourcePathOrPaths : [sourcePathOrPaths]\n\t\t\t\t\tconst newSourcePaths = sourcePaths.map((sourcePath) => {\n\t\t\t\t\t\tif (localNodeIds.has(sourcePath))\n\t\t\t\t\t\t\treturn `${idPrefix}${sourcePath}`\n\t\t\t\t\t\treturn sourcePath\n\t\t\t\t\t})\n\t\t\t\t\tinputs[templateKey] = Array.isArray(sourcePathOrPaths) ? newSourcePaths : newSourcePaths[0]\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (isRegisteredSubWorkflow) {\n\t\t\t\tif (!this.subWorkflowResolver)\n\t\t\t\t\tthrow new Error('GraphBuilder: `subWorkflowResolver` must be provided in options to handle sub-workflows.')\n\n\t\t\t\tconst subWorkflowData = node.data as any\n\t\t\t\tconst subWorkflowId = subWorkflowData.workflowId\n\t\t\t\tconst subGraph: WorkflowGraph | undefined = this.subWorkflowResolver.getGraph(subWorkflowId)\n\t\t\t\tif (!subGraph)\n\t\t\t\t\tthrow new Error(`Sub-workflow with ID ${subWorkflowId} not found in resolver.`)\n\n\t\t\t\tfinalNodes.push({\n\t\t\t\t\tid: prefixedNodeId,\n\t\t\t\t\ttype: '__internal_sub_workflow_container__',\n\t\t\t\t\tdata: { ...newNodeData, originalId: node.id },\n\t\t\t\t})\n\n\t\t\t\tconst inputMapperId = `${sanitizedId}_input_mapper`\n\t\t\t\tconst outputMapperId = `${sanitizedId}_output_mapper`\n\t\t\t\tfinalNodes.push({\n\t\t\t\t\tid: inputMapperId,\n\t\t\t\t\ttype: '__internal_input_mapper__',\n\t\t\t\t\tdata: { ...(subWorkflowData.inputs || {}), originalId: node.id },\n\t\t\t\t})\n\t\t\t\tfinalNodes.push({\n\t\t\t\t\tid: outputMapperId,\n\t\t\t\t\ttype: '__internal_output_mapper__',\n\t\t\t\t\tdata: { ...(subWorkflowData.outputs || {}), originalId: node.id },\n\t\t\t\t})\n\n\t\t\t\tconst inlinedSubGraph = this._flattenGraph(subGraph, `${prefixedNodeId}:`)\n\t\t\t\tconst augmentedInlinedNodes = inlinedSubGraph.nodes.map(n => ({\n\t\t\t\t\t...n,\n\t\t\t\t\tdata: { ...(n.data || {}), isSubWorkflow: true },\n\t\t\t\t}))\n\t\t\t\tfinalNodes.push(...augmentedInlinedNodes)\n\t\t\t\tfinalEdges.push(...inlinedSubGraph.edges)\n\n\t\t\t\tfinalEdges.push({ source: prefixedNodeId, target: inputMapperId })\n\n\t\t\t\tconst subGraphStartIds = inlinedSubGraph.nodes.map(n => n.id).filter(id => !inlinedSubGraph.edges.some(e => e.target === id))\n\t\t\t\tfor (const startId of subGraphStartIds)\n\t\t\t\t\tfinalEdges.push({ source: inputMapperId, target: startId })\n\n\t\t\t\tconst subGraphTerminalIds = inlinedSubGraph.nodes.map(n => n.id).filter(id => !inlinedSubGraph.edges.some(e => e.source === id))\n\t\t\t\tfor (const terminalId of subGraphTerminalIds)\n\t\t\t\t\tfinalEdges.push({ source: terminalId, target: outputMapperId })\n\t\t\t}\n\t\t\telse if (hasWorkflowId) {\n\t\t\t\tthrow new Error(`Node with ID '${node.id}' has a 'workflowId' but its type '${node.type}' is not in 'subWorkflowNodeTypes'.`)\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfinalNodes.push({ ...node, id: prefixedNodeId, data: { ...newNodeData, originalId: node.id } })\n\t\t\t}\n\t\t}\n\n\t\t// Pass 2: Re-wire all original edges to connect to the correct nodes in the flattened graph.\n\t\tfor (const edge of graph.edges) {\n\t\t\tconst sourceNode = graph.nodes.find(n => n.id === edge.source)!\n\t\t\tconst prefixedSourceId = `${idPrefix}${edge.source}`\n\t\t\tconst prefixedTargetId = `${idPrefix}${edge.target}`\n\n\t\t\tconst isSourceSub = this.subWorkflowNodeTypes.includes(sourceNode.type)\n\t\t\tconst sanitizedSourceId = prefixedSourceId.replace(/:/g, '_').replace(/\\W/g, '')\n\n\t\t\tif (isSourceSub)\n\t\t\t\tfinalEdges.push({ ...edge, source: `${sanitizedSourceId}_output_mapper`, target: prefixedTargetId })\n\t\t\telse\n\t\t\t\tfinalEdges.push({ ...edge, source: prefixedSourceId, target: prefixedTargetId })\n\t\t}\n\t\treturn { nodes: finalNodes, edges: finalEdges }\n\t}\n\n\t/**\n\t * Builds a runnable `Flow` from a graph definition for immediate in-memory execution.\n\t * @param graph The `WorkflowGraph` object describing the flow.\n\t * @param log Whether to log the graph after flattening. Defaults to `false`.\n\t * @returns A `BuildResult` object containing the executable `flow` and a `nodeMap`.\n\t */\n\tpublic build(graph: TypedWorkflowGraph<TNodeMap>, log?: boolean): BuildResult\n\tpublic build(graph: WorkflowGraph, log?: boolean): BuildResult\n\tpublic build(graph: TypedWorkflowGraph<TNodeMap> | WorkflowGraph, log?: boolean): BuildResult {\n\t\tconst { blueprint } = this.buildBlueprint(graph as WorkflowGraph)\n\t\tconst executor = new BlueprintExecutor(blueprint, this.registry, this.nodeOptionsContext)\n\n\t\tif (log)\n\t\t\tthis._logMermaid(executor.flow)\n\n\t\treturn {\n\t\t\tflow: executor.flow,\n\t\t\tnodeMap: executor.nodeMap,\n\t\t\tpredecessorCountMap: new Map(Object.entries(blueprint.predecessorCountMap)),\n\t\t\tpredecessorIdMap: new Map(Object.entries(blueprint.originalPredecessorIdMap).map(([k, v]) => [k, v])),\n\t\t\toriginalPredecessorIdMap: new Map(Object.entries(blueprint.originalPredecessorIdMap).map(([k, v]) => [k, v])),\n\t\t}\n\t}\n\n\t/**\n\t * Builds a serializable `WorkflowBlueprint` from a graph definition.\n\t * This is the recommended method for preparing a workflow for a distributed environment.\n\t * @param graph The `WorkflowGraph` object describing the flow.\n\t * @returns A `BlueprintBuildResult` object containing the serializable `blueprint`.\n\t */\n\t// type-safe overload\n\tpublic buildBlueprint(graph: TypedWorkflowGraph<TNodeMap>): BlueprintBuildResult\n\t// untyped overload\n\tpublic buildBlueprint(graph: WorkflowGraph): BlueprintBuildResult\n\t// single implementation that handles both cases\n\tpublic buildBlueprint(graph: TypedWorkflowGraph<TNodeMap> | WorkflowGraph): BlueprintBuildResult {\n\t\tconst flatGraph = this._flattenGraph(graph as WorkflowGraph)\n\n\t\tconst conditionalNodes = flatGraph.nodes.filter(n => this.conditionalNodeTypes.includes(n.type))\n\t\tfor (const conditionalNode of conditionalNodes) {\n\t\t\tconst branches = flatGraph.edges\n\t\t\t\t.filter(e => e.source === conditionalNode.id)\n\t\t\t\t.map(e => e.target)\n\n\t\t\tif (branches.length > 1) {\n\t\t\t\tconst convergenceTargetId = this._findConditionalConvergence(branches, flatGraph)\n\t\t\t\tif (convergenceTargetId) {\n\t\t\t\t\tconst joinNodeId = `${conditionalNode.id}__conditional_join`\n\t\t\t\t\tif (!flatGraph.nodes.some(n => n.id === joinNodeId)) {\n\t\t\t\t\t\tthis.logger.debug(`[GraphBuilder] Inserting conditional join node for '${conditionalNode.id}' converging at '${convergenceTargetId}'`)\n\t\t\t\t\t\tflatGraph.nodes.push({ id: joinNodeId, type: '__internal_conditional_join__', data: {} })\n\t\t\t\t\t\tconst branchTerminalIds = this._findBranchTerminals(branches, convergenceTargetId, flatGraph)\n\t\t\t\t\t\tconst terminalsToReroute = new Set(branchTerminalIds)\n\t\t\t\t\t\tif (flatGraph.edges.some(e => e.source === conditionalNode.id && e.target === convergenceTargetId)) {\n\t\t\t\t\t\t\tterminalsToReroute.add(conditionalNode.id)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor (const terminalId of terminalsToReroute) {\n\t\t\t\t\t\t\tconst edgesToUpdate = flatGraph.edges.filter(e => e.source === terminalId && e.target === convergenceTargetId)\n\t\t\t\t\t\t\tfor (const edge of edgesToUpdate) {\n\t\t\t\t\t\t\t\tedge.target = joinNodeId\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tflatGraph.edges.push({ source: joinNodeId, target: convergenceTargetId })\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst edgeGroups = flatGraph.edges.reduce((acc, edge) => {\n\t\t\tif (!acc.has(edge.source))\n\t\t\t\tacc.set(edge.source, new Map())\n\t\t\tconst sourceActions = acc.get(edge.source)!\n\t\t\tconst action = edge.action || DEFAULT_ACTION\n\t\t\tif (!sourceActions.has(action))\n\t\t\t\tsourceActions.set(action, [])\n\t\t\tsourceActions.get(action)!.push(edge.target)\n\t\t\treturn acc\n\t\t}, new Map<string, Map<any, string[]>>())\n\n\t\tconst nodesToProcess = [...flatGraph.nodes]\n\t\tfor (const sourceNode of nodesToProcess) {\n\t\t\tconst actions = edgeGroups.get(sourceNode.id)\n\t\t\tif (!actions)\n\t\t\t\tcontinue\n\n\t\t\tfor (const [action, successors] of actions.entries()) {\n\t\t\t\tif (successors.length > 1 && !this.conditionalNodeTypes.includes(sourceNode.type)) {\n\t\t\t\t\tconst parallelNodeId = `${sourceNode.id}__parallel_container`\n\t\t\t\t\tif (!flatGraph.nodes.some(n => n.id === parallelNodeId)) {\n\t\t\t\t\t\tflatGraph.nodes.push({ id: parallelNodeId, type: '__internal_parallel_container__', data: {} })\n\t\t\t\t\t\tconst edgesToReplace = flatGraph.edges.filter(e => e.source === sourceNode.id && (e.action || DEFAULT_ACTION) === action)\n\t\t\t\t\t\tflatGraph.edges = flatGraph.edges.filter(e => !edgesToReplace.includes(e))\n\t\t\t\t\t\tflatGraph.edges.push({ source: sourceNode.id, target: parallelNodeId, action: action === DEFAULT_ACTION ? undefined : String(action) })\n\t\t\t\t\t\tsuccessors.forEach(succId => flatGraph.edges.push({ source: parallelNodeId, target: succId }))\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst { predecessorIdMap, originalPredecessorIdMap } = this._createPredecessorIdMaps(flatGraph)\n\t\tconst predecessorCountMap = new Map<string, number>()\n\t\tfor (const [key, val] of predecessorIdMap.entries()) {\n\t\t\tpredecessorCountMap.set(key, val.length)\n\t\t}\n\n\t\tconst allNodeIds = new Set(flatGraph.nodes.map(n => n.id))\n\t\tfor (const id of allNodeIds) {\n\t\t\tif (!predecessorCountMap.has(id))\n\t\t\t\tpredecessorCountMap.set(id, 0)\n\t\t}\n\n\t\tconst allTargetIds = new Set(flatGraph.edges.map(e => e.target))\n\t\tconst startNodeIds = [...allNodeIds].filter(id => !allTargetIds.has(id))\n\t\tlet startNodeId: string\n\n\t\tif (startNodeIds.length === 0 && allNodeIds.size > 0)\n\t\t\tthrow new Error('GraphBuilder: This graph has a cycle and no clear start node.')\n\n\t\tif (startNodeIds.length === 1) {\n\t\t\tstartNodeId = startNodeIds[0]\n\t\t}\n\t\telse {\n\t\t\tstartNodeId = '__root_parallel_start'\n\t\t\tif (!flatGraph.nodes.some(n => n.id === startNodeId)) {\n\t\t\t\tflatGraph.nodes.push({ id: startNodeId, type: '__internal_parallel_container__', data: {} })\n\t\t\t\tfor (const id of startNodeIds)\n\t\t\t\t\tflatGraph.edges.push({ source: startNodeId, target: id })\n\t\t\t}\n\t\t}\n\n\t\tconst blueprint: WorkflowBlueprint = {\n\t\t\tnodes: flatGraph.nodes,\n\t\t\tedges: flatGraph.edges,\n\t\t\tstartNodeId,\n\t\t\tpredecessorCountMap: Object.fromEntries(predecessorCountMap.entries()),\n\t\t\toriginalPredecessorIdMap: Object.fromEntries(originalPredecessorIdMap.entries()),\n\t\t}\n\n\t\treturn { blueprint }\n\t}\n\n\tprivate _createPredecessorIdMaps(\n\t\tgraph: WorkflowGraph,\n\t): { predecessorIdMap: PredecessorIdMap, originalPredecessorIdMap: OriginalPredecessorIdMap } {\n\t\tconst predecessorIdMap: PredecessorIdMap = new Map()\n\t\tfor (const edge of graph.edges) {\n\t\t\tif (!predecessorIdMap.has(edge.target))\n\t\t\t\tpredecessorIdMap.set(edge.target, [])\n\t\t\tpredecessorIdMap.get(edge.target)!.push(edge.source)\n\t\t}\n\n\t\tconst originalPredecessorIdMap: OriginalPredecessorIdMap = new Map()\n\t\tconst nodeDataMap = new Map(graph.nodes.map(n => [n.id, n]))\n\t\tconst memo = new Map<string, string[]>()\n\n\t\tconst findOriginalProducers = (nodeId: string): string[] => {\n\t\t\tif (memo.has(nodeId))\n\t\t\t\treturn memo.get(nodeId)!\n\n\t\t\tconst nodeData = nodeDataMap.get(nodeId)\n\t\t\tif (!nodeData)\n\t\t\t\treturn []\n\n\t\t\tconst selfType = nodeData.type\n\t\t\tconst selfOriginalId = nodeData.data?.originalId ?? nodeId\n\n\t\t\t// Base Case: User-defined nodes are always the source of data.\n\t\t\tif (!selfType.startsWith('__internal_')) {\n\t\t\t\tconst result = [selfOriginalId]\n\t\t\t\tmemo.set(nodeId, result)\n\t\t\t\treturn result\n\t\t\t}\n\n\t\t\t// Special Case: The output mapper acts as the logical source for anything\n\t\t\t// outside the sub-workflow. It represents the sub-workflow's result.\n\t\t\tif (selfType === '__internal_output_mapper__') {\n\t\t\t\t// The originalId of the output_mapper is the ID of the container.\n\t\t\t\tconst result = [selfOriginalId]\n\t\t\t\tmemo.set(nodeId, result)\n\t\t\t\treturn result\n\t\t\t}\n\n\t\t\t// Recursive Step: For all other internal nodes (input_mapper, container, join),\n\t\t\t// they are transparent wiring. Look through them.\n\t\t\tconst directPredecessors = predecessorIdMap.get(nodeId) || []\n\t\t\tconst producers = new Set<string>()\n\t\t\tfor (const predId of directPredecessors) {\n\t\t\t\tfindOriginalProducers(predId).forEach(p => producers.add(p))\n\t\t\t}\n\n\t\t\tconst result = Array.from(producers)\n\t\t\tmemo.set(nodeId, result)\n\t\t\treturn result\n\t\t}\n\n\t\tfor (const targetId of nodeDataMap.keys()) {\n\t\t\tconst mapKey = targetId\n\n\t\t\tconst directPredecessors = predecessorIdMap.get(targetId) || []\n\t\t\tconst producers = new Set<string>()\n\t\t\tfor (const predId of directPredecessors)\n\t\t\t\tfindOriginalProducers(predId).forEach(p => producers.add(p))\n\n\t\t\tif (producers.size > 0)\n\t\t\t\toriginalPredecessorIdMap.set(mapKey, Array.from(producers))\n\t\t}\n\n\t\treturn { predecessorIdMap, originalPredecessorIdMap }\n\t}\n\n\tprivate _findBranchTerminals(branchStarts: string[], targetId: string, graph: WorkflowGraph): string[] {\n\t\tconst terminals: string[] = []\n\t\tfor (const start of branchStarts) {\n\t\t\tconst queue: string[] = [start]\n\t\t\tconst visitedInBranch = new Set<string>()\n\n\t\t\twhile (queue.length > 0) {\n\t\t\t\tconst currentId = queue.shift()!\n\t\t\t\tif (visitedInBranch.has(currentId))\n\t\t\t\t\tcontinue\n\t\t\t\tvisitedInBranch.add(currentId)\n\n\t\t\t\tconst successors = graph.edges.filter(e => e.source === currentId).map(e => e.target)\n\n\t\t\t\tif (successors.includes(targetId)) {\n\t\t\t\t\tif (!terminals.includes(currentId)) {\n\t\t\t\t\t\tterminals.push(currentId)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tfor (const successorId of successors) {\n\t\t\t\t\t\tif (!visitedInBranch.has(successorId)) {\n\t\t\t\t\t\t\tqueue.push(successorId)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn terminals\n\t}\n\n\tprivate _findConditionalConvergence(branchStarts: string[], graph: WorkflowGraph): string | undefined {\n\t\tif (branchStarts.length <= 1)\n\t\t\treturn undefined\n\n\t\tconst queue: string[] = [...branchStarts]\n\t\t// Map<nodeId, Set<startNodeId>>\n\t\tconst visitedBy = new Map<string, Set<string>>()\n\t\tbranchStarts.forEach(startId => visitedBy.set(startId, new Set([startId])))\n\n\t\tlet head = 0\n\t\twhile (head < queue.length) {\n\t\t\tconst currentId = queue[head++]!\n\t\t\tconst successors = graph.edges.filter(e => e.source === currentId).map(e => e.target)\n\n\t\t\tfor (const successorId of successors) {\n\t\t\t\tif (!visitedBy.has(successorId))\n\t\t\t\t\tvisitedBy.set(successorId, new Set())\n\n\t\t\t\tconst visitorSet = visitedBy.get(successorId)!\n\t\t\t\tconst startingPointsVistingThisNode = visitedBy.get(currentId)!\n\n\t\t\t\tfor (const startNodeId of startingPointsVistingThisNode)\n\t\t\t\t\tvisitorSet.add(startNodeId)\n\n\t\t\t\t// If this node has been visited by paths originating from ALL unique branches, it's the one.\n\t\t\t\tif (visitorSet.size === branchStarts.length)\n\t\t\t\t\treturn successorId\n\n\t\t\t\tif (!queue.includes(successorId))\n\t\t\t\t\tqueue.push(successorId)\n\t\t\t}\n\t\t}\n\n\t\treturn undefined\n\t}\n}\n","import type { Context } from '../../context'\nimport type { IExecutor } from '../../executors/types'\nimport type { RunOptions } from '../../types'\nimport type { AbstractNode } from '../../workflow/index'\nimport type { GraphNode, NodeRegistry, TypedNodeRegistry, WorkflowBlueprint } from './types'\nimport { InMemoryExecutor } from '../../executors/in-memory'\nimport { DEFAULT_ACTION } from '../../types'\nimport { Flow } from '../../workflow/index'\nimport { createNodeRegistry } from './graph'\nimport { ParallelBranchContainer } from './internal-nodes'\n\n/**\n * An execution engine that hydrates a runnable `Flow` from a serializable\n * `WorkflowBlueprint` and runs it. This is the recommended executor for\n *  distributed systems where the workflow is built once and executed many times by workers.\n */\nexport class BlueprintExecutor implements IExecutor {\n\tpublic readonly flow: Flow\n\tpublic readonly nodeMap: Map<string, AbstractNode>\n\tprivate readonly registry: NodeRegistry\n\n\tconstructor(\n\t\tprivate blueprint: WorkflowBlueprint,\n\t\tregistry: NodeRegistry | TypedNodeRegistry<any, any>,\n\t\tprivate nodeOptionsContext: Record<string, any> = {},\n\t) {\n\t\tthis.registry = registry instanceof Map ? registry : createNodeRegistry(registry)\n\t\tthis.nodeMap = this._createNodeMap(blueprint.nodes)\n\t\tthis._wireGraph()\n\t\tconst startNode = this.nodeMap.get(blueprint.startNodeId)\n\t\tif (!startNode)\n\t\t\tthrow new Error(`Blueprint start node with ID '${blueprint.startNodeId}' not found in hydrated node map.`)\n\n\t\tthis.flow = new Flow(startNode)\n\t\tthis._populateContainers()\n\t}\n\n\tprivate _populateContainers(): void {\n\t\tfor (const node of this.nodeMap.values()) {\n\t\t\tif (node instanceof ParallelBranchContainer)\n\t\t\t\tnode.nodesToRun = Array.from(node.successors.values()).flat()\n\t\t}\n\t}\n\n\t/**\n\t * Retrieves a hydrated node instance from the blueprint by its ID.\n\t * This is useful for workers that need to execute a specific node from the graph.\n\t * @param nodeId The ID of the node to retrieve.\n\t * @returns The `AbstractNode` instance if found, otherwise `undefined`.\n\t */\n\tpublic getNode(nodeId: string): AbstractNode | undefined {\n\t\treturn this.nodeMap.get(nodeId)\n\t}\n\n\t/**\n\t * Instantiates all node objects from the blueprint's definition.\n\t * @private\n\t */\n\tprivate _createNodeMap(nodes: GraphNode[]): Map<string, AbstractNode> {\n\t\tconst nodeMap = new Map<string, AbstractNode>()\n\t\tfor (const graphNode of nodes) {\n\t\t\tconst NodeClass = this.registry.get(graphNode.type)\n\t\t\tif (!NodeClass)\n\t\t\t\tthrow new Error(`BlueprintExecutor: Node type '${graphNode.type}' not found in registry.`)\n\n\t\t\tconst nodeOptions = {\n\t\t\t\t...this.nodeOptionsContext,\n\t\t\t\tdata: { ...graphNode.data, nodeId: graphNode.id },\n\t\t\t}\n\t\t\tconst executableNode = new NodeClass(nodeOptions).withId(graphNode.id).withGraphData(graphNode)\n\t\t\tnodeMap.set(graphNode.id, executableNode)\n\t\t}\n\t\treturn nodeMap\n\t}\n\n\t/**\n\t * Wires the hydrated node instances together based on the blueprint's edges.\n\t * @private\n\t */\n\tprivate _wireGraph(): void {\n\t\tconst edgeGroups = new Map<string, Map<any, AbstractNode[]>>()\n\t\tfor (const edge of this.blueprint.edges) {\n\t\t\tconst sourceId = edge.source\n\t\t\tconst action = edge.action || DEFAULT_ACTION\n\t\t\tconst targetNode = this.nodeMap.get(edge.target)\n\t\t\tif (!targetNode)\n\t\t\t\tcontinue // Should not happen in a valid blueprint\n\n\t\t\tif (!edgeGroups.has(sourceId))\n\t\t\t\tedgeGroups.set(sourceId, new Map())\n\t\t\tconst sourceActions = edgeGroups.get(sourceId)!\n\t\t\tif (!sourceActions.has(action))\n\t\t\t\tsourceActions.set(action, [])\n\t\t\tsourceActions.get(action)!.push(targetNode)\n\t\t}\n\n\t\tfor (const [sourceId, actions] of edgeGroups.entries()) {\n\t\t\tconst sourceNode = this.nodeMap.get(sourceId)!\n\t\t\tfor (const [action, successors] of actions.entries()) {\n\t\t\t\tfor (const successor of successors)\n\t\t\t\t\tsourceNode.next(successor, action)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Executes the flow defined by the blueprint.\n\t * @param flow The flow to execute.\n\t * @param context The shared context for the workflow.\n\t * @param options Runtime options, including a logger, abort controller, or initial params.\n\t * @returns A promise that resolves with the final action of the workflow.\n\t */\n\tpublic async run<T>(flow: Flow<any, T>, context: Context, options?: RunOptions): Promise<T> {\n\t\tif (flow !== this.flow) {\n\t\t\tthrow new Error(\n\t\t\t\t'BlueprintExecutor is specialized and can only run the flow instance it was constructed with. '\n\t\t\t\t+ 'To run an arbitrary flow, use an InMemoryExecutor instance.',\n\t\t\t)\n\t\t}\n\n\t\tconst inMemoryExecutor = new InMemoryExecutor()\n\t\tconst finalOptions = { ...options, executor: this }\n\t\treturn inMemoryExecutor.run(this.flow, context, finalOptions)\n\t}\n\n\t/**\n\t * Determines the next node to execute based on the action returned by the current node.\n\t * For distributed systems, this logic would live on the orchestrator.\n\t * @internal\n\t */\n\tpublic getNextNode(curr: AbstractNode, action: any): AbstractNode | undefined {\n\t\t// In a simple execution, we take the first successor for a given action.\n\t\t// Parallelism is handled by specific container nodes.\n\t\treturn curr.successors.get(action)?.[0]\n\t}\n}\n"]}

package/dist/chunk-64DNBF5W.js

@@ -1,36 +0,0 @@
-// src/errors.ts
-var AbortError = class extends Error {
-  constructor(message = "Workflow aborted") {
-    super(message);
-    this.name = "AbortError";
-  }
-};
-var WorkflowError = class extends Error {
-  /**
-   * @param message The error message.
-   * @param nodeName The name of the `Node` class where the error occurred.
-   * @param phase The lifecycle phase (`'prep'`, `'exec'`, or `'post'`) where the error was thrown.
-   * @param originalError The underlying error that was caught and wrapped.
-   */
-  constructor(message, nodeName, phase, originalError) {
-    const combinedMessage = originalError ? `${message}: ${originalError.message}` : message;
-    super(combinedMessage);
-    this.nodeName = nodeName;
-    this.phase = phase;
-    this.originalError = originalError;
-    this.name = "WorkflowError";
-    if (originalError?.stack)
-      this.stack = `${this.stack}
-Caused by: ${originalError.stack}`;
-  }
-};
-var FatalWorkflowError = class extends WorkflowError {
-  constructor(message, nodeName, phase, originalError) {
-    super(message, nodeName, phase, originalError);
-    this.name = "FatalWorkflowError";
-  }
-};
-
-export { AbortError, FatalWorkflowError, WorkflowError };
-//# sourceMappingURL=chunk-64DNBF5W.js.map
-//# sourceMappingURL=chunk-64DNBF5W.js.map

package/dist/chunk-64DNBF5W.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/errors.ts"],"names":[],"mappings":";AAIO,IAAM,UAAA,GAAN,cAAyB,KAAA,CAAM;AAAA,EACrC,WAAA,CAAY,UAAU,kBAAA,EAAoB;AACzC,IAAA,KAAA,CAAM,OAAO,CAAA;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,YAAA;AAAA,EACb;AACD;AAMO,IAAM,aAAA,GAAN,cAA4B,KAAA,CAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOxC,WAAA,CACC,OAAA,EACgB,QAAA,EACA,KAAA,EACA,aAAA,EACf;AACD,IAAA,MAAM,kBAAkB,aAAA,GACrB,CAAA,EAAG,OAAO,CAAA,EAAA,EAAK,aAAA,CAAc,OAAO,CAAA,CAAA,GACpC,OAAA;AAEH,IAAA,KAAA,CAAM,eAAe,CAAA;AARL,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AAOhB,IAAA,IAAA,CAAK,IAAA,GAAO,eAAA;AACZ,IAAA,IAAI,aAAA,EAAe,KAAA;AAClB,MAAA,IAAA,CAAK,KAAA,GAAQ,CAAA,EAAG,IAAA,CAAK,KAAK;AAAA,WAAA,EAAgB,cAAc,KAAK,CAAA,CAAA;AAAA,EAC/D;AACD;AASO,IAAM,kBAAA,GAAN,cAAiC,aAAA,CAAc;AAAA,EACrD,WAAA,CACC,OAAA,EACA,QAAA,EACA,KAAA,EACA,aAAA,EACC;AACD,IAAA,KAAA,CAAM,OAAA,EAAS,QAAA,EAAU,KAAA,EAAO,aAAa,CAAA;AAC7C,IAAA,IAAA,CAAK,IAAA,GAAO,oBAAA;AAAA,EACb;AACD","file":"chunk-64DNBF5W.js","sourcesContent":["/**\n * Error thrown when a workflow is gracefully aborted via an `AbortSignal`.\n * This error is caught by the execution engine to halt the flow.\n */\nexport class AbortError extends Error {\n\tconstructor(message = 'Workflow aborted') {\n\t\tsuper(message)\n\t\tthis.name = 'AbortError'\n\t}\n}\n\n/**\n * A custom error class for failures within a workflow, providing additional\n * context about where and when the error occurred.\n */\nexport class WorkflowError extends Error {\n\t/**\n\t * @param message The error message.\n\t * @param nodeName The name of the `Node` class where the error occurred.\n\t * @param phase The lifecycle phase (`'prep'`, `'exec'`, or `'post'`) where the error was thrown.\n\t * @param originalError The underlying error that was caught and wrapped.\n\t */\n\tconstructor(\n\t\tmessage: string,\n\t\tpublic readonly nodeName: string,\n\t\tpublic readonly phase: 'prep' | 'exec' | 'post',\n\t\tpublic readonly originalError?: Error,\n\t) {\n\t\tconst combinedMessage = originalError\n\t\t\t? `${message}: ${originalError.message}`\n\t\t\t: message\n\n\t\tsuper(combinedMessage)\n\t\tthis.name = 'WorkflowError'\n\t\tif (originalError?.stack)\n\t\t\tthis.stack = `${this.stack}\\nCaused by: ${originalError.stack}`\n\t}\n}\n\n/**\n * An error thrown by a node to indicate a non-recoverable failure.\n *\n * When an executor catches this error, it should immediately terminate the\n * entire workflow run, bypassing any remaining retries, fallbacks, or\n * subsequent nodes in the graph.\n */\nexport class FatalWorkflowError extends WorkflowError {\n\tconstructor(\n\t\tmessage: string,\n\t\tnodeName: string,\n\t\tphase: 'prep' | 'exec' | 'post',\n\t\toriginalError?: Error,\n\t) {\n\t\tsuper(message, nodeName, phase, originalError)\n\t\tthis.name = 'FatalWorkflowError'\n\t}\n}\n"]}

package/dist/chunk-6QCXIRLA.js

@@ -1,18 +0,0 @@
-import { AbortError } from './chunk-64DNBF5W.js';
-
-// src/utils/sleep.ts
-async function sleep(ms, signal) {
-  return new Promise((resolve, reject) => {
-    if (signal?.aborted)
-      return reject(new AbortError());
-    const timeoutId = setTimeout(resolve, ms);
-    signal?.addEventListener("abort", () => {
-      clearTimeout(timeoutId);
-      reject(new AbortError());
-    });
-  });
-}
-
-export { sleep };
-//# sourceMappingURL=chunk-6QCXIRLA.js.map
-//# sourceMappingURL=chunk-6QCXIRLA.js.map

package/dist/chunk-6QCXIRLA.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/sleep.ts"],"names":[],"mappings":";;;AAQA,eAAsB,KAAA,CAAM,IAAY,MAAA,EAAqC;AAC5E,EAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,OAAA,EAAS,MAAA,KAAW;AACvC,IAAA,IAAI,MAAA,EAAQ,OAAA;AACX,MAAA,OAAO,MAAA,CAAO,IAAI,UAAA,EAAY,CAAA;AAE/B,IAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,EAAS,EAAE,CAAA;AACxC,IAAA,MAAA,EAAQ,gBAAA,CAAiB,SAAS,MAAM;AACvC,MAAA,YAAA,CAAa,SAAS,CAAA;AACtB,MAAA,MAAA,CAAO,IAAI,YAAY,CAAA;AAAA,IACxB,CAAC,CAAA;AAAA,EACF,CAAC,CAAA;AACF","file":"chunk-6QCXIRLA.js","sourcesContent":["import { AbortError } from '../errors'\n\n/**\n * An abortable `sleep` utility that pauses execution for a specified duration.\n * It will reject with an `AbortError` if the provided `AbortSignal` is triggered.\n * @param ms The number of milliseconds to sleep.\n * @param signal An optional `AbortSignal` to listen for cancellation.\n */\nexport async function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n\treturn new Promise((resolve, reject) => {\n\t\tif (signal?.aborted)\n\t\t\treturn reject(new AbortError())\n\n\t\tconst timeoutId = setTimeout(resolve, ms)\n\t\tsignal?.addEventListener('abort', () => {\n\t\t\tclearTimeout(timeoutId)\n\t\t\treject(new AbortError())\n\t\t})\n\t})\n}\n"]}

package/dist/chunk-7XUN3OQT.js

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-7XUN3OQT.js.map
-//# sourceMappingURL=chunk-7XUN3OQT.js.map

package/dist/chunk-AOHBHYF6.js

@@ -1,7 +0,0 @@
-// src/types.ts
-var DEFAULT_ACTION = Symbol("default");
-var FILTER_FAILED = Symbol("filter_failed");
-
-export { DEFAULT_ACTION, FILTER_FAILED };
-//# sourceMappingURL=chunk-AOHBHYF6.js.map
-//# sourceMappingURL=chunk-AOHBHYF6.js.map

package/dist/chunk-AOHBHYF6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/types.ts"],"names":[],"mappings":";AASO,IAAM,cAAA,GAAiB,OAAO,SAAS;AAGvC,IAAM,aAAA,GAAgB,OAAO,eAAe","file":"chunk-AOHBHYF6.js","sourcesContent":["import type { Context } from './context'\nimport type { IExecutor } from './executors/types'\nimport type { Logger } from './logger'\nimport type { AbstractNode } from './workflow/index'\n\n/** A generic type for key-value parameters. */\nexport type Params = Record<string, any>\n\n/** The default action returned by a node for linear progression. */\nexport const DEFAULT_ACTION = Symbol('default')\n\n/** The action returned by a `.filter()` node when the predicate fails. */\nexport const FILTER_FAILED = Symbol('filter_failed')\n\n/**\n * The standard arguments object passed to a node's lifecycle methods.\n * @template PrepRes The type of the `prepRes` property.\n * @template ExecRes The type of the `execRes` property.\n * @template TParams The type for the node's static parameters.\n */\nexport interface NodeArgs<\n\tPrepRes = any,\n\tExecRes = any,\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> {\n\t/** The shared, mutable context for the workflow run. */\n\tctx: TContext\n\t/** The static parameters for the node, merged from the node and flow's `withParams`. */\n\tparams: TParams\n\t/** An `AbortController` to gracefully cancel the workflow. */\n\tcontroller?: AbortController\n\t/** An `AbortSignal` for handling cancellation. */\n\tsignal?: AbortSignal\n\t/** The logger instance for the workflow run. */\n\tlogger: Logger\n\t/** The result of the `prep` phase. */\n\tprepRes: PrepRes\n\t/** The result of the `exec` phase. */\n\texecRes: ExecRes\n\t/** The final error object, available only in `execFallback`. */\n\terror?: Error\n\t/** The name of the Node's constructor, for logging. */\n\tname?: string\n\t/** A reference to the current `IExecutor` running the flow. */\n\texecutor?: IExecutor\n\t/** The actual node instance being executed. */\n\tnode?: AbstractNode\n\t/** A shared set to track visited nodes within a parallel block, preventing race conditions. @internal */\n\tvisitedInParallel?: Set<AbstractNode>\n}\n\n/**\n * The context object passed to a node's internal `_run` method.\n * @internal\n */\nexport interface NodeRunContext<TContext extends Context = Context> {\n\tctx: TContext\n\tparams: Params\n\tsignal?: AbortSignal\n\tlogger: Logger\n\texecutor?: IExecutor\n\t/** A shared set to track visited nodes within a parallel block. @internal */\n\tvisitedInParallel?: Set<AbstractNode>\n}\n\n/** Options for configuring a `Node` instance. */\nexport interface NodeOptions {\n\t/** The total number of times the `exec` phase will be attempted. Defaults to `1`. */\n\tmaxRetries?: number\n\t/** The time in milliseconds to wait between failed `exec` attempts. Defaults to `0`. */\n\twait?: number\n}\n\n/** Options for running a top-level `Flow`. */\nexport interface RunOptions {\n\t/** An `AbortController` to gracefully cancel the workflow. */\n\tcontroller?: AbortController\n\t/** An `AbortSignal` for handling cancellation. */\n\tsignal?: AbortSignal\n\t/** A `Logger` instance to receive logs from the execution engine. */\n\tlogger?: Logger\n\t/** Top-level parameters to be merged into the context for the entire run. */\n\tparams?: Params\n\t/** A custom `IExecutor` instance to run the workflow. Defaults to `InMemoryExecutor`. */\n\texecutor?: IExecutor\n}\n\n/** The function signature for the `next` function passed to middleware. */\nexport type MiddlewareNext<T = any> = (args: NodeArgs) => Promise<T>\n/** The function signature for a middleware function. */\nexport type Middleware<T = any> = (args: NodeArgs, next: MiddlewareNext<T>) => Promise<T>\n"]}

package/dist/chunk-BRFMFLR6.js

@@ -1,85 +0,0 @@
-import { applyMiddleware } from './chunk-PNWOW52F.js';
-import { AbortError } from './chunk-64DNBF5W.js';
-import { NullLogger } from './chunk-IIKTTIW5.js';
-
-// src/executors/in-memory.ts
-var InMemoryExecutor = class {
-  /**
-   * A stateless, reusable method that orchestrates the traversal of a graph.
-   * It is called by `run()` for top-level flows and by `Flow.exec()` for sub-flows.
-   * @param startNode The node where the graph traversal begins.
-   * @param flowMiddleware The middleware array from the containing flow.
-   * @param context The shared workflow context.
-   * @param options The internal, normalized run options.
-   * @returns The final action from the last executed node in the graph.
-   * @internal
-   */
-  async _orch(startNode, flowMiddleware, context, options) {
-    let currentNode = startNode;
-    let nextNode;
-    let action;
-    const { logger, signal } = options;
-    const visitedInParallel = /* @__PURE__ */ new Set();
-    while (currentNode) {
-      if (signal?.aborted)
-        throw new AbortError();
-      if (visitedInParallel.has(currentNode)) {
-        currentNode = this.getNextNode(currentNode, void 0);
-        continue;
-      }
-      const nodeArgs = {
-        ctx: context,
-        params: { ...options.params, ...currentNode.params },
-        signal,
-        logger,
-        prepRes: void 0,
-        execRes: void 0,
-        name: currentNode.constructor.name,
-        executor: options.executor,
-        node: currentNode,
-        visitedInParallel
-      };
-      const chain = applyMiddleware(flowMiddleware, currentNode);
-      action = await chain(nodeArgs);
-      nextNode = this.getNextNode(currentNode, action);
-      if (!nextNode)
-        return action;
-      currentNode = nextNode;
-    }
-    return void 0;
-  }
-  async run(flow, context, options) {
-    const logger = options?.logger ?? new NullLogger();
-    const combinedParams = { ...flow.params, ...options?.params };
-    const internalOptions = {
-      logger,
-      signal: options?.signal ?? options?.controller?.signal,
-      params: combinedParams,
-      executor: this
-    };
-    if (!flow.startNode) {
-      logger.debug(`Executor is running a logic-bearing flow: ${flow.constructor.name}`);
-      const chain = applyMiddleware(flow.middleware, flow);
-      return await chain({
-        ...internalOptions,
-        ctx: context,
-        prepRes: void 0,
-        execRes: void 0,
-        name: flow.constructor.name
-      });
-    }
-    return this._orch(flow.startNode, flow.middleware, context, internalOptions);
-  }
-  /**
-   * Determines the next node to execute based on the action returned by the current node.
-   * @internal
-   */
-  getNextNode(curr, action) {
-    const nextNodes = curr.successors.get(action);
-    return nextNodes?.[0];
-  }
-};
-
-export { InMemoryExecutor };
-//# sourceMappingURL=chunk-BRFMFLR6.js.map
-//# sourceMappingURL=chunk-BRFMFLR6.js.map

package/dist/chunk-BRFMFLR6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/executors/in-memory.ts"],"names":[],"mappings":";;;;;AAaO,IAAM,mBAAN,MAA4C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWlD,MAAa,KAAA,CACZ,SAAA,EACA,cAAA,EACA,SACA,OAAA,EACa;AACb,IAAA,IAAI,WAAA,GAAwC,SAAA;AAC5C,IAAA,IAAI,QAAA;AACJ,IAAA,IAAI,MAAA;AAEJ,IAAA,MAAM,EAAE,MAAA,EAAQ,MAAA,EAAO,GAAI,OAAA;AAC3B,IAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAkB;AAEhD,IAAA,OAAO,WAAA,EAAa;AACnB,MAAA,IAAI,MAAA,EAAQ,OAAA;AACX,QAAA,MAAM,IAAI,UAAA,EAAW;AAEtB,MAAA,IAAI,iBAAA,CAAkB,GAAA,CAAI,WAAW,CAAA,EAAG;AACvC,QAAA,WAAA,GAAc,IAAA,CAAK,WAAA,CAAY,WAAA,EAAa,MAAS,CAAA;AACrD,QAAA;AAAA,MACD;AAEA,MAAA,MAAM,QAAA,GAAqB;AAAA,QAC1B,GAAA,EAAK,OAAA;AAAA,QACL,QAAQ,EAAE,GAAG,QAAQ,MAAA,EAAQ,GAAG,YAAY,MAAA,EAAO;AAAA,QACnD,MAAA;AAAA,QACA,MAAA;AAAA,QACA,OAAA,EAAS,MAAA;AAAA,QACT,OAAA,EAAS,MAAA;AAAA,QACT,IAAA,EAAM,YAAY,WAAA,CAAY,IAAA;AAAA,QAC9B,UAAU,OAAA,CAAQ,QAAA;AAAA,QAClB,IAAA,EAAM,WAAA;AAAA,QACN;AAAA,OACD;AAEA,MAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,cAAA,EAAgB,WAAW,CAAA;AACzD,MAAA,MAAA,GAAS,MAAM,MAAM,QAAQ,CAAA;AAC7B,MAAA,QAAA,GAAW,IAAA,CAAK,WAAA,CAAY,WAAA,EAAa,MAAM,CAAA;AAE/C,MAAA,IAAI,CAAC,QAAA;AACJ,QAAA,OAAO,MAAA;AAER,MAAA,WAAA,GAAc,QAAA;AAAA,IACf;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA,EAYA,MAAa,GAAA,CAAO,IAAA,EAAoB,OAAA,EAAkB,OAAA,EAAkC;AAC3F,IAAA,MAAM,MAAA,GAAS,OAAA,EAAS,MAAA,IAAU,IAAI,UAAA,EAAW;AACjD,IAAA,MAAM,iBAAiB,EAAE,GAAG,KAAK,MAAA,EAAQ,GAAG,SAAS,MAAA,EAAO;AAE5D,IAAA,MAAM,eAAA,GAAsC;AAAA,MAC3C,MAAA;AAAA,MACA,MAAA,EAAQ,OAAA,EAAS,MAAA,IAAU,OAAA,EAAS,UAAA,EAAY,MAAA;AAAA,MAChD,MAAA,EAAQ,cAAA;AAAA,MACR,QAAA,EAAU;AAAA,KACX;AAEA,IAAA,IAAI,CAAC,KAAK,SAAA,EAAW;AACpB,MAAA,MAAA,CAAO,KAAA,CAAM,CAAA,0CAAA,EAA6C,IAAA,CAAK,WAAA,CAAY,IAAI,CAAA,CAAE,CAAA;AACjF,MAAA,MAAM,KAAA,GAAQ,eAAA,CAAgB,IAAA,CAAK,UAAA,EAAY,IAAI,CAAA;AACnD,MAAA,OAAO,MAAM,KAAA,CAAM;AAAA,QAClB,GAAG,eAAA;AAAA,QACH,GAAA,EAAK,OAAA;AAAA,QACL,OAAA,EAAS,MAAA;AAAA,QACT,OAAA,EAAS,MAAA;AAAA,QACT,IAAA,EAAM,KAAK,WAAA,CAAY;AAAA,OACvB,CAAA;AAAA,IACF;AAEA,IAAA,OAAO,KAAK,KAAA,CAAS,IAAA,CAAK,WAAW,IAAA,CAAK,UAAA,EAAY,SAAS,eAAe,CAAA;AAAA,EAC/E;AAAA;AAAA;AAAA;AAAA;AAAA,EAMO,WAAA,CAAY,MAAoB,MAAA,EAAuC;AAC7E,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,CAAA;AAG5C,IAAA,OAAO,YAAY,CAAC,CAAA;AAAA,EACrB;AACD","file":"chunk-BRFMFLR6.js","sourcesContent":["import type { Context } from '../context'\nimport type { Middleware, NodeArgs, RunOptions } from '../types'\nimport type { AbstractNode, Flow } from '../workflow/index'\nimport type { IExecutor, InternalRunOptions } from './types'\nimport { AbortError } from '../errors'\nimport { NullLogger } from '../logger'\nimport { applyMiddleware } from '../utils/middleware'\n\n/**\n * The default executor that runs a workflow within a single, in-memory process.\n * This class contains the core logic for traversing a workflow graph, applying middleware,\n * and handling node execution.\n */\nexport class InMemoryExecutor implements IExecutor {\n\t/**\n\t * A stateless, reusable method that orchestrates the traversal of a graph.\n\t * It is called by `run()` for top-level flows and by `Flow.exec()` for sub-flows.\n\t * @param startNode The node where the graph traversal begins.\n\t * @param flowMiddleware The middleware array from the containing flow.\n\t * @param context The shared workflow context.\n\t * @param options The internal, normalized run options.\n\t * @returns The final action from the last executed node in the graph.\n\t * @internal\n\t */\n\tpublic async _orch<T = any>(\n\t\tstartNode: AbstractNode,\n\t\tflowMiddleware: Middleware[],\n\t\tcontext: Context,\n\t\toptions: InternalRunOptions,\n\t): Promise<T> {\n\t\tlet currentNode: AbstractNode | undefined = startNode\n\t\tlet nextNode: AbstractNode | undefined\n\t\tlet action: any\n\n\t\tconst { logger, signal } = options\n\t\tconst visitedInParallel = new Set<AbstractNode>()\n\n\t\twhile (currentNode) {\n\t\t\tif (signal?.aborted)\n\t\t\t\tthrow new AbortError()\n\n\t\t\tif (visitedInParallel.has(currentNode)) {\n\t\t\t\tcurrentNode = this.getNextNode(currentNode, undefined)\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tconst nodeArgs: NodeArgs = {\n\t\t\t\tctx: context,\n\t\t\t\tparams: { ...options.params, ...currentNode.params },\n\t\t\t\tsignal,\n\t\t\t\tlogger,\n\t\t\t\tprepRes: undefined,\n\t\t\t\texecRes: undefined,\n\t\t\t\tname: currentNode.constructor.name,\n\t\t\t\texecutor: options.executor,\n\t\t\t\tnode: currentNode,\n\t\t\t\tvisitedInParallel,\n\t\t\t}\n\n\t\t\tconst chain = applyMiddleware(flowMiddleware, currentNode)\n\t\t\taction = await chain(nodeArgs)\n\t\t\tnextNode = this.getNextNode(currentNode, action)\n\n\t\t\tif (!nextNode)\n\t\t\t\treturn action as T\n\n\t\t\tcurrentNode = nextNode\n\t\t}\n\n\t\treturn undefined as T\n\t}\n\n\t/**\n\t * Executes a given flow with a specific context and options.\n\t * This is the main entry point for the in-memory execution engine.\n\t * @param flow The Flow instance to execute.\n\t * @param context The shared context for the workflow.\n\t * @param options Runtime options, including a logger, abort controller, or initial params.\n\t * @returns A promise that resolves with the final action of the workflow.\n\t */\n\tpublic run<T>(flow: Flow<any, T>, context: Context, options?: RunOptions): Promise<T>\n\tpublic run(flow: Flow, context: Context, options?: RunOptions): Promise<any>\n\tpublic async run<T>(flow: Flow<any, T>, context: Context, options?: RunOptions): Promise<T> {\n\t\tconst logger = options?.logger ?? new NullLogger()\n\t\tconst combinedParams = { ...flow.params, ...options?.params }\n\n\t\tconst internalOptions: InternalRunOptions = {\n\t\t\tlogger,\n\t\t\tsignal: options?.signal ?? options?.controller?.signal,\n\t\t\tparams: combinedParams,\n\t\t\texecutor: this,\n\t\t}\n\n\t\tif (!flow.startNode) {\n\t\t\tlogger.debug(`Executor is running a logic-bearing flow: ${flow.constructor.name}`)\n\t\t\tconst chain = applyMiddleware(flow.middleware, flow)\n\t\t\treturn await chain({\n\t\t\t\t...internalOptions,\n\t\t\t\tctx: context,\n\t\t\t\tprepRes: undefined,\n\t\t\t\texecRes: undefined,\n\t\t\t\tname: flow.constructor.name,\n\t\t\t})\n\t\t}\n\n\t\treturn this._orch<T>(flow.startNode, flow.middleware, context, internalOptions)\n\t}\n\n\t/**\n\t * Determines the next node to execute based on the action returned by the current node.\n\t * @internal\n\t */\n\tpublic getNextNode(curr: AbstractNode, action: any): AbstractNode | undefined {\n\t\tconst nextNodes = curr.successors.get(action)\n\t\t// For the in-memory executor, we take the first successor for a given action.\n\t\t// Parallelism is handled by specific container nodes like ParallelFlow.\n\t\treturn nextNodes?.[0]\n\t}\n}\n"]}

package/dist/chunk-ELEHMJPM.js

@@ -1,13 +0,0 @@
-import { Node } from './chunk-HEO3XL4Z.js';
-
-// src/workflow/node-patterns.ts
-var ExecNode = class extends Node {
-};
-var PreNode = class extends Node {
-};
-var PostNode = class extends Node {
-};
-
-export { ExecNode, PostNode, PreNode };
-//# sourceMappingURL=chunk-ELEHMJPM.js.map
-//# sourceMappingURL=chunk-ELEHMJPM.js.map

package/dist/chunk-ELEHMJPM.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/workflow/node-patterns.ts"],"names":[],"mappings":";;;AAYO,IAAe,QAAA,GAAf,cAIG,IAAA,CAA4C;AAQtD;AASO,IAAe,OAAA,GAAf,cAGG,IAAA,CAAyC;AAOnD;AAUO,IAAe,QAAA,GAAf,cAIG,IAAA,CAA6C;AAQvD","file":"chunk-ELEHMJPM.js","sourcesContent":["import type { Context } from '../context'\nimport type { NodeArgs, Params } from '../types'\nimport { Node } from './Node'\n\n/**\n * A simplified base class for nodes that only need to perform a core action.\n * This pattern is ideal for nodes that receive their inputs via `params` and\n * produce an output, without needing `prep` or complex `post` branching logic.\n *\n * @template ExecRes The type of data returned by the `exec` phase.\n * @template TParams The type for the node's static parameters.\n */\nexport abstract class ExecNode<\n\tExecRes = any,\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> extends Node<void, ExecRes, any, TParams, TContext> {\n\t/**\n\t * (Lifecycle) Performs the core, isolated logic of the node.\n\t * This is the only phase that is retried on failure. It should not access the `Context` directly.\n\t * @param args The arguments for the node, including `prepRes`.\n\t * @returns The result of the execution.\n\t */\n\tabstract override exec(args: NodeArgs<void, void, TParams, TContext>): Promise<ExecRes>\n}\n\n/**\n * A simplified base class for nodes that only perform a side effect, such as\n * modifying the `Context` or logging. These nodes do not produce an `exec` result.\n * Their logic is typically placed in the `prep` phase.\n *\n * @template TParams The type for the node's static parameters.\n */\nexport abstract class PreNode<\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> extends Node<void, void, any, TParams, TContext> {\n\t/**\n\t * (Lifecycle) Prepares data or performs a side effect. Runs once before `exec`.\n\t * This is the ideal place to read from or write to the `Context`.\n\t * @param args The arguments for the node, including `ctx` and `params`.\n\t */\n\tabstract override prep(args: NodeArgs<void, void, TParams, TContext>): Promise<void>\n}\n\n/**\n * A simplified base class for nodes that make a branching decision.\n * This pattern is ideal for routing the workflow based on data in the `Context`.\n * The branching logic is placed in the `post` phase, which returns a custom action string.\n *\n * @template PostRes The type of the \"action\" string returned by the `post` phase.\n * @template TParams The type for the node's static parameters.\n */\nexport abstract class PostNode<\n\tPostRes = any,\n\tTParams extends Params = Params,\n\tTContext extends Context = Context,\n> extends Node<void, void, PostRes, TParams, TContext> {\n\t/**\n\t * (Lifecycle) Processes results and determines the next step. Runs once after `exec`.\n\t * This is the ideal place to write data to the `Context` and return an action.\n\t * @param args The arguments for the node, including `execRes`.\n\t * @returns An \"action\" string to determine which successor to execute next.\n\t */\n\tabstract override post(args: NodeArgs<void, void, TParams, TContext>): Promise<PostRes>\n}\n"]}

package/dist/chunk-F2RSES6P.js

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-F2RSES6P.js.map
-//# sourceMappingURL=chunk-F2RSES6P.js.map

package/dist/chunk-F6C6J7HK.js

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-F6C6J7HK.js.map
-//# sourceMappingURL=chunk-F6C6J7HK.js.map

package/dist/chunk-F6C6J7HK.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"chunk-F6C6J7HK.js"}

package/dist/chunk-GMKJ34T2.js

@@ -1,3 +0,0 @@
-
-//# sourceMappingURL=chunk-GMKJ34T2.js.map
-//# sourceMappingURL=chunk-GMKJ34T2.js.map

package/dist/chunk-GMKJ34T2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"names":[],"mappings":"","file":"chunk-GMKJ34T2.js"}