@nodaro/shared 3.62.0 → 3.64.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.
Files changed (264) hide show
  1. package/dist/{chunk-C7POAYFE.js → chunk-36VWLB4J.js} +3 -3
  2. package/dist/{chunk-C7POAYFE.js.map → chunk-36VWLB4J.js.map} +1 -1
  3. package/dist/{chunk-S24ZBUB4.js → chunk-3AYM47GW.js} +6 -32
  4. package/dist/chunk-3AYM47GW.js.map +1 -0
  5. package/dist/{chunk-YCXRSWCQ.js → chunk-3KTWYYCN.js} +8 -5
  6. package/dist/chunk-3KTWYYCN.js.map +1 -0
  7. package/dist/{chunk-ZES6EZC4.js → chunk-4IUE2JB7.js} +3 -3
  8. package/dist/{chunk-ZES6EZC4.js.map → chunk-4IUE2JB7.js.map} +1 -1
  9. package/dist/{chunk-MYJQELFN.cjs → chunk-5OBTGNUQ.cjs} +547 -29
  10. package/dist/chunk-5OBTGNUQ.cjs.map +1 -0
  11. package/dist/{chunk-TWF2OSH4.cjs → chunk-67CMMTLN.cjs} +4 -4
  12. package/dist/{chunk-TWF2OSH4.cjs.map → chunk-67CMMTLN.cjs.map} +1 -1
  13. package/dist/{chunk-WRSWH7US.cjs → chunk-6BRWPJPP.cjs} +17 -2
  14. package/dist/chunk-6BRWPJPP.cjs.map +1 -0
  15. package/dist/{chunk-S5TMRJMX.js → chunk-6YIV37V7.js} +4 -4
  16. package/dist/{chunk-S5TMRJMX.js.map → chunk-6YIV37V7.js.map} +1 -1
  17. package/dist/{chunk-3M4BNKFJ.cjs → chunk-7AJGUI7L.cjs} +202 -16
  18. package/dist/chunk-7AJGUI7L.cjs.map +1 -0
  19. package/dist/{chunk-JZGZ26YB.js → chunk-7KQ6W5DS.js} +4 -4
  20. package/dist/{chunk-JZGZ26YB.js.map → chunk-7KQ6W5DS.js.map} +1 -1
  21. package/dist/{chunk-IWWVPR3W.cjs → chunk-ACZZHHFZ.cjs} +149 -34
  22. package/dist/chunk-ACZZHHFZ.cjs.map +1 -0
  23. package/dist/{chunk-2W745U4A.cjs → chunk-AZNZ5WNZ.cjs} +42 -70
  24. package/dist/chunk-AZNZ5WNZ.cjs.map +1 -0
  25. package/dist/{chunk-HSHCCBIV.js → chunk-BQYCZLMF.js} +16 -3
  26. package/dist/chunk-BQYCZLMF.js.map +1 -0
  27. package/dist/chunk-CHS2SIP6.cjs +504 -0
  28. package/dist/chunk-CHS2SIP6.cjs.map +1 -0
  29. package/dist/{chunk-CIPPPT7E.cjs → chunk-CHTZZRAL.cjs} +6 -6
  30. package/dist/{chunk-CIPPPT7E.cjs.map → chunk-CHTZZRAL.cjs.map} +1 -1
  31. package/dist/{chunk-AOJ6B7K4.cjs → chunk-D4KWNDPH.cjs} +12 -12
  32. package/dist/chunk-D4KWNDPH.cjs.map +1 -0
  33. package/dist/{chunk-5YYN5X57.js → chunk-DZ4IOP3Q.js} +536 -30
  34. package/dist/chunk-DZ4IOP3Q.js.map +1 -0
  35. package/dist/{chunk-VACPZPUA.cjs → chunk-EXEVT6D2.cjs} +15 -5
  36. package/dist/chunk-EXEVT6D2.cjs.map +1 -0
  37. package/dist/{chunk-5M43XMRB.cjs → chunk-FHGRKQVZ.cjs} +8 -8
  38. package/dist/{chunk-5M43XMRB.cjs.map → chunk-FHGRKQVZ.cjs.map} +1 -1
  39. package/dist/{chunk-KJSRPHJ2.cjs → chunk-GTWUS6MQ.cjs} +165 -54
  40. package/dist/chunk-GTWUS6MQ.cjs.map +1 -0
  41. package/dist/{chunk-Q6IES3U2.js → chunk-H5KHWTAE.js} +5 -2
  42. package/dist/chunk-H5KHWTAE.js.map +1 -0
  43. package/dist/{chunk-G3KVK7OU.cjs → chunk-HDPJNNMF.cjs} +21 -21
  44. package/dist/{chunk-G3KVK7OU.cjs.map → chunk-HDPJNNMF.cjs.map} +1 -1
  45. package/dist/{chunk-3OYO3XCC.js → chunk-IYSOVS7O.js} +118 -24
  46. package/dist/chunk-IYSOVS7O.js.map +1 -0
  47. package/dist/{chunk-AFYTX4AI.cjs → chunk-J6B7J73J.cjs} +110 -50
  48. package/dist/chunk-J6B7J73J.cjs.map +1 -0
  49. package/dist/{chunk-I2RQB7VG.js → chunk-KB2SQAR3.js} +3 -3
  50. package/dist/{chunk-I2RQB7VG.js.map → chunk-KB2SQAR3.js.map} +1 -1
  51. package/dist/{chunk-BLJUCPMV.cjs → chunk-KSHAAPQF.cjs} +5 -2
  52. package/dist/chunk-KSHAAPQF.cjs.map +1 -0
  53. package/dist/{chunk-6G7NN4S4.js → chunk-NIAFR5EE.js} +2 -2
  54. package/dist/chunk-NIAFR5EE.js.map +1 -0
  55. package/dist/{chunk-CF4S4N5X.js → chunk-O2QOBA6Q.js} +2 -2
  56. package/dist/{chunk-CF4S4N5X.js.map → chunk-O2QOBA6Q.js.map} +1 -1
  57. package/dist/{chunk-IDTKF5EX.cjs → chunk-O4RPXBDZ.cjs} +12 -8
  58. package/dist/chunk-O4RPXBDZ.cjs.map +1 -0
  59. package/dist/{chunk-4GGLKRYI.cjs → chunk-O6TBB4IF.cjs} +2 -2
  60. package/dist/{chunk-4GGLKRYI.cjs.map → chunk-O6TBB4IF.cjs.map} +1 -1
  61. package/dist/{chunk-PTD6EDUU.js → chunk-OBOOHG3N.js} +13 -4
  62. package/dist/chunk-OBOOHG3N.js.map +1 -0
  63. package/dist/{chunk-2D5LQFV4.cjs → chunk-OOZW2MM6.cjs} +9 -9
  64. package/dist/{chunk-2D5LQFV4.cjs.map → chunk-OOZW2MM6.cjs.map} +1 -1
  65. package/dist/{chunk-A2PX5IRC.cjs → chunk-PERUFUVH.cjs} +13 -13
  66. package/dist/{chunk-A2PX5IRC.cjs.map → chunk-PERUFUVH.cjs.map} +1 -1
  67. package/dist/{chunk-G4U3HW6W.js → chunk-PJJAZQVZ.js} +3 -3
  68. package/dist/{chunk-G4U3HW6W.js.map → chunk-PJJAZQVZ.js.map} +1 -1
  69. package/dist/{chunk-E2HZTGYX.js → chunk-Q2Y4JHF7.js} +7 -7
  70. package/dist/chunk-Q2Y4JHF7.js.map +1 -0
  71. package/dist/{chunk-FVII3KHN.js → chunk-QYU7J5EQ.js} +198 -17
  72. package/dist/chunk-QYU7J5EQ.js.map +1 -0
  73. package/dist/{chunk-JJNNM23P.js → chunk-S3UGLZSF.js} +3 -3
  74. package/dist/{chunk-JJNNM23P.js.map → chunk-S3UGLZSF.js.map} +1 -1
  75. package/dist/{chunk-CC4V2B7S.js → chunk-SHH2T4CR.js} +3 -3
  76. package/dist/{chunk-CC4V2B7S.js.map → chunk-SHH2T4CR.js.map} +1 -1
  77. package/dist/{chunk-4ZEFP2FQ.cjs → chunk-SPAHI7DY.cjs} +4 -4
  78. package/dist/{chunk-4ZEFP2FQ.cjs.map → chunk-SPAHI7DY.cjs.map} +1 -1
  79. package/dist/{chunk-Y6X7UJSD.js → chunk-SXHHLZ22.js} +122 -15
  80. package/dist/chunk-SXHHLZ22.js.map +1 -0
  81. package/dist/{chunk-HRY7KGAE.cjs → chunk-T2OVDF2M.cjs} +6 -6
  82. package/dist/{chunk-HRY7KGAE.cjs.map → chunk-T2OVDF2M.cjs.map} +1 -1
  83. package/dist/{chunk-2QKF7M2Z.js → chunk-TAPBDT47.js} +3 -3
  84. package/dist/{chunk-2QKF7M2Z.js.map → chunk-TAPBDT47.js.map} +1 -1
  85. package/dist/{chunk-NGKKNSK6.js → chunk-TPQJKS7D.js} +139 -16
  86. package/dist/chunk-TPQJKS7D.js.map +1 -0
  87. package/dist/{chunk-N7OUQK7E.cjs → chunk-TQW3R44P.cjs} +8 -8
  88. package/dist/{chunk-N7OUQK7E.cjs.map → chunk-TQW3R44P.cjs.map} +1 -1
  89. package/dist/{chunk-GSFB537T.js → chunk-TTGZ2L3O.js} +23 -4
  90. package/dist/chunk-TTGZ2L3O.js.map +1 -0
  91. package/dist/{chunk-SYWR5G3T.js → chunk-VPTA4Z7G.js} +54 -7
  92. package/dist/chunk-VPTA4Z7G.js.map +1 -0
  93. package/dist/{chunk-2HZGDZZN.cjs → chunk-VZ6TE23U.cjs} +6 -6
  94. package/dist/{chunk-2HZGDZZN.cjs.map → chunk-VZ6TE23U.cjs.map} +1 -1
  95. package/dist/{chunk-TRVWMKNE.cjs → chunk-W6VJAUGM.cjs} +285 -64
  96. package/dist/chunk-W6VJAUGM.cjs.map +1 -0
  97. package/dist/{chunk-UDDVDQMF.js → chunk-W7KHHNZR.js} +235 -37
  98. package/dist/chunk-W7KHHNZR.js.map +1 -0
  99. package/dist/{chunk-KYMHFVAZ.cjs → chunk-Y4GCJJPF.cjs} +2 -2
  100. package/dist/chunk-Y4GCJJPF.cjs.map +1 -0
  101. package/dist/{chunk-6CSXMWL4.cjs → chunk-YQV53HRR.cjs} +27 -4
  102. package/dist/chunk-YQV53HRR.cjs.map +1 -0
  103. package/dist/{chunk-7FCTCWHD.js → chunk-ZI3QDUHO.js} +3 -3
  104. package/dist/{chunk-7FCTCWHD.js.map → chunk-ZI3QDUHO.js.map} +1 -1
  105. package/dist/entries/apps.cjs +43 -42
  106. package/dist/entries/apps.js +8 -7
  107. package/dist/entries/captions.cjs +38 -30
  108. package/dist/entries/captions.d.cts +47 -1
  109. package/dist/entries/captions.d.ts +47 -1
  110. package/dist/entries/captions.js +1 -1
  111. package/dist/entries/credits.cjs +354 -174
  112. package/dist/entries/credits.d.cts +378 -27
  113. package/dist/entries/credits.d.ts +378 -27
  114. package/dist/entries/credits.js +11 -11
  115. package/dist/entries/llm-models.cjs +77 -57
  116. package/dist/entries/llm-models.d.cts +108 -7
  117. package/dist/entries/llm-models.d.ts +108 -7
  118. package/dist/entries/llm-models.js +2 -2
  119. package/dist/entries/media.cjs +63 -63
  120. package/dist/entries/media.d.cts +8 -0
  121. package/dist/entries/media.d.ts +8 -0
  122. package/dist/entries/media.js +1 -1
  123. package/dist/entries/model-catalog.cjs +161 -105
  124. package/dist/entries/model-catalog.d.cts +109 -22
  125. package/dist/entries/model-catalog.d.ts +109 -22
  126. package/dist/entries/model-catalog.js +4 -4
  127. package/dist/entries/models.cjs +466 -322
  128. package/dist/entries/models.d.cts +71 -5
  129. package/dist/entries/models.d.ts +71 -5
  130. package/dist/entries/models.js +5 -5
  131. package/dist/entries/nodes.cjs +226 -209
  132. package/dist/entries/nodes.d.cts +66 -7
  133. package/dist/entries/nodes.d.ts +66 -7
  134. package/dist/entries/nodes.js +10 -9
  135. package/dist/entries/pipeline.cjs +156 -152
  136. package/dist/entries/pipeline.d.cts +14 -4
  137. package/dist/entries/pipeline.d.ts +14 -4
  138. package/dist/entries/pipeline.js +3 -3
  139. package/dist/entries/runtime-config.cjs +29 -29
  140. package/dist/entries/runtime-config.d.cts +10 -7
  141. package/dist/entries/runtime-config.d.ts +10 -7
  142. package/dist/entries/runtime-config.js +1 -1
  143. package/dist/entries/social.cjs +177 -177
  144. package/dist/entries/social.js +2 -2
  145. package/dist/entries/types.d.cts +8 -0
  146. package/dist/entries/types.d.ts +8 -0
  147. package/dist/entries/ugc.cjs +71 -71
  148. package/dist/entries/ugc.js +4 -4
  149. package/dist/entries/video.cjs +154 -150
  150. package/dist/entries/video.d.cts +11 -2
  151. package/dist/entries/video.d.ts +11 -2
  152. package/dist/entries/video.js +6 -6
  153. package/dist/entries/workflow.cjs +150 -150
  154. package/dist/entries/workflow.d.cts +1 -1
  155. package/dist/entries/workflow.d.ts +1 -1
  156. package/dist/entries/workflow.js +2 -2
  157. package/dist/index.cjs +2136 -1704
  158. package/dist/index.d.cts +10 -10
  159. package/dist/index.d.ts +10 -10
  160. package/dist/index.js +27 -27
  161. package/dist/{model-catalog-CCEcv08q.d.ts → model-catalog-Cf9fkEUp.d.cts} +45 -2
  162. package/dist/{model-catalog-CCEcv08q.d.cts → model-catalog-Cf9fkEUp.d.ts} +45 -2
  163. package/dist/{model-constants-B88p6XR0.d.ts → model-constants-BxjiWVQ9.d.ts} +215 -32
  164. package/dist/{model-constants-Cf3zaITt.d.cts → model-constants-C_Nyft_i.d.cts} +215 -32
  165. package/package.json +1 -1
  166. package/src/__tests__/add-captions-nemotron-pricing.test.ts +111 -0
  167. package/src/__tests__/credit-identifiers.test.ts +29 -0
  168. package/src/__tests__/extend-providers.test.ts +359 -39
  169. package/src/__tests__/fixtures/mask-composite-quote-parity.json +1 -1
  170. package/src/__tests__/fixtures/measured-input-quote-parity.json +1435 -0
  171. package/src/__tests__/fixtures/planned-length-quote-parity.json +1866 -0
  172. package/src/__tests__/fixtures/video-utility-quote-parity.json +2343 -0
  173. package/src/__tests__/flux-3-klein.test.ts +203 -0
  174. package/src/__tests__/gpt-image-2-6-formats.test.ts +3 -1
  175. package/src/__tests__/gvp-supported-providers.test.ts +27 -2
  176. package/src/__tests__/lip-sync-audio-rate.test.ts +74 -0
  177. package/src/__tests__/lip-sync-levers.test.ts +31 -0
  178. package/src/__tests__/llm-models.test.ts +139 -12
  179. package/src/__tests__/llm-price-key.test.ts +164 -1
  180. package/src/__tests__/model-makers.test.ts +3 -0
  181. package/src/__tests__/nemotron-transcribe-pricing.test.ts +61 -0
  182. package/src/__tests__/node-runtime-keys.test.ts +7 -0
  183. package/src/__tests__/normalize-node-params.test.ts +172 -1
  184. package/src/__tests__/pixverse-v6-max-catalog.test.ts +271 -0
  185. package/src/__tests__/prompt-length-limits.test.ts +4 -0
  186. package/src/__tests__/retired-lip-sync-providers.test.ts +43 -0
  187. package/src/__tests__/seedance-extend-source-credit-id.test.ts +89 -0
  188. package/src/__tests__/seedance-task-type.test.ts +13 -3
  189. package/src/__tests__/sequence-execution.test.ts +22 -1
  190. package/src/__tests__/suno-credit-type.test.ts +21 -2
  191. package/src/__tests__/transcribe-capabilities.test.ts +41 -2
  192. package/src/__tests__/transcribe-preflight.test.ts +50 -1
  193. package/src/__tests__/video-analysis-catalog-sync.test.ts +4 -2
  194. package/src/__tests__/video-analysis-pricing.test.ts +10 -9
  195. package/src/__tests__/video-audio-capability.test.ts +35 -6
  196. package/src/__tests__/video-resolution-billed-as-named.test.ts +30 -0
  197. package/src/__tests__/video-upscale-params.test.ts +62 -0
  198. package/src/caption-styles.ts +62 -0
  199. package/src/catalog-projection.ts +8 -0
  200. package/src/credit-estimators/add-captions-nemotron.ts +73 -0
  201. package/src/credit-estimators/index.ts +20 -0
  202. package/src/credit-estimators/nemotron-transcribe.ts +87 -0
  203. package/src/credit-identifiers.ts +351 -41
  204. package/src/entries/captions.ts +2 -0
  205. package/src/entries/credits.ts +37 -2
  206. package/src/entries/llm-models.ts +6 -0
  207. package/src/entries/model-catalog.ts +22 -0
  208. package/src/entries/models.ts +50 -0
  209. package/src/entries/nodes.ts +4 -0
  210. package/src/entries/pipeline.ts +1 -1
  211. package/src/entries/video.ts +1 -1
  212. package/src/flux-3-klein.ts +69 -0
  213. package/src/freecut-protocol.ts +8 -0
  214. package/src/input-image-pricing.ts +23 -6
  215. package/src/lip-sync-levers.ts +56 -0
  216. package/src/lip-sync-pricing.ts +91 -1
  217. package/src/llm-models.ts +305 -16
  218. package/src/model-catalog.ts +529 -28
  219. package/src/model-constants.ts +417 -41
  220. package/src/model-tree.ts +2 -1
  221. package/src/nodaro-video-upscale.ts +48 -0
  222. package/src/node-default-mappings.ts +6 -0
  223. package/src/node-runtime-keys.ts +3 -0
  224. package/src/normalize-node-params.ts +172 -3
  225. package/src/runtime-config/contract.ts +10 -7
  226. package/src/seedance-draft.ts +2 -1
  227. package/src/seedance-extend-rate.ts +116 -0
  228. package/src/sequence-execution.ts +24 -0
  229. package/src/transcribe-preflight.ts +81 -7
  230. package/src/video-analysis-pricing.ts +28 -15
  231. package/src/video-duration.ts +9 -0
  232. package/src/video-ui-defaults.ts +5 -3
  233. package/src/video-upscale-params.ts +67 -0
  234. package/dist/chunk-2W745U4A.cjs.map +0 -1
  235. package/dist/chunk-3M4BNKFJ.cjs.map +0 -1
  236. package/dist/chunk-3OYO3XCC.js.map +0 -1
  237. package/dist/chunk-5YYN5X57.js.map +0 -1
  238. package/dist/chunk-6CSXMWL4.cjs.map +0 -1
  239. package/dist/chunk-6G7NN4S4.js.map +0 -1
  240. package/dist/chunk-AFYTX4AI.cjs.map +0 -1
  241. package/dist/chunk-AOJ6B7K4.cjs.map +0 -1
  242. package/dist/chunk-BLJUCPMV.cjs.map +0 -1
  243. package/dist/chunk-E2HZTGYX.js.map +0 -1
  244. package/dist/chunk-FVII3KHN.js.map +0 -1
  245. package/dist/chunk-GSFB537T.js.map +0 -1
  246. package/dist/chunk-HSHCCBIV.js.map +0 -1
  247. package/dist/chunk-IDTKF5EX.cjs.map +0 -1
  248. package/dist/chunk-IWWVPR3W.cjs.map +0 -1
  249. package/dist/chunk-KJSRPHJ2.cjs.map +0 -1
  250. package/dist/chunk-KYMHFVAZ.cjs.map +0 -1
  251. package/dist/chunk-MYJQELFN.cjs.map +0 -1
  252. package/dist/chunk-NGKKNSK6.js.map +0 -1
  253. package/dist/chunk-PTD6EDUU.js.map +0 -1
  254. package/dist/chunk-Q6IES3U2.js.map +0 -1
  255. package/dist/chunk-QWYFHQYK.cjs +0 -357
  256. package/dist/chunk-QWYFHQYK.cjs.map +0 -1
  257. package/dist/chunk-S24ZBUB4.js.map +0 -1
  258. package/dist/chunk-SYWR5G3T.js.map +0 -1
  259. package/dist/chunk-TRVWMKNE.cjs.map +0 -1
  260. package/dist/chunk-UDDVDQMF.js.map +0 -1
  261. package/dist/chunk-VACPZPUA.cjs.map +0 -1
  262. package/dist/chunk-WRSWH7US.cjs.map +0 -1
  263. package/dist/chunk-Y6X7UJSD.js.map +0 -1
  264. package/dist/chunk-YCXRSWCQ.js.map +0 -1
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/clone-utils.ts","../src/group-aggregation.ts","../src/progress-curve.ts","../src/route-filter.ts","../src/variant-job-id.ts","../src/json-evaluator.ts","../src/repeat-types.ts","../src/fan-out-rows.ts","../src/settled-with-limit.ts","../src/loop-delimiter.ts","../src/generate-text-items.ts","../src/text-separators.ts","../src/list-sort.ts","../src/trigger-node-types.ts","../src/schedule-rules.ts","../src/schedule-retry.ts","../src/condition-variables.ts","../src/generated-results.ts","../src/inject-upstream.ts","../src/resolve-field-mappings.ts","../src/list-source-resolver.ts","../src/wired-image-size.ts","../src/list-merge.ts","../src/workflow-export.ts","../src/sub-workflow-validation.ts","../src/reduce-strategy-registry.ts","../src/private-host.ts","../src/node-execution-state.ts","../src/execution-outcome.ts"],"names":["newRows","start","int","clamp"],"mappings":";;;;;;AAQO,IAAM,kBAAA,GAAqB;AAG3B,SAAS,gBAAgB,IAAA,EAA4B;AAC1D,EAAA,OAAO,CAAC,CAAE,IAAA,CAAK,IAAA,CAAiC,mBAAmB,kBAAA,CAAmB,IAAA,CAAK,KAAK,EAAE,CAAA;AACpG;AAOO,SAAS,gBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EAC4B;AAC5B,EAAA,MAAM,SAAA,GAAY,SAAS,iBAAA,IAAqB,KAAA;AAEhD,EAAA,MAAM,WAAW,IAAI,GAAA;AAAA,IACnB,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,eAAA,CAAgB,CAAC,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE;AAAA,GACzD;AAEA,EAAA,MAAM,aAAA,GAAgB,KAAA,CACnB,MAAA,CAAO,CAAC,CAAA,KAAM;AACb,IAAA,IAAI,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,EAAE,GAAG,OAAO,KAAA;AAC/B,IAAA,IAAI,aAAa,CAAA,CAAE,EAAA,CAAG,UAAA,CAAW,QAAQ,GAAG,OAAO,KAAA;AACnD,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA,CACA,GAAA,CAAI,CAAC,CAAA,KAAO,CAAA,CAAE,MAAA,GAAS,EAAE,GAAG,CAAA,EAAG,MAAA,EAAQ,KAAA,KAAe,CAAE,CAAA;AAE3D,EAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM;AACxC,IAAA,IAAI,aAAc,CAAA,CAAsB,EAAA,EAAI,UAAA,CAAW,QAAQ,GAAG,OAAO,KAAA;AACzE,IAAA,OAAO,CAAC,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,MAAM,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,KAAA,EAAO,aAAA,EAAe,KAAA,EAAO,aAAA,EAAc;AACtD;;;ACtCO,IAAM,mBAAA,GAAsB,CAAC,MAAA,EAAQ,OAAA,EAAS,SAAS,OAAO;AAe9D,SAAS,gBAAgB,OAAA,EAAuC;AACrE,EAAA,MAAM,OAAA,GAA8B,EAAE,IAAA,EAAM,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAE;AAChF,EAAA,KAAA,MAAW,CAAA,IAAK,SAAS,OAAA,CAAQ,CAAA,CAAE,IAAI,CAAA,CAAE,IAAA,CAAK,EAAE,KAAK,CAAA;AACrD,EAAA,OAAO,OAAA;AACT;AAEO,SAAS,aAAa,OAAA,EAAkD;AAC7E,EAAA,OAAO,mBAAA,CAAoB,OAAO,CAAC,CAAA,KAAM,QAAQ,CAAC,CAAA,CAAE,SAAS,CAAC,CAAA;AAChE;AAGO,SAAS,oBAAoB,CAAA,EAAmD;AACrF,EAAA,OAAO,MAAM,MAAA,IAAU,CAAA,KAAM,OAAA,IAAW,CAAA,KAAM,WAAW,CAAA,KAAM,OAAA;AACjE;AAGO,IAAM,mBAAA,GAAsB;AAC5B,IAAM,iBAAA,GAAoB;AAE1B,SAAS,cAAc,CAAA,EAA8B;AAC1D,EAAA,OAAO,CAAA,EAAG,mBAAmB,CAAA,EAAG,CAAC,CAAA,CAAA;AACnC;AAEO,SAAS,iBAAiB,CAAA,EAA6D;AAC5F,EAAA,IAAI,CAAC,CAAA,IAAK,CAAC,EAAE,UAAA,CAAW,mBAAmB,GAAG,OAAO,MAAA;AACrD,EAAA,MAAM,SAAA,GAAY,CAAA,CAAE,KAAA,CAAM,mBAAA,CAAoB,MAAM,CAAA;AACpD,EAAA,OAAO,mBAAA,CAAoB,SAAS,CAAA,GAAI,SAAA,GAAY,MAAA;AACtD;AAOO,SAAS,sBACd,KAAA,EACuB;AACvB,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAsB;AACnD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAC,EAAE,QAAA,EAAU;AACjB,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAA;AAC5C,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,EAAE,CAAA;AAAA,0BACF,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAAE,EAAE,CAAC,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,gBAAA;AACT;AAKO,SAAS,gBAAgB,CAAA,EAA8C;AAC5E,EAAA,OAAA,CAAQ,CAAA,CAAE,gBAAgB,iBAAA,MAAuB,iBAAA;AACnD;AAkBO,SAAS,qBAAA,CACd,MAAA,EACA,UAAA,EACA,OAAA,EACA,KAAA,EACqB;AACrB,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAuB,UAAU,CAAA;AACrD,EAAA,KAAA,MAAW,KAAK,YAAA,CAAa,OAAO,CAAA,EAAG,OAAA,CAAQ,IAAI,CAAC,CAAA;AACpD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAA,CAAE,WAAW,MAAA,EAAQ;AACzB,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,CAAA,CAAE,YAAY,CAAA;AAC5C,IAAA,IAAI,IAAA,EAAM,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,oBAAoB,MAAA,CAAO,CAAC,MAAM,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA;AACzD;;;ACnGO,SAAS,iBAAA,CACd,SAAA,EACA,WAAA,EACA,QAAA,GAAmB,CAAA,EACX;AACR,EAAA,IAAI,WAAA,IAAe,GAAG,OAAO,CAAA;AAC7B,EAAA,MAAM,CAAA,GAAI,KAAK,GAAA,CAAI,IAAA,CAAK,IAAI,SAAA,GAAY,WAAA,EAAa,CAAC,CAAA,EAAG,CAAC,CAAA;AAC1D,EAAA,OAAO,IAAA,CAAK,MAAM,EAAA,IAAM,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,GAAI,CAAA,EAAG,QAAQ,CAAA,CAAE,CAAA;AACxD;AAGO,IAAM,0BAAA,GAAqD;AAAA,EAChE,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,IAAA;AAAA,EACP,WAAA,EAAa,IAAA;AAAA,EACb,KAAA,EAAO,GAAA;AAAA,EACP,GAAA,EAAK,GAAA;AAAA,EACL,OAAA,EAAS,GAAA;AAAA,EACT,MAAA,EAAQ;AACV;AAeO,SAAS,sBACd,aAAA,EACmB;AACnB,EAAA,MAAM,OAAA,GAAU,cAAc,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AACvE,EAAA,IAAI,OAAA,IAAW,CAAA,EAAG,OAAO,EAAC;AAE1B,EAAA,MAAM,WAA8B,EAAC;AACrC,EAAA,IAAI,MAAA,GAAS,CAAA;AAEb,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,EAAE,MAAA,EAAQ,WAAA,EAAY,GAAI,cAAc,CAAC,CAAA;AAC/C,IAAA,MAAM,UAAA,GAAc,cAAc,OAAA,GAAW,EAAA;AAC7C,IAAA,MAAM,MAAA,GAAS,CAAA,KAAM,aAAA,CAAc,MAAA,GAAS,CAAA;AAC5C,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,MAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA;AAAA,MAEV,MAAA,EAAQ,MAAA,GAAS,EAAA,GAAK,MAAA,GAAS,UAAA;AAAA,MAC/B;AAAA,KACD,CAAA;AACD,IAAA,MAAA,IAAU,UAAA;AAAA,EACZ;AAEA,EAAA,OAAO,QAAA;AACT;AAKO,SAAS,0BACd,QAAA,EACA,YAAA,EAIA,GAAA,GAAc,IAAA,CAAK,KAAI,EACf;AACR,EAAA,IAAI,QAAA,GAAW,CAAA;AAEf,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA;AACrC,IAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,IAAA,MAAM,UAAA,GAAa,GAAA,CAAI,MAAA,GAAS,GAAA,CAAI,QAAA;AAEpC,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,WAAA,IAAe,KAAA,CAAM,WAAW,SAAA,EAAW;AAC9D,MAAA,QAAA,IAAY,UAAA;AAAA,IACd,CAAA,MAAA,IAAW,KAAA,CAAM,MAAA,KAAW,SAAA,IAAa,MAAM,SAAA,EAAW;AACxD,MAAA,MAAM,UAAU,GAAA,GAAM,IAAI,KAAK,KAAA,CAAM,SAAS,EAAE,OAAA,EAAQ;AACxD,MAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,OAAA,EAAS,GAAA,CAAI,WAAW,CAAA;AAE/D,MAAA,QAAA,IAAa,eAAe,EAAA,GAAM,UAAA;AAAA,IACpC;AAAA,EAEF;AAEA,EAAA,OAAO,KAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,EAAE,CAAC,CAAA;AAC1C;;;AC9EA,SAAS,GAAA,CACP,OAAA,EACA,KAAA,EACA,SAAA,EACa;AACb,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAQ,CAAC,OAAO,CAAA;AAEtB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1B,IAAA,OAAA,CAAQ,IAAI,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,IAAI,SAAA,KAAc,SAAA,IAAa,IAAA,CAAK,MAAA,KAAW,OAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AACnF,QAAA,KAAA,CAAM,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,SAAA,KAAc,UAAA,IAAc,IAAA,CAAK,MAAA,KAAW,OAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC3F,QAAA,KAAA,CAAM,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AASO,SAAS,wBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EACa;AACb,EAAA,MAAM,YAAY,KAAA,CAAM,IAAA;AAAA,IACtB,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,oBAAA,IAAyB,CAAA,CAAE,KAAiC,OAAA,KAAY;AAAA,GAC5F;AACA,EAAA,MAAM,aAAa,KAAA,CAAM,IAAA;AAAA,IACvB,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,qBAAA,IAA0B,CAAA,CAAE,KAAiC,OAAA,KAAY;AAAA,GAC7F;AAEA,EAAA,IAAI,CAAC,SAAA,IAAa,CAAC,UAAA,EAAY,2BAAW,GAAA,EAAI;AAE9C,EAAA,MAAM,gBAAA,GAAmB,GAAA,CAAI,SAAA,CAAU,EAAA,EAAI,OAAO,SAAS,CAAA;AAC3D,EAAA,MAAM,iBAAA,GAAoB,GAAA,CAAI,UAAA,CAAW,EAAA,EAAI,OAAO,UAAU,CAAA;AAE9D,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,KAAA,MAAW,MAAM,gBAAA,EAAkB;AACjC,IAAA,IAAI,kBAAkB,GAAA,CAAI,EAAE,CAAA,EAAG,SAAA,CAAU,IAAI,EAAE,CAAA;AAAA,EACjD;AAGA,EAAA,SAAA,CAAU,GAAA,CAAI,UAAU,EAAE,CAAA;AAC1B,EAAA,SAAA,CAAU,GAAA,CAAI,WAAW,EAAE,CAAA;AAE3B,EAAA,OAAO,SAAA;AACT;;;ACjEO,SAAS,YAAA,CAAa,WAAmB,KAAA,EAAuB;AACrE,EAAA,OAAO,UAAU,CAAA,GAAI,SAAA,GAAY,CAAA,EAAG,SAAS,KAAK,KAAK,CAAA,CAAA;AACzD;;;ACQA,IAAM,UAAA,GAAa,4BAAA;AAEnB,SAAS,aAAa,CAAA,EAAmB;AACvC,EAAA,OAAO,EAAE,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAA,CAAE,OAAA,CAAQ,MAAM,KAAK,CAAA;AACrD;AAEA,SAAS,SAAS,KAAA,EAAuB;AACvC,EAAA,OAAO,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,GAAI,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,GAAK,CAAA,GAAA,EAAM,YAAA,CAAa,KAAK,CAAC,CAAA,EAAA,CAAA;AACzE;AAEA,SAAS,YAAY,CAAA,EAAmB;AACtC,EAAA,MAAM,OAAA,GAAU,EAAE,IAAA,EAAK;AACvB,EAAA,IAAI,OAAA,KAAY,EAAA,IAAM,OAAA,KAAY,UAAA,IAAc,OAAA,KAAY,eAAe,OAAA,KAAY,KAAA,EAAO,OAAO,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA,CAAA;AAChH,EAAA,MAAM,CAAA,GAAI,OAAO,OAAO,CAAA;AACxB,EAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA,GAAI,CAAA,CAAA,EAAI,YAAA,CAAa,OAAO,CAAC,CAAA,CAAA,CAAA;AACnE;AAEA,SAAS,gBAAgB,CAAA,EAAuB;AAC9C,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA;AAC5B,EAAA,QAAQ,EAAE,QAAA;AAAU,IAClB,KAAK,QAAA;AAAU,MAAA,OAAO,UAAU,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAA,CAAE,KAAe,CAAC,CAAA,CAAA,CAAA;AAAA,IACxE,KAAK,YAAA;AAAc,MAAA,OAAO,UAAU,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAA,CAAE,KAAe,CAAC,CAAA,CAAA,CAAA;AAAA,IAC5E,KAAK,UAAA;AAAY,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACpF,KAAK,cAAA;AAAgB,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,SAAA,CAAA;AAAA,IACxF,KAAK,aAAA;AAAe,MAAA,OAAO,UAAU,GAAG,CAAA,eAAA,EAAkB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACzF,KAAK,WAAA;AAAa,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACrF,KAAK,cAAA,EAAgB;AACnB,MAAA,MAAM,CAAA,GAAI,MAAA,CAAQ,CAAA,CAAE,KAAA,CAAiB,MAAM,CAAA;AAC3C,MAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,OAAO,UAAU,GAAG,CAAA,KAAA,CAAA;AAC7C,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,MAAM,CAAA,GAAI,MAAA,CAAQ,CAAA,CAAE,KAAA,CAAiB,MAAM,CAAA;AAC3C,MAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,OAAO,UAAU,GAAG,CAAA,KAAA,CAAA;AAC7C,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,UAAA;AAAY,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,YAAA,EAAe,GAAG,CAAA,OAAA,CAAA;AAAA,IACvD,KAAK,cAAA;AAAgB,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,aAAA,EAAgB,GAAG,CAAA,OAAA,CAAA;AAAA,IAC5D,KAAK,eAAA;AAAiB,MAAA,OAAO,UAAU,GAAG,CAAA,SAAA,EAAY,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACrF,KAAK,SAAA,EAAW;AAId,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,IAC7B,CAAA,CAAE,KAAA,GACF,MAAA,CAAO,CAAA,CAAE,KAAA,IAAS,EAAE,EAAE,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA;AACxE,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA,aAAA,CAAA;AAC7B,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAC,CAAC,CAAA,CAAE,CAAA;AAC1D,MAAA,OAAO,CAAA,OAAA,EAAU,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IACrC;AAAA,IACA;AAAS,MAAA,OAAO,CAAA,YAAA,CAAA;AAAA;AAEpB;AAIO,SAAS,0BAA0B,MAAA,EAI/B;AACT,EAAA,MAAM,EAAE,WAAW,OAAA,GAAU,IAAI,WAAA,GAAc,IAAG,GAAI,MAAA;AACtD,EAAA,MAAM,UAAA,GAAa,QAAQ,MAAA,GAAS,CAAA;AACpC,EAAA,MAAM,cAAA,GAAiB,YAAY,MAAA,GAAS,CAAA;AAC5C,EAAA,MAAM,UAAU,CAAC,CAAC,aAAa,SAAA,CAAU,IAAA,GAAO,MAAA,GAAS,CAAA;AAGzD,EAAA,IAAI,IAAA,GAAO,OAAA,GAAU,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA,GAAK,GAAA;AAGvC,EAAA,IAAI,cAAc,cAAA,EAAgB;AAChC,IAAA,IAAA,IAAQ,IAAA;AAAA,EACV;AAGA,EAAA,IAAI,CAAC,OAAA,IAAW,CAAC,UAAA,IAAc,CAAC,gBAAgB,OAAO,GAAA;AAEvD,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAG7B,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,CAAM,IAAA,CAAK,eAAA,CAAgB,CAAC,CAAC,CAAA;AAAA,EAC/B;AAGA,EAAA,IAAI,cAAA,EAAgB;AAClB,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,KAAM;AACpC,MAAA,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,CAAA;AAC/B,MAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,MAAA,EAAS,CAAC,CAAA,EAAA,CAAA;AAAA,IACxB,CAAC,CAAA;AACD,IAAA,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACrC;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,KAAK,CAAA;AACzB;AAiBA,SAAS,SAAS,IAAA,EAAuB;AACvC,EAAA,MAAM,SAAkB,EAAC;AACzB,EAAA,IAAI,CAAA,GAAI,CAAA;AAER,EAAA,OAAO,CAAA,GAAI,KAAK,MAAA,EAAQ;AAEtB,IAAA,IAAI,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA,EAAG;AAAE,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAExC,IAAA,MAAM,EAAA,GAAK,KAAK,CAAC,CAAA;AAGjB,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC1E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC3E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC5E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAG5E,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AAEzB,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,0BAA0B,CAAA;AACnD,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,MAAM,YAAY,KAAA,CAAM,CAAC,EAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CAAE,OAAA,CAAQ,OAAA,EAAS,IAAI,EAAE,OAAA,CAAQ,MAAA,EAAQ,IAAI,CAAA,CAAE,OAAA,CAAQ,QAAQ,GAAI,CAAA;AACjH,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,aAAA,EAAe,KAAA,EAAO,WAAW,CAAA;AACrD,QAAA,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACxB;AAEA,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA;AAClC,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,YAAA,EAAc,KAAA,EAAO,MAAM,CAAA;AAC/C,QAAA,CAAA,IAAK,CAAA;AAAG,QAAA;AAAA,MACV;AAEA,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,cAAc,CAAA;AACvC,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,cAAc,CAAA;AACrC,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA;AAC1D,QAAA,CAAA,IAAK,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACtB;AAEA,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,UAAA,EAAY,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IACtD;AAGA,IAAA,IAAI,CAAA,GAAI,CAAA,GAAI,IAAA,CAAK,MAAA,EAAQ;AACvB,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,IAAI,CAAC,CAAA;AAC/B,MAAA,IAAI,QAAQ,IAAA,IAAQ,GAAA,KAAQ,QAAQ,GAAA,KAAQ,IAAA,IAAQ,QAAQ,IAAA,EAAM;AAChE,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAG,QAAA,CAAA,IAAK,CAAA;AAAG,QAAA;AAAA,MACnD;AAAA,IACF;AACA,IAAA,IAAI,EAAA,KAAO,GAAA,IAAO,EAAA,KAAO,GAAA,EAAK;AAC5B,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,IAAI,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAC/C;AAGA,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,IAAI,CAAA,GAAI,EAAA;AACR,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,IAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,CAAC,MAAM,GAAA,EAAK;AACzC,QAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,IAAA,EAAM;AACpB,UAAA,CAAA,EAAA;AACA,UAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,UAAA,IAAI,GAAA,KAAQ,KAAK,CAAA,IAAK,GAAA;AAAA,eAAA,IACb,GAAA,KAAQ,MAAM,CAAA,IAAK,IAAA;AAAA,eAAA,IACnB,GAAA,KAAQ,KAAK,CAAA,IAAK,IAAA;AAAA,eAAA,IAClB,GAAA,KAAQ,KAAK,CAAA,IAAK,GAAA;AAAA,eACtB,CAAA,IAAK,GAAA;AAAA,QACZ,CAAA,MAAO;AACL,UAAA,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,QACb;AACA,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,IAAI,KAAK,CAAC,CAAA,KAAM,KAAK,MAAM,IAAI,MAAM,6BAA6B,CAAA;AAClE,MAAA,CAAA,EAAA;AACA,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,GAAG,CAAA;AAAG,MAAA;AAAA,IAC7C;AAGA,IAAA,IAAI,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,IAAM,EAAA,KAAO,GAAA,IAAO,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,EAAE,CAAA,EAAI;AACvE,MAAA,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAM,yCAAyC,CAAA;AACvE,MAAA,IAAI,CAAA,EAAG;AACL,QAAA,MAAM,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA;AACrB,QAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,gBAAA,EAAmB,CAAA,CAAE,CAAC,CAAC,CAAA,CAAE,CAAA;AAClE,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,GAAG,CAAA;AACxC,QAAA,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACpB;AAAA,IACF;AAGA,IAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAM,2BAA2B,CAAA;AAC3D,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,OAAO,GAAA,CAAI,CAAC,GAAG,CAAA;AAC5C,MAAA,CAAA,IAAK,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA;AAAQ,MAAA;AAAA,IACtB;AAEA,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,EAAE,CAAA,cAAA,EAAiB,CAAC,CAAA,CAAE,CAAA;AAAA,EACjE;AAEA,EAAA,OAAO,MAAA;AACT;AAsBA,IAAM,SAAN,MAAa;AAAA,EAEX,YAAoB,MAAA,EAAiB;AAAjB,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAAkB;AAAA,EAAlB,MAAA;AAAA,EADZ,GAAA,GAAM,CAAA;AAAA,EAGN,IAAA,GAA0B;AAAE,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AAAA,EAAE;AAAA,EACzD,GAAA,GAAa;AACnB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAA,EAAK,CAAA;AAChC,IAAA,IAAI,CAAC,CAAA,EAAG,MAAM,IAAI,MAAM,8BAA8B,CAAA;AACtD,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EACQ,OAAO,IAAA,EAAsB;AACnC,IAAA,MAAM,CAAA,GAAI,KAAK,GAAA,EAAI;AACnB,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,IAAA,EAAM,MAAM,IAAI,KAAA,CAAM,CAAA,SAAA,EAAY,IAAI,CAAA,MAAA,EAAS,CAAA,CAAE,IAAI,CAAA,GAAA,EAAM,CAAA,CAAE,KAAK,CAAA,EAAA,CAAI,CAAA;AACrF,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EACQ,GAAG,IAAA,EAAwB;AAAE,IAAA,OAAO,IAAA,CAAK,IAAA,EAAK,EAAG,IAAA,KAAS,IAAA;AAAA,EAAK;AAAA,EAC/D,QAAQ,CAAA,EAAoB;AAAE,IAAA,OAAO,IAAA,CAAK,MAAK,EAAG,IAAA,KAAS,WAAW,IAAA,CAAK,IAAA,IAAQ,KAAA,KAAU,CAAA;AAAA,EAAE;AAAA,EAC/F,IAAA,GAAgB;AAAE,IAAA,OAAO,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA,CAAO,MAAA;AAAA,EAAO;AAAA,EAEhE,KAAA,GAAiB;AACf,IAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAK,QAAS,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,IAAA,CAAK,MAAK,CAAG,KAAK,CAAA,cAAA,EAAiB,IAAA,CAAK,GAAG,CAAA,CAAE,CAAA;AACpG,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,SAAA,GAAqB;AAC3B,IAAA,IAAI,IAAA,GAAO,KAAK,aAAA,EAAc;AAC9B,IAAA,OAAO,IAAA,CAAK,EAAA,CAAG,MAAM,CAAA,EAAG;AACtB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,MAAM,KAAA,GAAQ,KAAK,aAAA,EAAc;AACjC,MAAA,IAAA,GAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAM;AAAA,IAClC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,aAAA,GAAyB;AAC/B,IAAA,IAAI,IAAA,GAAO,KAAK,YAAA,EAAa;AAC7B,IAAA,OAAO,KAAK,OAAA,CAAQ,KAAK,KAAK,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AAChD,MAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA;AACtB,MAAA,MAAM,KAAA,GAAQ,KAAK,YAAA,EAAa;AAChC,MAAA,IAAA,GAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,EAAA,EAAI,MAAM,KAAA,EAAM;AAAA,IACtC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,YAAA,GAAwB;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA,EAAG;AACjB,MAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA;AACtB,MAAA,MAAM,KAAA,GAAQ,KAAK,SAAA,EAAU;AAC7B,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,EAAA,EAAI,MAAM,KAAA,EAAM;AAAA,IACzC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,SAAA,GAAqB;AAE3B,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,EAAG;AAC1B,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AAEpB,MAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,MAAA,OAAO,EAAE,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AAAA,IAC7B;AAEA,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,OAAO,EAAE,GAAG,KAAA,EAAM;AAAA,IACpB;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,KAAK,eAAA,EAAgB;AAAA,IAC9B;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,EAAK,CAAG,KAAA;AAC1B,MAAA,IAAI,CAAC,YAAY,YAAA,EAAc,UAAA,EAAY,MAAM,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,EAAG;AAEjE,QAAA,IAAI,KAAK,MAAA,CAAO,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AAChD,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,MAAM,MAAA,GAAS,KAAK,GAAA,EAAI;AACxB,UAAA,IAAI,MAAA,CAAO,SAAS,QAAA,EAAU,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,IAAI,CAAA,4BAAA,CAA8B,CAAA;AACnF,UAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,UAAA,OAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,OAAO,KAAA,EAAgB;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,MAAM,KAAA,GAAQ,KAAK,aAAA,EAAc;AACjC,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,OAAO,IAAA,CAAK,GAAA,GAAM,KAAA,EAAgB;AAAA,IAC3D;AACA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,OAAO,IAAA,CAAK,GAAA,GAAM,KAAA,EAAgB;AAAA,IAC3D;AACA,IAAA,OAAO,KAAK,SAAA,EAAU;AAAA,EACxB;AAAA,EAEQ,SAAA,GAAqB;AAC3B,IAAA,IAAI,CAAC,IAAA,CAAK,EAAA,CAAG,KAAK,GAAG,MAAM,IAAI,KAAA,CAAM,CAAA,sCAAA,EAAyC,IAAA,CAAK,IAAA,EAAK,EAAG,KAAA,IAAS,KAAK,CAAA,CAAA,CAAG,CAAA;AAC5G,IAAA,IAAA,CAAK,GAAA,EAAI;AAGT,IAAA,MAAM,QAAmB,EAAC;AAG1B,IAAA,IAAI,IAAA,CAAK,GAAG,OAAO,CAAA,IAAK,CAAC,CAAC,QAAA,EAAS,KAAA,EAAM,UAAA,EAAW,YAAA,EAAa,UAAA,EAAW,QAAO,KAAA,EAAM,IAAA,EAAK,MAAA,EAAO,MAAA,EAAO,OAAO,CAAA,CAAE,SAAS,IAAA,CAAK,IAAA,EAAK,CAAG,KAAe,CAAA,EAAG;AAC3J,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC5D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,IAC7B,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC9D,CAAA,MAAO;AAEL,MAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,UAAA,EAAW;AAAA,IACjD;AAGA,IAAA,OAAO,IAAA,EAAM;AACX,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,KAAK,CAAA,EAAG;AAClB,QAAA,IAAA,CAAK,GAAA,EAAI;AACT,QAAA,IAAI,IAAA,CAAK,GAAG,OAAO,CAAA,IAAK,CAAC,CAAC,QAAA,EAAS,OAAM,UAAA,EAAW,YAAA,EAAa,YAAW,MAAA,EAAO,KAAA,EAAM,IAAI,CAAA,CAAE,QAAA,CAAS,KAAK,IAAA,EAAK,CAAG,KAAe,CAAA,EAAG;AACrI,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC5D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,UAAA,IAAA,CAAK,GAAA,EAAI;AAAG,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,QACzC,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC9D,CAAA,MAAO;AAEL,UAAA;AAAA,QACF;AAAA,MACF,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,MAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,QAAA,IAAA,CAAK,GAAA,EAAI;AAAG,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,MACzC,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,MAC9D,CAAA,MAAO;AACL,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,UAAA,EAAW;AAC/C,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,MAAM,CAAC,CAAA;AACtC,IAAA,OAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,KAAA,EAAM;AAAA,EAC5B;AAAA,EAEQ,eAAA,GAA2B;AACjC,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,MAAM,SAA4D,EAAC;AAEnE,IAAA,OAAO,CAAC,KAAK,EAAA,CAAG,QAAQ,KAAK,CAAC,IAAA,CAAK,MAAK,EAAG;AACzC,MAAA,IAAI,GAAA;AACJ,MAAA,IAAI,SAAA,GAA4B,IAAA;AAEhC,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,QAAA,GAAA,GAAM,IAAA,CAAK,KAAI,CAAE,KAAA;AACjB,QAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,SAAA,GAAY,KAAK,SAAA,EAAU;AAAA,QAC7B;AAAA,MAEF,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AAC5B,QAAA,GAAA,GAAM,IAAA,CAAK,KAAI,CAAE,KAAA;AACjB,QAAA,IAAA,CAAK,OAAO,OAAO,CAAA;AACnB,QAAA,SAAA,GAAY,KAAK,SAAA,EAAU;AAAA,MAC7B,CAAA,MAAO;AACL,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,gDAAA,EAAmD,KAAK,IAAA,EAAK,EAAG,KAAK,CAAA,CAAA,CAAG,CAAA;AAAA,MAC1F;AAEA,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,GAAA,EAAK,SAAA,EAAW,CAAA;AAC9B,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,OAAQ,GAAA,EAAI;AAAA,IACjC;AAEA,IAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,IAAA,OAAO,EAAE,CAAA,EAAG,QAAA,EAAU,MAAA,EAAO;AAAA,EAC/B;AACF,CAAA;AAKA,IAAM,OAAA,0BAAiB,SAAS,CAAA;AAIhC,SAAS,SAAS,CAAA,EAAqB;AACrC,EAAA,IAAI,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,SAAS,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,EAAI,OAAO,KAAA;AAChF,EAAA,OAAO,IAAA;AACT;AAUA,SAAS,QAAA,CAAS,IAAA,EAAe,KAAA,EAAgB,GAAA,EAAuC;AACtF,EAAA,QAAQ,KAAK,CAAA;AAAG,IACd,KAAK,UAAA;AACH,MAAA,OAAO,KAAA;AAAA,IAET,KAAK,KAAA,EAAO;AACV,MAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAClD,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,IAAA,CAAK,KAAK,CAAA,KAAA,EAAQ,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA,GAAU,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,MAC5G;AACA,MAAA,MAAM,GAAA,GAAM,KAAA;AACZ,MAAA,IAAI,EAAE,IAAA,CAAK,KAAA,IAAS,GAAA,CAAA,EAAM;AACxB,QAAA,MAAM,YAAY,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAC5C,QAAA,MAAM,IAAI,MAAM,CAAA,OAAA,EAAU,IAAA,CAAK,KAAK,CAAA,+BAAA,EAAkC,SAAA,IAAa,QAAQ,CAAA,CAAE,CAAA;AAAA,MAC/F;AACA,MAAA,OAAO,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,IACvB;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAClD,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA,GAAU,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,MAC7F;AACA,MAAA,MAAM,GAAA,GAAM,KAAA;AACZ,MAAA,IAAI,EAAE,IAAA,CAAK,GAAA,IAAO,GAAA,CAAA,EAAM;AACtB,QAAA,MAAM,YAAY,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAC5C,QAAA,MAAM,IAAI,MAAM,CAAA,OAAA,EAAU,IAAA,CAAK,GAAG,CAAA,+BAAA,EAAkC,SAAA,IAAa,QAAQ,CAAA,CAAE,CAAA;AAAA,MAC7F;AACA,MAAA,OAAO,GAAA,CAAI,KAAK,GAAG,CAAA;AAAA,IACrB;AAAA,IAEA,KAAK,OAAA,EAAS;AACZ,MAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,IAAA,CAAK,KAAK,CAAA,CAAA,CAAG,CAAA;AACzF,MAAA,MAAM,GAAA,GAAM,KAAK,KAAA,GAAQ,CAAA,GAAI,MAAM,MAAA,GAAS,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AAC9D,MAAA,OAAO,OAAO,CAAA,IAAK,GAAA,GAAM,MAAM,MAAA,GAAS,KAAA,CAAM,GAAG,CAAA,GAAI,IAAA;AAAA,IACvD;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,EAAM;AAE/C,QAAA,MAAM,GAAA,GAAM,CAAC,KAAK,CAAA;AAClB,QAAA,GAAA,CAAI,mBAAA,CAAoB,IAAI,GAAG,CAAA;AAC/B,QAAA,OAAO,GAAA;AAAA,MACT;AACA,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IACvD;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,GAAA,GAAe,KAAA;AACnB,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACzB,QAAA,MAAM,GAAA,GAAM,QAAA,CAAS,IAAA,EAAM,GAAA,EAAK,GAAG,CAAA;AAEnC,QAAA,IAAI,KAAK,CAAA,KAAM,SAAA,IAAa,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AAC9C,UAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAa,CAAA;AAE/D,UAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA;AACxC,UAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,GAAA;AACnC,UAAA,MAAM,SAAoB,EAAC;AAC3B,UAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,YAAA,MAAM,OAAA,GAAmB,SAAA,CAAU,MAAA,KAAW,CAAA,GAAI,SAAA,CAAU,CAAC,CAAA,GAAI,EAAE,CAAA,EAAG,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAU;AAC/F,YAAA,MAAM,MAAA,GAAS,QAAA,CAAS,OAAA,EAAS,IAAA,EAAM,GAAG,CAAA;AAC1C,YAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,GAAG,MAAA,CAAO,IAAA,CAAK,GAAG,MAAM,CAAA;AAAA,iBAAA,IACvC,MAAA,KAAW,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA;AAAA,UACjD;AACA,UAAA,OAAO,YAAA,CAAa,MAAA,EAAQ,aAAA,EAAe,GAAG,CAAA;AAAA,QAChD;AACA,QAAA,GAAA,GAAM,GAAA;AAAA,MACR;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,IAEA,KAAK,MAAA,EAAQ;AAEX,MAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AAG9C,MAAA,MAAM,cAAA,GAAiB,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,SAAS,GAAG,CAAA;AAE9D,MAAA,IAAI,cAAA,IAAkB,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,EAAG;AAC5C,QAAA,MAAM,gBAAA,GAAmB,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,OAAiB,CAAA;AACtE,QAAA,MAAM,UAAqB,EAAC;AAC5B,QAAA,KAAA,MAAW,QAAQ,OAAA,EAAS;AAC1B,UAAA,MAAM,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,MAAM,GAAG,CAAA;AACxC,UAAA,IAAI,MAAM,OAAA,EAAS;AACnB,UAAA,IAAI,KAAA,CAAM,QAAQ,CAAC,CAAA,IAAK,gBAAgB,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA,EAAG;AAC3D,YAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA,UACnB,CAAA,MAAA,IAAW,MAAM,OAAA,EAAS;AACxB,YAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,UAChB;AAAA,QACF;AAEA,QAAA,OAAO,YAAA,CAAa,OAAA,EAAS,gBAAA,EAAkB,GAAG,CAAA;AAAA,MACpD;AAEA,MAAA,IAAI,OAAA,KAAY,SAAS,OAAO,OAAA;AAGhC,MAAA,OAAO,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,OAAA,EAAS,GAAG,CAAA;AAAA,IAC1C;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AAI9C,MAAA,IAAI,KAAA,CAAM,QAAQ,OAAO,CAAA,IAAK,IAAI,cAAA,CAAe,GAAA,CAAI,OAAO,CAAA,EAAG;AAC7D,QAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AACvC,QAAA,OAAO,QAAA,CAAS,IAAI,CAAA,GAAI,KAAA,GAAQ,OAAA;AAAA,MAClC;AACA,MAAA,OAAO,QAAA,CAAS,OAAkB,CAAA,GAAI,KAAA,GAAQ,OAAA;AAAA,IAChD;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,CAAC,SAAS,KAAK,CAAA;AAAA,IACxB;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,SAAkC,EAAC;AACzC,MAAA,KAAA,MAAW,EAAE,GAAA,EAAK,SAAA,EAAU,IAAK,KAAK,MAAA,EAAQ;AAC5C,QAAA,IAAI,QAAA;AACJ,QAAA,IAAI,cAAc,IAAA,EAAM;AAEtB,UAAA,QAAA,GAAW,QAAA,CAAS,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,GAAA,EAAI,EAAG,OAAO,GAAG,CAAA;AAAA,QAC1D,CAAA,MAAO;AACL,UAAA,QAAA,GAAW,QAAA,CAAS,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA;AAAA,QAC3C;AACA,QAAA,IAAI,QAAA,KAAa,SAAS,OAAO,OAAA;AACjC,QAAA,MAAA,CAAO,GAAG,CAAA,GAAI,QAAA;AAAA,MAChB;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AACzC,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,OAAO,GAAG,CAAA;AAC1C,MAAA,QAAQ,KAAK,EAAA;AAAI,QACf,KAAK,IAAA;AAAM,UAAA,OAAO,EAAA,KAAO,EAAA;AAAA,QACzB,KAAK,IAAA;AAAM,UAAA,OAAO,EAAA,KAAO,EAAA;AAAA,QACzB,KAAK,GAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,KAAK,EAAA,GAAK,KAAA;AAAA,QAC/E,KAAK,GAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,KAAK,EAAA,GAAK,KAAA;AAAA,QAC/E,KAAK,IAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA;AAAA,QAChF,KAAK,IAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA;AAAA,QAChF;AAAW,UAAA,OAAO,KAAA;AAAA;AACpB,IACF;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AACzC,MAAA,IAAI,IAAA,CAAK,OAAO,KAAA,EAAO;AACrB,QAAA,IAAI,CAAC,QAAA,CAAS,EAAa,CAAA,EAAG,OAAO,KAAA;AACrC,QAAA,OAAO,SAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,GAAG,CAAY,CAAA;AAAA,MAC7D,CAAA,MAAO;AACL,QAAA,IAAI,QAAA,CAAS,EAAa,CAAA,EAAG,OAAO,IAAA;AACpC,QAAA,OAAO,SAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,GAAG,CAAY,CAAA;AAAA,MAC7D;AAAA,IACF;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,OAAO,UAAU,QAAA,EAAU,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,0BAAA,CAA4B,CAAA;AACvF,MAAA,QAAQ,KAAK,IAAA;AAAM,QACjB,KAAK,UAAA;AAAc,UAAA,OAAO,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,QACjD,KAAK,YAAA;AAAc,UAAA,OAAO,KAAA,CAAM,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA;AAAA,QACnD,KAAK,UAAA;AAAc,UAAA,OAAO,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,QACjD,KAAK,MAAA,EAAQ;AACX,UAAA,IAAI,EAAA,GAAK,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,KAAK,GAAG,CAAA;AACpC,UAAA,IAAI,CAAC,EAAA,EAAI;AACP,YAAA,IAAI,0BAAA,CAA2B,IAAA,CAAK,IAAA,CAAK,GAAG,CAAA,EAAG;AAC7C,cAAA,MAAM,IAAI,MAAM,2DAAsD,CAAA;AAAA,YACxE;AACA,YAAA,EAAA,GAAK,IAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AACxB,YAAA,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,GAAA,EAAK,EAAE,CAAA;AAAA,UACjC;AACA,UAAA,OAAO,GAAG,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,GAAM,CAAC,CAAA;AAAA,QACvC;AAAA,QACA;AAAS,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,IAAA,CAAK,IAAI,CAAA,CAAE,CAAA;AAAA;AAC3D,IACF;AAAA,IAEA,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IAEd,SAAS;AAEP,MAAA,MAAM,IAAI,MAAM,CAAA,gBAAA,CAAkB,CAAA;AAAA,IACpC;AAAA;AAEJ;AAMA,SAAS,YAAA,CAAa,GAAA,EAAgB,aAAA,EAAwB,GAAA,EAAyB;AACrF,EAAA,GAAA,CAAI,cAAA,CAAe,IAAI,GAAG,CAAA;AAC1B,EAAA,IAAI,aAAA,EAAe,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAG,CAAA;AAClD,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,eAAA,CAAgB,IAAA,EAAe,GAAA,EAAc,GAAA,EAAuB;AAC3E,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,GAAG,OAAO,KAAA;AAEhC,EAAA,IAAI,IAAA,CAAK,CAAA,KAAM,SAAA,EAAW,OAAO,IAAA;AAEjC,EAAA,IAAI,IAAA,CAAK,MAAM,MAAA,EAAQ;AACrB,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,SAAS,CAAC,CAAA;AAC7C,IAAA,IAAI,IAAA,EAAM,CAAA,KAAM,SAAA,EAAW,OAAO,IAAA;AAAA,EACpC;AAEA,EAAA,IAAI,KAAK,CAAA,KAAM,MAAA,SAAe,GAAA,CAAI,cAAA,CAAe,IAAI,GAAa,CAAA;AAElE,EAAA,OAAO,GAAA,CAAI,cAAA,CAAe,GAAA,CAAI,GAAa,CAAA;AAC7C;AAIO,SAAS,iBAAiB,KAAA,EAA0B;AACzD,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAA,GAAW,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AACzC,IAAA,OAAO,CAAC,OAAO,KAAA,KAAU,QAAA,GAAW,QAAQ,IAAA,CAAK,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,EACnE;AACA,EAAA,OAAO,EAAC;AACV;AAEO,SAAS,sBAAA,CAAuB,OAAgB,UAAA,EAAoC;AACzF,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,GAAS,SAAS,UAAU,CAAA;AAClC,IAAA,MAAM,GAAA,GAAM,IAAI,MAAA,CAAO,MAAM,EAAE,KAAA,EAAM;AACrC,IAAA,MAAM,GAAA,GAAe;AAAA,MACnB,cAAA,sBAAoB,OAAA,EAAQ;AAAA,MAC5B,mBAAA,sBAAyB,OAAA,EAAQ;AAAA,MACjC,UAAA,sBAAgB,GAAA;AAAI,KACtB;AACA,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,GAAA,EAAK,KAAA,EAAO,GAAG,CAAA;AAGpC,IAAA,IAAI,KAAA,CAAM,QAAQ,GAAG,CAAA,IAAK,gBAAgB,GAAA,EAAK,GAAA,EAAK,GAAG,CAAA,EAAG;AAGxD,MAAA,MAAM,YAAA,GAAe,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAa,CAAA;AAC9D,MAAA,IAAI,YAAA,EAAc;AAChB,QAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAO,IAAA,EAAK;AACrD,QAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,EAAO,GAAA,CAAI,CAAC,CAAA,EAAE;AAAA,MACzD;AACA,MAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,EAAC,EAAE;AACnD,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAA,EAAI;AAAA,IAChC;AAEA,IAAA,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,EAAO,QAAQ,OAAA,GAAU,KAAK,GAAA,EAAI;AAAA,EACvD,SAAS,GAAA,EAAK;AACZ,IAAA,MAAM,MAAM,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC3D,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAA,EAAI;AAAA,EACjC;AACF;;;ACztBO,IAAM,qBAAA,uBAA4B,GAAA,CAAI;AAAA,EAC3C,gBAAA;AAAA,EAAkB,YAAA;AAAA,EAAc,gBAAA;AAAA,EAChC,gBAAA;AAAA,EAAkB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EACpC,gBAAA;AAAA,EAAkB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EAAiB,kBAAA;AAAA,EACrD,WAAA;AAAA,EAAa,UAAA;AAAA,EAAY,iBAAA;AAAA,EACzB,eAAA;AAAA,EAAiB,YAAA;AAAA,EAAc,aAAA;AAAA,EAAe,aAAA;AAAA,EAC9C,UAAA;AAAA,EAAY,iBAAA;AAAA,EACZ,iBAAA;AAAA,EAAmB,cAAA;AAAA,EACnB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EAAiB,gBAAA;AAAA,EAAkB,UAAA;AAAA,EAAY,iBAAA;AAAA,EACjE,eAAA;AAAA,EAAiB,SAAA;AAAA,EAAW,aAAA;AAAA,EAAe,cAAA;AAAA,EAC3C;AACF,CAAC;AAIM,IAAM,kBAAA,GAAqB;AAM3B,IAAM,2BAAA,GAA8B;AAC3C,IAAM,2BAAA,GAA8B,IAAA;AAE7B,SAAS,mBAAmB,QAAA,EAA0B;AAC3D,EAAA,OAAO,CAAA,EAAG,2BAA2B,CAAA,EAAG,QAAQ,GAAG,2BAA2B,CAAA,CAAA;AAChF;AAEO,SAAS,mBAAmB,IAAA,EAAkC;AACnE,EAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,2BAA2B,GAAG,OAAO,MAAA;AAC1D,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,2BAA2B,GAAG,OAAO,MAAA;AACxD,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AAAA,IACjB,2BAAA,CAA4B,MAAA;AAAA,IAC5B,IAAA,CAAK,SAAS,2BAAA,CAA4B;AAAA,GAC5C;AACA,EAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,KAAA,GAAQ,MAAA;AACpC;AAGO,SAAS,wBAAwB,QAAA,EAA2C;AACjF,EAAA,MAAM,MAAM,QAAA,CAAS,WAAA;AACrB,EAAA,IAAI,CAAC,GAAA,IAAO,GAAA,IAAO,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAM,GAAG,CAAA,EAAG,CAAC,CAAA,EAAG,EAAE,CAAA;AAClD;AAIA,SAAS,sBAAsB,QAAA,EAAkE;AAC/F,EAAA,MAAM,MAAM,QAAA,CAAS,SAAA;AACrB,EAAA,IAAI,CAAC,GAAA,IAAO,GAAA,CAAI,MAAA,GAAS,GAAG,OAAO,MAAA;AACnC,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,KAAmB,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AACpF,EAAA,OAAO,OAAA,CAAQ,MAAA,IAAU,CAAA,GAAI,OAAA,GAAU,MAAA;AACzC;AAYO,SAAS,qBAAA,CACd,SAAA,EACA,QAAA,EACA,QAAA,EACiB;AACjB,EAAA,MAAM,cAAc,qBAAA,CAAsB,GAAA,CAAI,QAAQ,CAAA,GAClD,uBAAA,CAAwB,QAAQ,CAAA,GAChC,CAAA;AAEJ,EAAA,IAAI,SAAA,IAAa,SAAA,CAAU,MAAA,GAAS,CAAA,EAAG;AACrC,IAAA,MAAM,QAAA,GAAW,WAAA,GAAc,CAAA,GAC3B,SAAA,CAAU,OAAA,CAAQ,CAAA,IAAA,KAAQ,KAAA,CAAM,WAAW,CAAA,CAAE,IAAA,CAAK,IAAI,CAAa,CAAA,GACnE,SAAA;AACJ,IAAA,OAAO,QAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,sBAAsB,QAAQ,CAAA;AAChD,EAAA,IAAI,SAAA,EAAW;AAGb,IAAA,OAAO,SAAA,CAAU,OAAA;AAAA,MAAQ,CAAA,CAAA,KACvB,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,WAAA,EAAa,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,kBAAA,CAAmB,CAAC,CAAC;AAAA,KAC5D;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,CAAA,EAAG;AACnB,IAAA,OAAO,KAAA,CAAM,WAAW,CAAA,CAAE,IAAA,CAAK,kBAAkB,CAAA;AAAA,EACnD;AAEA,EAAA,OAAO,IAAA;AACT;;;ACxDA,IAAM,4BAAA,GAAkF;AAAA,EACtF,QAAA,EAAU,GAAA;AAAA,EACV,eAAA,EAAiB,GAAA;AAAA,EACjB,MAAA,EAAQ,CAAC,WAAW,CAAA;AAAA,EACpB,YAAY,CAAC,cAAA,EAAgB,aAAa,WAAA,EAAa,eAAA,EAAiB,gBAAgB,gBAAgB,CAAA;AAAA,EACxG,GAAA,EAAK,CAAC,WAAA,EAAa,eAAA,EAAiB,cAAc,CAAA;AAAA;AAAA,EAElD,MAAA,EAAQ,CAAC,cAAc,CAAA;AAAA,EACvB,OAAA,EAAS,CAAC,WAAW,CAAA;AAAA,EACrB,OAAA,EAAS,CAAC,WAAW,CAAA;AAAA;AAAA,EAErB,UAAA,EAAY,CAAC,eAAe,CAAA;AAAA,EAC5B,MAAA,EAAQ,CAAC,eAAe,CAAA;AAAA,EACxB,SAAA,EAAW,CAAC,eAAe,CAAA;AAAA,EAC3B,WAAA,EAAa,CAAC,cAAc,CAAA;AAAA,EAC5B,UAAA,EAAY,CAAC,WAAW,CAAA;AAAA;AAAA;AAAA;AAAA,EAIxB,IAAA,EAAM,CAAC,gBAAgB;AACzB,CAAA;AASO,IAAM,qBAAA,GAA2E,qBAAA,CAAsB,4BAAA,EAA8B,mBAAA,EAAqB;AAEjK,SAAS,qBAAA,CACP,QACA,IAAA,EACyC;AACzC,EAAA,MAAM,GAAA,GAA+C,EAAE,GAAG,MAAA,EAAO;AACjE,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,OAAO,CAAA,IAAK,IAAA,EAAM;AAClC,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAE5B,MAAA,IAAI,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,iCAAA,EAAoC,IAAI,CAAA,QAAA,EAAW,MAAM,CAAA,uCAAA,CAAyC,CAAA;AACvI,MAAA,GAAA,CAAI,IAAI,MAAM,CAAA;AACd,MAAA,MAAM,KAAA,GAAQ,OAAO,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA,GAAI,GAAA,CAAI,MAAM,CAAA,GAAI,EAAC;AAC1D,MAAA,IAAI,UAAU,GAAA,EAAK;AAInB,MAAA,IAAI,KAAA,CAAM,QAAA,CAAS,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,uBAAA,EAA0B,IAAI,CAAA,gBAAA,EAAmB,MAAM,CAAA,kEAAA,CAA+D,CAAA;AAChK,MAAA,GAAA,CAAI,MAAM,CAAA,GAAI,CAAC,GAAG,OAAO,IAAI,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,qBAAA,CAAsB,UAAqC,YAAA,EAAkD;AAC3H,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,MAAA,CAAO,qBAAA,EAAuB,YAAA,IAAgB,EAAE,CAAA,GAAI,qBAAA,CAAsB,YAAA,IAAgB,EAAE,CAAA,GAAI,MAAA;AACrH,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,IAAA;AAChC,EAAA,OAAO,UAAU,GAAA,IAAO,CAAC,KAAA,CAAM,QAAA,CAAS,YAAY,EAAE,CAAA;AACxD;AAEA,IAAM,OAAA,GAAU,CAAC,CAAA,KAAwB,OAAO,MAAM,QAAA,IAAY,CAAA,CAAE,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AAO/E,SAAS,gBAAgB,OAAA,EAAuE;AACrG,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,OAAA,CAAQ,OAAA,CAAQ,CAAC,KAAA,EAAO,GAAA,KAAQ;AAC9B,IAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AACpB,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,IAAA,UAAA,CAAW,KAAK,GAAG,CAAA;AAAA,EACrB,CAAC,CAAA;AACD,EAAA,OAAO,EAAE,OAAO,UAAA,EAAW;AAC7B;AA6BO,SAAS,WAAA,CACd,IAAA,EACA,IAAA,EACA,SAAA,EACa;AACb,EAAA,IAAI,KAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,MAAM,YAAA,EAAa;AACnD,EAAA,MAAM,IAAA,GAAO,MAAM,UAAA,IAAc,MAAA;AACjC,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,KAA0C,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,EAAE,IAAA,EAAM,OAAA,EAAS,OAAO,GAAA,EAAK;AACvH,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,IAAA,EAAM,SAAA,IAAa,GAAA,EAAK,IAAA,CAAK,MAAM,CAAC,CAAC,CAAA;AACxF,EAAA,IAAI,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,SAAU,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,EAAG,EAAE,CAAC,CAAC,CAAA;AAC3E,EAAA,IAAI,IAAA,KAAS,UAAU,SAAA,IAAa,uBAAA,CAAwB,IAAI,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,YAAA,EAAa;AAC/F,EAAA,MAAM,IAAA,GAAO,gBAAgB,eAAA,CAAgB,CAAC,GAAG,IAAI,CAAA,EAAG,IAAI,CAAC,CAAA,CAAE,KAAA;AAC/D,EAAA,OAAO,IAAA,CAAK,MAAA,GAAS,CAAA,GAAI,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,CAAC,CAAA,EAAG,GAAI,EAAE,MAAM,MAAA,EAAO;AAC/E;AAOO,SAAS,aAAA,CAAc,MAAwD,QAAA,EAA4B;AAChH,EAAA,OAAO,IAAA,CACJ,MAAA,CAAO,CAAC,GAAA,KAAQ,GAAA,CAAI,IAAA,CAAK,CAAC,IAAA,KAAS,CAAC,OAAA,CAAQ,IAAI,CAAC,CAAC,CAAA,CAClD,GAAA,CAAI,CAAC,GAAA,KAAS,OAAO,GAAA,CAAI,QAAQ,CAAA,KAAM,QAAA,GAAY,GAAA,CAAI,QAAQ,CAAA,CAAa,IAAA,EAAK,GAAI,EAAG,CAAA;AAC7F;AAgCO,SAAS,iBAAA,CACd,YACA,QAAA,EACwB;AACxB,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AACpC,EAAA,MAAM,OAAO,CAAC,CAAA,KAAS,gBAAgB,CAAA,CAAE,OAAO,EAAE,KAAA,CAAM,MAAA;AACxD,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,MAAA,CAAO,CAAC,IAAA,EAAM,CAAA,KAAO,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAI,IAAK,CAAA;AAChF,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,OAAA,CAAQ,MAAA,KAAW,OAAA,CAAQ,OAAA,CAAQ,MAAM,CAAA;AAClF,EAAA,MAAM,WAAA,GAAc,CAAC,CAAA,KAAS,qBAAA,CAAsB,QAAA,EAAU,CAAA,CAAE,YAAY,CAAA,IAAK,UAAA,CAAW,CAAA,CAAE,OAAA,EAAS,QAAA,EAAU,EAAE,YAAY,CAAA;AAC/H,EAAA,MAAM,MAAA,GAAS,YAAY,OAAO,CAAA,GAAI,UAAW,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA,IAAK,OAAA;AAC5E,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,KAAA,IAAS,MAAM,CAAA,EAAG,GAAA,GAAM,OAAA,CAAQ,OAAA,CAAQ,QAAQ,GAAA,EAAA,EAAO;AACrD,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,CAAA,CAAE,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAA,EAAG,UAAA,CAAW,KAAK,GAAG,CAAA;AAAA,EACtE;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,UAAA,CAAW,GAAA,CAAI,CAAC,QAAS,OAAA,CAAQ,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAC,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAE,CAAA;AAAA,IACxF,UAAA;AAAA,IACA,cAAc,MAAA,CAAO;AAAA,GACvB;AACF;AAOO,SAAS,gBAAgB,IAAA,EAAuB;AACrD,EAAA,MAAM,CAAA,GAAI,KAAK,IAAA,EAAK;AAKpB,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,KAAK,CAAC,CAAA,IAAK,CAAA,CAAE,UAAA,CAAW,GAAG,CAAA,IAAK,CAAA,CAAE,UAAA,CAAW,GAAG,GAAG,OAAO,KAAA;AACrF,EAAA,OAAO,EAAE,UAAA,CAAW,MAAM,CAAA,IAAK,2DAAA,CAA4D,KAAK,CAAC,CAAA;AACnG;AAQA,IAAM,sBAAA,GAAsE;AAAA,EAC1E,kBAAA,EAAoB,CAAC,IAAI;AAC3B,CAAA;AAGO,SAAS,mBAAA,CAAoB,UAAqC,YAAA,EAAkD;AACzH,EAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,QAAA,IAAY,EAAE,CAAA;AACnD,EAAA,OAAO,KAAA,KAAU,MAAA,IAAa,KAAA,CAAM,QAAA,CAAS,gBAAgB,EAAE,CAAA;AACjE;AAKA,SAAS,UAAA,CAAW,OAAA,EAA4B,QAAA,EAA0B,YAAA,EAAuC;AAC/G,EAAA,MAAM,KAAA,GAAQ,QAAQ,IAAA,CAAK,CAAC,MAAM,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAChC,EAAA,OAAO,CAAC,eAAA,CAAgB,KAAK,CAAA,IAAK,mBAAA,CAAoB,UAAU,YAAY,CAAA;AAC9E;AA6BO,SAAS,UAAA,CACd,MAAA,EACA,QAAA,EACA,QAAA,EACmB;AACnB,EAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,MAAA,EAAQ,KAAA,EAAO,UAAU,QAAQ,CAAA;AACrE,EAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AACnB,EAAA,MAAM,UAAA,GAAa,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAM,MAAA,GAAS,CAAA;AACjE,EAAA,IAAI,CAAC,UAAA,EAAY,OAAO,EAAE,KAAA,EAAO,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,MAAM,MAAS,CAAA,EAAG,YAAA,EAAc,MAAA,EAAU;AAC3F,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,MAAA;AAC3C,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA;AAAA,IACnE,cAAc,MAAA,CAAO;AAAA,GACvB;AACF;AASO,SAAS,gBAAA,CAAiB,OAAgB,IAAA,EAAoC;AACnF,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,KAAK,KAAK,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,MAAA;AACxD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,WAAW,KAAA,EAAO;AAC3B,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,OAAA,EAAS,IAAI,CAAA;AAC5C,IAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,OAAO,MAAA;AAC7B,IAAA,GAAA,CAAI,KAAK,oBAAA,CAAqB,KAAK,CAAA,CAAE,CAAC,KAAK,EAAE,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA,CAAI,KAAK,CAAC,CAAA,KAAM,EAAE,MAAA,GAAS,CAAC,IAAI,GAAA,GAAM,MAAA;AAC/C;;;AC7TA,eAAsB,gBAAA,CACpB,KAAA,EACA,KAAA,EACA,YAAA,EACoC;AACpC,EAAA,MAAM,OAAA,GAAqC,IAAI,KAAA,CAAM,KAAA,CAAM,MAAM,CAAA;AACjE,EAAA,IAAI,SAAA,GAAY,CAAA;AAEhB,EAAA,MAAM,cAAA,GAAiB,IAAI,KAAA,CAAM,qBAAqB,CAAA;AAEtD,EAAA,eAAe,MAAA,GAAwB;AACrC,IAAA,OAAO,SAAA,GAAY,MAAM,MAAA,EAAQ;AAC/B,MAAA,IAAI,cAAc,SAAA,EAAW;AAC7B,MAAA,MAAM,GAAA,GAAM,SAAA,EAAA;AACZ,MAAA,IAAI;AACF,QAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,CAAM,GAAG,CAAA,EAAE;AAC/B,QAAA,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,MAAA,EAAQ,aAAa,KAAA,EAAM;AAAA,MAC9C,SAAS,MAAA,EAAQ;AACf,QAAA,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,MAAA,EAAQ,YAAY,MAAA,EAAO;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,UAAU,KAAA,CAAM,IAAA;AAAA,IACpB,EAAE,MAAA,EAAQ,IAAA,CAAK,IAAI,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA,EAAE;AAAA,IACxC,MAAM,MAAA;AAAO,GACf;AACA,EAAA,MAAM,OAAA,CAAQ,IAAI,OAAO,CAAA;AAGzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,IAAA,IAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAA,GAAI,EAAE,MAAA,EAAQ,UAAA,EAAY,MAAA,EAAQ,cAAA,EAAe;AAAA,EAC7E;AAEA,EAAA,OAAO,OAAA;AACT;;;ACpCO,IAAM,kBAAA,GAAqB;AAc3B,SAAS,oBAAA,CACd,MACA,OAAA,EACU;AACV,EAAA,MAAM,YAAA,GAAA,CAAgB,OAAA,IAAW,EAAC,EAAG,IAAA,CAAK,CAAC,CAAA,KAAA,CAAO,CAAA,CAAE,IAAA,IAAQ,MAAA,MAAY,MAAM,CAAA;AAC9E,EAAA,MAAM,MAAM,YAAA,EAAc,cAAA;AAC1B,EAAA,IAAI,QAAQ,kBAAA,EAAoB;AAC9B,IAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,IAAA,OAAO,QAAQ,MAAA,GAAS,CAAA,GAAI,CAAC,OAAO,IAAI,EAAC;AAAA,EAC3C;AACA,EAAA,MAAM,YAAY,GAAA,IAAO,IAAA;AACzB,EAAA,OAAO,KAAK,KAAA,CAAM,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC9E;AAQO,SAAS,oBACd,IAAA,EACA,QAAA,EACA,UACA,UAAA,EACA,SAAA,EACA,aACA,QAAA,EACoE;AACpE,EAAA,MAAM,QAAQ,UAAA,CAAW,KAAA,CAAM,SAAS,CAAA,CAAE,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACzF,EAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AAErB,IAAA,MAAMA,QAAAA,GAAU,KAAK,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;AACtC,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAGA,QAAAA,CAAQ,QAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA;AAC7D,IAAA,OAAO,EAAE,OAAA,EAAAA,QAAAA,EAAS,WAAW,KAAA,EAAO,aAAA,EAAeA,SAAQ,MAAA,EAAO;AAAA,EACpE;AAEA,EAAA,MAAM,OAAA,GAAU,KAAK,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;AACtC,EAAA,OAAA,CAAQ,QAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,MAAM,CAAC,CAAA;AACrC,EAAA,MAAM,aAAa,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS;AAC9C,IAAA,MAAM,CAAA,GAAI,MAAM,IAAA,CAAa,EAAE,QAAQ,WAAA,EAAa,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA;AAC7D,IAAA,CAAA,CAAE,QAAQ,CAAA,GAAI,IAAA;AACd,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,OAAA,CAAQ,MAAA,CAAO,QAAA,GAAW,CAAA,EAAG,CAAA,EAAG,GAAG,UAAU,CAAA;AAE7C,EAAA,MAAM,SAAA,GAAY,QAAQ,MAAA,GAAS,QAAA;AACnC,EAAA,MAAM,gBAAgB,OAAA,CAAQ,MAAA;AAC9B,EAAA,OAAO;AAAA,IACL,SAAS,SAAA,GAAY,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,GAAI,OAAA;AAAA,IAClD,SAAA;AAAA,IACA;AAAA,GACF;AACF;;;ACvEO,IAAM,uBAAA,GAA0B;AAOhC,SAAS,oBAAoB,IAAA,EAA2C;AAC7E,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,EAAC;AACnB,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,uBAAuB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AACrF,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,OAAO,KAAA;AAC7B,EAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,EAAA,OAAO,OAAA,GAAU,CAAC,OAAO,CAAA,GAAI,EAAC;AAChC;;;ACTO,IAAM,iBAAA,GAAoB;AAAA,EAC/B,SAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF;AAIA,IAAM,SAAA,GAAoC;AAAA,EACxC,OAAA,EAAS,IAAA;AAAA,EACT,gBAAA,EAAkB,MAAA;AAAA,EAClB,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO;AACT,CAAA;AAEA,IAAM,WAAA,GAAsC;AAAA,EAC1C,GAAG,SAAA;AAAA,EACH,KAAA,EAAO;AACT,CAAA;AAGO,IAAM,iBAAA,GAA4C;AAAA,EACvD,OAAA,EAAS,KAAA;AAAA,EACT,gBAAA,EAAkB,QAAA;AAAA,EAClB,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,OAAA;AAAA,EACP,KAAA,EAAO;AACT;AAaO,SAAS,gBAAA,CACd,GAAA,EACA,eAAA,EACA,IAAA,EACQ;AACR,EAAA,MAAM,IAAI,GAAA,IAAO,SAAA;AACjB,EAAA,IAAI,CAAA,KAAM,QAAA,EAAU,OAAO,eAAA,IAAmB,EAAA;AAC9C,EAAA,MAAM,GAAA,GAAM,IAAA,EAAM,cAAA,GAAiB,WAAA,GAAc,SAAA;AACjD,EAAA,OAAO,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACnB;;;ACrCA,IAAM,YAAA,GAAe,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,EAAW;AAAA,EAChD,WAAA,EAAa,MAAA;AAAA,EACb,OAAA,EAAS;AACX,CAAC,CAAA;AAQD,SAAS,aAAA,CAAc,MAAc,KAAA,EAAwB;AAC3D,EAAA,IAAI,KAAA,KAAU,IAAI,OAAO,IAAA;AACzB,EAAA,MAAM,MAAA,GAAS,aAAa,IAAI,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,gBAAA,CAAiB,MAAA,EAAQ,KAAK,CAAA;AAC9C,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,GAAI,MAAA;AAC3C;AAEA,SAAS,UAAU,CAAA,EAAqB;AACtC,EAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,IAAA,EAAM,OAAO,IAAA;AAC1C,EAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,EAAE,IAAA,EAAK,KAAM,IAAI,OAAO,IAAA;AACrD,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,YAAY,CAAA,EAAgC;AACnD,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU,OAAO,OAAO,QAAA,CAAS,CAAC,IAAI,CAAA,GAAI,MAAA;AAC3D,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,MAAA;AAC3B,IAAA,MAAM,CAAA,GAAI,OAAO,OAAO,CAAA;AACxB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,UAAU,CAAA,EAAgC;AACjD,EAAA,IAAI,aAAa,IAAA,EAAM;AACrB,IAAA,MAAM,CAAA,GAAI,EAAE,OAAA,EAAQ;AACpB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU,OAAO,OAAO,QAAA,CAAS,CAAC,IAAI,CAAA,GAAI,MAAA;AAC3D,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACtB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,SAAA,CAAU,KAAc,QAAA,EAAwD;AACvF,EAAA,IAAI,SAAA,CAAU,GAAG,CAAA,EAAG,OAAO,EAAE,GAAA,EAAK,EAAA,EAAI,SAAS,SAAA,EAAU;AAEzD,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,MAAM,CAAA,GAAI,YAAY,GAAG,CAAA;AACzB,IAAA,OAAO,CAAA,KAAM,MAAA,GACT,EAAE,GAAA,EAAK,EAAA,EAAI,OAAA,EAAS,SAAA,EAAU,GAC9B,EAAE,GAAA,EAAK,CAAA,EAAG,OAAA,EAAS,QAAA,EAAS;AAAA,EAClC;AAEA,EAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,IAAA,MAAM,CAAA,GAAI,UAAU,GAAG,CAAA;AACvB,IAAA,OAAO,CAAA,KAAM,MAAA,GACT,EAAE,GAAA,EAAK,EAAA,EAAI,OAAA,EAAS,SAAA,EAAU,GAC9B,EAAE,GAAA,EAAK,CAAA,EAAG,OAAA,EAAS,QAAA,EAAS;AAAA,EAClC;AAEA,EAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,IAAA,OAAO,EAAE,GAAA,EAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,OAAA,EAAS,MAAA,EAAO;AAAA,EACrF;AAGA,EAAA,MAAM,KAAA,GAAQ,YAAY,GAAG,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW,OAAO,EAAE,GAAA,EAAK,KAAA,EAAO,SAAS,QAAA,EAAS;AAChE,EAAA,MAAM,MAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,EAAA,IAAI,WAAW,MAAA,EAAW,OAAO,EAAE,GAAA,EAAK,MAAA,EAAQ,SAAS,QAAA,EAAS;AAClE,EAAA,OAAO,EAAE,GAAA,EAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,OAAA,EAAS,MAAA,EAAO;AACrF;AAEO,SAAS,aAAA,CAAc,OAA0B,IAAA,EAAiC;AACvF,EAAA,MAAM,EAAE,KAAA,EAAO,QAAA,EAAU,SAAA,EAAU,GAAI,IAAA;AACvC,EAAA,MAAM,KAAA,GAAqB,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC7C,IAAA,MAAM,GAAA,GAAM,aAAA,CAAc,IAAA,EAAM,KAAK,CAAA;AACrC,IAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,SAAA,CAAU,KAAK,QAAQ,CAAA;AAChD,IAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,OAAA,EAAQ;AAAA,EAC9B,CAAC,CAAA;AAED,EAAA,MAAM,WAAW,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,YAAY,SAAS,CAAA;AAC5D,EAAA,MAAM,UAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,YAAY,SAAS,CAAA;AAE3D,EAAA,MAAM,MAAA,GAAS,SAAA,KAAc,MAAA,GAAS,EAAA,GAAK,CAAA;AAG3C,EAAA,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,IAAA,IAAI,CAAA,CAAE,OAAA,KAAY,QAAA,IAAY,CAAA,CAAE,YAAY,QAAA,EAAU;AACpD,MAAA,OAAA,CAAS,CAAA,CAAE,GAAA,GAAkB,CAAA,CAAE,GAAA,IAAkB,MAAA;AAAA,IACnD;AACA,IAAA,OAAO,YAAA,CAAa,OAAA,CAAQ,MAAA,CAAO,CAAA,CAAE,GAAG,GAAG,MAAA,CAAO,CAAA,CAAE,GAAG,CAAC,CAAA,GAAI,MAAA;AAAA,EAC9D,CAAC,CAAA;AAED,EAAA,OAAO,CAAC,GAAG,QAAA,CAAS,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,IAAI,CAAA,EAAG,GAAG,QAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACvE;;;AClHO,IAAM,0BAAA,GAA6B;AACnC,IAAM,yBAAA,GAA4B;AAClC,IAAM,0BAAA,GAA6B;AAEnC,IAAM,kCAAA,GAAqC;AAE3C,IAAM,4BAAA,uBAAwD,GAAA,CAAI;AAAA,EACvE,0BAAA;AAAA,EACA,yBAAA;AAAA,EACA,0BAAA;AAAA,EACA;AACF,CAAC;AAEM,SAAS,2BAA2B,IAAA,EAA+B;AACxE,EAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,4BAAA,CAA6B,IAAI,IAAI,CAAA;AAC1E;;;ACeO,IAAM,sBAAsB,CAAC,SAAA,EAAW,SAAS,MAAA,EAAQ,OAAA,EAAS,UAAU,MAAM;AA6BlF,IAAM,qBAAA,GAAwG;AAAA,EACnH,OAAA,EAAS,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACf,KAAA,EAAO,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACb,IAAA,EAAM,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACZ,KAAA,EAAO,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACb,MAAA,EAAQ,CAAC,CAAA,EAAG,EAAE;AAChB;AAMA,SAAS,IAAI,KAAA,EAA+B;AAC1C,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAChF,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,SAAA,CAAU,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,QAAA,CAAS,KAAA,CAAM,IAAA,IAAQ,EAAE,CAAA;AAC/F,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,KAAA,CAAM,KAAA,EAAsB,EAAA,EAAY,EAAA,EAAY,QAAA,EAA0B;AACrF,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,QAAA;AAC3B,EAAA,OAAO,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,CAAC,CAAA;AACzC;AAGA,SAAS,YAAY,KAAA,EAA+B;AAClD,EAAA,MAAM,CAAA,GAAI,IAAI,KAAK,CAAA;AACnB,EAAA,OAAO,CAAA,KAAM,IAAA,IAAQ,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,IAAA;AACpC;AAGO,SAAS,iBAAiB,KAAA,EAAiC;AAChE,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,CAAE,MAAA,KAAW,CAAA;AAC3F;AAQO,SAAS,qBAAA,CAAsB,GAAA,EAAc,UAAA,GAAa,QAAA,EAA+B;AAC9F,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;AAC5C,EAAA,MAAM,CAAA,GAAI,GAAA;AACV,EAAA,IAAI,OAAO,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,CAAE,oBAA0C,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA,EAAG,OAAO,IAAA;AACvG,EAAA,MAAM,OAAO,CAAA,CAAE,IAAA;AACf,EAAA,MAAM,EAAA,GAAK,OAAO,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,CAAG,IAAA,EAAK,GAAI,CAAA,CAAE,EAAA,CAAG,IAAA,EAAK,GAAI,UAAA;AACnE,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC,CAAA;AAC5C,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC,CAAA;AACxC,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,OAAA,EAAS,CAAC,CAAA,EAAE;AAAA,IAC5F,KAAK,OAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,KAAA,EAAO,CAAC,GAAG,MAAA,EAAO;AAAA,IAClG,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,IAAA,EAAM,CAAC,CAAA,EAAG,MAAM,MAAA,EAAO;AAAA,IACvG,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,QAAA,GAAW,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GACrC,CAAC,GAAG,IAAI,IAAI,CAAA,CAAE,QAAA,CAAS,GAAA,CAAI,GAAG,EAAE,MAAA,CAAO,CAAC,CAAA,KAAmB,CAAA,KAAM,IAAA,IAAQ,CAAA,IAAK,CAAA,IAAK,CAAA,IAAK,CAAC,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,IACjH,EAAC;AACL,MAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAClC,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,YAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,sBAAsB,KAAA,EAAO,CAAC,CAAA,EAAG,IAAA,EAAM,QAAQ,QAAA,EAAS;AAAA,IAClH;AAAA,IACA,KAAK,QAAA;AACH,MAAA,OAAO;AAAA,QACL,EAAA;AAAA,QACA,IAAA;AAAA,QACA,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,MAAA,EAAQ,CAAC,CAAA;AAAA,QACpE,IAAA;AAAA,QACA,MAAA;AAAA,QACA,UAAA,EAAY,MAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC;AAAA,OAC/C;AAAA,IACF,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,IAAA,GAAO,OAAO,CAAA,CAAE,IAAA,KAAS,WAAW,CAAA,CAAE,IAAA,CAAK,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAI,EAAA;AACjF,MAAA,OAAO,iBAAiB,IAAI,CAAA,GAAI,EAAE,EAAA,EAAI,IAAA,EAAM,MAAK,GAAI,IAAA;AAAA,IACvD;AAAA;AAEJ;AAGO,SAAS,uBAAuB,GAAA,EAA8B;AACnE,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,SAAU,EAAC;AACjC,EAAA,OAAO,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,sBAAsB,CAAA,EAAG,CAAA,KAAA,EAAQ,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA,CAAE,OAAO,CAAC,CAAA,KAAyB,MAAM,IAAI,CAAA;AACjH;AAOO,SAAS,sBAAsB,IAAA,EAAwF;AAC5H,EAAA,MAAM,QAAA,GAAW,OAAO,IAAA,CAAK,QAAA,KAAa,WAAW,IAAA,CAAK,QAAA,CAAS,MAAK,GAAI,EAAA;AAC5E,EAAA,MAAM,WAAW,CAAC,IAAA,CAAK,MAAM,IAAA,CAAK,cAAc,EAAE,IAAA,CAAK,CAAC,MAAmB,OAAO,CAAA,KAAM,YAAY,CAAA,CAAE,IAAA,OAAW,EAAE,CAAA,EAAG,MAAK,IAAK,EAAA;AAChI,EAAA,MAAM,CAAA,GAAI,QAAA,CAAS,KAAA,CAAM,iBAAiB,CAAA;AAC1C,EAAA,IAAI,CAAA,EAAG;AACL,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAE3B,IAAA,IAAI,CAAA,GAAI,CAAA,EAAG,OAAO,EAAC;AACnB,IAAA,QAAQ,CAAA,CAAE,CAAC,CAAA;AAAG,MACZ,KAAK,GAAA;AAAK,QAAA,OAAO,CAAC,EAAE,EAAA,EAAI,QAAA,EAAU,MAAM,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA;AAAA,MAC7D,KAAK,GAAA;AAAK,QAAA,OAAO,CAAA,GAAI,EAAA,GACjB,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA,GAC5C,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAE,CAAC,CAAC,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA,MACrG,KAAK,GAAA;AAAK,QAAA,OAAO,IAAI,EAAA,GACjB,CAAC,EAAE,EAAA,EAAI,UAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,IACrD,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,KAAK,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAE,CAAC,CAAC,CAAA,EAAG,MAAM,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC7G;AAAS,QAAA,OAAO,CAAC,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,QAAQ,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,CAAC,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA;AAC7F,EACF;AACA,EAAA,MAAM,UAAA,GAAa,QAAA,KAAa,EAAA,IAAM,QAAA,KAAa,WAAW,QAAA,GAAW,QAAA;AACzE,EAAA,IAAI,CAAC,gBAAA,CAAiB,UAAU,CAAA,SAAU,EAAC;AAC3C,EAAA,MAAM,QAAA,GAAW,WAAW,UAAU,CAAA;AAItC,EAAA,OAAO,uBAAuB,CAAC,QAAA,IAAY,EAAE,EAAA,EAAI,UAAU,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,UAAA,CAAW,MAAM,KAAK,CAAA,CAAE,KAAK,GAAG,CAAA,EAAG,CAAC,CAAA;AACrH;AAGA,SAAS,SAAS,KAAA,EAA8B;AAC9C,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,aAAa,CAAA;AACnC,EAAA,IAAI,CAAC,GAAG,OAAO,IAAA;AACf,EAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3B,EAAA,OAAO,CAAA,IAAK,IAAI,CAAA,GAAI,IAAA;AACtB;AAGA,SAAS,WAAW,UAAA,EAAyC;AAC3D,EAAA,MAAM,CAAC,GAAA,EAAK,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAG,CAAA,GAAI,UAAA,CAAW,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA;AAClE,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,CAAK,GAAG,IAAI,QAAA,CAAS,GAAA,EAAK,EAAE,CAAA,GAAI,IAAA;AACrD,EAAA,MAAM,KAAA,GAAQ,QAAQ,IAAA,CAAK,IAAI,IAAI,QAAA,CAAS,IAAA,EAAM,EAAE,CAAA,GAAI,IAAA;AACxD,EAAA,MAAM,OAAA,GAAU,SAAS,GAAG,CAAA;AAC5B,EAAA,MAAM,QAAA,GAAW,SAAS,IAAI,CAAA;AAC9B,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,IAAA,KAAS,GAAA,IAAO,QAAQ,GAAA,IAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,OAAO,OAAA,EAAQ;AAC3H,EAAA,IAAI,GAAA,KAAQ,GAAA,IAAO,IAAA,KAAS,GAAA,IAAO,QAAQ,GAAA,IAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,OAAO,CAAA,EAAE;AAChH,EAAA,IAAI,SAAS,IAAA,IAAQ,QAAA,KAAa,IAAA,IAAQ,GAAA,KAAQ,OAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAS,KAAA,EAAO,QAAA,EAAU,QAAQ,IAAA,EAAK;AAC1I,EAAA,IAAI,SAAS,IAAA,IAAQ,IAAA,KAAS,GAAA,IAAO,GAAA,KAAQ,OAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAS,KAAA,EAAO,CAAA,EAAG,QAAQ,IAAA,EAAK;AAC9H,EAAA,IAAI,SAAS,IAAA,IAAQ,KAAA,KAAU,QAAQ,GAAA,KAAQ,GAAA,IAAO,QAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,MAAM,MAAA,EAAQ,KAAA,EAAO,GAAG,IAAA,EAAM,KAAA,EAAO,QAAQ,IAAA,EAAK;AAC5I,EAAA,IAAI,IAAA,KAAS,QAAQ,KAAA,KAAU,IAAA,IAAQ,QAAQ,GAAA,IAAO,gCAAA,CAAiC,IAAA,CAAK,GAAG,CAAA,EAAG;AAChG,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,GAAG,KAC5B,MAAM;AAAE,MAAA,MAAM,CAAC,GAAG,CAAC,CAAA,GAAI,IAAI,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,MAAM,CAAA;AAAG,MAAA,OAAO,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,CAAA,GAAI,CAAA,GAAI,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AAAA,IAAE,IAAG,GACjH,GAAA,CAAI,MAAM,GAAG,CAAA,CAAE,IAAI,MAAM,CAAA;AAC7B,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,QAAA,EAAS;AAAA,EACtF;AACA,EAAA,IAAI,IAAA,KAAS,QAAQ,KAAA,KAAU,IAAA,IAAQ,QAAQ,IAAA,CAAK,GAAG,CAAA,IAAK,GAAA,KAAQ,GAAA,EAAK;AACvE,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,UAAU,KAAA,EAAO,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,QAAQ,IAAA,EAAM,UAAA,EAAY,QAAA,CAAS,GAAA,EAAK,EAAE,CAAA,EAAE;AAAA,EAC5G;AACA,EAAA,OAAO,IAAA;AACT;AA2BA,IAAM,UAAA,uBAAiB,GAAA,EAAiC;AACxD,IAAM,aAAA,uBAAoB,GAAA,EAAoB;AAC9C,IAAM,kBAAA,GAAqB,IAAA;AAE3B,SAAS,aAAa,QAAA,EAA0D;AAC9E,EAAA,MAAM,UAAU,QAAA,IAAY,QAAA,CAAS,MAAK,GAAI,QAAA,CAAS,MAAK,GAAI,KAAA;AAChE,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA;AACvC,EAAA,IAAI,KAAA,EAAO,OAAO,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA,IAAK,IAAA;AAC3C,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,IAAI,IAAA,CAAK,cAAA,CAAe,OAAA,EAAS;AAAA,MAC3C,QAAA,EAAU,OAAA;AAAA,MACV,SAAA,EAAW,KAAA;AAAA,MACX,IAAA,EAAM,SAAA;AAAA,MACN,KAAA,EAAO,SAAA;AAAA,MACP,GAAA,EAAK,SAAA;AAAA,MACL,IAAA,EAAM,SAAA;AAAA,MACN,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,MAAM,SAAA,GAAY,GAAA,CAAI,eAAA,EAAgB,CAAE,QAAA;AACxC,IAAA,IAAI,CAAC,WAAW,GAAA,CAAI,SAAS,GAAG,UAAA,CAAW,GAAA,CAAI,WAAW,GAAG,CAAA;AAC7D,IAAA,IAAI,aAAA,CAAc,IAAA,IAAQ,kBAAA,EAAoB,aAAA,CAAc,KAAA,EAAM;AAClE,IAAA,aAAA,CAAc,GAAA,CAAI,SAAS,SAAS,CAAA;AACpC,IAAA,OAAO,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA,IAAK,GAAA;AAAA,EACtC,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAGO,SAAS,gBAAgB,KAAA,EAAiC;AAC/D,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,CAAM,MAAK,KAAM,EAAA,IAAM,YAAA,CAAa,KAAK,CAAA,KAAM,IAAA;AACrF;AAGO,SAAS,eAAe,KAAA,EAA0B;AACvD,EAAA,OAAO,CAAA,EAAG,MAAM,QAAQ,CAAA,CAAA,EAAI,MAAM,IAAI,CAAA,CAAA,EAAI,MAAM,MAAM,CAAA,CAAA;AACxD;AAEA,SAAS,mBAAA,CAAoB,IAAA,EAAc,KAAA,EAAe,GAAA,EAAa,MAAc,MAAA,EAA2B;AAC9G,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA,GAAI,KAAQ,CAAA;AAErE,EAAA,MAAM,OAAA,GAAA,CAAa,QAAA,GAAW,CAAA,GAAK,CAAA,GAAI,CAAA,IAAK,CAAA;AAC5C,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,IAAA,EAAM,IAAA,KAAS,EAAA,GAAK,CAAA,GAAI,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,QAAA,EAAS;AACrF;AAGO,SAAS,WAAA,CAAY,MAAY,QAAA,EAA8B;AACpE,EAAA,MAAM,GAAA,GAAM,aAAa,QAAQ,CAAA;AACjC,EAAA,IAAI,CAAC,GAAA,EAAK,OAAO,oBAAoB,IAAA,CAAK,cAAA,IAAkB,IAAA,CAAK,WAAA,KAAgB,CAAA,EAAG,IAAA,CAAK,YAAW,EAAG,IAAA,CAAK,aAAY,EAAG,IAAA,CAAK,eAAe,CAAA;AAC/I,EAAA,MAAM,QAAgC,EAAC;AACvC,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,aAAA,CAAc,IAAI,CAAA,EAAG;AACvC,IAAA,IAAI,CAAA,CAAE,SAAS,SAAA,EAAW;AAC1B,IAAA,KAAA,CAAM,EAAE,IAAI,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,OAAO,EAAE,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,mBAAA,CAAoB,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAA,EAAO,MAAM,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,MAAM,CAAA;AACzF;AAGO,SAAS,qBAAA,CAAsB,MAAY,QAAA,EAA2B;AAC3E,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,IAAA,EAAM,QAAQ,CAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAA,GAAQ,CAAA,EAAG,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,MAAM,MAAM,CAAA;AACvF,EAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,OAAA,EAAQ,GAAI,GAAK,CAAA,GAAI,GAAA;AACvD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAA,CAAO,KAAA,GAAQ,SAAA,IAAa,GAAK,CAAA;AAC/C;AAEA,SAAS,WAAA,CAAY,MAAc,KAAA,EAAuB;AACxD,EAAA,OAAO,IAAI,KAAK,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,EAAO,CAAC,CAAC,CAAA,CAAE,UAAA,EAAW;AACvD;AAOO,SAAS,gBAAA,CAAiB,KAAA,EAAe,KAAA,EAAe,GAAA,EAAa,GAAA,EAAsB;AAChG,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,EAAA,IAAI,MAAM,QAAA,CAAS,GAAG,GAAG,OAAO,KAAA,CAAM,MAAM,GAAG,CAAA,CAAE,KAAK,CAAC,IAAA,KAAS,iBAAiB,IAAA,CAAK,IAAA,IAAQ,KAAA,EAAO,GAAA,EAAK,GAAG,CAAC,CAAA;AAC9G,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,IAAA,MAAM,CAAC,KAAA,EAAO,IAAI,CAAA,GAAI,KAAA,CAAM,MAAM,GAAG,CAAA;AACrC,IAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,EAAM,EAAE,CAAA;AACjC,IAAA,IAAI,OAAO,KAAA,CAAM,OAAO,CAAA,IAAK,OAAA,IAAW,GAAG,OAAO,KAAA;AAClD,IAAA,IAAI,KAAA,KAAU,GAAA,EAAK,OAAO,KAAA,GAAQ,OAAA,KAAY,CAAA;AAC9C,IAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,MAAA,MAAM,CAACC,MAAAA,EAAO,GAAG,CAAA,GAAI,WAAW,KAAK,CAAA;AACrC,MAAA,IAAIA,MAAAA,KAAU,IAAA,IAAQ,GAAA,KAAQ,IAAA,EAAM,OAAO,KAAA;AAC3C,MAAA,OAAO,SAASA,MAAAA,IAAS,KAAA,IAAS,GAAA,IAAA,CAAQ,KAAA,GAAQA,UAAS,OAAA,KAAY,CAAA;AAAA,IACzE;AACA,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,EAAO,EAAE,CAAA;AAChC,IAAA,IAAI,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,EAAG,OAAO,KAAA;AAChC,IAAA,OAAO,SAAS,KAAA,IAAS,KAAA,IAAS,GAAA,IAAA,CAAQ,KAAA,GAAQ,SAAS,OAAA,KAAY,CAAA;AAAA,EACzE;AACA,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,IAAA,MAAM,CAAC,KAAA,EAAO,GAAG,CAAA,GAAI,WAAW,KAAK,CAAA;AACrC,IAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,GAAA,KAAQ,IAAA,EAAM,OAAO,KAAA;AAC3C,IAAA,OAAO,KAAA,IAAS,SAAS,KAAA,IAAS,GAAA;AAAA,EACpC;AACA,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,EAAE,CAAA;AAC9B,EAAA,OAAO,CAAC,MAAA,CAAO,KAAA,CAAM,GAAG,KAAK,GAAA,KAAQ,KAAA;AACvC;AAEA,SAAS,WAAW,KAAA,EAA+C;AACjE,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,GAAG,CAAA;AAC7B,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,CAAC,MAAM,IAAI,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,CAAC,GAAG,EAAE,CAAA;AACnC,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,CAAM,CAAC,GAAG,EAAE,CAAA;AACjC,EAAA,OAAO,CAAC,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,GAAI,IAAA,GAAO,KAAA,EAAO,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAA,GAAO,GAAG,CAAA;AAC5E;AAGO,SAAS,WAAA,CAAY,YAAoB,KAAA,EAA2B;AACzE,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,IAAA,EAAK,CAAE,MAAM,KAAK,CAAA;AAC5C,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AAIhC,EAAA,OACE,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,QAAQ,CAAA,EAAG,EAAE,CAAA,IAC/C,gBAAA,CAAiB,MAAA,CAAO,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,EAAE,CAAA,IAC7C,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,GAAA,EAAK,CAAA,EAAG,EAAE,CAAA,IAC5C,iBAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,KAC7C,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,SAAS,CAAA,EAAG,CAAC,CAAA,IAAM,KAAA,CAAM,OAAA,KAAY,CAAA,IAAK,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,CAAA;AAEpH;AAGO,SAAS,WAAA,CAAY,MAAoB,KAAA,EAA2B;AACzE,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AACzC,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,IAAQ,CAAA;AAC1B,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AACH,MAAA,OAAO,KAAA,CAAM,SAAS,KAAA,KAAU,CAAA;AAAA,IAClC,KAAK,OAAA;AACH,MAAA,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,IAAU,KAAA,CAAM,OAAO,KAAA,KAAU,CAAA;AAAA,IAC3D,KAAK,MAAA;AACH,MAAA,OAAO,KAAA,CAAM,WAAW,MAAA,IAAU,KAAA,CAAM,SAAS,IAAA,IAAQ,KAAA,CAAM,WAAW,KAAA,KAAU,CAAA;AAAA,IACtF,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAA,CAAO,KAAA,CAAM,QAAA,GAAW,KAAK,CAAC,CAAA;AACrD,MAAA,OACE,KAAA,CAAM,MAAA,KAAW,MAAA,IACjB,KAAA,CAAM,SAAS,IAAA,IAAA,CACd,IAAA,CAAK,QAAA,IAAY,IAAI,QAAA,CAAS,KAAA,CAAM,OAAO,CAAA,IAC5C,YAAY,KAAA,KAAU,CAAA;AAAA,IAE1B;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,UAAA,IAAc,CAAA,EAAG,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAK,CAAC,CAAA;AAClF,MAAA,MAAM,UAAA,GAAa,KAAA,CAAM,IAAA,GAAO,EAAA,IAAM,MAAM,KAAA,GAAQ,CAAA,CAAA;AACpD,MAAA,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,IAAU,KAAA,CAAM,IAAA,KAAS,QAAQ,KAAA,CAAM,GAAA,KAAQ,MAAA,IAAU,UAAA,GAAa,KAAA,KAAU,CAAA;AAAA,IAC1G;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,OAAO,IAAA,CAAK,IAAA,KAAS,YAAY,WAAA,CAAY,IAAA,CAAK,MAAM,KAAK,CAAA;AAAA;AAE1E;AAGO,SAAS,iBAAA,CAAkB,MAAoB,EAAA,EAAmB;AACvE,EAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AACpC,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,EAAA,EAAI,IAAA,CAAK,QAAQ,CAAA;AAC3C,EAAA,OAAO,IAAA,CAAK,MAAM,IAAA,CAAK,CAAC,SAAS,WAAA,CAAY,IAAA,EAAM,KAAK,CAAC,CAAA;AAC3D;AAOA,IAAM,iBAAiB,EAAA,GAAK,GAAA;AAQrB,SAAS,mBAAA,CAAoB,IAAA,EAAoB,IAAA,EAAY,KAAA,EAAa,GAAA,EAAqB;AACpG,EAAA,MAAM,MAAc,EAAC;AACrB,EAAA,IAAI,KAAK,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,GAAA,IAAO,GAAG,OAAO,GAAA;AAChD,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,EAAA,IAAI,IAAI,IAAA,CAAK,IAAA,CAAK,KAAK,OAAA,EAAQ,GAAI,GAAK,CAAA,GAAI,GAAA;AAC5C,EAAA,MAAM,GAAA,GAAM,MAAM,OAAA,EAAQ;AAC1B,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,OAAA,GAAU,EAAA;AACd,EAAA,OAAO,CAAA,IAAK,GAAA,IAAO,GAAA,CAAI,MAAA,GAAS,GAAA,EAAK;AACnC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,cAAc,CAAA;AAC9C,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,GAAO,QAAA;AACP,MAAA,MAAA,GAAS,sBAAsB,IAAI,IAAA,CAAK,CAAC,CAAA,EAAG,KAAK,QAAQ,CAAA;AAAA,IAC3D;AACA,IAAA,MAAM,OAAA,GAAU,IAAI,IAAA,CAAK,CAAA,GAAI,SAAS,GAAK,CAAA;AAC3C,IAAA,MAAM,KAAA,GAAQ,mBAAA;AAAA,MACZ,QAAQ,cAAA,EAAe;AAAA,MACvB,OAAA,CAAQ,aAAY,GAAI,CAAA;AAAA,MACxB,QAAQ,UAAA,EAAW;AAAA,MACnB,QAAQ,WAAA,EAAY;AAAA,MACpB,QAAQ,aAAA;AAAc,KACxB;AACA,IAAA,IAAI,KAAA,CAAM,KAAK,CAAC,IAAA,KAAS,YAAY,IAAA,EAAM,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,GAAA,GAAM,eAAe,KAAK,CAAA;AAChC,MAAA,IAAI,QAAQ,OAAA,EAAS,GAAA,CAAI,KAAK,IAAI,IAAA,CAAK,CAAC,CAAC,CAAA;AACzC,MAAA,OAAA,GAAU,GAAA;AAAA,IACZ;AACA,IAAA,CAAA,IAAK,GAAA;AAAA,EACP;AACA,EAAA,OAAO,GAAA;AACT;AAEA,IAAM,MAAA,GAAS,KAAA;AAOR,SAAS,iBAAiB,KAAA,EAA4C;AAC3E,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AACzC,IAAA,MAAM,MAAA,GACJ,KAAK,IAAA,KAAS,MAAA,GAAS,QAAQ,MAAA,GAC7B,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,KAAA,GAAQ,CAAA,GAAI,SACpC,IAAA,CAAK,IAAA,KAAS,WAAW,KAAA,GAAQ,EAAA,GAAK,SACtC,IAAA,CAAK,IAAA,KAAS,MAAA,GAAS,GAAA,GAAM,MAAA,GAC7B,MAAA;AACJ,IAAA,IAAI,MAAA,GAAS,SAAS,OAAA,GAAU,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,GAAM,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,EAAA,GAAK,MAAA,EAAQ,OAAA,GAAU,CAAA,GAAI,MAAM,CAAC,CAAA;AAC3E;AAOO,SAAS,gBAAA,CAAiB,MAAoB,IAAA,EAAY,KAAA,EAAe,YAAY,gBAAA,CAAiB,IAAA,CAAK,KAAK,CAAA,EAAW;AAChI,EAAA,OAAO,oBAAoB,IAAA,EAAM,IAAI,IAAA,CAAK,IAAA,CAAK,SAAQ,GAAI,CAAC,CAAA,EAAG,IAAI,KAAK,IAAA,CAAK,OAAA,EAAQ,GAAI,SAAS,GAAG,KAAK,CAAA;AAC5G;;;AChcO,IAAM,qBAAA,GAAwB;AAAA,EACnC,YAAA,EAAc,CAAC,CAAA,EAAG,IAAI,CAAA;AAAA,EACtB,WAAA,EAAa,CAAC,CAAA,EAAG,CAAC;AACpB;AAEO,IAAM,uBAAA,GAAyC,OAAO,MAAA,CAAO;AAAA,EAClE,YAAA,EAAc,EAAA;AAAA,EACd,WAAA,EAAa,CAAA;AAAA,EACb,cAAA,EAAgB;AAClB,CAAC;AAED,SAASC,KAAI,KAAA,EAA+B;AAC1C,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAChF,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,SAAA,CAAU,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,QAAA,CAAS,KAAA,CAAM,IAAA,IAAQ,EAAE,CAAA;AAC/F,EAAA,OAAO,IAAA;AACT;AAEA,SAASC,OAAM,KAAA,EAAsB,CAAC,EAAA,EAAI,EAAE,GAA8B,QAAA,EAA0B;AAClG,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,QAAA;AAC3B,EAAA,OAAO,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,CAAC,CAAA;AACzC;AAUO,SAAS,uBAAuB,GAAA,EAAoC;AACzE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;AAC5C,EAAA,MAAM,CAAA,GAAI,GAAA;AACV,EAAA,OAAO;AAAA,IACL,YAAA,EAAcA,OAAMD,IAAAA,CAAI,CAAA,CAAE,YAAY,CAAA,EAAG,qBAAA,CAAsB,YAAA,EAAc,uBAAA,CAAwB,YAAY,CAAA;AAAA,IACjH,WAAA,EAAaC,OAAMD,IAAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG,qBAAA,CAAsB,WAAA,EAAa,uBAAA,CAAwB,WAAW,CAAA;AAAA;AAAA,IAE7G,cAAA,EAAgB,EAAE,cAAA,KAAmB;AAAA,GACvC;AACF;;;ACxDO,IAAM,mBAAA,GAAsB;AAe5B,SAAS,uBAAA,CAId,YAAA,EACA,KAAA,EACA,KAAA,EACA,aAAA,EACqB;AACrB,EAAA,MAAM,QAAkD,EAAC;AACzD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,WAAW,YAAA,EAAc;AAClC,IAAA,IAAI,IAAA,CAAK,iBAAiB,mBAAA,EAAqB;AAC/C,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AAClD,IAAA,IAAI,CAAC,GAAA,EAAK;AAGV,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAG,CAAA,EAAG,IAAA,EAAK;AACxC,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,KAAW,EAAA,EAAI;AAC3C,IAAA,MAAM,QAAS,GAAA,CAAI,IAAA,CAAK,KAAA,IAAoB,GAAA,CAAI,QAAQ,GAAA,CAAI,EAAA;AAC5D,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,MAAA,EAAQ,CAAA;AAAA,EAC9B;AAEA,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAoB;AACpC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,EAAE,KAAA,EAAM,IAAK,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAA,EAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAC7E,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,KAAA,MAAW,EAAE,KAAA,EAAO,MAAA,EAAO,IAAK,KAAA,EAAO;AACrC,IAAA,IAAI,GAAA,GAAM,KAAA;AACV,IAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,IAAK,KAAK,CAAA,EAAG;AAChC,MAAA,MAAM,CAAA,GAAA,CAAK,IAAA,CAAK,GAAA,CAAI,KAAK,KAAK,CAAA,IAAK,CAAA;AACnC,MAAA,IAAA,CAAK,GAAA,CAAI,OAAO,CAAC,CAAA;AACjB,MAAA,IAAI,IAAI,CAAA,EAAG,GAAA,GAAM,CAAA,EAAG,KAAK,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjC;AACA,IAAA,GAAA,CAAI,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAA;AACT;;;ACtDO,SAAS,2BACd,IAAA,EACsB;AACtB,EAAA,MAAM,UAAU,IAAA,CAAK,gBAAA;AAGrB,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,CAAQ,MAAA,KAAW,GAAG,OAAO,MAAA;AAC7C,EAAA,MAAM,UAAU,OAAA,CACb,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAA,IAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,EAChC,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC7B,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,GAAU,MAAA;AACxC;AAMO,SAAS,2BACd,IAAA,EACsB;AACtB,EAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,OAAO,KAAK,OAAA,CAAQ,MAAA,KAAW,GAAG,OAAO,MAAA;AAC5D,EAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,SAClB,OAAO,IAAA,KAAS,WAAW,IAAA,GAAO,IAAA,CAAK,UAAU,IAAI;AAAA,GACvD;AACF;AASO,SAAS,2BAA2B,KAAA,EAA2B;AACpE,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AAC/B,EAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,EAAU,OAAO,KAAA;AACvC,EAAA,MAAM,OAAA,GAAU,OAAO,IAAA,EAAK;AAC5B,EAAA,IAAI,CAAC,OAAA,CAAQ,UAAA,CAAW,GAAG,GAAG,OAAO,KAAA;AACrC,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC7B,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,MAAM,KAAK,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,KAAA;AAC1D,EAAA,OAAO,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,OACjB,OAAO,EAAA,KAAO,WAAW,EAAA,GAAK,IAAA,CAAK,UAAU,EAAE;AAAA,GACjD;AACF;;;ACvDO,SAAS,cAAA,CACd,YACA,QAAA,EACoB;AACpB,EAAA,IAAI,CAAC,UAAA,IAAc,CAAC,QAAA,EAAU,OAAO,UAAA;AACrC,EAAA,IAAI,UAAA,CAAW,SAAS,IAAI,CAAA,SAAU,UAAA,CAAW,UAAA,CAAW,MAAM,QAAQ,CAAA;AAC1E,EAAA,OAAO,UAAA;AACT;;;ACiBO,SAAS,oBAAA,CACd,IAAA,EACA,YAAA,EACA,kBAAA,EACA,iBACA,kBAAA,EACyB;AACzB,EAAA,MAAM,KAAK,IAAA,CAAK,aAAA;AAChB,EAAA,MAAM,QAAA,GAAW,EAAE,GAAG,IAAA,EAAK;AAE3B,EAAA,KAAA,MAAW,SAAS,kBAAA,EAAoB;AACtC,IAAA,MAAM,KAAA,GAAQ,qBAAqB,KAAK,CAAA;AACxC,IAAA,MAAM,OAAoC,OAAO,KAAA,KAAU,WAAW,EAAE,YAAA,EAAc,OAAM,GAAI,KAAA;AAChG,IAAA,MAAM,YAAA,GAAe,IAAA,EAAM,YAAA,IAAgB,EAAA,GAAK,KAAK,CAAA,EAAG,YAAA;AAExD,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,YAAA,EAAc,IAAA,EAAM,YAAY,CAAA;AAC/D,MAAA,IAAI,MAAA,IAAU,IAAA,EAAM,QAAA,CAAS,KAAK,CAAA,GAAI,MAAA;AAAA,IACxC,CAAA,MAAO;AACL,MAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,MAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,QAAA,MAAM,QAAA,GAAW,cAAA,CAAe,OAAA,EAAS,YAAY,CAAA;AACrD,QAAA,IAAI,QAAA,KAAa,OAAA,EAAS,QAAA,CAAS,KAAK,CAAA,GAAI,QAAA;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAQA,IAAM,gBAAA,GAAmB;AAAA,EACvB,WAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAA;AAwBO,SAAS,sBACd,GAAA,EACsB;AACtB,EAAA,MAAM,MAA4B,EAAC;AAEnC,EAAA,IAAI,OAAO,GAAA,CAAI,cAAA,KAAmB,YAAY,GAAA,CAAI,cAAA,CAAe,SAAS,CAAA,EAAG;AAC3E,IAAA,GAAA,CAAI,IAAA,CAAK;AAAA,MACP,GAAA,EAAK,gBAAA;AAAA,MACL,KAAA,EAAO,YAAA;AAAA,MACP,KAAK,GAAA,CAAI;AAAA,KACV,CAAA;AAAA,EACH;AAEA,EAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,IAAA,MAAM,GAAA,GAAM,IAAI,MAAM,CAAA;AACtB,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AACzB,IAAA,GAAA,CAAI,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM;AACvB,MAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,QAAA,EAAU;AACvC,MAAA,MAAM,OAAA,GAAU,IAAA;AAChB,MAAA,IAAI,OAAO,OAAA,CAAQ,GAAA,KAAQ,YAAY,OAAA,CAAQ,GAAA,CAAI,WAAW,CAAA,EAAG;AACjE,MAAA,MAAM,OAAO,OAAO,OAAA,CAAQ,IAAA,KAAS,QAAA,GAAW,QAAQ,IAAA,GAAO,EAAA;AAC/D,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,GAAA,EAAK,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAA;AAAA,QACnB,KAAA,EAAO,CAAA,EAAG,MAAM,CAAA,GAAA,EAAM,IAAI,CAAA,CAAA;AAAA,QAC1B,KAAK,OAAA,CAAQ;AAAA,OACd,CAAA;AAAA,IACH,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,GAAA;AACT;;;ACtGA,SAAS,UAAU,IAAA,EAA2B;AAC5C,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,EAAG,IAAA,EAAM,CAAC,CAAA;AAClD;AAEO,SAAS,iCAAA,CAGd,IAAA,EAAS,KAAA,EAAyB,KAAA,EAA4B;AAC9D,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,IAAI,OAAA,GAAU,IAAA;AACd,EAAA,OAAO,IAAA,EAAM;AACX,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,QAAQ,MAAM,CAAA;AACrD,IAAA,IAAI,CAAC,GAAA,IAAO,GAAA,CAAI,IAAA,KAAS,QAAQ,OAAO,OAAA;AACxC,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,GAAG,OAAO,OAAA;AAChC,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAI,EAAE,CAAA;AAClB,IAAA,MAAM,IAAA,GAAQ,GAAA,CAAI,IAAA,CAAK,IAAA,IAAmC,EAAC;AAC3D,IAAA,IAAI,SAAA,CAAU,IAAI,CAAA,EAAG,OAAO,OAAA;AAC5B,IAAA,MAAM,SAAS,KAAA,CAAM,IAAA;AAAA,MACnB,CAAC,CAAA,KAAM,CAAA,CAAE,WAAW,GAAA,CAAI,EAAA,IAAM,EAAE,YAAA,KAAiB;AAAA,KACnD;AACA,IAAA,IAAI,CAAC,QAAQ,OAAO,OAAA;AACpB,IAAA,OAAA,GAAU,MAAA;AAAA,EACZ;AACF;;;AC5BA,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,OAAO,CAAA,KAAM,YAAY,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,IAAK,CAAA,GAAI,CAAA;AAE1F,SAAS,kBAAkB,IAAA,EAA+E;AAC/G,EAAA,IAAI,CAAC,MAAM,OAAO,MAAA;AAClB,EAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,IAAA,CAAK,gBAAgB,CAAA,GAAK,IAAA,CAAK,mBAA6D,EAAC;AAC3H,EAAA,MAAM,QAAQ,OAAO,IAAA,CAAK,iBAAA,KAAsB,QAAA,GAAW,KAAK,iBAAA,GAAoB,CAAA;AACpF,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAK,CAAA,IAAK,QAAQ,CAAC,CAAA;AACzC,EAAA,IAAI,SAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,IAAK,SAAS,KAAA,CAAM,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,MAAA,EAAQ,MAAM,MAAA,EAAO;AAChH,EAAA,IAAI,QAAA,CAAS,IAAA,CAAK,KAAK,CAAA,IAAK,SAAS,IAAA,CAAK,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,MAAA,EAAQ,KAAK,MAAA,EAAO;AACnG,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,cAAA,CACd,MAAA,EACA,KAAA,EACA,KAAA,EAC6B;AAC7B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,IAAU,CAAC,KAAK,MAAA,IAAA,CAAW,IAAA,CAAK,YAAA,IAAgB,OAAA,MAAa,OAAA,EAAS;AAC1F,IAAA,MAAM,IAAA,GAAO,iBAAA,CAAkB,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,MAAM,CAAA,EAAG,IAAI,CAAA;AAC5E,IAAA,IAAI,MAAM,OAAO,IAAA;AAAA,EACnB;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,YAAA,CACd,MAAA,EACA,IAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,OAAO,MAAM,OAAA,KAAY,QAAA,IAAY,KAAK,OAAA,CAAQ,MAAA,GAAS,GAAG,OAAO,IAAA;AACzE,EAAA,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,YAAA,KAAiB,MAAM,CAAA;AACnF;;;ACtCO,SAAS,cAAc,KAAA,EAAuD;AACnF,EAAA,MAAM,WAAW,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACjD,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACnC,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG,OAAO,CAAC,GAAG,QAAA,CAAS,CAAC,CAAC,CAAA;AAEjD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,GAAG,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,CAAC,CAAA;AACxD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC/B,IAAA,MAAM,SAAkC,EAAC;AACzC,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA;AACjC,MAAA,QAAA,CAAS,KAAK,IAAI,CAAA;AAClB,MAAA,MAAM,MAAA,GAAS,aAAa,IAAI,CAAA;AAChC,MAAA,IAAI,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClE,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA,MAAA,CAAO,MAAA,CAAO,QAAQ,MAAiC,CAAA;AAAA,MACzD;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,YAAY,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAAA,EACjE;AACA,EAAA,OAAO,GAAA;AACT;;;AC0IA,IAAM,yBAAA,mBAA4B,IAAI,GAAA,CAAY,CAAC,OAAO,CAAC,CAAA;AAW3D,IAAM,gBAAA,GAAsC;AAAA,EAC1C,GAAG,CAAC,GAAG,mBAAmB,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,yBAAA,CAA0B,GAAA,CAAI,CAAC,CAAC,CAAA;AAAA,EAC3E;AACF,CAAA;AAGA,IAAM,iBAAA,GAA8C;AAAA;AAAA;AAAA;AAAA,EAIlD,kBAAA,EAAoB,CAAC,QAAQ,CAAA;AAAA;AAAA,EAE7B,0BAAA,EAA4B,CAAC,UAAU,CAAA;AAAA,EACvC,WAAW,CAAC,aAAA,EAAe,OAAA,EAAS,oBAAA,EAAsB,UAAU,kBAAkB,CAAA;AAAA,EACtF,MAAA,EAAQ,CAAC,QAAA,EAAU,WAAA,EAAa,cAAc,kBAAkB,CAAA;AAAA,EAChE,QAAA,EAAU,CAAC,QAAA,EAAU,OAAA,EAAS,cAAc,kBAAkB,CAAA;AAAA,EAC9D,QAAA,EAAU;AAAA,IACR,WAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,SAAA;AAAA,IACA,mBAAA;AAAA,IACA,kBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF;AAAA;AAAA;AAAA;AAAA,EAIA,IAAA,EAAM,CAAC,UAAA,EAAY,aAAA,EAAe,kBAAkB,CAAA;AAAA;AAAA;AAAA;AAAA,EAIpD,cAAA,EAAgB,CAAC,sBAAsB;AACzC,CAAA;AAWA,IAAM,kBAAA,GAAwD;AAAA,EAC5D,gBAAA,EAAkB,CAAC,cAAc,CAAA;AAAA;AAAA;AAAA,EAGjC,0BAAA,EAA4B,CAAC,WAAA,EAAa,SAAA,EAAW,cAAc,WAAW,CAAA;AAAA;AAAA,EAE9E,uBAAA,EAAyB,CAAC,WAAA,EAAa,cAAc,CAAA;AAAA,EACrD,GAAG,MAAA,CAAO,WAAA,CAAY,CAAC,GAAG,sBAAsB,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,IAAA,EAAM,CAAC,cAAc,CAAC,CAAC,CAAC;AAC3F,CAAA;AAGO,SAAS,iBAAiB,KAAA,EAAqC;AACpE,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,IAAA,CAAK,MAAM,OAAO,IAAA;AAClC,IAAA,MAAM,IAAA,GAAO,EAAE,GAAI,IAAA,CAAK,IAAA,EAAiC;AACzD,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,IAAI,SAAS,IAAA,EAAM;AACjB,QAAA,OAAO,KAAK,KAAK,CAAA;AACjB,QAAA,OAAA,GAAU,IAAA;AAAA,MACZ;AAAA,IACF;AACA,IAAA,OAAO,OAAA,GAAU,EAAE,GAAG,IAAA,EAAM,MAAK,GAAI,IAAA;AAAA,EACvC,CAAC,CAAA;AACH;AAGO,SAAS,mBAAmB,KAAA,EAAqC;AACtE,EAAA,OAAO,gBAAA,CAAiB,KAAK,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS;AAC3C,IAAA,MAAM,IAAA,GAAO,EAAE,GAAI,IAAA,CAAK,IAAA,EAAiC;AACzD,IAAA,KAAA,MAAW,KAAA,IAAS,gBAAA,EAAkB,OAAO,IAAA,CAAK,KAAK,CAAA;AAEvD,IAAA,KAAA,MAAW,KAAA,IAAS,8BAA8B,IAAA,CAAK,IAAI,KAAK,EAAC,EAAG,OAAO,IAAA,CAAK,KAAK,CAAA;AACrF,IAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,IAAA,CAAK,IAAI,KAAK,EAAC;AAChD,IAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,OAAO,IAAA,CAAK,KAAK,CAAA;AAG7C,IAAA,MAAM,aAAa,IAAA,CAAK,aAAA;AACxB,IAAA,IAAI,UAAA,IAAc,OAAO,UAAA,KAAe,QAAA,IAAY,WAAW,UAAA,EAAY;AACzE,MAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAG,MAAK,GAAI,UAAA;AACnC,MAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AAAA,IACvB;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAK;AAAA,EACzB,CAAC,CAAA;AACH;;;ACjQO,SAAS,0BACd,KAAA,EACkB;AAClB,EAAA,MAAM,SAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,oBAAoB,CAAA;AACnE,EAAA,MAAM,UAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAEpE,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAK;AAEnE,EAAA,MAAM,SAA4B,EAAC;AAGnC,EAAA,MAAM,YAAA,GAAe,CAAC,IAAA,KAAkC;AACtD,IAAA,MAAM,GAAA,uBAAU,GAAA,EAA4B;AAC5C,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,EAAE,IAAA,CAAK,OAAA;AACjB,MAAA,IAAI,CAAC,CAAA,EAAG;AACR,MAAA,MAAM,MAAA,GAAS,GAAA,CAAI,GAAA,CAAI,CAAC,KAAK,EAAC;AAC9B,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AACb,MAAA,GAAA,CAAI,GAAA,CAAI,GAAG,MAAM,CAAA;AAAA,IACnB;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AACA,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,YAAA,CAAa,MAAM,CAAA,EAAG;AACnD,IAAA,IAAI,MAAM,MAAA,GAAS,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,EAAE,GAAG,CAAA;AAAA,EAC5G;AACA,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,YAAA,CAAa,OAAO,CAAA,EAAG;AACpD,IAAA,IAAI,MAAM,MAAA,GAAS,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,EAAE,GAAG,CAAA;AAAA,EAC5G;AAGA,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,OAAA,EAAS,CAAC,CAAU,CAAC,CAAA;AAC9E,EAAA,KAAA,MAAW,aAAa,MAAA,EAAQ;AAC9B,IAAA,MAAM,OAAA,GAAU,UAAU,IAAA,CAAK,OAAA;AAC/B,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,MAAM,cAAA,GAAiB,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA;AAChD,IAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,0BAAA,EAA4B,SAAS,WAAA,EAAa,SAAA,CAAU,IAAI,CAAA;AACpF,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,eAAe,IAAA,CAAK,KAAA,IAAS,eAAe,IAAA,CAAK,KAAA,CAAM,WAAW,CAAA,EAAG;AACxE,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,2BAAA,EAA6B,SAAS,YAAA,EAAc,cAAA,CAAe,IAAI,CAAA;AAAA,IAC7F;AAAA,EACF;AAGA,EAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,OAAA,EAAS,CAAC,CAAU,CAAC,CAAA;AAC5E,EAAA,KAAA,MAAW,cAAc,OAAA,EAAS;AAChC,IAAA,MAAM,OAAA,GAAU,WAAW,IAAA,CAAK,OAAA;AAChC,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,OAAO,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,yBAAA,EAA2B,SAAS,YAAA,EAAc,UAAA,CAAW,IAAI,CAAA;AAAA,IACvF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA,CAAO,MAAA,KAAW,CAAA,GAAI,EAAE,EAAA,EAAI,MAAK,GAAI,EAAE,EAAA,EAAI,KAAA,EAAO,MAAA,EAAO;AAClE;AC7CA,IAAM,sBAAA,GAAyB;AAAA,EAC7B,EAAA,EAAI,eAAA;AAAA,EACJ,KAAA,EAAO,mBAAA;AAAA,EACP,WAAA,EAAa,kEAAA;AAAA,EACb,YAAA,EAAc,EAAE,MAAA,CAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKrB,QAAA,EAAU,EAAE,MAAA,EAAO,CAAE,IAAI,CAAA,EAAG,0BAA0B,CAAA,CAAE,OAAA,CAAQ,kCAAkC,CAAA;AAAA,IAClG,SAAA,EAAW,EAAE,IAAA,CAAK,CAAC,QAAQ,WAAW,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMvD,QAAA,EAAU,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAAS,GAC/B,CAAA;AAAA,EACD,aAAA,EAAe,EAAE,QAAA,EAAU,kCAAA,EAAoC,WAAW,MAAA,EAAgB;AAAA,EAC1F,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe,sBAAA;AAAA,EACf,OAAA,EAAS;AACX,CAAA;AAEA,IAAM,eAAA,GAAkB;AAAA,EACtB,EAAA,EAAI,QAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,4FAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,SAAA,EAAW,CAAA,CAAE,MAAA,EAAO,CAAE,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA;AAAA,EAChE,aAAA,EAAe,EAAE,SAAA,EAAW,MAAA,EAAO;AAAA,EACnC,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,wBAAA,GAA2B;AAAA,EAC/B,EAAA,EAAI,iBAAA;AAAA,EACJ,KAAA,EAAO,wBAAA;AAAA,EACP,WAAA,EAAa,mEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;AAAA,EACzB,eAAe,EAAC;AAAA,EAChB,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,cAAA,GAAiB;AAAA,EACrB,EAAA,EAAI,OAAA;AAAA,EACJ,KAAA,EAAO,YAAA;AAAA,EACP,WAAA,EAAa,sCAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;AAAA,EACzB,eAAe,EAAC;AAAA,EAChB,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,aAAA,GAAgB;AAAA,EACpB,EAAA,EAAI,MAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,qEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,aAAA,EAAe,CAAA,CAAE,OAAA,EAAQ,CAAE,OAAA,CAAQ,KAAK,CAAA,EAAG,CAAA;AAAA,EACpE,aAAA,EAAe,EAAE,aAAA,EAAe,KAAA,EAAM;AAAA,EACtC,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,mBAAA,GAAsB;AAAA,EAC1B,EAAA,EAAI,YAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,gEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,UAAU,CAAA,CAAE,IAAA,CAAK,CAAC,MAAA,EAAQ,SAAS,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,GAAG,CAAA;AAAA,EAChF,aAAA,EAAe,EAAE,QAAA,EAAU,MAAA,EAAgB;AAAA,EAC3C,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAeO,IAAM,iBAAA,GAAoB;AAAA,EAC/B,sBAAA;AAAA,EACA,eAAA;AAAA,EACA,wBAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF;AAEO,IAAM,sBAAsB,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE;AAIpE,IAAM,KAAA,GAAQ,IAAI,GAAA,CAA4B,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAE9E,SAAS,YAAY,EAAA,EAAsC;AAChE,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AACtB,EAAA,IAAI,CAAC,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,EAAE,CAAA,CAAE,CAAA;AACxD,EAAA,OAAO,CAAA;AACT;;;ACxHA,SAAS,uBAAA,CAAwB,CAAA,EAAW,CAAA,EAAW,CAAA,EAAoB;AACzE,EAAA,IAAI,CAAA,KAAM,GAAG,OAAO,IAAA;AACpB,EAAA,IAAI,CAAA,KAAM,KAAK,OAAO,IAAA;AACtB,EAAA,IAAI,CAAA,KAAM,IAAI,OAAO,IAAA;AACrB,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,IAAK,EAAA,IAAM,CAAA,IAAK,IAAI,OAAO,IAAA;AAC5C,EAAA,IAAI,CAAA,KAAM,GAAA,IAAO,CAAA,KAAM,GAAA,EAAK,OAAO,IAAA;AACnC,EAAA,IAAI,CAAA,KAAM,GAAA,IAAO,CAAA,KAAM,GAAA,EAAK,OAAO,IAAA;AACnC,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,IAAK,EAAA,IAAM,CAAA,IAAK,KAAK,OAAO,IAAA;AAC7C,EAAA,IAAI,MAAM,GAAA,KAAQ,CAAA,KAAM,EAAA,IAAM,CAAA,KAAM,KAAK,OAAO,IAAA;AAChD,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,GAAG,OAAO,IAAA;AAC5C,EAAA,IAAI,CAAA,IAAK,KAAK,OAAO,IAAA;AACrB,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,qBAAA,CAAsB,IAAY,EAAA,EAAqB;AAC9D,EAAA,OAAO,wBAAwB,EAAA,IAAM,CAAA,EAAG,EAAA,GAAK,GAAA,EAAM,MAAM,CAAC,CAAA;AAC5D;AAOA,SAAS,WAAW,EAAA,EAA6B;AAC/C,EAAA,IAAI,IAAA,GAAO,GAAG,WAAA,EAAY;AAC1B,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,IAAI,QAAQ,CAAA,EAAG,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,GAAG,IAAI,CAAA;AACxC,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA,EAAG,OAAO,IAAA;AAE/D,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,WAAA,CAAY,GAAG,CAAA;AACtC,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,SAAA,GAAY,CAAC,CAAA;AACrC,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,IAAA,IAAI,MAAM,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,WAAA,CAAY,IAAA,CAAK,CAAC,CAAA,IAAK,MAAA,CAAO,CAAC,CAAA,GAAI,GAAG,GAAG,OAAO,IAAA;AAC7F,IAAA,MAAM,CAAC,GAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,GAAI,KAAA,CAAM,IAAI,MAAM,CAAA;AACrC,IAAA,IAAA,GAAO,CAAA,EAAG,KAAK,KAAA,CAAM,CAAA,EAAG,YAAY,CAAC,CAAC,IAAK,CAAA,IAAK,CAAA,GAAK,GAAG,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA,EAAA,CAAM,CAAA,IAAK,IAAK,CAAA,EAAG,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA;AAAA,EACrG;AAEA,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC9B,EAAA,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,OAAO,IAAA;AAC9B,EAAA,MAAM,QAAA,GAAW,CAAC,IAAA,KAAkB,IAAA,KAAS,KAAK,EAAC,GAAI,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AACrE,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,CAAC,KAAK,EAAE,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,MAAA,KAAW,CAAA,GAAI,QAAA,CAAS,OAAO,CAAC,CAAA,IAAK,EAAE,CAAA,GAAI,EAAC;AAChE,EAAA,IAAI,CAAC,GAAG,IAAA,EAAM,GAAG,IAAI,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,iBAAA,CAAkB,IAAA,CAAK,CAAC,CAAC,GAAG,OAAO,IAAA;AACvE,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM,QAAA,CAAS,CAAA,EAAG,EAAE,CAAC,CAAA,GAAI,IAAA;AAAA,EAChE;AACA,EAAA,MAAM,OAAA,GAAU,CAAA,GAAI,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA;AACvC,EAAA,IAAI,OAAA,GAAU,GAAG,OAAO,IAAA;AACxB,EAAA,OAAO,CAAC,GAAG,IAAA,EAAM,GAAG,KAAA,CAAc,OAAO,EAAE,IAAA,CAAK,GAAG,GAAG,GAAG,IAAI,EAAE,GAAA,CAAI,CAAC,MAAM,QAAA,CAAS,CAAA,EAAG,EAAE,CAAC,CAAA;AAC3F;AAEA,SAAS,wBAAwB,CAAA,EAAsB;AACrD,EAAA,MAAM,WAAA,GAAc,CAAC,CAAA,KAAc,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,KAAM,CAAC,CAAA;AACrE,EAAA,MAAM,CAAC,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,GAAK,CAAA,IAAK,KAAK,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,CAAC,CAAA,GAAI,CAAA;AACnE,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,EAAG,OAAO,IAAA;AAC3B,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,IAAK,EAAA,KAAO,GAAG,OAAO,IAAA;AACvC,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,IAAK,EAAA,KAAO,OAAQ,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACxE,EAAA,IAAI,YAAY,CAAC,CAAA,EAAG,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACvD,EAAA,IAAI,EAAA,KAAO,GAAA,IAAQ,EAAA,KAAO,KAAA,IAAU,EAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,KAAM,CAAC,CAAA,EAAG;AACvE,IAAA,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,OAAO,GAAA,IAAQ,EAAA,KAAO,KAAA,IAAU,EAAA,KAAO,GAAG,OAAO,IAAA;AACrD,EAAA,IAAI,EAAA,KAAO,IAAA,EAAQ,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACtD,EAAA,IAAI,EAAA,KAAO,IAAA,IAAU,EAAA,KAAO,CAAA,EAAG,OAAO,IAAA;AACtC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,OAAO,KAAA;AACT;AAWO,SAAS,sBAAsB,EAAA,EAAqB;AACzD,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,KAAA,CAAM,8CAA8C,CAAA;AAClE,EAAA,IAAI,EAAA,EAAI;AACN,IAAA,OAAO,uBAAA,CAAwB,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAA,EAAG,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAA,EAAG,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,IAAI,CAAC,EAAA,CAAG,QAAA,CAAS,GAAG,GAAG,OAAO,KAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,WAAW,EAAE,CAAA;AAC5B,EAAA,OAAO,MAAA,KAAW,IAAA,GAAO,IAAA,GAAO,uBAAA,CAAwB,MAAM,CAAA;AAChE;AAQO,SAAS,yBAAyB,QAAA,EAA2B;AAClE,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,WAAA,EAAY,CAAE,OAAA,CAAQ,YAAY,EAAE,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAA;AAC7E,EAAA,IAAI,SAAS,WAAA,IAAe,IAAA,CAAK,QAAA,CAAS,YAAY,GAAG,OAAO,IAAA;AAChE,EAAA,OAAO,sBAAsB,IAAI,CAAA;AACnC;;;AC5DO,IAAM,+CACX,IAAI,GAAA,CAAyB,CAAC,WAAA,EAAa,QAAQ,CAAC;AAG/C,SAAS,wBAAwB,MAAA,EAAqC;AAC3E,EAAA,OACE,MAAA,KAAW,MAAA,IACX,4BAAA,CAA6B,GAAA,CAAI,MAA6B,CAAA;AAElE;;;ACpDA,IAAM,WAAA,GAA8B,aAAA;AAG7B,SAAS,qBAAqB,UAAA,EAAgF;AACnH,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,SAAS,MAAA,CAAO,MAAA,CAAO,UAAA,IAAc,EAAE,CAAA,EAAG;AACnD,IAAA,IAAI,SAAS,KAAA,CAAM,MAAA,KAAW,aAAa,KAAA,CAAM,UAAA,KAAe,aAAa,KAAA,IAAS,CAAA;AAAA,EACxF;AACA,EAAA,OAAO,KAAA;AACT;AAQO,SAAS,gBAAA,CACd,QACA,UAAA,EAC8B;AAC9B,EAAA,IAAI,MAAA,KAAW,aAAa,OAAO,MAAA;AACnC,EAAA,OAAO,oBAAA,CAAqB,UAAU,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AAChE","file":"chunk-2QKF7M2Z.js","sourcesContent":["/**\n * Utilities for detecting and filtering expanded loop clones.\n * Shared between frontend (store, persistence, execution) and backend (orchestrator).\n */\n\nimport type { GenericNode, GenericEdge } from \"./types.js\"\n\n/** Matches node IDs like `node_7_iter_0`, `node_7_iter_1`, etc. */\nexport const ITER_CLONE_PATTERN = /_iter_\\d+$/\n\n/** Returns true if the node is an expanded loop clone (by flag or ID pattern). */\nexport function isExpandedClone(node: GenericNode): boolean {\n return !!(node.data as Record<string, unknown>).__expandedClone || ITER_CLONE_PATTERN.test(node.id)\n}\n\n/**\n * Filter out expanded clone nodes and edges that reference them.\n * Unhides original nodes that were hidden during loop expansion.\n * Optionally filters sub-workflow nodes (prefix `__sub_`).\n */\nexport function filterCloneNodes<N extends GenericNode, E extends GenericEdge>(\n nodes: N[],\n edges: E[],\n options?: { filterSubWorkflow?: boolean },\n): { nodes: N[]; edges: E[] } {\n const filterSub = options?.filterSubWorkflow ?? false\n\n const cloneIds = new Set(\n nodes.filter((n) => isExpandedClone(n)).map((n) => n.id),\n )\n\n const filteredNodes = nodes\n .filter((n) => {\n if (cloneIds.has(n.id)) return false\n if (filterSub && n.id.startsWith(\"__sub_\")) return false\n return true\n })\n .map((n) => (n.hidden ? { ...n, hidden: false } as N : n))\n\n const filteredEdges = edges.filter((e) => {\n if (filterSub && (e as { id?: string }).id?.startsWith(\"__sub_\")) return false\n return !cloneIds.has(e.source) && !cloneIds.has(e.target)\n })\n\n return { nodes: filteredNodes, edges: filteredEdges }\n}\n","import type { OutputType } from \"./presentation-utils.js\"\n\n// Intentional subset of OutputType (presentation-utils.ts:152) —\n// excludes \"data\" (multi-output / opaque types are skipped from aggregation).\nexport type AggregateableType = \"text\" | \"image\" | \"video\" | \"audio\"\n\n// Stable ordered tuple of aggregateable types — used for handle ordering + presentTypes.\nexport const AGGREGATEABLE_TYPES = [\"text\", \"image\", \"video\", \"audio\"] as const\n\nexport interface Member {\n nodeId: string\n type: AggregateableType\n value: string\n}\n\nexport interface AggregationBuckets {\n text: string[]\n image: string[]\n video: string[]\n audio: string[]\n}\n\nexport function aggregateByType(members: Member[]): AggregationBuckets {\n const buckets: AggregationBuckets = { text: [], image: [], video: [], audio: [] }\n for (const m of members) buckets[m.type].push(m.value)\n return buckets\n}\n\nexport function presentTypes(buckets: AggregationBuckets): AggregateableType[] {\n return AGGREGATEABLE_TYPES.filter((t) => buckets[t].length > 0)\n}\n\n// Type guard for narrowing OutputType to AggregateableType.\nexport function isAggregateableType(t: OutputType | undefined): t is AggregateableType {\n return t === \"text\" || t === \"image\" || t === \"video\" || t === \"audio\"\n}\n\n// Handle id naming conventions for Group / Collect dynamic output handles + Collect's single input handle.\nexport const GROUP_HANDLE_PREFIX = \"out-\" as const\nexport const COLLECT_IN_HANDLE = \"in\" as const\n\nexport function groupHandleId(t: AggregateableType): string {\n return `${GROUP_HANDLE_PREFIX}${t}`\n}\n\nexport function parseGroupHandle(h: string | null | undefined): AggregateableType | undefined {\n if (!h || !h.startsWith(GROUP_HANDLE_PREFIX)) return undefined\n const candidate = h.slice(GROUP_HANDLE_PREFIX.length) as OutputType\n return isAggregateableType(candidate) ? candidate : undefined\n}\n\n/**\n * Build a parent → children-ids map from a flat node array in a single pass.\n * Used by both engines' `buildExecutionLevels` to derive the implicit\n * child → group dependency edges in O(N+G) instead of O(N×G).\n */\nexport function buildChildrenByParent<N extends { id: string; parentId?: string }>(\n nodes: ReadonlyArray<N>,\n): Map<string, string[]> {\n const childrenByParent = new Map<string, string[]>()\n for (const n of nodes) {\n if (!n.parentId) continue\n const list = childrenByParent.get(n.parentId)\n if (list) list.push(n.id)\n else childrenByParent.set(n.parentId, [n.id])\n }\n return childrenByParent\n}\n\n// Whether an edge targets a Collect node's \"in\" handle. The default-\"in\" fallback\n// matches every other call site so legacy edges without an explicit targetHandle\n// keep working. Duck-typed input shape avoids a runtime dep on @xyflow/react.\nexport function isCollectInEdge(e: { targetHandle?: string | null }): boolean {\n return (e.targetHandle ?? COLLECT_IN_HANDLE) === COLLECT_IN_HANDLE\n}\n\n/**\n * The source-pip lanes an aggregate node (Group / Collect) must EXPOSE.\n *\n * Bucket contents alone are not enough: buckets are computed from upstream\n * RESULTS, so before anything ran the node rendered zero source handles — a\n * pre-authored edge out of the node (MCP-written JSON, import, paste) pointed\n * at a handle that did not exist and React Flow silently hid it (\"connected\n * in the panel, invisible on canvas\"), and there was no pip to drag outward\n * from. A lane therefore exists when ANY of these hold:\n * (a) a wired member / input of that aggregateable type exists (pre-run),\n * (b) the bucket for that type has values (post-run),\n * (c) an existing outgoing edge references the lane's handle — so an edge\n * can never point at a missing handle, whatever state authored it\n * (also covers results being cleared after wiring downstream).\n * Ordered by AGGREGATEABLE_TYPES so the handle layout is stable.\n */\nexport function computeAggregateLanes(\n nodeId: string,\n wiredTypes: Iterable<AggregateableType>,\n buckets: AggregationBuckets,\n edges: ReadonlyArray<{ source: string; sourceHandle?: string | null }>,\n): AggregateableType[] {\n const present = new Set<AggregateableType>(wiredTypes)\n for (const t of presentTypes(buckets)) present.add(t)\n for (const e of edges) {\n if (e.source !== nodeId) continue\n const lane = parseGroupHandle(e.sourceHandle)\n if (lane) present.add(lane)\n }\n return AGGREGATEABLE_TYPES.filter((t) => present.has(t))\n}\n","/**\n * Non-linear progress calculation using quadratic ease-out curve.\n * Returns 0–99 during execution, never reaching 100 (that's set on completion).\n *\n * Formula: progress = 99 * (1 - (1 - t)^exponent)\n * where t = clamp(elapsedMs / estimatedMs, 0, 1)\n */\nexport function calculateProgress(\n elapsedMs: number,\n estimatedMs: number,\n exponent: number = 2,\n): number {\n if (estimatedMs <= 0) return 0\n const t = Math.min(Math.max(elapsedMs / estimatedMs, 0), 1)\n return Math.round(99 * (1 - Math.pow(1 - t, exponent)))\n}\n\n/** Category-based fallback durations (ms) when no historical data exists. */\nexport const CATEGORY_DURATION_DEFAULTS: Record<string, number> = {\n image: 30_000,\n video: 120_000,\n \"audio-tts\": 15_000,\n music: 60_000,\n llm: 8_000,\n upscale: 30_000,\n inline: 500,\n}\n\n/**\n * Compute weighted progress segments for a multi-node flow.\n * Each node gets a proportional slice of 0–99% based on its estimated duration.\n *\n * Returns array of { nodeId, startPct, endPct, estimatedMs } in execution order.\n */\nexport interface ProgressSegment {\n nodeId: string\n startPct: number\n endPct: number\n estimatedMs: number\n}\n\nexport function buildProgressSegments(\n nodeEstimates: { nodeId: string; estimatedMs: number }[],\n): ProgressSegment[] {\n const totalMs = nodeEstimates.reduce((sum, n) => sum + n.estimatedMs, 0)\n if (totalMs <= 0) return []\n\n const segments: ProgressSegment[] = []\n let cursor = 0\n\n for (let i = 0; i < nodeEstimates.length; i++) {\n const { nodeId, estimatedMs } = nodeEstimates[i]\n const sliceWidth = (estimatedMs / totalMs) * 99\n const isLast = i === nodeEstimates.length - 1\n segments.push({\n nodeId,\n startPct: cursor,\n // Last segment always stretches to exactly 99\n endPct: isLast ? 99 : cursor + sliceWidth,\n estimatedMs,\n })\n cursor += sliceWidth\n }\n\n return segments\n}\n\n/**\n * Calculate combined progress for a multi-node flow given current node states.\n */\nexport function calculateCombinedProgress(\n segments: ProgressSegment[],\n nodeStatuses: Record<string, {\n status: \"pending\" | \"running\" | \"completed\" | \"failed\" | \"skipped\"\n startedAt?: string\n }>,\n now: number = Date.now(),\n): number {\n let progress = 0\n\n for (const seg of segments) {\n const state = nodeStatuses[seg.nodeId]\n if (!state) continue\n\n const sliceWidth = seg.endPct - seg.startPct\n\n if (state.status === \"completed\" || state.status === \"skipped\") {\n progress += sliceWidth\n } else if (state.status === \"running\" && state.startedAt) {\n const elapsed = now - new Date(state.startedAt).getTime()\n const nodeProgress = calculateProgress(elapsed, seg.estimatedMs)\n // Map node's 0–99% to this segment's slice\n progress += (nodeProgress / 99) * sliceWidth\n }\n // pending/failed contribute 0\n }\n\n return Math.round(Math.min(progress, 99))\n}\n","/**\n * Shared BFS utility for computing reachable node IDs along a route.\n * Used by both frontend (RunTargetSelector stale guard) and backend\n * (presentation.ts, app-runner.ts, sub-workflow-handler.ts).\n */\n\nexport interface MinimalNode {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nexport interface MinimalEdge {\n source: string\n target: string\n}\n\n/**\n * BFS in one direction from a start node.\n */\nfunction bfs(\n startId: string,\n edges: readonly MinimalEdge[],\n direction: \"forward\" | \"backward\",\n): Set<string> {\n const visited = new Set<string>()\n const queue = [startId]\n\n while (queue.length > 0) {\n const current = queue.shift()!\n if (visited.has(current)) continue\n visited.add(current)\n\n for (const edge of edges) {\n if (direction === \"forward\" && edge.source === current && !visited.has(edge.target)) {\n queue.push(edge.target)\n } else if (direction === \"backward\" && edge.target === current && !visited.has(edge.source)) {\n queue.push(edge.source)\n }\n }\n }\n\n return visited\n}\n\n/**\n * Compute the set of node IDs reachable along a route.\n * 1. Finds the sub-workflow-input node with matching routeId\n * 2. Finds the sub-workflow-output node with matching routeId\n * 3. BFS forward from input, BFS backward from output, intersect\n * Returns empty set if input or output node not found (stale routeId).\n */\nexport function getRouteReachableNodeIds(\n nodes: readonly MinimalNode[],\n edges: readonly MinimalEdge[],\n routeId: string,\n): Set<string> {\n const inputNode = nodes.find(\n (n) => n.type === \"sub-workflow-input\" && (n.data as Record<string, unknown>).routeId === routeId,\n )\n const outputNode = nodes.find(\n (n) => n.type === \"sub-workflow-output\" && (n.data as Record<string, unknown>).routeId === routeId,\n )\n\n if (!inputNode || !outputNode) return new Set()\n\n const forwardReachable = bfs(inputNode.id, edges, \"forward\")\n const backwardReachable = bfs(outputNode.id, edges, \"backward\")\n\n const reachable = new Set<string>()\n for (const id of forwardReachable) {\n if (backwardReachable.has(id)) reachable.add(id)\n }\n\n // Always include input and output\n reachable.add(inputNode.id)\n reachable.add(outputNode.id)\n\n return reachable\n}\n","/**\n * R2-key + result-id suffix for multi-variant jobs. Provider returns multiple\n * URLs from a single task (Grok = up to 6 images, Suno = 2 tracks); each\n * variant gets a deterministic suffix-keyed ID so primary stays at the original\n * jobId for backwards compat and extras land under `${jobId}-v1`, `${jobId}-v2`, …\n *\n * Used by:\n * - backend `uploadImageVariantsMaybeWatermark` (R2 key)\n * - backend Suno `uploadAllSunoTracks` (R2 key)\n * - frontend `poll-job.ts handleJobCompleted` (GeneratedResult.jobId)\n * - frontend `run-handlers.ts` orchestrator poll loop (GeneratedResult.jobId)\n *\n * Changing the suffix scheme requires updating every caller, hence the shared helper.\n */\nexport function variantJobId(baseJobId: string, index: number): string {\n return index === 0 ? baseJobId : `${baseJobId}-v${index}`\n}\n","// --- Types ---\n\nexport type FilterOperator =\n | \"equals\" | \"not_equals\"\n | \"contains\" | \"not_contains\"\n | \"starts_with\" | \"ends_with\"\n | \"greater_than\" | \"less_than\"\n | \"is_empty\" | \"is_not_empty\"\n | \"matches_regex\"\n | \"in_list\"\n\nexport interface JsonFilter {\n id: string\n field: string\n operator: FilterOperator\n value: string | string[]\n}\n\nexport type JsonEvalResult =\n | { ok: true; value: unknown }\n | { ok: false; error: string }\n\n// --- Helpers ---\n\nconst BARE_IDENT = /^[a-zA-Z_$][a-zA-Z0-9_$]*$/\n\nfunction escapeString(v: string): string {\n return v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"')\n}\n\nfunction fieldRef(field: string): string {\n return BARE_IDENT.test(field) ? `.${field}` : `.[\"${escapeString(field)}\"]`\n}\n\nfunction coerceValue(v: string): string {\n const trimmed = v.trim()\n if (trimmed === \"\" || trimmed === \"Infinity\" || trimmed === \"-Infinity\" || trimmed === \"NaN\") return `\"${trimmed}\"`\n const n = Number(trimmed)\n return Number.isFinite(n) ? String(n) : `\"${escapeString(trimmed)}\"`\n}\n\nfunction buildFilterExpr(f: JsonFilter): string {\n const ref = fieldRef(f.field)\n switch (f.operator) {\n case \"equals\": return `select(${ref} == ${coerceValue(f.value as string)})`\n case \"not_equals\": return `select(${ref} != ${coerceValue(f.value as string)})`\n case \"contains\": return `select(${ref} | contains(\"${escapeString(f.value as string)}\"))`\n case \"not_contains\": return `select(${ref} | contains(\"${escapeString(f.value as string)}\") | not)`\n case \"starts_with\": return `select(${ref} | startswith(\"${escapeString(f.value as string)}\"))`\n case \"ends_with\": return `select(${ref} | endswith(\"${escapeString(f.value as string)}\"))`\n case \"greater_than\": {\n const n = Number((f.value as string).trim())\n if (!Number.isFinite(n)) return `select(${ref} > 0)`\n return `select(${ref} > ${n})`\n }\n case \"less_than\": {\n const n = Number((f.value as string).trim())\n if (!Number.isFinite(n)) return `select(${ref} < 0)`\n return `select(${ref} < ${n})`\n }\n case \"is_empty\": return `select(${ref} == null or ${ref} == \"\")`\n case \"is_not_empty\": return `select(${ref} != null and ${ref} != \"\")`\n case \"matches_regex\": return `select(${ref} | test(\"${escapeString(f.value as string)}\"))`\n case \"in_list\": {\n // Tolerate string form: users can switch operator to \"in_list\" while the\n // previous operator's string value is still in place. Comma-split so the\n // config panel's \"a, b, c\" shape works before it's persisted as an array.\n const raw = Array.isArray(f.value)\n ? f.value\n : String(f.value ?? \"\").split(\",\").map((s) => s.trim()).filter(Boolean)\n if (raw.length === 0) return `select(false)`\n const items = raw.map((v) => `${ref} == ${coerceValue(v)}`)\n return `select(${items.join(\" or \")})`\n }\n default: return `select(true)`\n }\n}\n\n// --- Public API ---\n\nexport function buildExpressionFromVisual(config: {\n inputPath?: string\n filters?: JsonFilter[]\n projections?: string[]\n}): string {\n const { inputPath, filters = [], projections = [] } = config\n const hasFilters = filters.length > 0\n const hasProjections = projections.length > 0\n const hasPath = !!inputPath && inputPath.trim().length > 0\n\n // Stage 1: path\n let path = hasPath ? `.${inputPath}` : \".\"\n\n // Append [] if filters or projections exist\n if (hasFilters || hasProjections) {\n path += \"[]\"\n }\n\n // If nothing configured, return identity\n if (!hasPath && !hasFilters && !hasProjections) return \".\"\n\n const parts: string[] = [path]\n\n // Stage 2: filters (AND via separate select pipes)\n for (const f of filters) {\n parts.push(buildFilterExpr(f))\n }\n\n // Stage 3: projections\n if (hasProjections) {\n const fields = projections.map((p) => {\n if (BARE_IDENT.test(p)) return p\n return `\"${p}\": .[\"${p}\"]`\n })\n parts.push(`{${fields.join(\", \")}}`)\n }\n\n return parts.join(\" | \")\n}\n\n// --- Tokenizer ---\n\ntype TokType =\n | \"DOT\" | \"PIPE\" | \"LBRACE\" | \"RBRACE\" | \"LBRACKET\" | \"RBRACKET\"\n | \"LPAREN\" | \"RPAREN\" | \"COMMA\" | \"COLON\"\n | \"EMPTY_ITER\" // []\n | \"INDEX\" // [N] or [-N]\n | \"BRACKET_KEY\" // [\"str\"]\n | \"IDENT\" // bare identifier or keyword\n | \"STRING\" // \"...\"\n | \"NUMBER\" // 42 / 3.14\n | \"OP\" // == != > < >= <=\n\ninterface Token { type: TokType; value: string | number }\n\nfunction tokenize(expr: string): Token[] {\n const tokens: Token[] = []\n let i = 0\n\n while (i < expr.length) {\n // whitespace\n if (/\\s/.test(expr[i])) { i++; continue }\n\n const ch = expr[i]\n\n // single-char structural\n if (ch === \".\") { tokens.push({ type: \"DOT\", value: \".\" }); i++; continue }\n if (ch === \"|\") { tokens.push({ type: \"PIPE\", value: \"|\" }); i++; continue }\n if (ch === \"{\") { tokens.push({ type: \"LBRACE\", value: \"{\" }); i++; continue }\n if (ch === \"}\") { tokens.push({ type: \"RBRACE\", value: \"}\" }); i++; continue }\n if (ch === \"(\") { tokens.push({ type: \"LPAREN\", value: \"(\" }); i++; continue }\n if (ch === \")\") { tokens.push({ type: \"RPAREN\", value: \")\" }); i++; continue }\n if (ch === \",\") { tokens.push({ type: \"COMMA\", value: \",\" }); i++; continue }\n if (ch === \":\") { tokens.push({ type: \"COLON\", value: \":\" }); i++; continue }\n\n // bracket forms: [], [N], [-N], [\"str\"]\n if (ch === \"[\") {\n const rest = expr.slice(i)\n // [\"str\"]\n const bkStr = rest.match(/^\\[\"((?:[^\"\\\\]|\\\\.)*)\"\\]/)\n if (bkStr) {\n const unescaped = bkStr[1].replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, \"\\\\\").replace(/\\\\n/g, \"\\n\").replace(/\\\\t/g, \"\\t\")\n tokens.push({ type: \"BRACKET_KEY\", value: unescaped })\n i += bkStr[0].length; continue\n }\n // []\n const bkEmpty = rest.match(/^\\[\\]/)\n if (bkEmpty) {\n tokens.push({ type: \"EMPTY_ITER\", value: \"[]\" })\n i += 2; continue\n }\n // [-N] or [N]\n const bkIdx = rest.match(/^\\[-?(\\d+)\\]/)\n if (bkIdx) {\n const raw = rest.match(/^\\[(-?\\d+)\\]/)!\n tokens.push({ type: \"INDEX\", value: parseInt(raw[1], 10) })\n i += raw[0].length; continue\n }\n // standalone [ (for parser completeness — treated as error later)\n tokens.push({ type: \"LBRACKET\", value: \"[\" }); i++; continue\n }\n\n // two-char operators\n if (i + 1 < expr.length) {\n const two = expr.slice(i, i + 2)\n if (two === \"==\" || two === \"!=\" || two === \">=\" || two === \"<=\") {\n tokens.push({ type: \"OP\", value: two }); i += 2; continue\n }\n }\n if (ch === \">\" || ch === \"<\") {\n tokens.push({ type: \"OP\", value: ch }); i++; continue\n }\n\n // string literal\n if (ch === '\"') {\n let s = \"\"\n i++ // skip opening \"\n while (i < expr.length && expr[i] !== '\"') {\n if (expr[i] === \"\\\\\") {\n i++\n const esc = expr[i]\n if (esc === '\"') s += '\"'\n else if (esc === \"\\\\\") s += \"\\\\\"\n else if (esc === \"n\") s += \"\\n\"\n else if (esc === \"t\") s += \"\\t\"\n else s += esc\n } else {\n s += expr[i]\n }\n i++\n }\n if (expr[i] !== '\"') throw new Error(\"Unterminated string literal\")\n i++ // skip closing \"\n tokens.push({ type: \"STRING\", value: s }); continue\n }\n\n // number\n if (/[0-9]/.test(ch) || (ch === \"-\" && /[0-9]/.test(expr[i + 1] ?? \"\"))) {\n const m = expr.slice(i).match(/^-?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?/)\n if (m) {\n const n = Number(m[0])\n if (!Number.isFinite(n)) throw new Error(`Invalid number: ${m[0]}`)\n tokens.push({ type: \"NUMBER\", value: n })\n i += m[0].length; continue\n }\n }\n\n // identifier / keyword\n const idm = expr.slice(i).match(/^[a-zA-Z_$][a-zA-Z0-9_$]*/)\n if (idm) {\n tokens.push({ type: \"IDENT\", value: idm[0] })\n i += idm[0].length; continue\n }\n\n throw new Error(`Unexpected character '${ch}' at position ${i}`)\n }\n\n return tokens\n}\n\n// --- AST Node Types ---\n\ntype AstNode =\n | { k: \"identity\" }\n | { k: \"dot\"; field: string }\n | { k: \"bracket\"; key: string }\n | { k: \"iterate\" }\n | { k: \"index\"; index: number }\n | { k: \"pipe\"; left: AstNode; right: AstNode }\n | { k: \"select\"; cond: AstNode }\n | { k: \"object\"; fields: Array<{ key: string; valueExpr: AstNode | null }> }\n | { k: \"compare\"; op: string; left: AstNode; right: AstNode }\n | { k: \"bool\"; op: \"and\" | \"or\"; left: AstNode; right: AstNode }\n | { k: \"not\" }\n | { k: \"func\"; name: string; arg: string }\n | { k: \"literal\"; value: string | number }\n | { k: \"path\"; steps: AstNode[] } // chained dot/bracket/iterate/index\n\n// --- Parser ---\n\nclass Parser {\n private pos = 0\n constructor(private tokens: Token[]) {}\n\n private peek(): Token | undefined { return this.tokens[this.pos] }\n private eat(): Token {\n const t = this.tokens[this.pos++]\n if (!t) throw new Error(\"Unexpected end of expression\")\n return t\n }\n private expect(type: TokType): Token {\n const t = this.eat()\n if (t.type !== type) throw new Error(`Expected ${type}, got ${t.type} ('${t.value}')`)\n return t\n }\n private at(type: TokType): boolean { return this.peek()?.type === type }\n private atIdent(v: string): boolean { return this.peek()?.type === \"IDENT\" && this.peek()?.value === v }\n private done(): boolean { return this.pos >= this.tokens.length }\n\n parse(): AstNode {\n const node = this.parsePipe()\n if (!this.done()) throw new Error(`Unexpected token '${this.peek()!.value}' at position ${this.pos}`)\n return node\n }\n\n private parsePipe(): AstNode {\n let left = this.parseBoolExpr()\n while (this.at(\"PIPE\")) {\n this.eat() // consume |\n const right = this.parseBoolExpr()\n left = { k: \"pipe\", left, right }\n }\n return left\n }\n\n private parseBoolExpr(): AstNode {\n let left = this.parseCompare()\n while (this.atIdent(\"and\") || this.atIdent(\"or\")) {\n const op = this.eat().value as \"and\" | \"or\"\n const right = this.parseCompare()\n left = { k: \"bool\", op, left, right }\n }\n return left\n }\n\n private parseCompare(): AstNode {\n const left = this.parseAtom()\n if (this.at(\"OP\")) {\n const op = this.eat().value as string\n const right = this.parseAtom()\n return { k: \"compare\", op, left, right }\n }\n return left\n }\n\n // parseAtom handles all leaf-level filter constructs\n private parseAtom(): AstNode {\n // select(...)\n if (this.atIdent(\"select\")) {\n this.eat()\n this.expect(\"LPAREN\")\n // Allow full pipe expressions inside select (e.g., select(.name | contains(\"x\")))\n const cond = this.parsePipe()\n this.expect(\"RPAREN\")\n return { k: \"select\", cond }\n }\n // not (postfix — standalone in pipe context)\n if (this.atIdent(\"not\")) {\n this.eat()\n return { k: \"not\" }\n }\n // object construction\n if (this.at(\"LBRACE\")) {\n return this.parseObjectCtor()\n }\n // string function calls (contains, startswith, endswith, test) with arg\n if (this.at(\"IDENT\")) {\n const name = this.peek()!.value as string\n if ([\"contains\", \"startswith\", \"endswith\", \"test\"].includes(name)) {\n // look ahead for (\n if (this.tokens[this.pos + 1]?.type === \"LPAREN\") {\n this.eat() // name\n this.eat() // (\n const argTok = this.eat()\n if (argTok.type !== \"STRING\") throw new Error(`${name}() argument must be a string`)\n this.expect(\"RPAREN\")\n return { k: \"func\", name, arg: argTok.value as string }\n }\n }\n }\n // parenthesised expression\n if (this.at(\"LPAREN\")) {\n this.eat()\n const inner = this.parseBoolExpr()\n this.expect(\"RPAREN\")\n return inner\n }\n // literals and paths\n if (this.at(\"STRING\")) {\n return { k: \"literal\", value: this.eat().value as string }\n }\n if (this.at(\"NUMBER\")) {\n return { k: \"literal\", value: this.eat().value as number }\n }\n return this.parsePath()\n }\n\n private parsePath(): AstNode {\n if (!this.at(\"DOT\")) throw new Error(`Expected path starting with '.', got '${this.peek()?.value ?? \"EOF\"}'`)\n this.eat() // consume .\n\n // bare \".\" — identity\n const steps: AstNode[] = []\n\n // after dot, there may be an identifier or a bracket form\n if (this.at(\"IDENT\") && ![\"select\",\"not\",\"contains\",\"startswith\",\"endswith\",\"test\",\"and\",\"or\",\"null\",\"true\",\"false\"].includes(this.peek()!.value as string)) {\n steps.push({ k: \"dot\", field: this.eat().value as string })\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat()\n steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n // just \".\"\n if (steps.length === 0) return { k: \"identity\" }\n }\n\n // chain more accesses: .foo.bar, .foo[0], .foo[]\n while (true) {\n if (this.at(\"DOT\")) {\n this.eat()\n if (this.at(\"IDENT\") && ![\"select\",\"not\",\"contains\",\"startswith\",\"endswith\",\"test\",\"and\",\"or\"].includes(this.peek()!.value as string)) {\n steps.push({ k: \"dot\", field: this.eat().value as string })\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat(); steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n // trailing dot — treat as identity at end (shouldn't normally happen)\n break\n }\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat(); steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n break\n }\n }\n\n if (steps.length === 0) return { k: \"identity\" }\n if (steps.length === 1) return steps[0]\n return { k: \"path\", steps }\n }\n\n private parseObjectCtor(): AstNode {\n this.eat() // {\n const fields: Array<{ key: string; valueExpr: AstNode | null }> = []\n\n while (!this.at(\"RBRACE\") && !this.done()) {\n let key: string\n let valueExpr: AstNode | null = null\n\n if (this.at(\"IDENT\")) {\n key = this.eat().value as string\n if (this.at(\"COLON\")) {\n this.eat() // :\n valueExpr = this.parsePipe()\n }\n // else shorthand: {name} => {name: .name}\n } else if (this.at(\"STRING\")) {\n key = this.eat().value as string\n this.expect(\"COLON\")\n valueExpr = this.parsePipe()\n } else {\n throw new Error(`Expected field name in object constructor, got '${this.peek()?.value}'`)\n }\n\n fields.push({ key, valueExpr })\n if (this.at(\"COMMA\")) this.eat()\n }\n\n this.expect(\"RBRACE\")\n return { k: \"object\", fields }\n }\n}\n\n// --- Evaluator ---\n\n// Sentinel to represent \"this item was dropped by select\"\nconst DROPPED = Symbol(\"DROPPED\")\n// Sentinel to track that we're in iterate mode (stream of items)\ntype EvalValue = unknown | typeof DROPPED\n\nfunction isTruthy(v: unknown): boolean {\n if (v === null || v === undefined || v === false || v === 0 || v === \"\") return false\n return true\n}\n\n// --- Per-call evaluation context ---\n\ninterface EvalCtx {\n expandedArrays: WeakSet<object>\n objectSourcedArrays: WeakSet<object>\n regexCache: Map<string, RegExp>\n}\n\nfunction evalNode(node: AstNode, input: unknown, ctx: EvalCtx): EvalValue | EvalValue[] {\n switch (node.k) {\n case \"identity\":\n return input\n\n case \"dot\": {\n if (input === null || input === undefined) return null\n if (typeof input !== \"object\" || Array.isArray(input)) {\n throw new Error(`Cannot access field '.${node.field}' on ${Array.isArray(input) ? \"array\" : typeof input}`)\n }\n const obj = input as Record<string, unknown>\n if (!(node.field in obj)) {\n const available = Object.keys(obj).join(\", \")\n throw new Error(`Field '${node.field}' not found. Available fields: ${available || \"(none)\"}`)\n }\n return obj[node.field]\n }\n\n case \"bracket\": {\n if (input === null || input === undefined) return null\n if (typeof input !== \"object\" || Array.isArray(input)) {\n throw new Error(`Cannot bracket-access on ${Array.isArray(input) ? \"array\" : typeof input}`)\n }\n const obj = input as Record<string, unknown>\n if (!(node.key in obj)) {\n const available = Object.keys(obj).join(\", \")\n throw new Error(`Field '${node.key}' not found. Available fields: ${available || \"(none)\"}`)\n }\n return obj[node.key]\n }\n\n case \"index\": {\n if (!Array.isArray(input)) throw new Error(`Cannot index non-array with .[${node.index}]`)\n const idx = node.index < 0 ? input.length + node.index : node.index\n return idx >= 0 && idx < input.length ? input[idx] : null\n }\n\n case \"iterate\": {\n if (Array.isArray(input)) {\n return input // return as array — caller handles fan-out\n }\n if (typeof input === \"object\" && input !== null) {\n // treat object as single-item sequence per spec\n const arr = [input]\n ctx.objectSourcedArrays.add(arr)\n return arr\n }\n throw new Error(`Cannot iterate over ${typeof input}`)\n }\n\n case \"path\": {\n let cur: unknown = input\n for (let i = 0; i < node.steps.length; i++) {\n const step = node.steps[i]\n const res = evalNode(step, cur, ctx)\n // if a step returns an array (from iterate), fan out remaining steps\n if (step.k === \"iterate\" && Array.isArray(res)) {\n const wasObjSourced = ctx.objectSourcedArrays.has(res as object)\n // fan out remaining steps over each element\n const remaining = node.steps.slice(i + 1)\n if (remaining.length === 0) return res\n const fanned: unknown[] = []\n for (const item of res) {\n const subNode: AstNode = remaining.length === 1 ? remaining[0] : { k: \"path\", steps: remaining }\n const subRes = evalNode(subNode, item, ctx)\n if (Array.isArray(subRes)) fanned.push(...subRes)\n else if (subRes !== DROPPED) fanned.push(subRes)\n }\n return markExpanded(fanned, wasObjSourced, ctx)\n }\n cur = res\n }\n return cur\n }\n\n case \"pipe\": {\n // Evaluate left side; if it produces an array (from iterate), fan-out over right side\n const leftVal = evalNode(node.left, input, ctx)\n\n // Check if left side was an iterate that produced array expansion\n const leftIsExpanded = isExpandedArray(node.left, leftVal, ctx)\n\n if (leftIsExpanded && Array.isArray(leftVal)) {\n const wasObjectSourced = ctx.objectSourcedArrays.has(leftVal as object)\n const results: unknown[] = []\n for (const item of leftVal) {\n const r = evalNode(node.right, item, ctx)\n if (r === DROPPED) continue\n if (Array.isArray(r) && isExpandedArray(node.right, r, ctx)) {\n results.push(...r)\n } else if (r !== DROPPED) {\n results.push(r)\n }\n }\n // mark as expanded, preserving object-sourced flag\n return markExpanded(results, wasObjectSourced, ctx)\n }\n\n if (leftVal === DROPPED) return DROPPED\n\n // scalar left — apply right once\n return evalNode(node.right, leftVal, ctx)\n }\n\n case \"select\": {\n const condVal = evalNode(node.cond, input, ctx)\n // If condition is a pipe that produced an expanded array (e.g., select(.name | contains(\"x\"))),\n // the truthiness is based on the final scalar result (the pipe's output).\n // An expanded array here means the condition pipeline returned array results — use last item.\n if (Array.isArray(condVal) && ctx.expandedArrays.has(condVal)) {\n const last = condVal[condVal.length - 1]\n return isTruthy(last) ? input : DROPPED\n }\n return isTruthy(condVal as unknown) ? input : DROPPED\n }\n\n case \"not\": {\n return !isTruthy(input)\n }\n\n case \"object\": {\n const result: Record<string, unknown> = {}\n for (const { key, valueExpr } of node.fields) {\n let fieldVal: unknown\n if (valueExpr === null) {\n // shorthand: {name} => .name\n fieldVal = evalNode({ k: \"dot\", field: key }, input, ctx)\n } else {\n fieldVal = evalNode(valueExpr, input, ctx)\n }\n if (fieldVal === DROPPED) return DROPPED\n result[key] = fieldVal\n }\n return result\n }\n\n case \"compare\": {\n const lv = evalNode(node.left, input, ctx) as unknown\n const rv = evalNode(node.right, input, ctx) as unknown\n switch (node.op) {\n case \"==\": return lv === rv\n case \"!=\": return lv !== rv\n case \">\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv > rv : false\n case \"<\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv < rv : false\n case \">=\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv >= rv : false\n case \"<=\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv <= rv : false\n default: return false\n }\n }\n\n case \"bool\": {\n const lv = evalNode(node.left, input, ctx)\n if (node.op === \"and\") {\n if (!isTruthy(lv as unknown)) return false\n return isTruthy(evalNode(node.right, input, ctx) as unknown)\n } else {\n if (isTruthy(lv as unknown)) return true\n return isTruthy(evalNode(node.right, input, ctx) as unknown)\n }\n }\n\n case \"func\": {\n if (typeof input !== \"string\") throw new Error(`${node.name}() requires a string input`)\n switch (node.name) {\n case \"contains\": return input.includes(node.arg)\n case \"startswith\": return input.startsWith(node.arg)\n case \"endswith\": return input.endsWith(node.arg)\n case \"test\": {\n let re = ctx.regexCache.get(node.arg)\n if (!re) {\n if (/(\\([^)]*[+*][^)]*\\))[+*]/.test(node.arg)) {\n throw new Error(\"Regex pattern too complex — avoid nested quantifiers\")\n }\n re = new RegExp(node.arg)\n ctx.regexCache.set(node.arg, re)\n }\n return re.test(input.slice(0, 100000))\n }\n default: throw new Error(`Unknown function: ${node.name}`)\n }\n }\n\n case \"literal\":\n return node.value\n\n default: {\n const _exhaustive: never = node\n throw new Error(`Unknown AST node`)\n }\n }\n}\n\n// --- Expanded array tracking ---\n// expandedArrays: arrays produced by iterate fan-out (pipe needs to fan-out over them)\n// objectSourcedArrays: expanded arrays whose origin was object iteration (unwrap at output)\n\nfunction markExpanded(arr: unknown[], objectSourced: boolean, ctx: EvalCtx): unknown[] {\n ctx.expandedArrays.add(arr)\n if (objectSourced) ctx.objectSourcedArrays.add(arr)\n return arr\n}\n\nfunction isExpandedArray(node: AstNode, val: unknown, ctx: EvalCtx): boolean {\n if (!Array.isArray(val)) return false\n // If left side is an iterate node directly, it's always expanded\n if (node.k === \"iterate\") return true\n // If left side is a path ending in iterate, check the last step\n if (node.k === \"path\") {\n const last = node.steps[node.steps.length - 1]\n if (last?.k === \"iterate\") return true\n }\n // If left side is a pipe that produced an expanded array\n if (node.k === \"pipe\") return ctx.expandedArrays.has(val as object)\n // Check WeakSet\n return ctx.expandedArrays.has(val as object)\n}\n\n// --- Public API ---\n\nexport function jsonResultToList(value: unknown): string[] {\n if (Array.isArray(value)) {\n return value.map((v) => typeof v === \"string\" ? v : JSON.stringify(v))\n }\n if (value !== null && value !== undefined) {\n return [typeof value === \"string\" ? value : JSON.stringify(value)]\n }\n return []\n}\n\nexport function evaluateJsonExpression(input: unknown, expression: string): JsonEvalResult {\n try {\n const tokens = tokenize(expression)\n const ast = new Parser(tokens).parse()\n const ctx: EvalCtx = {\n expandedArrays: new WeakSet(),\n objectSourcedArrays: new WeakSet(),\n regexCache: new Map(),\n }\n const raw = evalNode(ast, input, ctx)\n\n // If result is an expanded array (from iterate fan-out):\n if (Array.isArray(raw) && isExpandedArray(ast, raw, ctx)) {\n // Object-sourced: spec says treat as single-element sequence — unwrap (0 items → null, 1 → item)\n // Array-sourced: always return as array (jq model)\n const isObjSourced = ctx.objectSourcedArrays.has(raw as object)\n if (isObjSourced) {\n if (raw.length === 0) return { ok: true, value: null }\n if (raw.length === 1) return { ok: true, value: raw[0] }\n }\n if (raw.length === 0) return { ok: true, value: [] }\n return { ok: true, value: raw }\n }\n // Non-expanded: return as-is\n return { ok: true, value: raw === DROPPED ? [] : raw }\n } catch (err) {\n const msg = err instanceof Error ? err.message : String(err)\n return { ok: false, error: msg }\n }\n}\n","/** AI generation node types that support repeat-N execution.\n * Excludes deterministic nodes, FFmpeg, social, render, and utility nodes. */\nexport const REPEATABLE_NODE_TYPES = new Set([\n \"generate-image\", \"edit-image\", \"image-to-image\",\n \"image-to-video\", \"video-to-video\", \"text-to-video\",\n \"text-to-speech\", \"generate-music\", \"text-to-audio\", \"text-to-dialogue\",\n \"ai-writer\", \"llm-chat\", \"generate-script\",\n \"suno-generate\", \"suno-cover\", \"suno-extend\", \"suno-lyrics\",\n \"lip-sync\", \"speech-to-video\",\n \"motion-transfer\", \"extend-video\",\n \"video-composer\", \"after-effects\", \"lottie-overlay\", \"3d-title\", \"motion-graphics\",\n \"voice-changer\", \"dubbing\", \"voice-remix\", \"voice-design\",\n \"component\",\n])\n\n/** Sentinel value used as list item for repeat-only execution (no list fan-out input).\n * executeNodeForList skips the overridePrompt/overrideMediaUrl when it sees this. */\nexport const REPEAT_PLACEHOLDER = \"__repeat__\"\n\n/** Sentinel prefix for per-iteration provider override.\n * An item like `__provider:nano-banana__` tells executeNodeForList to clone the\n * node with `data.provider = \"nano-banana\"` for that iteration and otherwise\n * behave like REPEAT_PLACEHOLDER (no prompt/media override). */\nexport const PROVIDER_PLACEHOLDER_PREFIX = \"__provider:\"\nconst PROVIDER_PLACEHOLDER_SUFFIX = \"__\"\n\nexport function encodeProviderItem(provider: string): string {\n return `${PROVIDER_PLACEHOLDER_PREFIX}${provider}${PROVIDER_PLACEHOLDER_SUFFIX}`\n}\n\nexport function decodeProviderItem(item: string): string | undefined {\n if (!item.startsWith(PROVIDER_PLACEHOLDER_PREFIX)) return undefined\n if (!item.endsWith(PROVIDER_PLACEHOLDER_SUFFIX)) return undefined\n const inner = item.slice(\n PROVIDER_PLACEHOLDER_PREFIX.length,\n item.length - PROVIDER_PLACEHOLDER_SUFFIX.length,\n )\n return inner.length > 0 ? inner : undefined\n}\n\n/** Read repeatCount from node data, clamped to 1-20. Returns 1 if unset/invalid. */\nexport function getEffectiveRepeatCount(nodeData: Record<string, unknown>): number {\n const raw = nodeData.repeatCount as number | undefined\n if (!raw || raw <= 1) return 1\n return Math.min(Math.max(Math.floor(raw), 1), 20)\n}\n\n/** Read providers array from node data. Returns the array only when it has 2+\n * entries; one provider is equivalent to single-provider mode. */\nfunction getEffectiveProviders(nodeData: Record<string, unknown>): readonly string[] | undefined {\n const raw = nodeData.providers as readonly unknown[] | undefined\n if (!raw || raw.length < 2) return undefined\n const cleaned = raw.filter((p): p is string => typeof p === \"string\" && p.length > 0)\n return cleaned.length >= 2 ? cleaned : undefined\n}\n\n/**\n * Expand list items by repeatCount, or create synthetic repeat / provider items.\n *\n * Resolution order:\n * 1. If an upstream list exists, the list drives expansion (repeatCount multiplies).\n * 2. Else if `data.providers` has 2+ entries, emit `providers.length × repeatCount`\n * items — each provider runs `repeatCount` times consecutively.\n * 3. Else if repeatCount > 1, emit `repeatCount` synthetic items.\n * 4. Otherwise return null — single execution, no fan-out.\n */\nexport function expandItemsWithRepeat(\n listItems: string[] | undefined,\n nodeType: string,\n nodeData: Record<string, unknown>,\n): string[] | null {\n const repeatCount = REPEATABLE_NODE_TYPES.has(nodeType)\n ? getEffectiveRepeatCount(nodeData)\n : 1\n\n if (listItems && listItems.length > 1) {\n const expanded = repeatCount > 1\n ? listItems.flatMap(item => Array(repeatCount).fill(item) as string[])\n : listItems\n return expanded\n }\n\n const providers = getEffectiveProviders(nodeData)\n if (providers) {\n // Cross-product: each provider runs `repeatCount` times. Same provider's\n // iterations are grouped (better for UI progress + caching).\n return providers.flatMap(p =>\n Array(Math.max(repeatCount, 1)).fill(encodeProviderItem(p)) as string[],\n )\n }\n\n if (repeatCount > 1) {\n return Array(repeatCount).fill(REPEAT_PLACEHOLDER) as string[]\n }\n\n return null\n}\n","/**\n * Fan-out pairs by ROW.\n *\n * When several list wires reach one node (\"prompt\" + \"negative\" columns of the\n * same List, two Extract Field lists cut from the same JSON array, …) the node\n * runs once per row and every wire contributes the value of THAT row. Both DAG\n * engines (backend orchestrator + in-browser executor) build the plan with the\n * helpers below, so the rules live in exactly one place:\n *\n * - which list drives the fan-out, and which rows run, never depend on the\n * order the wires were drawn in (`resolveListFanOut`);\n * - the driving item is only written into the prompt when its wire actually\n * feeds the prompt (`fanOutTextFeedsPrompt`, `NON_PROMPT_TEXT_LANES`);\n * - an empty cell stays empty IN ITS ROW instead of pulling the rows below it\n * up (`liveRowColumn`, `alignedFieldList`, `compactWithRows`);\n * - an iteration keeps its row when Repeat xN multiplies it (`planFanOut`).\n */\nimport { evaluateJsonPath, stringifyPathResults } from \"./json-path.js\"\nimport { expandItemsWithRepeat } from \"./repeat-types.js\"\nimport { isDefaultSelectorConfig, resolveIndex, selectListItems, type SelectorFields } from \"./selector.js\"\nimport { unitNonPromptInputs } from \"./unit-contract-compose.js\"\n\n/**\n * The text LANES the input resolvers route somewhere OTHER than the prompt slot\n * (`negative` → negativePrompt, `system-prompt` → systemPrompt, an avatar's\n * `script`, an editor's `transcript`, …). A list that drives a fan-out through\n * one of these must NOT also be written into the prompt: the per-row resolution\n * already delivered it where it belongs.\n *\n * Keyed by handle, scoped by node type, because the routers are: `transcript`\n * is the caption track of Add Captions but the very text Forced Alignment\n * aligns. `\"*\"` = every node type (the router branch is unconditional).\n *\n * DERIVED, not remembered: each engine has a totality test\n * (`fanout-text-handle-totality`) that routes a text source into EVERY input\n * handle of EVERY node type through the real resolver and fails the build on any\n * pair where this table and the router disagree — in either direction. An\n * unlisted lane keeps the old behavior (the item is the prompt), so a miss can\n * only ever reproduce the old bug on that one lane, never a new one.\n */\nconst LEGACY_NON_PROMPT_TEXT_LANES: Readonly<Record<string, \"*\" | readonly string[]>> = {\n negative: \"*\",\n \"system-prompt\": \"*\",\n script: [\"ai-avatar\"],\n transcript: [\"add-captions\", \"apply-edl\", \"edit-plan\", \"camera-switch\", \"speaker-view\", \"speaker-frames\"],\n edl: [\"apply-edl\", \"camera-switch\", \"speaker-view\"],\n // Speaker View's face tracks (Speaker Frames' descriptor): framing data, never a prompt.\n tracks: [\"speaker-view\"],\n silence: [\"edit-plan\"],\n offsets: [\"edit-plan\"],\n // Camera Switch's speaker map (a Speaker Map result): who is on which camera, never a prompt.\n speakerMap: [\"camera-switch\"],\n qrText: [\"image-overlay\"],\n layerPlan: [\"video-overlay\"],\n captionPlan: [\"add-captions\"],\n transition: [\"slideshow\"],\n // Content Recipe's `link` carries the post's address (inputs.sourceLink), not\n // the material it analyzes — a list of links fanned through it must not be\n // written into the material too.\n link: [\"content-recipe\"],\n}\n\n/**\n * The hand-written lanes ∪ the node units' `contract.nonPromptInputs` rows\n * (generated/unit-contracts.ts): each unit type joins the list of every handle\n * it names (a handle no list names yet gets one). A `\"*\"` lane already covers\n * every type, so it stays as it is. A type listed twice for one handle throws\n * at load — a type is hand-written or a node unit, never both.\n */\nexport const NON_PROMPT_TEXT_LANES: Readonly<Record<string, \"*\" | readonly string[]>> = composeNonPromptLanes(LEGACY_NON_PROMPT_TEXT_LANES, unitNonPromptInputs())\n\nfunction composeNonPromptLanes(\n legacy: Readonly<Record<string, \"*\" | readonly string[]>>,\n rows: ReadonlyArray<readonly [string, ReadonlyArray<string>]>,\n): Record<string, \"*\" | readonly string[]> {\n const out: Record<string, \"*\" | readonly string[]> = { ...legacy }\n for (const [type, handles] of rows) {\n const own = new Set<string>()\n for (const handle of handles) {\n // A unit naming one handle twice in its own row is its own mistake, not a clash with the hand-written lanes.\n if (own.has(handle)) throw new Error(`NON_PROMPT_TEXT_LANES: node unit ${type} lists \"${handle}\" twice in its contract.nonPromptInputs`)\n own.add(handle)\n const scope = Object.hasOwn(out, handle) ? out[handle] : []\n if (scope === \"*\") continue\n // Only the same handle clashes here: a unit hand-listed under a DIFFERENT\n // handle is a string literal of a unit's id outside its folders, which\n // G2 fails (frontend/src/__tests__/node-units-structure.test.ts).\n if (scope.includes(type)) throw new Error(`NON_PROMPT_TEXT_LANES: ${type} is listed for \"${handle}\" both by hand and as a node unit — a type lives in one place`)\n out[handle] = [...scope, type]\n }\n }\n return out\n}\n\n/** Does a TEXT list wired to `targetHandle` of a `nodeType` node feed its prompt slot? */\nexport function fanOutTextFeedsPrompt(nodeType: string | null | undefined, targetHandle: string | null | undefined): boolean {\n const scope = Object.hasOwn(NON_PROMPT_TEXT_LANES, targetHandle ?? \"\") ? NON_PROMPT_TEXT_LANES[targetHandle ?? \"\"] : undefined\n if (scope === undefined) return true\n return scope !== \"*\" && !scope.includes(nodeType ?? \"\")\n}\n\nconst isBlank = (v: unknown): boolean => typeof v !== \"string\" || v.trim().length === 0\n\n/**\n * Drop the empty entries of a row-aligned list, remembering the row every kept\n * value came from. The items are what drives a fan-out (nothing runs for an\n * empty cell); the rows are what keeps the OTHER wires on the same row.\n */\nexport function compactWithRows(aligned: readonly string[]): { items: string[]; rowIndices: number[] } {\n const items: string[] = []\n const rowIndices: number[] = []\n aligned.forEach((value, row) => {\n if (isBlank(value)) return\n items.push(value)\n rowIndices.push(row)\n })\n return { items, rowIndices }\n}\n\n/** What a wire reads off a list with holes when it reads ONE value (`pickHeldRow`). */\nexport type HeldRowPick =\n /** This read is not one the holes change: the engine's own rule stands. */\n | { readonly kind: \"unaffected\" }\n /** The wire carries this value. */\n | { readonly kind: \"value\"; readonly value: string }\n /** The wire carries nothing (no scalar fallback). */\n | { readonly kind: \"none\" }\n\n/**\n * One value off a ROW-ALIGNED list whose empty rows mean \"nothing here\" (an\n * Edit Plan's clips as a person's review leaves them: the plan's rows, \"\" at\n * every dropped clip), for a wire that does not iterate it.\n *\n * Without this, both engines fall back to the source's scalar output (the\n * FIRST kept row of the whole list) whenever the wire's own pick is empty, so\n * a wire could carry a row it never selected:\n * - an Each wire with a range / list selector, outside its fan-out (the\n * selection holds one kept row, or none, so nothing fans out): the first\n * kept row OF THE SELECTION, or nothing when it holds none;\n * - an item pick (`item` / `item:N`), in a fan-out or not: the picked row, or\n * nothing when it is empty.\n * Every other read is `unaffected`: a default Each wire (its scalar IS the\n * first kept row), Selected (`last`), Bundle (`all`), an Each wire inside its\n * fan-out (the iteration reads its own row, and an empty row runs nothing),\n * and an empty list. Both engines call this, so they cannot disagree.\n */\nexport function pickHeldRow(\n rows: readonly string[],\n edge: (SelectorFields & { outputMode?: string; itemIndex?: string }) | undefined,\n iterating: boolean,\n): HeldRowPick {\n if (rows.length === 0) return { kind: \"unaffected\" }\n const mode = edge?.outputMode ?? \"each\"\n const held = (row: string | undefined): HeldRowPick => (isBlank(row) ? { kind: \"none\" } : { kind: \"value\", value: row! })\n if (mode === \"item\") return held(rows[resolveIndex(edge?.itemIndex ?? \"1\", rows.length)])\n if (mode.startsWith(\"item:\")) return held(rows[parseInt(mode.slice(5), 10)])\n if (mode !== \"each\" || iterating || isDefaultSelectorConfig(edge)) return { kind: \"unaffected\" }\n const kept = compactWithRows(selectListItems([...rows], edge)).items\n return kept.length > 0 ? { kind: \"value\", value: kept[0]! } : { kind: \"none\" }\n}\n\n/**\n * One column of a manual List table, row-aligned: a row is dropped only when\n * EVERY cell of it is blank (the trailing empty row the editor keeps), and an\n * empty cell of a row that has content stays in place as \"\".\n */\nexport function liveRowColumn(rows: ReadonlyArray<ReadonlyArray<string | undefined>>, colIndex: number): string[] {\n return rows\n .filter((row) => row.some((cell) => !isBlank(cell)))\n .map((row) => (typeof row[colIndex] === \"string\" ? (row[colIndex] as string).trim() : \"\"))\n}\n\n/** One list wire that could drive a fan-out. */\nexport interface FanOutCandidate {\n /** Target handle of the consumer-side wire. */\n targetHandle: string | null | undefined\n /** The wire's values in row order — may hold \"\" for an empty row. */\n aligned: readonly string[]\n}\n\n/**\n * Turn the lists that reach a node into ONE fan-out, so that nothing depends on\n * the order the wires were drawn in. `candidates` are the \"each\" lists that hold\n * more than one value, in wire order.\n *\n * The PRIMARY is the list that holds the most values (the first of them when\n * several tie): it sets the row space. Both engines get it from here, so the\n * orchestrator and the in-browser executor cannot disagree on how many times a\n * node runs. Lists with the SAME number of rows share that row space — two\n * columns of one table, two Extract Field lists cut from one array — and are\n * settled together:\n *\n * - the DRIVER (its item becomes the per-row override) is a text list that\n * feeds the prompt, when there is one: that item is what must win over the\n * typed prompt, and a list wired to `negative` must never supply it;\n * - a ROW runs when ANY of those lists has a value in it. A row is never\n * dropped because one column is empty there — that column just contributes\n * nothing for the row — and a row with no value anywhere does not run.\n *\n * A list with a different number of rows is not part of this: it keeps\n * wrapping around per iteration, as it always has.\n */\nexport function resolveListFanOut<C extends FanOutCandidate>(\n candidates: readonly C[],\n nodeType: string | null | undefined,\n): ListFanOut | undefined {\n if (candidates.length === 0) return undefined\n const held = (c: C) => compactWithRows(c.aligned).items.length\n const primary = candidates.reduce((best, c) => (held(c) > held(best) ? c : best))\n const space = candidates.filter((c) => c.aligned.length === primary.aligned.length)\n const feedsPrompt = (c: C) => fanOutTextFeedsPrompt(nodeType, c.targetHandle) && isTextList(c.aligned, nodeType, c.targetHandle)\n const driver = feedsPrompt(primary) ? primary : (space.find(feedsPrompt) ?? primary)\n const rowIndices: number[] = []\n for (let row = 0; row < primary.aligned.length; row++) {\n if (space.some((c) => !isBlank(c.aligned[row]))) rowIndices.push(row)\n }\n return {\n items: rowIndices.map((row) => (isBlank(driver.aligned[row]) ? \"\" : driver.aligned[row])),\n rowIndices,\n targetHandle: driver.targetHandle,\n }\n}\n\n/**\n * Is this fan-out item a media URL (as opposed to text)? The ONE guess both\n * engines make when a list item has to be applied as an override — kept here so\n * the backend worker and the in-browser executor cannot disagree on it.\n */\nexport function isFanOutUrlItem(item: string): boolean {\n const s = item.trim()\n // A media link is ONE address. JSON (`{…}` / `[…]`) and a sentence that merely\n // contains an image address are text: a scraped post's JSON with a\n // `.jpg?token=` inside it used to be read as a picture and dropped from the\n // prompt (review finding H3, 2026-10-06).\n if (s.length === 0 || /\\s/.test(s) || s.startsWith(\"{\") || s.startsWith(\"[\")) return false\n return s.startsWith(\"http\") || /\\.(png|jpg|jpeg|webp|gif|mp4|mov|webm|mp3|wav|ogg)(\\?|$)/i.test(s)\n}\n\n/**\n * Lanes where an item that LOOKS like a media link is still the item itself —\n * a record's link is what a Save to Collection stores, not a picture to show\n * it. Data-driven so a new consumer declares its lane here, never a name check\n * in either engine.\n */\nconst URL_ITEM_IS_TEXT_LANES: Readonly<Record<string, readonly string[]>> = {\n \"collection-write\": [\"in\"],\n}\n\n/** Does a fan-out item that looks like a link stay TEXT on this lane (the item, not a media input)? */\nexport function fanOutUrlItemIsText(nodeType: string | null | undefined, targetHandle: string | null | undefined): boolean {\n const lanes = URL_ITEM_IS_TEXT_LANES[nodeType ?? \"\"]\n return lanes !== undefined && lanes.includes(targetHandle ?? \"\")\n}\n\n/** A media list never supplies a prompt override, whatever handle it is wired to —\n * except on a lane where a link IS the item (`fanOutUrlItemIsText`).\n * The FIRST value decides — a column is one kind of thing; this is not a scan. */\nfunction isTextList(aligned: readonly string[], nodeType?: string | null, targetHandle?: string | null): boolean {\n const first = aligned.find((v) => !isBlank(v))\n if (first === undefined) return false\n return !isFanOutUrlItem(first) || fanOutUrlItemIsText(nodeType, targetHandle)\n}\n\n/** What a fan-out source resolved to. */\nexport interface ListFanOut {\n /** The driving list's value for every row that runs — \"\" where the driver has\n * none for a row another list keeps alive (nothing is overridden there). */\n items: string[]\n /** `rowIndices[k]` = the row `items[k]` came from, in the driver's row space. */\n rowIndices: number[]\n /** Target handle of the consumer-side wire that drives the fan-out. */\n targetHandle: string | null | undefined\n}\n\n/** The iterations a node will run, in order. */\nexport interface FanOutPlan {\n /** One entry per iteration (list items, repeat / provider sentinels). */\n items: string[]\n /** Row each iteration reads its inputs from; undefined when nothing is list-driven. */\n rows: Array<number | undefined>\n /** Handle the driving list is wired to; undefined when nothing is list-driven. */\n targetHandle: string | null | undefined\n}\n\n/**\n * Expand a fan-out into its iterations (list x Repeat xN, providers, repeats —\n * `expandItemsWithRepeat` stays the single rule for that) and pin every\n * iteration to the ROW its item came from. Repeat xN runs a row N times: the\n * copies share the row, they do not walk on to the next one.\n */\nexport function planFanOut(\n fanOut: ListFanOut | undefined,\n nodeType: string,\n nodeData: Record<string, unknown>,\n): FanOutPlan | null {\n const items = expandItemsWithRepeat(fanOut?.items, nodeType, nodeData)\n if (!items) return null\n const listDriven = fanOut !== undefined && fanOut.items.length > 1\n if (!listDriven) return { items, rows: items.map(() => undefined), targetHandle: undefined }\n const perRow = items.length / fanOut.items.length\n return {\n items,\n rows: items.map((_, k) => fanOut.rowIndices[Math.floor(k / perRow)]),\n targetHandle: fanOut.targetHandle,\n }\n}\n\n/**\n * Extract Field, List output, over a root ARRAY: one entry per element, \"\" where\n * the element has no value — so two Extract Field lists cut from the same array\n * stay row-aligned. Returns undefined when rows cannot be defined (the root is\n * not an array, an element fans into several values, or no element carries the\n * field at all) — the caller then keeps the plain \"values that exist\" list.\n */\nexport function alignedFieldList(value: unknown, path: string): string[] | undefined {\n if (!Array.isArray(value) || value.length === 0) return undefined\n const out: string[] = []\n for (const element of value) {\n const found = evaluateJsonPath(element, path)\n if (found.length > 1) return undefined\n out.push(stringifyPathResults(found)[0] ?? \"\")\n }\n return out.some((v) => v.length > 0) ? out : undefined\n}\n","/**\n * Like Promise.allSettled but limits how many tasks run concurrently.\n * Uses a worker-pool pattern so a new task starts as soon as a slot frees up.\n * When `cancelledRef` is provided and becomes truthy, remaining un-started\n * tasks are skipped (already-running tasks continue to completion/rejection).\n */\nexport async function settledWithLimit<T>(\n tasks: (() => Promise<T>)[],\n limit: number,\n cancelledRef?: { cancelled: boolean },\n): Promise<PromiseSettledResult<T>[]> {\n const results: PromiseSettledResult<T>[] = new Array(tasks.length)\n let nextIndex = 0\n\n const cancelledError = new Error(\"Execution cancelled\")\n\n async function worker(): Promise<void> {\n while (nextIndex < tasks.length) {\n if (cancelledRef?.cancelled) break\n const idx = nextIndex++\n try {\n const value = await tasks[idx]()\n results[idx] = { status: \"fulfilled\", value }\n } catch (reason) {\n results[idx] = { status: \"rejected\", reason }\n }\n }\n }\n\n const workers = Array.from(\n { length: Math.min(limit, tasks.length) },\n () => worker(),\n )\n await Promise.all(workers)\n\n // Fill any un-started slots (from cancellation) with a shared rejection\n for (let i = 0; i < results.length; i++) {\n if (!results[i]) results[i] = { status: \"rejected\", reason: cancelledError }\n }\n\n return results\n}\n","/**\n * Sentinel value persisted by the \"None\" delimiter option in the UI. Distinct\n * from `undefined` (which means \"default to newline\") so we can tell the\n * difference between \"user actively chose not to split\" and \"field never set\".\n */\nexport const NO_SPLIT_DELIMITER = \"__none__\" as const\n\n/**\n * Split text using a loop node's column delimiter.\n *\n * Uses the first text-type column's `splitDelimiter` to determine\n * how to split upstream text. Falls back to newline when no delimiter\n * is configured. The \"first text column wins\" heuristic is intentional:\n * connected mode pipes a single text stream into the loop, so we use\n * the primary text column's delimiter as the split strategy.\n *\n * `splitDelimiter === NO_SPLIT_DELIMITER` (\"__none__\") returns the input as\n * a single-item array — the user explicitly opted out of splitting.\n */\nexport function splitByLoopDelimiter(\n text: string,\n columns: ReadonlyArray<{ type?: string; splitDelimiter?: string }> | undefined,\n): string[] {\n const firstTextCol = (columns ?? []).find((c) => (c.type ?? \"text\") === \"text\")\n const raw = firstTextCol?.splitDelimiter\n if (raw === NO_SPLIT_DELIMITER) {\n const trimmed = text.trim()\n return trimmed.length > 0 ? [trimmed] : []\n }\n const delimiter = raw ?? \"\\n\"\n return text.split(delimiter).map((s) => s.trim()).filter((s) => s.length > 0)\n}\n\n/**\n * Split pasted (or manually-triggered) text into rows, inserting below\n * the source row. Returns the new rows array and truncation metadata.\n *\n * Pure function — callers handle persisting the result and showing toasts.\n */\nexport function spliceDelimitedRows(\n rows: readonly (readonly string[])[],\n rowIndex: number,\n colIndex: number,\n pastedText: string,\n delimiter: string,\n columnCount: number,\n maxItems: number,\n): { newRows: string[][]; truncated: boolean; totalProduced: number } {\n const parts = pastedText.split(delimiter).map((s) => s.trim()).filter((s) => s.length > 0)\n if (parts.length <= 1) {\n // Nothing to split — return rows unchanged with first part (or original) in cell\n const newRows = rows.map((r) => [...r])\n if (parts.length === 1) newRows[rowIndex][colIndex] = parts[0]\n return { newRows, truncated: false, totalProduced: newRows.length }\n }\n\n const newRows = rows.map((r) => [...r])\n newRows[rowIndex][colIndex] = parts[0]\n const insertRows = parts.slice(1).map((part) => {\n const r = Array.from<string>({ length: columnCount }).fill(\"\")\n r[colIndex] = part\n return r\n })\n newRows.splice(rowIndex + 1, 0, ...insertRows)\n\n const truncated = newRows.length > maxItems\n const totalProduced = newRows.length\n return {\n newRows: truncated ? newRows.slice(0, maxItems) : newRows,\n truncated,\n totalProduced,\n }\n}\n","/** Delimiter the Generate Text templates instruct the LLM to emit between blocks. */\nexport const GENERATE_TEXT_DELIMITER = \"===NEXT===\"\n\n/**\n * Split a Generate Text result into fan-out items. Used by BOTH the frontend\n * extractNodeOutput and the backend output-extractor so single-node and DAG\n * execution produce identical `items`.\n */\nexport function splitGeneratedItems(text: string | null | undefined): string[] {\n if (!text) return []\n const parts = text.split(GENERATE_TEXT_DELIMITER).map((s) => s.trim()).filter(Boolean)\n if (parts.length > 0) return parts\n const trimmed = text.trim()\n return trimmed ? [trimmed] : []\n}\n","/**\n * Shared separator presets for the Combine Text and Split Text nodes.\n * Single source of truth for both the frontend DAG executor and backend orchestrator.\n */\n\nexport const SEPARATOR_PRESETS = [\n \"newline\",\n \"double-newline\",\n \"comma\",\n \"space\",\n \"stars\",\n \"custom\",\n] as const\n\nexport type SeparatorPreset = (typeof SEPARATOR_PRESETS)[number]\n\nconst SPLIT_MAP: Record<string, string> = {\n newline: \"\\n\",\n \"double-newline\": \"\\n\\n\",\n comma: \",\",\n space: \" \",\n stars: \"***\",\n}\n\nconst COMBINE_MAP: Record<string, string> = {\n ...SPLIT_MAP,\n comma: \", \",\n}\n\n/** Human-readable label for the node badge. */\nexport const SEPARATOR_DISPLAY: Record<string, string> = {\n newline: \"\\\\n\",\n \"double-newline\": \"\\\\n\\\\n\",\n comma: \",\",\n space: \"space\",\n stars: \"***\",\n}\n\nexport interface ResolveSeparatorOptions {\n /** Use combine-text spacing — e.g. \", \" for comma instead of \",\" */\n combineSpacing?: boolean\n}\n\n/**\n * Resolve a separator value to its actual string.\n * - Enum preset → mapped value (e.g. \"newline\" → \"\\n\")\n * - \"custom\" → customSeparator field\n * - Anything else → literal string (back-compat with legacy values like \"===NEXT===\")\n */\nexport function resolveSeparator(\n raw: string | undefined,\n customSeparator: string | undefined,\n opts?: ResolveSeparatorOptions,\n): string {\n const r = raw || \"newline\"\n if (r === \"custom\") return customSeparator ?? \"\"\n const map = opts?.combineSpacing ? COMBINE_MAP : SPLIT_MAP\n return map[r] ?? r\n}\n","/** Pure sort helper shared by the frontend DAG executor and the backend\n * orchestrator. Contract: reorder stringified list items (as produced by\n * `collectUpstreamListItems` peers) by an optional dot-path field, with\n * Auto/Text/Number/Date comparison and asc/desc direction. Items whose\n * key is missing, empty, or uncoerceable under the chosen type are always\n * appended last — regardless of direction. */\n\nimport { evaluateJsonPath } from \"./json-path.js\"\nimport { tryParseJson } from \"./filter-condition.js\"\n\nexport type SortType = \"auto\" | \"text\" | \"number\" | \"date\"\nexport type SortDirection = \"asc\" | \"desc\"\n\nexport interface SortListOptions {\n field: string\n sortType: SortType\n direction: SortDirection\n}\n\n// Natural numeric-aware, case-insensitive locale compare. Declared once so\n// both the Text branch and the Auto fallback reuse the same Collator.\nconst textCollator = new Intl.Collator(undefined, {\n sensitivity: \"base\",\n numeric: true,\n})\n\ninterface KeyedItem {\n item: string\n key: number | string\n keyKind: \"number\" | \"text\" | \"invalid\"\n}\n\nfunction extractRawKey(item: string, field: string): unknown {\n if (field === \"\") return item\n const parsed = tryParseJson(item)\n const matches = evaluateJsonPath(parsed, field)\n return matches.length > 0 ? matches[0] : undefined\n}\n\nfunction isMissing(v: unknown): boolean {\n if (v === undefined || v === null) return true\n if (typeof v === \"string\" && v.trim() === \"\") return true\n return false\n}\n\nfunction toNumberKey(v: unknown): number | undefined {\n if (typeof v === \"number\") return Number.isFinite(v) ? v : undefined\n if (typeof v === \"boolean\") return v ? 1 : 0\n if (typeof v === \"string\") {\n const trimmed = v.trim()\n if (trimmed === \"\") return undefined\n const n = Number(trimmed)\n return Number.isFinite(n) ? n : undefined\n }\n return undefined\n}\n\nfunction toDateKey(v: unknown): number | undefined {\n if (v instanceof Date) {\n const t = v.getTime()\n return Number.isFinite(t) ? t : undefined\n }\n if (typeof v === \"number\") return Number.isFinite(v) ? v : undefined\n if (typeof v === \"string\") {\n const t = Date.parse(v)\n return Number.isFinite(t) ? t : undefined\n }\n return undefined\n}\n\nfunction coerceKey(raw: unknown, sortType: SortType): Pick<KeyedItem, \"key\" | \"keyKind\"> {\n if (isMissing(raw)) return { key: \"\", keyKind: \"invalid\" }\n\n if (sortType === \"number\") {\n const n = toNumberKey(raw)\n return n === undefined\n ? { key: \"\", keyKind: \"invalid\" }\n : { key: n, keyKind: \"number\" }\n }\n\n if (sortType === \"date\") {\n const d = toDateKey(raw)\n return d === undefined\n ? { key: \"\", keyKind: \"invalid\" }\n : { key: d, keyKind: \"number\" }\n }\n\n if (sortType === \"text\") {\n return { key: typeof raw === \"string\" ? raw : JSON.stringify(raw), keyKind: \"text\" }\n }\n\n // auto: try number → date → text.\n const asNum = toNumberKey(raw)\n if (asNum !== undefined) return { key: asNum, keyKind: \"number\" }\n const asDate = toDateKey(raw)\n if (asDate !== undefined) return { key: asDate, keyKind: \"number\" }\n return { key: typeof raw === \"string\" ? raw : JSON.stringify(raw), keyKind: \"text\" }\n}\n\nexport function sortListItems(items: readonly string[], opts: SortListOptions): string[] {\n const { field, sortType, direction } = opts\n const keyed: KeyedItem[] = items.map((item) => {\n const raw = extractRawKey(item, field)\n const { key, keyKind } = coerceKey(raw, sortType)\n return { item, key, keyKind }\n })\n\n const sortable = keyed.filter((k) => k.keyKind !== \"invalid\")\n const invalid = keyed.filter((k) => k.keyKind === \"invalid\")\n\n const factor = direction === \"desc\" ? -1 : 1\n // Array.prototype.sort is guaranteed stable since ES2019 — equal keys\n // preserve their relative input order.\n sortable.sort((a, b) => {\n if (a.keyKind === \"number\" && b.keyKind === \"number\") {\n return ((a.key as number) - (b.key as number)) * factor\n }\n return textCollator.compare(String(a.key), String(b.key)) * factor\n })\n\n return [...sortable.map((k) => k.item), ...invalid.map((k) => k.item)]\n}\n","/**\n * The node types the server projects onto `workflow_triggers` rows when a\n * workflow is saved (backend `lib/workflow-trigger-sync.ts`), and that the\n * editor therefore asks the server to re-project after its own saves. One\n * vocabulary for both sides: a projected type added here reaches the\n * editor's \"does this save need a sync?\" question by construction.\n */\nexport const SCHEDULE_TRIGGER_NODE_TYPE = \"schedule-trigger\"\nexport const WEBHOOK_TRIGGER_NODE_TYPE = \"webhook-trigger\"\nexport const TELEGRAM_TRIGGER_NODE_TYPE = \"telegram-trigger\"\n/** Fires on a message that reaches a Telegram account the owner connected (Cloud). */\nexport const TELEGRAM_ACCOUNT_TRIGGER_NODE_TYPE = \"telegram-account-trigger\"\n\nexport const PROJECTED_TRIGGER_NODE_TYPES: ReadonlySet<string> = new Set([\n SCHEDULE_TRIGGER_NODE_TYPE,\n WEBHOOK_TRIGGER_NODE_TYPE,\n TELEGRAM_TRIGGER_NODE_TYPE,\n TELEGRAM_ACCOUNT_TRIGGER_NODE_TYPE,\n])\n\nexport function isProjectedTriggerNodeType(type: unknown): type is string {\n return typeof type === \"string\" && PROJECTED_TRIGGER_NODE_TYPES.has(type)\n}\n","/**\n * Schedule Trigger rules — the ONE model both sides read.\n *\n * A schedule is a list of rules; the workflow runs whenever any rule says\n * \"this minute\". The editor previews a schedule (headline, today's timeline,\n * the next runs, runs per day) and the server decides whether to fire — from\n * the same functions here, so what the panel shows is what the cron does.\n *\n * Kinds, with the fields each reads (everything else on the rule is ignored):\n * - `minutes` — `every` (1–59): at minute 0, N, 2N… of every hour (cron `*\\/N`).\n * - `hours` — `every` (1–23) at `minute`: at hour 0, N, 2N… of every day.\n * - `days` — `every` (1–31) at `hour:minute`: every Nth calendar day.\n * - `weeks` — `every` (1–52) on `weekdays` at `hour:minute`: every Nth week.\n * - `months` — `every` (1–12) on `dayOfMonth` at `hour:minute`: every Nth month\n * (a day the month lacks — 31 in April — runs on its last day).\n * - `cron` — a 5-field cron expression, for the person who wants one.\n *\n * \"Every Nth day / week / month\" counts from a fixed origin (the Unix epoch,\n * in the schedule's timezone; weeks start on Monday) rather than from the\n * moment the rule was saved — so the preview and the server agree, a re-save\n * never shifts the phase, and two people reading the rule get the same days.\n *\n * Time is read in the schedule's timezone (an IANA name; missing or unknown\n * → UTC — callers validate with `isValidTimezone` and refuse the unknown\n * ones, so that fallback is only ever a defence). Resolution is one minute:\n * the cron ticks once a minute and asks \"does this minute match?\" — there is\n * no sub-minute scheduling.\n *\n * Daylight-saving: a wall-clock minute that does not exist on the day the\n * clocks jump forward is skipped that day. On the day they fall back, a rule\n * that names a time of day (`hours` / `days` / `weeks` / `months` / `cron`)\n * runs once — the second pass is the same wall-clock minute\n * (`localMinuteKey`) as the fire just before it, and both the server and the\n * preview drop it — while a `minutes` rule keeps its cadence through the\n * repeated hour, because real time keeps passing.\n */\n\nexport const SCHEDULE_RULE_KINDS = [\"minutes\", \"hours\", \"days\", \"weeks\", \"months\", \"cron\"] as const\nexport type ScheduleRuleKind = (typeof SCHEDULE_RULE_KINDS)[number]\n\nexport interface ScheduleRule {\n readonly id: string\n readonly kind: ScheduleRuleKind\n /** Every N units (see `SCHEDULE_EVERY_LIMITS`). */\n readonly every?: number\n /** 0–23, in the schedule's timezone. Read by days / weeks / months. */\n readonly hour?: number\n /** 0–59. Read by every kind but `minutes` and `cron`. */\n readonly minute?: number\n /** 0 = Sunday … 6 = Saturday (the cron / JavaScript convention). Read by `weeks`. */\n readonly weekdays?: ReadonlyArray<number>\n /** 1–31. Read by `months`. */\n readonly dayOfMonth?: number\n /** A 5-field cron expression. Read by `cron`. */\n readonly cron?: string\n}\n\nexport interface ScheduleSpec {\n readonly rules: ReadonlyArray<ScheduleRule>\n /** IANA timezone; missing or unknown means UTC. */\n readonly timezone?: string\n /** Stop after this many runs; missing means unlimited. */\n readonly maxExecutions?: number\n}\n\n/** `every` limits per kind — the panel's range hints and the normaliser's clamps. */\nexport const SCHEDULE_EVERY_LIMITS: Readonly<Record<Exclude<ScheduleRuleKind, \"cron\">, readonly [number, number]>> = {\n minutes: [1, 59],\n hours: [1, 23],\n days: [1, 31],\n weeks: [1, 52],\n months: [1, 12],\n}\n\n// ---------------------------------------------------------------------------\n// Normalisation\n// ---------------------------------------------------------------------------\n\nfunction int(value: unknown): number | null {\n if (typeof value === \"number\" && Number.isFinite(value)) return Math.trunc(value)\n if (typeof value === \"string\" && /^-?\\d+$/.test(value.trim())) return parseInt(value.trim(), 10)\n return null\n}\n\nfunction clamp(value: number | null, lo: number, hi: number, fallback: number): number {\n if (value === null) return fallback\n return Math.min(hi, Math.max(lo, value))\n}\n\n/** A count of units: zero or less is \"not typed yet\", never \"every minute\". */\nfunction positiveInt(value: unknown): number | null {\n const n = int(value)\n return n !== null && n >= 1 ? n : null\n}\n\n/** A 5-field cron expression — the only shape the matcher understands. */\nexport function isCronExpression(value: unknown): value is string {\n return typeof value === \"string\" && value.trim().split(/\\s+/).filter(Boolean).length === 5\n}\n\n/**\n * One rule as the user typed it → one rule the engine can run, or `null` when\n * there is nothing to run (unknown kind, a cron rule with no expression, a\n * weeks rule with no weekday). Out-of-range numbers are clamped, never\n * refused: a half-typed \"0\" must not silently disable a schedule.\n */\nexport function normalizeScheduleRule(raw: unknown, fallbackId = \"rule-1\"): ScheduleRule | null {\n if (!raw || typeof raw !== \"object\") return null\n const r = raw as Record<string, unknown>\n if (typeof r.kind !== \"string\" || !(SCHEDULE_RULE_KINDS as readonly string[]).includes(r.kind)) return null\n const kind = r.kind as ScheduleRuleKind\n const id = typeof r.id === \"string\" && r.id.trim() ? r.id.trim() : fallbackId\n const minute = clamp(int(r.minute), 0, 59, 0)\n const hour = clamp(int(r.hour), 0, 23, 0)\n switch (kind) {\n case \"minutes\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.minutes, 5) }\n case \"hours\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.hours, 1), minute }\n case \"days\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.days, 1), hour, minute }\n case \"weeks\": {\n const weekdays = Array.isArray(r.weekdays)\n ? [...new Set(r.weekdays.map(int).filter((d): d is number => d !== null && d >= 0 && d <= 6))].sort((a, b) => a - b)\n : []\n if (weekdays.length === 0) return null\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.weeks, 1), hour, minute, weekdays }\n }\n case \"months\":\n return {\n id,\n kind,\n every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.months, 1),\n hour,\n minute,\n dayOfMonth: clamp(int(r.dayOfMonth), 1, 31, 1),\n }\n case \"cron\": {\n const cron = typeof r.cron === \"string\" ? r.cron.trim().split(/\\s+/).join(\" \") : \"\"\n return isCronExpression(cron) ? { id, kind, cron } : null\n }\n }\n}\n\n/** Every usable rule, in order; unusable ones dropped. */\nexport function normalizeScheduleRules(raw: unknown): ScheduleRule[] {\n if (!Array.isArray(raw)) return []\n return raw.map((r, i) => normalizeScheduleRule(r, `rule-${i + 1}`)).filter((r): r is ScheduleRule => r !== null)\n}\n\n/**\n * The schedule an OLD node carried — `interval` (\"5m\" / \"1h\" / \"1d\" or one of\n * the editor's cron presets) and/or `cron` — as rules. Seconds cannot be\n * scheduled (the cron ticks once a minute) and become \"every minute\".\n */\nexport function legacyScheduleToRules(data: { interval?: unknown; cron?: unknown; cronExpression?: unknown }): ScheduleRule[] {\n const interval = typeof data.interval === \"string\" ? data.interval.trim() : \"\"\n const explicit = [data.cron, data.cronExpression].find((v): v is string => typeof v === \"string\" && v.trim() !== \"\")?.trim() ?? \"\"\n const m = interval.match(/^(\\d+)([smhd])$/)\n if (m) {\n const n = parseInt(m[1], 10)\n // \"0m\" never fired (it parsed to 0 ms); it must not start firing now.\n if (n < 1) return []\n switch (m[2]) {\n case \"s\": return [{ id: \"rule-1\", kind: \"minutes\", every: 1 }]\n case \"m\": return n < 60\n ? [{ id: \"rule-1\", kind: \"minutes\", every: n }]\n : [{ id: \"rule-1\", kind: \"hours\", every: Math.min(23, Math.max(1, Math.round(n / 60))), minute: 0 }]\n case \"h\": return n < 24\n ? [{ id: \"rule-1\", kind: \"hours\", every: n, minute: 0 }]\n : [{ id: \"rule-1\", kind: \"days\", every: Math.min(31, Math.max(1, Math.round(n / 24))), hour: 0, minute: 0 }]\n default: return [{ id: \"rule-1\", kind: \"days\", every: Math.min(31, n), hour: 0, minute: 0 }]\n }\n }\n const expression = interval === \"\" || interval === \"custom\" ? explicit : interval\n if (!isCronExpression(expression)) return []\n const fromCron = cronToRule(expression)\n // Through the normaliser like every other rule: a cron nobody could say in\n // words (\"0 9 * * 5-0\" — an empty weekday set) must come out as \"not\n // configured\", never as a rule that silently matches nothing or everything.\n return normalizeScheduleRules([fromCron ?? { id: \"rule-1\", kind: \"cron\", cron: expression.split(/\\s+/).join(\" \") }])\n}\n\n/** A cron step; a zero or negative step is not a step (it never matched before either). */\nfunction cronStep(field: string): number | null {\n const m = field.match(/^\\*\\/(\\d+)$/)\n if (!m) return null\n const n = parseInt(m[1], 10)\n return n >= 1 ? n : null\n}\n\n/** The plain shapes a cron expression can be said in words; anything else stays a cron rule. */\nfunction cronToRule(expression: string): ScheduleRule | null {\n const [min, hour, dom, month, dow] = expression.trim().split(/\\s+/)\n if (month !== \"*\") return null\n const minN = /^\\d+$/.test(min) ? parseInt(min, 10) : null\n const hourN = /^\\d+$/.test(hour) ? parseInt(hour, 10) : null\n const stepMin = cronStep(min)\n const stepHour = cronStep(hour)\n if (stepMin !== null && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"minutes\", every: stepMin }\n if (min === \"*\" && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"minutes\", every: 1 }\n if (minN !== null && stepHour !== null && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"hours\", every: stepHour, minute: minN }\n if (minN !== null && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"hours\", every: 1, minute: minN }\n if (minN !== null && hourN !== null && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"days\", every: 1, hour: hourN, minute: minN }\n if (minN !== null && hourN !== null && dom === \"*\" && /^[0-6](,[0-6])*$|^[0-6]-[0-6]$/.test(dow)) {\n const weekdays = dow.includes(\"-\")\n ? (() => { const [a, b] = dow.split(\"-\").map(Number); return Array.from({ length: b - a + 1 }, (_, i) => a + i) })()\n : dow.split(\",\").map(Number)\n return { id: \"rule-1\", kind: \"weeks\", every: 1, hour: hourN, minute: minN, weekdays }\n }\n if (minN !== null && hourN !== null && /^\\d+$/.test(dom) && dow === \"*\") {\n return { id: \"rule-1\", kind: \"months\", every: 1, hour: hourN, minute: minN, dayOfMonth: parseInt(dom, 10) }\n }\n return null\n}\n\n// ---------------------------------------------------------------------------\n// Local time\n// ---------------------------------------------------------------------------\n\nexport interface LocalTime {\n readonly year: number\n /** 1–12 */\n readonly month: number\n /** 1–31 */\n readonly day: number\n readonly hour: number\n readonly minute: number\n /** 0 = Sunday … 6 = Saturday */\n readonly weekday: number\n /** Calendar days since 1970-01-01, in the schedule's timezone. */\n readonly epochDay: number\n}\n\n/**\n * Formatters are cached under the zone's CANONICAL name (`resolvedOptions`),\n * never under the string a request spelled it with — \"aSiA/jErUsAlEm\" is\n * accepted by Intl, and a caller can spell a zone thousands of ways. The\n * spelling → canonical map is bounded too, since that is the one a request\n * can grow.\n */\nconst formatters = new Map<string, Intl.DateTimeFormat>()\nconst canonicalZone = new Map<string, string>()\nconst MAX_ZONE_SPELLINGS = 1024\n\nfunction formatterFor(timezone: string | undefined): Intl.DateTimeFormat | null {\n const spelled = timezone && timezone.trim() ? timezone.trim() : \"UTC\"\n const known = canonicalZone.get(spelled)\n if (known) return formatters.get(known) ?? null\n try {\n const fmt = new Intl.DateTimeFormat(\"en-US\", {\n timeZone: spelled,\n hourCycle: \"h23\",\n year: \"numeric\",\n month: \"2-digit\",\n day: \"2-digit\",\n hour: \"2-digit\",\n minute: \"2-digit\",\n })\n const canonical = fmt.resolvedOptions().timeZone\n if (!formatters.has(canonical)) formatters.set(canonical, fmt)\n if (canonicalZone.size >= MAX_ZONE_SPELLINGS) canonicalZone.clear()\n canonicalZone.set(spelled, canonical)\n return formatters.get(canonical) ?? fmt\n } catch {\n return null\n }\n}\n\n/** A timezone this runtime can read the clock in (an IANA name such as `Asia/Jerusalem`). */\nexport function isValidTimezone(value: unknown): value is string {\n return typeof value === \"string\" && value.trim() !== \"\" && formatterFor(value) !== null\n}\n\n/** One wall-clock minute, as a key: the same key twice means the clocks fell back. */\nexport function localMinuteKey(local: LocalTime): string {\n return `${local.epochDay}:${local.hour}:${local.minute}`\n}\n\nfunction localFromComponents(year: number, month: number, day: number, hour: number, minute: number): LocalTime {\n const epochDay = Math.floor(Date.UTC(year, month - 1, day) / 86400000)\n // 1970-01-01 was a Thursday (4).\n const weekday = (((epochDay % 7) + 7 + 4) % 7)\n return { year, month, day, hour: hour === 24 ? 0 : hour, minute, weekday, epochDay }\n}\n\n/** The wall-clock time in the schedule's timezone (UTC when it is missing or unknown). */\nexport function localTimeIn(date: Date, timezone?: string): LocalTime {\n const fmt = formatterFor(timezone)\n if (!fmt) return localFromComponents(date.getUTCFullYear(), date.getUTCMonth() + 1, date.getUTCDate(), date.getUTCHours(), date.getUTCMinutes())\n const parts: Record<string, number> = {}\n for (const p of fmt.formatToParts(date)) {\n if (p.type === \"literal\") continue\n parts[p.type] = parseInt(p.value, 10)\n }\n return localFromComponents(parts.year, parts.month, parts.day, parts.hour, parts.minute)\n}\n\n/** How far the timezone's wall clock is ahead of UTC at this instant, in minutes. */\nexport function timezoneOffsetMinutes(date: Date, timezone?: string): number {\n const local = localTimeIn(date, timezone)\n const asUtc = Date.UTC(local.year, local.month - 1, local.day, local.hour, local.minute)\n const truncated = Math.floor(date.getTime() / 60000) * 60000\n return Math.round((asUtc - truncated) / 60000)\n}\n\nfunction daysInMonth(year: number, month: number): number {\n return new Date(Date.UTC(year, month, 0)).getUTCDate()\n}\n\n// ---------------------------------------------------------------------------\n// Matching\n// ---------------------------------------------------------------------------\n\n/** Standard 5-field cron field: `*`, `N`, `a-b`, `a,b`, `*\\/N`, `a-b/N`, `a/N`. */\nexport function matchesCronField(field: string, value: number, min: number, max: number): boolean {\n if (field === \"*\") return true\n if (field.includes(\",\")) return field.split(\",\").some((part) => matchesCronField(part.trim(), value, min, max))\n if (field.includes(\"/\")) {\n const [range, step] = field.split(\"/\")\n const stepNum = parseInt(step, 10)\n if (Number.isNaN(stepNum) || stepNum <= 0) return false\n if (range === \"*\") return value % stepNum === 0\n if (range.includes(\"-\")) {\n const [start, end] = parseRange(range)\n if (start === null || end === null) return false\n return value >= start && value <= end && (value - start) % stepNum === 0\n }\n const start = parseInt(range, 10)\n if (Number.isNaN(start)) return false\n return value >= start && value <= max && (value - start) % stepNum === 0\n }\n if (field.includes(\"-\")) {\n const [start, end] = parseRange(field)\n if (start === null || end === null) return false\n return value >= start && value <= end\n }\n const num = parseInt(field, 10)\n return !Number.isNaN(num) && num === value\n}\n\nfunction parseRange(range: string): [number | null, number | null] {\n const parts = range.split(\"-\")\n if (parts.length !== 2) return [null, null]\n const start = parseInt(parts[0], 10)\n const end = parseInt(parts[1], 10)\n return [Number.isNaN(start) ? null : start, Number.isNaN(end) ? null : end]\n}\n\n/** Does this wall-clock minute match the cron expression? */\nexport function matchesCron(expression: string, local: LocalTime): boolean {\n const fields = expression.trim().split(/\\s+/)\n if (fields.length !== 5) return false\n // Every field must match (day-of-month AND day-of-week — the stricter of\n // the two readings crontabs disagree on; documented). Sunday answers to 7\n // as well as 0, as it does in every crontab.\n return (\n matchesCronField(fields[0], local.minute, 0, 59) &&\n matchesCronField(fields[1], local.hour, 0, 23) &&\n matchesCronField(fields[2], local.day, 1, 31) &&\n matchesCronField(fields[3], local.month, 1, 12) &&\n (matchesCronField(fields[4], local.weekday, 0, 6) || (local.weekday === 0 && matchesCronField(fields[4], 7, 0, 7)))\n )\n}\n\n/** Does this wall-clock minute match the rule? */\nexport function ruleMatches(rule: ScheduleRule, local: LocalTime): boolean {\n const every = Math.max(1, rule.every ?? 1)\n const minute = rule.minute ?? 0\n const hour = rule.hour ?? 0\n switch (rule.kind) {\n case \"minutes\":\n return local.minute % every === 0\n case \"hours\":\n return local.minute === minute && local.hour % every === 0\n case \"days\":\n return local.minute === minute && local.hour === hour && local.epochDay % every === 0\n case \"weeks\": {\n // Monday-start weeks counted from the epoch (1970-01-01 was a Thursday, so +3 lands Monday 1969-12-29 on week 0).\n const weekIndex = Math.floor((local.epochDay + 3) / 7)\n return (\n local.minute === minute &&\n local.hour === hour &&\n (rule.weekdays ?? []).includes(local.weekday) &&\n weekIndex % every === 0\n )\n }\n case \"months\": {\n const wanted = Math.min(rule.dayOfMonth ?? 1, daysInMonth(local.year, local.month))\n const monthIndex = local.year * 12 + (local.month - 1)\n return local.minute === minute && local.hour === hour && local.day === wanted && monthIndex % every === 0\n }\n case \"cron\":\n return typeof rule.cron === \"string\" && matchesCron(rule.cron, local)\n }\n}\n\n/** Does the schedule run at this instant (any rule, this minute)? */\nexport function scheduleMatchesAt(spec: ScheduleSpec, at: Date): boolean {\n if (spec.rules.length === 0) return false\n const local = localTimeIn(at, spec.timezone)\n return spec.rules.some((rule) => ruleMatches(rule, local))\n}\n\n// ---------------------------------------------------------------------------\n// Occurrences (previews)\n// ---------------------------------------------------------------------------\n\n/** Clocks change on a quarter hour at the latest (Adelaide and Lord Howe move mid-UTC-hour), so the offset is re-read per 15-minute slot. */\nconst OFFSET_SLOT_MS = 15 * 60000\n\n/**\n * Every minute in [from, until] at which the schedule runs, oldest first, at\n * most `cap`. Scans minute by minute with the timezone offset re-read once per\n * quarter hour, so a 62-day horizon costs ~90k cheap checks and ~6k clock\n * reads. A wall-clock minute the clocks fall back onto is listed once.\n */\nexport function scheduleOccurrences(spec: ScheduleSpec, from: Date, until: Date, cap: number): Date[] {\n const out: Date[] = []\n if (spec.rules.length === 0 || cap <= 0) return out\n const rules = spec.rules\n let t = Math.ceil(from.getTime() / 60000) * 60000\n const end = until.getTime()\n let slot = -1\n let offset = 0\n let lastKey = \"\"\n while (t <= end && out.length < cap) {\n const thisSlot = Math.floor(t / OFFSET_SLOT_MS)\n if (thisSlot !== slot) {\n slot = thisSlot\n offset = timezoneOffsetMinutes(new Date(t), spec.timezone)\n }\n const shifted = new Date(t + offset * 60000)\n const local = localFromComponents(\n shifted.getUTCFullYear(),\n shifted.getUTCMonth() + 1,\n shifted.getUTCDate(),\n shifted.getUTCHours(),\n shifted.getUTCMinutes(),\n )\n if (rules.some((rule) => ruleMatches(rule, local))) {\n const key = localMinuteKey(local)\n if (key !== lastKey) out.push(new Date(t))\n lastKey = key\n }\n t += 60000\n }\n return out\n}\n\nconst DAY_MS = 86400000\n\n/**\n * How far ahead a preview must look to find the schedule's next run: two\n * periods of its slowest rule (a quarterly rule needs half a year, a yearly\n * one two), never less than two months and never more than ~two years.\n */\nexport function previewHorizonMs(rules: ReadonlyArray<ScheduleRule>): number {\n let longest = 0\n for (const rule of rules) {\n const every = Math.max(1, rule.every ?? 1)\n const period =\n rule.kind === \"days\" ? every * DAY_MS\n : rule.kind === \"weeks\" ? every * 7 * DAY_MS\n : rule.kind === \"months\" ? every * 31 * DAY_MS\n : rule.kind === \"cron\" ? 366 * DAY_MS\n : DAY_MS\n if (period > longest) longest = period\n }\n return Math.min(800 * DAY_MS, Math.max(62 * DAY_MS, longest * 2 + DAY_MS))\n}\n\n/**\n * The next `count` runs strictly after `from` (the minute `from` is in does\n * not count, the very next one does), looking `horizonMs` ahead — by default\n * as far as the rules need (`previewHorizonMs`).\n */\nexport function nextScheduleRuns(spec: ScheduleSpec, from: Date, count: number, horizonMs = previewHorizonMs(spec.rules)): Date[] {\n return scheduleOccurrences(spec, new Date(from.getTime() + 1), new Date(from.getTime() + horizonMs), count)\n}\n\n// Putting a rule into words is deliberately NOT here: the editor says it in\n// the person's language (i18n), and nothing in the wire contract needs the\n// English. The rule's fields are the structured form to render from.\n","/**\n * Schedule Trigger \"Retry on failure\" — the ONE shape both sides read.\n *\n * A scheduled run nobody watches can fail for a reason that passes\n * (a provider lane down for a while). With a retry policy on the node, the\n * server runs the failed run again after a wait, a bounded number of times;\n * absent, nothing is retried and the schedule behaves exactly as before.\n *\n * - `afterMinutes` — how long after the failure the retry may start.\n * - `maxAttempts` — how many retries one failed scheduled run may get\n * (the original run is not an attempt).\n * - `cheapLanesOnly` — the model calls made by the run (the original\n * scheduled run AND its retries) that honour the flag stay on the\n * aggregator lane: a call that fails there is not re-asked on the vendor's\n * own, pricier API; it fails, and the retry handles it later. Which node\n * types honour it is listed on the Schedule Trigger's docs page\n * (docs/nodes/input/schedule-trigger.md, \"Cheap lanes only\").\n *\n * The node stores it as `data.retry`, the server projects it onto the\n * trigger row's `config.retry` (lib/workflow-trigger-sync.ts), and the API\n * takes the same object in `config` (POST / PATCH /v1/workflow-triggers).\n */\n\nexport interface ScheduleRetry {\n /** 5–1440 (a day). */\n readonly afterMinutes: number\n /** 1–5. */\n readonly maxAttempts: number\n readonly cheapLanesOnly: boolean\n}\n\nexport const SCHEDULE_RETRY_LIMITS = {\n afterMinutes: [5, 1440] as const,\n maxAttempts: [1, 5] as const,\n} as const\n\nexport const SCHEDULE_RETRY_DEFAULTS: ScheduleRetry = Object.freeze({\n afterMinutes: 30,\n maxAttempts: 3,\n cheapLanesOnly: true,\n})\n\nfunction int(value: unknown): number | null {\n if (typeof value === \"number\" && Number.isFinite(value)) return Math.trunc(value)\n if (typeof value === \"string\" && /^-?\\d+$/.test(value.trim())) return parseInt(value.trim(), 10)\n return null\n}\n\nfunction clamp(value: number | null, [lo, hi]: readonly [number, number], fallback: number): number {\n if (value === null) return fallback\n return Math.min(hi, Math.max(lo, value))\n}\n\n/**\n * A retry policy as stored on a node or a row → the policy the server runs,\n * or `null` when there is none (absent, `null`, or not an object — the\n * feature off). Out-of-range numbers are clamped, never refused: like a\n * rule, a half-typed value must not silently switch the retry off; the API\n * refuses out-of-range values before they are stored (its Zod), so a stored\n * value reaching the clamp is a node written by hand.\n */\nexport function normalizeScheduleRetry(raw: unknown): ScheduleRetry | null {\n if (!raw || typeof raw !== \"object\") return null\n const r = raw as Record<string, unknown>\n return {\n afterMinutes: clamp(int(r.afterMinutes), SCHEDULE_RETRY_LIMITS.afterMinutes, SCHEDULE_RETRY_DEFAULTS.afterMinutes),\n maxAttempts: clamp(int(r.maxAttempts), SCHEDULE_RETRY_LIMITS.maxAttempts, SCHEDULE_RETRY_DEFAULTS.maxAttempts),\n // Off only when said so: the default keeps a scheduled run on the cheap lanes.\n cheapLanesOnly: r.cheapLanesOnly !== false,\n }\n}\n","/**\n * Build a label→output map for `{Node Label}` refs inside condition values\n * on filter-list and router nodes.\n *\n * Only considers edges whose `targetHandle === VARIABLES_HANDLE_ID` — the\n * dedicated condition-variables input handle. Data-flow edges (targetHandle\n * `\"in\"`, column handles, etc.) are ignored, so variable sources never\n * influence the filtered/routed list.\n *\n * Duplicate labels are suffixed `Same`, `Same (2)`, `Same (3)` — matches\n * the convention in `buildNodeRefMap` (frontend) / `buildNodeRefsMap`\n * (backend) for text-prompt refs.\n */\n\nexport const VARIABLES_HANDLE_ID = \"variables\"\n\ntype EdgeShape = {\n source: string\n target: string\n sourceHandle?: string | null\n targetHandle?: string | null\n}\n\ntype NodeShape = {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nexport function buildConditionVariables<\n E extends EdgeShape,\n N extends NodeShape,\n>(\n targetNodeId: string,\n edges: ReadonlyArray<E>,\n nodes: ReadonlyArray<N>,\n extractOutput: (node: N) => string | undefined,\n): Map<string, string> {\n const pairs: Array<{ label: string; output: string }> = []\n for (const edge of edges) {\n if (edge.target !== targetNodeId) continue\n if (edge.targetHandle !== VARIABLES_HANDLE_ID) continue\n const src = nodes.find((n) => n.id === edge.source)\n if (!src) continue\n // Surrounding whitespace is never part of a variable: a model's answer\n // (\"<id>\\n\") must still equal the field it is compared with.\n const output = extractOutput(src)?.trim()\n if (output === undefined || output === \"\") continue\n const label = (src.data.label as string) || src.type || src.id\n pairs.push({ label, output })\n }\n\n const map = new Map<string, string>()\n const counts = new Map<string, number>()\n for (const { label } of pairs) counts.set(label, (counts.get(label) ?? 0) + 1)\n const seen = new Map<string, number>()\n for (const { label, output } of pairs) {\n let key = label\n if ((counts.get(label) ?? 0) > 1) {\n const n = (seen.get(label) ?? 0) + 1\n seen.set(label, n)\n if (n > 1) key = `${label} (${n})`\n }\n map.set(key, output)\n }\n return map\n}\n","/**\n * Helpers for reading a node's accumulated `generatedResults` array.\n *\n * Used by both frontend DAG executor (`node-input-resolver.ts`) and backend\n * orchestrator (`output-extractor.ts`) so they agree on when a node has\n * upstream-consumable output.\n */\n\n/**\n * Extract all output values from a node's accumulated generatedResults.\n * Returns the full flat list (any length). Returns undefined only when empty.\n */\nexport function extractAllGeneratedResults(\n data: Record<string, unknown>,\n): string[] | undefined {\n const results = data.generatedResults as\n | Array<{ url?: string; text?: string }>\n | undefined\n if (!results || results.length === 0) return undefined\n const outputs = results\n .map((r) => r.url || r.text || \"\")\n .filter((v) => v.length > 0)\n return outputs.length > 0 ? outputs : undefined\n}\n\n/**\n * Extract a JSON array (e.g. web-scrape `generatedJson`) as a list of strings.\n * Each array element is stringified; already-string elements pass through.\n */\nexport function extractGeneratedJsonAsList(\n data: Record<string, unknown>,\n): string[] | undefined {\n const jsonArr = data.generatedJson\n if (!Array.isArray(jsonArr) || jsonArr.length === 0) return undefined\n return jsonArr.map((item: unknown) =>\n typeof item === \"string\" ? item : JSON.stringify(item),\n )\n}\n\n/**\n * If a collected item list has a single entry whose contents parse to a\n * non-empty JSON array, spread the array's elements into separate items.\n * Mirrors the `output.json` spread in the orchestrator so a list node with\n * one row holding a JSON array feeds filter-list / deduplicate / sort-list /\n * merge-lists per-element instead of as one giant stringified blob.\n */\nexport function spreadJsonArrayIfSingleton(items: string[]): string[] {\n if (items.length !== 1) return items\n const single = items[0]\n if (typeof single !== \"string\") return items\n const trimmed = single.trim()\n if (!trimmed.startsWith(\"[\")) return items\n let parsed: unknown\n try {\n parsed = JSON.parse(trimmed)\n } catch {\n return items\n }\n if (!Array.isArray(parsed) || parsed.length === 0) return items\n return parsed.map((el) =>\n typeof el === \"string\" ? el : JSON.stringify(el),\n )\n}\n","/**\n * Replace {} placeholders in a field value with upstream text.\n *\n * ONLY handles {} injection. Does NOT inject into empty fields.\n * Empty-field fallback (d.prompt || inputs.prompt) stays in per-node\n * execution code — the resolver doesn't decide which field is \"primary.\"\n */\nexport function injectUpstream(\n fieldValue: string | undefined,\n upstream: string | undefined,\n): string | undefined {\n if (!fieldValue || !upstream) return fieldValue\n if (fieldValue.includes(\"{}\")) return fieldValue.replaceAll(\"{}\", upstream)\n return fieldValue\n}\n","import { injectUpstream } from \"./inject-upstream.js\"\n\n/** A live wire into a field's handle: which node, and which of its outputs. */\nexport interface FieldEdgeSource {\n readonly sourceNodeId: string\n readonly sourceHandle?: string | null\n}\n\n/**\n * Resolve fieldMappings + {} injection for all text fields on a node.\n *\n * Three resolution mechanisms, in precedence order per field:\n * 1. edge source: a live edge into the field's handle → use that node's\n * output. Prefix-agnostic — the caller decides which edges map to which\n * field (e.g. FE/BE wrappers match `field-<key>` handles). Wins over both\n * fieldMappings and {} injection.\n * 2. fieldMappings: field mapped to source node → use that node's output\n * 3. {} injection: manual field contains {} → replace with upstreamText\n *\n * Does NOT inject upstream into empty unmapped fields — that stays in\n * per-node execution code (e.g., d.prompt || inputs.prompt).\n *\n * The `getSourceOutput` callback abstracts how source node output is\n * extracted — frontend reads from live React Flow state, backend reads\n * from NodeExecutionState.output. Same pattern as ancestor-refs.ts.\n *\n * `edgeSourceForField` is optional: when omitted, behaviour is identical to\n * the prior fieldMappings-only resolver (existing callers stay valid). When\n * it names the wire's source HANDLE too, the value is that handle's output —\n * a Router's route, a trigger's named output — not the source's primary one.\n */\nexport function resolveFieldMappings(\n data: Record<string, unknown>,\n upstreamText: string | undefined,\n mappableFieldNames: ReadonlyArray<string>,\n getSourceOutput: (sourceNodeId: string, sourceHandle?: string | null) => string | undefined,\n edgeSourceForField?: (field: string) => FieldEdgeSource | string | undefined,\n): Record<string, unknown> {\n const fm = data.fieldMappings as Record<string, { sourceNodeId: string }> | undefined\n const resolved = { ...data }\n\n for (const field of mappableFieldNames) {\n const wired = edgeSourceForField?.(field)\n const edge: FieldEdgeSource | undefined = typeof wired === \"string\" ? { sourceNodeId: wired } : wired\n const sourceNodeId = edge?.sourceNodeId ?? fm?.[field]?.sourceNodeId\n\n if (sourceNodeId) {\n const output = getSourceOutput(sourceNodeId, edge?.sourceHandle)\n if (output != null) resolved[field] = output\n } else {\n const current = resolved[field]\n if (typeof current === \"string\") {\n const injected = injectUpstream(current, upstreamText)\n if (injected !== current) resolved[field] = injected\n }\n }\n }\n\n return resolved\n}\n\n/**\n * Location buckets that may carry generated/uploaded variants. Mirrors the\n * full set of attachable buckets in `entity-prompts.ts::LOCATION_ATTACH_COLUMNS`,\n * but in camelCase (matching the in-memory location object and the\n * `WorkflowExportLocation` export shape).\n */\nconst LOCATION_BUCKETS = [\n \"timeOfDay\",\n \"weather\",\n \"seasons\",\n \"angles\",\n \"lighting\",\n \"atmosphereMotions\",\n] as const\n\ninterface LocationFieldEntry {\n /** Stable key — `sourceImageUrl` or `<bucket>[<index>]`. */\n key: string\n /** Human-readable label — `Main image` or `<bucket> / <variant.name>`. */\n label: string\n /** R2 URL of the image. */\n url: string\n}\n\n/**\n * Flatten a location's anchor image and every variant bucket into a single\n * ordered list of `{ key, label, url }` entries. Used by picker UIs and\n * ref-resolvers that need a stable, position-keyed view of every image\n * attached to a location.\n *\n * Bucket iteration order is fixed (see `LOCATION_BUCKETS`) so frontend and\n * backend produce identical lists from the same fixture. Missing buckets and\n * non-array values are treated as empty — the helper never throws.\n *\n * Mirrors the future character/object variants of this helper; same shape\n * (`key`, `label`, `url`) so callers can be polymorphic over entity kind.\n */\nexport function resolveLocationFields(\n loc: Record<string, unknown>,\n): LocationFieldEntry[] {\n const out: LocationFieldEntry[] = []\n\n if (typeof loc.sourceImageUrl === \"string\" && loc.sourceImageUrl.length > 0) {\n out.push({\n key: \"sourceImageUrl\",\n label: \"Main image\",\n url: loc.sourceImageUrl,\n })\n }\n\n for (const bucket of LOCATION_BUCKETS) {\n const raw = loc[bucket]\n if (!Array.isArray(raw)) continue\n raw.forEach((item, i) => {\n if (!item || typeof item !== \"object\") return\n const variant = item as { name?: unknown; url?: unknown }\n if (typeof variant.url !== \"string\" || variant.url.length === 0) return\n const name = typeof variant.name === \"string\" ? variant.name : \"\"\n out.push({\n key: `${bucket}[${i}]`,\n label: `${bucket} / ${name}`,\n url: variant.url,\n })\n })\n }\n\n return out\n}\n","/**\n * Follow a list node's `in` edge chain to its effective upstream source.\n *\n * When a `list` node has no manual rows but an incoming connection, the UI\n * renders its upstream's items (see list-node.tsx's `connectedItems ??\n * staticItems`). Without this helper, downstream readers would see an empty\n * list because `extractSourceNodeOutput` for `list` only reads `data.rows`.\n *\n * Shared between the frontend DAG executor (`node-input-resolver.ts`) and\n * the backend orchestrator (`inline-executor.ts`) so both paths resolve\n * list-connected-mode identically.\n */\n\ntype EdgeShape = {\n source: string\n target: string\n sourceHandle?: string | null\n targetHandle?: string | null\n}\n\ntype NodeShape = {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nfunction hasAnyRow(rows: string[][]): boolean {\n return rows.some((r) => r.some((v) => v?.trim()))\n}\n\nexport function resolveSourceThroughConnectedList<\n E extends EdgeShape,\n N extends NodeShape,\n>(edge: E, nodes: ReadonlyArray<N>, edges: ReadonlyArray<E>): E {\n const visited = new Set<string>()\n let current = edge\n while (true) {\n const src = nodes.find((n) => n.id === current.source)\n if (!src || src.type !== \"list\") return current\n if (visited.has(src.id)) return current\n visited.add(src.id)\n const rows = (src.data.rows as string[][] | undefined) ?? []\n if (hasAnyRow(rows)) return current\n const inEdge = edges.find(\n (e) => e.target === src.id && e.targetHandle === \"in\",\n )\n if (!inEdge) return current\n current = inEdge\n }\n}\n","/**\n * The displayed size of the image wired into a node's `image` input, as the\n * node it comes from records it: the result it shows (`generatedResults` at\n * `activeResultIndex`, its `width` and `height`), else its own `width` and\n * `height` (an upload). What an estimate that cannot read the file (the\n * editor's badge, a workflow estimate) knows of a photo's size. `undefined`\n * when no wired node records one.\n */\nimport type { SourceImageSize } from \"./model-catalog.js\"\n\nexport interface SizedGraphNode {\n id?: string\n data?: Record<string, unknown> | null\n}\n\nexport interface SizedGraphEdge {\n source?: string\n target?: string | null\n targetHandle?: string | null\n}\n\nconst positive = (v: unknown): v is number => typeof v === \"number\" && Number.isFinite(v) && v > 0\n\nexport function recordedImageSize(data: Record<string, unknown> | null | undefined): SourceImageSize | undefined {\n if (!data) return undefined\n const results = Array.isArray(data.generatedResults) ? (data.generatedResults as Array<Record<string, unknown> | null>) : []\n const index = typeof data.activeResultIndex === \"number\" ? data.activeResultIndex : 0\n const shown = results[index] ?? results[0]\n if (shown && positive(shown.width) && positive(shown.height)) return { width: shown.width, height: shown.height }\n if (positive(data.width) && positive(data.height)) return { width: data.width, height: data.height }\n return undefined\n}\n\nexport function wiredImageSize(\n nodeId: string,\n nodes: ReadonlyArray<SizedGraphNode>,\n edges: ReadonlyArray<SizedGraphEdge>,\n): SourceImageSize | undefined {\n for (const edge of edges) {\n if (edge.target !== nodeId || !edge.source || (edge.targetHandle ?? \"image\") !== \"image\") continue\n const size = recordedImageSize(nodes.find((n) => n.id === edge.source)?.data)\n if (size) return size\n }\n return undefined\n}\n\n/** True when a node carries an inpainting mask: its own `maskUrl`, or a wire into its `mask` input. */\nexport function nodeIsMasked(\n nodeId: string,\n data: Record<string, unknown> | null | undefined,\n edges: ReadonlyArray<SizedGraphEdge> | undefined,\n): boolean {\n if (typeof data?.maskUrl === \"string\" && data.maskUrl.length > 0) return true\n return (edges ?? []).some((e) => e.target === nodeId && e.targetHandle === \"mask\")\n}\n","import { tryParseJson } from \"./filter-condition.js\"\n\n/**\n * Element-wise merge across upstream lists with modulo-wrap.\n *\n * Used by the `merge-lists` node's \"zip\" mode. Each output position i takes\n * `lists[j][i % lists[j].length]` from every input; JSON objects are spread\n * into a single object (later sources override earlier ones on key conflicts),\n * non-object items are stringified and concatenated.\n *\n * Length semantics mirror the DAG's existing fan-out behavior: the result\n * length equals `max(len)` across non-empty inputs. Shorter inputs cycle.\n * This means a single-item upstream (e.g. a JSON-process node emitting one\n * object, or a list with one row) is automatically injected into every\n * element of a longer list.\n */\nexport function zipMergeLists(lists: ReadonlyArray<ReadonlyArray<string>>): string[] {\n const nonEmpty = lists.filter((l) => l.length > 0)\n if (nonEmpty.length === 0) return []\n if (nonEmpty.length === 1) return [...nonEmpty[0]]\n\n const maxLen = Math.max(...nonEmpty.map((l) => l.length))\n const out: string[] = []\n for (let i = 0; i < maxLen; i++) {\n const merged: Record<string, unknown> = {}\n const rawItems: string[] = []\n let hasObject = false\n for (const list of nonEmpty) {\n const item = list[i % list.length]\n rawItems.push(item)\n const parsed = tryParseJson(item)\n if (parsed && typeof parsed === \"object\" && !Array.isArray(parsed)) {\n hasObject = true\n Object.assign(merged, parsed as Record<string, unknown>)\n }\n }\n out.push(hasObject ? JSON.stringify(merged) : rawItems.join(\"\"))\n }\n return out\n}\n","import type { GenericNode, GenericEdge } from \"./types.js\"\nimport { EXECUTION_DATA_KEYS, NODE_TYPE_EXECUTION_DATA_KEYS } from \"./node-runtime-keys.js\"\nimport { SOCIAL_POST_NODE_TYPES } from \"./social-post.js\"\n\n/** A named media variant (expression, pose, angle, etc.) produced during entity generation. */\ninterface AssetVariant {\n name: string\n url: string\n}\n\n/** A mood-board / scrap photo attached to a location ({@link WorkflowExportLocation.referencePhotos}). */\ninterface ReferencePhoto {\n kind: string\n url: string\n}\n\nexport interface WorkflowExportCharacter {\n id: string\n nodeId: string\n name: string\n description?: string | null\n gender?: string | null\n style?: string | null\n baseOutfit?: string | null\n sourceImageUrl?: string | null\n expressions?: AssetVariant[]\n poses?: AssetVariant[]\n lightingVariations?: AssetVariant[]\n}\n\nexport interface WorkflowExportObject {\n id: string\n nodeId: string\n name: string\n description?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n angles?: AssetVariant[]\n materials?: AssetVariant[]\n variations?: AssetVariant[]\n}\n\n/** Animal/Creature entity export shape. Structural clone of {@link WorkflowExportObject}\n * with the object→creature DELTA MAP: adds free-text `species`, and the `materials`\n * asset slot becomes `poses`. */\nexport interface WorkflowExportCreature {\n id: string\n nodeId: string\n name: string\n description?: string | null\n species?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n angles?: AssetVariant[]\n poses?: AssetVariant[]\n variations?: AssetVariant[]\n}\n\nexport interface WorkflowExportLocation {\n id: string\n nodeId: string\n name: string\n description?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n timeOfDay?: AssetVariant[]\n weather?: AssetVariant[]\n angles?: AssetVariant[]\n // Location Studio Phase 1 (migration 124).\n lighting?: AssetVariant[]\n seasons?: AssetVariant[]\n atmosphereMotions?: AssetVariant[]\n referencePhotos?: ReferencePhoto[]\n canonicalDescription?: string | null\n styleLock?: boolean | null\n}\n\n/** A media URL referenced from a node's data, located by node + field path. */\nexport interface WorkflowMediaRef {\n nodeId: string\n nodeLabel?: string\n /** Dot/bracket path inside `node.data`, e.g. `imageUrl` or `referenceImageUrls[1]`. */\n field: string\n url: string\n}\n\n/**\n * Export-time portability analysis (#866). A bundle exported from a private\n * host carries media URLs only that host can serve (`http://localhost:3000/\n * storage/…`, a LAN address, a `.internal` name); imported anywhere else, the\n * nodes fail at Run time with an opaque provider fetch error. The exporter\n * lists those URLs here so the person exporting is told BEFORE sharing, and\n * an importer can explain what will not load. Absent when every media URL is\n * publicly routable.\n */\nexport interface WorkflowPortability {\n unreachableMedia: WorkflowMediaRef[]\n}\n\n/** The four entity kinds a bundle's `assets` can carry. */\nexport type WorkflowAssetKind = \"character\" | \"object\" | \"creature\" | \"location\"\n\n/**\n * A bundled entity the import declined to re-create (#1088). The workflow\n * still lands — the film is the thing the importer asked for — so this is how\n * they hear that an `@` chip arrived unbound.\n */\nexport interface WorkflowImportSkippedAsset {\n kind: WorkflowAssetKind\n /** The entity's id IN THE BUNDLE (the exporter's row id). */\n id: string\n name: string\n reason: string\n}\n\n/**\n * What the importer did about the bundle's media (#866). Publicly reachable\n * media that is not already on the importing instance's own storage is\n * copied there (`rehosted`) so the workflow runs from local copies; media on\n * a host the importer cannot reach is left as-is and listed (`unreachable`);\n * anything declined for another reason (too large, not a media type, over\n * the per-import cap, upload failed) is listed with the reason (`skipped`).\n *\n * The bundle's ENTITY images (`assets`) ride the same walk (#1088) — with one\n * rule of their own: they are copied even when they already sit on this\n * instance, because they are the EXPORTER's bytes and the two accounts'\n * lifecycles are uncorrelated (their delete, their quarantine sweep, their\n * retention reaper). Only bytes the importer already owns are left alone.\n */\nexport interface WorkflowImportReport {\n rehosted: number\n unreachable: WorkflowMediaRef[]\n skipped: Array<WorkflowMediaRef & { reason: string }>\n /**\n * Bundled entity id (the EXPORTER's) → the row created under the importer,\n * for every entity the import re-created. Present whenever the bundle\n * carried `assets`. A client that holds chips outside the graph — a\n * timeline, a copy-a-shared-production path that never posts to\n * `/v1/workflows/import` — re-points them with this; the server has already\n * re-pointed every `references[]` entry inside the nodes it stored.\n */\n assetIdMap?: Record<string, string>\n /** Entities the import declined to create (storage quota). The workflow\n * still landed; chips bound to these arrive unresolvable. */\n assetsSkipped?: WorkflowImportSkippedAsset[]\n /** Anything else the importer should know, e.g. copies were made but the\n * workflow could not be updated to use them. */\n notes?: string[]\n}\n\nexport interface WorkflowExport {\n version: 1\n exportedAt: string\n name: string\n nodes: GenericNode[]\n edges: GenericEdge[]\n settings?: Record<string, unknown>\n assets?: {\n characters: WorkflowExportCharacter[]\n objects: WorkflowExportObject[]\n creatures?: WorkflowExportCreature[]\n locations: WorkflowExportLocation[]\n }\n /** Present only when the bundle references media another instance cannot fetch. */\n portability?: WorkflowPortability\n}\n\n/**\n * Config keys that are (mis)classified inside EXECUTION_DATA_KEYS but are\n * actually USER CONFIG a template MUST keep — NOT runtime/result. `shots` is\n * the Kling-3.0 multi-shot storyboard (user-authored, route-accepted via\n * shotsSchema); stripping it on template export silently drops every shot's\n * prompt+duration while leaving `multiShot:true`, producing a broken template.\n * (`elements`, the sibling Kling-3 config, is correctly absent from\n * EXECUTION_DATA_KEYS — `shots` should arguably be too, but is kept there for\n * other run-state consumers, so we exclude it here rather than reclassify.)\n */\nconst TEMPLATE_KEEP_CONFIG_KEYS = new Set<string>([\"shots\"])\n\n/**\n * Top-level node data fields cleared on template export. Built from\n * EXECUTION_DATA_KEYS (the single source of truth for runtime/result keys),\n * minus the config keys above, so a new result field is stripped by default —\n * never re-leak generated media URLs, job ids, or trained-LoRA identity\n * (loraReplicateVersion / loraTriggerWord / outputResults / generatedVideoUrl\n * / …) into a shareable template — while preserving user config. `assetId` is\n * the one non-runtime extra (a library-asset pointer).\n */\nconst GENERATED_FIELDS: readonly string[] = [\n ...[...EXECUTION_DATA_KEYS].filter((k) => !TEMPLATE_KEEP_CONFIG_KEYS.has(k)),\n \"assetId\",\n]\n\n/** Per-node-type extra generated fields beyond GENERATED_FIELDS. Unknown types get no extras ([] default). */\nconst NODE_EXTRA_FIELDS: Record<string, string[]> = {\n // A template must never import ARMED: the switch is the importer's to flip\n // (a schedule starts paused), and the rules themselves are config that\n // travels.\n \"schedule-trigger\": [\"active\"],\n // Same for a Telegram Account Trigger: listening is the importer's to start.\n \"telegram-account-trigger\": [\"isActive\"],\n character: [\"expressions\", \"poses\", \"lightingVariations\", \"angles\", \"customVariations\"],\n object: [\"angles\", \"materials\", \"variations\", \"customVariations\"],\n creature: [\"angles\", \"poses\", \"variations\", \"customVariations\"],\n location: [\n \"timeOfDay\",\n \"weather\",\n \"angles\",\n \"lighting\",\n \"seasons\",\n \"atmosphereMotions\",\n \"customVariations\",\n \"referencePhotos\",\n \"canonicalDescription\",\n ],\n // Strip the exporter's private face-row pointer + variants from templates\n // (faceDbId points at a row the importer doesn't own — see workflow-assets\n // import remap, which also clears it).\n face: [\"faceDbId\", \"expressions\", \"customVariations\"],\n // A template shouldn't carry a link to a specific child workflow id (it's\n // the exporter's, and unremapped on import). Strip it so the node lands\n // unlinked rather than dangling at the exporter's workflow.\n \"sub-workflow\": [\"referencedWorkflowId\"],\n}\n\n/**\n * Node fields that point at a row the IMPORTER does not own — a stored HTTP\n * credential behind a Webhook Output, a connected social account behind a\n * publisher. The id alone is useless without owning the row (resolution is\n * owner-scoped), so nothing leaks either way; the point is that the imported\n * node lands UNBOUND and the importer picks their own, instead of carrying a\n * dangling pointer at the exporter's account. Applied by every export shape,\n * including the asset bundle that otherwise keeps node data verbatim.\n */\nconst UNOWNED_REF_FIELDS: Record<string, readonly string[]> = {\n \"webhook-output\": [\"credentialId\"],\n // The exporter's connected Telegram account and its chats (a Saved Messages\n // chat id IS the exporter's Telegram user id) — the importer picks their own.\n \"telegram-account-trigger\": [\"accountId\", \"chatIds\", \"chatTitles\", \"senderIds\"],\n // Telegram Reply: the exporter's account and their bot.\n \"telegram-account-send\": [\"accountId\", \"connectionId\"],\n ...Object.fromEntries([...SOCIAL_POST_NODE_TYPES].map((type) => [type, [\"connectionId\"]])),\n}\n\n/** Clear owner-bound references (credential / connection ids). Returns new node objects; inputs are not mutated. */\nexport function stripUnownedRefs(nodes: GenericNode[]): GenericNode[] {\n return nodes.map((node) => {\n const fields = UNOWNED_REF_FIELDS[node.type]\n if (!fields || !node.data) return node\n const data = { ...(node.data as Record<string, unknown>) }\n let changed = false\n for (const field of fields) {\n if (field in data) {\n delete data[field]\n changed = true\n }\n }\n return changed ? { ...node, data } : node\n })\n}\n\n/** Strip generated/transient content from nodes for template export. Returns new node objects; inputs are not mutated. */\nexport function stripExportContent(nodes: GenericNode[]): GenericNode[] {\n return stripUnownedRefs(nodes).map((node) => {\n const data = { ...(node.data as Record<string, unknown>) }\n for (const field of GENERATED_FIELDS) delete data[field]\n // A type's own run results under generic names (UGC Clips' `quote`, …): stripped from that type only.\n for (const field of NODE_TYPE_EXECUTION_DATA_KEYS[node.type] ?? []) delete data[field]\n const extras = NODE_EXTRA_FIELDS[node.type] ?? []\n for (const field of extras) delete data[field]\n // A node an assistant made in an MCP conversation keeps where it came from (the\n // request is what makes the template useful), never the exporter's job id.\n const provenance = data.mcpProvenance\n if (provenance && typeof provenance === \"object\" && \"jobId\" in provenance) {\n const { jobId: _jobId, ...kept } = provenance as Record<string, unknown>\n data.mcpProvenance = kept\n }\n return { ...node, data }\n })\n}\n","export interface SubWorkflowPort {\n readonly id: string\n readonly name: string\n readonly mediaType: \"text\" | \"image\" | \"video\" | \"audio\" | \"any\"\n}\n\ninterface BoundaryNode {\n readonly id: string\n readonly type: string\n readonly data: { readonly routeId?: string; readonly ports?: readonly SubWorkflowPort[] }\n}\n\nexport type ValidationError =\n | { code: \"missing_output_for_route\"; routeId: string; inputNodeId: string }\n | { code: \"missing_input_for_route\"; routeId: string; outputNodeId: string }\n | { code: \"route_has_no_output_ports\"; routeId: string; outputNodeId: string }\n | { code: \"duplicate_route_id\"; routeId: string; nodeIds: readonly string[] }\n\nexport type ValidationResult =\n | { ok: true }\n | { ok: false; errors: readonly ValidationError[] }\n\nexport function validateSubWorkflowRoutes(\n nodes: readonly BoundaryNode[],\n): ValidationResult {\n const inputs = nodes.filter((n) => n.type === \"sub-workflow-input\")\n const outputs = nodes.filter((n) => n.type === \"sub-workflow-output\")\n\n if (inputs.length === 0 && outputs.length === 0) return { ok: true }\n\n const errors: ValidationError[] = []\n\n // 1. Duplicate routeIds within input or output lists\n const groupByRoute = (list: readonly BoundaryNode[]) => {\n const map = new Map<string, BoundaryNode[]>()\n for (const n of list) {\n const r = n.data.routeId\n if (!r) continue\n const bucket = map.get(r) ?? []\n bucket.push(n)\n map.set(r, bucket)\n }\n return map\n }\n for (const [routeId, group] of groupByRoute(inputs)) {\n if (group.length > 1) errors.push({ code: \"duplicate_route_id\", routeId, nodeIds: group.map((g) => g.id) })\n }\n for (const [routeId, group] of groupByRoute(outputs)) {\n if (group.length > 1) errors.push({ code: \"duplicate_route_id\", routeId, nodeIds: group.map((g) => g.id) })\n }\n\n // 2. Every input routeId must have a matching output\n const outputByRoute = new Map(outputs.map((o) => [o.data.routeId, o] as const))\n for (const inputNode of inputs) {\n const routeId = inputNode.data.routeId\n if (!routeId) continue\n const matchingOutput = outputByRoute.get(routeId)\n if (!matchingOutput) {\n errors.push({ code: \"missing_output_for_route\", routeId, inputNodeId: inputNode.id })\n continue\n }\n if (!matchingOutput.data.ports || matchingOutput.data.ports.length === 0) {\n errors.push({ code: \"route_has_no_output_ports\", routeId, outputNodeId: matchingOutput.id })\n }\n }\n\n // 3. Every output routeId must have a matching input\n const inputByRoute = new Map(inputs.map((i) => [i.data.routeId, i] as const))\n for (const outputNode of outputs) {\n const routeId = outputNode.data.routeId\n if (!routeId) continue\n if (!inputByRoute.has(routeId)) {\n errors.push({ code: \"missing_input_for_route\", routeId, outputNodeId: outputNode.id })\n }\n }\n\n return errors.length === 0 ? { ok: true } : { ok: false, errors }\n}\n","import { z, type ZodType } from \"zod\"\n// Reuse the canonical `OutputType` from presentation-utils so a single union\n// is the source of truth across the package. Re-exporting it here would\n// collide with the explicit named re-export in `index.ts`.\nimport type { OutputType } from \"./presentation-utils.js\"\n\n// `ZodType<Output, Def, Input>` with `Input = any` lets us accept schemas\n// like `z.object({ x: z.string().default(\"\") })` where the parsed output is\n// `{ x: string }` but the input is `{ x?: string }`. Pinning Input to TConfig\n// would force input === output and reject `.default()` schemas.\nexport type ReduceStrategy<TConfig = unknown> = {\n readonly id: string\n readonly label: string\n readonly description: string\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n readonly configSchema: ZodType<TConfig, any>\n readonly defaultConfig: TConfig\n readonly outputType: OutputType\n readonly creditCostKey: string\n /**\n * The strategy calls an LLM (its judge model). Everything that treats\n * \"an LLM strategy\" specially — the connected-install cloud proxy, the\n * tiered credit id — reads this rather than matching on the id, so a new\n * LLM strategy is covered by declaring it here.\n */\n readonly usesLlm?: boolean\n}\n\n// User-facing copy lives HERE (single source of truth) and flows into the node\n// body, the config panel dropdown, the SDK docs and the MCP tool. Written for\n// the person building the flow, not the engine: say what happens to their\n// candidates, never \"survivor\" / \"fan-in\" / \"reduce\" / model names.\nconst PICK_BEST_LLM_STRATEGY = {\n id: \"pick-best-llm\",\n label: \"AI picks the best\",\n description: \"AI compares every candidate against your criteria and picks one.\",\n configSchema: z.object({\n // Default to the sensible \"best quality\" criteria when omitted (matches\n // defaultConfig) so a reduce({strategyId:\"pick-best-llm\"}) call with no\n // criteria degrades gracefully instead of erroring. An explicit \"\" still\n // rejects via min(1).\n criteria: z.string().min(1, \"criteria cannot be empty\").default(\"Pick the highest-quality result.\"),\n inputKind: z.enum([\"text\", \"image-url\"]).default(\"text\"),\n // The judge model, like every other LLM node (llmModel + LlmModelSelect).\n // Optional: omitted → LLM_FEATURE_DEFAULTS[\"pick-best-llm\"]. Validated\n // against LLM_MODEL_IDS at the route (the registry can't import the model\n // list without a cycle), and its tier drives the credit price via\n // buildLlmCreditIdentifier — economy / standard / premium.\n llmModel: z.string().optional(),\n }),\n defaultConfig: { criteria: \"Pick the highest-quality result.\", inputKind: \"text\" as const },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:pick-best-llm\",\n usesLlm: true,\n} as const satisfies ReduceStrategy<{ criteria: string; inputKind: \"text\" | \"image-url\"; llmModel?: string }>\n\nconst CONCAT_STRATEGY = {\n id: \"concat\",\n label: \"Join into one text\",\n description: \"Puts every candidate into a single text, one after another, with a separator between them.\",\n configSchema: z.object({ separator: z.string().default(\"\\n\\n\") }),\n defaultConfig: { separator: \"\\n\\n\" },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:concat\",\n} as const satisfies ReduceStrategy<{ separator: string }>\n\nconst FIRST_NON_EMPTY_STRATEGY = {\n id: \"first-non-empty\",\n label: \"First that has content\",\n description: \"Takes the first candidate that is not empty and ignores the rest.\",\n configSchema: z.object({}),\n defaultConfig: {},\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:first-non-empty\",\n} as const satisfies ReduceStrategy<Record<string, never>>\n\nconst COUNT_STRATEGY = {\n id: \"count\",\n label: \"Count them\",\n description: \"Outputs how many candidates arrived.\",\n configSchema: z.object({}),\n defaultConfig: {},\n outputType: \"data\" as OutputType,\n creditCostKey: \"reduce:count\",\n} as const satisfies ReduceStrategy<Record<string, never>>\n\nconst VOTE_STRATEGY = {\n id: \"vote\",\n label: \"Most common answer\",\n description: \"Picks the candidate that appears most often (ties go to the first).\",\n configSchema: z.object({ caseSensitive: z.boolean().default(false) }),\n defaultConfig: { caseSensitive: false },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:vote\",\n} as const satisfies ReduceStrategy<{ caseSensitive: boolean }>\n\nconst MERGE_JSON_STRATEGY = {\n id: \"merge-json\",\n label: \"Merge JSON objects\",\n description: \"Reads every candidate as JSON and merges them into one object.\",\n configSchema: z.object({ strategy: z.enum([\"deep\", \"shallow\"]).default(\"deep\") }),\n defaultConfig: { strategy: \"deep\" as const },\n outputType: \"data\" as OutputType,\n creditCostKey: \"reduce:merge-json\",\n} as const satisfies ReduceStrategy<{ strategy: \"deep\" | \"shallow\" }>\n\n/**\n * Result-meta shape returned by every reduce strategy. Shared between the\n * backend route, the SDK client, and the frontend node so all three layers\n * agree on field names. `selectedIndex` + `reasoning` are set by the\n * `pick-best-llm` and `vote` strategies (the former also fills `reasoning`);\n * `summary` is always populated.\n */\nexport type ReduceMeta = {\n readonly selectedIndex?: number\n readonly reasoning?: string\n readonly summary: string\n}\n\nexport const REDUCE_STRATEGIES = [\n PICK_BEST_LLM_STRATEGY,\n CONCAT_STRATEGY,\n FIRST_NON_EMPTY_STRATEGY,\n COUNT_STRATEGY,\n VOTE_STRATEGY,\n MERGE_JSON_STRATEGY,\n] as const\n\nexport const REDUCE_STRATEGY_IDS = REDUCE_STRATEGIES.map((s) => s.id) as readonly ReduceStrategyId[]\n\nexport type ReduceStrategyId = typeof REDUCE_STRATEGIES[number][\"id\"]\n\nconst BY_ID = new Map<string, ReduceStrategy>(REDUCE_STRATEGIES.map((s) => [s.id, s]))\n\nexport function getStrategy(id: ReduceStrategyId): ReduceStrategy {\n const s = BY_ID.get(id)\n if (!s) throw new Error(`unknown reduce strategy: ${id}`)\n return s\n}\n","/**\n * Which hosts a server-side fetch must never be pointed at: loopback, private,\n * link-local, cloud-metadata, multicast and reserved addresses. Pure and\n * dependency-free, so the server's SSRF gates (`safeFetch`, `safeUrlSchema`) and\n * the app runner's link card judge a host with the SAME rule — a link the card\n * accepts is not one the server then refuses for its address.\n *\n * Literal hosts only. A name that RESOLVES to a private address is caught where\n * the connection is made (`safeFetch` re-validates the resolved IP); nothing\n * here does DNS.\n *\n * The documentation blocks (192.0.2.0/24, 198.51.100.0/24, 203.0.113.0/24,\n * 2001:db8::/32) are deliberately NOT refused: no network routes them, so they\n * are no SSRF target, and this same rule decides which client addresses the\n * server trusts and keys rate limits on (client-address.ts, hosting-ranges.ts),\n * where they stand in for public addresses.\n */\n\nfunction isPrivateOrReservedIPv4(a: number, b: number, c: number): boolean {\n if (a === 0) return true // 0.0.0.0/8 \"this network\"\n if (a === 127) return true // 127.0.0.0/8 loopback\n if (a === 10) return true // 10.0.0.0/8 private\n if (a === 172 && b >= 16 && b <= 31) return true // 172.16.0.0/12 private\n if (a === 192 && b === 168) return true // 192.168.0.0/16 private\n if (a === 169 && b === 254) return true // 169.254.0.0/16 link-local + AWS/GCP metadata\n if (a === 100 && b >= 64 && b <= 127) return true // 100.64.0.0/10 CGN\n if (a === 198 && (b === 18 || b === 19)) return true // 198.18.0.0/15 benchmarking\n if (a === 192 && b === 0 && c === 0) return true // 192.0.0.0/24 IETF protocol assignments (DS-Lite, NAT64 discovery)\n if (a >= 224) return true // 224.0.0.0/4 multicast + 240.0.0.0/4 reserved + 255.255.255.255\n return false\n}\n\n/** The IPv4 address carried in two 16-bit groups. */\nfunction embeddedIPv4IsPrivate(hi: number, lo: number): boolean {\n return isPrivateOrReservedIPv4(hi >> 8, hi & 0xff, lo >> 8)\n}\n\n/**\n * The eight 16-bit groups of an IPv6 address, or null when `ip` is not one.\n * Reads `::` compression, a dotted IPv4 tail (`::ffff:127.0.0.1`) and a zone\n * suffix (`fe80::1%eth0`).\n */\nfunction ipv6Groups(ip: string): number[] | null {\n let text = ip.toLowerCase()\n const zone = text.indexOf(\"%\")\n if (zone >= 0) text = text.slice(0, zone)\n if (!text.includes(\":\") || !/^[0-9a-f:.]+$/.test(text)) return null\n\n const lastColon = text.lastIndexOf(\":\")\n const last = text.slice(lastColon + 1)\n if (last.includes(\".\")) {\n const parts = last.split(\".\")\n if (parts.length !== 4 || parts.some((p) => !/^\\d{1,3}$/.test(p) || Number(p) > 255)) return null\n const [a, b, c, d] = parts.map(Number) as [number, number, number, number]\n text = `${text.slice(0, lastColon + 1)}${((a << 8) | b).toString(16)}:${((c << 8) | d).toString(16)}`\n }\n\n const halves = text.split(\"::\")\n if (halves.length > 2) return null\n const groupsOf = (part: string) => (part === \"\" ? [] : part.split(\":\"))\n const head = groupsOf(halves[0] ?? \"\")\n const tail = halves.length === 2 ? groupsOf(halves[1] ?? \"\") : []\n if ([...head, ...tail].some((g) => !/^[0-9a-f]{1,4}$/.test(g))) return null\n if (halves.length === 1) {\n return head.length === 8 ? head.map((g) => parseInt(g, 16)) : null\n }\n const missing = 8 - head.length - tail.length\n if (missing < 1) return null\n return [...head, ...Array<string>(missing).fill(\"0\"), ...tail].map((g) => parseInt(g, 16))\n}\n\nfunction isPrivateOrReservedIPv6(g: number[]): boolean {\n const zeroThrough = (n: number) => g.slice(0, n).every((x) => x === 0)\n const [g0 = 0, g1 = 0, g2 = 0, g3 = 0, , g5 = 0, g6 = 0, g7 = 0] = g\n if (zeroThrough(8)) return true // :: unspecified\n if (zeroThrough(7) && g7 === 1) return true // ::1 loopback\n if (zeroThrough(5) && g5 === 0xffff) return embeddedIPv4IsPrivate(g6, g7) // ::ffff:0:0/96 IPv4-mapped\n if (zeroThrough(6)) return embeddedIPv4IsPrivate(g6, g7) // ::/96 IPv4-compatible (deprecated)\n if (g0 === 0x64 && g1 === 0xff9b && g.slice(2, 6).every((x) => x === 0)) {\n return embeddedIPv4IsPrivate(g6, g7) // 64:ff9b::/96 NAT64: the IPv4 it reaches\n }\n if (g0 === 0x64 && g1 === 0xff9b && g2 === 1) return true // 64:ff9b:1::/48 local-use NAT64\n if (g0 === 0x2002) return embeddedIPv4IsPrivate(g1, g2) // 2002::/16 6to4: the IPv4 it reaches\n if (g0 === 0x2001 && g1 === 0) return true // 2001::/32 Teredo\n if ((g0 & 0xfe00) === 0xfc00) return true // fc00::/7 unique-local\n if ((g0 & 0xffc0) === 0xfe80) return true // fe80::/10 link-local (fe80:: to febf::)\n if ((g0 & 0xffc0) === 0xfec0) return true // fec0::/10 site-local (deprecated)\n if ((g0 & 0xff00) === 0xff00) return true // ff00::/8 multicast\n return false\n}\n\n/**\n * True if the IP belongs to a range we refuse to connect to from server-side\n * fetches. Covers IPv4 loopback/private/link-local/cloud-metadata/CGN/\n * multicast/reserved, the equivalent IPv6 classes, and every\n * IPv6 form that carries an IPv4 address (mapped, compatible, NAT64, 6to4 —\n * judged by the IPv4 they reach). Something with a colon that is not a valid\n * IPv6 address is refused (fail closed); anything else that is not an IP (a\n * host name) is not refused here.\n */\nexport function isPrivateOrReservedIP(ip: string): boolean {\n const v4 = ip.match(/^(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})$/)\n if (v4) {\n return isPrivateOrReservedIPv4(Number(v4[1]), Number(v4[2]), Number(v4[3]))\n }\n if (!ip.includes(\":\")) return false\n const groups = ipv6Groups(ip)\n return groups === null ? true : isPrivateOrReservedIPv6(groups)\n}\n\n/**\n * True when a URL hostname (as `new URL(...).hostname` gives it, IPv6 still in\n * brackets) names this machine or a private/reserved IP literal. WHATWG parsing\n * has already folded decimal, octal and hex IPv4 spellings (`2130706433`,\n * `0x7f.1`) into dotted form, so those are caught as IP literals.\n */\nexport function isLocalOrPrivateHostname(hostname: string): boolean {\n const host = hostname.toLowerCase().replace(/^\\[|\\]$/g, \"\").replace(/\\.$/, \"\")\n if (host === \"localhost\" || host.endsWith(\".localhost\")) return true\n return isPrivateOrReservedIP(host)\n}\n","/**\n * The wire contract for one node's entry in an execution's `nodeStates` map —\n * the shape the orchestrator persists on `workflow_executions.node_states`,\n * emits on the SSE execution stream, and every client reads back.\n *\n * Why this lives here rather than in the backend\n * ----------------------------------------------\n * The shape had THREE independent declarations — the orchestrator's rich\n * `NodeExecutionState` (workflow-engine/types.ts), the SDK's loose one\n * (`packages/client/src/resources/executions.ts`) and the editor's local copy\n * (`workflow-editor/run-handlers.ts`) — and nothing tied them together. The\n * field that made that expensive is `output`: it used to be an unstated\n * convention that only a COMPLETED node carries one, so every consumer read it\n * exclusively under `status === \"completed\"` and a failed node's retained\n * result had nowhere to travel.\n *\n * This module states the rule once. The backend keeps its richer `NodeOutput`\n * typing (its `NodeExecutionState` must stay ASSIGNABLE to the wire shape — a\n * type-level test pins that); the SDK and the editor extend/import it.\n */\n\n/**\n * The status a node reports inside an execution.\n *\n * `cancelled` is deliberately absent: a cancelled child job is mapped onto\n * `skipped` by the reconcile lane (see `lib/reconcile/node-states.ts`), and a\n * HELD job keeps `status: \"running\"` with the `awaitingReview` sidecar rather\n * than adding a member here.\n */\nexport type NodeExecutionStatus =\n | \"pending\"\n | \"running\"\n | \"completed\"\n | \"failed\"\n | \"skipped\"\n\n/**\n * Why a node was skipped at run time, when the run itself decided it (never\n * for a node the person froze with Skip, which is a saved-data seed):\n * - `empty_input` — a text-requiring node whose wired text came from a node\n * that, in this run, produced nothing (a feed that found no new posts). A\n * completed run with one such skip reads as \"nothing new\"\n * (execution-outcome.ts).\n * A router-gated node carries no reason, as before.\n */\nexport type NodeSkipReason = \"empty_input\"\n\n/**\n * The statuses whose node state MAY carry `output`.\n *\n * `completed` is the obvious one. `failed` is here because a run can refuse\n * its result and still RETAIN what it produced — the 3D-scene authoring lanes\n * publish a real, renderable revision and then fail the job on the visual\n * reviewer's verdict (`SCENE_QUALITY_FAILED`), so the scene and the refusal are\n * both true at once. That output was billed; dropping it because the status is\n * not `\"completed\"` is what this set exists to stop.\n *\n * `pending` / `running` / `skipped` never carry one: nothing has settled, or\n * the node was gated out.\n */\nexport const OUTPUT_BEARING_NODE_STATUSES: ReadonlySet<NodeExecutionStatus> =\n new Set<NodeExecutionStatus>([\"completed\", \"failed\"])\n\n/** Whether a node in this status may carry `output`. */\nexport function nodeStateMayCarryOutput(status: string | undefined): boolean {\n return (\n status !== undefined &&\n OUTPUT_BEARING_NODE_STATUSES.has(status as NodeExecutionStatus)\n )\n}\n\n/**\n * One node's execution state, as it travels on the wire.\n *\n * Additive by construction — an older client ignores fields it does not know,\n * which is why `output` on a failed node is safe to start sending.\n *\n * `TOutput` lets a declaration that knows its own richer output shape (the\n * orchestrator's `NodeOutput`, the editor's) stay ASSIGNABLE to this contract\n * instead of restating it; the default is what an external client sees.\n */\nexport interface NodeExecutionStateWire<TOutput = Record<string, unknown>> {\n status: NodeExecutionStatus | (string & {})\n nodeType?: string\n jobId?: string | null\n /** Every job id of a fan-out node (one per list / loop iteration). */\n jobIds?: string[]\n creditsUsed?: number\n error?: string | null\n /** Stable code for a refusal a client may branch on — never on the text. */\n errorCode?: string\n /**\n * The provider's own words for a `failed` node's failure (the job's\n * `error_detail`), with links cut to their host and secrets removed; absent\n * when the failure had no provider text (a platform refusal, a timeout).\n * Display-only, beside `error`: branch on `errorCode` or the hint, never on\n * these words. Only a reader who can open the workflow the run executed\n * receives it — never a published app's runner, nor a person running\n * someone else's share link — and on a deployment that keeps these words for\n * its administrators, no reader who is not one.\n */\n errorDetail?: string | null\n /**\n * What the node produced.\n *\n * Present for a `completed` node, and for a `failed` node whose run RETAINED\n * a structured result (see {@link OUTPUT_BEARING_NODE_STATUSES}). A consumer\n * that reads it must therefore gate on the FIELD, not on the status, and\n * must not treat its presence as success.\n */\n output?: TOutput\n startedAt?: string | null\n completedAt?: string | null\n /** The node's job is parked in `pending_review`; `status` stays \"running\". */\n awaitingReview?: boolean\n /**\n * The node's job is waiting for a free concurrency slot (the job's status is\n * `queued`; `status` here stays \"pending\"). Present only while it waits, and\n * only on the node state of a single-node job as the execution reads list\n * it. Concurrency limits are not enforced in this release, so nothing waits\n * for a slot yet and the key does not appear yet.\n */\n queued?: true\n /**\n * With `queued`: whole seconds the job has waited, counted from when it\n * first started waiting. Absent when that time cannot be read.\n */\n waitedSeconds?: number\n progress?: number\n /** Present on a `skipped` node the RUN skipped (see {@link NodeSkipReason}); absent on a router-gated one. */\n skipReason?: NodeSkipReason | (string & {})\n}\n","import type { NodeSkipReason } from \"./node-execution-state.js\"\n\n/**\n * How a COMPLETED run ended, derived on read from its node states — never a\n * column: the orchestrator, the boot sweep and the reconcile cron all write\n * `completed`, and a column only one of them set would read \"succeeded\" for\n * the runs the others closed. Every surface that shows a run (the editor's\n * run bar and Executions tab, a published app, Present, the REST / SDK\n * execution shapes, MCP `get_app_run` / `diagnose_run`) asks this one rule.\n */\nexport type ExecutionOutcome = \"succeeded\" | \"nothing_new\"\n\ninterface SkipStateLike {\n readonly status?: unknown\n readonly skipReason?: unknown\n}\n\nconst EMPTY_INPUT: NodeSkipReason = \"empty_input\"\n\n/** The nodes a run skipped for want of input: nothing upstream produced any text in this run. */\nexport function countEmptyInputSkips(nodeStates: Readonly<Record<string, SkipStateLike>> | null | undefined): number {\n let count = 0\n for (const state of Object.values(nodeStates ?? {})) {\n if (state && state.status === \"skipped\" && state.skipReason === EMPTY_INPUT) count += 1\n }\n return count\n}\n\n/**\n * `nothing_new` when a completed run skipped at least one node for want of\n * input (a feed that found no new posts, a writer with nothing to write);\n * `succeeded` for any other completed run; undefined for a run that has not\n * completed — a failed or cancelled run has no outcome, it has a status.\n */\nexport function executionOutcome(\n status: unknown,\n nodeStates: Readonly<Record<string, SkipStateLike>> | null | undefined,\n): ExecutionOutcome | undefined {\n if (status !== \"completed\") return undefined\n return countEmptyInputSkips(nodeStates) > 0 ? \"nothing_new\" : \"succeeded\"\n}\n"]}
1
+ {"version":3,"sources":["../src/clone-utils.ts","../src/group-aggregation.ts","../src/progress-curve.ts","../src/route-filter.ts","../src/variant-job-id.ts","../src/json-evaluator.ts","../src/repeat-types.ts","../src/fan-out-rows.ts","../src/settled-with-limit.ts","../src/loop-delimiter.ts","../src/generate-text-items.ts","../src/text-separators.ts","../src/list-sort.ts","../src/trigger-node-types.ts","../src/schedule-rules.ts","../src/schedule-retry.ts","../src/condition-variables.ts","../src/generated-results.ts","../src/inject-upstream.ts","../src/resolve-field-mappings.ts","../src/list-source-resolver.ts","../src/wired-image-size.ts","../src/list-merge.ts","../src/workflow-export.ts","../src/sub-workflow-validation.ts","../src/reduce-strategy-registry.ts","../src/private-host.ts","../src/node-execution-state.ts","../src/execution-outcome.ts"],"names":["newRows","start","int","clamp"],"mappings":";;;;;;AAQO,IAAM,kBAAA,GAAqB;AAG3B,SAAS,gBAAgB,IAAA,EAA4B;AAC1D,EAAA,OAAO,CAAC,CAAE,IAAA,CAAK,IAAA,CAAiC,mBAAmB,kBAAA,CAAmB,IAAA,CAAK,KAAK,EAAE,CAAA;AACpG;AAOO,SAAS,gBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EAC4B;AAC5B,EAAA,MAAM,SAAA,GAAY,SAAS,iBAAA,IAAqB,KAAA;AAEhD,EAAA,MAAM,WAAW,IAAI,GAAA;AAAA,IACnB,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,eAAA,CAAgB,CAAC,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,EAAE;AAAA,GACzD;AAEA,EAAA,MAAM,aAAA,GAAgB,KAAA,CACnB,MAAA,CAAO,CAAC,CAAA,KAAM;AACb,IAAA,IAAI,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,EAAE,GAAG,OAAO,KAAA;AAC/B,IAAA,IAAI,aAAa,CAAA,CAAE,EAAA,CAAG,UAAA,CAAW,QAAQ,GAAG,OAAO,KAAA;AACnD,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA,CACA,GAAA,CAAI,CAAC,CAAA,KAAO,CAAA,CAAE,MAAA,GAAS,EAAE,GAAG,CAAA,EAAG,MAAA,EAAQ,KAAA,KAAe,CAAE,CAAA;AAE3D,EAAA,MAAM,aAAA,GAAgB,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM;AACxC,IAAA,IAAI,aAAc,CAAA,CAAsB,EAAA,EAAI,UAAA,CAAW,QAAQ,GAAG,OAAO,KAAA;AACzE,IAAA,OAAO,CAAC,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,MAAM,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,KAAA,EAAO,aAAA,EAAe,KAAA,EAAO,aAAA,EAAc;AACtD;;;ACtCO,IAAM,mBAAA,GAAsB,CAAC,MAAA,EAAQ,OAAA,EAAS,SAAS,OAAO;AAe9D,SAAS,gBAAgB,OAAA,EAAuC;AACrE,EAAA,MAAM,OAAA,GAA8B,EAAE,IAAA,EAAM,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,EAAC,EAAE;AAChF,EAAA,KAAA,MAAW,CAAA,IAAK,SAAS,OAAA,CAAQ,CAAA,CAAE,IAAI,CAAA,CAAE,IAAA,CAAK,EAAE,KAAK,CAAA;AACrD,EAAA,OAAO,OAAA;AACT;AAEO,SAAS,aAAa,OAAA,EAAkD;AAC7E,EAAA,OAAO,mBAAA,CAAoB,OAAO,CAAC,CAAA,KAAM,QAAQ,CAAC,CAAA,CAAE,SAAS,CAAC,CAAA;AAChE;AAGO,SAAS,oBAAoB,CAAA,EAAmD;AACrF,EAAA,OAAO,MAAM,MAAA,IAAU,CAAA,KAAM,OAAA,IAAW,CAAA,KAAM,WAAW,CAAA,KAAM,OAAA;AACjE;AAGO,IAAM,mBAAA,GAAsB;AAC5B,IAAM,iBAAA,GAAoB;AAE1B,SAAS,cAAc,CAAA,EAA8B;AAC1D,EAAA,OAAO,CAAA,EAAG,mBAAmB,CAAA,EAAG,CAAC,CAAA,CAAA;AACnC;AAEO,SAAS,iBAAiB,CAAA,EAA6D;AAC5F,EAAA,IAAI,CAAC,CAAA,IAAK,CAAC,EAAE,UAAA,CAAW,mBAAmB,GAAG,OAAO,MAAA;AACrD,EAAA,MAAM,SAAA,GAAY,CAAA,CAAE,KAAA,CAAM,mBAAA,CAAoB,MAAM,CAAA;AACpD,EAAA,OAAO,mBAAA,CAAoB,SAAS,CAAA,GAAI,SAAA,GAAY,MAAA;AACtD;AAOO,SAAS,sBACd,KAAA,EACuB;AACvB,EAAA,MAAM,gBAAA,uBAAuB,GAAA,EAAsB;AACnD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAC,EAAE,QAAA,EAAU;AACjB,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,GAAA,CAAI,CAAA,CAAE,QAAQ,CAAA;AAC5C,IAAA,IAAI,IAAA,EAAM,IAAA,CAAK,IAAA,CAAK,CAAA,CAAE,EAAE,CAAA;AAAA,0BACF,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAAE,EAAE,CAAC,CAAA;AAAA,EAC9C;AACA,EAAA,OAAO,gBAAA;AACT;AAKO,SAAS,gBAAgB,CAAA,EAA8C;AAC5E,EAAA,OAAA,CAAQ,CAAA,CAAE,gBAAgB,iBAAA,MAAuB,iBAAA;AACnD;AAkBO,SAAS,qBAAA,CACd,MAAA,EACA,UAAA,EACA,OAAA,EACA,KAAA,EACqB;AACrB,EAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAuB,UAAU,CAAA;AACrD,EAAA,KAAA,MAAW,KAAK,YAAA,CAAa,OAAO,CAAA,EAAG,OAAA,CAAQ,IAAI,CAAC,CAAA;AACpD,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,CAAA,CAAE,WAAW,MAAA,EAAQ;AACzB,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,CAAA,CAAE,YAAY,CAAA;AAC5C,IAAA,IAAI,IAAA,EAAM,OAAA,CAAQ,GAAA,CAAI,IAAI,CAAA;AAAA,EAC5B;AACA,EAAA,OAAO,oBAAoB,MAAA,CAAO,CAAC,MAAM,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAC,CAAA;AACzD;;;ACnGO,SAAS,iBAAA,CACd,SAAA,EACA,WAAA,EACA,QAAA,GAAmB,CAAA,EACX;AACR,EAAA,IAAI,WAAA,IAAe,GAAG,OAAO,CAAA;AAC7B,EAAA,MAAM,CAAA,GAAI,KAAK,GAAA,CAAI,IAAA,CAAK,IAAI,SAAA,GAAY,WAAA,EAAa,CAAC,CAAA,EAAG,CAAC,CAAA;AAC1D,EAAA,OAAO,IAAA,CAAK,MAAM,EAAA,IAAM,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,GAAI,CAAA,EAAG,QAAQ,CAAA,CAAE,CAAA;AACxD;AAGO,IAAM,0BAAA,GAAqD;AAAA,EAChE,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,IAAA;AAAA,EACP,WAAA,EAAa,IAAA;AAAA,EACb,KAAA,EAAO,GAAA;AAAA,EACP,GAAA,EAAK,GAAA;AAAA,EACL,OAAA,EAAS,GAAA;AAAA,EACT,MAAA,EAAQ;AACV;AAeO,SAAS,sBACd,aAAA,EACmB;AACnB,EAAA,MAAM,OAAA,GAAU,cAAc,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,WAAA,EAAa,CAAC,CAAA;AACvE,EAAA,IAAI,OAAA,IAAW,CAAA,EAAG,OAAO,EAAC;AAE1B,EAAA,MAAM,WAA8B,EAAC;AACrC,EAAA,IAAI,MAAA,GAAS,CAAA;AAEb,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,aAAA,CAAc,QAAQ,CAAA,EAAA,EAAK;AAC7C,IAAA,MAAM,EAAE,MAAA,EAAQ,WAAA,EAAY,GAAI,cAAc,CAAC,CAAA;AAC/C,IAAA,MAAM,UAAA,GAAc,cAAc,OAAA,GAAW,EAAA;AAC7C,IAAA,MAAM,MAAA,GAAS,CAAA,KAAM,aAAA,CAAc,MAAA,GAAS,CAAA;AAC5C,IAAA,QAAA,CAAS,IAAA,CAAK;AAAA,MACZ,MAAA;AAAA,MACA,QAAA,EAAU,MAAA;AAAA;AAAA,MAEV,MAAA,EAAQ,MAAA,GAAS,EAAA,GAAK,MAAA,GAAS,UAAA;AAAA,MAC/B;AAAA,KACD,CAAA;AACD,IAAA,MAAA,IAAU,UAAA;AAAA,EACZ;AAEA,EAAA,OAAO,QAAA;AACT;AAKO,SAAS,0BACd,QAAA,EACA,YAAA,EAIA,GAAA,GAAc,IAAA,CAAK,KAAI,EACf;AACR,EAAA,IAAI,QAAA,GAAW,CAAA;AAEf,EAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA;AACrC,IAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,IAAA,MAAM,UAAA,GAAa,GAAA,CAAI,MAAA,GAAS,GAAA,CAAI,QAAA;AAEpC,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,WAAA,IAAe,KAAA,CAAM,WAAW,SAAA,EAAW;AAC9D,MAAA,QAAA,IAAY,UAAA;AAAA,IACd,CAAA,MAAA,IAAW,KAAA,CAAM,MAAA,KAAW,SAAA,IAAa,MAAM,SAAA,EAAW;AACxD,MAAA,MAAM,UAAU,GAAA,GAAM,IAAI,KAAK,KAAA,CAAM,SAAS,EAAE,OAAA,EAAQ;AACxD,MAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,OAAA,EAAS,GAAA,CAAI,WAAW,CAAA;AAE/D,MAAA,QAAA,IAAa,eAAe,EAAA,GAAM,UAAA;AAAA,IACpC;AAAA,EAEF;AAEA,EAAA,OAAO,KAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,EAAE,CAAC,CAAA;AAC1C;;;AC9EA,SAAS,GAAA,CACP,OAAA,EACA,KAAA,EACA,SAAA,EACa;AACb,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,KAAA,GAAQ,CAAC,OAAO,CAAA;AAEtB,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACvB,IAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AAC1B,IAAA,OAAA,CAAQ,IAAI,OAAO,CAAA;AAEnB,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,MAAA,IAAI,SAAA,KAAc,SAAA,IAAa,IAAA,CAAK,MAAA,KAAW,OAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AACnF,QAAA,KAAA,CAAM,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,SAAA,KAAc,UAAA,IAAc,IAAA,CAAK,MAAA,KAAW,OAAA,IAAW,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,MAAM,CAAA,EAAG;AAC3F,QAAA,KAAA,CAAM,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,OAAA;AACT;AASO,SAAS,wBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EACa;AACb,EAAA,MAAM,YAAY,KAAA,CAAM,IAAA;AAAA,IACtB,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,oBAAA,IAAyB,CAAA,CAAE,KAAiC,OAAA,KAAY;AAAA,GAC5F;AACA,EAAA,MAAM,aAAa,KAAA,CAAM,IAAA;AAAA,IACvB,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,qBAAA,IAA0B,CAAA,CAAE,KAAiC,OAAA,KAAY;AAAA,GAC7F;AAEA,EAAA,IAAI,CAAC,SAAA,IAAa,CAAC,UAAA,EAAY,2BAAW,GAAA,EAAI;AAE9C,EAAA,MAAM,gBAAA,GAAmB,GAAA,CAAI,SAAA,CAAU,EAAA,EAAI,OAAO,SAAS,CAAA;AAC3D,EAAA,MAAM,iBAAA,GAAoB,GAAA,CAAI,UAAA,CAAW,EAAA,EAAI,OAAO,UAAU,CAAA;AAE9D,EAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,EAAA,KAAA,MAAW,MAAM,gBAAA,EAAkB;AACjC,IAAA,IAAI,kBAAkB,GAAA,CAAI,EAAE,CAAA,EAAG,SAAA,CAAU,IAAI,EAAE,CAAA;AAAA,EACjD;AAGA,EAAA,SAAA,CAAU,GAAA,CAAI,UAAU,EAAE,CAAA;AAC1B,EAAA,SAAA,CAAU,GAAA,CAAI,WAAW,EAAE,CAAA;AAE3B,EAAA,OAAO,SAAA;AACT;;;ACjEO,SAAS,YAAA,CAAa,WAAmB,KAAA,EAAuB;AACrE,EAAA,OAAO,UAAU,CAAA,GAAI,SAAA,GAAY,CAAA,EAAG,SAAS,KAAK,KAAK,CAAA,CAAA;AACzD;;;ACQA,IAAM,UAAA,GAAa,4BAAA;AAEnB,SAAS,aAAa,CAAA,EAAmB;AACvC,EAAA,OAAO,EAAE,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAA,CAAE,OAAA,CAAQ,MAAM,KAAK,CAAA;AACrD;AAEA,SAAS,SAAS,KAAA,EAAuB;AACvC,EAAA,OAAO,UAAA,CAAW,IAAA,CAAK,KAAK,CAAA,GAAI,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,GAAK,CAAA,GAAA,EAAM,YAAA,CAAa,KAAK,CAAC,CAAA,EAAA,CAAA;AACzE;AAEA,SAAS,YAAY,CAAA,EAAmB;AACtC,EAAA,MAAM,OAAA,GAAU,EAAE,IAAA,EAAK;AACvB,EAAA,IAAI,OAAA,KAAY,EAAA,IAAM,OAAA,KAAY,UAAA,IAAc,OAAA,KAAY,eAAe,OAAA,KAAY,KAAA,EAAO,OAAO,CAAA,CAAA,EAAI,OAAO,CAAA,CAAA,CAAA;AAChH,EAAA,MAAM,CAAA,GAAI,OAAO,OAAO,CAAA;AACxB,EAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA,GAAI,CAAA,CAAA,EAAI,YAAA,CAAa,OAAO,CAAC,CAAA,CAAA,CAAA;AACnE;AAEA,SAAS,gBAAgB,CAAA,EAAuB;AAC9C,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA;AAC5B,EAAA,QAAQ,EAAE,QAAA;AAAU,IAClB,KAAK,QAAA;AAAU,MAAA,OAAO,UAAU,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAA,CAAE,KAAe,CAAC,CAAA,CAAA,CAAA;AAAA,IACxE,KAAK,YAAA;AAAc,MAAA,OAAO,UAAU,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAA,CAAE,KAAe,CAAC,CAAA,CAAA,CAAA;AAAA,IAC5E,KAAK,UAAA;AAAY,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACpF,KAAK,cAAA;AAAgB,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,SAAA,CAAA;AAAA,IACxF,KAAK,aAAA;AAAe,MAAA,OAAO,UAAU,GAAG,CAAA,eAAA,EAAkB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACzF,KAAK,WAAA;AAAa,MAAA,OAAO,UAAU,GAAG,CAAA,aAAA,EAAgB,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACrF,KAAK,cAAA,EAAgB;AACnB,MAAA,MAAM,CAAA,GAAI,MAAA,CAAQ,CAAA,CAAE,KAAA,CAAiB,MAAM,CAAA;AAC3C,MAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,OAAO,UAAU,GAAG,CAAA,KAAA,CAAA;AAC7C,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,WAAA,EAAa;AAChB,MAAA,MAAM,CAAA,GAAI,MAAA,CAAQ,CAAA,CAAE,KAAA,CAAiB,MAAM,CAAA;AAC3C,MAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,OAAO,UAAU,GAAG,CAAA,KAAA,CAAA;AAC7C,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,GAAA,EAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IAC7B;AAAA,IACA,KAAK,UAAA;AAAY,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,YAAA,EAAe,GAAG,CAAA,OAAA,CAAA;AAAA,IACvD,KAAK,cAAA;AAAgB,MAAA,OAAO,CAAA,OAAA,EAAU,GAAG,CAAA,aAAA,EAAgB,GAAG,CAAA,OAAA,CAAA;AAAA,IAC5D,KAAK,eAAA;AAAiB,MAAA,OAAO,UAAU,GAAG,CAAA,SAAA,EAAY,YAAA,CAAa,CAAA,CAAE,KAAe,CAAC,CAAA,GAAA,CAAA;AAAA,IACrF,KAAK,SAAA,EAAW;AAId,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,IAC7B,CAAA,CAAE,KAAA,GACF,MAAA,CAAO,CAAA,CAAE,KAAA,IAAS,EAAE,EAAE,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA;AACxE,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA,aAAA,CAAA;AAC7B,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,GAAG,CAAA,IAAA,EAAO,WAAA,CAAY,CAAC,CAAC,CAAA,CAAE,CAAA;AAC1D,MAAA,OAAO,CAAA,OAAA,EAAU,KAAA,CAAM,IAAA,CAAK,MAAM,CAAC,CAAA,CAAA,CAAA;AAAA,IACrC;AAAA,IACA;AAAS,MAAA,OAAO,CAAA,YAAA,CAAA;AAAA;AAEpB;AAIO,SAAS,0BAA0B,MAAA,EAI/B;AACT,EAAA,MAAM,EAAE,WAAW,OAAA,GAAU,IAAI,WAAA,GAAc,IAAG,GAAI,MAAA;AACtD,EAAA,MAAM,UAAA,GAAa,QAAQ,MAAA,GAAS,CAAA;AACpC,EAAA,MAAM,cAAA,GAAiB,YAAY,MAAA,GAAS,CAAA;AAC5C,EAAA,MAAM,UAAU,CAAC,CAAC,aAAa,SAAA,CAAU,IAAA,GAAO,MAAA,GAAS,CAAA;AAGzD,EAAA,IAAI,IAAA,GAAO,OAAA,GAAU,CAAA,CAAA,EAAI,SAAS,CAAA,CAAA,GAAK,GAAA;AAGvC,EAAA,IAAI,cAAc,cAAA,EAAgB;AAChC,IAAA,IAAA,IAAQ,IAAA;AAAA,EACV;AAGA,EAAA,IAAI,CAAC,OAAA,IAAW,CAAC,UAAA,IAAc,CAAC,gBAAgB,OAAO,GAAA;AAEvD,EAAA,MAAM,KAAA,GAAkB,CAAC,IAAI,CAAA;AAG7B,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,KAAA,CAAM,IAAA,CAAK,eAAA,CAAgB,CAAC,CAAC,CAAA;AAAA,EAC/B;AAGA,EAAA,IAAI,cAAA,EAAgB;AAClB,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,GAAA,CAAI,CAAC,CAAA,KAAM;AACpC,MAAA,IAAI,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,EAAG,OAAO,CAAA;AAC/B,MAAA,OAAO,CAAA,CAAA,EAAI,CAAC,CAAA,MAAA,EAAS,CAAC,CAAA,EAAA,CAAA;AAAA,IACxB,CAAC,CAAA;AACD,IAAA,KAAA,CAAM,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,EACrC;AAEA,EAAA,OAAO,KAAA,CAAM,KAAK,KAAK,CAAA;AACzB;AAiBA,SAAS,SAAS,IAAA,EAAuB;AACvC,EAAA,MAAM,SAAkB,EAAC;AACzB,EAAA,IAAI,CAAA,GAAI,CAAA;AAER,EAAA,OAAO,CAAA,GAAI,KAAK,MAAA,EAAQ;AAEtB,IAAA,IAAI,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAC,CAAA,EAAG;AAAE,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAExC,IAAA,MAAM,EAAA,GAAK,KAAK,CAAC,CAAA;AAGjB,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC1E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC3E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC7E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAC5E,IAAA,IAAI,OAAO,GAAA,EAAK;AAAE,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAAS;AAG5E,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AAEzB,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,0BAA0B,CAAA;AACnD,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,MAAM,YAAY,KAAA,CAAM,CAAC,EAAE,OAAA,CAAQ,MAAA,EAAQ,GAAG,CAAA,CAAE,OAAA,CAAQ,OAAA,EAAS,IAAI,EAAE,OAAA,CAAQ,MAAA,EAAQ,IAAI,CAAA,CAAE,OAAA,CAAQ,QAAQ,GAAI,CAAA;AACjH,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,aAAA,EAAe,KAAA,EAAO,WAAW,CAAA;AACrD,QAAA,CAAA,IAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACxB;AAEA,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,CAAM,OAAO,CAAA;AAClC,MAAA,IAAI,OAAA,EAAS;AACX,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,YAAA,EAAc,KAAA,EAAO,MAAM,CAAA;AAC/C,QAAA,CAAA,IAAK,CAAA;AAAG,QAAA;AAAA,MACV;AAEA,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,cAAc,CAAA;AACvC,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,cAAc,CAAA;AACrC,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA;AAC1D,QAAA,CAAA,IAAK,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACtB;AAEA,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,UAAA,EAAY,KAAA,EAAO,KAAK,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IACtD;AAGA,IAAA,IAAI,CAAA,GAAI,CAAA,GAAI,IAAA,CAAK,MAAA,EAAQ;AACvB,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,IAAI,CAAC,CAAA;AAC/B,MAAA,IAAI,QAAQ,IAAA,IAAQ,GAAA,KAAQ,QAAQ,GAAA,KAAQ,IAAA,IAAQ,QAAQ,IAAA,EAAM;AAChE,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA;AAAG,QAAA,CAAA,IAAK,CAAA;AAAG,QAAA;AAAA,MACnD;AAAA,IACF;AACA,IAAA,IAAI,EAAA,KAAO,GAAA,IAAO,EAAA,KAAO,GAAA,EAAK;AAC5B,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,IAAA,EAAM,KAAA,EAAO,IAAI,CAAA;AAAG,MAAA,CAAA,EAAA;AAAK,MAAA;AAAA,IAC/C;AAGA,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,IAAI,CAAA,GAAI,EAAA;AACR,MAAA,CAAA,EAAA;AACA,MAAA,OAAO,IAAI,IAAA,CAAK,MAAA,IAAU,IAAA,CAAK,CAAC,MAAM,GAAA,EAAK;AACzC,QAAA,IAAI,IAAA,CAAK,CAAC,CAAA,KAAM,IAAA,EAAM;AACpB,UAAA,CAAA,EAAA;AACA,UAAA,MAAM,GAAA,GAAM,KAAK,CAAC,CAAA;AAClB,UAAA,IAAI,GAAA,KAAQ,KAAK,CAAA,IAAK,GAAA;AAAA,eAAA,IACb,GAAA,KAAQ,MAAM,CAAA,IAAK,IAAA;AAAA,eAAA,IACnB,GAAA,KAAQ,KAAK,CAAA,IAAK,IAAA;AAAA,eAAA,IAClB,GAAA,KAAQ,KAAK,CAAA,IAAK,GAAA;AAAA,eACtB,CAAA,IAAK,GAAA;AAAA,QACZ,CAAA,MAAO;AACL,UAAA,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,QACb;AACA,QAAA,CAAA,EAAA;AAAA,MACF;AACA,MAAA,IAAI,KAAK,CAAC,CAAA,KAAM,KAAK,MAAM,IAAI,MAAM,6BAA6B,CAAA;AAClE,MAAA,CAAA,EAAA;AACA,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,GAAG,CAAA;AAAG,MAAA;AAAA,IAC7C;AAGA,IAAA,IAAI,OAAA,CAAQ,IAAA,CAAK,EAAE,CAAA,IAAM,EAAA,KAAO,GAAA,IAAO,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,IAAK,EAAE,CAAA,EAAI;AACvE,MAAA,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAM,yCAAyC,CAAA;AACvE,MAAA,IAAI,CAAA,EAAG;AACL,QAAA,MAAM,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,CAAC,CAAC,CAAA;AACrB,QAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,gBAAA,EAAmB,CAAA,CAAE,CAAC,CAAC,CAAA,CAAE,CAAA;AAClE,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,QAAA,EAAU,KAAA,EAAO,GAAG,CAAA;AACxC,QAAA,CAAA,IAAK,CAAA,CAAE,CAAC,CAAA,CAAE,MAAA;AAAQ,QAAA;AAAA,MACpB;AAAA,IACF;AAGA,IAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,MAAM,2BAA2B,CAAA;AAC3D,IAAA,IAAI,GAAA,EAAK;AACP,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,OAAA,EAAS,OAAO,GAAA,CAAI,CAAC,GAAG,CAAA;AAC5C,MAAA,CAAA,IAAK,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA;AAAQ,MAAA;AAAA,IACtB;AAEA,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,EAAE,CAAA,cAAA,EAAiB,CAAC,CAAA,CAAE,CAAA;AAAA,EACjE;AAEA,EAAA,OAAO,MAAA;AACT;AAsBA,IAAM,SAAN,MAAa;AAAA,EAEX,YAAoB,MAAA,EAAiB;AAAjB,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAAkB;AAAA,EAAlB,MAAA;AAAA,EADZ,GAAA,GAAM,CAAA;AAAA,EAGN,IAAA,GAA0B;AAAE,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AAAA,EAAE;AAAA,EACzD,GAAA,GAAa;AACnB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,GAAA,EAAK,CAAA;AAChC,IAAA,IAAI,CAAC,CAAA,EAAG,MAAM,IAAI,MAAM,8BAA8B,CAAA;AACtD,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EACQ,OAAO,IAAA,EAAsB;AACnC,IAAA,MAAM,CAAA,GAAI,KAAK,GAAA,EAAI;AACnB,IAAA,IAAI,CAAA,CAAE,IAAA,KAAS,IAAA,EAAM,MAAM,IAAI,KAAA,CAAM,CAAA,SAAA,EAAY,IAAI,CAAA,MAAA,EAAS,CAAA,CAAE,IAAI,CAAA,GAAA,EAAM,CAAA,CAAE,KAAK,CAAA,EAAA,CAAI,CAAA;AACrF,IAAA,OAAO,CAAA;AAAA,EACT;AAAA,EACQ,GAAG,IAAA,EAAwB;AAAE,IAAA,OAAO,IAAA,CAAK,IAAA,EAAK,EAAG,IAAA,KAAS,IAAA;AAAA,EAAK;AAAA,EAC/D,QAAQ,CAAA,EAAoB;AAAE,IAAA,OAAO,IAAA,CAAK,MAAK,EAAG,IAAA,KAAS,WAAW,IAAA,CAAK,IAAA,IAAQ,KAAA,KAAU,CAAA;AAAA,EAAE;AAAA,EAC/F,IAAA,GAAgB;AAAE,IAAA,OAAO,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA,CAAO,MAAA;AAAA,EAAO;AAAA,EAEhE,KAAA,GAAiB;AACf,IAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAK,QAAS,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,IAAA,CAAK,MAAK,CAAG,KAAK,CAAA,cAAA,EAAiB,IAAA,CAAK,GAAG,CAAA,CAAE,CAAA;AACpG,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,SAAA,GAAqB;AAC3B,IAAA,IAAI,IAAA,GAAO,KAAK,aAAA,EAAc;AAC9B,IAAA,OAAO,IAAA,CAAK,EAAA,CAAG,MAAM,CAAA,EAAG;AACtB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,MAAM,KAAA,GAAQ,KAAK,aAAA,EAAc;AACjC,MAAA,IAAA,GAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAM,KAAA,EAAM;AAAA,IAClC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,aAAA,GAAyB;AAC/B,IAAA,IAAI,IAAA,GAAO,KAAK,YAAA,EAAa;AAC7B,IAAA,OAAO,KAAK,OAAA,CAAQ,KAAK,KAAK,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AAChD,MAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA;AACtB,MAAA,MAAM,KAAA,GAAQ,KAAK,YAAA,EAAa;AAChC,MAAA,IAAA,GAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,EAAA,EAAI,MAAM,KAAA,EAAM;AAAA,IACtC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEQ,YAAA,GAAwB;AAC9B,IAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA,EAAG;AACjB,MAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA;AACtB,MAAA,MAAM,KAAA,GAAQ,KAAK,SAAA,EAAU;AAC7B,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,EAAA,EAAI,MAAM,KAAA,EAAM;AAAA,IACzC;AACA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,SAAA,GAAqB;AAE3B,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,QAAQ,CAAA,EAAG;AAC1B,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AAEpB,MAAA,MAAM,IAAA,GAAO,KAAK,SAAA,EAAU;AAC5B,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,MAAA,OAAO,EAAE,CAAA,EAAG,QAAA,EAAU,IAAA,EAAK;AAAA,IAC7B;AAEA,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,OAAO,EAAE,GAAG,KAAA,EAAM;AAAA,IACpB;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,KAAK,eAAA,EAAgB;AAAA,IAC9B;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,EAAK,CAAG,KAAA;AAC1B,MAAA,IAAI,CAAC,YAAY,YAAA,EAAc,UAAA,EAAY,MAAM,CAAA,CAAE,QAAA,CAAS,IAAI,CAAA,EAAG;AAEjE,QAAA,IAAI,KAAK,MAAA,CAAO,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AAChD,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,MAAM,MAAA,GAAS,KAAK,GAAA,EAAI;AACxB,UAAA,IAAI,MAAA,CAAO,SAAS,QAAA,EAAU,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,IAAI,CAAA,4BAAA,CAA8B,CAAA;AACnF,UAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,UAAA,OAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,OAAO,KAAA,EAAgB;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,MAAM,KAAA,GAAQ,KAAK,aAAA,EAAc;AACjC,MAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,MAAA,OAAO,KAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,OAAO,IAAA,CAAK,GAAA,GAAM,KAAA,EAAgB;AAAA,IAC3D;AACA,IAAA,IAAI,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AACrB,MAAA,OAAO,EAAE,CAAA,EAAG,SAAA,EAAW,OAAO,IAAA,CAAK,GAAA,GAAM,KAAA,EAAgB;AAAA,IAC3D;AACA,IAAA,OAAO,KAAK,SAAA,EAAU;AAAA,EACxB;AAAA,EAEQ,SAAA,GAAqB;AAC3B,IAAA,IAAI,CAAC,IAAA,CAAK,EAAA,CAAG,KAAK,GAAG,MAAM,IAAI,KAAA,CAAM,CAAA,sCAAA,EAAyC,IAAA,CAAK,IAAA,EAAK,EAAG,KAAA,IAAS,KAAK,CAAA,CAAA,CAAG,CAAA;AAC5G,IAAA,IAAA,CAAK,GAAA,EAAI;AAGT,IAAA,MAAM,QAAmB,EAAC;AAG1B,IAAA,IAAI,IAAA,CAAK,GAAG,OAAO,CAAA,IAAK,CAAC,CAAC,QAAA,EAAS,KAAA,EAAM,UAAA,EAAW,YAAA,EAAa,UAAA,EAAW,QAAO,KAAA,EAAM,IAAA,EAAK,MAAA,EAAO,MAAA,EAAO,OAAO,CAAA,CAAE,SAAS,IAAA,CAAK,IAAA,EAAK,CAAG,KAAe,CAAA,EAAG;AAC3J,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC5D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,MAAA,IAAA,CAAK,GAAA,EAAI;AACT,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,IAC7B,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,IAC9D,CAAA,MAAO;AAEL,MAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,UAAA,EAAW;AAAA,IACjD;AAGA,IAAA,OAAO,IAAA,EAAM;AACX,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,KAAK,CAAA,EAAG;AAClB,QAAA,IAAA,CAAK,GAAA,EAAI;AACT,QAAA,IAAI,IAAA,CAAK,GAAG,OAAO,CAAA,IAAK,CAAC,CAAC,QAAA,EAAS,OAAM,UAAA,EAAW,YAAA,EAAa,YAAW,MAAA,EAAO,KAAA,EAAM,IAAI,CAAA,CAAE,QAAA,CAAS,KAAK,IAAA,EAAK,CAAG,KAAe,CAAA,EAAG;AACrI,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC5D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,UAAA,IAAA,CAAK,GAAA,EAAI;AAAG,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,QACzC,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,QAC9D,CAAA,MAAO;AAEL,UAAA;AAAA,QACF;AAAA,MACF,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,aAAa,CAAA,EAAG;AACjC,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,KAAK,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,MAC9D,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,YAAY,CAAA,EAAG;AAChC,QAAA,IAAA,CAAK,GAAA,EAAI;AAAG,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,SAAA,EAAW,CAAA;AAAA,MACzC,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AAC3B,QAAA,KAAA,CAAM,IAAA,CAAK,EAAE,CAAA,EAAG,OAAA,EAAS,OAAO,IAAA,CAAK,GAAA,EAAI,CAAE,KAAA,EAAiB,CAAA;AAAA,MAC9D,CAAA,MAAO;AACL,QAAA;AAAA,MACF;AAAA,IACF;AAEA,IAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,GAAG,UAAA,EAAW;AAC/C,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,MAAM,CAAC,CAAA;AACtC,IAAA,OAAO,EAAE,CAAA,EAAG,MAAA,EAAQ,KAAA,EAAM;AAAA,EAC5B;AAAA,EAEQ,eAAA,GAA2B;AACjC,IAAA,IAAA,CAAK,GAAA,EAAI;AACT,IAAA,MAAM,SAA4D,EAAC;AAEnE,IAAA,OAAO,CAAC,KAAK,EAAA,CAAG,QAAQ,KAAK,CAAC,IAAA,CAAK,MAAK,EAAG;AACzC,MAAA,IAAI,GAAA;AACJ,MAAA,IAAI,SAAA,GAA4B,IAAA;AAEhC,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,QAAA,GAAA,GAAM,IAAA,CAAK,KAAI,CAAE,KAAA;AACjB,QAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,EAAG;AACpB,UAAA,IAAA,CAAK,GAAA,EAAI;AACT,UAAA,SAAA,GAAY,KAAK,SAAA,EAAU;AAAA,QAC7B;AAAA,MAEF,CAAA,MAAA,IAAW,IAAA,CAAK,EAAA,CAAG,QAAQ,CAAA,EAAG;AAC5B,QAAA,GAAA,GAAM,IAAA,CAAK,KAAI,CAAE,KAAA;AACjB,QAAA,IAAA,CAAK,OAAO,OAAO,CAAA;AACnB,QAAA,SAAA,GAAY,KAAK,SAAA,EAAU;AAAA,MAC7B,CAAA,MAAO;AACL,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,gDAAA,EAAmD,KAAK,IAAA,EAAK,EAAG,KAAK,CAAA,CAAA,CAAG,CAAA;AAAA,MAC1F;AAEA,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,GAAA,EAAK,SAAA,EAAW,CAAA;AAC9B,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,OAAO,CAAA,OAAQ,GAAA,EAAI;AAAA,IACjC;AAEA,IAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AACpB,IAAA,OAAO,EAAE,CAAA,EAAG,QAAA,EAAU,MAAA,EAAO;AAAA,EAC/B;AACF,CAAA;AAKA,IAAM,OAAA,0BAAiB,SAAS,CAAA;AAIhC,SAAS,SAAS,CAAA,EAAqB;AACrC,EAAA,IAAI,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,SAAS,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,EAAA,EAAI,OAAO,KAAA;AAChF,EAAA,OAAO,IAAA;AACT;AAUA,SAAS,QAAA,CAAS,IAAA,EAAe,KAAA,EAAgB,GAAA,EAAuC;AACtF,EAAA,QAAQ,KAAK,CAAA;AAAG,IACd,KAAK,UAAA;AACH,MAAA,OAAO,KAAA;AAAA,IAET,KAAK,KAAA,EAAO;AACV,MAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAClD,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,IAAA,CAAK,KAAK,CAAA,KAAA,EAAQ,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA,GAAU,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,MAC5G;AACA,MAAA,MAAM,GAAA,GAAM,KAAA;AACZ,MAAA,IAAI,EAAE,IAAA,CAAK,KAAA,IAAS,GAAA,CAAA,EAAM;AACxB,QAAA,MAAM,YAAY,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAC5C,QAAA,MAAM,IAAI,MAAM,CAAA,OAAA,EAAU,IAAA,CAAK,KAAK,CAAA,+BAAA,EAAkC,SAAA,IAAa,QAAQ,CAAA,CAAE,CAAA;AAAA,MAC/F;AACA,MAAA,OAAO,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,IACvB;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AAClD,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACrD,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,GAAI,OAAA,GAAU,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,MAC7F;AACA,MAAA,MAAM,GAAA,GAAM,KAAA;AACZ,MAAA,IAAI,EAAE,IAAA,CAAK,GAAA,IAAO,GAAA,CAAA,EAAM;AACtB,QAAA,MAAM,YAAY,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAC5C,QAAA,MAAM,IAAI,MAAM,CAAA,OAAA,EAAU,IAAA,CAAK,GAAG,CAAA,+BAAA,EAAkC,SAAA,IAAa,QAAQ,CAAA,CAAE,CAAA;AAAA,MAC7F;AACA,MAAA,OAAO,GAAA,CAAI,KAAK,GAAG,CAAA;AAAA,IACrB;AAAA,IAEA,KAAK,OAAA,EAAS;AACZ,MAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,8BAAA,EAAiC,IAAA,CAAK,KAAK,CAAA,CAAA,CAAG,CAAA;AACzF,MAAA,MAAM,GAAA,GAAM,KAAK,KAAA,GAAQ,CAAA,GAAI,MAAM,MAAA,GAAS,IAAA,CAAK,QAAQ,IAAA,CAAK,KAAA;AAC9D,MAAA,OAAO,OAAO,CAAA,IAAK,GAAA,GAAM,MAAM,MAAA,GAAS,KAAA,CAAM,GAAG,CAAA,GAAI,IAAA;AAAA,IACvD;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,EAAM;AAE/C,QAAA,MAAM,GAAA,GAAM,CAAC,KAAK,CAAA;AAClB,QAAA,GAAA,CAAI,mBAAA,CAAoB,IAAI,GAAG,CAAA;AAC/B,QAAA,OAAO,GAAA;AAAA,MACT;AACA,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,OAAO,KAAK,CAAA,CAAE,CAAA;AAAA,IACvD;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,GAAA,GAAe,KAAA;AACnB,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AAC1C,QAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACzB,QAAA,MAAM,GAAA,GAAM,QAAA,CAAS,IAAA,EAAM,GAAA,EAAK,GAAG,CAAA;AAEnC,QAAA,IAAI,KAAK,CAAA,KAAM,SAAA,IAAa,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AAC9C,UAAA,MAAM,aAAA,GAAgB,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAa,CAAA;AAE/D,UAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA;AACxC,UAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,GAAA;AACnC,UAAA,MAAM,SAAoB,EAAC;AAC3B,UAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,YAAA,MAAM,OAAA,GAAmB,SAAA,CAAU,MAAA,KAAW,CAAA,GAAI,SAAA,CAAU,CAAC,CAAA,GAAI,EAAE,CAAA,EAAG,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAU;AAC/F,YAAA,MAAM,MAAA,GAAS,QAAA,CAAS,OAAA,EAAS,IAAA,EAAM,GAAG,CAAA;AAC1C,YAAA,IAAI,MAAM,OAAA,CAAQ,MAAM,GAAG,MAAA,CAAO,IAAA,CAAK,GAAG,MAAM,CAAA;AAAA,iBAAA,IACvC,MAAA,KAAW,OAAA,EAAS,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA;AAAA,UACjD;AACA,UAAA,OAAO,YAAA,CAAa,MAAA,EAAQ,aAAA,EAAe,GAAG,CAAA;AAAA,QAChD;AACA,QAAA,GAAA,GAAM,GAAA;AAAA,MACR;AACA,MAAA,OAAO,GAAA;AAAA,IACT;AAAA,IAEA,KAAK,MAAA,EAAQ;AAEX,MAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AAG9C,MAAA,MAAM,cAAA,GAAiB,eAAA,CAAgB,IAAA,CAAK,IAAA,EAAM,SAAS,GAAG,CAAA;AAE9D,MAAA,IAAI,cAAA,IAAkB,KAAA,CAAM,OAAA,CAAQ,OAAO,CAAA,EAAG;AAC5C,QAAA,MAAM,gBAAA,GAAmB,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,OAAiB,CAAA;AACtE,QAAA,MAAM,UAAqB,EAAC;AAC5B,QAAA,KAAA,MAAW,QAAQ,OAAA,EAAS;AAC1B,UAAA,MAAM,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,MAAM,GAAG,CAAA;AACxC,UAAA,IAAI,MAAM,OAAA,EAAS;AACnB,UAAA,IAAI,KAAA,CAAM,QAAQ,CAAC,CAAA,IAAK,gBAAgB,IAAA,CAAK,KAAA,EAAO,CAAA,EAAG,GAAG,CAAA,EAAG;AAC3D,YAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA,UACnB,CAAA,MAAA,IAAW,MAAM,OAAA,EAAS;AACxB,YAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AAAA,UAChB;AAAA,QACF;AAEA,QAAA,OAAO,YAAA,CAAa,OAAA,EAAS,gBAAA,EAAkB,GAAG,CAAA;AAAA,MACpD;AAEA,MAAA,IAAI,OAAA,KAAY,SAAS,OAAO,OAAA;AAGhC,MAAA,OAAO,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,OAAA,EAAS,GAAG,CAAA;AAAA,IAC1C;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AAI9C,MAAA,IAAI,KAAA,CAAM,QAAQ,OAAO,CAAA,IAAK,IAAI,cAAA,CAAe,GAAA,CAAI,OAAO,CAAA,EAAG;AAC7D,QAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,OAAA,CAAQ,MAAA,GAAS,CAAC,CAAA;AACvC,QAAA,OAAO,QAAA,CAAS,IAAI,CAAA,GAAI,KAAA,GAAQ,OAAA;AAAA,MAClC;AACA,MAAA,OAAO,QAAA,CAAS,OAAkB,CAAA,GAAI,KAAA,GAAQ,OAAA;AAAA,IAChD;AAAA,IAEA,KAAK,KAAA,EAAO;AACV,MAAA,OAAO,CAAC,SAAS,KAAK,CAAA;AAAA,IACxB;AAAA,IAEA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,SAAkC,EAAC;AACzC,MAAA,KAAA,MAAW,EAAE,GAAA,EAAK,SAAA,EAAU,IAAK,KAAK,MAAA,EAAQ;AAC5C,QAAA,IAAI,QAAA;AACJ,QAAA,IAAI,cAAc,IAAA,EAAM;AAEtB,UAAA,QAAA,GAAW,QAAA,CAAS,EAAE,CAAA,EAAG,KAAA,EAAO,OAAO,GAAA,EAAI,EAAG,OAAO,GAAG,CAAA;AAAA,QAC1D,CAAA,MAAO;AACL,UAAA,QAAA,GAAW,QAAA,CAAS,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA;AAAA,QAC3C;AACA,QAAA,IAAI,QAAA,KAAa,SAAS,OAAO,OAAA;AACjC,QAAA,MAAA,CAAO,GAAG,CAAA,GAAI,QAAA;AAAA,MAChB;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,IAEA,KAAK,SAAA,EAAW;AACd,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AACzC,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,OAAO,GAAG,CAAA;AAC1C,MAAA,QAAQ,KAAK,EAAA;AAAI,QACf,KAAK,IAAA;AAAM,UAAA,OAAO,EAAA,KAAO,EAAA;AAAA,QACzB,KAAK,IAAA;AAAM,UAAA,OAAO,EAAA,KAAO,EAAA;AAAA,QACzB,KAAK,GAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,KAAK,EAAA,GAAK,KAAA;AAAA,QAC/E,KAAK,GAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,KAAK,EAAA,GAAK,KAAA;AAAA,QAC/E,KAAK,IAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA;AAAA,QAChF,KAAK,IAAA;AAAM,UAAA,OAAO,OAAO,EAAA,KAAO,QAAA,IAAY,OAAO,EAAA,KAAO,QAAA,GAAW,MAAM,EAAA,GAAK,KAAA;AAAA,QAChF;AAAW,UAAA,OAAO,KAAA;AAAA;AACpB,IACF;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,IAAA,CAAK,IAAA,EAAM,OAAO,GAAG,CAAA;AACzC,MAAA,IAAI,IAAA,CAAK,OAAO,KAAA,EAAO;AACrB,QAAA,IAAI,CAAC,QAAA,CAAS,EAAa,CAAA,EAAG,OAAO,KAAA;AACrC,QAAA,OAAO,SAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,GAAG,CAAY,CAAA;AAAA,MAC7D,CAAA,MAAO;AACL,QAAA,IAAI,QAAA,CAAS,EAAa,CAAA,EAAG,OAAO,IAAA;AACpC,QAAA,OAAO,SAAS,QAAA,CAAS,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,GAAG,CAAY,CAAA;AAAA,MAC7D;AAAA,IACF;AAAA,IAEA,KAAK,MAAA,EAAQ;AACX,MAAA,IAAI,OAAO,UAAU,QAAA,EAAU,MAAM,IAAI,KAAA,CAAM,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,0BAAA,CAA4B,CAAA;AACvF,MAAA,QAAQ,KAAK,IAAA;AAAM,QACjB,KAAK,UAAA;AAAc,UAAA,OAAO,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,QACjD,KAAK,YAAA;AAAc,UAAA,OAAO,KAAA,CAAM,UAAA,CAAW,IAAA,CAAK,GAAG,CAAA;AAAA,QACnD,KAAK,UAAA;AAAc,UAAA,OAAO,KAAA,CAAM,QAAA,CAAS,IAAA,CAAK,GAAG,CAAA;AAAA,QACjD,KAAK,MAAA,EAAQ;AACX,UAAA,IAAI,EAAA,GAAK,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,KAAK,GAAG,CAAA;AACpC,UAAA,IAAI,CAAC,EAAA,EAAI;AACP,YAAA,IAAI,0BAAA,CAA2B,IAAA,CAAK,IAAA,CAAK,GAAG,CAAA,EAAG;AAC7C,cAAA,MAAM,IAAI,MAAM,2DAAsD,CAAA;AAAA,YACxE;AACA,YAAA,EAAA,GAAK,IAAI,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA;AACxB,YAAA,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,IAAA,CAAK,GAAA,EAAK,EAAE,CAAA;AAAA,UACjC;AACA,UAAA,OAAO,GAAG,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,GAAM,CAAC,CAAA;AAAA,QACvC;AAAA,QACA;AAAS,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,IAAA,CAAK,IAAI,CAAA,CAAE,CAAA;AAAA;AAC3D,IACF;AAAA,IAEA,KAAK,SAAA;AACH,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IAEd,SAAS;AAEP,MAAA,MAAM,IAAI,MAAM,CAAA,gBAAA,CAAkB,CAAA;AAAA,IACpC;AAAA;AAEJ;AAMA,SAAS,YAAA,CAAa,GAAA,EAAgB,aAAA,EAAwB,GAAA,EAAyB;AACrF,EAAA,GAAA,CAAI,cAAA,CAAe,IAAI,GAAG,CAAA;AAC1B,EAAA,IAAI,aAAA,EAAe,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAG,CAAA;AAClD,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,eAAA,CAAgB,IAAA,EAAe,GAAA,EAAc,GAAA,EAAuB;AAC3E,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,GAAG,OAAO,KAAA;AAEhC,EAAA,IAAI,IAAA,CAAK,CAAA,KAAM,SAAA,EAAW,OAAO,IAAA;AAEjC,EAAA,IAAI,IAAA,CAAK,MAAM,MAAA,EAAQ;AACrB,IAAA,MAAM,OAAO,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,KAAA,CAAM,SAAS,CAAC,CAAA;AAC7C,IAAA,IAAI,IAAA,EAAM,CAAA,KAAM,SAAA,EAAW,OAAO,IAAA;AAAA,EACpC;AAEA,EAAA,IAAI,KAAK,CAAA,KAAM,MAAA,SAAe,GAAA,CAAI,cAAA,CAAe,IAAI,GAAa,CAAA;AAElE,EAAA,OAAO,GAAA,CAAI,cAAA,CAAe,GAAA,CAAI,GAAa,CAAA;AAC7C;AAIO,SAAS,iBAAiB,KAAA,EAA0B;AACzD,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,OAAO,CAAA,KAAM,QAAA,GAAW,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,CAAC,CAAC,CAAA;AAAA,EACvE;AACA,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AACzC,IAAA,OAAO,CAAC,OAAO,KAAA,KAAU,QAAA,GAAW,QAAQ,IAAA,CAAK,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,EACnE;AACA,EAAA,OAAO,EAAC;AACV;AAEO,SAAS,sBAAA,CAAuB,OAAgB,UAAA,EAAoC;AACzF,EAAA,IAAI;AACF,IAAA,MAAM,MAAA,GAAS,SAAS,UAAU,CAAA;AAClC,IAAA,MAAM,GAAA,GAAM,IAAI,MAAA,CAAO,MAAM,EAAE,KAAA,EAAM;AACrC,IAAA,MAAM,GAAA,GAAe;AAAA,MACnB,cAAA,sBAAoB,OAAA,EAAQ;AAAA,MAC5B,mBAAA,sBAAyB,OAAA,EAAQ;AAAA,MACjC,UAAA,sBAAgB,GAAA;AAAI,KACtB;AACA,IAAA,MAAM,GAAA,GAAM,QAAA,CAAS,GAAA,EAAK,KAAA,EAAO,GAAG,CAAA;AAGpC,IAAA,IAAI,KAAA,CAAM,QAAQ,GAAG,CAAA,IAAK,gBAAgB,GAAA,EAAK,GAAA,EAAK,GAAG,CAAA,EAAG;AAGxD,MAAA,MAAM,YAAA,GAAe,GAAA,CAAI,mBAAA,CAAoB,GAAA,CAAI,GAAa,CAAA;AAC9D,MAAA,IAAI,YAAA,EAAc;AAChB,QAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,OAAO,IAAA,EAAK;AACrD,QAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,EAAO,GAAA,CAAI,CAAC,CAAA,EAAE;AAAA,MACzD;AACA,MAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,EAAC,EAAE;AACnD,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,GAAA,EAAI;AAAA,IAChC;AAEA,IAAA,OAAO,EAAE,IAAI,IAAA,EAAM,KAAA,EAAO,QAAQ,OAAA,GAAU,KAAK,GAAA,EAAI;AAAA,EACvD,SAAS,GAAA,EAAK;AACZ,IAAA,MAAM,MAAM,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AAC3D,IAAA,OAAO,EAAE,EAAA,EAAI,KAAA,EAAO,KAAA,EAAO,GAAA,EAAI;AAAA,EACjC;AACF;;;ACztBO,IAAM,qBAAA,uBAA4B,GAAA,CAAI;AAAA,EAC3C,gBAAA;AAAA,EAAkB,YAAA;AAAA,EAAc,gBAAA;AAAA,EAChC,gBAAA;AAAA,EAAkB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EACpC,gBAAA;AAAA,EAAkB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EAAiB,kBAAA;AAAA,EACrD,WAAA;AAAA,EAAa,UAAA;AAAA,EAAY,iBAAA;AAAA,EACzB,eAAA;AAAA,EAAiB,YAAA;AAAA,EAAc,aAAA;AAAA,EAAe,aAAA;AAAA,EAC9C,UAAA;AAAA,EAAY,iBAAA;AAAA,EACZ,iBAAA;AAAA,EAAmB,cAAA;AAAA,EACnB,gBAAA;AAAA,EAAkB,eAAA;AAAA,EAAiB,gBAAA;AAAA,EAAkB,UAAA;AAAA,EAAY,iBAAA;AAAA,EACjE,eAAA;AAAA,EAAiB,SAAA;AAAA,EAAW,aAAA;AAAA,EAAe,cAAA;AAAA,EAC3C;AACF,CAAC;AAIM,IAAM,kBAAA,GAAqB;AAM3B,IAAM,2BAAA,GAA8B;AAC3C,IAAM,2BAAA,GAA8B,IAAA;AAE7B,SAAS,mBAAmB,QAAA,EAA0B;AAC3D,EAAA,OAAO,CAAA,EAAG,2BAA2B,CAAA,EAAG,QAAQ,GAAG,2BAA2B,CAAA,CAAA;AAChF;AAEO,SAAS,mBAAmB,IAAA,EAAkC;AACnE,EAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,2BAA2B,GAAG,OAAO,MAAA;AAC1D,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,2BAA2B,GAAG,OAAO,MAAA;AACxD,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AAAA,IACjB,2BAAA,CAA4B,MAAA;AAAA,IAC5B,IAAA,CAAK,SAAS,2BAAA,CAA4B;AAAA,GAC5C;AACA,EAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,KAAA,GAAQ,MAAA;AACpC;AAGO,SAAS,wBAAwB,QAAA,EAA2C;AACjF,EAAA,MAAM,MAAM,QAAA,CAAS,WAAA;AACrB,EAAA,IAAI,CAAC,GAAA,IAAO,GAAA,IAAO,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,MAAM,GAAG,CAAA,EAAG,CAAC,CAAA,EAAG,EAAE,CAAA;AAClD;AAIA,SAAS,sBAAsB,QAAA,EAAkE;AAC/F,EAAA,MAAM,MAAM,QAAA,CAAS,SAAA;AACrB,EAAA,IAAI,CAAC,GAAA,IAAO,GAAA,CAAI,MAAA,GAAS,GAAG,OAAO,MAAA;AACnC,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,KAAmB,OAAO,CAAA,KAAM,QAAA,IAAY,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AACpF,EAAA,OAAO,OAAA,CAAQ,MAAA,IAAU,CAAA,GAAI,OAAA,GAAU,MAAA;AACzC;AAYO,SAAS,qBAAA,CACd,SAAA,EACA,QAAA,EACA,QAAA,EACiB;AACjB,EAAA,MAAM,cAAc,qBAAA,CAAsB,GAAA,CAAI,QAAQ,CAAA,GAClD,uBAAA,CAAwB,QAAQ,CAAA,GAChC,CAAA;AAEJ,EAAA,IAAI,SAAA,IAAa,SAAA,CAAU,MAAA,GAAS,CAAA,EAAG;AACrC,IAAA,MAAM,QAAA,GAAW,WAAA,GAAc,CAAA,GAC3B,SAAA,CAAU,OAAA,CAAQ,CAAA,IAAA,KAAQ,KAAA,CAAM,WAAW,CAAA,CAAE,IAAA,CAAK,IAAI,CAAa,CAAA,GACnE,SAAA;AACJ,IAAA,OAAO,QAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAA,GAAY,sBAAsB,QAAQ,CAAA;AAChD,EAAA,IAAI,SAAA,EAAW;AAGb,IAAA,OAAO,SAAA,CAAU,OAAA;AAAA,MAAQ,CAAA,CAAA,KACvB,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,WAAA,EAAa,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,kBAAA,CAAmB,CAAC,CAAC;AAAA,KAC5D;AAAA,EACF;AAEA,EAAA,IAAI,cAAc,CAAA,EAAG;AACnB,IAAA,OAAO,KAAA,CAAM,WAAW,CAAA,CAAE,IAAA,CAAK,kBAAkB,CAAA;AAAA,EACnD;AAEA,EAAA,OAAO,IAAA;AACT;;;ACxDA,IAAM,4BAAA,GAAkF;AAAA,EACtF,QAAA,EAAU,GAAA;AAAA,EACV,eAAA,EAAiB,GAAA;AAAA,EACjB,MAAA,EAAQ,CAAC,WAAW,CAAA;AAAA,EACpB,YAAY,CAAC,cAAA,EAAgB,aAAa,WAAA,EAAa,eAAA,EAAiB,gBAAgB,gBAAgB,CAAA;AAAA,EACxG,GAAA,EAAK,CAAC,WAAA,EAAa,eAAA,EAAiB,cAAc,CAAA;AAAA;AAAA,EAElD,MAAA,EAAQ,CAAC,cAAc,CAAA;AAAA,EACvB,OAAA,EAAS,CAAC,WAAW,CAAA;AAAA,EACrB,OAAA,EAAS,CAAC,WAAW,CAAA;AAAA;AAAA,EAErB,UAAA,EAAY,CAAC,eAAe,CAAA;AAAA,EAC5B,MAAA,EAAQ,CAAC,eAAe,CAAA;AAAA,EACxB,SAAA,EAAW,CAAC,eAAe,CAAA;AAAA,EAC3B,WAAA,EAAa,CAAC,cAAc,CAAA;AAAA,EAC5B,UAAA,EAAY,CAAC,WAAW,CAAA;AAAA;AAAA;AAAA;AAAA,EAIxB,IAAA,EAAM,CAAC,gBAAgB;AACzB,CAAA;AASO,IAAM,qBAAA,GAA2E,qBAAA,CAAsB,4BAAA,EAA8B,mBAAA,EAAqB;AAEjK,SAAS,qBAAA,CACP,QACA,IAAA,EACyC;AACzC,EAAA,MAAM,GAAA,GAA+C,EAAE,GAAG,MAAA,EAAO;AACjE,EAAA,KAAA,MAAW,CAAC,IAAA,EAAM,OAAO,CAAA,IAAK,IAAA,EAAM;AAClC,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAE5B,MAAA,IAAI,GAAA,CAAI,GAAA,CAAI,MAAM,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,iCAAA,EAAoC,IAAI,CAAA,QAAA,EAAW,MAAM,CAAA,uCAAA,CAAyC,CAAA;AACvI,MAAA,GAAA,CAAI,IAAI,MAAM,CAAA;AACd,MAAA,MAAM,KAAA,GAAQ,OAAO,MAAA,CAAO,GAAA,EAAK,MAAM,CAAA,GAAI,GAAA,CAAI,MAAM,CAAA,GAAI,EAAC;AAC1D,MAAA,IAAI,UAAU,GAAA,EAAK;AAInB,MAAA,IAAI,KAAA,CAAM,QAAA,CAAS,IAAI,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,uBAAA,EAA0B,IAAI,CAAA,gBAAA,EAAmB,MAAM,CAAA,kEAAA,CAA+D,CAAA;AAChK,MAAA,GAAA,CAAI,MAAM,CAAA,GAAI,CAAC,GAAG,OAAO,IAAI,CAAA;AAAA,IAC/B;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,qBAAA,CAAsB,UAAqC,YAAA,EAAkD;AAC3H,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,MAAA,CAAO,qBAAA,EAAuB,YAAA,IAAgB,EAAE,CAAA,GAAI,qBAAA,CAAsB,YAAA,IAAgB,EAAE,CAAA,GAAI,MAAA;AACrH,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,IAAA;AAChC,EAAA,OAAO,UAAU,GAAA,IAAO,CAAC,KAAA,CAAM,QAAA,CAAS,YAAY,EAAE,CAAA;AACxD;AAEA,IAAM,OAAA,GAAU,CAAC,CAAA,KAAwB,OAAO,MAAM,QAAA,IAAY,CAAA,CAAE,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AAO/E,SAAS,gBAAgB,OAAA,EAAuE;AACrG,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,OAAA,CAAQ,OAAA,CAAQ,CAAC,KAAA,EAAO,GAAA,KAAQ;AAC9B,IAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AACpB,IAAA,KAAA,CAAM,KAAK,KAAK,CAAA;AAChB,IAAA,UAAA,CAAW,KAAK,GAAG,CAAA;AAAA,EACrB,CAAC,CAAA;AACD,EAAA,OAAO,EAAE,OAAO,UAAA,EAAW;AAC7B;AA6BO,SAAS,WAAA,CACd,IAAA,EACA,IAAA,EACA,SAAA,EACa;AACb,EAAA,IAAI,KAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAE,MAAM,YAAA,EAAa;AACnD,EAAA,MAAM,IAAA,GAAO,MAAM,UAAA,IAAc,MAAA;AACjC,EAAA,MAAM,IAAA,GAAO,CAAC,GAAA,KAA0C,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,IAAA,EAAM,MAAA,EAAO,GAAI,EAAE,IAAA,EAAM,OAAA,EAAS,OAAO,GAAA,EAAK;AACvH,EAAA,IAAI,IAAA,KAAS,MAAA,EAAQ,OAAO,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,IAAA,EAAM,SAAA,IAAa,GAAA,EAAK,IAAA,CAAK,MAAM,CAAC,CAAC,CAAA;AACxF,EAAA,IAAI,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA,SAAU,IAAA,CAAK,IAAA,CAAK,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,EAAG,EAAE,CAAC,CAAC,CAAA;AAC3E,EAAA,IAAI,IAAA,KAAS,UAAU,SAAA,IAAa,uBAAA,CAAwB,IAAI,CAAA,EAAG,OAAO,EAAE,IAAA,EAAM,YAAA,EAAa;AAC/F,EAAA,MAAM,IAAA,GAAO,gBAAgB,eAAA,CAAgB,CAAC,GAAG,IAAI,CAAA,EAAG,IAAI,CAAC,CAAA,CAAE,KAAA;AAC/D,EAAA,OAAO,IAAA,CAAK,MAAA,GAAS,CAAA,GAAI,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,CAAC,CAAA,EAAG,GAAI,EAAE,MAAM,MAAA,EAAO;AAC/E;AAOO,SAAS,aAAA,CAAc,MAAwD,QAAA,EAA4B;AAChH,EAAA,OAAO,IAAA,CACJ,MAAA,CAAO,CAAC,GAAA,KAAQ,GAAA,CAAI,IAAA,CAAK,CAAC,IAAA,KAAS,CAAC,OAAA,CAAQ,IAAI,CAAC,CAAC,CAAA,CAClD,GAAA,CAAI,CAAC,GAAA,KAAS,OAAO,GAAA,CAAI,QAAQ,CAAA,KAAM,QAAA,GAAY,GAAA,CAAI,QAAQ,CAAA,CAAa,IAAA,EAAK,GAAI,EAAG,CAAA;AAC7F;AAgCO,SAAS,iBAAA,CACd,YACA,QAAA,EACwB;AACxB,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AACpC,EAAA,MAAM,OAAO,CAAC,CAAA,KAAS,gBAAgB,CAAA,CAAE,OAAO,EAAE,KAAA,CAAM,MAAA;AACxD,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,MAAA,CAAO,CAAC,IAAA,EAAM,CAAA,KAAO,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA,GAAI,IAAI,IAAK,CAAA;AAChF,EAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,EAAE,OAAA,CAAQ,MAAA,KAAW,OAAA,CAAQ,OAAA,CAAQ,MAAM,CAAA;AAClF,EAAA,MAAM,WAAA,GAAc,CAAC,CAAA,KAAS,qBAAA,CAAsB,QAAA,EAAU,CAAA,CAAE,YAAY,CAAA,IAAK,UAAA,CAAW,CAAA,CAAE,OAAA,EAAS,QAAA,EAAU,EAAE,YAAY,CAAA;AAC/H,EAAA,MAAM,MAAA,GAAS,YAAY,OAAO,CAAA,GAAI,UAAW,KAAA,CAAM,IAAA,CAAK,WAAW,CAAA,IAAK,OAAA;AAC5E,EAAA,MAAM,aAAuB,EAAC;AAC9B,EAAA,KAAA,IAAS,MAAM,CAAA,EAAG,GAAA,GAAM,OAAA,CAAQ,OAAA,CAAQ,QAAQ,GAAA,EAAA,EAAO;AACrD,IAAA,IAAI,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,CAAA,CAAE,OAAA,CAAQ,GAAG,CAAC,CAAC,CAAA,EAAG,UAAA,CAAW,KAAK,GAAG,CAAA;AAAA,EACtE;AACA,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,UAAA,CAAW,GAAA,CAAI,CAAC,QAAS,OAAA,CAAQ,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAC,CAAA,GAAI,EAAA,GAAK,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAE,CAAA;AAAA,IACxF,UAAA;AAAA,IACA,cAAc,MAAA,CAAO;AAAA,GACvB;AACF;AAOO,SAAS,gBAAgB,IAAA,EAAuB;AACrD,EAAA,MAAM,CAAA,GAAI,KAAK,IAAA,EAAK;AAKpB,EAAA,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,IAAA,CAAK,KAAK,CAAC,CAAA,IAAK,CAAA,CAAE,UAAA,CAAW,GAAG,CAAA,IAAK,CAAA,CAAE,UAAA,CAAW,GAAG,GAAG,OAAO,KAAA;AACrF,EAAA,OAAO,EAAE,UAAA,CAAW,MAAM,CAAA,IAAK,2DAAA,CAA4D,KAAK,CAAC,CAAA;AACnG;AAQA,IAAM,sBAAA,GAAsE;AAAA,EAC1E,kBAAA,EAAoB,CAAC,IAAI;AAC3B,CAAA;AAGO,SAAS,mBAAA,CAAoB,UAAqC,YAAA,EAAkD;AACzH,EAAA,MAAM,KAAA,GAAQ,sBAAA,CAAuB,QAAA,IAAY,EAAE,CAAA;AACnD,EAAA,OAAO,KAAA,KAAU,MAAA,IAAa,KAAA,CAAM,QAAA,CAAS,gBAAgB,EAAE,CAAA;AACjE;AAKA,SAAS,UAAA,CAAW,OAAA,EAA4B,QAAA,EAA0B,YAAA,EAAuC;AAC/G,EAAA,MAAM,KAAA,GAAQ,QAAQ,IAAA,CAAK,CAAC,MAAM,CAAC,OAAA,CAAQ,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAChC,EAAA,OAAO,CAAC,eAAA,CAAgB,KAAK,CAAA,IAAK,mBAAA,CAAoB,UAAU,YAAY,CAAA;AAC9E;AA6BO,SAAS,UAAA,CACd,MAAA,EACA,QAAA,EACA,QAAA,EACmB;AACnB,EAAA,MAAM,KAAA,GAAQ,qBAAA,CAAsB,MAAA,EAAQ,KAAA,EAAO,UAAU,QAAQ,CAAA;AACrE,EAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AACnB,EAAA,MAAM,UAAA,GAAa,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAM,MAAA,GAAS,CAAA;AACjE,EAAA,IAAI,CAAC,UAAA,EAAY,OAAO,EAAE,KAAA,EAAO,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,MAAM,MAAS,CAAA,EAAG,YAAA,EAAc,MAAA,EAAU;AAC3F,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,MAAA;AAC3C,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,IAAA,EAAM,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA;AAAA,IACnE,cAAc,MAAA,CAAO;AAAA,GACvB;AACF;AASO,SAAS,gBAAA,CAAiB,OAAgB,IAAA,EAAoC;AACnF,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,KAAK,KAAK,KAAA,CAAM,MAAA,KAAW,GAAG,OAAO,MAAA;AACxD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,WAAW,KAAA,EAAO;AAC3B,IAAA,MAAM,KAAA,GAAQ,gBAAA,CAAiB,OAAA,EAAS,IAAI,CAAA;AAC5C,IAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,OAAO,MAAA;AAC7B,IAAA,GAAA,CAAI,KAAK,oBAAA,CAAqB,KAAK,CAAA,CAAE,CAAC,KAAK,EAAE,CAAA;AAAA,EAC/C;AACA,EAAA,OAAO,GAAA,CAAI,KAAK,CAAC,CAAA,KAAM,EAAE,MAAA,GAAS,CAAC,IAAI,GAAA,GAAM,MAAA;AAC/C;;;AC7TA,eAAsB,gBAAA,CACpB,KAAA,EACA,KAAA,EACA,YAAA,EACoC;AACpC,EAAA,MAAM,OAAA,GAAqC,IAAI,KAAA,CAAM,KAAA,CAAM,MAAM,CAAA;AACjE,EAAA,IAAI,SAAA,GAAY,CAAA;AAEhB,EAAA,MAAM,cAAA,GAAiB,IAAI,KAAA,CAAM,qBAAqB,CAAA;AAEtD,EAAA,eAAe,MAAA,GAAwB;AACrC,IAAA,OAAO,SAAA,GAAY,MAAM,MAAA,EAAQ;AAC/B,MAAA,IAAI,cAAc,SAAA,EAAW;AAC7B,MAAA,MAAM,GAAA,GAAM,SAAA,EAAA;AACZ,MAAA,IAAI;AACF,QAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,CAAM,GAAG,CAAA,EAAE;AAC/B,QAAA,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,MAAA,EAAQ,aAAa,KAAA,EAAM;AAAA,MAC9C,SAAS,MAAA,EAAQ;AACf,QAAA,OAAA,CAAQ,GAAG,CAAA,GAAI,EAAE,MAAA,EAAQ,YAAY,MAAA,EAAO;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,UAAU,KAAA,CAAM,IAAA;AAAA,IACpB,EAAE,MAAA,EAAQ,IAAA,CAAK,IAAI,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA,EAAE;AAAA,IACxC,MAAM,MAAA;AAAO,GACf;AACA,EAAA,MAAM,OAAA,CAAQ,IAAI,OAAO,CAAA;AAGzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,IAAA,IAAI,CAAC,OAAA,CAAQ,CAAC,CAAA,EAAG,OAAA,CAAQ,CAAC,CAAA,GAAI,EAAE,MAAA,EAAQ,UAAA,EAAY,MAAA,EAAQ,cAAA,EAAe;AAAA,EAC7E;AAEA,EAAA,OAAO,OAAA;AACT;;;ACpCO,IAAM,kBAAA,GAAqB;AAc3B,SAAS,oBAAA,CACd,MACA,OAAA,EACU;AACV,EAAA,MAAM,YAAA,GAAA,CAAgB,OAAA,IAAW,EAAC,EAAG,IAAA,CAAK,CAAC,CAAA,KAAA,CAAO,CAAA,CAAE,IAAA,IAAQ,MAAA,MAAY,MAAM,CAAA;AAC9E,EAAA,MAAM,MAAM,YAAA,EAAc,cAAA;AAC1B,EAAA,IAAI,QAAQ,kBAAA,EAAoB;AAC9B,IAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,IAAA,OAAO,QAAQ,MAAA,GAAS,CAAA,GAAI,CAAC,OAAO,IAAI,EAAC;AAAA,EAC3C;AACA,EAAA,MAAM,YAAY,GAAA,IAAO,IAAA;AACzB,EAAA,OAAO,KAAK,KAAA,CAAM,SAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,EAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC9E;AAQO,SAAS,oBACd,IAAA,EACA,QAAA,EACA,UACA,UAAA,EACA,SAAA,EACA,aACA,QAAA,EACoE;AACpE,EAAA,MAAM,QAAQ,UAAA,CAAW,KAAA,CAAM,SAAS,CAAA,CAAE,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACzF,EAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AAErB,IAAA,MAAMA,QAAAA,GAAU,KAAK,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;AACtC,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAGA,QAAAA,CAAQ,QAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,KAAA,CAAM,CAAC,CAAA;AAC7D,IAAA,OAAO,EAAE,OAAA,EAAAA,QAAAA,EAAS,WAAW,KAAA,EAAO,aAAA,EAAeA,SAAQ,MAAA,EAAO;AAAA,EACpE;AAEA,EAAA,MAAM,OAAA,GAAU,KAAK,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAA;AACtC,EAAA,OAAA,CAAQ,QAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,MAAM,CAAC,CAAA;AACrC,EAAA,MAAM,aAAa,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS;AAC9C,IAAA,MAAM,CAAA,GAAI,MAAM,IAAA,CAAa,EAAE,QAAQ,WAAA,EAAa,CAAA,CAAE,IAAA,CAAK,EAAE,CAAA;AAC7D,IAAA,CAAA,CAAE,QAAQ,CAAA,GAAI,IAAA;AACd,IAAA,OAAO,CAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,OAAA,CAAQ,MAAA,CAAO,QAAA,GAAW,CAAA,EAAG,CAAA,EAAG,GAAG,UAAU,CAAA;AAE7C,EAAA,MAAM,SAAA,GAAY,QAAQ,MAAA,GAAS,QAAA;AACnC,EAAA,MAAM,gBAAgB,OAAA,CAAQ,MAAA;AAC9B,EAAA,OAAO;AAAA,IACL,SAAS,SAAA,GAAY,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,GAAI,OAAA;AAAA,IAClD,SAAA;AAAA,IACA;AAAA,GACF;AACF;;;ACvEO,IAAM,uBAAA,GAA0B;AAOhC,SAAS,oBAAoB,IAAA,EAA2C;AAC7E,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,EAAC;AACnB,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,uBAAuB,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,OAAO,OAAO,CAAA;AACrF,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,OAAO,KAAA;AAC7B,EAAA,MAAM,OAAA,GAAU,KAAK,IAAA,EAAK;AAC1B,EAAA,OAAO,OAAA,GAAU,CAAC,OAAO,CAAA,GAAI,EAAC;AAChC;;;ACTO,IAAM,iBAAA,GAAoB;AAAA,EAC/B,SAAA;AAAA,EACA,gBAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA;AACF;AAIA,IAAM,SAAA,GAAoC;AAAA,EACxC,OAAA,EAAS,IAAA;AAAA,EACT,gBAAA,EAAkB,MAAA;AAAA,EAClB,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO;AACT,CAAA;AAEA,IAAM,WAAA,GAAsC;AAAA,EAC1C,GAAG,SAAA;AAAA,EACH,KAAA,EAAO;AACT,CAAA;AAGO,IAAM,iBAAA,GAA4C;AAAA,EACvD,OAAA,EAAS,KAAA;AAAA,EACT,gBAAA,EAAkB,QAAA;AAAA,EAClB,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,OAAA;AAAA,EACP,KAAA,EAAO;AACT;AAaO,SAAS,gBAAA,CACd,GAAA,EACA,eAAA,EACA,IAAA,EACQ;AACR,EAAA,MAAM,IAAI,GAAA,IAAO,SAAA;AACjB,EAAA,IAAI,CAAA,KAAM,QAAA,EAAU,OAAO,eAAA,IAAmB,EAAA;AAC9C,EAAA,MAAM,GAAA,GAAM,IAAA,EAAM,cAAA,GAAiB,WAAA,GAAc,SAAA;AACjD,EAAA,OAAO,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACnB;;;ACrCA,IAAM,YAAA,GAAe,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,EAAW;AAAA,EAChD,WAAA,EAAa,MAAA;AAAA,EACb,OAAA,EAAS;AACX,CAAC,CAAA;AAQD,SAAS,aAAA,CAAc,MAAc,KAAA,EAAwB;AAC3D,EAAA,IAAI,KAAA,KAAU,IAAI,OAAO,IAAA;AACzB,EAAA,MAAM,MAAA,GAAS,aAAa,IAAI,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,gBAAA,CAAiB,MAAA,EAAQ,KAAK,CAAA;AAC9C,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,CAAQ,CAAC,CAAA,GAAI,MAAA;AAC3C;AAEA,SAAS,UAAU,CAAA,EAAqB;AACtC,EAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,IAAA,EAAM,OAAO,IAAA;AAC1C,EAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,EAAE,IAAA,EAAK,KAAM,IAAI,OAAO,IAAA;AACrD,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,YAAY,CAAA,EAAgC;AACnD,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU,OAAO,OAAO,QAAA,CAAS,CAAC,IAAI,CAAA,GAAI,MAAA;AAC3D,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,MAAA;AAC3B,IAAA,MAAM,CAAA,GAAI,OAAO,OAAO,CAAA;AACxB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,UAAU,CAAA,EAAgC;AACjD,EAAA,IAAI,aAAa,IAAA,EAAM;AACrB,IAAA,MAAM,CAAA,GAAI,EAAE,OAAA,EAAQ;AACpB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU,OAAO,OAAO,QAAA,CAAS,CAAC,IAAI,CAAA,GAAI,MAAA;AAC3D,EAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACtB,IAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,SAAA,CAAU,KAAc,QAAA,EAAwD;AACvF,EAAA,IAAI,SAAA,CAAU,GAAG,CAAA,EAAG,OAAO,EAAE,GAAA,EAAK,EAAA,EAAI,SAAS,SAAA,EAAU;AAEzD,EAAA,IAAI,aAAa,QAAA,EAAU;AACzB,IAAA,MAAM,CAAA,GAAI,YAAY,GAAG,CAAA;AACzB,IAAA,OAAO,CAAA,KAAM,MAAA,GACT,EAAE,GAAA,EAAK,EAAA,EAAI,OAAA,EAAS,SAAA,EAAU,GAC9B,EAAE,GAAA,EAAK,CAAA,EAAG,OAAA,EAAS,QAAA,EAAS;AAAA,EAClC;AAEA,EAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,IAAA,MAAM,CAAA,GAAI,UAAU,GAAG,CAAA;AACvB,IAAA,OAAO,CAAA,KAAM,MAAA,GACT,EAAE,GAAA,EAAK,EAAA,EAAI,OAAA,EAAS,SAAA,EAAU,GAC9B,EAAE,GAAA,EAAK,CAAA,EAAG,OAAA,EAAS,QAAA,EAAS;AAAA,EAClC;AAEA,EAAA,IAAI,aAAa,MAAA,EAAQ;AACvB,IAAA,OAAO,EAAE,GAAA,EAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,OAAA,EAAS,MAAA,EAAO;AAAA,EACrF;AAGA,EAAA,MAAM,KAAA,GAAQ,YAAY,GAAG,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW,OAAO,EAAE,GAAA,EAAK,KAAA,EAAO,SAAS,QAAA,EAAS;AAChE,EAAA,MAAM,MAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,EAAA,IAAI,WAAW,MAAA,EAAW,OAAO,EAAE,GAAA,EAAK,MAAA,EAAQ,SAAS,QAAA,EAAS;AAClE,EAAA,OAAO,EAAE,GAAA,EAAK,OAAO,GAAA,KAAQ,QAAA,GAAW,GAAA,GAAM,IAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,OAAA,EAAS,MAAA,EAAO;AACrF;AAEO,SAAS,aAAA,CAAc,OAA0B,IAAA,EAAiC;AACvF,EAAA,MAAM,EAAE,KAAA,EAAO,QAAA,EAAU,SAAA,EAAU,GAAI,IAAA;AACvC,EAAA,MAAM,KAAA,GAAqB,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC7C,IAAA,MAAM,GAAA,GAAM,aAAA,CAAc,IAAA,EAAM,KAAK,CAAA;AACrC,IAAA,MAAM,EAAE,GAAA,EAAK,OAAA,EAAQ,GAAI,SAAA,CAAU,KAAK,QAAQ,CAAA;AAChD,IAAA,OAAO,EAAE,IAAA,EAAM,GAAA,EAAK,OAAA,EAAQ;AAAA,EAC9B,CAAC,CAAA;AAED,EAAA,MAAM,WAAW,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,YAAY,SAAS,CAAA;AAC5D,EAAA,MAAM,UAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,YAAY,SAAS,CAAA;AAE3D,EAAA,MAAM,MAAA,GAAS,SAAA,KAAc,MAAA,GAAS,EAAA,GAAK,CAAA;AAG3C,EAAA,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,IAAA,IAAI,CAAA,CAAE,OAAA,KAAY,QAAA,IAAY,CAAA,CAAE,YAAY,QAAA,EAAU;AACpD,MAAA,OAAA,CAAS,CAAA,CAAE,GAAA,GAAkB,CAAA,CAAE,GAAA,IAAkB,MAAA;AAAA,IACnD;AACA,IAAA,OAAO,YAAA,CAAa,OAAA,CAAQ,MAAA,CAAO,CAAA,CAAE,GAAG,GAAG,MAAA,CAAO,CAAA,CAAE,GAAG,CAAC,CAAA,GAAI,MAAA;AAAA,EAC9D,CAAC,CAAA;AAED,EAAA,OAAO,CAAC,GAAG,QAAA,CAAS,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,IAAI,CAAA,EAAG,GAAG,QAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACvE;;;AClHO,IAAM,0BAAA,GAA6B;AACnC,IAAM,yBAAA,GAA4B;AAClC,IAAM,0BAAA,GAA6B;AAEnC,IAAM,kCAAA,GAAqC;AAE3C,IAAM,4BAAA,uBAAwD,GAAA,CAAI;AAAA,EACvE,0BAAA;AAAA,EACA,yBAAA;AAAA,EACA,0BAAA;AAAA,EACA;AACF,CAAC;AAEM,SAAS,2BAA2B,IAAA,EAA+B;AACxE,EAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,4BAAA,CAA6B,IAAI,IAAI,CAAA;AAC1E;;;ACeO,IAAM,sBAAsB,CAAC,SAAA,EAAW,SAAS,MAAA,EAAQ,OAAA,EAAS,UAAU,MAAM;AA6BlF,IAAM,qBAAA,GAAwG;AAAA,EACnH,OAAA,EAAS,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACf,KAAA,EAAO,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACb,IAAA,EAAM,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACZ,KAAA,EAAO,CAAC,CAAA,EAAG,EAAE,CAAA;AAAA,EACb,MAAA,EAAQ,CAAC,CAAA,EAAG,EAAE;AAChB;AAMA,SAAS,IAAI,KAAA,EAA+B;AAC1C,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAChF,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,SAAA,CAAU,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,QAAA,CAAS,KAAA,CAAM,IAAA,IAAQ,EAAE,CAAA;AAC/F,EAAA,OAAO,IAAA;AACT;AAEA,SAAS,KAAA,CAAM,KAAA,EAAsB,EAAA,EAAY,EAAA,EAAY,QAAA,EAA0B;AACrF,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,QAAA;AAC3B,EAAA,OAAO,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,CAAC,CAAA;AACzC;AAGA,SAAS,YAAY,KAAA,EAA+B;AAClD,EAAA,MAAM,CAAA,GAAI,IAAI,KAAK,CAAA;AACnB,EAAA,OAAO,CAAA,KAAM,IAAA,IAAQ,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,IAAA;AACpC;AAGO,SAAS,iBAAiB,KAAA,EAAiC;AAChE,EAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,CAAM,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CAAE,MAAA,CAAO,OAAO,CAAA,CAAE,MAAA,KAAW,CAAA;AAC3F;AAQO,SAAS,qBAAA,CAAsB,GAAA,EAAc,UAAA,GAAa,QAAA,EAA+B;AAC9F,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;AAC5C,EAAA,MAAM,CAAA,GAAI,GAAA;AACV,EAAA,IAAI,OAAO,CAAA,CAAE,IAAA,KAAS,QAAA,IAAY,CAAE,oBAA0C,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA,EAAG,OAAO,IAAA;AACvG,EAAA,MAAM,OAAO,CAAA,CAAE,IAAA;AACf,EAAA,MAAM,EAAA,GAAK,OAAO,CAAA,CAAE,EAAA,KAAO,QAAA,IAAY,CAAA,CAAE,EAAA,CAAG,IAAA,EAAK,GAAI,CAAA,CAAE,EAAA,CAAG,IAAA,EAAK,GAAI,UAAA;AACnE,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,CAAA,CAAE,MAAM,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC,CAAA;AAC5C,EAAA,MAAM,IAAA,GAAO,MAAM,GAAA,CAAI,CAAA,CAAE,IAAI,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC,CAAA;AACxC,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,SAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,OAAA,EAAS,CAAC,CAAA,EAAE;AAAA,IAC5F,KAAK,OAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,KAAA,EAAO,CAAC,GAAG,MAAA,EAAO;AAAA,IAClG,KAAK,MAAA;AACH,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,IAAA,EAAM,CAAC,CAAA,EAAG,MAAM,MAAA,EAAO;AAAA,IACvG,KAAK,OAAA,EAAS;AACZ,MAAA,MAAM,QAAA,GAAW,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,QAAQ,CAAA,GACrC,CAAC,GAAG,IAAI,IAAI,CAAA,CAAE,QAAA,CAAS,GAAA,CAAI,GAAG,EAAE,MAAA,CAAO,CAAC,CAAA,KAAmB,CAAA,KAAM,IAAA,IAAQ,CAAA,IAAK,CAAA,IAAK,CAAA,IAAK,CAAC,CAAC,CAAC,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,IACjH,EAAC;AACL,MAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAClC,MAAA,OAAO,EAAE,EAAA,EAAI,IAAA,EAAM,KAAA,EAAO,KAAA,CAAM,YAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,sBAAsB,KAAA,EAAO,CAAC,CAAA,EAAG,IAAA,EAAM,QAAQ,QAAA,EAAS;AAAA,IAClH;AAAA,IACA,KAAK,QAAA;AACH,MAAA,OAAO;AAAA,QACL,EAAA;AAAA,QACA,IAAA;AAAA,QACA,KAAA,EAAO,MAAM,WAAA,CAAY,CAAA,CAAE,KAAK,CAAA,EAAE,GAAG,qBAAA,CAAsB,MAAA,EAAQ,CAAC,CAAA;AAAA,QACpE,IAAA;AAAA,QACA,MAAA;AAAA,QACA,UAAA,EAAY,MAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAA,EAAG,CAAA,EAAG,IAAI,CAAC;AAAA,OAC/C;AAAA,IACF,KAAK,MAAA,EAAQ;AACX,MAAA,MAAM,IAAA,GAAO,OAAO,CAAA,CAAE,IAAA,KAAS,WAAW,CAAA,CAAE,IAAA,CAAK,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,GAAI,EAAA;AACjF,MAAA,OAAO,iBAAiB,IAAI,CAAA,GAAI,EAAE,EAAA,EAAI,IAAA,EAAM,MAAK,GAAI,IAAA;AAAA,IACvD;AAAA;AAEJ;AAGO,SAAS,uBAAuB,GAAA,EAA8B;AACnE,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,SAAU,EAAC;AACjC,EAAA,OAAO,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG,CAAA,KAAM,sBAAsB,CAAA,EAAG,CAAA,KAAA,EAAQ,CAAA,GAAI,CAAC,EAAE,CAAC,CAAA,CAAE,OAAO,CAAC,CAAA,KAAyB,MAAM,IAAI,CAAA;AACjH;AAOO,SAAS,sBAAsB,IAAA,EAAwF;AAC5H,EAAA,MAAM,QAAA,GAAW,OAAO,IAAA,CAAK,QAAA,KAAa,WAAW,IAAA,CAAK,QAAA,CAAS,MAAK,GAAI,EAAA;AAC5E,EAAA,MAAM,WAAW,CAAC,IAAA,CAAK,MAAM,IAAA,CAAK,cAAc,EAAE,IAAA,CAAK,CAAC,MAAmB,OAAO,CAAA,KAAM,YAAY,CAAA,CAAE,IAAA,OAAW,EAAE,CAAA,EAAG,MAAK,IAAK,EAAA;AAChI,EAAA,MAAM,CAAA,GAAI,QAAA,CAAS,KAAA,CAAM,iBAAiB,CAAA;AAC1C,EAAA,IAAI,CAAA,EAAG;AACL,IAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAE3B,IAAA,IAAI,CAAA,GAAI,CAAA,EAAG,OAAO,EAAC;AACnB,IAAA,QAAQ,CAAA,CAAE,CAAC,CAAA;AAAG,MACZ,KAAK,GAAA;AAAK,QAAA,OAAO,CAAC,EAAE,EAAA,EAAI,QAAA,EAAU,MAAM,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA;AAAA,MAC7D,KAAK,GAAA;AAAK,QAAA,OAAO,CAAA,GAAI,EAAA,GACjB,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,GAAG,CAAA,GAC5C,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAE,CAAC,CAAC,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA,MACrG,KAAK,GAAA;AAAK,QAAA,OAAO,IAAI,EAAA,GACjB,CAAC,EAAE,EAAA,EAAI,UAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,CAAA,EAAG,QAAQ,CAAA,EAAG,IACrD,CAAC,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,MAAA,EAAQ,KAAA,EAAO,KAAK,GAAA,CAAI,EAAA,EAAI,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,EAAE,CAAC,CAAC,CAAA,EAAG,MAAM,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA,MAC7G;AAAS,QAAA,OAAO,CAAC,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,QAAQ,KAAA,EAAO,IAAA,CAAK,GAAA,CAAI,EAAA,EAAI,CAAC,CAAA,EAAG,IAAA,EAAM,CAAA,EAAG,MAAA,EAAQ,GAAG,CAAA;AAAA;AAC7F,EACF;AACA,EAAA,MAAM,UAAA,GAAa,QAAA,KAAa,EAAA,IAAM,QAAA,KAAa,WAAW,QAAA,GAAW,QAAA;AACzE,EAAA,IAAI,CAAC,gBAAA,CAAiB,UAAU,CAAA,SAAU,EAAC;AAC3C,EAAA,MAAM,QAAA,GAAW,WAAW,UAAU,CAAA;AAItC,EAAA,OAAO,uBAAuB,CAAC,QAAA,IAAY,EAAE,EAAA,EAAI,UAAU,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,UAAA,CAAW,MAAM,KAAK,CAAA,CAAE,KAAK,GAAG,CAAA,EAAG,CAAC,CAAA;AACrH;AAGA,SAAS,SAAS,KAAA,EAA8B;AAC9C,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,aAAa,CAAA;AACnC,EAAA,IAAI,CAAC,GAAG,OAAO,IAAA;AACf,EAAA,MAAM,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,CAAC,GAAG,EAAE,CAAA;AAC3B,EAAA,OAAO,CAAA,IAAK,IAAI,CAAA,GAAI,IAAA;AACtB;AAGA,SAAS,WAAW,UAAA,EAAyC;AAC3D,EAAA,MAAM,CAAC,GAAA,EAAK,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,GAAG,CAAA,GAAI,UAAA,CAAW,IAAA,EAAK,CAAE,KAAA,CAAM,KAAK,CAAA;AAClE,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,CAAK,GAAG,IAAI,QAAA,CAAS,GAAA,EAAK,EAAE,CAAA,GAAI,IAAA;AACrD,EAAA,MAAM,KAAA,GAAQ,QAAQ,IAAA,CAAK,IAAI,IAAI,QAAA,CAAS,IAAA,EAAM,EAAE,CAAA,GAAI,IAAA;AACxD,EAAA,MAAM,OAAA,GAAU,SAAS,GAAG,CAAA;AAC5B,EAAA,MAAM,QAAA,GAAW,SAAS,IAAI,CAAA;AAC9B,EAAA,IAAI,OAAA,KAAY,IAAA,IAAQ,IAAA,KAAS,GAAA,IAAO,QAAQ,GAAA,IAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,OAAO,OAAA,EAAQ;AAC3H,EAAA,IAAI,GAAA,KAAQ,GAAA,IAAO,IAAA,KAAS,GAAA,IAAO,QAAQ,GAAA,IAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,SAAA,EAAW,OAAO,CAAA,EAAE;AAChH,EAAA,IAAI,SAAS,IAAA,IAAQ,QAAA,KAAa,IAAA,IAAQ,GAAA,KAAQ,OAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAS,KAAA,EAAO,QAAA,EAAU,QAAQ,IAAA,EAAK;AAC1I,EAAA,IAAI,SAAS,IAAA,IAAQ,IAAA,KAAS,GAAA,IAAO,GAAA,KAAQ,OAAO,GAAA,KAAQ,GAAA,EAAK,OAAO,EAAE,IAAI,QAAA,EAAU,IAAA,EAAM,SAAS,KAAA,EAAO,CAAA,EAAG,QAAQ,IAAA,EAAK;AAC9H,EAAA,IAAI,SAAS,IAAA,IAAQ,KAAA,KAAU,QAAQ,GAAA,KAAQ,GAAA,IAAO,QAAQ,GAAA,EAAK,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,MAAM,MAAA,EAAQ,KAAA,EAAO,GAAG,IAAA,EAAM,KAAA,EAAO,QAAQ,IAAA,EAAK;AAC5I,EAAA,IAAI,IAAA,KAAS,QAAQ,KAAA,KAAU,IAAA,IAAQ,QAAQ,GAAA,IAAO,gCAAA,CAAiC,IAAA,CAAK,GAAG,CAAA,EAAG;AAChG,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,GAAG,KAC5B,MAAM;AAAE,MAAA,MAAM,CAAC,GAAG,CAAC,CAAA,GAAI,IAAI,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,MAAM,CAAA;AAAG,MAAA,OAAO,KAAA,CAAM,IAAA,CAAK,EAAE,MAAA,EAAQ,CAAA,GAAI,CAAA,GAAI,CAAA,EAAE,EAAG,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AAAA,IAAE,IAAG,GACjH,GAAA,CAAI,MAAM,GAAG,CAAA,CAAE,IAAI,MAAM,CAAA;AAC7B,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,MAAA,EAAQ,IAAA,EAAM,QAAA,EAAS;AAAA,EACtF;AACA,EAAA,IAAI,IAAA,KAAS,QAAQ,KAAA,KAAU,IAAA,IAAQ,QAAQ,IAAA,CAAK,GAAG,CAAA,IAAK,GAAA,KAAQ,GAAA,EAAK;AACvE,IAAA,OAAO,EAAE,EAAA,EAAI,QAAA,EAAU,IAAA,EAAM,UAAU,KAAA,EAAO,CAAA,EAAG,IAAA,EAAM,KAAA,EAAO,QAAQ,IAAA,EAAM,UAAA,EAAY,QAAA,CAAS,GAAA,EAAK,EAAE,CAAA,EAAE;AAAA,EAC5G;AACA,EAAA,OAAO,IAAA;AACT;AA2BA,IAAM,UAAA,uBAAiB,GAAA,EAAiC;AACxD,IAAM,aAAA,uBAAoB,GAAA,EAAoB;AAC9C,IAAM,kBAAA,GAAqB,IAAA;AAE3B,SAAS,aAAa,QAAA,EAA0D;AAC9E,EAAA,MAAM,UAAU,QAAA,IAAY,QAAA,CAAS,MAAK,GAAI,QAAA,CAAS,MAAK,GAAI,KAAA;AAChE,EAAA,MAAM,KAAA,GAAQ,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA;AACvC,EAAA,IAAI,KAAA,EAAO,OAAO,UAAA,CAAW,GAAA,CAAI,KAAK,CAAA,IAAK,IAAA;AAC3C,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,IAAI,IAAA,CAAK,cAAA,CAAe,OAAA,EAAS;AAAA,MAC3C,QAAA,EAAU,OAAA;AAAA,MACV,SAAA,EAAW,KAAA;AAAA,MACX,IAAA,EAAM,SAAA;AAAA,MACN,KAAA,EAAO,SAAA;AAAA,MACP,GAAA,EAAK,SAAA;AAAA,MACL,IAAA,EAAM,SAAA;AAAA,MACN,MAAA,EAAQ;AAAA,KACT,CAAA;AACD,IAAA,MAAM,SAAA,GAAY,GAAA,CAAI,eAAA,EAAgB,CAAE,QAAA;AACxC,IAAA,IAAI,CAAC,WAAW,GAAA,CAAI,SAAS,GAAG,UAAA,CAAW,GAAA,CAAI,WAAW,GAAG,CAAA;AAC7D,IAAA,IAAI,aAAA,CAAc,IAAA,IAAQ,kBAAA,EAAoB,aAAA,CAAc,KAAA,EAAM;AAClE,IAAA,aAAA,CAAc,GAAA,CAAI,SAAS,SAAS,CAAA;AACpC,IAAA,OAAO,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA,IAAK,GAAA;AAAA,EACtC,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAGO,SAAS,gBAAgB,KAAA,EAAiC;AAC/D,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,CAAM,MAAK,KAAM,EAAA,IAAM,YAAA,CAAa,KAAK,CAAA,KAAM,IAAA;AACrF;AAGO,SAAS,eAAe,KAAA,EAA0B;AACvD,EAAA,OAAO,CAAA,EAAG,MAAM,QAAQ,CAAA,CAAA,EAAI,MAAM,IAAI,CAAA,CAAA,EAAI,MAAM,MAAM,CAAA,CAAA;AACxD;AAEA,SAAS,mBAAA,CAAoB,IAAA,EAAc,KAAA,EAAe,GAAA,EAAa,MAAc,MAAA,EAA2B;AAC9G,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,GAAQ,CAAA,EAAG,GAAG,CAAA,GAAI,KAAQ,CAAA;AAErE,EAAA,MAAM,OAAA,GAAA,CAAa,QAAA,GAAW,CAAA,GAAK,CAAA,GAAI,CAAA,IAAK,CAAA;AAC5C,EAAA,OAAO,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,IAAA,EAAM,IAAA,KAAS,EAAA,GAAK,CAAA,GAAI,IAAA,EAAM,MAAA,EAAQ,OAAA,EAAS,QAAA,EAAS;AACrF;AAGO,SAAS,WAAA,CAAY,MAAY,QAAA,EAA8B;AACpE,EAAA,MAAM,GAAA,GAAM,aAAa,QAAQ,CAAA;AACjC,EAAA,IAAI,CAAC,GAAA,EAAK,OAAO,oBAAoB,IAAA,CAAK,cAAA,IAAkB,IAAA,CAAK,WAAA,KAAgB,CAAA,EAAG,IAAA,CAAK,YAAW,EAAG,IAAA,CAAK,aAAY,EAAG,IAAA,CAAK,eAAe,CAAA;AAC/I,EAAA,MAAM,QAAgC,EAAC;AACvC,EAAA,KAAA,MAAW,CAAA,IAAK,GAAA,CAAI,aAAA,CAAc,IAAI,CAAA,EAAG;AACvC,IAAA,IAAI,CAAA,CAAE,SAAS,SAAA,EAAW;AAC1B,IAAA,KAAA,CAAM,EAAE,IAAI,CAAA,GAAI,QAAA,CAAS,CAAA,CAAE,OAAO,EAAE,CAAA;AAAA,EACtC;AACA,EAAA,OAAO,mBAAA,CAAoB,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAA,EAAO,MAAM,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,MAAM,CAAA;AACzF;AAGO,SAAS,qBAAA,CAAsB,MAAY,QAAA,EAA2B;AAC3E,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,IAAA,EAAM,QAAQ,CAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAA,GAAQ,CAAA,EAAG,KAAA,CAAM,GAAA,EAAK,KAAA,CAAM,IAAA,EAAM,MAAM,MAAM,CAAA;AACvF,EAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,KAAK,OAAA,EAAQ,GAAI,GAAK,CAAA,GAAI,GAAA;AACvD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAA,CAAO,KAAA,GAAQ,SAAA,IAAa,GAAK,CAAA;AAC/C;AAEA,SAAS,WAAA,CAAY,MAAc,KAAA,EAAuB;AACxD,EAAA,OAAO,IAAI,KAAK,IAAA,CAAK,GAAA,CAAI,MAAM,KAAA,EAAO,CAAC,CAAC,CAAA,CAAE,UAAA,EAAW;AACvD;AAOO,SAAS,gBAAA,CAAiB,KAAA,EAAe,KAAA,EAAe,GAAA,EAAa,GAAA,EAAsB;AAChG,EAAA,IAAI,KAAA,KAAU,KAAK,OAAO,IAAA;AAC1B,EAAA,IAAI,MAAM,QAAA,CAAS,GAAG,GAAG,OAAO,KAAA,CAAM,MAAM,GAAG,CAAA,CAAE,KAAK,CAAC,IAAA,KAAS,iBAAiB,IAAA,CAAK,IAAA,IAAQ,KAAA,EAAO,GAAA,EAAK,GAAG,CAAC,CAAA;AAC9G,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,IAAA,MAAM,CAAC,KAAA,EAAO,IAAI,CAAA,GAAI,KAAA,CAAM,MAAM,GAAG,CAAA;AACrC,IAAA,MAAM,OAAA,GAAU,QAAA,CAAS,IAAA,EAAM,EAAE,CAAA;AACjC,IAAA,IAAI,OAAO,KAAA,CAAM,OAAO,CAAA,IAAK,OAAA,IAAW,GAAG,OAAO,KAAA;AAClD,IAAA,IAAI,KAAA,KAAU,GAAA,EAAK,OAAO,KAAA,GAAQ,OAAA,KAAY,CAAA;AAC9C,IAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,MAAA,MAAM,CAACC,MAAAA,EAAO,GAAG,CAAA,GAAI,WAAW,KAAK,CAAA;AACrC,MAAA,IAAIA,MAAAA,KAAU,IAAA,IAAQ,GAAA,KAAQ,IAAA,EAAM,OAAO,KAAA;AAC3C,MAAA,OAAO,SAASA,MAAAA,IAAS,KAAA,IAAS,GAAA,IAAA,CAAQ,KAAA,GAAQA,UAAS,OAAA,KAAY,CAAA;AAAA,IACzE;AACA,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,EAAO,EAAE,CAAA;AAChC,IAAA,IAAI,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,EAAG,OAAO,KAAA;AAChC,IAAA,OAAO,SAAS,KAAA,IAAS,KAAA,IAAS,GAAA,IAAA,CAAQ,KAAA,GAAQ,SAAS,OAAA,KAAY,CAAA;AAAA,EACzE;AACA,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,GAAG,CAAA,EAAG;AACvB,IAAA,MAAM,CAAC,KAAA,EAAO,GAAG,CAAA,GAAI,WAAW,KAAK,CAAA;AACrC,IAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,GAAA,KAAQ,IAAA,EAAM,OAAO,KAAA;AAC3C,IAAA,OAAO,KAAA,IAAS,SAAS,KAAA,IAAS,GAAA;AAAA,EACpC;AACA,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,EAAO,EAAE,CAAA;AAC9B,EAAA,OAAO,CAAC,MAAA,CAAO,KAAA,CAAM,GAAG,KAAK,GAAA,KAAQ,KAAA;AACvC;AAEA,SAAS,WAAW,KAAA,EAA+C;AACjE,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,KAAA,CAAM,GAAG,CAAA;AAC7B,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,CAAC,MAAM,IAAI,CAAA;AAC1C,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,CAAC,GAAG,EAAE,CAAA;AACnC,EAAA,MAAM,GAAA,GAAM,QAAA,CAAS,KAAA,CAAM,CAAC,GAAG,EAAE,CAAA;AACjC,EAAA,OAAO,CAAC,MAAA,CAAO,KAAA,CAAM,KAAK,CAAA,GAAI,IAAA,GAAO,KAAA,EAAO,MAAA,CAAO,KAAA,CAAM,GAAG,CAAA,GAAI,IAAA,GAAO,GAAG,CAAA;AAC5E;AAGO,SAAS,WAAA,CAAY,YAAoB,KAAA,EAA2B;AACzE,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,IAAA,EAAK,CAAE,MAAM,KAAK,CAAA;AAC5C,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AAIhC,EAAA,OACE,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,QAAQ,CAAA,EAAG,EAAE,CAAA,IAC/C,gBAAA,CAAiB,MAAA,CAAO,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,EAAE,CAAA,IAC7C,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,GAAA,EAAK,CAAA,EAAG,EAAE,CAAA,IAC5C,iBAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,KAC7C,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,KAAA,CAAM,SAAS,CAAA,EAAG,CAAC,CAAA,IAAM,KAAA,CAAM,OAAA,KAAY,CAAA,IAAK,gBAAA,CAAiB,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,CAAA;AAEpH;AAGO,SAAS,WAAA,CAAY,MAAoB,KAAA,EAA2B;AACzE,EAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AACzC,EAAA,MAAM,MAAA,GAAS,KAAK,MAAA,IAAU,CAAA;AAC9B,EAAA,MAAM,IAAA,GAAO,KAAK,IAAA,IAAQ,CAAA;AAC1B,EAAA,QAAQ,KAAK,IAAA;AAAM,IACjB,KAAK,SAAA;AACH,MAAA,OAAO,KAAA,CAAM,SAAS,KAAA,KAAU,CAAA;AAAA,IAClC,KAAK,OAAA;AACH,MAAA,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,IAAU,KAAA,CAAM,OAAO,KAAA,KAAU,CAAA;AAAA,IAC3D,KAAK,MAAA;AACH,MAAA,OAAO,KAAA,CAAM,WAAW,MAAA,IAAU,KAAA,CAAM,SAAS,IAAA,IAAQ,KAAA,CAAM,WAAW,KAAA,KAAU,CAAA;AAAA,IACtF,KAAK,OAAA,EAAS;AAEZ,MAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAA,CAAO,KAAA,CAAM,QAAA,GAAW,KAAK,CAAC,CAAA;AACrD,MAAA,OACE,KAAA,CAAM,MAAA,KAAW,MAAA,IACjB,KAAA,CAAM,SAAS,IAAA,IAAA,CACd,IAAA,CAAK,QAAA,IAAY,IAAI,QAAA,CAAS,KAAA,CAAM,OAAO,CAAA,IAC5C,YAAY,KAAA,KAAU,CAAA;AAAA,IAE1B;AAAA,IACA,KAAK,QAAA,EAAU;AACb,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,UAAA,IAAc,CAAA,EAAG,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,KAAK,CAAC,CAAA;AAClF,MAAA,MAAM,UAAA,GAAa,KAAA,CAAM,IAAA,GAAO,EAAA,IAAM,MAAM,KAAA,GAAQ,CAAA,CAAA;AACpD,MAAA,OAAO,KAAA,CAAM,MAAA,KAAW,MAAA,IAAU,KAAA,CAAM,IAAA,KAAS,QAAQ,KAAA,CAAM,GAAA,KAAQ,MAAA,IAAU,UAAA,GAAa,KAAA,KAAU,CAAA;AAAA,IAC1G;AAAA,IACA,KAAK,MAAA;AACH,MAAA,OAAO,OAAO,IAAA,CAAK,IAAA,KAAS,YAAY,WAAA,CAAY,IAAA,CAAK,MAAM,KAAK,CAAA;AAAA;AAE1E;AAGO,SAAS,iBAAA,CAAkB,MAAoB,EAAA,EAAmB;AACvE,EAAA,IAAI,IAAA,CAAK,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AACpC,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,EAAA,EAAI,IAAA,CAAK,QAAQ,CAAA;AAC3C,EAAA,OAAO,IAAA,CAAK,MAAM,IAAA,CAAK,CAAC,SAAS,WAAA,CAAY,IAAA,EAAM,KAAK,CAAC,CAAA;AAC3D;AAOA,IAAM,iBAAiB,EAAA,GAAK,GAAA;AAQrB,SAAS,mBAAA,CAAoB,IAAA,EAAoB,IAAA,EAAY,KAAA,EAAa,GAAA,EAAqB;AACpG,EAAA,MAAM,MAAc,EAAC;AACrB,EAAA,IAAI,KAAK,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,GAAA,IAAO,GAAG,OAAO,GAAA;AAChD,EAAA,MAAM,QAAQ,IAAA,CAAK,KAAA;AACnB,EAAA,IAAI,IAAI,IAAA,CAAK,IAAA,CAAK,KAAK,OAAA,EAAQ,GAAI,GAAK,CAAA,GAAI,GAAA;AAC5C,EAAA,MAAM,GAAA,GAAM,MAAM,OAAA,EAAQ;AAC1B,EAAA,IAAI,IAAA,GAAO,EAAA;AACX,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,OAAA,GAAU,EAAA;AACd,EAAA,OAAO,CAAA,IAAK,GAAA,IAAO,GAAA,CAAI,MAAA,GAAS,GAAA,EAAK;AACnC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,CAAA,GAAI,cAAc,CAAA;AAC9C,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,IAAA,GAAO,QAAA;AACP,MAAA,MAAA,GAAS,sBAAsB,IAAI,IAAA,CAAK,CAAC,CAAA,EAAG,KAAK,QAAQ,CAAA;AAAA,IAC3D;AACA,IAAA,MAAM,OAAA,GAAU,IAAI,IAAA,CAAK,CAAA,GAAI,SAAS,GAAK,CAAA;AAC3C,IAAA,MAAM,KAAA,GAAQ,mBAAA;AAAA,MACZ,QAAQ,cAAA,EAAe;AAAA,MACvB,OAAA,CAAQ,aAAY,GAAI,CAAA;AAAA,MACxB,QAAQ,UAAA,EAAW;AAAA,MACnB,QAAQ,WAAA,EAAY;AAAA,MACpB,QAAQ,aAAA;AAAc,KACxB;AACA,IAAA,IAAI,KAAA,CAAM,KAAK,CAAC,IAAA,KAAS,YAAY,IAAA,EAAM,KAAK,CAAC,CAAA,EAAG;AAClD,MAAA,MAAM,GAAA,GAAM,eAAe,KAAK,CAAA;AAChC,MAAA,IAAI,QAAQ,OAAA,EAAS,GAAA,CAAI,KAAK,IAAI,IAAA,CAAK,CAAC,CAAC,CAAA;AACzC,MAAA,OAAA,GAAU,GAAA;AAAA,IACZ;AACA,IAAA,CAAA,IAAK,GAAA;AAAA,EACP;AACA,EAAA,OAAO,GAAA;AACT;AAEA,IAAM,MAAA,GAAS,KAAA;AAOR,SAAS,iBAAiB,KAAA,EAA4C;AAC3E,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,IAAA,CAAK,SAAS,CAAC,CAAA;AACzC,IAAA,MAAM,MAAA,GACJ,KAAK,IAAA,KAAS,MAAA,GAAS,QAAQ,MAAA,GAC7B,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,KAAA,GAAQ,CAAA,GAAI,SACpC,IAAA,CAAK,IAAA,KAAS,WAAW,KAAA,GAAQ,EAAA,GAAK,SACtC,IAAA,CAAK,IAAA,KAAS,MAAA,GAAS,GAAA,GAAM,MAAA,GAC7B,MAAA;AACJ,IAAA,IAAI,MAAA,GAAS,SAAS,OAAA,GAAU,MAAA;AAAA,EAClC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,GAAM,MAAA,EAAQ,IAAA,CAAK,GAAA,CAAI,EAAA,GAAK,MAAA,EAAQ,OAAA,GAAU,CAAA,GAAI,MAAM,CAAC,CAAA;AAC3E;AAOO,SAAS,gBAAA,CAAiB,MAAoB,IAAA,EAAY,KAAA,EAAe,YAAY,gBAAA,CAAiB,IAAA,CAAK,KAAK,CAAA,EAAW;AAChI,EAAA,OAAO,oBAAoB,IAAA,EAAM,IAAI,IAAA,CAAK,IAAA,CAAK,SAAQ,GAAI,CAAC,CAAA,EAAG,IAAI,KAAK,IAAA,CAAK,OAAA,EAAQ,GAAI,SAAS,GAAG,KAAK,CAAA;AAC5G;;;AChcO,IAAM,qBAAA,GAAwB;AAAA,EACnC,YAAA,EAAc,CAAC,CAAA,EAAG,IAAI,CAAA;AAAA,EACtB,WAAA,EAAa,CAAC,CAAA,EAAG,CAAC;AACpB;AAEO,IAAM,uBAAA,GAAyC,OAAO,MAAA,CAAO;AAAA,EAClE,YAAA,EAAc,EAAA;AAAA,EACd,WAAA,EAAa,CAAA;AAAA,EACb,cAAA,EAAgB;AAClB,CAAC;AAED,SAASC,KAAI,KAAA,EAA+B;AAC1C,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,MAAA,CAAO,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAChF,EAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,SAAA,CAAU,KAAK,KAAA,CAAM,IAAA,EAAM,CAAA,EAAG,OAAO,QAAA,CAAS,KAAA,CAAM,IAAA,IAAQ,EAAE,CAAA;AAC/F,EAAA,OAAO,IAAA;AACT;AAEA,SAASC,OAAM,KAAA,EAAsB,CAAC,EAAA,EAAI,EAAE,GAA8B,QAAA,EAA0B;AAClG,EAAA,IAAI,KAAA,KAAU,MAAM,OAAO,QAAA;AAC3B,EAAA,OAAO,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,CAAC,CAAA;AACzC;AAUO,SAAS,uBAAuB,GAAA,EAAoC;AACzE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,UAAU,OAAO,IAAA;AAC5C,EAAA,MAAM,CAAA,GAAI,GAAA;AACV,EAAA,OAAO;AAAA,IACL,YAAA,EAAcA,OAAMD,IAAAA,CAAI,CAAA,CAAE,YAAY,CAAA,EAAG,qBAAA,CAAsB,YAAA,EAAc,uBAAA,CAAwB,YAAY,CAAA;AAAA,IACjH,WAAA,EAAaC,OAAMD,IAAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG,qBAAA,CAAsB,WAAA,EAAa,uBAAA,CAAwB,WAAW,CAAA;AAAA;AAAA,IAE7G,cAAA,EAAgB,EAAE,cAAA,KAAmB;AAAA,GACvC;AACF;;;ACxDO,IAAM,mBAAA,GAAsB;AAe5B,SAAS,uBAAA,CAId,YAAA,EACA,KAAA,EACA,KAAA,EACA,aAAA,EACqB;AACrB,EAAA,MAAM,QAAkD,EAAC;AACzD,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,WAAW,YAAA,EAAc;AAClC,IAAA,IAAI,IAAA,CAAK,iBAAiB,mBAAA,EAAqB;AAC/C,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,KAAK,MAAM,CAAA;AAClD,IAAA,IAAI,CAAC,GAAA,EAAK;AAGV,IAAA,MAAM,MAAA,GAAS,aAAA,CAAc,GAAG,CAAA,EAAG,IAAA,EAAK;AACxC,IAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,KAAW,EAAA,EAAI;AAC3C,IAAA,MAAM,QAAS,GAAA,CAAI,IAAA,CAAK,KAAA,IAAoB,GAAA,CAAI,QAAQ,GAAA,CAAI,EAAA;AAC5D,IAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,MAAA,EAAQ,CAAA;AAAA,EAC9B;AAEA,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAoB;AACpC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAoB;AACvC,EAAA,KAAA,MAAW,EAAE,KAAA,EAAM,IAAK,KAAA,EAAO,MAAA,CAAO,GAAA,CAAI,KAAA,EAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AAC7E,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAoB;AACrC,EAAA,KAAA,MAAW,EAAE,KAAA,EAAO,MAAA,EAAO,IAAK,KAAA,EAAO;AACrC,IAAA,IAAI,GAAA,GAAM,KAAA;AACV,IAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,IAAK,KAAK,CAAA,EAAG;AAChC,MAAA,MAAM,CAAA,GAAA,CAAK,IAAA,CAAK,GAAA,CAAI,KAAK,KAAK,CAAA,IAAK,CAAA;AACnC,MAAA,IAAA,CAAK,GAAA,CAAI,OAAO,CAAC,CAAA;AACjB,MAAA,IAAI,IAAI,CAAA,EAAG,GAAA,GAAM,CAAA,EAAG,KAAK,KAAK,CAAC,CAAA,CAAA,CAAA;AAAA,IACjC;AACA,IAAA,GAAA,CAAI,GAAA,CAAI,KAAK,MAAM,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,GAAA;AACT;;;ACtDO,SAAS,2BACd,IAAA,EACsB;AACtB,EAAA,MAAM,UAAU,IAAA,CAAK,gBAAA;AAGrB,EAAA,IAAI,CAAC,OAAA,IAAW,OAAA,CAAQ,MAAA,KAAW,GAAG,OAAO,MAAA;AAC7C,EAAA,MAAM,UAAU,OAAA,CACb,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAA,IAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,EAChC,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AAC7B,EAAA,OAAO,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,OAAA,GAAU,MAAA;AACxC;AAMO,SAAS,2BACd,IAAA,EACsB;AACtB,EAAA,MAAM,UAAU,IAAA,CAAK,aAAA;AACrB,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,OAAO,KAAK,OAAA,CAAQ,MAAA,KAAW,GAAG,OAAO,MAAA;AAC5D,EAAA,OAAO,OAAA,CAAQ,GAAA;AAAA,IAAI,CAAC,SAClB,OAAO,IAAA,KAAS,WAAW,IAAA,GAAO,IAAA,CAAK,UAAU,IAAI;AAAA,GACvD;AACF;AASO,SAAS,2BAA2B,KAAA,EAA2B;AACpE,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA;AAC/B,EAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,EAAU,OAAO,KAAA;AACvC,EAAA,MAAM,OAAA,GAAU,OAAO,IAAA,EAAK;AAC5B,EAAA,IAAI,CAAC,OAAA,CAAQ,UAAA,CAAW,GAAG,GAAG,OAAO,KAAA;AACrC,EAAA,IAAI,MAAA;AACJ,EAAA,IAAI;AACF,IAAA,MAAA,GAAS,IAAA,CAAK,MAAM,OAAO,CAAA;AAAA,EAC7B,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AACA,EAAA,IAAI,CAAC,MAAM,OAAA,CAAQ,MAAM,KAAK,MAAA,CAAO,MAAA,KAAW,GAAG,OAAO,KAAA;AAC1D,EAAA,OAAO,MAAA,CAAO,GAAA;AAAA,IAAI,CAAC,OACjB,OAAO,EAAA,KAAO,WAAW,EAAA,GAAK,IAAA,CAAK,UAAU,EAAE;AAAA,GACjD;AACF;;;ACvDO,SAAS,cAAA,CACd,YACA,QAAA,EACoB;AACpB,EAAA,IAAI,CAAC,UAAA,IAAc,CAAC,QAAA,EAAU,OAAO,UAAA;AACrC,EAAA,IAAI,UAAA,CAAW,SAAS,IAAI,CAAA,SAAU,UAAA,CAAW,UAAA,CAAW,MAAM,QAAQ,CAAA;AAC1E,EAAA,OAAO,UAAA;AACT;;;ACiBO,SAAS,oBAAA,CACd,IAAA,EACA,YAAA,EACA,kBAAA,EACA,iBACA,kBAAA,EACyB;AACzB,EAAA,MAAM,KAAK,IAAA,CAAK,aAAA;AAChB,EAAA,MAAM,QAAA,GAAW,EAAE,GAAG,IAAA,EAAK;AAE3B,EAAA,KAAA,MAAW,SAAS,kBAAA,EAAoB;AACtC,IAAA,MAAM,KAAA,GAAQ,qBAAqB,KAAK,CAAA;AACxC,IAAA,MAAM,OAAoC,OAAO,KAAA,KAAU,WAAW,EAAE,YAAA,EAAc,OAAM,GAAI,KAAA;AAChG,IAAA,MAAM,YAAA,GAAe,IAAA,EAAM,YAAA,IAAgB,EAAA,GAAK,KAAK,CAAA,EAAG,YAAA;AAExD,IAAA,IAAI,YAAA,EAAc;AAChB,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,YAAA,EAAc,IAAA,EAAM,YAAY,CAAA;AAC/D,MAAA,IAAI,MAAA,IAAU,IAAA,EAAM,QAAA,CAAS,KAAK,CAAA,GAAI,MAAA;AAAA,IACxC,CAAA,MAAO;AACL,MAAA,MAAM,OAAA,GAAU,SAAS,KAAK,CAAA;AAC9B,MAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,QAAA,MAAM,QAAA,GAAW,cAAA,CAAe,OAAA,EAAS,YAAY,CAAA;AACrD,QAAA,IAAI,QAAA,KAAa,OAAA,EAAS,QAAA,CAAS,KAAK,CAAA,GAAI,QAAA;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,QAAA;AACT;AAQA,IAAM,gBAAA,GAAmB;AAAA,EACvB,WAAA;AAAA,EACA,SAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,UAAA;AAAA,EACA;AACF,CAAA;AAwBO,SAAS,sBACd,GAAA,EACsB;AACtB,EAAA,MAAM,MAA4B,EAAC;AAEnC,EAAA,IAAI,OAAO,GAAA,CAAI,cAAA,KAAmB,YAAY,GAAA,CAAI,cAAA,CAAe,SAAS,CAAA,EAAG;AAC3E,IAAA,GAAA,CAAI,IAAA,CAAK;AAAA,MACP,GAAA,EAAK,gBAAA;AAAA,MACL,KAAA,EAAO,YAAA;AAAA,MACP,KAAK,GAAA,CAAI;AAAA,KACV,CAAA;AAAA,EACH;AAEA,EAAA,KAAA,MAAW,UAAU,gBAAA,EAAkB;AACrC,IAAA,MAAM,GAAA,GAAM,IAAI,MAAM,CAAA;AACtB,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AACzB,IAAA,GAAA,CAAI,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM;AACvB,MAAA,IAAI,CAAC,IAAA,IAAQ,OAAO,IAAA,KAAS,QAAA,EAAU;AACvC,MAAA,MAAM,OAAA,GAAU,IAAA;AAChB,MAAA,IAAI,OAAO,OAAA,CAAQ,GAAA,KAAQ,YAAY,OAAA,CAAQ,GAAA,CAAI,WAAW,CAAA,EAAG;AACjE,MAAA,MAAM,OAAO,OAAO,OAAA,CAAQ,IAAA,KAAS,QAAA,GAAW,QAAQ,IAAA,GAAO,EAAA;AAC/D,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,GAAA,EAAK,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,CAAA;AAAA,QACnB,KAAA,EAAO,CAAA,EAAG,MAAM,CAAA,GAAA,EAAM,IAAI,CAAA,CAAA;AAAA,QAC1B,KAAK,OAAA,CAAQ;AAAA,OACd,CAAA;AAAA,IACH,CAAC,CAAA;AAAA,EACH;AAEA,EAAA,OAAO,GAAA;AACT;;;ACtGA,SAAS,UAAU,IAAA,EAA2B;AAC5C,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,EAAG,IAAA,EAAM,CAAC,CAAA;AAClD;AAEO,SAAS,iCAAA,CAGd,IAAA,EAAS,KAAA,EAAyB,KAAA,EAA4B;AAC9D,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,IAAI,OAAA,GAAU,IAAA;AACd,EAAA,OAAO,IAAA,EAAM;AACX,IAAA,MAAM,GAAA,GAAM,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,QAAQ,MAAM,CAAA;AACrD,IAAA,IAAI,CAAC,GAAA,IAAO,GAAA,CAAI,IAAA,KAAS,QAAQ,OAAO,OAAA;AACxC,IAAA,IAAI,OAAA,CAAQ,GAAA,CAAI,GAAA,CAAI,EAAE,GAAG,OAAO,OAAA;AAChC,IAAA,OAAA,CAAQ,GAAA,CAAI,IAAI,EAAE,CAAA;AAClB,IAAA,MAAM,IAAA,GAAQ,GAAA,CAAI,IAAA,CAAK,IAAA,IAAmC,EAAC;AAC3D,IAAA,IAAI,SAAA,CAAU,IAAI,CAAA,EAAG,OAAO,OAAA;AAC5B,IAAA,MAAM,SAAS,KAAA,CAAM,IAAA;AAAA,MACnB,CAAC,CAAA,KAAM,CAAA,CAAE,WAAW,GAAA,CAAI,EAAA,IAAM,EAAE,YAAA,KAAiB;AAAA,KACnD;AACA,IAAA,IAAI,CAAC,QAAQ,OAAO,OAAA;AACpB,IAAA,OAAA,GAAU,MAAA;AAAA,EACZ;AACF;;;AC5BA,IAAM,QAAA,GAAW,CAAC,CAAA,KAA4B,OAAO,CAAA,KAAM,YAAY,MAAA,CAAO,QAAA,CAAS,CAAC,CAAA,IAAK,CAAA,GAAI,CAAA;AAE1F,SAAS,kBAAkB,IAAA,EAA+E;AAC/G,EAAA,IAAI,CAAC,MAAM,OAAO,MAAA;AAClB,EAAA,MAAM,OAAA,GAAU,MAAM,OAAA,CAAQ,IAAA,CAAK,gBAAgB,CAAA,GAAK,IAAA,CAAK,mBAA6D,EAAC;AAC3H,EAAA,MAAM,QAAQ,OAAO,IAAA,CAAK,iBAAA,KAAsB,QAAA,GAAW,KAAK,iBAAA,GAAoB,CAAA;AACpF,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAK,CAAA,IAAK,QAAQ,CAAC,CAAA;AACzC,EAAA,IAAI,SAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,IAAK,SAAS,KAAA,CAAM,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,KAAA,EAAO,MAAA,EAAQ,MAAM,MAAA,EAAO;AAChH,EAAA,IAAI,QAAA,CAAS,IAAA,CAAK,KAAK,CAAA,IAAK,SAAS,IAAA,CAAK,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,MAAA,EAAQ,KAAK,MAAA,EAAO;AACnG,EAAA,OAAO,MAAA;AACT;AAEO,SAAS,cAAA,CACd,MAAA,EACA,KAAA,EACA,KAAA,EAC6B;AAC7B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,IAAA,CAAK,WAAW,MAAA,IAAU,CAAC,KAAK,MAAA,IAAA,CAAW,IAAA,CAAK,YAAA,IAAgB,OAAA,MAAa,OAAA,EAAS;AAC1F,IAAA,MAAM,IAAA,GAAO,iBAAA,CAAkB,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,MAAM,CAAA,EAAG,IAAI,CAAA;AAC5E,IAAA,IAAI,MAAM,OAAO,IAAA;AAAA,EACnB;AACA,EAAA,OAAO,MAAA;AACT;AAGO,SAAS,YAAA,CACd,MAAA,EACA,IAAA,EACA,KAAA,EACS;AACT,EAAA,IAAI,OAAO,MAAM,OAAA,KAAY,QAAA,IAAY,KAAK,OAAA,CAAQ,MAAA,GAAS,GAAG,OAAO,IAAA;AACzE,EAAA,OAAA,CAAQ,KAAA,IAAS,EAAC,EAAG,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,KAAW,MAAA,IAAU,CAAA,CAAE,YAAA,KAAiB,MAAM,CAAA;AACnF;;;ACtCO,SAAS,cAAc,KAAA,EAAuD;AACnF,EAAA,MAAM,WAAW,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACjD,EAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACnC,EAAA,IAAI,QAAA,CAAS,WAAW,CAAA,EAAG,OAAO,CAAC,GAAG,QAAA,CAAS,CAAC,CAAC,CAAA;AAEjD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,GAAG,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,CAAC,CAAA;AACxD,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,EAAQ,CAAA,EAAA,EAAK;AAC/B,IAAA,MAAM,SAAkC,EAAC;AACzC,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC3B,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA;AACjC,MAAA,QAAA,CAAS,KAAK,IAAI,CAAA;AAClB,MAAA,MAAM,MAAA,GAAS,aAAa,IAAI,CAAA;AAChC,MAAA,IAAI,MAAA,IAAU,OAAO,MAAA,KAAW,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AAClE,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA,MAAA,CAAO,MAAA,CAAO,QAAQ,MAAiC,CAAA;AAAA,MACzD;AAAA,IACF;AACA,IAAA,GAAA,CAAI,IAAA,CAAK,YAAY,IAAA,CAAK,SAAA,CAAU,MAAM,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAAA,EACjE;AACA,EAAA,OAAO,GAAA;AACT;;;AC0IA,IAAM,yBAAA,mBAA4B,IAAI,GAAA,CAAY,CAAC,OAAO,CAAC,CAAA;AAW3D,IAAM,gBAAA,GAAsC;AAAA,EAC1C,GAAG,CAAC,GAAG,mBAAmB,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,yBAAA,CAA0B,GAAA,CAAI,CAAC,CAAC,CAAA;AAAA,EAC3E;AACF,CAAA;AAGA,IAAM,iBAAA,GAA8C;AAAA;AAAA;AAAA;AAAA,EAIlD,kBAAA,EAAoB,CAAC,QAAQ,CAAA;AAAA;AAAA,EAE7B,0BAAA,EAA4B,CAAC,UAAU,CAAA;AAAA,EACvC,WAAW,CAAC,aAAA,EAAe,OAAA,EAAS,oBAAA,EAAsB,UAAU,kBAAkB,CAAA;AAAA,EACtF,MAAA,EAAQ,CAAC,QAAA,EAAU,WAAA,EAAa,cAAc,kBAAkB,CAAA;AAAA,EAChE,QAAA,EAAU,CAAC,QAAA,EAAU,OAAA,EAAS,cAAc,kBAAkB,CAAA;AAAA,EAC9D,QAAA,EAAU;AAAA,IACR,WAAA;AAAA,IACA,SAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,SAAA;AAAA,IACA,mBAAA;AAAA,IACA,kBAAA;AAAA,IACA,iBAAA;AAAA,IACA;AAAA,GACF;AAAA;AAAA;AAAA;AAAA,EAIA,IAAA,EAAM,CAAC,UAAA,EAAY,aAAA,EAAe,kBAAkB,CAAA;AAAA;AAAA;AAAA;AAAA,EAIpD,cAAA,EAAgB,CAAC,sBAAsB;AACzC,CAAA;AAWA,IAAM,kBAAA,GAAwD;AAAA,EAC5D,gBAAA,EAAkB,CAAC,cAAc,CAAA;AAAA;AAAA;AAAA,EAGjC,0BAAA,EAA4B,CAAC,WAAA,EAAa,SAAA,EAAW,cAAc,WAAW,CAAA;AAAA;AAAA,EAE9E,uBAAA,EAAyB,CAAC,WAAA,EAAa,cAAc,CAAA;AAAA,EACrD,GAAG,MAAA,CAAO,WAAA,CAAY,CAAC,GAAG,sBAAsB,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,IAAA,EAAM,CAAC,cAAc,CAAC,CAAC,CAAC;AAC3F,CAAA;AAGO,SAAS,iBAAiB,KAAA,EAAqC;AACpE,EAAA,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AACzB,IAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,IAAA,CAAK,IAAI,CAAA;AAC3C,IAAA,IAAI,CAAC,MAAA,IAAU,CAAC,IAAA,CAAK,MAAM,OAAO,IAAA;AAClC,IAAA,MAAM,IAAA,GAAO,EAAE,GAAI,IAAA,CAAK,IAAA,EAAiC;AACzD,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,IAAI,SAAS,IAAA,EAAM;AACjB,QAAA,OAAO,KAAK,KAAK,CAAA;AACjB,QAAA,OAAA,GAAU,IAAA;AAAA,MACZ;AAAA,IACF;AACA,IAAA,OAAO,OAAA,GAAU,EAAE,GAAG,IAAA,EAAM,MAAK,GAAI,IAAA;AAAA,EACvC,CAAC,CAAA;AACH;AAGO,SAAS,mBAAmB,KAAA,EAAqC;AACtE,EAAA,OAAO,gBAAA,CAAiB,KAAK,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS;AAC3C,IAAA,MAAM,IAAA,GAAO,EAAE,GAAI,IAAA,CAAK,IAAA,EAAiC;AACzD,IAAA,KAAA,MAAW,KAAA,IAAS,gBAAA,EAAkB,OAAO,IAAA,CAAK,KAAK,CAAA;AAEvD,IAAA,KAAA,MAAW,KAAA,IAAS,8BAA8B,IAAA,CAAK,IAAI,KAAK,EAAC,EAAG,OAAO,IAAA,CAAK,KAAK,CAAA;AACrF,IAAA,MAAM,MAAA,GAAS,iBAAA,CAAkB,IAAA,CAAK,IAAI,KAAK,EAAC;AAChD,IAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,OAAO,IAAA,CAAK,KAAK,CAAA;AAG7C,IAAA,MAAM,aAAa,IAAA,CAAK,aAAA;AACxB,IAAA,IAAI,UAAA,IAAc,OAAO,UAAA,KAAe,QAAA,IAAY,WAAW,UAAA,EAAY;AACzE,MAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAQ,GAAG,MAAK,GAAI,UAAA;AACnC,MAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AAAA,IACvB;AACA,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAK;AAAA,EACzB,CAAC,CAAA;AACH;;;ACjQO,SAAS,0BACd,KAAA,EACkB;AAClB,EAAA,MAAM,SAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,oBAAoB,CAAA;AACnE,EAAA,MAAM,UAAU,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,qBAAqB,CAAA;AAEpE,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,IAAK,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,EAAE,EAAA,EAAI,IAAA,EAAK;AAEnE,EAAA,MAAM,SAA4B,EAAC;AAGnC,EAAA,MAAM,YAAA,GAAe,CAAC,IAAA,KAAkC;AACtD,IAAA,MAAM,GAAA,uBAAU,GAAA,EAA4B;AAC5C,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,MAAM,CAAA,GAAI,EAAE,IAAA,CAAK,OAAA;AACjB,MAAA,IAAI,CAAC,CAAA,EAAG;AACR,MAAA,MAAM,MAAA,GAAS,GAAA,CAAI,GAAA,CAAI,CAAC,KAAK,EAAC;AAC9B,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AACb,MAAA,GAAA,CAAI,GAAA,CAAI,GAAG,MAAM,CAAA;AAAA,IACnB;AACA,IAAA,OAAO,GAAA;AAAA,EACT,CAAA;AACA,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,YAAA,CAAa,MAAM,CAAA,EAAG;AACnD,IAAA,IAAI,MAAM,MAAA,GAAS,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,EAAE,GAAG,CAAA;AAAA,EAC5G;AACA,EAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,YAAA,CAAa,OAAO,CAAA,EAAG;AACpD,IAAA,IAAI,MAAM,MAAA,GAAS,CAAA,EAAG,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,OAAA,EAAS,OAAA,EAAS,MAAM,GAAA,CAAI,CAAC,MAAM,CAAA,CAAE,EAAE,GAAG,CAAA;AAAA,EAC5G;AAGA,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,OAAA,EAAS,CAAC,CAAU,CAAC,CAAA;AAC9E,EAAA,KAAA,MAAW,aAAa,MAAA,EAAQ;AAC9B,IAAA,MAAM,OAAA,GAAU,UAAU,IAAA,CAAK,OAAA;AAC/B,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,MAAM,cAAA,GAAiB,aAAA,CAAc,GAAA,CAAI,OAAO,CAAA;AAChD,IAAA,IAAI,CAAC,cAAA,EAAgB;AACnB,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,0BAAA,EAA4B,SAAS,WAAA,EAAa,SAAA,CAAU,IAAI,CAAA;AACpF,MAAA;AAAA,IACF;AACA,IAAA,IAAI,CAAC,eAAe,IAAA,CAAK,KAAA,IAAS,eAAe,IAAA,CAAK,KAAA,CAAM,WAAW,CAAA,EAAG;AACxE,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,2BAAA,EAA6B,SAAS,YAAA,EAAc,cAAA,CAAe,IAAI,CAAA;AAAA,IAC7F;AAAA,EACF;AAGA,EAAA,MAAM,YAAA,GAAe,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,IAAA,CAAK,OAAA,EAAS,CAAC,CAAU,CAAC,CAAA;AAC5E,EAAA,KAAA,MAAW,cAAc,OAAA,EAAS;AAChC,IAAA,MAAM,OAAA,GAAU,WAAW,IAAA,CAAK,OAAA;AAChC,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,IAAI,CAAC,YAAA,CAAa,GAAA,CAAI,OAAO,CAAA,EAAG;AAC9B,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,yBAAA,EAA2B,SAAS,YAAA,EAAc,UAAA,CAAW,IAAI,CAAA;AAAA,IACvF;AAAA,EACF;AAEA,EAAA,OAAO,MAAA,CAAO,MAAA,KAAW,CAAA,GAAI,EAAE,EAAA,EAAI,MAAK,GAAI,EAAE,EAAA,EAAI,KAAA,EAAO,MAAA,EAAO;AAClE;AC7CA,IAAM,sBAAA,GAAyB;AAAA,EAC7B,EAAA,EAAI,eAAA;AAAA,EACJ,KAAA,EAAO,mBAAA;AAAA,EACP,WAAA,EAAa,kEAAA;AAAA,EACb,YAAA,EAAc,EAAE,MAAA,CAAO;AAAA;AAAA;AAAA;AAAA;AAAA,IAKrB,QAAA,EAAU,EAAE,MAAA,EAAO,CAAE,IAAI,CAAA,EAAG,0BAA0B,CAAA,CAAE,OAAA,CAAQ,kCAAkC,CAAA;AAAA,IAClG,SAAA,EAAW,EAAE,IAAA,CAAK,CAAC,QAAQ,WAAW,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMvD,QAAA,EAAU,CAAA,CAAE,MAAA,EAAO,CAAE,QAAA;AAAS,GAC/B,CAAA;AAAA,EACD,aAAA,EAAe,EAAE,QAAA,EAAU,kCAAA,EAAoC,WAAW,MAAA,EAAgB;AAAA,EAC1F,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe,sBAAA;AAAA,EACf,OAAA,EAAS;AACX,CAAA;AAEA,IAAM,eAAA,GAAkB;AAAA,EACtB,EAAA,EAAI,QAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,4FAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,SAAA,EAAW,CAAA,CAAE,MAAA,EAAO,CAAE,OAAA,CAAQ,MAAM,CAAA,EAAG,CAAA;AAAA,EAChE,aAAA,EAAe,EAAE,SAAA,EAAW,MAAA,EAAO;AAAA,EACnC,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,wBAAA,GAA2B;AAAA,EAC/B,EAAA,EAAI,iBAAA;AAAA,EACJ,KAAA,EAAO,wBAAA;AAAA,EACP,WAAA,EAAa,mEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;AAAA,EACzB,eAAe,EAAC;AAAA,EAChB,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,cAAA,GAAiB;AAAA,EACrB,EAAA,EAAI,OAAA;AAAA,EACJ,KAAA,EAAO,YAAA;AAAA,EACP,WAAA,EAAa,sCAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,CAAA;AAAA,EACzB,eAAe,EAAC;AAAA,EAChB,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,aAAA,GAAgB;AAAA,EACpB,EAAA,EAAI,MAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,qEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,aAAA,EAAe,CAAA,CAAE,OAAA,EAAQ,CAAE,OAAA,CAAQ,KAAK,CAAA,EAAG,CAAA;AAAA,EACpE,aAAA,EAAe,EAAE,aAAA,EAAe,KAAA,EAAM;AAAA,EACtC,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAEA,IAAM,mBAAA,GAAsB;AAAA,EAC1B,EAAA,EAAI,YAAA;AAAA,EACJ,KAAA,EAAO,oBAAA;AAAA,EACP,WAAA,EAAa,gEAAA;AAAA,EACb,YAAA,EAAc,CAAA,CAAE,MAAA,CAAO,EAAE,UAAU,CAAA,CAAE,IAAA,CAAK,CAAC,MAAA,EAAQ,SAAS,CAAC,CAAA,CAAE,OAAA,CAAQ,MAAM,GAAG,CAAA;AAAA,EAChF,aAAA,EAAe,EAAE,QAAA,EAAU,MAAA,EAAgB;AAAA,EAC3C,UAAA,EAAY,MAAA;AAAA,EACZ,aAAA,EAAe;AACjB,CAAA;AAeO,IAAM,iBAAA,GAAoB;AAAA,EAC/B,sBAAA;AAAA,EACA,eAAA;AAAA,EACA,wBAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF;AAEO,IAAM,sBAAsB,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE;AAIpE,IAAM,KAAA,GAAQ,IAAI,GAAA,CAA4B,iBAAA,CAAkB,GAAA,CAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAE9E,SAAS,YAAY,EAAA,EAAsC;AAChE,EAAA,MAAM,CAAA,GAAI,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AACtB,EAAA,IAAI,CAAC,CAAA,EAAG,MAAM,IAAI,KAAA,CAAM,CAAA,yBAAA,EAA4B,EAAE,CAAA,CAAE,CAAA;AACxD,EAAA,OAAO,CAAA;AACT;;;ACxHA,SAAS,uBAAA,CAAwB,CAAA,EAAW,CAAA,EAAW,CAAA,EAAoB;AACzE,EAAA,IAAI,CAAA,KAAM,GAAG,OAAO,IAAA;AACpB,EAAA,IAAI,CAAA,KAAM,KAAK,OAAO,IAAA;AACtB,EAAA,IAAI,CAAA,KAAM,IAAI,OAAO,IAAA;AACrB,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,IAAK,EAAA,IAAM,CAAA,IAAK,IAAI,OAAO,IAAA;AAC5C,EAAA,IAAI,CAAA,KAAM,GAAA,IAAO,CAAA,KAAM,GAAA,EAAK,OAAO,IAAA;AACnC,EAAA,IAAI,CAAA,KAAM,GAAA,IAAO,CAAA,KAAM,GAAA,EAAK,OAAO,IAAA;AACnC,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,IAAK,EAAA,IAAM,CAAA,IAAK,KAAK,OAAO,IAAA;AAC7C,EAAA,IAAI,MAAM,GAAA,KAAQ,CAAA,KAAM,EAAA,IAAM,CAAA,KAAM,KAAK,OAAO,IAAA;AAChD,EAAA,IAAI,MAAM,GAAA,IAAO,CAAA,KAAM,CAAA,IAAK,CAAA,KAAM,GAAG,OAAO,IAAA;AAC5C,EAAA,IAAI,CAAA,IAAK,KAAK,OAAO,IAAA;AACrB,EAAA,OAAO,KAAA;AACT;AAGA,SAAS,qBAAA,CAAsB,IAAY,EAAA,EAAqB;AAC9D,EAAA,OAAO,wBAAwB,EAAA,IAAM,CAAA,EAAG,EAAA,GAAK,GAAA,EAAM,MAAM,CAAC,CAAA;AAC5D;AAOA,SAAS,WAAW,EAAA,EAA6B;AAC/C,EAAA,IAAI,IAAA,GAAO,GAAG,WAAA,EAAY;AAC1B,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC7B,EAAA,IAAI,QAAQ,CAAA,EAAG,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,GAAG,IAAI,CAAA;AACxC,EAAA,IAAI,CAAC,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,IAAK,CAAC,eAAA,CAAgB,IAAA,CAAK,IAAI,CAAA,EAAG,OAAO,IAAA;AAE/D,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,WAAA,CAAY,GAAG,CAAA;AACtC,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,SAAA,GAAY,CAAC,CAAA;AACrC,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,GAAG,CAAA,EAAG;AACtB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,IAAA,IAAI,MAAM,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,WAAA,CAAY,IAAA,CAAK,CAAC,CAAA,IAAK,MAAA,CAAO,CAAC,CAAA,GAAI,GAAG,GAAG,OAAO,IAAA;AAC7F,IAAA,MAAM,CAAC,GAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,GAAI,KAAA,CAAM,IAAI,MAAM,CAAA;AACrC,IAAA,IAAA,GAAO,CAAA,EAAG,KAAK,KAAA,CAAM,CAAA,EAAG,YAAY,CAAC,CAAC,IAAK,CAAA,IAAK,CAAA,GAAK,GAAG,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA,EAAA,CAAM,CAAA,IAAK,IAAK,CAAA,EAAG,QAAA,CAAS,EAAE,CAAC,CAAA,CAAA;AAAA,EACrG;AAEA,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC9B,EAAA,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,OAAO,IAAA;AAC9B,EAAA,MAAM,QAAA,GAAW,CAAC,IAAA,KAAkB,IAAA,KAAS,KAAK,EAAC,GAAI,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AACrE,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,MAAA,CAAO,CAAC,KAAK,EAAE,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,MAAA,KAAW,CAAA,GAAI,QAAA,CAAS,OAAO,CAAC,CAAA,IAAK,EAAE,CAAA,GAAI,EAAC;AAChE,EAAA,IAAI,CAAC,GAAG,IAAA,EAAM,GAAG,IAAI,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAC,iBAAA,CAAkB,IAAA,CAAK,CAAC,CAAC,GAAG,OAAO,IAAA;AACvE,EAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,MAAA,KAAW,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM,QAAA,CAAS,CAAA,EAAG,EAAE,CAAC,CAAA,GAAI,IAAA;AAAA,EAChE;AACA,EAAA,MAAM,OAAA,GAAU,CAAA,GAAI,IAAA,CAAK,MAAA,GAAS,IAAA,CAAK,MAAA;AACvC,EAAA,IAAI,OAAA,GAAU,GAAG,OAAO,IAAA;AACxB,EAAA,OAAO,CAAC,GAAG,IAAA,EAAM,GAAG,KAAA,CAAc,OAAO,EAAE,IAAA,CAAK,GAAG,GAAG,GAAG,IAAI,EAAE,GAAA,CAAI,CAAC,MAAM,QAAA,CAAS,CAAA,EAAG,EAAE,CAAC,CAAA;AAC3F;AAEA,SAAS,wBAAwB,CAAA,EAAsB;AACrD,EAAA,MAAM,WAAA,GAAc,CAAC,CAAA,KAAc,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,KAAM,CAAC,CAAA;AACrE,EAAA,MAAM,CAAC,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,KAAK,CAAA,EAAG,EAAA,GAAK,CAAA,IAAK,KAAK,CAAA,EAAG,EAAA,GAAK,CAAA,EAAG,EAAA,GAAK,CAAC,CAAA,GAAI,CAAA;AACnE,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,EAAG,OAAO,IAAA;AAC3B,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,IAAK,EAAA,KAAO,GAAG,OAAO,IAAA;AACvC,EAAA,IAAI,WAAA,CAAY,CAAC,CAAA,IAAK,EAAA,KAAO,OAAQ,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACxE,EAAA,IAAI,YAAY,CAAC,CAAA,EAAG,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACvD,EAAA,IAAI,EAAA,KAAO,GAAA,IAAQ,EAAA,KAAO,KAAA,IAAU,EAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM,CAAA,KAAM,CAAC,CAAA,EAAG;AACvE,IAAA,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AAAA,EACrC;AACA,EAAA,IAAI,OAAO,GAAA,IAAQ,EAAA,KAAO,KAAA,IAAU,EAAA,KAAO,GAAG,OAAO,IAAA;AACrD,EAAA,IAAI,EAAA,KAAO,IAAA,EAAQ,OAAO,qBAAA,CAAsB,IAAI,EAAE,CAAA;AACtD,EAAA,IAAI,EAAA,KAAO,IAAA,IAAU,EAAA,KAAO,CAAA,EAAG,OAAO,IAAA;AACtC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,IAAA,CAAK,EAAA,GAAK,KAAA,MAAY,KAAA,EAAQ,OAAO,IAAA;AACrC,EAAA,OAAO,KAAA;AACT;AAWO,SAAS,sBAAsB,EAAA,EAAqB;AACzD,EAAA,MAAM,EAAA,GAAK,EAAA,CAAG,KAAA,CAAM,8CAA8C,CAAA;AAClE,EAAA,IAAI,EAAA,EAAI;AACN,IAAA,OAAO,uBAAA,CAAwB,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAA,EAAG,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAA,EAAG,MAAA,CAAO,EAAA,CAAG,CAAC,CAAC,CAAC,CAAA;AAAA,EAC5E;AACA,EAAA,IAAI,CAAC,EAAA,CAAG,QAAA,CAAS,GAAG,GAAG,OAAO,KAAA;AAC9B,EAAA,MAAM,MAAA,GAAS,WAAW,EAAE,CAAA;AAC5B,EAAA,OAAO,MAAA,KAAW,IAAA,GAAO,IAAA,GAAO,uBAAA,CAAwB,MAAM,CAAA;AAChE;AAQO,SAAS,yBAAyB,QAAA,EAA2B;AAClE,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,WAAA,EAAY,CAAE,OAAA,CAAQ,YAAY,EAAE,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAA;AAC7E,EAAA,IAAI,SAAS,WAAA,IAAe,IAAA,CAAK,QAAA,CAAS,YAAY,GAAG,OAAO,IAAA;AAChE,EAAA,OAAO,sBAAsB,IAAI,CAAA;AACnC;;;AC5DO,IAAM,+CACX,IAAI,GAAA,CAAyB,CAAC,WAAA,EAAa,QAAQ,CAAC;AAG/C,SAAS,wBAAwB,MAAA,EAAqC;AAC3E,EAAA,OACE,MAAA,KAAW,MAAA,IACX,4BAAA,CAA6B,GAAA,CAAI,MAA6B,CAAA;AAElE;;;ACpDA,IAAM,WAAA,GAA8B,aAAA;AAG7B,SAAS,qBAAqB,UAAA,EAAgF;AACnH,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,MAAW,SAAS,MAAA,CAAO,MAAA,CAAO,UAAA,IAAc,EAAE,CAAA,EAAG;AACnD,IAAA,IAAI,SAAS,KAAA,CAAM,MAAA,KAAW,aAAa,KAAA,CAAM,UAAA,KAAe,aAAa,KAAA,IAAS,CAAA;AAAA,EACxF;AACA,EAAA,OAAO,KAAA;AACT;AAQO,SAAS,gBAAA,CACd,QACA,UAAA,EAC8B;AAC9B,EAAA,IAAI,MAAA,KAAW,aAAa,OAAO,MAAA;AACnC,EAAA,OAAO,oBAAA,CAAqB,UAAU,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AAChE","file":"chunk-TAPBDT47.js","sourcesContent":["/**\n * Utilities for detecting and filtering expanded loop clones.\n * Shared between frontend (store, persistence, execution) and backend (orchestrator).\n */\n\nimport type { GenericNode, GenericEdge } from \"./types.js\"\n\n/** Matches node IDs like `node_7_iter_0`, `node_7_iter_1`, etc. */\nexport const ITER_CLONE_PATTERN = /_iter_\\d+$/\n\n/** Returns true if the node is an expanded loop clone (by flag or ID pattern). */\nexport function isExpandedClone(node: GenericNode): boolean {\n return !!(node.data as Record<string, unknown>).__expandedClone || ITER_CLONE_PATTERN.test(node.id)\n}\n\n/**\n * Filter out expanded clone nodes and edges that reference them.\n * Unhides original nodes that were hidden during loop expansion.\n * Optionally filters sub-workflow nodes (prefix `__sub_`).\n */\nexport function filterCloneNodes<N extends GenericNode, E extends GenericEdge>(\n nodes: N[],\n edges: E[],\n options?: { filterSubWorkflow?: boolean },\n): { nodes: N[]; edges: E[] } {\n const filterSub = options?.filterSubWorkflow ?? false\n\n const cloneIds = new Set(\n nodes.filter((n) => isExpandedClone(n)).map((n) => n.id),\n )\n\n const filteredNodes = nodes\n .filter((n) => {\n if (cloneIds.has(n.id)) return false\n if (filterSub && n.id.startsWith(\"__sub_\")) return false\n return true\n })\n .map((n) => (n.hidden ? { ...n, hidden: false } as N : n))\n\n const filteredEdges = edges.filter((e) => {\n if (filterSub && (e as { id?: string }).id?.startsWith(\"__sub_\")) return false\n return !cloneIds.has(e.source) && !cloneIds.has(e.target)\n })\n\n return { nodes: filteredNodes, edges: filteredEdges }\n}\n","import type { OutputType } from \"./presentation-utils.js\"\n\n// Intentional subset of OutputType (presentation-utils.ts:152) —\n// excludes \"data\" (multi-output / opaque types are skipped from aggregation).\nexport type AggregateableType = \"text\" | \"image\" | \"video\" | \"audio\"\n\n// Stable ordered tuple of aggregateable types — used for handle ordering + presentTypes.\nexport const AGGREGATEABLE_TYPES = [\"text\", \"image\", \"video\", \"audio\"] as const\n\nexport interface Member {\n nodeId: string\n type: AggregateableType\n value: string\n}\n\nexport interface AggregationBuckets {\n text: string[]\n image: string[]\n video: string[]\n audio: string[]\n}\n\nexport function aggregateByType(members: Member[]): AggregationBuckets {\n const buckets: AggregationBuckets = { text: [], image: [], video: [], audio: [] }\n for (const m of members) buckets[m.type].push(m.value)\n return buckets\n}\n\nexport function presentTypes(buckets: AggregationBuckets): AggregateableType[] {\n return AGGREGATEABLE_TYPES.filter((t) => buckets[t].length > 0)\n}\n\n// Type guard for narrowing OutputType to AggregateableType.\nexport function isAggregateableType(t: OutputType | undefined): t is AggregateableType {\n return t === \"text\" || t === \"image\" || t === \"video\" || t === \"audio\"\n}\n\n// Handle id naming conventions for Group / Collect dynamic output handles + Collect's single input handle.\nexport const GROUP_HANDLE_PREFIX = \"out-\" as const\nexport const COLLECT_IN_HANDLE = \"in\" as const\n\nexport function groupHandleId(t: AggregateableType): string {\n return `${GROUP_HANDLE_PREFIX}${t}`\n}\n\nexport function parseGroupHandle(h: string | null | undefined): AggregateableType | undefined {\n if (!h || !h.startsWith(GROUP_HANDLE_PREFIX)) return undefined\n const candidate = h.slice(GROUP_HANDLE_PREFIX.length) as OutputType\n return isAggregateableType(candidate) ? candidate : undefined\n}\n\n/**\n * Build a parent → children-ids map from a flat node array in a single pass.\n * Used by both engines' `buildExecutionLevels` to derive the implicit\n * child → group dependency edges in O(N+G) instead of O(N×G).\n */\nexport function buildChildrenByParent<N extends { id: string; parentId?: string }>(\n nodes: ReadonlyArray<N>,\n): Map<string, string[]> {\n const childrenByParent = new Map<string, string[]>()\n for (const n of nodes) {\n if (!n.parentId) continue\n const list = childrenByParent.get(n.parentId)\n if (list) list.push(n.id)\n else childrenByParent.set(n.parentId, [n.id])\n }\n return childrenByParent\n}\n\n// Whether an edge targets a Collect node's \"in\" handle. The default-\"in\" fallback\n// matches every other call site so legacy edges without an explicit targetHandle\n// keep working. Duck-typed input shape avoids a runtime dep on @xyflow/react.\nexport function isCollectInEdge(e: { targetHandle?: string | null }): boolean {\n return (e.targetHandle ?? COLLECT_IN_HANDLE) === COLLECT_IN_HANDLE\n}\n\n/**\n * The source-pip lanes an aggregate node (Group / Collect) must EXPOSE.\n *\n * Bucket contents alone are not enough: buckets are computed from upstream\n * RESULTS, so before anything ran the node rendered zero source handles — a\n * pre-authored edge out of the node (MCP-written JSON, import, paste) pointed\n * at a handle that did not exist and React Flow silently hid it (\"connected\n * in the panel, invisible on canvas\"), and there was no pip to drag outward\n * from. A lane therefore exists when ANY of these hold:\n * (a) a wired member / input of that aggregateable type exists (pre-run),\n * (b) the bucket for that type has values (post-run),\n * (c) an existing outgoing edge references the lane's handle — so an edge\n * can never point at a missing handle, whatever state authored it\n * (also covers results being cleared after wiring downstream).\n * Ordered by AGGREGATEABLE_TYPES so the handle layout is stable.\n */\nexport function computeAggregateLanes(\n nodeId: string,\n wiredTypes: Iterable<AggregateableType>,\n buckets: AggregationBuckets,\n edges: ReadonlyArray<{ source: string; sourceHandle?: string | null }>,\n): AggregateableType[] {\n const present = new Set<AggregateableType>(wiredTypes)\n for (const t of presentTypes(buckets)) present.add(t)\n for (const e of edges) {\n if (e.source !== nodeId) continue\n const lane = parseGroupHandle(e.sourceHandle)\n if (lane) present.add(lane)\n }\n return AGGREGATEABLE_TYPES.filter((t) => present.has(t))\n}\n","/**\n * Non-linear progress calculation using quadratic ease-out curve.\n * Returns 0–99 during execution, never reaching 100 (that's set on completion).\n *\n * Formula: progress = 99 * (1 - (1 - t)^exponent)\n * where t = clamp(elapsedMs / estimatedMs, 0, 1)\n */\nexport function calculateProgress(\n elapsedMs: number,\n estimatedMs: number,\n exponent: number = 2,\n): number {\n if (estimatedMs <= 0) return 0\n const t = Math.min(Math.max(elapsedMs / estimatedMs, 0), 1)\n return Math.round(99 * (1 - Math.pow(1 - t, exponent)))\n}\n\n/** Category-based fallback durations (ms) when no historical data exists. */\nexport const CATEGORY_DURATION_DEFAULTS: Record<string, number> = {\n image: 30_000,\n video: 120_000,\n \"audio-tts\": 15_000,\n music: 60_000,\n llm: 8_000,\n upscale: 30_000,\n inline: 500,\n}\n\n/**\n * Compute weighted progress segments for a multi-node flow.\n * Each node gets a proportional slice of 0–99% based on its estimated duration.\n *\n * Returns array of { nodeId, startPct, endPct, estimatedMs } in execution order.\n */\nexport interface ProgressSegment {\n nodeId: string\n startPct: number\n endPct: number\n estimatedMs: number\n}\n\nexport function buildProgressSegments(\n nodeEstimates: { nodeId: string; estimatedMs: number }[],\n): ProgressSegment[] {\n const totalMs = nodeEstimates.reduce((sum, n) => sum + n.estimatedMs, 0)\n if (totalMs <= 0) return []\n\n const segments: ProgressSegment[] = []\n let cursor = 0\n\n for (let i = 0; i < nodeEstimates.length; i++) {\n const { nodeId, estimatedMs } = nodeEstimates[i]\n const sliceWidth = (estimatedMs / totalMs) * 99\n const isLast = i === nodeEstimates.length - 1\n segments.push({\n nodeId,\n startPct: cursor,\n // Last segment always stretches to exactly 99\n endPct: isLast ? 99 : cursor + sliceWidth,\n estimatedMs,\n })\n cursor += sliceWidth\n }\n\n return segments\n}\n\n/**\n * Calculate combined progress for a multi-node flow given current node states.\n */\nexport function calculateCombinedProgress(\n segments: ProgressSegment[],\n nodeStatuses: Record<string, {\n status: \"pending\" | \"running\" | \"completed\" | \"failed\" | \"skipped\"\n startedAt?: string\n }>,\n now: number = Date.now(),\n): number {\n let progress = 0\n\n for (const seg of segments) {\n const state = nodeStatuses[seg.nodeId]\n if (!state) continue\n\n const sliceWidth = seg.endPct - seg.startPct\n\n if (state.status === \"completed\" || state.status === \"skipped\") {\n progress += sliceWidth\n } else if (state.status === \"running\" && state.startedAt) {\n const elapsed = now - new Date(state.startedAt).getTime()\n const nodeProgress = calculateProgress(elapsed, seg.estimatedMs)\n // Map node's 0–99% to this segment's slice\n progress += (nodeProgress / 99) * sliceWidth\n }\n // pending/failed contribute 0\n }\n\n return Math.round(Math.min(progress, 99))\n}\n","/**\n * Shared BFS utility for computing reachable node IDs along a route.\n * Used by both frontend (RunTargetSelector stale guard) and backend\n * (presentation.ts, app-runner.ts, sub-workflow-handler.ts).\n */\n\nexport interface MinimalNode {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nexport interface MinimalEdge {\n source: string\n target: string\n}\n\n/**\n * BFS in one direction from a start node.\n */\nfunction bfs(\n startId: string,\n edges: readonly MinimalEdge[],\n direction: \"forward\" | \"backward\",\n): Set<string> {\n const visited = new Set<string>()\n const queue = [startId]\n\n while (queue.length > 0) {\n const current = queue.shift()!\n if (visited.has(current)) continue\n visited.add(current)\n\n for (const edge of edges) {\n if (direction === \"forward\" && edge.source === current && !visited.has(edge.target)) {\n queue.push(edge.target)\n } else if (direction === \"backward\" && edge.target === current && !visited.has(edge.source)) {\n queue.push(edge.source)\n }\n }\n }\n\n return visited\n}\n\n/**\n * Compute the set of node IDs reachable along a route.\n * 1. Finds the sub-workflow-input node with matching routeId\n * 2. Finds the sub-workflow-output node with matching routeId\n * 3. BFS forward from input, BFS backward from output, intersect\n * Returns empty set if input or output node not found (stale routeId).\n */\nexport function getRouteReachableNodeIds(\n nodes: readonly MinimalNode[],\n edges: readonly MinimalEdge[],\n routeId: string,\n): Set<string> {\n const inputNode = nodes.find(\n (n) => n.type === \"sub-workflow-input\" && (n.data as Record<string, unknown>).routeId === routeId,\n )\n const outputNode = nodes.find(\n (n) => n.type === \"sub-workflow-output\" && (n.data as Record<string, unknown>).routeId === routeId,\n )\n\n if (!inputNode || !outputNode) return new Set()\n\n const forwardReachable = bfs(inputNode.id, edges, \"forward\")\n const backwardReachable = bfs(outputNode.id, edges, \"backward\")\n\n const reachable = new Set<string>()\n for (const id of forwardReachable) {\n if (backwardReachable.has(id)) reachable.add(id)\n }\n\n // Always include input and output\n reachable.add(inputNode.id)\n reachable.add(outputNode.id)\n\n return reachable\n}\n","/**\n * R2-key + result-id suffix for multi-variant jobs. Provider returns multiple\n * URLs from a single task (Grok = up to 6 images, Suno = 2 tracks); each\n * variant gets a deterministic suffix-keyed ID so primary stays at the original\n * jobId for backwards compat and extras land under `${jobId}-v1`, `${jobId}-v2`, …\n *\n * Used by:\n * - backend `uploadImageVariantsMaybeWatermark` (R2 key)\n * - backend Suno `uploadAllSunoTracks` (R2 key)\n * - frontend `poll-job.ts handleJobCompleted` (GeneratedResult.jobId)\n * - frontend `run-handlers.ts` orchestrator poll loop (GeneratedResult.jobId)\n *\n * Changing the suffix scheme requires updating every caller, hence the shared helper.\n */\nexport function variantJobId(baseJobId: string, index: number): string {\n return index === 0 ? baseJobId : `${baseJobId}-v${index}`\n}\n","// --- Types ---\n\nexport type FilterOperator =\n | \"equals\" | \"not_equals\"\n | \"contains\" | \"not_contains\"\n | \"starts_with\" | \"ends_with\"\n | \"greater_than\" | \"less_than\"\n | \"is_empty\" | \"is_not_empty\"\n | \"matches_regex\"\n | \"in_list\"\n\nexport interface JsonFilter {\n id: string\n field: string\n operator: FilterOperator\n value: string | string[]\n}\n\nexport type JsonEvalResult =\n | { ok: true; value: unknown }\n | { ok: false; error: string }\n\n// --- Helpers ---\n\nconst BARE_IDENT = /^[a-zA-Z_$][a-zA-Z0-9_$]*$/\n\nfunction escapeString(v: string): string {\n return v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"')\n}\n\nfunction fieldRef(field: string): string {\n return BARE_IDENT.test(field) ? `.${field}` : `.[\"${escapeString(field)}\"]`\n}\n\nfunction coerceValue(v: string): string {\n const trimmed = v.trim()\n if (trimmed === \"\" || trimmed === \"Infinity\" || trimmed === \"-Infinity\" || trimmed === \"NaN\") return `\"${trimmed}\"`\n const n = Number(trimmed)\n return Number.isFinite(n) ? String(n) : `\"${escapeString(trimmed)}\"`\n}\n\nfunction buildFilterExpr(f: JsonFilter): string {\n const ref = fieldRef(f.field)\n switch (f.operator) {\n case \"equals\": return `select(${ref} == ${coerceValue(f.value as string)})`\n case \"not_equals\": return `select(${ref} != ${coerceValue(f.value as string)})`\n case \"contains\": return `select(${ref} | contains(\"${escapeString(f.value as string)}\"))`\n case \"not_contains\": return `select(${ref} | contains(\"${escapeString(f.value as string)}\") | not)`\n case \"starts_with\": return `select(${ref} | startswith(\"${escapeString(f.value as string)}\"))`\n case \"ends_with\": return `select(${ref} | endswith(\"${escapeString(f.value as string)}\"))`\n case \"greater_than\": {\n const n = Number((f.value as string).trim())\n if (!Number.isFinite(n)) return `select(${ref} > 0)`\n return `select(${ref} > ${n})`\n }\n case \"less_than\": {\n const n = Number((f.value as string).trim())\n if (!Number.isFinite(n)) return `select(${ref} < 0)`\n return `select(${ref} < ${n})`\n }\n case \"is_empty\": return `select(${ref} == null or ${ref} == \"\")`\n case \"is_not_empty\": return `select(${ref} != null and ${ref} != \"\")`\n case \"matches_regex\": return `select(${ref} | test(\"${escapeString(f.value as string)}\"))`\n case \"in_list\": {\n // Tolerate string form: users can switch operator to \"in_list\" while the\n // previous operator's string value is still in place. Comma-split so the\n // config panel's \"a, b, c\" shape works before it's persisted as an array.\n const raw = Array.isArray(f.value)\n ? f.value\n : String(f.value ?? \"\").split(\",\").map((s) => s.trim()).filter(Boolean)\n if (raw.length === 0) return `select(false)`\n const items = raw.map((v) => `${ref} == ${coerceValue(v)}`)\n return `select(${items.join(\" or \")})`\n }\n default: return `select(true)`\n }\n}\n\n// --- Public API ---\n\nexport function buildExpressionFromVisual(config: {\n inputPath?: string\n filters?: JsonFilter[]\n projections?: string[]\n}): string {\n const { inputPath, filters = [], projections = [] } = config\n const hasFilters = filters.length > 0\n const hasProjections = projections.length > 0\n const hasPath = !!inputPath && inputPath.trim().length > 0\n\n // Stage 1: path\n let path = hasPath ? `.${inputPath}` : \".\"\n\n // Append [] if filters or projections exist\n if (hasFilters || hasProjections) {\n path += \"[]\"\n }\n\n // If nothing configured, return identity\n if (!hasPath && !hasFilters && !hasProjections) return \".\"\n\n const parts: string[] = [path]\n\n // Stage 2: filters (AND via separate select pipes)\n for (const f of filters) {\n parts.push(buildFilterExpr(f))\n }\n\n // Stage 3: projections\n if (hasProjections) {\n const fields = projections.map((p) => {\n if (BARE_IDENT.test(p)) return p\n return `\"${p}\": .[\"${p}\"]`\n })\n parts.push(`{${fields.join(\", \")}}`)\n }\n\n return parts.join(\" | \")\n}\n\n// --- Tokenizer ---\n\ntype TokType =\n | \"DOT\" | \"PIPE\" | \"LBRACE\" | \"RBRACE\" | \"LBRACKET\" | \"RBRACKET\"\n | \"LPAREN\" | \"RPAREN\" | \"COMMA\" | \"COLON\"\n | \"EMPTY_ITER\" // []\n | \"INDEX\" // [N] or [-N]\n | \"BRACKET_KEY\" // [\"str\"]\n | \"IDENT\" // bare identifier or keyword\n | \"STRING\" // \"...\"\n | \"NUMBER\" // 42 / 3.14\n | \"OP\" // == != > < >= <=\n\ninterface Token { type: TokType; value: string | number }\n\nfunction tokenize(expr: string): Token[] {\n const tokens: Token[] = []\n let i = 0\n\n while (i < expr.length) {\n // whitespace\n if (/\\s/.test(expr[i])) { i++; continue }\n\n const ch = expr[i]\n\n // single-char structural\n if (ch === \".\") { tokens.push({ type: \"DOT\", value: \".\" }); i++; continue }\n if (ch === \"|\") { tokens.push({ type: \"PIPE\", value: \"|\" }); i++; continue }\n if (ch === \"{\") { tokens.push({ type: \"LBRACE\", value: \"{\" }); i++; continue }\n if (ch === \"}\") { tokens.push({ type: \"RBRACE\", value: \"}\" }); i++; continue }\n if (ch === \"(\") { tokens.push({ type: \"LPAREN\", value: \"(\" }); i++; continue }\n if (ch === \")\") { tokens.push({ type: \"RPAREN\", value: \")\" }); i++; continue }\n if (ch === \",\") { tokens.push({ type: \"COMMA\", value: \",\" }); i++; continue }\n if (ch === \":\") { tokens.push({ type: \"COLON\", value: \":\" }); i++; continue }\n\n // bracket forms: [], [N], [-N], [\"str\"]\n if (ch === \"[\") {\n const rest = expr.slice(i)\n // [\"str\"]\n const bkStr = rest.match(/^\\[\"((?:[^\"\\\\]|\\\\.)*)\"\\]/)\n if (bkStr) {\n const unescaped = bkStr[1].replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, \"\\\\\").replace(/\\\\n/g, \"\\n\").replace(/\\\\t/g, \"\\t\")\n tokens.push({ type: \"BRACKET_KEY\", value: unescaped })\n i += bkStr[0].length; continue\n }\n // []\n const bkEmpty = rest.match(/^\\[\\]/)\n if (bkEmpty) {\n tokens.push({ type: \"EMPTY_ITER\", value: \"[]\" })\n i += 2; continue\n }\n // [-N] or [N]\n const bkIdx = rest.match(/^\\[-?(\\d+)\\]/)\n if (bkIdx) {\n const raw = rest.match(/^\\[(-?\\d+)\\]/)!\n tokens.push({ type: \"INDEX\", value: parseInt(raw[1], 10) })\n i += raw[0].length; continue\n }\n // standalone [ (for parser completeness — treated as error later)\n tokens.push({ type: \"LBRACKET\", value: \"[\" }); i++; continue\n }\n\n // two-char operators\n if (i + 1 < expr.length) {\n const two = expr.slice(i, i + 2)\n if (two === \"==\" || two === \"!=\" || two === \">=\" || two === \"<=\") {\n tokens.push({ type: \"OP\", value: two }); i += 2; continue\n }\n }\n if (ch === \">\" || ch === \"<\") {\n tokens.push({ type: \"OP\", value: ch }); i++; continue\n }\n\n // string literal\n if (ch === '\"') {\n let s = \"\"\n i++ // skip opening \"\n while (i < expr.length && expr[i] !== '\"') {\n if (expr[i] === \"\\\\\") {\n i++\n const esc = expr[i]\n if (esc === '\"') s += '\"'\n else if (esc === \"\\\\\") s += \"\\\\\"\n else if (esc === \"n\") s += \"\\n\"\n else if (esc === \"t\") s += \"\\t\"\n else s += esc\n } else {\n s += expr[i]\n }\n i++\n }\n if (expr[i] !== '\"') throw new Error(\"Unterminated string literal\")\n i++ // skip closing \"\n tokens.push({ type: \"STRING\", value: s }); continue\n }\n\n // number\n if (/[0-9]/.test(ch) || (ch === \"-\" && /[0-9]/.test(expr[i + 1] ?? \"\"))) {\n const m = expr.slice(i).match(/^-?(?:\\d+\\.?\\d*|\\.\\d+)(?:[eE][+-]?\\d+)?/)\n if (m) {\n const n = Number(m[0])\n if (!Number.isFinite(n)) throw new Error(`Invalid number: ${m[0]}`)\n tokens.push({ type: \"NUMBER\", value: n })\n i += m[0].length; continue\n }\n }\n\n // identifier / keyword\n const idm = expr.slice(i).match(/^[a-zA-Z_$][a-zA-Z0-9_$]*/)\n if (idm) {\n tokens.push({ type: \"IDENT\", value: idm[0] })\n i += idm[0].length; continue\n }\n\n throw new Error(`Unexpected character '${ch}' at position ${i}`)\n }\n\n return tokens\n}\n\n// --- AST Node Types ---\n\ntype AstNode =\n | { k: \"identity\" }\n | { k: \"dot\"; field: string }\n | { k: \"bracket\"; key: string }\n | { k: \"iterate\" }\n | { k: \"index\"; index: number }\n | { k: \"pipe\"; left: AstNode; right: AstNode }\n | { k: \"select\"; cond: AstNode }\n | { k: \"object\"; fields: Array<{ key: string; valueExpr: AstNode | null }> }\n | { k: \"compare\"; op: string; left: AstNode; right: AstNode }\n | { k: \"bool\"; op: \"and\" | \"or\"; left: AstNode; right: AstNode }\n | { k: \"not\" }\n | { k: \"func\"; name: string; arg: string }\n | { k: \"literal\"; value: string | number }\n | { k: \"path\"; steps: AstNode[] } // chained dot/bracket/iterate/index\n\n// --- Parser ---\n\nclass Parser {\n private pos = 0\n constructor(private tokens: Token[]) {}\n\n private peek(): Token | undefined { return this.tokens[this.pos] }\n private eat(): Token {\n const t = this.tokens[this.pos++]\n if (!t) throw new Error(\"Unexpected end of expression\")\n return t\n }\n private expect(type: TokType): Token {\n const t = this.eat()\n if (t.type !== type) throw new Error(`Expected ${type}, got ${t.type} ('${t.value}')`)\n return t\n }\n private at(type: TokType): boolean { return this.peek()?.type === type }\n private atIdent(v: string): boolean { return this.peek()?.type === \"IDENT\" && this.peek()?.value === v }\n private done(): boolean { return this.pos >= this.tokens.length }\n\n parse(): AstNode {\n const node = this.parsePipe()\n if (!this.done()) throw new Error(`Unexpected token '${this.peek()!.value}' at position ${this.pos}`)\n return node\n }\n\n private parsePipe(): AstNode {\n let left = this.parseBoolExpr()\n while (this.at(\"PIPE\")) {\n this.eat() // consume |\n const right = this.parseBoolExpr()\n left = { k: \"pipe\", left, right }\n }\n return left\n }\n\n private parseBoolExpr(): AstNode {\n let left = this.parseCompare()\n while (this.atIdent(\"and\") || this.atIdent(\"or\")) {\n const op = this.eat().value as \"and\" | \"or\"\n const right = this.parseCompare()\n left = { k: \"bool\", op, left, right }\n }\n return left\n }\n\n private parseCompare(): AstNode {\n const left = this.parseAtom()\n if (this.at(\"OP\")) {\n const op = this.eat().value as string\n const right = this.parseAtom()\n return { k: \"compare\", op, left, right }\n }\n return left\n }\n\n // parseAtom handles all leaf-level filter constructs\n private parseAtom(): AstNode {\n // select(...)\n if (this.atIdent(\"select\")) {\n this.eat()\n this.expect(\"LPAREN\")\n // Allow full pipe expressions inside select (e.g., select(.name | contains(\"x\")))\n const cond = this.parsePipe()\n this.expect(\"RPAREN\")\n return { k: \"select\", cond }\n }\n // not (postfix — standalone in pipe context)\n if (this.atIdent(\"not\")) {\n this.eat()\n return { k: \"not\" }\n }\n // object construction\n if (this.at(\"LBRACE\")) {\n return this.parseObjectCtor()\n }\n // string function calls (contains, startswith, endswith, test) with arg\n if (this.at(\"IDENT\")) {\n const name = this.peek()!.value as string\n if ([\"contains\", \"startswith\", \"endswith\", \"test\"].includes(name)) {\n // look ahead for (\n if (this.tokens[this.pos + 1]?.type === \"LPAREN\") {\n this.eat() // name\n this.eat() // (\n const argTok = this.eat()\n if (argTok.type !== \"STRING\") throw new Error(`${name}() argument must be a string`)\n this.expect(\"RPAREN\")\n return { k: \"func\", name, arg: argTok.value as string }\n }\n }\n }\n // parenthesised expression\n if (this.at(\"LPAREN\")) {\n this.eat()\n const inner = this.parseBoolExpr()\n this.expect(\"RPAREN\")\n return inner\n }\n // literals and paths\n if (this.at(\"STRING\")) {\n return { k: \"literal\", value: this.eat().value as string }\n }\n if (this.at(\"NUMBER\")) {\n return { k: \"literal\", value: this.eat().value as number }\n }\n return this.parsePath()\n }\n\n private parsePath(): AstNode {\n if (!this.at(\"DOT\")) throw new Error(`Expected path starting with '.', got '${this.peek()?.value ?? \"EOF\"}'`)\n this.eat() // consume .\n\n // bare \".\" — identity\n const steps: AstNode[] = []\n\n // after dot, there may be an identifier or a bracket form\n if (this.at(\"IDENT\") && ![\"select\",\"not\",\"contains\",\"startswith\",\"endswith\",\"test\",\"and\",\"or\",\"null\",\"true\",\"false\"].includes(this.peek()!.value as string)) {\n steps.push({ k: \"dot\", field: this.eat().value as string })\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat()\n steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n // just \".\"\n if (steps.length === 0) return { k: \"identity\" }\n }\n\n // chain more accesses: .foo.bar, .foo[0], .foo[]\n while (true) {\n if (this.at(\"DOT\")) {\n this.eat()\n if (this.at(\"IDENT\") && ![\"select\",\"not\",\"contains\",\"startswith\",\"endswith\",\"test\",\"and\",\"or\"].includes(this.peek()!.value as string)) {\n steps.push({ k: \"dot\", field: this.eat().value as string })\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat(); steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n // trailing dot — treat as identity at end (shouldn't normally happen)\n break\n }\n } else if (this.at(\"BRACKET_KEY\")) {\n steps.push({ k: \"bracket\", key: this.eat().value as string })\n } else if (this.at(\"EMPTY_ITER\")) {\n this.eat(); steps.push({ k: \"iterate\" })\n } else if (this.at(\"INDEX\")) {\n steps.push({ k: \"index\", index: this.eat().value as number })\n } else {\n break\n }\n }\n\n if (steps.length === 0) return { k: \"identity\" }\n if (steps.length === 1) return steps[0]\n return { k: \"path\", steps }\n }\n\n private parseObjectCtor(): AstNode {\n this.eat() // {\n const fields: Array<{ key: string; valueExpr: AstNode | null }> = []\n\n while (!this.at(\"RBRACE\") && !this.done()) {\n let key: string\n let valueExpr: AstNode | null = null\n\n if (this.at(\"IDENT\")) {\n key = this.eat().value as string\n if (this.at(\"COLON\")) {\n this.eat() // :\n valueExpr = this.parsePipe()\n }\n // else shorthand: {name} => {name: .name}\n } else if (this.at(\"STRING\")) {\n key = this.eat().value as string\n this.expect(\"COLON\")\n valueExpr = this.parsePipe()\n } else {\n throw new Error(`Expected field name in object constructor, got '${this.peek()?.value}'`)\n }\n\n fields.push({ key, valueExpr })\n if (this.at(\"COMMA\")) this.eat()\n }\n\n this.expect(\"RBRACE\")\n return { k: \"object\", fields }\n }\n}\n\n// --- Evaluator ---\n\n// Sentinel to represent \"this item was dropped by select\"\nconst DROPPED = Symbol(\"DROPPED\")\n// Sentinel to track that we're in iterate mode (stream of items)\ntype EvalValue = unknown | typeof DROPPED\n\nfunction isTruthy(v: unknown): boolean {\n if (v === null || v === undefined || v === false || v === 0 || v === \"\") return false\n return true\n}\n\n// --- Per-call evaluation context ---\n\ninterface EvalCtx {\n expandedArrays: WeakSet<object>\n objectSourcedArrays: WeakSet<object>\n regexCache: Map<string, RegExp>\n}\n\nfunction evalNode(node: AstNode, input: unknown, ctx: EvalCtx): EvalValue | EvalValue[] {\n switch (node.k) {\n case \"identity\":\n return input\n\n case \"dot\": {\n if (input === null || input === undefined) return null\n if (typeof input !== \"object\" || Array.isArray(input)) {\n throw new Error(`Cannot access field '.${node.field}' on ${Array.isArray(input) ? \"array\" : typeof input}`)\n }\n const obj = input as Record<string, unknown>\n if (!(node.field in obj)) {\n const available = Object.keys(obj).join(\", \")\n throw new Error(`Field '${node.field}' not found. Available fields: ${available || \"(none)\"}`)\n }\n return obj[node.field]\n }\n\n case \"bracket\": {\n if (input === null || input === undefined) return null\n if (typeof input !== \"object\" || Array.isArray(input)) {\n throw new Error(`Cannot bracket-access on ${Array.isArray(input) ? \"array\" : typeof input}`)\n }\n const obj = input as Record<string, unknown>\n if (!(node.key in obj)) {\n const available = Object.keys(obj).join(\", \")\n throw new Error(`Field '${node.key}' not found. Available fields: ${available || \"(none)\"}`)\n }\n return obj[node.key]\n }\n\n case \"index\": {\n if (!Array.isArray(input)) throw new Error(`Cannot index non-array with .[${node.index}]`)\n const idx = node.index < 0 ? input.length + node.index : node.index\n return idx >= 0 && idx < input.length ? input[idx] : null\n }\n\n case \"iterate\": {\n if (Array.isArray(input)) {\n return input // return as array — caller handles fan-out\n }\n if (typeof input === \"object\" && input !== null) {\n // treat object as single-item sequence per spec\n const arr = [input]\n ctx.objectSourcedArrays.add(arr)\n return arr\n }\n throw new Error(`Cannot iterate over ${typeof input}`)\n }\n\n case \"path\": {\n let cur: unknown = input\n for (let i = 0; i < node.steps.length; i++) {\n const step = node.steps[i]\n const res = evalNode(step, cur, ctx)\n // if a step returns an array (from iterate), fan out remaining steps\n if (step.k === \"iterate\" && Array.isArray(res)) {\n const wasObjSourced = ctx.objectSourcedArrays.has(res as object)\n // fan out remaining steps over each element\n const remaining = node.steps.slice(i + 1)\n if (remaining.length === 0) return res\n const fanned: unknown[] = []\n for (const item of res) {\n const subNode: AstNode = remaining.length === 1 ? remaining[0] : { k: \"path\", steps: remaining }\n const subRes = evalNode(subNode, item, ctx)\n if (Array.isArray(subRes)) fanned.push(...subRes)\n else if (subRes !== DROPPED) fanned.push(subRes)\n }\n return markExpanded(fanned, wasObjSourced, ctx)\n }\n cur = res\n }\n return cur\n }\n\n case \"pipe\": {\n // Evaluate left side; if it produces an array (from iterate), fan-out over right side\n const leftVal = evalNode(node.left, input, ctx)\n\n // Check if left side was an iterate that produced array expansion\n const leftIsExpanded = isExpandedArray(node.left, leftVal, ctx)\n\n if (leftIsExpanded && Array.isArray(leftVal)) {\n const wasObjectSourced = ctx.objectSourcedArrays.has(leftVal as object)\n const results: unknown[] = []\n for (const item of leftVal) {\n const r = evalNode(node.right, item, ctx)\n if (r === DROPPED) continue\n if (Array.isArray(r) && isExpandedArray(node.right, r, ctx)) {\n results.push(...r)\n } else if (r !== DROPPED) {\n results.push(r)\n }\n }\n // mark as expanded, preserving object-sourced flag\n return markExpanded(results, wasObjectSourced, ctx)\n }\n\n if (leftVal === DROPPED) return DROPPED\n\n // scalar left — apply right once\n return evalNode(node.right, leftVal, ctx)\n }\n\n case \"select\": {\n const condVal = evalNode(node.cond, input, ctx)\n // If condition is a pipe that produced an expanded array (e.g., select(.name | contains(\"x\"))),\n // the truthiness is based on the final scalar result (the pipe's output).\n // An expanded array here means the condition pipeline returned array results — use last item.\n if (Array.isArray(condVal) && ctx.expandedArrays.has(condVal)) {\n const last = condVal[condVal.length - 1]\n return isTruthy(last) ? input : DROPPED\n }\n return isTruthy(condVal as unknown) ? input : DROPPED\n }\n\n case \"not\": {\n return !isTruthy(input)\n }\n\n case \"object\": {\n const result: Record<string, unknown> = {}\n for (const { key, valueExpr } of node.fields) {\n let fieldVal: unknown\n if (valueExpr === null) {\n // shorthand: {name} => .name\n fieldVal = evalNode({ k: \"dot\", field: key }, input, ctx)\n } else {\n fieldVal = evalNode(valueExpr, input, ctx)\n }\n if (fieldVal === DROPPED) return DROPPED\n result[key] = fieldVal\n }\n return result\n }\n\n case \"compare\": {\n const lv = evalNode(node.left, input, ctx) as unknown\n const rv = evalNode(node.right, input, ctx) as unknown\n switch (node.op) {\n case \"==\": return lv === rv\n case \"!=\": return lv !== rv\n case \">\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv > rv : false\n case \"<\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv < rv : false\n case \">=\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv >= rv : false\n case \"<=\": return typeof lv === \"number\" && typeof rv === \"number\" ? lv <= rv : false\n default: return false\n }\n }\n\n case \"bool\": {\n const lv = evalNode(node.left, input, ctx)\n if (node.op === \"and\") {\n if (!isTruthy(lv as unknown)) return false\n return isTruthy(evalNode(node.right, input, ctx) as unknown)\n } else {\n if (isTruthy(lv as unknown)) return true\n return isTruthy(evalNode(node.right, input, ctx) as unknown)\n }\n }\n\n case \"func\": {\n if (typeof input !== \"string\") throw new Error(`${node.name}() requires a string input`)\n switch (node.name) {\n case \"contains\": return input.includes(node.arg)\n case \"startswith\": return input.startsWith(node.arg)\n case \"endswith\": return input.endsWith(node.arg)\n case \"test\": {\n let re = ctx.regexCache.get(node.arg)\n if (!re) {\n if (/(\\([^)]*[+*][^)]*\\))[+*]/.test(node.arg)) {\n throw new Error(\"Regex pattern too complex — avoid nested quantifiers\")\n }\n re = new RegExp(node.arg)\n ctx.regexCache.set(node.arg, re)\n }\n return re.test(input.slice(0, 100000))\n }\n default: throw new Error(`Unknown function: ${node.name}`)\n }\n }\n\n case \"literal\":\n return node.value\n\n default: {\n const _exhaustive: never = node\n throw new Error(`Unknown AST node`)\n }\n }\n}\n\n// --- Expanded array tracking ---\n// expandedArrays: arrays produced by iterate fan-out (pipe needs to fan-out over them)\n// objectSourcedArrays: expanded arrays whose origin was object iteration (unwrap at output)\n\nfunction markExpanded(arr: unknown[], objectSourced: boolean, ctx: EvalCtx): unknown[] {\n ctx.expandedArrays.add(arr)\n if (objectSourced) ctx.objectSourcedArrays.add(arr)\n return arr\n}\n\nfunction isExpandedArray(node: AstNode, val: unknown, ctx: EvalCtx): boolean {\n if (!Array.isArray(val)) return false\n // If left side is an iterate node directly, it's always expanded\n if (node.k === \"iterate\") return true\n // If left side is a path ending in iterate, check the last step\n if (node.k === \"path\") {\n const last = node.steps[node.steps.length - 1]\n if (last?.k === \"iterate\") return true\n }\n // If left side is a pipe that produced an expanded array\n if (node.k === \"pipe\") return ctx.expandedArrays.has(val as object)\n // Check WeakSet\n return ctx.expandedArrays.has(val as object)\n}\n\n// --- Public API ---\n\nexport function jsonResultToList(value: unknown): string[] {\n if (Array.isArray(value)) {\n return value.map((v) => typeof v === \"string\" ? v : JSON.stringify(v))\n }\n if (value !== null && value !== undefined) {\n return [typeof value === \"string\" ? value : JSON.stringify(value)]\n }\n return []\n}\n\nexport function evaluateJsonExpression(input: unknown, expression: string): JsonEvalResult {\n try {\n const tokens = tokenize(expression)\n const ast = new Parser(tokens).parse()\n const ctx: EvalCtx = {\n expandedArrays: new WeakSet(),\n objectSourcedArrays: new WeakSet(),\n regexCache: new Map(),\n }\n const raw = evalNode(ast, input, ctx)\n\n // If result is an expanded array (from iterate fan-out):\n if (Array.isArray(raw) && isExpandedArray(ast, raw, ctx)) {\n // Object-sourced: spec says treat as single-element sequence — unwrap (0 items → null, 1 → item)\n // Array-sourced: always return as array (jq model)\n const isObjSourced = ctx.objectSourcedArrays.has(raw as object)\n if (isObjSourced) {\n if (raw.length === 0) return { ok: true, value: null }\n if (raw.length === 1) return { ok: true, value: raw[0] }\n }\n if (raw.length === 0) return { ok: true, value: [] }\n return { ok: true, value: raw }\n }\n // Non-expanded: return as-is\n return { ok: true, value: raw === DROPPED ? [] : raw }\n } catch (err) {\n const msg = err instanceof Error ? err.message : String(err)\n return { ok: false, error: msg }\n }\n}\n","/** AI generation node types that support repeat-N execution.\n * Excludes deterministic nodes, FFmpeg, social, render, and utility nodes. */\nexport const REPEATABLE_NODE_TYPES = new Set([\n \"generate-image\", \"edit-image\", \"image-to-image\",\n \"image-to-video\", \"video-to-video\", \"text-to-video\",\n \"text-to-speech\", \"generate-music\", \"text-to-audio\", \"text-to-dialogue\",\n \"ai-writer\", \"llm-chat\", \"generate-script\",\n \"suno-generate\", \"suno-cover\", \"suno-extend\", \"suno-lyrics\",\n \"lip-sync\", \"speech-to-video\",\n \"motion-transfer\", \"extend-video\",\n \"video-composer\", \"after-effects\", \"lottie-overlay\", \"3d-title\", \"motion-graphics\",\n \"voice-changer\", \"dubbing\", \"voice-remix\", \"voice-design\",\n \"component\",\n])\n\n/** Sentinel value used as list item for repeat-only execution (no list fan-out input).\n * executeNodeForList skips the overridePrompt/overrideMediaUrl when it sees this. */\nexport const REPEAT_PLACEHOLDER = \"__repeat__\"\n\n/** Sentinel prefix for per-iteration provider override.\n * An item like `__provider:nano-banana__` tells executeNodeForList to clone the\n * node with `data.provider = \"nano-banana\"` for that iteration and otherwise\n * behave like REPEAT_PLACEHOLDER (no prompt/media override). */\nexport const PROVIDER_PLACEHOLDER_PREFIX = \"__provider:\"\nconst PROVIDER_PLACEHOLDER_SUFFIX = \"__\"\n\nexport function encodeProviderItem(provider: string): string {\n return `${PROVIDER_PLACEHOLDER_PREFIX}${provider}${PROVIDER_PLACEHOLDER_SUFFIX}`\n}\n\nexport function decodeProviderItem(item: string): string | undefined {\n if (!item.startsWith(PROVIDER_PLACEHOLDER_PREFIX)) return undefined\n if (!item.endsWith(PROVIDER_PLACEHOLDER_SUFFIX)) return undefined\n const inner = item.slice(\n PROVIDER_PLACEHOLDER_PREFIX.length,\n item.length - PROVIDER_PLACEHOLDER_SUFFIX.length,\n )\n return inner.length > 0 ? inner : undefined\n}\n\n/** Read repeatCount from node data, clamped to 1-20. Returns 1 if unset/invalid. */\nexport function getEffectiveRepeatCount(nodeData: Record<string, unknown>): number {\n const raw = nodeData.repeatCount as number | undefined\n if (!raw || raw <= 1) return 1\n return Math.min(Math.max(Math.floor(raw), 1), 20)\n}\n\n/** Read providers array from node data. Returns the array only when it has 2+\n * entries; one provider is equivalent to single-provider mode. */\nfunction getEffectiveProviders(nodeData: Record<string, unknown>): readonly string[] | undefined {\n const raw = nodeData.providers as readonly unknown[] | undefined\n if (!raw || raw.length < 2) return undefined\n const cleaned = raw.filter((p): p is string => typeof p === \"string\" && p.length > 0)\n return cleaned.length >= 2 ? cleaned : undefined\n}\n\n/**\n * Expand list items by repeatCount, or create synthetic repeat / provider items.\n *\n * Resolution order:\n * 1. If an upstream list exists, the list drives expansion (repeatCount multiplies).\n * 2. Else if `data.providers` has 2+ entries, emit `providers.length × repeatCount`\n * items — each provider runs `repeatCount` times consecutively.\n * 3. Else if repeatCount > 1, emit `repeatCount` synthetic items.\n * 4. Otherwise return null — single execution, no fan-out.\n */\nexport function expandItemsWithRepeat(\n listItems: string[] | undefined,\n nodeType: string,\n nodeData: Record<string, unknown>,\n): string[] | null {\n const repeatCount = REPEATABLE_NODE_TYPES.has(nodeType)\n ? getEffectiveRepeatCount(nodeData)\n : 1\n\n if (listItems && listItems.length > 1) {\n const expanded = repeatCount > 1\n ? listItems.flatMap(item => Array(repeatCount).fill(item) as string[])\n : listItems\n return expanded\n }\n\n const providers = getEffectiveProviders(nodeData)\n if (providers) {\n // Cross-product: each provider runs `repeatCount` times. Same provider's\n // iterations are grouped (better for UI progress + caching).\n return providers.flatMap(p =>\n Array(Math.max(repeatCount, 1)).fill(encodeProviderItem(p)) as string[],\n )\n }\n\n if (repeatCount > 1) {\n return Array(repeatCount).fill(REPEAT_PLACEHOLDER) as string[]\n }\n\n return null\n}\n","/**\n * Fan-out pairs by ROW.\n *\n * When several list wires reach one node (\"prompt\" + \"negative\" columns of the\n * same List, two Extract Field lists cut from the same JSON array, …) the node\n * runs once per row and every wire contributes the value of THAT row. Both DAG\n * engines (backend orchestrator + in-browser executor) build the plan with the\n * helpers below, so the rules live in exactly one place:\n *\n * - which list drives the fan-out, and which rows run, never depend on the\n * order the wires were drawn in (`resolveListFanOut`);\n * - the driving item is only written into the prompt when its wire actually\n * feeds the prompt (`fanOutTextFeedsPrompt`, `NON_PROMPT_TEXT_LANES`);\n * - an empty cell stays empty IN ITS ROW instead of pulling the rows below it\n * up (`liveRowColumn`, `alignedFieldList`, `compactWithRows`);\n * - an iteration keeps its row when Repeat xN multiplies it (`planFanOut`).\n */\nimport { evaluateJsonPath, stringifyPathResults } from \"./json-path.js\"\nimport { expandItemsWithRepeat } from \"./repeat-types.js\"\nimport { isDefaultSelectorConfig, resolveIndex, selectListItems, type SelectorFields } from \"./selector.js\"\nimport { unitNonPromptInputs } from \"./unit-contract-compose.js\"\n\n/**\n * The text LANES the input resolvers route somewhere OTHER than the prompt slot\n * (`negative` → negativePrompt, `system-prompt` → systemPrompt, an avatar's\n * `script`, an editor's `transcript`, …). A list that drives a fan-out through\n * one of these must NOT also be written into the prompt: the per-row resolution\n * already delivered it where it belongs.\n *\n * Keyed by handle, scoped by node type, because the routers are: `transcript`\n * is the caption track of Add Captions but the very text Forced Alignment\n * aligns. `\"*\"` = every node type (the router branch is unconditional).\n *\n * DERIVED, not remembered: each engine has a totality test\n * (`fanout-text-handle-totality`) that routes a text source into EVERY input\n * handle of EVERY node type through the real resolver and fails the build on any\n * pair where this table and the router disagree — in either direction. An\n * unlisted lane keeps the old behavior (the item is the prompt), so a miss can\n * only ever reproduce the old bug on that one lane, never a new one.\n */\nconst LEGACY_NON_PROMPT_TEXT_LANES: Readonly<Record<string, \"*\" | readonly string[]>> = {\n negative: \"*\",\n \"system-prompt\": \"*\",\n script: [\"ai-avatar\"],\n transcript: [\"add-captions\", \"apply-edl\", \"edit-plan\", \"camera-switch\", \"speaker-view\", \"speaker-frames\"],\n edl: [\"apply-edl\", \"camera-switch\", \"speaker-view\"],\n // Speaker View's face tracks (Speaker Frames' descriptor): framing data, never a prompt.\n tracks: [\"speaker-view\"],\n silence: [\"edit-plan\"],\n offsets: [\"edit-plan\"],\n // Camera Switch's speaker map (a Speaker Map result): who is on which camera, never a prompt.\n speakerMap: [\"camera-switch\"],\n qrText: [\"image-overlay\"],\n layerPlan: [\"video-overlay\"],\n captionPlan: [\"add-captions\"],\n transition: [\"slideshow\"],\n // Content Recipe's `link` carries the post's address (inputs.sourceLink), not\n // the material it analyzes — a list of links fanned through it must not be\n // written into the material too.\n link: [\"content-recipe\"],\n}\n\n/**\n * The hand-written lanes ∪ the node units' `contract.nonPromptInputs` rows\n * (generated/unit-contracts.ts): each unit type joins the list of every handle\n * it names (a handle no list names yet gets one). A `\"*\"` lane already covers\n * every type, so it stays as it is. A type listed twice for one handle throws\n * at load — a type is hand-written or a node unit, never both.\n */\nexport const NON_PROMPT_TEXT_LANES: Readonly<Record<string, \"*\" | readonly string[]>> = composeNonPromptLanes(LEGACY_NON_PROMPT_TEXT_LANES, unitNonPromptInputs())\n\nfunction composeNonPromptLanes(\n legacy: Readonly<Record<string, \"*\" | readonly string[]>>,\n rows: ReadonlyArray<readonly [string, ReadonlyArray<string>]>,\n): Record<string, \"*\" | readonly string[]> {\n const out: Record<string, \"*\" | readonly string[]> = { ...legacy }\n for (const [type, handles] of rows) {\n const own = new Set<string>()\n for (const handle of handles) {\n // A unit naming one handle twice in its own row is its own mistake, not a clash with the hand-written lanes.\n if (own.has(handle)) throw new Error(`NON_PROMPT_TEXT_LANES: node unit ${type} lists \"${handle}\" twice in its contract.nonPromptInputs`)\n own.add(handle)\n const scope = Object.hasOwn(out, handle) ? out[handle] : []\n if (scope === \"*\") continue\n // Only the same handle clashes here: a unit hand-listed under a DIFFERENT\n // handle is a string literal of a unit's id outside its folders, which\n // G2 fails (frontend/src/__tests__/node-units-structure.test.ts).\n if (scope.includes(type)) throw new Error(`NON_PROMPT_TEXT_LANES: ${type} is listed for \"${handle}\" both by hand and as a node unit — a type lives in one place`)\n out[handle] = [...scope, type]\n }\n }\n return out\n}\n\n/** Does a TEXT list wired to `targetHandle` of a `nodeType` node feed its prompt slot? */\nexport function fanOutTextFeedsPrompt(nodeType: string | null | undefined, targetHandle: string | null | undefined): boolean {\n const scope = Object.hasOwn(NON_PROMPT_TEXT_LANES, targetHandle ?? \"\") ? NON_PROMPT_TEXT_LANES[targetHandle ?? \"\"] : undefined\n if (scope === undefined) return true\n return scope !== \"*\" && !scope.includes(nodeType ?? \"\")\n}\n\nconst isBlank = (v: unknown): boolean => typeof v !== \"string\" || v.trim().length === 0\n\n/**\n * Drop the empty entries of a row-aligned list, remembering the row every kept\n * value came from. The items are what drives a fan-out (nothing runs for an\n * empty cell); the rows are what keeps the OTHER wires on the same row.\n */\nexport function compactWithRows(aligned: readonly string[]): { items: string[]; rowIndices: number[] } {\n const items: string[] = []\n const rowIndices: number[] = []\n aligned.forEach((value, row) => {\n if (isBlank(value)) return\n items.push(value)\n rowIndices.push(row)\n })\n return { items, rowIndices }\n}\n\n/** What a wire reads off a list with holes when it reads ONE value (`pickHeldRow`). */\nexport type HeldRowPick =\n /** This read is not one the holes change: the engine's own rule stands. */\n | { readonly kind: \"unaffected\" }\n /** The wire carries this value. */\n | { readonly kind: \"value\"; readonly value: string }\n /** The wire carries nothing (no scalar fallback). */\n | { readonly kind: \"none\" }\n\n/**\n * One value off a ROW-ALIGNED list whose empty rows mean \"nothing here\" (an\n * Edit Plan's clips as a person's review leaves them: the plan's rows, \"\" at\n * every dropped clip), for a wire that does not iterate it.\n *\n * Without this, both engines fall back to the source's scalar output (the\n * FIRST kept row of the whole list) whenever the wire's own pick is empty, so\n * a wire could carry a row it never selected:\n * - an Each wire with a range / list selector, outside its fan-out (the\n * selection holds one kept row, or none, so nothing fans out): the first\n * kept row OF THE SELECTION, or nothing when it holds none;\n * - an item pick (`item` / `item:N`), in a fan-out or not: the picked row, or\n * nothing when it is empty.\n * Every other read is `unaffected`: a default Each wire (its scalar IS the\n * first kept row), Selected (`last`), Bundle (`all`), an Each wire inside its\n * fan-out (the iteration reads its own row, and an empty row runs nothing),\n * and an empty list. Both engines call this, so they cannot disagree.\n */\nexport function pickHeldRow(\n rows: readonly string[],\n edge: (SelectorFields & { outputMode?: string; itemIndex?: string }) | undefined,\n iterating: boolean,\n): HeldRowPick {\n if (rows.length === 0) return { kind: \"unaffected\" }\n const mode = edge?.outputMode ?? \"each\"\n const held = (row: string | undefined): HeldRowPick => (isBlank(row) ? { kind: \"none\" } : { kind: \"value\", value: row! })\n if (mode === \"item\") return held(rows[resolveIndex(edge?.itemIndex ?? \"1\", rows.length)])\n if (mode.startsWith(\"item:\")) return held(rows[parseInt(mode.slice(5), 10)])\n if (mode !== \"each\" || iterating || isDefaultSelectorConfig(edge)) return { kind: \"unaffected\" }\n const kept = compactWithRows(selectListItems([...rows], edge)).items\n return kept.length > 0 ? { kind: \"value\", value: kept[0]! } : { kind: \"none\" }\n}\n\n/**\n * One column of a manual List table, row-aligned: a row is dropped only when\n * EVERY cell of it is blank (the trailing empty row the editor keeps), and an\n * empty cell of a row that has content stays in place as \"\".\n */\nexport function liveRowColumn(rows: ReadonlyArray<ReadonlyArray<string | undefined>>, colIndex: number): string[] {\n return rows\n .filter((row) => row.some((cell) => !isBlank(cell)))\n .map((row) => (typeof row[colIndex] === \"string\" ? (row[colIndex] as string).trim() : \"\"))\n}\n\n/** One list wire that could drive a fan-out. */\nexport interface FanOutCandidate {\n /** Target handle of the consumer-side wire. */\n targetHandle: string | null | undefined\n /** The wire's values in row order — may hold \"\" for an empty row. */\n aligned: readonly string[]\n}\n\n/**\n * Turn the lists that reach a node into ONE fan-out, so that nothing depends on\n * the order the wires were drawn in. `candidates` are the \"each\" lists that hold\n * more than one value, in wire order.\n *\n * The PRIMARY is the list that holds the most values (the first of them when\n * several tie): it sets the row space. Both engines get it from here, so the\n * orchestrator and the in-browser executor cannot disagree on how many times a\n * node runs. Lists with the SAME number of rows share that row space — two\n * columns of one table, two Extract Field lists cut from one array — and are\n * settled together:\n *\n * - the DRIVER (its item becomes the per-row override) is a text list that\n * feeds the prompt, when there is one: that item is what must win over the\n * typed prompt, and a list wired to `negative` must never supply it;\n * - a ROW runs when ANY of those lists has a value in it. A row is never\n * dropped because one column is empty there — that column just contributes\n * nothing for the row — and a row with no value anywhere does not run.\n *\n * A list with a different number of rows is not part of this: it keeps\n * wrapping around per iteration, as it always has.\n */\nexport function resolveListFanOut<C extends FanOutCandidate>(\n candidates: readonly C[],\n nodeType: string | null | undefined,\n): ListFanOut | undefined {\n if (candidates.length === 0) return undefined\n const held = (c: C) => compactWithRows(c.aligned).items.length\n const primary = candidates.reduce((best, c) => (held(c) > held(best) ? c : best))\n const space = candidates.filter((c) => c.aligned.length === primary.aligned.length)\n const feedsPrompt = (c: C) => fanOutTextFeedsPrompt(nodeType, c.targetHandle) && isTextList(c.aligned, nodeType, c.targetHandle)\n const driver = feedsPrompt(primary) ? primary : (space.find(feedsPrompt) ?? primary)\n const rowIndices: number[] = []\n for (let row = 0; row < primary.aligned.length; row++) {\n if (space.some((c) => !isBlank(c.aligned[row]))) rowIndices.push(row)\n }\n return {\n items: rowIndices.map((row) => (isBlank(driver.aligned[row]) ? \"\" : driver.aligned[row])),\n rowIndices,\n targetHandle: driver.targetHandle,\n }\n}\n\n/**\n * Is this fan-out item a media URL (as opposed to text)? The ONE guess both\n * engines make when a list item has to be applied as an override — kept here so\n * the backend worker and the in-browser executor cannot disagree on it.\n */\nexport function isFanOutUrlItem(item: string): boolean {\n const s = item.trim()\n // A media link is ONE address. JSON (`{…}` / `[…]`) and a sentence that merely\n // contains an image address are text: a scraped post's JSON with a\n // `.jpg?token=` inside it used to be read as a picture and dropped from the\n // prompt (review finding H3, 2026-10-06).\n if (s.length === 0 || /\\s/.test(s) || s.startsWith(\"{\") || s.startsWith(\"[\")) return false\n return s.startsWith(\"http\") || /\\.(png|jpg|jpeg|webp|gif|mp4|mov|webm|mp3|wav|ogg)(\\?|$)/i.test(s)\n}\n\n/**\n * Lanes where an item that LOOKS like a media link is still the item itself —\n * a record's link is what a Save to Collection stores, not a picture to show\n * it. Data-driven so a new consumer declares its lane here, never a name check\n * in either engine.\n */\nconst URL_ITEM_IS_TEXT_LANES: Readonly<Record<string, readonly string[]>> = {\n \"collection-write\": [\"in\"],\n}\n\n/** Does a fan-out item that looks like a link stay TEXT on this lane (the item, not a media input)? */\nexport function fanOutUrlItemIsText(nodeType: string | null | undefined, targetHandle: string | null | undefined): boolean {\n const lanes = URL_ITEM_IS_TEXT_LANES[nodeType ?? \"\"]\n return lanes !== undefined && lanes.includes(targetHandle ?? \"\")\n}\n\n/** A media list never supplies a prompt override, whatever handle it is wired to —\n * except on a lane where a link IS the item (`fanOutUrlItemIsText`).\n * The FIRST value decides — a column is one kind of thing; this is not a scan. */\nfunction isTextList(aligned: readonly string[], nodeType?: string | null, targetHandle?: string | null): boolean {\n const first = aligned.find((v) => !isBlank(v))\n if (first === undefined) return false\n return !isFanOutUrlItem(first) || fanOutUrlItemIsText(nodeType, targetHandle)\n}\n\n/** What a fan-out source resolved to. */\nexport interface ListFanOut {\n /** The driving list's value for every row that runs — \"\" where the driver has\n * none for a row another list keeps alive (nothing is overridden there). */\n items: string[]\n /** `rowIndices[k]` = the row `items[k]` came from, in the driver's row space. */\n rowIndices: number[]\n /** Target handle of the consumer-side wire that drives the fan-out. */\n targetHandle: string | null | undefined\n}\n\n/** The iterations a node will run, in order. */\nexport interface FanOutPlan {\n /** One entry per iteration (list items, repeat / provider sentinels). */\n items: string[]\n /** Row each iteration reads its inputs from; undefined when nothing is list-driven. */\n rows: Array<number | undefined>\n /** Handle the driving list is wired to; undefined when nothing is list-driven. */\n targetHandle: string | null | undefined\n}\n\n/**\n * Expand a fan-out into its iterations (list x Repeat xN, providers, repeats —\n * `expandItemsWithRepeat` stays the single rule for that) and pin every\n * iteration to the ROW its item came from. Repeat xN runs a row N times: the\n * copies share the row, they do not walk on to the next one.\n */\nexport function planFanOut(\n fanOut: ListFanOut | undefined,\n nodeType: string,\n nodeData: Record<string, unknown>,\n): FanOutPlan | null {\n const items = expandItemsWithRepeat(fanOut?.items, nodeType, nodeData)\n if (!items) return null\n const listDriven = fanOut !== undefined && fanOut.items.length > 1\n if (!listDriven) return { items, rows: items.map(() => undefined), targetHandle: undefined }\n const perRow = items.length / fanOut.items.length\n return {\n items,\n rows: items.map((_, k) => fanOut.rowIndices[Math.floor(k / perRow)]),\n targetHandle: fanOut.targetHandle,\n }\n}\n\n/**\n * Extract Field, List output, over a root ARRAY: one entry per element, \"\" where\n * the element has no value — so two Extract Field lists cut from the same array\n * stay row-aligned. Returns undefined when rows cannot be defined (the root is\n * not an array, an element fans into several values, or no element carries the\n * field at all) — the caller then keeps the plain \"values that exist\" list.\n */\nexport function alignedFieldList(value: unknown, path: string): string[] | undefined {\n if (!Array.isArray(value) || value.length === 0) return undefined\n const out: string[] = []\n for (const element of value) {\n const found = evaluateJsonPath(element, path)\n if (found.length > 1) return undefined\n out.push(stringifyPathResults(found)[0] ?? \"\")\n }\n return out.some((v) => v.length > 0) ? out : undefined\n}\n","/**\n * Like Promise.allSettled but limits how many tasks run concurrently.\n * Uses a worker-pool pattern so a new task starts as soon as a slot frees up.\n * When `cancelledRef` is provided and becomes truthy, remaining un-started\n * tasks are skipped (already-running tasks continue to completion/rejection).\n */\nexport async function settledWithLimit<T>(\n tasks: (() => Promise<T>)[],\n limit: number,\n cancelledRef?: { cancelled: boolean },\n): Promise<PromiseSettledResult<T>[]> {\n const results: PromiseSettledResult<T>[] = new Array(tasks.length)\n let nextIndex = 0\n\n const cancelledError = new Error(\"Execution cancelled\")\n\n async function worker(): Promise<void> {\n while (nextIndex < tasks.length) {\n if (cancelledRef?.cancelled) break\n const idx = nextIndex++\n try {\n const value = await tasks[idx]()\n results[idx] = { status: \"fulfilled\", value }\n } catch (reason) {\n results[idx] = { status: \"rejected\", reason }\n }\n }\n }\n\n const workers = Array.from(\n { length: Math.min(limit, tasks.length) },\n () => worker(),\n )\n await Promise.all(workers)\n\n // Fill any un-started slots (from cancellation) with a shared rejection\n for (let i = 0; i < results.length; i++) {\n if (!results[i]) results[i] = { status: \"rejected\", reason: cancelledError }\n }\n\n return results\n}\n","/**\n * Sentinel value persisted by the \"None\" delimiter option in the UI. Distinct\n * from `undefined` (which means \"default to newline\") so we can tell the\n * difference between \"user actively chose not to split\" and \"field never set\".\n */\nexport const NO_SPLIT_DELIMITER = \"__none__\" as const\n\n/**\n * Split text using a loop node's column delimiter.\n *\n * Uses the first text-type column's `splitDelimiter` to determine\n * how to split upstream text. Falls back to newline when no delimiter\n * is configured. The \"first text column wins\" heuristic is intentional:\n * connected mode pipes a single text stream into the loop, so we use\n * the primary text column's delimiter as the split strategy.\n *\n * `splitDelimiter === NO_SPLIT_DELIMITER` (\"__none__\") returns the input as\n * a single-item array — the user explicitly opted out of splitting.\n */\nexport function splitByLoopDelimiter(\n text: string,\n columns: ReadonlyArray<{ type?: string; splitDelimiter?: string }> | undefined,\n): string[] {\n const firstTextCol = (columns ?? []).find((c) => (c.type ?? \"text\") === \"text\")\n const raw = firstTextCol?.splitDelimiter\n if (raw === NO_SPLIT_DELIMITER) {\n const trimmed = text.trim()\n return trimmed.length > 0 ? [trimmed] : []\n }\n const delimiter = raw ?? \"\\n\"\n return text.split(delimiter).map((s) => s.trim()).filter((s) => s.length > 0)\n}\n\n/**\n * Split pasted (or manually-triggered) text into rows, inserting below\n * the source row. Returns the new rows array and truncation metadata.\n *\n * Pure function — callers handle persisting the result and showing toasts.\n */\nexport function spliceDelimitedRows(\n rows: readonly (readonly string[])[],\n rowIndex: number,\n colIndex: number,\n pastedText: string,\n delimiter: string,\n columnCount: number,\n maxItems: number,\n): { newRows: string[][]; truncated: boolean; totalProduced: number } {\n const parts = pastedText.split(delimiter).map((s) => s.trim()).filter((s) => s.length > 0)\n if (parts.length <= 1) {\n // Nothing to split — return rows unchanged with first part (or original) in cell\n const newRows = rows.map((r) => [...r])\n if (parts.length === 1) newRows[rowIndex][colIndex] = parts[0]\n return { newRows, truncated: false, totalProduced: newRows.length }\n }\n\n const newRows = rows.map((r) => [...r])\n newRows[rowIndex][colIndex] = parts[0]\n const insertRows = parts.slice(1).map((part) => {\n const r = Array.from<string>({ length: columnCount }).fill(\"\")\n r[colIndex] = part\n return r\n })\n newRows.splice(rowIndex + 1, 0, ...insertRows)\n\n const truncated = newRows.length > maxItems\n const totalProduced = newRows.length\n return {\n newRows: truncated ? newRows.slice(0, maxItems) : newRows,\n truncated,\n totalProduced,\n }\n}\n","/** Delimiter the Generate Text templates instruct the LLM to emit between blocks. */\nexport const GENERATE_TEXT_DELIMITER = \"===NEXT===\"\n\n/**\n * Split a Generate Text result into fan-out items. Used by BOTH the frontend\n * extractNodeOutput and the backend output-extractor so single-node and DAG\n * execution produce identical `items`.\n */\nexport function splitGeneratedItems(text: string | null | undefined): string[] {\n if (!text) return []\n const parts = text.split(GENERATE_TEXT_DELIMITER).map((s) => s.trim()).filter(Boolean)\n if (parts.length > 0) return parts\n const trimmed = text.trim()\n return trimmed ? [trimmed] : []\n}\n","/**\n * Shared separator presets for the Combine Text and Split Text nodes.\n * Single source of truth for both the frontend DAG executor and backend orchestrator.\n */\n\nexport const SEPARATOR_PRESETS = [\n \"newline\",\n \"double-newline\",\n \"comma\",\n \"space\",\n \"stars\",\n \"custom\",\n] as const\n\nexport type SeparatorPreset = (typeof SEPARATOR_PRESETS)[number]\n\nconst SPLIT_MAP: Record<string, string> = {\n newline: \"\\n\",\n \"double-newline\": \"\\n\\n\",\n comma: \",\",\n space: \" \",\n stars: \"***\",\n}\n\nconst COMBINE_MAP: Record<string, string> = {\n ...SPLIT_MAP,\n comma: \", \",\n}\n\n/** Human-readable label for the node badge. */\nexport const SEPARATOR_DISPLAY: Record<string, string> = {\n newline: \"\\\\n\",\n \"double-newline\": \"\\\\n\\\\n\",\n comma: \",\",\n space: \"space\",\n stars: \"***\",\n}\n\nexport interface ResolveSeparatorOptions {\n /** Use combine-text spacing — e.g. \", \" for comma instead of \",\" */\n combineSpacing?: boolean\n}\n\n/**\n * Resolve a separator value to its actual string.\n * - Enum preset → mapped value (e.g. \"newline\" → \"\\n\")\n * - \"custom\" → customSeparator field\n * - Anything else → literal string (back-compat with legacy values like \"===NEXT===\")\n */\nexport function resolveSeparator(\n raw: string | undefined,\n customSeparator: string | undefined,\n opts?: ResolveSeparatorOptions,\n): string {\n const r = raw || \"newline\"\n if (r === \"custom\") return customSeparator ?? \"\"\n const map = opts?.combineSpacing ? COMBINE_MAP : SPLIT_MAP\n return map[r] ?? r\n}\n","/** Pure sort helper shared by the frontend DAG executor and the backend\n * orchestrator. Contract: reorder stringified list items (as produced by\n * `collectUpstreamListItems` peers) by an optional dot-path field, with\n * Auto/Text/Number/Date comparison and asc/desc direction. Items whose\n * key is missing, empty, or uncoerceable under the chosen type are always\n * appended last — regardless of direction. */\n\nimport { evaluateJsonPath } from \"./json-path.js\"\nimport { tryParseJson } from \"./filter-condition.js\"\n\nexport type SortType = \"auto\" | \"text\" | \"number\" | \"date\"\nexport type SortDirection = \"asc\" | \"desc\"\n\nexport interface SortListOptions {\n field: string\n sortType: SortType\n direction: SortDirection\n}\n\n// Natural numeric-aware, case-insensitive locale compare. Declared once so\n// both the Text branch and the Auto fallback reuse the same Collator.\nconst textCollator = new Intl.Collator(undefined, {\n sensitivity: \"base\",\n numeric: true,\n})\n\ninterface KeyedItem {\n item: string\n key: number | string\n keyKind: \"number\" | \"text\" | \"invalid\"\n}\n\nfunction extractRawKey(item: string, field: string): unknown {\n if (field === \"\") return item\n const parsed = tryParseJson(item)\n const matches = evaluateJsonPath(parsed, field)\n return matches.length > 0 ? matches[0] : undefined\n}\n\nfunction isMissing(v: unknown): boolean {\n if (v === undefined || v === null) return true\n if (typeof v === \"string\" && v.trim() === \"\") return true\n return false\n}\n\nfunction toNumberKey(v: unknown): number | undefined {\n if (typeof v === \"number\") return Number.isFinite(v) ? v : undefined\n if (typeof v === \"boolean\") return v ? 1 : 0\n if (typeof v === \"string\") {\n const trimmed = v.trim()\n if (trimmed === \"\") return undefined\n const n = Number(trimmed)\n return Number.isFinite(n) ? n : undefined\n }\n return undefined\n}\n\nfunction toDateKey(v: unknown): number | undefined {\n if (v instanceof Date) {\n const t = v.getTime()\n return Number.isFinite(t) ? t : undefined\n }\n if (typeof v === \"number\") return Number.isFinite(v) ? v : undefined\n if (typeof v === \"string\") {\n const t = Date.parse(v)\n return Number.isFinite(t) ? t : undefined\n }\n return undefined\n}\n\nfunction coerceKey(raw: unknown, sortType: SortType): Pick<KeyedItem, \"key\" | \"keyKind\"> {\n if (isMissing(raw)) return { key: \"\", keyKind: \"invalid\" }\n\n if (sortType === \"number\") {\n const n = toNumberKey(raw)\n return n === undefined\n ? { key: \"\", keyKind: \"invalid\" }\n : { key: n, keyKind: \"number\" }\n }\n\n if (sortType === \"date\") {\n const d = toDateKey(raw)\n return d === undefined\n ? { key: \"\", keyKind: \"invalid\" }\n : { key: d, keyKind: \"number\" }\n }\n\n if (sortType === \"text\") {\n return { key: typeof raw === \"string\" ? raw : JSON.stringify(raw), keyKind: \"text\" }\n }\n\n // auto: try number → date → text.\n const asNum = toNumberKey(raw)\n if (asNum !== undefined) return { key: asNum, keyKind: \"number\" }\n const asDate = toDateKey(raw)\n if (asDate !== undefined) return { key: asDate, keyKind: \"number\" }\n return { key: typeof raw === \"string\" ? raw : JSON.stringify(raw), keyKind: \"text\" }\n}\n\nexport function sortListItems(items: readonly string[], opts: SortListOptions): string[] {\n const { field, sortType, direction } = opts\n const keyed: KeyedItem[] = items.map((item) => {\n const raw = extractRawKey(item, field)\n const { key, keyKind } = coerceKey(raw, sortType)\n return { item, key, keyKind }\n })\n\n const sortable = keyed.filter((k) => k.keyKind !== \"invalid\")\n const invalid = keyed.filter((k) => k.keyKind === \"invalid\")\n\n const factor = direction === \"desc\" ? -1 : 1\n // Array.prototype.sort is guaranteed stable since ES2019 — equal keys\n // preserve their relative input order.\n sortable.sort((a, b) => {\n if (a.keyKind === \"number\" && b.keyKind === \"number\") {\n return ((a.key as number) - (b.key as number)) * factor\n }\n return textCollator.compare(String(a.key), String(b.key)) * factor\n })\n\n return [...sortable.map((k) => k.item), ...invalid.map((k) => k.item)]\n}\n","/**\n * The node types the server projects onto `workflow_triggers` rows when a\n * workflow is saved (backend `lib/workflow-trigger-sync.ts`), and that the\n * editor therefore asks the server to re-project after its own saves. One\n * vocabulary for both sides: a projected type added here reaches the\n * editor's \"does this save need a sync?\" question by construction.\n */\nexport const SCHEDULE_TRIGGER_NODE_TYPE = \"schedule-trigger\"\nexport const WEBHOOK_TRIGGER_NODE_TYPE = \"webhook-trigger\"\nexport const TELEGRAM_TRIGGER_NODE_TYPE = \"telegram-trigger\"\n/** Fires on a message that reaches a Telegram account the owner connected (Cloud). */\nexport const TELEGRAM_ACCOUNT_TRIGGER_NODE_TYPE = \"telegram-account-trigger\"\n\nexport const PROJECTED_TRIGGER_NODE_TYPES: ReadonlySet<string> = new Set([\n SCHEDULE_TRIGGER_NODE_TYPE,\n WEBHOOK_TRIGGER_NODE_TYPE,\n TELEGRAM_TRIGGER_NODE_TYPE,\n TELEGRAM_ACCOUNT_TRIGGER_NODE_TYPE,\n])\n\nexport function isProjectedTriggerNodeType(type: unknown): type is string {\n return typeof type === \"string\" && PROJECTED_TRIGGER_NODE_TYPES.has(type)\n}\n","/**\n * Schedule Trigger rules — the ONE model both sides read.\n *\n * A schedule is a list of rules; the workflow runs whenever any rule says\n * \"this minute\". The editor previews a schedule (headline, today's timeline,\n * the next runs, runs per day) and the server decides whether to fire — from\n * the same functions here, so what the panel shows is what the cron does.\n *\n * Kinds, with the fields each reads (everything else on the rule is ignored):\n * - `minutes` — `every` (1–59): at minute 0, N, 2N… of every hour (cron `*\\/N`).\n * - `hours` — `every` (1–23) at `minute`: at hour 0, N, 2N… of every day.\n * - `days` — `every` (1–31) at `hour:minute`: every Nth calendar day.\n * - `weeks` — `every` (1–52) on `weekdays` at `hour:minute`: every Nth week.\n * - `months` — `every` (1–12) on `dayOfMonth` at `hour:minute`: every Nth month\n * (a day the month lacks — 31 in April — runs on its last day).\n * - `cron` — a 5-field cron expression, for the person who wants one.\n *\n * \"Every Nth day / week / month\" counts from a fixed origin (the Unix epoch,\n * in the schedule's timezone; weeks start on Monday) rather than from the\n * moment the rule was saved — so the preview and the server agree, a re-save\n * never shifts the phase, and two people reading the rule get the same days.\n *\n * Time is read in the schedule's timezone (an IANA name; missing or unknown\n * → UTC — callers validate with `isValidTimezone` and refuse the unknown\n * ones, so that fallback is only ever a defence). Resolution is one minute:\n * the cron ticks once a minute and asks \"does this minute match?\" — there is\n * no sub-minute scheduling.\n *\n * Daylight-saving: a wall-clock minute that does not exist on the day the\n * clocks jump forward is skipped that day. On the day they fall back, a rule\n * that names a time of day (`hours` / `days` / `weeks` / `months` / `cron`)\n * runs once — the second pass is the same wall-clock minute\n * (`localMinuteKey`) as the fire just before it, and both the server and the\n * preview drop it — while a `minutes` rule keeps its cadence through the\n * repeated hour, because real time keeps passing.\n */\n\nexport const SCHEDULE_RULE_KINDS = [\"minutes\", \"hours\", \"days\", \"weeks\", \"months\", \"cron\"] as const\nexport type ScheduleRuleKind = (typeof SCHEDULE_RULE_KINDS)[number]\n\nexport interface ScheduleRule {\n readonly id: string\n readonly kind: ScheduleRuleKind\n /** Every N units (see `SCHEDULE_EVERY_LIMITS`). */\n readonly every?: number\n /** 0–23, in the schedule's timezone. Read by days / weeks / months. */\n readonly hour?: number\n /** 0–59. Read by every kind but `minutes` and `cron`. */\n readonly minute?: number\n /** 0 = Sunday … 6 = Saturday (the cron / JavaScript convention). Read by `weeks`. */\n readonly weekdays?: ReadonlyArray<number>\n /** 1–31. Read by `months`. */\n readonly dayOfMonth?: number\n /** A 5-field cron expression. Read by `cron`. */\n readonly cron?: string\n}\n\nexport interface ScheduleSpec {\n readonly rules: ReadonlyArray<ScheduleRule>\n /** IANA timezone; missing or unknown means UTC. */\n readonly timezone?: string\n /** Stop after this many runs; missing means unlimited. */\n readonly maxExecutions?: number\n}\n\n/** `every` limits per kind — the panel's range hints and the normaliser's clamps. */\nexport const SCHEDULE_EVERY_LIMITS: Readonly<Record<Exclude<ScheduleRuleKind, \"cron\">, readonly [number, number]>> = {\n minutes: [1, 59],\n hours: [1, 23],\n days: [1, 31],\n weeks: [1, 52],\n months: [1, 12],\n}\n\n// ---------------------------------------------------------------------------\n// Normalisation\n// ---------------------------------------------------------------------------\n\nfunction int(value: unknown): number | null {\n if (typeof value === \"number\" && Number.isFinite(value)) return Math.trunc(value)\n if (typeof value === \"string\" && /^-?\\d+$/.test(value.trim())) return parseInt(value.trim(), 10)\n return null\n}\n\nfunction clamp(value: number | null, lo: number, hi: number, fallback: number): number {\n if (value === null) return fallback\n return Math.min(hi, Math.max(lo, value))\n}\n\n/** A count of units: zero or less is \"not typed yet\", never \"every minute\". */\nfunction positiveInt(value: unknown): number | null {\n const n = int(value)\n return n !== null && n >= 1 ? n : null\n}\n\n/** A 5-field cron expression — the only shape the matcher understands. */\nexport function isCronExpression(value: unknown): value is string {\n return typeof value === \"string\" && value.trim().split(/\\s+/).filter(Boolean).length === 5\n}\n\n/**\n * One rule as the user typed it → one rule the engine can run, or `null` when\n * there is nothing to run (unknown kind, a cron rule with no expression, a\n * weeks rule with no weekday). Out-of-range numbers are clamped, never\n * refused: a half-typed \"0\" must not silently disable a schedule.\n */\nexport function normalizeScheduleRule(raw: unknown, fallbackId = \"rule-1\"): ScheduleRule | null {\n if (!raw || typeof raw !== \"object\") return null\n const r = raw as Record<string, unknown>\n if (typeof r.kind !== \"string\" || !(SCHEDULE_RULE_KINDS as readonly string[]).includes(r.kind)) return null\n const kind = r.kind as ScheduleRuleKind\n const id = typeof r.id === \"string\" && r.id.trim() ? r.id.trim() : fallbackId\n const minute = clamp(int(r.minute), 0, 59, 0)\n const hour = clamp(int(r.hour), 0, 23, 0)\n switch (kind) {\n case \"minutes\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.minutes, 5) }\n case \"hours\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.hours, 1), minute }\n case \"days\":\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.days, 1), hour, minute }\n case \"weeks\": {\n const weekdays = Array.isArray(r.weekdays)\n ? [...new Set(r.weekdays.map(int).filter((d): d is number => d !== null && d >= 0 && d <= 6))].sort((a, b) => a - b)\n : []\n if (weekdays.length === 0) return null\n return { id, kind, every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.weeks, 1), hour, minute, weekdays }\n }\n case \"months\":\n return {\n id,\n kind,\n every: clamp(positiveInt(r.every),...SCHEDULE_EVERY_LIMITS.months, 1),\n hour,\n minute,\n dayOfMonth: clamp(int(r.dayOfMonth), 1, 31, 1),\n }\n case \"cron\": {\n const cron = typeof r.cron === \"string\" ? r.cron.trim().split(/\\s+/).join(\" \") : \"\"\n return isCronExpression(cron) ? { id, kind, cron } : null\n }\n }\n}\n\n/** Every usable rule, in order; unusable ones dropped. */\nexport function normalizeScheduleRules(raw: unknown): ScheduleRule[] {\n if (!Array.isArray(raw)) return []\n return raw.map((r, i) => normalizeScheduleRule(r, `rule-${i + 1}`)).filter((r): r is ScheduleRule => r !== null)\n}\n\n/**\n * The schedule an OLD node carried — `interval` (\"5m\" / \"1h\" / \"1d\" or one of\n * the editor's cron presets) and/or `cron` — as rules. Seconds cannot be\n * scheduled (the cron ticks once a minute) and become \"every minute\".\n */\nexport function legacyScheduleToRules(data: { interval?: unknown; cron?: unknown; cronExpression?: unknown }): ScheduleRule[] {\n const interval = typeof data.interval === \"string\" ? data.interval.trim() : \"\"\n const explicit = [data.cron, data.cronExpression].find((v): v is string => typeof v === \"string\" && v.trim() !== \"\")?.trim() ?? \"\"\n const m = interval.match(/^(\\d+)([smhd])$/)\n if (m) {\n const n = parseInt(m[1], 10)\n // \"0m\" never fired (it parsed to 0 ms); it must not start firing now.\n if (n < 1) return []\n switch (m[2]) {\n case \"s\": return [{ id: \"rule-1\", kind: \"minutes\", every: 1 }]\n case \"m\": return n < 60\n ? [{ id: \"rule-1\", kind: \"minutes\", every: n }]\n : [{ id: \"rule-1\", kind: \"hours\", every: Math.min(23, Math.max(1, Math.round(n / 60))), minute: 0 }]\n case \"h\": return n < 24\n ? [{ id: \"rule-1\", kind: \"hours\", every: n, minute: 0 }]\n : [{ id: \"rule-1\", kind: \"days\", every: Math.min(31, Math.max(1, Math.round(n / 24))), hour: 0, minute: 0 }]\n default: return [{ id: \"rule-1\", kind: \"days\", every: Math.min(31, n), hour: 0, minute: 0 }]\n }\n }\n const expression = interval === \"\" || interval === \"custom\" ? explicit : interval\n if (!isCronExpression(expression)) return []\n const fromCron = cronToRule(expression)\n // Through the normaliser like every other rule: a cron nobody could say in\n // words (\"0 9 * * 5-0\" — an empty weekday set) must come out as \"not\n // configured\", never as a rule that silently matches nothing or everything.\n return normalizeScheduleRules([fromCron ?? { id: \"rule-1\", kind: \"cron\", cron: expression.split(/\\s+/).join(\" \") }])\n}\n\n/** A cron step; a zero or negative step is not a step (it never matched before either). */\nfunction cronStep(field: string): number | null {\n const m = field.match(/^\\*\\/(\\d+)$/)\n if (!m) return null\n const n = parseInt(m[1], 10)\n return n >= 1 ? n : null\n}\n\n/** The plain shapes a cron expression can be said in words; anything else stays a cron rule. */\nfunction cronToRule(expression: string): ScheduleRule | null {\n const [min, hour, dom, month, dow] = expression.trim().split(/\\s+/)\n if (month !== \"*\") return null\n const minN = /^\\d+$/.test(min) ? parseInt(min, 10) : null\n const hourN = /^\\d+$/.test(hour) ? parseInt(hour, 10) : null\n const stepMin = cronStep(min)\n const stepHour = cronStep(hour)\n if (stepMin !== null && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"minutes\", every: stepMin }\n if (min === \"*\" && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"minutes\", every: 1 }\n if (minN !== null && stepHour !== null && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"hours\", every: stepHour, minute: minN }\n if (minN !== null && hour === \"*\" && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"hours\", every: 1, minute: minN }\n if (minN !== null && hourN !== null && dom === \"*\" && dow === \"*\") return { id: \"rule-1\", kind: \"days\", every: 1, hour: hourN, minute: minN }\n if (minN !== null && hourN !== null && dom === \"*\" && /^[0-6](,[0-6])*$|^[0-6]-[0-6]$/.test(dow)) {\n const weekdays = dow.includes(\"-\")\n ? (() => { const [a, b] = dow.split(\"-\").map(Number); return Array.from({ length: b - a + 1 }, (_, i) => a + i) })()\n : dow.split(\",\").map(Number)\n return { id: \"rule-1\", kind: \"weeks\", every: 1, hour: hourN, minute: minN, weekdays }\n }\n if (minN !== null && hourN !== null && /^\\d+$/.test(dom) && dow === \"*\") {\n return { id: \"rule-1\", kind: \"months\", every: 1, hour: hourN, minute: minN, dayOfMonth: parseInt(dom, 10) }\n }\n return null\n}\n\n// ---------------------------------------------------------------------------\n// Local time\n// ---------------------------------------------------------------------------\n\nexport interface LocalTime {\n readonly year: number\n /** 1–12 */\n readonly month: number\n /** 1–31 */\n readonly day: number\n readonly hour: number\n readonly minute: number\n /** 0 = Sunday … 6 = Saturday */\n readonly weekday: number\n /** Calendar days since 1970-01-01, in the schedule's timezone. */\n readonly epochDay: number\n}\n\n/**\n * Formatters are cached under the zone's CANONICAL name (`resolvedOptions`),\n * never under the string a request spelled it with — \"aSiA/jErUsAlEm\" is\n * accepted by Intl, and a caller can spell a zone thousands of ways. The\n * spelling → canonical map is bounded too, since that is the one a request\n * can grow.\n */\nconst formatters = new Map<string, Intl.DateTimeFormat>()\nconst canonicalZone = new Map<string, string>()\nconst MAX_ZONE_SPELLINGS = 1024\n\nfunction formatterFor(timezone: string | undefined): Intl.DateTimeFormat | null {\n const spelled = timezone && timezone.trim() ? timezone.trim() : \"UTC\"\n const known = canonicalZone.get(spelled)\n if (known) return formatters.get(known) ?? null\n try {\n const fmt = new Intl.DateTimeFormat(\"en-US\", {\n timeZone: spelled,\n hourCycle: \"h23\",\n year: \"numeric\",\n month: \"2-digit\",\n day: \"2-digit\",\n hour: \"2-digit\",\n minute: \"2-digit\",\n })\n const canonical = fmt.resolvedOptions().timeZone\n if (!formatters.has(canonical)) formatters.set(canonical, fmt)\n if (canonicalZone.size >= MAX_ZONE_SPELLINGS) canonicalZone.clear()\n canonicalZone.set(spelled, canonical)\n return formatters.get(canonical) ?? fmt\n } catch {\n return null\n }\n}\n\n/** A timezone this runtime can read the clock in (an IANA name such as `Asia/Jerusalem`). */\nexport function isValidTimezone(value: unknown): value is string {\n return typeof value === \"string\" && value.trim() !== \"\" && formatterFor(value) !== null\n}\n\n/** One wall-clock minute, as a key: the same key twice means the clocks fell back. */\nexport function localMinuteKey(local: LocalTime): string {\n return `${local.epochDay}:${local.hour}:${local.minute}`\n}\n\nfunction localFromComponents(year: number, month: number, day: number, hour: number, minute: number): LocalTime {\n const epochDay = Math.floor(Date.UTC(year, month - 1, day) / 86400000)\n // 1970-01-01 was a Thursday (4).\n const weekday = (((epochDay % 7) + 7 + 4) % 7)\n return { year, month, day, hour: hour === 24 ? 0 : hour, minute, weekday, epochDay }\n}\n\n/** The wall-clock time in the schedule's timezone (UTC when it is missing or unknown). */\nexport function localTimeIn(date: Date, timezone?: string): LocalTime {\n const fmt = formatterFor(timezone)\n if (!fmt) return localFromComponents(date.getUTCFullYear(), date.getUTCMonth() + 1, date.getUTCDate(), date.getUTCHours(), date.getUTCMinutes())\n const parts: Record<string, number> = {}\n for (const p of fmt.formatToParts(date)) {\n if (p.type === \"literal\") continue\n parts[p.type] = parseInt(p.value, 10)\n }\n return localFromComponents(parts.year, parts.month, parts.day, parts.hour, parts.minute)\n}\n\n/** How far the timezone's wall clock is ahead of UTC at this instant, in minutes. */\nexport function timezoneOffsetMinutes(date: Date, timezone?: string): number {\n const local = localTimeIn(date, timezone)\n const asUtc = Date.UTC(local.year, local.month - 1, local.day, local.hour, local.minute)\n const truncated = Math.floor(date.getTime() / 60000) * 60000\n return Math.round((asUtc - truncated) / 60000)\n}\n\nfunction daysInMonth(year: number, month: number): number {\n return new Date(Date.UTC(year, month, 0)).getUTCDate()\n}\n\n// ---------------------------------------------------------------------------\n// Matching\n// ---------------------------------------------------------------------------\n\n/** Standard 5-field cron field: `*`, `N`, `a-b`, `a,b`, `*\\/N`, `a-b/N`, `a/N`. */\nexport function matchesCronField(field: string, value: number, min: number, max: number): boolean {\n if (field === \"*\") return true\n if (field.includes(\",\")) return field.split(\",\").some((part) => matchesCronField(part.trim(), value, min, max))\n if (field.includes(\"/\")) {\n const [range, step] = field.split(\"/\")\n const stepNum = parseInt(step, 10)\n if (Number.isNaN(stepNum) || stepNum <= 0) return false\n if (range === \"*\") return value % stepNum === 0\n if (range.includes(\"-\")) {\n const [start, end] = parseRange(range)\n if (start === null || end === null) return false\n return value >= start && value <= end && (value - start) % stepNum === 0\n }\n const start = parseInt(range, 10)\n if (Number.isNaN(start)) return false\n return value >= start && value <= max && (value - start) % stepNum === 0\n }\n if (field.includes(\"-\")) {\n const [start, end] = parseRange(field)\n if (start === null || end === null) return false\n return value >= start && value <= end\n }\n const num = parseInt(field, 10)\n return !Number.isNaN(num) && num === value\n}\n\nfunction parseRange(range: string): [number | null, number | null] {\n const parts = range.split(\"-\")\n if (parts.length !== 2) return [null, null]\n const start = parseInt(parts[0], 10)\n const end = parseInt(parts[1], 10)\n return [Number.isNaN(start) ? null : start, Number.isNaN(end) ? null : end]\n}\n\n/** Does this wall-clock minute match the cron expression? */\nexport function matchesCron(expression: string, local: LocalTime): boolean {\n const fields = expression.trim().split(/\\s+/)\n if (fields.length !== 5) return false\n // Every field must match (day-of-month AND day-of-week — the stricter of\n // the two readings crontabs disagree on; documented). Sunday answers to 7\n // as well as 0, as it does in every crontab.\n return (\n matchesCronField(fields[0], local.minute, 0, 59) &&\n matchesCronField(fields[1], local.hour, 0, 23) &&\n matchesCronField(fields[2], local.day, 1, 31) &&\n matchesCronField(fields[3], local.month, 1, 12) &&\n (matchesCronField(fields[4], local.weekday, 0, 6) || (local.weekday === 0 && matchesCronField(fields[4], 7, 0, 7)))\n )\n}\n\n/** Does this wall-clock minute match the rule? */\nexport function ruleMatches(rule: ScheduleRule, local: LocalTime): boolean {\n const every = Math.max(1, rule.every ?? 1)\n const minute = rule.minute ?? 0\n const hour = rule.hour ?? 0\n switch (rule.kind) {\n case \"minutes\":\n return local.minute % every === 0\n case \"hours\":\n return local.minute === minute && local.hour % every === 0\n case \"days\":\n return local.minute === minute && local.hour === hour && local.epochDay % every === 0\n case \"weeks\": {\n // Monday-start weeks counted from the epoch (1970-01-01 was a Thursday, so +3 lands Monday 1969-12-29 on week 0).\n const weekIndex = Math.floor((local.epochDay + 3) / 7)\n return (\n local.minute === minute &&\n local.hour === hour &&\n (rule.weekdays ?? []).includes(local.weekday) &&\n weekIndex % every === 0\n )\n }\n case \"months\": {\n const wanted = Math.min(rule.dayOfMonth ?? 1, daysInMonth(local.year, local.month))\n const monthIndex = local.year * 12 + (local.month - 1)\n return local.minute === minute && local.hour === hour && local.day === wanted && monthIndex % every === 0\n }\n case \"cron\":\n return typeof rule.cron === \"string\" && matchesCron(rule.cron, local)\n }\n}\n\n/** Does the schedule run at this instant (any rule, this minute)? */\nexport function scheduleMatchesAt(spec: ScheduleSpec, at: Date): boolean {\n if (spec.rules.length === 0) return false\n const local = localTimeIn(at, spec.timezone)\n return spec.rules.some((rule) => ruleMatches(rule, local))\n}\n\n// ---------------------------------------------------------------------------\n// Occurrences (previews)\n// ---------------------------------------------------------------------------\n\n/** Clocks change on a quarter hour at the latest (Adelaide and Lord Howe move mid-UTC-hour), so the offset is re-read per 15-minute slot. */\nconst OFFSET_SLOT_MS = 15 * 60000\n\n/**\n * Every minute in [from, until] at which the schedule runs, oldest first, at\n * most `cap`. Scans minute by minute with the timezone offset re-read once per\n * quarter hour, so a 62-day horizon costs ~90k cheap checks and ~6k clock\n * reads. A wall-clock minute the clocks fall back onto is listed once.\n */\nexport function scheduleOccurrences(spec: ScheduleSpec, from: Date, until: Date, cap: number): Date[] {\n const out: Date[] = []\n if (spec.rules.length === 0 || cap <= 0) return out\n const rules = spec.rules\n let t = Math.ceil(from.getTime() / 60000) * 60000\n const end = until.getTime()\n let slot = -1\n let offset = 0\n let lastKey = \"\"\n while (t <= end && out.length < cap) {\n const thisSlot = Math.floor(t / OFFSET_SLOT_MS)\n if (thisSlot !== slot) {\n slot = thisSlot\n offset = timezoneOffsetMinutes(new Date(t), spec.timezone)\n }\n const shifted = new Date(t + offset * 60000)\n const local = localFromComponents(\n shifted.getUTCFullYear(),\n shifted.getUTCMonth() + 1,\n shifted.getUTCDate(),\n shifted.getUTCHours(),\n shifted.getUTCMinutes(),\n )\n if (rules.some((rule) => ruleMatches(rule, local))) {\n const key = localMinuteKey(local)\n if (key !== lastKey) out.push(new Date(t))\n lastKey = key\n }\n t += 60000\n }\n return out\n}\n\nconst DAY_MS = 86400000\n\n/**\n * How far ahead a preview must look to find the schedule's next run: two\n * periods of its slowest rule (a quarterly rule needs half a year, a yearly\n * one two), never less than two months and never more than ~two years.\n */\nexport function previewHorizonMs(rules: ReadonlyArray<ScheduleRule>): number {\n let longest = 0\n for (const rule of rules) {\n const every = Math.max(1, rule.every ?? 1)\n const period =\n rule.kind === \"days\" ? every * DAY_MS\n : rule.kind === \"weeks\" ? every * 7 * DAY_MS\n : rule.kind === \"months\" ? every * 31 * DAY_MS\n : rule.kind === \"cron\" ? 366 * DAY_MS\n : DAY_MS\n if (period > longest) longest = period\n }\n return Math.min(800 * DAY_MS, Math.max(62 * DAY_MS, longest * 2 + DAY_MS))\n}\n\n/**\n * The next `count` runs strictly after `from` (the minute `from` is in does\n * not count, the very next one does), looking `horizonMs` ahead — by default\n * as far as the rules need (`previewHorizonMs`).\n */\nexport function nextScheduleRuns(spec: ScheduleSpec, from: Date, count: number, horizonMs = previewHorizonMs(spec.rules)): Date[] {\n return scheduleOccurrences(spec, new Date(from.getTime() + 1), new Date(from.getTime() + horizonMs), count)\n}\n\n// Putting a rule into words is deliberately NOT here: the editor says it in\n// the person's language (i18n), and nothing in the wire contract needs the\n// English. The rule's fields are the structured form to render from.\n","/**\n * Schedule Trigger \"Retry on failure\" — the ONE shape both sides read.\n *\n * A scheduled run nobody watches can fail for a reason that passes\n * (a provider lane down for a while). With a retry policy on the node, the\n * server runs the failed run again after a wait, a bounded number of times;\n * absent, nothing is retried and the schedule behaves exactly as before.\n *\n * - `afterMinutes` — how long after the failure the retry may start.\n * - `maxAttempts` — how many retries one failed scheduled run may get\n * (the original run is not an attempt).\n * - `cheapLanesOnly` — the model calls made by the run (the original\n * scheduled run AND its retries) that honour the flag stay on the\n * aggregator lane: a call that fails there is not re-asked on the vendor's\n * own, pricier API; it fails, and the retry handles it later. Which node\n * types honour it is listed on the Schedule Trigger's docs page\n * (docs/nodes/input/schedule-trigger.md, \"Cheap lanes only\").\n *\n * The node stores it as `data.retry`, the server projects it onto the\n * trigger row's `config.retry` (lib/workflow-trigger-sync.ts), and the API\n * takes the same object in `config` (POST / PATCH /v1/workflow-triggers).\n */\n\nexport interface ScheduleRetry {\n /** 5–1440 (a day). */\n readonly afterMinutes: number\n /** 1–5. */\n readonly maxAttempts: number\n readonly cheapLanesOnly: boolean\n}\n\nexport const SCHEDULE_RETRY_LIMITS = {\n afterMinutes: [5, 1440] as const,\n maxAttempts: [1, 5] as const,\n} as const\n\nexport const SCHEDULE_RETRY_DEFAULTS: ScheduleRetry = Object.freeze({\n afterMinutes: 30,\n maxAttempts: 3,\n cheapLanesOnly: true,\n})\n\nfunction int(value: unknown): number | null {\n if (typeof value === \"number\" && Number.isFinite(value)) return Math.trunc(value)\n if (typeof value === \"string\" && /^-?\\d+$/.test(value.trim())) return parseInt(value.trim(), 10)\n return null\n}\n\nfunction clamp(value: number | null, [lo, hi]: readonly [number, number], fallback: number): number {\n if (value === null) return fallback\n return Math.min(hi, Math.max(lo, value))\n}\n\n/**\n * A retry policy as stored on a node or a row → the policy the server runs,\n * or `null` when there is none (absent, `null`, or not an object — the\n * feature off). Out-of-range numbers are clamped, never refused: like a\n * rule, a half-typed value must not silently switch the retry off; the API\n * refuses out-of-range values before they are stored (its Zod), so a stored\n * value reaching the clamp is a node written by hand.\n */\nexport function normalizeScheduleRetry(raw: unknown): ScheduleRetry | null {\n if (!raw || typeof raw !== \"object\") return null\n const r = raw as Record<string, unknown>\n return {\n afterMinutes: clamp(int(r.afterMinutes), SCHEDULE_RETRY_LIMITS.afterMinutes, SCHEDULE_RETRY_DEFAULTS.afterMinutes),\n maxAttempts: clamp(int(r.maxAttempts), SCHEDULE_RETRY_LIMITS.maxAttempts, SCHEDULE_RETRY_DEFAULTS.maxAttempts),\n // Off only when said so: the default keeps a scheduled run on the cheap lanes.\n cheapLanesOnly: r.cheapLanesOnly !== false,\n }\n}\n","/**\n * Build a label→output map for `{Node Label}` refs inside condition values\n * on filter-list and router nodes.\n *\n * Only considers edges whose `targetHandle === VARIABLES_HANDLE_ID` — the\n * dedicated condition-variables input handle. Data-flow edges (targetHandle\n * `\"in\"`, column handles, etc.) are ignored, so variable sources never\n * influence the filtered/routed list.\n *\n * Duplicate labels are suffixed `Same`, `Same (2)`, `Same (3)` — matches\n * the convention in `buildNodeRefMap` (frontend) / `buildNodeRefsMap`\n * (backend) for text-prompt refs.\n */\n\nexport const VARIABLES_HANDLE_ID = \"variables\"\n\ntype EdgeShape = {\n source: string\n target: string\n sourceHandle?: string | null\n targetHandle?: string | null\n}\n\ntype NodeShape = {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nexport function buildConditionVariables<\n E extends EdgeShape,\n N extends NodeShape,\n>(\n targetNodeId: string,\n edges: ReadonlyArray<E>,\n nodes: ReadonlyArray<N>,\n extractOutput: (node: N) => string | undefined,\n): Map<string, string> {\n const pairs: Array<{ label: string; output: string }> = []\n for (const edge of edges) {\n if (edge.target !== targetNodeId) continue\n if (edge.targetHandle !== VARIABLES_HANDLE_ID) continue\n const src = nodes.find((n) => n.id === edge.source)\n if (!src) continue\n // Surrounding whitespace is never part of a variable: a model's answer\n // (\"<id>\\n\") must still equal the field it is compared with.\n const output = extractOutput(src)?.trim()\n if (output === undefined || output === \"\") continue\n const label = (src.data.label as string) || src.type || src.id\n pairs.push({ label, output })\n }\n\n const map = new Map<string, string>()\n const counts = new Map<string, number>()\n for (const { label } of pairs) counts.set(label, (counts.get(label) ?? 0) + 1)\n const seen = new Map<string, number>()\n for (const { label, output } of pairs) {\n let key = label\n if ((counts.get(label) ?? 0) > 1) {\n const n = (seen.get(label) ?? 0) + 1\n seen.set(label, n)\n if (n > 1) key = `${label} (${n})`\n }\n map.set(key, output)\n }\n return map\n}\n","/**\n * Helpers for reading a node's accumulated `generatedResults` array.\n *\n * Used by both frontend DAG executor (`node-input-resolver.ts`) and backend\n * orchestrator (`output-extractor.ts`) so they agree on when a node has\n * upstream-consumable output.\n */\n\n/**\n * Extract all output values from a node's accumulated generatedResults.\n * Returns the full flat list (any length). Returns undefined only when empty.\n */\nexport function extractAllGeneratedResults(\n data: Record<string, unknown>,\n): string[] | undefined {\n const results = data.generatedResults as\n | Array<{ url?: string; text?: string }>\n | undefined\n if (!results || results.length === 0) return undefined\n const outputs = results\n .map((r) => r.url || r.text || \"\")\n .filter((v) => v.length > 0)\n return outputs.length > 0 ? outputs : undefined\n}\n\n/**\n * Extract a JSON array (e.g. web-scrape `generatedJson`) as a list of strings.\n * Each array element is stringified; already-string elements pass through.\n */\nexport function extractGeneratedJsonAsList(\n data: Record<string, unknown>,\n): string[] | undefined {\n const jsonArr = data.generatedJson\n if (!Array.isArray(jsonArr) || jsonArr.length === 0) return undefined\n return jsonArr.map((item: unknown) =>\n typeof item === \"string\" ? item : JSON.stringify(item),\n )\n}\n\n/**\n * If a collected item list has a single entry whose contents parse to a\n * non-empty JSON array, spread the array's elements into separate items.\n * Mirrors the `output.json` spread in the orchestrator so a list node with\n * one row holding a JSON array feeds filter-list / deduplicate / sort-list /\n * merge-lists per-element instead of as one giant stringified blob.\n */\nexport function spreadJsonArrayIfSingleton(items: string[]): string[] {\n if (items.length !== 1) return items\n const single = items[0]\n if (typeof single !== \"string\") return items\n const trimmed = single.trim()\n if (!trimmed.startsWith(\"[\")) return items\n let parsed: unknown\n try {\n parsed = JSON.parse(trimmed)\n } catch {\n return items\n }\n if (!Array.isArray(parsed) || parsed.length === 0) return items\n return parsed.map((el) =>\n typeof el === \"string\" ? el : JSON.stringify(el),\n )\n}\n","/**\n * Replace {} placeholders in a field value with upstream text.\n *\n * ONLY handles {} injection. Does NOT inject into empty fields.\n * Empty-field fallback (d.prompt || inputs.prompt) stays in per-node\n * execution code — the resolver doesn't decide which field is \"primary.\"\n */\nexport function injectUpstream(\n fieldValue: string | undefined,\n upstream: string | undefined,\n): string | undefined {\n if (!fieldValue || !upstream) return fieldValue\n if (fieldValue.includes(\"{}\")) return fieldValue.replaceAll(\"{}\", upstream)\n return fieldValue\n}\n","import { injectUpstream } from \"./inject-upstream.js\"\n\n/** A live wire into a field's handle: which node, and which of its outputs. */\nexport interface FieldEdgeSource {\n readonly sourceNodeId: string\n readonly sourceHandle?: string | null\n}\n\n/**\n * Resolve fieldMappings + {} injection for all text fields on a node.\n *\n * Three resolution mechanisms, in precedence order per field:\n * 1. edge source: a live edge into the field's handle → use that node's\n * output. Prefix-agnostic — the caller decides which edges map to which\n * field (e.g. FE/BE wrappers match `field-<key>` handles). Wins over both\n * fieldMappings and {} injection.\n * 2. fieldMappings: field mapped to source node → use that node's output\n * 3. {} injection: manual field contains {} → replace with upstreamText\n *\n * Does NOT inject upstream into empty unmapped fields — that stays in\n * per-node execution code (e.g., d.prompt || inputs.prompt).\n *\n * The `getSourceOutput` callback abstracts how source node output is\n * extracted — frontend reads from live React Flow state, backend reads\n * from NodeExecutionState.output. Same pattern as ancestor-refs.ts.\n *\n * `edgeSourceForField` is optional: when omitted, behaviour is identical to\n * the prior fieldMappings-only resolver (existing callers stay valid). When\n * it names the wire's source HANDLE too, the value is that handle's output —\n * a Router's route, a trigger's named output — not the source's primary one.\n */\nexport function resolveFieldMappings(\n data: Record<string, unknown>,\n upstreamText: string | undefined,\n mappableFieldNames: ReadonlyArray<string>,\n getSourceOutput: (sourceNodeId: string, sourceHandle?: string | null) => string | undefined,\n edgeSourceForField?: (field: string) => FieldEdgeSource | string | undefined,\n): Record<string, unknown> {\n const fm = data.fieldMappings as Record<string, { sourceNodeId: string }> | undefined\n const resolved = { ...data }\n\n for (const field of mappableFieldNames) {\n const wired = edgeSourceForField?.(field)\n const edge: FieldEdgeSource | undefined = typeof wired === \"string\" ? { sourceNodeId: wired } : wired\n const sourceNodeId = edge?.sourceNodeId ?? fm?.[field]?.sourceNodeId\n\n if (sourceNodeId) {\n const output = getSourceOutput(sourceNodeId, edge?.sourceHandle)\n if (output != null) resolved[field] = output\n } else {\n const current = resolved[field]\n if (typeof current === \"string\") {\n const injected = injectUpstream(current, upstreamText)\n if (injected !== current) resolved[field] = injected\n }\n }\n }\n\n return resolved\n}\n\n/**\n * Location buckets that may carry generated/uploaded variants. Mirrors the\n * full set of attachable buckets in `entity-prompts.ts::LOCATION_ATTACH_COLUMNS`,\n * but in camelCase (matching the in-memory location object and the\n * `WorkflowExportLocation` export shape).\n */\nconst LOCATION_BUCKETS = [\n \"timeOfDay\",\n \"weather\",\n \"seasons\",\n \"angles\",\n \"lighting\",\n \"atmosphereMotions\",\n] as const\n\ninterface LocationFieldEntry {\n /** Stable key — `sourceImageUrl` or `<bucket>[<index>]`. */\n key: string\n /** Human-readable label — `Main image` or `<bucket> / <variant.name>`. */\n label: string\n /** R2 URL of the image. */\n url: string\n}\n\n/**\n * Flatten a location's anchor image and every variant bucket into a single\n * ordered list of `{ key, label, url }` entries. Used by picker UIs and\n * ref-resolvers that need a stable, position-keyed view of every image\n * attached to a location.\n *\n * Bucket iteration order is fixed (see `LOCATION_BUCKETS`) so frontend and\n * backend produce identical lists from the same fixture. Missing buckets and\n * non-array values are treated as empty — the helper never throws.\n *\n * Mirrors the future character/object variants of this helper; same shape\n * (`key`, `label`, `url`) so callers can be polymorphic over entity kind.\n */\nexport function resolveLocationFields(\n loc: Record<string, unknown>,\n): LocationFieldEntry[] {\n const out: LocationFieldEntry[] = []\n\n if (typeof loc.sourceImageUrl === \"string\" && loc.sourceImageUrl.length > 0) {\n out.push({\n key: \"sourceImageUrl\",\n label: \"Main image\",\n url: loc.sourceImageUrl,\n })\n }\n\n for (const bucket of LOCATION_BUCKETS) {\n const raw = loc[bucket]\n if (!Array.isArray(raw)) continue\n raw.forEach((item, i) => {\n if (!item || typeof item !== \"object\") return\n const variant = item as { name?: unknown; url?: unknown }\n if (typeof variant.url !== \"string\" || variant.url.length === 0) return\n const name = typeof variant.name === \"string\" ? variant.name : \"\"\n out.push({\n key: `${bucket}[${i}]`,\n label: `${bucket} / ${name}`,\n url: variant.url,\n })\n })\n }\n\n return out\n}\n","/**\n * Follow a list node's `in` edge chain to its effective upstream source.\n *\n * When a `list` node has no manual rows but an incoming connection, the UI\n * renders its upstream's items (see list-node.tsx's `connectedItems ??\n * staticItems`). Without this helper, downstream readers would see an empty\n * list because `extractSourceNodeOutput` for `list` only reads `data.rows`.\n *\n * Shared between the frontend DAG executor (`node-input-resolver.ts`) and\n * the backend orchestrator (`inline-executor.ts`) so both paths resolve\n * list-connected-mode identically.\n */\n\ntype EdgeShape = {\n source: string\n target: string\n sourceHandle?: string | null\n targetHandle?: string | null\n}\n\ntype NodeShape = {\n id: string\n type?: string\n data: Record<string, unknown>\n}\n\nfunction hasAnyRow(rows: string[][]): boolean {\n return rows.some((r) => r.some((v) => v?.trim()))\n}\n\nexport function resolveSourceThroughConnectedList<\n E extends EdgeShape,\n N extends NodeShape,\n>(edge: E, nodes: ReadonlyArray<N>, edges: ReadonlyArray<E>): E {\n const visited = new Set<string>()\n let current = edge\n while (true) {\n const src = nodes.find((n) => n.id === current.source)\n if (!src || src.type !== \"list\") return current\n if (visited.has(src.id)) return current\n visited.add(src.id)\n const rows = (src.data.rows as string[][] | undefined) ?? []\n if (hasAnyRow(rows)) return current\n const inEdge = edges.find(\n (e) => e.target === src.id && e.targetHandle === \"in\",\n )\n if (!inEdge) return current\n current = inEdge\n }\n}\n","/**\n * The displayed size of the image wired into a node's `image` input, as the\n * node it comes from records it: the result it shows (`generatedResults` at\n * `activeResultIndex`, its `width` and `height`), else its own `width` and\n * `height` (an upload). What an estimate that cannot read the file (the\n * editor's badge, a workflow estimate) knows of a photo's size. `undefined`\n * when no wired node records one.\n */\nimport type { SourceImageSize } from \"./model-catalog.js\"\n\nexport interface SizedGraphNode {\n id?: string\n data?: Record<string, unknown> | null\n}\n\nexport interface SizedGraphEdge {\n source?: string\n target?: string | null\n targetHandle?: string | null\n}\n\nconst positive = (v: unknown): v is number => typeof v === \"number\" && Number.isFinite(v) && v > 0\n\nexport function recordedImageSize(data: Record<string, unknown> | null | undefined): SourceImageSize | undefined {\n if (!data) return undefined\n const results = Array.isArray(data.generatedResults) ? (data.generatedResults as Array<Record<string, unknown> | null>) : []\n const index = typeof data.activeResultIndex === \"number\" ? data.activeResultIndex : 0\n const shown = results[index] ?? results[0]\n if (shown && positive(shown.width) && positive(shown.height)) return { width: shown.width, height: shown.height }\n if (positive(data.width) && positive(data.height)) return { width: data.width, height: data.height }\n return undefined\n}\n\nexport function wiredImageSize(\n nodeId: string,\n nodes: ReadonlyArray<SizedGraphNode>,\n edges: ReadonlyArray<SizedGraphEdge>,\n): SourceImageSize | undefined {\n for (const edge of edges) {\n if (edge.target !== nodeId || !edge.source || (edge.targetHandle ?? \"image\") !== \"image\") continue\n const size = recordedImageSize(nodes.find((n) => n.id === edge.source)?.data)\n if (size) return size\n }\n return undefined\n}\n\n/** True when a node carries an inpainting mask: its own `maskUrl`, or a wire into its `mask` input. */\nexport function nodeIsMasked(\n nodeId: string,\n data: Record<string, unknown> | null | undefined,\n edges: ReadonlyArray<SizedGraphEdge> | undefined,\n): boolean {\n if (typeof data?.maskUrl === \"string\" && data.maskUrl.length > 0) return true\n return (edges ?? []).some((e) => e.target === nodeId && e.targetHandle === \"mask\")\n}\n","import { tryParseJson } from \"./filter-condition.js\"\n\n/**\n * Element-wise merge across upstream lists with modulo-wrap.\n *\n * Used by the `merge-lists` node's \"zip\" mode. Each output position i takes\n * `lists[j][i % lists[j].length]` from every input; JSON objects are spread\n * into a single object (later sources override earlier ones on key conflicts),\n * non-object items are stringified and concatenated.\n *\n * Length semantics mirror the DAG's existing fan-out behavior: the result\n * length equals `max(len)` across non-empty inputs. Shorter inputs cycle.\n * This means a single-item upstream (e.g. a JSON-process node emitting one\n * object, or a list with one row) is automatically injected into every\n * element of a longer list.\n */\nexport function zipMergeLists(lists: ReadonlyArray<ReadonlyArray<string>>): string[] {\n const nonEmpty = lists.filter((l) => l.length > 0)\n if (nonEmpty.length === 0) return []\n if (nonEmpty.length === 1) return [...nonEmpty[0]]\n\n const maxLen = Math.max(...nonEmpty.map((l) => l.length))\n const out: string[] = []\n for (let i = 0; i < maxLen; i++) {\n const merged: Record<string, unknown> = {}\n const rawItems: string[] = []\n let hasObject = false\n for (const list of nonEmpty) {\n const item = list[i % list.length]\n rawItems.push(item)\n const parsed = tryParseJson(item)\n if (parsed && typeof parsed === \"object\" && !Array.isArray(parsed)) {\n hasObject = true\n Object.assign(merged, parsed as Record<string, unknown>)\n }\n }\n out.push(hasObject ? JSON.stringify(merged) : rawItems.join(\"\"))\n }\n return out\n}\n","import type { GenericNode, GenericEdge } from \"./types.js\"\nimport { EXECUTION_DATA_KEYS, NODE_TYPE_EXECUTION_DATA_KEYS } from \"./node-runtime-keys.js\"\nimport { SOCIAL_POST_NODE_TYPES } from \"./social-post.js\"\n\n/** A named media variant (expression, pose, angle, etc.) produced during entity generation. */\ninterface AssetVariant {\n name: string\n url: string\n}\n\n/** A mood-board / scrap photo attached to a location ({@link WorkflowExportLocation.referencePhotos}). */\ninterface ReferencePhoto {\n kind: string\n url: string\n}\n\nexport interface WorkflowExportCharacter {\n id: string\n nodeId: string\n name: string\n description?: string | null\n gender?: string | null\n style?: string | null\n baseOutfit?: string | null\n sourceImageUrl?: string | null\n expressions?: AssetVariant[]\n poses?: AssetVariant[]\n lightingVariations?: AssetVariant[]\n}\n\nexport interface WorkflowExportObject {\n id: string\n nodeId: string\n name: string\n description?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n angles?: AssetVariant[]\n materials?: AssetVariant[]\n variations?: AssetVariant[]\n}\n\n/** Animal/Creature entity export shape. Structural clone of {@link WorkflowExportObject}\n * with the object→creature DELTA MAP: adds free-text `species`, and the `materials`\n * asset slot becomes `poses`. */\nexport interface WorkflowExportCreature {\n id: string\n nodeId: string\n name: string\n description?: string | null\n species?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n angles?: AssetVariant[]\n poses?: AssetVariant[]\n variations?: AssetVariant[]\n}\n\nexport interface WorkflowExportLocation {\n id: string\n nodeId: string\n name: string\n description?: string | null\n style?: string | null\n sourceImageUrl?: string | null\n timeOfDay?: AssetVariant[]\n weather?: AssetVariant[]\n angles?: AssetVariant[]\n // Location Studio Phase 1 (migration 124).\n lighting?: AssetVariant[]\n seasons?: AssetVariant[]\n atmosphereMotions?: AssetVariant[]\n referencePhotos?: ReferencePhoto[]\n canonicalDescription?: string | null\n styleLock?: boolean | null\n}\n\n/** A media URL referenced from a node's data, located by node + field path. */\nexport interface WorkflowMediaRef {\n nodeId: string\n nodeLabel?: string\n /** Dot/bracket path inside `node.data`, e.g. `imageUrl` or `referenceImageUrls[1]`. */\n field: string\n url: string\n}\n\n/**\n * Export-time portability analysis (#866). A bundle exported from a private\n * host carries media URLs only that host can serve (`http://localhost:3000/\n * storage/…`, a LAN address, a `.internal` name); imported anywhere else, the\n * nodes fail at Run time with an opaque provider fetch error. The exporter\n * lists those URLs here so the person exporting is told BEFORE sharing, and\n * an importer can explain what will not load. Absent when every media URL is\n * publicly routable.\n */\nexport interface WorkflowPortability {\n unreachableMedia: WorkflowMediaRef[]\n}\n\n/** The four entity kinds a bundle's `assets` can carry. */\nexport type WorkflowAssetKind = \"character\" | \"object\" | \"creature\" | \"location\"\n\n/**\n * A bundled entity the import declined to re-create (#1088). The workflow\n * still lands — the film is the thing the importer asked for — so this is how\n * they hear that an `@` chip arrived unbound.\n */\nexport interface WorkflowImportSkippedAsset {\n kind: WorkflowAssetKind\n /** The entity's id IN THE BUNDLE (the exporter's row id). */\n id: string\n name: string\n reason: string\n}\n\n/**\n * What the importer did about the bundle's media (#866). Publicly reachable\n * media that is not already on the importing instance's own storage is\n * copied there (`rehosted`) so the workflow runs from local copies; media on\n * a host the importer cannot reach is left as-is and listed (`unreachable`);\n * anything declined for another reason (too large, not a media type, over\n * the per-import cap, upload failed) is listed with the reason (`skipped`).\n *\n * The bundle's ENTITY images (`assets`) ride the same walk (#1088) — with one\n * rule of their own: they are copied even when they already sit on this\n * instance, because they are the EXPORTER's bytes and the two accounts'\n * lifecycles are uncorrelated (their delete, their quarantine sweep, their\n * retention reaper). Only bytes the importer already owns are left alone.\n */\nexport interface WorkflowImportReport {\n rehosted: number\n unreachable: WorkflowMediaRef[]\n skipped: Array<WorkflowMediaRef & { reason: string }>\n /**\n * Bundled entity id (the EXPORTER's) → the row created under the importer,\n * for every entity the import re-created. Present whenever the bundle\n * carried `assets`. A client that holds chips outside the graph — a\n * timeline, a copy-a-shared-production path that never posts to\n * `/v1/workflows/import` — re-points them with this; the server has already\n * re-pointed every `references[]` entry inside the nodes it stored.\n */\n assetIdMap?: Record<string, string>\n /** Entities the import declined to create (storage quota). The workflow\n * still landed; chips bound to these arrive unresolvable. */\n assetsSkipped?: WorkflowImportSkippedAsset[]\n /** Anything else the importer should know, e.g. copies were made but the\n * workflow could not be updated to use them. */\n notes?: string[]\n}\n\nexport interface WorkflowExport {\n version: 1\n exportedAt: string\n name: string\n nodes: GenericNode[]\n edges: GenericEdge[]\n settings?: Record<string, unknown>\n assets?: {\n characters: WorkflowExportCharacter[]\n objects: WorkflowExportObject[]\n creatures?: WorkflowExportCreature[]\n locations: WorkflowExportLocation[]\n }\n /** Present only when the bundle references media another instance cannot fetch. */\n portability?: WorkflowPortability\n}\n\n/**\n * Config keys that are (mis)classified inside EXECUTION_DATA_KEYS but are\n * actually USER CONFIG a template MUST keep — NOT runtime/result. `shots` is\n * the Kling-3.0 multi-shot storyboard (user-authored, route-accepted via\n * shotsSchema); stripping it on template export silently drops every shot's\n * prompt+duration while leaving `multiShot:true`, producing a broken template.\n * (`elements`, the sibling Kling-3 config, is correctly absent from\n * EXECUTION_DATA_KEYS — `shots` should arguably be too, but is kept there for\n * other run-state consumers, so we exclude it here rather than reclassify.)\n */\nconst TEMPLATE_KEEP_CONFIG_KEYS = new Set<string>([\"shots\"])\n\n/**\n * Top-level node data fields cleared on template export. Built from\n * EXECUTION_DATA_KEYS (the single source of truth for runtime/result keys),\n * minus the config keys above, so a new result field is stripped by default —\n * never re-leak generated media URLs, job ids, or trained-LoRA identity\n * (loraReplicateVersion / loraTriggerWord / outputResults / generatedVideoUrl\n * / …) into a shareable template — while preserving user config. `assetId` is\n * the one non-runtime extra (a library-asset pointer).\n */\nconst GENERATED_FIELDS: readonly string[] = [\n ...[...EXECUTION_DATA_KEYS].filter((k) => !TEMPLATE_KEEP_CONFIG_KEYS.has(k)),\n \"assetId\",\n]\n\n/** Per-node-type extra generated fields beyond GENERATED_FIELDS. Unknown types get no extras ([] default). */\nconst NODE_EXTRA_FIELDS: Record<string, string[]> = {\n // A template must never import ARMED: the switch is the importer's to flip\n // (a schedule starts paused), and the rules themselves are config that\n // travels.\n \"schedule-trigger\": [\"active\"],\n // Same for a Telegram Account Trigger: listening is the importer's to start.\n \"telegram-account-trigger\": [\"isActive\"],\n character: [\"expressions\", \"poses\", \"lightingVariations\", \"angles\", \"customVariations\"],\n object: [\"angles\", \"materials\", \"variations\", \"customVariations\"],\n creature: [\"angles\", \"poses\", \"variations\", \"customVariations\"],\n location: [\n \"timeOfDay\",\n \"weather\",\n \"angles\",\n \"lighting\",\n \"seasons\",\n \"atmosphereMotions\",\n \"customVariations\",\n \"referencePhotos\",\n \"canonicalDescription\",\n ],\n // Strip the exporter's private face-row pointer + variants from templates\n // (faceDbId points at a row the importer doesn't own — see workflow-assets\n // import remap, which also clears it).\n face: [\"faceDbId\", \"expressions\", \"customVariations\"],\n // A template shouldn't carry a link to a specific child workflow id (it's\n // the exporter's, and unremapped on import). Strip it so the node lands\n // unlinked rather than dangling at the exporter's workflow.\n \"sub-workflow\": [\"referencedWorkflowId\"],\n}\n\n/**\n * Node fields that point at a row the IMPORTER does not own — a stored HTTP\n * credential behind a Webhook Output, a connected social account behind a\n * publisher. The id alone is useless without owning the row (resolution is\n * owner-scoped), so nothing leaks either way; the point is that the imported\n * node lands UNBOUND and the importer picks their own, instead of carrying a\n * dangling pointer at the exporter's account. Applied by every export shape,\n * including the asset bundle that otherwise keeps node data verbatim.\n */\nconst UNOWNED_REF_FIELDS: Record<string, readonly string[]> = {\n \"webhook-output\": [\"credentialId\"],\n // The exporter's connected Telegram account and its chats (a Saved Messages\n // chat id IS the exporter's Telegram user id) — the importer picks their own.\n \"telegram-account-trigger\": [\"accountId\", \"chatIds\", \"chatTitles\", \"senderIds\"],\n // Telegram Reply: the exporter's account and their bot.\n \"telegram-account-send\": [\"accountId\", \"connectionId\"],\n ...Object.fromEntries([...SOCIAL_POST_NODE_TYPES].map((type) => [type, [\"connectionId\"]])),\n}\n\n/** Clear owner-bound references (credential / connection ids). Returns new node objects; inputs are not mutated. */\nexport function stripUnownedRefs(nodes: GenericNode[]): GenericNode[] {\n return nodes.map((node) => {\n const fields = UNOWNED_REF_FIELDS[node.type]\n if (!fields || !node.data) return node\n const data = { ...(node.data as Record<string, unknown>) }\n let changed = false\n for (const field of fields) {\n if (field in data) {\n delete data[field]\n changed = true\n }\n }\n return changed ? { ...node, data } : node\n })\n}\n\n/** Strip generated/transient content from nodes for template export. Returns new node objects; inputs are not mutated. */\nexport function stripExportContent(nodes: GenericNode[]): GenericNode[] {\n return stripUnownedRefs(nodes).map((node) => {\n const data = { ...(node.data as Record<string, unknown>) }\n for (const field of GENERATED_FIELDS) delete data[field]\n // A type's own run results under generic names (UGC Clips' `quote`, …): stripped from that type only.\n for (const field of NODE_TYPE_EXECUTION_DATA_KEYS[node.type] ?? []) delete data[field]\n const extras = NODE_EXTRA_FIELDS[node.type] ?? []\n for (const field of extras) delete data[field]\n // A node an assistant made in an MCP conversation keeps where it came from (the\n // request is what makes the template useful), never the exporter's job id.\n const provenance = data.mcpProvenance\n if (provenance && typeof provenance === \"object\" && \"jobId\" in provenance) {\n const { jobId: _jobId, ...kept } = provenance as Record<string, unknown>\n data.mcpProvenance = kept\n }\n return { ...node, data }\n })\n}\n","export interface SubWorkflowPort {\n readonly id: string\n readonly name: string\n readonly mediaType: \"text\" | \"image\" | \"video\" | \"audio\" | \"any\"\n}\n\ninterface BoundaryNode {\n readonly id: string\n readonly type: string\n readonly data: { readonly routeId?: string; readonly ports?: readonly SubWorkflowPort[] }\n}\n\nexport type ValidationError =\n | { code: \"missing_output_for_route\"; routeId: string; inputNodeId: string }\n | { code: \"missing_input_for_route\"; routeId: string; outputNodeId: string }\n | { code: \"route_has_no_output_ports\"; routeId: string; outputNodeId: string }\n | { code: \"duplicate_route_id\"; routeId: string; nodeIds: readonly string[] }\n\nexport type ValidationResult =\n | { ok: true }\n | { ok: false; errors: readonly ValidationError[] }\n\nexport function validateSubWorkflowRoutes(\n nodes: readonly BoundaryNode[],\n): ValidationResult {\n const inputs = nodes.filter((n) => n.type === \"sub-workflow-input\")\n const outputs = nodes.filter((n) => n.type === \"sub-workflow-output\")\n\n if (inputs.length === 0 && outputs.length === 0) return { ok: true }\n\n const errors: ValidationError[] = []\n\n // 1. Duplicate routeIds within input or output lists\n const groupByRoute = (list: readonly BoundaryNode[]) => {\n const map = new Map<string, BoundaryNode[]>()\n for (const n of list) {\n const r = n.data.routeId\n if (!r) continue\n const bucket = map.get(r) ?? []\n bucket.push(n)\n map.set(r, bucket)\n }\n return map\n }\n for (const [routeId, group] of groupByRoute(inputs)) {\n if (group.length > 1) errors.push({ code: \"duplicate_route_id\", routeId, nodeIds: group.map((g) => g.id) })\n }\n for (const [routeId, group] of groupByRoute(outputs)) {\n if (group.length > 1) errors.push({ code: \"duplicate_route_id\", routeId, nodeIds: group.map((g) => g.id) })\n }\n\n // 2. Every input routeId must have a matching output\n const outputByRoute = new Map(outputs.map((o) => [o.data.routeId, o] as const))\n for (const inputNode of inputs) {\n const routeId = inputNode.data.routeId\n if (!routeId) continue\n const matchingOutput = outputByRoute.get(routeId)\n if (!matchingOutput) {\n errors.push({ code: \"missing_output_for_route\", routeId, inputNodeId: inputNode.id })\n continue\n }\n if (!matchingOutput.data.ports || matchingOutput.data.ports.length === 0) {\n errors.push({ code: \"route_has_no_output_ports\", routeId, outputNodeId: matchingOutput.id })\n }\n }\n\n // 3. Every output routeId must have a matching input\n const inputByRoute = new Map(inputs.map((i) => [i.data.routeId, i] as const))\n for (const outputNode of outputs) {\n const routeId = outputNode.data.routeId\n if (!routeId) continue\n if (!inputByRoute.has(routeId)) {\n errors.push({ code: \"missing_input_for_route\", routeId, outputNodeId: outputNode.id })\n }\n }\n\n return errors.length === 0 ? { ok: true } : { ok: false, errors }\n}\n","import { z, type ZodType } from \"zod\"\n// Reuse the canonical `OutputType` from presentation-utils so a single union\n// is the source of truth across the package. Re-exporting it here would\n// collide with the explicit named re-export in `index.ts`.\nimport type { OutputType } from \"./presentation-utils.js\"\n\n// `ZodType<Output, Def, Input>` with `Input = any` lets us accept schemas\n// like `z.object({ x: z.string().default(\"\") })` where the parsed output is\n// `{ x: string }` but the input is `{ x?: string }`. Pinning Input to TConfig\n// would force input === output and reject `.default()` schemas.\nexport type ReduceStrategy<TConfig = unknown> = {\n readonly id: string\n readonly label: string\n readonly description: string\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n readonly configSchema: ZodType<TConfig, any>\n readonly defaultConfig: TConfig\n readonly outputType: OutputType\n readonly creditCostKey: string\n /**\n * The strategy calls an LLM (its judge model). Everything that treats\n * \"an LLM strategy\" specially — the connected-install cloud proxy, the\n * tiered credit id — reads this rather than matching on the id, so a new\n * LLM strategy is covered by declaring it here.\n */\n readonly usesLlm?: boolean\n}\n\n// User-facing copy lives HERE (single source of truth) and flows into the node\n// body, the config panel dropdown, the SDK docs and the MCP tool. Written for\n// the person building the flow, not the engine: say what happens to their\n// candidates, never \"survivor\" / \"fan-in\" / \"reduce\" / model names.\nconst PICK_BEST_LLM_STRATEGY = {\n id: \"pick-best-llm\",\n label: \"AI picks the best\",\n description: \"AI compares every candidate against your criteria and picks one.\",\n configSchema: z.object({\n // Default to the sensible \"best quality\" criteria when omitted (matches\n // defaultConfig) so a reduce({strategyId:\"pick-best-llm\"}) call with no\n // criteria degrades gracefully instead of erroring. An explicit \"\" still\n // rejects via min(1).\n criteria: z.string().min(1, \"criteria cannot be empty\").default(\"Pick the highest-quality result.\"),\n inputKind: z.enum([\"text\", \"image-url\"]).default(\"text\"),\n // The judge model, like every other LLM node (llmModel + LlmModelSelect).\n // Optional: omitted → LLM_FEATURE_DEFAULTS[\"pick-best-llm\"]. Validated\n // against LLM_MODEL_IDS at the route (the registry can't import the model\n // list without a cycle), and its tier drives the credit price via\n // buildLlmCreditIdentifier — economy / standard / premium.\n llmModel: z.string().optional(),\n }),\n defaultConfig: { criteria: \"Pick the highest-quality result.\", inputKind: \"text\" as const },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:pick-best-llm\",\n usesLlm: true,\n} as const satisfies ReduceStrategy<{ criteria: string; inputKind: \"text\" | \"image-url\"; llmModel?: string }>\n\nconst CONCAT_STRATEGY = {\n id: \"concat\",\n label: \"Join into one text\",\n description: \"Puts every candidate into a single text, one after another, with a separator between them.\",\n configSchema: z.object({ separator: z.string().default(\"\\n\\n\") }),\n defaultConfig: { separator: \"\\n\\n\" },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:concat\",\n} as const satisfies ReduceStrategy<{ separator: string }>\n\nconst FIRST_NON_EMPTY_STRATEGY = {\n id: \"first-non-empty\",\n label: \"First that has content\",\n description: \"Takes the first candidate that is not empty and ignores the rest.\",\n configSchema: z.object({}),\n defaultConfig: {},\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:first-non-empty\",\n} as const satisfies ReduceStrategy<Record<string, never>>\n\nconst COUNT_STRATEGY = {\n id: \"count\",\n label: \"Count them\",\n description: \"Outputs how many candidates arrived.\",\n configSchema: z.object({}),\n defaultConfig: {},\n outputType: \"data\" as OutputType,\n creditCostKey: \"reduce:count\",\n} as const satisfies ReduceStrategy<Record<string, never>>\n\nconst VOTE_STRATEGY = {\n id: \"vote\",\n label: \"Most common answer\",\n description: \"Picks the candidate that appears most often (ties go to the first).\",\n configSchema: z.object({ caseSensitive: z.boolean().default(false) }),\n defaultConfig: { caseSensitive: false },\n outputType: \"text\" as OutputType,\n creditCostKey: \"reduce:vote\",\n} as const satisfies ReduceStrategy<{ caseSensitive: boolean }>\n\nconst MERGE_JSON_STRATEGY = {\n id: \"merge-json\",\n label: \"Merge JSON objects\",\n description: \"Reads every candidate as JSON and merges them into one object.\",\n configSchema: z.object({ strategy: z.enum([\"deep\", \"shallow\"]).default(\"deep\") }),\n defaultConfig: { strategy: \"deep\" as const },\n outputType: \"data\" as OutputType,\n creditCostKey: \"reduce:merge-json\",\n} as const satisfies ReduceStrategy<{ strategy: \"deep\" | \"shallow\" }>\n\n/**\n * Result-meta shape returned by every reduce strategy. Shared between the\n * backend route, the SDK client, and the frontend node so all three layers\n * agree on field names. `selectedIndex` + `reasoning` are set by the\n * `pick-best-llm` and `vote` strategies (the former also fills `reasoning`);\n * `summary` is always populated.\n */\nexport type ReduceMeta = {\n readonly selectedIndex?: number\n readonly reasoning?: string\n readonly summary: string\n}\n\nexport const REDUCE_STRATEGIES = [\n PICK_BEST_LLM_STRATEGY,\n CONCAT_STRATEGY,\n FIRST_NON_EMPTY_STRATEGY,\n COUNT_STRATEGY,\n VOTE_STRATEGY,\n MERGE_JSON_STRATEGY,\n] as const\n\nexport const REDUCE_STRATEGY_IDS = REDUCE_STRATEGIES.map((s) => s.id) as readonly ReduceStrategyId[]\n\nexport type ReduceStrategyId = typeof REDUCE_STRATEGIES[number][\"id\"]\n\nconst BY_ID = new Map<string, ReduceStrategy>(REDUCE_STRATEGIES.map((s) => [s.id, s]))\n\nexport function getStrategy(id: ReduceStrategyId): ReduceStrategy {\n const s = BY_ID.get(id)\n if (!s) throw new Error(`unknown reduce strategy: ${id}`)\n return s\n}\n","/**\n * Which hosts a server-side fetch must never be pointed at: loopback, private,\n * link-local, cloud-metadata, multicast and reserved addresses. Pure and\n * dependency-free, so the server's SSRF gates (`safeFetch`, `safeUrlSchema`) and\n * the app runner's link card judge a host with the SAME rule — a link the card\n * accepts is not one the server then refuses for its address.\n *\n * Literal hosts only. A name that RESOLVES to a private address is caught where\n * the connection is made (`safeFetch` re-validates the resolved IP); nothing\n * here does DNS.\n *\n * The documentation blocks (192.0.2.0/24, 198.51.100.0/24, 203.0.113.0/24,\n * 2001:db8::/32) are deliberately NOT refused: no network routes them, so they\n * are no SSRF target, and this same rule decides which client addresses the\n * server trusts and keys rate limits on (client-address.ts, hosting-ranges.ts),\n * where they stand in for public addresses.\n */\n\nfunction isPrivateOrReservedIPv4(a: number, b: number, c: number): boolean {\n if (a === 0) return true // 0.0.0.0/8 \"this network\"\n if (a === 127) return true // 127.0.0.0/8 loopback\n if (a === 10) return true // 10.0.0.0/8 private\n if (a === 172 && b >= 16 && b <= 31) return true // 172.16.0.0/12 private\n if (a === 192 && b === 168) return true // 192.168.0.0/16 private\n if (a === 169 && b === 254) return true // 169.254.0.0/16 link-local + AWS/GCP metadata\n if (a === 100 && b >= 64 && b <= 127) return true // 100.64.0.0/10 CGN\n if (a === 198 && (b === 18 || b === 19)) return true // 198.18.0.0/15 benchmarking\n if (a === 192 && b === 0 && c === 0) return true // 192.0.0.0/24 IETF protocol assignments (DS-Lite, NAT64 discovery)\n if (a >= 224) return true // 224.0.0.0/4 multicast + 240.0.0.0/4 reserved + 255.255.255.255\n return false\n}\n\n/** The IPv4 address carried in two 16-bit groups. */\nfunction embeddedIPv4IsPrivate(hi: number, lo: number): boolean {\n return isPrivateOrReservedIPv4(hi >> 8, hi & 0xff, lo >> 8)\n}\n\n/**\n * The eight 16-bit groups of an IPv6 address, or null when `ip` is not one.\n * Reads `::` compression, a dotted IPv4 tail (`::ffff:127.0.0.1`) and a zone\n * suffix (`fe80::1%eth0`).\n */\nfunction ipv6Groups(ip: string): number[] | null {\n let text = ip.toLowerCase()\n const zone = text.indexOf(\"%\")\n if (zone >= 0) text = text.slice(0, zone)\n if (!text.includes(\":\") || !/^[0-9a-f:.]+$/.test(text)) return null\n\n const lastColon = text.lastIndexOf(\":\")\n const last = text.slice(lastColon + 1)\n if (last.includes(\".\")) {\n const parts = last.split(\".\")\n if (parts.length !== 4 || parts.some((p) => !/^\\d{1,3}$/.test(p) || Number(p) > 255)) return null\n const [a, b, c, d] = parts.map(Number) as [number, number, number, number]\n text = `${text.slice(0, lastColon + 1)}${((a << 8) | b).toString(16)}:${((c << 8) | d).toString(16)}`\n }\n\n const halves = text.split(\"::\")\n if (halves.length > 2) return null\n const groupsOf = (part: string) => (part === \"\" ? [] : part.split(\":\"))\n const head = groupsOf(halves[0] ?? \"\")\n const tail = halves.length === 2 ? groupsOf(halves[1] ?? \"\") : []\n if ([...head, ...tail].some((g) => !/^[0-9a-f]{1,4}$/.test(g))) return null\n if (halves.length === 1) {\n return head.length === 8 ? head.map((g) => parseInt(g, 16)) : null\n }\n const missing = 8 - head.length - tail.length\n if (missing < 1) return null\n return [...head, ...Array<string>(missing).fill(\"0\"), ...tail].map((g) => parseInt(g, 16))\n}\n\nfunction isPrivateOrReservedIPv6(g: number[]): boolean {\n const zeroThrough = (n: number) => g.slice(0, n).every((x) => x === 0)\n const [g0 = 0, g1 = 0, g2 = 0, g3 = 0, , g5 = 0, g6 = 0, g7 = 0] = g\n if (zeroThrough(8)) return true // :: unspecified\n if (zeroThrough(7) && g7 === 1) return true // ::1 loopback\n if (zeroThrough(5) && g5 === 0xffff) return embeddedIPv4IsPrivate(g6, g7) // ::ffff:0:0/96 IPv4-mapped\n if (zeroThrough(6)) return embeddedIPv4IsPrivate(g6, g7) // ::/96 IPv4-compatible (deprecated)\n if (g0 === 0x64 && g1 === 0xff9b && g.slice(2, 6).every((x) => x === 0)) {\n return embeddedIPv4IsPrivate(g6, g7) // 64:ff9b::/96 NAT64: the IPv4 it reaches\n }\n if (g0 === 0x64 && g1 === 0xff9b && g2 === 1) return true // 64:ff9b:1::/48 local-use NAT64\n if (g0 === 0x2002) return embeddedIPv4IsPrivate(g1, g2) // 2002::/16 6to4: the IPv4 it reaches\n if (g0 === 0x2001 && g1 === 0) return true // 2001::/32 Teredo\n if ((g0 & 0xfe00) === 0xfc00) return true // fc00::/7 unique-local\n if ((g0 & 0xffc0) === 0xfe80) return true // fe80::/10 link-local (fe80:: to febf::)\n if ((g0 & 0xffc0) === 0xfec0) return true // fec0::/10 site-local (deprecated)\n if ((g0 & 0xff00) === 0xff00) return true // ff00::/8 multicast\n return false\n}\n\n/**\n * True if the IP belongs to a range we refuse to connect to from server-side\n * fetches. Covers IPv4 loopback/private/link-local/cloud-metadata/CGN/\n * multicast/reserved, the equivalent IPv6 classes, and every\n * IPv6 form that carries an IPv4 address (mapped, compatible, NAT64, 6to4 —\n * judged by the IPv4 they reach). Something with a colon that is not a valid\n * IPv6 address is refused (fail closed); anything else that is not an IP (a\n * host name) is not refused here.\n */\nexport function isPrivateOrReservedIP(ip: string): boolean {\n const v4 = ip.match(/^(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})$/)\n if (v4) {\n return isPrivateOrReservedIPv4(Number(v4[1]), Number(v4[2]), Number(v4[3]))\n }\n if (!ip.includes(\":\")) return false\n const groups = ipv6Groups(ip)\n return groups === null ? true : isPrivateOrReservedIPv6(groups)\n}\n\n/**\n * True when a URL hostname (as `new URL(...).hostname` gives it, IPv6 still in\n * brackets) names this machine or a private/reserved IP literal. WHATWG parsing\n * has already folded decimal, octal and hex IPv4 spellings (`2130706433`,\n * `0x7f.1`) into dotted form, so those are caught as IP literals.\n */\nexport function isLocalOrPrivateHostname(hostname: string): boolean {\n const host = hostname.toLowerCase().replace(/^\\[|\\]$/g, \"\").replace(/\\.$/, \"\")\n if (host === \"localhost\" || host.endsWith(\".localhost\")) return true\n return isPrivateOrReservedIP(host)\n}\n","/**\n * The wire contract for one node's entry in an execution's `nodeStates` map —\n * the shape the orchestrator persists on `workflow_executions.node_states`,\n * emits on the SSE execution stream, and every client reads back.\n *\n * Why this lives here rather than in the backend\n * ----------------------------------------------\n * The shape had THREE independent declarations — the orchestrator's rich\n * `NodeExecutionState` (workflow-engine/types.ts), the SDK's loose one\n * (`packages/client/src/resources/executions.ts`) and the editor's local copy\n * (`workflow-editor/run-handlers.ts`) — and nothing tied them together. The\n * field that made that expensive is `output`: it used to be an unstated\n * convention that only a COMPLETED node carries one, so every consumer read it\n * exclusively under `status === \"completed\"` and a failed node's retained\n * result had nowhere to travel.\n *\n * This module states the rule once. The backend keeps its richer `NodeOutput`\n * typing (its `NodeExecutionState` must stay ASSIGNABLE to the wire shape — a\n * type-level test pins that); the SDK and the editor extend/import it.\n */\n\n/**\n * The status a node reports inside an execution.\n *\n * `cancelled` is deliberately absent: a cancelled child job is mapped onto\n * `skipped` by the reconcile lane (see `lib/reconcile/node-states.ts`), and a\n * HELD job keeps `status: \"running\"` with the `awaitingReview` sidecar rather\n * than adding a member here.\n */\nexport type NodeExecutionStatus =\n | \"pending\"\n | \"running\"\n | \"completed\"\n | \"failed\"\n | \"skipped\"\n\n/**\n * Why a node was skipped at run time, when the run itself decided it (never\n * for a node the person froze with Skip, which is a saved-data seed):\n * - `empty_input` — a text-requiring node whose wired text came from a node\n * that, in this run, produced nothing (a feed that found no new posts). A\n * completed run with one such skip reads as \"nothing new\"\n * (execution-outcome.ts).\n * A router-gated node carries no reason, as before.\n */\nexport type NodeSkipReason = \"empty_input\"\n\n/**\n * The statuses whose node state MAY carry `output`.\n *\n * `completed` is the obvious one. `failed` is here because a run can refuse\n * its result and still RETAIN what it produced — the 3D-scene authoring lanes\n * publish a real, renderable revision and then fail the job on the visual\n * reviewer's verdict (`SCENE_QUALITY_FAILED`), so the scene and the refusal are\n * both true at once. That output was billed; dropping it because the status is\n * not `\"completed\"` is what this set exists to stop.\n *\n * `pending` / `running` / `skipped` never carry one: nothing has settled, or\n * the node was gated out.\n */\nexport const OUTPUT_BEARING_NODE_STATUSES: ReadonlySet<NodeExecutionStatus> =\n new Set<NodeExecutionStatus>([\"completed\", \"failed\"])\n\n/** Whether a node in this status may carry `output`. */\nexport function nodeStateMayCarryOutput(status: string | undefined): boolean {\n return (\n status !== undefined &&\n OUTPUT_BEARING_NODE_STATUSES.has(status as NodeExecutionStatus)\n )\n}\n\n/**\n * One node's execution state, as it travels on the wire.\n *\n * Additive by construction — an older client ignores fields it does not know,\n * which is why `output` on a failed node is safe to start sending.\n *\n * `TOutput` lets a declaration that knows its own richer output shape (the\n * orchestrator's `NodeOutput`, the editor's) stay ASSIGNABLE to this contract\n * instead of restating it; the default is what an external client sees.\n */\nexport interface NodeExecutionStateWire<TOutput = Record<string, unknown>> {\n status: NodeExecutionStatus | (string & {})\n nodeType?: string\n jobId?: string | null\n /** Every job id of a fan-out node (one per list / loop iteration). */\n jobIds?: string[]\n creditsUsed?: number\n error?: string | null\n /** Stable code for a refusal a client may branch on — never on the text. */\n errorCode?: string\n /**\n * The provider's own words for a `failed` node's failure (the job's\n * `error_detail`), with links cut to their host and secrets removed; absent\n * when the failure had no provider text (a platform refusal, a timeout).\n * Display-only, beside `error`: branch on `errorCode` or the hint, never on\n * these words. Only a reader who can open the workflow the run executed\n * receives it — never a published app's runner, nor a person running\n * someone else's share link — and on a deployment that keeps these words for\n * its administrators, no reader who is not one.\n */\n errorDetail?: string | null\n /**\n * What the node produced.\n *\n * Present for a `completed` node, and for a `failed` node whose run RETAINED\n * a structured result (see {@link OUTPUT_BEARING_NODE_STATUSES}). A consumer\n * that reads it must therefore gate on the FIELD, not on the status, and\n * must not treat its presence as success.\n */\n output?: TOutput\n startedAt?: string | null\n completedAt?: string | null\n /** The node's job is parked in `pending_review`; `status` stays \"running\". */\n awaitingReview?: boolean\n /**\n * The node's job is waiting for a free concurrency slot (the job's status is\n * `queued`; `status` here stays \"pending\"). Present only while it waits, and\n * only on the node state of a single-node job as the execution reads list\n * it. Concurrency limits are not enforced in this release, so nothing waits\n * for a slot yet and the key does not appear yet.\n */\n queued?: true\n /**\n * With `queued`: whole seconds the job has waited, counted from when it\n * first started waiting. Absent when that time cannot be read.\n */\n waitedSeconds?: number\n progress?: number\n /** Present on a `skipped` node the RUN skipped (see {@link NodeSkipReason}); absent on a router-gated one. */\n skipReason?: NodeSkipReason | (string & {})\n}\n","import type { NodeSkipReason } from \"./node-execution-state.js\"\n\n/**\n * How a COMPLETED run ended, derived on read from its node states — never a\n * column: the orchestrator, the boot sweep and the reconcile cron all write\n * `completed`, and a column only one of them set would read \"succeeded\" for\n * the runs the others closed. Every surface that shows a run (the editor's\n * run bar and Executions tab, a published app, Present, the REST / SDK\n * execution shapes, MCP `get_app_run` / `diagnose_run`) asks this one rule.\n */\nexport type ExecutionOutcome = \"succeeded\" | \"nothing_new\"\n\ninterface SkipStateLike {\n readonly status?: unknown\n readonly skipReason?: unknown\n}\n\nconst EMPTY_INPUT: NodeSkipReason = \"empty_input\"\n\n/** The nodes a run skipped for want of input: nothing upstream produced any text in this run. */\nexport function countEmptyInputSkips(nodeStates: Readonly<Record<string, SkipStateLike>> | null | undefined): number {\n let count = 0\n for (const state of Object.values(nodeStates ?? {})) {\n if (state && state.status === \"skipped\" && state.skipReason === EMPTY_INPUT) count += 1\n }\n return count\n}\n\n/**\n * `nothing_new` when a completed run skipped at least one node for want of\n * input (a feed that found no new posts, a writer with nothing to write);\n * `succeeded` for any other completed run; undefined for a run that has not\n * completed — a failed or cancelled run has no outcome, it has a status.\n */\nexport function executionOutcome(\n status: unknown,\n nodeStates: Readonly<Record<string, SkipStateLike>> | null | undefined,\n): ExecutionOutcome | undefined {\n if (status !== \"completed\") return undefined\n return countEmptyInputSkips(nodeStates) > 0 ? \"nothing_new\" : \"succeeded\"\n}\n"]}