@nodaro/shared 3.36.0 → 3.38.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{chunk-FKQJYMCO.js → chunk-2BHOAYZW.js} +38 -13
- package/dist/chunk-2BHOAYZW.js.map +1 -0
- package/dist/{chunk-BSQCKTXH.cjs → chunk-33QG2DOW.cjs} +6 -6
- package/dist/{chunk-BSQCKTXH.cjs.map → chunk-33QG2DOW.cjs.map} +1 -1
- package/dist/{chunk-NYMOHNYV.js → chunk-5OED47LE.js} +3 -3
- package/dist/{chunk-NYMOHNYV.js.map → chunk-5OED47LE.js.map} +1 -1
- package/dist/{chunk-GZH2SIOF.cjs → chunk-5PCI6M44.cjs} +18 -6
- package/dist/chunk-5PCI6M44.cjs.map +1 -0
- package/dist/chunk-6Q4BS6AR.js +158 -0
- package/dist/chunk-6Q4BS6AR.js.map +1 -0
- package/dist/{chunk-AXUW64ZY.js → chunk-7QITUDRT.js} +3 -3
- package/dist/{chunk-AXUW64ZY.js.map → chunk-7QITUDRT.js.map} +1 -1
- package/dist/{chunk-V3N56Z2S.cjs → chunk-7VDPBFER.cjs} +43 -12
- package/dist/chunk-7VDPBFER.cjs.map +1 -0
- package/dist/{chunk-LT5IJO4Y.cjs → chunk-AQA6YXY5.cjs} +39 -10
- package/dist/chunk-AQA6YXY5.cjs.map +1 -0
- package/dist/{chunk-7AB3AE5L.js → chunk-BDSFMY4X.js} +5 -18
- package/dist/chunk-BDSFMY4X.js.map +1 -0
- package/dist/chunk-BLZBDPZJ.js +16 -0
- package/dist/chunk-BLZBDPZJ.js.map +1 -0
- package/dist/{chunk-TCBHVIMD.js → chunk-CQJYKSXF.js} +18 -6
- package/dist/chunk-CQJYKSXF.js.map +1 -0
- package/dist/{chunk-AWWOQH46.cjs → chunk-D33YBZ3B.cjs} +170 -143
- package/dist/chunk-D33YBZ3B.cjs.map +1 -0
- package/dist/chunk-DBD4BCGH.cjs +169 -0
- package/dist/chunk-DBD4BCGH.cjs.map +1 -0
- package/dist/{chunk-7VQPHLZ5.cjs → chunk-ENFBA33M.cjs} +21 -21
- package/dist/{chunk-7VQPHLZ5.cjs.map → chunk-ENFBA33M.cjs.map} +1 -1
- package/dist/{chunk-BBLE4UTG.cjs → chunk-GLON7ANZ.cjs} +48 -15
- package/dist/chunk-GLON7ANZ.cjs.map +1 -0
- package/dist/{chunk-JSGIEF6Z.cjs → chunk-HSJU5KNR.cjs} +6 -3
- package/dist/chunk-HSJU5KNR.cjs.map +1 -0
- package/dist/{chunk-YN6AXDN5.cjs → chunk-HZ46RDLD.cjs} +9 -24
- package/dist/chunk-HZ46RDLD.cjs.map +1 -0
- package/dist/{chunk-NITAUX3A.cjs → chunk-JLKZEKQ3.cjs} +45 -28
- package/dist/chunk-JLKZEKQ3.cjs.map +1 -0
- package/dist/{chunk-WXNQMJ67.js → chunk-LOWOJN65.js} +100 -6
- package/dist/chunk-LOWOJN65.js.map +1 -0
- package/dist/chunk-M7G66F6H.js +17 -0
- package/dist/chunk-M7G66F6H.js.map +1 -0
- package/dist/chunk-PSAWDKO3.cjs +19 -0
- package/dist/chunk-PSAWDKO3.cjs.map +1 -0
- package/dist/{chunk-2HVFF5SS.js → chunk-QLCSS6DK.js} +165 -141
- package/dist/chunk-QLCSS6DK.js.map +1 -0
- package/dist/{chunk-ANOQWAMU.js → chunk-R6B2UDFR.js} +35 -5
- package/dist/chunk-R6B2UDFR.js.map +1 -0
- package/dist/chunk-T3TOSWVH.cjs +20 -0
- package/dist/chunk-T3TOSWVH.cjs.map +1 -0
- package/dist/{chunk-J65CAOUV.cjs → chunk-TGZJXCLL.cjs} +105 -5
- package/dist/chunk-TGZJXCLL.cjs.map +1 -0
- package/dist/{chunk-56VQ7V3V.js → chunk-THGNDVVH.js} +29 -4
- package/dist/chunk-THGNDVVH.js.map +1 -0
- package/dist/{chunk-XNISPHTZ.js → chunk-WPT5ZTA2.js} +6 -3
- package/dist/chunk-WPT5ZTA2.js.map +1 -0
- package/dist/{chunk-NTHRTRQK.js → chunk-XA53RUSD.js} +22 -6
- package/dist/chunk-XA53RUSD.js.map +1 -0
- package/dist/entries/apps.cjs +38 -38
- package/dist/entries/apps.js +3 -3
- package/dist/entries/credits.cjs +135 -134
- package/dist/entries/credits.js +3 -2
- package/dist/entries/llm-models.cjs +81 -49
- package/dist/entries/llm-models.d.cts +82 -14
- package/dist/entries/llm-models.d.ts +82 -14
- package/dist/entries/llm-models.js +2 -2
- package/dist/entries/media.cjs +66 -42
- package/dist/entries/media.d.cts +145 -4
- package/dist/entries/media.d.ts +145 -4
- package/dist/entries/media.js +1 -1
- package/dist/entries/models.cjs +84 -27
- package/dist/entries/models.d.cts +109 -3
- package/dist/entries/models.d.ts +109 -3
- package/dist/entries/models.js +3 -2
- package/dist/entries/nodes.cjs +204 -199
- package/dist/entries/nodes.d.cts +19 -2
- package/dist/entries/nodes.d.ts +19 -2
- package/dist/entries/nodes.js +5 -4
- package/dist/entries/pipeline.d.cts +2 -2
- package/dist/entries/pipeline.d.ts +2 -2
- package/dist/entries/social.cjs +187 -174
- package/dist/entries/social.d.cts +26 -1
- package/dist/entries/social.d.ts +26 -1
- package/dist/entries/social.js +3 -2
- package/dist/entries/workflow.cjs +157 -144
- package/dist/entries/workflow.d.cts +49 -1
- package/dist/entries/workflow.d.ts +49 -1
- package/dist/entries/workflow.js +4 -3
- package/dist/index.cjs +942 -800
- package/dist/index.d.cts +8 -7
- package/dist/index.d.ts +8 -7
- package/dist/index.js +14 -12
- package/dist/{scene-node-types-Cvbtf-0a.d.ts → model-constants-C43YS07I.d.cts} +1 -497
- package/dist/{scene-node-types-Cvbtf-0a.d.cts → model-constants-C43YS07I.d.ts} +1 -497
- package/dist/scene-node-types-BSrTKnV7.d.cts +499 -0
- package/dist/scene-node-types-BSrTKnV7.d.ts +499 -0
- package/package.json +1 -1
- package/src/__tests__/cast-swap-limits.test.ts +40 -0
- package/src/__tests__/fixtures/root-exports.baseline.json +6 -0
- package/src/__tests__/llm-models.test.ts +61 -18
- package/src/__tests__/llm-price-key.test.ts +55 -0
- package/src/__tests__/node-preset-extract.test.ts +10 -0
- package/src/__tests__/node-runtime-keys.test.ts +21 -2
- package/src/__tests__/render-output.test.ts +64 -0
- package/src/__tests__/schedule-retry.test.ts +35 -0
- package/src/__tests__/scrape-analysis-pricing.test.ts +41 -0
- package/src/__tests__/suno-separate.test.ts +78 -0
- package/src/__tests__/video-mask.test.ts +27 -0
- package/src/cast-swap-limits.ts +52 -0
- package/src/entries/llm-models.ts +7 -0
- package/src/entries/models.ts +26 -1
- package/src/entries/social.ts +1 -0
- package/src/entries/workflow.ts +6 -0
- package/src/generated/unit-contracts.ts +8 -2
- package/src/llm-models.ts +111 -23
- package/src/mask-composite.ts +80 -3
- package/src/node-preset-extract.ts +4 -0
- package/src/node-runtime-keys.ts +7 -0
- package/src/render-output.ts +36 -1
- package/src/schedule-retry.ts +71 -0
- package/src/scrape-analysis-pricing.ts +73 -0
- package/src/script-model.ts +21 -0
- package/src/suno-separate.ts +210 -0
- package/src/video-mask.ts +97 -0
- package/dist/chunk-2HVFF5SS.js.map +0 -1
- package/dist/chunk-56VQ7V3V.js.map +0 -1
- package/dist/chunk-7AB3AE5L.js.map +0 -1
- package/dist/chunk-ANOQWAMU.js.map +0 -1
- package/dist/chunk-AWWOQH46.cjs.map +0 -1
- package/dist/chunk-BBLE4UTG.cjs.map +0 -1
- package/dist/chunk-FG4E7MTG.cjs +0 -4
- package/dist/chunk-FG4E7MTG.cjs.map +0 -1
- package/dist/chunk-FKQJYMCO.js.map +0 -1
- package/dist/chunk-GZH2SIOF.cjs.map +0 -1
- package/dist/chunk-J65CAOUV.cjs.map +0 -1
- package/dist/chunk-JSGIEF6Z.cjs.map +0 -1
- package/dist/chunk-LT5IJO4Y.cjs.map +0 -1
- package/dist/chunk-NITAUX3A.cjs.map +0 -1
- package/dist/chunk-NTHRTRQK.js.map +0 -1
- package/dist/chunk-TCBHVIMD.js.map +0 -1
- package/dist/chunk-TZE673G6.js +0 -3
- package/dist/chunk-TZE673G6.js.map +0 -1
- package/dist/chunk-V3N56Z2S.cjs.map +0 -1
- package/dist/chunk-WXNQMJ67.js.map +0 -1
- package/dist/chunk-XNISPHTZ.js.map +0 -1
- package/dist/chunk-YN6AXDN5.cjs.map +0 -1
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/node-refs.ts","../src/trigger-feeds.ts","../src/node-runtime-keys.ts","../src/json-path.ts","../src/filter-condition.ts","../src/selector.ts"],"names":[],"mappings":";AAMO,IAAM,gBAAA,GAAmB;AAGzB,IAAM,sBAAA,uBAA6B,GAAA,CAAI;AAAA,EAC5C,MAAA;AAAA,EACA,aAAA;AAAA,EACA,YAAA;AAAA,EACA,mBAAA;AAAA,EACA;AACF,CAAC;AAUM,SAAS,aAAa,GAAA,EAAwD;AACnF,EAAA,MAAM,CAAA,GAAI,GAAA,CAAI,OAAA,CAAQ,IAAI,CAAA;AAC1B,EAAA,IAAI,CAAA,KAAM,IAAI,OAAO,EAAE,MAAM,GAAA,CAAI,IAAA,EAAK,EAAG,QAAA,EAAU,IAAA,EAAK;AACxD,EAAA,OAAO,EAAE,IAAA,EAAM,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,IAAA,EAAK,EAAG,QAAA,EAAU,IAAI,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA,CAAE,MAAK,EAAE;AAC3E;AAYO,SAAS,iBAAiB,KAAA,EAAuB;AACtD,EAAA,OAAO,KAAA,CAAM,IAAA,EAAK,CAAE,WAAA,EAAY;AAClC;AAcO,SAAS,2BACX,KAAA,EACU;AACb,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,IAAA,CAAK,WAAW,CAAA,EAAG;AACnD,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,gBAAgB,CAAA,EAAG;AAC/C,MAAA,MAAM,EAAE,IAAA,EAAK,GAAI,aAAa,CAAA,CAAE,CAAC,KAAK,EAAE,CAAA;AACxC,MAAA,IAAI,IAAA,KAAS,MAAM,IAAA,CAAK,UAAA,CAAW,QAAQ,CAAA,IAAK,sBAAA,CAAuB,GAAA,CAAI,IAAI,CAAA,EAAG;AAClF,MAAA,IAAA,CAAK,GAAA,CAAI,gBAAA,CAAiB,IAAI,CAAC,CAAA;AAAA,IACjC;AAAA,EACF;AACA,EAAA,OAAO,IAAA;AACT;AAKO,IAAM,mBAAA,GAAwD;AAAA,EACnE,MAAA,EAAQ,CAAA;AAAA,EACR,QAAA,EAAU,CAAA;AAAA,EACV,IAAA,EAAM,CAAA;AAAA,EACN,cAAA,EAAgB,CAAA;AAAA,EAChB,KAAA,EAAO;AACT;AAIO,SAAS,kBAAkB,YAAA,EAAiD;AACjF,EAAA,IAAI,YAAA,IAAgB,QAAQ,MAAA,CAAO,SAAA,CAAU,eAAe,IAAA,CAAK,mBAAA,EAAqB,YAAY,CAAA,EAAG;AACnG,IAAA,OAAO,oBAAoB,YAAY,CAAA;AAAA,EACzC;AACA,EAAA,OAAO,EAAA;AACT;AAkBO,IAAM,oBAAA,GAA2G;AAAA;AAAA,EAEtH,YAAA,EAAc,oBAAA;AAAA,EACd,kBAAA,EAAoB,oBAAA;AAAA,EACpB,iBAAA,EAAmB,oBAAA;AAAA;AAAA;AAAA,EAGnB,iBAAA,EAAmB,oBAAA;AAAA,EACnB,iBAAA,EAAmB,oBAAA;AAAA,EACnB,iBAAA,EAAmB;AACrB;AAcO,SAAS,2BAA2B,YAAA,EAAmE;AAC5G,EAAA,IAAI,YAAA,IAAgB,MAAM,OAAO,IAAA;AACjC,EAAA,MAAM,GAAA,GAAM,qBAAqB,YAAY,CAAA;AAC7C,EAAA,OAAO,GAAA,KAAQ,uBAAuB,OAAA,GAAU,GAAA,KAAQ,uBAAuB,OAAA,GAAU,GAAA,KAAQ,uBAAuB,OAAA,GAAU,IAAA;AACpI;AAiBO,IAAM,uCAA4C,IAAI,GAAA,CAAI,CAAC,YAAA,EAAc,UAAU,CAAC;AA2BpF,SAAS,qBAAA,CACd,KAAA,EACA,MAAA,EACA,QAAA,EACQ;AACR,EAAA,IAAI,CAAA,GAAI,CAAA;AACR,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAA,CAAE,WAAW,MAAA,IAAU,0BAAA,CAA2B,EAAE,YAAY,CAAA,KAAM,UAAU,CAAA,IAAK,CAAA;AAAA,EAC3F;AACA,EAAA,OAAO,CAAA;AACT;AAkBO,SAAS,qBAAqB,UAAA,EAA8D;AACjG,EAAA,MAAM,OAAA,uBAAc,GAAA,EAA4B;AAChD,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,IAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AACpB,IAAA,MAAM,GAAA,GAAM,gBAAA,CAAiB,CAAA,CAAE,KAAK,CAAA;AACpC,IAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA;AAC3B,IAAA,IAAI,GAAA,EAAK,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA;AAAA,SACd,OAAA,CAAQ,GAAA,CAAI,GAAA,EAAK,CAAC,CAAC,CAAC,CAAA;AAAA,EAC3B;AACA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,KAAK,CAAA,IAAK,OAAA,EAAS;AACpC,IAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACtB,IAAA,MAAM,OAAA,GAAU,KAAA,CACb,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,MAAO,EAAE,CAAA,EAAG,CAAA,EAAE,CAAE,CAAA,CACxB,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,CAAA,CAAE,QAAA,IAAY,EAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CACvD,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,MAAM,CAAA;AACxB,IAAA,QAAA,CAAS,GAAA,CAAI,KAAA,EAAO,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAC,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,QAAA;AACT;AAOO,SAAS,eAAA,CACd,MACA,aAAA,EACQ;AACR,EAAA,MAAM,UAAA,GAAa,EAAA;AACnB,EAAA,IAAI,MAAA,GAAS,IAAA;AACb,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAA,EAAY,CAAA,EAAA,EAAK;AACnC,IAAA,MAAM,OAAO,MAAA,CAAO,OAAA,CAAQ,gBAAA,EAAkB,CAAC,OAAO,GAAA,KAAgB;AACpE,MAAA,MAAM,EAAE,IAAA,EAAM,QAAA,EAAS,GAAI,aAAa,GAAG,CAAA;AAC3C,MAAA,IAAI,sBAAA,CAAuB,GAAA,CAAI,IAAI,CAAA,EAAG,OAAO,KAAA;AAI7C,MAAA,MAAM,MAAA,GAAS,cAAc,GAAA,CAAI,IAAI,KAAK,aAAA,CAAc,GAAA,CAAI,gBAAA,CAAiB,IAAI,CAAC,CAAA;AAClF,MAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,MAAA,IAAI,QAAA,KAAa,MAAM,OAAO,QAAA;AAC9B,MAAA,OAAO,KAAA;AAAA,IACT,CAAC,CAAA;AACD,IAAA,IAAI,SAAS,MAAA,EAAQ;AACrB,IAAA,MAAA,GAAS,IAAA;AAAA,EACX;AACA,EAAA,OAAO,MAAA;AACT;AAeO,IAAM,4BAAA,GAAkD;AAAA,EAC7D,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,QAAA;AAAA,EAAU,OAAA;AAAA,EAAS;AACzC;AAcO,SAAS,gBAAA,CACd,MACA,UAAA,EACc;AACd,EAAA,MAAM,KAAA,GAAQ,KAAK,WAAA,EAAY;AAC/B,EAAA,IAAI,IAAA,KAAS,EAAA,IAAM,4BAAA,CAA6B,IAAA,CAAK,CAAC,CAAA,KAAM,KAAA,CAAM,UAAA,CAAW,CAAC,CAAC,CAAA,EAAG,OAAO,MAAA;AACzF,EAAA,IAAI,sBAAA,CAAuB,GAAA,CAAI,IAAI,CAAA,EAAG,OAAO,UAAA;AAC7C,EAAA,IAAI,UAAA,KAAe,MAAM,OAAO,SAAA;AAChC,EAAA,OAAO,WAAW,GAAA,CAAI,gBAAA,CAAiB,IAAI,CAAC,IAAI,OAAA,GAAU,SAAA;AAC5D;AAqBO,SAAS,mBAAA,CACd,MACA,IAAA,EACU;AACV,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,KAAK,MAAA,KAAW,CAAA,SAAU,EAAC;AAC3D,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,gBAAgB,CAAA,EAAG;AAC/C,IAAA,MAAM,EAAE,MAAM,QAAA,EAAS,GAAI,aAAa,CAAA,CAAE,CAAC,KAAK,EAAE,CAAA;AAClD,IAAA,IAAI,aAAa,IAAA,EAAM;AACvB,IAAA,IAAI,gBAAA,CAAiB,IAAA,EAAM,IAAA,CAAK,UAAU,MAAM,SAAA,EAAW;AAC3D,IAAA,MAAM,KAAA,GAAQ,iBAAiB,IAAI,CAAA;AACnC,IAAA,IAAI,IAAA,CAAK,MAAM,GAAA,CAAI,KAAK,KAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,EAAG;AAC9C,IAAA,IAAA,CAAK,IAAI,KAAK,CAAA;AACd,IAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,EACf;AACA,EAAA,OAAO,GAAA;AACT;;;AC9SO,SAAS,aAAA,CAAc,OAAgC,KAAA,EAA0C;AACtG,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAC,CAAA;AAC3C,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAsB;AAC3C,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAsB;AAC1C,EAAA,MAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,MAAA,KAAmB;AAChD,IAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,IAAK,CAAC,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,IAAK,MAAA,KAAW,MAAA,EAAQ;AACjE,IAAA,QAAA,CAAS,GAAA,CAAI,MAAA,EAAQ,CAAC,GAAI,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC,EAAI,MAAM,CAAC,CAAA;AAC9D,IAAA,OAAA,CAAQ,GAAA,CAAI,MAAA,EAAQ,CAAC,GAAI,OAAA,CAAQ,GAAA,CAAI,MAAM,CAAA,IAAK,EAAC,EAAI,MAAM,CAAC,CAAA;AAAA,EAC9D,CAAA;AACA,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO,KAAA,CAAM,IAAA,CAAK,MAAA,EAAQ,KAAK,MAAM,CAAA;AACxD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,OAAO,CAAA,CAAE,QAAA,KAAa,QAAA,IAAY,CAAA,CAAE,UAAU,KAAA,CAAM,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,QAAQ,CAAA;AACxE,IAAA,MAAM,QAAA,GAAY,EAAE,IAAA,EAAyD,aAAA;AAC7E,IAAA,IAAI,QAAA,IAAY,OAAO,QAAA,KAAa,QAAA,EAAU;AAC5C,MAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,MAAA,CAAO,QAAmC,CAAA,EAAG;AACxE,QAAA,MAAM,eAAgB,OAAA,EAA+C,YAAA;AACrE,QAAA,IAAI,OAAO,YAAA,KAAiB,QAAA,IAAY,cAAc,KAAA,CAAM,YAAA,EAAc,EAAE,EAAE,CAAA;AAAA,MAChF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,UAAU,OAAA,EAAQ;AAC7B;AAGO,SAAS,iBAAA,CAAkB,KAAA,EAAgC,KAAA,EAAgC,MAAA,EAAyB;AACzH,EAAA,OAAA,CAAQ,aAAA,CAAc,KAAA,EAAO,KAAK,CAAA,CAAE,QAAA,CAAS,IAAI,MAAM,CAAA,IAAK,EAAC,EAAG,MAAA,GAAS,CAAA;AAC3E;;;AC3CO,IAAM,mBAAA,uBAA+C,GAAA,CAAI;AAAA,EAC9D,iBAAA;AAAA,EACA,cAAA;AAAA,EACA,oBAAA;AAAA,EACA,cAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,mBAAA;AAAA;AAAA;AAAA;AAAA,EAIA,mBAAA;AAAA,EACA,aAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,eAAA;AAAA,EACA,iBAAA;AAAA,EACA,gBAAA;AAAA,EACA,kBAAA;AAAA,EACA,mBAAA;AAAA,EACA,gBAAA;AAAA,EACA,aAAA;AAAA,EACA,iBAAA;AAAA,EACA,eAAA;AAAA;AAAA;AAAA,EAGA,sBAAA;AAAA;AAAA;AAAA,EAGA,oBAAA;AAAA;AAAA;AAAA,EAGA,eAAA;AAAA;AAAA;AAAA;AAAA,EAIA,iBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAA;AAAA;AAAA;AAAA,EAGA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,iBAAA;AAAA,EACA,eAAA;AAAA,EACA,eAAA;AAAA,EACA,aAAA;AAAA,EACA,eAAA;AAAA;AAAA;AAAA,EAGA,qBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA;AAAA,EACA,qBAAA;AAAA,EACA,eAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,iBAAA;AAAA,EACA,cAAA;AAAA,EACA,cAAA;AAAA,EACA,kBAAA;AAAA,EACA,MAAA;AAAA;AAAA,EAEA,sBAAA;AAAA,EACA,iBAAA;AAAA,EACA,oBAAA;AAAA;AAAA,EAEA,YAAA;AAAA,EACA,UAAA;AAAA,EACA,iBAAA;AAAA;AAAA;AAAA,EAGA,iBAAA;AAAA,EACA,eAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gBAAA;AAAA,EACA,mBAAA;AAAA,EACA,qBAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAA;AAAA,EACA,aAAA;AAAA;AAAA;AAAA,EAGA,cAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,eAAA;AAAA,EACA,WAAA;AAAA,EACA,gBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA;AAAA,EACA,aAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAA;AAAA;AAAA;AAAA;AAAA,EAIA,mBAAA;AAAA;AAAA,EAEA,eAAA;AAAA;AAAA;AAAA,EAGA,kBAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA;AACF,CAAC;AAeM,IAAM,6BAAA,GAA6E;AAAA,EACxF,aAAA,EAAe,CAAC,YAAA,EAAc,YAAA,EAAc,cAAc,CAAA;AAAA,EAC1D,YAAA,EAAc,CAAC,YAAY,CAAA;AAAA,EAC3B,WAAA,EAAa,CAAC,YAAA,EAAc,OAAO,CAAA;AAAA,EACnC,UAAA,EAAY,CAAC,YAAA,EAAc,cAAA,EAAgB,eAAe,iBAAiB,CAAA;AAAA,EAC3E,WAAA,EAAa,CAAC,YAAY;AAC5B;AAGO,SAAS,kBAAA,CAAmB,KAAa,IAAA,EAA0C;AACxF,EAAA,IAAI,mBAAA,CAAoB,GAAA,CAAI,GAAG,CAAA,EAAG,OAAO,IAAA;AACzC,EAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,MAAA,CAAO,MAAA,CAAO,6BAAA,EAA+B,IAAI,CAAA,IAAK,6BAAA,CAA8B,IAAI,CAAA,CAAG,QAAA,CAAS,GAAG,CAAA;AAC5I;AAEA,IAAM,8BAA8B,IAAI,GAAA;AAAA,EACtC,MAAA,CAAO,QAAQ,6BAA6B,CAAA,CAAE,IAAI,CAAC,CAAC,MAAM,IAAI,CAAA,KAAM,CAAC,IAAA,kBAAM,IAAI,IAAI,CAAC,GAAG,qBAAqB,GAAG,IAAI,CAAC,CAAC,CAAC;AACxH,CAAA;AAGO,SAAS,oBAAoB,IAAA,EAAsD;AACxF,EAAA,OAAA,CAAQ,OAAO,IAAA,KAAS,QAAA,GAAW,4BAA4B,GAAA,CAAI,IAAI,IAAI,MAAA,KAAc,mBAAA;AAC3F;AAkBO,IAAM,sBAAA,uBAAkD,GAAA,CAAI;AAAA,EACjE,iBAAA;AAAA,EACA,cAAA;AAAA,EACA,oBAAA;AAAA,EACA,mBAAA;AAAA,EACA,mBAAA;AAAA,EACA,aAAA;AAAA,EACA,qBAAA;AAAA,EACA,aAAA;AAAA,EACA,iBAAA;AAAA,EACA,eAAA;AAAA,EACA,iBAAA;AAAA;AAAA;AAAA,EAGA,gBAAA;AAAA,EACA,kBAAA;AAAA,EACA,iBAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAA;AAAA,EACA,eAAA;AAAA;AAAA;AAAA;AAAA,EAIA,eAAA;AAAA;AAAA,EAEA;AACF,CAAC;AAOM,SAAS,0BAEd,KAAA,EAA0B;AAC1B,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,OAAO,IAAA,CAAK,IAAA;AAClB,IAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAClB,IAAA,IAAI,YAAA,GAAe,KAAA;AACnB,IAAA,KAAA,MAAW,OAAO,sBAAA,EAAwB;AACxC,MAAA,IAAI,OAAO,IAAA,EAAM;AACf,QAAA,YAAA,GAAe,IAAA;AACf,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,CAAC,cAAc,OAAO,IAAA;AAC1B,IAAA,MAAM,UAAmC,EAAC;AAC1C,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,MAAA,IAAI,CAAC,sBAAA,CAAuB,GAAA,CAAI,GAAG,CAAA,EAAG,OAAA,CAAQ,GAAG,CAAA,GAAI,KAAA;AAAA,IACvD;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,OAAA,EAAQ;AAAA,EAClC,CAAC,CAAA;AACH;;;AClQO,SAAS,gBAAA,CAAiB,OAAgB,IAAA,EAAyB;AACxE,EAAA,MAAM,QAAA,GAAW,KAAK,MAAA,KAAW,CAAA,GAAI,EAAC,GAAI,IAAA,CAAK,MAAM,GAAG,CAAA;AACxD,EAAA,OAAO,IAAA,CAAK,KAAA,EAAO,QAAA,EAAU,CAAC,CAAA;AAChC;AAOO,SAAS,qBAAqB,GAAA,EAA0B;AAC7D,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,IAAA,IAAI,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,MAAA,EAAW;AACnC,IAAA,IAAI,OAAO,CAAA,KAAM,QAAA,EAAU,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,SAAA,IAC5B,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,CAAA,KAAM,WAAW,GAAA,CAAI,IAAA,CAAK,MAAA,CAAO,CAAC,CAAC,CAAA;AAAA,SACvE,GAAA,CAAI,IAAA,CAAK,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,EACjC;AACA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,IAAA,CAAK,KAAA,EAAgB,QAAA,EAAoB,MAAA,EAA2B;AAC3E,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,MAAM,UAAqB,EAAC;AAC5B,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,KAAA,MAAW,CAAA,IAAK,KAAK,IAAA,EAAM,QAAA,EAAU,MAAM,CAAA,EAAG,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,IAC9D;AACA,IAAA,OAAO,OAAA;AAAA,EACT;AACA,EAAA,IAAI,MAAA,IAAU,QAAA,CAAS,MAAA,EAAQ,OAAO,CAAC,KAAK,CAAA;AAC5C,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,IAAA,GAAO,SAAS,MAAM,CAAA;AAC5B,IAAA,IAAI,CAAC,MAAA,CAAO,MAAA,CAAO,OAAiB,IAAI,CAAA,SAAU,EAAC;AACnD,IAAA,OAAO,KAAM,KAAA,CAAkC,IAAI,CAAA,EAAG,QAAA,EAAU,SAAS,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,OAAO,EAAC;AACV;;;ACOO,SAAS,aAAa,IAAA,EAAwB;AACnD,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,EAAU,OAAO,IAAA;AACrC,EAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,EAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AACrB,EAAA,MAAM,KAAA,GAAQ,QAAQ,CAAC,CAAA;AACvB,EAAA,IAAI,UAAU,GAAA,IAAO,KAAA,KAAU,GAAA,IAAO,KAAA,KAAU,OAAQ,CAAC,OAAA,CAAQ,IAAA,CAAK,OAAO,KAAK,OAAA,KAAY,MAAA,IAAU,OAAA,KAAY,OAAA,IAAW,YAAY,MAAA,EAAQ;AACjJ,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI;AAAE,IAAA,OAAO,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAAE,CAAA,CAAA,MAAQ;AAAE,IAAA,OAAO,IAAA;AAAA,EAAK;AACzD;AAEA,IAAM,OAAA,GAAU,KAAK,EAAA,GAAK,GAAA;AAC1B,IAAM,SAAS,EAAA,GAAK,OAAA;AACpB,IAAM,UAAU,CAAA,GAAI,MAAA;AAIb,SAAS,2BAA2B,GAAA,EAAiC;AAC1E,EAAA,MAAM,CAAA,GAAI,qCAAA,CAAsC,IAAA,CAAK,GAAG,CAAA;AACxD,EAAA,IAAI,CAAC,GAAG,OAAO,MAAA;AACf,EAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3B,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,GAAG,OAAO,MAAA;AAChC,EAAA,MAAM,MAAA,GAAS,CAAA,CAAE,CAAC,CAAA,KAAM,OAAA,GAAU,UAAU,CAAA,CAAE,CAAC,CAAA,KAAM,MAAA,GAAS,MAAA,GAAS,OAAA;AACvE,EAAA,OAAO,IAAI,KAAK,IAAA,CAAK,GAAA,KAAQ,CAAA,GAAI,MAAM,EAAE,WAAA,EAAY;AACvD;AAYO,SAAS,uBAAA,CACd,KACA,WAAA,EACQ;AACR,EAAA,IAAI,CAAC,MAAA,CAAO,IAAA,CAAK,GAAG,GAAG,OAAO,GAAA;AAC9B,EAAA,OAAO,GAAA,CAAI,OAAA,CAAQ,yBAAA,EAA2B,CAAC,IAAI,IAAA,KAAS;AAC1D,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAI,CAAA,CAAE,IAAA,EAAK;AAC9B,IAAA,IAAI,QAAQ,KAAA,EAAO,OAAA,iBAAO,IAAI,IAAA,IAAO,WAAA,EAAY;AACjD,IAAA,IAAI,QAAQ,2BAAA,EAA6B;AACvC,MAAA,MAAM,IAAI,WAAA,EAAa,iBAAA;AACvB,MAAA,OAAO,CAAA,IAAK,IAAA,GAAO,EAAA,GAAK,MAAA,CAAO,CAAC,CAAA;AAAA,IAClC;AACA,IAAA,IAAI,GAAA,CAAI,UAAA,CAAW,UAAU,CAAA,EAAG;AAC9B,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,KAAA,CAAM,UAAA,CAAW,MAAM,CAAA;AACxC,MAAA,MAAM,CAAA,GAAI,cAAc,IAAI,CAAA;AAC5B,MAAA,OAAO,CAAA,IAAK,IAAA,GAAO,EAAA,GAAK,MAAA,CAAO,CAAC,CAAA;AAAA,IAClC;AACA,IAAA,MAAM,QAAA,GAAW,2BAA2B,GAAG,CAAA;AAC/C,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,QAAA;AACnC,IAAA,OAAO,EAAA;AAAA,EACT,CAAC,CAAA;AACH;AAEO,SAAS,qBAAA,CACd,GAAA,EACA,SAAA,EACA,WAAA,EACA,SAAA,EACQ;AACR,EAAA,IAAI,KAAA,GAAQ,GAAA;AACZ,EAAA,IAAI,SAAA,IAAa,SAAA,CAAU,IAAA,GAAO,CAAA,EAAG;AACnC,IAAA,KAAA,GAAQ,eAAA,CAAgB,OAAO,SAAS,CAAA;AAAA,EAC1C;AACA,EAAA,MAAM,WAAA,GAAc,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA;AACrC,EAAA,IAAI,SAAA,KAAc,UAAA,IAAc,CAAC,WAAA,EAAa,OAAO,KAAA;AACrD,EAAA,OAAO,uBAAA,CAAwB,OAAO,WAAW,CAAA;AACnD;AAEA,SAAS,mBAAmB,CAAA,EAAoB;AAC9C,EAAA,IAAI,OAAO,CAAA,KAAM,QAAA,EAAU,OAAO,CAAA;AAClC,EAAA,IAAI,OAAO,CAAA,KAAM,SAAA,EAAW,OAAO,IAAI,CAAA,GAAI,CAAA;AAC3C,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,IAAA,MAAM,OAAA,GAAU,EAAE,IAAA,EAAK;AACvB,IAAA,IAAI,OAAA,KAAY,IAAI,OAAO,GAAA;AAC3B,IAAA,MAAM,CAAA,GAAI,OAAO,OAAO,CAAA;AACxB,IAAA,IAAI,CAAC,KAAA,CAAM,CAAC,CAAA,EAAG,OAAO,CAAA;AACtB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA;AAC5B,IAAA,IAAI,CAAC,KAAA,CAAM,CAAC,CAAA,EAAG,OAAO,CAAA;AAAA,EACxB;AACA,EAAA,OAAO,GAAA;AACT;AAIA,SAAS,aAAA,CAAc,GAAY,CAAA,EAAoB;AACrD,EAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,EAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,EAAA,IAAI,CAAC,MAAM,EAAE,CAAA,IAAK,CAAC,KAAA,CAAM,EAAE,CAAA,EAAG,OAAO,EAAA,GAAK,EAAA;AAC1C,EAAA,OAAO,MAAA,CAAO,KAAK,EAAE,CAAA,CAAE,cAAc,MAAA,CAAO,CAAA,IAAK,EAAE,CAAC,CAAA;AACtD;AAKA,SAAS,WAAA,CAAY,GAAY,CAAA,EAAqB;AACpD,EAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,EAAA,MAAM,EAAA,GAAK,mBAAmB,CAAC,CAAA;AAC/B,EAAA,IAAI,CAAC,MAAM,EAAE,CAAA,IAAK,CAAC,KAAA,CAAM,EAAE,CAAA,EAAG,OAAO,EAAA,KAAO,EAAA;AAC5C,EAAA,OAAO,OAAO,CAAA,IAAK,EAAE,CAAA,KAAM,MAAA,CAAO,KAAK,EAAE,CAAA;AAC3C;AAEA,SAAS,SAAA,CAAU,GAAW,aAAA,EAAgC;AAC5D,EAAA,OAAO,aAAA,GAAgB,CAAA,GAAI,CAAA,CAAE,WAAA,EAAY;AAC3C;AAEO,SAAS,iBAAA,CACd,UAAA,EACA,OAAA,EACA,SAAA,EACA,aACA,OAAA,EACS;AACT,EAAA,MAAM,IAAA,GAAA,CAAQ,SAAA,CAAU,KAAA,IAAS,EAAA,EAAI,IAAA,EAAK;AAC1C,EAAA,IAAI,UAAA;AACJ,EAAA,IAAI,SAAS,EAAA,EAAI;AACf,IAAA,UAAA,GAAa,UAAA,IAAc,OAAA;AAAA,EAC7B,CAAA,MAAO;AACL,IAAA,MAAM,OAAA,GAAU,gBAAA,CAAiB,UAAA,IAAc,OAAA,EAAS,IAAI,CAAA;AAC5D,IAAA,UAAA,GAAa,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,GAAI,MAAA;AAAA,EACjD;AAEA,EAAA,MAAM,SAAA,GAAY,sBAAsB,SAAA,CAAU,KAAA,IAAS,IAAI,SAAA,CAAU,SAAA,EAAW,WAAA,EAAa,OAAA,EAAS,SAAS,CAAA;AAInH,EAAA,MAAM,EAAA,GAAK,SAAS,aAAA,IAAiB,IAAA;AACrC,EAAA,MAAM,QAAA,GAAW,MAAA,CAAO,UAAA,IAAc,EAAE,CAAA;AAExC,EAAA,QAAQ,UAAU,QAAA;AAAU,IAC1B,KAAK,QAAA;AACH,MAAA,OAAO,UAAA,KAAe,UAAa,UAAA,KAAe,IAAA;AAAA,IACpD,KAAK,YAAA;AACH,MAAA,OAAO,UAAA,KAAe,UAAa,UAAA,KAAe,IAAA;AAAA,IACpD,KAAK,UAAA;AACH,MAAA,OAAO,SAAA,CAAU,UAAU,EAAE,CAAA,CAAE,SAAS,SAAA,CAAU,SAAA,EAAW,EAAE,CAAC,CAAA;AAAA,IAClE,KAAK,cAAA;AACH,MAAA,OAAO,CAAC,UAAU,QAAA,EAAU,EAAE,EAAE,QAAA,CAAS,SAAA,CAAU,SAAA,EAAW,EAAE,CAAC,CAAA;AAAA,IACnE,KAAK,aAAA;AACH,MAAA,OAAO,SAAA,CAAU,UAAU,EAAE,CAAA,CAAE,WAAW,SAAA,CAAU,SAAA,EAAW,EAAE,CAAC,CAAA;AAAA,IACpE,KAAK,WAAA;AACH,MAAA,OAAO,SAAA,CAAU,UAAU,EAAE,CAAA,CAAE,SAAS,SAAA,CAAU,SAAA,EAAW,EAAE,CAAC,CAAA;AAAA,IAClE,KAAK,OAAA,EAAS;AACZ,MAAA,IAAI,CAAC,WAAW,OAAO,KAAA;AACvB,MAAA,IAAI;AACF,QAAA,OAAO,IAAI,MAAA,CAAO,SAAS,CAAA,CAAE,KAAK,QAAQ,CAAA;AAAA,MAC5C,CAAA,CAAA,MAAQ;AACN,QAAA,OAAO,KAAA;AAAA,MACT;AAAA,IACF;AAAA,IACA,KAAK,GAAA;AACH,MAAA,OAAO,EAAA,GACH,WAAA,CAAY,UAAA,EAAY,SAAS,CAAA,GACjC,SAAA,CAAU,QAAA,EAAU,KAAK,CAAA,KAAM,SAAA,CAAU,SAAA,EAAW,KAAK,CAAA;AAAA,IAC/D,KAAK,IAAA;AACH,MAAA,OAAO,EAAA,GACH,CAAC,WAAA,CAAY,UAAA,EAAY,SAAS,CAAA,GAClC,SAAA,CAAU,QAAA,EAAU,KAAK,CAAA,KAAM,SAAA,CAAU,SAAA,EAAW,KAAK,CAAA;AAAA,IAC/D,KAAK,GAAA;AACH,MAAA,OAAO,aAAA,CAAc,UAAA,EAAY,SAAS,CAAA,GAAI,CAAA;AAAA,IAChD,KAAK,GAAA;AACH,MAAA,OAAO,aAAA,CAAc,UAAA,EAAY,SAAS,CAAA,GAAI,CAAA;AAAA,IAChD,KAAK,IAAA;AACH,MAAA,OAAO,aAAA,CAAc,UAAA,EAAY,SAAS,CAAA,IAAK,CAAA;AAAA,IACjD,KAAK,IAAA;AACH,MAAA,OAAO,aAAA,CAAc,UAAA,EAAY,SAAS,CAAA,IAAK,CAAA;AAAA,IACjD;AACE,MAAA,OAAO,KAAA;AAAA;AAEb;AAKO,SAAS,uBACd,UAAA,EACA,OAAA,EACA,UAAA,EACA,KAAA,EACA,aACA,OAAA,EACS;AACT,EAAA,MAAM,YAAY,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,IAAK,EAAE,QAAQ,CAAA;AAC1D,EAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AACnC,EAAA,MAAM,OAAA,GAAU,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA,KAAM,iBAAA,CAAkB,UAAA,EAAY,OAAA,EAAS,CAAA,EAAG,WAAA,EAAa,OAAO,CAAC,CAAA;AACpG,EAAA,OAAO,KAAA,KAAU,OAAO,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,GAAI,OAAA,CAAQ,MAAM,OAAO,CAAA;AACvE;;;ACpKO,SAAS,YAAA,CACd,IAAA,EACA,UAAA,EACA,WAAA,GAAsB,GAAA,EACd;AACR,EAAA,IAAI,UAAA,IAAc,GAAG,OAAO,CAAA;AAE5B,EAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,EAAA,IAAI,KAAA;AAEJ,EAAA,IAAI,YAAY,MAAA,EAAQ;AACtB,IAAA,KAAA,GAAQ,UAAA,GAAa,CAAA;AAAA,EACvB,CAAA,MAAA,IAAW,OAAA,CAAQ,UAAA,CAAW,OAAO,CAAA,EAAG;AACtC,IAAA,MAAM,SAAS,QAAA,CAAS,OAAA,CAAQ,KAAA,CAAM,CAAC,GAAG,EAAE,CAAA;AAC5C,IAAA,IAAI,KAAA,CAAM,MAAM,CAAA,IAAK,MAAA,GAAS,CAAA,EAAG,OAAO,YAAA,CAAa,WAAA,KAAgB,IAAA,GAAO,GAAA,GAAM,WAAA,EAAa,UAAU,CAAA;AACzG,IAAA,KAAA,GAAQ,aAAa,CAAA,GAAI,MAAA;AAAA,EAC3B,CAAA,MAAO;AACL,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,OAAA,EAAS,EAAE,CAAA;AAC9B,IAAA,IAAI,KAAA,CAAM,CAAC,CAAA,EAAG,OAAO,aAAa,WAAA,KAAgB,IAAA,GAAO,GAAA,GAAM,WAAA,EAAa,UAAU,CAAA;AACtF,IAAA,KAAA,GAAQ,CAAA,GAAI,CAAA;AAAA,EACd;AAEA,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,IAAI,KAAA,EAAO,UAAA,GAAa,CAAC,CAAC,CAAA;AACpD;AAaO,SAAS,UAAA,CACd,IAAA,EACA,IAAA,EACA,EAAA,EACA,IAAA,EACU;AACV,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAE/B,EAAA,MAAM,UAAU,YAAA,CAAa,IAAA,IAAQ,GAAA,EAAK,IAAA,CAAK,QAAQ,GAAG,CAAA;AAC1D,EAAA,MAAM,QAAQ,YAAA,CAAa,EAAA,IAAM,MAAA,EAAQ,IAAA,CAAK,QAAQ,MAAM,CAAA;AAC5D,EAAA,MAAM,aAAA,GAAgB,IAAA,KAAS,CAAA,IAAK,IAAA,KAAS,SAAY,CAAA,GAAI,IAAA;AAE7D,EAAA,IAAI,aAAA,GAAgB,CAAA,IAAK,OAAA,GAAU,KAAA,SAAc,EAAC;AAClD,EAAA,IAAI,aAAA,GAAgB,CAAA,IAAK,OAAA,GAAU,KAAA,SAAc,EAAC;AAElD,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,KAAA,IAAS,CAAA,GAAI,OAAA,EAAS,CAAA,IAAK,KAAA,EAAO,CAAA,IAAK,eAAe,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC3E,CAAA,MAAO;AACL,IAAA,KAAA,IAAS,CAAA,GAAI,OAAA,EAAS,CAAA,IAAK,KAAA,EAAO,CAAA,IAAK,eAAe,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA;AAAA,EAC3E;AACA,EAAA,OAAO,MAAA;AACT;AAUO,SAAS,sBACd,IAAA,EACqC;AACrC,EAAA,IAAI,CAAC,MAAM,OAAO,IAAA;AAElB,EAAA,MAAM,OAAO,IAAA,CAAK,UAAA;AAClB,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,KAAK,UAAA,CAAW,OAAO,GAAG,OAAO,IAAA;AAE/C,EAAA,MAAM,GAAA,GAAM,SAAS,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3C,EAAA,OAAO;AAAA,IACL,GAAG,IAAA;AAAA,IACH,UAAA,EAAY,MAAA;AAAA,IACZ,WAAW,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,CAAA,GAAI,MAAM,CAAC;AAAA,GAC5C;AACF;AAUO,SAAS,gBACd,IAAA,EACA,SAAA,EACA,SACA,SAAA,EACA,SAAA,EACA,cACA,cAAA,EACoB;AACpB,EAAA,OAAO,eAAe,IAAA,EAAM,SAAA,EAAW,SAAS,SAAA,EAAW,SAAA,EAAW,cAAc,cAAc,CAAA;AACpG;AAGA,SAAS,eACP,IAAA,EACA,SAAA,EACA,SACA,SAAA,EACA,SAAA,EACA,cACA,cAAA,EACoB;AACpB,EAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,MAAA;AAE5B,EAAA,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,KAAA,KAAU,iBAAiB,MAAA,EAAQ;AAClE,IAAA,MAAM,OAAA,GAAA,CAAW,cAAA,IAAkB,EAAA,EAAI,IAAA,EAAK;AAC5C,IAAA,IAAI,OAAA,KAAY,IAAI,OAAO,MAAA;AAC3B,IAAA,OAAO,aAAA,CAAc,SAAS,EAAE,CAAA;AAAA,EAClC;AAEA,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,SAAA,IAAa,MAAA;AAEzC,EAAA,MAAM,OAAO,SAAA,IAAa,GAAA;AAC1B,EAAA,MAAM,KAAK,OAAA,IAAW,MAAA;AACtB,EAAA,MAAM,OAAO,SAAA,IAAa,CAAA;AAC1B,EAAA,MAAM,cAAA,GAAiB,IAAA,KAAS,GAAA,IAAO,EAAA,KAAO,MAAA;AAC9C,EAAA,MAAM,gBAAgB,IAAA,KAAS,CAAA;AAC/B,EAAA,IAAI,cAAA,IAAkB,eAAe,OAAO,MAAA;AAE5C,EAAA,IAAI,KAAA,GAAQ,CAAA,EAAG,IAAI,CAAA,EAAA,EAAK,EAAE,CAAA,CAAA;AAC1B,EAAA,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,KAAS,KAAA,KAAU,CAAC,aAAA,EAAe;AACzD,IAAA,KAAA,IAAS,OAAO,CAAA,GAAI,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,GAAK,IAAI,IAAI,CAAA,CAAA;AAAA,EAC5C;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,aAAA,CAAc,GAAW,MAAA,EAAwB;AACxD,EAAA,IAAI,CAAA,CAAE,MAAA,IAAU,MAAA,EAAQ,OAAO,CAAA;AAC/B,EAAA,OAAO,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,MAAM,CAAA,GAAI,QAAA;AAC9B;AASO,SAAS,oBACd,IAAA,EAC6C;AAC7C,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,CAAK,IAAA,EAAM,CAAA;AACzC,EAAA,OAAO,MAAA,CAAO,EAAA,GAAK,EAAE,EAAA,EAAI,IAAA,EAAK,GAAI,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,MAAA,CAAO,KAAA,EAAM;AACrE;AAGA,SAAS,kBAAkB,KAAA,EAAwB;AACjD,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,IAAA;AAC7B,EAAA,IAAI,YAAA,CAAa,IAAA,CAAK,KAAK,CAAA,EAAG,OAAO,IAAA;AACrC,EAAA,MAAM,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AACnC,EAAA,IAAI,CAAA,SAAU,CAAC,KAAA,CAAM,SAAS,CAAA,CAAE,CAAC,CAAA,EAAG,EAAE,CAAC,CAAA;AACvC,EAAA,OAAO,KAAA;AACT;AAeO,SAAS,qBAAA,CAAsB,MAAc,UAAA,EAA8B;AAChF,EAAA,IAAI,UAAA,IAAc,CAAA,EAAG,OAAO,EAAC;AAC7B,EAAA,MAAM,MAAA,GAAS,cAAA,CAAe,IAAA,CAAK,IAAA,EAAM,CAAA;AACzC,EAAA,IAAI,CAAC,OAAO,EAAA,EAAI;AACd,IAAA,OAAA,CAAQ,IAAA,CAAK,uCAAA,EAAyC,IAAA,EAAM,QAAA,EAAK,OAAO,KAAK,CAAA;AAC7E,IAAA,OAAO,UAAA,CAAW,CAAA,EAAG,UAAA,GAAa,CAAA,EAAG,CAAC,CAAA;AAAA,EACxC;AACA,EAAA,IAAI,MAAA,CAAO,MAAM,MAAA,KAAW,CAAA,SAAU,UAAA,CAAW,CAAA,EAAG,UAAA,GAAa,CAAA,EAAG,CAAC,CAAA;AAErE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,IAAA,IAAQ,OAAO,KAAA,EAAO;AAC/B,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACzB,MAAA,GAAA,CAAI,IAAA,CAAK,YAAA,CAAa,IAAA,CAAK,KAAA,EAAO,UAAU,CAAC,CAAA;AAAA,IAC/C,CAAA,MAAO;AACL,MAAA,MAAM,IAAA,GAAO,YAAA,CAAa,IAAA,CAAK,IAAA,EAAM,UAAU,CAAA;AAC/C,MAAA,MAAM,EAAA,GAAK,YAAA,CAAa,IAAA,CAAK,EAAA,EAAI,UAAU,CAAA;AAC3C,MAAA,KAAA,MAAW,GAAA,IAAO,WAAW,IAAA,EAAM,EAAA,EAAI,KAAK,IAAI,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,GAAG,CAAA;AAAA,IACjE;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGA,SAAS,UAAA,CAAW,IAAA,EAAc,EAAA,EAAY,IAAA,EAAwB;AACpE,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,IAAI,OAAO,CAAA,EAAG;AACZ,IAAA,IAAI,IAAA,GAAO,EAAA,EAAI,OAAO,EAAC;AACvB,IAAA,KAAA,IAAS,CAAA,GAAI,MAAM,CAAA,IAAK,EAAA,EAAI,KAAK,IAAA,EAAM,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACnD,CAAA,MAAO;AACL,IAAA,IAAI,IAAA,GAAO,EAAA,EAAI,OAAO,EAAC;AACvB,IAAA,KAAA,IAAS,CAAA,GAAI,MAAM,CAAA,IAAK,EAAA,EAAI,KAAK,IAAA,EAAM,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACnD;AACA,EAAA,OAAO,GAAA;AACT;AAOO,SAAS,eAAA,CACd,OACA,QAAA,EACU;AACV,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAChC,EAAA,IAAI,uBAAA,CAAwB,QAAQ,CAAA,EAAG,OAAO,KAAA;AAC9C,EAAA,IAAI,QAAA,EAAU,iBAAiB,MAAA,EAAQ;AACrC,IAAA,MAAM,UAAU,qBAAA,CAAsB,QAAA,CAAS,cAAA,IAAkB,EAAA,EAAI,MAAM,MAAM,CAAA;AACjF,IAAA,OAAO,QAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,WAAW,KAAA,EAAO,QAAA,EAAU,WAAW,QAAA,EAAU,OAAA,EAAS,UAAU,SAAS,CAAA;AACtF;AAOO,SAAS,wBAAwB,QAAA,EAA+C;AACrF,EAAA,IAAI,CAAC,UAAU,OAAO,IAAA;AACtB,EAAA,IAAI,QAAA,CAAS,iBAAiB,MAAA,EAAQ;AACpC,IAAA,OAAA,CAAS,QAAA,CAAS,cAAA,IAAkB,EAAA,EAAI,IAAA,EAAK,KAAO,EAAA;AAAA,EACtD;AACA,EAAA,MAAM,EAAE,IAAA,EAAM,EAAA,EAAI,IAAA,EAAK,GAAI,eAAe,QAAQ,CAAA;AAClD,EAAA,OAAO,IAAA,KAAS,GAAA,IAAO,EAAA,KAAO,MAAA,IAAU,IAAA,KAAS,CAAA;AACnD;AAEO,SAAS,qBACd,QAAA,EAWQ;AACR,EAAA,MAAM,OAAO,QAAA,EAAU,UAAA;AACvB,EAAA,OAAO,iBAAA,CAAkB,UAAU,IAAI,CAAA;AACzC;AAEA,SAAS,iBAAA,CACP,UACA,IAAA,EACQ;AACR,EAAA,IAAI,IAAA,KAAS,QAAQ,OAAO,6BAAA;AAC5B,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,iBAAA,CAAkB,QAAQ,CAAA;AACtD,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,iBAAA,CAAkB,QAAQ,CAAA;AACtD,EAAA,IAAI,IAAA,KAAS,KAAA,EAAO,OAAO,gBAAA,CAAiB,QAAQ,CAAA;AACpD,EAAA,OAAO,2BAAA;AACT;AAEA,SAAS,kBACP,QAAA,EACQ;AACR,EAAA,MAAM,SAAA,GAAY,kBAAA,CAAmB,QAAA,EAAU,SAAS,CAAA;AACxD,EAAA,OAAO,CAAA,YAAA,EAAe,YAAA,CAAa,SAAS,CAAC,CAAA,CAAA,CAAA;AAC/C;AAEA,SAAS,kBACP,QAAA,EACQ;AACR,EAAA,IAAI,uBAAA,CAAwB,QAAQ,CAAA,EAAG,OAAO,0CAAA;AAC9C,EAAA,IAAI,QAAA,EAAU,iBAAiB,MAAA,EAAQ;AACrC,IAAA,MAAM,SAAS,cAAA,CAAA,CAAgB,QAAA,CAAS,cAAA,IAAkB,EAAA,EAAI,MAAM,CAAA;AACpE,IAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,0CAAA;AAAA,EACzB;AACA,EAAA,MAAM,MAAA,GAAS,qBAAqB,QAAQ,CAAA;AAC5C,EAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAClC,IAAA,OAAO,kDAAA;AAAA,EACT;AACA,EAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAClC,IAAA,OAAO,CAAA,2BAAA,EAA8B,OAAO,YAAY,CAAA,CAAA,CAAA;AAAA,EAC1D;AACA,EAAA,OAAO,CAAA,4BAAA,EAA+B,OAAO,IAAI,CAAA,CAAA,CAAA;AACnD;AAEA,SAAS,iBACP,QAAA,EACQ;AACR,EAAA,IAAI,uBAAA,CAAwB,QAAQ,CAAA,EAAG,OAAO,2BAAA;AAC9C,EAAA,IAAI,QAAA,EAAU,iBAAiB,MAAA,EAAQ;AACrC,IAAA,MAAM,SAAS,cAAA,CAAA,CAAgB,QAAA,CAAS,cAAA,IAAkB,EAAA,EAAI,MAAM,CAAA;AACpE,IAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,2BAAA;AAAA,EACzB;AACA,EAAA,MAAM,MAAA,GAAS,qBAAqB,QAAQ,CAAA;AAC5C,EAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAClC,IAAA,OAAO,iEAAA;AAAA,EACT;AACA,EAAA,IAAI,MAAA,CAAO,SAAS,cAAA,EAAgB;AAClC,IAAA,OAAO,CAAA,YAAA,EAAe,OAAO,YAAY,CAAA,CAAA,CAAA;AAAA,EAC3C;AACA,EAAA,OAAO,CAAA,OAAA,EAAU,OAAO,IAAI,CAAA,SAAA,CAAA;AAC9B;AAIA,SAAS,mBAAmB,GAAA,EAAiC;AAC3D,EAAA,MAAM,OAAA,GAAA,CAAW,GAAA,IAAO,EAAA,EAAI,IAAA,EAAK;AACjC,EAAA,IAAI,OAAA,KAAY,IAAI,OAAO,GAAA;AAC3B,EAAA,IAAI,CAAC,iBAAA,CAAkB,OAAO,CAAA,EAAG,OAAO,GAAA;AACxC,EAAA,OAAO,OAAA;AACT;AAEA,SAAS,eACP,QAAA,EACgB;AAChB,EAAA,MAAM,IAAA,GAAA,CAAS,QAAA,EAAU,SAAA,IAAa,EAAA,EAAI,MAAK,IAAK,GAAA;AACpD,EAAA,MAAM,EAAA,GAAA,CAAO,QAAA,EAAU,OAAA,IAAW,EAAA,EAAI,MAAK,IAAK,MAAA;AAChD,EAAA,MAAM,UAAU,QAAA,EAAU,SAAA;AAC1B,EAAA,MAAM,IAAA,GAAO,OAAA,KAAY,MAAA,IAAa,OAAA,KAAY,IAAI,CAAA,GAAI,OAAA;AAC1D,EAAA,OAAO,EAAE,IAAA,EAAM,EAAA,EAAI,IAAA,EAAK;AAC1B;AAGA,SAAS,aAAa,SAAA,EAA2B;AAC/C,EAAA,IAAI,SAAA,KAAc,KAAK,OAAO,gBAAA;AAC9B,EAAA,IAAI,QAAQ,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,QAAQ,SAAS,CAAA,CAAA;AACrD,EAAA,IAAI,SAAA,KAAc,MAAA,IAAU,SAAA,KAAc,QAAA,EAAU,OAAO,eAAA;AAC3D,EAAA,MAAM,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,SAAS,CAAA;AACvC,EAAA,IAAI,CAAA,EAAG;AACL,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3B,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,yBAAA;AACpB,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,wBAAA;AACpB,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,yBAAA;AACpB,IAAA,OAAO,CAAA,IAAA,EAAO,OAAA,CAAQ,CAAA,GAAI,CAAC,CAAC,CAAA,eAAA,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,gBAAA;AACT;AAEA,SAAS,YAAY,SAAA,EAA2B;AAC9C,EAAA,IAAI,OAAA,CAAQ,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,SAAA;AACpC,EAAA,IAAI,SAAA,KAAc,MAAA,IAAU,SAAA,KAAc,QAAA,EAAU,OAAO,cAAA;AAC3D,EAAA,MAAM,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,SAAS,CAAA;AACvC,EAAA,IAAI,CAAA,EAAG;AACL,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3B,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,oBAAA;AACpB,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,mBAAA;AACpB,IAAA,IAAI,CAAA,KAAM,GAAG,OAAO,oBAAA;AACpB,IAAA,OAAO,CAAA,IAAA,EAAO,OAAA,CAAQ,CAAA,GAAI,CAAC,CAAC,CAAA,UAAA,CAAA;AAAA,EAC9B;AACA,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,QAAQ,CAAA,EAAmB;AAClC,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA;AACvB,EAAA,MAAM,UAAU,IAAA,GAAO,GAAA;AACvB,EAAA,IAAI,WAAW,EAAA,IAAM,OAAA,IAAW,EAAA,EAAI,OAAO,GAAG,CAAC,CAAA,EAAA,CAAA;AAC/C,EAAA,QAAQ,OAAO,EAAA;AAAI,IACjB,KAAK,CAAA;AAAG,MAAA,OAAO,GAAG,CAAC,CAAA,EAAA,CAAA;AAAA,IACnB,KAAK,CAAA;AAAG,MAAA,OAAO,GAAG,CAAC,CAAA,EAAA,CAAA;AAAA,IACnB,KAAK,CAAA;AAAG,MAAA,OAAO,GAAG,CAAC,CAAA,EAAA,CAAA;AAAA,IACnB;AAAS,MAAA,OAAO,GAAG,CAAC,CAAA,EAAA,CAAA;AAAA;AAExB;AAOA,SAAS,qBACP,QAAA,EACiB;AACjB,EAAA,IAAI,QAAA,EAAU,iBAAiB,MAAA,EAAQ;AACrC,IAAA,OAAO,wBAAA,CAAA,CAA0B,QAAA,CAAS,cAAA,IAAkB,EAAA,EAAI,MAAM,CAAA;AAAA,EACxE;AACA,EAAA,OAAO,yBAAA,CAA0B,cAAA,CAAe,QAAQ,CAAC,CAAA;AAC3D;AAEA,SAAS,UAAU,KAAA,EAAoD;AACrE,EAAA,IAAI,YAAA,CAAa,IAAA,CAAK,KAAK,CAAA,EAAG,OAAO,UAAA;AACrC,EAAA,IAAI,UAAU,MAAA,IAAU,YAAA,CAAa,IAAA,CAAK,KAAK,GAAG,OAAO,UAAA;AACzD,EAAA,OAAO,SAAA;AACT;AAEA,SAAS,eAAe,KAAA,EAAuB;AAC7C,EAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,CAAA;AAC7B,EAAA,MAAM,CAAA,GAAI,cAAA,CAAe,IAAA,CAAK,KAAK,CAAA;AACnC,EAAA,OAAO,IAAI,QAAA,CAAS,CAAA,CAAE,CAAC,CAAA,EAAG,EAAE,CAAA,GAAI,CAAA;AAClC;AAEA,SAAS,aAAA,CAAc,GAAW,CAAA,EAAyC;AACzE,EAAA,MAAM,EAAA,GAAK,UAAU,CAAC,CAAA;AACtB,EAAA,MAAM,EAAA,GAAK,UAAU,CAAC,CAAA;AACtB,EAAA,IAAI,EAAA,KAAO,IAAI,OAAO,eAAA;AACtB,EAAA,IAAI,OAAO,UAAA,EAAY;AACrB,IAAA,MAAM,EAAA,GAAK,QAAA,CAAS,CAAA,EAAG,EAAE,CAAA;AACzB,IAAA,MAAM,EAAA,GAAK,QAAA,CAAS,CAAA,EAAG,EAAE,CAAA;AACzB,IAAA,OAAO,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,EAAA,GAAK,KAAK,CAAA,GAAI,CAAA;AAAA,EACtC;AACA,EAAA,IAAI,OAAO,UAAA,EAAY;AACrB,IAAA,MAAM,EAAA,GAAK,eAAe,CAAC,CAAA;AAC3B,IAAA,MAAM,EAAA,GAAK,eAAe,CAAC,CAAA;AAC3B,IAAA,OAAO,EAAA,GAAK,EAAA,GAAK,CAAA,GAAI,EAAA,GAAK,KAAK,EAAA,GAAK,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,eAAA;AACT;AAEA,SAAS,0BAA0B,CAAA,EAAoC;AACrE,EAAA,MAAM,EAAE,IAAA,EAAM,EAAA,EAAI,IAAA,EAAK,GAAI,CAAA;AAE3B,EAAA,MAAM,GAAA,GAAM,aAAA,CAAc,IAAA,EAAM,EAAE,CAAA;AAClC,EAAA,IAAI,QAAQ,eAAA,EAAiB;AAC3B,IAAA,IAAI,OAAO,CAAA,IAAK,GAAA,KAAQ,GAAG,OAAO,EAAE,MAAM,cAAA,EAAe;AACzD,IAAA,IAAI,OAAO,CAAA,IAAK,GAAA,KAAQ,IAAI,OAAO,EAAE,MAAM,cAAA,EAAe;AAAA,EAC5D;AAEA,EAAA,IAAI,QAAQ,CAAA,EAAG;AACb,IAAA,OAAO,EAAE,IAAA,EAAM,cAAA,EAAgB,YAAA,EAAc,YAAA,CAAa,IAAI,CAAA,EAAE;AAAA,EAClE;AAEA,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA;AAC7B,EAAA,IAAI,IAAA,KAAS,EAAA,IAAM,IAAA,KAAS,MAAA,IAAU,OAAO,GAAA,EAAK;AAChD,IAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,4BAAA,EAA6B;AAAA,EAC7D;AAEA,EAAA,IAAI,IAAA,GAAO,SAAS,WAAA,CAAY,IAAI,CAAC,CAAA,SAAA,EAAY,WAAA,CAAY,EAAE,CAAC,CAAA,CAAA;AAChE,EAAA,IAAI,OAAA,KAAY,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG;AAC7B,IAAA,IAAA,IAAQ,mBAAA;AAAA,EACV,CAAA,MAAA,IAAW,OAAA,GAAU,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG;AAClC,IAAA,IAAA,IAAQ,CAAA,QAAA,EAAW,OAAA,CAAQ,OAAO,CAAC,CAAA,MAAA,CAAA;AAAA,EACrC,CAAA,MAAA,IAAW,OAAA,GAAU,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG;AAClC,IAAA,IAAA,IAAQ,CAAA,QAAA,EAAW,OAAA,CAAQ,OAAO,CAAC,CAAA,kBAAA,CAAA;AAAA,EACrC;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAK;AAC/B;AAoBA,SAAS,eAAe,IAAA,EAA2B;AACjD,EAAA,IAAI,IAAA,KAAS,IAAI,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,EAAO,EAAC,EAAE;AAC9C,EAAA,MAAM,QAAoB,EAAC;AAC3B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC1B,EAAA,KAAA,MAAW,WAAW,GAAA,EAAK;AACzB,IAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,EAAK;AAC1B,IAAA,IAAI,SAAS,EAAA,EAAI,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,OAAO,2BAAA,EAA4B;AACxE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA;AAClC,IAAA,IAAI,aAAa,EAAA,EAAI;AACnB,MAAA,IAAI,CAAC,iBAAA,CAAkB,IAAI,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,eAAA,EAAkB,IAAI,CAAA,CAAA,EAAG;AAClF,MAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,MAAM,CAAA;AACzC,MAAA;AAAA,IACF;AACA,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,QAAQ,EAAE,IAAA,EAAK;AAC1C,IAAA,MAAM,gBAAgB,IAAA,CAAK,KAAA,CAAM,QAAA,GAAW,CAAC,EAAE,IAAA,EAAK;AACpD,IAAA,IAAI,IAAA,KAAS,EAAA,IAAM,aAAA,KAAkB,EAAA,EAAI;AACvC,MAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,wBAAA,EAA2B,IAAI,CAAA,CAAA,EAAG;AAAA,IAC/D;AACA,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,OAAA,CAAQ,GAAG,CAAA;AAC1C,IAAA,MAAM,KAAA,GAAQ,aAAa,EAAA,GAAK,aAAA,GAAgB,cAAc,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,CAAE,IAAA,EAAK;AACtF,IAAA,MAAM,OAAA,GAAU,aAAa,EAAA,GAAK,IAAA,GAAO,cAAc,KAAA,CAAM,QAAA,GAAW,CAAC,CAAA,CAAE,IAAA,EAAK;AAChF,IAAA,IAAI,KAAA,KAAU,IAAI,OAAO,EAAE,IAAI,KAAA,EAAO,KAAA,EAAO,CAAA,wBAAA,EAA2B,IAAI,CAAA,CAAA,EAAG;AAC/E,IAAA,IAAI,CAAC,iBAAA,CAAkB,IAAI,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,eAAA,EAAkB,IAAI,CAAA,CAAA,EAAG;AAClF,IAAA,IAAI,CAAC,iBAAA,CAAkB,KAAK,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,CAAA,eAAA,EAAkB,KAAK,CAAA,CAAA,EAAG;AACpF,IAAA,IAAI,IAAA,GAAO,CAAA;AACX,IAAA,IAAI,YAAY,IAAA,EAAM;AACpB,MAAA,IAAI,CAAC,SAAA,CAAU,IAAA,CAAK,OAAO,CAAA,SAAU,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,yBAAA,EAA0B;AACnF,MAAA,MAAM,MAAA,GAAS,QAAA,CAAS,OAAA,EAAS,EAAE,CAAA;AACnC,MAAA,IAAA,GAAO,MAAA,KAAW,IAAI,CAAA,GAAI,MAAA;AAAA,IAC5B;AACA,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,MAAM,IAAA,EAAM,EAAA,EAAI,KAAA,EAAO,IAAA,EAAM,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAM;AAC3B;AAEA,SAAS,yBAAyB,IAAA,EAA+B;AAC/D,EAAA,MAAM,MAAA,GAAS,eAAe,IAAI,CAAA;AAClC,EAAA,IAAI,CAAC,MAAA,CAAO,EAAA,EAAI,OAAO,EAAE,MAAM,cAAA,EAAe;AAC9C,EAAA,IAAI,MAAA,CAAO,MAAM,MAAA,KAAW,CAAA,SAAU,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,OAAA,EAAQ;AAErE,EAAA,MAAM,UAAA,GAAa,MAAA,CAAO,KAAA,CAAM,GAAA,CAAc,CAAC,CAAA,KAAM;AACnD,IAAA,IAAI,CAAA,CAAE,SAAS,OAAA,EAAS;AACtB,MAAA,MAAM,GAAA,GAAM,aAAA,CAAc,CAAA,CAAE,IAAA,EAAM,EAAE,EAAE,CAAA;AACtC,MAAA,IAAI,GAAA,KAAQ,GAAG,OAAO,EAAE,MAAM,OAAA,EAAS,KAAA,EAAO,EAAE,IAAA,EAAK;AAAA,IACvD;AACA,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,IAAI,WAAW,MAAA,KAAW,CAAA,IAAK,WAAW,CAAC,CAAA,CAAE,SAAS,OAAA,EAAS;AAC7D,IAAA,OAAO,EAAE,MAAM,cAAA,EAAgB,YAAA,EAAc,aAAa,UAAA,CAAW,CAAC,CAAA,CAAE,KAAK,CAAA,EAAE;AAAA,EACjF;AAEA,EAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM;AACrC,IAAA,IAAI,EAAE,IAAA,KAAS,OAAA,EAAS,OAAO,WAAA,CAAY,EAAE,KAAK,CAAA;AAClD,IAAA,IAAI,IAAA,GAAO,CAAA,EAAG,WAAA,CAAY,CAAA,CAAE,IAAI,CAAC,CAAA,SAAA,EAAY,WAAA,CAAY,CAAA,CAAE,EAAE,CAAC,CAAA,CAAA;AAC9D,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA;AAC/B,IAAA,IAAI,OAAA,KAAY,CAAA,IAAK,CAAA,CAAE,IAAA,GAAO,CAAA,EAAG;AAC/B,MAAA,IAAI,EAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,EAAA,KAAO,KAAK,OAAO,sBAAA;AAC9C,MAAA,IAAA,IAAQ,aAAA;AAAA,IACV,CAAA,MAAA,IAAW,OAAA,GAAU,CAAA,IAAK,CAAA,CAAE,OAAO,CAAA,EAAG;AACpC,MAAA,IAAA,IAAQ,CAAA,QAAA,EAAW,OAAA,CAAQ,OAAO,CAAC,CAAA,CAAA,CAAA;AAAA,IACrC,CAAA,MAAA,IAAW,OAAA,GAAU,CAAA,IAAK,CAAA,CAAE,OAAO,CAAA,EAAG;AACpC,MAAA,IAAA,IAAQ,CAAA,QAAA,EAAW,OAAA,CAAQ,OAAO,CAAC,CAAA,aAAA,CAAA;AAAA,IACrC;AACA,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AAED,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG;AACzB,IAAA,MAAA,GAAS,SAAS,CAAC,CAAA;AAAA,EACrB,CAAA,MAAA,IAAW,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAChC,IAAA,MAAA,GAAS,GAAG,QAAA,CAAS,CAAC,CAAC,CAAA,KAAA,EAAQ,QAAA,CAAS,CAAC,CAAC,CAAA,CAAA;AAAA,EAC5C,CAAA,MAAO;AACL,IAAA,MAAM,OAAO,QAAA,CAAS,KAAA,CAAM,GAAG,EAAE,CAAA,CAAE,KAAK,IAAI,CAAA;AAC5C,IAAA,MAAA,GAAS,GAAG,IAAI,CAAA,MAAA,EAAS,SAAS,QAAA,CAAS,MAAA,GAAS,CAAC,CAAC,CAAA,CAAA;AAAA,EACxD;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,IAAA,EAAM,CAAA,MAAA,EAAS,MAAM,CAAA,CAAA,EAAG;AAClD;AAOO,SAAS,WAAA,CAAY,OAAiB,MAAA,EAAwC;AACnF,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,QAAQ,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAEtD,EAAA,QAAQ,OAAO,IAAA;AAAM,IACnB,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,MAAM,YAAA,CAAa,MAAA,CAAO,aAAa,GAAA,EAAK,KAAA,CAAM,QAAQ,GAAG,CAAA;AACnE,MAAA,OAAO,cAAA,CAAe,KAAA,EAAO,CAAC,GAAG,CAAC,CAAA;AAAA,IACpC;AAAA,IACA,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,OAAA,GAAU,kBAAkB,KAAA,CAAM,MAAA,EAAQ,OAAO,SAAA,EAAW,MAAA,CAAO,OAAA,EAAS,MAAA,CAAO,SAAS,CAAA;AAClG,MAAA,OAAO,cAAA,CAAe,OAAO,OAAO,CAAA;AAAA,IACtC;AAAA,IACA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,UAAU,qBAAA,CAAsB,MAAA,CAAO,cAAA,IAAkB,EAAA,EAAI,MAAM,MAAM,CAAA;AAC/E,MAAA,OAAO,cAAA,CAAe,OAAO,OAAO,CAAA;AAAA,IACtC;AAAA,IACA,KAAK,QAAA;AACH,MAAA,OAAO,aAAa,KAAA,EAAO,MAAA,CAAO,WAAA,IAAe,CAAA,EAAG,OAAO,IAAI,CAAA;AAAA,IACjE,KAAK,QAAA;AACH,MAAA,OAAO,cAAA,CAAe,KAAA,EAAO,MAAA,CAAO,aAAa,CAAA;AAAA,IACnD,KAAK,WAAA;AACH,MAAA,OAAO,iBAAA,CAAkB,OAAO,MAAM,CAAA;AAAA,IACxC,KAAK,WAAA;AACH,MAAA,OAAO,gBAAA,CAAiB,KAAA,EAAO,MAAA,CAAO,aAAA,EAAe,OAAO,aAAa,CAAA;AAAA,IAC3E;AACE,MAAA,OAAO,EAAE,MAAA,EAAQ,IAAI,IAAA,EAAM,KAAA,CAAM,OAAM,EAAE;AAAA;AAE/C;AAOA,SAAS,cAAA,CAAe,OAAiB,aAAA,EAAyC;AAChF,EAAA,MAAM,SAAA,GAAY,IAAI,GAAA,CAAI,aAAA,CAAc,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,IAAK,CAAA,IAAK,CAAA,GAAI,KAAA,CAAM,MAAM,CAAC,CAAA;AACjF,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,OAAiB,EAAC;AACxB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,IAAI,SAAA,CAAU,IAAI,CAAC,CAAA,SAAU,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,SACrC,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,EACzB;AACA,EAAA,OAAO,EAAE,QAAQ,IAAA,EAAK;AACxB;AAOO,SAAS,iBAAA,CACd,MAAA,EACA,IAAA,EACA,EAAA,EACA,IAAA,EACU;AACV,EAAA,IAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC1B,EAAA,MAAM,OAAA,GAAU,YAAA,CAAa,IAAA,IAAQ,GAAA,EAAK,QAAQ,GAAG,CAAA;AACrD,EAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,EAAA,IAAM,MAAA,EAAQ,QAAQ,MAAM,CAAA;AACvD,EAAA,MAAM,aAAA,GAAgB,IAAA,KAAS,CAAA,IAAK,IAAA,KAAS,SAAY,CAAA,GAAI,IAAA;AAC7D,EAAA,IAAI,aAAA,GAAgB,CAAA,IAAK,OAAA,GAAU,KAAA,SAAc,EAAC;AAClD,EAAA,IAAI,aAAA,GAAgB,CAAA,IAAK,OAAA,GAAU,KAAA,SAAc,EAAC;AAClD,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,IAAI,gBAAgB,CAAA,EAAG;AACrB,IAAA,KAAA,IAAS,CAAA,GAAI,SAAS,CAAA,IAAK,KAAA,EAAO,KAAK,aAAA,EAAe,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACrE,CAAA,MAAO;AACL,IAAA,KAAA,IAAS,CAAA,GAAI,SAAS,CAAA,IAAK,KAAA,EAAO,KAAK,aAAA,EAAe,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACrE;AACA,EAAA,OAAO,MAAA;AACT;AAYA,SAAS,WAAW,IAAA,EAA4B;AAC9C,EAAA,IAAI,IAAI,IAAA,GAAO,CAAA;AACf,EAAA,OAAO,MAAM;AACX,IAAA,CAAA,GAAK,IAAI,UAAA,GAAc,CAAA;AACvB,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,CAAA,GAAI,KAAK,IAAA,CAAK,CAAA,GAAK,CAAA,KAAM,EAAA,EAAK,IAAI,CAAC,CAAA;AACnC,IAAA,CAAA,IAAK,IAAI,IAAA,CAAK,IAAA,CAAK,IAAK,CAAA,KAAM,CAAA,EAAI,IAAI,EAAE,CAAA;AACxC,IAAA,OAAA,CAAA,CAAS,CAAA,GAAK,CAAA,KAAM,EAAA,MAAS,CAAA,IAAK,UAAA;AAAA,EACpC,CAAA;AACF;AAGA,SAAS,SAAS,CAAA,EAAmB;AACnC,EAAA,IAAI,IAAI,UAAA,GAAa,CAAA;AACrB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,CAAE,QAAQ,CAAA,EAAA,EAAK;AACjC,IAAA,CAAA,IAAK,CAAA,CAAE,WAAW,CAAC,CAAA;AACnB,IAAA,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAA,EAAG,QAAQ,CAAA;AAAA,EAC3B;AACA,EAAA,OAAO,CAAA;AACT;AAOO,SAAS,YAAA,CAAa,KAAA,EAAiB,KAAA,EAAe,IAAA,EAA+B;AAC1F,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,QAAQ,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AACtD,EAAA,MAAM,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,KAAA,EAAO,KAAA,CAAM,MAAM,CAAC,CAAA;AACnD,EAAA,MAAM,IAAA,GAAO,IAAA,IAAQ,IAAA,CAAK,MAAA,GAAS,CAAA,GAAI,WAAW,QAAA,CAAS,IAAI,CAAC,CAAA,GAAI,IAAA,CAAK,MAAA;AAEzE,EAAA,MAAM,UAAU,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAG,MAAM,CAAC,CAAA;AACrC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,CAAA,GAAI,IAAI,IAAA,CAAK,KAAA,CAAM,MAAK,IAAK,OAAA,CAAQ,SAAS,CAAA,CAAE,CAAA;AACrD,IAAA,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAC,CAAA,GAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAC,CAAA;AAAA,EACrD;AACA,EAAA,OAAO,eAAe,KAAA,EAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA;AAClD;AAQO,SAAS,cAAA,CAAe,OAAiB,OAAA,EAA6C;AAC3F,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,QAAQ,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AACtD,EAAA,MAAM,CAAA,GAAI,UAAU,MAAA,CAAO,QAAA,CAAS,QAAQ,IAAA,EAAK,EAAG,EAAE,CAAA,GAAI,GAAA;AAC1D,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,QAAA,CAAS,CAAC,IAAI,CAAA,GAAI,CAAA;AACvC,EAAA,MAAM,OAAQ,KAAA,GAAQ,KAAA,CAAM,MAAA,GAAU,KAAA,CAAM,UAAU,KAAA,CAAM,MAAA;AAC5D,EAAA,OAAO,cAAA,CAAe,KAAA,EAAO,CAAC,GAAG,CAAC,CAAA;AACpC;AAUO,SAAS,iBAAA,CACd,OACA,MAAA,EACgB;AAChB,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,QAAQ,EAAC,EAAG,IAAA,EAAM,EAAC,EAAE;AAStD,EAAA,MAAM,EAAA,GAAK,OAAO,WAAA,IAAe,GAAA;AAKjC,EAAA,MAAM,IAAA,GAAO,EAAE,aAAA,EAAe,MAAA,CAAO,0BAA0B,KAAA,EAAM;AACrE,EAAA,MAAM,QAAA,GAAW,OAAO,cAAA,KAAmB,KAAA;AAC3C,EAAA,MAAM,IAAA,GAAO;AAAA,IAEX,KAAA,EAAO,OAAO,cAAA,IAAkB,EAAA;AAAA,IAChC,QAAA,EAAU,EAAA;AAAA,IACV,KAAA,EAAO,OAAO,cAAA,IAAkB,EAAA;AAAA,IAChC,SAAA,EAAW;AAAA,GACb;AACA,EAAA,MAAM,iBAA2B,EAAC;AAClC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,MAAA,GAAS,YAAA,CAAa,KAAA,CAAM,CAAC,CAAC,CAAA;AACpC,IAAA,MAAM,GAAA,GAAM,kBAAkB,MAAA,EAAQ,KAAA,CAAM,CAAC,CAAA,EAAG,IAAA,EAAM,QAAW,IAAI,CAAA;AACrE,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,cAAA,CAAe,KAAK,CAAC,CAAA;AACrB,MAAA,IAAI,CAAC,QAAA,EAAU;AAAA,IACjB;AAAA,EACF;AACA,EAAA,OAAO,cAAA,CAAe,OAAO,cAAc,CAAA;AAC7C;AAQO,SAAS,gBAAA,CACd,KAAA,EACA,KAAA,EACA,KAAA,EACgB;AAChB,EAAA,OAAO,kBAAkB,KAAA,EAAO;AAAA,IAE9B,cAAA,EAAgB,KAAA;AAAA,IAChB,WAAA,EAAa,GAAA;AAAA,IACb,cAAA,EAAgB,KAAA;AAAA,IAChB,cAAA,EAAgB;AAAA,GACjB,CAAA;AACH;AAmBO,SAAS,mBAAA,CACd,MAAA,EACA,WAAA,EACA,SAAA,EACgB;AAChB,EAAA,MAAM,OAAA,GAAU,CAAC,CAAA,KAA8C;AAC7D,IAAA,IAAI,CAAA,IAAK,MAAM,OAAO,CAAA;AACtB,IAAA,MAAM,YAAA,GAAe,eAAA,CAAgB,CAAA,EAAG,SAAS,CAAA;AACjD,IAAA,OAAO,uBAAA,CAAwB,cAAc,WAAW,CAAA;AAAA,EAC1D,CAAA;AACA,EAAA,OAAO;AAAA,IACL,GAAG,MAAA;AAAA,IACH,aAAA,EAAe,OAAA,CAAQ,MAAA,CAAO,aAAa,CAAA;AAAA,IAC3C,cAAA,EAAgB,OAAA,CAAQ,MAAA,CAAO,cAAc,CAAA;AAAA,IAC7C,aAAA,EAAe,OAAA,CAAQ,MAAA,CAAO,aAAa,CAAA;AAAA,IAC3C,IAAA,EAAM,OAAA,CAAQ,MAAA,CAAO,IAAI;AAAA,GAC3B;AACF","file":"chunk-XNISPHTZ.js","sourcesContent":["/**\n * Node reference pattern and resolution for {Node Label} template syntax.\n * Shared between frontend and backend.\n */\n\n/** Matches {Node Label} references in text. */\nexport const NODE_REF_PATTERN = /\\{([^}]+)\\}/g\n\n/** Reserved template variable names that should NOT be resolved as node refs */\nexport const RESERVED_TEMPLATE_VARS = new Set([\n \"name\",\n \"description\",\n \"userPrompt\",\n \"assetDescriptions\",\n \"outputCount\",\n])\n\n/**\n * Split a `{...}` token body into its node name and optional fallback. Splits on the FIRST `||`\n * (a fallback may itself contain `||`); both sides are trimmed. `fallback` is null when there is\n * no `||`, preserving the legacy \"leave the literal token\" behavior.\n * \"person || man\" -> { name: \"person\", fallback: \"man\" }\n * \"person || \" -> { name: \"person\", fallback: \"\" } (resolves to empty when absent)\n * \"person\" -> { name: \"person\", fallback: null } (literal {person} when absent)\n */\nexport function parseNodeRef(raw: string): { name: string; fallback: string | null } {\n const i = raw.indexOf(\"||\")\n if (i === -1) return { name: raw.trim(), fallback: null }\n return { name: raw.slice(0, i).trim(), fallback: raw.slice(i + 2).trim() }\n}\n\n/**\n * Canonical form of a node-name variable: trimmed + lowercased. Node-name\n * variables are CASE-INSENSITIVE with lowercase as canonical, so nodes labeled\n * `TEXt`, `TEXT`, `text` all feed the one `{text}` variable and `{TEXT}` /\n * `{Text}` / `{text}` in a prompt all resolve to it.\n *\n * Reserved template vars (RESERVED_TEMPLATE_VARS, e.g. `userPrompt`) are matched\n * case-sensitively on the ORIGINAL token BEFORE canonicalization, so `{userPrompt}`\n * stays a reserved token rather than becoming a `userprompt` node ref.\n */\nexport function canonicalVarName(label: string): string {\n return label.trim().toLowerCase()\n}\n\n/**\n * The distinct `{label}` names referenced across the given texts. Mirrors the\n * canvas-side `referencedRefs`: strips the `|| fallback`, and ignores empty\n * tokens, image-ref tokens (`{image:N}`), and RESERVED_TEMPLATE_VARS. Used to\n * SUPPRESS auto-injection of a connected node the author already placed\n * explicitly via `{label}` (so it isn't injected twice). `matchAll` over the\n * global pattern does not mutate its lastIndex, so sharing the constant is safe.\n *\n * Deliberately NOT `REF_TOKEN_NAMESPACE_PREFIXES`: widening this changes\n * run-time auto-injection on BOTH engines (follow-up ticket), not just the\n * editor.\n */\nexport function extractReferencedLabels(\n ...texts: ReadonlyArray<string | undefined | null>\n): Set<string> {\n const refs = new Set<string>()\n for (const text of texts) {\n if (typeof text !== \"string\" || text.length === 0) continue\n for (const m of text.matchAll(NODE_REF_PATTERN)) {\n const { name } = parseNodeRef(m[1] ?? \"\")\n if (name === \"\" || name.startsWith(\"image:\") || RESERVED_TEMPLATE_VARS.has(name)) continue\n refs.add(canonicalVarName(name)) // case-insensitive: {Foo} suppresses a `foo` node\n }\n }\n return refs\n}\n\n/** Handle → combine-order category for same-label `{label}` merging. Lower wins\n * first: prompt (0) → elements (1) → look family (2). Other handles are -1\n * (not combinable — they keep the per-engine last-wins/suffix behavior). */\nexport const REF_HANDLE_CATEGORY: Readonly<Record<string, number>> = {\n prompt: 0,\n elements: 1,\n look: 2,\n cinematography: 2,\n style: 2,\n}\n\n/** Combine-order category for a direct-parent edge's `targetHandle`; -1 when the\n * handle isn't one of the combinable prompt/elements/look handles. */\nexport function refHandleCategory(targetHandle: string | null | undefined): number {\n if (targetHandle != null && Object.prototype.hasOwnProperty.call(REF_HANDLE_CATEGORY, targetHandle)) {\n return REF_HANDLE_CATEGORY[targetHandle]\n }\n return -1\n}\n\n/**\n * Reference-handle id → resolved-input key. The SINGLE SOURCE OF TRUTH for which\n * `targetHandle` ids carry image / video / audio reference inputs. Shared by the\n * backend input-resolver (routes the wired URL into the matching\n * `referenceImageUrls` / `referenceVideoUrls` / `referenceAudioUrls` slot) AND\n * the positional `{image:N}` / `{video:N}` / `{audio:N}` body-token COUNTS in the\n * FE preview (`video-prompt-assembly.ts`), FE run (`execute-node.ts`), and BE\n * payload-builder.\n *\n * Two handle families map to the same keys:\n * - Legacy / i2v single-name ids (`references` / `reference-videos` /\n * `reference-audio`) — kept for un-migrated workflows.\n * - Canonical typed-handle ids the modern Generate Video node exposes\n * (`imageReferences` / `videoReferences` / `audioReferences`) — share the\n * resolved-input keys with the legacy ids so consumer code never forks.\n */\nexport const REFERENCE_HANDLE_MAP: Record<string, \"referenceImageUrls\" | \"referenceVideoUrls\" | \"referenceAudioUrls\"> = {\n // Legacy / i2v single-name handle ids (kept for un-migrated workflows)\n \"references\": \"referenceImageUrls\",\n \"reference-videos\": \"referenceVideoUrls\",\n \"reference-audio\": \"referenceAudioUrls\",\n // New canonical typed-handle ids (Generate Video) — share the resolved-input\n // keys with the legacy ids so payload-builder code doesn't fork.\n \"imageReferences\": \"referenceImageUrls\",\n \"videoReferences\": \"referenceVideoUrls\",\n \"audioReferences\": \"referenceAudioUrls\",\n}\n\n/** The three reference modalities a reference handle can carry. */\nexport type ReferenceModality = \"image\" | \"video\" | \"audio\"\n\n/**\n * The reference MODALITY a `targetHandle` carries, or null when the handle is\n * not a reference handle. Resolves BOTH the legacy single-name ids and the\n * canonical Generate Video ids (via REFERENCE_HANDLE_MAP), so positional\n * `{image:N}` / `{video:N}` / `{audio:N}` token counts cover every handle alias\n * — without this, the generate-video `imageReferences` handle was silently\n * uncounted and `{image:N}` tokens dropped to bare labels on the only creatable\n * video node.\n */\nexport function referenceModalityForHandle(targetHandle: string | null | undefined): ReferenceModality | null {\n if (targetHandle == null) return null\n const key = REFERENCE_HANDLE_MAP[targetHandle]\n return key === \"referenceImageUrls\" ? \"image\" : key === \"referenceVideoUrls\" ? \"video\" : key === \"referenceAudioUrls\" ? \"audio\" : null\n}\n\n/**\n * Frame target handles (start / end keyframes). An image wired into one of these\n * is a KEYFRAME, not an `{image:N}` reference: the backend appends frames at the\n * TAIL of `reference_image_urls` (`resolveSeedance2Inputs`), never numbered. The\n * editor MUST therefore exclude them from `{image:N}` numbering so editor token N\n * equals the worker reference slot N.\n *\n * The SINGLE source of truth for \"is this a frame handle,\" shared by the\n * config-panel autocomplete (`video-configs.tsx`) AND the inline/modal builder\n * (`connected-references.ts`) — without ONE definition those two surfaces drifted\n * and the inline editor numbered the frame as `{image:1}` (the C1 bug). Frames\n * are deliberately NOT in `REFERENCE_HANDLE_MAP`: they carry no reference\n * modality, so `referenceModalityForHandle` already returns `null` for them on\n * the count side — this set is the exclusion lever for the EDITOR-numbering side.\n */\nexport const FRAME_TARGET_HANDLES: ReadonlySet<string> = new Set([\"startFrame\", \"endFrame\"])\n\n/**\n * Minimal structural edge shape {@link countRefModalityEdges} reads — only the\n * two fields the count needs. Both the FE `WorkflowEdge` (xyflow `Edge`, whose\n * `target` is a non-null string) and the BE `SimpleEdge` satisfy it.\n */\nexport interface RefModalityEdge {\n target?: string | null\n targetHandle?: string | null\n}\n\n/**\n * Count the reference-handle edges of a given reference MODALITY wired into a\n * node — the ONE positional `{image:N}` / `{video:N}` / `{audio:N}` counter\n * shared by the FE preview (`video-prompt-assembly.ts`), the FE run\n * (`execute-node.ts`), and the BE orchestrator (`payload-builder.ts`). Counting\n * via `referenceModalityForHandle` (not a single handle string) covers BOTH the\n * legacy single-name ids (`references` / `reference-videos` / `reference-audio`)\n * AND the canonical Generate Video ids (`imageReferences` / `videoReferences` /\n * `audioReferences`), so editor token N maps 1:1 to the worker\n * `referenceImageUrls` / `referenceVideoUrls` / `referenceAudioUrls` slot N on\n * every handle alias. This is the EDGE count (not the resolved/list-expanded URL\n * count) so all three paths stay byte-identical; the edge-vs-resolved divergence\n * for a reference edge that fans out to >1 URL (a List producer) is a shared,\n * documented v1 limitation.\n */\nexport function countRefModalityEdges(\n edges: ReadonlyArray<RefModalityEdge>,\n nodeId: string,\n modality: ReferenceModality,\n): number {\n let n = 0\n for (const e of edges) {\n if (e.target === nodeId && referenceModalityForHandle(e.targetHandle) === modality) n += 1\n }\n return n\n}\n\n/** A candidate contribution to the `{label}` map: the node's label, its resolved\n * output, and its direct-parent handle category (-1 = not combinable / deeper). */\nexport interface RefCandidate {\n label: string\n output: string\n category: number\n}\n\n/**\n * Same-label COMBINE: when ≥2 direct-parent candidates (category ≥ 0) share a\n * label, `{label}` resolves to their values joined by \", \" ordered prompt →\n * elements → look, and within a category by candidate (edge) order. Returns a\n * Map of ONLY the combined labels; the caller fills the rest with its own\n * (FE suffix / BE last-wins) logic, skipping any label present here. Shared so\n * the frontend executor and backend orchestrator never drift.\n */\nexport function combineSameLabelRefs(candidates: ReadonlyArray<RefCandidate>): Map<string, string> {\n const byLabel = new Map<string, RefCandidate[]>()\n for (const c of candidates) {\n if (c.category < 0) continue\n const key = canonicalVarName(c.label) // TEXt + TEXT + text collapse into one {text}\n const arr = byLabel.get(key)\n if (arr) arr.push(c)\n else byLabel.set(key, [c])\n }\n const combined = new Map<string, string>()\n for (const [label, group] of byLabel) {\n if (group.length < 2) continue\n const ordered = group\n .map((c, i) => ({ c, i }))\n .sort((a, b) => a.c.category - b.c.category || a.i - b.i)\n .map((x) => x.c.output)\n combined.set(label, ordered.join(\", \"))\n }\n return combined\n}\n\n/**\n * Resolve {Node Label} references in text by replacing them with actual node outputs.\n * Skips reserved template variables used by applyTemplate().\n * Iterates until stable to handle nested refs (e.g. {List} → {Animal1} → \"dog\").\n */\nexport function resolveNodeRefs(\n text: string,\n labelToOutput: ReadonlyMap<string, string>,\n): string {\n const MAX_PASSES = 10\n let result = text\n for (let i = 0; i < MAX_PASSES; i++) {\n const next = result.replace(NODE_REF_PATTERN, (match, raw: string) => {\n const { name, fallback } = parseNodeRef(raw)\n if (RESERVED_TEMPLATE_VARS.has(name)) return match\n // Node-name vars are case-insensitive: try the literal key first (keeps\n // original-cased maps like condition-variables working), then the\n // lowercase-canonical key (node-ref maps are canonical-keyed).\n const output = labelToOutput.get(name) ?? labelToOutput.get(canonicalVarName(name))\n if (output !== undefined) return output // connected, non-empty output → its value\n if (fallback !== null) return fallback // absent/empty + fallback → default (\"\" for {name || })\n return match // absent + no || → literal {name}\n })\n if (next === result) break\n result = next\n }\n return result\n}\n\n/**\n * Token namespaces that are NOT node-label references. `{image:1:face}` is the\n * unified-reference grammar, `{slot:x}` is recast's, `{video:N}`/`{audio:N}`\n * are reference handles, and `{ref:<id>}` is the id-addressed reference form —\n * all five are substituted by their own resolvers (`resolveReferenceTokens`,\n * `resolveRefIdTokens`, the recast slot pass), not by resolveNodeRefs. Before\n * this list existed, only `image:` was excluded, so `{video:1}` classified as a\n * MISSING node ref.\n *\n * Compared against the LOWERCASED token name: `REFERENCE_TOKEN_RE` is `/gi` and\n * `REF_ID_TOKEN_RE` spells `[rR][eE][fF]`, so `{Image:1}` / `{Ref:x}` really do\n * resolve downstream and must never read as a missing node ref.\n */\nexport const REF_TOKEN_NAMESPACE_PREFIXES: readonly string[] = [\n \"image:\", \"video:\", \"audio:\", \"slot:\", \"ref:\",\n]\n\nexport type RefTokenKind = \"wired\" | \"reserved\" | \"missing\" | \"skip\" | \"unknown\"\n\n/**\n * Classify a parsed `{...}` token name against the resolvable label set.\n * `resolvable === null` means the caller has no ref data at all — such tokens\n * classify `unknown` and must render like wired, so \"no data\" never\n * masquerades as \"nothing wired\".\n *\n * Single source of truth for the editor decoration, the missing-refs chip\n * (frontend/src/lib/prompt-ref-scan.ts delegates here) and the execution\n * engine's dispatch guard.\n */\nexport function classifyRefToken(\n name: string,\n resolvable: ReadonlySet<string> | null,\n): RefTokenKind {\n const lower = name.toLowerCase()\n if (name === \"\" || REF_TOKEN_NAMESPACE_PREFIXES.some((p) => lower.startsWith(p))) return \"skip\"\n if (RESERVED_TEMPLATE_VARS.has(name)) return \"reserved\"\n if (resolvable === null) return \"unknown\"\n return resolvable.has(canonicalVarName(name)) ? \"wired\" : \"missing\"\n}\n\n/**\n * The `{Label}` tokens in `text` that `resolveNodeRefs` would leave LITERAL and\n * that no upstream node can explain — i.e. exactly what would reach a provider\n * as the characters `{Label}`. Evidence for why this matters: `{Describe Image}`\n * ×2 (gpt-image-2) and `{gravity flip}` / `{rewind}` (seedance-2-5) in the\n * 2026-09-01 app-reports export.\n *\n * `resolvable` — labels with a value in the ref map (canonical/lowercase).\n * `known` — canonical labels of the nodes the caller considers to EXIST\n * (no state requirement; the backend passes every node in the\n * run's graph).\n *\n * A token whose label is in `known` but not `resolvable` PASSES: the node\n * exists and simply produced nothing, which is the caller's to substitute (the\n * backend resolves it to empty text), not this function's to refuse. A token\n * with an explicit `|| fallback` passes too — the fallback is substituted.\n * Returns original-cased names, de-duplicated by canonical form, for the\n * user-facing message.\n */\nexport function unresolvedRefTokens(\n text: string,\n opts: { resolvable: ReadonlySet<string>; known: ReadonlySet<string> },\n): string[] {\n if (typeof text !== \"string\" || text.length === 0) return []\n const seen = new Set<string>()\n const out: string[] = []\n for (const m of text.matchAll(NODE_REF_PATTERN)) {\n const { name, fallback } = parseNodeRef(m[1] ?? \"\")\n if (fallback !== null) continue\n if (classifyRefToken(name, opts.resolvable) !== \"missing\") continue\n const canon = canonicalVarName(name)\n if (opts.known.has(canon) || seen.has(canon)) continue\n seen.add(canon)\n out.push(name)\n }\n return out\n}\n","/**\n * Every way one node FEEDS another — the ONE definition the server's run\n * scope (`triggerRunScope`) and the editor's \"is this trigger wired?\" read\n * from, so the card can never say \"the branch\" while the server runs the\n * whole workflow, or the other way round:\n *\n * - a drawn edge whose two ends are both on the graph (a delta that deleted a\n * node leaves its edges behind; those feed nothing);\n * - Group membership: a node inside a Group feeds the group (`parentId`),\n * the way the engine orders a group after its members;\n * - a field mapping: `data.fieldMappings[field].sourceNodeId` feeds the node\n * that carries the mapping, even after the edge it was made from is gone.\n */\n\nexport interface FeedNode {\n readonly id: string\n readonly parentId?: string | null\n readonly data?: unknown\n}\n\nexport interface FeedEdge {\n readonly source: string\n readonly target: string\n}\n\nexport interface FeedMaps {\n /** node id → the ids it feeds */\n readonly children: ReadonlyMap<string, ReadonlyArray<string>>\n /** node id → the ids that feed it */\n readonly parents: ReadonlyMap<string, ReadonlyArray<string>>\n}\n\nexport function buildFeedMaps(nodes: ReadonlyArray<FeedNode>, edges: ReadonlyArray<FeedEdge>): FeedMaps {\n const live = new Set(nodes.map((n) => n.id))\n const children = new Map<string, string[]>()\n const parents = new Map<string, string[]>()\n const feeds = (source: string, target: string) => {\n if (!live.has(source) || !live.has(target) || source === target) return\n children.set(source, [...(children.get(source) ?? []), target])\n parents.set(target, [...(parents.get(target) ?? []), source])\n }\n for (const edge of edges) feeds(edge.source, edge.target)\n for (const n of nodes) {\n if (typeof n.parentId === \"string\" && n.parentId) feeds(n.id, n.parentId)\n const mappings = (n.data as { fieldMappings?: unknown } | null | undefined)?.fieldMappings\n if (mappings && typeof mappings === \"object\") {\n for (const mapping of Object.values(mappings as Record<string, unknown>)) {\n const sourceNodeId = (mapping as { sourceNodeId?: unknown } | null)?.sourceNodeId\n if (typeof sourceNodeId === \"string\" && sourceNodeId) feeds(sourceNodeId, n.id)\n }\n }\n }\n return { children, parents }\n}\n\n/** Does this node feed anything? A trigger that does not runs the whole workflow. */\nexport function nodeFeedsAnything(nodes: ReadonlyArray<FeedNode>, edges: ReadonlyArray<FeedEdge>, nodeId: string): boolean {\n return (buildFeedMaps(nodes, edges).children.get(nodeId) ?? []).length > 0\n}\n","/**\n * Field names on a node's `data` that hold runtime / result / transient execution\n * state (job ids, progress, generated outputs, fan-out bookkeeping). These are NEVER\n * part of a node's reusable configuration.\n *\n * Single source of truth, consumed by:\n * - the workflow store's undo logic (execution-only updates skip undo capture, so job\n * polling does not pollute undo history or flip `isDirty`)\n * - the node-preset extractor (presets must never capture runtime state)\n * - the backend defensive strip on preset writes\n *\n * When adding a new runtime/result field to a node's data, add its key here — or, when it is a\n * generic name only one node type writes as a result, to that type's row of\n * NODE_TYPE_EXECUTION_DATA_KEYS (read through `isExecutionDataKey` / `executionDataKeysOf`).\n */\nexport const EXECUTION_DATA_KEYS: ReadonlySet<string> = new Set([\n \"executionStatus\",\n \"currentJobId\",\n \"currentJobProgress\",\n \"errorMessage\",\n // Structured detail alongside errorMessage for a safety-filter block\n // (see `JobErrorHint` in the app's frontend/src/types/nodes.ts). Same\n // lifecycle as errorMessage: a RESULT the user expects to survive reload,\n // never user-edited config.\n \"errorHint\",\n // A job policy registered by the deployment held this node's result for a\n // human reviewer (`jobs.status = \"pending_review\"`). Pure run state, like\n // executionStatus: the node is still \"running\" and the flag disappears the\n // moment the review resolves — so it is ALSO in TRANSIENT_RUNTIME_KEYS\n // below. Without the transient half, a flip into review marks a passive tab\n // dirty and a preset captures \"awaiting review\".\n \"jobAwaitingReview\",\n // The editor cannot reach the server to read this node's job. The job keeps\n // running and the watch keeps polling. Pure run state, cleared by the next\n // check that gets through, so it is ALSO in TRANSIENT_RUNTIME_KEYS below.\n \"jobConnectionLost\",\n \"isStreaming\",\n \"generatedImageUrl\",\n \"generatedVideoUrl\",\n \"generatedAudioUrl\",\n \"generatedText\",\n \"generatedScript\",\n \"generatedItems\",\n \"generatedResults\",\n \"activeResultIndex\",\n \"sourceImageUrl\",\n \"__listTotal\",\n \"__listCompleted\",\n \"__listResults\",\n // Row-aligned twin of __listResults (Extract Field, List output) — read only\n // by the fan-out so two lists cut from one array pair by row.\n \"__alignedListResults\",\n // A render's fan-out row stamps, row-aligned with __listResults: each row's\n // take identity, and the clip every row was sent for (a failed row too).\n \"__listResultStamps\",\n // List fan-out window flag (abandon-guard exemption). Set/cleared by\n // executeNodeForList — purely execution-related, never user-edited.\n \"__listRunning\",\n // Why the last server run skipped this node (`empty_input`): a chip on the\n // card for the run that just ended, never a saved result — also in\n // TRANSIENT_RUNTIME_KEYS below.\n \"__runSkipReason\",\n // One token per paid run still out on this node that no executor mark\n // covers (the editor's `withRunInFlight`, around each paid call outside the\n // executors). Purely execution-related, never user-edited; also in\n // TRANSIENT_RUNTIME_KEYS.\n \"__runsInFlight\",\n // Selector node dual-channel outputs (picked + rest). Server-side execution\n // output, not user-edited config.\n \"pickedResults\",\n \"restResults\",\n \"__pickedResults\",\n \"__restResults\",\n \"__pickedTotal\",\n \"__restTotal\",\n \"generatedJson\",\n // A render's remapped transcript on its own pip (Speaker View's\n // `transcript`, RENDER_NODE_TYPES transcriptOutput) — run-result data.\n \"generatedTranscript\",\n // Edit Plan: a person's review of the plan (`EditedEdl`, edit-plan-review.ts),\n // kept beside `generatedJson` and fingerprinted against it. Run-result data\n // (TA14, decided 2026-10-04): out of undo, presets, templates and exports,\n // and Clear results wipes it. Persisted — never transient.\n \"editedEdl\",\n \"subWorkflowProgress\",\n \"outputResults\",\n \"shots\",\n \"result\",\n \"processedResult\",\n \"activeRoutes\",\n \"routeOutputs\",\n \"_upstreamRefresh\",\n \"zoom\",\n // Character LoRA training status fields — written every 8s while training.\n \"loraReplicateVersion\",\n \"loraTriggerWord\",\n \"loraTrainingStatus\",\n // Collect (fan-in) execution snapshot.\n \"lastInputs\",\n \"lastMeta\",\n \"__upstreamCount\",\n // Video URL node — the download's live percent/phase, written on every\n // progress tick (~2/s). Pure run-state; also in TRANSIENT_RUNTIME_KEYS below.\n \"downloadPercent\",\n \"downloadPhase\",\n // Webhook Output's delivery receipt. A webhook target may reflect the\n // request back (httpbin, RequestBin, an API that 400s with \"headers\n // received: …\"), so `webhookResponseBody` can carry whatever the request\n // carried — with an attached credential, the secret itself. Listing the three\n // here is what keeps the receipt out of template exports (GENERATED_FIELDS\n // derives from this set), out of node presets, and out of undo history.\n \"webhookSuccess\",\n \"webhookStatusCode\",\n \"webhookResponseBody\",\n // Content Ideas: one creative brief per idea (the node's list output — kept\n // out of __listResults, which would clone the node). And the non-fatal notes\n // a Content Recipe / Content Ideas run returns (\"read the first of 3 posts\").\n // Both are RESULTS: they persist, and a preset, a template or a run-only\n // patch must never treat them as config.\n \"ideaBriefs\",\n \"runWarnings\",\n // Content Ideas: the own brand whose results the last run leaned on — a\n // RESULT naming the runner's brand, so a template or a preset never carries it.\n \"brandLessons\",\n // Social Search: every post the last search found (the picker's grid), the\n // ids a person picked from them, and the run's non-fatal notes (\"only part\n // of the results loaded\"). All RESULTS: a template, a preset or a run-only\n // patch must never carry yesterday's posts or picks as configuration.\n \"searchResults\",\n \"pickedIds\",\n \"searchWarnings\",\n // Save to Collection: how the last run ended for this node (inserted /\n // duplicate / replayed) and how many old records the cap evicted. RESULTS of\n // a run — Clear results wipes them, and a template, a preset or a run-only\n // patch never carries them as configuration.\n \"lastOutcome\",\n \"lastEvicted\",\n // When the editor's \"Clear results\" last emptied this node (ISO time). Not a\n // result and not config: bookkeeping that tells the load-time recovery lanes\n // \"this node is empty ON PURPOSE\" — without it, every reload reads an empty\n // node as \"ran while the editor was closed\" and paints the last run back.\n // Persisted (never transient): the reload is exactly when it is read.\n \"resultsClearedAt\",\n // The id of the trigger-started run whose results this node shows (the\n // editor paints a Telegram run onto the canvas). Bookkeeping, not a result\n // and not config: it stops a reload from painting the same run again over\n // edits made since. Persisted for the same reason as resultsClearedAt.\n \"resultsRunId\",\n // When that run ended the node (beside resultsRunId): the editor's reopen\n // keeps a result a NEWER run left even when its own run listing cannot see\n // that run. Bookkeeping, persisted for the same reason.\n \"resultsRunEndedAt\",\n // A trigger's last run values (also in TRANSIENT_RUNTIME_KEYS: never saved).\n \"__triggerData\",\n // A fan-out's notes rows, every fan-out's (row-aligned with __listResults):\n // a row's warnings and length. A RESULT: persisted.\n \"__listResultMeta\",\n // A use-case node's continuation of one of its runs (Tighten Episode): set\n // for ONE run only, as that run's input override (an app's or the editor's\n // Render final, the canvas Continue's run option). Never saved — also in\n // TRANSIENT_RUNTIME_KEYS — so a saved one can never turn a later plain run\n // into a continuation of an old run.\n \"useCaseContinue\",\n])\n\n/**\n * Run results a node type writes under a GENERIC name — `quote`, `durationSec`,\n * `candidates` — that are execution data on THAT type only. Another node may\n * keep a setting under the same name; filing these globally would misfile it\n * (out of undo, presets, templates and the copilot's view). Same lifecycle as\n * the global results: persisted, and a run writing them is never an undo step.\n *\n * UGC video (Nodaro Cloud): the outputs a node hands on (`ugcOutputs`), UGC\n * Creator's options of a draw and their note, UGC Clips' quote, and UGC Clip's\n * warnings, length and Re-render marks (`rerenderPending`: the clips pressed for\n * Re-render that no run has rendered yet — run bookkeeping; the press itself,\n * `rerender`, is a choice).\n */\nexport const NODE_TYPE_EXECUTION_DATA_KEYS: Readonly<Record<string, readonly string[]>> = {\n \"ugc-creator\": [\"ugcOutputs\", \"candidates\", \"optionFailed\"],\n \"ugc-script\": [\"ugcOutputs\"],\n \"ugc-clips\": [\"ugcOutputs\", \"quote\"],\n \"ugc-clip\": [\"ugcOutputs\", \"clipWarnings\", \"durationSec\", \"rerenderPending\"],\n \"ugc-cards\": [\"ugcOutputs\"],\n}\n\n/** Is `key` execution data (run state or a run's result) on a node of `type`: global, or that type's own? */\nexport function isExecutionDataKey(key: string, type: string | null | undefined): boolean {\n if (EXECUTION_DATA_KEYS.has(key)) return true\n return typeof type === \"string\" && Object.hasOwn(NODE_TYPE_EXECUTION_DATA_KEYS, type) && NODE_TYPE_EXECUTION_DATA_KEYS[type]!.includes(key)\n}\n\nconst EXECUTION_DATA_KEYS_BY_TYPE = new Map<string, ReadonlySet<string>>(\n Object.entries(NODE_TYPE_EXECUTION_DATA_KEYS).map(([type, keys]) => [type, new Set([...EXECUTION_DATA_KEYS, ...keys])]),\n)\n\n/** Every execution-data key on a node of `type`, as one set: the global ones, plus the type's own. */\nexport function executionDataKeysOf(type: string | null | undefined): ReadonlySet<string> {\n return (typeof type === \"string\" ? EXECUTION_DATA_KEYS_BY_TYPE.get(type) : undefined) ?? EXECUTION_DATA_KEYS\n}\n\n/**\n * The PURE RUN-STATE subset of EXECUTION_DATA_KEYS: per-tick values (status\n * flips, job ids, progress counters, fan-out bookkeeping) that must NEITHER\n * mark the workflow dirty NOR be persisted in the save payload. Everything\n * else in EXECUTION_DATA_KEYS is a RESULT the user expects to survive reload\n * (generated URLs/results, errorMessage, LoRA outputs, collect snapshots).\n *\n * Why this split exists: writing these keys used to set `isDirty`, so job\n * polling phantom-dirtied passive tabs → spurious autosaves → false\n * \"changed in another tab\" banners → the remote-ahead latch froze autosave\n * (the \"not saved for a long time\" report). Consumed by the workflow\n * store's dirty decision and the save-payload sanitizer below.\n *\n * Invariant (guarded by node-runtime-keys.test.ts): subset of\n * EXECUTION_DATA_KEYS — anything transient is also undo-exempt.\n */\nexport const TRANSIENT_RUNTIME_KEYS: ReadonlySet<string> = new Set([\n \"executionStatus\",\n \"currentJobId\",\n \"currentJobProgress\",\n \"jobAwaitingReview\",\n \"jobConnectionLost\",\n \"isStreaming\",\n \"subWorkflowProgress\",\n \"__listTotal\",\n \"__listCompleted\",\n \"__listRunning\",\n \"__runSkipReason\",\n // A paid run still out, held by the editor tab that started it. Never\n // saved, so a reload, which has no such run, starts without one.\n \"__runsInFlight\",\n \"_upstreamRefresh\",\n \"__upstreamCount\",\n // Video URL node download ticks. They used to dirty the workflow twice a\n // second for the length of the download — the same phantom-save chain the\n // job-progress keys above were moved here to stop. What SURVIVES a reload is\n // `downloadStatus` + `downloadId`; the percent is re-read from the server.\n \"downloadPercent\",\n \"downloadPhase\",\n // A trigger's last run values, shown in the editor after a run (a webhook's\n // body, a Telegram message and its post). Never saved: the workflow is not\n // where a message's content is kept — runs are, under their retention.\n \"__triggerData\",\n // A use-case node's continuation: one run's override, never config (above).\n \"useCaseContinue\",\n])\n\n/**\n * Pure save-payload sanitizer: returns new node objects with the transient\n * run-state keys removed from `data`. Nodes without transient keys (or\n * without `data`) are returned by reference — cheap for the common case.\n */\nexport function stripTransientRuntimeData<\n T extends { data?: Record<string, unknown> | undefined },\n>(nodes: readonly T[]): T[] {\n return nodes.map((node) => {\n const data = node.data\n if (!data) return node\n let hasTransient = false\n for (const key of TRANSIENT_RUNTIME_KEYS) {\n if (key in data) {\n hasTransient = true\n break\n }\n }\n if (!hasTransient) return node\n const cleaned: Record<string, unknown> = {}\n for (const [key, value] of Object.entries(data)) {\n if (!TRANSIENT_RUNTIME_KEYS.has(key)) cleaned[key] = value\n }\n return { ...node, data: cleaned }\n })\n}\n","/**\n * Evaluate a dot-notation path against a JSON value.\n *\n * Auto-iterates arrays at any depth: if the current value is an array,\n * the evaluator iterates and applies the remaining path to each element,\n * flattening results. This lets simple paths like \"caption\" work on a\n * top-level array and \"pages.markdown\" work on a nested array without\n * any wildcard syntax.\n *\n * Returns an array of values. Missing properties are skipped (empty for\n * that branch). Null/undefined leaf values are included — callers coerce.\n * Empty path returns `[value]` (a single-element array wrapping the\n * value) when the value is scalar/object, or the array elements flat\n * when the root is an array.\n */\nexport function evaluateJsonPath(value: unknown, path: string): unknown[] {\n const segments = path.length === 0 ? [] : path.split(\".\")\n return walk(value, segments, 0)\n}\n\n/**\n * Coerce an array of unknown values (typically from evaluateJsonPath) to\n * strings, skipping null/undefined. Primitives are stringified; objects\n * are JSON-encoded.\n */\nexport function stringifyPathResults(raw: unknown[]): string[] {\n const out: string[] = []\n for (const v of raw) {\n if (v === null || v === undefined) continue\n if (typeof v === \"string\") out.push(v)\n else if (typeof v === \"number\" || typeof v === \"boolean\") out.push(String(v))\n else out.push(JSON.stringify(v))\n }\n return out\n}\n\nfunction walk(value: unknown, segments: string[], offset: number): unknown[] {\n if (Array.isArray(value)) {\n const results: unknown[] = []\n for (const item of value) {\n for (const v of walk(item, segments, offset)) results.push(v)\n }\n return results\n }\n if (offset >= segments.length) return [value]\n if (value !== null && typeof value === \"object\") {\n const head = segments[offset]\n if (!Object.hasOwn(value as object, head)) return []\n return walk((value as Record<string, unknown>)[head], segments, offset + 1)\n }\n return []\n}\n","/** Pure condition evaluator shared by filter-list and router (conditional mode). */\n\nimport { evaluateJsonPath } from \"./json-path.js\"\nimport { resolveNodeRefs } from \"./node-refs.js\"\n\nexport type FilterListOperator =\n | \">\" | \"<\" | \">=\" | \"<=\"\n | \"=\" | \"!=\"\n | \"contains\" | \"not_contains\"\n | \"starts_with\" | \"ends_with\" | \"regex\"\n | \"exists\" | \"not_exists\"\n\nexport interface FilterListCondition {\n id?: string\n field?: string\n operator: FilterListOperator\n value?: string\n valueType?: \"static\" | \"variable\"\n /** UI-only hint on the config panel — irrelevant to evaluation. */\n mode?: \"dropdown\" | \"custom\"\n}\n\n/** AND/OR condition bundle used by the router's conditional mode. When a\n * group matches, every routeId is added to activeRoutes. Multiple groups\n * union (deduped). */\nexport interface RouterConditionGroup {\n id?: string\n conditions?: FilterListCondition[]\n conditionLogic?: \"AND\" | \"OR\"\n routeIds?: string[]\n}\n\n/**\n * Options for `evaluateCondition` / `evaluateConditionGroup`.\n */\nexport interface EvaluateConditionOptions {\n /** When `false`, text operators (`contains`, `not_contains`, `starts_with`,\n * `ends_with`, `=`, `!=`) compare case-insensitively using case-folded\n * string equality.\n *\n * Note: `=` and `!=` lose their default numeric-coercion semantics under\n * `caseSensitive: false`. Under the default (case-sensitive), `1 == \"1.0\"`\n * via `valuesEqual`; under `caseSensitive: false`, comparison is pure\n * case-folded string equality, so `\"1\" !== \"1.0\"`.\n *\n * Default (when undefined): `true` (case-sensitive) — preserves existing\n * behavior for all callers.\n *\n * Non-text operators (`>`, `<`, `>=`, `<=`, `exists`, `not_exists`,\n * `regex`) are unaffected by this flag. */\n caseSensitive?: boolean\n /** Label→output map for `{Node Label}` refs inside condition values.\n * Populated from a filter-list / router node's `\"variables\"` target\n * handle. Resolved via `resolveNodeRefs` — unknown labels preserve\n * the original `{...}` text, so JSON-literal values stay intact. */\n variables?: ReadonlyMap<string, string>\n}\n\nexport function tryParseJson(item: unknown): unknown {\n if (typeof item !== \"string\") return item\n const trimmed = item.trim()\n if (!trimmed) return item\n const first = trimmed[0]\n if (first !== \"{\" && first !== \"[\" && first !== \"\\\"\" && !/^-?\\d/.test(trimmed) && trimmed !== \"true\" && trimmed !== \"false\" && trimmed !== \"null\") {\n return item\n }\n try { return JSON.parse(trimmed) } catch { return item }\n}\n\nconst HOUR_MS = 60 * 60 * 1000\nconst DAY_MS = 24 * HOUR_MS\nconst WEEK_MS = 7 * DAY_MS\n\n/** Resolve a relative-window token like `last_N_hours:3` to an ISO timestamp\n * N units before `Date.now()`. Returns undefined for malformed tokens. */\nexport function resolveRelativeWindowToken(key: string): string | undefined {\n const m = /^last_N_(hours|days|weeks):(-?\\d+)$/.exec(key)\n if (!m) return undefined\n const n = parseInt(m[2], 10)\n if (!Number.isFinite(n)) return undefined\n const unitMs = m[1] === \"hours\" ? HOUR_MS : m[1] === \"days\" ? DAY_MS : WEEK_MS\n return new Date(Date.now() - n * unitMs).toISOString()\n}\n\n/**\n * Substitute `{{...}}` template tokens — `{{now}}`, `{{trigger.<path>}}`,\n * and relative-window tokens (`{{last_N_hours:N}}` / days / weeks). Reused\n * by `resolveConditionValue` (filter-list / router) and `resolveSelectorRefs`\n * (selector node) so token semantics stay identical across the workflow-engine\n * ref-resolution surface.\n *\n * Pure: returns a new string. Strings with no `{{...}}` tokens pass through\n * unchanged.\n */\nexport function substituteTriggerTokens(\n raw: string,\n triggerData?: Record<string, unknown>,\n): string {\n if (!/\\{\\{/.test(raw)) return raw\n return raw.replace(/\\{\\{\\s*([^}]+?)\\s*\\}\\}/g, (_m, expr) => {\n const key = String(expr).trim()\n if (key === \"now\") return new Date().toISOString()\n if (key === \"trigger.last_triggered_at\") {\n const v = triggerData?.last_triggered_at\n return v == null ? \"\" : String(v)\n }\n if (key.startsWith(\"trigger.\")) {\n const path = key.slice(\"trigger.\".length)\n const v = triggerData?.[path]\n return v == null ? \"\" : String(v)\n }\n const relative = resolveRelativeWindowToken(key)\n if (relative !== undefined) return relative\n return \"\"\n })\n}\n\nexport function resolveConditionValue(\n raw: string,\n valueType: string | undefined,\n triggerData?: Record<string, unknown>,\n variables?: ReadonlyMap<string, string>,\n): string {\n let value = raw\n if (variables && variables.size > 0) {\n value = resolveNodeRefs(value, variables)\n }\n const hasTemplate = /\\{\\{/.test(value)\n if (valueType !== \"variable\" && !hasTemplate) return value\n return substituteTriggerTokens(value, triggerData)\n}\n\nfunction asComparableNumber(v: unknown): number {\n if (typeof v === \"number\") return v\n if (typeof v === \"boolean\") return v ? 1 : 0\n if (typeof v === \"string\") {\n const trimmed = v.trim()\n if (trimmed === \"\") return NaN\n const n = Number(trimmed)\n if (!isNaN(n)) return n\n const d = Date.parse(trimmed)\n if (!isNaN(d)) return d\n }\n return NaN\n}\n\n// Numeric-first ordering compare used by >, <, >=, <=. Falls back to\n// localeCompare when either side can't be parsed as a number.\nfunction compareValues(a: unknown, b: unknown): number {\n const na = asComparableNumber(a)\n const nb = asComparableNumber(b)\n if (!isNaN(na) && !isNaN(nb)) return na - nb\n return String(a ?? \"\").localeCompare(String(b ?? \"\"))\n}\n\n// Numeric-first equality used by = and !=. So \"432\" == 432, and 432 == \"432\".\n// Falls back to strict string equality (null/undefined coerced to \"\") so\n// alpha values still work.\nfunction valuesEqual(a: unknown, b: unknown): boolean {\n const na = asComparableNumber(a)\n const nb = asComparableNumber(b)\n if (!isNaN(na) && !isNaN(nb)) return na === nb\n return String(a ?? \"\") === String(b ?? \"\")\n}\n\nfunction applyCase(s: string, caseSensitive: boolean): string {\n return caseSensitive ? s : s.toLowerCase()\n}\n\nexport function evaluateCondition(\n parsedItem: unknown,\n rawItem: string,\n condition: FilterListCondition,\n triggerData?: Record<string, unknown>,\n options?: EvaluateConditionOptions,\n): boolean {\n const path = (condition.field ?? \"\").trim()\n let fieldValue: unknown\n if (path === \"\") {\n fieldValue = parsedItem ?? rawItem\n } else {\n const matches = evaluateJsonPath(parsedItem ?? rawItem, path)\n fieldValue = matches.length > 0 ? matches[0] : undefined\n }\n\n const targetStr = resolveConditionValue(condition.value ?? \"\", condition.valueType, triggerData, options?.variables)\n // Default to case-sensitive when the flag is not explicitly set. This\n // preserves existing behavior for Router conditional mode and legacy\n // Filter List nodes that don't carry the new `caseSensitive` field.\n const cs = options?.caseSensitive ?? true\n const fieldStr = String(fieldValue ?? \"\")\n\n switch (condition.operator) {\n case \"exists\":\n return fieldValue !== undefined && fieldValue !== null\n case \"not_exists\":\n return fieldValue === undefined || fieldValue === null\n case \"contains\":\n return applyCase(fieldStr, cs).includes(applyCase(targetStr, cs))\n case \"not_contains\":\n return !applyCase(fieldStr, cs).includes(applyCase(targetStr, cs))\n case \"starts_with\":\n return applyCase(fieldStr, cs).startsWith(applyCase(targetStr, cs))\n case \"ends_with\":\n return applyCase(fieldStr, cs).endsWith(applyCase(targetStr, cs))\n case \"regex\": {\n if (!targetStr) return false\n try {\n return new RegExp(targetStr).test(fieldStr)\n } catch {\n return false\n }\n }\n case \"=\":\n return cs\n ? valuesEqual(fieldValue, targetStr)\n : applyCase(fieldStr, false) === applyCase(targetStr, false)\n case \"!=\":\n return cs\n ? !valuesEqual(fieldValue, targetStr)\n : applyCase(fieldStr, false) !== applyCase(targetStr, false)\n case \">\":\n return compareValues(fieldValue, targetStr) > 0\n case \"<\":\n return compareValues(fieldValue, targetStr) < 0\n case \">=\":\n return compareValues(fieldValue, targetStr) >= 0\n case \"<=\":\n return compareValues(fieldValue, targetStr) <= 0\n default:\n return false\n }\n}\n\n/** Evaluate a single AND/OR-joined group against one item. Empty condition\n * list evaluates to `true` — typical when the user has just added a group\n * and hasn't configured any conditions yet. */\nexport function evaluateConditionGroup(\n parsedItem: unknown,\n rawItem: string,\n conditions: readonly FilterListCondition[],\n logic: \"AND\" | \"OR\",\n triggerData?: Record<string, unknown>,\n options?: EvaluateConditionOptions,\n): boolean {\n const effective = conditions.filter((c) => c && c.operator)\n if (effective.length === 0) return true\n const results = effective.map((c) => evaluateCondition(parsedItem, rawItem, c, triggerData, options))\n return logic === \"OR\" ? results.some(Boolean) : results.every(Boolean)\n}\n","/**\n * Edge range utilities for resolving 1-based index expressions\n * and applying range/step slicing to output lists.\n *\n * Used by both frontend DAG executor and backend orchestrator\n * to support edge-level range, step, and item selection.\n */\n\nimport { evaluateCondition, substituteTriggerTokens, tryParseJson } from \"./filter-condition.js\"\nimport { resolveNodeRefs } from \"./node-refs.js\"\n\n/** Selector tab on an edge — \"range\" (from/to/step) or \"list\" (expression). */\nexport type SelectorMode = \"range\" | \"list\"\n\n/** Per-edge output mode controlling how upstream results reach downstream. */\nexport type OutputMode = \"last\" | \"each\" | \"all\" | \"item\"\n\n/** Edge-data fields consumed by selectListItems / isDefaultSelectorConfig. */\nexport type SelectorFields = {\n selectorMode?: SelectorMode\n listExpression?: string\n rangeFrom?: string\n rangeTo?: string\n rangeStep?: number\n}\n\n/** Full selector mode set — extends the edge-selector modes with new operators. */\nexport type FullSelectorMode =\n | \"item\"\n | \"range\"\n | \"list\"\n | \"random\"\n | \"modulo\"\n | \"predicate\"\n | \"named-key\"\n\n/** Operator set for predicate mode — reused from filter-list. */\nexport type SelectorPredicateOp =\n | \">\" | \"<\" | \">=\" | \"<=\"\n | \"=\" | \"!=\"\n | \"contains\" | \"not_contains\"\n | \"starts_with\" | \"ends_with\"\n | \"regex\"\n | \"exists\" | \"not_exists\"\n\n/** Config consumed by `runSelector` and `resolveSelectorRefs`. */\nexport type SelectorConfig = {\n mode: FullSelectorMode\n // item\n itemIndex?: string\n // range\n rangeFrom?: string\n rangeTo?: string\n rangeStep?: number\n // list\n listExpression?: string\n // random\n seed?: string\n randomCount?: number\n // modulo\n moduloDivisor?: string\n // predicate\n predicateField?: string\n predicateOp?: SelectorPredicateOp\n predicateValue?: string\n predicateMatch?: \"first\" | \"all\"\n predicateCaseSensitive?: boolean\n // named-key\n namedKeyField?: string\n namedKeyValue?: string\n}\n\n/** Result of a selector run. `picked ∪ rest = items`, `picked ∩ rest = ∅`. */\nexport type SelectorResult = { picked: string[]; rest: string[] }\n\n/**\n * Resolves a 1-based index expression to a 0-based array index.\n *\n * Supported expressions:\n * - \"1\", \"2\", ... — absolute 1-based index\n * - \"last\" — last element\n * - \"last-1\", \"last-2\", ... — relative from end\n *\n * Out-of-bounds values are clamped. Malformed input falls back to `defaultExpr`.\n */\nexport function resolveIndex(\n expr: string,\n listLength: number,\n defaultExpr: string = \"1\",\n): number {\n if (listLength <= 0) return 0\n\n const trimmed = expr.trim()\n let index: number\n\n if (trimmed === \"last\") {\n index = listLength - 1\n } else if (trimmed.startsWith(\"last-\")) {\n const offset = parseInt(trimmed.slice(5), 10)\n if (isNaN(offset) || offset < 0) return resolveIndex(defaultExpr === expr ? \"1\" : defaultExpr, listLength)\n index = listLength - 1 - offset\n } else {\n const n = parseInt(trimmed, 10)\n if (isNaN(n)) return resolveIndex(defaultExpr === expr ? \"1\" : defaultExpr, listLength)\n index = n - 1\n }\n\n return Math.max(0, Math.min(index, listLength - 1))\n}\n\n/**\n * Applies range and step slicing to a list of strings.\n *\n * `from` and `to` are 1-based index expressions (see `resolveIndex`).\n * `step` controls iteration direction and stride:\n * - positive step: forward iteration (from must be <= to)\n * - negative step: reverse iteration (from must be >= to)\n * - step 0 is treated as step 1\n *\n * Returns empty array if direction mismatches (e.g., from < to with negative step).\n */\nexport function applyRange(\n list: string[],\n from?: string,\n to?: string,\n step?: number,\n): string[] {\n if (list.length === 0) return []\n\n const fromIdx = resolveIndex(from ?? \"1\", list.length, \"1\")\n const toIdx = resolveIndex(to ?? \"last\", list.length, \"last\")\n const effectiveStep = step === 0 || step === undefined ? 1 : step\n\n if (effectiveStep > 0 && fromIdx > toIdx) return []\n if (effectiveStep < 0 && fromIdx < toIdx) return []\n\n const result: string[] = []\n if (effectiveStep > 0) {\n for (let i = fromIdx; i <= toIdx; i += effectiveStep) result.push(list[i])\n } else {\n for (let i = fromIdx; i >= toIdx; i += effectiveStep) result.push(list[i])\n }\n return result\n}\n\n/**\n * Migrates legacy `item:N` (0-based) outputMode to structured format.\n *\n * Legacy: `{ outputMode: \"item:0\" }` — 0-based index baked into mode string\n * New: `{ outputMode: \"item\", itemIndex: \"1\" }` — 1-based expression\n *\n * Returns the data unchanged if not a legacy item mode.\n */\nexport function migrateEdgeOutputMode(\n data: Record<string, unknown> | undefined,\n): Record<string, unknown> | undefined {\n if (!data) return data\n\n const mode = data.outputMode as string | undefined\n if (!mode || !mode.startsWith(\"item:\")) return data\n\n const idx = parseInt(mode.split(\":\")[1], 10)\n return {\n ...data,\n outputMode: \"item\",\n itemIndex: String(isNaN(idx) ? 1 : idx + 1),\n }\n}\n\n/**\n * Builds the edge range label shown as a pill on the edge.\n * Examples:\n * - \"2..last-1 +2\" — range with step 2\n * - \"last..1 -1\" — reversed\n * - \"3\" — item mode, index 3\n * - undefined — \"last\" mode has no label\n */\nexport function buildRangeLabel(\n mode: string,\n rangeFrom?: string,\n rangeTo?: string,\n rangeStep?: number,\n itemIndex?: string,\n selectorMode?: SelectorMode,\n listExpression?: string,\n): string | undefined {\n return buildItemLabel(mode, rangeFrom, rangeTo, rangeStep, itemIndex, selectorMode, listExpression)\n}\n\n/** Internal: builds the item-side label (range / list / item / each). Mode \"last\" returns undefined. */\nfunction buildItemLabel(\n mode: string,\n rangeFrom?: string,\n rangeTo?: string,\n rangeStep?: number,\n itemIndex?: string,\n selectorMode?: SelectorMode,\n listExpression?: string,\n): string | undefined {\n if (mode === \"last\") return undefined\n\n if ((mode === \"each\" || mode === \"all\") && selectorMode === \"list\") {\n const trimmed = (listExpression ?? \"\").trim()\n if (trimmed === \"\") return undefined\n return truncateLabel(trimmed, 18)\n }\n\n if (mode === \"item\") return itemIndex || undefined\n\n const from = rangeFrom ?? \"1\"\n const to = rangeTo ?? \"last\"\n const step = rangeStep ?? 1\n const isDefaultRange = from === \"1\" && to === \"last\"\n const isDefaultStep = step === 1\n if (isDefaultRange && isDefaultStep) return undefined\n\n let label = `${from}..${to}`\n if ((mode === \"each\" || mode === \"all\") && !isDefaultStep) {\n label += step > 0 ? ` +${step}` : ` ${step}`\n }\n return label\n}\n\nfunction truncateLabel(s: string, maxLen: number): string {\n if (s.length <= maxLen) return s\n return s.slice(0, maxLen) + \"…\"\n}\n\n/**\n * Validates a list expression without resolving indices.\n * Used for live UI validation in the List tab input.\n *\n * Returns { ok: true } for empty/whitespace input — matches the\n * \"empty = all items\" runtime semantics.\n */\nexport function parseListExpression(\n expr: string,\n): { ok: true } | { ok: false; error: string } {\n const result = parseListTerms(expr.trim())\n return result.ok ? { ok: true } : { ok: false, error: result.error }\n}\n\n/** Internal: validates a single index token (\"1\", \"last\", \"last-3\"). */\nfunction isValidIndexToken(token: string): boolean {\n if (token === \"last\") return true\n if (/^[1-9]\\d*$/.test(token)) return true\n const m = /^last-(\\d+)$/.exec(token)\n if (m) return !isNaN(parseInt(m[1], 10))\n return false\n}\n\n/**\n * Parses a list expression and returns 0-based indices into the list,\n * in user-specified order. Preserves duplicates.\n *\n * Supported syntax:\n * <expr> := <term> (\",\" <term>)*\n * <term> := <index> | <index> \"..\" <index> (\":\" <step>)?\n * <index> := <number> | \"last\" | \"last-\" <number>\n * <step> := integer (0 coerced to 1)\n *\n * Clamps out-of-bounds indices. Malformed input logs a warning and\n * returns [0..listLength-1] (matches applyRange leniency).\n */\nexport function resolveListExpression(expr: string, listLength: number): number[] {\n if (listLength <= 0) return []\n const result = parseListTerms(expr.trim())\n if (!result.ok) {\n console.warn(\"[edge-range] invalid list expression:\", expr, \"—\", result.error)\n return indexRange(0, listLength - 1, 1)\n }\n if (result.terms.length === 0) return indexRange(0, listLength - 1, 1)\n\n const out: number[] = []\n for (const term of result.terms) {\n if (term.kind === \"index\") {\n out.push(resolveIndex(term.token, listLength))\n } else {\n const from = resolveIndex(term.from, listLength)\n const to = resolveIndex(term.to, listLength)\n for (const idx of indexRange(from, to, term.step)) out.push(idx)\n }\n }\n return out\n}\n\n/** Internal: inclusive index range with step. Returns [] if direction mismatches. */\nfunction indexRange(from: number, to: number, step: number): number[] {\n const out: number[] = []\n if (step > 0) {\n if (from > to) return []\n for (let i = from; i <= to; i += step) out.push(i)\n } else {\n if (from < to) return []\n for (let i = from; i >= to; i += step) out.push(i)\n }\n return out\n}\n\n/**\n * Dispatches to either applyRange() or resolveListExpression() based on\n * edgeData.selectorMode. Returns a new string[] containing the selected\n * subset of items — or `items` unchanged when the edge has no filter.\n */\nexport function selectListItems(\n items: string[],\n edgeData: SelectorFields | undefined,\n): string[] {\n if (items.length === 0) return []\n if (isDefaultSelectorConfig(edgeData)) return items\n if (edgeData?.selectorMode === \"list\") {\n const indices = resolveListExpression(edgeData.listExpression ?? \"\", items.length)\n return indices.map((i) => items[i])\n }\n return applyRange(items, edgeData?.rangeFrom, edgeData?.rangeTo, edgeData?.rangeStep)\n}\n\n/**\n * Returns true when edge data carries no active filter — empty/whitespace list\n * expression in list mode, or defaults (1..last, step 1) in range mode.\n * Callers can skip filtering entirely when this returns true.\n */\nexport function isDefaultSelectorConfig(edgeData: SelectorFields | undefined): boolean {\n if (!edgeData) return true\n if (edgeData.selectorMode === \"list\") {\n return ((edgeData.listExpression ?? \"\").trim()) === \"\"\n }\n const { from, to, step } = canonicalRange(edgeData)\n return from === \"1\" && to === \"last\" && step === 1\n}\n\nexport function describeEdgeBehavior(\n edgeData:\n | {\n outputMode?: string\n selectorMode?: SelectorMode\n listExpression?: string\n rangeFrom?: string\n rangeTo?: string\n rangeStep?: number\n itemIndex?: string\n }\n | undefined,\n): string {\n const mode = edgeData?.outputMode\n return buildBaseSentence(edgeData, mode)\n}\n\nfunction buildBaseSentence(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n mode: string | undefined,\n): string {\n if (mode === \"last\") return \"Passes the selected result.\"\n if (mode === \"item\") return buildItemSentence(edgeData)\n if (mode === \"each\") return buildEachSentence(edgeData)\n if (mode === \"all\") return buildAllSentence(edgeData)\n return \"Passes all items at once.\"\n}\n\nfunction buildItemSentence(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n): string {\n const canonical = canonicalItemIndex(edgeData?.itemIndex)\n return `Passes only ${itemModeForm(canonical)}.`\n}\n\nfunction buildEachSentence(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n): string {\n if (isDefaultSelectorConfig(edgeData)) return \"Runs the next node one by one, per item.\"\n if (edgeData?.selectorMode === \"list\") {\n const result = parseListTerms((edgeData.listExpression ?? \"\").trim())\n if (!result.ok) return \"Runs the next node one by one, per item.\"\n }\n const phrase = buildSelectionPhrase(edgeData)\n if (phrase.kind === \"empty-result\") {\n return \"Nothing selected — the next node won't run.\"\n }\n if (phrase.kind === \"single-index\") {\n return `Runs the next node only on ${phrase.itemModeForm}.`\n }\n return `Runs the next node once for ${phrase.text}.`\n}\n\nfunction buildAllSentence(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n): string {\n if (isDefaultSelectorConfig(edgeData)) return \"Passes all items at once.\"\n if (edgeData?.selectorMode === \"list\") {\n const result = parseListTerms((edgeData.listExpression ?? \"\").trim())\n if (!result.ok) return \"Passes all items at once.\"\n }\n const phrase = buildSelectionPhrase(edgeData)\n if (phrase.kind === \"empty-result\") {\n return \"Nothing selected — the next node will get an empty bundle.\"\n }\n if (phrase.kind === \"single-index\") {\n return `Passes only ${phrase.itemModeForm}.`\n }\n return `Passes ${phrase.text} at once.`\n}\n\ntype CanonicalRange = { from: string; to: string; step: number }\n\nfunction canonicalItemIndex(raw: string | undefined): string {\n const trimmed = (raw ?? \"\").trim()\n if (trimmed === \"\") return \"1\"\n if (!isValidIndexToken(trimmed)) return \"1\"\n return trimmed\n}\n\nfunction canonicalRange(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n): CanonicalRange {\n const from = ((edgeData?.rangeFrom ?? \"\").trim() || \"1\")\n const to = ((edgeData?.rangeTo ?? \"\").trim() || \"last\")\n const rawStep = edgeData?.rangeStep\n const step = rawStep === undefined || rawStep === 0 ? 1 : rawStep\n return { from, to, step }\n}\n\n\nfunction itemModeForm(canonical: string): string {\n if (canonical === \"1\") return \"the first item\"\n if (/^\\d+$/.test(canonical)) return `item ${canonical}`\n if (canonical === \"last\" || canonical === \"last-0\") return \"the last item\"\n const m = /^last-(\\d+)$/.exec(canonical)\n if (m) {\n const n = parseInt(m[1], 10)\n if (n === 1) return \"the second-to-last item\"\n if (n === 2) return \"the third-to-last item\"\n if (n === 3) return \"the fourth-to-last item\"\n return `the ${ordinal(n + 1)}-from-last item`\n }\n return \"the first item\"\n}\n\nfunction compactForm(canonical: string): string {\n if (/^\\d+$/.test(canonical)) return canonical\n if (canonical === \"last\" || canonical === \"last-0\") return \"the last one\"\n const m = /^last-(\\d+)$/.exec(canonical)\n if (m) {\n const n = parseInt(m[1], 10)\n if (n === 1) return \"the second-to-last\"\n if (n === 2) return \"the third-to-last\"\n if (n === 3) return \"the fourth-to-last\"\n return `the ${ordinal(n + 1)}-from-last`\n }\n return canonical\n}\n\nfunction ordinal(n: number): string {\n const absN = Math.abs(n)\n const lastTwo = absN % 100\n if (lastTwo >= 11 && lastTwo <= 13) return `${n}th`\n switch (absN % 10) {\n case 1: return `${n}st`\n case 2: return `${n}nd`\n case 3: return `${n}rd`\n default: return `${n}th`\n }\n}\n\ntype SelectionPhrase =\n | { kind: \"items\"; text: string }\n | { kind: \"single-index\"; itemModeForm: string }\n | { kind: \"empty-result\" }\n\nfunction buildSelectionPhrase(\n edgeData: Parameters<typeof describeEdgeBehavior>[0],\n): SelectionPhrase {\n if (edgeData?.selectorMode === \"list\") {\n return buildListSelectionPhrase((edgeData.listExpression ?? \"\").trim())\n }\n return buildRangeSelectionPhrase(canonicalRange(edgeData))\n}\n\nfunction indexKind(token: string): \"concrete\" | \"relative\" | \"invalid\" {\n if (/^[1-9]\\d*$/.test(token)) return \"concrete\"\n if (token === \"last\" || /^last-\\d+$/.test(token)) return \"relative\"\n return \"invalid\"\n}\n\nfunction relativeOffset(token: string): number {\n if (token === \"last\") return 0\n const m = /^last-(\\d+)$/.exec(token)\n return m ? parseInt(m[1], 10) : 0\n}\n\nfunction compareTokens(a: string, b: string): -1 | 0 | 1 | \"indeterminate\" {\n const ka = indexKind(a)\n const kb = indexKind(b)\n if (ka !== kb) return \"indeterminate\"\n if (ka === \"concrete\") {\n const na = parseInt(a, 10)\n const nb = parseInt(b, 10)\n return na < nb ? -1 : na > nb ? 1 : 0\n }\n if (ka === \"relative\") {\n const oa = relativeOffset(a)\n const ob = relativeOffset(b)\n return oa < ob ? 1 : oa > ob ? -1 : 0\n }\n return \"indeterminate\"\n}\n\nfunction buildRangeSelectionPhrase(r: CanonicalRange): SelectionPhrase {\n const { from, to, step } = r\n\n const cmp = compareTokens(from, to)\n if (cmp !== \"indeterminate\") {\n if (step > 0 && cmp === 1) return { kind: \"empty-result\" }\n if (step < 0 && cmp === -1) return { kind: \"empty-result\" }\n }\n\n if (cmp === 0) {\n return { kind: \"single-index\", itemModeForm: itemModeForm(from) }\n }\n\n const absStep = Math.abs(step)\n if (step === -1 && from === \"last\" && to === \"1\") {\n return { kind: \"items\", text: \"all items in reverse order\" }\n }\n\n let text = `items ${compactForm(from)} through ${compactForm(to)}`\n if (absStep === 1 && step < 0) {\n text += \" in reverse order\"\n } else if (absStep > 1 && step > 0) {\n text += ` (every ${ordinal(absStep)} item)`\n } else if (absStep > 1 && step < 0) {\n text += ` (every ${ordinal(absStep)} item, in reverse)`\n }\n return { kind: \"items\", text }\n}\n\ntype ListTerm =\n | { kind: \"index\"; token: string }\n | { kind: \"range\"; from: string; to: string; step: number }\n\ntype ParseResult =\n | { ok: true; terms: ListTerm[] }\n | { ok: false; error: string }\n\n/**\n * Core list-expression parser. Returns structured terms on success or a\n * specific error message on failure. Empty input → zero terms (not an error).\n * Error messages are surfaced unchanged in the edge-config tooltip, so they\n * must stay stable:\n * - \"Empty item between commas\"\n * - \"Invalid index: <token>\"\n * - \"Range missing endpoint: <term>\"\n * - \"Step must be an integer\"\n */\nfunction parseListTerms(expr: string): ParseResult {\n if (expr === \"\") return { ok: true, terms: [] }\n const terms: ListTerm[] = []\n const raw = expr.split(\",\")\n for (const rawTerm of raw) {\n const term = rawTerm.trim()\n if (term === \"\") return { ok: false, error: \"Empty item between commas\" }\n const rangeIdx = term.indexOf(\"..\")\n if (rangeIdx === -1) {\n if (!isValidIndexToken(term)) return { ok: false, error: `Invalid index: ${term}` }\n terms.push({ kind: \"index\", token: term })\n continue\n }\n const left = term.slice(0, rangeIdx).trim()\n const rightWithStep = term.slice(rangeIdx + 2).trim()\n if (left === \"\" || rightWithStep === \"\") {\n return { ok: false, error: `Range missing endpoint: ${term}` }\n }\n const colonIdx = rightWithStep.indexOf(\":\")\n const right = colonIdx === -1 ? rightWithStep : rightWithStep.slice(0, colonIdx).trim()\n const stepStr = colonIdx === -1 ? null : rightWithStep.slice(colonIdx + 1).trim()\n if (right === \"\") return { ok: false, error: `Range missing endpoint: ${term}` }\n if (!isValidIndexToken(left)) return { ok: false, error: `Invalid index: ${left}` }\n if (!isValidIndexToken(right)) return { ok: false, error: `Invalid index: ${right}` }\n let step = 1\n if (stepStr !== null) {\n if (!/^-?\\d+$/.test(stepStr)) return { ok: false, error: \"Step must be an integer\" }\n const parsed = parseInt(stepStr, 10)\n step = parsed === 0 ? 1 : parsed\n }\n terms.push({ kind: \"range\", from: left, to: right, step })\n }\n return { ok: true, terms }\n}\n\nfunction buildListSelectionPhrase(expr: string): SelectionPhrase {\n const result = parseListTerms(expr)\n if (!result.ok) return { kind: \"empty-result\" }\n if (result.terms.length === 0) return { kind: \"items\", text: \"items\" } // unreachable via callers; default-config catches empty\n\n const normalized = result.terms.map<ListTerm>((t) => {\n if (t.kind === \"range\") {\n const cmp = compareTokens(t.from, t.to)\n if (cmp === 0) return { kind: \"index\", token: t.from }\n }\n return t\n })\n\n if (normalized.length === 1 && normalized[0].kind === \"index\") {\n return { kind: \"single-index\", itemModeForm: itemModeForm(normalized[0].token) }\n }\n\n const rendered = normalized.map((t) => {\n if (t.kind === \"index\") return compactForm(t.token)\n let text = `${compactForm(t.from)} through ${compactForm(t.to)}`\n const absStep = Math.abs(t.step)\n if (absStep === 1 && t.step < 0) {\n if (t.from === \"last\" && t.to === \"1\") return \"all items in reverse\"\n text += \" in reverse\"\n } else if (absStep > 1 && t.step > 0) {\n text += ` (every ${ordinal(absStep)})`\n } else if (absStep > 1 && t.step < 0) {\n text += ` (every ${ordinal(absStep)}, in reverse)`\n }\n return text\n })\n\n let joined: string\n if (rendered.length === 1) {\n joined = rendered[0]\n } else if (rendered.length === 2) {\n joined = `${rendered[0]} and ${rendered[1]}`\n } else {\n const head = rendered.slice(0, -1).join(\", \")\n joined = `${head}, and ${rendered[rendered.length - 1]}`\n }\n return { kind: \"items\", text: `items ${joined}` }\n}\n\n/**\n * Run the selector against `items`. Returns the picked subset plus the\n * complement (`rest`). For modes that pick by index, `rest` is computed by\n * index exclusion (not value) so duplicate items are handled correctly.\n */\nexport function runSelector(items: string[], config: SelectorConfig): SelectorResult {\n if (items.length === 0) return { picked: [], rest: [] }\n\n switch (config.mode) {\n case \"item\": {\n const idx = resolveIndex(config.itemIndex ?? \"1\", items.length, \"1\")\n return splitByIndices(items, [idx])\n }\n case \"range\": {\n const indices = applyRangeIndices(items.length, config.rangeFrom, config.rangeTo, config.rangeStep)\n return splitByIndices(items, indices)\n }\n case \"list\": {\n const indices = resolveListExpression(config.listExpression ?? \"\", items.length)\n return splitByIndices(items, indices)\n }\n case \"random\":\n return selectRandom(items, config.randomCount ?? 1, config.seed)\n case \"modulo\":\n return selectByModulo(items, config.moduloDivisor)\n case \"predicate\":\n return selectByPredicate(items, config)\n case \"named-key\":\n return selectByNamedKey(items, config.namedKeyField, config.namedKeyValue)\n default:\n return { picked: [], rest: items.slice() }\n }\n}\n\n/**\n * Partition `items` into picked (indices ∈ pickedIndices, in their original\n * order in the source list) and rest (everything else). Deduplicates\n * `pickedIndices` so passing the same index twice doesn't double-count.\n */\nfunction splitByIndices(items: string[], pickedIndices: number[]): SelectorResult {\n const pickedSet = new Set(pickedIndices.filter((i) => i >= 0 && i < items.length))\n const picked: string[] = []\n const rest: string[] = []\n for (let i = 0; i < items.length; i++) {\n if (pickedSet.has(i)) picked.push(items[i])\n else rest.push(items[i])\n }\n return { picked, rest }\n}\n\n/**\n * Returns the indices that `applyRange` would pick. Extracted so `runSelector`\n * range mode can compute the exact picked-index set (`items.indexOf(value)`\n * would return the wrong duplicate when the list contains repeated values).\n */\nexport function applyRangeIndices(\n length: number,\n from?: string,\n to?: string,\n step?: number,\n): number[] {\n if (length === 0) return []\n const fromIdx = resolveIndex(from ?? \"1\", length, \"1\")\n const toIdx = resolveIndex(to ?? \"last\", length, \"last\")\n const effectiveStep = step === 0 || step === undefined ? 1 : step\n if (effectiveStep > 0 && fromIdx > toIdx) return []\n if (effectiveStep < 0 && fromIdx < toIdx) return []\n const result: number[] = []\n if (effectiveStep > 0) {\n for (let i = fromIdx; i <= toIdx; i += effectiveStep) result.push(i)\n } else {\n for (let i = fromIdx; i >= toIdx; i += effectiveStep) result.push(i)\n }\n return result\n}\n\n/** mulberry32 PRNG — deterministic given a seed (any 32-bit signed integer).\n *\n * TWIN WARNING: backend/src/providers/video/audio-fx.ts carries its own\n * private mulberry32 (cosmetically different — `>>> 0` seed masking — but the\n * same sequence). The two are deliberately INDEPENDENT and both frozen: the\n * audio-fx copy seeds every reverb impulse response that the committed\n * characterization goldens (and every customer's rendered reverb waveform)\n * are pinned to. Do NOT \"deduplicate\" them into one shared export or \"sync\"\n * one to match the other — a change to either sequence is a silent behavior\n * change in its domain. */\nfunction mulberry32(seed: number): () => number {\n let a = seed | 0\n return () => {\n a = (a + 0x6D2B79F5) | 0\n let t = a\n t = Math.imul(t ^ (t >>> 15), t | 1)\n t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n }\n}\n\n/** Hash a seed string to a 32-bit integer (FNV-1a variant). */\nfunction hashSeed(s: string): number {\n let h = 2166136261 | 0\n for (let i = 0; i < s.length; i++) {\n h ^= s.charCodeAt(i)\n h = Math.imul(h, 16777619)\n }\n return h\n}\n\n/**\n * Pick `count` items uniformly at random without replacement.\n * If `seed` is non-empty, the PRNG is seeded deterministically.\n * Otherwise `Math.random` is used (fresh randomness per call).\n */\nexport function selectRandom(items: string[], count: number, seed?: string): SelectorResult {\n if (items.length === 0) return { picked: [], rest: [] }\n const k = Math.max(0, Math.min(count, items.length))\n const rand = seed && seed.length > 0 ? mulberry32(hashSeed(seed)) : Math.random\n // Partial Fisher-Yates: shuffle the first k positions, pick those indices.\n const indices = items.map((_, i) => i)\n for (let i = 0; i < k; i++) {\n const j = i + Math.floor(rand() * (indices.length - i))\n ;[indices[i], indices[j]] = [indices[j], indices[i]]\n }\n return splitByIndices(items, indices.slice(0, k))\n}\n\n/**\n * Pick a single item at `divisor % items.length`. Non-numeric `divisor`\n * falls back to index 0. Caller is responsible for resolving any\n * `{NodeLabel}` template refs in `divisor` BEFORE calling this — see\n * `resolveSelectorRefs`.\n */\nexport function selectByModulo(items: string[], divisor: string | undefined): SelectorResult {\n if (items.length === 0) return { picked: [], rest: [] }\n const n = divisor ? Number.parseInt(divisor.trim(), 10) : NaN\n const safeN = Number.isFinite(n) ? n : 0\n const idx = ((safeN % items.length) + items.length) % items.length\n return splitByIndices(items, [idx])\n}\n\n/**\n * Pick items whose parsed JSON satisfies the predicate. `match: \"first\"`\n * (default) stops at the first hit; `\"all\"` collects every hit.\n *\n * Reuses the filter-list condition evaluator so operator semantics\n * (numeric coercion on `=`/`!=`, locale-aware ordering, case-sensitive\n * text ops) stay identical to the Filter List node.\n */\nexport function selectByPredicate(\n items: string[],\n config: SelectorConfig,\n): SelectorResult {\n if (items.length === 0) return { picked: [], rest: [] }\n // Default operator to \"=\" so the UI's visual default (selector-config.tsx\n // shows `op={config.predicateOp ?? \"=\"}`) matches runtime; first-time\n // predicate use without explicitly setting an operator used to silently\n // return picked=[].\n // predicateField is intentionally allowed to be empty/undefined —\n // evaluateCondition treats an empty path as \"compare against the whole\n // item\" (filter-condition.ts:161), matching the UI placeholder hint\n // \"blank = whole item\" on the field input.\n const op = config.predicateOp ?? \"=\"\n // Pass caseSensitive explicitly. evaluateCondition defaults undefined to\n // `true` (case-sensitive) to preserve legacy callers, but the selector\n // UI checkbox shows unchecked by default — so undefined config must map\n // to case-INsensitive at runtime to match what the user sees.\n const opts = { caseSensitive: config.predicateCaseSensitive ?? false }\n const matchAll = config.predicateMatch === \"all\"\n const cond = {\n id: \"selector-predicate\",\n field: config.predicateField ?? \"\",\n operator: op,\n value: config.predicateValue ?? \"\",\n valueType: \"static\" as const,\n }\n const matchedIndices: number[] = []\n for (let i = 0; i < items.length; i++) {\n const parsed = tryParseJson(items[i])\n const hit = evaluateCondition(parsed, items[i], cond, undefined, opts)\n if (hit) {\n matchedIndices.push(i)\n if (!matchAll) break\n }\n }\n return splitByIndices(items, matchedIndices)\n}\n\n/**\n * Shortcut for `predicate(op=\"=\", match=\"first\")` — pick the first item\n * whose `field` strictly equals `value`. Implemented as a thin wrapper\n * so the UI can offer a 2-field form (\"look up by name\") instead of the\n * full 4-field predicate form.\n */\nexport function selectByNamedKey(\n items: string[],\n field: string | undefined,\n value: string | undefined,\n): SelectorResult {\n return selectByPredicate(items, {\n mode: \"predicate\",\n predicateField: field,\n predicateOp: \"=\",\n predicateValue: value,\n predicateMatch: \"first\",\n })\n}\n\n/**\n * Returns a new SelectorConfig with `{NodeLabel}` refs and `{{trigger.*}}` /\n * `{{now}}` / `{{last_N_*:N}}` template tokens resolved in the four\n * template-aware fields: moduloDivisor, predicateValue, namedKeyValue, seed.\n * All other fields are passed through unchanged. Callers must build\n * `variables` via `buildConditionVariables` (or equivalent) BEFORE calling.\n *\n * Other selector fields (itemIndex, range/list expressions, randomCount, etc.)\n * are treated as literals — they have their own selector-lib syntax and are\n * not resolved against the variable space.\n *\n * Token resolution matches `resolveConditionValue` exactly (both reuse\n * `substituteTriggerTokens`) so the selector's `{{trigger.foo}}` semantics\n * stay in lockstep with filter-list / router conditions.\n *\n * Pure: returns a new object; the input config is not mutated.\n */\nexport function resolveSelectorRefs(\n config: SelectorConfig,\n triggerData: Record<string, unknown> | undefined,\n variables: ReadonlyMap<string, string>,\n): SelectorConfig {\n const resolve = (v: string | undefined): string | undefined => {\n if (v == null) return v\n const refsResolved = resolveNodeRefs(v, variables)\n return substituteTriggerTokens(refsResolved, triggerData)\n }\n return {\n ...config,\n moduloDivisor: resolve(config.moduloDivisor),\n predicateValue: resolve(config.predicateValue),\n namedKeyValue: resolve(config.namedKeyValue),\n seed: resolve(config.seed),\n }\n}\n"]}
|