@nodaro/shared 3.58.0 → 3.60.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-OWNPYQSH.cjs → chunk-4GGLKRYI.cjs} +16 -3
- package/dist/chunk-4GGLKRYI.cjs.map +1 -0
- package/dist/{chunk-5PJC4ZWO.cjs → chunk-5G23AJBU.cjs} +6 -6
- package/dist/{chunk-5PJC4ZWO.cjs.map → chunk-5G23AJBU.cjs.map} +1 -1
- package/dist/{chunk-IKOKRJDI.cjs → chunk-5HK5Z5OB.cjs} +4 -4
- package/dist/{chunk-IKOKRJDI.cjs.map → chunk-5HK5Z5OB.cjs.map} +1 -1
- package/dist/{chunk-WLFT5UVV.cjs → chunk-5Y42RIGY.cjs} +8 -8
- package/dist/{chunk-WLFT5UVV.cjs.map → chunk-5Y42RIGY.cjs.map} +1 -1
- package/dist/{chunk-L26G7B27.js → chunk-6AJOTEVC.js} +3 -3
- package/dist/{chunk-L26G7B27.js.map → chunk-6AJOTEVC.js.map} +1 -1
- package/dist/{chunk-OMUYZKRB.js → chunk-6Q6SI7AG.js} +3 -3
- package/dist/{chunk-OMUYZKRB.js.map → chunk-6Q6SI7AG.js.map} +1 -1
- package/dist/{chunk-4ZZ6SVIQ.cjs → chunk-A6HRY3WF.cjs} +269 -37
- package/dist/chunk-A6HRY3WF.cjs.map +1 -0
- package/dist/{chunk-ZX6RRM6R.cjs → chunk-AXT7YNOR.cjs} +51 -51
- package/dist/{chunk-ZX6RRM6R.cjs.map → chunk-AXT7YNOR.cjs.map} +1 -1
- package/dist/{chunk-ODTZV3BW.js → chunk-AZGONXWV.js} +4 -4
- package/dist/{chunk-ODTZV3BW.js.map → chunk-AZGONXWV.js.map} +1 -1
- package/dist/{chunk-S5VBJJUT.cjs → chunk-BDXXOEBZ.cjs} +80 -57
- package/dist/chunk-BDXXOEBZ.cjs.map +1 -0
- package/dist/{chunk-QPBBIRLF.cjs → chunk-BGIJO5V4.cjs} +39 -39
- package/dist/{chunk-QPBBIRLF.cjs.map → chunk-BGIJO5V4.cjs.map} +1 -1
- package/dist/{chunk-NZRG5CXQ.cjs → chunk-BLJUCPMV.cjs} +5 -2
- package/dist/chunk-BLJUCPMV.cjs.map +1 -0
- package/dist/{chunk-KYHDKKUJ.cjs → chunk-BXNPO3PL.cjs} +8 -8
- package/dist/{chunk-KYHDKKUJ.cjs.map → chunk-BXNPO3PL.cjs.map} +1 -1
- package/dist/{chunk-S7FCFQ6X.js → chunk-CF4S4N5X.js} +16 -4
- package/dist/chunk-CF4S4N5X.js.map +1 -0
- package/dist/{chunk-4UUX62S3.cjs → chunk-CIOXUPCJ.cjs} +12 -12
- package/dist/{chunk-4UUX62S3.cjs.map → chunk-CIOXUPCJ.cjs.map} +1 -1
- package/dist/{chunk-5UVBFY2G.cjs → chunk-DQIJPDHC.cjs} +11 -11
- package/dist/{chunk-5UVBFY2G.cjs.map → chunk-DQIJPDHC.cjs.map} +1 -1
- package/dist/{chunk-UMPZR56R.js → chunk-DS2TOM32.js} +3 -3
- package/dist/{chunk-UMPZR56R.js.map → chunk-DS2TOM32.js.map} +1 -1
- package/dist/{chunk-K6UMB37V.js → chunk-EN2YI5TV.js} +3 -3
- package/dist/{chunk-K6UMB37V.js.map → chunk-EN2YI5TV.js.map} +1 -1
- package/dist/{chunk-SEQ5L72K.js → chunk-G6GMY5BC.js} +21 -4
- package/dist/chunk-G6GMY5BC.js.map +1 -0
- package/dist/chunk-G7ZYZQKO.cjs +27 -0
- package/dist/{chunk-QCW6J6BQ.cjs.map → chunk-G7ZYZQKO.cjs.map} +1 -1
- package/dist/{chunk-WBERPAXE.cjs → chunk-GNPJ2JLE.cjs} +6 -6
- package/dist/{chunk-WBERPAXE.cjs.map → chunk-GNPJ2JLE.cjs.map} +1 -1
- package/dist/{chunk-VZXRDSWA.cjs → chunk-GWBQ3GPO.cjs} +43 -21
- package/dist/chunk-GWBQ3GPO.cjs.map +1 -0
- package/dist/{chunk-DCP7JFSE.cjs → chunk-HDHLZK7C.cjs} +5 -5
- package/dist/{chunk-DCP7JFSE.cjs.map → chunk-HDHLZK7C.cjs.map} +1 -1
- package/dist/{chunk-QVPIO2NU.cjs → chunk-HNEF2N5C.cjs} +5 -5
- package/dist/{chunk-QVPIO2NU.cjs.map → chunk-HNEF2N5C.cjs.map} +1 -1
- package/dist/{chunk-7JM5EZF3.cjs → chunk-HOKWJXHA.cjs} +13 -13
- package/dist/{chunk-7JM5EZF3.cjs.map → chunk-HOKWJXHA.cjs.map} +1 -1
- package/dist/{chunk-FVKCNAEQ.js → chunk-HP3YIWNJ.js} +9 -4
- package/dist/chunk-HP3YIWNJ.js.map +1 -0
- package/dist/{chunk-UJJUX6NW.cjs → chunk-HW6TLOK4.cjs} +9 -3
- package/dist/chunk-HW6TLOK4.cjs.map +1 -0
- package/dist/{chunk-A5ESI2NY.js → chunk-ICDLYU4I.js} +9 -9
- package/dist/{chunk-A5ESI2NY.js.map → chunk-ICDLYU4I.js.map} +1 -1
- package/dist/{chunk-JUEFRVHZ.js → chunk-IV6IDECY.js} +4 -4
- package/dist/{chunk-JUEFRVHZ.js.map → chunk-IV6IDECY.js.map} +1 -1
- package/dist/{chunk-HEUWAIXG.js → chunk-JKZVRKN3.js} +36 -14
- package/dist/chunk-JKZVRKN3.js.map +1 -0
- package/dist/{chunk-ZMH56CLL.js → chunk-KJZVQIN4.js} +3 -3
- package/dist/{chunk-ZMH56CLL.js.map → chunk-KJZVQIN4.js.map} +1 -1
- package/dist/{chunk-6CYS7VRH.js → chunk-KOLC7AF2.js} +262 -38
- package/dist/chunk-KOLC7AF2.js.map +1 -0
- package/dist/{chunk-CNSRCZYY.js → chunk-LN3EVFRS.js} +5 -5
- package/dist/{chunk-CNSRCZYY.js.map → chunk-LN3EVFRS.js.map} +1 -1
- package/dist/{chunk-DC2QPACA.js → chunk-MHY47BLL.js} +4 -4
- package/dist/{chunk-DC2QPACA.js.map → chunk-MHY47BLL.js.map} +1 -1
- package/dist/{chunk-AWS4BWEC.js → chunk-Q6IES3U2.js} +5 -2
- package/dist/chunk-Q6IES3U2.js.map +1 -0
- package/dist/{chunk-PK4ZR2SK.cjs → chunk-RRPPXZ36.cjs} +4 -4
- package/dist/{chunk-PK4ZR2SK.cjs.map → chunk-RRPPXZ36.cjs.map} +1 -1
- package/dist/{chunk-6TFWFYYI.js → chunk-SCYBGTX6.js} +3 -3
- package/dist/{chunk-6TFWFYYI.js.map → chunk-SCYBGTX6.js.map} +1 -1
- package/dist/{chunk-I7NG2D6X.cjs → chunk-SKFJIFEV.cjs} +21 -21
- package/dist/{chunk-I7NG2D6X.cjs.map → chunk-SKFJIFEV.cjs.map} +1 -1
- package/dist/{chunk-VVGSIWNL.js → chunk-TZ42IVSF.js} +4 -4
- package/dist/{chunk-VVGSIWNL.js.map → chunk-TZ42IVSF.js.map} +1 -1
- package/dist/{chunk-IQBIH3AE.js → chunk-URLDVK67.js} +3 -3
- package/dist/{chunk-IQBIH3AE.js.map → chunk-URLDVK67.js.map} +1 -1
- package/dist/{chunk-IOET54EV.js → chunk-VB2ARGQ6.js} +35 -3
- package/dist/chunk-VB2ARGQ6.js.map +1 -0
- package/dist/{chunk-BSENM6HM.js → chunk-VYQ25YQF.js} +3 -3
- package/dist/{chunk-BSENM6HM.js.map → chunk-VYQ25YQF.js.map} +1 -1
- package/dist/{chunk-QSWUSXRL.cjs → chunk-WGKAOUEQ.cjs} +41 -2
- package/dist/chunk-WGKAOUEQ.cjs.map +1 -0
- package/dist/{chunk-M7SMSAOU.js → chunk-YHVEZVAO.js} +4 -4
- package/dist/{chunk-M7SMSAOU.js.map → chunk-YHVEZVAO.js.map} +1 -1
- package/dist/entries/apps.cjs +43 -43
- package/dist/entries/apps.js +8 -8
- package/dist/entries/credits.cjs +155 -151
- package/dist/entries/credits.d.cts +32 -3
- package/dist/entries/credits.d.ts +32 -3
- package/dist/entries/credits.js +8 -8
- package/dist/entries/edl.cjs +63 -59
- package/dist/entries/edl.d.cts +15 -1
- package/dist/entries/edl.d.ts +15 -1
- package/dist/entries/edl.js +1 -1
- package/dist/entries/llm-models.d.cts +1 -1
- package/dist/entries/llm-models.d.ts +1 -1
- package/dist/entries/model-catalog.cjs +144 -84
- package/dist/entries/model-catalog.d.cts +4 -47
- package/dist/entries/model-catalog.d.ts +4 -47
- package/dist/entries/model-catalog.js +5 -5
- package/dist/entries/models.cjs +308 -288
- package/dist/entries/models.d.cts +3 -3
- package/dist/entries/models.d.ts +3 -3
- package/dist/entries/models.js +4 -4
- package/dist/entries/nodes.cjs +208 -208
- package/dist/entries/nodes.d.cts +1 -1
- package/dist/entries/nodes.d.ts +1 -1
- package/dist/entries/nodes.js +10 -10
- package/dist/entries/pipeline.cjs +152 -152
- package/dist/entries/pipeline.d.cts +1 -1
- package/dist/entries/pipeline.d.ts +1 -1
- package/dist/entries/pipeline.js +3 -3
- package/dist/entries/runtime-config.cjs +32 -28
- package/dist/entries/runtime-config.d.cts +24 -2
- package/dist/entries/runtime-config.d.ts +24 -2
- package/dist/entries/runtime-config.js +1 -1
- package/dist/entries/ugc.cjs +71 -71
- package/dist/entries/ugc.js +4 -4
- package/dist/entries/video.cjs +117 -117
- package/dist/entries/video.js +4 -4
- package/dist/entries/workflow.cjs +147 -147
- package/dist/entries/workflow.d.cts +8 -0
- package/dist/entries/workflow.d.ts +8 -0
- package/dist/entries/workflow.js +2 -2
- package/dist/gpt-image-2-6-BeZdT-pW.d.cts +98 -0
- package/dist/gpt-image-2-6-BeZdT-pW.d.ts +98 -0
- package/dist/index.cjs +1412 -1320
- package/dist/index.d.cts +7 -6
- package/dist/index.d.ts +7 -6
- package/dist/index.js +22 -22
- package/dist/{model-catalog-CCsA1isC.d.ts → model-catalog-D6Es7VG-.d.cts} +59 -3
- package/dist/{model-catalog-CCsA1isC.d.cts → model-catalog-D6Es7VG-.d.ts} +59 -3
- package/dist/{model-constants-BtXkUsX3.d.cts → model-constants-22k3fjp1.d.cts} +22 -1
- package/dist/{model-constants-BtXkUsX3.d.ts → model-constants-22k3fjp1.d.ts} +22 -1
- package/package.json +1 -1
- package/src/__tests__/camera-switch-contract.test.ts +12 -3
- package/src/__tests__/credit-identifiers.test.ts +18 -9
- package/src/__tests__/gpt-image-2-6-formats.test.ts +171 -0
- package/src/__tests__/gpt-image-2-size-rules.test.ts +80 -0
- package/src/__tests__/normalize-model-input.test.ts +10 -10
- package/src/__tests__/runtime-config.test.ts +28 -0
- package/src/camera-switch-contract.ts +13 -1
- package/src/credit-identifiers.ts +63 -3
- package/src/entries/credits.ts +1 -0
- package/src/entries/model-catalog.ts +17 -0
- package/src/entries/models.ts +7 -0
- package/src/entries/runtime-config.ts +1 -0
- package/src/gpt-image-2-6.ts +72 -0
- package/src/model-catalog.ts +350 -40
- package/src/model-constants.ts +40 -0
- package/src/node-execution-state.ts +8 -0
- package/src/node-runtime-keys.ts +3 -0
- package/src/runtime-config/contract.ts +34 -0
- package/dist/chunk-4ZZ6SVIQ.cjs.map +0 -1
- package/dist/chunk-6CYS7VRH.js.map +0 -1
- package/dist/chunk-AWS4BWEC.js.map +0 -1
- package/dist/chunk-FVKCNAEQ.js.map +0 -1
- package/dist/chunk-HEUWAIXG.js.map +0 -1
- package/dist/chunk-IOET54EV.js.map +0 -1
- package/dist/chunk-NZRG5CXQ.cjs.map +0 -1
- package/dist/chunk-OWNPYQSH.cjs.map +0 -1
- package/dist/chunk-QCW6J6BQ.cjs +0 -27
- package/dist/chunk-QSWUSXRL.cjs.map +0 -1
- package/dist/chunk-S5VBJJUT.cjs.map +0 -1
- package/dist/chunk-S7FCFQ6X.js.map +0 -1
- package/dist/chunk-SEQ5L72K.js.map +0 -1
- package/dist/chunk-UJJUX6NW.cjs.map +0 -1
- package/dist/chunk-VZXRDSWA.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;AAQO,SAAS,oBAAA,CAAqB,OAAuC,MAAA,EAAwB;AAClG,EAAA,MAAM,QAAA,GAAW,CAAC,MAAA,KAAmB,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,YAAA,KAAiB,MAAM,CAAA,CAAE,MAAA;AAC3G,EAAA,OAAO,qBAAA,CAAsB,KAAA,EAAO,MAAA,EAAQ,OAAO,IAAI,QAAA,CAAS,QAAQ,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,QAAA,CAAS,OAAO,IAAI,CAAC,CAAA;AAC/G;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;;;ACzTO,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;;;ACzCO,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;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA;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,iBAAA;AAAA;AAAA;AAAA,EAGA;AACF,CAAC;AAmBM,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,CAAA;AAAA,EAC1B,eAAA,EAAiB,CAAC,GAAG,2BAAA,EAA6B,GAAG,yBAAA,CAA0B,MAAA,CAAO,CAAC,GAAA,KAAQ,GAAA,KAAQ,UAAU,CAAC;AACpH;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,WAAA;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,iBAAA;AAAA;AAAA;AAAA,EAGA;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;;;ACtRO,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-AWS4BWEC.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/**\n * The wires that bring a node the images a run sends, besides its own source:\n * its reference images, each identity node on the `assets` handle (one image at\n * least), and every `image` wire after the first (the first is the source, which\n * an edit's estimate counts itself). For a model priced per input image.\n */\nexport function countImageInputEdges(edges: ReadonlyArray<RefModalityEdge>, nodeId: string): number {\n const onHandle = (handle: string) => edges.filter((e) => e.target === nodeId && e.targetHandle === handle).length\n return countRefModalityEdges(edges, nodeId, \"image\") + onHandle(\"assets\") + Math.max(0, onHandle(\"image\") - 1)\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","import { SUNO_SEPARATE_META_FIELDS, SUNO_SEPARATE_RESULT_FIELDS } from \"./suno-separate.js\"\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 // Where this node's job stands in line while it waits for a free slot\n // (the job read's `queue` field), shown by the editor's queue badge. Pure run\n // state, replaced on each read and cleared once the job leaves `queued`, so\n // it is ALSO in TRANSIENT_RUNTIME_KEYS below: a badge never marks the\n // workflow dirty and is never saved.\n \"queueInfo\",\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 // The content rights confirmation a run fetches a Video URL node's link\n // under: that run's input override alone, never saved (also transient).\n \"rightsConfirmationId\",\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 *\n * Suno Separate: every stem / take URL a run writes and the run's facts (its\n * engine, a Demucs fallback's refusal and reason, its mode) — not `stemName`,\n * the node's instrument setting that the run only echoes back.\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 \"suno-separate\": [...SUNO_SEPARATE_RESULT_FIELDS, ...SUNO_SEPARATE_META_FIELDS.filter((key) => key !== \"stemName\")],\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 \"queueInfo\",\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 // The content rights confirmation a run fetches a Video URL node's link\n // under: one run's override (RUN_ONLY_NODE_FIELDS), never config.\n \"rightsConfirmationId\",\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"]}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/audio-crossfade-curves.ts","../src/smart-cut-windows.ts","../src/speaker-tracks.ts","../src/speaker-map-contract.ts","../src/camera-switch-contract.ts","../src/edit-plan-contract.ts"],"names":["num"],"mappings":";;;AAkBO,IAAM,sBAAA,GAAyD;AAAA,EACpE;AAAA,IACE,EAAA,EAAI,QAAA;AAAA,IACJ,MAAA,EAAQ,KAAA;AAAA,IACR,KAAA,EAAO,QAAA;AAAA,IACP,WAAA,EAAa;AAAA,GACf;AAAA,EACA;AAAA,IACE,EAAA,EAAI,aAAA;AAAA,IACJ,MAAA,EAAQ,MAAA;AAAA,IACR,KAAA,EAAO,aAAA;AAAA,IACP,WAAA,EAAa;AAAA,GACf;AAAA,EACA;AAAA,IACE,EAAA,EAAI,QAAA;AAAA,IACJ,MAAA,EAAQ,MAAA;AAAA,IACR,KAAA,EAAO,eAAA;AAAA,IACP,WAAA,EAAa;AAAA,GACf;AAAA,EACA;AAAA,IACE,EAAA,EAAI,aAAA;AAAA,IACJ,MAAA,EAAQ,KAAA;AAAA,IACR,KAAA,EAAO,aAAA;AAAA,IACP,WAAA,EAAa;AAAA,GACf;AAAA,EACA;AAAA,IACE,EAAA,EAAI,aAAA;AAAA,IACJ,MAAA,EAAQ,KAAA;AAAA,IACR,KAAA,EAAO,aAAA;AAAA,IACP,WAAA,EAAa;AAAA;AAEjB;AAEO,IAAM,4BACX,sBAAA,CAAuB,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE;AAEjC,IAAM,gCAAA,GAAmC;AAEhD,IAAM,eAAyD,IAAI,GAAA;AAAA,EACjE,sBAAA,CAAuB,IAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC;AAC7C,CAAA;AAEO,SAAS,uBAAuB,EAAA,EAA6C;AAClF,EAAA,OAAO,YAAA,CAAa,IAAI,EAAE,CAAA;AAC5B;AAOO,SAAS,2BAA2B,EAAA,EAAgC;AACzE,EAAA,IAAI,CAAC,IAAI,OAAO,KAAA;AAChB,EAAA,OAAO,YAAA,CAAa,GAAA,CAAI,EAAE,CAAA,EAAG,MAAA,IAAU,KAAA;AACzC;;;AC/CO,IAAM,oBAAA,GAAuB;AAE7B,IAAM,oBAAA,GAAuB;AAG7B,IAAM,wBAAA,GAA2B;AASjC,SAAS,oBAAoB,KAAA,EAAoC;AACtE,EAAA,IAAI,OAAO,UAAU,QAAA,IAAY,CAAC,OAAO,QAAA,CAAS,KAAK,GAAG,OAAO,MAAA;AACjE,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAC1B,EAAA,IAAI,CAAA,GAAI,sBAAsB,OAAO,oBAAA;AACrC,EAAA,IAAI,CAAA,GAAI,sBAAsB,OAAO,oBAAA;AACrC,EAAA,OAAO,CAAA;AACT;;;ACAO,IAAM,sBAAA,GAAyB;AAI/B,IAAM,iCAAA,GAAoC,CAAC,YAAA,EAAc,QAAA,EAAU,gBAAgB,QAAQ;AAElG,IAAM,aAAA,GAAqC,IAAI,GAAA,CAAI,iCAAiC,CAAA;AAM7E,IAAM,mCAAA,GAAsC;AAI5C,IAAM,wBAAA,GAA2B,KAAK,IAAA,GAAO;AAgGpD,IAAM,KAAA,GAAQ,CAAC,CAAA,KAA6C,CAAC,CAAC,CAAA,IAAK,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA;AAC5G,IAAM,KAAA,GAAQ,CAAC,CAAA,KAA4B,OAAO,MAAM,QAAA,IAAY,MAAA,CAAO,SAAS,CAAC,CAAA;AACrF,IAAM,GAAA,GAAM,CAAC,CAAA,EAAY,QAAA,GAAW,MAAe,KAAA,CAAM,CAAC,IAAI,CAAA,GAAI,QAAA;AAClE,IAAM,MAAM,CAAC,CAAA,KAAoC,OAAO,CAAA,KAAM,WAAW,CAAA,GAAI,MAAA;AAC7E,IAAM,OAAA,GAAU,CAAC,CAAA,KAAsB,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,CAAC,CAAC,CAAA;AAEjE,IAAM,GAAA,GAAM,CAAK,CAAA,KAA+C,KAAA,CAAM,QAAQ,CAAC,CAAA,GAAI,IAAI,EAAC;AAExF,IAAM,GAAA,GAAM,CAAC,CAAA,KAAsB;AACjC,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACtB,EAAA,OAAO,CAAA,KAAM,IAAI,CAAA,GAAI,CAAA;AACvB,CAAA;AAOA,SAAS,QAAA,CAAS,GAAW,CAAA,EAAkD;AAC7E,EAAA,IAAI,EAAE,CAAA,GAAI,CAAA,CAAA,EAAI,OAAO,MAAA;AACrB,EAAA,IAAI,CAAA,IAAK,KAAK,CAAA,GAAI,CAAA,IAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAA;AACtC,EAAA,MAAM,EAAA,GAAK,QAAQ,CAAC,CAAA;AACpB,EAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,CAAA,GAAI,CAAC,CAAA;AACxB,EAAA,OAAO,KAAK,EAAA,GAAK,CAAC,EAAA,EAAI,EAAA,GAAK,EAAE,CAAA,GAAI,MAAA;AACnC;AAEA,SAAS,aAAa,GAAA,EAA2C;AAC/D,EAAA,IAAI,CAAC,KAAA,CAAM,GAAG,CAAA,EAAG,OAAO,MAAA;AACxB,EAAA,IAAI,CAAC,CAAC,GAAA,CAAI,EAAA,EAAI,GAAA,CAAI,GAAG,GAAA,CAAI,CAAA,EAAG,GAAA,CAAI,CAAA,EAAG,IAAI,CAAC,CAAA,CAAE,KAAA,CAAM,KAAK,GAAG,OAAO,MAAA;AAM/D,EAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,CAAA,EAAa,IAAI,CAAW,CAAA;AACpD,EAAA,MAAM,EAAA,GAAK,QAAA,CAAS,GAAA,CAAI,CAAA,EAAa,IAAI,CAAW,CAAA;AACpD,EAAA,IAAI,CAAC,EAAA,IAAM,CAAC,EAAA,EAAI,OAAO,MAAA;AACvB,EAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,EAAA;AACf,EAAA,MAAM,CAAC,CAAA,EAAG,CAAC,CAAA,GAAI,EAAA;AACf,EAAA,OAAO,EAAE,IAAI,GAAA,CAAI,GAAA,CAAI,EAAY,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAI,MAAM,GAAA,CAAI,KAAK,CAAA,GAAI,EAAE,KAAA,EAAO,OAAA,CAAQ,IAAI,KAAK,CAAA,EAAE,GAAI,EAAC,EAAG;AAC7G;AAEA,SAAS,eAAe,GAAA,EAAkC;AACxD,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,SAAU,EAAC;AACjC,EAAA,MAAM,KAAA,GAAQ,GAAA,CACX,MAAA,CAAO,KAAK,CAAA,CACZ,OAAO,CAAC,CAAA,KAAM,KAAA,CAAM,CAAA,CAAE,OAAO,CAAA,IAAK,MAAM,CAAA,CAAE,KAAK,CAAC,CAAA,CAChD,GAAA,CAAI,CAAC,OAAO,EAAE,OAAA,EAAS,GAAA,CAAI,CAAA,CAAE,OAAiB,CAAA,EAAG,OAAO,GAAA,CAAI,CAAA,CAAE,KAAe,CAAA,EAAE,CAAE,CAAA,CACjF,OAAO,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,GAAQ,CAAA,CAAE,OAAO,EACjC,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,OAAA,GAAU,EAAE,OAAA,IAAW,CAAA,CAAE,KAAA,GAAQ,CAAA,CAAE,KAAK,CAAA;AAC5D,EAAA,MAAM,SAA6B,EAAC;AACpC,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,MAAM,IAAA,GAAO,MAAA,CAAO,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA;AACrC,IAAA,IAAI,IAAA,IAAQ,EAAE,OAAA,IAAW,IAAA,CAAK,OAAO,MAAA,CAAO,MAAA,CAAO,SAAS,CAAC,CAAA,GAAI,EAAE,OAAA,EAAS,IAAA,CAAK,SAAS,KAAA,EAAO,IAAA,CAAK,IAAI,IAAA,CAAK,KAAA,EAAO,CAAA,CAAE,KAAK,CAAA,EAAE;AAAA,SAC1H,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,EACpB;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,cAAc,GAAA,EAAwB;AAC7C,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,SAAU,EAAC;AACjC,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,MAAA,CAAO,KAAK,CAAA,CAAE,GAAA,CAAI,GAAG,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,IAAI,CAAC,CAAA;AAC9D,EAAA,OAAO,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,MAAA,CAAO,CAAA,GAAI,CAAC,CAAC,CAAA;AAC/D;AAEA,SAAS,qBAAqB,GAAA,EAAmD;AAC/E,EAAA,IAAI,CAAC,KAAA,CAAM,GAAG,CAAA,EAAG,OAAO,MAAA;AACxB,EAAA,MAAM,MAAA,GAAS,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA;AAC7B,EAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AACpB,EAAA,MAAM,UAAA,GAAa,GAAA,CAAI,GAAA,CAAI,UAAU,CAAA;AACrC,EAAA,OAAO,EAAE,MAAA,EAAQ,UAAA,EAAY,OAAA,CAAQ,IAAI,GAAA,CAAI,UAAU,CAAC,CAAA,EAAG,GAAI,UAAA,GAAa,EAAE,UAAA,EAAW,GAAI,EAAC,EAAG;AACnG;AAEA,SAAS,eAAA,CAAgB,KAA8B,UAAA,EAAwC;AAC7F,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA;AAC/B,EAAA,MAAM,WAAA,GAAc,oBAAA,CAAqB,GAAA,CAAI,WAAW,CAAA;AACxD,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA,IAAK,UAAA;AAAA,IACnB,GAAI,OAAA,GAAU,EAAE,OAAA,KAAY,EAAC;AAAA,IAC7B,GAAI,WAAA,GAAc,EAAE,WAAA,KAAgB;AAAC,GACvC;AACF;AAEA,SAAS,mBAAmB,CAAA,EAAmD;AAC7E,EAAA,MAAM,WAAW,KAAA,CAAM,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA,CAAE,WAAW,EAAC;AACnD,EAAA,MAAM,eAAA,GAAkB,GAAA,CAAI,QAAA,CAAS,OAAO,CAAA;AAC5C,EAAA,OAAO;AAAA;AAAA;AAAA;AAAA,IAIL,OAAA,EAAU,CAAA,CAAE,OAAA,KAAY,MAAA,GAAY,yBAAyB,CAAA,CAAE,OAAA;AAAA,IAC/D,SAAA,EAAW,GAAA,CAAI,CAAA,CAAE,SAAS,CAAA;AAAA,IAC1B,QAAA,EAAU,EAAE,EAAA,EAAI,GAAA,CAAI,SAAS,EAAE,CAAA,IAAK,EAAA,EAAI,GAAI,kBAAkB,EAAE,OAAA,EAAS,eAAA,EAAgB,GAAI,EAAC;AAAG,GACnG;AACF;AAEA,SAAS,gBAAA,CACP,KACA,KAAA,EACqE;AACrE,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,SAAU,EAAC;AACjC,EAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM;AACpB,IAAA,MAAM,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA,GAAI,IAAI,EAAC;AAC1B,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAA,IAAK,EAAA;AACpC,IAAA,MAAM,QAAQ,KAAA,CAAM,CAAA,CAAE,KAAK,CAAA,GAAI,CAAA,CAAE,QAAQ,EAAC;AAC1C,IAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,CAAE,IAAI,CAAA;AACjC,IAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,MAAM,CAAA,GAAI,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,GAAI,CAAA,GAAI,EAAC,EAAG,CAAA,EAAG,QAAQ,CAAA,EAAA,EAAK,CAAA,GAAI,CAAC,CAAA,CAAE,CAAC,CAAA,GAAI,EAAC;AACtH,IAAA,OAAO;AAAA,MACL,QAAA;AAAA;AAAA;AAAA,MAGA,OAAQ,OAAO,CAAA,CAAE,KAAA,KAAU,QAAA,GAAW,EAAE,KAAA,GAAQ,QAAA;AAAA,MAChD,KAAA,EAAO,EAAE,CAAA,EAAG,GAAA,CAAI,IAAI,KAAA,CAAM,CAAC,CAAC,CAAA,EAAG,GAAG,GAAA,CAAI,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA,EAAE;AAAA,MACpD,YAAA,EAAc,cAAA,CAAe,CAAA,CAAE,YAAY,CAAA;AAAA,MAC3C,MAAA;AAAA,MACA,GAAI,IAAA,CAAK,MAAA,GAAS,IAAI,EAAE,IAAA,KAAS;AAAC,KACpC;AAAA,EACF,CAAC,CAAA;AACH;AAcO,SAAS,uBAAuB,KAAA,EAAiC;AACtE,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAK,CAAA,GAAI,QAAQ,EAAC;AAClC,EAAA,OAAO;AAAA,IACL,GAAG,mBAAmB,CAAC,CAAA;AAAA,IACvB,SAAS,gBAAA,CAAiB,CAAA,CAAE,OAAA,EAAS,CAAC,GAAG,UAAA,KAAe;AACtD,MAAA,MAAM,QAAQ,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,IAAI,CAAA,CAAE,KAAA,CAAM,GAAA,CAAI,YAAY,EAAE,MAAA,CAAO,CAAC,MAA4B,CAAA,KAAM,MAAS,IAAI,EAAC;AACzH,MAAA,OAAO,EAAE,GAAG,eAAA,CAAgB,GAAG,UAAU,CAAA,EAAG,OAAO,CAAC,GAAG,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,EAAA,GAAK,CAAA,CAAE,EAAE,CAAA,EAAE;AAAA,IAC5F,CAAC;AAAA,GACH;AACF;AAIO,SAAS,mCAAmC,KAAA,EAA2C;AAC5F,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAK,CAAA,GAAI,QAAQ,EAAC;AAClC,EAAA,OAAO;AAAA,IACL,GAAG,mBAAmB,CAAC,CAAA;AAAA,IACvB,SAAS,gBAAA,CAAiB,CAAA,CAAE,OAAA,EAAS,CAAC,GAAG,UAAA,MAAgB;AAAA,MACvD,GAAG,eAAA,CAAgB,CAAA,EAAG,UAAU,CAAA;AAAA,MAChC,QAAA,EAAU,KAAK,GAAA,CAAI,CAAA,EAAG,IAAI,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAC,CAAC;AAAA,KAC5C,CAAE,CAAA;AAAA,IACF,GAAA,EAAK,GAAA,CAAI,CAAA,CAAE,GAAG,CAAA,IAAK,EAAA;AAAA,IACnB,MAAA,EAAQ,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,IAAK,EAAA;AAAA,IACzB,KAAA,EAAO,GAAA,CAAI,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC;AAAA,GACzB;AACF;AAIO,SAAS,qBAAA,CACd,KACA,QAAA,EAC2B;AAC3B,EAAA,OAAO;AAAA,IACL,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,QAAA,EAAU,EAAE,GAAG,GAAA,CAAI,QAAA,EAAS;AAAA,IAC5B,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MAC/B,UAAU,CAAA,CAAE,QAAA;AAAA,MACZ,OAAO,CAAA,CAAE,KAAA;AAAA,MACT,KAAA,EAAO,EAAE,GAAG,CAAA,CAAE,KAAA,EAAM;AAAA,MACpB,YAAA,EAAc,EAAE,YAAA,CAAa,GAAA,CAAI,CAAC,EAAA,MAAQ,EAAE,GAAG,EAAA,EAAG,CAAE,CAAA;AAAA,MACpD,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QAC3B,IAAI,CAAA,CAAE,EAAA;AAAA,QACN,GAAI,EAAE,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,CAAA,CAAE,OAAA,EAAQ,GAAI,EAAC;AAAA,QACxD,GAAI,CAAA,CAAE,WAAA,GAAc,EAAE,WAAA,EAAa,EAAE,GAAG,CAAA,CAAE,WAAA,EAAY,EAAE,GAAI,EAAC;AAAA,QAC7D,QAAA,EAAU,EAAE,KAAA,CAAM;AAAA,OACpB,CAAE,CAAA;AAAA,MACF,GAAI,CAAA,CAAE,IAAA,IAAQ,CAAA,CAAE,KAAK,MAAA,GAAS,CAAA,GAAI,EAAE,IAAA,EAAM,CAAC,GAAG,CAAA,CAAE,IAAI,CAAA,KAAM;AAAC,KAC7D,CAAE,CAAA;AAAA,IACF,KAAK,QAAA,CAAS,GAAA;AAAA,IACd,QAAQ,QAAA,CAAS,MAAA;AAAA,IACjB,OAAO,QAAA,CAAS;AAAA,GAClB;AACF;AAUO,SAAS,gBAAgB,GAAA,EAAqC;AACnE,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,MAAM,GAAA,GAAM,CAAC,CAAA,KAAe;AAC1B,IAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,EAAG,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,EAC3C,CAAA;AACA,EAAA,KAAA,MAAW,CAAA,IAAK,OAAA,CAAQ,GAAG,CAAA,EAAG;AAC5B,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAA,GAAI,CAAA,CAAE,OAAA,GAAU,EAAC,EAAG;AACzD,MAAA,KAAA,MAAW,EAAA,IAAM,KAAA,CAAM,OAAA,CAAQ,CAAA,EAAG,QAAQ,CAAA,GAAI,CAAA,CAAE,QAAA,GAAW,EAAC,EAAG,GAAA,CAAI,EAAE,CAAA;AAAA,IACvE;AACA,IAAA,KAAA,MAAW,GAAA,IAAO,MAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,CAAA,CAAE,QAAA,GAAW,EAAC,EAAG;AAC7D,MAAA,GAAA,CAAI,KAAK,OAAO,CAAA;AAChB,MAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,CAAM,OAAA,CAAQ,GAAA,EAAK,QAAQ,KAAK,CAAA,GAAI,GAAA,CAAI,MAAA,CAAQ,KAAA,GAAS,EAAC,EAAG,GAAA,CAAI,MAAM,OAAO,CAAA;AAAA,IACnG;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,GAAG,CAAA,CAAE,IAAA,EAAK;AACvB;AAEA,SAAS,QAAQ,GAAA,EAAuD;AACtE,EAAA,IAAI,CAAC,GAAA,EAAK,OAAO,EAAC;AAClB,EAAA,MAAM,MAA0B,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,GAAI,GAAA,GAAM,CAAC,GAAG,CAAA;AAC/D,EAAA,OAAO,IAAI,MAAA,CAAO,CAAC,CAAA,KAAgB,KAAA,CAAM,CAAC,CAAC,CAAA;AAC7C;AAoBA,IAAM,UAAA,GAAa,gBAAA;AAMnB,SAAS,cAAA,CACP,GAAA,EACA,IAAA,EACA,QAAA,EACU;AACV,EAAA,MAAM,IAAc,EAAE,MAAA,EAAQ,EAAC,EAAG,QAAA,EAAU,EAAC,EAAE;AAC/C,EAAA,MAAM,EAAE,MAAA,EAAQ,QAAA,EAAS,GAAI,CAAA;AAC7B,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA;AAC/B,EAAA,MAAM,QAAA,GAAW,KAAK,iBAAA,IAAqB,mCAAA;AAE3C,EAAA,IAAI,IAAI,OAAA,KAAY,sBAAA,SAA+B,IAAA,CAAK,CAAA,gBAAA,EAAmB,sBAAsB,CAAA,CAAE,CAAA;AACnG,EAAA,IAAI,EAAE,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,IAAK,IAAI,SAAA,GAAY,CAAA,CAAA,EAAI,MAAA,CAAO,IAAA,CAAK,uCAAuC,CAAA;AAErG,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAA;AAC7B,EAAA,MAAM,UAAA,uBAAiB,GAAA,EAAuB;AAC9C,EAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,IAAA,KAAA,MAAW,CAAA,IAAK,MAAM,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAA,GAAI,CAAA,CAAE,OAAA,GAAU,EAAC,EAAG;AACzD,MAAA,IAAI,CAAA,IAAK,OAAO,CAAA,CAAE,EAAA,KAAO,YAAY,CAAC,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,EAAG,UAAA,CAAW,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA;AAAA,IACpF;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,OAAA,CAAQ,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACxB,IAAA,MAAM,MAAM,CAAA,CAAE,QAAA;AACd,IAAA,MAAM,EAAA,GAAK,WAAW,GAAG,CAAA,CAAA,CAAA;AACzB,IAAA,IAAI,CAAC,GAAA,EAAK,MAAA,CAAO,IAAA,CAAK,CAAA,OAAA,EAAU,CAAC,CAAA,oBAAA,CAAsB,CAAA;AAAA,SAAA,IAC9C,SAAA,CAAU,IAAI,GAAG,CAAA,SAAU,IAAA,CAAK,CAAA,qBAAA,EAAwB,GAAG,CAAA,CAAA,CAAG,CAAA;AACvE,IAAA,SAAA,CAAU,IAAI,GAAG,CAAA;AACjB,IAAA,IAAI,GAAA,IAAO,IAAA,CAAK,MAAA,GAAS,CAAA,EAAG;AAC1B,MAAA,MAAM,EAAA,GAAK,UAAA,CAAW,GAAA,CAAI,GAAG,CAAA;AAC7B,MAAA,IAAI,CAAC,EAAA,EAAI,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,yBAAA,CAA2B,CAAA;AAAA,WAAA,IAC5C,EAAA,CAAG,IAAA,KAAS,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,GAAG,EAAE,CAAA,0BAAA,EAA6B,EAAA,CAAG,IAAI,CAAA,6BAAA,CAA+B,CAAA;AAAA,IACpH;AACA,IAAA,IAAI,EAAE,KAAA,KAAU,QAAA,SAAiB,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,wBAAA,CAA0B,CAAA;AACrE,IAAA,IAAI,EAAE,MAAM,CAAA,CAAE,KAAK,KAAK,KAAA,CAAM,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,IAAK,KAAA,CAAM,EAAE,KAAA,CAAM,CAAC,KAAK,CAAA,CAAE,KAAA,CAAM,IAAI,CAAA,IAAK,CAAA,CAAE,KAAA,CAAM,CAAA,GAAI,CAAA,CAAA,EAAI;AAC/F,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,4BAAA,CAA8B,CAAA;AAAA,IACjD;AAEA,IAAA,MAAM,KAAA,GAAQ,GAAA,CAAsB,CAAA,CAAE,YAAY,CAAA;AAClD,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,EAAA,EAAI,CAAA,KAAM;AACvB,MAAA,MAAM,UAAmB,EAAA,EAAI,OAAA;AAC7B,MAAA,MAAM,QAAiB,EAAA,EAAI,KAAA;AAC3B,MAAA,IAAI,EAAE,MAAM,OAAO,CAAA,IAAK,MAAM,KAAK,CAAA,IAAK,QAAQ,OAAA,CAAA,EAAU;AACxD,QAAA,MAAA,CAAO,IAAA,CAAK,GAAG,EAAE,CAAA,eAAA,EAAkB,CAAC,CAAA,GAAA,EAAM,OAAO,CAAA,CAAA,EAAI,KAAK,CAAA,iBAAA,CAAmB,CAAA;AAC7E,QAAA;AAAA,MACF;AACA,MAAA,IAAI,EAAE,MAAA,CAAO,SAAA,CAAU,OAAO,CAAA,IAAK,MAAA,CAAO,UAAU,KAAK,CAAA,CAAA,SAAW,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,eAAA,EAAkB,CAAC,MAAM,OAAO,CAAA,CAAA,EAAI,KAAK,CAAA,mBAAA,CAAqB,CAAA;AAC5I,MAAA,IAAI,OAAA,GAAU,GAAG,MAAA,CAAO,IAAA,CAAK,GAAG,EAAE,CAAA,eAAA,EAAkB,CAAC,CAAA,iBAAA,CAAmB,CAAA;AACxE,MAAA,MAAM,OAAA,GAAmB,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA,EAAG,KAAA;AACvC,MAAA,IAAI,IAAI,CAAA,IAAK,KAAA,CAAM,OAAO,CAAA,IAAK,UAAU,OAAA,EAAS;AAChD,QAAA,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,wDAAA,EAA2D,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,MAClF;AAAA,IACF,CAAC,CAAA;AAED,IAAA,MAAM,OAAO,CAAA,CAAE,IAAA;AACf,IAAA,IAAI,SAAS,MAAA,EAAW;AACtB,MAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,IAAI,KAAK,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,EAAG,CAAA,KAAM,MAAA,CAAO,UAAU,CAAC,CAAA,IAAK,KAAK,CAAA,KAAM,CAAA,KAAM,KAAK,CAAA,GAAI,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,CAAE,CAAA;AACxH,MAAA,IAAI,CAAC,MAAA,EAAQ,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,wCAAA,CAA0C,CAAA;AAAA,IAC1E;AAEA,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,MAAM,MAAA,GAAS,GAAA,CAAO,CAAA,CAAE,MAAM,CAAA;AAC9B,IAAA,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACvB,MAAA,IAAI,CAAC,GAAG,EAAA,EAAI,MAAA,CAAO,KAAK,CAAA,EAAG,EAAE,CAAA,OAAA,EAAU,CAAC,CAAA,cAAA,CAAgB,CAAA;AAAA,WAAA,IAC/C,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,EAAE,CAAA,SAAU,IAAA,CAAK,CAAA,oBAAA,EAAuB,CAAA,CAAE,EAAE,CAAA,CAAA,CAAG,CAAA;AACvE,MAAA,IAAI,CAAA,EAAG,EAAA,EAAI,QAAA,CAAS,GAAA,CAAI,EAAE,EAAE,CAAA;AAC5B,MAAA,MAAM,IAAI,CAAA,EAAG,WAAA;AACb,MAAA,IAAI,CAAA,EAAG;AACL,QAAA,IAAI,EAAE,KAAA,CAAM,CAAA,CAAE,UAAU,CAAA,IAAK,EAAE,UAAA,IAAc,CAAA,IAAK,CAAA,CAAE,UAAA,IAAc,CAAA,CAAA,EAAI;AACpE,UAAA,MAAA,CAAO,KAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,CAAA,0BAAA,EAA6B,CAAA,CAAE,UAAU,CAAA,YAAA,CAAc,CAAA;AAAA,QACnF;AACA,QAAA,IAAI,CAAC,aAAA,CAAc,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG;AAChC,UAAA,QAAA,CAAS,IAAA,CAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,CAAA,+BAAA,EAAkC,CAAA,CAAE,MAAM,CAAA,UAAA,EAAa,iCAAA,CAAkC,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,QACpI;AAAA,MACF;AACA,MAAA,KAAA,IAAS,QAAA,CAAS,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAAA,IAC3B,CAAC,CAAA;AACD,IAAA,IAAI,KAAA,GAAQ,QAAA,EAAU,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,EAAE,CAAA,EAAA,EAAK,KAAK,CAAA,0BAAA,EAA6B,QAAQ,CAAA,CAAE,CAAA;AAAA,EAC1F,CAAC,CAAA;AAKD,EAAA,IAAI,IAAA,CAAK,SAAS,CAAA,EAAG;AACnB,IAAA,MAAM,KAAA,GAAQ,gBAAgB,IAAI,CAAA;AAClC,IAAA,MAAM,UAAA,GAAa,QAAQ,OAAA,CAAQ,CAAC,MAAO,KAAA,CAAM,OAAA,CAAQ,EAAE,MAAM,CAAA,GAAI,EAAE,MAAA,GAAS,EAAG,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,CAAC,CAAA,EAAG,OAAO,CAAA;AAC/G,IAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,UAAA,CAAW,SAAS,CAAA,EAAG;AAC7C,MAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,KAAK,CAAA;AAC7B,MAAA,MAAM,UAAU,CAAC,CAAA,KAAS,OAAA,CAAQ,GAAA,CAAI,EAAE,OAAQ,CAAA,IAAM,CAAC,CAAC,EAAE,WAAA,EAAa,UAAA,IAAc,QAAQ,GAAA,CAAI,CAAA,CAAE,YAAY,UAAU,CAAA;AACzH,MAAA,IAAI,CAAC,UAAA,CAAW,IAAA,CAAK,OAAO,CAAA,EAAG;AAC7B,QAAA,MAAM,MAAA,GAAS,CAAC,GAAG,IAAI,IAAI,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,OAAQ,CAAC,CAAC,EAAE,IAAA,EAAK;AACpE,QAAA,MAAA,CAAO,IAAA;AAAA,UACL,CAAA,yEAAA,EAA4E,OAAO,GAAA,CAAI,CAAC,MAAM,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,mBAAA,EAC1F,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,mEAAA;AAAA,SAC/D;AAAA,MACF,CAAA,MAAO;AACL,QAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,UAAA,IAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,QAAA,CAAS,IAAA,CAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,CAAA,YAAA,EAAe,CAAA,CAAE,OAAO,CAAA,kCAAA,CAAoC,CAAA;AAAA,QAC3G;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,CAAA;AACT;AAMA,IAAM,qBAAA,GAAwB,CAAA;AAC9B,IAAM,mBAAA,GAAsB,GAAA;AAM5B,SAAS,SAAA,CAAU,GAAoB,EAAA,EAA0B;AAC/D,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,KAAK,CAAC,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,GAAG,CAAA,EAAY;AAC7C,IAAA,MAAM,CAAA,GAAI,IAAI,CAAC,CAAA;AACf,IAAA,IAAI,CAAC,MAAM,CAAC,CAAA,IAAK,IAAI,CAAA,IAAK,CAAA,GAAI,GAAG,GAAA,CAAI,IAAA,CAAK,CAAC,CAAA,KAAA,EAAQ,CAAC,gBAAgB,CAAA,EAAG,EAAE,KAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,YAAA,CAAc,CAAC,CAAA;AAAA,EACrG;AACA,EAAA,IAAI,GAAA,CAAI,MAAA,GAAS,CAAA,EAAG,OAAO,GAAA;AAE3B,EAAA,IAAI,CAAA,CAAE,CAAA,IAAK,CAAA,IAAK,CAAA,CAAE,CAAA,IAAK,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,CAAC,yBAAA,EAA2B,CAAA,EAAG,EAAE,oBAAoB,CAAC,CAAA;AACzF,EAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,CAAC,+BAAA,EAAiC,CAAA,EAAG,EAAE,uCAAuC,CAAC,CAAA;AAClH,EAAA,IAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,GAAI,IAAA,EAAM,GAAA,CAAI,IAAA,CAAK,CAAC,gCAAA,EAAkC,CAAA,EAAG,EAAE,wCAAwC,CAAC,CAAA;AACpH,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,MAAA,IAAa,EAAE,KAAA,CAAM,EAAE,KAAK,CAAA,IAAK,CAAA,CAAE,KAAA,IAAS,CAAA,IAAK,CAAA,CAAE,SAAS,CAAA,CAAA,EAAI,GAAA,CAAI,IAAA,CAAK,CAAC,0BAAA,EAA4B,CAAA,EAAG,EAAE,CAAA,QAAA,EAAW,CAAA,CAAE,KAAK,CAAA,YAAA,CAAc,CAAC,CAAA;AAC5J,EAAA,OAAO,GAAA;AACT;AAIA,SAAS,SAAA,CAAU,MAAyB,IAAA,EAAuC;AACjF,EAAA,IAAI,KAAK,MAAA,IAAU,mBAAA,EAAqB,OAAO,CAAC,GAAG,IAAI,CAAA;AACvD,EAAA,OAAO,CAAC,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,mBAAmB,CAAA,EAAG,CAAA,EAAG,IAAA,CAAK,MAAA,GAAS,mBAAmB,CAAA,MAAA,EAAS,IAAI,CAAA,WAAA,CAAa,CAAA;AAC/G;AAGA,SAAS,OAAA,CAAQ,OAAoC,EAAA,EAAqB;AACxE,EAAA,IAAI,EAAA,GAAK,CAAA;AACT,EAAA,IAAI,EAAA,GAAK,MAAM,MAAA,GAAS,CAAA;AACxB,EAAA,OAAO,MAAM,EAAA,EAAI;AACf,IAAA,MAAM,GAAA,GAAO,KAAK,EAAA,IAAO,CAAA;AACzB,IAAA,MAAM,EAAA,GAAK,MAAM,GAAG,CAAA;AACpB,IAAA,IAAI,EAAA,GAAK,EAAA,CAAG,OAAA,EAAS,EAAA,GAAK,GAAA,GAAM,CAAA;AAAA,SAAA,IACvB,EAAA,IAAM,EAAA,CAAG,KAAA,EAAO,EAAA,GAAK,GAAA,GAAM,CAAA;AAAA,SAC/B,OAAO,IAAA;AAAA,EACd;AACA,EAAA,OAAO,KAAA;AACT;AAoBO,SAAS,qBAAA,CAAsB,GAAA,EAAsB,IAAA,GAAqC,EAAC,EAAkB;AAClH,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,GAAG,CAAA,GAAI,MAAO,EAAC;AAClC,EAAA,MAAM,CAAA,GAAI,eAAe,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA,EAAG,MAAA,EAAQ,EAAE,MAAA,EAAO,KAAM;AAC9D,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,CAAA,EAAG,KAAK,CAAA,GAAI,CAAA,CAAE,QAAQ,EAAC;AACnD,IAAA,MAAM,KAAA,GAAQ,MAAM,OAAA,CAAQ,MAAA,CAAO,YAAY,CAAA,GAAI,MAAA,CAAO,eAAe,EAAC;AAC1E,IAAA,IAAI,KAAA,GAAQ,QAAA;AACZ,IAAA,IAAI,IAAA,GAAO,CAAA,QAAA;AAEX,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,IAAA,MAAM,MAAA,GAAS,CAAC,CAAC,IAAA,EAAM,OAAO,CAAA,KAAkB;AAC9C,MAAA,MAAM,CAAA,GAAA,CAAK,IAAA,CAAK,GAAA,CAAI,IAAI,KAAK,CAAA,IAAK,CAAA;AAClC,MAAA,IAAA,CAAK,GAAA,CAAI,MAAM,CAAC,CAAA;AAChB,MAAA,IAAI,CAAA,IAAK,qBAAA,EAAuB,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA;AAAA,IACrD,CAAA;AACA,IAAA,MAAM,OAAA,GAAU,CAAA,sCAAA,EAAyC,MAAA,CAAO,QAAQ,CAAA,CAAA,CAAA;AACxE,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,MAAA,MAAM,EAAA,GAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,SAAS,CAAC,CAAA,CAAA,CAAA;AACnC,MAAA,SAAA,CAAU,CAAA,EAAG,EAAE,CAAA,CAAE,OAAA,CAAQ,MAAM,CAAA;AAC/B,MAAA,IAAI,CAAC,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,EAAG;AACjB,QAAA,MAAA,CAAO,CAAC,0BAAA,EAA4B,CAAA,EAAG,EAAE,sBAAsB,CAAC,CAAA;AAChE,QAAA;AAAA,MACF;AACA,MAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,CAAA,CAAE,EAAE,CAAA,EAAG,MAAA,CAAO,CAAC,4BAAA,EAA8B,GAAG,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,EAAE,oBAAoB,CAAC,CAAA;AACzG,MAAA,MAAM,IAAA,GAAO,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA,EAAG,EAAA;AAC3B,MAAA,IAAI,CAAA,GAAI,KAAK,KAAA,CAAM,IAAI,KAAK,EAAE,CAAA,CAAE,KAAK,IAAA,CAAA,EAAO,MAAA,CAAO,CAAC,4BAAA,EAA8B,CAAA,EAAG,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,EAAE,CAAA,gCAAA,EAAmC,IAAI,GAAG,CAAC,CAAA;AAC9I,MAAA,IAAI,CAAC,OAAA,CAAQ,KAAA,EAAO,CAAA,CAAE,EAAE,GAAG,MAAA,CAAO,CAAC,OAAA,EAAS,CAAA,EAAG,EAAE,CAAA,KAAA,EAAQ,CAAA,CAAE,EAAE,CAAA,IAAA,EAAO,OAAO,EAAE,CAAC,CAAA;AAC9E,MAAA,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,CAAA,CAAE,EAAE,CAAA;AAC5B,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,EAAE,CAAA;AAAA,IAC5B,CAAC,CAAA;AACD,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,CAAC,CAAA,IAAK,IAAA,EAAM;AAC5B,MAAA,IAAI,CAAA,GAAI,qBAAA,EAAuB,MAAA,CAAO,IAAA,CAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,CAAA,GAAA,EAAM,CAAA,GAAI,qBAAqB,CAAA,YAAA,EAAe,IAAI,CAAA,CAAE,CAAA;AAAA,IAC/G;AACA,IAAA,MAAM,OAAO,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,IAAI,IAAI,MAAA,CAAO,IAAA,GAAO,EAAC,EAAG,KAAK,CAAC,CAAA,KAAM,KAAA,GAAQ,CAAA,IAAK,KAAK,IAAI,CAAA;AAC9F,IAAA,IAAI,GAAA,KAAQ,MAAA,EAAW,MAAA,CAAO,IAAA,CAAK,CAAA,OAAA,EAAU,CAAA,CAAE,EAAE,CAAA,oBAAA,EAAuB,GAAG,CAAA,WAAA,EAAc,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,CAAG,CAAA;AAC1G,IAAA,OAAO,KAAA,CAAM,MAAA;AAAA,EACf,CAAC,CAAA;AACD,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,wBAAA;AAClC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,eAAA,IAAmB,IAAI,WAAA,EAAY,CAAE,MAAA,CAAO,IAAA,CAAK,SAAA,CAAU,IAAI,CAAC,CAAA,CAAE,MAAA;AACrF,EAAA,IAAI,KAAA,GAAQ,UAAU,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA,iBAAA,EAAoB,KAAK,CAAA,wBAAA,EAA2B,QAAQ,CAAA,CAAE,CAAA;AAClG,EAAA,OAAO,EAAE,EAAA,EAAI,CAAA,CAAE,MAAA,CAAO,MAAA,KAAW,GAAG,MAAA,EAAQ,SAAA,CAAU,CAAA,CAAE,MAAA,EAAQ,QAAQ,CAAA,EAAG,QAAA,EAAU,UAAU,CAAA,CAAE,QAAA,EAAU,UAAU,CAAA,EAAE;AACzH;AAQO,SAAS,iCAAA,CACd,CAAA,EACA,IAAA,GAA8D,EAAC,EAChD;AACf,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,GAAI,IAAK,EAAC;AAC9B,EAAA,MAAM,CAAA,GAAI,eAAe,IAAA,EAAM,IAAA,EAAM,CAAC,CAAA,EAAG,OAAA,EAAS,EAAE,MAAA,EAAO,KAAM;AAC/D,IAAA,IAAI,EAAE,OAAO,SAAA,CAAU,CAAA,EAAG,QAAQ,CAAA,IAAK,CAAA,CAAE,YAAY,CAAA,CAAA,EAAI;AACvD,MAAA,MAAA,CAAO,IAAA,CAAK,CAAA,OAAA,EAAU,CAAA,EAAG,EAAE,CAAA,0CAAA,CAA4C,CAAA;AACvE,MAAA,OAAO,CAAA;AAAA,IACT;AACA,IAAA,OAAO,CAAA,CAAE,QAAA;AAAA,EACX,CAAC,CAAA;AACD,EAAA,IAAI,EAAE,OAAO,IAAA,CAAK,GAAA,KAAQ,QAAA,IAAY,IAAA,CAAK,GAAA,CAAI,IAAA,EAAK,CAAA,EAAI,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,cAAc,CAAA;AACpF,EAAA,IAAI,EAAE,OAAO,IAAA,CAAK,MAAA,KAAW,QAAA,IAAY,UAAA,CAAW,IAAA,CAAK,IAAA,CAAK,MAAM,CAAA,CAAA,EAAI,CAAA,CAAE,MAAA,CAAO,KAAK,4CAA4C,CAAA;AAClI,EAAA,MAAM,QAAA,GAAW,KAAK,QAAA,IAAY,wBAAA;AAClC,EAAA,IAAI,EAAE,MAAA,CAAO,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA,IAAK,IAAA,CAAK,KAAA,GAAQ,CAAA,CAAA,EAAI,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,kCAAkC,CAAA;AAAA,OAAA,IAC9F,IAAA,CAAK,KAAA,GAAQ,QAAA,EAAU,CAAA,CAAE,MAAA,CAAO,IAAA,CAAK,CAAA,iBAAA,EAAoB,IAAA,CAAK,KAAK,CAAA,wBAAA,EAA2B,QAAQ,CAAA,CAAE,CAAA;AACjH,EAAA,OAAO,EAAE,EAAA,EAAI,CAAA,CAAE,MAAA,CAAO,MAAA,KAAW,GAAG,MAAA,EAAQ,SAAA,CAAU,CAAA,CAAE,MAAA,EAAQ,QAAQ,CAAA,EAAG,QAAA,EAAU,UAAU,CAAA,CAAE,QAAA,EAAU,UAAU,CAAA,EAAE;AACzH;;;ACrnBO,IAAM,mBAAA,GAAsB;AAE5B,IAAM,uBAAA,GAA0B;AAEhC,IAAM,uBAAA,GAA0B;AAEhC,IAAM,6BAAA,GAAgC;AAmB7C,IAAM,KAAA,GAAQ,CAAC,GAAA,KAA0B;AACvC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,GAAA;AACpC,EAAA,IAAI;AAAE,IAAA,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,EAAE,CAAA,CAAA,MAAQ;AAAE,IAAA,OAAO,MAAA;AAAA,EAAU;AAC1D,CAAA;AACA,IAAM,QAAA,GAAW,CAAC,CAAA,KAA6C,CAAC,CAAC,CAAA,IAAK,OAAO,CAAA,KAAM,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA;AAE/G,IAAM,YAAA,GAAe,CAAC,CAAA,KACpB,QAAA,CAAS,CAAC,CAAA,IAAK,OAAO,EAAE,MAAA,KAAW,QAAA,KAAa,EAAE,QAAA,KAAa,IAAA,IAAS,OAAO,CAAA,CAAE,QAAA,KAAa,YAAY,MAAA,CAAO,QAAA,CAAS,EAAE,QAAQ,CAAA,CAAA;AAK/H,SAAS,mBAAmB,GAAA,EAAuC;AACxE,EAAA,MAAM,CAAA,GAAI,MAAM,GAAG,CAAA;AACnB,EAAA,IAAI,CAAC,SAAS,CAAC,CAAA,IAAK,EAAE,OAAA,KAAY,mBAAA,IAAuB,CAAC,QAAA,CAAS,CAAA,CAAE,UAAU,KAAK,CAAC,QAAA,CAAS,CAAA,CAAE,UAAU,CAAA,IAAK,CAAC,MAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,EAAG,OAAO,IAAA;AAC/I,EAAA,IAAI,CAAC,MAAA,CAAO,MAAA,CAAO,CAAA,CAAE,UAAU,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAQ,GAAG,OAAO,IAAA;AAC7E,EAAA,IAAI,CAAC,OAAO,MAAA,CAAO,CAAA,CAAE,UAAU,CAAA,CAAE,KAAA,CAAM,YAAY,CAAA,EAAG,OAAO,IAAA;AAC7D,EAAA,IAAI,CAAC,CAAA,CAAE,KAAA,CAAM,KAAA,CAAM,CAAC,MAAM,OAAO,CAAA,KAAM,QAAQ,CAAA,EAAG,OAAO,IAAA;AACzD,EAAA,OAAO,CAAA;AACT;AAGA,IAAM,OAAA,GAAU,YAAA;AAYT,SAAS,mBAAA,CAAoB,QAA2B,OAAA,EAA+E;AAC5I,EAAA,IAAI,CAAC,QAAA,CAAS,OAAO,CAAA,SAAU,EAAC;AAChC,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,MAAM,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AACvD,IAAA,IAAI,CAAC,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAA,EAAG;AAC5B,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,MAAA,CAAO,OAAO,IAAI,CAAC,CAAA;AACxC,IAAA,IAAI,UAAU,MAAA,IAAa,OAAO,WAAW,QAAA,EAAU,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EACtE;AACA,EAAA,OAAO,GAAA;AACT;;;AClEO,IAAM,sBAAA,GAAyB,OAAO,MAAA,CAAO;AAAA;AAAA,EAElD,SAAA,EAAW,IAAA;AAAA;AAAA,EAEX,MAAA,EAAQ,GAAA;AAAA;AAAA,EAER,SAAA,EAAW,GAAA;AAAA;AAAA,EAEX,SAAA,EAAW,CAAA;AAAA;AAAA,EAEX,WAAA,EAAa;AACf,CAAC;AAGM,IAAM,uBAAA,GAA0B;AAEvC,IAAM,UAAA,GAAa,CAAC,GAAA,KAA0B;AAC5C,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,GAAA;AACpC,EAAA,IAAI;AAAE,IAAA,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,EAAE,CAAA,CAAA,MAAQ;AAAE,IAAA,OAAO,MAAA;AAAA,EAAU;AAC1D,CAAA;AAOO,SAAS,wBAAwB,UAAA,EAA+B;AACrE,EAAA,MAAM,MAAA,GAAS,WAAW,UAAU,CAAA;AACpC,EAAA,IAAI,CAAC,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,SAAiB,EAAC;AACnD,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,KAAA,MAAW,CAAA,IAAK,mBAAA,CAAoB,MAAM,CAAA,CAAE,KAAA,EAAO;AACjD,IAAA,IAAI,CAAA,CAAE,OAAA,IAAW,CAAC,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,OAAO,CAAA,EAAG,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,OAAO,CAAA;AAAA,EAC3D;AACA,EAAA,OAAO,CAAC,GAAG,IAAI,CAAA;AACjB;AAIO,SAAS,oBAAoB,GAAA,EAAoD;AACtF,EAAA,MAAM,OAAA,GAAW,UAAA,CAAW,GAAG,CAAA,EAAgD,OAAA;AAC/E,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,SAAU,EAAC;AACrC,EAAA,OAAO,OAAA,CACJ,OAAO,CAAC,CAAA,KAAyD,CAAC,CAAC,CAAA,IAAK,OAAQ,CAAA,CAAuB,EAAA,KAAO,QAAQ,CAAA,CACtH,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,OAAA,IAAW,CAAA,CAAE,SAAS,MAAA,IAAU,CAAA,CAAE,SAAS,QAAA,IAAY,CAAA,CAAE,SAAS,cAAc,CAAA,CACzG,IAAI,CAAC,CAAA,MAAO,EAAE,EAAA,EAAI,CAAA,CAAE,IAAI,GAAI,CAAA,CAAE,OAAO,EAAE,IAAA,EAAM,EAAE,IAAA,EAAK,GAAI,EAAC,EAAG,CAAE,CAAA;AACnE;AAIO,IAAM,oBAAA,GAAuB,OAAO,MAAA,CAAO;AAAA,EAChD,SAAA,EAAW,OAAO,MAAA,CAAO,EAAE,KAAK,GAAA,EAAK,GAAA,EAAK,KAAQ,CAAA;AAAA,EAClD,MAAA,EAAQ,OAAO,MAAA,CAAO,EAAE,KAAK,CAAA,EAAG,GAAA,EAAK,KAAO,CAAA;AAAA,EAC5C,SAAA,EAAW,OAAO,MAAA,CAAO,EAAE,KAAK,CAAA,EAAG,GAAA,EAAK,KAAS,CAAA;AAAA,EACjD,SAAA,EAAW,OAAO,MAAA,CAAO,EAAE,KAAK,CAAA,EAAG,GAAA,EAAK,IAAI;AAC9C,CAAC;AAGM,IAAM,sBAAA,GAAyB;AAK/B,SAAS,wBAAA,CAAyB,KAAiC,KAAA,EAAoC;AAC5G,EAAA,IAAI,OAAO,UAAU,QAAA,IAAY,CAAC,OAAO,QAAA,CAAS,KAAK,GAAG,OAAO,MAAA;AACjE,EAAA,MAAM,EAAE,GAAA,EAAK,GAAA,EAAI,GAAI,qBAAqB,GAAG,CAAA;AAC7C,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,EAAK,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAC,CAAA;AACvD;AAIO,SAAS,kBAAkB,GAAA,EAAsC;AACtE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,IAAY,MAAM,OAAA,CAAQ,GAAG,CAAA,EAAG,OAAO,EAAC;AACnE,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,KAAA,MAAW,CAAC,KAAA,EAAO,IAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,GAA8B,CAAA,EAAG;AAC1E,IAAA,MAAM,UAAU,OAAO,IAAA,KAAS,QAAA,GAAW,IAAA,CAAK,MAAK,GAAI,EAAA;AACzD,IAAA,IAAI,KAAA,IAAS,SAAS,GAAA,CAAI,KAAK,IAAI,OAAA,CAAQ,KAAA,CAAM,GAAG,sBAAsB,CAAA;AAAA,EAC5E;AACA,EAAA,OAAO,GAAA;AACT;AAMO,SAAS,uBAAuB,GAAA,EAA6B;AAClE,EAAA,MAAM,CAAA,GAAI,WAAW,GAAG,CAAA;AACxB,EAAA,IAAI,CAAC,KAAK,OAAO,CAAA,KAAM,YAAY,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAO,wDAAA;AAC5D,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,GAAG,OAAO,qHAAA;AACnC,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,OAAO,CAAA,IAAK,CAAC,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,EAAG,OAAO,sDAAA;AACpE,EAAA,IAAI,CAAA,CAAE,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,uCAAA;AACpC,EAAA,MAAMA,IAAAA,GAAM,CAAC,CAAA,KAAgB,OAAO,CAAA,KAAM,YAAY,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAC/E,EAAA,KAAA,MAAW,CAAC,CAAA,EAAG,GAAG,KAAM,CAAA,CAAE,QAAA,CAAuB,SAAQ,EAAG;AAC1D,IAAA,MAAM,GAAA,GAAM,GAAA;AACZ,IAAA,MAAM,IAAA,GAAOA,KAAI,GAAA,EAAK,IAAI,GAAG,KAAA,GAAQA,IAAAA,CAAI,KAAK,KAAK,CAAA;AACnD,IAAA,IAAI,IAAA,KAAS,UAAa,KAAA,KAAU,MAAA,IAAa,EAAE,KAAA,GAAQ,IAAA,CAAA,EAAO,OAAO,CAAA,uBAAA,EAA0B,CAAC,CAAA,8BAAA,CAAA;AAAA,EACtG;AACA,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,QAAA,EAAU,OAAO,kGAAA;AACjC,EAAA,OAAO,IAAA;AACT;AAQO,SAAS,iBAAA,CACd,MAAA,EACA,SAAA,EACA,QAAA,GAA6C,EAAC,EACtB;AACxB,EAAA,MAAM,MAA8B,EAAC;AACrC,EAAA,MAAA,CAAO,OAAA,CAAQ,CAAC,KAAA,EAAO,CAAA,KAAM;AAC3B,IAAA,IAAI,OAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,QAAA,EAAU,KAAK,CAAA,EAAG;AACzD,MAAA,MAAM,IAAA,GAAO,SAAS,KAAK,CAAA;AAC3B,MAAA,IAAI,OAAO,IAAA,KAAS,QAAA,EAAU,GAAA,CAAI,KAAK,CAAA,GAAI,IAAA;AAC3C,MAAA;AAAA,IACF;AACA,IAAA,IAAI,IAAI,SAAA,CAAU,MAAA,MAAY,KAAK,CAAA,GAAI,UAAU,CAAC,CAAA;AAAA,EACpD,CAAC,CAAA;AACD,EAAA,OAAO,GAAA;AACT;AA6BO,SAAS,sBAAA,CACd,IAAA,EACA,GAAA,EACA,UAAA,EACA,KAAA,EACwB;AACxB,EAAA,MAAM,MAAA,GAAS,wBAAwB,UAAU,CAAA;AACjD,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,IAAc,OAAO,IAAA,CAAK,UAAA,KAAe,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,UAAU,IACrG,MAAA,CAAO,WAAA,CAAY,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,UAAU,CAAA,CAAE,MAAA,CAAO,CAAC,GAAG,MAAM,CAAA,KAAM,OAAO,MAAA,KAAW,QAAQ,CAAC,IACrG,EAAC;AACL,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAI,kBAAA,CAAmB,KAAA,EAAO,UAAU,CAAA,EAAG,cAAc,EAAC;AAAA,IAC1D,GAAG,mBAAA,CAAoB,MAAA,EAAQ,IAAA,CAAK,iBAAiB,CAAA;AAAA,IACrD,GAAG;AAAA,GACL;AACA,EAAA,OAAO,iBAAA,CAAkB,MAAA,EAAQ,mBAAA,CAAoB,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE,CAAA,EAAG,QAAQ,CAAA;AACtF;AAEO,SAAS,2BAAA,CACd,IAAA,EACA,GAAA,EACA,UAAA,EACA,KAAA,EASA;AACA,EAAA,MAAM,GAAA,GAAsD;AAAA,IAC1D,UAAA,EAAY,sBAAA,CAAuB,IAAA,EAAM,GAAA,EAAK,YAAY,KAAK,CAAA;AAAA,IAC/D,YAAA,EAAc,iBAAA,CAAkB,IAAA,CAAK,YAAY,CAAA;AAAA,IACjD,WAAA,EAAa,KAAK,WAAA,KAAgB;AAAA,GACpC;AACA,EAAA,KAAA,MAAW,GAAA,IAAO,MAAA,CAAO,IAAA,CAAK,oBAAoB,CAAA,EAAmC;AACnF,IAAA,MAAM,CAAA,GAAI,wBAAA,CAAyB,GAAA,EAAK,IAAA,CAAK,GAAG,CAAC,CAAA;AACjD,IAAA,IAAI,CAAA,KAAM,MAAA,EAAW,GAAA,CAAI,GAAG,CAAA,GAAI,CAAA;AAAA,EAClC;AACA,EAAA,OAAO,GAAA;AACT;;;ACrLO,IAAM,eAAA,GAA2C,CAAC,SAAA,EAAW,OAAA,EAAS,YAAY,SAAS;AAC3F,IAAM,eAAA,GAA2C,CAAC,SAAA,EAAW,UAAA,EAAY,SAAS;AAIlF,IAAM,2BAA8C,CAAC,EAAA,EAAI,IAAI,EAAA,EAAI,EAAA,EAAI,KAAK,GAAG;AAE7E,IAAM,qBAAA,GAAwB;AAI9B,IAAM,4BAAA,GAA+B;AACrC,IAAM,wBAAA,GAA2B;AAIjC,SAAS,uBAAuB,KAAA,EAAoC;AACzE,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,MAAA,CAAO,SAAS,KAAK,CAAA,IAAK,KAAA,IAAS,CAAA,EAAG,OAAO,MAAA;AAC/E,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,wBAAA,EAA0B,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAC,CAAA;AAC1E;AAEO,IAAM,wBAAA,GAA2B;AAKjC,SAAS,sBAAsB,WAAA,EAAyC;AAC7E,EAAA,MAAM,IAAA,GAAO,OAAO,WAAA,KAAgB,QAAA,IAAY,OAAO,QAAA,CAAS,WAAW,CAAA,GAAI,WAAA,GAAc,qBAAA,GAAwB,EAAA;AACrH,EAAA,MAAM,IAAA,GAAO,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,IAAA,CAAK,IAAA,GAAO,EAAE,CAAC,CAAA;AAC7C,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,qBAAqB,CAAA;AACnD,EAAA,KAAA,MAAW,CAAA,IAAK,wBAAA,EAA0B,IAAI,MAAA,IAAU,GAAG,OAAO,CAAA;AAClE,EAAA,OAAO,wBAAA,CAAyB,wBAAA,CAAyB,MAAA,GAAS,CAAC,CAAA;AACrE;AAIO,SAAS,qBAAA,CAAsB,IAAA,EAAoB,IAAA,EAAoB,WAAA,EAA8B;AAC1G,EAAA,OAAO,uBAAA,CAAwB,IAAA,EAAM,IAAA,EAAM,qBAAA,CAAsB,WAAW,CAAC,CAAA;AAC/E;AAaO,SAAS,uBAAuB,WAAA,EAAyC;AAC9E,EAAA,MAAM,IAAA,GAAO,OAAO,WAAA,KAAgB,QAAA,IAAY,OAAO,QAAA,CAAS,WAAW,CAAA,GAAI,WAAA,GAAc,qBAAA,GAAwB,EAAA;AACrH,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,qBAAA,EAAuB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,IAAA,GAAO,EAAE,CAAC,CAAC,CAAA;AAC1E;AAGO,SAAS,uBAAA,CAAwB,IAAA,EAAoB,IAAA,EAAoB,OAAA,EAAyB;AACvG,EAAA,OAAO,CAAA,UAAA,EAAa,IAAI,CAAA,CAAA,EAAI,IAAI,IAAI,OAAO,CAAA,CAAA,CAAA;AAC7C;AAKO,SAAS,uBAAA,CACd,IAAA,EACA,IAAA,EACA,WAAA,EACA,SAAA,EACQ;AACR,EAAA,OAAO,SAAA,GACH,uBAAA,CAAwB,IAAA,EAAM,IAAA,EAAM,sBAAA,CAAuB,WAAW,CAAC,CAAA,GACvE,qBAAA,CAAsB,IAAA,EAAM,IAAA,EAAM,WAAW,CAAA;AACnD;AAGO,SAAS,oBAAA,CAAqB,MAAoB,IAAA,EAA4B;AACnF,EAAA,OAAO,CAAA,UAAA,EAAa,IAAI,CAAA,CAAA,EAAI,IAAI,CAAA,WAAA,CAAA;AAClC;AAGO,SAAS,oBAAA,CAAqB,MAAoB,IAAA,EAA4B;AACnF,EAAA,OAAO,CAAA,UAAA,EAAa,IAAI,CAAA,CAAA,EAAI,IAAI,CAAA,KAAA,CAAA;AAClC;AAKO,SAAS,6BACd,EAAA,EACyE;AACzE,EAAA,MAAM,CAAA,GAAI,sCAAA,CAAuC,IAAA,CAAK,EAAE,CAAA;AACxD,EAAA,IAAI,CAAC,GAAG,OAAO,MAAA;AACf,EAAA,MAAM,IAAA,GAAO,iBAAA,CAAkB,CAAA,CAAE,CAAC,CAAC,CAAA;AACnC,EAAA,MAAM,IAAA,GAAQ,gBAAsC,QAAA,CAAS,CAAA,CAAE,CAAC,CAAE,CAAA,GAAK,CAAA,CAAE,CAAC,CAAA,GAAqB,MAAA;AAC/F,EAAA,MAAM,OAAA,GAAU,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA;AAC3B,EAAA,IAAI,CAAC,IAAA,IAAQ,CAAC,IAAA,IAAQ,CAAC,MAAA,CAAO,SAAA,CAAU,OAAO,CAAA,IAAK,OAAA,GAAU,CAAA,IAAK,OAAA,GAAU,uBAAuB,OAAO,MAAA;AAC3G,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,OAAA,EAAQ;AAC/B;AAIO,SAAS,0BAAA,CAA2B,IAAA,EAAc,IAAA,EAAc,OAAA,EAAyB;AAC9F,EAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,KAAK,IAAA,GAAO,IAAA,GAAO,OAAO,CAAC,CAAA;AACrD;AAMO,SAAS,eAAe,CAAA,EAA0B;AACvD,EAAA,OAAO,iBAAA,CAAkB,CAAC,CAAA,IAAK,SAAA;AACjC;AAIO,SAAS,kBAAkB,CAAA,EAAsC;AACtE,EAAA,OAAO,OAAO,CAAA,KAAM,QAAA,IAAa,gBAAsC,QAAA,CAAS,CAAC,IAAK,CAAA,GAAqB,MAAA;AAC7G;AAGO,SAAS,eAAe,CAAA,EAA0B;AACvD,EAAA,OAAO,CAAA,KAAM,SAAA,IAAa,CAAA,KAAM,SAAA,GAAY,CAAA,GAAI,UAAA;AAClD;AAkBO,SAAS,qBAAqB,UAAA,EAA8B;AACjE,EAAA,IAAI,CAAC,UAAA,IAAc,OAAO,UAAA,KAAe,UAAU,OAAO,UAAA;AAC1D,EAAA,MAAM,CAAA,GAAI,UAAA;AAEV,EAAA,IAAI,MAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,SAAU,CAAA,CAAE,KAAA;AAErC,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,EAAG,OAAO,EAAE,OAAA,EAAS,WAAA,EAAa,QAAA,EAAU,CAAA,CAAE,QAAA,EAAS;AAEnF,EAAA,MAAM,EAAE,cAAA,EAAgB,eAAA,EAAiB,GAAG,MAAK,GAAI,CAAA;AACrD,EAAA,OAAO,IAAA;AACT","file":"chunk-FVKCNAEQ.js","sourcesContent":["/**\n * Curated subset of FFmpeg `acrossfade=curve=...` options for combine-videos\n * audio crossfades. We expose 5 well-understood presets out of the ~21 raw\n * curves FFmpeg supports; the rest are either visually indistinguishable to\n * non-audio-engineers or rarely useful in this context.\n *\n * Default `linear` matches today's behavior — adding this catalog is a pure\n * additive change for existing workflows.\n */\n\nexport interface AudioCrossfadeCurve {\n readonly id: string\n /** FFmpeg `acrossfade=curve=...` name. */\n readonly ffmpeg: string\n readonly label: string\n readonly description: string\n}\n\nexport const AUDIO_CROSSFADE_CURVES: readonly AudioCrossfadeCurve[] = [\n {\n id: \"linear\",\n ffmpeg: \"tri\",\n label: \"Linear\",\n description: \"Straight-line fade. Default; predictable but can dip in the middle for music.\",\n },\n {\n id: \"equal-power\",\n ffmpeg: \"qsin\",\n label: \"Equal Power\",\n description: \"Quarter-sine. Keeps perceived loudness roughly constant across the crossfade — best for music.\",\n },\n {\n id: \"smooth\",\n ffmpeg: \"hsin\",\n label: \"Smooth (Sine)\",\n description: \"Half-sine. Gentler than equal-power; good for dialogue and ambient.\",\n },\n {\n id: \"logarithmic\",\n ffmpeg: \"log\",\n label: \"Logarithmic\",\n description: \"Compensates for the ear's logarithmic loudness response. Long, slow tails.\",\n },\n {\n id: \"exponential\",\n ffmpeg: \"exp\",\n label: \"Exponential\",\n description: \"Sharp out / slow in (or vice versa). Punchy — good for impact moments.\",\n },\n]\n\nexport const AUDIO_CROSSFADE_CURVE_IDS: readonly string[] =\n AUDIO_CROSSFADE_CURVES.map((c) => c.id)\n\nexport const DEFAULT_AUDIO_CROSSFADE_CURVE_ID = \"linear\"\n\nconst CURVES_BY_ID: ReadonlyMap<string, AudioCrossfadeCurve> = new Map(\n AUDIO_CROSSFADE_CURVES.map((c) => [c.id, c]),\n)\n\nexport function getAudioCrossfadeCurve(id: string): AudioCrossfadeCurve | undefined {\n return CURVES_BY_ID.get(id)\n}\n\n/**\n * Resolve a curve id to its FFmpeg `acrossfade=curve=` name. Unknown ids fall\n * back to `tri` (linear) — this matches the route's Zod default so callers\n * downstream of validation never see undefined.\n */\nexport function resolveAudioCrossfadeCurve(id: string | undefined): string {\n if (!id) return \"tri\"\n return CURVES_BY_ID.get(id)?.ffmpeg ?? \"tri\"\n}\n","/**\n * Smart-cut SEARCH WINDOWS — the shared bound + clamp for the\n * `smartCutFramesPrev` / `smartCutFramesNext` of BOTH smart-cut nodes:\n * generate-video-pro (segment boundaries) and combine-videos (clip joins).\n *\n * They bound how much of each side of a boundary the engine considers when\n * it places the cut: N frames from the end of a segment and M from the start\n * of the next. Absent → the engine's own default, byte-identical to the\n * behavior before they were exposed. A boundary the engine cannot resolve\n * inside the window falls back to the fixed freeze-trims; recast pins 24/24.\n *\n * Why a shared clamp: the config panel, the canvas node (single-node Run) and\n * the orchestrator (workflow Run) are three independent writers/send paths into\n * the same route, whose Zod schema REJECTS out-of-range values (its `.min()` /\n * `.max()` are these very constants). Deriving all of them from this one\n * function means a stale, imported or hand-edited node value degrades to a\n * legal request instead of 400-ing an entire run — and the paths cannot drift\n * apart. An `<input type=\"number\" max={…}>` is not a substitute: the browser\n * does not stop a typed or pasted value from reaching React's onChange.\n */\n\n/** Widest window we accept anywhere — the UI's `max`, the clamp's ceiling and\n * `/v1/combine-videos`' own Zod `.max()` (the generate-video-pro engine route\n * itself accepts up to 48). Past this, added frames only cost search time and\n * invite a false match. */\nexport const SMART_CUT_WINDOW_MAX = 24\n/** Narrowest meaningful window — one frame each side. */\nexport const SMART_CUT_WINDOW_MIN = 1\n/** The engine's default when the field is absent. Documented here so the UI\n * can show it as the placeholder without hardcoding a second copy. */\nexport const SMART_CUT_WINDOW_DEFAULT = 8\n\n/**\n * Narrow an arbitrary node value to a legal window, or `undefined` to mean\n * \"let the engine use its default\". Non-numbers, NaN, and non-integers all\n * collapse to `undefined` rather than to a guessed number: a malformed value\n * should fall back to the proven default, not silently pick a different\n * search width than the user asked for.\n */\nexport function clampSmartCutWindow(value: unknown): number | undefined {\n if (typeof value !== \"number\" || !Number.isFinite(value)) return undefined\n const n = Math.round(value)\n if (n < SMART_CUT_WINDOW_MIN) return SMART_CUT_WINDOW_MIN\n if (n > SMART_CUT_WINDOW_MAX) return SMART_CUT_WINDOW_MAX\n return n\n}\n","import type { Edl, EdlSource, EdlValidation } from \"./edl.js\"\n\n/**\n * Speaker tracks — where each speaker's face is, over time, per camera.\n *\n * WHY THIS EXISTS\n * A face-tracking analysis node samples each camera an edit shows, finds the\n * faces, links them into tracks and labels each track with a speaker. Its\n * result feeds the framing rung `resolveEdlSegmentSlots` reserves for a\n * per-segment resolver (D20, edl-multicam.ts). This module is the wire shape\n * of that result plus the pure functions that read it: structural vocabulary\n * only — no detector, no linking or attribution rule, no framing or follow\n * math, no thresholds. That is why it lives in the Apache-licensed\n * `@nodaro/shared` (the public contract: the API response, the SDK type and\n * the MCP output). Every published version is an irrevocable grant, so every\n * later field is optional and additive.\n *\n * TWO SHAPES, ONE PROJECTION\n * - `SpeakerTrackSet` — the full set, boxes included. At a long multi-camera\n * edit it is megabytes of JSON, so it is stored as a JSON artifact (the\n * versioned box body), never inline in a job row or a node's data.\n * - `SpeakerTrackSetDescriptor` — what the node outputs: the same set with\n * every box removed (a `boxCount` per track instead) plus the artifact's\n * `url`, `sha256` and `bytes`. Consumers fetch the body by URL, check the\n * hash, run `normalizeSpeakerTracks` + `validateSpeakerTracks` on it, and\n * can confirm it is the body the descriptor names with\n * `describeSpeakerTracks(body, artifact)` deep-equal to the descriptor.\n *\n * CLOCK (D19)\n * Boxes are per SOURCE and on that source's own clock (`clock: \"source\"`), in\n * integer ms. A consumer maps to the master clock through the EDL source's\n * offset: `masterMs = ms + offsetMs` (`remapMsThroughEdl(edl, ms, sourceId)`).\n * Nothing here applies the offset, and nothing ever rescales a time (no\n * seconds→ms guessing — an implausible value is a validation error).\n *\n * GEOMETRY\n * Box coordinates are fractions 0..1 of `frame`: the display-oriented frame\n * (after rotation, square pixels) the producer sampled.\n *\n * SAMPLING\n * `sampledSpans` say what was looked at. No box for a track outside them means\n * \"not sampled\"; inside them it means \"no face there\". Spans are half-open\n * `[startMs, endMs)`, like EDL segments.\n */\n\nexport const SPEAKER_TRACKS_VERSION = 1 as const\n\n/** How a track got its speaker. Open: a newer producer may add a method, which\n * an older validator reports as a WARNING, never an issue. */\nexport const SPEAKER_TRACK_ATTRIBUTION_METHODS = [\"source-map\", \"region\", \"mouth-motion\", \"manual\"] as const\nexport type SpeakerTrackAttributionMethod = (typeof SPEAKER_TRACK_ATTRIBUTION_METHODS)[number]\nconst KNOWN_METHODS: ReadonlySet<string> = new Set(SPEAKER_TRACK_ATTRIBUTION_METHODS)\n\n/** Default hard cap on boxes per source. The longest edit the platform plans\n * for (180 minutes) sampled at 2 per second is 21,600 samples per source; the\n * cap leaves room for several faces in every sample. Override per call with\n * `maxBoxesPerSource`. */\nexport const SPEAKER_TRACKS_MAX_BOXES_PER_SOURCE = 100_000\n/** Default hard cap on the serialized size of a track set (UTF-8 bytes of its\n * JSON), so no consumer ever loads an unbounded body. Override per call with\n * `maxBytes`. */\nexport const SPEAKER_TRACKS_MAX_BYTES = 64 * 1024 * 1024\n\n/** One detection. `ms` on the source clock; x/y/w/h fractions 0..1 of the frame. */\nexport interface SpeakerTrackBox {\n readonly ms: number\n readonly x: number\n readonly y: number\n readonly w: number\n readonly h: number\n /** Detector confidence 0..1, when the detector reports one. */\n readonly score?: number\n}\n\nexport interface SpeakerTrackAttribution {\n /** Known: `SPEAKER_TRACK_ATTRIBUTION_METHODS`. */\n readonly method: SpeakerTrackAttributionMethod | (string & {})\n /** 0..1. */\n readonly confidence: number\n /** The transcript's own label for this speaker, kept beside the display name\n * in `speaker` so a later rename re-maps instead of orphaning the track. */\n readonly rawSpeaker?: string\n}\n\n/** What a track says about itself, without its boxes. */\nexport interface SpeakerTrackHeader {\n /** Unique in the whole set, e.g. \"wide/t3\". */\n readonly id: string\n /** A label in the edit's speaker space. Absent = unattributed. */\n readonly speaker?: string\n readonly attribution?: SpeakerTrackAttribution\n}\n\nexport interface SpeakerTrack extends SpeakerTrackHeader {\n /** Strictly increasing `ms`, each inside one of the source's `sampledSpans`. */\n readonly boxes: readonly SpeakerTrackBox[]\n}\n\nexport interface SpeakerTrackSummary extends SpeakerTrackHeader {\n readonly boxCount: number\n}\n\nexport interface SpeakerTrackSpan {\n readonly startMs: number\n /** Exclusive, > startMs. */\n readonly endMs: number\n}\n\ninterface SpeakerTrackSourceFields {\n /** `EdlSource.id` of a video source. */\n readonly sourceId: string\n /** Boxes, spans and cuts are ms on this SOURCE's own clock (D19). */\n readonly clock: \"source\"\n /** The display-oriented frame (after rotation, square pixels), in pixels, that box fractions refer to. */\n readonly frame: { readonly w: number; readonly h: number }\n /** What was sampled: sorted, non-overlapping, half-open. */\n readonly sampledSpans: readonly SpeakerTrackSpan[]\n /** Source-clock ms of detected scene changes, ascending. No track spans one. */\n readonly cuts?: readonly number[]\n}\n\nexport interface SpeakerTrackSource extends SpeakerTrackSourceFields {\n readonly tracks: readonly SpeakerTrack[]\n}\n\nexport interface SpeakerTrackSourceSummary extends SpeakerTrackSourceFields {\n readonly tracks: readonly SpeakerTrackSummary[]\n}\n\ninterface SpeakerTrackSetFields {\n readonly version: 1\n /** Samples per second the producer looked at. */\n readonly sampleFps: number\n /** Informational: which detector produced the boxes, e.g. \"example:face-detector\". */\n readonly detector: { readonly id: string; readonly version?: string }\n}\n\n/** The full set — the versioned box body, stored as a JSON artifact. */\nexport interface SpeakerTrackSet extends SpeakerTrackSetFields {\n readonly sources: readonly SpeakerTrackSource[]\n}\n\n/** What the analysis node outputs: the set without its boxes, plus where the body is. */\nexport interface SpeakerTrackSetDescriptor extends SpeakerTrackSetFields {\n readonly sources: readonly SpeakerTrackSourceSummary[]\n /** Where the `SpeakerTrackSet` body is stored. */\n readonly url: string\n /** SHA-256 of the stored body's bytes, 64 lowercase hex characters. */\n readonly sha256: string\n /** Size of the stored body in bytes. */\n readonly bytes: number\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// Normalization (coerce, never reject — and never reinterpret)\n// ─────────────────────────────────────────────────────────────────────────\n\nconst isObj = (v: unknown): v is Record<string, unknown> => !!v && typeof v === \"object\" && !Array.isArray(v)\nconst isNum = (v: unknown): v is number => typeof v === \"number\" && Number.isFinite(v)\nconst num = (v: unknown, fallback = 0): number => (isNum(v) ? v : fallback)\nconst str = (v: unknown): string | undefined => (typeof v === \"string\" ? v : undefined)\nconst clamp01 = (v: number): number => Math.min(1, Math.max(0, v))\n/** A readonly array field of a value that may have skipped normalization. */\nconst arr = <T,>(v: readonly T[] | undefined): readonly T[] => (Array.isArray(v) ? v : [])\n/** Integer ms; never -0 (JSON cannot carry it, so a round trip would differ). */\nconst int = (v: number): number => {\n const r = Math.round(v)\n return r === 0 ? 0 : r\n}\n\n/** One axis of a detection, cropped to the frame: the visible part of\n * `[p, p+s]` within `[0, 1]`, or undefined when none of it is visible. An\n * in-frame axis is returned untouched (so a second pass cannot drift by a\n * float ulp); an overhanging one becomes the intersection, whichever edge it\n * crosses, so its centre only ever moves toward the visible part. */\nfunction cropAxis(p: number, s: number): readonly [number, number] | undefined {\n if (!(s > 0)) return undefined\n if (p >= 0 && p + s <= 1) return [p, s]\n const lo = clamp01(p)\n const hi = clamp01(p + s)\n return hi > lo ? [lo, hi - lo] : undefined\n}\n\nfunction normalizeBox(raw: unknown): SpeakerTrackBox | undefined {\n if (!isObj(raw)) return undefined\n if (![raw.ms, raw.x, raw.y, raw.w, raw.h].every(isNum)) return undefined\n // A detection is cropped to the frame, never moved: a face at the frame edge\n // keeps only its visible part, and one entirely off-frame is dropped. This is\n // deliberately NOT `normalizeRegion`'s clamp-then-shrink (edl.ts), which is\n // fine for a region a user draws but would shift a left/top overhang and turn\n // an off-frame detection into an in-frame face.\n const xs = cropAxis(raw.x as number, raw.w as number)\n const ys = cropAxis(raw.y as number, raw.h as number)\n if (!xs || !ys) return undefined\n const [x, w] = xs\n const [y, h] = ys\n return { ms: int(raw.ms as number), x, y, w, h, ...(isNum(raw.score) ? { score: clamp01(raw.score) } : {}) }\n}\n\nfunction normalizeSpans(raw: unknown): SpeakerTrackSpan[] {\n if (!Array.isArray(raw)) return []\n const spans = raw\n .filter(isObj)\n .filter((s) => isNum(s.startMs) && isNum(s.endMs))\n .map((s) => ({ startMs: int(s.startMs as number), endMs: int(s.endMs as number) }))\n .filter((s) => s.endMs > s.startMs)\n .sort((a, b) => a.startMs - b.startMs || a.endMs - b.endMs)\n const merged: SpeakerTrackSpan[] = []\n for (const s of spans) {\n const last = merged[merged.length - 1]\n if (last && s.startMs <= last.endMs) merged[merged.length - 1] = { startMs: last.startMs, endMs: Math.max(last.endMs, s.endMs) }\n else merged.push(s)\n }\n return merged\n}\n\nfunction normalizeCuts(raw: unknown): number[] {\n if (!Array.isArray(raw)) return []\n const sorted = raw.filter(isNum).map(int).sort((a, b) => a - b)\n return sorted.filter((c, i) => i === 0 || c !== sorted[i - 1])\n}\n\nfunction normalizeAttribution(raw: unknown): SpeakerTrackAttribution | undefined {\n if (!isObj(raw)) return undefined\n const method = str(raw.method)\n if (!method) return undefined\n const rawSpeaker = str(raw.rawSpeaker)\n return { method, confidence: clamp01(num(raw.confidence)), ...(rawSpeaker ? { rawSpeaker } : {}) }\n}\n\nfunction normalizeHeader(raw: Record<string, unknown>, fallbackId: string): SpeakerTrackHeader {\n const speaker = str(raw.speaker)\n const attribution = normalizeAttribution(raw.attribution)\n return {\n id: str(raw.id) || fallbackId,\n ...(speaker ? { speaker } : {}),\n ...(attribution ? { attribution } : {}),\n }\n}\n\nfunction normalizeSetFields(o: Record<string, unknown>): SpeakerTrackSetFields {\n const detector = isObj(o.detector) ? o.detector : {}\n const detectorVersion = str(detector.version)\n return {\n // Only an ABSENT version defaults to 1. Any present value — another\n // number, \"2\", null — is kept as is so validate refuses it rather than\n // reading a newer (or broken) body as this one.\n version: (o.version === undefined ? SPEAKER_TRACKS_VERSION : o.version) as 1,\n sampleFps: num(o.sampleFps),\n detector: { id: str(detector.id) ?? \"\", ...(detectorVersion ? { version: detectorVersion } : {}) },\n }\n}\n\nfunction normalizeSources<T>(\n raw: unknown,\n track: (t: Record<string, unknown>, fallbackId: string) => T,\n): Array<SpeakerTrackSourceFields & { readonly tracks: readonly T[] }> {\n if (!Array.isArray(raw)) return []\n return raw.map((r) => {\n const s = isObj(r) ? r : {}\n const sourceId = str(s.sourceId) ?? \"\"\n const frame = isObj(s.frame) ? s.frame : {}\n const cuts = normalizeCuts(s.cuts)\n const tracks = Array.isArray(s.tracks) ? s.tracks.map((t, k) => track(isObj(t) ? t : {}, `${sourceId}/t${k + 1}`)) : []\n return {\n sourceId,\n // A clock other than \"source\" cannot be repaired: boxes on another clock\n // would land offsetMs away from their frame. Keep it for validate to refuse.\n clock: (typeof s.clock === \"string\" ? s.clock : \"source\") as \"source\",\n frame: { w: int(num(frame.w)), h: int(num(frame.h)) },\n sampledSpans: normalizeSpans(s.sampledSpans),\n tracks,\n ...(cuts.length > 0 ? { cuts } : {}),\n }\n })\n}\n\n/**\n * Coerce an unknown value into a well-formed `SpeakerTrackSet` (the box body):\n * drop unknown keys and malformed boxes, crop every box to the frame (an\n * entirely off-frame box is dropped, an overhang keeps its visible part), clamp\n * scores and confidences to 0..1, round every time to integer ms, sort each\n * track's boxes by time (box order IS time, unlike EDL segment order), sort and\n * merge sampled spans, sort and de-duplicate cuts.\n *\n * It never repairs what would change meaning: a box outside every sampled\n * span, two boxes at one instant, a track across a cut, another version or\n * another clock all survive for `validateSpeakerTracks` to report.\n */\nexport function normalizeSpeakerTracks(input: unknown): SpeakerTrackSet {\n const o = isObj(input) ? input : {}\n return {\n ...normalizeSetFields(o),\n sources: normalizeSources(o.sources, (t, fallbackId) => {\n const boxes = Array.isArray(t.boxes) ? t.boxes.map(normalizeBox).filter((b): b is SpeakerTrackBox => b !== undefined) : []\n return { ...normalizeHeader(t, fallbackId), boxes: [...boxes].sort((a, b) => a.ms - b.ms) }\n }),\n }\n}\n\n/** Coerce an unknown value into a `SpeakerTrackSetDescriptor`, by the same rules\n * as `normalizeSpeakerTracks`; a missing or broken `boxCount` becomes 0. */\nexport function normalizeSpeakerTrackSetDescriptor(input: unknown): SpeakerTrackSetDescriptor {\n const o = isObj(input) ? input : {}\n return {\n ...normalizeSetFields(o),\n sources: normalizeSources(o.sources, (t, fallbackId) => ({\n ...normalizeHeader(t, fallbackId),\n boxCount: Math.max(0, int(num(t.boxCount))),\n })),\n url: str(o.url) ?? \"\",\n sha256: str(o.sha256) ?? \"\",\n bytes: int(num(o.bytes)),\n }\n}\n\n/** The descriptor of a (normalized) set stored at `artifact.url`: every box\n * removed, a `boxCount` per track. Pure; the caller hashes and stores the body. */\nexport function describeSpeakerTracks(\n set: SpeakerTrackSet,\n artifact: { readonly url: string; readonly sha256: string; readonly bytes: number },\n): SpeakerTrackSetDescriptor {\n return {\n version: set.version,\n sampleFps: set.sampleFps,\n detector: { ...set.detector },\n sources: set.sources.map((s) => ({\n sourceId: s.sourceId,\n clock: s.clock,\n frame: { ...s.frame },\n sampledSpans: s.sampledSpans.map((sp) => ({ ...sp })),\n tracks: s.tracks.map((t) => ({\n id: t.id,\n ...(t.speaker !== undefined ? { speaker: t.speaker } : {}),\n ...(t.attribution ? { attribution: { ...t.attribution } } : {}),\n boxCount: t.boxes.length,\n })),\n ...(s.cuts && s.cuts.length > 0 ? { cuts: [...s.cuts] } : {}),\n })),\n url: artifact.url,\n sha256: artifact.sha256,\n bytes: artifact.bytes,\n }\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// The edit's speaker space\n// ─────────────────────────────────────────────────────────────────────────\n\n/** The speaker labels an edit uses: the union of `sources[].speakers`,\n * `segments[].speaker` and `segments[].layout.slots[].speaker`, over every EDL\n * given (a clip pack), sorted by code unit. Tracks must be labelled in this\n * space, or no track ever matches a segment's speaker. */\nexport function edlSpeakerSpace(edl: Edl | readonly Edl[]): string[] {\n const out = new Set<string>()\n const add = (v: unknown) => {\n if (typeof v === \"string\" && v) out.add(v)\n }\n for (const e of edlList(edl)) {\n for (const s of Array.isArray(e.sources) ? e.sources : []) {\n for (const sp of Array.isArray(s?.speakers) ? s.speakers : []) add(sp)\n }\n for (const seg of Array.isArray(e.segments) ? e.segments : []) {\n add(seg?.speaker)\n for (const slot of Array.isArray(seg?.layout?.slots) ? seg.layout!.slots! : []) add(slot?.speaker)\n }\n }\n return [...out].sort()\n}\n\nfunction edlList(edl: Edl | readonly Edl[] | undefined): readonly Edl[] {\n if (!edl) return []\n const all: readonly unknown[] = Array.isArray(edl) ? edl : [edl]\n return all.filter((e): e is Edl => isObj(e))\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// Validation\n// ─────────────────────────────────────────────────────────────────────────\n\nexport interface SpeakerTracksValidateOptions {\n /** The edit the tracks are for — one EDL, or every clip of a pack. When given,\n * every source must resolve to one of its video sources, and attributed\n * speakers must be in its speaker space (`edlSpeakerSpace`). */\n readonly edl?: Edl | readonly Edl[]\n /** Default `SPEAKER_TRACKS_MAX_BOXES_PER_SOURCE`. */\n readonly maxBoxesPerSource?: number\n /** Default `SPEAKER_TRACKS_MAX_BYTES`. */\n readonly maxBytes?: number\n /** `validateSpeakerTracks` only: the body's known size in bytes (e.g. the\n * fetched length), so a large body is not serialized again to measure it. */\n readonly serializedBytes?: number\n}\n\nconst SHA256_HEX = /^[0-9a-f]{64}$/\n\ntype Findings = { issues: string[]; warnings: string[] }\n\n/** The rules shared by the body and the descriptor. `perTrack` adds the body's\n * box rules and returns the track's box count. */\nfunction validateCommon<T extends SpeakerTrackHeader>(\n set: SpeakerTrackSetFields & { readonly sources: ReadonlyArray<SpeakerTrackSourceFields & { readonly tracks: readonly T[] }> },\n opts: SpeakerTracksValidateOptions,\n perTrack: (track: T, source: SpeakerTrackSourceFields, f: Findings) => number,\n): Findings {\n const f: Findings = { issues: [], warnings: [] }\n const { issues, warnings } = f\n const sources = arr(set.sources)\n const maxBoxes = opts.maxBoxesPerSource ?? SPEAKER_TRACKS_MAX_BOXES_PER_SOURCE\n\n if (set.version !== SPEAKER_TRACKS_VERSION) issues.push(`version must be ${SPEAKER_TRACKS_VERSION}`)\n if (!(isNum(set.sampleFps) && set.sampleFps > 0)) issues.push(\"sampleFps must be a finite number > 0\")\n\n const edls = edlList(opts.edl)\n const edlSources = new Map<string, EdlSource>()\n for (const e of edls) {\n for (const s of Array.isArray(e.sources) ? e.sources : []) {\n if (s && typeof s.id === \"string\" && !edlSources.has(s.id)) edlSources.set(s.id, s)\n }\n }\n\n const sourceIds = new Set<string>()\n const trackIds = new Set<string>()\n sources.forEach((s, i) => {\n const sid = s.sourceId\n const at = `source \"${sid}\"`\n if (!sid) issues.push(`source[${i}]: sourceId is empty`)\n else if (sourceIds.has(sid)) issues.push(`duplicate source id \"${sid}\"`)\n sourceIds.add(sid)\n if (sid && edls.length > 0) {\n const es = edlSources.get(sid)\n if (!es) issues.push(`${at}: not a source of the EDL`)\n else if (es.kind !== \"video\") issues.push(`${at}: the EDL source is kind:\"${es.kind}\", tracks need a video source`)\n }\n if (s.clock !== \"source\") issues.push(`${at}: clock must be \"source\"`)\n if (!(isObj(s.frame) && isNum(s.frame.w) && isNum(s.frame.h) && s.frame.w > 0 && s.frame.h > 0)) {\n issues.push(`${at}: frame w/h must be positive`)\n }\n\n const spans = arr<SpeakerTrackSpan>(s.sampledSpans)\n spans.forEach((sp, j) => {\n const startMs: unknown = sp?.startMs\n const endMs: unknown = sp?.endMs\n if (!(isNum(startMs) && isNum(endMs) && endMs > startMs)) {\n issues.push(`${at}: sampledSpans[${j}] [${startMs},${endMs}) is not positive`)\n return\n }\n if (!(Number.isInteger(startMs) && Number.isInteger(endMs))) issues.push(`${at}: sampledSpans[${j}] [${startMs},${endMs}) is not integer ms`)\n if (startMs < 0) issues.push(`${at}: sampledSpans[${j}] starts before 0`)\n const prevEnd: unknown = spans[j - 1]?.endMs\n if (j > 0 && isNum(prevEnd) && startMs < prevEnd) {\n issues.push(`${at}: sampledSpans must be sorted and non-overlapping (span ${j})`)\n }\n })\n\n const cuts = s.cuts\n if (cuts !== undefined) {\n const okCuts = Array.isArray(cuts) && cuts.every((c, k) => Number.isInteger(c) && c >= 0 && (k === 0 || c > cuts[k - 1]))\n if (!okCuts) issues.push(`${at}: cuts must be ascending non-negative ms`)\n }\n\n let boxes = 0\n const tracks = arr<T>(s.tracks)\n tracks.forEach((t, k) => {\n if (!t?.id) issues.push(`${at} track[${k}]: id is empty`)\n else if (trackIds.has(t.id)) issues.push(`duplicate track id \"${t.id}\"`)\n if (t?.id) trackIds.add(t.id)\n const a = t?.attribution\n if (a) {\n if (!(isNum(a.confidence) && a.confidence >= 0 && a.confidence <= 1)) {\n issues.push(`track \"${t.id}\": attribution.confidence=${a.confidence} out of 0..1`)\n }\n if (!KNOWN_METHODS.has(a.method)) {\n warnings.push(`track \"${t.id}\": unknown attribution method \"${a.method}\" (known: ${SPEAKER_TRACK_ATTRIBUTION_METHODS.join(\", \")})`)\n }\n }\n boxes += perTrack(t, s, f)\n })\n if (boxes > maxBoxes) issues.push(`${at}: ${boxes} boxes is over the cap of ${maxBoxes}`)\n })\n\n // The speaker name space: labels from the raw transcript against an edit\n // that uses display names (or the reverse) match nothing, and every slot\n // would silently fall back to static framing.\n if (edls.length > 0) {\n const space = edlSpeakerSpace(edls)\n const attributed = sources.flatMap((s) => (Array.isArray(s.tracks) ? s.tracks : [])).filter((t) => !!t?.speaker)\n if (space.length > 0 && attributed.length > 0) {\n const inSpace = new Set(space)\n const matches = (t: T) => inSpace.has(t.speaker!) || (!!t.attribution?.rawSpeaker && inSpace.has(t.attribution.rawSpeaker))\n if (!attributed.some(matches)) {\n const labels = [...new Set(attributed.map((t) => t.speaker!))].sort()\n issues.push(\n `no tracked speaker is in the edit's speaker set: the tracks are labelled ${labels.map((l) => `\"${l}\"`).join(\", \")}` +\n ` and the edit uses ${space.map((l) => `\"${l}\"`).join(\", \")} — wire Speaker Frames to the same transcript as Camera Switch`,\n )\n } else {\n for (const t of attributed) {\n if (!matches(t)) warnings.push(`track \"${t.id}\": speaker \"${t.speaker}\" is not in the edit's speaker set`)\n }\n }\n }\n }\n return f\n}\n\n/** Per-box findings listed per track and rule before the rest are summarized\n * in one line, and the most issues a validation lists before one truncation\n * line. A systematic producer bug (a clock off by `offsetMs`, say) puts EVERY\n * box out of span; the refusal must stay readable wherever it is shown. */\nconst BOX_FINDINGS_PER_RULE = 5\nconst MAX_LISTED_FINDINGS = 100\n\n/** A per-box finding: the rule (what the per-track summary line counts, as\n * \"N more boxes <rule>\") and the message for one box. */\ntype BoxFinding = readonly [rule: string, message: string]\n\nfunction boxIssues(b: SpeakerTrackBox, at: string): BoxFinding[] {\n const out: BoxFinding[] = []\n for (const k of [\"x\", \"y\", \"w\", \"h\"] as const) {\n const v = b?.[k]\n if (!isNum(v) || v < 0 || v > 1) out.push([`with ${k} out of 0..1`, `${at}: ${k}=${v} out of 0..1`])\n }\n if (out.length > 0) return out\n // The same edge tolerance as validateEdl's regions, so the two never disagree.\n if (b.w <= 0 || b.h <= 0) out.push([\"with a non-positive w/h\", `${at}: non-positive w/h`])\n if (b.x + b.w > 1 + 1e-9) out.push([\"extending past the right edge\", `${at}: extends past the right edge (x+w>1)`])\n if (b.y + b.h > 1 + 1e-9) out.push([\"extending past the bottom edge\", `${at}: extends past the bottom edge (y+h>1)`])\n if (b.score !== undefined && !(isNum(b.score) && b.score >= 0 && b.score <= 1)) out.push([\"with a score out of 0..1\", `${at}: score=${b.score} out of 0..1`])\n return out\n}\n\n/** Cap a findings list at `MAX_LISTED_FINDINGS`, ending in one line that counts\n * the rest. Never empties a non-empty list, so `ok` is unchanged. */\nfunction capListed(list: readonly string[], noun: \"issues\" | \"warnings\"): string[] {\n if (list.length <= MAX_LISTED_FINDINGS) return [...list]\n return [...list.slice(0, MAX_LISTED_FINDINGS), `${list.length - MAX_LISTED_FINDINGS} more ${noun} not listed`]\n}\n\n/** Is `ms` inside one of `spans` (sorted, half-open)? Binary search. */\nfunction inSpans(spans: readonly SpeakerTrackSpan[], ms: number): boolean {\n let lo = 0\n let hi = spans.length - 1\n while (lo <= hi) {\n const mid = (lo + hi) >> 1\n const sp = spans[mid]\n if (ms < sp.startMs) hi = mid - 1\n else if (ms >= sp.endMs) lo = mid + 1\n else return true\n }\n return false\n}\n\n/**\n * Structural validation of a track set (the box body). Normalization is\n * `normalizeSpeakerTracks`'s job; this reports what is still wrong after it.\n * Issues are facts intrinsic to the set (or to the set against the EDL);\n * warnings are judgements an older validator must not turn into a refusal\n * (an unknown attribution method, one stray speaker label).\n *\n * Rules: version; a positive sample rate; unique source ids that resolve to\n * the EDL's video sources; the source clock; a positive frame; sorted,\n * non-overlapping, positive, integer-ms spans; ascending integer cuts; unique\n * track ids; every box in-frame, at an integer ms, strictly after the previous\n * one and inside a sampled span; no track across a cut; the speaker name\n * space; the box and byte caps.\n *\n * The listing is bounded: per track, the first few boxes breaking each rule\n * are listed and the rest counted in one line; past a fixed total, one line\n * counts the issues (or warnings) not listed. `ok` counts every finding.\n */\nexport function validateSpeakerTracks(set: SpeakerTrackSet, opts: SpeakerTracksValidateOptions = {}): EdlValidation {\n const safe = isObj(set) ? set : ({} as SpeakerTrackSet)\n const f = validateCommon(safe, opts, (t, source, { issues }) => {\n const boxes = Array.isArray(t?.boxes) ? t.boxes : []\n const spans = Array.isArray(source.sampledSpans) ? source.sampledSpans : []\n let first = Infinity\n let last = -Infinity\n // The first few findings of each rule are listed; the rest are counted.\n const seen = new Map<string, number>()\n const report = ([rule, message]: BoxFinding) => {\n const n = (seen.get(rule) ?? 0) + 1\n seen.set(rule, n)\n if (n <= BOX_FINDINGS_PER_RULE) issues.push(message)\n }\n const outside = `outside every sampled span of source \"${source.sourceId}\"`\n boxes.forEach((b, j) => {\n const at = `track \"${t.id}\" box[${j}]`\n boxIssues(b, at).forEach(report)\n if (!isNum(b?.ms)) {\n report([\"whose ms is not a number\", `${at}: ms is not a number`])\n return\n }\n if (!Number.isInteger(b.ms)) report([\"whose ms is not an integer\", `${at}: ms ${b.ms} is not an integer`])\n const prev = boxes[j - 1]?.ms\n if (j > 0 && isNum(prev) && !(b.ms > prev)) report([\"not after the previous box\", `${at}: ms ${b.ms} is not after the previous box (${prev})`])\n if (!inSpans(spans, b.ms)) report([outside, `${at}: ms ${b.ms} is ${outside}`])\n first = Math.min(first, b.ms)\n last = Math.max(last, b.ms)\n })\n for (const [rule, n] of seen) {\n if (n > BOX_FINDINGS_PER_RULE) issues.push(`track \"${t.id}\": ${n - BOX_FINDINGS_PER_RULE} more boxes ${rule}`)\n }\n const cut = (Array.isArray(source.cuts) ? source.cuts : []).find((c) => first < c && c <= last)\n if (cut !== undefined) issues.push(`track \"${t.id}\": spans the cut at ${cut} ms (boxes ${first}..${last})`)\n return boxes.length\n })\n const maxBytes = opts.maxBytes ?? SPEAKER_TRACKS_MAX_BYTES\n const bytes = opts.serializedBytes ?? new TextEncoder().encode(JSON.stringify(safe)).length\n if (bytes > maxBytes) f.issues.push(`the track set is ${bytes} bytes, over the cap of ${maxBytes}`)\n return { ok: f.issues.length === 0, issues: capListed(f.issues, \"issues\"), warnings: capListed(f.warnings, \"warnings\") }\n}\n\n/**\n * Structural validation of a descriptor (the node's output): the same rules as\n * `validateSpeakerTracks` minus the per-box ones (it has no boxes; `boxCount`\n * feeds the per-source cap), plus a non-empty `url`, a well-formed `sha256`\n * and a positive `bytes` within the byte cap.\n */\nexport function validateSpeakerTrackSetDescriptor(\n d: SpeakerTrackSetDescriptor,\n opts: Omit<SpeakerTracksValidateOptions, \"serializedBytes\"> = {},\n): EdlValidation {\n const safe = isObj(d) ? d : ({} as SpeakerTrackSetDescriptor)\n const f = validateCommon(safe, opts, (t, _source, { issues }) => {\n if (!(Number.isInteger(t?.boxCount) && t.boxCount >= 0)) {\n issues.push(`track \"${t?.id}\": boxCount must be a non-negative integer`)\n return 0\n }\n return t.boxCount\n })\n if (!(typeof safe.url === \"string\" && safe.url.trim())) f.issues.push(\"url is empty\")\n if (!(typeof safe.sha256 === \"string\" && SHA256_HEX.test(safe.sha256))) f.issues.push(\"sha256 must be 64 lowercase hex characters\")\n const maxBytes = opts.maxBytes ?? SPEAKER_TRACKS_MAX_BYTES\n if (!(Number.isInteger(safe.bytes) && safe.bytes > 0)) f.issues.push(\"bytes must be a positive integer\")\n else if (safe.bytes > maxBytes) f.issues.push(`the track set is ${safe.bytes} bytes, over the cap of ${maxBytes}`)\n return { ok: f.issues.length === 0, issues: capListed(f.issues, \"issues\"), warnings: capListed(f.warnings, \"warnings\") }\n}\n","/**\n * speaker-map (podcast use-case nodes, decided 2026-10-12/17) — which camera\n * each speaker is on, worked out from the cameras' own microphones: the\n * structural pieces every caller shares (the canvas engines, MCP, the SDK).\n * HOW the levels are compared is the server's. Pure, no I/O.\n */\nimport type { Edl } from \"./edl.js\"\n\nexport const SPEAKER_MAP_VERSION = 1 as const\n/** Recordings one run reads (cameras, plus the master when it also emits the edit). */\nexport const SPEAKER_MAP_MAX_SOURCES = 6\n/** Candidate cameras a comparison needs. */\nexport const SPEAKER_MAP_MIN_CAMERAS = 2\n/** How far the loudest camera must beat the next for the speaker to get it. */\nexport const SPEAKER_MAP_DEFAULT_MARGIN_DB = 3\n\nexport interface SpeakerMapConfidence {\n /** The camera the speaker got; \"\" = none clear (shown on the wide shot). */\n readonly camera: string\n /** The loudest camera's lead over the next, in dB; null when there was nothing to compare. */\n readonly marginDb: number | null\n}\n\nexport interface SpeakerMapResult {\n readonly version: typeof SPEAKER_MAP_VERSION\n /** Transcript speaker label → camera source id; \"\" = no camera of their own. Feeds Camera Switch's `speakerMap`. */\n readonly speakerMap: Readonly<Record<string, string>>\n readonly confidence: Readonly<Record<string, SpeakerMapConfidence>>\n readonly notes: readonly string[]\n /** The recordings as one edit on the master clock (offsets applied, roles and speakers set, one segment). */\n readonly edl?: Edl\n}\n\nconst parse = (raw: unknown): unknown => {\n if (typeof raw !== \"string\") return raw\n try { return JSON.parse(raw) } catch { return undefined }\n}\nconst isRecord = (v: unknown): v is Record<string, unknown> => !!v && typeof v === \"object\" && !Array.isArray(v)\n\nconst isConfidence = (v: unknown): boolean =>\n isRecord(v) && typeof v.camera === \"string\" && (v.marginDb === null || (typeof v.marginDb === \"number\" && Number.isFinite(v.marginDb)))\n\n/** A Speaker Map result (an object or its JSON string), or null when it is not\n * one: every map value and confidence camera a string, every margin a finite\n * number or null, every note a string — so a reader can trust each field. */\nexport function speakerMapResultOf(raw: unknown): SpeakerMapResult | null {\n const v = parse(raw)\n if (!isRecord(v) || v.version !== SPEAKER_MAP_VERSION || !isRecord(v.speakerMap) || !isRecord(v.confidence) || !Array.isArray(v.notes)) return null\n if (!Object.values(v.speakerMap).every((c) => typeof c === \"string\")) return null\n if (!Object.values(v.confidence).every(isConfidence)) return null\n if (!v.notes.every((n) => typeof n === \"string\")) return null\n return v as unknown as SpeakerMapResult\n}\n\n/** An ordinal key: a whole number from 1, written plainly (\"1\", \"12\" — never \" 1\", \"01\", \"1.0\", \"1e0\"). */\nconst ORDINAL = /^[1-9]\\d*$/\n\n/**\n * The override keyed by ordinal (\"1\" = the first voice heard) as a map keyed\n * by the transcript's own labels. `labels` is the transcript's speakers in\n * first-heard order — the caller passes `transcriptSpeakerLabels(transcript)`,\n * so this module imports nothing from camera-switch-contract (one import\n * direction: camera-switch-contract → speaker-map-contract, no cycle for the\n * structure ratchet). An ordinal past the transcript's speakers maps nobody,\n * and so do a key that is not a plain ordinal and an override that is not an\n * object (a hand-written workflow).\n */\nexport function speakerMapByOrdinal(labels: readonly string[], byOrder: Readonly<Record<string, string>> | undefined): Record<string, string> {\n if (!isRecord(byOrder)) return {}\n const out: Record<string, string> = {}\n for (const [ordinal, camera] of Object.entries(byOrder)) {\n if (!ORDINAL.test(ordinal)) continue\n const label = labels[Number(ordinal) - 1]\n if (label !== undefined && typeof camera === \"string\") out[label] = camera\n }\n return out\n}\n","/**\n * camera-switch (podcast B5, decided 2026-10-03) — the structural pieces every\n * caller shares: the canvas engines, the editor, MCP and the SDK. WHO is on\n * screen is decided by the Cloud plugin; these only read the inputs it needs\n * and pre-fill the speaker table. Pure, no I/O.\n */\nimport { normalizeTranscript } from \"./edl.js\"\nimport { speakerMapByOrdinal, speakerMapResultOf } from \"./speaker-map-contract.js\"\n\n/** The settings and their decided defaults (the plugin holds its own copy, D13). */\nexport const CAMERA_SWITCH_DEFAULTS = Object.freeze({\n /** The shortest shot; a shorter turn (an interjection) holds the shot. */\n minShotMs: 2_500,\n /** Cut this long before the new speaker starts. */\n leadMs: 200,\n /** With a `wide` camera: break to it after this long on one camera. */\n maxShotMs: 20_000,\n /** With a `wide` camera: every N-th cut goes to the wide (0 = off). */\n wideEvery: 0,\n /** Overlapping speech → a side-by-side / stacked layout hint. */\n layoutHints: false,\n})\n\n/** The flat credit id and price (decided 2026-10-03). */\nexport const CAMERA_SWITCH_CREDIT_ID = \"camera-switch\"\n\nconst parseMaybe = (raw: unknown): unknown => {\n if (typeof raw !== \"string\") return raw\n try { return JSON.parse(raw) } catch { return undefined }\n}\n\n/** Distinct speaker labels of a transcript (an object or its JSON string), in\n * order of first appearance in time. Read through `normalizeTranscript`\n * (decided 2026-10-08) — the Cloud plugin's reading — so a broken word (no\n * usable time) names no speaker here either; a zero-width word is a point\n * and does. Empty → camera-switch refuses before charging. */\nexport function transcriptSpeakerLabels(transcript: unknown): string[] {\n const parsed = parseMaybe(transcript)\n if (!parsed || typeof parsed !== \"object\") return []\n const seen = new Set<string>()\n for (const w of normalizeTranscript(parsed).words) {\n if (w.speaker && !seen.has(w.speaker)) seen.add(w.speaker)\n }\n return [...seen]\n}\n\n/** The cameras a speaker can be given: an EDL's video sources in order,\n * without the `wide` / `screen` angles (those are not anyone's close-up). */\nexport function cameraSwitchCameras(edl: unknown): Array<{ id: string; role?: string }> {\n const sources = (parseMaybe(edl) as { sources?: unknown } | null | undefined)?.sources\n if (!Array.isArray(sources)) return []\n return sources\n .filter((s): s is { id: string; kind?: string; role?: string } => !!s && typeof (s as { id?: unknown }).id === \"string\")\n .filter((s) => s.kind !== \"audio\" && s.role !== \"wide\" && s.role !== \"screen\" && s.role !== \"master-audio\")\n .map((s) => ({ id: s.id, ...(s.role ? { role: s.role } : {}) }))\n}\n\n/** The settings' accepted ranges — exactly the Cloud route's (it answers 400\n * outside them), so every caller clamps to the same numbers before sending. */\nexport const CAMERA_SWITCH_BOUNDS = Object.freeze({\n minShotMs: Object.freeze({ min: 500, max: 60_000 }),\n leadMs: Object.freeze({ min: 0, max: 5_000 }),\n maxShotMs: Object.freeze({ min: 0, max: 600_000 }),\n wideEvery: Object.freeze({ min: 0, max: 20 }),\n})\n\n/** The longest display name a speaker can be given. */\nexport const CAMERA_SWITCH_NAME_MAX = 80\n\nexport type CameraSwitchNumericSetting = keyof typeof CAMERA_SWITCH_BOUNDS\n\n/** A setting as a whole number inside its range; undefined when unset. */\nexport function clampCameraSwitchSetting(key: CameraSwitchNumericSetting, value: unknown): number | undefined {\n if (typeof value !== \"number\" || !Number.isFinite(value)) return undefined\n const { min, max } = CAMERA_SWITCH_BOUNDS[key]\n return Math.min(max, Math.max(min, Math.round(value)))\n}\n\n/** Display names trimmed, empty ones dropped, each cut to\n * `CAMERA_SWITCH_NAME_MAX` characters. */\nexport function cleanSpeakerNames(raw: unknown): Record<string, string> {\n if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) return {}\n const out: Record<string, string> = {}\n for (const [label, name] of Object.entries(raw as Record<string, unknown>)) {\n const trimmed = typeof name === \"string\" ? name.trim() : \"\"\n if (label && trimmed) out[label] = trimmed.slice(0, CAMERA_SWITCH_NAME_MAX)\n }\n return out\n}\n\n/** Why camera-switch would refuse this edit (the route's 400 `invalid_edl`),\n * or null. One edit (an object or its JSON string) on the master clock, with\n * sources and at least one segment of numeric inMs < outMs; a clip SET is\n * refused — on the canvas each clip fans out to its own run. */\nexport function cameraSwitchEdlProblem(edl: unknown): string | null {\n const v = parseMaybe(edl) as Record<string, unknown> | null | undefined\n if (!v || typeof v !== \"object\" || Array.isArray(v)) return \"camera-switch: `edl` must be one edit (an EDL object).\"\n if (Array.isArray(v.clips)) return \"camera-switch: `edl` is a clip set — pass one clip's EDL (a clip set fans out one run per clip on the canvas).\"\n if (!Array.isArray(v.sources) || !Array.isArray(v.segments)) return \"camera-switch: `edl` needs `sources` and `segments`.\"\n if (v.segments.length === 0) return \"camera-switch: `edl` has no segments.\"\n const num = (x: unknown) => (typeof x === \"number\" && Number.isFinite(x) ? x : undefined)\n for (const [i, row] of (v.segments as unknown[]).entries()) {\n const seg = row as { inMs?: unknown; outMs?: unknown } | null\n const inMs = num(seg?.inMs), outMs = num(seg?.outMs)\n if (inMs === undefined || outMs === undefined || !(outMs > inMs)) return `camera-switch: segment ${i} needs a numeric inMs < outMs.`\n }\n if (v.clock === \"output\") return \"camera-switch: the edit must be on the master clock (an edit-plan EDL), not a rendered output's.\"\n return null\n}\n\n/** The speaker table pre-filled by order (decided 2026-10-03): speaker 1 →\n * camera 1, speaker 2 → camera 2 … A speaker past the last camera stays\n * unmapped (the wide shows them, else any camera with picture). `existing`\n * entries are kept as the person set them — an explicit `\"\"` means \"no\n * camera of their own\" and is SENT as `\"\"`, so it also beats a source whose\n * `speakers` list names them. */\nexport function defaultSpeakerMap(\n labels: readonly string[],\n cameraIds: readonly string[],\n existing: Readonly<Record<string, string>> = {},\n): Record<string, string> {\n const out: Record<string, string> = {}\n labels.forEach((label, i) => {\n if (Object.prototype.hasOwnProperty.call(existing, label)) {\n const kept = existing[label]\n if (typeof kept === \"string\") out[label] = kept\n return\n }\n if (i < cameraIds.length) out[label] = cameraIds[i]!\n })\n return out\n}\n\n/** What a Camera Switch node sends besides its two inputs — ONE funnel for the\n * canvas executor and the orchestrator, so both send the same clamped\n * settings and the same pre-filled speaker table. */\nexport interface CameraSwitchNodeSettings {\n readonly speakerMap?: Readonly<Record<string, string>>\n /** Who is on which camera by ordinal — \"1\" the first voice heard → a camera\n * SOURCE id, \"\" none; what a use-case node's override writes (decided\n * 2026-10-17). A label in `speakerMap` beats it. */\n readonly speakerMapByOrder?: Readonly<Record<string, string>>\n readonly speakerNames?: Readonly<Record<string, string>>\n readonly minShotMs?: number\n readonly leadMs?: number\n readonly maxShotMs?: number\n readonly wideEvery?: number\n readonly layoutHints?: boolean\n}\n/**\n * Who is on which camera — the ONE merge of the speaker table's layers\n * (decided 2026-10-17). Per speaker, the first that names them wins: an\n * explicit label in `speakerMap`, the ordinal override `speakerMapByOrder`, a\n * wired Speaker Map result, then the order default (`defaultSpeakerMap`).\n * Each layer above the default is passed as `existing`, so its \"\" (no camera\n * of their own) is SENT as \"\" and is never re-filled by the order default; an\n * explicit entry that is not a string is ignored, so it never hides a layer\n * below it. `cameraSwitchSettingsPayload` sends this; the config panel's\n * \"What the run will use\" shows this — never a second copy of the order.\n */\nexport function cameraSwitchSpeakerMap(\n data: Pick<CameraSwitchNodeSettings, \"speakerMap\" | \"speakerMapByOrder\">,\n edl: unknown,\n transcript: unknown,\n wired?: { readonly speakerMap?: unknown },\n): Record<string, string> {\n const labels = transcriptSpeakerLabels(transcript)\n const explicit = data.speakerMap && typeof data.speakerMap === \"object\" && !Array.isArray(data.speakerMap)\n ? Object.fromEntries(Object.entries(data.speakerMap).filter(([, camera]) => typeof camera === \"string\"))\n : {}\n const existing = {\n ...(speakerMapResultOf(wired?.speakerMap)?.speakerMap ?? {}),\n ...speakerMapByOrdinal(labels, data.speakerMapByOrder),\n ...explicit,\n }\n return defaultSpeakerMap(labels, cameraSwitchCameras(edl).map((c) => c.id), existing)\n}\n\nexport function cameraSwitchSettingsPayload(\n data: CameraSwitchNodeSettings,\n edl: unknown,\n transcript: unknown,\n wired?: { readonly speakerMap?: unknown },\n): {\n speakerMap: Record<string, string>\n speakerNames: Record<string, string>\n minShotMs?: number\n leadMs?: number\n maxShotMs?: number\n wideEvery?: number\n layoutHints: boolean\n} {\n const out: ReturnType<typeof cameraSwitchSettingsPayload> = {\n speakerMap: cameraSwitchSpeakerMap(data, edl, transcript, wired),\n speakerNames: cleanSpeakerNames(data.speakerNames),\n layoutHints: data.layoutHints === true,\n }\n for (const key of Object.keys(CAMERA_SWITCH_BOUNDS) as CameraSwitchNumericSetting[]) {\n const v = clampCameraSwitchSetting(key, data[key])\n if (v !== undefined) out[key] = v\n }\n return out\n}\n","/**\n * The edit-plan node's credit-id scheme and output unwrap — split out of\n * `edl.ts` (which keeps the EDL shape itself) so that module stays within the\n * file-size cap. Re-exported from the package index, so importers of\n * `@nodaro/shared` are unaffected.\n */\nimport { EDL_VERSION } from \"./edl.js\"\n\n// ─────────────────────────────────────────────────────────────────────────\n// edit-plan credit-id scheme (STRUCTURE only — the per-mode/tier/bucket credit\n// VALUES live app-side in backend/ee/billing/credits.ts + migration 432, since\n// they are probe-set placeholders and the DB row wins at runtime). Lives HERE\n// so BOTH core payload-builder and ee credits.ts read one id builder — core\n// may not import ee (check-ee-imports), the same reason buildVideoAnalysisCreditId\n// is shared. Mirrors the plugin's own (D13-local) pricing.ts scheme.\n// ─────────────────────────────────────────────────────────────────────────\n\n/** `trailer` (Track D1): one short teaser EDL built from the strongest moments,\n * priced like `clips` (the per-minute rate plus the clips flat). */\nexport type EditPlanMode = \"tighten\" | \"clips\" | \"chapters\" | \"trailer\"\nexport type EditPlanTier = \"economy\" | \"standard\" | \"premium\"\nexport const EDIT_PLAN_MODES: readonly EditPlanMode[] = [\"tighten\", \"clips\", \"chapters\", \"trailer\"]\nexport const EDIT_PLAN_TIERS: readonly EditPlanTier[] = [\"economy\", \"standard\", \"premium\"]\n/** The coarse duration ladder (MINUTES) a probed source duration rounds UP to;\n * the composite credit id carries the bucket. 4 modes × 3 tiers × 6 buckets =\n * 72 composites (+ the bare `edit-plan`). */\nexport const EDIT_PLAN_BUCKET_MINUTES: readonly number[] = [15, 30, 60, 90, 120, 180]\n/** Hard duration cap (design §7.4). */\nexport const EDIT_PLAN_MAX_MINUTES = 180\n/** `clips` mode: how many clips a plan returns when the caller names no count,\n * and the most it may be asked for. One source for the credit estimate, the\n * orchestrated payload clamp and the request schema. */\nexport const EDIT_PLAN_DEFAULT_CLIP_COUNT = 8\nexport const EDIT_PLAN_MAX_CLIP_COUNT = 50\n\n/** Clamp a requested clip count into `[1, EDIT_PLAN_MAX_CLIP_COUNT]`; `undefined`\n * for anything that is not a positive number (the planner then uses its default). */\nexport function clampEditPlanClipCount(count: unknown): number | undefined {\n if (typeof count !== \"number\" || !Number.isFinite(count) || count <= 0) return undefined\n return Math.min(EDIT_PLAN_MAX_CLIP_COUNT, Math.max(1, Math.floor(count)))\n}\n/** The bare estimator / DB-down fallback id. */\nexport const EDIT_PLAN_BASE_CREDIT_ID = \"edit-plan\"\n\n/** Round a source duration (seconds) UP to the smallest covering ladder bucket\n * (capped at the max), in minutes. `undefined` / non-finite → the ceiling\n * bucket (the safe over-reserve direction). */\nexport function editPlanBucketMinutes(durationSec: number | undefined): number {\n const secs = typeof durationSec === \"number\" && Number.isFinite(durationSec) ? durationSec : EDIT_PLAN_MAX_MINUTES * 60\n const mins = Math.max(1, Math.ceil(secs / 60))\n const capped = Math.min(mins, EDIT_PLAN_MAX_MINUTES)\n for (const b of EDIT_PLAN_BUCKET_MINUTES) if (capped <= b) return b\n return EDIT_PLAN_BUCKET_MINUTES[EDIT_PLAN_BUCKET_MINUTES.length - 1]!\n}\n\n/** `edit-plan:<mode>:<tier>:<bucket>m`. `durationSec` undefined → the ceiling\n * bucket. Single source of truth for the composite id shape. */\nexport function buildEditPlanCreditId(mode: EditPlanMode, tier: EditPlanTier, durationSec?: number): string {\n return editPlanMinutesCreditId(mode, tier, editPlanBucketMinutes(durationSec))\n}\n\n// ─────────────────────────────────────────────────────────────────────────\n// Per started minute (decided 2026-10-07). A plugin that declares\n// `supports().editPlanPerMinute` reserves `edit-plan:<mode>:<tier>:<N>m` with\n// N = the started minutes of the source (1..180), priced flat + rate × N from\n// ONE rate row and ONE flat row per mode × tier. The step ids above have the\n// same shape (N = a step), so one parser reads both, and the plugin's money\n// gate (`:(\\d+)m$`) accepts both.\n// ─────────────────────────────────────────────────────────────────────────\n\n/** Started minutes of a source (seconds): ceil(sec / 60), at least 1, capped at\n * the maximum. `undefined` / non-finite → the maximum (over-reserve direction). */\nexport function editPlanStartedMinutes(durationSec: number | undefined): number {\n const secs = typeof durationSec === \"number\" && Number.isFinite(durationSec) ? durationSec : EDIT_PLAN_MAX_MINUTES * 60\n return Math.min(EDIT_PLAN_MAX_MINUTES, Math.max(1, Math.ceil(secs / 60)))\n}\n\n/** `edit-plan:<mode>:<tier>:<N>m` for N minutes (a started-minute count or a step). */\nexport function editPlanMinutesCreditId(mode: EditPlanMode, tier: EditPlanTier, minutes: number): string {\n return `edit-plan:${mode}:${tier}:${minutes}m`\n}\n\n/** The id a run of this mode/tier on a source of `durationSec` reserves: per\n * started minute when the plugin charges that way (`perMinute`), else the step\n * the length rounds up to. An unknown length → the 180-minute maximum either way. */\nexport function editPlanReserveCreditId(\n mode: EditPlanMode,\n tier: EditPlanTier,\n durationSec: number | undefined,\n perMinute: boolean,\n): string {\n return perMinute\n ? editPlanMinutesCreditId(mode, tier, editPlanStartedMinutes(durationSec))\n : buildEditPlanCreditId(mode, tier, durationSec)\n}\n\n/** The rate row: credits per started source minute for a mode/tier. Never reserved. */\nexport function editPlanRateCreditId(mode: EditPlanMode, tier: EditPlanTier): string {\n return `edit-plan:${mode}:${tier}:per-minute`\n}\n\n/** The flat row: credits once per plan for a mode/tier (0 for tighten and chapters). Never reserved. */\nexport function editPlanFlatCreditId(mode: EditPlanMode, tier: EditPlanTier): string {\n return `edit-plan:${mode}:${tier}:flat`\n}\n\n/** The mode, tier and minutes of an `edit-plan:<mode>:<tier>:<N>m` id (1 ≤ N ≤\n * the maximum), or `undefined` for anything else (the bare id, a rate or flat\n * row, an unknown mode or tier). */\nexport function parseEditPlanMinutesCreditId(\n id: string,\n): { mode: EditPlanMode; tier: EditPlanTier; minutes: number } | undefined {\n const m = /^edit-plan:([a-z]+):([a-z]+):(\\d+)m$/.exec(id)\n if (!m) return undefined\n const mode = parseEditPlanMode(m[1])\n const tier = (EDIT_PLAN_TIERS as readonly string[]).includes(m[2]!) ? (m[2] as EditPlanTier) : undefined\n const minutes = Number(m[3])\n if (!mode || !tier || !Number.isInteger(minutes) || minutes < 1 || minutes > EDIT_PLAN_MAX_MINUTES) return undefined\n return { mode, tier, minutes }\n}\n\n/** flat + rate × N, rounded up, at least 1 credit — what an\n * `edit-plan:<mode>:<tier>:<N>m` id costs from its two rows (the plugin's formula). */\nexport function editPlanMinutesBaseCredits(flat: number, rate: number, minutes: number): number {\n return Math.max(1, Math.ceil(flat + rate * minutes))\n}\n\n/** Narrow an arbitrary value to a known edit-plan mode, defaulting to \"tighten\".\n * For display and estimates only: anything that DISPATCHES a plan must use\n * {@link parseEditPlanMode} and refuse an unknown mode, or that mode is planned\n * (and charged) as tighten. */\nexport function asEditPlanMode(v: unknown): EditPlanMode {\n return parseEditPlanMode(v) ?? \"tighten\"\n}\n\n/** The strict sibling of {@link asEditPlanMode}: the mode when `v` is exactly a\n * known edit-plan mode, otherwise `undefined` — never a substitute. */\nexport function parseEditPlanMode(v: unknown): EditPlanMode | undefined {\n return typeof v === \"string\" && (EDIT_PLAN_MODES as readonly string[]).includes(v) ? (v as EditPlanMode) : undefined\n}\n\n/** Narrow an arbitrary value to a known edit-plan tier, defaulting to \"standard\". */\nexport function asEditPlanTier(v: unknown): EditPlanTier {\n return v === \"economy\" || v === \"premium\" ? v : \"standard\"\n}\n\n/**\n * Unwrap an `edit-plan` job's `output_data` into the value stored on the node's\n * `data.generatedJson`, which every output extractor then reads. This is the ONE\n * place the modes are normalized (the same rule on both engines and every\n * result-application site, so audit-dag parity can't drift):\n * - `clips` → the BARE `Edl[]` (T5: the `list` fan-out reads `Array.isArray`\n * on `generatedJson`; each element becomes one JSON-stringified\n * item a downstream `edl` input `normalizeEdl`-parses).\n * - `chapters` → the `{ version, chapters }` object.\n * - `tighten` / `trailer` → the `Edl` object at top level.\n *\n * The cloud relay object-spreads `output_data` and adds `viaNodaroCloud: true`;\n * that key (and any other bookkeeping) is stripped here. The unwrap lives HERE —\n * NEVER in `output_data` — because a bare array written into `output_data` would\n * be corrupted into numeric keys by the relay's object-spread (see `EdlClipSet`).\n */\nexport function unwrapEditPlanOutput(outputData: unknown): unknown {\n if (!outputData || typeof outputData !== \"object\") return outputData\n const o = outputData as Record<string, unknown>\n // clips: EdlClipSet { version, clips: Edl[] } → the bare Edl[].\n if (Array.isArray(o.clips)) return o.clips\n // chapters: { version, chapters: [...] } → the object, minus bookkeeping.\n if (Array.isArray(o.chapters)) return { version: EDL_VERSION, chapters: o.chapters }\n // tighten / trailer: the Edl object at top level → drop the relay's viaNodaroCloud.\n const { viaNodaroCloud: _viaNodaroCloud, ...rest } = o\n return rest\n}\n"]}
|