solve-engine 1.0.1 → 1.0.2

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 (55) hide show
  1. package/dist/{Lexer-BN5mt30n.d.ts → Lexer-CNmWxabg.d.ts} +30 -0
  2. package/dist/{Lexer-D78E2yDW.d.cts → Lexer-DpjdaQ98.d.cts} +30 -0
  3. package/dist/{PackageRegistry-DCUEzbQt.d.ts → PackageRegistry-ClIFXxAe.d.ts} +1 -1
  4. package/dist/{PackageRegistry-B37mRvvz.d.cts → PackageRegistry-zuzqt51V.d.cts} +1 -1
  5. package/dist/{chunk-2XLQPQKI.cjs → chunk-524F3ATQ.cjs} +3 -3
  6. package/dist/{chunk-2XLQPQKI.cjs.map → chunk-524F3ATQ.cjs.map} +1 -1
  7. package/dist/{chunk-TBN7DEHO.js → chunk-7FSDNNNC.js} +3 -3
  8. package/dist/{chunk-TBN7DEHO.js.map → chunk-7FSDNNNC.js.map} +1 -1
  9. package/dist/{chunk-5F4C26RU.js → chunk-AA3KTWTX.js} +3 -3
  10. package/dist/{chunk-5F4C26RU.js.map → chunk-AA3KTWTX.js.map} +1 -1
  11. package/dist/{chunk-KBSXGXPM.cjs → chunk-FE23VSSA.cjs} +4 -4
  12. package/dist/{chunk-KBSXGXPM.cjs.map → chunk-FE23VSSA.cjs.map} +1 -1
  13. package/dist/{chunk-QY25VWBF.js → chunk-FQGX2PA2.js} +29 -4
  14. package/dist/chunk-FQGX2PA2.js.map +1 -0
  15. package/dist/{chunk-B7TLZABL.cjs → chunk-HBVFFBRR.cjs} +23 -21
  16. package/dist/chunk-HBVFFBRR.cjs.map +1 -0
  17. package/dist/{chunk-YPPPYLSR.js → chunk-IP7ASJEW.js} +3 -3
  18. package/dist/{chunk-YPPPYLSR.js.map → chunk-IP7ASJEW.js.map} +1 -1
  19. package/dist/{chunk-V5PYO44Y.js → chunk-NG2JHZHE.js} +9 -7
  20. package/dist/chunk-NG2JHZHE.js.map +1 -0
  21. package/dist/{chunk-YWQ6V4ZN.cjs → chunk-R7YVBHCV.cjs} +29 -4
  22. package/dist/chunk-R7YVBHCV.cjs.map +1 -0
  23. package/dist/{chunk-3AFRJYP4.cjs → chunk-SESSWASV.cjs} +46 -46
  24. package/dist/{chunk-3AFRJYP4.cjs.map → chunk-SESSWASV.cjs.map} +1 -1
  25. package/dist/{chunk-BHTNFEGZ.cjs → chunk-T556MJDZ.cjs} +5 -5
  26. package/dist/{chunk-BHTNFEGZ.cjs.map → chunk-T556MJDZ.cjs.map} +1 -1
  27. package/dist/{chunk-HMOISHXR.js → chunk-YXCTLWOH.js} +4 -4
  28. package/dist/{chunk-HMOISHXR.js.map → chunk-YXCTLWOH.js.map} +1 -1
  29. package/dist/constants.cjs +4 -4
  30. package/dist/constants.js +1 -1
  31. package/dist/engine.cjs +16 -16
  32. package/dist/engine.d.cts +3 -3
  33. package/dist/engine.d.ts +3 -3
  34. package/dist/engine.js +6 -6
  35. package/dist/index.cjs +13 -13
  36. package/dist/index.d.cts +3 -3
  37. package/dist/index.d.ts +3 -3
  38. package/dist/index.js +7 -7
  39. package/dist/language.d.cts +3 -3
  40. package/dist/language.d.ts +3 -3
  41. package/dist/lexer.cjs +8 -8
  42. package/dist/lexer.d.cts +2 -2
  43. package/dist/lexer.d.ts +2 -2
  44. package/dist/lexer.js +2 -2
  45. package/dist/normalizer.cjs +8 -8
  46. package/dist/normalizer.js +2 -2
  47. package/dist/packages.cjs +26 -26
  48. package/dist/packages.d.cts +2 -2
  49. package/dist/packages.d.ts +2 -2
  50. package/dist/packages.js +3 -3
  51. package/package.json +1 -1
  52. package/dist/chunk-B7TLZABL.cjs.map +0 -1
  53. package/dist/chunk-QY25VWBF.js.map +0 -1
  54. package/dist/chunk-V5PYO44Y.js.map +0 -1
  55. package/dist/chunk-YWQ6V4ZN.cjs.map +0 -1
package/dist/chunk-V5PYO44Y.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"sources":["../node_modules/semver/internal/constants.js","../node_modules/semver/internal/debug.js","../node_modules/semver/internal/re.js","../node_modules/semver/internal/parse-options.js","../node_modules/semver/internal/identifiers.js","../node_modules/semver/classes/semver.js","../node_modules/semver/functions/parse.js","../node_modules/semver/functions/valid.js","../node_modules/semver/functions/clean.js","../node_modules/semver/functions/inc.js","../node_modules/semver/functions/diff.js","../node_modules/semver/functions/major.js","../node_modules/semver/functions/minor.js","../node_modules/semver/functions/patch.js","../node_modules/semver/functions/prerelease.js","../node_modules/semver/functions/compare.js","../node_modules/semver/functions/rcompare.js","../node_modules/semver/functions/compare-loose.js","../node_modules/semver/functions/compare-build.js","../node_modules/semver/functions/sort.js","../node_modules/semver/functions/rsort.js","../node_modules/semver/functions/gt.js","../node_modules/semver/functions/lt.js","../node_modules/semver/functions/eq.js","../node_modules/semver/functions/neq.js","../node_modules/semver/functions/gte.js","../node_modules/semver/functions/lte.js","../node_modules/semver/functions/cmp.js","../node_modules/semver/functions/coerce.js","../node_modules/semver/functions/truncate.js","../node_modules/semver/internal/lrucache.js","../node_modules/semver/classes/range.js","../node_modules/semver/classes/comparator.js","../node_modules/semver/functions/satisfies.js","../node_modules/semver/ranges/to-comparators.js","../node_modules/semver/ranges/max-satisfying.js","../node_modules/semver/ranges/min-satisfying.js","../node_modules/semver/ranges/min-version.js","../node_modules/semver/ranges/valid.js","../node_modules/semver/ranges/outside.js","../node_modules/semver/ranges/gtr.js","../node_modules/semver/ranges/ltr.js","../node_modules/semver/ranges/intersects.js","../node_modules/semver/ranges/simplify.js","../node_modules/semver/ranges/subset.js","../node_modules/semver/index.js","../src/cache/LineCache.ts","../src/api/PackageCompatibility.ts","../src/api/EngineVersionCompatibility.ts","../src/workers/engine.worker.ts","../src/engine/ExecutionPool.ts","../src/engine/AsyncResolutionBatcher.ts","../src/telemetry/AllocationTracker.ts","../src/engine/ExpressionEngineSafety.ts","../src/engine/ExpressionEngine.ts","../src/engine/SegmentTree.ts","../src/engine/DocumentModel.ts","../src/engine/CompilationWorkerManager.ts","../src/engine/PageManager.ts","../src/engine/ThreeTierEvaluator.ts"],"names":["coerce","satisfies","require_valid","validRange","require_semver","reads","writes","expression","EvalTier"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAA,iBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,2CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAIA,IAAA,IAAM,mBAAA,GAAsB,OAAA;AAE5B,IAAA,IAAM,UAAA,GAAa,GAAA;AACnB,IAAA,IAAM,mBAAmB,MAAA,CAAO,gBAAA;AAAA,IACL,gBAAA;AAG3B,IAAA,IAAM,yBAAA,GAA4B,EAAA;AAIlC,IAAA,IAAM,wBAAwB,UAAA,GAAa,CAAA;AAE3C,IAAA,IAAM,aAAA,GAAgB;AAAA,MACpB,OAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,UAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU;AAAA,MACf,UAAA;AAAA,MACA,yBAAA;AAAA,MACA,qBAAA;AAAA,MACA,gBAAA;AAAA,MACA,aAAA;AAAA,MACA,mBAAA;AAAA,MACA,uBAAA,EAAyB,CAAA;AAAA,MACzB,UAAA,EAAY;AAAA,KACd;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACpCA,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,uCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GACJ,OAAO,OAAA,KAAY,QAAA,IACnB,QAAQ,GAAA,IACR,OAAA,CAAQ,GAAA,CAAI,UAAA,IACZ,aAAA,CAAc,IAAA,CAAK,QAAQ,GAAA,CAAI,UAAU,CAAA,GACvC,CAAA,GAAI,IAAA,KAAS,OAAA,CAAQ,MAAM,QAAA,EAAU,GAAG,IAAI,CAAA,GAC5C,MAAM;AAAA,IAAC,CAAA;AAEX,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACVjB,IAAA,UAAA,GAAA,UAAA,CAAA;AAAA,EAAA,oCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM;AAAA,MACJ,yBAAA;AAAA,MACA,qBAAA;AAAA,MACA;AAAA,KACF,GAAI,iBAAA,EAAA;AACJ,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,OAAA,GAAU,MAAA,CAAO,UAAU,EAAC;AAG5B,IAAA,IAAM,EAAA,GAAK,OAAA,CAAQ,EAAA,GAAK,EAAC;AACzB,IAAA,IAAM,MAAA,GAAS,OAAA,CAAQ,MAAA,GAAS,EAAC;AACjC,IAAA,IAAM,GAAA,GAAM,OAAA,CAAQ,GAAA,GAAM,EAAC;AAC3B,IAAA,IAAM,OAAA,GAAU,OAAA,CAAQ,OAAA,GAAU,EAAC;AACnC,IAAA,IAAM,CAAA,GAAI,OAAA,CAAQ,CAAA,GAAI,EAAC;AACvB,IAAA,IAAI,CAAA,GAAI,CAAA;AAER,IAAA,IAAM,gBAAA,GAAmB,cAAA;AAQzB,IAAA,IAAM,qBAAA,GAAwB;AAAA,MAC5B,CAAC,OAAO,CAAC,CAAA;AAAA,MACT,CAAC,OAAO,UAAU,CAAA;AAAA,MAClB,CAAC,kBAAkB,qBAAqB;AAAA,KAC1C;AAEA,IAAA,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAU;AAC/B,MAAA,KAAA,MAAW,CAAC,KAAA,EAAO,GAAG,CAAA,IAAK,qBAAA,EAAuB;AAChD,QAAA,KAAA,GAAQ,KAAA,CACL,MAAM,CAAA,EAAG,KAAK,GAAG,CAAA,CAAE,IAAA,CAAK,CAAA,EAAG,KAAK,CAAA,GAAA,EAAM,GAAG,GAAG,CAAA,CAC5C,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,CAAA,CAAG,CAAA,CAAE,KAAK,CAAA,EAAG,KAAK,CAAA,GAAA,EAAM,GAAG,CAAA,CAAA,CAAG,CAAA;AAAA,MACjD;AACA,MAAA,OAAO,KAAA;AAAA,IACT,CAAA;AAEA,IAAA,IAAM,WAAA,GAAc,CAAC,IAAA,EAAM,KAAA,EAAO,QAAA,KAAa;AAC7C,MAAA,MAAM,IAAA,GAAO,cAAc,KAAK,CAAA;AAChC,MAAA,MAAM,KAAA,GAAQ,CAAA,EAAA;AACd,MAAA,KAAA,CAAM,IAAA,EAAM,OAAO,KAAK,CAAA;AACxB,MAAA,CAAA,CAAE,IAAI,CAAA,GAAI,KAAA;AACV,MAAA,GAAA,CAAI,KAAK,CAAA,GAAI,KAAA;AACb,MAAA,OAAA,CAAQ,KAAK,CAAA,GAAI,IAAA;AACjB,MAAA,EAAA,CAAG,KAAK,CAAA,GAAI,IAAI,OAAO,KAAA,EAAO,QAAA,GAAW,MAAM,MAAS,CAAA;AACxD,MAAA,MAAA,CAAO,KAAK,CAAA,GAAI,IAAI,OAAO,IAAA,EAAM,QAAA,GAAW,MAAM,MAAS,CAAA;AAAA,IAC7D,CAAA;AAQA,IAAA,WAAA,CAAY,qBAAqB,aAAa,CAAA;AAC9C,IAAA,WAAA,CAAY,0BAA0B,MAAM,CAAA;AAM5C,IAAA,WAAA,CAAY,sBAAA,EAAwB,CAAA,aAAA,EAAgB,gBAAgB,CAAA,CAAA,CAAG,CAAA;AAKvE,IAAA,WAAA,CAAY,eAAe,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,iBAAiB,CAAC,CAAA,KAAA,EAChC,GAAA,CAAI,CAAA,CAAE,iBAAiB,CAAC,CAAA,KAAA,EACxB,GAAA,CAAI,CAAA,CAAE,iBAAiB,CAAC,CAAA,CAAA,CAAG,CAAA;AAElD,IAAA,WAAA,CAAY,oBAAoB,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,sBAAsB,CAAC,CAAA,KAAA,EACrC,GAAA,CAAI,CAAA,CAAE,sBAAsB,CAAC,CAAA,KAAA,EAC7B,GAAA,CAAI,CAAA,CAAE,sBAAsB,CAAC,CAAA,CAAA,CAAG,CAAA;AAO5D,IAAA,WAAA,CAAY,sBAAA,EAAwB,CAAA,GAAA,EAAM,GAAA,CAAI,CAAA,CAAE,oBAAoB,CACpE,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,iBAAiB,CAAC,CAAA,CAAA,CAAG,CAAA;AAE/B,IAAA,WAAA,CAAY,2BAAA,EAA6B,CAAA,GAAA,EAAM,GAAA,CAAI,CAAA,CAAE,oBAAoB,CACzE,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,sBAAsB,CAAC,CAAA,CAAA,CAAG,CAAA;AAMpC,IAAA,WAAA,CAAY,YAAA,EAAc,CAAA,KAAA,EAAQ,GAAA,CAAI,CAAA,CAAE,oBAAoB,CAC5D,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,oBAAoB,CAAC,CAAA,IAAA,CAAM,CAAA;AAE1C,IAAA,WAAA,CAAY,iBAAA,EAAmB,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,yBAAyB,CACvE,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,yBAAyB,CAAC,CAAA,IAAA,CAAM,CAAA;AAK/C,IAAA,WAAA,CAAY,iBAAA,EAAmB,CAAA,EAAG,gBAAgB,CAAA,CAAA,CAAG,CAAA;AAMrD,IAAA,WAAA,CAAY,OAAA,EAAS,CAAA,OAAA,EAAU,GAAA,CAAI,CAAA,CAAE,eAAe,CACpD,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,eAAe,CAAC,CAAA,IAAA,CAAM,CAAA;AAWrC,IAAA,WAAA,CAAY,aAAa,CAAA,EAAA,EAAK,GAAA,CAAI,CAAA,CAAE,WAAW,CAC/C,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAAA,EAClB,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAEjB,IAAA,WAAA,CAAY,QAAQ,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,CAAA,CAAG,CAAA;AAK3C,IAAA,WAAA,CAAY,cAAc,CAAA,QAAA,EAAW,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAC3D,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,eAAe,CAAC,CAAA,CAAA,EACvB,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAEjB,IAAA,WAAA,CAAY,SAAS,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAAA,CAAG,CAAA;AAE7C,IAAA,WAAA,CAAY,QAAQ,cAAc,CAAA;AAKlC,IAAA,WAAA,CAAY,yBAAyB,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,sBAAsB,CAAC,CAAA,QAAA,CAAU,CAAA;AAC/E,IAAA,WAAA,CAAY,oBAAoB,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,iBAAiB,CAAC,CAAA,QAAA,CAAU,CAAA;AAErE,IAAA,WAAA,CAAY,aAAA,EAAe,CAAA,SAAA,EAAY,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,QAAA,EACjC,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,QAAA,EACvB,GAAA,CAAI,EAAE,gBAAgB,CAAC,CAAA,IAAA,EAC3B,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,EAAA,EACrB,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA,KAAA,CACR,CAAA;AAEzB,IAAA,WAAA,CAAY,kBAAA,EAAoB,CAAA,SAAA,EAAY,GAAA,CAAI,CAAA,CAAE,qBAAqB,CAAC,CAAA,QAAA,EACtC,GAAA,CAAI,CAAA,CAAE,qBAAqB,CAAC,CAAA,QAAA,EAC5B,GAAA,CAAI,EAAE,qBAAqB,CAAC,CAAA,IAAA,EAChC,GAAA,CAAI,CAAA,CAAE,eAAe,CAAC,CAAA,EAAA,EAC1B,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA,KAAA,CACR,CAAA;AAE9B,IAAA,WAAA,CAAY,QAAA,EAAU,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,CAAA,CAAG,CAAA;AACjE,IAAA,WAAA,CAAY,aAAA,EAAe,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,IAAA,EAAO,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,CAAA,CAAG,CAAA;AAI3E,IAAA,WAAA,CAAY,aAAA,EAAe,GAAG,mBACP,CAAA,EAAG,yBAAyB,CAAA,eAAA,EACrB,yBAAyB,CAAA,iBAAA,EACzB,yBAAyB,CAAA,IAAA,CAAM,CAAA;AAC7D,IAAA,WAAA,CAAY,UAAU,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,YAAA,CAAc,CAAA;AACzD,IAAA,WAAA,CAAY,YAAA,EAAc,GAAA,CAAI,CAAA,CAAE,WAAW,IAC7B,CAAA,GAAA,EAAM,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,KAAA,EACjB,GAAA,CAAI,CAAA,CAAE,KAAK,CAAC,CAAA,cAAA,CACJ,CAAA;AAC5B,IAAA,WAAA,CAAY,WAAA,EAAa,GAAA,CAAI,CAAA,CAAE,MAAM,GAAG,IAAI,CAAA;AAC5C,IAAA,WAAA,CAAY,eAAA,EAAiB,GAAA,CAAI,CAAA,CAAE,UAAU,GAAG,IAAI,CAAA;AAIpD,IAAA,WAAA,CAAY,aAAa,SAAS,CAAA;AAElC,IAAA,WAAA,CAAY,aAAa,CAAA,MAAA,EAAS,GAAA,CAAI,EAAE,SAAS,CAAC,QAAQ,IAAI,CAAA;AAC9D,IAAA,OAAA,CAAQ,gBAAA,GAAmB,KAAA;AAE3B,IAAA,WAAA,CAAY,OAAA,EAAS,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,CAAA,CAAG,CAAA;AACjE,IAAA,WAAA,CAAY,YAAA,EAAc,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,CAAA,CAAG,CAAA;AAI3E,IAAA,WAAA,CAAY,aAAa,SAAS,CAAA;AAElC,IAAA,WAAA,CAAY,aAAa,CAAA,MAAA,EAAS,GAAA,CAAI,EAAE,SAAS,CAAC,QAAQ,IAAI,CAAA;AAC9D,IAAA,OAAA,CAAQ,gBAAA,GAAmB,KAAA;AAE3B,IAAA,WAAA,CAAY,OAAA,EAAS,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,CAAA,CAAG,CAAA;AACjE,IAAA,WAAA,CAAY,YAAA,EAAc,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,CAAA,CAAG,CAAA;AAG3E,IAAA,WAAA,CAAY,iBAAA,EAAmB,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,KAAA,EAAQ,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,KAAA,CAAO,CAAA;AAC9E,IAAA,WAAA,CAAY,YAAA,EAAc,CAAA,CAAA,EAAI,GAAA,CAAI,CAAA,CAAE,IAAI,CAAC,CAAA,KAAA,EAAQ,GAAA,CAAI,CAAA,CAAE,SAAS,CAAC,CAAA,KAAA,CAAO,CAAA;AAIxE,IAAA,WAAA,CAAY,kBAAkB,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,IAAI,CACjD,CAAA,KAAA,EAAQ,GAAA,CAAI,CAAA,CAAE,UAAU,CAAC,CAAA,CAAA,EAAI,GAAA,CAAI,EAAE,WAAW,CAAC,KAAK,IAAI,CAAA;AACxD,IAAA,OAAA,CAAQ,qBAAA,GAAwB,QAAA;AAMhC,IAAA,WAAA,CAAY,aAAA,EAAe,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,WAAA,EAE/B,GAAA,CAAI,CAAA,CAAE,WAAW,CAAC,CAAA,MAAA,CACf,CAAA;AAE1B,IAAA,WAAA,CAAY,kBAAA,EAAoB,CAAA,MAAA,EAAS,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,WAAA,EAEpC,GAAA,CAAI,CAAA,CAAE,gBAAgB,CAAC,CAAA,MAAA,CACpB,CAAA;AAG/B,IAAA,WAAA,CAAY,QAAQ,iBAAiB,CAAA;AAErC,IAAA,WAAA,CAAY,QAAQ,2BAA2B,CAAA;AAC/C,IAAA,WAAA,CAAY,WAAW,6BAA6B,CAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC9NpD,IAAA,qBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,+CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAGA,IAAA,IAAM,cAAc,MAAA,CAAO,MAAA,CAAO,EAAE,KAAA,EAAO,MAAM,CAAA;AACjD,IAAA,IAAM,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,EAAG,CAAA;AACnC,IAAA,IAAM,eAAe,CAAA,OAAA,KAAW;AAC9B,MAAA,IAAI,CAAC,OAAA,EAAS;AACZ,QAAA,OAAO,SAAA;AAAA,MACT;AAEA,MAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,QAAA,OAAO,WAAA;AAAA,MACT;AAEA,MAAA,OAAO,OAAA;AAAA,IACT,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,YAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AChBjB,IAAA,mBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,6CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,UAAA;AAChB,IAAA,IAAM,kBAAA,GAAqB,CAAC,CAAA,EAAG,CAAA,KAAM;AACnC,MAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AAClD,QAAA,OAAO,CAAA,KAAM,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,IAAI,EAAA,GAAK,CAAA;AAAA,MACpC;AAEA,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA;AAC3B,MAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA;AAE3B,MAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,QAAA,CAAA,GAAI,CAAC,CAAA;AACL,QAAA,CAAA,GAAI,CAAC,CAAA;AAAA,MACP;AAEA,MAAA,OAAO,CAAA,KAAM,CAAA,GAAI,CAAA,GACZ,IAAA,IAAQ,CAAC,IAAA,GAAQ,EAAA,GACjB,IAAA,IAAQ,CAAC,IAAA,GAAQ,CAAA,GAClB,CAAA,GAAI,IAAI,EAAA,GACR,CAAA;AAAA,IACN,CAAA;AAEA,IAAA,IAAM,sBAAsB,CAAC,CAAA,EAAG,CAAA,KAAM,kBAAA,CAAmB,GAAG,CAAC,CAAA;AAE7D,IAAA,MAAA,CAAO,OAAA,GAAU;AAAA,MACf,kBAAA;AAAA,MACA;AAAA,KACF;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC5BA,IAAA,cAAA,GAAA,UAAA,CAAA;AAAA,EAAA,uCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,EAAE,UAAA,EAAY,gBAAA,EAAiB,GAAI,iBAAA,EAAA;AACzC,IAAA,IAAM,EAAE,MAAA,EAAQ,EAAA,EAAI,CAAA,EAAE,GAAI,UAAA,EAAA;AAE1B,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,EAAE,oBAAmB,GAAI,mBAAA,EAAA;AAE/B,IAAA,IAAM,sBAAA,GAAyB,CAAC,UAAA,EAAY,UAAA,KAAe;AACzD,MAAA,MAAM,WAAA,GAAc,UAAA,CAAW,KAAA,CAAM,GAAG,CAAA;AACxC,MAAA,IAAI,WAAA,CAAY,MAAA,GAAS,UAAA,CAAW,MAAA,EAAQ;AAC1C,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,WAAA,CAAY,QAAQ,CAAA,EAAA,EAAK;AAC3C,QAAA,IAAI,kBAAA,CAAmB,WAAW,CAAC,CAAA,EAAG,YAAY,CAAC,CAAC,MAAM,CAAA,EAAG;AAC3D,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AAEA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAEA,IAAA,IAAM,MAAA,GAAN,MAAM,OAAA,CAAO;AAAA,MACX,WAAA,CAAa,SAAS,OAAA,EAAS;AAC7B,QAAA,OAAA,GAAU,aAAa,OAAO,CAAA;AAE9B,QAAA,IAAI,mBAAmB,OAAA,EAAQ;AAC7B,UAAA,IAAI,OAAA,CAAQ,KAAA,KAAU,CAAC,CAAC,OAAA,CAAQ,KAAA,IAC9B,OAAA,CAAQ,iBAAA,KAAsB,CAAC,CAAC,OAAA,CAAQ,iBAAA,EAAmB;AAC3D,YAAA,OAAO,OAAA;AAAA,UACT,CAAA,MAAO;AACL,YAAA,OAAA,GAAU,OAAA,CAAQ,OAAA;AAAA,UACpB;AAAA,QACF,CAAA,MAAA,IAAW,OAAO,OAAA,KAAY,QAAA,EAAU;AACtC,UAAA,MAAM,IAAI,SAAA,CAAU,CAAA,6CAAA,EAAgD,OAAO,OAAO,CAAA,EAAA,CAAI,CAAA;AAAA,QACxF;AAEA,QAAA,IAAI,OAAA,CAAQ,SAAS,UAAA,EAAY;AAC/B,UAAA,MAAM,IAAI,SAAA;AAAA,YACR,0BAA0B,UAAU,CAAA,WAAA;AAAA,WACtC;AAAA,QACF;AAEA,QAAA,KAAA,CAAM,QAAA,EAAU,SAAS,OAAO,CAAA;AAChC,QAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAC,OAAA,CAAQ,KAAA;AAGvB,QAAA,IAAA,CAAK,iBAAA,GAAoB,CAAC,CAAC,OAAA,CAAQ,iBAAA;AAEnC,QAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,IAAA,EAAK,CAAE,MAAM,OAAA,CAAQ,KAAA,GAAQ,EAAA,CAAG,CAAA,CAAE,KAAK,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,IAAI,CAAC,CAAA;AAEvE,QAAA,IAAI,CAAC,CAAA,EAAG;AACN,UAAA,MAAM,IAAI,SAAA,CAAU,CAAA,iBAAA,EAAoB,OAAO,CAAA,CAAE,CAAA;AAAA,QACnD;AAEA,QAAA,IAAA,CAAK,GAAA,GAAM,OAAA;AAGX,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAA,CAAE,CAAC,CAAA;AACjB,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAA,CAAE,CAAC,CAAA;AACjB,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAA,CAAE,CAAC,CAAA;AAEjB,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,gBAAA,IAAoB,IAAA,CAAK,QAAQ,CAAA,EAAG;AACnD,UAAA,MAAM,IAAI,UAAU,uBAAuB,CAAA;AAAA,QAC7C;AAEA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,gBAAA,IAAoB,IAAA,CAAK,QAAQ,CAAA,EAAG;AACnD,UAAA,MAAM,IAAI,UAAU,uBAAuB,CAAA;AAAA,QAC7C;AAEA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,gBAAA,IAAoB,IAAA,CAAK,QAAQ,CAAA,EAAG;AACnD,UAAA,MAAM,IAAI,UAAU,uBAAuB,CAAA;AAAA,QAC7C;AAGA,QAAA,IAAI,CAAC,CAAA,CAAE,CAAC,CAAA,EAAG;AACT,UAAA,IAAA,CAAK,aAAa,EAAC;AAAA,QACrB,CAAA,MAAO;AACL,UAAA,IAAA,CAAK,UAAA,GAAa,EAAE,CAAC,CAAA,CAAE,MAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAC,EAAA,KAAO;AAC5C,YAAA,IAAI,UAAA,CAAW,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,cAAA,MAAM,MAAM,CAAC,EAAA;AACb,cAAA,IAAI,GAAA,IAAO,CAAA,IAAK,GAAA,GAAM,gBAAA,EAAkB;AACtC,gBAAA,OAAO,GAAA;AAAA,cACT;AAAA,YACF;AACA,YAAA,OAAO,EAAA;AAAA,UACT,CAAC,CAAA;AAAA,QACH;AAEA,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,GAAI,EAAC;AACvC,QAAA,IAAA,CAAK,MAAA,EAAO;AAAA,MACd;AAAA,MAEA,MAAA,GAAU;AACR,QAAA,IAAA,CAAK,OAAA,GAAU,GAAG,IAAA,CAAK,KAAK,IAAI,IAAA,CAAK,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,KAAK,CAAA,CAAA;AACxD,QAAA,IAAI,IAAA,CAAK,WAAW,MAAA,EAAQ;AAC1B,UAAA,IAAA,CAAK,WAAW,CAAA,CAAA,EAAI,IAAA,CAAK,UAAA,CAAW,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,QAC/C;AACA,QAAA,OAAO,IAAA,CAAK,OAAA;AAAA,MACd;AAAA,MAEA,QAAA,GAAY;AACV,QAAA,OAAO,IAAA,CAAK,OAAA;AAAA,MACd;AAAA,MAEA,QAAS,KAAA,EAAO;AACd,QAAA,KAAA,CAAM,gBAAA,EAAkB,IAAA,CAAK,OAAA,EAAS,IAAA,CAAK,SAAS,KAAK,CAAA;AACzD,QAAA,IAAI,EAAE,iBAAiB,OAAA,CAAA,EAAS;AAC9B,UAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,KAAK,OAAA,EAAS;AACvD,YAAA,OAAO,CAAA;AAAA,UACT;AACA,UAAA,KAAA,GAAQ,IAAI,OAAA,CAAO,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,QACxC;AAEA,QAAA,IAAI,KAAA,CAAM,OAAA,KAAY,IAAA,CAAK,OAAA,EAAS;AAClC,UAAA,OAAO,CAAA;AAAA,QACT;AAEA,QAAA,OAAO,KAAK,WAAA,CAAY,KAAK,CAAA,IAAK,IAAA,CAAK,WAAW,KAAK,CAAA;AAAA,MACzD;AAAA,MAEA,YAAa,KAAA,EAAO;AAClB,QAAA,IAAI,EAAE,iBAAiB,OAAA,CAAA,EAAS;AAC9B,UAAA,KAAA,GAAQ,IAAI,OAAA,CAAO,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,QACxC;AAEA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,EAAA;AAAA,QACT;AACA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,CAAA;AAAA,QACT;AACA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,EAAA;AAAA,QACT;AACA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,CAAA;AAAA,QACT;AACA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,EAAA;AAAA,QACT;AACA,QAAA,IAAI,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,KAAA,EAAO;AAC5B,UAAA,OAAO,CAAA;AAAA,QACT;AACA,QAAA,OAAO,CAAA;AAAA,MACT;AAAA,MAEA,WAAY,KAAA,EAAO;AACjB,QAAA,IAAI,EAAE,iBAAiB,OAAA,CAAA,EAAS;AAC9B,UAAA,KAAA,GAAQ,IAAI,OAAA,CAAO,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,QACxC;AAGA,QAAA,IAAI,KAAK,UAAA,CAAW,MAAA,IAAU,CAAC,KAAA,CAAM,WAAW,MAAA,EAAQ;AACtD,UAAA,OAAO,EAAA;AAAA,QACT,WAAW,CAAC,IAAA,CAAK,WAAW,MAAA,IAAU,KAAA,CAAM,WAAW,MAAA,EAAQ;AAC7D,UAAA,OAAO,CAAA;AAAA,QACT,CAAA,MAAA,IAAW,CAAC,IAAA,CAAK,UAAA,CAAW,UAAU,CAAC,KAAA,CAAM,WAAW,MAAA,EAAQ;AAC9D,UAAA,OAAO,CAAA;AAAA,QACT;AAEA,QAAA,IAAI,CAAA,GAAI,CAAA;AACR,QAAA,GAAG;AACD,UAAA,MAAM,CAAA,GAAI,IAAA,CAAK,UAAA,CAAW,CAAC,CAAA;AAC3B,UAAA,MAAM,CAAA,GAAI,KAAA,CAAM,UAAA,CAAW,CAAC,CAAA;AAC5B,UAAA,KAAA,CAAM,oBAAA,EAAsB,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AACnC,UAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,EAAW;AACtC,YAAA,OAAO,CAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,MAAA,EAAW;AAC1B,YAAA,OAAO,CAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,MAAA,EAAW;AAC1B,YAAA,OAAO,EAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,CAAA,EAAG;AAClB,YAAA;AAAA,UACF,CAAA,MAAO;AACL,YAAA,OAAO,kBAAA,CAAmB,GAAG,CAAC,CAAA;AAAA,UAChC;AAAA,QACF,SAAS,EAAE,CAAA;AAAA,MACb;AAAA,MAEA,aAAc,KAAA,EAAO;AACnB,QAAA,IAAI,EAAE,iBAAiB,OAAA,CAAA,EAAS;AAC9B,UAAA,KAAA,GAAQ,IAAI,OAAA,CAAO,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AAAA,QACxC;AAEA,QAAA,IAAI,CAAA,GAAI,CAAA;AACR,QAAA,GAAG;AACD,UAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AACtB,UAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA;AACvB,UAAA,KAAA,CAAM,eAAA,EAAiB,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA;AAC9B,UAAA,IAAI,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,EAAW;AACtC,YAAA,OAAO,CAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,MAAA,EAAW;AAC1B,YAAA,OAAO,CAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,MAAA,EAAW;AAC1B,YAAA,OAAO,EAAA;AAAA,UACT,CAAA,MAAA,IAAW,MAAM,CAAA,EAAG;AAClB,YAAA;AAAA,UACF,CAAA,MAAO;AACL,YAAA,OAAO,kBAAA,CAAmB,GAAG,CAAC,CAAA;AAAA,UAChC;AAAA,QACF,SAAS,EAAE,CAAA;AAAA,MACb;AAAA;AAAA;AAAA,MAIA,GAAA,CAAK,OAAA,EAAS,UAAA,EAAY,cAAA,EAAgB;AACxC,QAAA,IAAI,OAAA,CAAQ,UAAA,CAAW,KAAK,CAAA,EAAG;AAC7B,UAAA,IAAI,CAAC,UAAA,IAAc,cAAA,KAAmB,KAAA,EAAO;AAC3C,YAAA,MAAM,IAAI,MAAM,iDAAiD,CAAA;AAAA,UACnE;AAEA,UAAA,IAAI,UAAA,EAAY;AACd,YAAA,MAAM,KAAA,GAAQ,CAAA,CAAA,EAAI,UAAU,CAAA,CAAA,CAAG,MAAM,IAAA,CAAK,OAAA,CAAQ,KAAA,GAAQ,EAAA,CAAG,EAAE,eAAe,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,UAAU,CAAC,CAAA;AAClG,YAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,CAAC,MAAM,UAAA,EAAY;AACrC,cAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuB,UAAU,CAAA,CAAE,CAAA;AAAA,YACrD;AAAA,UACF;AAAA,QACF;AAEA,QAAA,QAAQ,OAAA;AAAS,UACf,KAAK,UAAA;AACH,YAAA,IAAA,CAAK,WAAW,MAAA,GAAS,CAAA;AACzB,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,KAAA,EAAA;AACL,YAAA,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,UAAA,EAAY,cAAc,CAAA;AAC1C,YAAA;AAAA,UACF,KAAK,UAAA;AACH,YAAA,IAAA,CAAK,WAAW,MAAA,GAAS,CAAA;AACzB,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,KAAA,EAAA;AACL,YAAA,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,UAAA,EAAY,cAAc,CAAA;AAC1C,YAAA;AAAA,UACF,KAAK,UAAA;AAIH,YAAA,IAAA,CAAK,WAAW,MAAA,GAAS,CAAA;AACzB,YAAA,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,UAAA,EAAY,cAAc,CAAA;AAC5C,YAAA,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,UAAA,EAAY,cAAc,CAAA;AAC1C,YAAA;AAAA;AAAA;AAAA,UAGF,KAAK,YAAA;AACH,YAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAChC,cAAA,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,UAAA,EAAY,cAAc,CAAA;AAAA,YAC9C;AACA,YAAA,IAAA,CAAK,GAAA,CAAI,KAAA,EAAO,UAAA,EAAY,cAAc,CAAA;AAC1C,YAAA;AAAA,UACF,KAAK,SAAA;AACH,YAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAChC,cAAA,MAAM,IAAI,KAAA,CAAM,CAAA,QAAA,EAAW,IAAA,CAAK,GAAG,CAAA,oBAAA,CAAsB,CAAA;AAAA,YAC3D;AACA,YAAA,IAAA,CAAK,WAAW,MAAA,GAAS,CAAA;AACzB,YAAA;AAAA,UAEF,KAAK,OAAA;AAKH,YAAA,IACE,IAAA,CAAK,UAAU,CAAA,IACf,IAAA,CAAK,UAAU,CAAA,IACf,IAAA,CAAK,UAAA,CAAW,MAAA,KAAW,CAAA,EAC3B;AACA,cAAA,IAAA,CAAK,KAAA,EAAA;AAAA,YACP;AACA,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,aAAa,EAAC;AACnB,YAAA;AAAA,UACF,KAAK,OAAA;AAKH,YAAA,IAAI,KAAK,KAAA,KAAU,CAAA,IAAK,IAAA,CAAK,UAAA,CAAW,WAAW,CAAA,EAAG;AACpD,cAAA,IAAA,CAAK,KAAA,EAAA;AAAA,YACP;AACA,YAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,YAAA,IAAA,CAAK,aAAa,EAAC;AACnB,YAAA;AAAA,UACF,KAAK,OAAA;AAKH,YAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAChC,cAAA,IAAA,CAAK,KAAA,EAAA;AAAA,YACP;AACA,YAAA,IAAA,CAAK,aAAa,EAAC;AACnB,YAAA;AAAA;AAAA;AAAA,UAGF,KAAK,KAAA,EAAO;AACV,YAAA,MAAM,IAAA,GAAO,MAAA,CAAO,cAAc,CAAA,GAAI,CAAA,GAAI,CAAA;AAE1C,YAAA,IAAI,IAAA,CAAK,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAChC,cAAA,IAAA,CAAK,UAAA,GAAa,CAAC,IAAI,CAAA;AAAA,YACzB,CAAA,MAAO;AACL,cAAA,IAAI,CAAA,GAAI,KAAK,UAAA,CAAW,MAAA;AACxB,cAAA,OAAO,EAAE,KAAK,CAAA,EAAG;AACf,gBAAA,IAAI,OAAO,IAAA,CAAK,UAAA,CAAW,CAAC,MAAM,QAAA,EAAU;AAC1C,kBAAA,IAAA,CAAK,WAAW,CAAC,CAAA,EAAA;AACjB,kBAAA,CAAA,GAAI,EAAA;AAAA,gBACN;AAAA,cACF;AACA,cAAA,IAAI,MAAM,EAAA,EAAI;AAEZ,gBAAA,IAAI,eAAe,IAAA,CAAK,UAAA,CAAW,KAAK,GAAG,CAAA,IAAK,mBAAmB,KAAA,EAAO;AACxE,kBAAA,MAAM,IAAI,MAAM,uDAAuD,CAAA;AAAA,gBACzE;AACA,gBAAA,IAAA,CAAK,UAAA,CAAW,KAAK,IAAI,CAAA;AAAA,cAC3B;AAAA,YACF;AACA,YAAA,IAAI,UAAA,EAAY;AAGd,cAAA,IAAI,UAAA,GAAa,CAAC,UAAA,EAAY,IAAI,CAAA;AAClC,cAAA,IAAI,mBAAmB,KAAA,EAAO;AAC5B,gBAAA,UAAA,GAAa,CAAC,UAAU,CAAA;AAAA,cAC1B;AACA,cAAA,IAAI,sBAAA,CAAuB,IAAA,CAAK,UAAA,EAAY,UAAU,CAAA,EAAG;AACvD,gBAAA,MAAM,iBAAiB,IAAA,CAAK,UAAA,CAAW,WAAW,KAAA,CAAM,GAAG,EAAE,MAAM,CAAA;AACnE,gBAAA,IAAI,KAAA,CAAM,cAAc,CAAA,EAAG;AACzB,kBAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAAA,gBACpB;AAAA,cACF,CAAA,MAAO;AACL,gBAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAAA,cACpB;AAAA,YACF;AACA,YAAA;AAAA,UACF;AAAA,UACA;AACE,YAAA,MAAM,IAAI,KAAA,CAAM,CAAA,4BAAA,EAA+B,OAAO,CAAA,CAAE,CAAA;AAAA;AAE5D,QAAA,IAAA,CAAK,GAAA,GAAM,KAAK,MAAA,EAAO;AACvB,QAAA,IAAI,IAAA,CAAK,MAAM,MAAA,EAAQ;AACrB,UAAA,IAAA,CAAK,OAAO,CAAA,CAAA,EAAI,IAAA,CAAK,KAAA,CAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA;AAAA,QACtC;AACA,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,KACF;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,MAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC7VjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,CAAC,OAAA,EAAS,OAAA,EAAS,cAAc,KAAA,KAAU;AACvD,MAAA,IAAI,mBAAmB,MAAA,EAAQ;AAC7B,QAAA,OAAO,OAAA;AAAA,MACT;AACA,MAAA,IAAI;AACF,QAAA,OAAO,IAAI,MAAA,CAAO,OAAA,EAAS,OAAO,CAAA;AAAA,MACpC,SAAS,EAAA,EAAI;AACX,QAAA,IAAI,CAAC,WAAA,EAAa;AAChB,UAAA,OAAO,IAAA;AAAA,QACT;AACA,QAAA,MAAM,EAAA;AAAA,MACR;AAAA,IACF,CAAA;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACjBjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,CAAC,OAAA,EAAS,OAAA,KAAY;AAClC,MAAA,MAAM,CAAA,GAAI,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA;AAChC,MAAA,OAAO,CAAA,GAAI,EAAE,OAAA,GAAU,IAAA;AAAA,IACzB,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACPjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,CAAC,OAAA,EAAS,OAAA,KAAY;AAClC,MAAA,MAAM,CAAA,GAAI,MAAM,OAAA,CAAQ,IAAA,GAAO,OAAA,CAAQ,QAAA,EAAU,EAAE,CAAA,EAAG,OAAO,CAAA;AAC7D,MAAA,OAAO,CAAA,GAAI,EAAE,OAAA,GAAU,IAAA;AAAA,IACzB,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACPjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AAEf,IAAA,IAAM,MAAM,CAAC,OAAA,EAAS,OAAA,EAAS,OAAA,EAAS,YAAY,cAAA,KAAmB;AACrE,MAAA,IAAI,OAAQ,YAAa,QAAA,EAAU;AACjC,QAAA,cAAA,GAAiB,UAAA;AACjB,QAAA,UAAA,GAAa,OAAA;AACb,QAAA,OAAA,GAAU,MAAA;AAAA,MACZ;AAEA,MAAA,IAAI;AACF,QAAA,OAAO,IAAI,MAAA;AAAA,UACT,OAAA,YAAmB,MAAA,GAAS,OAAA,CAAQ,OAAA,GAAU,OAAA;AAAA,UAC9C;AAAA,SACF,CAAE,GAAA,CAAI,OAAA,EAAS,UAAA,EAAY,cAAc,CAAA,CAAE,OAAA;AAAA,MAC7C,SAAS,EAAA,EAAI;AACX,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACpBjB,IAAA,YAAA,GAAA,UAAA,CAAA;AAAA,EAAA,uCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AAEd,IAAA,IAAM,IAAA,GAAO,CAAC,QAAA,EAAU,QAAA,KAAa;AACnC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,QAAA,EAAU,IAAA,EAAM,IAAI,CAAA;AACrC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,QAAA,EAAU,IAAA,EAAM,IAAI,CAAA;AACrC,MAAA,MAAM,UAAA,GAAa,EAAA,CAAG,OAAA,CAAQ,EAAE,CAAA;AAEhC,MAAA,IAAI,eAAe,CAAA,EAAG;AACpB,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,MAAM,WAAW,UAAA,GAAa,CAAA;AAC9B,MAAA,MAAM,WAAA,GAAc,WAAW,EAAA,GAAK,EAAA;AACpC,MAAA,MAAM,UAAA,GAAa,WAAW,EAAA,GAAK,EAAA;AACnC,MAAA,MAAM,UAAA,GAAa,CAAC,CAAC,WAAA,CAAY,UAAA,CAAW,MAAA;AAC5C,MAAA,MAAM,SAAA,GAAY,CAAC,CAAC,UAAA,CAAW,UAAA,CAAW,MAAA;AAE1C,MAAA,IAAI,SAAA,IAAa,CAAC,UAAA,EAAY;AAQ5B,QAAA,IAAI,CAAC,UAAA,CAAW,KAAA,IAAS,CAAC,WAAW,KAAA,EAAO;AAC1C,UAAA,OAAO,OAAA;AAAA,QACT;AAGA,QAAA,IAAI,UAAA,CAAW,WAAA,CAAY,WAAW,CAAA,KAAM,CAAA,EAAG;AAC7C,UAAA,IAAI,UAAA,CAAW,KAAA,IAAS,CAAC,UAAA,CAAW,KAAA,EAAO;AACzC,YAAA,OAAO,OAAA;AAAA,UACT;AACA,UAAA,OAAO,OAAA;AAAA,QACT;AAAA,MACF;AAGA,MAAA,MAAM,MAAA,GAAS,aAAa,KAAA,GAAQ,EAAA;AAEpC,MAAA,IAAI,EAAA,CAAG,KAAA,KAAU,EAAA,CAAG,KAAA,EAAO;AACzB,QAAA,OAAO,MAAA,GAAS,OAAA;AAAA,MAClB;AAEA,MAAA,IAAI,EAAA,CAAG,KAAA,KAAU,EAAA,CAAG,KAAA,EAAO;AACzB,QAAA,OAAO,MAAA,GAAS,OAAA;AAAA,MAClB;AAEA,MAAA,IAAI,EAAA,CAAG,KAAA,KAAU,EAAA,CAAG,KAAA,EAAO;AACzB,QAAA,OAAO,MAAA,GAAS,OAAA;AAAA,MAClB;AAGA,MAAA,OAAO,YAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,IAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC3DjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAG,KAAA,KAAU,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA,CAAE,KAAA;AACjD,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAG,KAAA,KAAU,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA,CAAE,KAAA;AACjD,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,CAAC,CAAA,EAAG,KAAA,KAAU,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA,CAAE,KAAA;AACjD,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,kBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,6CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,UAAA,GAAa,CAAC,OAAA,EAAS,OAAA,KAAY;AACvC,MAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,EAAS,OAAO,CAAA;AACrC,MAAA,OAAQ,MAAA,IAAU,MAAA,CAAO,UAAA,CAAW,MAAA,GAAU,OAAO,UAAA,GAAa,IAAA;AAAA,IACpE,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,UAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACPjB,IAAA,eAAA,GAAA,UAAA,CAAA;AAAA,EAAA,0CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,OAAA,GAAU,CAAC,CAAA,EAAG,CAAA,EAAG,UACrB,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,EAAE,OAAA,CAAQ,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAC,CAAA;AAEnD,IAAA,MAAA,CAAO,OAAA,GAAU,OAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACNjB,IAAA,gBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,2CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,QAAA,GAAW,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,GAAG,KAAK,CAAA;AACrD,IAAA,MAAA,CAAO,OAAA,GAAU,QAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,qBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,gDAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,eAAe,CAAC,CAAA,EAAG,MAAM,OAAA,CAAQ,CAAA,EAAG,GAAG,IAAI,CAAA;AACjD,IAAA,MAAA,CAAO,OAAA,GAAU,YAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,qBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,gDAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,YAAA,GAAe,CAAC,CAAA,EAAG,CAAA,EAAG,KAAA,KAAU;AACpC,MAAA,MAAM,QAAA,GAAW,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA;AACpC,MAAA,MAAM,QAAA,GAAW,IAAI,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA;AACpC,MAAA,OAAO,SAAS,OAAA,CAAQ,QAAQ,CAAA,IAAK,QAAA,CAAS,aAAa,QAAQ,CAAA;AAAA,IACrE,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,YAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACRjB,IAAA,YAAA,GAAA,UAAA,CAAA;AAAA,EAAA,uCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,IAAA,GAAO,CAAC,IAAA,EAAM,KAAA,KAAU,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,YAAA,CAAa,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;AAC3E,IAAA,MAAA,CAAO,OAAA,GAAU,IAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,KAAA,GAAQ,CAAC,IAAA,EAAM,KAAA,KAAU,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,YAAA,CAAa,CAAA,EAAG,CAAA,EAAG,KAAK,CAAC,CAAA;AAC5E,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,UAAA,GAAA,UAAA,CAAA;AAAA,EAAA,qCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,EAAA,GAAK,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,GAAI,CAAA;AACnD,IAAA,MAAA,CAAO,OAAA,GAAU,EAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,UAAA,GAAA,UAAA,CAAA;AAAA,EAAA,qCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,EAAA,GAAK,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,GAAI,CAAA;AACnD,IAAA,MAAA,CAAO,OAAA,GAAU,EAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,UAAA,GAAA,UAAA,CAAA;AAAA,EAAA,qCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,EAAA,GAAK,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,KAAM,CAAA;AACrD,IAAA,MAAA,CAAO,OAAA,GAAU,EAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,GAAA,GAAM,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,KAAM,CAAA;AACtD,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,GAAA,GAAM,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,IAAK,CAAA;AACrD,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,GAAA,GAAM,CAAC,CAAA,EAAG,CAAA,EAAG,UAAU,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,IAAK,CAAA;AACrD,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACJjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AAEZ,IAAA,IAAM,GAAA,GAAM,CAAC,CAAA,EAAG,EAAA,EAAI,GAAG,KAAA,KAAU;AAC/B,MAAA,QAAQ,EAAA;AAAI,QACV,KAAK,KAAA;AACH,UAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,YAAA,CAAA,GAAI,CAAA,CAAE,OAAA;AAAA,UACR;AACA,UAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,YAAA,CAAA,GAAI,CAAA,CAAE,OAAA;AAAA,UACR;AACA,UAAA,OAAO,CAAA,KAAM,CAAA;AAAA,QAEf,KAAK,KAAA;AACH,UAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,YAAA,CAAA,GAAI,CAAA,CAAE,OAAA;AAAA,UACR;AACA,UAAA,IAAI,OAAO,MAAM,QAAA,EAAU;AACzB,YAAA,CAAA,GAAI,CAAA,CAAE,OAAA;AAAA,UACR;AACA,UAAA,OAAO,CAAA,KAAM,CAAA;AAAA,QAEf,KAAK,EAAA;AAAA,QACL,KAAK,GAAA;AAAA,QACL,KAAK,IAAA;AACH,UAAA,OAAO,EAAA,CAAG,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAEvB,KAAK,IAAA;AACH,UAAA,OAAO,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAExB,KAAK,GAAA;AACH,UAAA,OAAO,EAAA,CAAG,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAEvB,KAAK,IAAA;AACH,UAAA,OAAO,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAExB,KAAK,GAAA;AACH,UAAA,OAAO,EAAA,CAAG,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAEvB,KAAK,IAAA;AACH,UAAA,OAAO,GAAA,CAAI,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA;AAAA,QAExB;AACE,UAAA,MAAM,IAAI,SAAA,CAAU,CAAA,kBAAA,EAAqB,EAAE,CAAA,CAAE,CAAA;AAAA;AACjD,IACF,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACrDjB,IAAA,cAAA,GAAA,UAAA,CAAA;AAAA,EAAA,yCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,EAAE,MAAA,EAAQ,EAAA,EAAI,CAAA,EAAE,GAAI,UAAA,EAAA;AAE1B,IAAA,IAAMA,OAAAA,GAAS,CAAC,OAAA,EAAS,OAAA,KAAY;AACnC,MAAA,IAAI,mBAAmB,MAAA,EAAQ;AAC7B,QAAA,OAAO,OAAA;AAAA,MACT;AAEA,MAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,QAAA,OAAA,GAAU,OAAO,OAAO,CAAA;AAAA,MAC1B;AAEA,MAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,OAAA,GAAU,WAAW,EAAC;AAEtB,MAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,MAAA,IAAI,CAAC,QAAQ,GAAA,EAAK;AAChB,QAAA,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,OAAA,CAAQ,iBAAA,GAAoB,EAAA,CAAG,CAAA,CAAE,UAAU,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,MAAM,CAAC,CAAA;AAAA,MACnF,CAAA,MAAO;AAUL,QAAA,MAAM,cAAA,GAAiB,QAAQ,iBAAA,GAAoB,EAAA,CAAG,EAAE,aAAa,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,SAAS,CAAA;AACvF,QAAA,IAAI,IAAA;AACJ,QAAA,OAAA,CAAQ,IAAA,GAAO,cAAA,CAAe,IAAA,CAAK,OAAO,OACrC,CAAC,KAAA,IAAS,KAAA,CAAM,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,CAAE,MAAA,KAAW,QAAQ,MAAA,CAAA,EACvD;AACA,UAAA,IAAI,CAAC,KAAA,IACC,IAAA,CAAK,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,KAAW,KAAA,CAAM,KAAA,GAAQ,KAAA,CAAM,CAAC,EAAE,MAAA,EAAQ;AACnE,YAAA,KAAA,GAAQ,IAAA;AAAA,UACV;AACA,UAAA,cAAA,CAAe,SAAA,GAAY,KAAK,KAAA,GAAQ,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA,GAAS,IAAA,CAAK,CAAC,CAAA,CAAE,MAAA;AAAA,QACnE;AAEA,QAAA,cAAA,CAAe,SAAA,GAAY,EAAA;AAAA,MAC7B;AAEA,MAAA,IAAI,UAAU,IAAA,EAAM;AAClB,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,MAAM,KAAA,GAAQ,MAAM,CAAC,CAAA;AACrB,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,IAAK,GAAA;AAC1B,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,IAAK,GAAA;AAC1B,MAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,iBAAA,IAAqB,KAAA,CAAM,CAAC,IAAI,CAAA,CAAA,EAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA,GAAK,EAAA;AAC5E,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,iBAAA,IAAqB,KAAA,CAAM,CAAC,IAAI,CAAA,CAAA,EAAI,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA,GAAK,EAAA;AAEvE,MAAA,OAAO,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,CAAA,EAAI,KAAK,CAAA,EAAG,UAAU,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,OAAO,CAAA;AAAA,IACzE,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAUA,OAAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC7DjB,IAAA,gBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,2CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,SAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AAEf,IAAA,IAAM,QAAA,GAAW,CAAC,OAAA,EAAS,UAAA,EAAY,OAAA,KAAY;AACjD,MAAA,IAAI,CAAC,SAAA,CAAU,aAAA,CAAc,QAAA,CAAS,UAAU,CAAA,EAAG;AACjD,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,MAAM,aAAA,GAAgB,iBAAA,CAAkB,OAAA,EAAS,OAAO,CAAA;AACxD,MAAA,OAAO,aAAA,IAAiB,YAAA,CAAa,aAAA,EAAe,UAAU,CAAA;AAAA,IAChE,CAAA;AAEA,IAAA,IAAM,iBAAA,GAAoB,CAAC,OAAA,EAAS,OAAA,KAAY;AAC9C,MAAA,MAAM,oBAAA,GACJ,OAAA,YAAmB,MAAA,GAAS,OAAA,CAAQ,OAAA,GAAU,OAAA;AAGhD,MAAA,OAAO,KAAA,CAAM,sBAAsB,OAAO,CAAA;AAAA,IAC5C,CAAA;AAEA,IAAA,IAAM,YAAA,GAAe,CAAC,OAAA,EAAS,UAAA,KAAe;AAC5C,MAAA,IAAI,YAAA,CAAa,UAAU,CAAA,EAAG;AAC5B,QAAA,OAAO,OAAA,CAAQ,OAAA;AAAA,MACjB;AAEA,MAAA,OAAA,CAAQ,aAAa,EAAC;AAEtB,MAAA,QAAQ,UAAA;AAAY,QAClB,KAAK,OAAA;AACH,UAAA,OAAA,CAAQ,KAAA,GAAQ,CAAA;AAChB,UAAA,OAAA,CAAQ,KAAA,GAAQ,CAAA;AAChB,UAAA;AAAA,QACF,KAAK,OAAA;AACH,UAAA,OAAA,CAAQ,KAAA,GAAQ,CAAA;AAChB,UAAA;AAAA;AAGJ,MAAA,OAAO,QAAQ,MAAA,EAAO;AAAA,IACxB,CAAA;AAEA,IAAA,IAAM,YAAA,GAAe,CAAC,IAAA,KAAS;AAC7B,MAAA,OAAO,IAAA,CAAK,WAAW,KAAK,CAAA;AAAA,IAC9B,CAAA;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,QAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC/CjB,IAAA,gBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,0CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,WAAN,MAAe;AAAA,MACb,WAAA,GAAe;AACb,QAAA,IAAA,CAAK,GAAA,GAAM,GAAA;AACX,QAAA,IAAA,CAAK,GAAA,uBAAU,GAAA,EAAI;AAAA,MACrB;AAAA,MAEA,IAAK,GAAA,EAAK;AACR,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,GAAG,CAAA;AAC9B,QAAA,IAAI,UAAU,MAAA,EAAW;AACvB,UAAA,OAAO,MAAA;AAAA,QACT,CAAA,MAAO;AAEL,UAAA,IAAA,CAAK,GAAA,CAAI,OAAO,GAAG,CAAA;AACnB,UAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AACvB,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AAAA,MAEA,OAAQ,GAAA,EAAK;AACX,QAAA,OAAO,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,GAAG,CAAA;AAAA,MAC5B;AAAA,MAEA,GAAA,CAAK,KAAK,KAAA,EAAO;AACf,QAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,GAAG,CAAA;AAE/B,QAAA,IAAI,CAAC,OAAA,IAAW,KAAA,KAAU,MAAA,EAAW;AAEnC,UAAA,IAAI,IAAA,CAAK,GAAA,CAAI,IAAA,IAAQ,IAAA,CAAK,GAAA,EAAK;AAC7B,YAAA,MAAM,WAAW,IAAA,CAAK,GAAA,CAAI,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AACxC,YAAA,IAAA,CAAK,OAAO,QAAQ,CAAA;AAAA,UACtB;AAEA,UAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,GAAA,EAAK,KAAK,CAAA;AAAA,QACzB;AAEA,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,KACF;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,QAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACzCjB,IAAA,aAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,gBAAA,GAAmB,MAAA;AAGzB,IAAA,IAAM,KAAA,GAAN,MAAM,MAAA,CAAM;AAAA,MACV,WAAA,CAAa,OAAO,OAAA,EAAS;AAC3B,QAAA,OAAA,GAAU,aAAa,OAAO,CAAA;AAE9B,QAAA,IAAI,iBAAiB,MAAA,EAAO;AAC1B,UAAA,IACE,KAAA,CAAM,KAAA,KAAU,CAAC,CAAC,OAAA,CAAQ,KAAA,IAC1B,KAAA,CAAM,iBAAA,KAAsB,CAAC,CAAC,OAAA,CAAQ,iBAAA,EACtC;AACA,YAAA,OAAO,KAAA;AAAA,UACT,CAAA,MAAO;AACL,YAAA,OAAO,IAAI,MAAA,CAAM,KAAA,CAAM,GAAA,EAAK,OAAO,CAAA;AAAA,UACrC;AAAA,QACF;AAEA,QAAA,IAAI,iBAAiB,UAAA,EAAY;AAE/B,UAAA,IAAA,CAAK,MAAM,KAAA,CAAM,KAAA;AACjB,UAAA,IAAA,CAAK,GAAA,GAAM,CAAC,CAAC,KAAK,CAAC,CAAA;AACnB,UAAA,IAAA,CAAK,SAAA,GAAY,MAAA;AACjB,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAC,OAAA,CAAQ,KAAA;AACvB,QAAA,IAAA,CAAK,iBAAA,GAAoB,CAAC,CAAC,OAAA,CAAQ,iBAAA;AAKnC,QAAA,IAAA,CAAK,MAAM,KAAA,CAAM,IAAA,EAAK,CAAE,OAAA,CAAQ,kBAAkB,GAAG,CAAA;AAGrD,QAAA,IAAA,CAAK,MAAM,IAAA,CAAK,GAAA,CACb,MAAM,IAAI,CAAA,CAEV,IAAI,CAAA,CAAA,KAAK,IAAA,CAAK,UAAA,CAAW,CAAA,CAAE,MAAM,CAAC,EAIlC,MAAA,CAAO,CAAA,CAAA,KAAK,EAAE,MAAM,CAAA;AAEvB,QAAA,IAAI,CAAC,IAAA,CAAK,GAAA,CAAI,MAAA,EAAQ;AACpB,UAAA,MAAM,IAAI,SAAA,CAAU,CAAA,sBAAA,EAAyB,IAAA,CAAK,GAAG,CAAA,CAAE,CAAA;AAAA,QACzD;AAGA,QAAA,IAAI,IAAA,CAAK,GAAA,CAAI,MAAA,GAAS,CAAA,EAAG;AAEvB,UAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA;AACxB,UAAA,IAAA,CAAK,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,CAAA,CAAA,KAAK,CAAC,SAAA,CAAU,CAAA,CAAE,CAAC,CAAC,CAAC,CAAA;AAChD,UAAA,IAAI,IAAA,CAAK,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG;AACzB,YAAA,IAAA,CAAK,GAAA,GAAM,CAAC,KAAK,CAAA;AAAA,UACnB,CAAA,MAAA,IAAW,IAAA,CAAK,GAAA,CAAI,MAAA,GAAS,CAAA,EAAG;AAE9B,YAAA,KAAA,MAAW,CAAA,IAAK,KAAK,GAAA,EAAK;AACxB,cAAA,IAAI,EAAE,MAAA,KAAW,CAAA,IAAK,MAAM,CAAA,CAAE,CAAC,CAAC,CAAA,EAAG;AACjC,gBAAA,IAAA,CAAK,GAAA,GAAM,CAAC,CAAC,CAAA;AACb,gBAAA;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,QAAA,IAAA,CAAK,SAAA,GAAY,MAAA;AAAA,MACnB;AAAA,MAEA,IAAI,KAAA,GAAS;AACX,QAAA,IAAI,IAAA,CAAK,cAAc,MAAA,EAAW;AAChC,UAAA,IAAA,CAAK,SAAA,GAAY,EAAA;AACjB,UAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACxC,YAAA,IAAI,IAAI,CAAA,EAAG;AACT,cAAA,IAAA,CAAK,SAAA,IAAa,IAAA;AAAA,YACpB;AACA,YAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA;AACxB,YAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,cAAA,IAAI,IAAI,CAAA,EAAG;AACT,gBAAA,IAAA,CAAK,SAAA,IAAa,GAAA;AAAA,cACpB;AACA,cAAA,IAAA,CAAK,aAAa,KAAA,CAAM,CAAC,CAAA,CAAE,QAAA,GAAW,IAAA,EAAK;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AACA,QAAA,OAAO,IAAA,CAAK,SAAA;AAAA,MACd;AAAA,MAEA,MAAA,GAAU;AACR,QAAA,OAAO,IAAA,CAAK,KAAA;AAAA,MACd;AAAA,MAEA,QAAA,GAAY;AACV,QAAA,OAAO,IAAA,CAAK,KAAA;AAAA,MACd;AAAA,MAEA,WAAY,KAAA,EAAO;AAEjB,QAAA,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,YAAA,EAAc,EAAE,CAAA;AAItC,QAAA,MAAM,YACH,IAAA,CAAK,OAAA,CAAQ,qBAAqB,uBAAA,KAClC,IAAA,CAAK,QAAQ,KAAA,IAAS,UAAA,CAAA;AACzB,QAAA,MAAM,OAAA,GAAU,WAAW,GAAA,GAAM,KAAA;AACjC,QAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,OAAO,CAAA;AAChC,QAAA,IAAI,MAAA,EAAQ;AACV,UAAA,OAAO,MAAA;AAAA,QACT;AAEA,QAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,KAAA;AAE3B,QAAA,MAAM,EAAA,GAAK,QAAQ,EAAA,CAAG,CAAA,CAAE,gBAAgB,CAAA,GAAI,EAAA,CAAG,EAAE,WAAW,CAAA;AAC5D,QAAA,KAAA,GAAQ,MAAM,OAAA,CAAQ,EAAA,EAAI,cAAc,IAAA,CAAK,OAAA,CAAQ,iBAAiB,CAAC,CAAA;AACvE,QAAA,KAAA,CAAM,kBAAkB,KAAK,CAAA;AAG7B,QAAA,KAAA,GAAQ,MAAM,OAAA,CAAQ,EAAA,CAAG,CAAA,CAAE,cAAc,GAAG,qBAAqB,CAAA;AACjE,QAAA,KAAA,CAAM,mBAAmB,KAAK,CAAA;AAG9B,QAAA,KAAA,GAAQ,MAAM,OAAA,CAAQ,EAAA,CAAG,CAAA,CAAE,SAAS,GAAG,gBAAgB,CAAA;AACvD,QAAA,KAAA,CAAM,cAAc,KAAK,CAAA;AAGzB,QAAA,KAAA,GAAQ,MAAM,OAAA,CAAQ,EAAA,CAAG,CAAA,CAAE,SAAS,GAAG,gBAAgB,CAAA;AACvD,QAAA,KAAA,CAAM,cAAc,KAAK,CAAA;AAKzB,QAAA,IAAI,SAAA,GAAY,KAAA,CACb,KAAA,CAAM,GAAG,CAAA,CACT,IAAI,CAAA,IAAA,KAAQ,eAAA,CAAgB,IAAA,EAAM,IAAA,CAAK,OAAO,CAAC,EAC/C,IAAA,CAAK,GAAG,CAAA,CACR,KAAA,CAAM,KAAK,CAAA,CAEX,GAAA,CAAI,CAAA,IAAA,KAAQ,WAAA,CAAY,IAAA,EAAM,IAAA,CAAK,OAAO,CAAC,CAAA;AAE9C,QAAA,IAAI,KAAA,EAAO;AAET,UAAA,SAAA,GAAY,SAAA,CAAU,OAAO,CAAA,IAAA,KAAQ;AACnC,YAAA,KAAA,CAAM,sBAAA,EAAwB,IAAA,EAAM,IAAA,CAAK,OAAO,CAAA;AAChD,YAAA,OAAO,CAAC,CAAC,IAAA,CAAK,MAAM,EAAA,CAAG,CAAA,CAAE,eAAe,CAAC,CAAA;AAAA,UAC3C,CAAC,CAAA;AAAA,QACH;AACA,QAAA,KAAA,CAAM,cAAc,SAAS,CAAA;AAK7B,QAAA,MAAM,QAAA,uBAAe,GAAA,EAAI;AACzB,QAAA,MAAM,WAAA,GAAc,UAAU,GAAA,CAAI,CAAA,IAAA,KAAQ,IAAI,UAAA,CAAW,IAAA,EAAM,IAAA,CAAK,OAAO,CAAC,CAAA;AAC5E,QAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC9B,UAAA,IAAI,SAAA,CAAU,IAAI,CAAA,EAAG;AACnB,YAAA,OAAO,CAAC,IAAI,CAAA;AAAA,UACd;AACA,UAAA,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,KAAA,EAAO,IAAI,CAAA;AAAA,QAC/B;AACA,QAAA,IAAI,SAAS,IAAA,GAAO,CAAA,IAAK,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA,EAAG;AACzC,UAAA,QAAA,CAAS,OAAO,EAAE,CAAA;AAAA,QACpB;AAEA,QAAA,MAAM,MAAA,GAAS,CAAC,GAAG,QAAA,CAAS,QAAQ,CAAA;AACpC,QAAA,KAAA,CAAM,GAAA,CAAI,SAAS,MAAM,CAAA;AACzB,QAAA,OAAO,MAAA;AAAA,MACT;AAAA,MAEA,UAAA,CAAY,OAAO,OAAA,EAAS;AAC1B,QAAA,IAAI,EAAE,iBAAiB,MAAA,CAAA,EAAQ;AAC7B,UAAA,MAAM,IAAI,UAAU,qBAAqB,CAAA;AAAA,QAC3C;AAEA,QAAA,OAAO,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,CAAC,eAAA,KAAoB;AACxC,UAAA,OACE,aAAA,CAAc,iBAAiB,OAAO,CAAA,IACtC,MAAM,GAAA,CAAI,IAAA,CAAK,CAAC,gBAAA,KAAqB;AACnC,YAAA,OACE,cAAc,gBAAA,EAAkB,OAAO,KACvC,eAAA,CAAgB,KAAA,CAAM,CAAC,cAAA,KAAmB;AACxC,cAAA,OAAO,gBAAA,CAAiB,KAAA,CAAM,CAAC,eAAA,KAAoB;AACjD,gBAAA,OAAO,cAAA,CAAe,UAAA,CAAW,eAAA,EAAiB,OAAO,CAAA;AAAA,cAC3D,CAAC,CAAA;AAAA,YACH,CAAC,CAAA;AAAA,UAEL,CAAC,CAAA;AAAA,QAEL,CAAC,CAAA;AAAA,MACH;AAAA;AAAA,MAGA,KAAM,OAAA,EAAS;AACb,QAAA,IAAI,CAAC,OAAA,EAAS;AACZ,UAAA,OAAO,KAAA;AAAA,QACT;AAEA,QAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,UAAA,IAAI;AACF,YAAA,OAAA,GAAU,IAAI,MAAA,CAAO,OAAA,EAAS,IAAA,CAAK,OAAO,CAAA;AAAA,UAC5C,SAAS,EAAA,EAAI;AACX,YAAA,OAAO,KAAA;AAAA,UACT;AAAA,QACF;AAEA,QAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACxC,UAAA,IAAI,OAAA,CAAQ,KAAK,GAAA,CAAI,CAAC,GAAG,OAAA,EAAS,IAAA,CAAK,OAAO,CAAA,EAAG;AAC/C,YAAA,OAAO,IAAA;AAAA,UACT;AAAA,QACF;AACA,QAAA,OAAO,KAAA;AAAA,MACT;AAAA,KACF;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,KAAA;AAEjB,IAAA,IAAM,GAAA,GAAM,gBAAA,EAAA;AACZ,IAAA,IAAM,KAAA,GAAQ,IAAI,GAAA,EAAI;AAEtB,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM;AAAA,MACJ,MAAA,EAAQ,EAAA;AAAA,MACR,GAAA;AAAA,MACA,CAAA;AAAA,MACA,qBAAA;AAAA,MACA,gBAAA;AAAA,MACA;AAAA,KACF,GAAI,UAAA,EAAA;AACJ,IAAA,IAAM,EAAE,uBAAA,EAAyB,UAAA,EAAW,GAAI,iBAAA,EAAA;AAGhD,IAAA,IAAM,eAAe,IAAI,MAAA,CAAO,IAAI,CAAA,CAAE,KAAK,GAAG,GAAG,CAAA;AAEjD,IAAA,IAAM,SAAA,GAAY,CAAA,CAAA,KAAK,CAAA,CAAE,KAAA,KAAU,UAAA;AACnC,IAAA,IAAM,KAAA,GAAQ,CAAA,CAAA,KAAK,CAAA,CAAE,KAAA,KAAU,EAAA;AAI/B,IAAA,IAAM,aAAA,GAAgB,CAAC,WAAA,EAAa,OAAA,KAAY;AAC9C,MAAA,IAAI,MAAA,GAAS,IAAA;AACb,MAAA,MAAM,oBAAA,GAAuB,YAAY,KAAA,EAAM;AAC/C,MAAA,IAAI,cAAA,GAAiB,qBAAqB,GAAA,EAAI;AAE9C,MAAA,OAAO,MAAA,IAAU,qBAAqB,MAAA,EAAQ;AAC5C,QAAA,MAAA,GAAS,oBAAA,CAAqB,KAAA,CAAM,CAAC,eAAA,KAAoB;AACvD,UAAA,OAAO,cAAA,CAAe,UAAA,CAAW,eAAA,EAAiB,OAAO,CAAA;AAAA,QAC3D,CAAC,CAAA;AAED,QAAA,cAAA,GAAiB,qBAAqB,GAAA,EAAI;AAAA,MAC5C;AAEA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAKA,IAAA,IAAM,eAAA,GAAkB,CAAC,IAAA,EAAM,OAAA,KAAY;AACzC,MAAA,IAAA,GAAO,KAAK,OAAA,CAAQ,EAAA,CAAG,CAAA,CAAE,KAAK,GAAG,EAAE,CAAA;AACnC,MAAA,KAAA,CAAM,MAAA,EAAQ,MAAM,OAAO,CAAA;AAC3B,MAAA,IAAA,GAAO,aAAA,CAAc,MAAM,OAAO,CAAA;AAClC,MAAA,KAAA,CAAM,SAAS,IAAI,CAAA;AACnB,MAAA,IAAA,GAAO,aAAA,CAAc,MAAM,OAAO,CAAA;AAClC,MAAA,KAAA,CAAM,UAAU,IAAI,CAAA;AACpB,MAAA,IAAA,GAAO,cAAA,CAAe,MAAM,OAAO,CAAA;AACnC,MAAA,KAAA,CAAM,UAAU,IAAI,CAAA;AACpB,MAAA,IAAA,GAAO,YAAA,CAAa,MAAM,OAAO,CAAA;AACjC,MAAA,KAAA,CAAM,SAAS,IAAI,CAAA;AACnB,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAEA,IAAA,IAAM,GAAA,GAAM,QAAM,CAAC,EAAA,IAAM,GAAG,WAAA,EAAY,KAAM,OAAO,EAAA,KAAO,GAAA;AAE5D,IAAA,IAAM,qBAAqB,CAAC,CAAA,EAAG,GAAG,CAAA,KAC/B,GAAA,CAAI,CAAC,CAAA,IAAK,CAAC,GAAA,CAAI,CAAC,KAChB,GAAA,CAAI,CAAC,KAAK,CAAA,IAAK,CAAC,IAAI,CAAC,CAAA;AAUxB,IAAA,IAAM,aAAA,GAAgB,CAAC,IAAA,EAAM,OAAA,KAAY;AACvC,MAAA,OAAO,IAAA,CACJ,IAAA,EAAK,CACL,KAAA,CAAM,KAAK,CAAA,CACX,GAAA,CAAI,CAAC,CAAA,KAAM,aAAa,CAAA,EAAG,OAAO,CAAC,CAAA,CACnC,KAAK,GAAG,CAAA;AAAA,IACb,CAAA;AAEA,IAAA,IAAM,YAAA,GAAe,CAAC,IAAA,EAAM,OAAA,KAAY;AACtC,MAAA,MAAM,CAAA,GAAI,QAAQ,KAAA,GAAQ,EAAA,CAAG,EAAE,UAAU,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,KAAK,CAAA;AAIvD,MAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,iBAAA,GAAoB,IAAA,GAAO,EAAA;AAC7C,MAAA,OAAO,IAAA,CAAK,QAAQ,CAAA,EAAG,CAAC,GAAG,CAAA,EAAG,CAAA,EAAG,GAAG,EAAA,KAAO;AACzC,QAAA,KAAA,CAAM,SAAS,IAAA,EAAM,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAG,EAAE,CAAA;AACnC,QAAA,IAAI,GAAA;AAEJ,QAAA,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG;AACV,UAAA,GAAA,GAAM,EAAA;AAAA,QACR,CAAA,MAAA,IAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,UAAA,GAAA,GAAM,KAAK,CAAC,CAAA,IAAA,EAAO,CAAC,CAAA,EAAA,EAAK,CAAC,IAAI,CAAC,CAAA,MAAA,CAAA;AAAA,QACjC,CAAA,MAAA,IAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AAEjB,UAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,IAAA,CAAA;AAAA,QACzC,WAAW,EAAA,EAAI;AACb,UAAA,KAAA,CAAM,mBAAmB,EAAE,CAAA;AAC3B,UAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,EAC1B,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CAAC,CAAA,IAAA,CAAA;AAAA,QAClB,CAAA,MAAO;AAEL,UAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CACrB,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,IAAA,CAAA;AAAA,QAClB;AAEA,QAAA,KAAA,CAAM,gBAAgB,GAAG,CAAA;AACzB,QAAA,OAAO,GAAA;AAAA,MACT,CAAC,CAAA;AAAA,IACH,CAAA;AAUA,IAAA,IAAM,aAAA,GAAgB,CAAC,IAAA,EAAM,OAAA,KAAY;AACvC,MAAA,OAAO,IAAA,CACJ,IAAA,EAAK,CACL,KAAA,CAAM,KAAK,CAAA,CACX,GAAA,CAAI,CAAC,CAAA,KAAM,aAAa,CAAA,EAAG,OAAO,CAAC,CAAA,CACnC,KAAK,GAAG,CAAA;AAAA,IACb,CAAA;AAEA,IAAA,IAAM,YAAA,GAAe,CAAC,IAAA,EAAM,OAAA,KAAY;AACtC,MAAA,KAAA,CAAM,OAAA,EAAS,MAAM,OAAO,CAAA;AAC5B,MAAA,MAAM,CAAA,GAAI,QAAQ,KAAA,GAAQ,EAAA,CAAG,EAAE,UAAU,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,KAAK,CAAA;AACvD,MAAA,MAAM,CAAA,GAAI,OAAA,CAAQ,iBAAA,GAAoB,IAAA,GAAO,EAAA;AAC7C,MAAA,OAAO,IAAA,CAAK,QAAQ,CAAA,EAAG,CAAC,GAAG,CAAA,EAAG,CAAA,EAAG,GAAG,EAAA,KAAO;AACzC,QAAA,KAAA,CAAM,SAAS,IAAA,EAAM,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,GAAG,EAAE,CAAA;AACnC,QAAA,IAAI,GAAA;AAEJ,QAAA,IAAI,GAAA,CAAI,CAAC,CAAA,EAAG;AACV,UAAA,GAAA,GAAM,EAAA;AAAA,QACR,CAAA,MAAA,IAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,UAAA,GAAA,GAAM,KAAK,CAAC,CAAA,IAAA,EAAO,CAAC,CAAA,EAAA,EAAK,CAAC,IAAI,CAAC,CAAA,MAAA,CAAA;AAAA,QACjC,CAAA,MAAA,IAAW,GAAA,CAAI,CAAC,CAAA,EAAG;AACjB,UAAA,IAAI,MAAM,GAAA,EAAK;AACb,YAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,EAAA,EAAK,CAAC,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,IAAA,CAAA;AAAA,UACzC,CAAA,MAAO;AACL,YAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,KAAK,CAAC,CAAA,EAAA,EAAK,CAAC,CAAA,GAAI,CAAC,CAAA,MAAA,CAAA;AAAA,UACpC;AAAA,QACF,WAAW,EAAA,EAAI;AACb,UAAA,KAAA,CAAM,mBAAmB,EAAE,CAAA;AAC3B,UAAA,IAAI,MAAM,GAAA,EAAK;AACb,YAAA,IAAI,MAAM,GAAA,EAAK;AACb,cAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CAAC,CAAA,CAAA,EAAI,EAC1B,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CAAC,CAAA,EAAA,CAAA;AAAA,YACvB,CAAA,MAAO;AACL,cAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,EAC1B,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CAAC,CAAA,IAAA,CAAA;AAAA,YAClB;AAAA,UACF,CAAA,MAAO;AACL,YAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,EAC1B,CAAA,EAAA,EAAK,CAAC,CAAA,GAAI,CAAC,CAAA,MAAA,CAAA;AAAA,UACb;AAAA,QACF,CAAA,MAAO;AACL,UAAA,KAAA,CAAM,OAAO,CAAA;AACb,UAAA,IAAI,MAAM,GAAA,EAAK;AACb,YAAA,IAAI,MAAM,GAAA,EAAK;AACb,cAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CACrB,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CAAC,CAAA,EAAA,CAAA;AAAA,YACvB,CAAA,MAAO;AACL,cAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CACrB,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,IAAA,CAAA;AAAA,YAClB;AAAA,UACF,CAAA,MAAO;AACL,YAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,IAAI,CACrB,CAAA,EAAA,EAAK,CAAC,CAAA,GAAI,CAAC,CAAA,MAAA,CAAA;AAAA,UACb;AAAA,QACF;AAEA,QAAA,KAAA,CAAM,gBAAgB,GAAG,CAAA;AACzB,QAAA,OAAO,GAAA;AAAA,MACT,CAAC,CAAA;AAAA,IACH,CAAA;AAEA,IAAA,IAAM,cAAA,GAAiB,CAAC,IAAA,EAAM,OAAA,KAAY;AACxC,MAAA,KAAA,CAAM,gBAAA,EAAkB,MAAM,OAAO,CAAA;AACrC,MAAA,OAAO,IAAA,CACJ,KAAA,CAAM,KAAK,CAAA,CACX,GAAA,CAAI,CAAC,CAAA,KAAM,aAAA,CAAc,CAAA,EAAG,OAAO,CAAC,CAAA,CACpC,KAAK,GAAG,CAAA;AAAA,IACb,CAAA;AAEA,IAAA,IAAM,aAAA,GAAgB,CAAC,IAAA,EAAM,OAAA,KAAY;AACvC,MAAA,IAAA,GAAO,KAAK,IAAA,EAAK;AACjB,MAAA,MAAM,CAAA,GAAI,QAAQ,KAAA,GAAQ,EAAA,CAAG,EAAE,WAAW,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,MAAM,CAAA;AACzD,MAAA,OAAO,IAAA,CAAK,QAAQ,CAAA,EAAG,CAAC,KAAK,IAAA,EAAM,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,EAAA,KAAO;AACjD,QAAA,KAAA,CAAM,UAAU,IAAA,EAAM,GAAA,EAAK,MAAM,CAAA,EAAG,CAAA,EAAG,GAAG,EAAE,CAAA;AAC5C,QAAA,IAAI,kBAAA,CAAmB,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,EAAG;AAC/B,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,MAAM,EAAA,GAAK,IAAI,CAAC,CAAA;AAChB,QAAA,MAAM,EAAA,GAAK,EAAA,IAAM,GAAA,CAAI,CAAC,CAAA;AACtB,QAAA,MAAM,EAAA,GAAK,EAAA,IAAM,GAAA,CAAI,CAAC,CAAA;AACtB,QAAA,MAAM,IAAA,GAAO,EAAA;AAEb,QAAA,IAAI,IAAA,KAAS,OAAO,IAAA,EAAM;AACxB,UAAA,IAAA,GAAO,EAAA;AAAA,QACT;AAIA,QAAA,EAAA,GAAK,OAAA,CAAQ,oBAAoB,IAAA,GAAO,EAAA;AAExC,QAAA,IAAI,EAAA,EAAI;AACN,UAAA,IAAI,IAAA,KAAS,GAAA,IAAO,IAAA,KAAS,GAAA,EAAK;AAEhC,YAAA,GAAA,GAAM,UAAA;AAAA,UACR,CAAA,MAAO;AAEL,YAAA,GAAA,GAAM,GAAA;AAAA,UACR;AAAA,QACF,CAAA,MAAA,IAAW,QAAQ,IAAA,EAAM;AAGvB,UAAA,IAAI,EAAA,EAAI;AACN,YAAA,CAAA,GAAI,CAAA;AAAA,UACN;AACA,UAAA,CAAA,GAAI,CAAA;AAEJ,UAAA,IAAI,SAAS,GAAA,EAAK;AAGhB,YAAA,IAAA,GAAO,IAAA;AACP,YAAA,IAAI,EAAA,EAAI;AACN,cAAA,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;AACT,cAAA,CAAA,GAAI,CAAA;AACJ,cAAA,CAAA,GAAI,CAAA;AAAA,YACN,CAAA,MAAO;AACL,cAAA,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;AACT,cAAA,CAAA,GAAI,CAAA;AAAA,YACN;AAAA,UACF,CAAA,MAAA,IAAW,SAAS,IAAA,EAAM;AAGxB,YAAA,IAAA,GAAO,GAAA;AACP,YAAA,IAAI,EAAA,EAAI;AACN,cAAA,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;AAAA,YACX,CAAA,MAAO;AACL,cAAA,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA;AAAA,YACX;AAAA,UACF;AAEA,UAAA,IAAI,SAAS,GAAA,EAAK;AAChB,YAAA,EAAA,GAAK,IAAA;AAAA,UACP;AAEA,UAAA,GAAA,GAAM,CAAA,EAAG,OAAO,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,GAAG,EAAE,CAAA,CAAA;AAAA,QAClC,WAAW,EAAA,EAAI;AACb,UAAA,GAAA,GAAM,KAAK,CAAC,CAAA,IAAA,EAAO,EAAE,CAAA,EAAA,EAAK,CAAC,IAAI,CAAC,CAAA,MAAA,CAAA;AAAA,QAClC,WAAW,EAAA,EAAI;AACb,UAAA,GAAA,GAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,EAAA,EAAK,EACtB,CAAA,EAAA,EAAK,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,GAAI,CAAC,CAAA,IAAA,CAAA;AAAA,QAClB;AAEA,QAAA,KAAA,CAAM,iBAAiB,GAAG,CAAA;AAE1B,QAAA,OAAO,GAAA;AAAA,MACT,CAAC,CAAA;AAAA,IACH,CAAA;AAIA,IAAA,IAAM,YAAA,GAAe,CAAC,IAAA,EAAM,OAAA,KAAY;AACtC,MAAA,KAAA,CAAM,cAAA,EAAgB,MAAM,OAAO,CAAA;AAEnC,MAAA,OAAO,IAAA,CACJ,MAAK,CACL,OAAA,CAAQ,GAAG,CAAA,CAAE,IAAI,GAAG,EAAE,CAAA;AAAA,IAC3B,CAAA;AAEA,IAAA,IAAM,WAAA,GAAc,CAAC,IAAA,EAAM,OAAA,KAAY;AACrC,MAAA,KAAA,CAAM,aAAA,EAAe,MAAM,OAAO,CAAA;AAClC,MAAA,OAAO,IAAA,CACJ,IAAA,EAAK,CACL,OAAA,CAAQ,EAAA,CAAG,OAAA,CAAQ,iBAAA,GAAoB,CAAA,CAAE,OAAA,GAAU,CAAA,CAAE,IAAI,CAAA,EAAG,EAAE,CAAA;AAAA,IACnE,CAAA;AAQA,IAAA,IAAM,aAAA,GAAgB,CAAA,KAAA,KAAS,CAAC,EAAA,EAC9B,MAAM,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,GAAA,EAAK,EAAA,EACvB,EAAA,EAAI,EAAA,EAAI,EAAA,EAAI,IAAI,GAAA,KAAQ;AACxB,MAAA,IAAI,GAAA,CAAI,EAAE,CAAA,EAAG;AACX,QAAA,IAAA,GAAO,EAAA;AAAA,MACT,CAAA,MAAA,IAAW,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,QAAA,IAAA,GAAO,CAAA,EAAA,EAAK,EAAE,CAAA,IAAA,EAAO,KAAA,GAAQ,OAAO,EAAE,CAAA,CAAA;AAAA,MACxC,CAAA,MAAA,IAAW,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,QAAA,IAAA,GAAO,KAAK,EAAE,CAAA,CAAA,EAAI,EAAE,CAAA,EAAA,EAAK,KAAA,GAAQ,OAAO,EAAE,CAAA,CAAA;AAAA,MAC5C,WAAW,GAAA,EAAK;AACd,QAAA,IAAA,GAAO,KAAK,IAAI,CAAA,CAAA;AAAA,MAClB,CAAA,MAAO;AACL,QAAA,IAAA,GAAO,CAAA,EAAA,EAAK,IAAI,CAAA,EAAG,KAAA,GAAQ,OAAO,EAAE,CAAA,CAAA;AAAA,MACtC;AAEA,MAAA,IAAI,GAAA,CAAI,EAAE,CAAA,EAAG;AACX,QAAA,EAAA,GAAK,EAAA;AAAA,MACP,CAAA,MAAA,IAAW,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,QAAA,EAAA,GAAK,CAAA,CAAA,EAAI,CAAC,EAAA,GAAK,CAAC,CAAA,MAAA,CAAA;AAAA,MAClB,CAAA,MAAA,IAAW,GAAA,CAAI,EAAE,CAAA,EAAG;AAClB,QAAA,EAAA,GAAK,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,EAAI,CAAC,KAAK,CAAC,CAAA,IAAA,CAAA;AAAA,MACxB,WAAW,GAAA,EAAK;AACd,QAAA,EAAA,GAAK,KAAK,EAAE,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,EAAI,EAAE,IAAI,GAAG,CAAA,CAAA;AAAA,MACjC,WAAW,KAAA,EAAO;AAChB,QAAA,EAAA,GAAK,IAAI,EAAE,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,EAAI,CAAC,KAAK,CAAC,CAAA,EAAA,CAAA;AAAA,MAC9B,CAAA,MAAO;AACL,QAAA,EAAA,GAAK,KAAK,EAAE,CAAA,CAAA;AAAA,MACd;AAEA,MAAA,OAAO,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,EAAE,GAAG,IAAA,EAAK;AAAA,IAC9B,CAAA;AAEA,IAAA,IAAM,OAAA,GAAU,CAAC,GAAA,EAAK,OAAA,EAAS,OAAA,KAAY;AACzC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,QAAA,IAAI,CAAC,GAAA,CAAI,CAAC,CAAA,CAAE,IAAA,CAAK,OAAO,CAAA,EAAG;AACzB,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AAEA,MAAA,IAAI,OAAA,CAAQ,UAAA,CAAW,MAAA,IAAU,CAAC,QAAQ,iBAAA,EAAmB;AAM3D,QAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,UAAA,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,CAAE,MAAM,CAAA;AACnB,UAAA,IAAI,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA,KAAW,WAAW,GAAA,EAAK;AACpC,YAAA;AAAA,UACF;AAEA,UAAA,IAAI,IAAI,CAAC,CAAA,CAAE,MAAA,CAAO,UAAA,CAAW,SAAS,CAAA,EAAG;AACvC,YAAA,MAAM,OAAA,GAAU,GAAA,CAAI,CAAC,CAAA,CAAE,MAAA;AACvB,YAAA,IAAI,OAAA,CAAQ,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC1B,OAAA,CAAQ,KAAA,KAAU,OAAA,CAAQ,KAAA,IAC1B,OAAA,CAAQ,KAAA,KAAU,OAAA,CAAQ,KAAA,EAAO;AACnC,cAAA,OAAO,IAAA;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAGA,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AChkBA,IAAA,kBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,2CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,GAAA,0BAAa,YAAY,CAAA;AAE/B,IAAA,IAAM,UAAA,GAAN,MAAM,WAAA,CAAW;AAAA,MACf,WAAW,GAAA,GAAO;AAChB,QAAA,OAAO,GAAA;AAAA,MACT;AAAA,MAEA,WAAA,CAAa,MAAM,OAAA,EAAS;AAC1B,QAAA,OAAA,GAAU,aAAa,OAAO,CAAA;AAE9B,QAAA,IAAI,gBAAgB,WAAA,EAAY;AAC9B,UAAA,IAAI,IAAA,CAAK,KAAA,KAAU,CAAC,CAAC,QAAQ,KAAA,EAAO;AAClC,YAAA,OAAO,IAAA;AAAA,UACT,CAAA,MAAO;AACL,YAAA,IAAA,GAAO,IAAA,CAAK,KAAA;AAAA,UACd;AAAA,QACF;AAEA,QAAA,IAAA,GAAO,KAAK,IAAA,EAAK,CAAE,MAAM,KAAK,CAAA,CAAE,KAAK,GAAG,CAAA;AACxC,QAAA,KAAA,CAAM,YAAA,EAAc,MAAM,OAAO,CAAA;AACjC,QAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,QAAA,IAAA,CAAK,KAAA,GAAQ,CAAC,CAAC,OAAA,CAAQ,KAAA;AACvB,QAAA,IAAA,CAAK,MAAM,IAAI,CAAA;AAEf,QAAA,IAAI,IAAA,CAAK,WAAW,GAAA,EAAK;AACvB,UAAA,IAAA,CAAK,KAAA,GAAQ,EAAA;AAAA,QACf,CAAA,MAAO;AACL,UAAA,IAAA,CAAK,KAAA,GAAQ,IAAA,CAAK,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,OAAA;AAAA,QAC3C;AAEA,QAAA,KAAA,CAAM,QAAQ,IAAI,CAAA;AAAA,MACpB;AAAA,MAEA,MAAO,IAAA,EAAM;AACX,QAAA,MAAM,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,KAAA,GAAQ,EAAA,CAAG,EAAE,eAAe,CAAA,GAAI,EAAA,CAAG,CAAA,CAAE,UAAU,CAAA;AACtE,QAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA;AAEtB,QAAA,IAAI,CAAC,CAAA,EAAG;AACN,UAAA,MAAM,IAAI,SAAA,CAAU,CAAA,oBAAA,EAAuB,IAAI,CAAA,CAAE,CAAA;AAAA,QACnD;AAEA,QAAA,IAAA,CAAK,WAAW,CAAA,CAAE,CAAC,MAAM,MAAA,GAAY,CAAA,CAAE,CAAC,CAAA,GAAI,EAAA;AAC5C,QAAA,IAAI,IAAA,CAAK,aAAa,GAAA,EAAK;AACzB,UAAA,IAAA,CAAK,QAAA,GAAW,EAAA;AAAA,QAClB;AAGA,QAAA,IAAI,CAAC,CAAA,CAAE,CAAC,CAAA,EAAG;AACT,UAAA,IAAA,CAAK,MAAA,GAAS,GAAA;AAAA,QAChB,CAAA,MAAO;AACL,UAAA,IAAA,CAAK,MAAA,GAAS,IAAI,MAAA,CAAO,CAAA,CAAE,CAAC,CAAA,EAAG,IAAA,CAAK,QAAQ,KAAK,CAAA;AAAA,QACnD;AAAA,MACF;AAAA,MAEA,QAAA,GAAY;AACV,QAAA,OAAO,IAAA,CAAK,KAAA;AAAA,MACd;AAAA,MAEA,KAAM,OAAA,EAAS;AACb,QAAA,KAAA,CAAM,iBAAA,EAAmB,OAAA,EAAS,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA;AAEpD,QAAA,IAAI,IAAA,CAAK,MAAA,KAAW,GAAA,IAAO,OAAA,KAAY,GAAA,EAAK;AAC1C,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAI,OAAO,YAAY,QAAA,EAAU;AAC/B,UAAA,IAAI;AACF,YAAA,OAAA,GAAU,IAAI,MAAA,CAAO,OAAA,EAAS,IAAA,CAAK,OAAO,CAAA;AAAA,UAC5C,SAAS,EAAA,EAAI;AACX,YAAA,OAAO,KAAA;AAAA,UACT;AAAA,QACF;AAEA,QAAA,OAAO,IAAI,OAAA,EAAS,IAAA,CAAK,UAAU,IAAA,CAAK,MAAA,EAAQ,KAAK,OAAO,CAAA;AAAA,MAC9D;AAAA,MAEA,UAAA,CAAY,MAAM,OAAA,EAAS;AACzB,QAAA,IAAI,EAAE,gBAAgB,WAAA,CAAA,EAAa;AACjC,UAAA,MAAM,IAAI,UAAU,0BAA0B,CAAA;AAAA,QAChD;AAEA,QAAA,IAAI,IAAA,CAAK,aAAa,EAAA,EAAI;AACxB,UAAA,IAAI,IAAA,CAAK,UAAU,EAAA,EAAI;AACrB,YAAA,OAAO,IAAA;AAAA,UACT;AACA,UAAA,OAAO,IAAI,MAAM,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,CAAE,IAAA,CAAK,KAAK,KAAK,CAAA;AAAA,QACvD,CAAA,MAAA,IAAW,IAAA,CAAK,QAAA,KAAa,EAAA,EAAI;AAC/B,UAAA,IAAI,IAAA,CAAK,UAAU,EAAA,EAAI;AACrB,YAAA,OAAO,IAAA;AAAA,UACT;AACA,UAAA,OAAO,IAAI,MAAM,IAAA,CAAK,KAAA,EAAO,OAAO,CAAA,CAAE,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,QACxD;AAEA,QAAA,OAAA,GAAU,aAAa,OAAO,CAAA;AAG9B,QAAA,IAAI,QAAQ,iBAAA,KACT,IAAA,CAAK,UAAU,UAAA,IAAc,IAAA,CAAK,UAAU,UAAA,CAAA,EAAa;AAC1D,UAAA,OAAO,KAAA;AAAA,QACT;AACA,QAAA,IAAI,CAAC,OAAA,CAAQ,iBAAA,KACV,IAAA,CAAK,KAAA,CAAM,UAAA,CAAW,QAAQ,CAAA,IAAK,IAAA,CAAK,KAAA,CAAM,UAAA,CAAW,QAAQ,CAAA,CAAA,EAAI;AACtE,UAAA,OAAO,KAAA;AAAA,QACT;AAGA,QAAA,IAAI,IAAA,CAAK,SAAS,UAAA,CAAW,GAAG,KAAK,IAAA,CAAK,QAAA,CAAS,UAAA,CAAW,GAAG,CAAA,EAAG;AAClE,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAI,IAAA,CAAK,SAAS,UAAA,CAAW,GAAG,KAAK,IAAA,CAAK,QAAA,CAAS,UAAA,CAAW,GAAG,CAAA,EAAG;AAClE,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IACG,IAAA,CAAK,MAAA,CAAO,OAAA,KAAY,IAAA,CAAK,OAAO,OAAA,IACrC,IAAA,CAAK,QAAA,CAAS,QAAA,CAAS,GAAG,CAAA,IAAK,IAAA,CAAK,QAAA,CAAS,QAAA,CAAS,GAAG,CAAA,EAAG;AAC5D,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAI,IAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAO,CAAA,IAC5C,IAAA,CAAK,QAAA,CAAS,WAAW,GAAG,CAAA,IAAK,KAAK,QAAA,CAAS,UAAA,CAAW,GAAG,CAAA,EAAG;AAChE,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAI,IAAI,IAAA,CAAK,MAAA,EAAQ,GAAA,EAAK,IAAA,CAAK,QAAQ,OAAO,CAAA,IAC5C,IAAA,CAAK,QAAA,CAAS,WAAW,GAAG,CAAA,IAAK,KAAK,QAAA,CAAS,UAAA,CAAW,GAAG,CAAA,EAAG;AAChE,UAAA,OAAO,IAAA;AAAA,QACT;AACA,QAAA,OAAO,KAAA;AAAA,MACT;AAAA,KACF;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,UAAA;AAEjB,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,EAAE,MAAA,EAAQ,EAAA,EAAI,CAAA,EAAE,GAAI,UAAA,EAAA;AAC1B,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC9Id,IAAA,iBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,4CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAMC,UAAAA,GAAY,CAAC,OAAA,EAAS,KAAA,EAAO,OAAA,KAAY;AAC7C,MAAA,IAAI;AACF,QAAA,KAAA,GAAQ,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAAA,MAClC,SAAS,EAAA,EAAI;AACX,QAAA,OAAO,KAAA;AAAA,MACT;AACA,MAAA,OAAO,KAAA,CAAM,KAAK,OAAO,CAAA;AAAA,IAC3B,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAUA,UAAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACXjB,IAAA,sBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,8CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AAGd,IAAA,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAO,OAAA,KAC5B,IAAI,MAAM,KAAA,EAAO,OAAO,CAAA,CAAE,GAAA,CACvB,GAAA,CAAI,CAAA,IAAA,KAAQ,KAAK,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,KAAK,CAAA,CAAE,IAAA,CAAK,GAAG,CAAA,CAAE,IAAA,EAAK,CAAE,KAAA,CAAM,GAAG,CAAC,CAAA;AAEnE,IAAA,MAAA,CAAO,OAAA,GAAU,aAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACTjB,IAAA,sBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,8CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AAEd,IAAA,IAAM,aAAA,GAAgB,CAAC,QAAA,EAAU,KAAA,EAAO,OAAA,KAAY;AAClD,MAAA,IAAI,GAAA,GAAM,IAAA;AACV,MAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,MAAA,IAAI,QAAA,GAAW,IAAA;AACf,MAAA,IAAI;AACF,QAAA,QAAA,GAAW,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAAA,MACrC,SAAS,EAAA,EAAI;AACX,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA,KAAM;AACtB,QAAA,IAAI,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,EAAG;AAEpB,UAAA,IAAI,CAAC,GAAA,IAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAM,EAAA,EAAI;AAEnC,YAAA,GAAA,GAAM,CAAA;AACN,YAAA,KAAA,GAAQ,IAAI,MAAA,CAAO,GAAA,EAAK,OAAO,CAAA;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC,CAAA;AACD,MAAA,OAAO,GAAA;AAAA,IACT,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,aAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC1BjB,IAAA,sBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,8CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,aAAA,GAAgB,CAAC,QAAA,EAAU,KAAA,EAAO,OAAA,KAAY;AAClD,MAAA,IAAI,GAAA,GAAM,IAAA;AACV,MAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,MAAA,IAAI,QAAA,GAAW,IAAA;AACf,MAAA,IAAI;AACF,QAAA,QAAA,GAAW,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAAA,MACrC,SAAS,EAAA,EAAI;AACX,QAAA,OAAO,IAAA;AAAA,MACT;AACA,MAAA,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA,KAAM;AACtB,QAAA,IAAI,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,EAAG;AAEpB,UAAA,IAAI,CAAC,GAAA,IAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,MAAM,CAAA,EAAG;AAElC,YAAA,GAAA,GAAM,CAAA;AACN,YAAA,KAAA,GAAQ,IAAI,MAAA,CAAO,GAAA,EAAK,OAAO,CAAA;AAAA,UACjC;AAAA,QACF;AAAA,MACF,CAAC,CAAA;AACD,MAAA,OAAO,GAAA;AAAA,IACT,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,aAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACzBjB,IAAA,mBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,2CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AAEX,IAAA,IAAM,UAAA,GAAa,CAAC,KAAA,EAAO,KAAA,KAAU;AACnC,MAAA,KAAA,GAAQ,IAAI,KAAA,CAAM,KAAA,EAAO,KAAK,CAAA;AAE9B,MAAA,IAAI,MAAA,GAAS,IAAI,MAAA,CAAO,OAAO,CAAA;AAC/B,MAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA,EAAG;AACtB,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAA,GAAS,IAAI,OAAO,SAAS,CAAA;AAC7B,MAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA,EAAG;AACtB,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAA,GAAS,IAAA;AACT,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA,EAAG;AACzC,QAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA;AAE/B,QAAA,IAAI,MAAA,GAAS,IAAA;AACb,QAAA,WAAA,CAAY,OAAA,CAAQ,CAAC,UAAA,KAAe;AAElC,UAAA,MAAM,OAAA,GAAU,IAAI,MAAA,CAAO,UAAA,CAAW,OAAO,OAAO,CAAA;AACpD,UAAA,QAAQ,WAAW,QAAA;AAAU,YAC3B,KAAK,GAAA;AACH,cAAA,IAAI,OAAA,CAAQ,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AACnC,gBAAA,OAAA,CAAQ,KAAA,EAAA;AAAA,cACV,CAAA,MAAO;AACL,gBAAA,OAAA,CAAQ,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,cAC3B;AACA,cAAA,OAAA,CAAQ,GAAA,GAAM,QAAQ,MAAA,EAAO;AAAA;AAAA,YAE/B,KAAK,EAAA;AAAA,YACL,KAAK,IAAA;AACH,cAAA,IAAI,CAAC,MAAA,IAAU,EAAA,CAAG,OAAA,EAAS,MAAM,CAAA,EAAG;AAClC,gBAAA,MAAA,GAAS,OAAA;AAAA,cACX;AACA,cAAA;AAAA,YACF,KAAK,GAAA;AAAA,YACL,KAAK,IAAA;AAEH,cAAA;AAAA;AAAA,YAEF;AACE,cAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,UAAA,CAAW,QAAQ,CAAA,CAAE,CAAA;AAAA;AAClE,QACF,CAAC,CAAA;AACD,QAAA,IAAI,WAAW,CAAC,MAAA,IAAU,EAAA,CAAG,MAAA,EAAQ,MAAM,CAAA,CAAA,EAAI;AAC7C,UAAA,MAAA,GAAS,MAAA;AAAA,QACX;AAAA,MACF;AAEA,MAAA,IAAI,MAAA,IAAU,KAAA,CAAM,IAAA,CAAK,MAAM,CAAA,EAAG;AAChC,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,UAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AC9DjB,IAAAC,cAAAA,GAAA,UAAA,CAAA;AAAA,EAAA,qCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAMC,WAAAA,GAAa,CAAC,KAAA,EAAO,OAAA,KAAY;AACrC,MAAA,IAAI;AAGF,QAAA,OAAO,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,EAAE,KAAA,IAAS,GAAA;AAAA,MAC5C,SAAS,EAAA,EAAI;AACX,QAAA,OAAO,IAAA;AAAA,MACT;AAAA,IACF,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAUA,WAAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACZjB,IAAA,eAAA,GAAA,UAAA,CAAA;AAAA,EAAA,uCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,EAAE,KAAI,GAAI,UAAA;AAChB,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAMF,UAAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AAEZ,IAAA,IAAM,OAAA,GAAU,CAAC,OAAA,EAAS,KAAA,EAAO,MAAM,OAAA,KAAY;AACjD,MAAA,OAAA,GAAU,IAAI,MAAA,CAAO,OAAA,EAAS,OAAO,CAAA;AACrC,MAAA,KAAA,GAAQ,IAAI,KAAA,CAAM,KAAA,EAAO,OAAO,CAAA;AAEhC,MAAA,IAAI,IAAA,EAAM,KAAA,EAAO,IAAA,EAAM,IAAA,EAAM,KAAA;AAC7B,MAAA,QAAQ,IAAA;AAAM,QACZ,KAAK,GAAA;AACH,UAAA,IAAA,GAAO,EAAA;AACP,UAAA,KAAA,GAAQ,GAAA;AACR,UAAA,IAAA,GAAO,EAAA;AACP,UAAA,IAAA,GAAO,GAAA;AACP,UAAA,KAAA,GAAQ,IAAA;AACR,UAAA;AAAA,QACF,KAAK,GAAA;AACH,UAAA,IAAA,GAAO,EAAA;AACP,UAAA,KAAA,GAAQ,GAAA;AACR,UAAA,IAAA,GAAO,EAAA;AACP,UAAA,IAAA,GAAO,GAAA;AACP,UAAA,KAAA,GAAQ,IAAA;AACR,UAAA;AAAA,QACF;AACE,UAAA,MAAM,IAAI,UAAU,uCAAuC,CAAA;AAAA;AAI/D,MAAA,IAAIA,UAAAA,CAAU,OAAA,EAAS,KAAA,EAAO,OAAO,CAAA,EAAG;AACtC,QAAA,OAAO,KAAA;AAAA,MACT;AAKA,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAM,GAAA,CAAI,MAAA,EAAQ,EAAE,CAAA,EAAG;AACzC,QAAA,MAAM,WAAA,GAAc,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA;AAE/B,QAAA,IAAI,IAAA,GAAO,IAAA;AACX,QAAA,IAAI,GAAA,GAAM,IAAA;AAEV,QAAA,WAAA,CAAY,OAAA,CAAQ,CAAC,UAAA,KAAe;AAClC,UAAA,IAAI,UAAA,CAAW,WAAW,GAAA,EAAK;AAC7B,YAAA,UAAA,GAAa,IAAI,WAAW,SAAS,CAAA;AAAA,UACvC;AACA,UAAA,IAAA,GAAO,IAAA,IAAQ,UAAA;AACf,UAAA,GAAA,GAAM,GAAA,IAAO,UAAA;AACb,UAAA,IAAI,KAAK,UAAA,CAAW,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAQ,OAAO,CAAA,EAAG;AACjD,YAAA,IAAA,GAAO,UAAA;AAAA,UACT,WAAW,IAAA,CAAK,UAAA,CAAW,QAAQ,GAAA,CAAI,MAAA,EAAQ,OAAO,CAAA,EAAG;AACvD,YAAA,GAAA,GAAM,UAAA;AAAA,UACR;AAAA,QACF,CAAC,CAAA;AAID,QAAA,IAAI,IAAA,CAAK,QAAA,KAAa,IAAA,IAAQ,IAAA,CAAK,aAAa,KAAA,EAAO;AACrD,UAAA,OAAO,KAAA;AAAA,QACT;AAIA,QAAA,IAAA,CAAK,CAAC,GAAA,CAAI,QAAA,IAAY,GAAA,CAAI,QAAA,KAAa,SACnC,KAAA,CAAM,OAAA,EAAS,GAAA,CAAI,MAAM,CAAA,EAAG;AAC9B,UAAA,OAAO,KAAA;AAAA,QACT,CAAA,MAAA,IAAW,IAAI,QAAA,KAAa,KAAA,IAAS,KAAK,OAAA,EAAS,GAAA,CAAI,MAAM,CAAA,EAAG;AAC9D,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AACA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,OAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACjFjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,mCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAGA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,GAAA,GAAM,CAAC,OAAA,EAAS,KAAA,EAAO,YAAY,OAAA,CAAQ,OAAA,EAAS,KAAA,EAAO,GAAA,EAAK,OAAO,CAAA;AAC7E,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACLjB,IAAA,WAAA,GAAA,UAAA,CAAA;AAAA,EAAA,mCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAEhB,IAAA,IAAM,GAAA,GAAM,CAAC,OAAA,EAAS,KAAA,EAAO,YAAY,OAAA,CAAQ,OAAA,EAAS,KAAA,EAAO,GAAA,EAAK,OAAO,CAAA;AAC7E,IAAA,MAAA,CAAO,OAAA,GAAU,GAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACLjB,IAAA,kBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,0CAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,UAAA,GAAa,CAAC,EAAA,EAAI,EAAA,EAAI,OAAA,KAAY;AACtC,MAAA,EAAA,GAAK,IAAI,KAAA,CAAM,EAAA,EAAI,OAAO,CAAA;AAC1B,MAAA,EAAA,GAAK,IAAI,KAAA,CAAM,EAAA,EAAI,OAAO,CAAA;AAC1B,MAAA,OAAO,EAAA,CAAG,UAAA,CAAW,EAAA,EAAI,OAAO,CAAA;AAAA,IAClC,CAAA;AACA,IAAA,MAAA,CAAO,OAAA,GAAU,UAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACRjB,IAAA,gBAAA,GAAA,UAAA,CAAA;AAAA,EAAA,wCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAKA,IAAA,IAAMA,UAAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,MAAA,CAAO,OAAA,GAAU,CAAC,QAAA,EAAU,KAAA,EAAO,OAAA,KAAY;AAC7C,MAAA,MAAM,MAAM,EAAC;AACb,MAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,MAAA,IAAI,IAAA,GAAO,IAAA;AACX,MAAA,MAAM,CAAA,GAAI,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,EAAG,MAAM,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,OAAO,CAAC,CAAA;AACxD,MAAA,KAAA,MAAW,WAAW,CAAA,EAAG;AACvB,QAAA,MAAM,QAAA,GAAWA,UAAAA,CAAU,OAAA,EAAS,KAAA,EAAO,OAAO,CAAA;AAClD,QAAA,IAAI,QAAA,EAAU;AACZ,UAAA,IAAA,GAAO,OAAA;AACP,UAAA,IAAI,CAAC,KAAA,EAAO;AACV,YAAA,KAAA,GAAQ,OAAA;AAAA,UACV;AAAA,QACF,CAAA,MAAO;AACL,UAAA,IAAI,IAAA,EAAM;AACR,YAAA,GAAA,CAAI,IAAA,CAAK,CAAC,KAAA,EAAO,IAAI,CAAC,CAAA;AAAA,UACxB;AACA,UAAA,IAAA,GAAO,IAAA;AACP,UAAA,KAAA,GAAQ,IAAA;AAAA,QACV;AAAA,MACF;AACA,MAAA,IAAI,KAAA,EAAO;AACT,QAAA,GAAA,CAAI,IAAA,CAAK,CAAC,KAAA,EAAO,IAAI,CAAC,CAAA;AAAA,MACxB;AAEA,MAAA,MAAM,SAAS,EAAC;AAChB,MAAA,KAAA,MAAW,CAAC,GAAA,EAAK,GAAG,CAAA,IAAK,GAAA,EAAK;AAC5B,QAAA,IAAI,QAAQ,GAAA,EAAK;AACf,UAAA,MAAA,CAAO,KAAK,GAAG,CAAA;AAAA,QACjB,WAAW,CAAC,GAAA,IAAO,GAAA,KAAQ,CAAA,CAAE,CAAC,CAAA,EAAG;AAC/B,UAAA,MAAA,CAAO,KAAK,GAAG,CAAA;AAAA,QACjB,CAAA,MAAA,IAAW,CAAC,GAAA,EAAK;AACf,UAAA,MAAA,CAAO,IAAA,CAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AAAA,QACxB,CAAA,MAAA,IAAW,GAAA,KAAQ,CAAA,CAAE,CAAC,CAAA,EAAG;AACvB,UAAA,MAAA,CAAO,IAAA,CAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAE,CAAA;AAAA,QACxB,CAAA,MAAO;AACL,UAAA,MAAA,CAAO,IAAA,CAAK,CAAA,EAAG,GAAG,CAAA,GAAA,EAAM,GAAG,CAAA,CAAE,CAAA;AAAA,QAC/B;AAAA,MACF;AACA,MAAA,MAAM,UAAA,GAAa,MAAA,CAAO,IAAA,CAAK,MAAM,CAAA;AACrC,MAAA,MAAM,QAAA,GAAW,OAAO,KAAA,CAAM,GAAA,KAAQ,WAAW,KAAA,CAAM,GAAA,GAAM,OAAO,KAAK,CAAA;AACzE,MAAA,OAAO,UAAA,CAAW,MAAA,GAAS,QAAA,CAAS,MAAA,GAAS,UAAA,GAAa,KAAA;AAAA,IAC5D,CAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;AChDA,IAAA,cAAA,GAAA,UAAA,CAAA;AAAA,EAAA,sCAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAEA,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,EAAE,KAAI,GAAI,UAAA;AAChB,IAAA,IAAMA,UAAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAsChB,IAAA,IAAM,SAAS,CAAC,GAAA,EAAK,GAAA,EAAK,OAAA,GAAU,EAAC,KAAM;AACzC,MAAA,IAAI,QAAQ,GAAA,EAAK;AACf,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,GAAA,GAAM,IAAI,KAAA,CAAM,GAAA,EAAK,OAAO,CAAA;AAC5B,MAAA,GAAA,GAAM,IAAI,KAAA,CAAM,GAAA,EAAK,OAAO,CAAA;AAC5B,MAAA,IAAI,UAAA,GAAa,KAAA;AAEjB,MAAA,KAAA,EAAO,KAAA,MAAW,SAAA,IAAa,GAAA,CAAI,GAAA,EAAK;AACtC,QAAA,KAAA,MAAW,SAAA,IAAa,IAAI,GAAA,EAAK;AAC/B,UAAA,MAAM,KAAA,GAAQ,YAAA,CAAa,SAAA,EAAW,SAAA,EAAW,OAAO,CAAA;AACxD,UAAA,UAAA,GAAa,cAAc,KAAA,KAAU,IAAA;AACrC,UAAA,IAAI,KAAA,EAAO;AACT,YAAA,SAAS,KAAA;AAAA,UACX;AAAA,QACF;AAKA,QAAA,IAAI,UAAA,EAAY;AACd,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AACA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAEA,IAAA,IAAM,4BAAA,GAA+B,CAAC,IAAI,UAAA,CAAW,WAAW,CAAC,CAAA;AACjE,IAAA,IAAM,cAAA,GAAiB,CAAC,IAAI,UAAA,CAAW,SAAS,CAAC,CAAA;AAEjD,IAAA,IAAM,YAAA,GAAe,CAAC,GAAA,EAAK,GAAA,EAAK,OAAA,KAAY;AAC1C,MAAA,IAAI,QAAQ,GAAA,EAAK;AACf,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,IAAI,IAAI,MAAA,KAAW,CAAA,IAAK,IAAI,CAAC,CAAA,CAAE,WAAW,GAAA,EAAK;AAC7C,QAAA,IAAI,IAAI,MAAA,KAAW,CAAA,IAAK,IAAI,CAAC,CAAA,CAAE,WAAW,GAAA,EAAK;AAC7C,UAAA,OAAO,IAAA;AAAA,QACT,CAAA,MAAA,IAAW,QAAQ,iBAAA,EAAmB;AACpC,UAAA,GAAA,GAAM,4BAAA;AAAA,QACR,CAAA,MAAO;AACL,UAAA,GAAA,GAAM,cAAA;AAAA,QACR;AAAA,MACF;AAEA,MAAA,IAAI,IAAI,MAAA,KAAW,CAAA,IAAK,IAAI,CAAC,CAAA,CAAE,WAAW,GAAA,EAAK;AAC7C,QAAA,IAAI,QAAQ,iBAAA,EAAmB;AAC7B,UAAA,OAAO,IAAA;AAAA,QACT,CAAA,MAAO;AACL,UAAA,GAAA,GAAM,cAAA;AAAA,QACR;AAAA,MACF;AAEA,MAAA,MAAM,KAAA,uBAAY,GAAA,EAAI;AACtB,MAAA,IAAI,EAAA,EAAI,EAAA;AACR,MAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,QAAA,IAAI,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,aAAa,IAAA,EAAM;AAC7C,UAAA,EAAA,GAAK,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAAA,QAC9B,WAAW,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,aAAa,IAAA,EAAM;AACpD,UAAA,EAAA,GAAK,OAAA,CAAQ,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAAA,QAC7B,CAAA,MAAO;AACL,UAAA,KAAA,CAAM,GAAA,CAAI,EAAE,MAAM,CAAA;AAAA,QACpB;AAAA,MACF;AAEA,MAAA,IAAI,KAAA,CAAM,OAAO,CAAA,EAAG;AAClB,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,IAAI,QAAA;AACJ,MAAA,IAAI,MAAM,EAAA,EAAI;AACZ,QAAA,QAAA,GAAW,OAAA,CAAQ,EAAA,CAAG,MAAA,EAAQ,EAAA,CAAG,QAAQ,OAAO,CAAA;AAChD,QAAA,IAAI,WAAW,CAAA,EAAG;AAChB,UAAA,OAAO,IAAA;AAAA,QACT,CAAA,MAAA,IAAW,aAAa,CAAA,KAAM,EAAA,CAAG,aAAa,IAAA,IAAQ,EAAA,CAAG,aAAa,IAAA,CAAA,EAAO;AAC3E,UAAA,OAAO,IAAA;AAAA,QACT;AAAA,MACF;AAGA,MAAA,KAAA,MAAW,MAAM,KAAA,EAAO;AACtB,QAAA,IAAI,EAAA,IAAM,CAACA,UAAAA,CAAU,EAAA,EAAI,OAAO,EAAE,CAAA,EAAG,OAAO,CAAA,EAAG;AAC7C,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,IAAI,EAAA,IAAM,CAACA,UAAAA,CAAU,EAAA,EAAI,OAAO,EAAE,CAAA,EAAG,OAAO,CAAA,EAAG;AAC7C,UAAA,OAAO,IAAA;AAAA,QACT;AAEA,QAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,UAAA,IAAI,CAACA,UAAAA,CAAU,EAAA,EAAI,OAAO,CAAC,CAAA,EAAG,OAAO,CAAA,EAAG;AACtC,YAAA,OAAO,KAAA;AAAA,UACT;AAAA,QACF;AAEA,QAAA,OAAO,IAAA;AAAA,MACT;AAEA,MAAA,IAAI,MAAA,EAAQ,KAAA;AACZ,MAAA,IAAI,QAAA,EAAU,QAAA;AAGd,MAAA,IAAI,YAAA,GAAe,EAAA,IACjB,CAAC,OAAA,CAAQ,iBAAA,IACT,GAAG,MAAA,CAAO,UAAA,CAAW,MAAA,GAAS,EAAA,CAAG,MAAA,GAAS,KAAA;AAC5C,MAAA,IAAI,YAAA,GAAe,EAAA,IACjB,CAAC,OAAA,CAAQ,iBAAA,IACT,GAAG,MAAA,CAAO,UAAA,CAAW,MAAA,GAAS,EAAA,CAAG,MAAA,GAAS,KAAA;AAE5C,MAAA,IAAI,YAAA,IAAgB,YAAA,CAAa,UAAA,CAAW,MAAA,KAAW,CAAA,IACnD,EAAA,CAAG,QAAA,KAAa,GAAA,IAAO,YAAA,CAAa,UAAA,CAAW,CAAC,CAAA,KAAM,CAAA,EAAG;AAC3D,QAAA,YAAA,GAAe,KAAA;AAAA,MACjB;AAEA,MAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,QAAA,QAAA,GAAW,QAAA,IAAY,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,EAAE,QAAA,KAAa,IAAA;AAC5D,QAAA,QAAA,GAAW,QAAA,IAAY,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,EAAE,QAAA,KAAa,IAAA;AAC5D,QAAA,IAAI,EAAA,EAAI;AACN,UAAA,IAAI,YAAA,EAAc;AAChB,YAAA,IAAI,CAAA,CAAE,OAAO,UAAA,IAAc,CAAA,CAAE,OAAO,UAAA,CAAW,MAAA,IAC3C,EAAE,MAAA,CAAO,KAAA,KAAU,aAAa,KAAA,IAChC,CAAA,CAAE,OAAO,KAAA,KAAU,YAAA,CAAa,SAChC,CAAA,CAAE,MAAA,CAAO,KAAA,KAAU,YAAA,CAAa,KAAA,EAAO;AACzC,cAAA,YAAA,GAAe,KAAA;AAAA,YACjB;AAAA,UACF;AACA,UAAA,IAAI,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,aAAa,IAAA,EAAM;AAC7C,YAAA,MAAA,GAAS,QAAA,CAAS,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAChC,YAAA,IAAI,MAAA,KAAW,CAAA,IAAK,MAAA,KAAW,EAAA,EAAI;AACjC,cAAA,OAAO,KAAA;AAAA,YACT;AAAA,UACF,CAAA,MAAA,IAAW,GAAG,QAAA,KAAa,IAAA,IAAQ,CAAC,CAAA,CAAE,IAAA,CAAK,EAAA,CAAG,MAAM,CAAA,EAAG;AACrD,YAAA,OAAO,KAAA;AAAA,UACT;AAAA,QACF;AACA,QAAA,IAAI,EAAA,EAAI;AACN,UAAA,IAAI,YAAA,EAAc;AAChB,YAAA,IAAI,CAAA,CAAE,OAAO,UAAA,IAAc,CAAA,CAAE,OAAO,UAAA,CAAW,MAAA,IAC3C,EAAE,MAAA,CAAO,KAAA,KAAU,aAAa,KAAA,IAChC,CAAA,CAAE,OAAO,KAAA,KAAU,YAAA,CAAa,SAChC,CAAA,CAAE,MAAA,CAAO,KAAA,KAAU,YAAA,CAAa,KAAA,EAAO;AACzC,cAAA,YAAA,GAAe,KAAA;AAAA,YACjB;AAAA,UACF;AACA,UAAA,IAAI,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,aAAa,IAAA,EAAM;AAC7C,YAAA,KAAA,GAAQ,OAAA,CAAQ,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAC9B,YAAA,IAAI,KAAA,KAAU,CAAA,IAAK,KAAA,KAAU,EAAA,EAAI;AAC/B,cAAA,OAAO,KAAA;AAAA,YACT;AAAA,UACF,CAAA,MAAA,IAAW,GAAG,QAAA,KAAa,IAAA,IAAQ,CAAC,CAAA,CAAE,IAAA,CAAK,EAAA,CAAG,MAAM,CAAA,EAAG;AACrD,YAAA,OAAO,KAAA;AAAA,UACT;AAAA,QACF;AACA,QAAA,IAAI,CAAC,CAAA,CAAE,QAAA,KAAa,EAAA,IAAM,EAAA,CAAA,IAAO,aAAa,CAAA,EAAG;AAC/C,UAAA,OAAO,KAAA;AAAA,QACT;AAAA,MACF;AAKA,MAAA,IAAI,EAAA,IAAM,QAAA,IAAY,CAAC,EAAA,IAAM,aAAa,CAAA,EAAG;AAC3C,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAI,EAAA,IAAM,QAAA,IAAY,CAAC,EAAA,IAAM,aAAa,CAAA,EAAG;AAC3C,QAAA,OAAO,KAAA;AAAA,MACT;AAKA,MAAA,IAAI,gBAAgB,YAAA,EAAc;AAChC,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAGA,IAAA,IAAM,QAAA,GAAW,CAAC,CAAA,EAAG,CAAA,EAAG,OAAA,KAAY;AAClC,MAAA,IAAI,CAAC,CAAA,EAAG;AACN,QAAA,OAAO,CAAA;AAAA,MACT;AACA,MAAA,MAAM,OAAO,OAAA,CAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,QAAQ,OAAO,CAAA;AAChD,MAAA,OAAO,IAAA,GAAO,CAAA,GAAI,CAAA,GACd,IAAA,GAAO,CAAA,GAAI,CAAA,GACX,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,QAAA,KAAa,IAAA,GAAO,CAAA,GAC5C,CAAA;AAAA,IACN,CAAA;AAGA,IAAA,IAAM,OAAA,GAAU,CAAC,CAAA,EAAG,CAAA,EAAG,OAAA,KAAY;AACjC,MAAA,IAAI,CAAC,CAAA,EAAG;AACN,QAAA,OAAO,CAAA;AAAA,MACT;AACA,MAAA,MAAM,OAAO,OAAA,CAAQ,CAAA,CAAE,MAAA,EAAQ,CAAA,CAAE,QAAQ,OAAO,CAAA;AAChD,MAAA,OAAO,IAAA,GAAO,CAAA,GAAI,CAAA,GACd,IAAA,GAAO,CAAA,GAAI,CAAA,GACX,CAAA,CAAE,QAAA,KAAa,GAAA,IAAO,CAAA,CAAE,QAAA,KAAa,IAAA,GAAO,CAAA,GAC5C,CAAA;AAAA,IACN,CAAA;AAEA,IAAA,MAAA,CAAO,OAAA,GAAU,MAAA;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACxPjB,IAAAG,eAAAA,GAAA,UAAA,CAAA;AAAA,EAAA,8BAAA,CAAA,OAAA,EAAA,MAAA,EAAA;AAGA,IAAA,IAAM,UAAA,GAAa,UAAA,EAAA;AACnB,IAAA,IAAM,SAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,WAAA,GAAc,mBAAA,EAAA;AACpB,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,IAAA,GAAO,YAAA,EAAA;AACb,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,QAAA,GAAW,gBAAA,EAAA;AACjB,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,YAAA,GAAe,qBAAA,EAAA;AACrB,IAAA,IAAM,IAAA,GAAO,YAAA,EAAA;AACb,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,EAAA,GAAK,UAAA,EAAA;AACX,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAMJ,OAAAA,GAAS,cAAA,EAAA;AACf,IAAA,IAAM,QAAA,GAAW,gBAAA,EAAA;AACjB,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,KAAA,GAAQ,aAAA,EAAA;AACd,IAAA,IAAMC,UAAAA,GAAY,iBAAA,EAAA;AAClB,IAAA,IAAM,aAAA,GAAgB,sBAAA,EAAA;AACtB,IAAA,IAAM,aAAA,GAAgB,sBAAA,EAAA;AACtB,IAAA,IAAM,aAAA,GAAgB,sBAAA,EAAA;AACtB,IAAA,IAAM,UAAA,GAAa,mBAAA,EAAA;AACnB,IAAA,IAAME,WAAAA,GAAa,cAAA,EAAA;AACnB,IAAA,IAAM,OAAA,GAAU,eAAA,EAAA;AAChB,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,GAAA,GAAM,WAAA,EAAA;AACZ,IAAA,IAAM,UAAA,GAAa,kBAAA,EAAA;AACnB,IAAA,IAAM,aAAA,GAAgB,gBAAA,EAAA;AACtB,IAAA,IAAM,MAAA,GAAS,cAAA,EAAA;AACf,IAAA,MAAA,CAAO,OAAA,GAAU;AAAA,MACf,KAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,GAAA;AAAA,MACA,IAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,UAAA;AAAA,MACA,OAAA;AAAA,MACA,QAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA,IAAA;AAAA,MACA,KAAA;AAAA,MACA,EAAA;AAAA,MACA,EAAA;AAAA,MACA,EAAA;AAAA,MACA,GAAA;AAAA,MACA,GAAA;AAAA,MACA,GAAA;AAAA,MACA,GAAA;AAAA,MACA,MAAA,EAAAH,OAAAA;AAAA,MACA,QAAA;AAAA,MACA,UAAA;AAAA,MACA,KAAA;AAAA,MACA,SAAA,EAAAC,UAAAA;AAAA,MACA,aAAA;AAAA,MACA,aAAA;AAAA,MACA,aAAA;AAAA,MACA,UAAA;AAAA,MACA,UAAA,EAAAE,WAAAA;AAAA,MACA,OAAA;AAAA,MACA,GAAA;AAAA,MACA,GAAA;AAAA,MACA,UAAA;AAAA,MACA,aAAA;AAAA,MACA,MAAA;AAAA,MACA,MAAA;AAAA,MACA,IAAI,UAAA,CAAW,EAAA;AAAA,MACf,KAAK,UAAA,CAAW,GAAA;AAAA,MAChB,QAAQ,UAAA,CAAW,CAAA;AAAA,MACnB,qBAAqB,SAAA,CAAU,mBAAA;AAAA,MAC/B,eAAe,SAAA,CAAU,aAAA;AAAA,MACzB,oBAAoB,WAAA,CAAY,kBAAA;AAAA,MAChC,qBAAqB,WAAA,CAAY;AAAA,KACnC;AAAA,EAAA;AAAA,CAAA,CAAA;;;ACnFO,IAAM,iBAAN,MAAqB;AAAA,EAC1B,WAAA,CACS,MAAA,EACA,QAAA,EACA,aAAA,EACA,aAAA,EACP;AAJO,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AACA,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AAAA,EACN;AACL,CAAA;AA2BO,IAAM,SAAA,GAAN,MAAM,UAAA,CAAU;AAAA,EAAhB,WAAA,GAAA;AAEL;AAAA,IAAA,IAAA,CAAQ,MAAA,uBAAuD,GAAA,EAAI;AACnE,IAAA,IAAA,CAAQ,KAAA,GAAQ,CAAA;AAAA,EAAA;AAAA,EAEhB,OAAe,QAAQ,UAAA,EAA6B;AAClD,IAAA,OAAO,UAAA,IAAc,EAAA;AAAA,EACvB;AAAA,EAEA,OAAe,UAAA,CAAW,IAAA,EAAc,OAAA,EAAyB;AAC/D,IAAA,OAAO,OAAA,KAAY,KAAK,CAAA,EAAG,IAAI,KAAK,CAAA,EAAG,IAAI,IAAI,OAAO,CAAA,CAAA;AAAA,EACxD;AAAA,EAEA,GAAA,CAAI,MAAc,UAAA,EAAiD;AACjE,IAAA,OAAO,IAAA,CAAK,OAAO,GAAA,CAAI,IAAI,GAAG,GAAA,CAAI,UAAA,CAAU,OAAA,CAAQ,UAAU,CAAC,CAAA;AAAA,EACjE;AAAA;AAAA,EAGA,gBAAgB,IAAA,EAA0C;AACxD,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AACpC,IAAA,IAAI,CAAC,SAAS,OAAO,MAAA;AAErB,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,EAAO,EAAG;AACpC,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEA,GAAA,CAAI,IAAA,EAAc,KAAA,EAAuB,UAAA,EAA2B;AAClE,IAAA,IAAI,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AAClC,IAAA,IAAI,CAAC,OAAA,EAAS;AACZ,MAAA,OAAA,uBAAc,GAAA,EAAI;AAClB,MAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAA,EAAM,OAAO,CAAA;AAAA,IAC/B;AACA,IAAA,MAAM,GAAA,GAAM,UAAA,CAAU,OAAA,CAAQ,UAAU,CAAA;AAIxC,IAAA,IAAI,QAAQ,IAAA,GAAO,CAAA,IAAK,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,CAAA,EAAG;AACzC,MAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,IAAA;AACtB,MAAA,OAAA,CAAQ,KAAA,EAAM;AAAA,IAChB;AACA,IAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,GAAG,GAAG,IAAA,CAAK,KAAA,EAAA;AAC5B,IAAA,OAAA,CAAQ,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,EACxB;AAAA,EAEA,GAAA,CAAI,MAAc,UAAA,EAA8B;AAC9C,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAG,IAAI,UAAA,CAAU,OAAA,CAAQ,UAAU,CAAC,CAAA,IAAK,KAAA;AAAA,EACtE;AAAA,EAEA,MAAA,CAAO,MAAc,UAAA,EAA2B;AAC9C,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AACpC,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,IAAI,QAAQ,MAAA,CAAO,UAAA,CAAU,OAAA,CAAQ,UAAU,CAAC,CAAA,EAAG;AACjD,MAAA,IAAA,CAAK,KAAA,EAAA;AACL,MAAA,IAAI,QAAQ,IAAA,KAAS,CAAA,EAAG,IAAA,CAAK,MAAA,CAAO,OAAO,IAAI,CAAA;AAAA,IACjD;AAAA,EACF;AAAA,EAEA,iBAAiB,IAAA,EAAoB;AACnC,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA;AACpC,IAAA,IAAI,CAAC,OAAA,EAAS;AACd,IAAA,IAAA,CAAK,SAAS,OAAA,CAAQ,IAAA;AACtB,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,IAAI,CAAA;AAAA,EACzB;AAAA,EAEA,UAAU,IAAA,EAAoB;AAC5B,IAAA,IAAA,CAAK,iBAAiB,IAAI,CAAA;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,IAAA,GAAe;AACjB,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,OAAO,KAAA,EAAM;AAClB,IAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,QAAA,EAA8D;AACpE,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,OAAO,CAAA,IAAK,KAAK,MAAA,EAAQ;AACzC,MAAA,KAAA,MAAW,CAAC,OAAA,EAAS,KAAK,CAAA,IAAK,OAAA,EAAS;AACtC,QAAA,QAAA,CAAS,UAAA,CAAU,UAAA,CAAW,IAAA,EAAM,OAAO,GAAG,KAAK,CAAA;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,IAAA,GAAiB;AACf,IAAA,MAAM,SAAmB,EAAC;AAC1B,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,OAAO,CAAA,IAAK,KAAK,MAAA,EAAQ;AACzC,MAAA,KAAA,MAAW,OAAA,IAAW,OAAA,CAAQ,IAAA,EAAK,EAAG;AACpC,QAAA,MAAA,CAAO,IAAA,CAAK,UAAA,CAAU,UAAA,CAAW,IAAA,EAAM,OAAO,CAAC,CAAA;AAAA,MACjD;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AACF,CAAA;;;AC3EA,SAAS,wBAAA,CACP,IAAA,EACA,SAAA,EACA,WAAA,EACA,WACA,GAAA,EACM;AACN,EAAA,MAAM,eAAA,GAAkB,YAAY,SAAS,CAAA;AAC7C,EAAA,MAAM,gBAAA,GAAmB,UAAU,SAAS,CAAA;AAC5C,EAAA,IAAI,CAAC,eAAA,IAAmB,CAAC,gBAAA,EAAkB;AAC3C,EAAA,MAAM,aAAA,GAAgB,IAAI,GAAA,CAAI,eAAA,CAAgB,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACrE,EAAA,KAAA,MAAW,SAAS,gBAAA,EAAkB;AACpC,IAAA,IAAI,aAAA,CAAc,GAAA,CAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACtC,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACP,IAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAOA,QAAA,EAAU,SAAA;AAAA,QACV,MAAA,EAAQ,CAAA,MAAA,EAAS,WAAA,CAAY,IAAI,UAAU,SAAA,CAAU,IAAI,CAAA,aAAA,EAAgB,SAAA,KAAc,iBAAA,GAAoB,QAAA,GAAW,OAAO,CAAA,0BAAA,EAA6B,MAAM,SAAS,CAAA,gDAAA,CAAA;AAAA,QACzK,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,OAC5C,CAAA;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,mBAAA,CAAoB,aAA6B,SAAA,EAAoD;AAC5G,EAAA,MAAM,YAAqC,EAAC;AAE5C,EAAA,wBAAA,CAAyB,yBAAA,EAA2B,iBAAA,EAAmB,WAAA,EAAa,SAAA,EAAW,SAAS,CAAA;AACxG,EAAA,wBAAA,CAAyB,wBAAA,EAA0B,gBAAA,EAAkB,WAAA,EAAa,SAAA,EAAW,SAAS,CAAA;AAItG,EAAA,IAAI,WAAA,CAAY,OAAA,IAAW,SAAA,CAAU,OAAA,EAAS;AAC5C,IAAA,KAAA,MAAW,CAAC,QAAQ,SAAS,CAAA,IAAK,OAAO,OAAA,CAAQ,SAAA,CAAU,OAAO,CAAA,EAAG;AACnE,MAAA,MAAM,iBAAA,GAAoB,WAAA,CAAY,OAAA,CAAQ,MAAM,CAAA;AACpD,MAAA,IAAI,iBAAA,KAAsB,MAAA,IAAa,iBAAA,KAAsB,SAAA,EAAW;AACtE,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,QAAA;AAAA,UACN,QAAA,EAAU,SAAA;AAAA,UACV,MAAA,EAAQ,CAAA,MAAA,EAAS,WAAA,CAAY,IAAI,CAAA,OAAA,EAAU,iBAAiB,CAAA,QAAA,EAAW,SAAA,CAAU,IAAI,CAAA,OAAA,EAAU,SAAS,CAAA,oBAAA,EAAuB,MAAM,CAAA,uJAAA,CAAA;AAAA,UACrI,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAIA,EAAA,IAAI,WAAA,CAAY,YAAA,IAAgB,SAAA,CAAU,YAAA,EAAc;AACtD,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAA,CAAO,IAAA,CAAK,SAAA,CAAU,YAAY,CAAA,EAAG;AACtD,MAAA,MAAM,GAAA,GAAM,KAAK,WAAA,EAAY;AAC7B,MAAA,IAAI,MAAA,CAAO,IAAA,CAAK,WAAA,CAAY,YAAY,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,WAAA,EAAY,KAAM,GAAG,CAAA,EAAG;AAC9E,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,eAAA;AAAA,UACN,QAAA,EAAU,SAAA;AAAA,UACV,MAAA,EAAQ,SAAS,WAAA,CAAY,IAAI,UAAU,SAAA,CAAU,IAAI,qBAAqB,IAAI,CAAA,8DAAA,CAAA;AAAA,UAClF,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAUA,EAAA,IAAI,WAAA,CAAY,eAAA,IAAmB,SAAA,CAAU,eAAA,EAAiB;AAC5D,IAAA,MAAM,eAAA,GAAkB,IAAI,GAAA,CAAI,WAAA,CAAY,eAAA,CAAgB,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAC,CAAA;AAC/E,IAAA,KAAA,MAAW,EAAA,IAAM,UAAU,eAAA,EAAiB;AAC1C,MAAA,IAAI,eAAA,CAAgB,GAAA,CAAI,EAAA,CAAG,KAAK,CAAA,EAAG;AACjC,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,qBAAA;AAAA,UACN,QAAA,EAAU,OAAA;AAAA,UACV,MAAA,EAAQ,SAAS,WAAA,CAAY,IAAI,UAAU,SAAA,CAAU,IAAI,CAAA,8CAAA,EAAiD,EAAA,CAAG,KAAK,CAAA,yMAAA,CAAA;AAAA,UAClH,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAOA,EAAA,MAAM,gBAAgB,WAAA,CAAY,eAAA;AAClC,EAAA,MAAM,iBAAiB,SAAA,CAAU,eAAA;AACjC,EAAA,IAAI,aAAA,EAAe,QAAA,IAAY,cAAA,EAAgB,QAAA,EAAU;AACvD,IAAA,KAAA,MAAW,CAAC,MAAM,SAAS,CAAA,IAAK,OAAO,OAAA,CAAQ,cAAA,CAAe,QAAQ,CAAA,EAAG;AACvE,MAAA,MAAM,iBAAA,GAAoB,aAAA,CAAc,QAAA,CAAS,IAAI,CAAA;AACrD,MAAA,IAAI,iBAAA,KAAsB,MAAA,IAAa,iBAAA,KAAsB,SAAA,EAAW;AACtE,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,cAAA;AAAA,UACN,QAAA,EAAU,OAAA;AAAA,UACV,MAAA,EAAQ,CAAA,MAAA,EAAS,WAAA,CAAY,IAAI,CAAA,OAAA,EAAU,iBAAiB,CAAA,QAAA,EAAW,SAAA,CAAU,IAAI,CAAA,OAAA,EAAU,SAAS,CAAA,+BAAA,EAAkC,IAAI,CAAA,+IAAA,CAAA;AAAA,UAC9I,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACA,EAAA,IAAI,aAAA,EAAe,SAAA,IAAa,cAAA,EAAgB,SAAA,EAAW;AACzD,IAAA,KAAA,MAAW,CAAC,IAAI,SAAS,CAAA,IAAK,OAAO,OAAA,CAAQ,cAAA,CAAe,SAAS,CAAA,EAAG;AACtE,MAAA,MAAM,iBAAA,GAAoB,aAAA,CAAc,SAAA,CAAU,EAAE,CAAA;AACpD,MAAA,IAAI,iBAAA,KAAsB,MAAA,IAAa,iBAAA,KAAsB,SAAA,EAAW;AACtE,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,eAAA;AAAA,UACN,QAAA,EAAU,OAAA;AAAA,UACV,MAAA,EAAQ,CAAA,MAAA,EAAS,WAAA,CAAY,IAAI,CAAA,OAAA,EAAU,iBAAiB,CAAA,QAAA,EAAW,SAAA,CAAU,IAAI,CAAA,OAAA,EAAU,SAAS,CAAA,gCAAA,EAAmC,EAAE,CAAA,4BAAA,CAAA;AAAA,UAC7I,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAKA,EAAA,IAAI,WAAA,CAAY,cAAA,IAAkB,SAAA,CAAU,cAAA,EAAgB;AAC1D,IAAA,MAAM,kBAAA,GAAqB,IAAI,GAAA,CAAI,WAAA,CAAY,cAAA,CAAe,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,CAAC,CAAA;AACrF,IAAA,KAAA,MAAW,QAAA,IAAY,UAAU,cAAA,EAAgB;AAC/C,MAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AAC9C,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,wBAAA;AAAA,UACN,QAAA,EAAU,OAAA;AAAA,UACV,MAAA,EAAQ,SAAS,WAAA,CAAY,IAAI,UAAU,SAAA,CAAU,IAAI,CAAA,kDAAA,EAAqD,QAAA,CAAS,SAAS,CAAA,2HAAA,CAAA;AAAA,UAChI,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAOA,EAAA,IAAI,WAAA,CAAY,eAAA,IAAmB,SAAA,CAAU,eAAA,EAAiB;AAC5D,IAAA,KAAA,MAAW,CAAC,WAAW,QAAQ,CAAA,IAAK,OAAO,OAAA,CAAQ,SAAA,CAAU,eAAe,CAAA,EAAG;AAC7E,MAAA,MAAM,gBAAA,GAAmB,WAAA,CAAY,eAAA,CAAgB,SAAS,CAAA;AAC9D,MAAA,IAAI,gBAAA,KAAqB,MAAA,IAAa,gBAAA,KAAqB,QAAA,EAAU;AACnE,QAAA,SAAA,CAAU,IAAA,CAAK;AAAA,UACb,IAAA,EAAM,eAAA;AAAA,UACN,QAAA,EAAU,MAAA;AAAA,UACV,MAAA,EAAQ,CAAA,MAAA,EAAS,WAAA,CAAY,IAAI,CAAA,OAAA,EAAU,gBAAgB,CAAA,QAAA,EAAW,SAAA,CAAU,IAAI,CAAA,OAAA,EAAU,QAAQ,CAAA,gDAAA,EAAmD,SAAS,CAAA,wDAAA,CAAA;AAAA,UAClK,QAAA,EAAU,CAAC,WAAA,CAAY,IAAA,EAAM,UAAU,IAAI;AAAA,SAC5C,CAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,SAAA;AACT;AAgBO,SAAS,yBAAA,CACd,WACA,QAAA,EACqB;AACrB,EAAA,MAAM,YAAqC,EAAC;AAC5C,EAAA,KAAA,MAAW,eAAe,QAAA,EAAU;AAClC,IAAA,IAAI,WAAA,KAAgB,SAAA,IAAa,WAAA,CAAY,IAAA,KAAS,UAAU,IAAA,EAAM;AACtE,IAAA,SAAA,CAAU,IAAA,CAAK,GAAG,mBAAA,CAAoB,WAAA,EAAa,SAAS,CAAC,CAAA;AAAA,EAC/D;AACA,EAAA,OAAO;AAAA,IACL,UAAA,EAAY,CAAC,SAAA,CAAU,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,aAAa,OAAO,CAAA;AAAA,IACzD;AAAA,GACF;AACF;;;ACtQA,IAAA,aAAA,GAA8C,OAAA,CAAA,eAAA,EAAA,EAAA,CAAA,CAAA;AAiDvC,SAAS,+BAAA,CACd,GAAA,EACA,aAAA,GAAwB,cAAA,EACE;AAC1B,EAAA,IAAI,CAAC,GAAA,CAAI,aAAA,EAAe,OAAO,EAAE,YAAY,IAAA,EAAK;AAElD,EAAA,IAAA,IAAI,aAAA,CAAA,UAAA,EAAW,GAAA,CAAI,aAAa,CAAA,KAAM,IAAA,EAAM;AAC1C,IAAA,OAAO,EAAE,YAAY,KAAA,EAAO,MAAA,EAAQ,iBAAiB,aAAA,EAAe,GAAA,CAAI,eAAe,aAAA,EAAc;AAAA,EACvG;AAcA,EAAA,MAAM,iBAAA,GAAA,IAAoB,aAAA,CAAA,MAAA,EAAO,aAAa,CAAA,EAAG,OAAA,IAAW,aAAA;AAE5D,EAAA,IAAI,CAAA,IAAC,aAAA,CAAA,SAAA,EAAU,iBAAA,EAAmB,GAAA,CAAI,aAAa,CAAA,EAAG;AACpD,IAAA,OAAO,EAAE,YAAY,KAAA,EAAO,MAAA,EAAQ,uBAAuB,aAAA,EAAe,GAAA,CAAI,eAAe,aAAA,EAAc;AAAA,EAC7G;AAEA,EAAA,OAAO,EAAE,YAAY,IAAA,EAAK;AAC5B;AASO,SAAS,6BAAA,CACd,GAAA,EACA,aAAA,GAAwB,cAAA,EAClB;AACN,EAAA,MAAM,MAAA,GAAS,+BAAA,CAAgC,GAAA,EAAK,aAAa,CAAA;AACjE,EAAA,IAAI,OAAO,UAAA,EAAY;AAEvB,EAAA,IAAI,MAAA,CAAO,WAAW,eAAA,EAAiB;AACrC,IAAA,MAAM,aAAa,MAAA,CAAO;AAAA,MACxB,IAAA,EAAM,sCAAA;AAAA,MACN,SAAS,CAAA,SAAA,EAAY,GAAA,CAAI,IAAI,CAAA,4CAAA,EAA+C,OAAO,aAAa,CAAA,8BAAA,CAAA;AAAA,MAChG,QAAA,EAAU,CAAA,6DAAA,CAAA;AAAA,MACV,KAAA,EAAO,CAAA,CAAA,EAAI,MAAA,CAAO,aAAa,CAAA,CAAA,CAAA;AAAA,MAC/B,UAAA,EAAY,CAAA,gCAAA,EAAmC,GAAA,CAAI,IAAI,CAAA,sGAAA,CAAA;AAAA,MACvD,SAAS,EAAE,WAAA,EAAa,IAAI,IAAA,EAAM,aAAA,EAAe,OAAO,aAAA;AAAc,KACvE,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,aAAa,MAAA,CAAO;AAAA,IACxB,IAAA,EAAM,iCAAA;AAAA,IACN,OAAA,EAAS,YAAY,GAAA,CAAI,IAAI,6BAA6B,MAAA,CAAO,aAAa,CAAA,yDAAA,EAA4D,MAAA,CAAO,aAAa,CAAA,EAAA,CAAA;AAAA,IAC9J,QAAA,EAAU,CAAA,8BAAA,EAAiC,MAAA,CAAO,aAAa,CAAA,CAAA,CAAA;AAAA,IAC/D,KAAA,EAAO,CAAA,gBAAA,EAAmB,MAAA,CAAO,aAAa,CAAA,CAAA,CAAA;AAAA,IAC9C,UAAA,EAAY,WAAW,GAAA,CAAI,IAAI,6CAA6C,MAAA,CAAO,aAAa,CAAA,+CAAA,EAAkD,MAAA,CAAO,aAAa,CAAA,EAAA,CAAA;AAAA,IACtK,OAAA,EAAS,EAAE,WAAA,EAAa,GAAA,CAAI,IAAA,EAAM,eAAe,MAAA,CAAO,aAAA,EAAe,aAAA,EAAe,MAAA,CAAO,aAAA;AAAc,GAC5G,CAAA;AACH;;;ACGA,IAAO,yBAAS,MAAM;AACrB,EAAA,MAAM,IAAI,MAAM,sGAAsG,CAAA;AACvH,CAAA,CAAA;AAIA,IAAI,aAAA,GAAyC,IAAA;AAC7C,SAAS,gBAAA,GAAqC;AAC7C,EAAA,IAAI,CAAC,aAAA,EAAe;AACnB,IAAA,aAAA,GAAgB,IAAI,gBAAA,CAAiB,IAAA,EAAM,KAAK,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,aAAA;AACR;AAEA,IAAI,SAAA,GAAgD,IAAA;AACpD,SAAS,YAAA,GAA4C;AACpD,EAAA,IAAI,CAAC,SAAA,EAAW;AACf,IAAA,SAAA,GAAY,QAAA,CAAS,gBAAA,EAAkB,GAAA,EAAK,GAAK,CAAA;AAAA,EAClD;AACA,EAAA,OAAO,SAAA;AACR;AAUA,SAAS,WAAW,IAAA,EAAkC;AACrD,EAAA,MAAM,IAAA,GAAmG;AAAA,IACxG,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,YAAY,IAAA,CAAK,UAAA;AAAA,IACjB,qBAAqB,IAAA,CAAK,QAAA;AAAA,IAC1B,SAAS,EAAC;AAAA,IACV,OAAO,EAAC;AAAA,IACR,QAAQ,EAAC;AAAA,IACT,aAAA,EAAe,KAAA;AAAA,IACf,KAAA,EAAO;AAAA,GACR;AAEA,EAAA,IAAI;AACH,IAAA,MAAM,MAAM,gBAAA,EAAiB;AAC7B,IAAA,MAAM,EAAE,SAAS,KAAA,EAAO,MAAA,KAAW,GAAA,CAAI,iBAAA,CAAkB,KAAK,UAAU,CAAA;AACxE,IAAA,MAAM,aAAA,GAAgB,OAAO,MAAA,GAAS,CAAA;AAEtC,IAAA,MAAM,UAAU,OAAA,CAAQ,OAAA;AACxB,IAAA,MAAM,UAAU,OAAA,CAAQ,OAAA;AAYxB,IAAA,MAAM,aAAA,GAAiB,QAAQ,MAAA,CAAuB,KAAA;AAAA,MACrD,OAAA,CAAQ,UAAA;AAAA,MACR,OAAA,CAAQ,aAAa,OAAA,CAAQ;AAAA,KAC9B;AACA,IAAA,MAAM,aAAA,GAAiB,QAAQ,MAAA,CAAuB,KAAA;AAAA,MACrD,OAAA,CAAQ,UAAA;AAAA,MACR,OAAA,CAAQ,aAAa,OAAA,CAAQ;AAAA,KAC9B;AAEA,IAAA,OAAO;AAAA,MACN,GAAG,IAAA;AAAA,MACH,aAAA;AAAA,MACA,aAAA;AAAA,MACA,eAAe,OAAA,CAAQ,MAAA;AAAA,MACvB,eAAe,OAAA,CAAQ,MAAA;AAAA,MACvB,OAAA,EAAS,CAAC,GAAG,OAAA,CAAQ,OAAO,CAAA;AAAA,MAC5B,KAAA;AAAA,MACA,MAAA;AAAA,MACA;AAAA,KACD;AAAA,EACD,SAAS,CAAA,EAAG;AACX,IAAA,OAAO;AAAA,MACN,GAAG,IAAA;AAAA,MACH,aAAA,EAAe,IAAI,WAAA,CAAY,CAAC,CAAA;AAAA,MAChC,aAAA,EAAe,IAAI,WAAA,CAAY,CAAC,CAAA;AAAA,MAChC,aAAA,EAAe,CAAA;AAAA,MACf,aAAA,EAAe,CAAA;AAAA,MACf,OAAO,CAAA,YAAa,KAAA,GAAQ,CAAA,CAAE,OAAA,GAAU,OAAO,CAAC;AAAA,KACjD;AAAA,EACD;AACD;AAEA,SAAS,mBAAmB,GAAA,EAA4B;AACvD,EAAA,MAAM,UAA2B,EAAC;AAClC,EAAA,MAAM,eAA8B,EAAC;AAErC,EAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,KAAA,EAAO;AAC7B,IAAA,MAAM,MAAA,GAAS,WAAW,IAAI,CAAA;AAC9B,IAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AACnB,IAAA,IAAI,OAAO,aAAA,CAAc,UAAA,GAAa,GAAG,YAAA,CAAa,IAAA,CAAK,OAAO,aAAa,CAAA;AAC/E,IAAA,IAAI,OAAO,aAAA,CAAc,UAAA,GAAa,GAAG,YAAA,CAAa,IAAA,CAAK,OAAO,aAAa,CAAA;AAAA,EAChF;AAEA,EAAC,IAAA,CAA2B,WAAA;AAAA,IAC3B,EAAE,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,IAAA,EAAM,kBAAkB,OAAA,EAAQ;AAAA,IAC9C;AAAA,GACD;AACD;AAUA,SAAS,WAAW,IAAA,EAAkC;AACrD,EAAA,MAAM,MAAM,YAAA,EAAa;AACzB,EAAA,GAAA,CAAI,KAAA,EAAM;AAEV,EAAA,MAAM,UAAU,IAAI,UAAA,CAAW,KAAK,aAAA,EAAe,CAAA,EAAG,KAAK,aAAa,CAAA;AACxE,EAAA,MAAM,UAAU,IAAI,YAAA,CAAa,KAAK,aAAA,EAAe,CAAA,EAAG,KAAK,aAAa,CAAA;AAC1E,EAAA,MAAM,WAAqB,EAAE,OAAA,EAAS,OAAA,EAAS,OAAA,EAAS,KAAK,OAAA,EAAQ;AAErE,EAAA,IAAI;AACH,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,QAAA,EAAU,GAAG,CAAA;AAE5C,IAAA,IAAI,MAAA,CAAO,SAAS,SAAA,EAAW;AAC9B,MAAA,OAAO;AAAA,QACN,YAAY,IAAA,CAAK,UAAA;AAAA,QACjB,SAAA,EAAA,EAAA;AAAA,QACA,KAAA,EAAO,CAAA;AAAA,QACP,SAAA,EAAW,IAAA;AAAA,QACX,UAAU,MAAA,CAAO;AAAA,OAClB;AAAA,IACD;AAEA,IAAA,IAAI,MAAA,CAAO,SAAS,OAAA,EAAS;AAC5B,MAAA,OAAO;AAAA,QACN,YAAY,IAAA,CAAK,UAAA;AAAA,QACjB,SAAA,EAAA,EAAA;AAAA,QACA,KAAA,EAAO,CAAA;AAAA,QACP,SAAA,EAAW,KAAA;AAAA,QACX,IAAA,EAAM,OAAO,KAAA,CAAM;AAAA,OACpB;AAAA,IACD;AAEA,IAAA,MAAM,MAAM,MAAA,CAAO,KAAA;AACnB,IAAA,OAAO;AAAA,MACN,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,WAAW,GAAA,CAAI,IAAA;AAAA,MACf,KAAA,EAAO,OAAO,GAAA,CAAI,KAAA,KAAU,WACzB,GAAA,CAAI,KAAA,GACJ,OAAO,GAAA,CAAI,KAAA,KAAU,QAAA,GACpB,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,GAChB,CAAA;AAAA,MACJ,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,SAAA,EAAW;AAAA,KACZ;AAAA,EACD,CAAA,CAAA,MAAQ;AAGP,IAAA,OAAO;AAAA,MACN,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,SAAA,EAAA,EAAA;AAAA,MACA,KAAA,EAAO,CAAA;AAAA,MACP,SAAA,EAAW,KAAA;AAAA,MACX,IAAA,EAAM;AAAA,KACP;AAAA,EACD;AACD;AAEA,SAAS,mBAAmB,GAAA,EAA4B;AACvD,EAAA,MAAM,UAA2B,EAAC;AAClC,EAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,KAAA,EAAO;AAC7B,IAAA,OAAA,CAAQ,IAAA,CAAK,UAAA,CAAW,IAAI,CAAC,CAAA;AAAA,EAC9B;AAGA,EAAC,KAA2B,WAAA,CAAY;AAAA,IACvC,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,IAAA,EAAM,gBAAA;AAAA,IACN;AAAA,GACA,CAAA;AACF;AAkBA,IAAM,aAAA,GAAgB,OAAO,IAAA,KAAS,WAAA,IAAe,OAAO,MAAA,KAAW,WAAA;AAEvE,IAAM,aAAA,GAAgB,CAAC,KAAA,KAAwB;AAO9C,EAAA,IAAI,KAAA,CAAM,UAAU,IAAA,CAAK,QAAA,IAAY,MAAM,MAAA,KAAW,IAAA,CAAK,SAAS,MAAA,EAAQ;AAE5E,EAAA,MAAM,MAAM,KAAA,CAAM,IAAA;AAElB,EAAA,QAAQ,IAAI,IAAA;AAAM,IACjB,KAAK,eAAA;AACJ,MAAA,kBAAA,CAAmB,GAAG,CAAA;AACtB,MAAA;AAAA,IAED,KAAK,eAAA;AACJ,MAAA,kBAAA,CAAmB,GAAG,CAAA;AACtB,MAAA;AAAA,IAED,KAAK,WAAA,EAAa;AAKjB,MAAA,IAAI,aAAA,EAAe;AAClB,QAAA,aAAA,CAAc,KAAA,EAAM;AACpB,QAAA,aAAA,GAAgB,IAAA;AAAA,MACjB;AACA,MAAA,IAAI,SAAA,EAAW;AACd,QAAA,SAAA,CAAU,KAAA,EAAM;AAChB,QAAA,SAAA,GAAY,IAAA;AAAA,MACb;AACA,MAAC,KAA2B,WAAA,CAAY;AAAA,QACvC,IAAI,GAAA,CAAI,EAAA;AAAA,QACR,IAAA,EAAM,gBAAA;AAAA,QACN,SAAS;AAAC,OACV,CAAA;AACD,MAAA;AAAA,IACD;AAAA,IAEA,SAAS;AACR,MAAC,KAA2B,WAAA,CAAY;AAAA,QACvC,EAAA,EAAI,EAAA;AAAA,QACJ,IAAA,EAAM,gBAAA;AAAA,QACN,SAAS,EAAC;AAAA,QACV,KAAA,EAAO,CAAA,sBAAA,EAA0B,GAAA,CAA0B,IAAI,CAAA;AAAA,OAC/D,CAAA;AAAA,IACF;AAAA;AAEF,CAAA;AAKA,IAAI,aAAA,EAAe;AAClB,EAAA,IAAA,CAAK,SAAA,GAAY,aAAA;AAClB;;;ACvVA,IAAM,uBAAA,GAA0B,GAAA;AAwCzB,IAAM,wBAAA,GAA2B,EAAA;AAYjC,IAAM,gBAAN,MAAoB;AAAA,EAQ1B,YAAY,QAAA,EAAmB;AAP/B,IAAA,IAAA,CAAQ,UAAoB,EAAC;AAC7B,IAAA,IAAA,CAAQ,UAAA,GAAa,CAAA;AACrB,IAAA,IAAA,CAAQ,MAAA,GAAS,CAAA;AACjB,IAAA,IAAA,CAAQ,cAAA,uBAAqB,GAAA,EAA0B;AACvD,IAAA,IAAA,CAAQ,UAAA,GAAa,KAAA;AAiBrB;AAAA;AAAA,IAAA,IAAA,CAAQ,UAAA,GAA6B,IAAA;AAbpC,IAAA,IAAA,CAAK,WAAW,IAAA,CAAK,GAAA,CAAI,YAAY,IAAA,CAAK,eAAA,IAAmB,CAAC,CAAA;AAAA,EAC/D;AAAA,EAEQ,eAAA,GAA0B;AACjC,IAAA,IAAI,OAAO,SAAA,KAAc,WAAA,IAAe,SAAA,CAAU,mBAAA,EAAqB;AACtE,MAAA,OAAO,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,mBAAA,EAAqB,CAAC,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,CAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,WAAA,GAAuB;AACtB,IAAA,IAAI,IAAA,CAAK,YAAY,OAAO,KAAA;AAC5B,IAAA,IAAI,IAAA,CAAK,UAAA,KAAe,IAAA,EAAM,OAAO,IAAA,CAAK,UAAA;AAC1C,IAAA,IAAI,OAAO,WAAW,WAAA,EAAa;AAClC,MAAA,IAAA,CAAK,UAAA,GAAa,KAAA;AAClB,MAAA,OAAO,KAAA;AAAA,IACR;AACA,IAAA,IAAI;AAEH,MAAA,MAAM,IAAI,qBAAA,EAAsB;AAChC,MAAA,CAAA,CAAE,SAAA,EAAU;AACZ,MAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAClB,MAAA,OAAO,IAAA;AAAA,IACR,CAAA,CAAA,MAAQ;AACP,MAAA,IAAA,CAAK,UAAA,GAAa,KAAA;AAClB,MAAA,OAAO,KAAA;AAAA,IACR;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,YAAA,CACC,oBACA,OAAA,EACuC;AACvC,IAAA,IAAI,CAAC,IAAA,CAAK,WAAA,EAAY,EAAG,OAAO,MAAA;AAChC,IAAA,IAAI,mBAAmB,MAAA,KAAW,CAAA,SAAU,OAAA,CAAQ,OAAA,CAAQ,EAAE,CAAA;AAG9D,IAAA,IAAA,CAAK,aAAA,EAAc;AAInB,IAAA,MAAM,QAAuB,EAAC;AAC9B,IAAA,KAAA,MAAW,cAAc,kBAAA,EAAoB;AAC5C,MAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,GAAA,CAAI,UAAU,CAAA;AACpC,MAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,QAAA,CAAS,OAAA,CAAQ,WAAW,CAAA,EAAG;AAEnD,MAAA,MAAM,OAAA,GAAU,MAAM,QAAA,CAAS,OAAA;AAC/B,MAAA,MAAM,OAAA,GAAU,MAAM,QAAA,CAAS,OAAA;AAK/B,MAAA,MAAM,YAAA,GAAe,QAAQ,MAAA,CAAO,KAAA;AAAA,QACnC,OAAA,CAAQ,UAAA;AAAA,QACR,OAAA,CAAQ,aAAa,OAAA,CAAQ;AAAA,OAC9B;AACA,MAAA,MAAM,YAAA,GAAe,QAAQ,MAAA,CAAO,KAAA;AAAA,QACnC,OAAA,CAAQ,UAAA;AAAA,QACR,OAAA,CAAQ,aAAa,OAAA,CAAQ;AAAA,OAC9B;AAEA,MAAA,KAAA,CAAM,IAAA,CAAK;AAAA,QACV,UAAA;AAAA,QACA,aAAA,EAAe,YAAA;AAAA,QACf,aAAA,EAAe,YAAA;AAAA,QACf,eAAe,OAAA,CAAQ,MAAA;AAAA,QACvB,eAAe,OAAA,CAAQ,MAAA;AAAA,QACvB,OAAA,EAAS,CAAC,GAAG,KAAA,CAAM,SAAS,OAAO;AAAA,OACnC,CAAA;AAAA,IACF;AAEA,IAAA,IAAI,MAAM,MAAA,KAAW,CAAA,SAAU,OAAA,CAAQ,OAAA,CAAQ,EAAE,CAAA;AAGjD,IAAA,MAAM,eAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACzB,MAAA,IAAI,KAAK,aAAA,CAAc,UAAA,GAAa,GAAG,YAAA,CAAa,IAAA,CAAK,KAAK,aAAa,CAAA;AAC3E,MAAA,IAAI,KAAK,aAAA,CAAc,UAAA,GAAa,GAAG,YAAA,CAAa,IAAA,CAAK,KAAK,aAAa,CAAA;AAAA,IAC5E;AAEA,IAAA,MAAM,UAAU,IAAA,CAAK,MAAA,EAAA;AACrB,IAAA,MAAM,MAAA,GAAS,KAAK,aAAA,EAAc;AAElC,IAAA,OAAO,IAAI,OAAA,CAAyB,CAAC,OAAA,KAAY;AAGhD,MAAA,MAAM,SAAA,GAAY,WAAW,MAAM;AAClC,QAAA,IAAA,CAAK,cAAA,CAAe,OAAO,OAAO,CAAA;AAClC,QAAA,OAAA,CAAQ,EAAE,CAAA;AAAA,MACX,GAAG,uBAAuB,CAAA;AAE1B,MAAA,IAAA,CAAK,cAAA,CAAe,IAAI,OAAA,EAAS;AAAA,QAChC,EAAA,EAAI,OAAA;AAAA,QACJ,WAAA,EAAa,kBAAA;AAAA,QACb,OAAA,EAAS,CAAC,OAAA,KAA6B;AACtC,UAAA,YAAA,CAAa,SAAS,CAAA;AACtB,UAAA,OAAA,CAAQ,OAAO,CAAA;AAAA,QAChB;AAAA,OACA,CAAA;AAED,MAAA,MAAA,CAAO,WAAA;AAAA,QACN,EAAE,IAAA,EAAM,eAAA,EAAiB,EAAA,EAAI,SAAS,KAAA,EAAM;AAAA,QAC5C;AAAA,OACD;AAAA,IACD,CAAC,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,GAAc;AAEb,IAAA,KAAA,MAAW,GAAG,KAAK,CAAA,IAAK,KAAK,cAAA,EAAgB;AAC5C,MAAA,KAAA,CAAM,OAAA,CAAQ,EAAE,CAAA;AAAA,IACjB;AACA,IAAA,IAAA,CAAK,eAAe,KAAA,EAAM;AAG1B,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,OAAA,EAAS;AAC7B,MAAA,CAAA,CAAE,SAAA,EAAU;AAAA,IACb;AACA,IAAA,IAAA,CAAK,UAAU,EAAC;AAChB,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAA,GAAgB;AACf,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAClB,IAAA,IAAA,CAAK,KAAA,EAAM;AAAA,EACZ;AAAA;AAAA,EAIQ,aAAA,GAAsB;AAC7B,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,CAAA,EAAG;AAE7B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,UAAU,CAAA,EAAA,EAAK;AACvC,MAAA,MAAM,SAAS,qBAAA,EAAsB;AACrC,MAAA,MAAA,CAAO,SAAA,GAAY,CAAC,KAAA,KAAwB;AAC3C,QAAA,IAAA,CAAK,mBAAA,CAAoB,MAAM,IAAI,CAAA;AAAA,MACpC,CAAA;AACA,MAAA,MAAA,CAAO,OAAA,GAAU,CAAC,GAAA,KAAoB;AACrC,QAAA,OAAA,CAAQ,KAAA,CAAM,CAAA,uBAAA,EAA0B,CAAC,CAAA,OAAA,CAAA,EAAW,IAAI,OAAO,CAAA;AAI/D,QAAA,KAAA,MAAW,CAAC,EAAA,EAAI,KAAK,CAAA,IAAK,KAAK,cAAA,EAAgB;AAC9C,UAAA,KAAA,CAAM,OAAA,CAAQ,EAAE,CAAA;AAChB,UAAA,IAAA,CAAK,cAAA,CAAe,OAAO,EAAE,CAAA;AAAA,QAC9B;AAAA,MACD,CAAA;AACA,MAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,MAAM,CAAA;AAAA,IACzB;AAAA,EACD;AAAA,EAEQ,aAAA,GAAwB;AAC/B,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,UAAU,CAAA;AACtC,IAAA,IAAA,CAAK,UAAA,GAAA,CAAc,IAAA,CAAK,UAAA,GAAa,CAAA,IAAK,KAAK,OAAA,CAAQ,MAAA;AACvD,IAAA,OAAO,CAAA;AAAA,EACR;AAAA,EAEQ,oBAAoB,IAAA,EAAoE;AAC/F,IAAA,IAAI,IAAA,CAAK,SAAS,gBAAA,EAAkB;AAEpC,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,KAAK,EAAE,CAAA;AAC7C,IAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,IAAA,IAAA,CAAK,cAAA,CAAe,MAAA,CAAO,IAAA,CAAK,EAAE,CAAA;AAClC,IAAA,KAAA,CAAM,OAAA,CAAQ,KAAK,OAAO,CAAA;AAAA,EAC3B;AACD,CAAA;AAUO,SAAS,iBAAiB,MAAA,EAA8B;AAC9D,EAAA,QAAQ,OAAO,SAAA;AAAW,IACzB,KAAA,CAAA;AACC,MAAA,OAAO,WAAA,CAAY,OAAO,KAAK,CAAA;AAAA,IAChC,KAAA,CAAA;AACC,MAAA,OAAO,QAAA,CAAS,OAAO,KAAK,CAAA;AAAA,IAC7B,KAAA,CAAA;AACC,MAAA,OAAO,WAAA,CAAY,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACxC,KAAA,CAAA;AACC,MAAA,OAAO,WAAA,CAAY,MAAA,CAAO,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACxC,KAAA,CAAA;AACC,MAAA,OAAO,aAAA,CAAc,OAAO,KAAK,CAAA;AAAA,IAClC,KAAA,CAAA;AACC,MAAA,OAAO,eAAA,CAAgB,OAAO,KAAK,CAAA;AAAA,IACpC,KAAA,CAAA;AACC,MAAA,OAAO,QAAA,CAAS,MAAA,CAAO,KAAA,EAAO,MAAA,CAAO,QAAQ,EAAE,CAAA;AAAA,IAChD,KAAA,CAAA;AAOC,MAAA,OAAO,WAAA,CAAY,OAAO,KAAK,CAAA;AAAA,IAChC,KAAA,EAAA;AACC,MAAA,OAAO,SAAA,CAAU,MAAA,CAAO,KAAA,KAAU,CAAC,CAAA;AAAA,IACpC,KAAA,EAAA;AACC,MAAA,OAAO,YAAA,CAAa,MAAA,CAAO,QAAA,IAAY,EAAE,CAAA;AAAA,IAC1C,KAAA,EAAA;AACC,MAAA,OAAO,UAAA,CAAW,wBAAA,EAA0B,MAAA,CAAO,IAAA,IAAQ,sBAAsB,CAAA;AAAA,IAClF;AACC,MAAA,OAAO,WAAA,CAAY,OAAO,KAAK,CAAA;AAAA;AAElC;;;AC9PO,IAAM,uBAAA,GAAN,MAAM,uBAAA,CAAuB;AAAA,EAoGnC,YACC,GAAA,EACA,SAAA,EACA,EAAA,EACA,aAAA,GAAwB,wBAAuB,uBAAA,EAC9C;AAxGF,IAAA,IAAA,CAAQ,UAAwB,EAAC;AACjC,IAAA,IAAA,CAAQ,SAAA,GAAY,KAAA;AAEpB;AAAA,IAAA,IAAA,CAAQ,OAAA,GAAU,KAAA;AAWlB;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,aAAA,GAAsC,IAAA;AAO9C;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,0BAAA,GAA6B,CAAA;AAqBrC;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,iBAAA,GAAkF,IAAA;AAO1F;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAO,aAAA,GAA+C,IAAA;AAkBtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAA,YAAA,GAAoE,IAAA;AASpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,sBAAA,GAAyB,KAAA;AA6BhC,IAAA,IAAA,CAAK,GAAA,GAAM,GAAA;AACX,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;AACjB,IAAA,IAAA,CAAK,EAAA,GAAK,EAAA;AACV,IAAA,IAAA,CAAK,aAAA,GAAgB,aAAA;AAErB,IAAA,IAAA,CAAK,YAAA,GAAe,KAAK,iBAAA,EAAkB;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA1BQ,aAAA,GAAsB;AAC7B,IAAA,IAAI,IAAA,CAAK,YAAA,IAAgB,IAAA,CAAK,sBAAA,EAAwB;AACtD,IAAA,IAAA,CAAK,sBAAA,GAAyB,IAAA;AAC9B,IAAA,OAAA,CAAQ,IAAA;AAAA,MACP;AAAA,KAID;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBQ,iBAAA,GAA0D;AACjE,IAAA,OAAO,IAAI,cAAA,CAAqC;AAAA,MAC/C,KAAA,EAAO,CAAC,UAAA,KAAe;AACtB,QAAA,IAAA,CAAK,iBAAA,GAAoB,UAAA;AAAA,MAC1B,CAAA;AAAA,MACA,QAAQ,MAAM;AACb,QAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AAAA,MAC1B;AAAA,KACD,EAAG,IAAI,oBAAA,CAAqB,EAAE,eAAe,IAAA,CAAK,aAAA,EAAe,CAAC,CAAA;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAI,KAAA,EAAyB;AAE5B,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AAKf,IAAA,KAAA,MAAW,QAAA,IAAY,KAAK,OAAA,EAAS;AACpC,MAAA,IAAI,SAAS,SAAA,KAAc,KAAA,CAAM,aAAa,QAAA,CAAS,QAAA,KAAa,MAAM,QAAA,EAAU;AACnF,QAAA;AAAA,MACD;AAAA,IACD;AAEA,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAK,KAAK,CAAA;AAEvB,IAAA,IAAI,CAAC,KAAK,SAAA,EAAW;AACpB,MAAA,IAAA,CAAK,SAAA,GAAY,IAAA;AAYjB,MAAA,cAAA,CAAe,MAAM;AACpB,QAAA,IAAI;AACH,UAAA,IAAA,CAAK,KAAA,EAAM;AAAA,QACZ,SAAS,CAAA,EAAG;AACX,UAAA,MAAM,WAAA,GAAc,sBAAsB,CAAC,CAAA;AAC3C,UAAA,OAAA,CAAQ,KAAA,CAAM,CAAA,qGAAA,EAAmG,WAAA,CAAY,MAAA,EAAQ,CAAA,CAAE,CAAA;AAAA,QACxI;AAAA,MACD,CAAC,CAAA;AAAA,IACF;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,cAAA,GAAuD;AACtD,IAAA,OAAO,IAAA,CAAK,YAAA;AAAA,EACb;AAAA;AAAA,EAGA,IAAI,YAAA,GAAuB;AAC1B,IAAA,OAAO,KAAK,OAAA,CAAQ,MAAA;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,UAAA,GAAqB;AACxB,IAAA,MAAM,KAAA,uBAAY,GAAA,EAAY;AAC9B,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AACjC,MAAA,KAAA,CAAM,IAAI,CAAA,EAAG,KAAA,CAAM,SAAS,CAAA,CAAA,EAAI,KAAA,CAAM,QAAQ,CAAA,CAAE,CAAA;AAAA,IACjD;AACA,IAAA,OAAO,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,OAAA,CAAQ,MAAA,GAAS,MAAM,IAAI,CAAA;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,aAAA,GAAwB;AAC3B,IAAA,OAAO,IAAA,CAAK,YAAA,CAAa,MAAA,GAAS,CAAA,GAAI,CAAA;AAAA,EACvC;AAAA;AAAA,EAGA,IAAI,kBAAA,GAA6B;AAChC,IAAA,OAAO,IAAA,CAAK,0BAAA;AAAA,EACb;AAAA;AAAA,EAGA,QAAA,GAAiB;AAChB,IAAA,IAAA,CAAK,UAAU,EAAC;AAChB,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA;AACjB,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAIf,IAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AACrB,IAAA,IAAA,CAAK,YAAA,GAAe,IAAA;AAMpB,IAAA,IAAI;AACH,MAAA,IAAA,CAAK,mBAAmB,KAAA,EAAM;AAAA,IAC/B,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AACzB,IAAA,IAAA,CAAK,YAAA,GAAe,KAAK,iBAAA,EAAkB;AAE3C,IAAA,IAAI,KAAK,aAAA,EAAe;AACvB,MAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AACzB,MAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AAAA,IACtB;AAEA,IAAA,IAAA,CAAK,0BAAA,GAA6B,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,KAAA,GAAc;AACrB,IAAA,IAAA,CAAK,SAAA,GAAY,KAAA;AACjB,IAAA,IAAI,KAAK,OAAA,EAAS;AAClB,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AAG/B,IAAA,MAAM,QAAQ,IAAA,CAAK,OAAA;AACnB,IAAA,IAAA,CAAK,UAAU,EAAC;AAGhB,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAwB;AAC5C,IAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AAC1B,MAAA,MAAM,eAAe,CAAA,EAAG,KAAA,CAAM,SAAS,CAAA,CAAA,EAAI,MAAM,QAAQ,CAAA,CAAA;AACzD,MAAA,OAAA,CAAQ,GAAA,CAAI,cAAc,KAAK,CAAA;AAAA,IAChC;AAKA,IAAA,MAAM,eAA6B,EAAC;AACpC,IAAA,MAAM,YAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,KAAA,IAAS,OAAA,CAAQ,MAAA,EAAO,EAAG;AACrC,MAAA,IAAI,MAAM,OAAA,EAAS;AAClB,QAAA,YAAA,CAAa,KAAK,KAAK,CAAA;AAAA,MACxB,CAAA,MAAO;AACN,QAAA,SAAA,CAAU,KAAK,KAAK,CAAA;AAAA,MACrB;AAAA,IACD;AAGA,IAAA,KAAA,MAAW,SAAS,YAAA,EAAc;AACjC,MAAA,IAAI,KAAA,CAAM,OAAO,OAAA,EAAS;AAC1B,MAAA,IAAA,CAAK,eAAA,CAAgB;AAAA,QACpB,IAAA,EAAM,OAAA;AAAA,QACN,UAAU,KAAA,CAAM,QAAA;AAAA,QAChB,WAAW,KAAA,CAAM,SAAA;AAAA,QACjB,KAAA,EAAO,KAAA,CAAM,KAAA,IAAS,IAAI,MAAM,gCAAgC;AAAA,OAChE,CAAA;AAAA,IACF;AAKA,IAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AACpC,IAAA,MAAM,eAAyB,EAAC;AAEhC,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,SAAA,EAAW,GAAG,YAAY,CAAA;AACjD,IAAA,KAAA,MAAW,SAAS,UAAA,EAAY;AAC/B,MAAA,IAAI,KAAA,CAAM,OAAO,OAAA,EAAS;AAC1B,MAAA,YAAA,CAAa,IAAA,CAAK,MAAM,QAAQ,CAAA;AAEhC,MAAA,MAAM,QAAA,GAAW,KAAK,GAAA,CAAI,4BAAA;AAAA,QACzB,KAAA,CAAM,SAAA;AAAA,QACN,CAAC,MAAM,QAAQ;AAAA,OAChB;AACA,MAAA,KAAA,MAAW,QAAQ,QAAA,EAAU;AAC5B,QAAA,WAAA,CAAY,IAAI,IAAI,CAAA;AAAA,MACrB;AAAA,IACD;AAEA,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAG3B,MAAA,IAAA,CAAK,eAAA,CAAgB;AAAA,QACpB,IAAA,EAAM,eAAA;AAAA,QACN,aAAa,EAAC;AAAA,QACd,iBAAA,EAAmB;AAAA,OACnB,CAAA;AACD,MAAA;AAAA,IACD;AAOA,IAAA,MAAM,UAAU,IAAA,CAAK,eAAA,CAAgB,KAAA,CAAM,IAAA,CAAK,WAAW,CAAC,CAAA;AAK5D,IAAA,IAAI,OAAA,CAAQ,SAAS,wBAAA,EAA0B;AAE9C,MAAA,MAAM,QAAA,uBAAe,GAAA,EAAsD;AAC3E,MAAA,KAAA,MAAW,cAAc,OAAA,EAAS;AACjC,QAAA,QAAA,CAAS,IAAI,UAAA,EAAY,IAAA,CAAK,SAAA,CAAU,eAAA,CAAgB,UAAU,CAAC,CAAA;AAAA,MACpE;AAOA,MAAA,KAAK,IAAA,CAAK,uBAAuB,OAAA,EAAS,QAAA,EAAU,YAAY,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA,KAAM;AAC9E,QAAA,MAAM,WAAA,GAAc,sBAAsB,CAAC,CAAA;AAC3C,QAAA,OAAA,CAAQ,KAAA,CAAM,CAAA,uEAAA,EAA0E,WAAA,CAAY,MAAA,EAAQ,CAAA,CAAE,CAAA;AAAA,MAC/G,CAAC,CAAA;AACD,MAAA;AAAA,IACD;AAEA,IAAA,IAAA,CAAK,mBAAA,CAAoB,SAAS,YAAY,CAAA;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,gBAAgB,KAAA,EAA2B;AAClD,IAAA,IAAI,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG,OAAO,KAAA;AAG9B,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAoB;AACzC,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAsB;AAG5C,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAoB;AAE3C,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACzB,MAAA,QAAA,CAAS,GAAA,CAAI,MAAM,CAAC,CAAA;AACpB,MAAA,SAAA,CAAU,GAAA,CAAI,IAAA,EAAM,EAAE,CAAA;AAAA,IACvB;AAGA,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACzB,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,IAAI,CAAA;AACtC,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACvB,QAAA,UAAA,CAAW,GAAA,CAAI,GAAG,IAAI,CAAA;AAAA,MACvB;AAAA,IACD;AAGA,IAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACzB,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,eAAA,CAAgB,IAAI,CAAA;AAC3C,MAAA,KAAA,MAAW,WAAW,KAAA,EAAO;AAC5B,QAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,CAAI,OAAO,CAAA;AACvC,QAAA,IAAI,QAAA,KAAa,MAAA,IAAa,QAAA,KAAa,IAAA,EAAM;AAChD,UAAA,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA,CAAG,IAAA,CAAK,IAAI,CAAA;AAClC,UAAA,QAAA,CAAS,IAAI,IAAA,EAAA,CAAO,QAAA,CAAS,IAAI,IAAI,CAAA,IAAK,KAAK,CAAC,CAAA;AAAA,QACjD;AAAA,MACD;AAAA,IACD;AAGA,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,MAAM,CAAA,IAAK,QAAA,EAAU;AACtC,MAAA,IAAI,MAAA,KAAW,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAAA,IAClC;AAGA,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,SAAS,CAAA,EAAG;AAC3C,MAAA,OAAO,CAAC,GAAG,KAAK,CAAA,CAAE,KAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AAAA,IACvC;AAEA,IAAA,MAAM,UAAoB,EAAC;AAC3B,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACxB,MAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,MAAA,OAAA,CAAQ,KAAK,OAAO,CAAA;AAEpB,MAAA,KAAA,MAAW,cAAc,SAAA,CAAU,GAAA,CAAI,OAAO,CAAA,IAAK,EAAC,EAAG;AACtD,QAAA,MAAM,SAAA,GAAA,CAAa,QAAA,CAAS,GAAA,CAAI,UAAU,KAAK,CAAA,IAAK,CAAA;AACpD,QAAA,QAAA,CAAS,GAAA,CAAI,YAAY,SAAS,CAAA;AAClC,QAAA,IAAI,SAAA,KAAc,CAAA,EAAG,KAAA,CAAM,IAAA,CAAK,UAAU,CAAA;AAAA,MAC3C;AAAA,IACD;AAGA,IAAA,IAAI,OAAA,CAAQ,MAAA,GAAS,KAAA,CAAM,MAAA,EAAQ;AAClC,MAAA,MAAM,YAAY,KAAA,CAChB,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,OAAA,CAAQ,QAAA,CAAS,CAAC,CAAC,EAClC,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,IAAI,CAAC,CAAA;AACtB,MAAA,OAAA,CAAQ,IAAA,CAAK,GAAG,SAAS,CAAA;AAAA,IAC1B;AAEA,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,MAAc,sBAAA,CACb,OAAA,EACA,QAAA,EACA,YAAA,EACgB;AAEhB,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACxB,MAAA,IAAA,CAAK,aAAA,GAAgB,IAAI,aAAA,EAAc;AAAA,IACxC;AAEA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,aAAA,CAAc,YAAA,CAAa,SAAS,QAAQ,CAAA;AAKjE,IAAA,IAAI,CAAC,OAAA,EAAS;AACb,MAAA,IAAA,CAAK,mBAAA,CAAoB,OAAA,EAAS,YAAA,EAAc,QAAQ,CAAA;AACxD,MAAA;AAAA,IACD;AAEA,IAAA,IAAA,CAAK,0BAAA,EAAA;AAGL,IAAA,MAAM,gBAAgB,MAAM,OAAA;AAI5B,IAAA,IAAI,KAAK,OAAA,EAAS;AAGlB,IAAA,MAAM,qBAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,MAAM,aAAA,EAAe;AAC/B,MAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,EAAA,CAAG,UAAU,CAAA;AACxC,MAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,MAAA,IAAI,GAAG,SAAA,EAAW;AAEjB,QAAA;AAAA,MACD;AAGA,MAAA,MAAM,KAAA,GAAQ,iBAAiB,EAAE,CAAA;AACjC,MAAA,KAAA,CAAM,MAAA,GAAS,KAAA;AACf,MAAA,IAAA,CAAK,aAAA,EAAc;AACnB,MAAA,IAAA,CAAK,YAAA,GAAe,EAAA,CAAG,UAAA,EAAY,KAAK,CAAA;AACxC,MAAA,kBAAA,CAAmB,IAAA,CAAK,GAAG,UAAU,CAAA;AAAA,IACtC;AAGA,IAAA,IAAI,KAAK,OAAA,EAAS;AAClB,IAAA,IAAI,kBAAA,CAAmB,MAAA,GAAS,CAAA,IAAK,YAAA,CAAa,SAAS,CAAA,EAAG;AAC7D,MAAA,IAAA,CAAK,eAAA,CAAgB;AAAA,QACpB,IAAA,EAAM,eAAA;AAAA,QACN,WAAA,EAAa,kBAAA;AAAA,QACb,iBAAA,EAAmB;AAAA,OACnB,CAAA;AAAA,IACF;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgCQ,mBAAA,CACP,OAAA,EACA,YAAA,EACA,QAAA,EACW;AACX,IAAA,MAAM,qBAA+B,EAAC;AAEtC,IAAA,KAAA,MAAW,cAAc,OAAA,EAAS;AACjC,MAAA,MAAM,KAAA,GAAQ,WACX,QAAA,CAAS,GAAA,CAAI,UAAU,CAAA,GACvB,IAAA,CAAK,SAAA,CAAU,eAAA,CAAgB,UAAU,CAAA;AAC5C,MAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,QAAA,CAAS,OAAA,CAAQ,WAAW,CAAA,EAAG;AAOnD,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,MAAA;AACvC,MAAA,IAAI;AACH,QAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,KAAA,CAAM,QAAA,EAAU,KAAK,EAAE,CAAA;AACtD,QAAA,OAAO,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,SAAS,WAAA,EAAa;AAC/C,UAAA,IAAA,CAAK,GAAG,GAAA,EAAI;AAAA,QACb;AAEA,QAAA,IAAI,MAAA,CAAO,SAAS,OAAA,EAAS;AAC5B,UAAA,KAAA,CAAM,SAAS,MAAA,CAAO,KAAA;AACtB,UAAA,IAAA,CAAK,aAAA,EAAc;AACnB,UAAA,IAAA,CAAK,YAAA,GAAe,UAAA,EAAY,MAAA,CAAO,KAAK,CAAA;AAC5C,UAAA,kBAAA,CAAmB,KAAK,UAAU,CAAA;AAAA,QACnC,CAAA,MAAA,IAAW,MAAA,CAAO,IAAA,KAAS,OAAA,EAAS;AAYnC,UAAA,MAAM,QAAQ,UAAA,CAAW,MAAA,CAAO,MAAM,IAAA,EAAM,MAAA,CAAO,MAAM,OAAO,CAAA;AAChE,UAAA,KAAA,CAAM,MAAA,GAAS,KAAA;AACf,UAAA,IAAA,CAAK,aAAA,EAAc;AACnB,UAAA,IAAA,CAAK,aAAA,EAAc;AACpB,UAAA,IAAA,CAAK,YAAA,GAAe,YAAY,KAAK,CAAA;AACpC,UAAA,kBAAA,CAAmB,KAAK,UAAU,CAAA;AAAA,QACnC;AAAA,MAGD,SAAS,CAAA,EAAG;AAKX,QAAA,OAAO,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,SAAS,WAAA,EAAa;AAC/C,UAAA,IAAA,CAAK,GAAG,GAAA,EAAI;AAAA,QACb;AACA,QAAA,MAAM,WAAA,GAAc,sBAAsB,CAAC,CAAA;AAC3C,QAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,WAAA,CAAY,IAAA,EAAM,YAAY,OAAO,CAAA;AAC9D,QAAA,KAAA,CAAM,MAAA,GAAS,KAAA;AACf,QAAA,IAAA,CAAK,aAAA,EAAc;AACnB,QAAA,IAAA,CAAK,YAAA,GAAe,YAAY,KAAK,CAAA;AACrC,QAAA,kBAAA,CAAmB,KAAK,UAAU,CAAA;AAAA,MACnC;AAAA,IACD;AAGA,IAAA,IAAI,kBAAA,CAAmB,MAAA,GAAS,CAAA,IAAK,YAAA,CAAa,SAAS,CAAA,EAAG;AAC7D,MAAA,IAAA,CAAK,eAAA,CAAgB;AAAA,QACpB,IAAA,EAAM,eAAA;AAAA,QACN,WAAA,EAAa,kBAAA;AAAA,QACb,iBAAA,EAAmB;AAAA,OACnB,CAAA;AAAA,IACF;AAEA,IAAA,OAAO,kBAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,gBAAgB,KAAA,EAAmC;AAE1D,IAAA,IAAI,KAAK,aAAA,EAAe;AACvB,MAAA,IAAA,CAAK,aAAA,CAAc,KAAK,KAAK,CAAA;AAAA,IAC9B;AAEA,IAAA,IAAI,KAAK,iBAAA,EAAmB;AAC3B,MAAA,IAAI;AACH,QAAA,IAAA,CAAK,iBAAA,CAAkB,QAAQ,KAAK,CAAA;AAAA,MACrC,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACD;AAAA,EACD;AACD,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AApoBa,uBAAA,CA+BY,uBAAA,GAA0B,EAAA;AA/B5C,IAAM,sBAAA,GAAN;;;ACIA,IAAM,oBAAN,MAAwB;AAAA;AAAA;AAAA,EAO3B,OAAO,MAAA,GAAe;AAClB,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EACnB;AAAA;AAAA,EAGA,OAAO,OAAA,GAAgB;AACnB,IAAA,IAAA,CAAK,OAAA,GAAU,KAAA;AAAA,EACnB;AAAA;AAAA,EAGA,OAAO,SAAA,GAAqB;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,OAAO,KAAA,CACH,KAAA,EACA,EAAA,EACA,IAAA,EAC4C;AAC5C,IAAA,IAAI,CAAC,KAAK,OAAA,EAAS;AACf,MAAA,OAAO,EAAE,MAAA,EAAQ,EAAA,EAAG,EAAG,OAAO,IAAA,EAAK;AAAA,IACvC;AAGA,IAAA,MAAM,QAAA,GAAW,OAAO,OAAA,KAAY,WAAA,IAAe,QAAQ,WAAA,GACrD,OAAA,CAAQ,aAAY,GACpB,IAAA;AAEN,IAAA,MAAM,SAAA,GAAY,OAAO,OAAA,KAAY,WAAA,IAAe,OAAA,CAAQ,SACtD,OAAA,CAAQ,MAAA,EAAO,GACf,WAAA,CAAY,GAAA,EAAI;AAItB,IAAA,MAAM,SAAS,EAAA,EAAG;AAGlB,IAAA,MAAM,OAAA,GAAU,OAAO,OAAA,KAAY,WAAA,IAAe,QAAQ,MAAA,GACpD,OAAA,CAAQ,MAAA,CAAO,SAA6B,CAAA,GAC5C,MAAA;AACN,IAAA,MAAM,MAAA,GAAS,OAAO,OAAA,KAAY,WAAA,IAAe,QAAQ,WAAA,GACnD,OAAA,CAAQ,aAAY,GACpB,IAAA;AAKN,IAAA,MAAM,UAAA,GAAqB,OAAA,GACrB,OAAA,CAAQ,CAAC,CAAA,GAAI,GAAA,GAAM,OAAA,CAAQ,CAAC,CAAA,GAAA,CAC3B,WAAA,CAAY,GAAA,EAAI,GAAK,SAAA,IAAwB,GAAA;AAEpD,IAAA,MAAM,aAAqB,QAAA,IAAY,MAAA,GACjC,MAAA,CAAO,QAAA,GAAW,SAAS,QAAA,GAC3B,CAAA;AAEN,IAAA,MAAM,KAAA,GAAyB;AAAA,MAC3B,KAAA;AAAA,MACA,UAAA,EAAY,CAAA;AAAA;AAAA,MACZ,UAAA;AAAA,MACA,cAAc,EAAC;AAAA;AAAA,MACf,UAAA;AAAA,MACA,GAAG;AAAA,KACP;AAEA,IAAA,OAAO,EAAE,QAAQ,KAAA,EAAM;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,OAAO,cAAA,CAAe,SAAA,EAAgC,KAAA,EAAwB;AAC1E,IAAA,MAAM,QAAkB,EAAC;AAEzB,IAAA,KAAA,CAAM,IAAA,CAAK,KAAA,GAAQ,CAAA,GAAA,EAAM,KAAK,KAAK,+BAA+B,CAAA;AAClE,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,UAAA,EAAa,SAAA,CAAU,MAAM,CAAA,kBAAA,EAAA,qBAAyB,IAAA,EAAK,EAAE,WAAA,EAAa,CAAA,CAAE,CAAA;AACvF,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AAGb,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,SAAA,CAAU,SAAS,CAAA;AAE1C,IAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AACxB,MAAA,KAAA,CAAM,KAAK,sBAAsB,CAAA;AACjC,MAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IAC1B;AAGA,IAAA,KAAA,CAAM,KAAK,yBAAyB,CAAA;AACpC,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,IAAA,KAAA,CAAM,KAAK,kIAAgH,CAAA;AAC3H,IAAA,KAAA,CAAM,KAAK,gHAAgH,CAAA;AAE3H,IAAA,KAAA,MAAW,OAAO,SAAA,EAAW;AACzB,MAAA,KAAA,CAAM,IAAA;AAAA,QACF,CAAA,EAAA,EAAK,GAAA,CAAI,KAAK,CAAA,GAAA,EAAM,GAAA,CAAI,KAAK,CAAA,GAAA,EAAA,CACzB,GAAA,CAAI,cAAA,GAAiB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,CAAA,GAAA,EACtC,GAAA,CAAI,cAAA,CAAe,OAAA,CAAQ,CAAC,CAAC,OAC5B,GAAA,CAAI,aAAA,GAAgB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,OACpC,GAAA,CAAI,aAAA,GAAgB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,OACpC,GAAA,CAAI,aAAA,GAAgB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,OACpC,GAAA,CAAI,aAAA,GAAgB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,CAAA,GAAA,EAAA,CACpC,GAAA,CAAI,aAAA,GAAgB,GAAA,EAAM,OAAA,CAAQ,CAAC,CAAC,CAAA,EAAA;AAAA,OAC5C;AAAA,IACJ;AAGA,IAAA,MAAM,eAAA,GAAkB,UAAU,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,eAAA,EAAiB,CAAC,CAAA;AAC/E,IAAA,MAAM,WAAA,GAAc,UAAU,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,eAAA,EAAiB,CAAC,CAAA;AAC3E,IAAA,MAAM,gBAAgB,SAAA,CAAU,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,QAAQ,CAAA,CAAE,MAAA;AAExD,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,IAAA,KAAA,CAAM,KAAK,YAAY,CAAA;AACvB,IAAA,KAAA,CAAM,KAAK,EAAE,CAAA;AACb,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,uBAAA,EAAA,CAA2B,WAAA,GAAc,GAAA,EAAK,OAAA,CAAQ,CAAC,CAAC,CAAA,KAAA,EAAQ,SAAA,CAAU,MAAM,CAAA,MAAA,CAAQ,CAAA;AACnG,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,4BAAA,EAA+B,eAAA,CAAgB,cAAA,EAAgB,CAAA,MAAA,CAAQ,CAAA;AAClF,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,sBAAA,EAAyB,aAAa,CAAA,CAAA,EAAI,UAAU,MAAM,CAAA,EAAA,EAAA,CAAO,aAAA,GAAgB,SAAA,CAAU,MAAA,GAAU,GAAA,EAAK,OAAA,CAAQ,CAAC,CAAC,CAAA,EAAA,CAAI,CAAA;AACnI,IAAA,KAAA,CAAM,KAAK,CAAA,oBAAA,EAAA,CAAwB,WAAA,GAAc,SAAA,CAAU,MAAA,GAAS,KAAM,OAAA,CAAQ,CAAC,CAAC,CAAA,QAAA,EAAA,CAAS,kBAAkB,SAAA,CAAU,MAAA,EAAQ,OAAA,CAAQ,CAAC,CAAC,CAAA,MAAA,CAAQ,CAAA;AAEnJ,IAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,UAAU,SAAA,EAAkD;AAC/D,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAsC;AAG3D,IAAA,KAAA,MAAW,KAAK,SAAA,EAAW;AACvB,MAAA,KAAA,MAAW,CAAA,IAAK,EAAE,MAAA,EAAQ;AACtB,QAAA,IAAI,CAAC,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,KAAK,CAAA,EAAG;AACxB,UAAA,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,KAAA,EAAO,EAAE,CAAA;AAAA,QAC5B;AACA,QAAA,QAAA,CAAS,GAAA,CAAI,CAAA,CAAE,KAAK,CAAA,CAAG,KAAK,CAAC,CAAA;AAAA,MACjC;AAAA,IACJ;AAGA,IAAA,MAAM,SAA2B,EAAC;AAClC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,WAAW,CAAA,IAAK,QAAA,EAAU;AACzC,MAAA,MAAM,SAAA,GAAY,WAAA,CAAY,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,UAAU,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,GAAI,CAAC,CAAA;AACzE,MAAA,MAAM,UAAA,GAAa,WAAA,CAAY,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,UAAU,CAAA;AACpD,MAAA,MAAM,QAAQ,WAAA,CAAY,MAAA;AAE1B,MAAA,MAAA,CAAO,IAAA,CAAK;AAAA,QACR,KAAA;AAAA,QACA,KAAA;AAAA,QACA,cAAA,EAAgB,WAAW,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,GAAI,KAAA;AAAA,QACxD,cAAA,EAAgB,UAAU,MAAA,CAAO,CAAC,GAAG,CAAA,KAAM,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA,GAAI,KAAA;AAAA,QACvD,aAAA,EAAe,UAAU,CAAC,CAAA;AAAA,QAC1B,aAAA,EAAe,SAAA,CAAU,SAAA,CAAU,MAAA,GAAS,CAAC,CAAA;AAAA,QAC7C,aAAA,EAAe,UAAA,CAAW,SAAA,EAAW,EAAE,CAAA;AAAA,QACvC,aAAA,EAAe,UAAA,CAAW,SAAA,EAAW,EAAE,CAAA;AAAA,QACvC,aAAA,EAAe,UAAA,CAAW,SAAA,EAAW,EAAE;AAAA,OAC1C,CAAA;AAAA,IACL;AAGA,IAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,CAAM,aAAA,CAAc,CAAA,CAAE,KAAK,CAAC,CAAA;AACpD,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,eAAA,CACH,UAAA,EACA,MAAA,EACA,WAAoB,KAAA,EACH;AACjB,IAAA,MAAM,eAAA,GAAkB,OAAO,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,UAAA,EAAY,CAAC,CAAA;AACvE,IAAA,MAAM,eAAA,GAAkB,OAAO,MAAA,CAAO,CAAC,KAAK,CAAA,KAAM,GAAA,GAAM,CAAA,CAAE,UAAA,EAAY,CAAC,CAAA;AACvE,IAAA,OAAO,EAAE,UAAA,EAAY,MAAA,EAAQ,eAAA,EAAiB,iBAAiB,QAAA,EAAS;AAAA,EAC5E;AACJ,CAAA;AAAA;AAnNa,iBAAA,CAEM,OAAA,GAAmB,KAAA;AAyNtC,SAAS,UAAA,CAAW,QAAkB,CAAA,EAAmB;AACrD,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAChC,EAAA,IAAI,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG,OAAO,OAAO,CAAC,CAAA;AAExC,EAAA,MAAM,KAAA,GAAS,CAAA,GAAI,GAAA,IAAQ,MAAA,CAAO,MAAA,GAAS,CAAA,CAAA;AAC3C,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAC9B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AAC7B,EAAA,IAAI,KAAA,KAAU,KAAA,EAAO,OAAO,MAAA,CAAO,KAAK,CAAA;AAExC,EAAA,MAAM,WAAW,KAAA,GAAQ,KAAA;AACzB,EAAA,OAAO,OAAO,KAAK,CAAA,IAAK,IAAI,QAAA,CAAA,GAAY,MAAA,CAAO,KAAK,CAAA,GAAI,QAAA;AAC5D;;;ACpQO,SAAS,qBAAA,CACZ,YACA,MAAA,EACiB;AACjB,EAAA,IAAI,UAAA,CAAW,MAAA,GAAS,MAAA,CAAO,mBAAA,EAAqB;AAChD,IAAA,MAAM,MAAM,YAAA,CAAa,UAAA;AAAA,MACrB,qBAAA;AAAA,MACA,CAAA,iCAAA,EAAoC,MAAA,CAAO,mBAAmB,CAAA,iBAAA,EAAoB,WAAW,MAAM,CAAA,CAAA,CAAA;AAAA,MACnG,EAAE,gBAAA,EAAkB,UAAA,CAAW,MAAA,EAAQ,SAAA,EAAW,OAAO,mBAAA;AAAoB,KACjF;AACA,IAAA,OAAO;AAAA,MACH,MAAA,EAAQ,KAAA;AAAA,MACR,KAAA,EAAO;AAAA,QACH,KAAA,EAAO,YAAY,CAAC,CAAA;AAAA,QACpB,QAAQ,EAAC;AAAA,QACT,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,OAAO,GAAA,CAAI,OAAA;AAAA,QACX,WAAA,EAAa;AAAA;AACjB,KACJ;AAAA,EACJ;AACA,EAAA,OAAO,EAAE,QAAQ,IAAA,EAAK;AAC1B;AAMO,SAAS,yBAAA,CACZ,QACA,MAAA,EAC8F;AAC9F,EAAA,IAAI,iBAAA,GAAoB,CAAA;AACxB,EAAA,IAAI,YAAA,GAAe,CAAA;AACnB,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACpB,IAAA,IAAI,CAAA,CAAE,SAAS,MAAA,EAAQ,iBAAA,EAAA;AACvB,IAAA,IAAI,CAAA,CAAE,KAAA,KAAU,GAAA,IAAO,CAAA,CAAE,SAAS,QAAA,EAAU;AAAE,MAAA,YAAA,EAAA;AAAgB,MAAA,SAAA,GAAY,IAAA,CAAK,GAAA,CAAI,SAAA,EAAW,YAAY,CAAA;AAAA,IAAG;AAC7G,IAAA,IAAI,CAAA,CAAE,KAAA,KAAU,GAAA,IAAO,CAAA,CAAE,SAAS,QAAA,EAAU,YAAA,EAAA;AAAA,EAChD;AACA,EAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,MAAA,GAAS,iBAAA,GAAoB,IAAI,SAAA,GAAY,EAAA;AAC5E,EAAA,IAAI,eAAA,GAAkB,OAAO,aAAA,EAAe;AACxC,IAAA,MAAM,MAAM,YAAA,CAAa,UAAA;AAAA,MACrB,wBAAA;AAAA,MACA,CAAA,4BAAA,EAA+B,eAAe,CAAA,oBAAA,EAAuB,MAAA,CAAO,aAAa,CAAA,CAAA;AAAA,MACzF,EAAE,UAAA,EAAY,eAAA,EAAiB,aAAA,EAAe,OAAO,aAAA;AAAc,KACvE;AACA,IAAA,OAAO,EAAE,QAAQ,KAAA,EAAO,eAAA,EAAiB,cAAc,GAAA,CAAI,OAAA,EAAS,aAAa,GAAA,EAAI;AAAA,EACzF;AACA,EAAA,OAAO,EAAE,MAAA,EAAQ,IAAA,EAAM,eAAA,EAAgB;AAC3C;AASA,SAAS,UAAU,CAAA,EAAmB;AAClC,EAAA,OAAO,CAAA,CAAE,IAAA,KAAS,OAAA,IAAW,CAAA,CAAE,IAAA,KAAS,MAAA;AAC5C;AAeA,SAAS,qBAAqB,IAAA,EAAsB;AAChD,EAAA,OAAO,IAAA,CAAK,IAAA,KAAS,QAAA,IAAY,IAAA,CAAK,IAAA,KAAS,QAAQ,IAAA,CAAK,IAAA,KAAS,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,QAAA;AAC/F;AAUA,SAAS,qBAAA,CAAsB,QAAiB,OAAA,EAAgC;AAC5E,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,OAAA,EAAS,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AAC1C,IAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU,KAAA,EAAA;AAAA,SAAA,IACxB,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU;AAClC,MAAA,KAAA,EAAA;AACA,MAAA,IAAI,KAAA,KAAU,GAAG,OAAO,CAAA;AAAA,IAC5B;AAAA,EACJ;AACA,EAAA,OAAO,IAAA;AACX;AAeA,SAAS,0BAA0B,MAAA,EAA8B;AAC7D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,IAAI,CAAC,SAAA,CAAU,MAAA,CAAO,CAAC,CAAC,CAAA,EAAG;AAC3B,IAAA,IAAI,IAAI,CAAA,IAAK,MAAA,CAAO,IAAI,CAAC,CAAA,CAAE,SAAS,OAAA,EAAS;AAC7C,IAAA,IAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AACtC,IAAA,MAAM,QAAA,GAAW,qBAAA,CAAsB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AACpD,IAAA,IAAI,aAAa,IAAA,EAAM;AACvB,IAAA,IAAI,MAAA,CAAO,QAAA,GAAW,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AAC7C,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAU,CAAA,EAAA,EAAK;AACnC,MAAA,IAAI,SAAA,CAAU,MAAA,CAAO,CAAC,CAAC,CAAA,WAAY,GAAA,CAAI,MAAA,CAAO,CAAC,CAAA,CAAE,KAAK,CAAA;AAAA,IAC1D;AAAA,EACJ;AACA,EAAA,OAAO,QAAA;AACX;AAuBO,SAAS,sBAAsB,MAAA,EAAwD;AAC1F,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,kBAAA,GAAqB,0BAA0B,MAAM,CAAA;AAE3D,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,IAAA,IAAI,CAAA,CAAE,SAAS,QAAA,EAAU;AAQrB,MAAA,IAAI,CAAA,GAAI,CAAA,GAAI,MAAA,CAAO,MAAA,IAAU,OAAO,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,KAAS,WAAW,SAAA,CAAU,MAAA,CAAO,CAAA,GAAI,CAAC,CAAC,CAAA,EAAG;AACrF,QAAA,MAAM,MAAM,YAAA,CAAa,MAAA,CAAO,CAAA,GAAI,CAAC,EAAE,KAAK,CAAA;AAC5C,QAAA,KAAA,CAAM,KAAK,GAAG,CAAA;AACd,QAAA,IAAI,CAAA,GAAI,IAAI,MAAA,CAAO,MAAA,IAAU,OAAO,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU;AAC1D,UAAA,MAAA,CAAO,KAAK,GAAG,CAAA;AAAA,QACnB;AAAA,MACJ;AACA,MAAA;AAAA,IACJ;AACA,IAAA,IAAI,CAAA,CAAE,SAAS,OAAA,EAAS;AAGpB,MAAA,IAAI,IAAI,CAAA,IAAK,MAAA,CAAO,IAAI,CAAC,CAAA,CAAE,SAAS,QAAA,EAAU;AAG9C,MAAA,IAAI,CAAA,GAAI,IAAI,MAAA,CAAO,MAAA,IAAU,UAAU,MAAA,CAAO,CAAA,GAAI,CAAC,CAAC,CAAA,EAAG;AACnD,QAAA,MAAM,OAAA,GAAU,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,CAAE,KAAA;AAC9B,QAAA,KAAA,CAAM,KAAK,OAAO,CAAA;AAGlB,QAAA,IAAI,CAAA,GAAI,IAAI,MAAA,CAAO,MAAA,IAAU,OAAO,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU;AAC1D,UAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ;AACA,IAAA,IAAI,SAAA,CAAU,CAAC,CAAA,EAAG;AAEd,MAAA,IAAI,IAAI,CAAA,IAAK,MAAA,CAAO,IAAI,CAAC,CAAA,CAAE,SAAS,OAAA,EAAS;AAG7C,MAAA,IAAI,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,GAAI,CAAA,IAAK,qBAAqB,MAAA,CAAO,CAAA,GAAI,CAAC,CAAC,CAAA,EAAG;AAGvE,MAAA,IAAI,kBAAA,CAAmB,GAAA,CAAI,CAAA,CAAE,KAAK,CAAA,EAAG;AAIrC,MAAA,IAAI,MAAA,CAAO,CAAA,GAAI,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AAClC,QAAA,MAAM,QAAA,GAAW,qBAAA,CAAsB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AACpD,QAAA,IAAI,aAAa,IAAA,IAAQ,MAAA,CAAO,WAAW,CAAC,CAAA,EAAG,SAAS,QAAA,EAAU;AAC9D,UAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAK,CAAA;AAClB,UAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AACnB,UAAA;AAAA,QACJ;AAAA,MAGJ;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAK,CAAA;AAElB,MAAA,IAAI,CAAA,GAAI,IAAI,MAAA,CAAO,MAAA,IAAU,OAAO,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU;AAC1D,QAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAK,CAAA;AAAA,MACvB;AAAA,IACJ;AAAA,EACJ;AACA,EAAA,OAAO,EAAE,OAAO,MAAA,EAAO;AAC3B;AA8BO,SAAS,YAAY,QAAA,EAA2B;AACnD,EAAA,MAAM,cAAA,GAAiB,WAAA,CAAY,YAAA,CAAa,QAAQ,CAAA;AACxD,EAAA,OAAO,cAAA,CAAe,IAAA;AAC1B;AAQO,SAAS,sBAAA,CAAuB,UAAkB,UAAA,EAA2C;AAChG,EAAA,MAAM,KAAA,GAAQ,WAAA,CAAY,gBAAA,CAAiB,QAAQ,CAAA;AACnD,EAAA,OAAO,KAAA,CAAM,IAAI,CAAA,CAAA,MAAM;AAAA,IACnB,OAAO,CAAA,CAAE,KAAA;AAAA,IACT,KAAK,CAAA,CAAE,GAAA;AAAA,IACP,YAAY,CAAA,CAAE,UAAA;AAAA,IACd,UAAA;AAAA,IACA,cAAc,CAAA,CAAE;AAAA,GACpB,CAAE,CAAA;AACN;;;ACrLO,IAAM,mBAAN,MAAuB;AAAA;AAAA;AAAA,EA6K1B,YACI,UAAA,GAAa,IAAA,EACb,iBAAiB,KAAA,EACjB,MAAA,EACA,oBACA,QAAA,EACF;AAjLF;AAAA,IAAA,IAAA,CAAQ,GAAA,GAAM,IAAI,eAAA,EAAgB;AAClC,IAAA,IAAA,CAAQ,SAAA,GAAY,IAAI,SAAA,EAAU;AAClC,IAAA,IAAA,CAAQ,YAAA,GAAe,IAAI,YAAA,EAAa;AAyBxC;AAAA,IAAA,IAAA,CAAQ,gBAAA,GAAmB,IAAI,gBAAA,EAAiB;AAOhD;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,oBAAA,uBAA2B,GAAA,EAQhC;AAUH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,kBAAA,uBAAyB,GAAA,EAA4B;AAa7D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,aAAA,GAAsC,IAAA;AAyC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,sBAAA,uBAA6B,GAAA,EAA8B;AAYnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,eAAA,GAAsC,IAAA;AAe9C;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,aAAA,uBAAkD,GAAA,EAAI;AAwB9D;AAAA,IAAA,IAAA,CAAQ,WAAA,GAAiC;AAAA,MACrC,IAAI,eAAA,EAAgB;AAAA,MACpB,IAAI,eAAA,EAAgB;AAAA,MACpB,IAAI,eAAA,EAAgB;AAAA,MACpB,IAAI,eAAA;AAAgB,KACxB;AAEA;AAAA,IAAA,IAAA,CAAQ,gBAAA,GAAmB,CAAA;AAE3B;AAAA,IAAA,IAAA,CAAQ,aAAA,GAA0C,IAAA;AAY9C,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAKlB,IAAA,IAAA,CAAK,MAAA,GAAS,iBAAA,CAAkB,cAAA,EAAgB,MAAA,IAAU,EAAE,CAAA;AAC5D,IAAA,IAAA,CAAK,QAAQ,IAAI,KAAA,CAAM,UAAA,EAAY,gBAAA,CAAiB,UAAU,CAAC,CAAA;AAC/D,IAAA,IAAA,CAAK,QAAA,GAAW,IAAI,gBAAA,EAAiB;AAErC,IAAA,IAAA,CAAK,UAAU,mBAAA,EAAoB;AAGlC,IAAA,IAAI,kBAAA,EAAoB;AACpB,MAAA,IAAA,CAAK,kBAAA,GAAqB,kBAAA;AAAA,IAC9B,WAAW,cAAA,EAAgB;AACvB,MAAA,IAAA,CAAK,kBAAA,GAAqB,IAAI,kBAAA,EAAmB;AACjD,MAAA,IAAA,CAAK,iBAAA,GAAoB,IAAI,2BAAA,EAA4B;AACzD,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAA,CAAS,IAAA,CAAK,iBAAiB,CAAA;AAAA,IAC3D,CAAA,MAAO;AACH,MAAA,IAAA,CAAK,kBAAA,GAAqB,IAAI,kBAAA,EAAmB;AAAA,IAErD;AAcD,IAAA,IAAA,CAAK,UAAA,GAAa,IAAI,eAAA,EAAgB;AAItC,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,SAAS,KAAK,MAAA,CAAO,OAAA,CAAQ,eAAe,CAAA,EAAG;AAC/D,MAAA,IAAA,CAAK,UAAA,CAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAA;AAAA,IAC/C;AAKA,IAAA,IAAA,CAAK,WAAW,QAAA,CAAS,oBAAA;AAAA,MACrB,EAAA;AAAA,MACA,CAAC,IAAA,KAAS,IAAA,CAAK,UAAA,CAAW,eAAe,IAAI;AAAA,KAChD,CAAA;AAED,IAAA,MAAM,UAAU,QAAA,IAAY,gBAAA;AAC5B,IAAA,KAAA,MAAW,OAAO,OAAA,EAAS;AAmBvB,MAAA,IAAI;AACA,QAAA,IAAA,CAAK,gBAAgB,GAAG,CAAA;AAAA,MAC5B,SAAS,CAAA,EAAG;AACR,QAAA,MAAM,WAAA,GAAc,sBAAsB,CAAC,CAAA;AAC3C,QAAA,OAAA,CAAQ,KAAA;AAAA,UACJ,kDAAkD,GAAA,CAAI,IAAI,CAAA,8EAAA,EACb,WAAA,CAAY,QAAQ,CAAA;AAAA,SACrE;AAAA,MACJ;AAAA,IACJ;AAEA,IAAA,IAAA,CAAK,MAAA,GAAS,IAAI,gBAAA,CAAiB,IAAA,CAAK,UAAU,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,eAAA,EAAiB,UAAU,CAAA;AACpG,IAAA,IAAA,CAAK,EAAA,GAAK,QAAA;AAAA,MACN,KAAK,OAAA,CAAQ,UAAA;AAAA,MACb,IAAA,CAAK,OAAO,EAAA,CAAG,aAAA;AAAA,MACf,IAAA,CAAK,OAAO,EAAA,CAAG,eAAA;AAAA,MACf,MAAA;AAAA,MACA,IAAA,CAAK,OAAO,EAAA,CAAG,iBAAA;AAAA,MACf,IAAA,CAAK,OAAO,EAAA,CAAG,oBAAA;AAAA,MACf,IAAA,CAAK,OAAO,EAAA,CAAG,gBAAA;AAAA,MACf,IAAA,CAAK,OAAO,IAAA,CAAK,cAAA;AAAA,MACjB,IAAA,CAAK,OAAO,IAAA,CAAK,cAAA;AAAA,MACjB,IAAA,CAAK;AAAA,KACT;AACA,IAAA,IAAA,CAAK,cAAc,iBAAA,EAAkB;AACrC,IAAA,IAAA,CAAK,OAAA,GAAU,IAAI,sBAAA,CAAuB,IAAA,CAAK,KAAK,IAAA,CAAK,SAAA,EAAW,KAAK,EAAE,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA3MG,iBAAiB,GAAA,EAAiC;AAC9C,IAAA,IAAA,CAAK,aAAA,GAAgB,GAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,gBAAgB,UAAA,EAA0C;AAC9D,IAAA,MAAM,MAAM,IAAA,CAAK,aAAA;AACjB,IAAA,OAAO;AAAA,MACH,SAAA,EAAW,UAAA;AAAA,MACX,aAAA,EAAe,MAAM,CAAC,CAAA,KAAc,IAAI,SAAA,CAAU,CAAC,CAAA,EAAG,MAAA,IAAU,MAAA,GAAY,MAAA;AAAA,MAC5E,cAAA,EAAgB,GAAA,GACV,CAAC,CAAA,KAAc;AACX,QAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,SAAA,CAAU,CAAC,CAAA;AAC7B,QAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AACnB,QAAA,OAAO,KAAA,CAAM,OAAA,IAAW,OAAA,CAAQ,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,MACnD,CAAA,GACA;AAAA,KACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiDQ,aAAA,CAAc,YAAoB,OAAA,EAAgC;AACtE,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,MAAA,CAAO,WAAA,CAAY,gBAAA;AAC3C,IAAA,IAAI,IAAA,CAAK,aAAA,CAAc,IAAA,IAAQ,UAAA,EAAY;AACvC,MAAA,MAAM,SAAS,IAAA,CAAK,aAAA,CAAc,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AAChD,MAAA,IAAI,WAAW,MAAA,EAAW;AACtB,QAAA,IAAA,CAAK,aAAA,CAAc,OAAO,MAAM,CAAA;AAAA,MACpC;AAAA,IACJ;AACA,IAAA,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,UAAA,EAAY,OAAO,CAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8IA,cAAA,GAAuD;AACnD,IAAA,OAAO,IAAA,CAAK,QAAQ,cAAA,EAAe;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAA,GAAqC;AACjC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,gBAAgB,GAAA,EAA2B;AAUvC,IAAA,6BAAA,CAA8B,GAAG,CAAA;AAYjC,IAAA,IAAI,IAAA,CAAK,oBAAA,CAAqB,GAAA,CAAI,GAAA,CAAI,IAAI,CAAA,EAAG;AACzC,MAAA,OAAA,CAAQ,IAAA;AAAA,QACJ,CAAA,4BAAA,EAA+B,IAAI,IAAI,CAAA,uFAAA;AAAA,OAE3C;AACA,MAAA,IAAA,CAAK,iBAAA,CAAkB,IAAI,IAAI,CAAA;AAAA,IACnC;AAWA,IAAA,MAAM,aAAA,GAAgB,0BAA0B,GAAA,EAAK,CAAC,GAAG,IAAA,CAAK,kBAAA,CAAmB,MAAA,EAAQ,CAAC,CAAA;AAC1F,IAAA,KAAA,MAAW,QAAA,IAAY,cAAc,SAAA,EAAW;AAC5C,MAAA,MAAM,MAAM,QAAA,CAAS,QAAA,KAAa,OAAA,GAAU,OAAA,CAAQ,QAAQ,OAAA,CAAQ,IAAA;AACpE,MAAA,GAAA,CAAI,CAAA,yCAAA,EAA4C,SAAS,QAAQ,CAAA,EAAA,EAAK,SAAS,IAAI,CAAA,GAAA,EAAM,QAAA,CAAS,MAAM,CAAA,CAAE,CAAA;AAAA,IAC9G;AAmBA,IAAA,MAAM,YAAA,GAAe;AAAA,MACjB,uBAAuB,EAAC;AAAA,MACxB,iBAAiB,EAAC;AAAA,MAClB,oBAAoB,EAAC;AAAA,MACrB,iBAAiB,EAAC;AAAA,MAClB,iBAAiB,GAAA,CAAI,eAAA;AAAA,MACrB,kBAAkB,EAAC;AAAA,MACnB,qBAAqB;AAAC,KAC1B;AAYA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,IAAA,CAAK,KAAA,CAAM,kBAAA,CAAmB,GAAA,CAAI,eAAe,CAAA;AAAA,IACrD;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,KAAA,MAAW,EAAA,IAAM,IAAI,eAAA,EAAiB;AAClC,QAAA,IAAA,CAAK,QAAA,CAAS,cAAA,CAAe,EAAA,CAAG,SAAA,EAAW,GAAG,QAAQ,CAAA;AAAA,MAC1D;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,cAAA,EAAgB;AACpB,MAAA,KAAA,MAAW,EAAA,IAAM,IAAI,cAAA,EAAgB;AACjC,QAAA,IAAA,CAAK,QAAA,CAAS,aAAA,CAAc,EAAA,CAAG,SAAA,EAAW,GAAG,QAAQ,CAAA;AAAA,MACzD;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,KAAA,MAAW,EAAA,IAAM,IAAI,eAAA,EAAiB;AAClC,QAAA,IAAA,CAAK,OAAA,CAAQ,eAAA,CAAgB,EAAA,CAAG,KAAK,IAAI,EAAA,CAAG,OAAA;AAC5C,QAAA,IAAA,CAAK,OAAA,CAAQ,oBAAA,CAAqB,EAAA,CAAG,KAAK,IAAI,GAAA,CAAI,IAAA;AAClD,QAAA,YAAA,CAAa,qBAAA,CAAsB,IAAA,CAAK,EAAA,CAAG,KAAK,CAAA;AAAA,MACpD;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,KAAA,MAAW,EAAA,IAAM,IAAI,eAAA,EAAiB;AAClC,QAAA,IAAA,CAAK,OAAA,CAAQ,gBAAA,CAAiB,cAAA,CAAe,EAAE,CAAA;AAC/C,QAAA,YAAA,CAAa,eAAA,CAAgB,KAAK,EAAE,CAAA;AAAA,MACxC;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,cAAA,EAAgB;AACpB,MAAA,KAAA,MAAW,QAAA,IAAY,IAAI,cAAA,EAAgB;AACvC,QAAA,IAAA,CAAK,gBAAA,CAAiB,SAAS,QAAQ,CAAA;AACvC,QAAA,YAAA,CAAa,kBAAA,CAAmB,IAAA,CAAK,QAAA,CAAS,SAAS,CAAA;AAAA,MAC3D;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,OAAA,EAAS;AACb,MAAA,KAAA,MAAW,CAAC,QAAQ,SAAS,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,OAAO,CAAA,EAAG;AAC3D,QAAA,IAAA,CAAK,UAAA,CAAW,SAAA,CAAU,MAAA,EAAQ,SAAS,CAAA;AAAA,MAC/C;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,KAAA,MAAW,IAAA,IAAQ,IAAI,eAAA,EAAiB;AACpC,QAAA,IAAA,CAAK,UAAA,CAAW,SAAS,IAAI,CAAA;AAC7B,QAAA,YAAA,CAAa,mBAAA,CAAoB,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA;AAAA,MACnD;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,KAAA,MAAW,CAAC,WAAW,QAAQ,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,eAAe,CAAA,EAAG;AACrE,QAAA,qBAAA,CAAsB,WAAW,QAAQ,CAAA;AACzC,QAAA,YAAA,CAAa,eAAA,CAAgB,KAAK,SAAS,CAAA;AAAA,MAC/C;AAAA,IACJ;AACA,IAAA,IAAI,IAAI,eAAA,EAAiB;AACrB,MAAA,IAAA,CAAK,sBAAA,CAAuB,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,IAAI,eAAe,CAAA;AAAA,IACjE;AACA,IAAA,IAAI,IAAI,YAAA,EAAc;AAClB,MAAA,KAAA,MAAW,CAAC,MAAM,OAAO,CAAA,IAAK,OAAO,OAAA,CAAQ,GAAA,CAAI,YAAY,CAAA,EAAG;AAC5D,QAAA,mBAAA,CAAoB,MAAM,OAAO,CAAA;AACjC,QAAA,YAAA,CAAa,gBAAA,CAAiB,KAAK,IAAI,CAAA;AAAA,MAC3C;AAAA,IACJ;AAEA,IAAA,IAAA,CAAK,oBAAA,CAAqB,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,YAAY,CAAA;AAMpD,IAAA,IAAA,CAAK,kBAAA,CAAmB,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,GAAG,CAAA;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiCA,kBAAkB,WAAA,EAA8B;AAC5C,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,oBAAA,CAAqB,GAAA,CAAI,WAAW,CAAA;AAC9D,IAAA,IAAI,CAAC,cAAc,OAAO,KAAA;AAE1B,IAAA,KAAA,MAAW,KAAA,IAAS,aAAa,qBAAA,EAAuB;AACpD,MAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,eAAA,CAAgB,KAAK,CAAA;AACzC,MAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,oBAAA,CAAqB,KAAK,CAAA;AAAA,IAClD;AACA,IAAA,KAAA,MAAW,EAAA,IAAM,aAAa,eAAA,EAAiB;AAC3C,MAAA,IAAA,CAAK,OAAA,CAAQ,gBAAA,CAAiB,gBAAA,CAAiB,EAAE,CAAA;AAAA,IACrD;AACA,IAAA,KAAA,MAAW,SAAA,IAAa,aAAa,kBAAA,EAAoB;AACrD,MAAA,IAAA,CAAK,gBAAA,CAAiB,WAAW,SAAS,CAAA;AAAA,IAC9C;AACA,IAAA,KAAA,MAAW,SAAA,IAAa,aAAa,eAAA,EAAiB;AAClD,MAAA,uBAAA,CAAwB,SAAS,CAAA;AAAA,IACrC;AACA,IAAA,IAAI,aAAa,eAAA,EAAiB;AAC9B,MAAA,IAAA,CAAK,KAAA,CAAM,oBAAA,CAAqB,YAAA,CAAa,eAAe,CAAA;AAAA,IAChE;AACA,IAAA,KAAA,MAAW,IAAA,IAAQ,aAAa,gBAAA,EAAkB;AAC9C,MAAA,qBAAA,CAAsB,IAAI,CAAA;AAAA,IAC9B;AACA,IAAA,KAAA,MAAW,QAAA,IAAY,aAAa,mBAAA,EAAqB;AACrD,MAAA,IAAA,CAAK,UAAA,CAAW,WAAW,QAAQ,CAAA;AAAA,IACvC;AACA,IAAA,IAAA,CAAK,sBAAA,CAAuB,OAAO,WAAW,CAAA;AAE9C,IAAA,IAAA,CAAK,oBAAA,CAAqB,OAAO,WAAW,CAAA;AAC5C,IAAA,IAAA,CAAK,kBAAA,CAAmB,OAAO,WAAW,CAAA;AAC1C,IAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AACzB,IAAA,OAAO,IAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,SAAA,GAA0B;AACtB,IAAA,OAAO,EAAE,GAAG,IAAA,CAAK,MAAA,EAAO;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAA,GAA4C;AACxC,IAAA,OAAO,IAAA,CAAK,kBAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,gBACJ,UAAA,EACA,MAAA,EACA,OAAA,EACA,KAAA,EACA,QACA,UAAA,EACI;AACJ,IAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,UAAA,EAAY,IAAI,cAAA;AAAA,MAC/B,MAAA;AAAA,MACA,OAAA;AAAA,MACA,KAAA;AAAA,MACA,MAAA,CAAO,MAAA,GAAS,CAAA,GAAI,MAAA,CAAO,CAAC,CAAA,GAAI;AAAA,OACjC,UAAU,CAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBQ,eAAA,CACJ,SACA,UAAA,EACA,UAAA,EACA,OACA,MAAA,EACA,SAAA,EACA,eACA,eAAA,EACK;AACL,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,MAAA;AAKvC,IAAA,MAAM,UAAA,GAAa,IAAI,eAAA,EAAgB;AAKvC,IAAA,MAAM,UAAA,GAAa,MAAM,UAAA,CAAW,KAAA,EAAM;AAC1C,IAAA,IAAA,CAAK,iBAAiB,gBAAA,CAAiB,OAAA,EAAS,YAAY,EAAE,IAAA,EAAM,MAAM,CAAA;AAE1E,IAAA,WAAA,CAAY,uBAAuB,iBAAiB,CAAA;AACpD,IAAA,IAAI,KAAK,eAAA,EAAiB;AACtB,MAAA,WAAA,CAAY,aAAa,iBAAiB,CAAA;AAAA,IAC9C;AAEA,IAAA,IAAA,CAAK,EAAA,CAAG,eAAe,UAAA,CAAW,MAAA;AAClC,IAAA,IAAA,CAAK,EAAA,CAAG,eAAe,MAAM;AACzB,MAAA,WAAA,CAAY,eAAe,iBAAiB,CAAA;AAC5C,MAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,UAAU,CAAA;AAC7D,MAAA,UAAA,CAAW,KAAA,EAAM;AAAA,IACrB,CAAA;AAEA,IAAA,oBAAA,CAAqB,KAAK,WAAW,CAAA;AACrC,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,OAAA,EAAS,IAAA,CAAK,EAAA,EAAI,eAAe,eAAA,EAAiB,IAAA,CAAK,eAAA,CAAgB,UAAU,CAAC,CAAA;AAGjH,IAAA,OAAO,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,SAAS,WAAA,EAAa;AAC5C,MAAA,IAAA,CAAK,GAAG,GAAA,EAAI;AAAA,IAChB;AAEA,IAAA,IAAI,MAAA,CAAO,SAAS,SAAA,EAAW;AAI3B,MAAA,KAAK,IAAA,CAAK,aAAa,MAAM,CAAA;AAG7B,MAAA,IAAA,CAAK,GAAA,CAAI,gCAAA;AAAA,QACL,UAAA;AAAA,QACA,OAAO,SAAA,IAAa,SAAA;AAAA,QACpB,CAAC,OAAO,QAAQ;AAAA,OACpB;AAEA,MAAA,MAAM,OAAA,GAAU,YAAA,CAAa,MAAA,CAAO,QAAQ,CAAA;AAC5C,MAAA,IAAA,CAAK,gBAAgB,UAAA,EAAY,OAAA,EAAS,OAAA,EAAS,KAAA,EAAO,QAAQ,UAAU,CAAA;AAC5E,MAAA,OAAO,OAAA;AAAA,IACX;AAEA,IAAA,IAAI,MAAA,CAAO,SAAS,OAAA,EAAS;AACzB,MAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,UAAU,CAAA;AAC7D,MAAA,MAAM,MAAA,CAAO,KAAA;AAAA,IACjB;AAKA,IAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,UAAU,CAAA;AAE7D,IAAA,IAAA,CAAK,GAAA,CAAI,YAAA,CAAa,UAAA,EAAY,KAAA,EAAO,MAAM,CAAA;AAC/C,IAAA,IAAA,CAAK,gBAAgB,UAAA,EAAY,MAAA,CAAO,OAAO,OAAA,EAAS,KAAA,EAAO,QAAQ,UAAU,CAAA;AACjF,IAAA,OAAO,MAAA,CAAO,KAAA;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,UAAA,CAAW,OAAA,EAA0B,UAAA,GAAqB,EAAA,EAAgB;AAC9E,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,MAAA;AAEvC,IAAA,MAAM,UAAA,GAAa,IAAI,eAAA,EAAgB;AAEvC,IAAA,MAAM,UAAA,GAAa,MAAM,UAAA,CAAW,KAAA,EAAM;AAC1C,IAAA,IAAA,CAAK,iBAAiB,gBAAA,CAAiB,OAAA,EAAS,YAAY,EAAE,IAAA,EAAM,MAAM,CAAA;AAE1E,IAAA,WAAA,CAAY,uBAAuB,YAAY,CAAA;AAC/C,IAAA,IAAI,KAAK,eAAA,EAAiB;AACtB,MAAA,WAAA,CAAY,aAAa,YAAY,CAAA;AAAA,IACzC;AAEA,IAAA,IAAA,CAAK,EAAA,CAAG,eAAe,UAAA,CAAW,MAAA;AAClC,IAAA,IAAA,CAAK,EAAA,CAAG,eAAe,MAAM;AACzB,MAAA,WAAA,CAAY,eAAe,YAAY,CAAA;AACvC,MAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,UAAU,CAAA;AAC7D,MAAA,UAAA,CAAW,KAAA,EAAM;AAAA,IACrB,CAAA;AAEA,IAAA,oBAAA,CAAqB,KAAK,WAAW,CAAA;AACrC,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,OAAA,EAAS,IAAA,CAAK,EAAA,EAAI,QAAW,MAAA,EAAW,IAAA,CAAK,eAAA,CAAgB,UAAU,CAAC,CAAA;AAGvG,IAAA,OAAO,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,SAAS,WAAA,EAAa;AAC5C,MAAA,IAAA,CAAK,GAAG,GAAA,EAAI;AAAA,IAChB;AAKA,IAAA,IAAI,MAAA,CAAO,SAAS,SAAA,EAAW;AAC3B,MAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,UAAU,CAAA;AAAA,IACjE;AAEA,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAc,aAAa,OAAA,EAAkE;AACzF,IAAA,MAAM,EAAE,QAAA,EAAU,QAAA,EAAU,SAAA,EAAW,QAAO,GAAI,OAAA;AAClD,IAAA,MAAM,qBAAqB,SAAA,IAAa,SAAA;AAKxC,IAAA,IAAI;AAGA,MAAA,MAAM,QAAA;AACN,MAAA,IAAI,OAAO,OAAA,EAAS;AAChB,QAAA,WAAA,CAAY,kBAAA,CAAmB,UAAU,8BAA8B,CAAA;AACvE,QAAA;AAAA,MACJ;AAEA,MAAA,IAAA,CAAK,QAAQ,GAAA,CAAI;AAAA,QACb,QAAA;AAAA,QACA,SAAA,EAAW,kBAAA;AAAA,QACX,MAAA;AAAA,QACA,OAAA,EAAS;AAAA,OACZ,CAAA;AAAA,IACL,SAAS,GAAA,EAAK;AACV,MAAA,IAAI,OAAO,OAAA,EAAS;AAChB,QAAA,WAAA,CAAY,kBAAA,CAAmB,UAAU,4BAA4B,CAAA;AACrE,QAAA;AAAA,MACJ;AACA,MAAA,MAAM,KAAA,GAAQ,eAAe,KAAA,GAAQ,GAAA,GAAM,IAAI,KAAA,CAAM,MAAA,CAAO,GAAG,CAAC,CAAA;AAChE,MAAA,IAAA,CAAK,QAAQ,GAAA,CAAI;AAAA,QACb,QAAA;AAAA,QACA,SAAA,EAAW,kBAAA;AAAA,QACX,MAAA;AAAA,QACA,OAAA,EAAS,IAAA;AAAA,QACT;AAAA,OACH,CAAA;AAAA,IACL;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAc,KAAA,EAAe,OAAA,GAAiC,EAAE,SAAA,EAAW,YAAW,EAAkB;AAOpG,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,WAAA,CAAY,gBAAA;AACzC,IAAA,IAAI,UAAA,CAAW,KAAA,EAAO,QAAQ,CAAA,GAAI,QAAA,EAAU;AACxC,MAAA,MAAM,YAAA,CAAa,SAAA;AAAA,QACf,oBAAA;AAAA,QACA,CAAA,4BAAA,EAA+B,QAAA,CAAS,cAAA,CAAe,OAAO,CAAC,CAAA,6DAAA,CAAA;AAAA,QAC/D,EAAE,QAAA;AAAS,OACf;AAAA,IACJ;AAKA,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,YAAA,CAAa,KAAK,CAAA;AACjD,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,kBAAA,CAAmB,WAAW,CAAA;AAE1D,IAAA,MAAM,MAAA,GAAwB;AAAA,MAC1B,KAAA,EAAO,cAAA;AAAA,MACP,YAAY,cAAA,CAAe,MAAA;AAAA,MAC3B,QAAQ;AAAC,KACb;AAGA,IAAA,KAAA,MAAW,QAAQ,cAAA,EAAgB;AAC/B,MAAA,IAAI,KAAK,KAAA,EAAO;AACZ,QAAA,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,KAAA,EAAQ,IAAA,CAAK,UAAU,CAAA,EAAA,EAAK,IAAA,CAAK,KAAK,CAAA,CAAE,CAAA;AAAA,MAC/D;AACA,MAAA,KAAA,MAAW,KAAA,IAAS,KAAK,YAAA,EAAc;AACnC,QAAA,IAAI,MAAM,KAAA,EAAO;AACb,UAAA,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,KAAA,EAAQ,IAAA,CAAK,UAAU,CAAA,EAAA,EAAK,KAAA,CAAM,KAAK,CAAA,CAAE,CAAA;AAAA,QAChE;AAAA,MACJ;AAAA,IACJ;AAEA,IAAA,MAAM,kBAAA,GAAqB,QAAQ,kBAAA,IAAsB,KAAA;AACzD,IAAA,IAAI,kBAAA,EAAoB;AACpB,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,kBAAA,CAAmB,cAAA,EAAe;AACvD,MAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG;AACpB,QAAA,MAAA,CAAO,WAAA,GAAc,OAAA,CAAQ,CAAC,CAAA,CAAE,MAAA,EAAO;AAAA,MAC3C;AAAA,IACJ;AAEA,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA,cAAc,KAAA,EAA+B;AAGzC,IAAA,MAAM,YAAA,GAAe,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AACpC,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,YAAA,CAAa,YAAY,CAAA;AACxD,IAAA,OAAO,IAAA,CAAK,mBAAmB,WAAW,CAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,mBAAmB,WAAA,EAA6C;AACpE,IAAA,MAAM,SAAuB,EAAC;AAE9B,IAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AAClC,MAAA,MAAM,WAAW,UAAA,CAAW,IAAA;AAC5B,MAAA,MAAM,aAAa,UAAA,CAAW,UAAA;AAC9B,MAAA,MAAM,gBAAgB,UAAA,CAAW,WAAA;AACjC,MAAA,MAAM,cAAc,UAAA,CAAW,SAAA;AAC/B,MAAA,MAAM,OAAA,GAAU,WAAW,cAAA,CAAe,IAAA;AAC1C,MAAA,MAAM,YAAA,GAAsC,UAAA,CAAW,YAAA,CAAa,GAAA,CAAI,CAAA,CAAA,MAAM;AAAA,QAC1E,OAAO,CAAA,CAAE,KAAA;AAAA,QACT,KAAK,CAAA,CAAE,GAAA;AAAA,QACP,YAAY,CAAA,CAAE,UAAA;AAAA,QACd,UAAA;AAAA,QACA,cAAc,CAAA,CAAE;AAAA,OACpB,CAAE,CAAA;AACF,MAAA,MAAM,eAAA,GAAkB,aAAa,MAAA,GAAS,CAAA;AAE9C,MAAA,MAAM,UAAA,GAAyB;AAAA,QAC3B,UAAA;AAAA,QACA,IAAA,EAAM,QAAA;AAAA,QACN,aAAA;AAAA,QACA,WAAA;AAAA,QACA,OAAA;AAAA,QACA,eAAA;AAAA,QACA,YAAA;AAAA,QACA,UAAA,EAAY,IAAA;AAAA,QACZ,MAAA,EAAQ,IAAA;AAAA,QACR,KAAA,EAAO;AAAA,OACX;AAEA,MAAA,IAAI,CAAC,OAAA,EAAS;AACV,QAAA,MAAM,oBAAA,GAAuB,QAAA,CAAS,IAAA,EAAK,CAAE,WAAW,GAAG,CAAA;AAE3D,QAAA,IAAI,eAAA,IAAmB,CAAC,oBAAA,EAAsB;AAC1C,UAAA,KAAA,MAAW,SAAS,YAAA,EAAc;AAC9B,YAAA,IAAI;AACA,cAAA,MAAM,MAAA,GAAS,IAAA,CAAK,YAAA,CAAa,UAAA,EAAY,MAAM,UAAU,CAAA;AAC7D,cAAA,KAAA,CAAM,MAAA,GAAS,OAAO,CAAC,CAAA;AAAA,YAC3B,SAAS,KAAA,EAAO;AACZ,cAAA,MAAM,eAAe,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AAC1E,cAAA,KAAA,CAAM,KAAA,GAAQ,YAAA;AAAA,YAClB;AAAA,UACJ;AAAA,QACJ,CAAA,MAAO;AACH,UAAA,MAAM,UAAA,GAAa,SAAS,IAAA,EAAK;AACjC,UAAA,IAAI,UAAA,EAAY;AAEZ,YAAA,IAAI;AACA,cAAA,MAAM,SAAS,IAAA,CAAK,4BAAA;AAAA,gBAChB,UAAA;AAAA,gBACA,UAAA;AAAA,gBACA,UAAA,CAAW;AAAA,eACf;AACA,cAAA,UAAA,CAAW,UAAA,GAAa,UAAA;AACxB,cAAA,UAAA,CAAW,MAAA,GAAS,OAAO,CAAC,CAAA;AAAA,YAChC,SAAS,KAAA,EAAO;AACZ,cAAA,MAAM,eAAe,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AAC1E,cAAA,UAAA,CAAW,KAAA,GAAQ,YAAA;AAAA,YACvB;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAEA,MAAA,MAAA,CAAO,KAAK,UAAU,CAAA;AAAA,IAC1B;AAEA,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,4BAAA,CACJ,UAAA,EACA,UAAA,EACA,YAAA,EACO;AAIP,IAAA,MAAM,SAAkB,EAAC;AACzB,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,KAAA,MAAW,KAAK,YAAA,EAAc;AAC1B,MAAA,IAAI,EAAE,IAAA,KAAS,QAAA,IAAY,CAAA,CAAE,IAAA,KAAS,UAAU,SAAA,GAAY,IAAA;AAC5D,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,IACjB;AAGA,IAAA,OAAO,CAAC,IAAA,CAAK,kBAAA,CAAmB,YAAY,UAAA,EAAY,MAAA,EAAQ,SAAS,CAAC,CAAA;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBQ,eAAA,CAAgB,OAAA,EAA0B,MAAA,EAAiB,SAAA,EAAqB,qBAAqB,IAAA,EAAY;AACrH,IAAA,IAAA,CAAK,MAAA,CAAO,WAAW,OAAO,CAAA;AAI9B,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,MAAA,EAAQ,IAAA,CAAK,OAAO,UAAA,CAAW,iBAAA,GAAoB,YAAY,KAAK,CAAA;AACrF,IAAA,IAAA,CAAK,MAAA,CAAO,gBAAgB,CAAC,CAAA;AAW7B,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,IAAA,EAAK;AAClC,IAAA,IAAI,QAAA,EAAU;AAcV,MAAA,IAAI,QAAA,CAAS,SAAS,QAAA,IAAY,CAAC,KAAK,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,EAAG;AACtD,QAAA;AAAA,MACJ;AAiCA,MAAA,KAAA,IAAS,CAAA,GAAI,qBAAqB,MAAA,CAAO,MAAA,GAAS,IAAI,CAAA,EAAG,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AAClE,QAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,OAAA,EAAS;AAChC,QAAA,IAAI,CAAA,GAAI,CAAA,IAAK,MAAA,CAAO,MAAA,EAAQ;AAW5B,QAAA,IAAI,iBAAA,GAAoB,IAAA;AACxB,QAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AACxB,UAAA,MAAM,IAAA,GAAO,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA;AACvB,UAAA,IAAI,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,OAAA,EAAS;AACvC,YAAA,iBAAA,GAAoB,KAAA;AACpB,YAAA;AAAA,UACJ;AAAA,QACJ;AACA,QAAA,IAAI,iBAAA,EAAmB;AAKnB,UAAA,MAAM,OAAA,GAAU,MAAA,CAAO,KAAA,CAAM,CAAA,EAAG,IAAI,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,CAAA,CAAE,KAAK,EAAE,CAAA;AAClE,UAAA,MAAM,YAAA,CAAa,OAAA;AAAA,YACf,sBAAA;AAAA,YACA,IAAI,OAAO,CAAA,qBAAA,CAAA;AAAA,YACX,EAAE,SAAA,EAAW,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,EAAM,YAAY,OAAA;AAAQ,WACrD;AAAA,QACJ;AAEA,QAAA,OAAA,CAAQ,KAAA,EAAM;AACd,QAAA,IAAI;AAoBA,UAAA,IAAA,CAAK,eAAA,CAAgB,SAAS,MAAA,CAAO,KAAA,CAAM,IAAI,CAAC,CAAA,EAAG,WAAW,KAAK,CAAA;AACnE,UAAA;AAAA,QACJ,CAAA,CAAA,MAAQ;AAAA,QAGR;AAAA,MACJ;AAEA,MAAA,MAAM,YAAA,CAAa,OAAA;AAAA,QACf,2BAAA;AAAA,QACA,CAAA,oCAAA,EAAuC,SAAS,KAAK,CAAA,CAAA,CAAA;AAAA,QACrD,EAAE,SAAA,EAAW,QAAA,CAAS,IAAA,EAAM,UAAA,EAAY,SAAS,KAAA;AAAM,OAC3D;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,aAAa,MAAA,EAAkC;AACnD,IAAA,MAAM,OAAA,GAAU,IAAI,eAAA,EAAgB;AACpC,IAAA,IAAA,CAAK,eAAA,CAAgB,SAAS,MAAM,CAAA;AACpC,IAAA,OAAO,QAAQ,KAAA,EAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBQ,uBAAA,CAAwB,OAAA,EAA0B,UAAA,GAAqB,EAAA,EAAW;AACtF,IAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,OAAA,EAAS,IAAA,CAAK,EAAA,EAAI,MAAA,EAAW,MAAA,EAAW,IAAA,CAAK,eAAA,CAAgB,UAAU,CAAA,EAAG,IAAI,CAAA;AAC7G,IAAA,IAAI,MAAA,CAAO,IAAA,KAAS,OAAA,EAAS,MAAM,MAAA,CAAO,KAAA;AAC1C,IAAA,IAAI,MAAA,CAAO,SAAS,SAAA,EAAW;AAC3B,MAAA,MAAM,YAAA,CAAa,SAAA;AAAA,QACf,6BAAA;AAAA,QACA,CAAA,wFAAA;AAAA,OACJ;AAAA,IACJ;AACA,IAAA,OAAO,MAAA,CAAO,KAAA;AAAA,EAClB;AAAA;AAAA,EAGQ,oBAAA,CAAqB,MAAA,EAAiB,UAAA,GAAqB,EAAA,EAAW;AAC1E,IAAA,OAAO,KAAK,uBAAA,CAAwB,IAAA,CAAK,YAAA,CAAa,MAAM,GAAG,UAAU,CAAA;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBQ,iBAAiB,MAAA,EAAkC;AACvD,IAAA,IAAI,OAAO,MAAA,KAAW,CAAA,IAAK,OAAO,MAAA,GAAS,CAAA,KAAM,GAAG,OAAO,IAAA;AAC3D,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACpC,MAAA,IAAI,CAAA,GAAI,MAAM,CAAA,EAAG;AACb,QAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,OAAA,IAAW,OAAO,CAAC,CAAA,CAAE,IAAA,KAAS,MAAA,EAAQ,OAAO,IAAA;AACpE,QAAA,KAAA,CAAM,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,CAAE,KAAK,CAAA;AAAA,MAC9B,CAAA,MAAO;AACH,QAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,QAAQ,OAAO,IAAA;AAAA,MAC1C;AAAA,IACJ;AACA,IAAA,OAAO,KAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,aAAA,CAAc,QAAA,EAAuB,UAAA,GAAqB,EAAA,EAAW;AACzE,IAAA,MAAM,eAAwB,EAAC;AAC/B,IAAA,KAAA,MAAW,IAAA,IAAQ,SAAS,WAAA,EAAa;AACrC,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,IAAI,CAAA;AAC7B,MAAA,IAAI,MAAM,MAAA,EAAW;AACjB,QAAA,OAAO,UAAA;AAAA,UACH,2BAAA;AAAA,UACA,CAAA,kBAAA,EAAqB,QAAA,CAAS,QAAQ,CAAA,IAAA,EAAO,IAAI,CAAA,qBAAA;AAAA,SACrD;AAAA,MACJ;AACA,MAAA,IAAI,EAAE,IAAA,KAAA,CAAA,eAA2B;AAC7B,QAAA,OAAO,UAAA;AAAA,UACH,4BAAA;AAAA,UACA,CAAA,kBAAA,EAAqB,QAAA,CAAS,QAAQ,CAAA,IAAA,EAAO,IAAI,CAAA,gDAAA;AAAA,SACrD;AAAA,MACJ;AACA,MAAA,YAAA,CAAa,KAAK,CAAC,CAAA;AAAA,IACvB;AAEA,IAAA,IAAI,QAAA,GAAW,YAAA,CAAa,CAAC,CAAA,CAAE,KAAA;AAC/B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,YAAA,CAAa,QAAQ,CAAA,EAAA,EAAK;AAC1C,MAAA,MAAM,UAAU,cAAA,CAAe,QAAA,EAAU,YAAA,CAAa,CAAC,EAAE,KAAmB,CAAA;AAC5E,MAAA,IAAI,OAAA,CAAQ,yBAA0B,OAAO,OAAA;AAC7C,MAAA,QAAA,GAAW,OAAA,CAAQ,KAAA;AAAA,IACvB;AAEA,IAAA,MAAM,GAAA,GAAM,QAAQ,QAAQ,CAAA;AAC5B,IAAA,IAAI,GAAA,CAAI,yBAA0B,OAAO,GAAA;AAEzC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,uBAAA,CAAwB,QAAA,CAAS,YAAY,UAAU,CAAA;AAC7E,IAAA,IAAI,SAAS,IAAA,KAAA,CAAA,eAA2B;AACpC,MAAA,OAAO,UAAA;AAAA,QACH,yBAAA;AAAA,QACA,CAAA,kBAAA,EAAqB,SAAS,QAAQ,CAAA,wCAAA;AAAA,OAC1C;AAAA,IACJ;AAEA,IAAA,OAAO,cAAA,CAAe,GAAA,CAAI,KAAA,EAAqB,QAAA,CAAS,KAAmB,CAAA;AAAA,EAC/E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiCQ,kBAAA,CAAmB,gBAAA,EAA2B,UAAA,GAAqB,EAAA,EAAkB;AACzF,IAAA,IAAI,gBAAA,CAAiB,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAE1C,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,gBAAA,CAAiB,MAAA,GAAS,CAAC,CAAA;AACzD,IAAA,IAAI,IAAA,CAAK,SAAS,WAAA,EAAa;AAC3B,MAAA,MAAM,YAAA,GAAe,gBAAA,CAAiB,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACjD,MAAA,IAAI,YAAA,CAAa,WAAW,CAAA,EAAG;AAC3B,QAAA,MAAM,YAAA,CAAa,OAAA,CAAQ,+BAAA,EAAiC,CAAA,oDAAA,CAAsD,CAAA;AAAA,MACtH;AACA,MAAA,IAAI,YAAA,CAAa,MAAA,KAAW,CAAA,KAAM,YAAA,CAAa,CAAC,CAAA,CAAE,IAAA,KAAS,OAAA,IAAW,YAAA,CAAa,CAAC,CAAA,CAAE,IAAA,KAAS,MAAA,CAAA,EAAS;AAIpG,QAAA,MAAM,IAAA,GAAO,YAAA,CAAa,CAAC,CAAA,CAAE,KAAA;AAC7B,QAAA,MAAM,QAAA,GAAW,IAAA,CAAK,EAAA,CAAG,WAAA,CAAY,IAAI,CAAA;AACzC,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,EAAA,CAAG,iBAAA,CAAkB,IAAI,CAAA;AAC7C,QAAA,IAAI,QAAA,EAAU;AACV,UAAA,MAAM,MAAA,GAAS,IAAA,CAAK,aAAA,CAAc,QAAA,EAAU,UAAU,CAAA;AAStD,UAAA,MAAM,WAAA,GAAc,MAAA,CAAO,IAAA,KAAA,EAAA,gBAA4B,MAAA,CAAO,KAAA,KAAU,4BAAA;AACxE,UAAA,IAAI,CAAC,WAAA,IAAe,CAAC,MAAA,EAAQ,OAAO,MAAA;AAAA,QACxC;AACA,QAAA,IAAI,MAAA,EAAQ;AACR,UAAA,OAAO,IAAA,CAAK,mBAAA,CAAoB,MAAA,EAAQ,UAAU,CAAA;AAAA,QACtD;AAAA,MACJ;AACA,MAAA,OAAO,IAAA,CAAK,oBAAA,CAAqB,YAAA,EAAc,UAAU,CAAA;AAAA,IAC7D;AASA,IAAA,IAAI,oBAAA,CAAqB,gBAAgB,CAAA,EAAG;AACxC,MAAA,OAAO,IAAA,CAAK,oBAAA,CAAqB,gBAAA,EAAkB,UAAU,CAAA;AAAA,IACjE;AAIA,IAAA,IAAI,gBAAA,CAAiB,CAAC,CAAA,CAAE,IAAA,KAAS,OAAA,IAAW,iBAAiB,CAAC,CAAA,CAAE,IAAA,KAAS,QAAA,EAAU,OAAO,IAAA;AAE1F,IAAA,MAAM,QAAQ,gBAAA,CAAiB,SAAA,CAAU,CAAA,CAAA,KAAK,CAAA,CAAE,SAAS,QAAQ,CAAA;AACjE,IAAA,IAAI,KAAA,KAAU,IAAI,OAAO,IAAA;AAEzB,IAAA,MAAM,QAAQ,IAAA,CAAK,gBAAA,CAAiB,iBAAiB,KAAA,CAAM,CAAA,EAAG,KAAK,CAAC,CAAA;AACpE,IAAA,IAAI,UAAU,IAAA,EAAM;AAKhB,MAAA,OAAO,IAAA,CAAK,sBAAA,CAAuB,gBAAA,EAAkB,KAAK,CAAA;AAAA,IAC9D;AAEA,IAAA,MAAM,SAAA,GAAY,gBAAA,CAAiB,KAAA,CAAM,KAAA,GAAQ,CAAC,CAAA;AAElD,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACpB,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,oBAAA,CAAqB,SAAA,EAAW,UAAU,CAAA;AAC9D,MAAA,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,KAAA,CAAM,CAAC,GAAG,MAAM,CAAA;AAC/B,MAAA,OAAO,MAAA;AAAA,IACX;AAEA,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACtC,IAAA,MAAM,WAAA,GAAc,KAAA,CAAM,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACrC,IAAA,IAAA,CAAK,GAAG,cAAA,CAAe,OAAA,EAAS,aAAa,IAAA,CAAK,YAAA,CAAa,SAAS,CAAC,CAAA;AAOzE,IAAA,IAAA,CAAK,EAAA,CAAG,oBAAA,CAAqB,OAAA,EAAS,IAAA,CAAK,aAAa,gBAAA,CAAiB,KAAA,CAAM,CAAA,EAAG,KAAK,CAAC,CAAA,EAAG,IAAA,CAAK,YAAA,CAAa,SAAS,CAAC,CAAA;AACvH,IAAA,OAAO,WAAA,CAAY,CAAA,EAAG,OAAO,CAAA,0CAAA,EAAwC,OAAO,CAAA,IAAA,CAAM,CAAA;AAAA,EACtF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgCQ,sBAAA,CAAuB,kBAA2B,KAAA,EAA6B;AACnF,IAAA,IAAI,gBAAA,CAAiB,CAAC,CAAA,EAAG,IAAA,KAAS,UAAU,OAAO,IAAA;AACnD,IAAA,IAAI,UAAU,CAAA,IAAK,KAAA,KAAU,gBAAA,CAAiB,MAAA,GAAS,GAAG,OAAO,IAAA;AAEjE,IAAA,MAAM,SAAA,GAAY,gBAAA,CAAiB,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA;AACjD,IAAA,MAAM,SAAA,GAAY,gBAAA,CAAiB,KAAA,CAAM,KAAA,GAAQ,CAAC,CAAA;AAClD,IAAA,IAAI,UAAU,IAAA,CAAK,CAAA,CAAA,KAAK,EAAE,IAAA,KAAS,QAAQ,GAAG,OAAO,IAAA;AAErD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,gBAAA,CAAiB,SAAA,EAAW,SAAS,CAAA;AAC3D,IAAA,IAAI,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAElC,IAAA,MAAM,QAAA,GAAW,SAAS,CAAC,CAAA;AAC3B,IAAA,IAAA,CAAK,EAAA,CAAG,oBAAA,CAAqB,QAAA,EAAU,IAAA,CAAK,YAAA,CAAa,SAAS,CAAA,EAAG,IAAA,CAAK,YAAA,CAAa,SAAS,CAAC,CAAA;AACjG,IAAA,OAAO,WAAA,CAAY,CAAA,EAAG,QAAQ,CAAA,0CAAA,EAAwC,QAAQ,CAAA,IAAA,CAAM,CAAA;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeQ,gBAAA,CAAiB,WAAoB,SAAA,EAA8B;AACvE,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,KAAA,MAAW,SAAS,CAAC,GAAG,SAAA,EAAW,GAAG,SAAS,CAAA,EAAG;AAC9C,MAAA,IAAI,KAAA,CAAM,IAAA,KAAS,OAAA,IAAW,KAAA,CAAM,SAAS,MAAA,EAAQ;AACrD,MAAA,IAAI,KAAK,EAAA,CAAG,MAAA,CAAO,KAAA,CAAM,KAAK,MAAM,MAAA,EAAW;AAC/C,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,eAAA,CAAgB,KAAA,CAAM,KAAK,CAAA,EAAG;AAC1C,MAAA,IAAI,CAAC,SAAS,QAAA,CAAS,KAAA,CAAM,KAAK,CAAA,EAAG,QAAA,CAAS,IAAA,CAAK,KAAA,CAAM,KAAK,CAAA;AAAA,IAClE;AACA,IAAA,OAAO,QAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,mBAAA,CAAoB,QAAA,EAA6B,UAAA,GAAqB,EAAA,EAAW;AACrF,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,uBAAA,CAAwB,QAAA,CAAS,YAAY,UAAU,CAAA;AACxE,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,uBAAA,CAAwB,QAAA,CAAS,YAAY,UAAU,CAAA;AACxE,IAAA,OAAO,mBAAA,CAAoB,GAAA,EAAK,GAAA,EAAK,QAAA,CAAS,QAAQ,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeQ,WAAA,CAAY,YAAoB,OAAA,EAAuE;AAC3G,IAAA,MAAM,SAAkB,EAAC;AACzB,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,IAAA,CAAK,KAAA,CAAM,gBAAgB,UAAU,CAAA;AACrC,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,KAAA,EAAO;AACxB,MAAA,IAAI,CAAA,CAAE,SAAS,SAAA,EAAW;AAC1B,MAAA,IAAI,EAAE,IAAA,KAAS,QAAA,IAAY,CAAA,CAAE,IAAA,KAAS,UAAU,SAAA,GAAY,IAAA;AAC5D,MAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AACb,MAAA,OAAA,GAAU,CAAC,CAAA;AAAA,IACf;AACA,IAAA,OAAO,EAAE,QAAQ,SAAA,EAAU;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqDQ,kBACJ,UAAA,EACA,MAAA,EACA,SAAA,EACA,QAAA,EACA,aAAqB,EAAA,EAKiD;AAEtE,IAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,UAAA,EAAY,IAAA,CAAK,OAAO,UAAU,CAAA;AAC5E,IAAA,IAAI,CAAC,YAAY,MAAA,EAAQ;AACrB,MAAA,OAAO,EAAE,MAAM,OAAA,EAAS,KAAA,EAAO,UAAU,KAAA,EAAO,WAAA,CAAY,MAAO,WAAA,EAAa;AAAA,IACpF;AAGA,IAAA,MAAM,aAAa,MAAA,CAAO,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,SAAS,SAAS,CAAA;AAC1D,IAAA,IAAI,UAAA,CAAW,WAAW,CAAA,EAAG;AACzB,MAAA,OAAO,EAAE,MAAM,OAAA,EAAQ;AAAA,IAC3B;AAIA,IAAA,MAAM,gBAAA,GAAmB,IAAA,CAAK,UAAA,CAAW,SAAA,CAAU,YAAY,QAAQ,CAAA;AAGvE,IAAA,MAAM,eAAA,GAAkB,yBAAA,CAA0B,gBAAA,EAAkB,IAAA,CAAK,OAAO,UAAU,CAAA;AAC1F,IAAA,IAAI,CAAC,gBAAgB,MAAA,EAAQ;AACzB,MAAA,OAAO,EAAE,MAAM,OAAA,EAAS,KAAA,EAAO,cAAc,KAAA,EAAO,eAAA,CAAgB,aAAc,gBAAA,EAAiB;AAAA,IACvG;AAeA,IAAA,IAAI,cAAA;AACJ,IAAA,IAAI;AACA,MAAA,cAAA,GAAiB,IAAA,CAAK,kBAAA,CAAmB,gBAAA,EAAkB,UAAU,CAAA;AAAA,IACzE,SAAS,CAAA,EAAG;AAKR,MAAA,MAAM,EAAE,KAAA,EAAAE,MAAAA,EAAO,QAAAC,OAAAA,EAAO,GAAI,sBAAsB,gBAAgB,CAAA;AAChE,MAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,OAAA,EAAS,KAAA,EAAO,qBAAA,CAAsB,CAAC,CAAA,EAAG,KAAA,EAAAD,MAAAA,EAAO,MAAA,EAAAC,SAAQ,gBAAA,EAAiB;AAAA,IAC7G;AACA,IAAA,IAAI,mBAAmB,IAAA,EAAM;AACzB,MAAA,OAAO,EAAE,IAAA,EAAM,gBAAA,EAAkB,gBAAA,EAAkB,OAAO,cAAA,EAAe;AAAA,IAC7E;AAEA,IAAA,MAAM,EAAE,KAAA,EAAO,MAAA,EAAO,GAAI,sBAAsB,gBAAgB,CAAA;AAGhE,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,UAAU,CAAA;AACvD,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,OAAO,EAAE,MAAM,OAAA,EAAS,gBAAA,EAAkB,OAAO,MAAA,EAAQ,OAAA,EAAS,aAAA,EAAe,MAAA,EAAQ,IAAA,EAAK;AAAA,IAClG;AAGA,IAAA,MAAM,UAAU,IAAA,CAAK,WAAA,CAAY,KAAK,gBAAA,EAAA,GAAqB,IAAA,CAAK,YAAY,MAAM,CAAA;AAClF,IAAA,OAAA,CAAQ,KAAA,EAAM;AACd,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI,WAAA,GAAsC,IAAA;AAC1C,IAAA,IAAI;AAMA,MAAA,MAAM,WAAA,GAAc,iBAAA,CAAkB,KAAA,CAAM,QAAA,EAAU,MAAM;AACxD,QAAA,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,gBAAA,EAAkB,SAAS,CAAA;AACzD,QAAA,OAAO,QAAQ,KAAA,EAAM;AAAA,MACzB,CAAC,CAAA;AACD,MAAA,OAAA,GAAU,WAAA,CAAY,MAAA;AACtB,MAAA,WAAA,GAAc,WAAA,CAAY,KAAA;AAAA,IAC9B,SAAS,CAAA,EAAG;AASR,MAAA,OAAO,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,OAAA,EAAS,KAAA,EAAO,qBAAA,CAAsB,CAAC,CAAA,EAAG,KAAA,EAAO,MAAA,EAAQ,gBAAA,EAAiB;AAAA,IAC7G;AAEA,IAAA,IAAA,CAAK,aAAA,CAAc,YAAY,OAAO,CAAA;AACtC,IAAA,OAAO,EAAE,MAAM,OAAA,EAAS,gBAAA,EAAkB,OAAO,MAAA,EAAQ,OAAA,EAAS,MAAA,EAAQ,KAAA,EAAO,WAAA,EAAY;AAAA,EACjG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BQ,eACJ,gBAAA,EACA,OAAA,EACA,UAAA,EACA,UAAA,EACA,OACA,MAAA,EACuD;AACvD,IAAA,IAAI,EAAE,OAAA,CAAQ,QAAA,IAAY,IAAA,CAAK,gBAAA,CAAiB,OAAO,CAAA,CAAA,EAAI;AACvD,MAAA,OAAO,EAAE,MAAM,SAAA,EAAU;AAAA,IAC7B;AAMA,IAAA,MAAM,mBAAA,GAAsB,IAAI,eAAA,EAAgB;AAChD,IAAA,MAAM,cAAA,GAAiB,MAAM,mBAAA,CAAoB,KAAA,EAAM;AACvD,IAAA,IAAA,CAAK,iBAAiB,gBAAA,CAAiB,OAAA,EAAS,gBAAgB,EAAE,IAAA,EAAM,MAAM,CAAA;AAE9E,IAAA,WAAA,CAAY,uBAAuB,gBAAgB,CAAA;AACnD,IAAA,IAAI,KAAK,eAAA,EAAiB;AACtB,MAAA,WAAA,CAAY,aAAa,gBAAgB,CAAA;AAAA,IAC7C;AAEA,IAAA,MAAM,kBAAkB,mBAAA,CAAoB,MAAA;AAC5C,IAAA,MAAM,UAAA,GAAa,KAAK,gBAAA,CAAiB,YAAA;AAAA,MACrC,gBAAA;AAAA,MAAkB,OAAA;AAAA,MAAS,SAAA;AAAA,MAAW,eAAA;AAAA,MAAiB,IAAA,CAAK;AAAA,KAChE;AACA,IAAA,IAAI,UAAA,EAAY;AAEZ,MAAA,KAAK,KAAK,YAAA,CAAa;AAAA,QACnB,IAAA,EAAM,SAAA;AAAA,QACN,UAAU,UAAA,CAAW,QAAA;AAAA,QACrB,UAAU,UAAA,CAAW,QAAA;AAAA,QACrB,SAAA,EAAW,WAAW,SAAA,IAAa,SAAA;AAAA,QACnC,QAAQ,UAAA,CAAW;AAAA,OACtB,CAAA;AAGD,MAAA,IAAA,CAAK,GAAA,CAAI,gCAAA;AAAA,QACL,UAAA;AAAA,QACA,WAAW,SAAA,IAAa,SAAA;AAAA,QACxB,CAAC,WAAW,QAAQ;AAAA,OACxB;AAEA,MAAA,MAAM,OAAA,GAAU,YAAA,CAAa,UAAA,CAAW,QAAQ,CAAA;AAChD,MAAA,IAAA,CAAK,gBAAgB,UAAA,EAAY,OAAA,EAAS,OAAA,EAAS,KAAA,EAAO,QAAQ,UAAU,CAAA;AAC5E,MAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,OAAA,EAAQ;AAAA,IAC7C;AAGA,IAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,cAAc,CAAA;AACjE,IAAA,OAAO,EAAE,MAAM,SAAA,EAAU;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBQ,kBAAA,CACJ,UAAA,EACA,UAAA,EACA,MAAA,EACA,SAAA,EACK;AACL,IAAA,MAAM,OAAO,IAAA,CAAK,iBAAA,CAAkB,YAAY,MAAA,EAAQ,SAAA,EAAW,QAAW,UAAU,CAAA;AAExF,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACvB,MAAA,MAAM,CAAA,GAAI,YAAY,CAAC,CAAA;AACvB,MAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,UAAA,EAAY,IAAI,cAAA,CAAe,CAAA,EAAG,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,EAAC,EAAG,IAAI,CAAA,EAAG,UAAU,CAAA;AACtK,MAAA,OAAO,CAAA;AAAA,IACX;AACA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AAMvB,MAAA,MAAM,IAAA,CAAK,KAAA;AAAA,IACf;AACA,IAAA,IAAI,IAAA,CAAK,SAAS,gBAAA,EAAkB;AAQhC,MAAA,IAAA,CAAK,eAAA,CAAgB,UAAA,EAAY,IAAA,CAAK,KAAA,EAAO,EAAE,SAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,aAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,EAAC,EAAG,EAAC,EAAG,UAAU,CAAA;AAC3J,MAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IAChB;AAEA,IAAA,MAAM,EAAE,gBAAA,EAAkB,KAAA,EAAO,MAAA,EAAQ,SAAQ,GAAI,IAAA;AAGrD,IAAA,MAAM,SAAA,GAAY,KAAK,cAAA,CAAe,gBAAA,EAAkB,SAAS,UAAA,EAAY,UAAA,EAAY,OAAO,MAAM,CAAA;AACtG,IAAA,IAAI,SAAA,CAAU,SAAS,SAAA,EAAW;AAC9B,MAAA,OAAO,SAAA,CAAU,KAAA;AAAA,IACrB;AAIA,IAAA,OAAO,KAAK,eAAA,CAAgB,OAAA,EAAS,YAAY,UAAA,EAAY,KAAA,EAAO,QAAQ,SAAS,CAAA;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcH,YAAA,CACO,YACA,QAAA,EACW;AACX,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,oBAAA,CAAqB,UAAA,EAAY,QAAQ,CAAA;AAC/D,IAAA,OAAO,QAAA,CAAS,OAAO,KAAA,EAAM;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,oBAAA,CAAqB,YAAoB,QAAA,EAAkC;AACvE,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,qBAAA,CAAsB,UAAA,EAAY,QAAQ,CAAA;AAC9D,IAAA,IAAI,OAAO,KAAA,EAAO;AAQd,MAAA,IAAI,OAAO,WAAA,EAAa;AACpB,QAAA,MAAM,MAAA,CAAO,WAAA;AAAA,MACjB;AACA,MAAA,MAAM,YAAA,CAAa,SAAA;AAAA,QACf,kBAAA;AAAA,QACA,MAAA,CAAO,KAAA;AAAA,QACP,EAAE,UAAA;AAAW,OACjB;AAAA,IACJ;AACA,IAAA,OAAO,EAAE,MAAA,EAAQ,CAAC,YAAY,MAAA,CAAO,KAAK,CAAC,CAAA,EAAE;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,qBAAA,CACI,UAAA,EACA,QAAA,EACA,SAAA,GAAoB,YAAA,EAC0L;AAC9M,IAAA,MAAM,gBAAA,GAAmB,QAAA,CAAS,KAAA,CAAM,cAAc,CAAA;AACtD,IAAA,IAAI,gBAAA,EAAkB;AAClB,MAAA,MAAM,UAAA,GAAa,iBAAiB,CAAC,CAAA;AACrC,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,gCAAA,CAAiC,UAAA,EAAY,YAAY,SAAS,CAAA;AACtF,MAAA,OAAO;AAAA,QACH,GAAG,MAAA;AAAA,QACH,WAAA,EAAa;AAAA,UACT,KAAA,EAAO,CAAA;AAAA,UACP,KAAK,QAAA,CAAS,MAAA;AAAA,UACd,UAAA;AAAA,UACA,UAAA;AAAA,UACA,YAAA,EAAc;AAAA;AAClB,OACJ;AAAA,IACJ;AACA,IAAA,OAAO,IAAA,CAAK,gCAAA,CAAiC,QAAA,EAAU,UAAA,EAAY,SAAS,CAAA;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgCQ,kBAAA,CACJ,QACA,KAAA,EACA,KAAA,EACA,MACA,UAAA,EACA,UAAA,EACA,SAAA,EACA,OAAA,EACA,MAAA,EACI;AACJ,IAAA,MAAA,CAAO,IAAA,CAAK,EAAE,KAAA,EAAO,KAAA,EAAO,IAAA,EAAM,YAAY,UAAA,EAAY,SAAA,EAAW,OAAA,EAAS,MAAA,EAAQ,CAAA;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkEQ,gCAAA,CAAiC,UAAA,EAAoB,UAAA,EAAoB,SAAA,GAAoB,YAAA,EAA2L;AAC5R,IAAA,MAAM,WAAW,IAAA,CAAK,kBAAA;AACtB,IAAA,MAAM,gBAAgB,QAAA,CAAS,aAAA;AAI/B,IAAA,MAAM,eAAA,GAAkB,IAAA,CAAK,iBAAA,EAAmB,kBAAA,IAAsB,CAAA;AACtE,IAAA,MAAM,YAAA,GAAe,kBAAkB,SAAA,EAAU;AACjD,IAAA,MAAM,cAAiC,EAAC;AACxC,IAAA,MAAM,SAAgC,EAAC;AACvC,IAAA,MAAM,WAAA,GAAc,CAAA;AAGpB,IAAA,MAAM,WAAA,GAAc,qBAAA,CAAsB,UAAA,EAAY,IAAA,CAAK,OAAO,UAAU,CAAA;AAC5E,IAAA,IAAI,CAAC,YAAY,MAAA,EAAQ;AACrB,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,eAAA,EAAiB,gBAAA,EAAkB,mBAAO,UAAA,EAAY,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,UACzG,IAAA,EAAM,eAAA;AAAA,UACN,MAAA,EAAQ,KAAA;AAAA,UACR,kBAAkB,UAAA,CAAW,MAAA;AAAA,UAC7B,SAAA,EAAW,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,mBAAA;AAAA,UAClC,YAAA,EAAc,YAAY,KAAA,CAAO;AAAA,SACpC,CAAA;AAAA,MACL;AACA,MAAA,OAAO,EAAE,GAAG,WAAA,CAAY,OAAQ,KAAA,EAAO,MAAA,EAAW,YAAY,MAAA,EAAU;AAAA,IAC5E;AAGA,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,QAAA,CAAS,iBAAA,CAAkB;AAAA,QACvB,MAAM,mBAAA,CAAoB,aAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA;AAAA,OACF,CAAA;AACF,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,gBAAA,EAAkB,gBAAA,EAAkB,UAAK,UAAA,EAAY,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QACxG,IAAA,EAAM,gBAAA;AAAA,QAAkB,UAAA;AAAA,QAAY;AAAA,OACvC,CAAA;AACD,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,eAAA,EAAiB,gBAAA,EAAkB,mBAAO,UAAA,EAAY,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QACzG,IAAA,EAAM,eAAA;AAAA,QACN,MAAA,EAAQ,IAAA;AAAA,QACR,kBAAkB,UAAA,CAAW,MAAA;AAAA,QAC7B,SAAA,EAAW,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW;AAAA,OACrC,CAAA;AAAA,IACL;AAUA,IAAA,MAAM,OAAA,GAAU,aAAA,GAAgB,CAAC,CAAA,KAAa;AAC1C,MAAA,QAAA,CAAS,gBAAA,CAAiB;AAAA,QACtB,MAAM,mBAAA,CAAoB,YAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA;AAAA,QACX,UAAA;AAAA,QACA,KAAA,EAAO;AAAA,UACH,MAAM,CAAA,CAAE,IAAA;AAAA,UACR,OAAO,CAAA,CAAE,KAAA;AAAA,UACT,MAAA,EAAQ,EAAE,MAAA,IAAU,CAAA;AAAA,UACpB,IAAA,EAAM,EAAE,IAAA,IAAQ,UAAA;AAAA,UAChB,GAAA,EAAK,EAAE,GAAA,IAAO;AAAA;AAClB,OACH,CAAA;AAAA,IACL,CAAA,GAAI,MAAA;AACJ,IAAA,MAAM,SAAA,GAAY,kBAAkB,KAAA,CAAM,OAAA,EAAS,MAAM,IAAA,CAAK,WAAA,CAAY,UAAA,EAAY,OAAO,CAAC,CAAA;AAC9F,IAAA,MAAM,MAAA,GAAS,UAAU,MAAA,CAAO,MAAA;AAChC,IAAA,MAAM,SAAA,GAAY,UAAU,MAAA,CAAO,SAAA;AACnC,IAAA,IAAI,gBAAgB,SAAA,CAAU,KAAA,EAAO,WAAA,CAAY,IAAA,CAAK,UAAU,KAAK,CAAA;AAGrE,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,MAAM,aAAqC,EAAC;AAC5C,MAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACpB,QAAA,UAAA,CAAW,EAAE,IAAI,CAAA,GAAA,CAAK,WAAW,CAAA,CAAE,IAAI,KAAK,CAAA,IAAK,CAAA;AAAA,MACrD;AACA,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,OAAA,EAAS,OAAA,EAAS,aAAM,OAAA,EAAS,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QACpF,IAAA,EAAM,OAAA;AAAA,QACN,YAAY,MAAA,CAAO,MAAA;AAAA,QACnB,UAAA;AAAA,QACA,SAAA;AAAA,QACA,QAAQ,IAAA,CAAK,UAAA;AAAA,QACb,MAAA,EAAQ,CAAC,GAAG,MAAM;AAAA,OACrB,CAAA;AAGD,MAAA,MAAM,mBAA0C,EAAC;AACjD,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACpC,QAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,QAAA,IAAI,CAAA,CAAE,SAAS,oBAAA,EAAsB;AAEjC,UAAA,IAAI,MAAA,GAAS,EAAA;AACb,UAAA,KAAA,IAAS,IAAI,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,QAAQ,CAAA,EAAA,EAAK;AACxC,YAAA,IAAI,MAAA,CAAO,CAAC,CAAA,CAAE,IAAA,KAAS,eAAA,EAAiB;AACpC,cAAA,MAAA,GAAS,CAAA;AACT,cAAA;AAAA,YACJ;AAAA,UACJ;AACA,UAAA,IAAI,SAAS,CAAA,EAAG;AACZ,YAAA,MAAM,UAAA,GAAa,MAAA,CAAO,KAAA,CAAM,CAAA,GAAI,GAAG,MAAM,CAAA;AAC7C,YAAA,MAAMC,WAAAA,GAAa,WAAW,GAAA,CAAI,CAAA,EAAA,KAAM,GAAG,KAAK,CAAA,CAAE,KAAK,EAAE,CAAA;AACzD,YAAA,gBAAA,CAAiB,IAAA,CAAK;AAAA,cAClB,eAAA,EAAiB,CAAA;AAAA,cACjB,aAAA,EAAe,MAAA;AAAA,cACf,UAAA,EAAAA,WAAAA;AAAA,cACA,YAAA,EAAc,EAAE,GAAA,IAAO;AAAA,aAC1B,CAAA;AACD,YAAA,CAAA,GAAI,MAAA;AAAA,UACR;AAAA,QACJ;AAAA,MACJ;AACA,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,qBAAA,EAAuB,qBAAA,EAAuB,aAAM,UAAA,EAAY,GAAA,EAAK,aAAa,KAAA,EAAO;AAAA,QACrH,IAAA,EAAM,qBAAA;AAAA,QACN,cAAA,EAAgB,YAAA;AAAA,QAChB,IAAA,EAAM,KAAA;AAAA,QACN,cAAA,EAAgB,iBAAiB,MAAA,GAAS,CAAA;AAAA,QAC1C;AAAA,OACH,CAAA;AAAA,IACL;AAEA,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AACrB,MAAA,MAAM,CAAA,GAAI,YAAY,CAAC,CAAA;AACvB,MAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,UAAA,EAAY,IAAI,cAAA,CAAe,CAAA,EAAG,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,EAAC,EAAG,IAAI,CAAA,EAAG,UAAU,CAAA;AAEtK,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,WAAA,EAAa,CAAA;AAAA,UACb,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AAEA,MAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,OAAA,EAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,KAAA,EAAO,MAAA,EAAW,UAAA,EAAY,MAAA,EAAU;AAAA,IAC5K;AAiBA,IAAA,IAAI,WAAA,GAAc,CAAA;AAClB,IAAA,MAAM,oBAAmC,EAAC;AAC1C,IAAA,MAAM,oBAAA,uBAA2B,GAAA,EAAoB;AACrD,IAAA,MAAM,QAAA,GAAW,aAAA,GAAgB,CAAC,MAAA,KAAwB;AACtD,MAAA,WAAA,EAAA;AACA,MAAA,iBAAA,CAAkB,KAAK,MAAM,CAAA;AAC7B,MAAA,oBAAA,CAAqB,GAAA,CAAI,OAAO,IAAA,EAAA,CAAO,oBAAA,CAAqB,IAAI,MAAA,CAAO,IAAI,CAAA,IAAK,CAAA,IAAK,CAAC,CAAA;AACtF,MAAA,QAAA,CAAS,cAAA,CAAe;AAAA,QACpB,MAAM,mBAAA,CAAoB,UAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA,UAAU,MAAA,CAAO,IAAA;AAAA,QACjB,gBAAA,EAAkB,OAAO,YAAA,CAAa,MAAA;AAAA,QACtC,cAAA,EAAgB,OAAO,UAAA,CAAW,IAAA;AAAA,QAClC,eAAA,EAAiB,OAAO,UAAA,CAAW;AAAA,OACtC,CAAA;AAAA,IACL,CAAA,GAAI,MAAA;AAEJ,IAAA,IAAI,aAAA,IAAiB,IAAA,CAAK,UAAA,CAAW,SAAA,GAAY,CAAA,EAAG;AAChD,MAAA,QAAA,CAAS,mBAAA,CAAoB;AAAA,QACzB,MAAM,mBAAA,CAAoB,eAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA,iBAAiB,MAAA,CAAO;AAAA,OAC3B,CAAA;AAAA,IACL;AAQA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,UAAU,CAAA;AACtD,IAAA,IAAI,aAAA,IAAiB,CAAC,YAAA,EAAc;AAChC,MAAA,IAAA,CAAK,MAAA,CAAO,qBAAA,CAAsB,QAAA,EAAU,UAAU,CAAA;AAAA,IAC1D;AAUA,IAAA,MAAM,OAAO,IAAA,CAAK,iBAAA,CAAkB,YAAY,MAAA,EAAQ,SAAA,EAAW,UAAU,UAAU,CAAA;AACvF,IAAA,IAAI,YAAA,IAAgB,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,KAAK,WAAA,EAAa;AAC3D,MAAA,WAAA,CAAY,IAAA,CAAK,KAAK,WAAW,CAAA;AAAA,IACrC;AAEA,IAAA,IAAI,aAAA,IAAiB,CAAC,YAAA,EAAc;AAChC,MAAA,IAAA,CAAK,MAAA,CAAO,qBAAA,CAAsB,MAAA,EAAW,EAAE,CAAA;AAAA,IACnD;AAOA,IAAA,MAAM,mBAA4B,IAAA,CAAK,IAAA,KAAS,OAAA,GAAU,MAAA,GAAU,KAAK,gBAAA,IAAoB,MAAA;AAE7F,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAI,IAAA,CAAK,UAAA,CAAW,SAAA,GAAY,CAAA,EAAG;AAC/B,QAAA,QAAA,CAAS,iBAAA,CAAkB;AAAA,UACvB,MAAM,mBAAA,CAAoB,aAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,kBAAkB,gBAAA,CAAiB,MAAA;AAAA,UACnC,YAAA,EAAc;AAAA,SACjB,CAAA;AACD,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,YAAA,EAAc,YAAA,EAAc,aAAM,YAAA,EAAc,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,UACnG,IAAA,EAAM,YAAA;AAAA,UACN,iBAAiB,MAAA,CAAO,MAAA;AAAA,UACxB,kBAAkB,gBAAA,CAAiB,MAAA;AAAA,UACnC,OAAA,EAAS,iBAAA;AAAA,UACT,cAAc,CAAC,GAAG,oBAAA,CAAqB,OAAA,EAAS,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,MAAM,KAAK,CAAA,MAAO,EAAE,IAAA,EAAM,OAAM,CAAE,CAAA;AAAA,UAC1F,MAAA,EAAQ,CAAC,GAAG,gBAAgB,CAAA;AAAA,UAC5B,OAAA,EAAS,IAAA,CAAK,UAAA,CAAW,UAAA;AAAW,SACvC,CAAA;AAAA,MACL,CAAA,MAAO;AACH,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,YAAA,EAAc,YAAA,EAAc,aAAM,YAAA,EAAc,CAAA,EAAG,aAAa,IAAA,EAAM;AAAA,UAClG,IAAA,EAAM,YAAA;AAAA,UACN,iBAAiB,MAAA,CAAO,MAAA;AAAA,UACxB,kBAAkB,MAAA,CAAO,MAAA;AAAA,UACzB,SAAS,EAAC;AAAA,UACV,cAAc,EAAC;AAAA,UACf,MAAA,EAAQ,CAAC,GAAG,MAAM,CAAA;AAAA,UAClB,OAAA,EAAS,IAAA,CAAK,UAAA,CAAW,UAAA;AAAW,SACvC,CAAA;AAAA,MACL;AAAA,IACJ;AAMA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,IAAY,IAAA,CAAK,SAAS,OAAA,IAAW,IAAA,CAAK,UAAU,QAAA,EAAW;AAC7E,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,KAAK,IAAA,KAAS,OAAA;AAAA,UACvB,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AACA,MAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AACvB,QAAA,MAAM,CAAA,GAAI,YAAY,CAAC,CAAA;AACvB,QAAA,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,UAAA,EAAY,IAAI,cAAA,CAAe,CAAA,EAAG,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,EAAC,EAAG,IAAI,CAAA,EAAG,UAAU,CAAA;AACtK,QAAA,OAAO,EAAE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,OAAA,EAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,KAAA,EAAM,EAAG,KAAA,EAAO,MAAA,EAAW,UAAA,EAAY,MAAA,EAAU;AAAA,MAC5K;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,YAAY,CAAC,CAAA;AAAA,QACpB,QAAQ,EAAC;AAAA,QACT,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,KAAA,EAAO,KAAK,KAAA,CAAM,OAAA;AAAA,QAClB,aAAa,IAAA,CAAK,KAAA;AAAA,QAClB,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY;AAAA,OAChB;AAAA,IACJ;AAMA,IAAA,MAAM,eAAA,GAAkB,yBAAA,CAA0B,gBAAA,EAAkB,IAAA,CAAK,OAAO,UAAU,CAAA;AAE1F,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,IAAA,CAAK,UAAU,YAAA,EAAc;AACtD,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,mBAAA,EAAqB,oBAAA,EAAsB,mBAAO,UAAA,EAAY,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,UACjH,IAAA,EAAM,mBAAA;AAAA,UACN,MAAA,EAAQ,KAAA;AAAA,UACR,eAAA,EAAiB,gBAAgB,eAAA,IAAmB,CAAA;AAAA,UACpD,aAAA,EAAe,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,aAAA;AAAA,UACtC,SAAA,EAAW;AAAA,YACP,YAAY,gBAAA,CAAiB,MAAA;AAAA,YAC7B,aAAA,EAAe,CAAA;AAAA,YACf,YAAA,EAAc;AAAA,WAClB;AAAA,UACA,cAAc,eAAA,CAAgB;AAAA,SACjC,CAAA;AACD,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,KAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,YAAY,CAAC,CAAA;AAAA,QACpB,QAAQ,EAAC;AAAA,QACT,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,OAAO,eAAA,CAAgB,YAAA;AAAA,QACvB,aAAa,eAAA,CAAgB,WAAA;AAAA,QAC7B,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY;AAAA,OAChB;AAAA,IACJ;AAEA,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,mBAAA,EAAqB,oBAAA,EAAsB,mBAAO,UAAA,EAAY,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QACjH,IAAA,EAAM,mBAAA;AAAA,QACN,MAAA,EAAQ,IAAA;AAAA,QACR,eAAA,EAAiB,eAAA,CAAgB,eAAA,IAAmB,gBAAA,CAAiB,MAAA;AAAA,QACrE,aAAA,EAAe,IAAA,CAAK,MAAA,CAAO,UAAA,CAAW,aAAA;AAAA,QACtC,SAAA,EAAW;AAAA,UACP,YAAY,gBAAA,CAAiB,MAAA;AAAA,UAC7B,aAAA,EAAe,CAAA;AAAA,UACf,YAAA,EAAc;AAAA;AAClB,OACH,CAAA;AAAA,IACL;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,gBAAA,EAAkB;AAChC,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AACA,MAAA,MAAM,eAAgC,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAC/H,MAAA,IAAA,CAAK,eAAA,CAAgB,YAAY,IAAA,CAAK,KAAA,EAAO,cAAc,EAAC,EAAG,EAAC,EAAG,UAAU,CAAA;AAC7E,MAAA,OAAO;AAAA,QACH,OAAO,IAAA,CAAK,KAAA;AAAA,QACZ,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA,EAAS,YAAA;AAAA,QACT,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY;AAAA,OAChB;AAAA,IACJ;AAKA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,IAAS,EAAC;AAC7B,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,IAAU,EAAC;AAE/B,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,WAAA,EAAa,YAAA,EAAc,aAAM,WAAA,EAAa,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QACjG,IAAA,EAAM,WAAA;AAAA,QACN,KAAA;AAAA,QACA,MAAA;AAAA,QACA,YAAA,EAAc,OAAO,MAAA,GAAS;AAAA,OACjC,CAAA;AACD,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,aAAA,EAAe,aAAA,EAAe,aAAM,OAAA,EAAS,CAAA,EAAG,aAAa,KAAA,EAAO;AAAA,QAChG,IAAA,EAAM,aAAA;AAAA,QACN,GAAA,EAAK,CAAC,CAAC,YAAA;AAAA,QACP,SAAA,EAAW,KAAK,aAAA,CAAc,IAAA;AAAA,QAC9B,QAAA,EAAU;AAAA,OACb,CAAA;AACD,MAAA,IAAI,YAAA,EAAc;AACd,QAAA,QAAA,CAAS,YAAA,CAAa,EAAE,IAAA,EAAM,mBAAA,CAAoB,QAAA,EAAU,SAAA,EAAW,CAAA,EAAG,UAAA,EAAY,KAAA,EAAO,UAAA,EAAY,GAAA,EAAK,UAAA,EAAY,CAAA;AAAA,MAC9H,CAAA,MAAO;AACH,QAAA,QAAA,CAAS,aAAA,CAAc,EAAE,IAAA,EAAM,mBAAA,CAAoB,SAAA,EAAW,SAAA,EAAW,CAAA,EAAG,UAAA,EAAY,KAAA,EAAO,UAAA,EAAY,GAAA,EAAK,UAAA,EAAY,CAAA;AAAA,MAChI;AAAA,IACJ;AAEA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,IAAA,CAAK,UAAU,OAAA,EAAS;AAKjD,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,KAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,YAAY,CAAC,CAAA;AAAA,QACpB,MAAA,EAAQ,gBAAA;AAAA,QACR,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,KAAA,EAAO,KAAK,KAAA,CAAM,OAAA;AAAA,QAClB,aAAa,IAAA,CAAK,KAAA;AAAA,QAClB,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY;AAAA,OAChB;AAAA,IACJ;AAEA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AAOvB,MAAA,MAAM,aAAa,QAAA,CAAS;AAAA,QACxB,IAAA,EAAM,kBAAA;AAAA,QACN,OAAA,EAAS;AAAA,OACZ,CAAA;AAAA,IACL;AACA,IAAA,MAAM,UAAU,IAAA,CAAK,OAAA;AAErB,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAA,CAAK,kBAAA,CAAmB,MAAA,EAAQ,QAAA,EAAU,QAAA,EAAU,WAAA,EAAM,UAAU,CAAA,EAAG,WAAA,EAAa,CAAC,CAAC,YAAA,EAAc;AAAA,QAChG,IAAA,EAAM,QAAA;AAAA,QACN,WAAW,EAAC;AAAA,QACZ,qBAAqB,EAAC;AAAA,QACtB,QAAA,EAAU;AAAA,OACb,CAAA;AACD,MAAA,IAAA,CAAK,kBAAA,CAAmB,MAAA,EAAQ,UAAA,EAAY,UAAA,EAAY,cAAA,EAAM,YAAY,CAAA,EAAG,WAAA,EAAa,CAAC,CAAC,YAAA,EAAc;AAAA,QACtG,IAAA,EAAM,UAAA;AAAA,QACN,WAAA,EAAa,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC7B,eAAA,EAAiB,QAAQ,OAAA,CAAQ,MAAA;AAAA,QACjC,eAAA,EAAiB,QAAQ,OAAA,CAAQ,MAAA;AAAA,QACjC,UAAU,OAAA,CAAQ,QAAA;AAAA,QAClB,MAAA,EAAQ,CAAC,CAAC;AAAA,OACb,CAAA;AACD,MAAA,QAAA,CAAS,iBAAA,CAAkB;AAAA,QACvB,MAAM,mBAAA,CAAoB,aAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,QAAA,EAAU,CAAC,CAAC;AAAA,OACf,CAAA;AAAA,IACL;AAGA,IAAA,MAAM,aAAA,GAAgB,OAAA,CAAQ,QAAA,IAAY,IAAA,CAAK,iBAAiB,IAAA,GAAO,CAAA;AACvE,IAAA,MAAM,SAAA,GAAY,KAAK,cAAA,CAAe,gBAAA,EAAkB,SAAS,UAAA,EAAY,UAAA,EAAY,OAAO,MAAM,CAAA;AAEtG,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAI,SAAA,CAAU,SAAS,SAAA,EAAW;AAC9B,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,iBAAA,EAAmB,iBAAA,EAAmB,aAAM,OAAA,EAAS,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,UACzG,IAAA,EAAM,iBAAA;AAAA,UACN,IAAA,EAAM,SAAA;AAAA,UACN,eAAA,EAAiB,UAAU,KAAA,CAAM,KAAA;AAAA,UACjC,aAAA,EAAe,KAAK,gBAAA,CAAiB,IAAA;AAAA,UACrC,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL,WAAW,aAAA,EAAe;AACtB,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,iBAAA,EAAmB,iBAAA,EAAmB,aAAM,OAAA,EAAS,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,UACzG,IAAA,EAAM,iBAAA;AAAA,UACN,IAAA,EAAM,MAAA;AAAA,UACN,aAAA,EAAe,KAAK,gBAAA,CAAiB,IAAA;AAAA,UACrC,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL,CAAA,MAAO;AACH,QAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,iBAAA,EAAmB,iBAAA,EAAmB,aAAM,OAAA,EAAS,EAAA,EAAI,aAAa,IAAA,EAAM;AAAA,UACxG,IAAA,EAAM,iBAAA;AAAA,UACN,IAAA,EAAM,MAAA;AAAA,UACN,aAAA,EAAe,CAAA;AAAA,UACf,YAAA,EAAc;AAAA,SACjB,CAAA;AAAA,MACL;AAAA,IACJ;AAEA,IAAA,IAAI,SAAA,CAAU,SAAS,SAAA,EAAW;AAC9B,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc,QAAQ,OAAA,CAAQ;AAAA,SACjC,CAAA;AAAA,MACL;AACA,MAAA,OAAO;AAAA,QACH,OAAO,SAAA,CAAU,KAAA;AAAA,QACjB,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA;AAAA,QACA,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY,aAAA,GAAgB,IAAA,CAAK,qBAAA,CAAsB,MAAA,EAAQ,UAAU,KAAA,EAAO,gBAAA,EAAkB,OAAA,EAAS,IAAI,CAAA,GAAI;AAAA,OACvH;AAAA,IACJ;AAaA,IAAA,MAAM,WAAA,GAAc,aAAA,IAAiB,IAAA,CAAK,MAAA,CAAO,WAAW,cAAA,KAAmB,IAAA;AAC/E,IAAA,IAAI,MAAA;AACJ,IAAA,IAAI;AACA,MAAA,MAAM,QAAA,GAAW,iBAAA,CAAkB,KAAA,CAAM,IAAA,EAAM,MAAM;AACjD,QAAA,OAAO,IAAA,CAAK,eAAA,CAAgB,OAAA,EAAS,UAAA,EAAY,UAAA,EAAY,KAAA,EAAO,MAAA,EAAQ,SAAA,EAAW,WAAA,GAAc,QAAA,GAAW,KAAA,CAAA,EAAW,UAAU,CAAA;AAAA,MACzI,GAAG,EAAE,QAAA,EAAU,CAAC,CAAC,cAAc,CAAA;AAC/B,MAAA,MAAA,GAAS,QAAA,CAAS,MAAA;AAClB,MAAA,IAAI,gBAAgB,QAAA,CAAS,KAAA,EAAO,WAAA,CAAY,IAAA,CAAK,SAAS,KAAK,CAAA;AAAA,IACvE,SAAS,CAAA,EAAG;AACR,MAAA,MAAM,WAAA,GAAc,sBAAsB,CAAC,CAAA;AAC3C,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,KAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc,QAAQ,OAAA,CAAQ;AAAA,SACjC,CAAA;AAAA,MACL;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,YAAY,CAAC,CAAA;AAAA,QACpB,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA;AAAA,QACA,OAAO,WAAA,CAAY,OAAA;AAAA,QACnB,WAAA;AAAA,QACA,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY;AAAA,OAChB;AAAA,IACJ;AAEA,IAAA,MAAM,YAAY,MAAA,CAAO,IAAA,KAAA,EAAA;AAEzB,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,MAAM,cAAc,SAAA,GAAY,SAAA,GAAY,MAAA,CAAO,MAAA,CAAO,SAAS,EAAE,CAAA;AACrE,MAAA,MAAM,UAAA,GAAa,SAAA,GAAY,SAAA,GAAa,MAAA,CAAO,OAAO,KAAA,GAAQ,QAAA;AAClE,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,YAAA,EAAc,YAAA,EAAc,UAAK,IAAA,EAAM,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,QAC3F,IAAA,EAAM,YAAA;AAAA,QACN,iBAAA,EAAmB,QAAQ,OAAA,CAAQ,MAAA;AAAA,QACnC,UAAA,EAAY,IAAA,CAAK,EAAA,CAAG,QAAA,EAAS,CAAE,MAAA;AAAA,QAC/B,UAAA;AAAA,QACA,WAAA;AAAA,QACA;AAAA,OACH,CAAA;AAAA,IACL;AAEA,IAAA,IAAI,SAAA,EAAW;AACX,MAAA,IAAI,aAAA,EAAe;AACf,QAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,UACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,UAC1B,SAAA,EAAW,CAAA;AAAA,UACX,UAAA;AAAA,UACA,OAAA,EAAS,IAAA;AAAA,UACT,aAAa,MAAA,CAAO,MAAA;AAAA,UACpB,YAAA,EAAc,QAAQ,OAAA,CAAQ;AAAA,SACjC,CAAA;AAAA,MACL;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,MAAA;AAAA,QACP,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA;AAAA,QACA,KAAA,EAAO,MAAA;AAAA,QACP,UAAA,EAAY,gBAAgB,IAAA,CAAK,qBAAA,CAAsB,QAAQ,MAAA,EAAQ,gBAAA,EAAkB,OAAA,EAAS,IAAI,CAAA,GAAI;AAAA,OAC9G;AAAA,IACJ;AAGA,IAAA,IAAI,YAAA,IAAgB,WAAA,CAAY,MAAA,GAAS,CAAA,EAAG;AACxC,MAAA,IAAA,CAAK,gBAAgB,iBAAA,CAAkB,eAAA;AAAA,QACnC,UAAA;AAAA,QACA,WAAA;AAAA,QACA,CAAC,CAAC;AAAA,OACN;AAAA,IACJ;AAGA,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,kBAAA,EAAoB,kBAAA,EAAoB,aAAM,KAAA,EAAO,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,QACzG,IAAA,EAAM,kBAAA;AAAA,QACN,eAAA,EAAiB,KAAA;AAAA,QACjB,gBAAA,EAAkB,MAAA;AAAA,QAClB,uBAAuB;AAAC,OAC3B,CAAA;AACD,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,WAAA,EAAa,YAAA,EAAc,aAAM,OAAA,EAAS,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,QAC9F,IAAA,EAAM,WAAA;AAAA,QACN,UAAA;AAAA,QACA,UAAA;AAAA,QACA,MAAA,EAAQ;AAAA,OACX,CAAA;AACD,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,QAAA,EAAU,QAAA,EAAU,UAAK,QAAA,EAAU,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,QACvF,IAAA,EAAM,QAAA;AAAA,QACN,QAAA,EAAU,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAAA,QAC7B,cAAA,EAAgB,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA;AAAA,QACnC,SAAA,EAAW,MAAA,CAAO,IAAA,KAAS,CAAA,GAAI,QAAA,GAAW,OAAA;AAAA,QAC1C,MAAM,MAAA,CAAO;AAAA,OAChB,CAAA;AAED,MAAA,QAAA,CAAS,UAAA,CAAW;AAAA,QAChB,MAAM,mBAAA,CAAoB,MAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA,QAAQ,MAAA,GAAS;AAAA,UACb,MAAM,MAAA,CAAO,IAAA;AAAA,UACb,OAAO,MAAA,CAAO,KAAA;AAAA,UACd,MAAM,MAAA,CAAO;AAAA,SACjB,GAAI;AAAA,OACP,CAAA;AAED,MAAA,IAAA,CAAK,kBAAA,CAAmB,QAAQ,cAAA,EAAgB,cAAA,EAAgB,UAAK,UAAA,EAAY,EAAA,EAAI,aAAa,KAAA,EAAO;AAAA,QACrG,IAAA,EAAM,cAAA;AAAA,QACN,OAAA,EAAS,IAAA;AAAA,QACT,aAAa,MAAA,CAAO,MAAA;AAAA,QACpB,YAAA,EAAc,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC9B,QAAA,EAAU,CAAC,CAAC;AAAA,OACf,CAAA;AAED,MAAA,QAAA,CAAS,eAAA,CAAgB;AAAA,QACrB,MAAM,mBAAA,CAAoB,WAAA;AAAA,QAC1B,SAAA,EAAW,CAAA;AAAA,QACX,UAAA;AAAA,QACA,OAAA,EAAS,IAAA;AAAA,QACT,aAAa,MAAA,CAAO,MAAA;AAAA,QACpB,YAAA,EAAc,QAAQ,OAAA,CAAQ;AAAA,OACjC,CAAA;AAAA,IACL;AAGA,IAAA,IAAI,aAAA,EAAe;AACf,MAAA,MAAM,OAAA,GAAU,SAAS,cAAA,EAAe;AACxC,MAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,CAAC,CAAA,EAAG,MAAA,EAAO;AAWpC,MAAA,IAAI,KAAA,GAAQ,QAAA;AACZ,MAAA,IAAI,QAAA,EAAU;AACV,QAAA,MAAM,aAAA,GAAgB,QAAA,CAAS,SAAA,CAAU,KAAA,CAAM,eAAe,CAAA;AAmB9D,QAAA,MAAM,sBAA8C,EAAC;AACrD,QAAA,KAAA,MAAW,KAAK,aAAA,EAAe;AAC3B,UAAA,mBAAA,CAAoB,EAAE,gBAAgB,CAAA,GAAA,CAAK,oBAAoB,CAAA,CAAE,gBAAgB,KAAK,CAAA,IAAK,CAAA;AAAA,QAC/F;AACA,QAAA,KAAA,GAAQ;AAAA,UACJ,GAAG,QAAA;AAAA,UACH,SAAA,EAAW,aAAA;AAAA,UACX,OAAA,EAAS;AAAA,YACL,GAAG,QAAA,CAAS,OAAA;AAAA,YACZ,cAAA,EAAgB,MAAA,CAAO,IAAA,CAAK,mBAAmB,CAAA,CAAE,MAAA;AAAA,YACjD,eAAA,EAAiB;AAAA;AACrB,SACJ;AAAA,MACJ;AACA,MAAA,OAAO;AAAA,QACH,KAAA,EAAO,MAAA;AAAA,QACP,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA;AAAA,QACA,KAAA;AAAA,QACA,YAAY,IAAA,CAAK,qBAAA,CAAsB,QAAQ,MAAA,EAAQ,gBAAA,EAAkB,SAAS,IAAI;AAAA,OAC1F;AAAA,IACJ;AAEA,IAAA,OAAO;AAAA,MACH,KAAA,EAAO,MAAA;AAAA,MACP,MAAA,EAAQ,gBAAA;AAAA,MACR;AAAA,KACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,qBAAA,CACJ,MAAA,EACA,KAAA,EACA,MAAA,EACA,SACA,KAAA,EACwB;AACxB,IAAA,OAAO;AAAA,MACH,MAAA;AAAA,MACA,KAAA;AAAA,MACA,MAAA;AAAA,MACA,OAAA;AAAA,MACA,KAAA;AAAA,MACA,WAAA,EAAa,IAAA,CAAK,GAAA,CAAI,WAAA,EAAY;AAAA,MAClC,aAAA,EAAe,KAAK,gBAAA,EAAiB;AAAA,MACrC,cAAA,EAAgB,KAAK,iBAAA,EAAkB;AAAA,MACvC,WAAA,EAAa,KAAK,cAAA;AAAe,KACrC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,cAAA,CAAe,YAAoB,UAAA,EAAuC;AACtE,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,YAAY,UAAU,CAAA;AACvD,IAAA,IAAI,CAAC,OAAO,OAAO,MAAA;AAEnB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,aAAA,CAAc,GAAA,CAAI,UAAU,CAAA;AACjD,IAAA,IAAI,CAAC,SAAS,OAAO,MAAA;AAKrB,IAAA,IAAI,MAAM,QAAA,CAAS,QAAA,IAAY,IAAA,CAAK,gBAAA,CAAiB,OAAO,CAAA,EAAG;AAG/D,MAAA,MAAM,mBAAA,GAAsB,IAAI,eAAA,EAAgB;AAChD,MAAA,MAAM,cAAA,GAAiB,MAAM,mBAAA,CAAoB,KAAA,EAAM;AACvD,MAAA,IAAA,CAAK,iBAAiB,gBAAA,CAAiB,OAAA,EAAS,gBAAgB,EAAE,IAAA,EAAM,MAAM,CAAA;AAE9E,MAAA,WAAA,CAAY,uBAAuB,0BAA0B,CAAA;AAC7D,MAAA,IAAI,KAAK,eAAA,EAAiB;AACtB,QAAA,WAAA,CAAY,aAAa,0BAA0B,CAAA;AAAA,MACvD;AAEA,MAAA,MAAM,kBAAkB,mBAAA,CAAoB,MAAA;AAC5C,MAAA,MAAM,UAAA,GAAa,KAAK,gBAAA,CAAiB,YAAA;AAAA,QACrC,EAAC;AAAA,QAAG,KAAA,CAAM,QAAA;AAAA,QAAU,SAAA;AAAA,QAAW,eAAA;AAAA,QAAiB,IAAA,CAAK;AAAA,OACzD;AACA,MAAA,IAAI,UAAA,EAAY;AACZ,QAAA,KAAK,KAAK,YAAA,CAAa;AAAA,UACnB,IAAA,EAAM,SAAA;AAAA,UACN,UAAU,UAAA,CAAW,QAAA;AAAA,UACrB,UAAU,UAAA,CAAW,QAAA;AAAA,UACrB,SAAA,EAAW,WAAW,SAAA,IAAa,SAAA;AAAA,UACnC,QAAQ,UAAA,CAAW;AAAA,SACtB,CAAA;AACD,QAAA,OAAO,YAAA,CAAa,WAAW,QAAQ,CAAA;AAAA,MAC3C;AAEA,MAAA,IAAA,CAAK,eAAA,EAAiB,mBAAA,CAAoB,OAAA,EAAS,cAAc,CAAA;AAAA,IACjE;AAKA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,UAAU,CAAA;AAEtD,IAAA,IAAI,UAAA,CAAW,SAAS,SAAA,EAAW;AAC/B,MAAA,KAAK,IAAA,CAAK,aAAa,UAAU,CAAA;AACjC,MAAA,OAAO,YAAA,CAAa,WAAW,QAAQ,CAAA;AAAA,IAC3C;AACA,IAAA,IAAI,UAAA,CAAW,SAAS,OAAA,EAAS;AAC7B,MAAA,MAAM,UAAA,CAAW,KAAA;AAAA,IACrB;AAEA,IAAA,MAAM,SAAS,UAAA,CAAW,KAAA;AAC1B,IAAA,KAAA,CAAM,MAAA,GAAS,MAAA;AAEf,IAAA,OAAO,MAAA;AAAA,EACX;AAAA,EAEA,MAAA,GAA0B;AACtB,IAAA,OAAO,IAAA,CAAK,GAAA;AAAA,EAChB;AAAA,EAEA,YAAA,GAA0B;AACtB,IAAA,OAAO,IAAA,CAAK,SAAA;AAAA,EAChB;AAAA,EAEA,gBAAA,GAAiD;AAC7C,IAAA,OAAO,IAAA,CAAK,aAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,KAAA,GAAY;AACR,IAAA,OAAO,IAAA,CAAK,EAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,UAAA,GAA4B;AACxB,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EAChB;AAAA,EAEA,eAAA,GAAgC;AAC5B,IAAA,OAAO,IAAA,CAAK,YAAA;AAAA,EAChB;AAAA,EAEA,QAAA,GAAkB;AACd,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,aAAA,GAAiC;AAC7B,IAAA,OAAO,IAAA,CAAK,UAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,yBAAA,GAA8C;AAC1C,IAAA,MAAM,QAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,QAAA,IAAY,IAAA,CAAK,sBAAA,CAAuB,MAAA,EAAO,EAAG;AACzD,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,QAAQ,CAAA;AAAA,IAC1B;AACA,IAAA,OAAO,KAAA;AAAA,EACX;AAAA,EAEA,mBAAA,GAAsN;AAClN,IAAA,OAAO;AAAA,MACH,MAAA,EAAQ,IAAA,CAAK,QAAA,CAAS,YAAA,EAAa;AAAA,MACnC,KAAA,EAAO,IAAA,CAAK,QAAA,CAAS,WAAA;AAAY,KACrC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BA,0BAA0B,IAAA,EAAuB;AAC7C,IAAA,IAAA,CAAK,KAAA,CAAM,gBAAgB,IAAI,CAAA;AAC/B,IAAA,MAAM,SAAA,GAAY,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAK,CAAA;AACvC,IAAA,MAAM,aAAa,SAAA,CAAU,MAAA,CAAO,CAAA,CAAA,KAAK,CAAA,CAAE,SAAS,SAAS,CAAA;AAC7D,IAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACrC,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,SAAA,CAAU,UAAU,CAAA;AAAA,EAC/C;AAAA,EAEA,SAAA,GAA8B;AAC1B,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EAChB;AAAA,EAEA,gBAAA,GAA4B;AACxB,IAAA,OAAO,KAAK,kBAAA,CAAmB,aAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,mBAAmB,MAAA,EAAkC;AACjD,IAAA,IAAI,MAAA,EAAQ;AACR,MAAA,WAAA,CAAY,kBAAA,CAAmB,OAAO,OAAO,CAAA;AAAA,IACjD,CAAA,MAAO;AACH,MAAA,WAAA,CAAY,sBAAA,EAAuB;AAAA,IACvC;AACA,IAAA,IAAA,CAAK,eAAA,GAAkB,MAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAA,GAAkC;AAC9B,IAAA,MAAM,WAAiC,EAAC;AACxC,IAAA,KAAA,MAAW,CAAC,UAAA,EAAY,OAAO,CAAA,IAAK,KAAK,aAAA,EAAe;AACpD,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACV,UAAA;AAAA,QACA,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,aAAA,EAAe,QAAQ,OAAA,CAAQ,MAAA;AAAA,QAC/B,UAAU,OAAA,CAAQ;AAAA,OACrB,CAAA;AAAA,IACL;AAEA,IAAA,MAAM,mBAAyC,EAAC;AAChD,IAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,SAAA,CAAU,IAAA,EAAK,EAAG;AAErC,MAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,GAAG,CAAA;AAChC,MAAA,MAAM,UAAA,GAAa,QAAA,GAAW,CAAA,GACvB,QAAA,CAAS,IAAI,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAA,EAAG,EAAE,CAAA,IAAK,CAAA,GACxC,QAAA,CAAS,GAAA,EAAK,EAAE,CAAA,IAAK,CAAA;AAC5B,MAAA,MAAM,iBAAiB,QAAA,GAAW,CAAA,GAAI,IAAI,KAAA,CAAM,QAAA,GAAW,CAAC,CAAA,GAAI,MAAA;AAEhE,MAAA,MAAM,KAAA,GAAQ,cAAA,KAAmB,MAAA,GAC3B,IAAA,CAAK,SAAA,CAAU,GAAA,CAAI,UAAA,EAAY,cAAc,CAAA,GAC7C,IAAA,CAAK,SAAA,CAAU,eAAA,CAAgB,UAAU,CAAA;AAC/C,MAAA,IAAI,CAAC,KAAA,EAAO;AAEZ,MAAA,gBAAA,CAAiB,IAAA,CAAK;AAAA,QAClB,GAAA;AAAA,QACA,UAAA;AAAA,QACA,UAAA,EAAY,MAAA,CAAO,KAAA,CAAM,MAAA,EAAQ,QAAQ,EAAE,CAAA;AAAA,QAC3C,WAAA,EAAa,MAAA,CAAO,KAAA,CAAM,MAAA,EAAQ,SAAS,EAAE,CAAA;AAAA,QAC7C,KAAA,EAAO,KAAA,CAAM,aAAA,IAAiB,EAAC;AAAA,QAC/B,QAAA,EAAU,MAAM,aAAA,IAAiB;AAAA,OACpC,CAAA;AAAA,IACL;AAGA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,WAAA,CAAY,aAAA,EAAc;AAClD,IAAA,MAAM,UAAA,GAAa,WAAW,MAAA,EAAO;AACrC,IAAA,MAAM,UAAA,GAAa,UAAA,CAAW,GAAA,CAAI,CAAA,CAAA,KAAK;AACnC,MAAA,MAAM,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,MAAA,KAAW,SAAA,GAAY,aACxC,CAAA,CAAE,KAAA,CAAM,MAAA,KAAW,OAAA,GAAU,OAAA,GAC7B,WAAA;AACN,MAAA,OAAO;AAAA,QACH,SAAA,EAAY,CAAA,CAAE,QAAA,CAAS,CAAC,CAAA,IAAgB,SAAA;AAAA,QACxC,aAAA,EAAe,CAAA,CAAE,KAAA,CAAM,MAAA,KAAW,YAAY,CAAA,GAAI,CAAA;AAAA,QAClD,aAAA,EAAe,EAAE,KAAA,CAAM,MAAA,KAAW,aAAa,CAAA,CAAE,KAAA,CAAM,MAAA,KAAW,OAAA,GAAU,CAAA,GAAI,CAAA;AAAA,QAChF,UAAA,EAAY,CAAA,CAAE,KAAA,CAAM,MAAA,KAAW,UAAU,CAAA,GAAI,CAAA;AAAA,QAC7C,OAAA,EAAS,CAAC,EAAE,GAAA,EAAK,CAAA,CAAE,SAAS,IAAA,CAAK,GAAG,CAAA,EAAG,MAAA,EAAQ;AAAA,OACnD;AAAA,IACJ,CAAC,CAAA;AAED,IAAA,OAAO,EAAE,QAAA,EAAU,SAAA,EAAW,gBAAA,EAAkB,UAAA,EAAW;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,iBAAA,GAAoC;AAChC,IAAA,OAAO;AAAA,MACH,YAAA,EAAc,KAAK,OAAA,CAAQ,YAAA;AAAA,MAC3B,UAAA,EAAY,KAAK,OAAA,CAAQ,UAAA;AAAA,MACzB,kBAAA,EAAoB,KAAK,OAAA,CAAQ,kBAAA;AAAA,MACjC,aAAA,EAAe,KAAK,OAAA,CAAQ;AAAA,KAChC;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cAAA,GAAuC;AAMnC,IAAA,MAAM,qBAAqB,IAAA,CAAK,EAAA;AAKhC,IAAA,MAAM,eAAe,kBAAA,CAAmB,YAAA;AACxC,IAAA,IAAI,CAAC,YAAA,EAAc,OAAO,EAAC;AAE3B,IAAA,MAAM,GAAA,GAAM,aAAa,iBAAA,EAAkB;AAC3C,IAAA,OAAO,GAAA,CAAI,IAAI,CAAA,EAAA,MAAO;AAAA,MAClB,YAAY,EAAA,CAAG,UAAA;AAAA,MACf,SAAA,EAAW,MAAA,CAAO,IAAA,CAAK,EAAA,CAAG,SAAS,CAAA;AAAA,MACnC,aAAA,EAAe,MAAA,CAAO,IAAA,CAAK,EAAA,CAAG,SAAS,CAAA,CAAE;AAAA,KAC7C,CAAE,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,gBAAA,GAA6C;AACzC,IAAA,OAAO,IAAA,CAAK,aAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,mBAAmB,UAAA,EAAiC;AAChD,IAAA,OAAO,IAAA,CAAK,YAAA,CAAa,EAAA,EAAI,UAAU,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBH,kBAAkB,UAAA,EAKhB;AACD,IAAA,MAAM,EAAE,MAAA,EAAQ,SAAA,EAAU,GAAI,IAAA,CAAK,YAAY,UAAU,CAAA;AAGzD,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,iBAAA,CAAkB,UAAA,EAAY,QAAQ,SAAS,CAAA;AAEjE,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AAC1B,MAAA,OAAO;AAAA,QACN,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,QAAQ,EAAC;AAAA,QACT,OAAO,EAAC;AAAA,QACR,QAAQ;AAAC,OACV;AAAA,IACD;AACA,IAAA,IAAI,IAAA,CAAK,SAAS,OAAA,EAAS;AAC1B,MAAA,IAAI,IAAA,CAAK,UAAU,OAAA,KAAY,IAAA,CAAK,OAAO,MAAA,IAAU,IAAA,CAAK,QAAQ,MAAA,CAAA,EAAS;AAY1E,QAAA,MAAM,IAAI,WAAA,CAAY,IAAA,CAAK,KAAA,CAAM,QAAA,EAAU;AAAA,UAC1C,IAAA,EAAM,KAAK,KAAA,CAAM,IAAA;AAAA,UACjB,OAAA,EAAS,KAAK,KAAA,CAAM,OAAA;AAAA,UACpB,QAAA,EAAU,KAAK,KAAA,CAAM,QAAA;AAAA,UACrB,KAAA,EAAO,KAAK,KAAA,CAAM,KAAA;AAAA,UAClB,UAAA,EAAY,KAAK,KAAA,CAAM,UAAA;AAAA,UACvB,WAAA,EAAa,KAAK,KAAA,CAAM,WAAA;AAAA,UACxB,IAAA,EAAM,KAAK,KAAA,CAAM,IAAA;AAAA,UACjB,KAAA,EAAO,KAAK,KAAA,CAAM,KAAA;AAAA,UAClB,OAAA,EAAS,EAAE,GAAG,IAAA,CAAK,MAAM,OAAA,EAAS,KAAA,EAAO,IAAA,CAAK,KAAA,IAAS,EAAC,EAAG,MAAA,EAAQ,IAAA,CAAK,MAAA,IAAU,EAAC;AAAE,SACrF,CAAA;AAAA,MACF;AACA,MAAA,MAAM,IAAA,CAAK,KAAA;AAAA,IACZ;AACA,IAAA,IAAI,IAAA,CAAK,SAAS,gBAAA,EAAkB;AAQnC,MAAA,OAAO;AAAA,QACN,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,QAAQ,IAAA,CAAK,gBAAA;AAAA,QACb,OAAO,EAAC;AAAA,QACR,QAAQ;AAAC,OACV;AAAA,IACD;AAEA,IAAA,OAAO,EAAE,OAAA,EAAS,IAAA,CAAK,OAAA,EAAS,MAAA,EAAQ,OAAO,IAAA,CAAK,KAAA,EAAO,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyCA,qBAAqB,UAAA,EAA6B;AACjD,IAAA,IAAI;AACH,MAAA,OAAO,IAAA,CAAK,8BAA8B,UAAU,CAAA;AAAA,IACrD,CAAA,CAAA,MAAQ;AAKP,MAAA,OAAO,KAAA;AAAA,IACR;AAAA,EACD;AAAA;AAAA,EAGQ,8BAA8B,UAAA,EAA6B;AAClE,IAAA,MAAM,EAAE,MAAA,EAAQ,SAAA,EAAU,GAAI,IAAA,CAAK,YAAY,UAAU,CAAA;AACzD,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,iBAAA,CAAkB,UAAA,EAAY,QAAQ,SAAS,CAAA;AACjE,IAAA,OAAO,KAAK,IAAA,KAAS,OAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,aAAA,CAAc,OAAA,EAA0B,UAAA,GAAqB,EAAA,EAAW;AACvE,IAAA,IAAI,OAAA,CAAQ,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACjC,MAAA,OAAO,YAAY,CAAC,CAAA;AAAA,IACrB;AACA,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,CAAW,OAAA,EAAS,UAAU,CAAA;AAEtD,IAAA,IAAI,UAAA,CAAW,SAAS,SAAA,EAAW;AAClC,MAAA,KAAK,IAAA,CAAK,aAAa,UAAU,CAAA;AACjC,MAAA,OAAO,YAAA,CAAa,WAAW,QAAQ,CAAA;AAAA,IACxC;AACA,IAAA,IAAI,UAAA,CAAW,SAAS,OAAA,EAAS;AAUhC,MAAA,MAAM,UAAA,CAAW,KAAA;AAAA,IAClB;AAEA,IAAA,OAAO,UAAA,CAAW,KAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBG,eAAe,UAAA,EAA4B;AACtC,IAAA,MAAM,OAAA,GAAU,WAAW,IAAA,EAAK;AAKhC,IAAA,IAAI,0BAAA,CAA2B,IAAA,CAAK,OAAO,CAAA,EAAG;AAC1C,MAAA,IAAI,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,OAAO,MAAM,MAAA,EAAW;AACvC,QAAA,OAAO,GAAA;AAAA,MACX;AAAA,IACJ;AAEA,IAAA,IAAI;AACA,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,YAAA,CAAa,CAAA,CAAA,EAAI,UAAU,CAAA;AAChD,MAAA,OAAO,OAAA,CAAQ,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,IAC/B,CAAA,CAAA,MAAQ;AACJ,MAAA,OAAO,GAAA;AAAA,IACX;AAAA,EACL;AAAA;AAAA;AAAA,EAMA,KAAA,GAAc;AAOhB,IAAA,IAAA,CAAK,QAAQ,QAAA,EAAS;AAatB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AAKvB,IAAA,IAAI,oBAAA,EAAqB,KAAM,IAAA,CAAK,WAAA,uBAAkC,IAAI,CAAA;AAEnE,IAAA,IAAA,CAAK,IAAI,KAAA,EAAM;AACf,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,aAAa,KAAA,EAAM;AACxB,IAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AACzB,IAAA,IAAA,CAAK,GAAG,KAAA,EAAM;AACd,IAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaD,mBAAA,CAAoB,UAAkB,QAAA,EAAsC;AAMxE,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,GAAA,CAAI,uBAAA,CAAwB,QAAQ,CAAA;AAG/D,IAAA,IAAA,CAAK,EAAA,CAAG,MAAA,CAAO,QAAA,EAAU,WAAA,CAAY,QAAQ,CAAC,CAAA;AAE9C,IAAA,MAAM,OAAA,uBAAc,GAAA,EAAmB;AAEvC,IAAA,KAAA,MAAW,cAAc,aAAA,EAAe;AACpC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,eAAA,CAAgB,UAAU,CAAA;AACvD,MAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,QAAA,CAAS,OAAA,CAAQ,WAAW,CAAA,EAAG;AACnD,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,CAAW,KAAA,CAAM,UAAU,UAAU,CAAA;AAE7D,MAAA,IAAI,UAAA,CAAW,SAAS,SAAA,EAAW;AAC/B,QAAA,KAAK,IAAA,CAAK,aAAa,UAAU,CAAA;AAGjC,QAAA;AAAA,MACJ;AACA,MAAA,IAAI,UAAA,CAAW,SAAS,OAAA,EAAS;AAS7B,QAAA,MAAM,QAAQ,UAAA,CAAW,UAAA,CAAW,MAAM,IAAA,EAAM,UAAA,CAAW,MAAM,OAAO,CAAA;AACxE,QAAA,OAAA,CAAQ,GAAA,CAAI,YAAY,KAAK,CAAA;AAC7B,QAAA,KAAA,CAAM,MAAA,GAAS,KAAA;AACf,QAAA;AAAA,MACJ;AAEA,MAAA,MAAM,SAAS,UAAA,CAAW,KAAA;AAC1B,MAAA,OAAA,CAAQ,GAAA,CAAI,YAAY,MAAM,CAAA;AAC9B,MAAA,KAAA,CAAM,MAAA,GAAS,MAAA;AAAA,IACnB;AACA,IAAA,OAAO,OAAA;AAAA,EACX;AAAA;AAGJ;;;ACn5GO,IAAM,cAAN,MAAkB;AAAA,EAAlB,WAAA,GAAA;AACN,IAAA,IAAA,CAAQ,IAAA,GAAoB,IAAA;AAAA,EAAA;AAAA;AAAA;AAAA,EAK5B,IAAI,MAAA,GAAiB;AACpB,IAAA,OAAO,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,IAAA,GAAO,CAAA;AAAA,EACrC;AAAA;AAAA,EAGA,IAAI,OAAA,GAAmB;AACtB,IAAA,OAAO,KAAK,IAAA,KAAS,IAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,KAAA,EAAmC;AACxC,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,KAAU,KAAK,IAAA,EAAM,IAAA,IAAQ,IAAI,OAAO,MAAA;AACzD,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAK,IAAA,EAAM,KAAK,CAAA,CAAE,MAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAA,CAAS,OAAe,MAAA,EAAsB;AAC7C,IAAA,MAAM,CAAC,IAAA,EAAM,KAAK,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,KAAK,CAAA;AAC5C,IAAA,IAAA,CAAK,IAAA,GAAO,MAAM,KAAA,CAAM,IAAA,EAAM,WAAW,MAAM,CAAC,GAAG,KAAK,CAAA;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,KAAA,EAAmC;AAC3C,IAAA,IAAI,QAAQ,CAAA,IAAK,KAAA,KAAU,KAAK,IAAA,EAAM,IAAA,IAAQ,IAAI,OAAO,MAAA;AAEzD,IAAA,MAAM,CAAC,IAAA,EAAM,QAAQ,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,KAAK,CAAA;AAC/C,IAAA,MAAM,CAAC,GAAA,EAAK,KAAK,CAAA,GAAI,KAAA,CAAM,UAAU,CAAC,CAAA;AAEtC,IAAA,MAAM,OAAA,GAAU,GAAA,GAAM,GAAA,CAAI,MAAA,GAAS,MAAA;AACnC,IAAA,IAAA,CAAK,IAAA,GAAO,KAAA,CAAM,IAAA,EAAM,KAAK,CAAA;AAC7B,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAA,CACC,UAAA,EACA,WAAA,EACA,MAAA,EACW;AACX,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAA;AAC3C,IAAA,MAAM,eAAe,IAAA,CAAK,GAAA;AAAA,MACzB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,WAAW,CAAA;AAAA,MAAA,CACtB,IAAA,CAAK,IAAA,EAAM,IAAA,IAAQ,CAAA,IAAK;AAAA,KAC1B;AAGA,IAAA,MAAM,CAAC,IAAA,EAAM,QAAQ,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,YAAY,CAAA;AACtD,IAAA,MAAM,CAAC,GAAA,EAAK,KAAK,CAAA,GAAI,KAAA,CAAM,UAAU,YAAY,CAAA;AAGjD,IAAA,MAAM,OAAA,GAAU,eAAe,GAAG,CAAA;AAGlC,IAAA,MAAM,OAAA,GAAU,UAAA,CAAW,MAAA,EAAQ,CAAA,EAAG,OAAO,MAAM,CAAA;AACnD,IAAA,IAAA,CAAK,OAAO,KAAA,CAAM,KAAA,CAAM,IAAA,EAAM,OAAO,GAAG,KAAK,CAAA;AAE7C,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,OAAA,EAAyB;AACnC,IAAA,IAAA,CAAK,IAAA,GAAO,UAAA,CAAW,OAAA,EAAS,CAAA,EAAG,QAAQ,MAAM,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAA,CAAS,YAAoB,QAAA,EAA4B;AACxD,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,UAAU,CAAA;AAC3C,IAAA,MAAM,UAAA,GAAa,KAAK,GAAA,CAAA,CAAK,IAAA,CAAK,MAAM,IAAA,IAAQ,CAAA,IAAK,GAAG,QAAQ,CAAA;AAChE,IAAA,IAAI,YAAA,GAAe,UAAA,EAAY,OAAO,EAAC;AAEvC,IAAA,MAAM,SAAmB,EAAC;AAC1B,IAAA,IAAA,CAAK,aAAa,IAAA,CAAK,IAAA,EAAM,YAAA,EAAc,UAAA,EAAY,GAAG,MAAM,CAAA;AAChE,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACb,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,EAAE,MAAA,CAAO,QAAQ,CAAA,GAA8B;AAC9C,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAAA,EAC9B;AAAA,EAEA,CAAS,QAAQ,IAAA,EAA6C;AAC7D,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAC7B,IAAA,MAAM,IAAA,CAAK,MAAA;AACX,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA;AAAA,EAC/B;AAAA;AAAA,EAIQ,MAAA,CAAO,MAAmB,KAAA,EAAqB;AAEtD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAM,IAAA,GAAO,IAAA,CAAM,KAAK,IAAA,GAAO,CAAA;AAEhD,IAAA,IAAI,QAAQ,QAAA,EAAU;AACrB,MAAA,OAAO,IAAA,CAAK,MAAA,CAAO,IAAA,CAAM,IAAA,EAAM,KAAK,CAAA;AAAA,IACrC,CAAA,MAAA,IAAW,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,IAAA;AAAA,IACR,CAAA,MAAO;AACN,MAAA,OAAO,KAAK,MAAA,CAAO,IAAA,CAAM,KAAA,EAAO,KAAA,GAAQ,WAAW,CAAC,CAAA;AAAA,IACrD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,YAAA,CACP,IAAA,EACA,WAAA,EACA,SAAA,EACA,QACA,MAAA,EACO;AACP,IAAA,IAAI,CAAC,IAAA,EAAM;AAEX,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,KAAK,IAAA,GAAO,CAAA;AAC9C,IAAA,MAAM,YAAY,MAAA,GAAS,QAAA;AAG3B,IAAA,IAAI,SAAA,GAAY,WAAA,IAAe,IAAA,CAAK,IAAA,EAAM;AACzC,MAAA,IAAA,CAAK,aAAa,IAAA,CAAK,IAAA,EAAM,WAAA,EAAa,SAAA,EAAW,QAAQ,MAAM,CAAA;AAAA,IACpE;AAGA,IAAA,IAAI,SAAA,IAAa,WAAA,IAAe,SAAA,IAAa,SAAA,EAAW;AACvD,MAAA,MAAA,CAAO,IAAA,CAAK,KAAK,MAAM,CAAA;AAAA,IACxB;AAGA,IAAA,IAAI,SAAA,GAAY,SAAA,IAAa,IAAA,CAAK,KAAA,EAAO;AACxC,MAAA,IAAA,CAAK,aAAa,IAAA,CAAK,KAAA,EAAO,aAAa,SAAA,EAAW,SAAA,GAAY,GAAG,MAAM,CAAA;AAAA,IAC5E;AAAA,EACD;AACD,CAAA;AAKA,SAAS,WAAW,MAAA,EAAsB;AACzC,EAAA,OAAO;AAAA,IACN,MAAA;AAAA,IACA,IAAA,EAAM,CAAA;AAAA,IACN,QAAA,EAAU,KAAK,MAAA,EAAO;AAAA,IACtB,IAAA,EAAM,IAAA;AAAA,IACN,KAAA,EAAO;AAAA,GACR;AACD;AAGA,SAAS,WAAW,IAAA,EAAkB;AACrC,EAAA,IAAA,CAAK,IAAA,GAAO,CAAA,IAAK,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,IAAA,GAAO,CAAA,CAAA,IAAM,IAAA,CAAK,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAA,GAAO,CAAA,CAAA;AACpF;AAMA,SAAS,KAAA,CAAM,MAAmB,KAAA,EAAiC;AAClE,EAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,EAAA,IAAI,CAAC,OAAO,OAAO,IAAA;AAEnB,EAAA,IAAI,IAAA,CAAK,QAAA,GAAW,KAAA,CAAM,QAAA,EAAU;AACnC,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA,CAAM,IAAA,CAAK,KAAA,EAAO,KAAK,CAAA;AACpC,IAAA,UAAA,CAAW,IAAI,CAAA;AACf,IAAA,OAAO,IAAA;AAAA,EACR,CAAA,MAAO;AACN,IAAA,KAAA,CAAM,IAAA,GAAO,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AACnC,IAAA,UAAA,CAAW,KAAK,CAAA;AAChB,IAAA,OAAO,KAAA;AAAA,EACR;AACD;AAQA,SAAS,KAAA,CACR,MACA,KAAA,EAC6B;AAC7B,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,CAAC,MAAM,IAAI,CAAA;AAE7B,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,KAAK,IAAA,GAAO,CAAA;AAE9C,EAAA,IAAI,SAAS,QAAA,EAAU;AACtB,IAAA,MAAM,CAAC,IAAA,EAAM,KAAK,IAAI,KAAA,CAAM,IAAA,CAAK,MAAM,KAAK,CAAA;AAC5C,IAAA,IAAA,CAAK,IAAA,GAAO,KAAA;AACZ,IAAA,UAAA,CAAW,IAAI,CAAA;AACf,IAAA,OAAO,CAAC,MAAM,IAAI,CAAA;AAAA,EACnB,CAAA,MAAO;AACN,IAAA,MAAM,CAAC,MAAM,KAAK,CAAA,GAAI,MAAM,IAAA,CAAK,KAAA,EAAO,KAAA,GAAQ,QAAA,GAAW,CAAC,CAAA;AAC5D,IAAA,IAAA,CAAK,KAAA,GAAQ,IAAA;AACb,IAAA,UAAA,CAAW,IAAI,CAAA;AACf,IAAA,OAAO,CAAC,MAAM,KAAK,CAAA;AAAA,EACpB;AACD;AAMA,SAAS,eAAe,IAAA,EAA6B;AACpD,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,OAAA,CAAQ,MAAM,MAAM,CAAA;AACpB,EAAA,OAAO,MAAA;AACR;AAEA,SAAS,OAAA,CAAQ,MAAmB,MAAA,EAAwB;AAC3D,EAAA,IAAI,CAAC,IAAA,EAAM;AACX,EAAA,OAAA,CAAQ,IAAA,CAAK,MAAM,MAAM,CAAA;AACzB,EAAA,MAAA,CAAO,IAAA,CAAK,KAAK,MAAM,CAAA;AACvB,EAAA,OAAA,CAAQ,IAAA,CAAK,OAAO,MAAM,CAAA;AAC3B;AAQA,SAAS,UAAA,CAAW,OAAA,EAAmB,KAAA,EAAe,GAAA,EAA0B;AAC/E,EAAA,IAAI,KAAA,IAAS,KAAK,OAAO,IAAA;AAEzB,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAA,CAAO,KAAA,GAAQ,OAAO,CAAC,CAAA;AAIxC,EAAA,MAAM,QAAA,GAAW,aAAa,GAAG,CAAA;AAEjC,EAAA,MAAM,IAAA,GAAa;AAAA,IAClB,MAAA,EAAQ,QAAQ,GAAG,CAAA;AAAA,IACnB,MAAM,GAAA,GAAM,KAAA;AAAA,IACZ,QAAA;AAAA,IACA,IAAA,EAAM,UAAA,CAAW,OAAA,EAAS,KAAA,EAAO,GAAG,CAAA;AAAA,IACpC,KAAA,EAAO,UAAA,CAAW,OAAA,EAAS,GAAA,GAAM,GAAG,GAAG;AAAA,GACxC;AAEA,EAAA,OAAO,IAAA;AACR;AAMA,SAAS,aAAa,IAAA,EAAsB;AAC3C,EAAA,IAAI,CAAA,GAAI,IAAA;AACR,EAAA,CAAA,GAAA,CAAM,CAAA,IAAK,KAAM,CAAA,IAAK,QAAA;AACtB,EAAA,CAAA,GAAA,CAAM,CAAA,IAAK,KAAM,CAAA,IAAK,QAAA;AACtB,EAAA,CAAA,GAAK,KAAK,EAAA,GAAM,CAAA;AAChB,EAAA,OAAO,CAAA,GAAI,UAAA;AACZ;;;ACrMO,IAAM,gBAAN,MAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6C1B,WAAA,CAAY,QAAA,GAAmB,cAAA,CAAe,WAAA,CAAY,gBAAA,EAAkB;AA3C5E;AAAA,IAAA,IAAA,CAAQ,KAAA,uBAAoC,GAAA,EAAI;AAGhD;AAAA,IAAA,IAAA,CAAQ,SAAA,GAAyB,IAAI,WAAA,EAAY;AAGjD;AAAA,IAAA,IAAA,CAAQ,UAAA,GAAqB,CAAA;AAM7B;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,cAAA,GAA6C,IAAA;AAcrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,YAAA,uBAAgC,GAAA,EAAI;AAkB3C,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,YAAY,IAAA,EAAoB;AAG/B,IAAA,MAAM,SAAA,GAAY,UAAA,CAAW,IAAA,EAAM,IAAA,CAAK,QAAQ,CAAA;AAChD,IAAA,IAAI,SAAA,GAAY,KAAK,QAAA,EAAU;AAC9B,MAAA,MAAM,YAAA,CAAa,SAAA;AAAA,QAClB,oBAAA;AAAA,QACA,CAAA,4BAAA,EAA+B,IAAA,CAAK,QAAA,CAAS,cAAA,CAAe,OAAO,CAAC,CAAA,sDAAA,CAAA;AAAA,QACpE,EAAE,QAAA,EAAU,IAAA,CAAK,QAAA;AAAS,OAC3B;AAAA,IACD;AACA,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AACjB,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AACtB,IAAA,IAAA,CAAK,aAAa,KAAA,EAAM;AACxB,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAElB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAChC,IAAA,MAAM,OAAA,GAAU,IAAI,KAAA,CAAc,QAAA,CAAS,MAAM,CAAA;AAEjD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACzC,MAAA,MAAM,SAAS,IAAA,CAAK,UAAA,EAAA;AACpB,MAAA,OAAA,CAAQ,CAAC,CAAA,GAAI,MAAA;AACb,MAAA,IAAA,CAAK,KAAA,CAAM,IAAI,MAAA,EAAQ;AAAA,QACtB,MAAA;AAAA,QACA,QAAA,EAAU,QAAA,CAAS,QAAA,CAAS,CAAC,CAAC,CAAA;AAAA,QAC9B,IAAA,EAAM,SAAS,CAAC,CAAA;AAAA,QAChB,aAAa,EAAC;AAAA,QACd,WAAW,EAAC;AAAA,QACZ,OAAO,EAAC;AAAA,QACR,QAAQ,EAAC;AAAA,QACT,SAAS,EAAC;AAAA,QACV,MAAA,EAAQ,IAAA;AAAA,QACR,KAAA,EAAO,IAAA;AAAA,QACP,aAAA,EAAe,KAAA;AAAA,QACf,SAAS,QAAA,CAAS,CAAC,CAAA,CAAE,IAAA,GAAO,MAAA,KAAW,CAAA;AAAA,QACvC,gBAAA,EAAkB;AAAA,OAClB,CAAA;AAAA,IACF;AAGA,IAAA,IAAA,CAAK,SAAA,CAAU,WAAW,OAAO,CAAA;AAKjC,IAAA,KAAA,MAAW,EAAA,IAAM,OAAA,EAAS,IAAA,CAAK,YAAA,CAAa,IAAI,EAAE,CAAA;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA,aAAa,OAAA,EAA2C;AACvD,IAAA,MAAM,WAAqB,EAAC;AAC5B,IAAA,MAAM,UAAoB,EAAC;AAG3B,IAAA,MAAM,MAAA,GAAS,CAAC,GAAG,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,SAAA,GAAY,CAAA,CAAE,SAAS,CAAA;AAEpE,IAAA,KAAA,MAAW,UAAU,MAAA,EAAQ;AAC5B,MAAA,MAAM,QAAA,GAAW,OAAO,SAAA,GAAY,CAAA;AAGpC,MAAA,MAAM,SAAmB,EAAC;AAC1B,MAAA,KAAA,MAAW,IAAA,IAAQ,OAAO,WAAA,EAAa;AACtC,QAAA,MAAM,SAAS,IAAA,CAAK,UAAA,EAAA;AACpB,QAAA,MAAA,CAAO,KAAK,MAAM,CAAA;AAClB,QAAA,QAAA,CAAS,KAAK,MAAM,CAAA;AACpB,QAAA,IAAA,CAAK,KAAA,CAAM,IAAI,MAAA,EAAQ;AAAA,UACtB,MAAA;AAAA,UACA,QAAA,EAAU,SAAS,IAAI,CAAA;AAAA,UACvB,IAAA;AAAA,UACA,aAAa,EAAC;AAAA,UACd,WAAW,EAAC;AAAA,UACZ,OAAO,EAAC;AAAA,UACR,QAAQ,EAAC;AAAA,UACT,SAAS,EAAC;AAAA,UACV,MAAA,EAAQ,IAAA;AAAA,UACR,KAAA,EAAO,IAAA;AAAA,UACP,aAAA,EAAe,KAAA;AAAA,UACf,OAAA,EAAS,IAAA,CAAK,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AAAA,UAChC,gBAAA,EAAkB;AAAA,SAClB,CAAA;AAAA,MACF;AAGA,MAAA,KAAA,MAAW,EAAA,IAAM,MAAA,EAAQ,IAAA,CAAK,YAAA,CAAa,IAAI,EAAE,CAAA;AAGjD,MAAA,MAAM,UAAA,GAAa,KAAK,SAAA,CAAU,QAAA;AAAA,QACjC,QAAA;AAAA,QACA,MAAA,CAAO,WAAA;AAAA,QACP;AAAA,OACD;AACA,MAAA,KAAA,MAAW,MAAM,UAAA,EAAY;AAC5B,QAAA,OAAA,CAAQ,KAAK,EAAE,CAAA;AACf,QAAA,IAAA,CAAK,KAAA,CAAM,OAAO,EAAE,CAAA;AACpB,QAAA,IAAA,CAAK,YAAA,CAAa,OAAO,EAAE,CAAA;AAAA,MAC5B;AAAA,IACD;AAGA,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AAEtB,IAAA,OAAO,EAAE,UAAU,OAAA,EAAQ;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,CAAY,QAAgB,KAAA,EAA2B;AACtD,IAAA,MAAM,MAAA,GAAqB;AAAA,MAC1B,SAAA,EAAW,MAAA;AAAA,MACX,WAAA,EAAa,CAAA;AAAA,MACb,WAAA,EAAa;AAAA,KACd;AACA,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,YAAA,CAAa,CAAC,MAAM,CAAC,CAAA;AACzC,IAAA,OAAO,MAAA,CAAO,QAAA;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAA,CAAY,WAAmB,OAAA,EAA2B;AACzD,IAAA,MAAM,MAAA,GAAqB;AAAA,MAC1B,SAAA;AAAA,MACA,WAAA,EAAa,UAAU,SAAA,GAAY,CAAA;AAAA,MACnC,aAAa;AAAC,KACf;AACA,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,YAAA,CAAa,CAAC,MAAM,CAAC,CAAA;AACzC,IAAA,OAAO,MAAA,CAAO,OAAA;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAA,CAAS,YAAoB,OAAA,EAA0B;AACtD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,UAAU,CAAA;AACvC,IAAA,IAAI,CAAC,OAAO,OAAO,KAAA;AAEnB,IAAA,MAAM,OAAA,GAAU,SAAS,OAAO,CAAA;AAChC,IAAA,IAAI,OAAA,KAAY,KAAA,CAAM,QAAA,EAAU,OAAO,KAAA;AAEvC,IAAA,KAAA,CAAM,IAAA,GAAO,OAAA;AACb,IAAA,KAAA,CAAM,QAAA,GAAW,OAAA;AACjB,IAAA,KAAA,CAAM,cAAc,EAAC;AACrB,IAAA,KAAA,CAAM,YAAY,EAAC;AACnB,IAAA,KAAA,CAAM,UAAU,EAAC;AACjB,IAAA,KAAA,CAAM,MAAA,GAAS,IAAA;AACf,IAAA,KAAA,CAAM,gBAAA,GAAmB,CAAA;AACzB,IAAA,KAAA,CAAM,KAAA,GAAQ,IAAA;AACd,IAAA,IAAA,CAAK,YAAA,CAAa,GAAA,CAAI,KAAA,CAAM,MAAM,CAAA;AAClC,IAAA,KAAA,CAAM,OAAA,GAAU,OAAA,CAAQ,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AAC1C,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,QAAA,EAAyC;AAClD,IAAA,MAAM,MAAM,QAAA,GAAW,CAAA;AACvB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA;AACvC,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,MAAA;AACjC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAgB,MAAA,EAAwB;AACvC,IAAA,IAAI,KAAK,cAAA,EAAgB;AACxB,MAAA,OAAO,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,IAAK,EAAA;AAAA,IAC3C;AAGA,IAAA,IAAA,CAAK,cAAA,uBAAqB,GAAA,EAAI;AAC9B,IAAA,IAAI,GAAA,GAAM,CAAA;AACV,IAAA,KAAA,MAAW,EAAA,IAAM,KAAK,SAAA,EAAW;AAChC,MAAA,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,EAAA,EAAI,GAAA,EAAK,CAAA;AAAA,IAClC;AAEA,IAAA,OAAO,IAAA,CAAK,cAAA,CAAe,GAAA,CAAI,MAAM,CAAA,IAAK,EAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAA,CAAgB,WAAmB,OAAA,EAA8B;AAChE,IAAA,MAAM,UAAU,IAAA,CAAK,SAAA,CAAU,SAAS,SAAA,GAAY,CAAA,EAAG,UAAU,CAAC,CAAA;AAClE,IAAA,MAAM,SAAsB,EAAC;AAC7B,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC7B,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,MAAA,IAAI,KAAA,EAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA;AAAA,IAC7B;AACA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,GAA2B;AAC1B,IAAA,OAAO,IAAA,CAAK,eAAA,CAAgB,CAAA,EAAG,IAAA,CAAK,SAAS,CAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,MAAA,EAAuC;AAClD,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA,GAA6B;AAC5B,IAAA,MAAM,SAAsB,EAAC;AAC7B,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACxC,MAAA,IAAI,KAAA,CAAM,KAAA,EAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA;AAAA,IACnC;AACA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,sBAAsB,QAAA,EAA2B;AAChD,IAAA,KAAA,MAAW,MAAA,IAAU,KAAK,YAAA,EAAc;AACvC,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,CAAgB,MAAM,CAAA;AACvC,MAAA,IAAI,GAAA,IAAO,CAAA,IAAK,GAAA,GAAM,QAAA,EAAU,OAAO,IAAA;AAAA,IACxC;AACA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,iCAAiC,QAAA,EAA2B;AAC3D,IAAA,KAAA,MAAW,MAAA,IAAU,KAAK,YAAA,EAAc;AACvC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,MAAA,IAAI,CAAC,KAAA,IAAS,CAAC,KAAA,CAAM,aAAA,EAAe;AACpC,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,eAAA,CAAgB,MAAM,CAAA;AACvC,MAAA,IAAI,GAAA,IAAO,CAAA,IAAK,GAAA,GAAM,QAAA,EAAU,OAAO,IAAA;AAAA,IACxC;AACA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA,EAGA,IAAI,UAAA,GAAqB;AACxB,IAAA,OAAO,KAAK,YAAA,CAAa,IAAA;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,eAAA,CAAgB,QAAgB,mBAAA,EAAsC;AACrE,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,OAAO,KAAA,KAAU,MAAA,IAAa,KAAA,CAAM,QAAA,KAAa,mBAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,MAAA,EAAsB;AAC/B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,KAAA,EAAO;AACV,MAAA,KAAA,CAAM,KAAA,GAAQ,KAAA;AACd,MAAA,IAAA,CAAK,YAAA,CAAa,OAAO,MAAM,CAAA;AAAA,IAChC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAAsB,UAAA,EAA0B;AAC/C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,UAAU,CAAA;AACvC,IAAA,IAAI,KAAA,EAAO;AACV,MAAA,KAAA,CAAM,KAAA,GAAQ,IAAA;AACd,MAAA,IAAA,CAAK,YAAA,CAAa,GAAA,CAAI,KAAA,CAAM,MAAM,CAAA;AAAA,IACnC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,MAAA,EAAsB;AAC/B,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,KAAA,EAAO;AACV,MAAA,KAAA,CAAM,KAAA,GAAQ,IAAA;AACd,MAAA,IAAA,CAAK,YAAA,CAAa,IAAI,MAAM,CAAA;AAAA,IAC7B;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA,GAAsB;AACrB,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,KAAA,CAAM,MAAA,EAAO,EAAG;AACxC,MAAA,KAAA,CAAM,KAAA,GAAQ,IAAA;AAAA,IACf;AACA,IAAA,IAAA,CAAK,eAAe,IAAI,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,MAAM,CAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,gBAAA,CACC,QACA,OAAA,EACA,SAAA,EACA,aACA,KAAA,EACA,MAAA,EACA,aAAA,EACA,gBAAA,GAA2B,CAAA,EACpB;AACP,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,KAAA,EAAO;AACZ,IAAA,KAAA,CAAM,OAAA,GAAU,OAAA;AAChB,IAAA,KAAA,CAAM,MAAA,GAAS,OAAA,CAAQ,CAAC,CAAA,GAAI,CAAC,CAAA,IAAK,IAAA;AAClC,IAAA,KAAA,CAAM,SAAA,GAAY,SAAA;AAClB,IAAA,KAAA,CAAM,WAAA,GAAc,WAAA;AACpB,IAAA,KAAA,CAAM,KAAA,GAAQ,KAAA;AACd,IAAA,KAAA,CAAM,MAAA,GAAS,MAAA;AACf,IAAA,KAAA,CAAM,aAAA,GAAgB,aAAA;AACtB,IAAA,KAAA,CAAM,gBAAA,GAAmB,gBAAA;AACzB,IAAA,KAAA,CAAM,KAAA,GAAQ,KAAA;AACd,IAAA,IAAA,CAAK,YAAA,CAAa,OAAO,MAAM,CAAA;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,kBAAA,CACC,QACA,WAAA,EACA,SAAA,EACA,OACA,MAAA,EACA,aAAA,EACA,mBAA2B,CAAA,EACpB;AACP,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,KAAA,EAAO;AACZ,IAAA,KAAA,CAAM,WAAA,GAAc,WAAA;AACpB,IAAA,KAAA,CAAM,SAAA,GAAY,SAAA;AAClB,IAAA,KAAA,CAAM,KAAA,GAAQ,KAAA;AACd,IAAA,KAAA,CAAM,MAAA,GAAS,MAAA;AACf,IAAA,KAAA,CAAM,aAAA,GAAgB,aAAA;AACtB,IAAA,KAAA,CAAM,gBAAA,GAAmB,gBAAA;AAAA,EAE1B;AAAA;AAAA,EAIA,IAAI,SAAA,GAAoB;AACvB,IAAA,OAAO,KAAK,SAAA,CAAU,MAAA;AAAA,EACvB;AAAA,EAEA,IAAI,OAAA,GAAmB;AACtB,IAAA,OAAO,KAAK,SAAA,CAAU,OAAA;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,EAAE,MAAA,CAAO,QAAQ,CAAA,GAAiC;AACjD,IAAA,KAAA,MAAW,MAAA,IAAU,KAAK,SAAA,EAAW;AACpC,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AACnC,MAAA,IAAI,OAAO,MAAM,KAAA;AAAA,IAClB;AAAA,EACD;AAAA;AAAA,EAIA,KAAA,GAAc;AACb,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AACjB,IAAA,IAAA,CAAK,UAAU,KAAA,EAAM;AACrB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AACtB,IAAA,IAAA,CAAK,UAAA,GAAa,CAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,GAAiB;AAChB,IAAA,OAAO;AAAA,MACN,WAAW,IAAA,CAAK,SAAA;AAAA,MAChB,OAAO,IAAA,CAAK,WAAA,EAAY,CAAE,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,QACrC,QAAQ,CAAA,CAAE,MAAA;AAAA,QACV,IAAA,EAAM,CAAA,CAAE,IAAA,CAAK,SAAA,CAAU,GAAG,EAAE,CAAA;AAAA;AAAA,QAC5B,UAAU,CAAA,CAAE,QAAA;AAAA,QACZ,OAAO,CAAA,CAAE,KAAA;AAAA,QACT,eAAe,CAAA,CAAE,aAAA;AAAA,QACjB,SAAS,CAAA,CAAE,OAAA;AAAA,QACX,WAAA,EAAa,CAAA,CAAE,SAAA,CAAU,MAAA,GAAS,CAAA;AAAA,QAClC,SAAA,EAAW,CAAA,CAAE,OAAA,CAAQ,MAAA,GAAS,CAAA;AAAA,QAC9B,kBAAkB,CAAA,CAAE,gBAAA;AAAA,QACpB,OAAO,CAAA,CAAE,KAAA;AAAA,QACT,QAAQ,CAAA,CAAE;AAAA,OACX,CAAE;AAAA,KACH;AAAA,EACD;AACD;;;ACxnBO,IAAM,2BAAN,MAA+B;AAAA,EAWrC,WAAA,GAAc;AAVd,IAAA,IAAA,CAAQ,MAAA,GAAwB,IAAA;AAChC,IAAA,IAAA,CAAQ,MAAA,GAAS,CAAA;AACjB,IAAA,IAAA,CAAQ,OAAA,uBAAc,GAAA,EAMpB;AAAA,EAEa;AAAA;AAAA;AAAA;AAAA;AAAA,EAMP,YAAA,GAAuB;AAC9B,IAAA,IAAI,IAAA,CAAK,MAAA,EAAQ,OAAO,IAAA,CAAK,MAAA;AAE7B,IAAA,IAAA,CAAK,SAAS,qBAAA,EAAwB;AAEtC,IAAA,IAAA,CAAK,MAAA,CAAO,SAAA,GAAY,CAAC,KAAA,KAAwB;AAChD,MAAA,MAAM,OAAO,KAAA,CAAM,IAAA;AACnB,MAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,gBAAA,EAAkB;AAE7C,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,OAAA,CAAQ,GAAA,CAAI,KAAK,EAAE,CAAA;AACxC,MAAA,IAAI,CAAC,OAAA,EAAS;AAEd,MAAA,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,IAAA,CAAK,EAAE,CAAA;AAE3B,MAAA,MAAM,UAAiC,EAAC;AACxC,MAAA,KAAA,MAAW,GAAA,IAAO,KAAK,OAAA,EAAkC;AACxD,QAAA,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,iBAAA,CAAkB,GAAG,CAAC,CAAA;AAAA,MACzC;AACA,MAAA,OAAA,CAAQ,QAAQ,OAAO,CAAA;AAAA,IACxB,CAAA;AAEA,IAAA,IAAA,CAAK,MAAA,CAAO,OAAA,GAAU,CAAC,GAAA,KAAQ;AAE9B,MAAA,KAAA,MAAW,CAAC,EAAA,EAAI,OAAO,CAAA,IAAK,KAAK,OAAA,EAAS;AACzC,QAAA,OAAA,CAAQ,MAAA;AAAA,UACP,IAAI,KAAA,CAAM,CAAA,0BAAA,EAA6B,GAAA,CAAI,OAAO,CAAA,CAAE;AAAA,SACrD;AACA,QAAA,IAAA,CAAK,OAAA,CAAQ,OAAO,EAAE,CAAA;AAAA,MACvB;AAAA,IACD,CAAA;AAEA,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,aAAa,KAAA,EAA6D;AAC/E,IAAA,IAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAEhC,IAAA,MAAM,MAAA,GAAS,KAAK,YAAA,EAAa;AACjC,IAAA,MAAM,KAAK,IAAA,CAAK,MAAA,EAAA;AAEhB,IAAA,OAAO,IAAI,OAAA,CAA+B,CAAC,OAAA,EAAS,MAAA,KAAW;AAC9D,MAAA,IAAA,CAAK,QAAQ,GAAA,CAAI,EAAA,EAAI,EAAE,OAAA,EAAS,QAAQ,CAAA;AAExC,MAAA,MAAA,CAAO,WAAA,CAAY;AAAA,QAClB,IAAA,EAAM,eAAA;AAAA,QACN,EAAA;AAAA,QACA;AAAA,OACA,CAAA;AAAA,IACF,CAAC,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,YAAA,CACC,SACA,GAAA,EACS;AAET,IAAA,MAAM,QAAA,uBAAe,GAAA,EAUnB;AAGF,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC7B,MAAA,IAAI,OAAO,KAAA,EAAO;AAGlB,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,WAAA,CAAY,MAAA,CAAO,MAAM,CAAA;AAC3C,MAAA,IAAI,CAAC,KAAA,EAAO;AAGZ,MAAA,IAAI,KAAA,CAAM,QAAA,KAAa,MAAA,CAAO,mBAAA,EAAqB;AAGnD,MAAA,IAAI,KAAA,GAAQ,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,MAAM,CAAA;AACtC,MAAA,IAAI,CAAC,KAAA,EAAO;AACX,QAAA,KAAA,GAAQ;AAAA,UACP,WAAW,EAAC;AAAA,UACZ,KAAA,sBAAW,GAAA,EAAI;AAAA,UACf,MAAA,sBAAY,GAAA,EAAI;AAAA,UAChB,aAAA,EAAe,KAAA;AAAA,UACf,WAAA,EAAa,KAAA,CAAM,WAAA,CAAY,MAAA,GAAS,CAAA,GAAI,CAAC,GAAG,KAAA,CAAM,WAAW,CAAA,GAAI,EAAC;AAAA,UACtE,UAAU,MAAA,CAAO;AAAA,SAClB;AACA,QAAA,QAAA,CAAS,GAAA,CAAI,MAAA,CAAO,MAAA,EAAQ,KAAK,CAAA;AAAA,MAClC;AAEA,MAAA,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,MAAA,CAAO,OAAO,CAAA;AACnC,MAAA,KAAA,MAAW,KAAK,MAAA,CAAO,KAAA,EAAO,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA;AAC/C,MAAA,KAAA,MAAW,KAAK,MAAA,CAAO,MAAA,EAAQ,KAAA,CAAM,MAAA,CAAO,IAAI,CAAC,CAAA;AACjD,MAAA,IAAI,MAAA,CAAO,aAAA,EAAe,KAAA,CAAM,aAAA,GAAgB,IAAA;AAChD,IACD;AAGA,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,KAAA,MAAW,CAAC,MAAA,EAAQ,KAAK,CAAA,IAAK,QAAA,EAAU;AACvC,MAAA,IAAI,KAAA,CAAM,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG;AAGlC,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,WAAA,CAAY,MAAM,CAAA;AACpC,MAAA,MAAM,gBAAA,GAAmB,OAAO,gBAAA,IAAoB,CAAA;AACpD,MAAA,GAAA,CAAI,kBAAA;AAAA,QACH,MAAA;AAAA,QACA,KAAA,CAAM,WAAA;AAAA,QACN,KAAA,CAAM,SAAA;AAAA,QACN,CAAC,GAAG,KAAA,CAAM,KAAK,CAAA;AAAA,QACf,CAAC,GAAG,KAAA,CAAM,MAAM,CAAA;AAAA,QAChB,KAAA,CAAM,aAAA;AAAA,QACN;AAAA,OACD;AACA,MAAA,MAAA,IAAU,MAAM,SAAA,CAAU,MAAA;AAAA,IAC3B;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,SAAA,GAAkB;AACjB,IAAA,IAAI,KAAK,MAAA,EAAQ;AAChB,MAAA,IAAA,CAAK,OAAO,SAAA,EAAU;AACtB,MAAA,IAAA,CAAK,MAAA,GAAS,IAAA;AACd,MAAA,IAAA,CAAK,QAAQ,KAAA,EAAM;AAAA,IACpB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,QAAA,GAAoB;AACvB,IAAA,OAAO,KAAK,MAAA,KAAW,IAAA;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,kBAAkB,GAAA,EAA+C;AACxE,IAAA,IAAI,IAAI,KAAA,EAAO;AACd,MAAA,OAAO;AAAA,QACN,QAAQ,GAAA,CAAI,MAAA;AAAA,QACZ,qBAAqB,GAAA,CAAI,mBAAA;AAAA,QACzB,SAAS,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,UAAU,KAAA,EAAM;AAAA,QAClG,OAAO,EAAC;AAAA,QACR,QAAQ,EAAC;AAAA,QACT,aAAA,EAAe,KAAA;AAAA,QACf,OAAO,GAAA,CAAI;AAAA,OACZ;AAAA,IACD;AAIA,IAAA,MAAM,OAAA,GACL,GAAA,CAAI,aAAA,GAAgB,CAAA,GACjB,IAAI,UAAA,CAAW,GAAA,CAAI,aAAA,EAAe,CAAA,EAAG,GAAA,CAAI,aAAa,CAAA,GACtD,IAAI,WAAW,CAAC,CAAA;AACpB,IAAA,MAAM,OAAA,GACL,GAAA,CAAI,aAAA,GAAgB,CAAA,GACjB,IAAI,YAAA,CAAa,GAAA,CAAI,aAAA,EAAe,CAAA,EAAG,GAAA,CAAI,aAAa,CAAA,GACxD,IAAI,aAAa,CAAC,CAAA;AAEtB,IAAA,MAAM,OAAA,GAA2B;AAAA,MAChC,OAAA;AAAA,MACA,OAAA;AAAA,MACA,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,QAAA,EAAU;AAAA,KACX;AAEA,IAAA,OAAO;AAAA,MACN,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,qBAAqB,GAAA,CAAI,mBAAA;AAAA,MACzB,OAAA;AAAA,MACA,OAAO,GAAA,CAAI,KAAA;AAAA,MACX,QAAQ,GAAA,CAAI,MAAA;AAAA,MACZ,eAAe,GAAA,CAAI,aAAA;AAAA,MACnB,KAAA,EAAO;AAAA,KACR;AAAA,EACD;AACD,CAAA;;;AChQO,IAAM,SAAA,GAAY,GAAA;AAGzB,IAAM,eAAA,GAAkB,CAAA;AAGxB,IAAM,gBAAA,GAAmB,CAAA;AAGzB,IAAM,kBAAA,GAAqB,CAAA;AAY3B,IAAM,iBAAA,GAAoB,eAAA;AAYnB,IAAM,WAAA,GAAN,MAAM,YAAA,CAAY;AAAA,EAAlB,WAAA,GAAA;AAEN;AAAA,IAAA,IAAA,CAAQ,iBAAA,GAAmC,IAAA;AAG3C;AAAA,IAAA,IAAA,CAAQ,cAAA,GAAuC,IAAA;AAG/C;AAAA,IAAA,IAAA,CAAQ,UAAA,uBAAsC,GAAA,EAAI;AAGlD;AAAA,IAAA,IAAA,CAAQ,SAAA,GAAY,CAAA;AAAA,EAAA;AAAA;AAAA;AAAA,EAKpB,OAAO,YAAY,UAAA,EAA4B;AAC9C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAA,CAAO,UAAA,GAAa,CAAA,IAAK,SAAS,CAAA;AAAA,EAC/C;AAAA;AAAA,EAGA,OAAO,SAAA,CACN,OAAA,EACA,YAAA,EACyC;AACzC,IAAA,OAAO;AAAA,MACN,SAAA,EAAW,UAAU,SAAA,GAAY,CAAA;AAAA,MACjC,SAAS,IAAA,CAAK,GAAA,CAAA,CAAK,OAAA,GAAU,CAAA,IAAK,WAAW,YAAY;AAAA,KAC1D;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,gBAAgB,WAAA,EAA0D;AACzE,IAAA,IAAI,IAAA,CAAK,iBAAA,KAAsB,IAAA,EAAM,OAAO,IAAA;AAC5C,IAAA,IAAI,WAAA,CAAY,SAAA,GAAY,IAAA,CAAK,iBAAA,EAAmB,OAAO,MAAA;AAC3D,IAAA,IAAI,WAAA,CAAY,SAAA,GAAY,IAAA,CAAK,iBAAA,EAAmB,OAAO,IAAA;AAC3D,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,iBAAA,CACC,UACA,GAAA,EACO;AAEP,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA,CAAK,eAAA,CAAgB,QAAQ,CAAA;AACnD,IAAA,IAAA,CAAK,oBAAoB,QAAA,CAAS,SAAA;AAElC,IAAA,MAAM,eAAe,GAAA,CAAI,SAAA;AACzB,IAAA,MAAM,iBAAA,GAAoB,YAAA,CAAY,WAAA,CAAY,QAAA,CAAS,SAAS,CAAA;AACpE,IAAA,MAAM,eAAA,GAAkB,YAAA,CAAY,WAAA,CAAY,QAAA,CAAS,OAAO,CAAA;AAChE,IAAA,MAAM,QAAA,GAAW,YAAA,CAAY,WAAA,CAAY,YAAY,CAAA;AAKrD,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,oBAAoB,eAAe,CAAA;AAChE,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,kBAAkB,eAAe,CAAA;AACnE,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,oBAAoB,gBAAgB,CAAA;AAClE,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,kBAAkB,gBAAgB,CAAA;AAGrE,IAAA,KAAA,IAAS,CAAA,GAAI,QAAA,EAAU,CAAA,IAAK,MAAA,EAAQ,CAAA,EAAA,EAAK;AACxC,MAAA,IAAA,CAAK,UAAU,CAAC,CAAA;AAAA,IACjB;AAGA,IAAA,KAAA,IAAS,CAAA,GAAI,SAAA,EAAW,CAAA,IAAK,OAAA,EAAS,CAAA,EAAA,EAAK;AAC1C,MAAA,IAAI,CAAA,IAAK,QAAA,IAAY,CAAA,IAAK,MAAA,EAAQ;AAClC,MAAA,IAAA,CAAK,gBAAA,CAAiB,CAAA,EAAG,GAAA,EAAK,YAAY,CAAA;AAAA,IAC3C;AAMA,IAAA,MAAM,cAAc,SAAA,GAAY,CAAA;AAChC,IAAA,MAAM,gBAAgB,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,WAAA,GAAc,oBAAoB,CAAC,CAAA;AACrE,IAAA,KAAA,IAAS,CAAA,GAAI,aAAA,EAAe,CAAA,IAAK,WAAA,EAAa,CAAA,EAAA,EAAK;AAClD,MAAA,IAAA,CAAK,iBAAA,CAAkB,CAAA,EAAG,GAAA,EAAK,YAAY,CAAA;AAAA,IAC5C;AAEA,IAAA,MAAM,iBAAiB,OAAA,GAAU,CAAA;AACjC,IAAA,MAAM,eAAe,IAAA,CAAK,GAAA,CAAI,QAAA,EAAU,cAAA,GAAiB,oBAAoB,CAAC,CAAA;AAC9E,IAAA,KAAA,IAAS,CAAA,GAAI,cAAA,EAAgB,CAAA,IAAK,YAAA,EAAc,CAAA,EAAA,EAAK;AACpD,MAAA,IAAA,CAAK,iBAAA,CAAkB,CAAA,EAAG,GAAA,EAAK,YAAY,CAAA;AAAA,IAC5C;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,iBAAA,CACC,UACA,GAAA,EACkE;AAIlE,IAAA,MAAM,YAAY,IAAA,CAAK,cAAA;AACvB,IAAA,IAAI,CAAC,SAAA,EAAW,OAAO,EAAC;AAExB,IAAA,MAAM,QAAyE,EAAC;AAGhF,IAAA,MAAM,eAAA,GAAkB,YAAA,CAAY,WAAA,CAAY,QAAA,CAAS,OAAO,CAAA;AAChE,IAAA,MAAM,iBAAA,GAAoB,YAAA,CAAY,WAAA,CAAY,QAAA,CAAS,SAAS,CAAA;AACpE,IAAA,MAAM,QAAA,GAAW,YAAA,CAAY,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AAEtD,IAAA,MAAM,QAAkB,EAAC;AACzB,IAAA,IAAI,cAAc,MAAA,EAAQ;AAEzB,MAAA,MAAM,SAAA,GAAY,kBAAkB,eAAA,GAAkB,CAAA;AACtD,MAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,SAAA,GAAY,kBAAA,GAAqB,GAAG,QAAQ,CAAA;AACrE,MAAA,KAAA,IAAS,IAAI,SAAA,EAAW,CAAA,IAAK,OAAA,IAAW,CAAA,IAAK,UAAU,CAAA,EAAA,EAAK;AAC3D,QAAA,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,MACb;AAAA,IACD,CAAA,MAAO;AAEN,MAAA,MAAM,gBAAA,GAAmB,oBAAoB,eAAA,GAAkB,CAAA;AAC/D,MAAA,KAAA,IAAS,IAAI,gBAAA,EAAkB,CAAA,GAAI,mBAAmB,kBAAA,IAAsB,CAAA,IAAK,GAAG,CAAA,EAAA,EAAK;AACxF,QAAA,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,MACb;AAAA,IACD;AAEA,IAAA,KAAA,MAAW,WAAW,KAAA,EAAO;AAC5B,MAAA,MAAM,KAAA,GAAQ,YAAA,CAAY,SAAA,CAAU,OAAA,EAAS,IAAI,SAAS,CAAA;AAC1D,MAAA,KAAA,IAAS,MAAM,KAAA,CAAM,SAAA,EAAW,GAAA,IAAO,KAAA,CAAM,SAAS,GAAA,EAAA,EAAO;AAC5D,QAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AAC/B,QAAA,IAAI,CAAC,KAAA,EAAO;AACZ,QAAA,IAAI,CAAC,MAAM,KAAA,EAAO;AAClB,QAAA,IAAI,MAAM,SAAA,CAAU,MAAA,GAAS,CAAA,IAAK,CAAC,MAAM,aAAA,EAAe;AACxD,QAAA,IAAI,MAAM,OAAA,EAAS;AAKnB,QAAA,IAAI,KAAA,CAAM,WAAA,CAAY,MAAA,GAAS,CAAA,EAAG;AAEjC,UAAA,KAAA,MAAW,UAAA,IAAc,MAAM,WAAA,EAAa;AAC3C,YAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAK,EAAG;AACxB,YAAA,KAAA,CAAM,IAAA,CAAK;AAAA,cACV,QAAQ,KAAA,CAAM,MAAA;AAAA,cACd,UAAA;AAAA,cACA,UAAU,KAAA,CAAM;AAAA,aAChB,CAAA;AAAA,UACF;AAAA,QACD,CAAA,MAAO;AAEN,UAAA,MAAM,WAAA,GAAc,WAAA,CAAY,gBAAA,CAAiB,KAAA,CAAM,IAAI,CAAA;AAC3D,UAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC3B,YAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC/B,cAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,IAAA,EAAK,EAAG;AAC7B,cAAA,KAAA,CAAM,IAAA,CAAK;AAAA,gBACV,QAAQ,KAAA,CAAM,MAAA;AAAA,gBACd,YAAY,IAAA,CAAK,UAAA;AAAA,gBACjB,UAAU,KAAA,CAAM;AAAA,eAChB,CAAA;AAAA,YACF;AAAA,UACD,CAAA,MAAO;AAEN,YAAA,MAAM,UAAA,GAAa,KAAA,CAAM,IAAA,CAAK,IAAA,EAAK;AACnC,YAAA,IAAI,UAAA,EAAY;AACf,cAAA,KAAA,CAAM,IAAA,CAAK;AAAA,gBACV,QAAQ,KAAA,CAAM,MAAA;AAAA,gBACd,UAAA;AAAA,gBACA,UAAU,KAAA,CAAM;AAAA,eAChB,CAAA;AAAA,YACF;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAEA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACb,IAAA,IAAA,CAAK,WAAW,KAAA,EAAM;AACtB,IAAA,IAAA,CAAK,SAAA,GAAY,CAAA;AACjB,IAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AACzB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AAAA,EACvB;AAAA;AAAA;AAAA,EAKQ,UAAU,OAAA,EAAuB;AACxC,IAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,OAAA,EAAS,EAAE,KAAK,SAAS,CAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,gBAAA,CACP,OAAA,EACA,GAAA,EACA,YAAA,EACO;AACP,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAY,SAAA,CAAU,OAAA,EAAS,YAAY,CAAA;AACzD,IAAA,KAAA,IAAS,MAAM,KAAA,CAAM,SAAA,EAAW,GAAA,IAAO,KAAA,CAAM,SAAS,GAAA,EAAA,EAAO;AAC5D,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AAC/B,MAAA,IAAI,SAAS,CAAC,KAAA,CAAM,iBAAiB,KAAA,CAAM,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC9D,QAAA,KAAA,CAAM,UAAU,EAAC;AACjB,QAAA,KAAA,CAAM,MAAA,GAAS,IAAA;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,iBAAA,CACP,OAAA,EACA,GAAA,EACA,YAAA,EACO;AACP,IAAA,MAAM,KAAA,GAAQ,YAAA,CAAY,SAAA,CAAU,OAAA,EAAS,YAAY,CAAA;AACzD,IAAA,KAAA,IAAS,MAAM,KAAA,CAAM,SAAA,EAAW,GAAA,IAAO,KAAA,CAAM,SAAS,GAAA,EAAA,EAAO;AAC5D,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AAC/B,MAAA,IAAI,CAAC,KAAA,IAAS,KAAA,CAAM,aAAA,EAAe;AAEnC,MAAA,IAAI,MAAM,SAAA,CAAU,MAAA,GAAS,KAAK,KAAA,CAAM,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC3D,QAAA,KAAA,CAAM,YAAY,EAAC;AACnB,QAAA,KAAA,CAAM,UAAU,EAAC;AACjB,QAAA,KAAA,CAAM,MAAA,GAAS,IAAA;AACf,QAAA,GAAA,CAAI,SAAA,CAAU,MAAM,MAAM,CAAA;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AACD,CAAA;;;AC1SO,IAAK,QAAA,qBAAAC,SAAAA,KAAL;AAEN,EAAAA,SAAAA,CAAAA,SAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAEA,EAAAA,SAAAA,CAAAA,SAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAEA,EAAAA,SAAAA,CAAAA,SAAAA,CAAA,WAAQ,CAAA,CAAA,GAAR,OAAA;AAEA,EAAAA,SAAAA,CAAAA,SAAAA,CAAA,aAAU,CAAA,CAAA,GAAV,SAAA;AARW,EAAA,OAAAA,SAAAA;AAAA,CAAA,EAAA,QAAA,IAAA,EAAA;AAoEL,IAAM,qBAAN,MAAyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsB/B,WAAA,CACC,GAAA,EACA,MAAA,EACA,YAAA,EACC;AArBF,IAAA,IAAA,CAAQ,iBAAA,GAAqD,IAAA;AAQ7D;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,iBAAA,GAAyC,IAAA;AAchD,IAAA,IAAA,CAAK,GAAA,GAAM,GAAA;AACX,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,GAAA,GAAM,OAAO,MAAA,EAAO;AACzB,IAAA,IAAA,CAAK,eAAe,YAAA,IAAgB,IAAA;AACpC,IAAA,IAAA,CAAK,WAAA,GAAc,IAAI,WAAA,EAAY;AAKnC,IAAA,IAAA,CAAK,MAAA,CAAO,gBAAA,CAAiB,IAAA,CAAK,GAAG,CAAA;AAUrC,IAAA,IAAA,CAAK,iBAAA,GAAoB,yBAAA,CAA0B,SAAA,CAAU,CAAC,IAAA,KAAS;AAWtE,MAAA,KAAA,MAAW,cAAc,IAAA,CAAK,GAAA,CAAI,iBAAiB,YAAA,CAAa,IAAI,CAAC,CAAA,EAAG;AACvE,QAAA,IAAA,CAAK,GAAA,CAAI,sBAAsB,UAAU,CAAA;AAAA,MAC1C;AAAA,IACD,CAAC,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,QAAA,CAAS,UAAyB,MAAA,EAAkC;AAKnE,IAAA,IAAA,CAAK,MAAA,CAAO,kBAAA,CAAmB,MAAA,IAAU,IAAI,CAAA;AAG7C,IAAA,gBAAA,EAAiB;AACjB,IAAA,IAAI;AACH,MAAA,MAAM,QAA0B,EAAC;AACjC,MAAA,MAAM,SAAA,uBAAgB,GAAA,EAAqB;AAC3C,MAAA,MAAM,UAAA,GAAa,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,CAAA,EAAE;AAK9D,MAAA,MAAM,MAAA,GAAS,KAAK,GAAA,CAAI,SAAA;AACxB,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,SAAS,MAAM,CAAA;AAEjD,MAAA,KAAA,IAAS,GAAA,GAAM,CAAA,EAAG,GAAA,IAAO,OAAA,EAAS,GAAA,EAAA,EAAO;AACxC,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACpC,QAAA,IAAI,CAAC,KAAA,EAAO;AACX,UAAA,UAAA,CAAW,OAAA,EAAA;AACX,UAAA;AAAA,QACD;AAEA,QAAA,MAAM,UAAA,GAAa,GAAA,IAAO,QAAA,CAAS,SAAA,IAAa,OAAO,QAAA,CAAS,OAAA;AAEhE,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,UAAU,CAAA;AACjE,QAAA,KAAA,CAAM,KAAK,UAAU,CAAA;AAErB,QAAA,IAAI,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,aAAA,IAC1C,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,aAAA,IAC/C,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,aACnD,UAAA,CAAW,OAAA,EAAA;AAEhB,QAAA,IAAI,UAAA,CAAW,WAAW,UAAA,EAAY;AACrC,UAAA,SAAA,CAAU,GAAA,CAAI,GAAA,EAAK,UAAA,CAAW,OAAA,CAAQ,MAAM,CAAA;AAAA,QAC7C;AAAA,MACD;AAIA,MAAA,IAAA,CAAK,WAAA,CAAY,iBAAA,CAAkB,QAAA,EAAU,IAAA,CAAK,GAAG,CAAA;AAErD,MAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,UAAA,EAAW;AAAA,IACvC,CAAA,SAAE;AAGD,MAAA,IAAA,CAAK,MAAA,CAAO,mBAAmB,IAAI,CAAA;AAInC,MAAA,iBAAA,EAAkB;AAAA,IACnB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,kBAAkB,QAAA,EAA2C;AAC5D,IAAA,MAAM,UAA4B,EAAC;AACnC,IAAA,MAAM,MAAA,GAAS,KAAK,GAAA,CAAI,SAAA;AACxB,IAAA,MAAM,QAAA,GAAW,SAAS,OAAA,GAAU,CAAA;AAEpC,IAAA,KAAA,IAAS,GAAA,GAAM,QAAA,EAAU,GAAA,IAAO,MAAA,EAAQ,GAAA,EAAA,EAAO;AAC9C,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACpC,MAAA,IAAI,CAAC,KAAA,EAAO;AAGZ,MAAA,IAAI,CAAC,MAAM,KAAA,EAAO;AAMlB,MAAA,IAAI,MAAM,SAAA,CAAU,MAAA,GAAS,CAAA,IAAK,CAAC,MAAM,aAAA,EAAe;AAExD,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,KAAK,CAAA;AAC5D,MAAA,OAAA,CAAQ,KAAK,UAAU,CAAA;AAAA,IACxB;AAEA,IAAA,OAAO,OAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,2BAA2B,QAAA,EAA+B;AAEzD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,8BAAA,CAA+B,QAAQ,CAAA;AAC1D,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AAGxB,IAAA,IAAI,CAAC,KAAK,iBAAA,EAAmB;AAC5B,MAAA,IAAA,CAAK,iBAAA,GAAoB,IAAI,wBAAA,EAAyB;AAAA,IACvD;AAGA,IAAA,IAAA,CAAK,kBAAkB,YAAA,CAAa,KAAK,CAAA,CAAE,IAAA,CAAK,CAAC,OAAA,KAAY;AAC5D,MAAA,IAAA,CAAK,iBAAA,CAAmB,YAAA,CAAa,OAAA,EAAS,IAAA,CAAK,GAAG,CAAA;AAAA,IACvD,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,IAAA,KAAS;AAAA,IAGnB,CAAC,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAA,GAAwB;AACvB,IAAA,IAAI,KAAK,iBAAA,EAAmB;AAC3B,MAAA,IAAA,CAAK,kBAAkB,SAAA,EAAU;AACjC,MAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AAAA,IAC1B;AACA,IAAA,IAAI,KAAK,iBAAA,EAAmB;AAC3B,MAAA,IAAA,CAAK,iBAAA,EAAkB;AACvB,MAAA,IAAA,CAAK,iBAAA,GAAoB,IAAA;AAAA,IAC1B;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAA,GAAwB;AACvB,IAAA,OAAO,IAAA,CAAK,GAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,MAAA,EAAkC;AAC7C,IAAA,MAAM,WAAW,EAAE,SAAA,EAAW,GAAG,OAAA,EAAS,IAAA,CAAK,IAAI,SAAA,EAAU;AAC7D,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,MAAM,CAAA;AAE7C,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BA,WAAA,CAAY,UAAyB,MAAA,EAAkC;AAGtE,IAAA,IAAA,CAAK,MAAA,CAAO,kBAAA,CAAmB,MAAA,IAAU,IAAI,CAAA;AAG7C,IAAA,IAAI,SAAS,SAAA,GAAY,CAAA,IAAK,KAAK,mBAAA,CAAoB,QAAA,CAAS,SAAS,CAAA,EAAG;AAG3E,MAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AACzB,MAAA,OAAO,IAAA,CAAK,QAAA,CAAS,QAAA,EAAU,MAAM,CAAA;AAAA,IACtC;AAKA,IAAA,IAAA,CAAK,WAAA,CAAY,iBAAA,CAAkB,QAAA,EAAU,IAAA,CAAK,GAAG,CAAA;AAGrD,IAAA,IAAA,CAAK,iBAAiB,QAAQ,CAAA;AAI9B,IAAA,IAAA,CAAK,SAAA,CAAU,QAAA,CAAS,SAAA,GAAY,CAAC,CAAA;AAGrC,IAAA,gBAAA,EAAiB;AACjB,IAAA,IAAI;AAEH,MAAA,MAAM,SAAS,IAAA,CAAK,kBAAA,CAAmB,QAAA,CAAS,SAAA,EAAW,SAAS,OAAO,CAAA;AAC3E,MAAA,OAAO,MAAA;AAAA,IACR,CAAA,SAAE;AAED,MAAA,IAAA,CAAK,MAAA,CAAO,mBAAmB,IAAI,CAAA;AAInC,MAAA,iBAAA,EAAkB;AAAA,IACnB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,iBAAiB,OAAA,EAGf;AAMD,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAElC,IAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC7B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,aAAa,CAAA,EAAA,EAAK;AAC5C,QAAA,MAAM,OAAA,GAAU,OAAO,SAAA,GAAY,CAAA;AACnC,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,OAAO,CAAA;AACzC,QAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACvB,UAAA,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,QAChB;AAEA,QAAA,IAAA,CAAK,GAAA,CAAI,WAAW,OAAO,CAAA;AAM3B,QAAA,IAAA,CAAK,MAAA,CAAO,YAAA,EAAa,CAAE,gBAAA,CAAiB,OAAO,CAAA;AAAA,MACpD;AAAA,IACD;AAKA,IAAA,MAAM,iBAAA,uBAAwB,GAAA,EAAY;AAC1C,IAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AACjC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,gBAAA,CAAiB,QAAQ,CAAA;AACnD,MAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC/B,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,OAAO,CAAA;AACxC,QAAA,IAAI,KAAA,EAAO;AACV,UAAA,iBAAA,CAAkB,GAAA,CAAI,MAAM,MAAM,CAAA;AAAA,QACnC;AAAA,MACD;AAAA,IACD;AAGA,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,GAAA,CAAI,YAAA,CAAa,OAAO,CAAA;AAG5C,IAAA,IAAA,CAAK,cAAc,KAAA,EAAM;AAOzB,IAAA,KAAA,MAAW,UAAU,iBAAA,EAAmB;AACvC,MAAA,IAAA,CAAK,GAAA,CAAI,UAAU,MAAM,CAAA;AAAA,IAC1B;AAMA,IAAA,IAAA,CAAK,IAAI,KAAA,EAAM;AAEf,IAAA,OAAO;AAAA,MACN,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,SAAS,MAAA,CAAO;AAAA,KACjB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,kBAAA,CAAmB,WAAmB,OAAA,EAA6B;AAC1E,IAAA,MAAM,QAA0B,EAAC;AACjC,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAqB;AAC3C,IAAA,MAAM,UAAA,GAAa,EAAE,KAAA,EAAO,CAAA,EAAG,OAAO,CAAA,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,CAAA,EAAE;AAE9D,IAAA,MAAM,MAAA,GAAS,KAAK,GAAA,CAAI,SAAA;AACxB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,MAAM,CAAA;AAExC,IAAA,KAAA,IAAS,GAAA,GAAM,SAAA,EAAW,GAAA,IAAO,OAAA,EAAS,GAAA,EAAA,EAAO;AAChD,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACpC,MAAA,IAAI,CAAC,KAAA,EAAO;AASZ,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,IAAI,CAAA;AAC3D,MAAA,KAAA,CAAM,KAAK,UAAU,CAAA;AAErB,MAAA,IAAI,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,WAAA,IAC1C,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,WAAA,IAC/C,UAAA,CAAW,IAAA,KAAS,CAAA,cAAgB,UAAA,CAAW,KAAA,EAAA;AAAA,WACnD,UAAA,CAAW,OAAA,EAAA;AAEhB,MAAA,IAAI,WAAW,OAAA,EAAS;AACvB,QAAA,SAAA,CAAU,GAAA,CAAI,GAAA,EAAK,UAAA,CAAW,OAAA,CAAQ,MAAM,CAAA;AAAA,MAC7C;AAAA,IACD;AAEA,IAAA,OAAO,EAAE,KAAA,EAAO,SAAA,EAAW,UAAA,EAAW;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8BQ,oBAAoB,QAAA,EAA2B;AACtD,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,gCAAA,CAAiC,QAAQ,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,kBAAA,CACP,KAAA,EACA,UAAA,EACA,UAAA,EACiB;AACjB,IAAA,MAAM,UAAA,GAAgE;AAAA,MACrE,QAAQ,KAAA,CAAM,MAAA;AAAA,MACd;AAAA,KACD;AAGA,IAAA,IAAI,KAAA,CAAM,OAAA,IAAW,WAAA,CAAY,KAAA,CAAM,IAAI,CAAA,EAAG;AAC7C,MAAA,KAAA,CAAM,OAAA,GAAU,IAAA;AAChB,MAAA,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,MAAM,CAAA;AAC/B,MAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,iBAAkB,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,IAC3E;AAGA,IAAA,MAAM,EAAE,WAAA,EAAa,gBAAA,EAAiB,GAAI,IAAA,CAAK,mBAAmB,KAAK,CAAA;AACvE,IAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAC7B,MAAA,KAAA,CAAM,OAAA,GAAU,IAAA;AAChB,MAAA,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,MAAM,CAAA;AAC/B,MAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,iBAAkB,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,IAC3E;AAGA,IAAA,IAAI,MAAM,KAAA,EAAO;AAChB,MAAA,IAAI,UAAA,EAAY;AAEf,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,UAAA,EAAY,WAAA,EAAa,kBAAkB,UAAU,CAAA;AAAA,MACvF,CAAA,MAAO;AAON,QAAA,IAAI,KAAA,CAAM,SAAA,CAAU,MAAA,GAAS,CAAA,IAAK,KAAA,CAAM,SAAA,CAAU,MAAA,KAAW,WAAA,CAAY,MAAA,IAAU,CAAC,KAAA,CAAM,aAAA,EAAe;AACxG,UAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,iBAAkB,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,QAC3E;AACA,QAAA,OAAO,KAAK,aAAA,CAAc,KAAA,EAAO,UAAA,EAAY,WAAA,EAAa,kBAAkB,UAAU,CAAA;AAAA,MACvF;AAAA,IACD;AAGA,IAAA,IAAI,UAAA,IAAc,KAAA,CAAM,SAAA,CAAU,MAAA,GAAS,CAAA,EAAG;AAE7C,MAAA,OAAO,IAAA,CAAK,aAAA,CAAc,KAAA,EAAO,UAAA,EAAY,UAAU,CAAA;AAAA,IACxD;AAGA,IAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,iBAAkB,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,aAAA,CACP,KAAA,EACA,UAAA,EACA,WAAA,EACA,kBACA,UAAA,EACiB;AACjB,IAAA,MAAM,aAAwB,EAAC;AAC/B,IAAA,MAAM,eAAkC,EAAC;AACzC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,IAAA,IAAI,cAAA,GAAiB,KAAA;AACrB,IAAA,IAAI,SAAA,GAA0B,IAAA;AAC9B,IAAA,IAAI,UAAA,GAA4B,IAAA;AAChC,IAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,IAAA,IAAI,UAAA,GAAa,KAAA;AASjB,IAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACrC,MAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAK,EAAG;AAExB,MAAA,IAAI,KAAA,GAAwB,IAAA;AAC5B,MAAA,IAAI,KAAA;AAEJ,MAAA,IAAI;AACH,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,MAAA,CAAO,oBAAA,CAAqB,YAAY,UAAU,CAAA;AAC1E,QAAA,KAAA,GAAQ,UAAA,CAAW,MAAA;AACnB,QAAA,SAAA,GAAY,MAAM,CAAC,CAAA;AAKnB,QAAA,KAAA,GAAQ,KAAK,MAAA,CAAO,YAAA,EAAa,CAAE,GAAA,CAAI,YAAY,UAAU,CAAA;AAAA,MAC9D,SAAS,CAAA,EAAG;AACX,QAAA,MAAM,eAAe,CAAA,YAAa,KAAA,GAAQ,CAAA,CAAE,OAAA,GAAU,OAAO,CAAC,CAAA;AAC9D,QAAA,IAAI,CAAC,YAAY,UAAA,GAAa,YAAA;AAC9B,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA,KAAA,GAAQ,IAAA;AAAA,MACT;AAMA,MAAA,IAAI,SAAS,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,0BAA0B,EAAG;AAC7D,QAAA,UAAA,GAAa,IAAA;AAAA,MACd;AAEA,MAAA,IAAI,KAAA,EAAO;AACV,QAAA,UAAA,CAAW,KAAK,KAAK,CAAA;AAAA,MACtB,CAAA,MAAO;AAIN,QAAA,UAAA,CAAW,KAAK,CAAC,UAAA,CAAW,eAAe,UAAA,IAAc,eAAe,CAAC,CAAC,CAAA;AAAA,MAC3E;AAEA,MAAA,IAAI,KAAA,EAAO;AACV,QAAA,YAAA,CAAa,IAAA,CAAK,MAAM,QAAQ,CAAA;AAChC,QAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,aAAA,EAAe,QAAA,CAAS,IAAI,CAAC,CAAA;AACnD,QAAA,IAAI,MAAM,aAAA,EAAe;AACxB,UAAA,SAAA,CAAU,GAAA,CAAI,MAAM,aAAa,CAAA;AACjC,UAAA,cAAA,GAAiB,IAAA;AAAA,QAClB;AAAA,MACD,CAAA,MAAO;AAEN,QAAA,IAAI;AACH,UAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAAH,MAAAA,EAAO,MAAA,EAAAC,SAAO,GAAI,IAAA,CAAK,MAAA,CAAO,iBAAA,CAAkB,UAAU,CAAA;AAC3E,UAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AACzB,UAAA,KAAA,MAAW,CAAA,IAAKD,MAAAA,EAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AACrC,UAAA,KAAA,MAAW,CAAA,IAAKC,OAAAA,EAAQ,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA;AACvC,UAAA,IAAIA,OAAAA,CAAO,MAAA,GAAS,CAAA,EAAG,cAAA,GAAiB,IAAA;AAAA,QACzC,SAAS,UAAA,EAAY;AAQpB,UAAA,YAAA,CAAa,KAAK,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,OAAO,CAAA;AAC5G,UAAA,IAAI,UAAA,YAAsB,WAAA,IAAe,UAAA,CAAW,OAAA,EAAS;AAC5D,YAAA,MAAM,QAAA,GAAW,WAAW,OAAA,CAAQ,KAAA;AACpC,YAAA,MAAM,SAAA,GAAY,WAAW,OAAA,CAAQ,MAAA;AACrC,YAAA,IAAI,KAAA,CAAM,QAAQ,QAAQ,CAAA,aAAc,CAAA,IAAK,QAAA,EAAU,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AACrE,YAAA,IAAI,KAAA,CAAM,QAAQ,SAAS,CAAA,aAAc,CAAA,IAAK,SAAA,EAAW,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA;AAAA,UACzE;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAEA,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,QAAQ,CAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,CAAC,GAAG,SAAS,CAAA;AAO5B,IAAA,IAAI,aAAa,UAAA,EAAY;AAI5B,MAAA,IAAA,CAAK,GAAA,CAAI,kBAAA;AAAA,QACR,KAAA,CAAM,MAAA;AAAA,QACN,WAAA;AAAA,QACA,YAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA;AAAA,QACA,cAAA;AAAA,QACA;AAAA,OACD;AAEA,MAAA,KAAA,CAAM,OAAA,GAAU,UAAA;AAChB,MAAA,KAAA,CAAM,MAAA,GAAS,UAAA,CAAW,CAAC,CAAA,GAAI,CAAC,CAAA,IAAK,IAAA;AACrC,MAAA,KAAA,CAAM,gBAAA,GAAmB,gBAAA;AACzB,MAAA,KAAA,CAAM,WAAA,GAAc,WAAA;AAAA,IACrB,CAAA,MAAO;AAEN,MAAA,IAAA,CAAK,GAAA,CAAI,gBAAA;AAAA,QACR,KAAA,CAAM,MAAA;AAAA,QACN,UAAA;AAAA,QACA,YAAA;AAAA,QACA,WAAA;AAAA,QACA,KAAA;AAAA,QACA,MAAA;AAAA,QACA,cAAA;AAAA,QACA;AAAA,OACD;AAAA,IACD;AAKA,IAAA,IAAA,CAAK,GAAA,CAAI,YAAA,CAAa,UAAA,EAAY,KAAA,EAAO,MAAM,CAAA;AAK/C,IAAA,IAAI,IAAA,CAAK,gBAAgB,MAAA,CAAO,MAAA,GAAS,KAAK,CAAC,SAAA,IAAa,CAAC,UAAA,EAAY;AACxE,MAAA,IAAA,CAAK,YAAA,CAAa,QAAA,CAAS,UAAA,EAAY,KAAA,CAAM,QAAQ,MAAM,CAAA;AAAA,IAC5D;AAEA,IAAA,OAAO;AAAA,MACN,GAAG,UAAA;AAAA,MACH,IAAA,EAAM,CAAA;AAAA,MACN,MAAA,EAAQ,SAAA;AAAA,MACR,OAAA,EAAS,UAAA;AAAA,MACT,KAAA,EAAO;AAAA,KACR;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,aAAA,CACP,KAAA,EACA,UAAA,EACA,UAAA,EACiB;AACjB,IAAA,IAAI,KAAA,CAAM,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG;AACjC,MAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,iBAAkB,MAAA,EAAQ,IAAA,EAAM,OAAO,IAAA,EAAK;AAAA,IAC3E;AAEA,IAAA,MAAM,UAAqB,EAAC;AAC5B,IAAA,IAAI,SAAA,GAA0B,IAAA;AAC9B,IAAA,IAAI,UAAA,GAA4B,IAAA;AAChC,IAAA,IAAI,SAAA,GAAY,KAAA;AAMhB,IAAA,KAAA,MAAW,QAAA,IAAY,MAAM,SAAA,EAAW;AACvC,MAAA,IAAI,QAAA,CAAS,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACnC,MAAA,IAAI;AACH,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,aAAA,CAAc,UAAU,UAAU,CAAA;AAC5D,QAAA,SAAA,GAAY,KAAA;AACZ,QAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,KAAK,CAAC,CAAA;AAAA,MACrB,SAAS,CAAA,EAAG;AACX,QAAA,MAAM,eAAe,CAAA,YAAa,KAAA,GAAQ,CAAA,CAAE,OAAA,GAAU,OAAO,CAAC,CAAA;AAC9D,QAAA,IAAI,CAAC,YAAY,UAAA,GAAa,YAAA;AAC9B,QAAA,SAAA,GAAY,IAAA;AAEZ,QAAA,OAAA,CAAQ,KAAK,CAAC,UAAA,CAAW,aAAA,EAAe,YAAY,CAAC,CAAC,CAAA;AAAA,MACvD;AAAA,IACD;AAIA,IAAA,IAAA,CAAK,IAAI,YAAA,CAAa,UAAA,EAAY,KAAA,CAAM,KAAA,EAAO,MAAM,MAAM,CAAA;AAE3D,IAAA,KAAA,CAAM,OAAA,GAAU,OAAA;AAChB,IAAA,KAAA,CAAM,MAAA,GAAS,OAAA,CAAQ,CAAC,CAAA,GAAI,CAAC,CAAA,IAAK,IAAA;AAClC,IAAA,IAAI,SAAA,EAAW;AAEd,MAAA,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,MAAM,CAAA;AAAA,IAChC;AAEA,IAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,eAAgB,MAAA,EAAQ,SAAA,EAAW,OAAA,EAAS,KAAA,EAAO,UAAA,EAAW;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,aAAA,CACP,KAAA,EACA,UAAA,EACA,WAAA,EACA,kBACA,UAAA,EACiB;AACjB,IAAA,MAAM,eAAkC,EAAC;AACzC,IAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAY;AAClC,IAAA,IAAI,cAAA,GAAiB,KAAA;AACrB,IAAA,IAAI,UAAA,GAA2B,IAAA;AAC/B,IAAA,IAAI,UAAA,GAA4B,IAAA;AAChC,IAAA,IAAI,SAAA,GAAY,KAAA;AAEhB,IAAA,IAAI,UAAA,GAAa,KAAA;AAKjB,IAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACrC,MAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAK,EAAG;AAExB,MAAA,IAAI;AACH,QAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAAD,MAAAA,EAAO,MAAA,EAAAC,SAAO,GAAI,IAAA,CAAK,MAAA,CAAO,iBAAA,CAAkB,UAAU,CAAA;AAC3E,QAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AACzB,QAAA,KAAA,MAAW,CAAA,IAAKD,MAAAA,EAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA;AACrC,QAAA,KAAA,MAAW,CAAA,IAAKC,OAAAA,EAAQ,SAAA,CAAU,GAAA,CAAI,CAAC,CAAA;AACvC,QAAA,IAAIA,OAAAA,CAAO,MAAA,GAAS,CAAA,EAAG,cAAA,GAAiB,IAAA;AAExC,QAAA,IAAIA,QAAO,MAAA,GAAS,CAAA,IAAK,OAAA,CAAQ,OAAA,CAAQ,SAAS,CAAA,EAAG;AAEpD,UAAA,UAAA,GAAa,IAAA,CAAK,MAAA,CAAO,aAAA,CAAc,OAAA,EAAS,UAAU,CAAA;AAG1D,UAAA,IAAI,UAAA,IAAc,WAAW,IAAA,KAAA,EAAA,gBAA4B;AACxD,YAAA,UAAA,GAAa,IAAA;AAAA,UACd;AAAA,QACD;AAAA,MACD,SAAS,CAAA,EAAG;AACX,QAAA,MAAM,eAAe,CAAA,YAAa,KAAA,GAAQ,CAAA,CAAE,OAAA,GAAU,OAAO,CAAC,CAAA;AAC9D,QAAA,IAAI,CAAC,YAAY,UAAA,GAAa,YAAA;AAC9B,QAAA,SAAA,GAAY,IAAA;AAEZ,QAAA,YAAA,CAAa,KAAK,EAAE,OAAA,EAAS,IAAI,UAAA,CAAW,CAAC,CAAA,EAAG,OAAA,EAAS,IAAI,YAAA,CAAa,CAAC,CAAA,EAAG,OAAA,EAAS,EAAC,EAAG,QAAA,EAAU,OAAO,CAAA;AAAA,MAC7G;AAAA,IACD;AAEA,IAAA,MAAM,KAAA,GAAQ,CAAC,GAAG,QAAQ,CAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,CAAC,GAAG,SAAS,CAAA;AAI5B,IAAA,IAAA,CAAK,GAAA,CAAI,kBAAA;AAAA,MACR,KAAA,CAAM,MAAA;AAAA,MACN,WAAA;AAAA,MACA,YAAA;AAAA,MACA,KAAA;AAAA,MACA,MAAA;AAAA,MACA,cAAA;AAAA,MACA;AAAA,KACD;AAIA,IAAA,IAAA,CAAK,GAAA,CAAI,YAAA,CAAa,UAAA,EAAY,KAAA,EAAO,MAAM,CAAA;AAE/C,IAAA,IAAI,cAAA,IAAkB,UAAA,IAAc,CAAC,SAAA,IAAa,CAAC,UAAA,EAAY;AAC9D,MAAA,KAAA,CAAM,OAAA,GAAU,CAAC,CAAC,UAAU,CAAC,CAAA;AAC7B,MAAA,KAAA,CAAM,MAAA,GAAS,UAAA;AACf,MAAA,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,KAAA,CAAM,MAAM,CAAA;AAG/B,MAAA,IAAI,KAAK,YAAA,EAAc;AACtB,QAAA,IAAA,CAAK,YAAA,CAAa,QAAA,CAAS,UAAA,EAAY,KAAA,CAAM,QAAQ,MAAM,CAAA;AAAA,MAC5D;AAAA,IACD;AAEA,IAAA,OAAO,EAAE,GAAG,UAAA,EAAY,IAAA,EAAM,eAAgB,MAAA,EAAQ,UAAA,EAAY,SAAS,cAAA,IAAkB,UAAA,IAAc,CAAC,SAAA,IAAa,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC,CAAA,GAAI,MAAA,EAAW,KAAA,EAAO,UAAA,EAAW;AAAA,EACtL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,UAAU,UAAA,EAA0B;AACnC,IAAA,IAAI,KAAK,YAAA,EAAc;AACtB,MAAA,IAAA,CAAK,YAAA,CAAa,UAAU,UAAU,CAAA;AAAA,IACvC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,eAAA,GAAyC;AACxC,IAAA,OAAO,IAAA,CAAK,YAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAA,GAA8B;AAC7B,IAAA,OAAO,IAAA,CAAK,WAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,iBAAiB,QAAA,EAA+B;AACvD,IAAA,MAAM,UAAU,IAAA,CAAK,WAAA,CAAY,iBAAA,CAAkB,QAAA,EAAU,KAAK,GAAG,CAAA;AACrE,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AAG1B,IAAA,IAAI,CAAC,KAAK,iBAAA,EAAmB;AAC5B,MAAA,IAAA,CAAK,iBAAA,GAAoB,IAAI,wBAAA,EAAyB;AAAA,IACvD;AAGA,IAAA,IAAA,CAAK,kBAAkB,YAAA,CAAa,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,OAAA,KAAY;AAC9D,MAAA,IAAA,CAAK,iBAAA,CAAmB,YAAA,CAAa,OAAA,EAAS,IAAA,CAAK,GAAG,CAAA;AAAA,IACvD,CAAC,CAAA,CAAE,KAAA,CAAM,CAAC,IAAA,KAAS;AAAA,IAEnB,CAAC,CAAA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,+BAA+B,QAAA,EAA+C;AACrF,IAAA,MAAM,QAA8B,EAAC;AACrC,IAAA,MAAM,MAAA,GAAS,KAAK,GAAA,CAAI,SAAA;AACxB,IAAA,MAAM,QAAA,GAAW,SAAS,OAAA,GAAU,CAAA;AAEpC,IAAA,KAAA,IAAS,GAAA,GAAM,QAAA,EAAU,GAAA,IAAO,MAAA,EAAQ,GAAA,EAAA,EAAO;AAC9C,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACpC,MAAA,IAAI,CAAC,KAAA,EAAO;AAGZ,MAAA,IAAI,CAAC,MAAM,KAAA,EAAO;AAGlB,MAAA,IAAI,MAAM,SAAA,CAAU,MAAA,GAAS,CAAA,IAAK,CAAC,MAAM,aAAA,EAAe;AAGxD,MAAA,IAAI,KAAA,CAAM,OAAA,IAAW,WAAA,CAAY,KAAA,CAAM,IAAI,CAAA,EAAG;AAE9C,MAAA,MAAM,EAAE,WAAA,EAAY,GAAI,IAAA,CAAK,mBAAmB,KAAK,CAAA;AACrD,MAAA,IAAI,WAAA,CAAY,WAAW,CAAA,EAAG;AAK9B,MAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACrC,QAAA,IAAI,CAAC,UAAA,CAAW,IAAA,EAAK,EAAG;AACxB,QAAA,KAAA,CAAM,IAAA,CAAK;AAAA,UACV,QAAQ,KAAA,CAAM,MAAA;AAAA,UACd,UAAA;AAAA,UACA,UAAU,KAAA,CAAM;AAAA,SAChB,CAAA;AAAA,MACF;AAAA,IACD;AAEA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaQ,mBAAmB,KAAA,EAAuE;AAEjG,IAAA,IAAI,KAAA,CAAM,WAAA,CAAY,MAAA,GAAS,CAAA,EAAG;AACjC,MAAA,OAAO,EAAE,WAAA,EAAa,KAAA,CAAM,WAAA,EAAa,gBAAA,EAAkB,MAAM,gBAAA,EAAiB;AAAA,IACnF;AAEA,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,IAAA,CAAK,IAAA,EAAK;AAChC,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG,OAAO,EAAE,WAAA,EAAa,EAAC,EAAG,gBAAA,EAAkB,CAAA,EAAE;AAGxE,IAAA,MAAM,WAAA,GAAc,WAAA,CAAY,gBAAA,CAAiB,KAAA,CAAM,IAAI,CAAA;AAC3D,IAAA,IAAI,WAAA,CAAY,SAAS,CAAA,EAAG;AAC3B,MAAA,OAAO;AAAA,QACN,WAAA,EAAa,WAAA,CAAY,GAAA,CAAI,CAAA,CAAA,KAAK,EAAE,UAAU,CAAA;AAAA,QAC9C,kBAAkB,WAAA,CAAY;AAAA,OAC/B;AAAA,IACD;AAGA,IAAA,OAAO,EAAE,WAAA,EAAa,CAAC,OAAO,CAAA,EAAG,kBAAkB,CAAA,EAAE;AAAA,EACtD;AACD","file":"chunk-V5PYO44Y.js","sourcesContent":["'use strict'\n\n// Note: this is the semver.org version of the spec that it implements\n// Not necessarily the package version of this code.\nconst SEMVER_SPEC_VERSION = '2.0.0'\n\nconst MAX_LENGTH = 256\nconst MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||\n/* istanbul ignore next */ 9007199254740991\n\n// Max safe segment length for coercion.\nconst MAX_SAFE_COMPONENT_LENGTH = 16\n\n// Max safe length for a build identifier. The max length minus 6 characters for\n// the shortest version with a build 0.0.0+BUILD.\nconst MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6\n\nconst RELEASE_TYPES = [\n 'major',\n 'premajor',\n 'minor',\n 'preminor',\n 'patch',\n 'prepatch',\n 'prerelease',\n]\n\nmodule.exports = {\n MAX_LENGTH,\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_SAFE_INTEGER,\n RELEASE_TYPES,\n SEMVER_SPEC_VERSION,\n FLAG_INCLUDE_PRERELEASE: 0b001,\n FLAG_LOOSE: 0b010,\n}\n","'use strict'\n\nconst debug = (\n typeof process === 'object' &&\n process.env &&\n process.env.NODE_DEBUG &&\n /\\bsemver\\b/i.test(process.env.NODE_DEBUG)\n) ? (...args) => console.error('SEMVER', ...args)\n : () => {}\n\nmodule.exports = debug\n","'use strict'\n\nconst {\n MAX_SAFE_COMPONENT_LENGTH,\n MAX_SAFE_BUILD_LENGTH,\n MAX_LENGTH,\n} = require('./constants')\nconst debug = require('./debug')\nexports = module.exports = {}\n\n// The actual regexps go on exports.re\nconst re = exports.re = []\nconst safeRe = exports.safeRe = []\nconst src = exports.src = []\nconst safeSrc = exports.safeSrc = []\nconst t = exports.t = {}\nlet R = 0\n\nconst LETTERDASHNUMBER = '[a-zA-Z0-9-]'\n\n// Replace some greedy regex tokens to prevent regex dos issues. These regex are\n// used internally via the safeRe object since all inputs in this library get\n// normalized first to trim and collapse all extra whitespace. The original\n// regexes are exported for userland consumption and lower level usage. A\n// future breaking change could export the safer regex only with a note that\n// all input should have extra whitespace removed.\nconst safeRegexReplacements = [\n ['\\\\s', 1],\n ['\\\\d', MAX_LENGTH],\n [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],\n]\n\nconst makeSafeRegex = (value) => {\n for (const [token, max] of safeRegexReplacements) {\n value = value\n .split(`${token}*`).join(`${token}{0,${max}}`)\n .split(`${token}+`).join(`${token}{1,${max}}`)\n }\n return value\n}\n\nconst createToken = (name, value, isGlobal) => {\n const safe = makeSafeRegex(value)\n const index = R++\n debug(name, index, value)\n t[name] = index\n src[index] = value\n safeSrc[index] = safe\n re[index] = new RegExp(value, isGlobal ? 'g' : undefined)\n safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)\n}\n\n// The following Regular Expressions can be used for tokenizing,\n// validating, and parsing SemVer version strings.\n\n// ## Numeric Identifier\n// A single `0`, or a non-zero digit followed by zero or more digits.\n\ncreateToken('NUMERICIDENTIFIER', '0|[1-9]\\\\d*')\ncreateToken('NUMERICIDENTIFIERLOOSE', '\\\\d+')\n\n// ## Non-numeric Identifier\n// Zero or more digits, followed by a letter or hyphen, and then zero or\n// more letters, digits, or hyphens.\n\ncreateToken('NONNUMERICIDENTIFIER', `\\\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)\n\n// ## Main Version\n// Three dot-separated numeric identifiers.\n\ncreateToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})\\\\.` +\n `(${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version Identifier\n// A numeric identifier, or a non-numeric identifier.\n// Non-numeric identifiers include numeric identifiers but can be longer.\n// Therefore non-numeric identifiers must go first.\n\ncreateToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIER]})`)\n\ncreateToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]\n}|${src[t.NUMERICIDENTIFIERLOOSE]})`)\n\n// ## Pre-release Version\n// Hyphen, followed by one or more dot-separated pre-release version\n// identifiers.\n\ncreateToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIER]})*))`)\n\ncreateToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]\n}(?:\\\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)\n\n// ## Build Metadata Identifier\n// Any combination of digits, letters, or hyphens.\n\ncreateToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)\n\n// ## Build Metadata\n// Plus sign, followed by one or more period-separated build metadata\n// identifiers.\n\ncreateToken('BUILD', `(?:\\\\+(${src[t.BUILDIDENTIFIER]\n}(?:\\\\.${src[t.BUILDIDENTIFIER]})*))`)\n\n// ## Full Version String\n// A main version, followed optionally by a pre-release version and\n// build metadata.\n\n// Note that the only major, minor, patch, and pre-release sections of\n// the version string are capturing groups. The build metadata is not a\n// capturing group, because it should not ever be used in version\n// comparison.\n\ncreateToken('FULLPLAIN', `v?${src[t.MAINVERSION]\n}${src[t.PRERELEASE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('FULL', `^${src[t.FULLPLAIN]}$`)\n\n// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.\n// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty\n// common in the npm registry.\ncreateToken('LOOSEPLAIN', `[v=\\\\s]*${src[t.MAINVERSIONLOOSE]\n}${src[t.PRERELEASELOOSE]}?${\n src[t.BUILD]}?`)\n\ncreateToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)\n\ncreateToken('GTLT', '((?:<|>)?=?)')\n\n// Something like \"2.*\" or \"1.2.x\".\n// Note that \"x.x\" is a valid xRange identifier, meaning \"any version\"\n// Only the first item is strictly required.\ncreateToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\\\*`)\ncreateToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\\\*`)\n\ncreateToken('XRANGEPLAIN', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIER]})` +\n `(?:${src[t.PRERELEASE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGEPLAINLOOSE', `[v=\\\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:\\\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +\n `(?:${src[t.PRERELEASELOOSE]})?${\n src[t.BUILD]}?` +\n `)?)?`)\n\ncreateToken('XRANGE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAIN]}$`)\ncreateToken('XRANGELOOSE', `^${src[t.GTLT]}\\\\s*${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Coercion.\n// Extract anything that could conceivably be a part of a valid semver\ncreateToken('COERCEPLAIN', `${'(^|[^\\\\d])' +\n '(\\\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +\n `(?:\\\\.(\\\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)\ncreateToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\\\d])`)\ncreateToken('COERCEFULL', src[t.COERCEPLAIN] +\n `(?:${src[t.PRERELEASE]})?` +\n `(?:${src[t.BUILD]})?` +\n `(?:$|[^\\\\d])`)\ncreateToken('COERCERTL', src[t.COERCE], true)\ncreateToken('COERCERTLFULL', src[t.COERCEFULL], true)\n\n// Tilde ranges.\n// Meaning is \"reasonably at or greater than\"\ncreateToken('LONETILDE', '(?:~>?)')\n\ncreateToken('TILDETRIM', `(\\\\s*)${src[t.LONETILDE]}\\\\s+`, true)\nexports.tildeTrimReplace = '$1~'\n\ncreateToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// Caret ranges.\n// Meaning is \"at least and backwards compatible with\"\ncreateToken('LONECARET', '(?:\\\\^)')\n\ncreateToken('CARETTRIM', `(\\\\s*)${src[t.LONECARET]}\\\\s+`, true)\nexports.caretTrimReplace = '$1^'\n\ncreateToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)\ncreateToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)\n\n// A simple gt/lt/eq thing, or just \"\" to indicate \"any version\"\ncreateToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\\\s*(${src[t.LOOSEPLAIN]})$|^$`)\ncreateToken('COMPARATOR', `^${src[t.GTLT]}\\\\s*(${src[t.FULLPLAIN]})$|^$`)\n\n// An expression to strip any whitespace between the gtlt and the thing\n// it modifies, so that `> 1.2.3` ==> `>1.2.3`\ncreateToken('COMPARATORTRIM', `(\\\\s*)${src[t.GTLT]\n}\\\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)\nexports.comparatorTrimReplace = '$1$2$3'\n\n// Something like `1.2.3 - 1.2.4`\n// Note that these all use the loose form, because they'll be\n// checked against either the strict or loose comparator form\n// later.\ncreateToken('HYPHENRANGE', `^\\\\s*(${src[t.XRANGEPLAIN]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAIN]})` +\n `\\\\s*$`)\n\ncreateToken('HYPHENRANGELOOSE', `^\\\\s*(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s+-\\\\s+` +\n `(${src[t.XRANGEPLAINLOOSE]})` +\n `\\\\s*$`)\n\n// Star ranges basically just allow anything at all.\ncreateToken('STAR', '(<|>)?=?\\\\s*\\\\*')\n// >=0.0.0 is like a star\ncreateToken('GTE0', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0\\\\s*$')\ncreateToken('GTE0PRE', '^\\\\s*>=\\\\s*0\\\\.0\\\\.0-0\\\\s*$')\n","'use strict'\n\n// parse out just the options we care about\nconst looseOption = Object.freeze({ loose: true })\nconst emptyOpts = Object.freeze({ })\nconst parseOptions = options => {\n if (!options) {\n return emptyOpts\n }\n\n if (typeof options !== 'object') {\n return looseOption\n }\n\n return options\n}\nmodule.exports = parseOptions\n","'use strict'\n\nconst numeric = /^[0-9]+$/\nconst compareIdentifiers = (a, b) => {\n if (typeof a === 'number' && typeof b === 'number') {\n return a === b ? 0 : a < b ? -1 : 1\n }\n\n const anum = numeric.test(a)\n const bnum = numeric.test(b)\n\n if (anum && bnum) {\n a = +a\n b = +b\n }\n\n return a === b ? 0\n : (anum && !bnum) ? -1\n : (bnum && !anum) ? 1\n : a < b ? -1\n : 1\n}\n\nconst rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)\n\nmodule.exports = {\n compareIdentifiers,\n rcompareIdentifiers,\n}\n","'use strict'\n\nconst debug = require('../internal/debug')\nconst { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst parseOptions = require('../internal/parse-options')\nconst { compareIdentifiers } = require('../internal/identifiers')\n\nconst isPrereleaseIdentifier = (prerelease, identifier) => {\n const identifiers = identifier.split('.')\n if (identifiers.length > prerelease.length) {\n return false\n }\n\n for (let i = 0; i < identifiers.length; i++) {\n if (compareIdentifiers(prerelease[i], identifiers[i]) !== 0) {\n return false\n }\n }\n\n return true\n}\n\nclass SemVer {\n constructor (version, options) {\n options = parseOptions(options)\n\n if (version instanceof SemVer) {\n if (version.loose === !!options.loose &&\n version.includePrerelease === !!options.includePrerelease) {\n return version\n } else {\n version = version.version\n }\n } else if (typeof version !== 'string') {\n throw new TypeError(`Invalid version. Must be a string. Got type \"${typeof version}\".`)\n }\n\n if (version.length > MAX_LENGTH) {\n throw new TypeError(\n `version is longer than ${MAX_LENGTH} characters`\n )\n }\n\n debug('SemVer', version, options)\n this.options = options\n this.loose = !!options.loose\n // this isn't actually relevant for versions, but keep it so that we\n // don't run into trouble passing this.options around.\n this.includePrerelease = !!options.includePrerelease\n\n const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])\n\n if (!m) {\n throw new TypeError(`Invalid Version: ${version}`)\n }\n\n this.raw = version\n\n // these are actually numbers\n this.major = +m[1]\n this.minor = +m[2]\n this.patch = +m[3]\n\n if (this.major > MAX_SAFE_INTEGER || this.major < 0) {\n throw new TypeError('Invalid major version')\n }\n\n if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {\n throw new TypeError('Invalid minor version')\n }\n\n if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {\n throw new TypeError('Invalid patch version')\n }\n\n // numberify any prerelease numeric ids\n if (!m[4]) {\n this.prerelease = []\n } else {\n this.prerelease = m[4].split('.').map((id) => {\n if (/^[0-9]+$/.test(id)) {\n const num = +id\n if (num >= 0 && num < MAX_SAFE_INTEGER) {\n return num\n }\n }\n return id\n })\n }\n\n this.build = m[5] ? m[5].split('.') : []\n this.format()\n }\n\n format () {\n this.version = `${this.major}.${this.minor}.${this.patch}`\n if (this.prerelease.length) {\n this.version += `-${this.prerelease.join('.')}`\n }\n return this.version\n }\n\n toString () {\n return this.version\n }\n\n compare (other) {\n debug('SemVer.compare', this.version, this.options, other)\n if (!(other instanceof SemVer)) {\n if (typeof other === 'string' && other === this.version) {\n return 0\n }\n other = new SemVer(other, this.options)\n }\n\n if (other.version === this.version) {\n return 0\n }\n\n return this.compareMain(other) || this.comparePre(other)\n }\n\n compareMain (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n if (this.major < other.major) {\n return -1\n }\n if (this.major > other.major) {\n return 1\n }\n if (this.minor < other.minor) {\n return -1\n }\n if (this.minor > other.minor) {\n return 1\n }\n if (this.patch < other.patch) {\n return -1\n }\n if (this.patch > other.patch) {\n return 1\n }\n return 0\n }\n\n comparePre (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n // NOT having a prerelease is > having one\n if (this.prerelease.length && !other.prerelease.length) {\n return -1\n } else if (!this.prerelease.length && other.prerelease.length) {\n return 1\n } else if (!this.prerelease.length && !other.prerelease.length) {\n return 0\n }\n\n let i = 0\n do {\n const a = this.prerelease[i]\n const b = other.prerelease[i]\n debug('prerelease compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n compareBuild (other) {\n if (!(other instanceof SemVer)) {\n other = new SemVer(other, this.options)\n }\n\n let i = 0\n do {\n const a = this.build[i]\n const b = other.build[i]\n debug('build compare', i, a, b)\n if (a === undefined && b === undefined) {\n return 0\n } else if (b === undefined) {\n return 1\n } else if (a === undefined) {\n return -1\n } else if (a === b) {\n continue\n } else {\n return compareIdentifiers(a, b)\n }\n } while (++i)\n }\n\n // preminor will bump the version up to the next minor release, and immediately\n // down to pre-release. premajor and prepatch work the same way.\n inc (release, identifier, identifierBase) {\n if (release.startsWith('pre')) {\n if (!identifier && identifierBase === false) {\n throw new Error('invalid increment argument: identifier is empty')\n }\n // Avoid an invalid semver results\n if (identifier) {\n const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])\n if (!match || match[1] !== identifier) {\n throw new Error(`invalid identifier: ${identifier}`)\n }\n }\n }\n\n switch (release) {\n case 'premajor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor = 0\n this.major++\n this.inc('pre', identifier, identifierBase)\n break\n case 'preminor':\n this.prerelease.length = 0\n this.patch = 0\n this.minor++\n this.inc('pre', identifier, identifierBase)\n break\n case 'prepatch':\n // If this is already a prerelease, it will bump to the next version\n // drop any prereleases that might already exist, since they are not\n // relevant at this point.\n this.prerelease.length = 0\n this.inc('patch', identifier, identifierBase)\n this.inc('pre', identifier, identifierBase)\n break\n // If the input is a non-prerelease version, this acts the same as\n // prepatch.\n case 'prerelease':\n if (this.prerelease.length === 0) {\n this.inc('patch', identifier, identifierBase)\n }\n this.inc('pre', identifier, identifierBase)\n break\n case 'release':\n if (this.prerelease.length === 0) {\n throw new Error(`version ${this.raw} is not a prerelease`)\n }\n this.prerelease.length = 0\n break\n\n case 'major':\n // If this is a pre-major version, bump up to the same major version.\n // Otherwise increment major.\n // 1.0.0-5 bumps to 1.0.0\n // 1.1.0 bumps to 2.0.0\n if (\n this.minor !== 0 ||\n this.patch !== 0 ||\n this.prerelease.length === 0\n ) {\n this.major++\n }\n this.minor = 0\n this.patch = 0\n this.prerelease = []\n break\n case 'minor':\n // If this is a pre-minor version, bump up to the same minor version.\n // Otherwise increment minor.\n // 1.2.0-5 bumps to 1.2.0\n // 1.2.1 bumps to 1.3.0\n if (this.patch !== 0 || this.prerelease.length === 0) {\n this.minor++\n }\n this.patch = 0\n this.prerelease = []\n break\n case 'patch':\n // If this is not a pre-release version, it will increment the patch.\n // If it is a pre-release it will bump up to the same patch version.\n // 1.2.0-5 patches to 1.2.0\n // 1.2.0 patches to 1.2.1\n if (this.prerelease.length === 0) {\n this.patch++\n }\n this.prerelease = []\n break\n // This probably shouldn't be used publicly.\n // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.\n case 'pre': {\n const base = Number(identifierBase) ? 1 : 0\n\n if (this.prerelease.length === 0) {\n this.prerelease = [base]\n } else {\n let i = this.prerelease.length\n while (--i >= 0) {\n if (typeof this.prerelease[i] === 'number') {\n this.prerelease[i]++\n i = -2\n }\n }\n if (i === -1) {\n // didn't increment anything\n if (identifier === this.prerelease.join('.') && identifierBase === false) {\n throw new Error('invalid increment argument: identifier already exists')\n }\n this.prerelease.push(base)\n }\n }\n if (identifier) {\n // 1.2.0-beta.1 bumps to 1.2.0-beta.2,\n // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0\n let prerelease = [identifier, base]\n if (identifierBase === false) {\n prerelease = [identifier]\n }\n if (isPrereleaseIdentifier(this.prerelease, identifier)) {\n const prereleaseBase = this.prerelease[identifier.split('.').length]\n if (isNaN(prereleaseBase)) {\n this.prerelease = prerelease\n }\n } else {\n this.prerelease = prerelease\n }\n }\n break\n }\n default:\n throw new Error(`invalid increment argument: ${release}`)\n }\n this.raw = this.format()\n if (this.build.length) {\n this.raw += `+${this.build.join('.')}`\n }\n return this\n }\n}\n\nmodule.exports = SemVer\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = (version, options, throwErrors = false) => {\n if (version instanceof SemVer) {\n return version\n }\n try {\n return new SemVer(version, options)\n } catch (er) {\n if (!throwErrors) {\n return null\n }\n throw er\n }\n}\n\nmodule.exports = parse\n","'use strict'\n\nconst parse = require('./parse')\nconst valid = (version, options) => {\n const v = parse(version, options)\n return v ? v.version : null\n}\nmodule.exports = valid\n","'use strict'\n\nconst parse = require('./parse')\nconst clean = (version, options) => {\n const s = parse(version.trim().replace(/^[=v]+/, ''), options)\n return s ? s.version : null\n}\nmodule.exports = clean\n","'use strict'\n\nconst SemVer = require('../classes/semver')\n\nconst inc = (version, release, options, identifier, identifierBase) => {\n if (typeof (options) === 'string') {\n identifierBase = identifier\n identifier = options\n options = undefined\n }\n\n try {\n return new SemVer(\n version instanceof SemVer ? version.version : version,\n options\n ).inc(release, identifier, identifierBase).version\n } catch (er) {\n return null\n }\n}\nmodule.exports = inc\n","'use strict'\n\nconst parse = require('./parse.js')\n\nconst diff = (version1, version2) => {\n const v1 = parse(version1, null, true)\n const v2 = parse(version2, null, true)\n const comparison = v1.compare(v2)\n\n if (comparison === 0) {\n return null\n }\n\n const v1Higher = comparison > 0\n const highVersion = v1Higher ? v1 : v2\n const lowVersion = v1Higher ? v2 : v1\n const highHasPre = !!highVersion.prerelease.length\n const lowHasPre = !!lowVersion.prerelease.length\n\n if (lowHasPre && !highHasPre) {\n // Going from prerelease -> no prerelease requires some special casing\n\n // If the low version has only a major, then it will always be a major\n // Some examples:\n // 1.0.0-1 -> 1.0.0\n // 1.0.0-1 -> 1.1.1\n // 1.0.0-1 -> 2.0.0\n if (!lowVersion.patch && !lowVersion.minor) {\n return 'major'\n }\n\n // If the main part has no difference\n if (lowVersion.compareMain(highVersion) === 0) {\n if (lowVersion.minor && !lowVersion.patch) {\n return 'minor'\n }\n return 'patch'\n }\n }\n\n // add the `pre` prefix if we are going to a prerelease version\n const prefix = highHasPre ? 'pre' : ''\n\n if (v1.major !== v2.major) {\n return prefix + 'major'\n }\n\n if (v1.minor !== v2.minor) {\n return prefix + 'minor'\n }\n\n if (v1.patch !== v2.patch) {\n return prefix + 'patch'\n }\n\n // high and low are prereleases\n return 'prerelease'\n}\n\nmodule.exports = diff\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst major = (a, loose) => new SemVer(a, loose).major\nmodule.exports = major\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst minor = (a, loose) => new SemVer(a, loose).minor\nmodule.exports = minor\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst patch = (a, loose) => new SemVer(a, loose).patch\nmodule.exports = patch\n","'use strict'\n\nconst parse = require('./parse')\nconst prerelease = (version, options) => {\n const parsed = parse(version, options)\n return (parsed && parsed.prerelease.length) ? parsed.prerelease : null\n}\nmodule.exports = prerelease\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compare = (a, b, loose) =>\n new SemVer(a, loose).compare(new SemVer(b, loose))\n\nmodule.exports = compare\n","'use strict'\n\nconst compare = require('./compare')\nconst rcompare = (a, b, loose) => compare(b, a, loose)\nmodule.exports = rcompare\n","'use strict'\n\nconst compare = require('./compare')\nconst compareLoose = (a, b) => compare(a, b, true)\nmodule.exports = compareLoose\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst compareBuild = (a, b, loose) => {\n const versionA = new SemVer(a, loose)\n const versionB = new SemVer(b, loose)\n return versionA.compare(versionB) || versionA.compareBuild(versionB)\n}\nmodule.exports = compareBuild\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))\nmodule.exports = sort\n","'use strict'\n\nconst compareBuild = require('./compare-build')\nconst rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))\nmodule.exports = rsort\n","'use strict'\n\nconst compare = require('./compare')\nconst gt = (a, b, loose) => compare(a, b, loose) > 0\nmodule.exports = gt\n","'use strict'\n\nconst compare = require('./compare')\nconst lt = (a, b, loose) => compare(a, b, loose) < 0\nmodule.exports = lt\n","'use strict'\n\nconst compare = require('./compare')\nconst eq = (a, b, loose) => compare(a, b, loose) === 0\nmodule.exports = eq\n","'use strict'\n\nconst compare = require('./compare')\nconst neq = (a, b, loose) => compare(a, b, loose) !== 0\nmodule.exports = neq\n","'use strict'\n\nconst compare = require('./compare')\nconst gte = (a, b, loose) => compare(a, b, loose) >= 0\nmodule.exports = gte\n","'use strict'\n\nconst compare = require('./compare')\nconst lte = (a, b, loose) => compare(a, b, loose) <= 0\nmodule.exports = lte\n","'use strict'\n\nconst eq = require('./eq')\nconst neq = require('./neq')\nconst gt = require('./gt')\nconst gte = require('./gte')\nconst lt = require('./lt')\nconst lte = require('./lte')\n\nconst cmp = (a, op, b, loose) => {\n switch (op) {\n case '===':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a === b\n\n case '!==':\n if (typeof a === 'object') {\n a = a.version\n }\n if (typeof b === 'object') {\n b = b.version\n }\n return a !== b\n\n case '':\n case '=':\n case '==':\n return eq(a, b, loose)\n\n case '!=':\n return neq(a, b, loose)\n\n case '>':\n return gt(a, b, loose)\n\n case '>=':\n return gte(a, b, loose)\n\n case '<':\n return lt(a, b, loose)\n\n case '<=':\n return lte(a, b, loose)\n\n default:\n throw new TypeError(`Invalid operator: ${op}`)\n }\n}\nmodule.exports = cmp\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst parse = require('./parse')\nconst { safeRe: re, t } = require('../internal/re')\n\nconst coerce = (version, options) => {\n if (version instanceof SemVer) {\n return version\n }\n\n if (typeof version === 'number') {\n version = String(version)\n }\n\n if (typeof version !== 'string') {\n return null\n }\n\n options = options || {}\n\n let match = null\n if (!options.rtl) {\n match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])\n } else {\n // Find the right-most coercible string that does not share\n // a terminus with a more left-ward coercible string.\n // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'\n // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'\n //\n // Walk through the string checking with a /g regexp\n // Manually set the index so as to pick up overlapping matches.\n // Stop when we get a match that ends at the string end, since no\n // coercible string can be more right-ward without the same terminus.\n const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]\n let next\n while ((next = coerceRtlRegex.exec(version)) &&\n (!match || match.index + match[0].length !== version.length)\n ) {\n if (!match ||\n next.index + next[0].length !== match.index + match[0].length) {\n match = next\n }\n coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length\n }\n // leave it in a clean state\n coerceRtlRegex.lastIndex = -1\n }\n\n if (match === null) {\n return null\n }\n\n const major = match[2]\n const minor = match[3] || '0'\n const patch = match[4] || '0'\n const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''\n const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''\n\n return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)\n}\nmodule.exports = coerce\n","'use strict'\n\nconst parse = require('./parse')\nconst constants = require('../internal/constants')\nconst SemVer = require('../classes/semver')\n\nconst truncate = (version, truncation, options) => {\n if (!constants.RELEASE_TYPES.includes(truncation)) {\n return null\n }\n\n const clonedVersion = cloneInputVersion(version, options)\n return clonedVersion && doTruncation(clonedVersion, truncation)\n}\n\nconst cloneInputVersion = (version, options) => {\n const versionStringToParse = (\n version instanceof SemVer ? version.version : version\n )\n\n return parse(versionStringToParse, options)\n}\n\nconst doTruncation = (version, truncation) => {\n if (isPrerelease(truncation)) {\n return version.version\n }\n\n version.prerelease = []\n\n switch (truncation) {\n case 'major':\n version.minor = 0\n version.patch = 0\n break\n case 'minor':\n version.patch = 0\n break\n }\n\n return version.format()\n}\n\nconst isPrerelease = (type) => {\n return type.startsWith('pre')\n}\n\nmodule.exports = truncate\n","'use strict'\n\nclass LRUCache {\n constructor () {\n this.max = 1000\n this.map = new Map()\n }\n\n get (key) {\n const value = this.map.get(key)\n if (value === undefined) {\n return undefined\n } else {\n // Remove the key from the map and add it to the end\n this.map.delete(key)\n this.map.set(key, value)\n return value\n }\n }\n\n delete (key) {\n return this.map.delete(key)\n }\n\n set (key, value) {\n const deleted = this.delete(key)\n\n if (!deleted && value !== undefined) {\n // If cache is full, delete the least recently used item\n if (this.map.size >= this.max) {\n const firstKey = this.map.keys().next().value\n this.delete(firstKey)\n }\n\n this.map.set(key, value)\n }\n\n return this\n }\n}\n\nmodule.exports = LRUCache\n","'use strict'\n\nconst SPACE_CHARACTERS = /\\s+/g\n\n// hoisted class for cyclic dependency\nclass Range {\n constructor (range, options) {\n options = parseOptions(options)\n\n if (range instanceof Range) {\n if (\n range.loose === !!options.loose &&\n range.includePrerelease === !!options.includePrerelease\n ) {\n return range\n } else {\n return new Range(range.raw, options)\n }\n }\n\n if (range instanceof Comparator) {\n // just put it in the set and return\n this.raw = range.value\n this.set = [[range]]\n this.formatted = undefined\n return this\n }\n\n this.options = options\n this.loose = !!options.loose\n this.includePrerelease = !!options.includePrerelease\n\n // First reduce all whitespace as much as possible so we do not have to rely\n // on potentially slow regexes like \\s*. This is then stored and used for\n // future error messages as well.\n this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')\n\n // First, split on ||\n this.set = this.raw\n .split('||')\n // map the range to a 2d array of comparators\n .map(r => this.parseRange(r.trim()))\n // throw out any comparator lists that are empty\n // this generally means that it was not a valid range, which is allowed\n // in loose mode, but will still throw if the WHOLE range is invalid.\n .filter(c => c.length)\n\n if (!this.set.length) {\n throw new TypeError(`Invalid SemVer Range: ${this.raw}`)\n }\n\n // if we have any that are not the null set, throw out null sets.\n if (this.set.length > 1) {\n // keep the first one, in case they're all null sets\n const first = this.set[0]\n this.set = this.set.filter(c => !isNullSet(c[0]))\n if (this.set.length === 0) {\n this.set = [first]\n } else if (this.set.length > 1) {\n // if we have any that are *, then the range is just *\n for (const c of this.set) {\n if (c.length === 1 && isAny(c[0])) {\n this.set = [c]\n break\n }\n }\n }\n }\n\n this.formatted = undefined\n }\n\n get range () {\n if (this.formatted === undefined) {\n this.formatted = ''\n for (let i = 0; i < this.set.length; i++) {\n if (i > 0) {\n this.formatted += '||'\n }\n const comps = this.set[i]\n for (let k = 0; k < comps.length; k++) {\n if (k > 0) {\n this.formatted += ' '\n }\n this.formatted += comps[k].toString().trim()\n }\n }\n }\n return this.formatted\n }\n\n format () {\n return this.range\n }\n\n toString () {\n return this.range\n }\n\n parseRange (range) {\n // strip build metadata so it can't bleed into the version\n range = range.replace(BUILDSTRIPRE, '')\n\n // memoize range parsing for performance.\n // this is a very hot path, and fully deterministic.\n const memoOpts =\n (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |\n (this.options.loose && FLAG_LOOSE)\n const memoKey = memoOpts + ':' + range\n const cached = cache.get(memoKey)\n if (cached) {\n return cached\n }\n\n const loose = this.options.loose\n // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`\n const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]\n range = range.replace(hr, hyphenReplace(this.options.includePrerelease))\n debug('hyphen replace', range)\n\n // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`\n range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)\n debug('comparator trim', range)\n\n // `~ 1.2.3` => `~1.2.3`\n range = range.replace(re[t.TILDETRIM], tildeTrimReplace)\n debug('tilde trim', range)\n\n // `^ 1.2.3` => `^1.2.3`\n range = range.replace(re[t.CARETTRIM], caretTrimReplace)\n debug('caret trim', range)\n\n // At this point, the range is completely trimmed and\n // ready to be split into comparators.\n\n let rangeList = range\n .split(' ')\n .map(comp => parseComparator(comp, this.options))\n .join(' ')\n .split(/\\s+/)\n // >=0.0.0 is equivalent to *\n .map(comp => replaceGTE0(comp, this.options))\n\n if (loose) {\n // in loose mode, throw out any that are not valid comparators\n rangeList = rangeList.filter(comp => {\n debug('loose invalid filter', comp, this.options)\n return !!comp.match(re[t.COMPARATORLOOSE])\n })\n }\n debug('range list', rangeList)\n\n // if any comparators are the null set, then replace with JUST null set\n // if more than one comparator, remove any * comparators\n // also, don't include the same comparator more than once\n const rangeMap = new Map()\n const comparators = rangeList.map(comp => new Comparator(comp, this.options))\n for (const comp of comparators) {\n if (isNullSet(comp)) {\n return [comp]\n }\n rangeMap.set(comp.value, comp)\n }\n if (rangeMap.size > 1 && rangeMap.has('')) {\n rangeMap.delete('')\n }\n\n const result = [...rangeMap.values()]\n cache.set(memoKey, result)\n return result\n }\n\n intersects (range, options) {\n if (!(range instanceof Range)) {\n throw new TypeError('a Range is required')\n }\n\n return this.set.some((thisComparators) => {\n return (\n isSatisfiable(thisComparators, options) &&\n range.set.some((rangeComparators) => {\n return (\n isSatisfiable(rangeComparators, options) &&\n thisComparators.every((thisComparator) => {\n return rangeComparators.every((rangeComparator) => {\n return thisComparator.intersects(rangeComparator, options)\n })\n })\n )\n })\n )\n })\n }\n\n // if ANY of the sets match ALL of its comparators, then pass\n test (version) {\n if (!version) {\n return false\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n for (let i = 0; i < this.set.length; i++) {\n if (testSet(this.set[i], version, this.options)) {\n return true\n }\n }\n return false\n }\n}\n\nmodule.exports = Range\n\nconst LRU = require('../internal/lrucache')\nconst cache = new LRU()\n\nconst parseOptions = require('../internal/parse-options')\nconst Comparator = require('./comparator')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst {\n safeRe: re,\n src,\n t,\n comparatorTrimReplace,\n tildeTrimReplace,\n caretTrimReplace,\n} = require('../internal/re')\nconst { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')\n\n// unbounded global build-metadata stripper used by parseRange\nconst BUILDSTRIPRE = new RegExp(src[t.BUILD], 'g')\n\nconst isNullSet = c => c.value === '<0.0.0-0'\nconst isAny = c => c.value === ''\n\n// take a set of comparators and determine whether there\n// exists a version which can satisfy it\nconst isSatisfiable = (comparators, options) => {\n let result = true\n const remainingComparators = comparators.slice()\n let testComparator = remainingComparators.pop()\n\n while (result && remainingComparators.length) {\n result = remainingComparators.every((otherComparator) => {\n return testComparator.intersects(otherComparator, options)\n })\n\n testComparator = remainingComparators.pop()\n }\n\n return result\n}\n\n// comprised of xranges, tildes, stars, and gtlt's at this point.\n// already replaced the hyphen ranges\n// turn into a set of JUST comparators.\nconst parseComparator = (comp, options) => {\n comp = comp.replace(re[t.BUILD], '')\n debug('comp', comp, options)\n comp = replaceCarets(comp, options)\n debug('caret', comp)\n comp = replaceTildes(comp, options)\n debug('tildes', comp)\n comp = replaceXRanges(comp, options)\n debug('xrange', comp)\n comp = replaceStars(comp, options)\n debug('stars', comp)\n return comp\n}\n\nconst isX = id => !id || id.toLowerCase() === 'x' || id === '*'\n\nconst invalidXRangeOrder = (M, m, p) => (\n (isX(M) && !isX(m)) ||\n (isX(m) && p && !isX(p))\n)\n\n// ~, ~> --> * (any, kinda silly)\n// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0\n// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0\n// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0\n// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0\n// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0\n// ~0.0.1 --> >=0.0.1 <0.1.0-0\nconst replaceTildes = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceTilde(c, options))\n .join(' ')\n}\n\nconst replaceTilde = (comp, options) => {\n const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]\n // if we're including prereleases in the match, then the lower bound is\n // -0, the lowest possible prerelease value, just like x-ranges and carets.\n // this keeps `~1.2` equivalent to the `1.2.x` x-range it's documented as.\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('tilde', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n // ~1.2 == >=1.2.0 <1.3.0-0\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else if (pr) {\n debug('replaceTilde pr', pr)\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n } else {\n // ~1.2.3 == >=1.2.3 <1.3.0-0\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('tilde return', ret)\n return ret\n })\n}\n\n// ^ --> * (any, kinda silly)\n// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0\n// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0\n// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0\n// ^1.2.3 --> >=1.2.3 <2.0.0-0\n// ^1.2.0 --> >=1.2.0 <2.0.0-0\n// ^0.0.1 --> >=0.0.1 <0.0.2-0\n// ^0.1.0 --> >=0.1.0 <0.2.0-0\nconst replaceCarets = (comp, options) => {\n return comp\n .trim()\n .split(/\\s+/)\n .map((c) => replaceCaret(c, options))\n .join(' ')\n}\n\nconst replaceCaret = (comp, options) => {\n debug('caret', comp, options)\n const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]\n const z = options.includePrerelease ? '-0' : ''\n return comp.replace(r, (_, M, m, p, pr) => {\n debug('caret', comp, _, M, m, p, pr)\n let ret\n\n if (isX(M)) {\n ret = ''\n } else if (isX(m)) {\n ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`\n } else if (isX(p)) {\n if (M === '0') {\n ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`\n } else {\n ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`\n }\n } else if (pr) {\n debug('replaceCaret pr', pr)\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p}-${pr\n } <${+M + 1}.0.0-0`\n }\n } else {\n debug('no pr')\n if (M === '0') {\n if (m === '0') {\n ret = `>=${M}.${m}.${p\n } <${M}.${m}.${+p + 1}-0`\n } else {\n ret = `>=${M}.${m}.${p\n } <${M}.${+m + 1}.0-0`\n }\n } else {\n ret = `>=${M}.${m}.${p\n } <${+M + 1}.0.0-0`\n }\n }\n\n debug('caret return', ret)\n return ret\n })\n}\n\nconst replaceXRanges = (comp, options) => {\n debug('replaceXRanges', comp, options)\n return comp\n .split(/\\s+/)\n .map((c) => replaceXRange(c, options))\n .join(' ')\n}\n\nconst replaceXRange = (comp, options) => {\n comp = comp.trim()\n const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]\n return comp.replace(r, (ret, gtlt, M, m, p, pr) => {\n debug('xRange', comp, ret, gtlt, M, m, p, pr)\n if (invalidXRangeOrder(M, m, p)) {\n return comp\n }\n\n const xM = isX(M)\n const xm = xM || isX(m)\n const xp = xm || isX(p)\n const anyX = xp\n\n if (gtlt === '=' && anyX) {\n gtlt = ''\n }\n\n // if we're including prereleases in the match, then we need\n // to fix this to -0, the lowest possible prerelease value\n pr = options.includePrerelease ? '-0' : ''\n\n if (xM) {\n if (gtlt === '>' || gtlt === '<') {\n // nothing is allowed\n ret = '<0.0.0-0'\n } else {\n // nothing is forbidden\n ret = '*'\n }\n } else if (gtlt && anyX) {\n // we know patch is an x, because we have any x at all.\n // replace X with 0\n if (xm) {\n m = 0\n }\n p = 0\n\n if (gtlt === '>') {\n // >1 => >=2.0.0\n // >1.2 => >=1.3.0\n gtlt = '>='\n if (xm) {\n M = +M + 1\n m = 0\n p = 0\n } else {\n m = +m + 1\n p = 0\n }\n } else if (gtlt === '<=') {\n // <=0.7.x is actually <0.8.0, since any 0.7.x should\n // pass. Similarly, <=7.x is actually <8.0.0, etc.\n gtlt = '<'\n if (xm) {\n M = +M + 1\n } else {\n m = +m + 1\n }\n }\n\n if (gtlt === '<') {\n pr = '-0'\n }\n\n ret = `${gtlt + M}.${m}.${p}${pr}`\n } else if (xm) {\n ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`\n } else if (xp) {\n ret = `>=${M}.${m}.0${pr\n } <${M}.${+m + 1}.0-0`\n }\n\n debug('xRange return', ret)\n\n return ret\n })\n}\n\n// Because * is AND-ed with everything else in the comparator,\n// and '' means \"any version\", just remove the *s entirely.\nconst replaceStars = (comp, options) => {\n debug('replaceStars', comp, options)\n // Looseness is ignored here. star is always as loose as it gets!\n return comp\n .trim()\n .replace(re[t.STAR], '')\n}\n\nconst replaceGTE0 = (comp, options) => {\n debug('replaceGTE0', comp, options)\n return comp\n .trim()\n .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')\n}\n\n// This function is passed to string.replace(re[t.HYPHENRANGE])\n// M, m, patch, prerelease, build\n// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5\n// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do\n// 1.2 - 3.4 => >=1.2.0 <3.5.0-0\n// TODO build?\nconst hyphenReplace = incPr => ($0,\n from, fM, fm, fp, fpr, fb,\n to, tM, tm, tp, tpr) => {\n if (isX(fM)) {\n from = ''\n } else if (isX(fm)) {\n from = `>=${fM}.0.0${incPr ? '-0' : ''}`\n } else if (isX(fp)) {\n from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`\n } else if (fpr) {\n from = `>=${from}`\n } else {\n from = `>=${from}${incPr ? '-0' : ''}`\n }\n\n if (isX(tM)) {\n to = ''\n } else if (isX(tm)) {\n to = `<${+tM + 1}.0.0-0`\n } else if (isX(tp)) {\n to = `<${tM}.${+tm + 1}.0-0`\n } else if (tpr) {\n to = `<=${tM}.${tm}.${tp}-${tpr}`\n } else if (incPr) {\n to = `<${tM}.${tm}.${+tp + 1}-0`\n } else {\n to = `<=${to}`\n }\n\n return `${from} ${to}`.trim()\n}\n\nconst testSet = (set, version, options) => {\n for (let i = 0; i < set.length; i++) {\n if (!set[i].test(version)) {\n return false\n }\n }\n\n if (version.prerelease.length && !options.includePrerelease) {\n // Find the set of versions that are allowed to have prereleases\n // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0\n // That should allow `1.2.3-pr.2` to pass.\n // However, `1.2.4-alpha.notready` should NOT be allowed,\n // even though it's within the range set by the comparators.\n for (let i = 0; i < set.length; i++) {\n debug(set[i].semver)\n if (set[i].semver === Comparator.ANY) {\n continue\n }\n\n if (set[i].semver.prerelease.length > 0) {\n const allowed = set[i].semver\n if (allowed.major === version.major &&\n allowed.minor === version.minor &&\n allowed.patch === version.patch) {\n return true\n }\n }\n }\n\n // Version has a -pre, but it's not one of the ones we like.\n return false\n }\n\n return true\n}\n","'use strict'\n\nconst ANY = Symbol('SemVer ANY')\n// hoisted class for cyclic dependency\nclass Comparator {\n static get ANY () {\n return ANY\n }\n\n constructor (comp, options) {\n options = parseOptions(options)\n\n if (comp instanceof Comparator) {\n if (comp.loose === !!options.loose) {\n return comp\n } else {\n comp = comp.value\n }\n }\n\n comp = comp.trim().split(/\\s+/).join(' ')\n debug('comparator', comp, options)\n this.options = options\n this.loose = !!options.loose\n this.parse(comp)\n\n if (this.semver === ANY) {\n this.value = ''\n } else {\n this.value = this.operator + this.semver.version\n }\n\n debug('comp', this)\n }\n\n parse (comp) {\n const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]\n const m = comp.match(r)\n\n if (!m) {\n throw new TypeError(`Invalid comparator: ${comp}`)\n }\n\n this.operator = m[1] !== undefined ? m[1] : ''\n if (this.operator === '=') {\n this.operator = ''\n }\n\n // if it literally is just '>' or '' then allow anything.\n if (!m[2]) {\n this.semver = ANY\n } else {\n this.semver = new SemVer(m[2], this.options.loose)\n }\n }\n\n toString () {\n return this.value\n }\n\n test (version) {\n debug('Comparator.test', version, this.options.loose)\n\n if (this.semver === ANY || version === ANY) {\n return true\n }\n\n if (typeof version === 'string') {\n try {\n version = new SemVer(version, this.options)\n } catch (er) {\n return false\n }\n }\n\n return cmp(version, this.operator, this.semver, this.options)\n }\n\n intersects (comp, options) {\n if (!(comp instanceof Comparator)) {\n throw new TypeError('a Comparator is required')\n }\n\n if (this.operator === '') {\n if (this.value === '') {\n return true\n }\n return new Range(comp.value, options).test(this.value)\n } else if (comp.operator === '') {\n if (comp.value === '') {\n return true\n }\n return new Range(this.value, options).test(comp.semver)\n }\n\n options = parseOptions(options)\n\n // Special cases where nothing can possibly be lower\n if (options.includePrerelease &&\n (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {\n return false\n }\n if (!options.includePrerelease &&\n (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {\n return false\n }\n\n // Same direction increasing (> or >=)\n if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {\n return true\n }\n // Same direction decreasing (< or <=)\n if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {\n return true\n }\n // same SemVer and both sides are inclusive (<= or >=)\n if (\n (this.semver.version === comp.semver.version) &&\n this.operator.includes('=') && comp.operator.includes('=')) {\n return true\n }\n // opposite directions less than\n if (cmp(this.semver, '<', comp.semver, options) &&\n this.operator.startsWith('>') && comp.operator.startsWith('<')) {\n return true\n }\n // opposite directions greater than\n if (cmp(this.semver, '>', comp.semver, options) &&\n this.operator.startsWith('<') && comp.operator.startsWith('>')) {\n return true\n }\n return false\n }\n}\n\nmodule.exports = Comparator\n\nconst parseOptions = require('../internal/parse-options')\nconst { safeRe: re, t } = require('../internal/re')\nconst cmp = require('../functions/cmp')\nconst debug = require('../internal/debug')\nconst SemVer = require('./semver')\nconst Range = require('./range')\n","'use strict'\n\nconst Range = require('../classes/range')\nconst satisfies = (version, range, options) => {\n try {\n range = new Range(range, options)\n } catch (er) {\n return false\n }\n return range.test(version)\n}\nmodule.exports = satisfies\n","'use strict'\n\nconst Range = require('../classes/range')\n\n// Mostly just for testing and legacy API reasons\nconst toComparators = (range, options) =>\n new Range(range, options).set\n .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))\n\nmodule.exports = toComparators\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\n\nconst maxSatisfying = (versions, range, options) => {\n let max = null\n let maxSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!max || maxSV.compare(v) === -1) {\n // compare(max, v, true)\n max = v\n maxSV = new SemVer(max, options)\n }\n }\n })\n return max\n}\nmodule.exports = maxSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst minSatisfying = (versions, range, options) => {\n let min = null\n let minSV = null\n let rangeObj = null\n try {\n rangeObj = new Range(range, options)\n } catch (er) {\n return null\n }\n versions.forEach((v) => {\n if (rangeObj.test(v)) {\n // satisfies(v, range, options)\n if (!min || minSV.compare(v) === 1) {\n // compare(min, v, true)\n min = v\n minSV = new SemVer(min, options)\n }\n }\n })\n return min\n}\nmodule.exports = minSatisfying\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Range = require('../classes/range')\nconst gt = require('../functions/gt')\n\nconst minVersion = (range, loose) => {\n range = new Range(range, loose)\n\n let minver = new SemVer('0.0.0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = new SemVer('0.0.0-0')\n if (range.test(minver)) {\n return minver\n }\n\n minver = null\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let setMin = null\n comparators.forEach((comparator) => {\n // Clone to avoid manipulating the comparator's semver object.\n const compver = new SemVer(comparator.semver.version)\n switch (comparator.operator) {\n case '>':\n if (compver.prerelease.length === 0) {\n compver.patch++\n } else {\n compver.prerelease.push(0)\n }\n compver.raw = compver.format()\n /* fallthrough */\n case '':\n case '>=':\n if (!setMin || gt(compver, setMin)) {\n setMin = compver\n }\n break\n case '<':\n case '<=':\n /* Ignore maximum versions */\n break\n /* istanbul ignore next */\n default:\n throw new Error(`Unexpected operation: ${comparator.operator}`)\n }\n })\n if (setMin && (!minver || gt(minver, setMin))) {\n minver = setMin\n }\n }\n\n if (minver && range.test(minver)) {\n return minver\n }\n\n return null\n}\nmodule.exports = minVersion\n","'use strict'\n\nconst Range = require('../classes/range')\nconst validRange = (range, options) => {\n try {\n // Return '*' instead of '' so that truthiness works.\n // This will throw if it's invalid anyway\n return new Range(range, options).range || '*'\n } catch (er) {\n return null\n }\n}\nmodule.exports = validRange\n","'use strict'\n\nconst SemVer = require('../classes/semver')\nconst Comparator = require('../classes/comparator')\nconst { ANY } = Comparator\nconst Range = require('../classes/range')\nconst satisfies = require('../functions/satisfies')\nconst gt = require('../functions/gt')\nconst lt = require('../functions/lt')\nconst lte = require('../functions/lte')\nconst gte = require('../functions/gte')\n\nconst outside = (version, range, hilo, options) => {\n version = new SemVer(version, options)\n range = new Range(range, options)\n\n let gtfn, ltefn, ltfn, comp, ecomp\n switch (hilo) {\n case '>':\n gtfn = gt\n ltefn = lte\n ltfn = lt\n comp = '>'\n ecomp = '>='\n break\n case '<':\n gtfn = lt\n ltefn = gte\n ltfn = gt\n comp = '<'\n ecomp = '<='\n break\n default:\n throw new TypeError('Must provide a hilo val of \"<\" or \">\"')\n }\n\n // If it satisfies the range it is not outside\n if (satisfies(version, range, options)) {\n return false\n }\n\n // From now on, variable terms are as if we're in \"gtr\" mode.\n // but note that everything is flipped for the \"ltr\" function.\n\n for (let i = 0; i < range.set.length; ++i) {\n const comparators = range.set[i]\n\n let high = null\n let low = null\n\n comparators.forEach((comparator) => {\n if (comparator.semver === ANY) {\n comparator = new Comparator('>=0.0.0')\n }\n high = high || comparator\n low = low || comparator\n if (gtfn(comparator.semver, high.semver, options)) {\n high = comparator\n } else if (ltfn(comparator.semver, low.semver, options)) {\n low = comparator\n }\n })\n\n // If the edge version comparator has a operator then our version\n // isn't outside it\n if (high.operator === comp || high.operator === ecomp) {\n return false\n }\n\n // If the lowest version comparator has an operator and our version\n // is less than it then it isn't higher than the range\n if ((!low.operator || low.operator === comp) &&\n ltefn(version, low.semver)) {\n return false\n } else if (low.operator === ecomp && ltfn(version, low.semver)) {\n return false\n }\n }\n return true\n}\n\nmodule.exports = outside\n","'use strict'\n\n// Determine if version is greater than all the versions possible in the range.\nconst outside = require('./outside')\nconst gtr = (version, range, options) => outside(version, range, '>', options)\nmodule.exports = gtr\n","'use strict'\n\nconst outside = require('./outside')\n// Determine if version is less than all the versions possible in the range\nconst ltr = (version, range, options) => outside(version, range, '<', options)\nmodule.exports = ltr\n","'use strict'\n\nconst Range = require('../classes/range')\nconst intersects = (r1, r2, options) => {\n r1 = new Range(r1, options)\n r2 = new Range(r2, options)\n return r1.intersects(r2, options)\n}\nmodule.exports = intersects\n","'use strict'\n\n// given a set of versions and a range, create a \"simplified\" range\n// that includes the same versions that the original range does\n// If the original range is shorter than the simplified one, return that.\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\nmodule.exports = (versions, range, options) => {\n const set = []\n let first = null\n let prev = null\n const v = versions.sort((a, b) => compare(a, b, options))\n for (const version of v) {\n const included = satisfies(version, range, options)\n if (included) {\n prev = version\n if (!first) {\n first = version\n }\n } else {\n if (prev) {\n set.push([first, prev])\n }\n prev = null\n first = null\n }\n }\n if (first) {\n set.push([first, null])\n }\n\n const ranges = []\n for (const [min, max] of set) {\n if (min === max) {\n ranges.push(min)\n } else if (!max && min === v[0]) {\n ranges.push('*')\n } else if (!max) {\n ranges.push(`>=${min}`)\n } else if (min === v[0]) {\n ranges.push(`<=${max}`)\n } else {\n ranges.push(`${min} - ${max}`)\n }\n }\n const simplified = ranges.join(' || ')\n const original = typeof range.raw === 'string' ? range.raw : String(range)\n return simplified.length < original.length ? simplified : range\n}\n","'use strict'\n\nconst Range = require('../classes/range.js')\nconst Comparator = require('../classes/comparator.js')\nconst { ANY } = Comparator\nconst satisfies = require('../functions/satisfies.js')\nconst compare = require('../functions/compare.js')\n\n// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:\n// - Every simple range `r1, r2, ...` is a null set, OR\n// - Every simple range `r1, r2, ...` which is not a null set is a subset of\n// some `R1, R2, ...`\n//\n// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:\n// - If c is only the ANY comparator\n// - If C is only the ANY comparator, return true\n// - Else if in prerelease mode, return false\n// - else replace c with `[>=0.0.0]`\n// - If C is only the ANY comparator\n// - if in prerelease mode, return true\n// - else replace C with `[>=0.0.0]`\n// - Let EQ be the set of = comparators in c\n// - If EQ is more than one, return true (null set)\n// - Let GT be the highest > or >= comparator in c\n// - Let LT be the lowest < or <= comparator in c\n// - If GT and LT, and GT.semver > LT.semver, return true (null set)\n// - If any C is a = range, and GT or LT are set, return false\n// - If EQ\n// - If GT, and EQ does not satisfy GT, return true (null set)\n// - If LT, and EQ does not satisfy LT, return true (null set)\n// - If EQ satisfies every C, return true\n// - Else return false\n// - If GT\n// - If GT.semver is lower than any > or >= comp in C, return false\n// - If GT is >=, and GT.semver does not satisfy every C, return false\n// - If GT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the GT.semver tuple, return false\n// - If LT\n// - If LT.semver is greater than any < or <= comp in C, return false\n// - If LT is <=, and LT.semver does not satisfy every C, return false\n// - If LT.semver has a prerelease, and not in prerelease mode\n// - If no C has a prerelease and the LT.semver tuple, return false\n// - Else return true\n\nconst subset = (sub, dom, options = {}) => {\n if (sub === dom) {\n return true\n }\n\n sub = new Range(sub, options)\n dom = new Range(dom, options)\n let sawNonNull = false\n\n OUTER: for (const simpleSub of sub.set) {\n for (const simpleDom of dom.set) {\n const isSub = simpleSubset(simpleSub, simpleDom, options)\n sawNonNull = sawNonNull || isSub !== null\n if (isSub) {\n continue OUTER\n }\n }\n // the null set is a subset of everything, but null simple ranges in\n // a complex range should be ignored. so if we saw a non-null range,\n // then we know this isn't a subset, but if EVERY simple range was null,\n // then it is a subset.\n if (sawNonNull) {\n return false\n }\n }\n return true\n}\n\nconst minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]\nconst minimumVersion = [new Comparator('>=0.0.0')]\n\nconst simpleSubset = (sub, dom, options) => {\n if (sub === dom) {\n return true\n }\n\n if (sub.length === 1 && sub[0].semver === ANY) {\n if (dom.length === 1 && dom[0].semver === ANY) {\n return true\n } else if (options.includePrerelease) {\n sub = minimumVersionWithPreRelease\n } else {\n sub = minimumVersion\n }\n }\n\n if (dom.length === 1 && dom[0].semver === ANY) {\n if (options.includePrerelease) {\n return true\n } else {\n dom = minimumVersion\n }\n }\n\n const eqSet = new Set()\n let gt, lt\n for (const c of sub) {\n if (c.operator === '>' || c.operator === '>=') {\n gt = higherGT(gt, c, options)\n } else if (c.operator === '<' || c.operator === '<=') {\n lt = lowerLT(lt, c, options)\n } else {\n eqSet.add(c.semver)\n }\n }\n\n if (eqSet.size > 1) {\n return null\n }\n\n let gtltComp\n if (gt && lt) {\n gtltComp = compare(gt.semver, lt.semver, options)\n if (gtltComp > 0) {\n return null\n } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {\n return null\n }\n }\n\n // will iterate one or zero times\n for (const eq of eqSet) {\n if (gt && !satisfies(eq, String(gt), options)) {\n return null\n }\n\n if (lt && !satisfies(eq, String(lt), options)) {\n return null\n }\n\n for (const c of dom) {\n if (!satisfies(eq, String(c), options)) {\n return false\n }\n }\n\n return true\n }\n\n let higher, lower\n let hasDomLT, hasDomGT\n // if the subset has a prerelease, we need a comparator in the superset\n // with the same tuple and a prerelease, or it's not a subset\n let needDomLTPre = lt &&\n !options.includePrerelease &&\n lt.semver.prerelease.length ? lt.semver : false\n let needDomGTPre = gt &&\n !options.includePrerelease &&\n gt.semver.prerelease.length ? gt.semver : false\n // exception: <1.2.3-0 is the same as <1.2.3\n if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&\n lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {\n needDomLTPre = false\n }\n\n for (const c of dom) {\n hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='\n hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='\n if (gt) {\n if (needDomGTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomGTPre.major &&\n c.semver.minor === needDomGTPre.minor &&\n c.semver.patch === needDomGTPre.patch) {\n needDomGTPre = false\n }\n }\n if (c.operator === '>' || c.operator === '>=') {\n higher = higherGT(gt, c, options)\n if (higher === c && higher !== gt) {\n return false\n }\n } else if (gt.operator === '>=' && !c.test(gt.semver)) {\n return false\n }\n }\n if (lt) {\n if (needDomLTPre) {\n if (c.semver.prerelease && c.semver.prerelease.length &&\n c.semver.major === needDomLTPre.major &&\n c.semver.minor === needDomLTPre.minor &&\n c.semver.patch === needDomLTPre.patch) {\n needDomLTPre = false\n }\n }\n if (c.operator === '<' || c.operator === '<=') {\n lower = lowerLT(lt, c, options)\n if (lower === c && lower !== lt) {\n return false\n }\n } else if (lt.operator === '<=' && !c.test(lt.semver)) {\n return false\n }\n }\n if (!c.operator && (lt || gt) && gtltComp !== 0) {\n return false\n }\n }\n\n // if there was a < or >, and nothing in the dom, then must be false\n // UNLESS it was limited by another range in the other direction.\n // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0\n if (gt && hasDomLT && !lt && gtltComp !== 0) {\n return false\n }\n\n if (lt && hasDomGT && !gt && gtltComp !== 0) {\n return false\n }\n\n // we needed a prerelease range in a specific tuple, but didn't get one\n // then this isn't a subset. eg >=1.2.3-pre is not a subset of >=1.0.0,\n // because it includes prereleases in the 1.2.3 tuple\n if (needDomGTPre || needDomLTPre) {\n return false\n }\n\n return true\n}\n\n// >=1.2.3 is lower than >1.2.3\nconst higherGT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp > 0 ? a\n : comp < 0 ? b\n : b.operator === '>' && a.operator === '>=' ? b\n : a\n}\n\n// <=1.2.3 is higher than <1.2.3\nconst lowerLT = (a, b, options) => {\n if (!a) {\n return b\n }\n const comp = compare(a.semver, b.semver, options)\n return comp < 0 ? a\n : comp > 0 ? b\n : b.operator === '<' && a.operator === '<=' ? b\n : a\n}\n\nmodule.exports = subset\n","'use strict'\n\n// just pre-load all the stuff that index.js lazily exports\nconst internalRe = require('./internal/re')\nconst constants = require('./internal/constants')\nconst SemVer = require('./classes/semver')\nconst identifiers = require('./internal/identifiers')\nconst parse = require('./functions/parse')\nconst valid = require('./functions/valid')\nconst clean = require('./functions/clean')\nconst inc = require('./functions/inc')\nconst diff = require('./functions/diff')\nconst major = require('./functions/major')\nconst minor = require('./functions/minor')\nconst patch = require('./functions/patch')\nconst prerelease = require('./functions/prerelease')\nconst compare = require('./functions/compare')\nconst rcompare = require('./functions/rcompare')\nconst compareLoose = require('./functions/compare-loose')\nconst compareBuild = require('./functions/compare-build')\nconst sort = require('./functions/sort')\nconst rsort = require('./functions/rsort')\nconst gt = require('./functions/gt')\nconst lt = require('./functions/lt')\nconst eq = require('./functions/eq')\nconst neq = require('./functions/neq')\nconst gte = require('./functions/gte')\nconst lte = require('./functions/lte')\nconst cmp = require('./functions/cmp')\nconst coerce = require('./functions/coerce')\nconst truncate = require('./functions/truncate')\nconst Comparator = require('./classes/comparator')\nconst Range = require('./classes/range')\nconst satisfies = require('./functions/satisfies')\nconst toComparators = require('./ranges/to-comparators')\nconst maxSatisfying = require('./ranges/max-satisfying')\nconst minSatisfying = require('./ranges/min-satisfying')\nconst minVersion = require('./ranges/min-version')\nconst validRange = require('./ranges/valid')\nconst outside = require('./ranges/outside')\nconst gtr = require('./ranges/gtr')\nconst ltr = require('./ranges/ltr')\nconst intersects = require('./ranges/intersects')\nconst simplifyRange = require('./ranges/simplify')\nconst subset = require('./ranges/subset')\nmodule.exports = {\n parse,\n valid,\n clean,\n inc,\n diff,\n major,\n minor,\n patch,\n prerelease,\n compare,\n rcompare,\n compareLoose,\n compareBuild,\n sort,\n rsort,\n gt,\n lt,\n eq,\n neq,\n gte,\n lte,\n cmp,\n coerce,\n truncate,\n Comparator,\n Range,\n satisfies,\n toComparators,\n maxSatisfying,\n minSatisfying,\n minVersion,\n validRange,\n outside,\n gtr,\n ltr,\n intersects,\n simplifyRange,\n subset,\n SemVer,\n re: internalRe.re,\n src: internalRe.src,\n tokens: internalRe.t,\n SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,\n RELEASE_TYPES: constants.RELEASE_TYPES,\n compareIdentifiers: identifiers.compareIdentifiers,\n rcompareIdentifiers: identifiers.rcompareIdentifiers,\n}\n","import { Value } from \"@solve-js/vm/Value\";\nimport { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\n\n/**\n * One line's compiled bytecode, plus the variables it reads and writes.\n *\n * The reads and writes are what let the dependency graph re-evaluate only the\n * lines an edit actually affected.\n */\nexport class LineCacheEntry {\n constructor(\n public result: Value,\n public bytecode: BytecodeProgram,\n public readVariables: string[],\n public writeVariable: string | null\n ) {}\n}\n\n/**\n * Per-line result + bytecode cache.\n *\n * Entries are stored in a two-level map (line number → expression → entry)\n * so per-line operations, getEntryForLine, removeAllForLine, are O(1)\n * lookups instead of scans over every cached key. Entries with no\n * expression are stored under the empty-string key.\n *\n * The string keys exposed by keys()/forEach() keep the historical\n * \"line\" / \"line:expression\" format for diagnostics consumers.\n *\n * INVARIANT: at most one entry per line number at a time. `set()` stores\n * the expression alongside the entry ONLY as a same-key staleness check for\n * `get(line, expression)`, a line's previous text is never meaningfully\n * cacheable once the line has moved on, since `get()`/`getEntryForLine()`\n * are only ever called with the line's CURRENT text (see\n * `ExpressionEngine.reEvaluateLine()`). Before this invariant was enforced,\n * every distinct keystroke state of a line accumulated its own entry here\n * forever (nothing ever called `remove()`/`removeAllForLine()` per-edit,\n * only a full `clear()` on document switch), an unbounded, session-long\n * memory leak reachable via ordinary typing, and a latent correctness bug\n * in `getEntryForLine()`, which picks \"first in insertion order\" and could\n * silently return a STALE entry from an old edit of the line instead of\n * its current one once more than one entry had piled up.\n */\nexport class LineCache {\n /** line number → (expression, or \"\" for expressionless entries) → entry */\n private byLine: Map<number, Map<string, LineCacheEntry>> = new Map();\n private count = 0;\n\n private static exprKey(expression?: string): string {\n return expression ?? \"\";\n }\n\n private static displayKey(line: number, exprKey: string): string {\n return exprKey === \"\" ? `${line}` : `${line}:${exprKey}`;\n }\n\n get(line: number, expression?: string): LineCacheEntry | undefined {\n return this.byLine.get(line)?.get(LineCache.exprKey(expression));\n }\n\n /** Find any cache entry for the given line number, regardless of expression suffix */\n getEntryForLine(line: number): LineCacheEntry | undefined {\n const entries = this.byLine.get(line);\n if (!entries) return undefined;\n // First entry in insertion order, matches the historical scan behavior.\n for (const entry of entries.values()) {\n return entry;\n }\n return undefined;\n }\n\n set(line: number, entry: LineCacheEntry, expression?: string): void {\n let entries = this.byLine.get(line);\n if (!entries) {\n entries = new Map();\n this.byLine.set(line, entries);\n }\n const key = LineCache.exprKey(expression);\n // Enforce the one-entry-per-line invariant (see class doc comment):\n // any entry under a DIFFERENT expression key for this same line is for\n // text this line no longer has, drop it rather than let it pile up.\n if (entries.size > 0 && !entries.has(key)) {\n this.count -= entries.size;\n entries.clear();\n }\n if (!entries.has(key)) this.count++;\n entries.set(key, entry);\n }\n\n has(line: number, expression?: string): boolean {\n return this.byLine.get(line)?.has(LineCache.exprKey(expression)) ?? false;\n }\n\n remove(line: number, expression?: string): void {\n const entries = this.byLine.get(line);\n if (!entries) return;\n if (entries.delete(LineCache.exprKey(expression))) {\n this.count--;\n if (entries.size === 0) this.byLine.delete(line);\n }\n }\n\n removeAllForLine(line: number): void {\n const entries = this.byLine.get(line);\n if (!entries) return;\n this.count -= entries.size;\n this.byLine.delete(line);\n }\n\n clearLine(line: number): void {\n this.removeAllForLine(line);\n }\n\n /**\n * Number of entries in the cache. Useful for diagnostics.\n */\n get size(): number {\n return this.count;\n }\n\n clear(): void {\n this.byLine.clear();\n this.count = 0;\n }\n\n /**\n * Iterate all cache entries for diagnostics/debugging.\n */\n forEach(callback: (key: string, entry: LineCacheEntry) => void): void {\n for (const [line, entries] of this.byLine) {\n for (const [exprKey, entry] of entries) {\n callback(LineCache.displayKey(line, exprKey), entry);\n }\n }\n }\n\n /**\n * Get all entry keys.\n */\n keys(): string[] {\n const result: string[] = [];\n for (const [line, entries] of this.byLine) {\n for (const exprKey of entries.keys()) {\n result.push(LineCache.displayKey(line, exprKey));\n }\n }\n return result;\n }\n}\n","import type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\n\n/**\n * Package load-time compatibility checking, the \"detect overlapping\n * logic between packages\" SDK surface.\n *\n * This engine's package system (`IEnginePackage`) has always had SOME\n * collision visibility, but it's inconsistent and scattered: `ParseletRegistry`\n * warns on a token-type overwrite, `asConverterRegistry` warns on a converter\n * name overwrite, and `PhraseTrie` warns on... nothing at all, a second\n * package fusing the exact same multi-word phrase to a different token type\n * silently wins with zero signal, the same class of gap\n * `ParseletRegistry.registerPrefix()`'s collision-visibility fix closed for\n * parselets specifically (see `ARCHITECTURE.md`'s punch list). And none of\n * these existing checks can be run BEFORE registration, they only fire at\n * the moment a collision actually happens, deep inside a live engine.\n *\n * `checkPackageCompatibility()` is a single, pure, side-effect-free function\n * that statically compares one candidate package's declared descriptor\n * against a list of already-registered packages' descriptors, across every\n * collision-capable field `IEnginePackage` has, callable standalone (a host\n * building a plugin marketplace could run it before ever constructing an\n * engine) or wired into registration itself (see\n * `ExpressionEngine.registerPackage()`, which calls this automatically and\n * logs every conflict found, the \"load-up resiliency\" half of this\n * mechanism).\n *\n * A real, concrete motivating bug (found the same session this module was\n * built): the currency package's real `IEnginePackage` descriptor\n * (`CurrencyPackage.ts`) and its parallel test-harness registration helper\n * (`parselets/index.ts`'s `registerCurrencyParselets()`) drifted out of sync\n *, new currency-symbol token types were wired into one but not the other\n * caught only by a test happening to exercise the stale path. This module\n * doesn't catch THAT specific class of bug (two hand-written registration\n * functions for the same logical package diverging is a source-consistency\n * problem, not a runtime collision), but it DOES catch the more common and\n * more dangerous sibling: two DIFFERENT, independently-authored packages\n * unknowingly claiming the same token type, phrase, converter name, plugin\n * function index, or lexer keyword.\n */\n\n/** How serious a detected conflict is. */\nexport type CompatibilitySeverity = \"error\" | \"warning\" | \"info\";\n\n/** The category of overlap detected between two packages. */\nexport type CompatibilityConflictKind =\n | \"prefixParseletTokenType\"\n | \"infixParseletTokenType\"\n | \"phrase\"\n | \"converterName\"\n | \"pluginFunctionIndex\"\n | \"lexerKeyword\"\n | \"lexerOperator\"\n | \"asyncResolverNamespace\"\n | \"tokenCategory\";\n\n/** One way two packages collide, for example claiming the same keyword. */\nexport interface CompatibilityConflict {\n kind: CompatibilityConflictKind;\n severity: CompatibilitySeverity;\n /** Human-readable description, safe to log directly. */\n detail: string;\n /** The two package names involved, [existing, candidate]. */\n packages: [string, string];\n}\n\n/** Every conflict found between a candidate package and those already registered. */\nexport interface CompatibilityReport {\n /** `false` iff at least one \"error\"-severity conflict was found. */\n compatible: boolean;\n conflicts: CompatibilityConflict[];\n}\n\nfunction collectParseletConflicts(\n kind: \"prefixParseletTokenType\" | \"infixParseletTokenType\",\n fieldName: \"prefixParselets\" | \"infixParselets\",\n existingPkg: IEnginePackage,\n candidate: IEnginePackage,\n out: CompatibilityConflict[],\n): void {\n const existingEntries = existingPkg[fieldName];\n const candidateEntries = candidate[fieldName];\n if (!existingEntries || !candidateEntries) return;\n const existingTypes = new Set(existingEntries.map((e) => e.tokenType));\n for (const entry of candidateEntries) {\n if (existingTypes.has(entry.tokenType)) {\n out.push({\n kind,\n // A different parselet INSTANCE silently wins at registration time\n // (matches ParseletRegistry.registerPrefix/registerInfix's own\n // \"warn on a genuinely different instance, stay quiet on idempotent\n // re-registration\" behavior), flagged as a warning, not an error\n // since deliberate override is sometimes the intended use (a\n // package explicitly built to replace a built-in's grammar).\n severity: \"warning\",\n detail: `Both \"${existingPkg.name}\" and \"${candidate.name}\" register a ${fieldName === \"prefixParselets\" ? \"prefix\" : \"infix\"} parselet for token type \"${entry.tokenType}\" — the later-registered one silently wins.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n}\n\nfunction checkOnePackagePair(existingPkg: IEnginePackage, candidate: IEnginePackage): CompatibilityConflict[] {\n const conflicts: CompatibilityConflict[] = [];\n\n collectParseletConflicts(\"prefixParseletTokenType\", \"prefixParselets\", existingPkg, candidate, conflicts);\n collectParseletConflicts(\"infixParseletTokenType\", \"infixParselets\", existingPkg, candidate, conflicts);\n\n // Phrases, the ONE category with zero pre-existing runtime warning\n // anywhere (PhraseTrie silently overwrites on an exact-key collision).\n if (existingPkg.phrases && candidate.phrases) {\n for (const [phrase, tokenType] of Object.entries(candidate.phrases)) {\n const existingTokenType = existingPkg.phrases[phrase];\n if (existingTokenType !== undefined && existingTokenType !== tokenType) {\n conflicts.push({\n kind: \"phrase\",\n severity: \"warning\",\n detail: `Both \"${existingPkg.name}\" (-> \"${existingTokenType}\") and \"${candidate.name}\" (-> \"${tokenType}\") fuse the phrase \"${phrase}\" to DIFFERENT token types — PhraseTrie has no collision detection of its own, so the later-registered mapping silently wins with no other signal.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n // asConverters, mirrors registerAsConverter()'s own runtime warning, but\n // callable before either package is ever registered.\n if (existingPkg.asConverters && candidate.asConverters) {\n for (const name of Object.keys(candidate.asConverters)) {\n const key = name.toLowerCase();\n if (Object.keys(existingPkg.asConverters).some((n) => n.toLowerCase() === key)) {\n conflicts.push({\n kind: \"converterName\",\n severity: \"warning\",\n detail: `Both \"${existingPkg.name}\" and \"${candidate.name}\" register an \"as ${name}\" converter — the later-registered handler silently wins.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n // pluginFunctions, index collisions are ALWAYS a real bug (unlike\n // parselet/converter overrides, there's no legitimate \"intentional\n // replacement\" use case for two packages sharing a CALL_PLUGIN index;\n // allocatePluginFunctionIndex() exists specifically to make this\n // unreachable when used correctly, so a collision here means one side\n // hardcoded a number instead). This is the exact bug class that hit\n // THREE separate parallel background agents in one session before\n // this checker existed.\n if (existingPkg.pluginFunctions && candidate.pluginFunctions) {\n const existingIndices = new Set(existingPkg.pluginFunctions.map((f) => f.index));\n for (const fn of candidate.pluginFunctions) {\n if (existingIndices.has(fn.index)) {\n conflicts.push({\n kind: \"pluginFunctionIndex\",\n severity: \"error\",\n detail: `Both \"${existingPkg.name}\" and \"${candidate.name}\" register a pluginFunctions handler at index ${fn.index} — one of them almost certainly hardcoded this index instead of calling allocatePluginFunctionIndex(). Whichever registers second silently overwrites the first's handler in pluginFunctionRegistry.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n // Lexer keywords/operators, a word/symbol can only mean ONE token type.\n // `units` is deliberately NOT checked here: units live in a Set, and two\n // packages both recognizing the same unit WORD is harmless/idempotent\n // (there's no \"which token type wins\" ambiguity the way there is for a\n // keyword->tokenType or operator->tokenType mapping).\n const existingVocab = existingPkg.lexerVocabulary;\n const candidateVocab = candidate.lexerVocabulary;\n if (existingVocab?.keywords && candidateVocab?.keywords) {\n for (const [word, tokenType] of Object.entries(candidateVocab.keywords)) {\n const existingTokenType = existingVocab.keywords[word];\n if (existingTokenType !== undefined && existingTokenType !== tokenType) {\n conflicts.push({\n kind: \"lexerKeyword\",\n severity: \"error\",\n detail: `Both \"${existingPkg.name}\" (-> \"${existingTokenType}\") and \"${candidate.name}\" (-> \"${tokenType}\") register the lexer keyword \"${word}\" for DIFFERENT token types — whichever package registers second wins, and the loser's grammar becomes silently unreachable for that word.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n if (existingVocab?.operators && candidateVocab?.operators) {\n for (const [op, tokenType] of Object.entries(candidateVocab.operators)) {\n const existingTokenType = existingVocab.operators[op];\n if (existingTokenType !== undefined && existingTokenType !== tokenType) {\n conflicts.push({\n kind: \"lexerOperator\",\n severity: \"error\",\n detail: `Both \"${existingPkg.name}\" (-> \"${existingTokenType}\") and \"${candidate.name}\" (-> \"${tokenType}\") register the lexer operator \"${op}\" for DIFFERENT token types.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n // Async resolver namespaces, ResolverRegistry is keyed by namespace;\n // the JSDoc on IEnginePackage.asyncResolvers already states \"each\n // resolver must have a unique namespace\" as a hard requirement.\n if (existingPkg.asyncResolvers && candidate.asyncResolvers) {\n const existingNamespaces = new Set(existingPkg.asyncResolvers.map((r) => r.namespace));\n for (const resolver of candidate.asyncResolvers) {\n if (existingNamespaces.has(resolver.namespace)) {\n conflicts.push({\n kind: \"asyncResolverNamespace\",\n severity: \"error\",\n detail: `Both \"${existingPkg.name}\" and \"${candidate.name}\" register an async resolver under the namespace \"${resolver.namespace}\" — ResolverRegistry is keyed by namespace, so one resolver's cache/preflight state will silently clobber the other's.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n // Token categories. Same token type, different highlight category.\n // Cosmetic only (doesn't break parsing/evaluation), so \"info\" not\n // \"warning\"/\"error\", but still worth surfacing, since a silently-wrong\n // highlight color is exactly the kind of thing that's invisible until a\n // user notices their editor coloring looks off.\n if (existingPkg.tokenCategories && candidate.tokenCategories) {\n for (const [tokenType, category] of Object.entries(candidate.tokenCategories)) {\n const existingCategory = existingPkg.tokenCategories[tokenType];\n if (existingCategory !== undefined && existingCategory !== category) {\n conflicts.push({\n kind: \"tokenCategory\",\n severity: \"info\",\n detail: `Both \"${existingPkg.name}\" (-> \"${existingCategory}\") and \"${candidate.name}\" (-> \"${category}\") declare a highlight category for token type \"${tokenType}\" — cosmetic only, but the later registration wins.`,\n packages: [existingPkg.name, candidate.name],\n });\n }\n }\n }\n\n return conflicts;\n}\n\n/**\n * Statically check `candidate` against every package in `existing` for\n * overlapping/conflicting declarations, across every collision-capable\n * field `IEnginePackage` has. Pure and side-effect-free, does not touch\n * any shared registry, does not require a live `ExpressionEngine`.\n *\n * @example\n * ```ts\n * const report = checkPackageCompatibility(myNewPackage, BUILTIN_PACKAGES);\n * if (!report.compatible) {\n * for (const c of report.conflicts) console.error(c.detail);\n * }\n * ```\n */\nexport function checkPackageCompatibility(\n candidate: IEnginePackage,\n existing: IEnginePackage[],\n): CompatibilityReport {\n const conflicts: CompatibilityConflict[] = [];\n for (const existingPkg of existing) {\n if (existingPkg === candidate || existingPkg.name === candidate.name) continue;\n conflicts.push(...checkOnePackagePair(existingPkg, candidate));\n }\n return {\n compatible: !conflicts.some((c) => c.severity === \"error\"),\n conflicts,\n };\n}\n","import { satisfies, validRange, coerce } from \"semver\";\nimport type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\nimport { ENGINE_VERSION } from \"@solve-js/constants/version\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n/**\n * Engine-version package compatibility gating, the \"reject a package built\n * for a different engine version\" SDK surface.\n *\n * This is a DIFFERENT kind of check from `api/PackageCompatibility.ts`'s\n * `checkPackageCompatibility()`, and deliberately kept in its own module\n * rather than folded into that one. `checkPackageCompatibility()` answers\n * \"do these two SIMULTANEOUSLY-registered packages' declared fields\n * collide\" and its contract, pure, package-vs-package, every conflict\n * including \"error\" severity is advisory, the caller always just logs and\n * proceeds, is locked in by its own regression suite and stated explicitly\n * in `ExpressionEngine.registerPackage()`'s comments. This module answers a\n * different question, \"can THIS package's declared engine-version range\n * run against the engine that's actually running RIGHT NOW\", and, unlike\n * every other compatibility signal in this codebase, a mismatch here is a\n * hard REJECTION, not a warning. Mixing that blocking behavior into\n * `checkPackageCompatibility()`'s report type would be a footgun for any\n * future reader who's learned (correctly, until now) that every conflict\n * that module can produce stays advisory.\n *\n * `checkEngineVersionCompatibility()` is the pure predicate (mirrors\n * `checkPackageCompatibility()`'s \"return a result, caller decides\" shape,\n * and this codebase's own testing convention of asserting against plain\n * result objects rather than `toThrow()` for a pure function).\n * `assertEngineVersionCompatible()` is the thin throwing wrapper both\n * `ExpressionEngine.registerPackage()` and the `PackageRegistry` singleton\n * call as the very first thing they do. See `ARCHITECTURE.md` §5.3.\n */\n\nexport type EngineVersionCheckResult =\n | { compatible: true }\n | { compatible: false; reason: \"range-not-satisfied\"; declaredRange: string; engineVersion: string }\n | { compatible: false; reason: \"invalid-range\"; declaredRange: string; engineVersion: string };\n\n/**\n * Pure, side-effect-free. Returns `{ compatible: true }` when `pkg` declares\n * no `engineVersion` at all (no constraint = always allowed, preserves\n * every package that predates this field), when the declared range is\n * satisfied by `engineVersion`, or a `{ compatible: false, reason, ... }`\n * result otherwise. A malformed/unparseable range string (a typo in the\n * package's own descriptor) is its own distinct `\"invalid-range\"` reason\n * never conflated with a genuine `\"range-not-satisfied\"` mismatch, so a\n * package author gets feedback about the actual problem they have.\n */\nexport function checkEngineVersionCompatibility(\n pkg: IEnginePackage,\n engineVersion: string = ENGINE_VERSION,\n): EngineVersionCheckResult {\n if (!pkg.engineVersion) return { compatible: true };\n\n if (validRange(pkg.engineVersion) === null) {\n return { compatible: false, reason: \"invalid-range\", declaredRange: pkg.engineVersion, engineVersion };\n }\n\n // Compare against the release the prerelease is a prerelease OF, not the\n // prerelease string itself.\n //\n // Semver sorts 1.0.0-beta.0 BELOW 1.0.0, so it falls outside `^1.0.0` and a\n // package declaring that range would be rejected by the very beta meant to\n // ship its API. `includePrerelease` does not help: the ordering is what\n // excludes it, not a prerelease filter. Verified empirically against the\n // installed semver, including that `^0.1.0` still correctly rejects a 1.0.0\n // engine and that 1.2.3 and 2.0.0 behave unchanged against `^1.0.0`.\n //\n // Coercing is also the semantically right answer: 1.0.0-beta.N presents the\n // 1.0.0 API surface, which is the thing a package declares a range against.\n const comparableVersion = coerce(engineVersion)?.version ?? engineVersion;\n\n if (!satisfies(comparableVersion, pkg.engineVersion)) {\n return { compatible: false, reason: \"range-not-satisfied\", declaredRange: pkg.engineVersion, engineVersion };\n }\n\n return { compatible: true };\n}\n\n/**\n * Throws an `EngineError` (`ErrorCategory.CONFIG`, matching the existing\n * precedent for `PLUGIN_KEYWORD_COLLISION`/`PLUGIN_OPERATOR_COLLISION`/\n * `PLUGIN_UNIT_COLLISION` in `lexer/ExpressionLexer.ts`, the only other\n * place in this codebase that hard-rejects a package at registration time)\n * when `pkg` is not engine-version compatible. Does nothing when compatible.\n */\nexport function assertEngineVersionCompatible(\n pkg: IEnginePackage,\n engineVersion: string = ENGINE_VERSION,\n): void {\n const result = checkEngineVersionCompatibility(pkg, engineVersion);\n if (result.compatible) return;\n\n if (result.reason === \"invalid-range\") {\n throw ErrorFactory.config({\n code: \"PACKAGE_ENGINE_VERSION_INVALID_RANGE\",\n message: `Package \"${pkg.name}\" declares an invalid engineVersion range: \"${result.declaredRange}\" is not a valid semver range.`,\n expected: `a valid semver range string (e.g. \"^0.1.0\", \">=0.2.0 <1.0.0\")`,\n found: `\"${result.declaredRange}\"`,\n suggestion: `This is a range-syntax typo in \"${pkg.name}\"'s own descriptor, not a version mismatch with the running engine — check for a stray character.`,\n context: { packageName: pkg.name, declaredRange: result.declaredRange },\n });\n }\n\n throw ErrorFactory.config({\n code: \"PACKAGE_ENGINE_VERSION_MISMATCH\",\n message: `Package \"${pkg.name}\" declares engineVersion \"${result.declaredRange}\", which is not satisfied by the running engine version \"${result.engineVersion}\".`,\n expected: `an engine version satisfying \"${result.declaredRange}\"`,\n found: `engine version \"${result.engineVersion}\"`,\n suggestion: `Update \"${pkg.name}\" to a version built against solve-engine ${result.engineVersion}, or pin solve-engine to a version satisfying \"${result.declaredRange}\".`,\n context: { packageName: pkg.name, declaredRange: result.declaredRange, engineVersion: result.engineVersion },\n });\n}\n","/**\n * Engine worker, offloads both compilation and VM execution to a\n * background thread (plan L6: worker consolidation).\n *\n * Previously two separate worker files (compilation.worker.ts,\n * execution.worker.ts) duplicated the Transferable ArrayBuffer protocol,\n * postMessage/onmessage boilerplate, and lazy-init pattern. This file\n * merges them behind a single `self.onmessage` dispatching on `msg.type`\n * the message shapes are UNCHANGED from the two original files, so\n * CompilationWorkerManager and ExecutionPool (the main-thread consumers)\n * require no changes beyond importing this file's factory.\n *\n * Each Worker instance created from this file is used exclusively by ONE\n * consumer (a CompilationWorkerManager sends only COMPILE_BATCH; an\n * ExecutionPool sends only EXECUTE_BATCH), the module-level `engine` and\n * `vm` singletons below are independent lazy state, so there is no\n * cross-contamination between the two roles even though they share code.\n *\n * Message protocol:\n * Main → Worker:\n * { type: \"COMPILE_BATCH\", id, items: CompileItem[] }\n * { type: \"EXECUTE_BATCH\", id, items: ExecuteItem[] }\n * { type: \"TERMINATE\", id }\n *\n * Worker → Main:\n * { id, type: \"COMPILE_RESULT\", results: CompileResult[] }\n * { id, type: \"EXECUTE_RESULT\", results: ExecuteResult[] }\n *\n * Transferable objects: bytecode opcodes/numbers buffers are transferred\n * (zero-copy) in both directions, same pattern as the original files.\n */\n\nimport { ExpressionEngine } from \"../engine/ExpressionEngine\";\nimport type { Bytecode } from \"../vm/VM\";\nimport { createVM, executeBytecode } from \"../vm/VM\";\nimport { sharedOpRegistry } from \"../vm/OpRegistry\";\nimport { ValueType } from \"../vm/Value\";\n\n// ── Compile message types ──────────────────────────────────────────────\n\ninterface CompileItem {\n\tlineId: number;\n\texpression: string;\n\ttextHash: number;\n}\n\ninterface CompileBatchMsg {\n\ttype: \"COMPILE_BATCH\";\n\tid: number;\n\titems: CompileItem[];\n}\n\ninterface CompileResult {\n\tlineId: number;\n\texpression: string;\n\tcompiledAgainstHash: number;\n\topcodesBuffer: ArrayBuffer;\n\tnumbersBuffer: ArrayBuffer;\n\topcodesLength: number;\n\tnumbersLength: number;\n\tstrings: string[];\n\treads: string[];\n\twrites: string[];\n\tisVariableDef: boolean;\n\terror: string | null;\n}\n\n// ── Execute message types ──────────────────────────────────────────────\n\ninterface ExecuteItem {\n\tlineNumber: number;\n\topcodesBuffer: ArrayBuffer;\n\tnumbersBuffer: ArrayBuffer;\n\topcodesLength: number;\n\tnumbersLength: number;\n\tstrings: string[];\n}\n\ninterface ExecuteBatchMsg {\n\ttype: \"EXECUTE_BATCH\";\n\tid: number;\n\titems: ExecuteItem[];\n}\n\ninterface ExecuteResult {\n\tlineNumber: number;\n\tvalueType: ValueType;\n\tvalue: number;\n\tunit?: string;\n\tisPending: boolean;\n\tqueryKey?: string;\n}\n\ninterface TerminateMsg {\n\ttype: \"TERMINATE\";\n\tid: number;\n}\n\ntype EngineWorkerMessage = CompileBatchMsg | ExecuteBatchMsg | TerminateMsg;\n\n// ── Worker body ───────────────────────────────────────────────────────\n\n// A host that builds with esbuild-plugin-inline-worker gets this replaced by a\n// real factory returning a Worker. Nothing else does, the published tsup bundle\n// included, so this stub is a live runtime path rather than a dead sentinel.\n//\n// Throwing is the contract, not a failure to handle the case. Both consumers\n// probe availability by calling this inside a try/catch\n// ({@link ExecutionPool.isAvailable}, and the equivalent in\n// CompilationWorkerManager), so the throw is how they learn workers are\n// unavailable and fall back to the main thread. The message is for a developer\n// reading a stack trace, and is otherwise swallowed by design.\n//\n// The one raw `throw new Error` in the codebase. It stays raw because it is a\n// build-configuration signal rather than an engine error, and routing it\n// through ErrorFactory would imply a caller should inspect its code.\nexport default (() => {\n\tthrow new Error(\"engine.worker.ts was not processed by esbuild-plugin-inline-worker, so worker offload is unavailable\");\n}) as unknown as () => Worker;\n\n// ── Lazy per-role state, independent, only the used one is created ────\n\nlet compileEngine: ExpressionEngine | null = null;\nfunction getCompileEngine(): ExpressionEngine {\n\tif (!compileEngine) {\n\t\tcompileEngine = new ExpressionEngine(\"en\", false);\n\t}\n\treturn compileEngine;\n}\n\nlet executeVm: ReturnType<typeof createVM> | null = null;\nfunction getExecuteVm(): ReturnType<typeof createVM> {\n\tif (!executeVm) {\n\t\texecuteVm = createVM(sharedOpRegistry, 200, 50000);\n\t}\n\treturn executeVm;\n}\n\n// ── Compile ──────────────────────────────────────────────────────────\n\n/**\n * Compile a single expression and produce a transfer-ready CompileResult.\n * Extracts ArrayBuffers from the compiled TypedArrays so they can be\n * transferred via postMessage, after this call, the original TypedArrays\n * are detached on the worker side.\n */\nfunction compileOne(item: CompileItem): CompileResult {\n\tconst base: Omit<CompileResult, \"opcodesBuffer\" | \"numbersBuffer\" | \"opcodesLength\" | \"numbersLength\"> = {\n\t\tlineId: item.lineId,\n\t\texpression: item.expression,\n\t\tcompiledAgainstHash: item.textHash,\n\t\tstrings: [],\n\t\treads: [],\n\t\twrites: [],\n\t\tisVariableDef: false,\n\t\terror: null,\n\t};\n\n\ttry {\n\t\tconst eng = getCompileEngine();\n\t\tconst { program, reads, writes } = eng.compileExpression(item.expression);\n\t\tconst isVariableDef = writes.length > 0;\n\n\t\tconst opcodes = program.opcodes;\n\t\tconst numbers = program.numbers;\n\n\t\t// Transfer only the exact used slice of the ArrayBuffer. The engine's\n\t\t// buffer pool is write-only, so detaching the source view is fine.\n\t\t//\n\t\t// The casts narrow ArrayBufferLike to ArrayBuffer. A TypedArray's\n\t\t// `buffer` is typed as the union including SharedArrayBuffer, which\n\t\t// TypeScript 6 enforces where 5.1 did not, and the postMessage\n\t\t// transfer list below accepts only ArrayBuffer. The narrowing is\n\t\t// sound here because these buffers come from the engine's own pool,\n\t\t// which allocates plain ArrayBuffers; a SharedArrayBuffer could not\n\t\t// reach this point, and would not be transferable if it did.\n\t\tconst opcodesBuffer = (opcodes.buffer as ArrayBuffer).slice(\n\t\t\topcodes.byteOffset,\n\t\t\topcodes.byteOffset + opcodes.byteLength\n\t\t);\n\t\tconst numbersBuffer = (numbers.buffer as ArrayBuffer).slice(\n\t\t\tnumbers.byteOffset,\n\t\t\tnumbers.byteOffset + numbers.byteLength\n\t\t);\n\n\t\treturn {\n\t\t\t...base,\n\t\t\topcodesBuffer,\n\t\t\tnumbersBuffer,\n\t\t\topcodesLength: opcodes.length,\n\t\t\tnumbersLength: numbers.length,\n\t\t\tstrings: [...program.strings],\n\t\t\treads,\n\t\t\twrites,\n\t\t\tisVariableDef,\n\t\t};\n\t} catch (e) {\n\t\treturn {\n\t\t\t...base,\n\t\t\topcodesBuffer: new ArrayBuffer(0),\n\t\t\tnumbersBuffer: new ArrayBuffer(0),\n\t\t\topcodesLength: 0,\n\t\t\tnumbersLength: 0,\n\t\t\terror: e instanceof Error ? e.message : String(e),\n\t\t};\n\t}\n}\n\nfunction handleCompileBatch(msg: CompileBatchMsg): void {\n\tconst results: CompileResult[] = [];\n\tconst transferList: ArrayBuffer[] = [];\n\n\tfor (const item of msg.items) {\n\t\tconst result = compileOne(item);\n\t\tresults.push(result);\n\t\tif (result.opcodesBuffer.byteLength > 0) transferList.push(result.opcodesBuffer);\n\t\tif (result.numbersBuffer.byteLength > 0) transferList.push(result.numbersBuffer);\n\t}\n\n\t(self as unknown as Worker).postMessage(\n\t\t{ id: msg.id, type: \"COMPILE_RESULT\", results },\n\t\ttransferList\n\t);\n}\n\n// ── Execute ──────────────────────────────────────────────────────────\n\n/**\n * Execute a single bytecode program and produce a serialized ExecuteResult.\n * Reconstructs TypedArrays from the transferred ArrayBuffers (zero-copy).\n * Resets the worker VM before each execution, no state carries over\n * between lines in a batch.\n */\nfunction executeOne(item: ExecuteItem): ExecuteResult {\n\tconst vmm = getExecuteVm();\n\tvmm.reset();\n\n\tconst opcodes = new Uint8Array(item.opcodesBuffer, 0, item.opcodesLength);\n\tconst numbers = new Float64Array(item.numbersBuffer, 0, item.numbersLength);\n\tconst bytecode: Bytecode = { opcodes, numbers, strings: item.strings };\n\n\ttry {\n\t\tconst result = executeBytecode(bytecode, vmm);\n\n\t\tif (result.type === \"pending\") {\n\t\t\treturn {\n\t\t\t\tlineNumber: item.lineNumber,\n\t\t\t\tvalueType: ValueType.Pending,\n\t\t\t\tvalue: 0,\n\t\t\t\tisPending: true,\n\t\t\t\tqueryKey: result.queryKey,\n\t\t\t};\n\t\t}\n\n\t\tif (result.type === \"error\") {\n\t\t\treturn {\n\t\t\t\tlineNumber: item.lineNumber,\n\t\t\t\tvalueType: ValueType.Error,\n\t\t\t\tvalue: 0,\n\t\t\t\tisPending: false,\n\t\t\t\tunit: result.error.message,\n\t\t\t};\n\t\t}\n\n\t\tconst val = result.value;\n\t\treturn {\n\t\t\tlineNumber: item.lineNumber,\n\t\t\tvalueType: val.type,\n\t\t\tvalue: typeof val.value === \"number\"\n\t\t\t\t? val.value\n\t\t\t\t: typeof val.value === \"bigint\"\n\t\t\t\t\t? Number(val.value)\n\t\t\t\t\t: 0,\n\t\t\tunit: val.unit,\n\t\t\tisPending: false,\n\t\t};\n\t} catch {\n\t\t// Execution error, return error-type value so main thread can\n\t\t// propagate through DAG as errorValue.\n\t\treturn {\n\t\t\tlineNumber: item.lineNumber,\n\t\t\tvalueType: ValueType.Error,\n\t\t\tvalue: 0,\n\t\t\tisPending: false,\n\t\t\tunit: \"Worker execution failed\",\n\t\t};\n\t}\n}\n\nfunction handleExecuteBatch(msg: ExecuteBatchMsg): void {\n\tconst results: ExecuteResult[] = [];\n\tfor (const item of msg.items) {\n\t\tresults.push(executeOne(item));\n\t}\n\t// No transferables needed for the response, results are plain\n\t// objects with numbers and strings (structured-cloned).\n\t(self as unknown as Worker).postMessage({\n\t\tid: msg.id,\n\t\ttype: \"EXECUTE_RESULT\",\n\t\tresults,\n\t});\n}\n\n// ── Message handler ───────────────────────────────────────────────────\n\n/**\n * Whether this module is executing inside a real worker global scope.\n *\n * Only `esbuild-plugin-inline-worker` splits this file into a separate worker\n * bundle. Any other bundler, tsup included, treats it as an ordinary module and\n * inlines the whole body into whatever imported it, which means the code below\n * runs on the main thread or in Node rather than in a worker.\n *\n * Without this guard, importing the published package from Node throws\n * `self is not defined` before a single expression can be evaluated. The check\n * distinguishes the three environments: Node defines neither `self` nor\n * `window`, a browser main thread defines both, and a worker defines only\n * `self`.\n */\nconst inWorkerScope = typeof self !== \"undefined\" && typeof window === \"undefined\";\n\nconst handleMessage = (event: MessageEvent) => {\n\t// A real postMessage always carries a browser-populated origin the\n\t// sender cannot spoof, so this only ever rejects a genuine mismatch. It\n\t// is skipped, not enforced, when either side is unset, which covers the\n\t// test harness driving this handler directly with a plain object and\n\t// no location global (see WorkerIntegration.spec.ts), without opening\n\t// anything a real message could exploit.\n\tif (event.origin && self.location && event.origin !== self.location.origin) return;\n\n\tconst msg = event.data as EngineWorkerMessage;\n\n\tswitch (msg.type) {\n\t\tcase \"COMPILE_BATCH\":\n\t\t\thandleCompileBatch(msg);\n\t\t\tbreak;\n\n\t\tcase \"EXECUTE_BATCH\":\n\t\t\thandleExecuteBatch(msg);\n\t\t\tbreak;\n\n\t\tcase \"TERMINATE\": {\n\t\t\t// Not sent by either production manager today, both call the\n\t\t\t// native Worker.terminate() directly instead. Kept for protocol\n\t\t\t// completeness and future consumers. Clears whichever per-role\n\t\t\t// state this instance happened to create.\n\t\t\tif (compileEngine) {\n\t\t\t\tcompileEngine.clear();\n\t\t\t\tcompileEngine = null;\n\t\t\t}\n\t\t\tif (executeVm) {\n\t\t\t\texecuteVm.reset();\n\t\t\t\texecuteVm = null;\n\t\t\t}\n\t\t\t(self as unknown as Worker).postMessage({\n\t\t\t\tid: msg.id,\n\t\t\t\ttype: \"COMPILE_RESULT\",\n\t\t\t\tresults: [],\n\t\t\t});\n\t\t\tbreak;\n\t\t}\n\n\t\tdefault: {\n\t\t\t(self as unknown as Worker).postMessage({\n\t\t\t\tid: -1,\n\t\t\t\ttype: \"COMPILE_RESULT\",\n\t\t\t\tresults: [],\n\t\t\t\terror: `Unknown message type: ${(msg as { type?: string }).type}`,\n\t\t\t});\n\t\t}\n\t}\n};\n\n// Installed only when genuinely running as a worker. Everywhere else this\n// module has been inlined into a host bundle, where binding a handler would at\n// best be inert and at worst intercept the host's own messages.\nif (inWorkerScope) {\n\tself.onmessage = handleMessage;\n}\n","/**\n * ExecutionPool, manages a pool of execution workers for offloading\n * VM bytecode re-execution when AsyncResolutionBatcher.flush() has >50\n * affected lines.\n *\n * Workers are created lazily (on first dispatch). Each worker runs\n * executeBytecode() with its own isolated VM, no shared state between\n * worker and main thread, no scope leakage.\n *\n * Design decisions:\n * - Pool size: Math.min(navigator.hardwareConcurrency ?? 4, 4). Capped at\n * 4 to avoid excessive thread creation on high-core machines.\n * - Round-robin dispatch distributes batches evenly across workers.\n * - Workers are terminated on pool.clear() (engine clear) and recreated\n * lazily on next dispatch.\n * - Falls back to synchronous main-thread execution when Worker is\n * unavailable (Node.js, SSR, testing without jsdom worker support).\n *\n * Transferable protocol (shares engine.worker.ts with CompilationWorkerManager):\n * - Main thread clones bytecode ArrayBuffers via .slice() per entry\n * - Transfers cloned buffers to worker (zero-copy, detached on main side)\n * - Worker receives buffers, reconstructs TypedArrays, executes, returns\n * serialized results (plain objects with numbers/strings)\n *\n * Message protocol:\n * Pool → Worker: { type: \"EXECUTE_BATCH\", id, items: ExecuteItem[] }\n * Worker → Pool: { id, type: \"EXECUTE_RESULT\", results: ExecuteResult[] }\n */\n\nimport type { LineCacheEntry } from \"@solve-js/cache/LineCache\";\nimport { ValueType } from \"@solve-js/vm/Value\";\nimport { numberValue, uomValue, hexValue, bigIntValue, stringValue, boolValue, datetimeValue, percentageValue, errorValue, pendingValue } from \"@solve-js/vm/Value\";\nimport type { Value } from \"@solve-js/vm/Value\";\n\n/** Timeout for worker batch execution (30s). If exceeded, returns empty results. */\nconst WORKER_BATCH_TIMEOUT_MS = 30_000;\n\n// ── Static import of the inline worker factory ────────────────────────────\n// esbuild-plugin-inline-worker transforms this into a function that\n// returns Worker (using blob URL or equivalent). At build time it's a\n// factory; at dev time it throws.\nimport createExecutionWorker from \"@solve-js/workers/engine.worker\";\n\n// ── Worker message types (mirrors the EXECUTE_* shapes in engine.worker.ts) ──\n\ninterface ExecuteItem {\n\tlineNumber: number;\n\topcodesBuffer: ArrayBuffer;\n\tnumbersBuffer: ArrayBuffer;\n\topcodesLength: number;\n\tnumbersLength: number;\n\tstrings: string[];\n}\n\ninterface ExecuteResult {\n\tlineNumber: number;\n\tvalueType: ValueType;\n\tvalue: number;\n\tunit?: string;\n\tisPending: boolean;\n\tqueryKey?: string;\n}\n\n// ── Batch tracking ────────────────────────────────────────────────────────\n\ninterface PendingBatch {\n\t/** Correlation ID sent to the worker. */\n\tid: number;\n\t/** Line numbers in this batch (in order). Used for result correlation. */\n\tlineNumbers: number[];\n\t/** Resolve when results arrive. */\n\tresolve: (results: ExecuteResult[]) => void;\n}\n\n/** Number of affected lines before we offload to worker pool. */\nexport const WORKER_OFFLOAD_THRESHOLD = 50;\n\n// ── Pool ──────────────────────────────────────────────────────────────────\n\n/**\n * Runs bytecode on background workers instead of the main thread.\n *\n * Used for scroll-driven batches, where evaluating a screenful of lines on the\n * main thread would drop frames. Degrades to the main thread when workers are\n * unavailable, which is the normal case in Node and in any bundle not built\n * with esbuild-plugin-inline-worker. See {@link ExecutionPool.isAvailable}.\n */\nexport class ExecutionPool {\n\tprivate workers: Worker[] = [];\n\tprivate nextWorker = 0;\n\tprivate nextId = 1;\n\tprivate pendingBatches = new Map<number, PendingBatch>();\n\tprivate terminated = false;\n\tprivate poolSize: number;\n\n\tconstructor(poolSize?: number) {\n\t\tthis.poolSize = Math.min(poolSize ?? this.defaultPoolSize(), 4);\n\t}\n\n\tprivate defaultPoolSize(): number {\n\t\tif (typeof navigator !== \"undefined\" && navigator.hardwareConcurrency) {\n\t\t\treturn Math.min(navigator.hardwareConcurrency, 4);\n\t\t}\n\t\treturn 2;\n\t}\n\n\t// ── Public API ────────────────────────────────────────────────────────\n\n\t/** Cached availability flag. Checked once; createExecutionWorker never called again. */\n\tprivate _available: boolean | null = null;\n\n\t/**\n\t * Whether worker-based execution is available.\n\t * Returns false in Node.js / jsdom test environments where Worker\n\t * may be polyfilled but execution workers aren't functional.\n\t */\n\tisAvailable(): boolean {\n\t\tif (this.terminated) return false;\n\t\tif (this._available !== null) return this._available;\n\t\tif (typeof Worker === \"undefined\") {\n\t\t\tthis._available = false;\n\t\t\treturn false;\n\t\t}\n\t\ttry {\n\t\t\t// Create a test worker, then immediately terminate it.\n\t\t\tconst w = createExecutionWorker();\n\t\t\tw.terminate();\n\t\t\tthis._available = true;\n\t\t\treturn true;\n\t\t} catch {\n\t\t\tthis._available = false;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/**\n\t * Execute a batch of line entries via the worker pool.\n\t *\n\t * Takes ordered line numbers and their LineCache entries. Clones bytecode\n\t * ArrayBuffers for transfer, dispatches to workers round-robin, and\n\t * returns the serialized results (with 30s timeout fallback).\n\t *\n\t * Falls back to undefined when workers are unavailable, caller should\n\t * use the main-thread path.\n\t *\n\t * @returns ExecuteResult[] on success, undefined if workers unavailable.\n\t */\n\texecuteBatch(\n\t\torderedLineNumbers: number[],\n\t\tentries: Map<number, LineCacheEntry | undefined>,\n\t): Promise<ExecuteResult[]> | undefined {\n\t\tif (!this.isAvailable()) return undefined;\n\t\tif (orderedLineNumbers.length === 0) return Promise.resolve([]);\n\n\t\t// Lazy-initialize workers\n\t\tthis.ensureWorkers();\n\n\t\t// Clone bytecode buffers for transfer. Each worker needs its own\n\t\t// copy because transfer detaches the ArrayBuffer on the sender side.\n\t\tconst items: ExecuteItem[] = [];\n\t\tfor (const lineNumber of orderedLineNumbers) {\n\t\t\tconst entry = entries.get(lineNumber);\n\t\t\tif (!entry || entry.bytecode.opcodes.length === 0) continue;\n\n\t\t\tconst opcodes = entry.bytecode.opcodes;\n\t\t\tconst numbers = entry.bytecode.numbers;\n\n\t\t\t// Clone the exact used slice of each ArrayBuffer for transfer.\n\t\t\t// After transfer, the clone is detached on the main thread\n\t\t\t// the original LineCache entry's buffers are untouched.\n\t\t\tconst opcodesClone = opcodes.buffer.slice(\n\t\t\t\topcodes.byteOffset,\n\t\t\t\topcodes.byteOffset + opcodes.byteLength,\n\t\t\t) as ArrayBuffer;\n\t\t\tconst numbersClone = numbers.buffer.slice(\n\t\t\t\tnumbers.byteOffset,\n\t\t\t\tnumbers.byteOffset + numbers.byteLength,\n\t\t\t) as ArrayBuffer;\n\n\t\t\titems.push({\n\t\t\t\tlineNumber,\n\t\t\t\topcodesBuffer: opcodesClone,\n\t\t\t\tnumbersBuffer: numbersClone,\n\t\t\t\topcodesLength: opcodes.length,\n\t\t\t\tnumbersLength: numbers.length,\n\t\t\t\tstrings: [...entry.bytecode.strings],\n\t\t\t});\n\t\t}\n\n\t\tif (items.length === 0) return Promise.resolve([]);\n\n\t\t// Collect transferable ArrayBuffers for zero-copy postMessage.\n\t\tconst transferList: ArrayBuffer[] = [];\n\t\tfor (const item of items) {\n\t\t\tif (item.opcodesBuffer.byteLength > 0) transferList.push(item.opcodesBuffer);\n\t\t\tif (item.numbersBuffer.byteLength > 0) transferList.push(item.numbersBuffer);\n\t\t}\n\n\t\tconst batchId = this.nextId++;\n\t\tconst worker = this.getNextWorker();\n\n\t\treturn new Promise<ExecuteResult[]>((resolve) => {\n\t\t\t// Timeout guard: if worker hangs (infinite bytecode loop despite\n\t\t\t// VM instruction limit), resolve with empty results after 30s.\n\t\t\tconst timeoutId = setTimeout(() => {\n\t\t\t\tthis.pendingBatches.delete(batchId);\n\t\t\t\tresolve([]);\n\t\t\t}, WORKER_BATCH_TIMEOUT_MS);\n\n\t\t\tthis.pendingBatches.set(batchId, {\n\t\t\t\tid: batchId,\n\t\t\t\tlineNumbers: orderedLineNumbers,\n\t\t\t\tresolve: (results: ExecuteResult[]) => {\n\t\t\t\t\tclearTimeout(timeoutId);\n\t\t\t\t\tresolve(results);\n\t\t\t\t},\n\t\t\t});\n\n\t\t\tworker.postMessage(\n\t\t\t\t{ type: \"EXECUTE_BATCH\", id: batchId, items },\n\t\t\t\ttransferList,\n\t\t\t);\n\t\t});\n\t}\n\n\t/**\n\t * Clean up all workers and pending batches. Called on engine clear.\n\t * Workers are recreated lazily on next dispatch.\n\t */\n\tclear(): void {\n\t\t// Reject all pending batches\n\t\tfor (const [, batch] of this.pendingBatches) {\n\t\t\tbatch.resolve([]);\n\t\t}\n\t\tthis.pendingBatches.clear();\n\n\t\t// Terminate all workers\n\t\tfor (const w of this.workers) {\n\t\t\tw.terminate();\n\t\t}\n\t\tthis.workers = [];\n\t\tthis.nextWorker = 0;\n\t}\n\n\t/**\n\t * Full teardown. After destroy(), the pool is permanently unusable.\n\t */\n\tdestroy(): void {\n\t\tthis.terminated = true;\n\t\tthis.clear();\n\t}\n\n\t// ── Private ────────────────────────────────────────────────────────────\n\n\tprivate ensureWorkers(): void {\n\t\tif (this.workers.length > 0) return;\n\n\t\tfor (let i = 0; i < this.poolSize; i++) {\n\t\t\tconst worker = createExecutionWorker();\n\t\t\tworker.onmessage = (event: MessageEvent) => {\n\t\t\t\tthis.handleWorkerMessage(event.data);\n\t\t\t};\n\t\t\tworker.onerror = (err: ErrorEvent) => {\n\t\t\t\tconsole.error(`[ExecutionPool] Worker ${i} error:`, err.message);\n\t\t\t\t// Resolve ALL pending batches with empty results so callers\n\t\t\t\t// don't hang. Any in-flight execution results are lost, but\n\t\t\t\t// the batcher will re-evaluate on next resolution.\n\t\t\t\tfor (const [id, batch] of this.pendingBatches) {\n\t\t\t\t\tbatch.resolve([]);\n\t\t\t\t\tthis.pendingBatches.delete(id);\n\t\t\t\t}\n\t\t\t};\n\t\t\tthis.workers.push(worker);\n\t\t}\n\t}\n\n\tprivate getNextWorker(): Worker {\n\t\tconst w = this.workers[this.nextWorker];\n\t\tthis.nextWorker = (this.nextWorker + 1) % this.workers.length;\n\t\treturn w;\n\t}\n\n\tprivate handleWorkerMessage(data: { id: number; type: string; results: ExecuteResult[] }): void {\n\t\tif (data.type !== \"EXECUTE_RESULT\") return;\n\n\t\tconst batch = this.pendingBatches.get(data.id);\n\t\tif (!batch) return;\n\n\t\tthis.pendingBatches.delete(data.id);\n\t\tbatch.resolve(data.results);\n\t}\n}\n\n// ── Value reconstruction helpers ──────────────────────────────────────────\n\n/**\n * Reconstruct a Value object from a serialized ExecuteResult.\n *\n * Called on the main thread after worker execution completes.\n * Maps ValueType → appropriate constructor function.\n */\nexport function reconstructValue(result: ExecuteResult): Value {\n\tswitch (result.valueType) {\n\t\tcase ValueType.Number:\n\t\t\treturn numberValue(result.value);\n\t\tcase ValueType.Hex:\n\t\t\treturn hexValue(result.value);\n\t\tcase ValueType.BigInt:\n\t\t\treturn bigIntValue(BigInt(result.value));\n\t\tcase ValueType.String:\n\t\t\treturn stringValue(String(result.value));\n\t\tcase ValueType.Datetime:\n\t\t\treturn datetimeValue(result.value);\n\t\tcase ValueType.Percentage:\n\t\t\treturn percentageValue(result.value);\n\t\tcase ValueType.Uom:\n\t\t\treturn uomValue(result.value, result.unit ?? \"\");\n\t\tcase ValueType.Matrix:\n\t\t\t// Pre-existing simplification carried over from the old Array\n\t\t\t// type: the worker-pool's {valueType, value, unit} serialization\n\t\t\t// has no slot for MatrixData's rows/cols/data shape, so a Matrix\n\t\t\t// result degrades to a plain number here rather than round-\n\t\t\t// tripping intact. Not fixed as part of Matrix support. This\n\t\t\t// gap already existed for vectors before this rename.\n\t\t\treturn numberValue(result.value);\n\t\tcase ValueType.Boolean:\n\t\t\treturn boolValue(result.value !== 0);\n\t\tcase ValueType.Pending:\n\t\t\treturn pendingValue(result.queryKey ?? \"\");\n\t\tcase ValueType.Error:\n\t\t\treturn errorValue(\"WORKER_EXECUTION_ERROR\", result.unit ?? \"Unknown worker error\");\n\t\tdefault:\n\t\t\treturn numberValue(result.value);\n\t}\n}\n","import type { DependencyGraph } from \"@solve-js/vm/DependencyGraph\";\nimport type { LineCache, LineCacheEntry } from \"@solve-js/cache/LineCache\";\nimport { type Value, errorValue } from \"@solve-js/vm/Value\";\nimport { executeBytecode } from \"@solve-js/vm/VM\";\nimport type { VM } from \"@solve-js/vm/OpRegistry\";\nimport { normalizeUnknownError } from \"@solve-js/errors/EngineError\";\nimport {\n\tExecutionPool,\n\tWORKER_OFFLOAD_THRESHOLD,\n\treconstructValue,\n} from \"@solve-js/engine/ExecutionPool\";\n\n// ── Event types ────────────────────────────────────────────────────────\n\n/** Emitted when one or more lines have updated results after async resolution. */\nexport interface LinesUpdatedEvent {\n\ttype: \"lines-updated\";\n\t/** Line numbers whose results changed (1-based). */\n\tlineNumbers: number[];\n\t/** The query keys whose resolution triggered this update. */\n\taffectedQueryKeys: string[];\n}\n\n/** Emitted when an async resolution fails with an error. */\nexport interface AsyncErrorEvent {\n\ttype: \"error\";\n\t/** The query key that failed. */\n\tqueryKey: string;\n\t/** The package whose resolver failed. */\n\tpackageId: string;\n\t/** The error that caused the failure. */\n\terror: Error;\n}\n\n/** Something an async resolution produced: updated lines, or a failure. */\nexport type AsyncResolutionEvent = LinesUpdatedEvent | AsyncErrorEvent;\n\n// ── Internal batch entry ───────────────────────────────────────────────\n\ninterface BatchEntry {\n\t/** The query key that just resolved (or errored). */\n\tqueryKey: string;\n\t/** The package that owns this data. */\n\tpackageId: string;\n\t/** AbortSignal for staleness detection. */\n\tsignal: AbortSignal;\n\t/** Whether this was an error resolution. */\n\tisError: boolean;\n\t/** Error if isError. */\n\terror?: Error;\n}\n\n// ── Batcher ────────────────────────────────────────────────────────────\n\n/**\n * Micro-batches async resolution completions into a single DAG walk + re-evaluation pass.\n *\n * When multiple promises resolve within the same event-loop tick (e.g., 3 currency\n * rates: USD→GBP, USD→EUR, USD→JPY all return within 2ms), this batcher collapses\n * them into ONE DAG walk and ONE re-execution pass instead of 3 separate ones.\n *\n * Lifecycle:\n * - Engine calls `add()` after each `resolveAsync()` completes\n * - `queueMicrotask()` schedules `flush()` for the end of the current tick\n * - `flush()` deduplicates queryKeys, walks DAG once for all resolved keys,\n * topologically sorts affected lines, re-executes, and fires listener events\n *\n * Perf: For N resolutions in a tick, reduces DAG walks from N to 1 and\n * re-executions from N*avgAffected to totalAffected.\n *\n * ## Streaming Architecture\n *\t * Events are published to a native {@link ReadableStream}. Stream-based\n\t * consumers read from the stream via `getReader()`, gaining built-in\n\t * cancellation (`reader.cancel()`), proper resource cleanup\n\t * (`reader.releaseLock()`), and the ability to\n\t * `pipeTo()` / `pipeThrough()` / `tee()` the event flow.\n *\n * The stream uses a configurable {@link CountQueuingStrategy} with a default\n * `highWaterMark` of 64 events to limit the internal buffer size.\n */\nexport class AsyncResolutionBatcher {\n\tprivate pending: BatchEntry[] = [];\n\tprivate scheduled = false;\n\t/** Set to true by clearPending(), flush() checks this to abort stale work. */\n\tprivate cleared = false;\n\n\tprivate dag: DependencyGraph;\n\tprivate lineCache: LineCache;\n\tprivate vm: VM;\n\n\t/**\n\t * Worker pool for offloading VM re-execution when the affected line\n\t * count exceeds WORKER_OFFLOAD_THRESHOLD (50). Lazily created on\n\t * first dispatch; cleared on clearAll().\n\t */\n\tprivate executionPool: ExecutionPool | null = null;\n\n\t/**\n\t * Number of flushes actually dispatched to the worker pool (as opposed\n\t * to falling back to the main thread because Worker is unavailable).\n\t * Exposed via {@link workerOffloadCount} for the Workers diagnostic tab.\n\t */\n\tprivate workerOffloadDispatchCount = 0;\n\n\t// ── Web Streams API integration ──────────────────────────────────\n\n\t/**\n\t * Default high-water mark for the internal event stream.\n\t * Limits the internal buffer size before the stream signals to\n\t * consumers that they need to catch up.\n\t */\n\tprivate static readonly DEFAULT_HIGH_WATER_MARK = 64;\n\n\t/**\n\t * Internal {@link ReadableStream} for async resolution events.\n\t * All events (lines-updated and error) are enqueued here.\n\t */\n\tprivate _eventStream: ReadableStream<AsyncResolutionEvent>;\n\n\t/**\n\t * Controller for the internal event stream. Set during stream\n\t * initialization; cleared on stream cancellation or clearAll().\n\t */\n\tprivate _streamController: ReadableStreamDefaultController<AsyncResolutionEvent> | null = null;\n\n\t/**\n\t * Test-only synchronous capture array. When enabled (non-null), every\n\t * event is synchronously pushed here in addition to the stream.\n\t * Tests read from this array to avoid async stream reader timing issues.\n\t */\n\tpublic _testCaptures: AsyncResolutionEvent[] | null = null;\n\n\t/**\n\t * Called for each line whose result is patched after an async resolution,\n\t * on both the main-thread and worker-pool paths.\n\t *\n\t * **A host that displays async results must set this.** It is the only\n\t * mechanism that moves a resolved value out of the LineCache and into the\n\t * host's own document state. The engine cannot do it itself: it does not own\n\t * a document, the host does, and the batcher has no reference to one.\n\t *\n\t * Nullable rather than a constructor parameter because it is cleared by\n\t * `clearAll()` and re-wired on re-subscribe, so it cannot be readonly. That\n\t * makes it easy to miss, which is why {@link warnIfUnwired} exists: leaving\n\t * it unset means async values resolve into the cache and are never shown,\n\t * with nothing to indicate why. A host that genuinely does not want async\n\t * results should not register async resolvers at all.\n\t */\n\tonLineResult: ((lineNumber: number, value: Value) => void) | null = null;\n\n\t/**\n\t * Whether {@link warnIfUnwired} has already fired.\n\t *\n\t * Once per instance, not once per resolution. A document with fifty live\n\t * data lines would otherwise produce fifty identical warnings on the first\n\t * fetch, which is how a useful warning becomes noise people filter out.\n\t */\n\tprivate warnedAboutMissingHook = false;\n\n\t/**\n\t * Warn once if an async result resolved with no {@link onLineResult} wired.\n\t *\n\t * The failure this catches is silent by nature: the value arrives, the cache\n\t * updates, and the line keeps showing pending forever. Without this a host\n\t * author has no thread to pull on.\n\t */\n\tprivate warnIfUnwired(): void {\n\t\tif (this.onLineResult || this.warnedAboutMissingHook) return;\n\t\tthis.warnedAboutMissingHook = true;\n\t\tconsole.warn(\n\t\t\t\"[solve-engine] An async result resolved but AsyncResolutionBatcher.onLineResult \" +\n\t\t\t\"is not set, so the value cannot reach your document and the line will keep \" +\n\t\t\t\"showing as pending. Set it to mirror resolved values into your own state. \" +\n\t\t\t\"This warning appears once per batcher.\",\n\t\t);\n\t}\n\n\t/** High-water mark used when (re)creating the event stream. */\n\tprivate readonly highWaterMark: number;\n\n\tconstructor(\n\t\tdag: DependencyGraph,\n\t\tlineCache: LineCache,\n\t\tvm: VM,\n\t\thighWaterMark: number = AsyncResolutionBatcher.DEFAULT_HIGH_WATER_MARK,\n\t) {\n\t\tthis.dag = dag;\n\t\tthis.lineCache = lineCache;\n\t\tthis.vm = vm;\n\t\tthis.highWaterMark = highWaterMark;\n\n\t\tthis._eventStream = this.createEventStream();\n\t}\n\n\t/**\n\t * Create a fresh internal event stream and wire its controller.\n\t * Called from the constructor and again from clearAll() so the batcher\n\t * keeps emitting events after an engine clear, the engine instance\n\t * (and this batcher) live on across clear() calls.\n\t */\n\tprivate createEventStream(): ReadableStream<AsyncResolutionEvent> {\n\t\treturn new ReadableStream<AsyncResolutionEvent>({\n\t\t\tstart: (controller) => {\n\t\t\t\tthis._streamController = controller;\n\t\t\t},\n\t\t\tcancel: () => {\n\t\t\t\tthis._streamController = null;\n\t\t\t},\n\t\t}, new CountQueuingStrategy({ highWaterMark: this.highWaterMark }));\n\t}\n\n\t// ── Public API ────────────────────────────────────────────────────\n\n\t/**\n\t * Add a resolved query key to the pending batch.\n\t *\n\t * Called by ExpressionEngine.resolveAsync() after a promise resolves or errors.\n\t * If this is the first entry in the current tick, schedules a microtask flush.\n\t */\n\tadd(entry: BatchEntry): void {\n\t\t// Re-arm after engine clear (clearAll sets cleared=true).\n\t\tthis.cleared = false;\n\n\t\t// Deduplicate: if the same (packageId:queryKey) is already in the batch, skip.\n\t\t// This handles the case where the same data source is resolved multiple times\n\t\t// (e.g., fetch → error → retry) within the same tick.\n\t\tfor (const existing of this.pending) {\n\t\t\tif (existing.packageId === entry.packageId && existing.queryKey === entry.queryKey) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tthis.pending.push(entry);\n\n\t\tif (!this.scheduled) {\n\t\t\tthis.scheduled = true;\n\t\t\t// Hard backstop, deliberately redundant with reExecuteMainThread()'s\n\t\t\t// own per-line try/catch: this runs inside a bare queueMicrotask\n\t\t\t// callback, which has no caller able to catch anything that escapes\n\t\t\t// it, an uncaught throw here becomes an uncaughtException that can\n\t\t\t// crash the host process. flush() is expected to never throw past\n\t\t\t// its own internal per-line containment, but \"expected to never\" is\n\t\t\t// exactly the assumption that was silently wrong before this pass\n\t\t\t// (see reExecuteMainThread()'s doc comment). This exists so a\n\t\t\t// FUTURE regression in flush()'s own control flow (topologicalSort(),\n\t\t\t// the DAG walk, an error-listener notification) degrades to a\n\t\t\t// logged, contained failure instead of a repeat of that bug.\n\t\t\tqueueMicrotask(() => {\n\t\t\t\ttry {\n\t\t\t\t\tthis.flush();\n\t\t\t\t} catch (e) {\n\t\t\t\t\tconst engineError = normalizeUnknownError(e);\n\t\t\t\t\tconsole.error(`[AsyncResolutionBatcher] flush() failed unexpectedly — this should never happen; please report: ${engineError.format()}`);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\n\t/**\n\t * Get the native event stream for stream-based consumers.\n\t *\n\t * Use this for backpressure, cancellation, or the ability\n\t * to `pipeTo()` / `pipeThrough()` the event flow.\n\t *\n\t * @returns A {@link ReadableStream} that emits {@link AsyncResolutionEvent}\n\t * items as the batcher processes async resolutions.\n\t */\n\tgetEventStream(): ReadableStream<AsyncResolutionEvent> {\n\t\treturn this._eventStream;\n\t}\n\n\t/** Number of resolutions currently queued for the next flush. */\n\tget pendingCount(): number {\n\t\treturn this.pending.length;\n\t}\n\n\t/** Number of pending entries collapsed by (packageId, queryKey) deduplication. */\n\tget dedupCount(): number {\n\t\tconst dedup = new Set<string>();\n\t\tfor (const entry of this.pending) {\n\t\t\tdedup.add(`${entry.packageId}:${entry.queryKey}`);\n\t\t}\n\t\treturn Math.max(0, this.pending.length - dedup.size);\n\t}\n\n\t/**\n\t * Whether the internal event stream currently has an active reader.\n\t * `1` if a consumer has called `getEventStream().getReader()` (or\n\t * otherwise locked the stream) and not released it, `0` otherwise.\n\t */\n\tget listenerCount(): number {\n\t\treturn this._eventStream.locked ? 1 : 0;\n\t}\n\n\t/** Number of flushes that were actually dispatched to the worker pool. */\n\tget workerOffloadCount(): number {\n\t\treturn this.workerOffloadDispatchCount;\n\t}\n\n\t/** Remove all listeners and cancel pending batch. Called on engine clear. */\n\tclearAll(): void {\n\t\tthis.pending = [];\n\t\tthis.scheduled = false;\n\t\tthis.cleared = true;\n\n\t\t// Clear test capture to match stream-close semantics, after\n\t\t// clearAll(), no further events reach old subscribers.\n\t\tthis._testCaptures = null;\n\t\tthis.onLineResult = null;\n\n\t\t// Close the old stream gracefully so existing consumers get a clean\n\t\t// done signal, then create a fresh stream. The engine instance (and\n\t\t// this batcher) survive clear(), so getEventStream() must keep\n\t\t// returning a live stream for new subscribers.\n\t\ttry {\n\t\t\tthis._streamController?.close();\n\t\t} catch {\n\t\t\t// Controller may already be closed or errored.\n\t\t}\n\t\tthis._streamController = null;\n\t\tthis._eventStream = this.createEventStream();\n\n\t\tif (this.executionPool) {\n\t\t\tthis.executionPool.clear();\n\t\t\tthis.executionPool = null;\n\t\t}\n\n\t\tthis.workerOffloadDispatchCount = 0;\n\t}\n\n\t// ── Private: flush ────────────────────────────────────────────────\n\n\t/**\n\t * Flush all pending resolutions in a single batched pass.\n\t *\n\t * Called automatically via queueMicrotask. Never called directly.\n\t */\n\tprivate flush(): void {\n\t\tthis.scheduled = false;\n\t\tif (this.cleared) return; // Engine was cleared — abort stale flush\n\t\tif (this.pending.length === 0) return;\n\n\t\t// Take ownership of the pending array (swap with empty).\n\t\tconst batch = this.pending;\n\t\tthis.pending = [];\n\n\t\t// Deduplicate by (packageId, queryKey), keep last entry per key.\n\t\tconst deduped = new Map<string, BatchEntry>();\n\t\tfor (const entry of batch) {\n\t\t\tconst compositeKey = `${entry.packageId}:${entry.queryKey}`;\n\t\t\tdeduped.set(compositeKey, entry);\n\t\t}\n\n\t\t// Step 1: Separate errors from successes, but re-evaluate for BOTH.\n\t\t// Error entries must also trigger DAG re-evaluation so downstream\n\t\t// lines can pick up the Error Value from AsyncResultCache.\n\t\tconst errorEntries: BatchEntry[] = [];\n\t\tconst okEntries: BatchEntry[] = [];\n\t\tfor (const entry of deduped.values()) {\n\t\t\tif (entry.isError) {\n\t\t\t\terrorEntries.push(entry);\n\t\t\t} else {\n\t\t\t\tokEntries.push(entry);\n\t\t\t}\n\t\t}\n\n\t\t// Notify error listeners first (before re-evaluation).\n\t\tfor (const entry of errorEntries) {\n\t\t\tif (entry.signal.aborted) continue;\n\t\t\tthis.notifyListeners({\n\t\t\t\ttype: \"error\",\n\t\t\t\tqueryKey: entry.queryKey,\n\t\t\t\tpackageId: entry.packageId,\n\t\t\t\terror: entry.error ?? new Error(\"Unknown async resolution error\"),\n\t\t\t});\n\t\t}\n\n\t\t// Step 2: Single DAG walk, collect ALL affected lines from ALL resolved\n\t\t// queryKeys (both success AND error). Errors also need re-evaluation so\n\t\t// downstream lines can receive errorValue() results.\n\t\tconst allAffected = new Set<number>();\n\t\tconst allQueryKeys: string[] = [];\n\n\t\tconst allEntries = [...okEntries, ...errorEntries];\n\t\tfor (const entry of allEntries) {\n\t\t\tif (entry.signal.aborted) continue;\n\t\t\tallQueryKeys.push(entry.queryKey);\n\n\t\t\tconst affected = this.dag.getAffectedLinesByDataSource(\n\t\t\t\tentry.packageId,\n\t\t\t\t[entry.queryKey],\n\t\t\t);\n\t\t\tfor (const line of affected) {\n\t\t\t\tallAffected.add(line);\n\t\t\t}\n\t\t}\n\n\t\tif (allAffected.size === 0) {\n\t\t\t// No lines affected, still notify listeners so UI can update\n\t\t\t// (e.g., clear loading indicators).\n\t\t\tthis.notifyListeners({\n\t\t\t\ttype: \"lines-updated\",\n\t\t\t\tlineNumbers: [],\n\t\t\t\taffectedQueryKeys: allQueryKeys,\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\t// Step 3: Topological sort affected lines.\n\t\t// We need to re-evaluate in dependency order so that variable producers\n\t\t// execute before their consumers. We use getAffectedLinesInOrder() but\n\t\t// that requires a starting variable. Instead, we do our own Kahn's algo\n\t\t// on the subgraph of affected lines.\n\t\tconst ordered = this.topologicalSort(Array.from(allAffected));\n\n\t\t// Step 4: Re-execute all affected lines.\n\t\t// For ≤50 lines: main-thread synchronous loop (fast, no worker overhead).\n\t\t// For >50 lines: offload to worker pool to avoid UI freeze.\n\t\tif (ordered.length > WORKER_OFFLOAD_THRESHOLD) {\n\t\t\t// Build a Map for fast entry lookup in the worker dispatch path.\n\t\t\tconst entryMap = new Map<number, ReturnType<LineCache[\"getEntryForLine\"]>>();\n\t\t\tfor (const lineNumber of ordered) {\n\t\t\t\tentryMap.set(lineNumber, this.lineCache.getEntryForLine(lineNumber));\n\t\t\t}\n\t\t\t// .catch() is required, not optional: reExecuteViaWorkerPool() is an\n\t\t\t// async method dispatched with `void` (fire-and-forget), without a\n\t\t\t// handler here, a rejection (a worker crash, `executionPool.executeBatch`\n\t\t\t// throwing) becomes an unhandled promise rejection, the async\n\t\t\t// equivalent of the uncaught-exception risk `add()`'s queueMicrotask\n\t\t\t// backstop guards against for the synchronous path.\n\t\t\tvoid this.reExecuteViaWorkerPool(ordered, entryMap, allQueryKeys).catch((e) => {\n\t\t\t\tconst engineError = normalizeUnknownError(e);\n\t\t\t\tconsole.error(`[AsyncResolutionBatcher] reExecuteViaWorkerPool() failed unexpectedly: ${engineError.format()}`);\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\tthis.reExecuteMainThread(ordered, allQueryKeys);\n\t}\n\n\t// ── Private: topological sort ─────────────────────────────────────\n\n\t/**\n\t * Topologically sort affected lines using Kahn's algorithm.\n\t *\n\t * Lines that produce variables come before lines that consume them.\n\t * This ensures correct evaluation order when multiple interdependent\n\t * lines are affected by async resolution.\n\t */\n\tprivate topologicalSort(lines: number[]): number[] {\n\t\tif (lines.length <= 1) return lines;\n\n\t\t// Build in-degree map and producer lookup.\n\t\tconst inDegree = new Map<number, number>();\n\t\tconst adjacency = new Map<number, number[]>();\n\n\t\t// Variable → producing line number (within affected set).\n\t\tconst producerOf = new Map<string, number>();\n\n\t\tfor (const line of lines) {\n\t\t\tinDegree.set(line, 0);\n\t\t\tadjacency.set(line, []);\n\t\t}\n\n\t\t// First pass: identify which variables are produced by which affected lines.\n\t\tfor (const line of lines) {\n\t\t\tconst writes = this.dag.getWrites(line);\n\t\t\tfor (const w of writes) {\n\t\t\t\tproducerOf.set(w, line);\n\t\t\t}\n\t\t}\n\n\t\t// Second pass: build edges from producer → consumer.\n\t\tfor (const line of lines) {\n\t\t\tconst reads = this.dag.getDependencies(line);\n\t\t\tfor (const readVar of reads) {\n\t\t\t\tconst producer = producerOf.get(readVar);\n\t\t\t\tif (producer !== undefined && producer !== line) {\n\t\t\t\t\tadjacency.get(producer)!.push(line);\n\t\t\t\t\tinDegree.set(line, (inDegree.get(line) ?? 0) + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Kahn's algorithm.\n\t\tconst queue: number[] = [];\n\t\tfor (const [line, degree] of inDegree) {\n\t\t\tif (degree === 0) queue.push(line);\n\t\t}\n\n\t\t// Fallback: if all lines have dependencies (cycles), sort by line number.\n\t\tif (queue.length === 0 && lines.length > 0) {\n\t\t\treturn [...lines].sort((a, b) => a - b);\n\t\t}\n\n\t\tconst ordered: number[] = [];\n\t\twhile (queue.length > 0) {\n\t\t\tconst current = queue.shift()!;\n\t\t\tordered.push(current);\n\n\t\t\tfor (const downstream of adjacency.get(current) ?? []) {\n\t\t\t\tconst newDegree = (inDegree.get(downstream) ?? 1) - 1;\n\t\t\t\tinDegree.set(downstream, newDegree);\n\t\t\t\tif (newDegree === 0) queue.push(downstream);\n\t\t\t}\n\t\t}\n\n\t\t// Append unresolvable lines (cycles).\n\t\tif (ordered.length < lines.length) {\n\t\t\tconst remaining = lines\n\t\t\t\t.filter((l) => !ordered.includes(l))\n\t\t\t\t.sort((a, b) => a - b);\n\t\t\tordered.push(...remaining);\n\t\t}\n\n\t\treturn ordered;\n\t}\n\n\t// ── Private: worker-pool re-execution ─────────────────────────────\n\n\t/**\n\t * Offload VM re-execution to the worker pool for large batches.\n\t *\n\t * Called when ordered.length > WORKER_OFFLOAD_THRESHOLD (50).\n\t * Clones bytecode ArrayBuffers, dispatches to workers, and asynchronously\n\t * patches results back into LineCache before notifying listeners.\n\t *\n\t * Handles pending results: lines that return { type: 'pending' } from the\n\t * worker are NOT marked as updated, the engine's resolveAsync will handle\n\t * them when the async resolver completes.\n\t *\n\t * Safety: checks this.cleared before applying results, if the engine was\n\t * cleared while the worker batch was in-flight, results are discarded.\n\t */\n\tprivate async reExecuteViaWorkerPool(\n\t\tordered: number[],\n\t\tentryMap: Map<number, ReturnType<LineCache[\"getEntryForLine\"]>>,\n\t\tallQueryKeys: string[],\n\t): Promise<void> {\n\t\t// Lazily create the pool on first use.\n\t\tif (!this.executionPool) {\n\t\t\tthis.executionPool = new ExecutionPool();\n\t\t}\n\n\t\tconst results = this.executionPool.executeBatch(ordered, entryMap);\n\n\t\t// If workers are unavailable (Node.js, SSR, test env without jsdom\n\t\t// worker support), executeBatch returns undefined. Fall back to\n\t\t// main-thread execution.\n\t\tif (!results) {\n\t\t\tthis.reExecuteMainThread(ordered, allQueryKeys, entryMap);\n\t\t\treturn;\n\t\t}\n\n\t\tthis.workerOffloadDispatchCount++;\n\n\t\t// Await worker results.\n\t\tconst workerResults = await results;\n\n\t\t// Guard: if engine was cleared while the worker batch was in-flight,\n\t\t// discard results, the LineCache/DAG are stale.\n\t\tif (this.cleared) return;\n\n\t\t// Patch results back into LineCache.\n\t\tconst updatedLineNumbers: number[] = [];\n\t\tfor (const wr of workerResults) {\n\t\t\tconst entry = entryMap.get(wr.lineNumber);\n\t\t\tif (!entry) continue;\n\n\t\t\tif (wr.isPending) {\n\t\t\t\t// Don't mark as updated, will be resolved in a future batch.\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Reconstruct Value from serialized result.\n\t\t\tconst value = reconstructValue(wr);\n\t\t\tentry.result = value;\n\t\t\tthis.warnIfUnwired();\n\t\t\tthis.onLineResult?.(wr.lineNumber, value);\n\t\t\tupdatedLineNumbers.push(wr.lineNumber);\n\t\t}\n\n\t\t// Notify listeners (only if not cleared during await).\n\t\tif (this.cleared) return;\n\t\tif (updatedLineNumbers.length > 0 || allQueryKeys.length > 0) {\n\t\t\tthis.notifyListeners({\n\t\t\t\ttype: \"lines-updated\",\n\t\t\t\tlineNumbers: updatedLineNumbers,\n\t\t\t\taffectedQueryKeys: allQueryKeys,\n\t\t\t});\n\t\t}\n\t}\n\n\t// ── Private: main-thread re-execution ────────────────────────────\n\n\t/**\n\t * Execute ordered lines on the main thread, update LineCache, and notify\n\t * listeners. Returns the list of line numbers that actually changed.\n\t *\n\t * Used by both flush() (≤50 lines) and reExecuteViaWorkerPool() (fallback\n\t * when workers are unavailable). Extracted to avoid code duplication.\n\t *\n\t * **Per-line containment (fatal-bug fix)**: `executeBytecode()` used to\n\t * run here with NO try/catch anywhere in this method's call chain, and\n\t * this whole batch runs inside a bare `queueMicrotask` (see `add()`) with\n\t * no surrounding try/catch at any caller either, so if any ONE line's\n\t * cached bytecode threw (a stack/instruction-limit error, an undefined\n\t * variable, a corrupted-bytecode `TypeError`), the `for` loop aborted\n\t * immediately: every line scheduled AFTER the failure in this batch was\n\t * silently never re-executed or notified even though nothing was wrong\n\t * with them, every line BEFORE it had already had its `entry.result`\n\t * mutated in-place but `notifyListeners()` was never reached (a silent\n\t * `LineCache`/host desync), and, because a bare `queueMicrotask`\n\t * callback has no caller to catch it, the exception was uncatchable:\n\t * an `uncaughtException` that could crash the host process outright.\n\t * (`__tests__/async/AsyncResolutionBatcher.spec.ts`'s topological-sort\n\t * describe block used to have a test skipped specifically because of\n\t * this. See that file, now un-skipped and rewritten.) Each line's\n\t * execution is now its own try/catch: a failure is recorded as an\n\t * `Error` `Value` for THAT line (still counted as \"updated\" so the host\n\t * learns about it and stops showing a stale Pending state) and the loop\n\t * continues, one line's failure can no longer take out its neighbors.\n\t */\n\tprivate reExecuteMainThread(\n\t\tordered: number[],\n\t\tallQueryKeys: string[],\n\t\tentryMap?: Map<number, LineCacheEntry | undefined>,\n\t): number[] {\n\t\tconst updatedLineNumbers: number[] = [];\n\n\t\tfor (const lineNumber of ordered) {\n\t\t\tconst entry = entryMap\n\t\t\t\t? entryMap.get(lineNumber)\n\t\t\t\t: this.lineCache.getEntryForLine(lineNumber);\n\t\t\tif (!entry || entry.bytecode.opcodes.length === 0) continue;\n\n\t\t\t// Do NOT reset the VM here: reset() clears the variable table, which\n\t\t\t// would wipe values produced by earlier lines in this topologically\n\t\t\t// ordered batch (and by unaffected lines outside it). Instead, mirror\n\t\t\t// the engine's execution pattern: snapshot the stack depth and pop\n\t\t\t// back to it after execution.\n\t\t\tconst stackBefore = this.vm.getStack().length;\n\t\t\ttry {\n\t\t\t\tconst result = executeBytecode(entry.bytecode, this.vm);\n\t\t\t\twhile (this.vm.getStack().length > stackBefore) {\n\t\t\t\t\tthis.vm.pop();\n\t\t\t\t}\n\n\t\t\t\tif (result.type === \"value\") {\n\t\t\t\t\tentry.result = result.value;\n\t\t\t\t\tthis.warnIfUnwired();\n\t\t\t\t\tthis.onLineResult?.(lineNumber, result.value);\n\t\t\t\t\tupdatedLineNumbers.push(lineNumber);\n\t\t\t\t} else if (result.type === \"error\") {\n\t\t\t\t\t// executeBytecode() reports controlled failures (undefined\n\t\t\t\t\t// variable, stack/instruction limits, a plugin throw) as this\n\t\t\t\t\t// {type:'error'} return value now, not a thrown exception, the\n\t\t\t\t\t// catch block below only remains as a backstop for whatever\n\t\t\t\t\t// still throws outside that contract (e.g. a bug in the\n\t\t\t\t\t// stack-cleanup loop itself). Without this branch, a VM-level\n\t\t\t\t\t// error here fell through both the \"value\" and \"pending\" cases\n\t\t\t\t\t// silently: no entry.result update, no onLineResult, not counted\n\t\t\t\t\t// in updatedLineNumbers, the same class of silent-drop bug this\n\t\t\t\t\t// method's containment fix exists to prevent, just moved one\n\t\t\t\t\t// level up from \"uncaught exception\" to \"unhandled Result arm\".\n\t\t\t\t\tconst value = errorValue(result.error.code, result.error.message);\n\t\t\t\t\tentry.result = value;\n\t\t\t\t\tthis.warnIfUnwired();\n\t\t\t\t\tthis.warnIfUnwired();\n\t\t\t\tthis.onLineResult?.(lineNumber, value);\n\t\t\t\t\tupdatedLineNumbers.push(lineNumber);\n\t\t\t\t}\n\t\t\t\t// If still pending, don't mark as updated, will be handled by the\n\t\t\t\t// next resolution batch.\n\t\t\t} catch (e) {\n\t\t\t\t// Restore the stack to its pre-execution depth even on failure\n\t\t\t\t// a partially-executed opcode sequence may have pushed values it\n\t\t\t\t// never got to pop, and leaving them would corrupt every\n\t\t\t\t// subsequent line's execution in this same shared VM.\n\t\t\t\twhile (this.vm.getStack().length > stackBefore) {\n\t\t\t\t\tthis.vm.pop();\n\t\t\t\t}\n\t\t\t\tconst engineError = normalizeUnknownError(e);\n\t\t\t\tconst value = errorValue(engineError.code, engineError.message);\n\t\t\t\tentry.result = value;\n\t\t\t\tthis.warnIfUnwired();\n\t\t\t\tthis.onLineResult?.(lineNumber, value);\n\t\t\t\tupdatedLineNumbers.push(lineNumber);\n\t\t\t}\n\t\t}\n\n\t\t// Notify listeners of updated lines.\n\t\tif (updatedLineNumbers.length > 0 || allQueryKeys.length > 0) {\n\t\t\tthis.notifyListeners({\n\t\t\t\ttype: \"lines-updated\",\n\t\t\t\tlineNumbers: updatedLineNumbers,\n\t\t\t\taffectedQueryKeys: allQueryKeys,\n\t\t\t});\n\t\t}\n\n\t\treturn updatedLineNumbers;\n\t}\n\n\t/**\n\t * Notify all consumers of an async resolution event.\n\t *\n\t * Enqueues the event into the internal {@link ReadableStream}.\n\t * If the stream has been closed or errored (consumer cancelled),\n\t * the enqueue silently fails (caught by try/catch).\n\t */\n\tprivate notifyListeners(event: AsyncResolutionEvent): void {\n\t\t// Test capture, synchronous, no timing issues (enabled only in tests).\n\t\tif (this._testCaptures) {\n\t\t\tthis._testCaptures.push(event);\n\t\t}\n\n\t\tif (this._streamController) {\n\t\t\ttry {\n\t\t\t\tthis._streamController.enqueue(event);\n\t\t\t} catch {\n\t\t\t\t// Stream closed or errored, consumer may have cancelled.\n\t\t\t}\n\t\t}\n\t}\n}\n","// ── Allocation Tracker Telemetry Framework ─────────────────────────────────\n// Phase 1: Per-stage allocation + wall-time tracking for the 5-layer pipeline.\n//\n// Usage:\n// AllocationTracker.enable();\n// const { result, alloc } = AllocationTracker.track('lexer', () => lexer.tokenizeAll());\n// AllocationTracker.disable();\n//\n// Each track() call captures:\n// - Wall-clock time (via process.hrtime in Node.js, performance.now in browser)\n// - Heap delta (via process.memoryUsage in Node.js, unavailable in browser)\n// - Object counts (reserved for Phase 2+ with --expose-gc heap snapshots)\n//\n// Design principle: Zero overhead when disabled. The enabled flag is a static\n// boolean, a single branch that V8's JIT eliminates when allocation tracking\n// is disabled in production.\n\n\n// ── Types ─────────────────────────────────────────────────────────────────\n\n/** The pipeline stages allocation is attributed to. */\nexport type PipelineStage =\n | 'lexer'\n | 'normalizer'\n | 'parser'\n | 'resolver'\n | 'vm'\n | 'orchestrator';\n\n/** What one stage allocated during one measured span. */\nexport interface StageAllocation {\n /** Pipeline stage name. */\n stage: PipelineStage;\n /** Number of objects allocated (reserved, requires --expose-gc snapshots). */\n allocCount: number;\n /** Heap bytes allocated (delta of process.memoryUsage().heapUsed). */\n allocBytes: number;\n /** Breakdown of object types allocated (reserved, requires heap snapshots). */\n objectCounts: Record<string, number>;\n /** Wall-clock duration in nanoseconds. */\n wallTimeNs: number;\n /** Optional: sub-stage name for finer-grained tracking within a stage. */\n subStage?: string;\n /** Optional: whether this stage hit a cache (zero-parse, zero-lex). */\n cacheHit?: boolean;\n}\n\n/** Per-stage allocation for a single expression, in pipeline order. */\nexport interface PipelineTelemetry {\n /** The expression text that was evaluated. */\n expression: string;\n /** Per-stage allocation and timing data, in execution order. */\n stages: StageAllocation[];\n /** Total heap bytes allocated across all stages. */\n totalAllocBytes: number;\n /** Total wall-clock duration in nanoseconds. */\n totalWallTimeNs: number;\n /** Whether the expression took the orchestrator fast path. */\n fastPath: boolean;\n}\n\n/** Aggregate statistics across multiple pipeline runs. */\nexport interface StageAggregate {\n stage: PipelineStage;\n count: number;\n meanAllocBytes: number;\n meanWallTimeNs: number;\n minWallTimeNs: number;\n maxWallTimeNs: number;\n p50WallTimeNs: number;\n p95WallTimeNs: number;\n p99WallTimeNs: number;\n}\n\n// ── AllocationTracker ─────────────────────────────────────────────────────\n\n/**\n * Measures heap allocation per pipeline stage.\n *\n * A development tool: it reads `process.memoryUsage().heapUsed` around each\n * stage, which is only meaningful over the exact span it wraps. Widening a\n * measured span to cover more work does not measure more, it measures garbage\n * collection, and produces negative readings when a collection lands inside.\n */\nexport class AllocationTracker {\n /** Master kill-switch. Disabled in production, zero allocation overhead. */\n private static enabled: boolean = false;\n\n // ══ Lifecycle ═══════════════════════════════════════════════════════════\n\n /** Enable allocation tracking. Idempotent. */\n static enable(): void {\n this.enabled = true;\n }\n\n /** Disable allocation tracking. Idempotent. */\n static disable(): void {\n this.enabled = false;\n }\n\n /** Query whether tracking is currently enabled. */\n static isEnabled(): boolean {\n return this.enabled;\n }\n\n // ══ Core: Track a pipeline stage ═══════════════════════════════════════\n\n /**\n * Execute a function and capture allocation + wall-time data.\n *\n * When disabled, executes `fn()` with zero overhead (no measurements taken).\n * When enabled, captures heap delta via process.memoryUsage() (Node.js) and\n * wall-clock via process.hrtime() (Node.js) or performance.now() (browser).\n *\n * @param stage - Pipeline stage name (e.g., 'lexer', 'parser', 'vm').\n * @param fn - The pipeline stage function to execute and measure.\n * @param opts - Optional: sub-stage name and cache-hit flag.\n * @returns The function's result and the allocation/timing data.\n */\n static track<T>(\n stage: PipelineStage,\n fn: () => T,\n opts?: { subStage?: string; cacheHit?: boolean }\n ): { result: T; alloc: StageAllocation | null } {\n if (!this.enabled) {\n return { result: fn(), alloc: null };\n }\n\n // ══ Capture pre-execution state ══\n const startMem = typeof process !== 'undefined' && process.memoryUsage\n ? process.memoryUsage()\n : null;\n // hrtime() returns [seconds, nanoseconds]; performance.now() returns milliseconds\n const startTime = typeof process !== 'undefined' && process.hrtime\n ? process.hrtime()\n : performance.now();\n\n // ══ Execute the pipeline stage ══\n // Errors propagate naturally, track() must not swallow.\n const result = fn();\n\n // ══ Capture post-execution state ══\n const endTime = typeof process !== 'undefined' && process.hrtime\n ? process.hrtime(startTime as [number, number])\n : undefined;\n const endMem = typeof process !== 'undefined' && process.memoryUsage\n ? process.memoryUsage()\n : null;\n\n // Compute wall time:\n // Node.js: endTime is [seconds, nanoseconds] → convert to ns\n // Browser: endTime undefined, startTime is performance.now() → compute delta in ns\n const wallTimeNs: number = endTime\n ? endTime[0] * 1e9 + endTime[1]\n : (performance.now() - (startTime as number)) * 1e6;\n\n const allocBytes: number = startMem && endMem\n ? endMem.heapUsed - startMem.heapUsed\n : 0;\n\n const alloc: StageAllocation = {\n stage,\n allocCount: 0, // Reserved — requires --expose-gc heap snapshots (Phase 2+)\n allocBytes,\n objectCounts: {}, // Reserved — requires heap snapshots (Phase 2+)\n wallTimeNs,\n ...opts,\n };\n\n return { result, alloc };\n }\n\n // ══ Report Generation ══════════════════════════════════════════════════\n\n /**\n * Generate a markdown table from an array of PipelineTelemetry records.\n *\n * Aggregates by stage and outputs mean/min/max wall time, mean alloc bytes,\n * and p50/p95/p99 percentiles.\n *\n * @param telemetry - Array of pipeline telemetry records from multiple runs.\n * @param title - Optional title for the markdown section.\n * @returns A markdown-formatted string with per-stage and total aggregate tables.\n */\n static generateReport(telemetry: PipelineTelemetry[], title?: string): string {\n const lines: string[] = [];\n\n lines.push(title ? `## ${title}` : '## Pipeline Allocation Report');\n lines.push('');\n lines.push(`**Runs:** ${telemetry.length} | **Generated:** ${new Date().toISOString()}`);\n lines.push('');\n\n // Aggregate by stage\n const aggregate = this.aggregate(telemetry);\n\n if (aggregate.length === 0) {\n lines.push('_No telemetry data._');\n return lines.join('\\n');\n }\n\n // Per-stage table\n lines.push('### Per-Stage Breakdown');\n lines.push('');\n lines.push('| Stage | Count | Mean Wall (µs) | Mean Alloc (bytes) | Min (µs) | Max (µs) | p50 (µs) | p95 (µs) | p99 (µs) |');\n lines.push('|-------|:-----:|:--------------:|:------------------:|:--------:|:--------:|:--------:|:--------:|:--------:|');\n\n for (const agg of aggregate) {\n lines.push(\n `| ${agg.stage} | ${agg.count} | ` +\n `${(agg.meanWallTimeNs / 1000).toFixed(2)} | ` +\n `${agg.meanAllocBytes.toFixed(0)} | ` +\n `${(agg.minWallTimeNs / 1000).toFixed(2)} | ` +\n `${(agg.maxWallTimeNs / 1000).toFixed(2)} | ` +\n `${(agg.p50WallTimeNs / 1000).toFixed(2)} | ` +\n `${(agg.p95WallTimeNs / 1000).toFixed(2)} | ` +\n `${(agg.p99WallTimeNs / 1000).toFixed(2)} |`\n );\n }\n\n // Total stats\n const totalAllocBytes = telemetry.reduce((sum, t) => sum + t.totalAllocBytes, 0);\n const totalWallNs = telemetry.reduce((sum, t) => sum + t.totalWallTimeNs, 0);\n const fastPathCount = telemetry.filter(t => t.fastPath).length;\n\n lines.push('');\n lines.push('### Totals');\n lines.push('');\n lines.push(`- **Total wall time:** ${(totalWallNs / 1e6).toFixed(2)} ms (${telemetry.length} runs)`);\n lines.push(`- **Total heap allocated:** ${totalAllocBytes.toLocaleString()} bytes`);\n lines.push(`- **Fast-path runs:** ${fastPathCount}/${telemetry.length} (${((fastPathCount / telemetry.length) * 100).toFixed(0)}%)`);\n lines.push(`- **Mean per-run:** ${(totalWallNs / telemetry.length / 1000).toFixed(2)} µs, ${(totalAllocBytes / telemetry.length).toFixed(0)} bytes`);\n\n return lines.join('\\n');\n }\n\n /**\n * Aggregate PipelineTelemetry records by stage.\n *\n * Computes count, mean/min/max wall time, mean alloc bytes, and\n * p50/p95/p99 percentiles for each pipeline stage.\n */\n static aggregate(telemetry: PipelineTelemetry[]): StageAggregate[] {\n const stageMap = new Map<PipelineStage, StageAllocation[]>();\n\n // Collect all stage allocations by stage\n for (const t of telemetry) {\n for (const s of t.stages) {\n if (!stageMap.has(s.stage)) {\n stageMap.set(s.stage, []);\n }\n stageMap.get(s.stage)!.push(s);\n }\n }\n\n // Compute aggregates\n const result: StageAggregate[] = [];\n for (const [stage, allocations] of stageMap) {\n const wallTimes = allocations.map(a => a.wallTimeNs).sort((a, b) => a - b);\n const allocBytes = allocations.map(a => a.allocBytes);\n const count = allocations.length;\n\n result.push({\n stage,\n count,\n meanAllocBytes: allocBytes.reduce((s, v) => s + v, 0) / count,\n meanWallTimeNs: wallTimes.reduce((s, v) => s + v, 0) / count,\n minWallTimeNs: wallTimes[0],\n maxWallTimeNs: wallTimes[wallTimes.length - 1],\n p50WallTimeNs: percentile(wallTimes, 50),\n p95WallTimeNs: percentile(wallTimes, 95),\n p99WallTimeNs: percentile(wallTimes, 99),\n });\n }\n\n // Sort by stage name for consistent output\n result.sort((a, b) => a.stage.localeCompare(b.stage));\n return result;\n }\n\n /**\n * Create a PipelineTelemetry from a collection of StageAllocations.\n *\n * @param expression - The expression that was evaluated.\n * @param stages - Per-stage allocation data in execution order.\n * @param fastPath - Whether the orchestrator took the fast path.\n */\n static createTelemetry(\n expression: string,\n stages: StageAllocation[],\n fastPath: boolean = false\n ): PipelineTelemetry {\n const totalAllocBytes = stages.reduce((sum, s) => sum + s.allocBytes, 0);\n const totalWallTimeNs = stages.reduce((sum, s) => sum + s.wallTimeNs, 0);\n return { expression, stages, totalAllocBytes, totalWallTimeNs, fastPath };\n }\n}\n\n// ── Helpers ───────────────────────────────────────────────────────────────\n\n/**\n * Compute the nth percentile from a sorted array of numbers.\n * Uses linear interpolation between neighboring values.\n */\nfunction percentile(sorted: number[], p: number): number {\n if (sorted.length === 0) return 0;\n if (sorted.length === 1) return sorted[0];\n\n const index = (p / 100) * (sorted.length - 1);\n const lower = Math.floor(index);\n const upper = Math.ceil(index);\n if (lower === upper) return sorted[lower];\n\n const fraction = index - lower;\n return sorted[lower] * (1 - fraction) + sorted[upper] * fraction;\n}\n","import type { Token } from \"@solve-js/lexer/Token\";\nimport { InlineSolvePosition } from \"@solve-js/types/ParsingResult\";\nimport { ErrorFactory, type EngineError } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { numberValue, Value } from \"@solve-js/vm/Value\";\nimport { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\n// Deliberately the shared lexer, not an engine's own.\n//\n// `classifyLine` and `findInlineSolves` are character-level scans for headings,\n// comment markers, code fences and backtick spans. Neither consults the\n// keyword, unit or operator tables, so every lexer returns the same answer and\n// there is nothing per-engine to respect. Pinned by\n// __tests__/lexer/LineClassificationIsVocabularyIndependent.spec.ts, which\n// compares a bare lexer against one carrying extra vocabulary.\n//\n// This matters because these are free functions with no engine to ask. Making\n// them engine-aware would mean changing their signatures and every caller for\n// no behavioural difference.\nimport { sharedLexer } from \"@solve-js/lexer/Lexer\";\nimport { globalDagKey } from \"@solve-js/vm/GlobalVariableStore\";\n\n// ── Validation config ────────────────────────────────────────────────────\n\n/** Bounds applied to input before parsing: length and nesting depth. */\nexport interface ValidationConfig {\n maxExpressionLength: number;\n maxComplexity: number;\n}\n\n// ── Safety result ─────────────────────────────────────────────────────────\n\n/** Whether input passed the safety bounds, and which one it failed. */\nexport interface SafetyCheckResult {\n passed: boolean;\n /**\n * `error.error` (a plain string) exists purely because it's spread\n * directly into `evaluateExpressionWithDiagnostic()`'s own return shape\n * (`{value, tokens, program, error?: string, ...}`), which deliberately\n * keeps errors as display strings for the debug/diagnostic pipeline\n * see that method's own doc comment. `error.engineError` is additive\n * (doesn't replace the string field, so existing consumers of this\n * exported type are unaffected): it carries the real EngineError this\n * check constructed internally, so callers that DO want the original\n * code/category/expected/found/suggestion (prepareExpression(), not the\n * diagnostic pipeline) don't have to reconstruct a generic one from just\n * the flattened message.\n */\n error?: { value: Value; tokens: Token[]; program: BytecodeProgram; error: string; engineError?: EngineError };\n}\n\n// ── Safety checks ─────────────────────────────────────────────────────────\n\n/**\n * Check that the expression doesn't exceed the maximum allowed length.\n */\nexport function checkExpressionLength(\n expression: string,\n config: ValidationConfig\n): SafetyCheckResult {\n if (expression.length > config.maxExpressionLength) {\n const err = ErrorFactory.validation(\n \"EXPRESSION_TOO_LONG\",\n `Expression exceeds max length of ${config.maxExpressionLength} characters (got ${expression.length})`,\n { expressionLength: expression.length, maxLength: config.maxExpressionLength }\n );\n return {\n passed: false,\n error: {\n value: numberValue(0),\n tokens: [],\n program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n error: err.message,\n engineError: err,\n },\n };\n }\n return { passed: true };\n}\n\n/**\n * Score expression complexity based on token count, function calls, and nesting depth.\n * Returns the complexity score and whether it exceeds the configured maximum.\n */\nexport function checkExpressionComplexity(\n tokens: Token[],\n config: ValidationConfig\n): { passed: boolean; complexityScore: number; errorMessage?: string; engineError?: EngineError } {\n let functionCallCount = 0;\n let nestingDepth = 0;\n let maxParens = 0;\n for (const t of tokens) {\n if (t.type === \"FUNC\") functionCallCount++;\n if (t.value === \"(\" || t.type === \"LPAREN\") { nestingDepth++; maxParens = Math.max(maxParens, nestingDepth); }\n if (t.value === \")\" || t.type === \"RPAREN\") nestingDepth--;\n }\n const complexityScore = tokens.length + functionCallCount * 5 + maxParens * 10;\n if (complexityScore > config.maxComplexity) {\n const err = ErrorFactory.validation(\n \"EXPRESSION_TOO_COMPLEX\",\n `Expression complexity score ${complexityScore} exceeds maximum of ${config.maxComplexity}`,\n { complexity: complexityScore, maxComplexity: config.maxComplexity }\n );\n return { passed: false, complexityScore, errorMessage: err.message, engineError: err };\n }\n return { passed: true, complexityScore };\n}\n\n// ── Read/write extraction ─────────────────────────────────────────────────\n\n/**\n * Guard: true if the token is a valid variable name type.\n * Accepts both IDENT and UNIT tokens, UNIT occurs when the variable name\n * collides with a known unit (e.g., \"b\" for bits, \"s\" for seconds).\n */\nfunction isVarName(t: Token): boolean {\n return t.type === \"IDENT\" || t.type === \"UNIT\";\n}\n\n/**\n * True if a UNIT token at this position is being consumed as a\n * unit-of-measure literal rather than a variable reference, i.e. it's\n * immediately preceded by a value (NUMBER, a closing paren) or a\n * conversion keyword (TO, IN). This mirrors exactly where\n * UomLiteralParselet/ConvertParselet/PercentageChangeParselet accept a\n * UNIT token themselves: `500 EUR`, `(x + y) km`, `to JPY`, `in m`.\n * In all of these the compiler emits PUSH_STRING for the unit name, not\n * LOAD_VAR, so treating them as a DAG read is a false positive, the\n * classic case being any bare currency/unit conversion like\n * \"500 EUR to JPY\", which falsely reported \"EUR\" and \"JPY\" as variable\n * dependencies even though the compiled bytecode never loads a variable.\n */\nfunction isUnitLiteralContext(prev: Token): boolean {\n return prev.type === \"NUMBER\" || prev.type === \"TO\" || prev.type === \"IN\" || prev.type === \"RPAREN\";\n}\n\n/**\n * From an LPAREN token index, scan forward tracking paren depth and return\n * the index of the matching RPAREN, or `null` if unbalanced. Mirrors\n * `PrecedenceParser.ts`'s `findMatchingRParen`, necessarily duplicated\n * here since this file is a standalone, parser-instance-free static token\n * scan (same \"dead-code-but-must-stay-synced mirror\" pattern as\n * `NumberParselet.ts`).\n */\nfunction findMatchingRParenIdx(tokens: Token[], openIdx: number): number | null {\n let depth = 0;\n for (let i = openIdx; i < tokens.length; i++) {\n if (tokens[i].type === \"LPAREN\") depth++;\n else if (tokens[i].type === \"RPAREN\") {\n depth--;\n if (depth === 0) return i;\n }\n }\n return null;\n}\n\n/**\n * Pre-scan for user-defined-function DEFINITION shapes (`name(params) =\n * body`) to collect the set of PARAMETER names that must be excluded from\n * `reads`/`writes` in {@link extractReadsAndWrites} below. Without this, a\n * parameter name colliding with an unrelated document-level `:variable` of\n * the same name would register a spurious DAG dependency, `f(x) = 2*x+1`\n * must not depend on some unrelated `:x` defined elsewhere in the document,\n * and `x` itself must never be reported as a document-level WRITE (the\n * parameter isn't being assigned to at document scope at all). Scoped to a\n * single line's own token stream, matching how `extractReadsAndWrites` is\n * already called per-line, no cross-line interference with an unrelated\n * `:x` on a different line.\n */\nfunction collectFunctionParamNames(tokens: Token[]): Set<string> {\n const excluded = new Set<string>();\n for (let i = 0; i < tokens.length; i++) {\n if (!isVarName(tokens[i])) continue;\n if (i > 0 && tokens[i - 1].type === \"COLON\") continue; // :name(...) is a different grammar entirely\n if (tokens[i + 1]?.type !== \"LPAREN\") continue;\n const closeIdx = findMatchingRParenIdx(tokens, i + 1);\n if (closeIdx === null) continue;\n if (tokens[closeIdx + 1]?.type !== \"EQUALS\") continue; // a CALL, not a DEFINITION — no params to exclude\n for (let j = i + 2; j < closeIdx; j++) {\n if (isVarName(tokens[j])) excluded.add(tokens[j].value);\n }\n }\n return excluded;\n}\n\n/**\n * Extract variable reads and writes from a token stream.\n *\n * Handles both IDENT and UNIT tokens as potential variable references.\n * UNIT tokens occur when the variable name collides with a known unit\n * (e.g., \"b\" for bits, \"s\" for seconds). The colon prefix unambiguously\n * signals a variable definition context (handled by VariableParselet).\n * A standalone UNIT token is only a real variable reference when it\n * isn't in unit-literal position (see {@link isUnitLiteralContext})\n * otherwise it's a quantity/conversion unit name, never LOAD_VAR'd.\n *\n * Also detects user-defined-function DEFINITIONS (`name(params) = body`)\n * as a read+write of the function's own name, mirroring `:name = value`'s\n * existing convention of registering the defined name as both, and\n * excludes the definition's own PARAMETER names from reads/writes\n * entirely (see {@link collectFunctionParamNames}). A function CALL\n * (`name(args)`, no trailing `=`) needs no special detection: the call's\n * own name falls through to the ordinary bare-identifier read-tracking\n * below, the same as any other `LOAD_VAR`-producing identifier. This is\n * already correct once calls compile successfully, no change needed.\n */\nexport function extractReadsAndWrites(tokens: Token[]): { reads: string[]; writes: string[] } {\n const reads: string[] = [];\n const writes: string[] = [];\n const functionParamNames = collectFunctionParamNames(tokens);\n\n for (let i = 0; i < tokens.length; i++) {\n const t = tokens[i];\n if (t.type === \"GLOBAL\") {\n // global :name [= expr], GLOBAL, COLON, IDENT/UNIT are three\n // separate tokens (matching GlobalVariableParselet). Emit a\n // \"global:\"-prefixed synthetic name into THIS document's own\n // DAG (via globalDagKey) so a local :hello and global :hello\n // never collide in this document's own reads/writes tracking\n // the bare-COLON branch below explicitly skips the colon that\n // follows GLOBAL, since it's handled here instead.\n if (i + 2 < tokens.length && tokens[i + 1].type === \"COLON\" && isVarName(tokens[i + 2])) {\n const key = globalDagKey(tokens[i + 2].value);\n reads.push(key);\n if (i + 3 < tokens.length && tokens[i + 3].type === \"EQUALS\") {\n writes.push(key);\n }\n }\n continue;\n }\n if (t.type === \"COLON\") {\n // Skip. This colon belongs to a `global :name` sequence\n // already handled by the GLOBAL branch above.\n if (i > 0 && tokens[i - 1].type === \"GLOBAL\") continue;\n // The moo lexer produces COLON as a bare \":\" token. The variable\n // name follows as a separate IDENT or UNIT token (matching VariableParselet).\n if (i + 1 < tokens.length && isVarName(tokens[i + 1])) {\n const varName = tokens[i + 1].value;\n reads.push(varName);\n // Colon-prefix variable definition: :name = expr\n // COLON + IDENT/UNIT are separate tokens, so EQUALS is at i+2.\n if (i + 2 < tokens.length && tokens[i + 2].type === \"EQUALS\") {\n writes.push(varName);\n }\n }\n }\n if (isVarName(t)) {\n // Skip if already consumed by preceding COLON handler above.\n if (i > 0 && tokens[i - 1].type === \"COLON\") continue;\n // Skip UNIT tokens acting as a quantity/conversion unit name\n // rather than a variable (see isUnitLiteralContext above).\n if (t.type === \"UNIT\" && i > 0 && isUnitLiteralContext(tokens[i - 1])) continue;\n // A user-defined-function's own PARAMETER name, never a\n // document-level read or write (see collectFunctionParamNames).\n if (functionParamNames.has(t.value)) continue;\n // A user-defined-function DEFINITION's own name: `name(params) =\n // body`. Registered as both a read and a write, mirroring\n // `:name = value`'s existing convention just below.\n if (tokens[i + 1]?.type === \"LPAREN\") {\n const closeIdx = findMatchingRParenIdx(tokens, i + 1);\n if (closeIdx !== null && tokens[closeIdx + 1]?.type === \"EQUALS\") {\n reads.push(t.value);\n writes.push(t.value);\n continue;\n }\n // else: a CALL (or malformed), falls through below, same as\n // any other bare identifier read.\n }\n reads.push(t.value);\n // Check if next token is EQUALS -> this is a write\n if (i + 1 < tokens.length && tokens[i + 1].type === \"EQUALS\") {\n writes.push(t.value);\n }\n }\n }\n return { reads, writes };\n}\n\n// ── Line classification ───────────────────────────────────────────────────\n\n/**\n * Check if a line is effectively empty (whitespace only or only markdown syntax).\n *\n * Phase B: Delegates to the ExpressionLexer's character-by-character\n * markdown line scanner, replacing the old regex-based heuristics.\n *\n * Skips lines that contain no evaluable expression:\n * - Whitespace-only lines\n * - Markdown structural markers (headings, blockquotes, lists without inline solves)\n * - Code block fences (```)\n * - MathJax block fences ($$)\n * - Table separator rows (|---|)\n * - Horizontal rules (---, ***, ___)\n * - Standalone wikilinks / embeds ([[...]], ![[...]])\n * - Whole-line comments (a line whose first non-whitespace characters are `//`)\n *\n * Lines containing inline solves (s\\`...\\`) are never considered empty.\n *\n * Note: a trailing `#`/`//` comment in the MIDDLE of an otherwise-evaluable\n * line does NOT make isEmptyLine() return true, that line is still an\n * \"expression\" line (skip: false). The comment is instead stripped at\n * tokenization time (ExpressionLexer's HASH/`//` handling emits a COMMENT\n * token for the rest of the line) and then filtered out of the token\n * stream by ExpressionEngine.prepareExpression() before parsing, so\n * `<expr> // note` evaluates identically to `<expr>` alone.\n */\nexport function isEmptyLine(lineText: string): boolean {\n const classification = sharedLexer.classifyLine(lineText);\n return classification.skip;\n}\n\n/**\n * Find all inline solves in a line with precise coordinate mapping.\n *\n * Phase B: Delegates to the ExpressionLexer's character-by-character\n * scanner (no regex, handles escaped backticks).\n */\nexport function findInlineSolvesInLine(lineText: string, lineNumber: number): InlineSolvePosition[] {\n const spans = sharedLexer.findInlineSolves(lineText);\n return spans.map(s => ({\n start: s.start,\n end: s.end,\n expression: s.expression,\n lineNumber,\n columnNumber: s.columnNumber,\n }));\n}\n","//#region Imports\n\nimport { VM, type EquationDef, type ScalarEquationDef } from \"@solve-js/vm/OpRegistry\";\nimport { matrixMultiply, inverse } from \"@solve-js/vm/MatrixOps\";\nimport { DependencyGraph } from \"@solve-js/vm/DependencyGraph\";\nimport { LineCache, LineCacheEntry } from \"@solve-js/cache/LineCache\";\nimport { ScopeManager } from \"@solve-js/vm/ScopeManager\";\nimport { Lexer } from \"@solve-js/lexer/Lexer\";\nimport { PrecedenceParser } from \"@solve-js/parser/PrecedenceParser\";\nimport { ParseletRegistry } from \"@solve-js/parser/registry/ParseletRegistry\";\nimport { BytecodeBuilder, type BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport { createVM, executeBytecode } from \"@solve-js/vm/VM\";\nimport type { EvalResult, LineExecutionContext } from \"@solve-js/vm/VM\";\nimport type { DocumentModel } from \"@solve-js/engine/DocumentModel\";\nimport { registerAsConverter, unregisterAsConverter } from \"@solve-js/vm/VMBuiltins\";\nimport { createEngineContext } from \"@solve-js/engine/EngineContext\";\nimport type { EngineContext } from \"@solve-js/engine/EngineContext\";\nimport { Value, ValueType, numberValue, stringValue, pendingValue, freezeIfDev, errorValue, type MatrixData } from \"@solve-js/vm/Value\";\nimport { BUILTIN_PACKAGES } from \"@solve-js/packages/builtins\";\nimport type { IEnginePackage } from \"@solve-js/api/PackageRegistry\";\nimport { checkPackageCompatibility } from \"@solve-js/api/PackageCompatibility\";\nimport { assertEngineVersionCompatible } from \"@solve-js/api/EngineVersionCompatibility\";\nimport { registerTokenCategory, unregisterTokenCategory } from \"@solve-js/language/TokenCategoryMap\";\nimport type { CompletionItem } from \"@solve-js/language/LanguageService\";\nimport type { LexerVocabulary } from \"@solve-js/lexer/ExpressionLexer\";\nimport { QueryClient } from \"@tanstack/query-core\";\nimport { createQueryClient, setActiveQueryClient, getActiveQueryClient } from \"@solve-js/services/DataQueryService\";\nimport { ErrorFactory, EngineError, normalizeUnknownError } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { countLines } from \"@solve-js/utilities/Strings\";\nimport {\n\tResolverRegistry,\n} from \"@solve-js/resolvers/ResolverRegistry\";\nimport {\n\tAsyncResolutionBatcher,\n\ttype AsyncResolutionEvent,\n} from \"@solve-js/engine/AsyncResolutionBatcher\";\nimport { AllocationTracker, type PipelineTelemetry, type StageAllocation } from \"@solve-js/telemetry\";\nimport {\n ParsingResult,\n ParsedLine,\n InlineSolvePosition,\n UnifiedParsingOptions,\n} from \"@solve-js/types/ParsingResult\";\nimport { DiagnosticReportJSON } from \"@solve-js/diagnostics\";\nimport type { Token, ScanLineResult } from \"@solve-js/lexer\";\nimport { DEFAULT_CONFIG, mergeEngineConfig, type EngineConfig } from \"@solve-js/constants/Configuration\";\nimport {\n DiagnosticPipeline,\n TimelineDiagnosticCollector,\n DiagnosticEventType\n} from \"@solve-js/diagnostics\";\nimport {\n checkExpressionLength,\n checkExpressionComplexity,\n extractReadsAndWrites,\n} from \"@solve-js/engine/ExpressionEngineSafety\";\nimport { buildTokenLookup } from \"@solve-js/lexer/tokenRegistration\";\nimport { containsSymbolicCall } from \"@solve-js/packages/symbolic\";\nimport { solveEquationValues } from \"@solve-js/vm/SymbolicOps\";\nimport { abortLogger } from \"@solve-js/utilities/AbortControllerLogger\";\nimport { TokenNormalizer, BUILTIN_PHRASES, implicitMultiplyRule } from \"@solve-js/normalizer\";\nimport type { TokenFusion } from \"@solve-js/normalizer\";\nimport {\n type DiagnosticPipelineResult,\n type PipelineStageResult,\n type StageOutput,\n type InlineSolveSpanInfo,\n type CacheSnapshot,\n type BatcherMetrics,\n type CheckpointSnapshot,\n type BytecodeCacheEntry,\n type LineCacheEntryInfo,\n type AsyncCachePackageInfo,\n} from \"@solve-js/types/DiagnosticPipelineResult\";\n\n// Re-export for consumers (playground imports these from ExpressionEngine)\nexport type { CacheSnapshot, BatcherMetrics, CheckpointSnapshot, BytecodeCacheEntry, LineCacheEntryInfo, AsyncCachePackageInfo };\nexport type { DagSnapshot } from \"@solve-js/vm/DependencyGraph\";\n\n/**\n * Return type of {@link evaluateLine} and {@link evaluateExpression}.\n *\n * A single-element `Value[]`, kept as an array (rather than a bare\n * `Value`) for API stability.\n */\nexport interface EvalResults extends Array<Value> {}\n\n/** Explicit result of {@link ExpressionEngine.evaluateLineDetailed}. */\nexport interface LineEvaluation {\n /** The evaluated value, wrapped in a single-element array. */\n values: Value[];\n}\n\n//#endregion\n\n/**\n * Core expression evaluation engine, the top-level orchestrator.\n *\n * Owns the full evaluation pipeline: lexing, parsing, bytecode compilation,\n * VM execution, DAG-based dependency tracking, and async resolution.\n *\n * Key responsibilities:\n * - Pipeline orchestration: lex → parse → compile → execute → cache\n * - Bytecode caching for repeated expressions\n * - DAG-based incremental re-evaluation on variable changes\n * - Async resolution via ResolverRegistry + AsyncResolutionBatcher\n * - Package registration (built-in + external plugins)\n * - Safety validation (length, complexity, nesting)\n * - Diagnostic pipeline integration\n * - Keystroke-level AbortSignal management\n *\n * Each engine instance has its own isolated lexer, registry, parser, and\n * LineCache. The VM uses this engine's own opcode registry, and each engine\n * creates its own VM instance with configurable limits.\n *\n * ## Lifecycle\n *\n * Call {@link ExpressionEngine.clear} when you are finished with an engine that\n * has parsed a document. Dropping your last reference is not sufficient: the\n * async batcher is reachable from the module-level data-query service, so a\n * parsed engine stays retained until `clear()` releases it. Measured per engine\n * after a forced collection, with a 40-line document:\n *\n * | Lifecycle | Retained |\n * | --- | --- |\n * | constructed, never parsed | 8.2KB |\n * | constructed and parsed | 46.9KB |\n * | constructed, parsed, cleared | 10.0KB |\n *\n * This matters for hosts that create one engine per document or per tab, which\n * is the intended usage. Reusing a single engine across documents is also fine:\n * `clear()` resets it for the next one rather than consuming it.\n *\n * @example\n * ```typescript\n * import { ExpressionEngine } from \"solve-engine\";\n * const engine = new ExpressionEngine(\"en\");\n * const [value] = engine.evaluateExpression(\"2 + 2 * 10\");\n * console.log(value.toNumber()); // 22\n * ```\n */\n//#region Class: ExpressionEngine\n\nexport class ExpressionEngine {\n //#region Private Properties\n private dag = new DependencyGraph();\n private lineCache = new LineCache();\n private scopeManager = new ScopeManager();\n private lexer: Lexer;\n private registry: ParseletRegistry;\n private parser: PrecedenceParser;\n private localeCode: string;\n private vm: VM;\n /**\n * Registries this engine owns, rather than shares with every other\n * instance in the process. See {@link EngineContext}.\n */\n private readonly context: EngineContext;\n private config: typeof DEFAULT_CONFIG;\n private diagnosticPipeline: DiagnosticPipeline;\n /**\n * Direct reference to the timeline collector registered above (when\n * diagnosticMode is on), kept alongside the generic `diagnosticPipeline`\n * so `evaluateExpressionWithDiagnostic()` can cheaply read its current\n * `parseletMatchCount` as a \"before\" baseline without paying for a full\n * `getReport()` build (which copies the whole cumulative parselets\n * array). See that method's use of it for why a baseline is needed at\n * all, `TimelineDiagnosticCollector`'s state is deliberately cumulative\n * across an entire document pass, not reset per line.\n */\n private timelineCollector?: TimelineDiagnosticCollector;\n /** Registry of async resolvers from registered packages. */\n private resolverRegistry = new ResolverRegistry();\n\n /**\n * Per-package record of contributions made to the SHARED registries\n * (this engine's variable resolver / resolver namespaces), so\n * {@link unregisterPackage} can reverse them. Keyed by package name.\n */\n private packageContributions = new Map<string, {\n pluginFunctionIndices: number[];\n variableSources: import(\"@solve-js/variables/IVariableSource\").IVariableSource[];\n resolverNamespaces: string[];\n tokenCategories: string[];\n lexerVocabulary: LexerVocabulary | undefined;\n asConverterNames: string[];\n normalizerRuleNames: string[];\n }>();\n\n /**\n * The actual `IEnginePackage` descriptor of every package currently\n * registered on this engine instance, keyed by name, separate from\n * {@link packageContributions} (which tracks what was WRITTEN into\n * shared registries, not the original descriptor). Used by\n * {@link registerPackage}'s automatic `checkPackageCompatibility()` call\n *. See `api/PackageCompatibility.ts`'s module doc for why this exists.\n */\n private registeredPackages = new Map<string, IEnginePackage>();\n\n /**\n * The `DocumentModel` this engine is currently evaluating, if any\n * `null` for a bare engine with no document (e.g. anything only ever\n * calling `evaluateExpression()`). `ExpressionEngine` doesn't own its\n * `DocumentModel` (`ThreeTierEvaluator` constructs and owns both as\n * siblings). This is set once, via {@link setDocumentModel}, purely so\n * {@link makeLineContext} can answer \"what's line N's cached result\"\n * for cross-line features (`prev`/`line<N>`/aggregation. See\n * `packages/lines/`) without the engine needing to own document\n * lifecycle itself.\n */\n private documentModel: DocumentModel | null = null;\n\n /**\n * Called once by `ThreeTierEvaluator`'s constructor. Not part of the\n * public evaluate-a-document contract, purely internal wiring so\n * {@link makeLineContext} has something to read from.\n */\n setDocumentModel(doc: DocumentModel | null): void {\n this.documentModel = doc;\n }\n\n /**\n * Build the {@link LineExecutionContext} passed to `executeBytecode()`\n * for a given line. `lineNumber = -1` (the existing sentinel\n * `evaluateExpression()`/`evaluateLine(-1, ...)` already use for \"no\n * real document\") naturally produces a context with both closures\n * `undefined`, a cross-line plugin function must check for that itself\n * and return a clear error, never assume line 0 exists.\n */\n private makeLineContext(lineNumber: number): LineExecutionContext {\n const doc = this.documentModel;\n return {\n lineIndex: lineNumber,\n getLineResult: doc ? (n: number) => doc.getLineAt(n)?.result ?? undefined : undefined,\n isLineBoundary: doc\n ? (n: number) => {\n const state = doc.getLineAt(n);\n if (!state) return true; // out of range counts as a boundary — nothing to aggregate past it\n return state.isEmpty || /^\\s*#/.test(state.text);\n }\n : undefined,\n };\n }\n\n /**\n * Package-contributed completion candidates (`IEnginePackage.completionItems`),\n * keyed by package name, engine-instance-local, not a shared registry\n * (unlike tokenCategories), so no separate register/unregister module is\n * needed: registerPackage()/unregisterPackage() just set/delete the\n * package's own entry. {@link getPackageCompletionItems} flattens it.\n */\n private packageCompletionItems = new Map<string, CompletionItem[]>();\n\n /**\n * Keystroke-level AbortSignal, set by the UI layer (MarkdownEditorViewPlugin)\n * before each evaluation. When the user types a new keystroke, the old signal\n * is aborted, causing all in-flight async work (fetches, preflight checks,\n * batcher flushes) to be canceled atomically.\n *\n * executeAndStore() and executeRaw() link their local AbortControllers to\n * this signal so that when the keystroke changes, all per-evaluation controllers\n * are aborted together.\n */\n private keystrokeSignal: AbortSignal | null = null;\n\n /**\n * Micro-batcher that collapses multiple async resolutions into a single\n * DAG walk + re-evaluation pass. Replaces the old single-callback pattern.\n */\n private batcher: AsyncResolutionBatcher;\n /** Post-lexer token normalizer for phrase fusion, implicit multiply, etc. */\n private normalizer: TokenNormalizer;\n /** TanStack Query client, injected into resolvers for cache reads/writes. */\n readonly queryClient: QueryClient;\n // Bytecode cache, avoids re-parsing identical expressions.\n // Bounded by config.performance.defaultCacheSize: when full, the oldest\n // entry (Map insertion order) is evicted so unique expressions across a\n // long session can't grow memory unboundedly.\n private bytecodeCache: Map<string, BytecodeProgram> = new Map();\n\n /**\n * Insert into the bytecode cache, evicting the oldest entry when full.\n *\n * Bug fix (found during release hardening): this used to check against\n * a hardcoded `BYTECODE_CACHE_MAX_ENTRIES = 2000` constant that never\n * read `config.performance.defaultCacheSize`, despite that field being\n * documented (see `EngineConfig`'s JSDoc example) as exactly this knob.\n * A host raising `defaultCacheSize` for large documents had zero effect;\n * every document beyond ~2000 unique expressions per line silently lost\n * the bytecode-cache benefit on re-evaluation regardless of config.\n */\n private cacheBytecode(expression: string, program: BytecodeProgram): void {\n const maxEntries = this.config.performance.defaultCacheSize;\n if (this.bytecodeCache.size >= maxEntries) {\n const oldest = this.bytecodeCache.keys().next().value;\n if (oldest !== undefined) {\n this.bytecodeCache.delete(oldest);\n }\n }\n this.bytecodeCache.set(expression, program);\n }\n // Pre-allocated BytecodeBuilder pool\n private builderPool: BytecodeBuilder[] = [\n new BytecodeBuilder(),\n new BytecodeBuilder(),\n new BytecodeBuilder(),\n new BytecodeBuilder(),\n ];\n // Index into the builder pool, incremented modulo pool size.\n private builderPoolIndex = 0;\n // Most recent pipeline telemetry, populated when AllocationTracker.isEnabled().\n private lastTelemetry: PipelineTelemetry | null = null;\n\n //#endregion\n\n //#region Constructor\n constructor(\n localeCode = \"en\",\n diagnosticMode = false,\n config?: Partial<typeof DEFAULT_CONFIG>,\n diagnosticPipeline?: DiagnosticPipeline,\n packages?: IEnginePackage[]\n ) {\n this.localeCode = localeCode;\n // Per-section merge, not a top-level shallow spread, overriding one\n // field of a section (e.g. `{ performance: { defaultCacheSize: 500 } }`)\n // used to silently replace the WHOLE section, dropping every other\n // field in it back to `undefined` instead of keeping its default.\n this.config = mergeEngineConfig(DEFAULT_CONFIG, config ?? {});\n this.lexer = new Lexer(localeCode, buildTokenLookup(localeCode));\n this.registry = new ParseletRegistry();\n // Before the package loop below, which registers plugin functions into it.\n this.context = createEngineContext();\n\n// Wire diagnostic pipeline: use provided, create timeline if enabled, or leave empty for production\n if (diagnosticPipeline) {\n this.diagnosticPipeline = diagnosticPipeline;\n } else if (diagnosticMode) {\n this.diagnosticPipeline = new DiagnosticPipeline();\n this.timelineCollector = new TimelineDiagnosticCollector();\n this.diagnosticPipeline.register(this.timelineCollector);\n } else {\n this.diagnosticPipeline = new DiagnosticPipeline();\n // Production: no collectors, pipeline length-check exits immediately with zero overhead\n }\n\n // Register providers via IEnginePackage data.\n // Defaults to BUILTIN_PACKAGES (all built-in providers). Callers can\n // pass a filtered subset via the `packages` constructor parameter to\n // selectively include/exclude specific providers (e.g., omit dice or\n // vector support for a calculator-only engine).\n // Each package's parselets go into the engine's isolated registry\n // (not sharedParseletRegistry), lexer plugins into the engine's\n // isolated lexer, and opcode/variable handlers into shared registries.\n\n // ── Create normalizer BEFORE package registration ──\n // Packages may register phrases and normalizer rules, so the normalizer\n // must exist before registerPackage() is called.\n this.normalizer = new TokenNormalizer();\n\n // Register built-in phrases into the PhraseTrie, single-pass\n // O(depth) matching per position instead of separate rule scans.\n for (const [phrase, tokenType] of Object.entries(BUILTIN_PHRASES)) {\n this.normalizer.addPhrase(phrase, tokenType);\n }\n\n // Register built-in normalizer rules (implicit multiply, etc.)\n // Pass the trie's canStart predicate so the implicit multiply rule\n // stays in sync with package-registered phrases.\n this.normalizer.register(implicitMultiplyRule(\n 50,\n (word) => this.normalizer.canStartPhrase(word),\n ));\n\n const pkgList = packages ?? BUILTIN_PACKAGES;\n for (const pkg of pkgList) {\n // Per-package containment: registerPackage() can throw (a\n // lexerVocabulary keyword/operator/unit colliding with a\n // built-in one, ExpressionLexer.registerVocabulary()'s hard\n // guard, the one sub-registration in registerPackage() that\n // isn't already \"warn and proceed\"). Unguarded, that throw used\n // to escape the constructor itself: every package after the\n // offender in pkgList never got registered, `new\n // ExpressionEngine(...)` never returned an instance, and\n // whatever THIS package or earlier ones already wrote into\n // shared module-level registries (pluginFunctionRegistry,\n // TokenCategoryMap, asConverterRegistry)\n // had no owning engine instance left to call\n // unregisterPackage() and clean it up. Same containment shape\n // as AsyncResolutionBatcher.reExecuteMainThread()'s fatal-bug\n // fix: one bad package (most likely a third-party one passed via\n // the `packages` constructor param, not a built-in) is skipped\n // with a clear, verbose error instead of taking the whole engine\n // down.\n try {\n this.registerPackage(pkg);\n } catch (e) {\n const engineError = normalizeUnknownError(e);\n console.error(\n `[ExpressionEngine] Failed to register package \"${pkg.name}\" — skipping it and continuing ` +\n `construction with the remaining packages: ${engineError.format()}`\n );\n }\n }\n\n this.parser = new PrecedenceParser(this.registry, this.config.validation.maxNestingDepth, localeCode);\n this.vm = createVM(\n this.context.opRegistry,\n this.config.vm.maxStackDepth,\n this.config.vm.maxInstructions,\n undefined,\n this.config.vm.maxCollectionSize,\n this.config.vm.maxAllocatedElements,\n this.config.vm.maxFunctionCalls,\n this.config.date.maxOffsetYears,\n this.config.date.minOffsetYears,\n this.context,\n );\n this.queryClient = createQueryClient();\n this.batcher = new AsyncResolutionBatcher(this.dag, this.lineCache, this.vm);\n\t}\n\n //#endregion\n\n //#region Public API, Event stream\n\n /**\n * Get the native event stream from the batcher for stream-based consumers.\n *\n * Use this instead of `addAsyncListener()` when you need:\n * - **Backpressure**: the stream buffers up to `highWaterMark` events;\n * when full, `enqueue()` blocks until the consumer reads, preventing\n * unbounded memory growth.\n * - **Cancellation**: call `reader.cancel()` or pass an `AbortSignal` to\n * `pipeTo()` to stop receiving events.\n * - **Piping**: use `stream.pipeTo(writable)` or `stream.pipeThrough(transform)`\n * to build a reactive pipeline.\n * - **Teeing**: use `stream.tee()` to serve multiple independent consumers.\n *\n * @returns A {@link ReadableStream} that emits {@link AsyncResolutionEvent}\n * items as the batcher processes async resolutions.\n */\n getEventStream(): ReadableStream<AsyncResolutionEvent> {\n return this.batcher.getEventStream();\n }\n\n /**\n * Get the batcher instance (for test infrastructure).\n *\n * Tests use this to access `batcher._testCaptures` for synchronous\n * event observation without async stream reader timing issues.\n */\n getBatcher(): AsyncResolutionBatcher {\n return this.batcher;\n }\n\n //#endregion\n\n //#region Public API, Package registration\n\n /**\n * Register a package with the engine's isolated registries.\n *\n * Handles all IEnginePackage fields:\n * - `lexerVocabulary` → engine's isolated lexer (via this.lexer.registerVocabulary)\n * - `prefixParselets` → engine's isolated ParseletRegistry\n * - `infixParselets` → engine's isolated ParseletRegistry\n * - `variableSources` → this engine's own variable resolver\n *\n * Built-in packages (ARITHMETIC, FUNCTION, UOM, etc.) are registered\n * via this method during construction. External user packages can also\n * use this method for data-driven registration.\n *\n * @param pkg - The package to register.\n */\n registerPackage(pkg: IEnginePackage): void {\n // Engine-vs-package version gating, checked FIRST, before the\n // duplicate-name guard below. Unlike checkPackageCompatibility()\n // further down (package-vs-package, always advisory, never blocks\n // ARCHITECTURE.md §5.2), an unsatisfied or malformed engineVersion is\n // a hard rejection: throwing here means re-registering an\n // incompatible REPLACEMENT for an already-working package never\n // unregisters the old one first, the engine is never left with\n // neither version registered. See ARCHITECTURE.md §5.3 and\n // api/EngineVersionCompatibility.ts.\n assertEngineVersionCompatible(pkg);\n\n // Guard against double-registration under the same name: without\n // this, a second registerPackage() call for the same pkg.name would\n // overwrite packageContributions' tracked record for the FIRST\n // registration, permanently orphaning its shared-registry\n // contributions (pluginFunctionRegistry entries, variable sources,\n // resolver namespaces, token categories), unreachable and\n // unreversible for the engine's lifetime, since those are shared\n // module-level registries. Mirrors ResolverRegistry.register()'s\n // existing \"destroy old, warn, replace\" pattern for the same class\n // of problem at the resolver-namespace level.\n if (this.packageContributions.has(pkg.name)) {\n console.warn(\n `[ExpressionEngine] Package \"${pkg.name}\" is already registered. ` +\n `Unregistering the previous registration before re-registering.`,\n );\n this.unregisterPackage(pkg.name);\n }\n\n // Load-up resiliency: statically compare this package's declared\n // fields against every OTHER package already on this engine, before\n // touching any shared registry. See api/PackageCompatibility.ts's\n // module doc for the full reasoning and the real bug that motivated\n // it. Non-fatal (matches this codebase's established \"warn and\n // proceed\" convention for collisions elsewhere, ParseletRegistry\n // asConverterRegistry) even for \"error\"-severity conflicts, since a\n // host may have a deliberate reason to accept a collision; the\n // point is making it IMPOSSIBLE to miss, not blocking registration.\n const compatibility = checkPackageCompatibility(pkg, [...this.registeredPackages.values()]);\n for (const conflict of compatibility.conflicts) {\n const log = conflict.severity === \"error\" ? console.error : console.warn;\n log(`[ExpressionEngine] Package compatibility ${conflict.severity} (${conflict.kind}): ${conflict.detail}`);\n }\n\n // Track shared-registry contributions so unregisterPackage() can\n // reverse them. Isolated per-engine registrations (parselets,\n // phrases) die with the engine and don't need tracking. lexerVocabulary\n // IS tracked (unlike before) so its custom keyword/operator token\n // types can be reverted via ExpressionLexer.unregisterVocabulary()\n // previously that method existed and worked correctly but was never\n // called from here, leaving a package's lexer contribution live\n // after \"unregistering\" it. tokenCategories is tracked the same way.\n //\n // normalizerRuleNames is tracked even though the normalizer is\n // per-engine, because unlike phrases these do NOT die with the engine\n // in any useful sense: a phrase goes into a text-keyed trie and\n // registering it twice is idempotent, whereas a rule is pushed onto an\n // array, so a host re-registering a package on every settings change\n // accumulated one more copy of every rule each time and the normalizer\n // tried all of them at every token position for the rest of the\n // engine's life.\n const contribution = {\n pluginFunctionIndices: [] as number[],\n variableSources: [] as import(\"@solve-js/variables/IVariableSource\").IVariableSource[],\n resolverNamespaces: [] as string[],\n tokenCategories: [] as string[],\n lexerVocabulary: pkg.lexerVocabulary,\n asConverterNames: [] as string[],\n normalizerRuleNames: [] as string[],\n };\n\n // Only lexerVocabulary can throw here (built-in keyword/operator/unit\n // collision, ExpressionLexer.registerVocabulary()'s hard guard)\n // every other sub-registration below is already \"warn and proceed\".\n // Deliberately done BEFORE registeredPackages/packageContributions\n // are recorded (see below) so a throw here leaves no phantom\n // entry, the caller's try/catch (registerPackage() itself still\n // throws for a single bad package; ExpressionEngine's constructor\n // catches per-package so one bad package can't take down engine\n // construction, see that loop's own comment) sees a package that\n // registered NOTHING, not a partially-registered one.\n if (pkg.lexerVocabulary) {\n this.lexer.registerVocabulary(pkg.lexerVocabulary);\n }\n if (pkg.prefixParselets) {\n for (const pp of pkg.prefixParselets) {\n this.registry.registerPrefix(pp.tokenType, pp.parselet);\n }\n }\n if (pkg.infixParselets) {\n for (const ip of pkg.infixParselets) {\n this.registry.registerInfix(ip.tokenType, ip.parselet);\n }\n }\n if (pkg.pluginFunctions) {\n for (const pf of pkg.pluginFunctions) {\n this.context.pluginFunctions[pf.index] = pf.handler;\n this.context.pluginFunctionOwners[pf.index] = pkg.name;\n contribution.pluginFunctionIndices.push(pf.index);\n }\n }\n if (pkg.variableSources) {\n for (const vs of pkg.variableSources) {\n this.context.variableResolver.registerSource(vs);\n contribution.variableSources.push(vs);\n }\n }\n if (pkg.asyncResolvers) {\n for (const resolver of pkg.asyncResolvers) {\n this.resolverRegistry.register(resolver);\n contribution.resolverNamespaces.push(resolver.namespace);\n }\n }\n if (pkg.phrases) {\n for (const [phrase, tokenType] of Object.entries(pkg.phrases)) {\n this.normalizer.addPhrase(phrase, tokenType);\n }\n }\n if (pkg.normalizerRules) {\n for (const rule of pkg.normalizerRules) {\n this.normalizer.register(rule);\n contribution.normalizerRuleNames.push(rule.name);\n }\n }\n if (pkg.tokenCategories) {\n for (const [tokenType, category] of Object.entries(pkg.tokenCategories)) {\n registerTokenCategory(tokenType, category);\n contribution.tokenCategories.push(tokenType);\n }\n }\n if (pkg.completionItems) {\n this.packageCompletionItems.set(pkg.name, pkg.completionItems);\n }\n if (pkg.asConverters) {\n for (const [name, handler] of Object.entries(pkg.asConverters)) {\n registerAsConverter(name, handler);\n contribution.asConverterNames.push(name);\n }\n }\n\n this.packageContributions.set(pkg.name, contribution);\n // Recorded LAST, only once every sub-registration above actually\n // succeeded. If this ran up front (as it used to), a mid-function\n // throw from lexerVocabulary would leave a phantom entry: callers\n // checking registeredPackages.has(pkg.name) would see \"registered\"\n // for a package that contributed nothing.\n this.registeredPackages.set(pkg.name, pkg);\n }\n\n /**\n * Unregister a package previously registered via {@link registerPackage}.\n *\n * Reverses the package's contributions to the SHARED registries, plugin\n * functions (pluginFunctionRegistry), variable sources\n * (this engine's variable resolver), async resolvers, and now\n * token highlight categories (TokenCategoryMap), which registerPackage\n * wrote into process-wide state. Also reverts\n * the package's lexer plugin (custom keyword/operator token types\n * revert to generic IDENT/ERROR, matching ExpressionLexer.unregisterVocabulary()'s\n * own contract). This engine-instance-local registration is reversed\n * here too, even though it isn't a \"shared\" registry, so a package's\n * lexer and highlighting contributions clean up together rather than\n * only half-reversing on unregister. Normalizer rules are reversed here\n * for the same reason: they are per-engine, but they live in an ARRAY the\n * normalizer walks at every token position, so re-registering a package\n * appended a second copy of every rule and lexing got slower with every\n * register/unregister cycle.\n *\n * Per-engine parselets and phrases are still left in place: a parselet\n * lives in this engine's isolated registry and a phrase goes into a\n * text-keyed trie where registering the same phrase twice is the same as\n * registering it once, so neither accumulates and both are discarded with\n * the engine instance.\n *\n * Clears the bytecode cache, removing handlers changes what compiled\n * bytecode is valid.\n *\n * @param packageName - The `name` the package was registered under.\n * @returns true if the package was found and unregistered.\n */\n unregisterPackage(packageName: string): boolean {\n const contribution = this.packageContributions.get(packageName);\n if (!contribution) return false;\n\n for (const index of contribution.pluginFunctionIndices) {\n delete this.context.pluginFunctions[index];\n delete this.context.pluginFunctionOwners[index];\n }\n for (const vs of contribution.variableSources) {\n this.context.variableResolver.unregisterSource(vs);\n }\n for (const namespace of contribution.resolverNamespaces) {\n this.resolverRegistry.unregister(namespace);\n }\n for (const tokenType of contribution.tokenCategories) {\n unregisterTokenCategory(tokenType);\n }\n if (contribution.lexerVocabulary) {\n this.lexer.unregisterVocabulary(contribution.lexerVocabulary);\n }\n for (const name of contribution.asConverterNames) {\n unregisterAsConverter(name);\n }\n for (const ruleName of contribution.normalizerRuleNames) {\n this.normalizer.unregister(ruleName);\n }\n this.packageCompletionItems.delete(packageName);\n\n this.packageContributions.delete(packageName);\n this.registeredPackages.delete(packageName);\n this.bytecodeCache.clear();\n return true;\n }\n\n //#endregion\n\n //#region Public API, Configuration & accessors\n\n /**\n * Get the effective engine configuration currently in use.\n * Includes all defaults merged with any constructor overrides.\n * Useful for introspection, lets consumers see what values are actually\n * in effect after merging with DEFAULT_CONFIG.\n */\n getConfig(): EngineConfig {\n return { ...this.config };\n }\n\n /**\n * Get the underlying diagnostic pipeline for advanced usage.\n */\n getDiagnosticPipeline(): DiagnosticPipeline {\n return this.diagnosticPipeline;\n }\n\n //#endregion\n\n //#region Internal, Execution helpers\n\n /**\n * Store a result in the line cache (with DAG registration).\n * Extracted common pattern from 8 call sites.\n */\n private storeLineResult(\n lineNumber: number,\n result: Value,\n program: BytecodeProgram,\n reads: string[],\n writes: string[],\n expression: string,\n ): void {\n this.lineCache.set(lineNumber, new LineCacheEntry(\n result,\n program,\n reads,\n writes.length > 0 ? writes[0] : null\n ), expression);\n }\n\n /**\n * Execute bytecode and handle the result.\n *\n * Replaces ALL 5 try/catch blocks that previously caught AsyncSuspenseError.\n * Now that executeBytecode returns an EvalResult discriminated union,\n * we simply check result.type instead of catching errors.\n *\n * Sets up AbortController → VM for stale-data prevention.\n * Cleans up the VM stack after execution (success or pending).\n * Fires async resolution via fire-and-forget for pending results.\n *\n * `tracePipeline`/`traceExpression`, when given, are passed straight\n * through to `executeBytecode()`'s own optional VM-step-tracing\n * parameters, used ONLY by {@link evaluateExpressionWithDiagnostic}\n * when `vmTraceEnabled` is on. Omitted by every other caller, with zero\n * behavior change (identical to today's hardcoded `undefined, undefined`).\n */\n private executeAndStore(\n program: BytecodeProgram,\n lineNumber: number,\n expression: string,\n reads: string[],\n writes: string[],\n packageId: string,\n tracePipeline?: DiagnosticPipeline,\n traceExpression?: string,\n ): Value {\n const stackBefore = this.vm.getStack().length;\n\n // Set up AbortController for this evaluation.\n // When the user edits the line before resolution, the old controller\n // is aborted, preventing stale data from surfacing.\n const controller = new AbortController();\n // ── Link to keystroke signal (One AbortController Per Keystroke) ──\n // When the user types a new keystroke, the keystrokeController is aborted,\n // which in turn aborts this local controller, canceling all in-flight\n // async work for this specific evaluation.\n const abortLocal = () => controller.abort();\n this.keystrokeSignal?.addEventListener('abort', abortLocal, { once: true });\n\n abortLogger.localControllerCreated(\"executeAndStore\");\n if (this.keystrokeSignal) {\n abortLogger.signalLinked(\"executeAndStore\");\n }\n\n this.vm.activeSignal = controller.signal;\n this.vm.abortCurrent = () => {\n abortLogger.signalUnlinked(\"executeAndStore\");\n this.keystrokeSignal?.removeEventListener('abort', abortLocal);\n controller.abort();\n };\n\n setActiveQueryClient(this.queryClient);\n const result = executeBytecode(program, this.vm, tracePipeline, traceExpression, this.makeLineContext(lineNumber));\n\n // Single stack cleanup (replaces 10 occurrences)\n while (this.vm.getStack().length > stackBefore) {\n this.vm.pop();\n }\n\n if (result.type === 'pending') {\n // Fire-and-forget async resolution.\n // The keystroke listener stays attached while the async work is\n // in flight so a new keystroke can still cancel it.\n void this.resolveAsync(result);\n\n // Register data source dependency in DAG for re-evaluation tracking\n this.dag.registerLineDataSourceDependency(\n lineNumber,\n result.packageId || packageId,\n [result.queryKey]\n );\n\n const pending = pendingValue(result.queryKey);\n this.storeLineResult(lineNumber, pending, program, reads, writes, expression);\n return pending;\n }\n\n if (result.type === 'error') {\n this.keystrokeSignal?.removeEventListener('abort', abortLocal);\n throw result.error;\n }\n\n // Success path, execution finished synchronously, so unhook the\n // keystroke listener now. Without this, one listener per evaluated\n // line accumulates on the keystroke signal for large documents.\n this.keystrokeSignal?.removeEventListener('abort', abortLocal);\n\n this.dag.registerLine(lineNumber, reads, writes);\n this.storeLineResult(lineNumber, result.value, program, reads, writes, expression);\n return result.value;\n }\n\n /**\n * Execute bytecode and return the raw EvalResult without DAG/LineCache updates.\n * Used by reEvaluateLine, executeCached, and evaluateIncremental which\n * manage their own cache state differently.\n *\n * @param lineNumber - 1-based line this bytecode belongs to, for\n * cross-line features (`prev`/`line<N>`/aggregation. See\n * `makeLineContext()`). Defaults to -1 (the existing \"no real\n * document\" sentinel) for any caller that doesn't have a real line\n * number to pass.\n */\n private executeRaw(program: BytecodeProgram, lineNumber: number = -1): EvalResult {\n const stackBefore = this.vm.getStack().length;\n\n const controller = new AbortController();\n // ── Link to keystroke signal (One AbortController Per Keystroke) ──\n const abortLocal = () => controller.abort();\n this.keystrokeSignal?.addEventListener('abort', abortLocal, { once: true });\n\n abortLogger.localControllerCreated(\"executeRaw\");\n if (this.keystrokeSignal) {\n abortLogger.signalLinked(\"executeRaw\");\n }\n\n this.vm.activeSignal = controller.signal;\n this.vm.abortCurrent = () => {\n abortLogger.signalUnlinked(\"executeRaw\");\n this.keystrokeSignal?.removeEventListener('abort', abortLocal);\n controller.abort();\n };\n\n setActiveQueryClient(this.queryClient);\n const result = executeBytecode(program, this.vm, undefined, undefined, this.makeLineContext(lineNumber));\n\n // Stack cleanup\n while (this.vm.getStack().length > stackBefore) {\n this.vm.pop();\n }\n\n // Sync completion, unhook the keystroke listener to prevent\n // per-evaluation listener accumulation. Pending results keep the\n // listener so in-flight async work stays cancellable.\n if (result.type !== 'pending') {\n this.keystrokeSignal?.removeEventListener('abort', abortLocal);\n }\n\n return result;\n }\n\n /**\n * Fire-and-forget async resolution using async/await.\n *\n * On resolution or error:\n * 1. Checks AbortSignal, if aborted, stale data is discarded.\n * 2. Stores result/error in AsyncResultCache (per-package scoped).\n * 3. Defers re-evaluation to AsyncResolutionBatcher which collapses\n * multiple resolutions into a single DAG walk + re-execution pass\n * and fires typed events to all listeners.\n */\n private async resolveAsync(pending: Extract<EvalResult, { type: 'pending' }>): Promise<void> {\n const { queryKey, resolver, packageId, signal } = pending;\n const effectivePackageId = packageId || '_engine';\n\n // TanStack Query handles dedup + caching automatically via fetchQuery().\n // We just await the resolver and dispatch to the batcher on completion.\n\n try {\n // The resolved value is not needed here, only the fact that it\n // settled: the batcher re-reads it from the cache on re-evaluation.\n await resolver;\n if (signal.aborted) {\n abortLogger.staleDataDiscarded(queryKey, \"signal aborted after resolve\");\n return;\n }\n // Defer re-evaluation to batcher (collapsed across microtask).\n this.batcher.add({\n queryKey,\n packageId: effectivePackageId,\n signal,\n isError: false,\n });\n } catch (err) {\n if (signal.aborted) {\n abortLogger.staleDataDiscarded(queryKey, \"signal aborted after error\");\n return;\n }\n const error = err instanceof Error ? err : new Error(String(err));\n this.batcher.add({\n queryKey,\n packageId: effectivePackageId,\n signal,\n isError: true,\n error,\n });\n }\n }\n\n //#endregion\n\n //#region Public API, Document parsing\n\n /**\n * Unified parsing method that handles different input types and returns comprehensive results\n * with precise coordinate mapping for inline solves.\n */\n parseDocument(input: string, options: UnifiedParsingOptions = { inputType: 'markdown' }): ParsingResult {\n // Refused before the scan rather than during it. Every limit above this\n // one bounds what a single LINE may ask for, and a document's cost is\n // its line count whatever the lines say: two hundred thousand lines of\n // `1 + 1` exhausted the heap on the per-line records alone, which is a\n // process abort no host can catch. See\n // `constants/Configuration.ts`'s `performance.maxDocumentLines`.\n const maxLines = this.config.performance.maxDocumentLines;\n if (countLines(input, maxLines) > maxLines) {\n throw ErrorFactory.execution(\n \"DOCUMENT_TOO_LARGE\",\n `This document has more than ${maxLines.toLocaleString(\"en-US\")} lines, which is the most the engine will process in one pass`,\n { maxLines },\n );\n }\n // Scan the entire document in a single pass, bypasses the old\n // split('\\n') → evaluateLines() → join('\\n') → scanDocument()\n // roundtrip. scanDocument() classifies and tokenizes all lines\n // character-by-character with a single Lexer.reset().\n const scanResults = this.lexer.scanDocument(input);\n const processedLines = this.processScanResults(scanResults);\n\n const result: ParsingResult = {\n lines: processedLines,\n totalLines: processedLines.length,\n errors: [],\n };\n\n // Collect errors from processed lines\n for (const line of processedLines) {\n if (line.error) {\n result.errors.push(`Line ${line.lineNumber}: ${line.error}`);\n }\n for (const solve of line.inlineSolves) {\n if (solve.error) {\n result.errors.push(`Line ${line.lineNumber}: ${solve.error}`);\n }\n }\n }\n\n const includeDiagnostics = options.includeDiagnostics ?? false;\n if (includeDiagnostics) {\n const reports = this.diagnosticPipeline.collectReports();\n if (reports.length > 0) {\n result.diagnostics = reports[0].toJSON();\n }\n }\n\n return result;\n }\n\n /**\n * Batch-evaluate an array of lines in a single pass.\n *\n * Uses scanDocument() to classify and tokenize all lines in a single\n * character-by-character walk through the re-joined document text.\n * This eliminates the per-line Lexer.reset() + classifyLine() +\n * findInlineSolvesInLine() overhead from the old three-pass approach.\n *\n * Tokenization results from scanDocument() are passed directly to the\n * parser via evaluateLineWithPreTokenized(), skipping re-lexing.\n */\n /**\n * Batch-evaluate an array of lines in a single pass.\n *\n * Primarily used by tests. For production, prefer parseDocument()\n * which calls scanDocument() directly on the raw document string,\n * bypassing the split→join roundtrip that this method performs.\n */\n evaluateLines(lines: string[]): ParsedLine[] {\n // Rejoin lines and scan in a single pass, scanDocument() handles\n // classification + tokenization for all lines in one character walk.\n const documentText = lines.join('\\n');\n const scanResults = this.lexer.scanDocument(documentText);\n return this.processScanResults(scanResults);\n }\n\n /**\n * Process pre-scanned line results into ParsedLine objects.\n *\n * Shared by parseDocument() (which scanDocuments the raw input) and\n * evaluateLines() (which scanDocuments joined line arrays). Handles\n * inline solve extraction, variable assignment detection, and\n * expression evaluation for each non-skipped line.\n */\n private processScanResults(scanResults: ScanLineResult[]): ParsedLine[] {\n const result: ParsedLine[] = [];\n\n for (const scanResult of scanResults) {\n const lineText = scanResult.text;\n const lineNumber = scanResult.lineNumber;\n const startPosition = scanResult.startOffset;\n const endPosition = scanResult.endOffset;\n const isEmpty = scanResult.classification.skip;\n const inlineSolves: InlineSolvePosition[] = scanResult.inlineSolves.map(s => ({\n start: s.start,\n end: s.end,\n expression: s.expression,\n lineNumber,\n columnNumber: s.columnNumber,\n }));\n const hasInlineSolves = inlineSolves.length > 0;\n\n const parsedLine: ParsedLine = {\n lineNumber,\n text: lineText,\n startPosition,\n endPosition,\n isEmpty,\n hasInlineSolves,\n inlineSolves,\n expression: null,\n result: null,\n error: null,\n };\n\n if (!isEmpty) {\n const isVariableAssignment = lineText.trim().startsWith(':');\n\n if (hasInlineSolves && !isVariableAssignment) {\n for (const solve of inlineSolves) {\n try {\n const values = this.evaluateLine(lineNumber, solve.expression);\n solve.result = values[0];\n } catch (error) {\n const errorMessage = error instanceof Error ? error.message : String(error);\n solve.error = errorMessage;\n }\n }\n } else {\n const expression = lineText.trim();\n if (expression) {\n // Pass pre-tokenized tokens from scanDocument to avoid re-lexing\n try {\n const values = this.evaluateLineWithPreTokenized(\n lineNumber,\n expression,\n scanResult.tokens\n );\n parsedLine.expression = expression;\n parsedLine.result = values[0];\n } catch (error) {\n const errorMessage = error instanceof Error ? error.message : String(error);\n parsedLine.error = errorMessage;\n }\n }\n }\n }\n\n result.push(parsedLine);\n }\n\n return result;\n }\n\n /**\n * Evaluate a line using pre-tokenized tokens from scanDocument().\n *\n * Skips the lexing step entirely, the tokens are already available\n * from the document-level scan. Only parsing, compilation, and\n * execution are performed.\n *\n * This is the production fast path for evaluateLines(). Note: this\n * path intentionally bypasses the diagnostic pipeline. For diagnostic\n * events, use evaluateExpressionWithDiagnostic() directly.\n */\n private evaluateLineWithPreTokenized(\n lineNumber: number,\n expression: string,\n preTokenized: Token[]\n ): Value[] {\n // Filter markdown tokens as a defensive safety net.\n // ExpressionLexer never produces MD_* tokens, but this guard\n // prevents accidental breakage if the lexer mode changes.\n const tokens: Token[] = [];\n let hasParens = false;\n for (const t of preTokenized) {\n if (t.type === \"LPAREN\" || t.type === \"RPAREN\") hasParens = true;\n tokens.push(t);\n }\n\n // Directly invoke evaluateWithTokens, no lexing needed\n return [this.evaluateWithTokens(lineNumber, expression, tokens, hasParens)];\n }\n\n //#endregion\n\n //#region Internal, Parsing & compilation\n\n /**\n * Route parse+compile to the active parser (PrecedenceParser or Recursive Descent).\n *\n * Sets up the builder on the active parser, loads tokens, and calls\n * parseExpression(). Abstracts the API difference between the two parsers:\n * - PrecedenceParser: parser.setBuilder(builder); parser.parseExpression(0)\n * - RD: parser.builder = builder; parser.parseExpression(0)\n *\n * @param allowLabelFallback - Whether a line that does not parse whole may\n * be retried as \"&lt;label&gt;: &lt;expression&gt;\". True for a real line, false for\n * the retries that fallback makes itself, which is what stops it costing\n * exponential time; see the loop below, and the comment on its recursive\n * call for the measurement.\n */\n private parseExpression(builder: BytecodeBuilder, tokens: Token[], hasParens?: boolean, allowLabelFallback = true): void {\n this.parser.setBuilder(builder);\n // When autoBalanceParens is disabled, skip the O(n) paren-count scan\n // by always passing false, the parser will fail naturally on unmatched\n // parens instead of silently inserting missing closing/opening tokens.\n this.parser.load(tokens, this.config.validation.autoBalanceParens ? hasParens : false);\n this.parser.parseExpression(0);\n\n // parseExpression() stops as soon as it has one complete top-level\n // expression, it never checked whether that consumed the WHOLE\n // token list. Any leftover tokens (a stray trailing number, an\n // unconsumed comma-and-digits from a malformed \"thousands\"-looking\n // literal, a typo'd second operand with a missing operator, ...)\n // were silently discarded rather than surfaced: \"5 3\" evaluated to\n // a confident \"5\", \"1,2345\" to a confident \"1\", with no indication\n // anything was wrong. Requiring full consumption turns every one\n // of those into a real, visible parse error instead.\n const leftover = this.parser.peek();\n if (leftover) {\n // A single trailing bare \"=\" with nothing after it (e.g.\n // \"355/113=\") is tolerated rather than treated as an error.\n // EQUALS is never registered as an infix operator anywhere in\n // this grammar (confirmed, nothing consumes it after a\n // complete expression), so it can't be a legitimate second\n // operand or a typo'd continuation the way a stray number or\n // identifier could be; it's an unambiguous \"show the result\"\n // marker familiar from pocket calculators and other apps in\n // this category (see GitHub issue #65). This is deliberately\n // narrower than tolerating arbitrary trailing tokens, which\n // would reopen the exact silently-wrong-answer bug this same\n // check was added to close (see this function's own doc\n // comment above).\n if (leftover.type === \"EQUALS\" && !this.parser.peekAt(1)) {\n return;\n }\n\n // Labeled-line fallback: \"<label>: <expression>\", e.g. \"pi\n // approximation: 355/113\" (see GitHub issue #65). Only\n // attempted once the whole-line parse has ALREADY failed, so\n // it can never change behavior for a line that already\n // worked. VALID clock times (\"9:30\"), lap times (\"03:04:05\"),\n // and \":name = value\" variable definitions all consume their\n // colon(s) internally during lexing and never produce a real\n // COLON token, confirmed directly against the token stream\n // not assumed, so this can't misfire on any of them. Only a\n // genuine COLON token past position 0 counts (position 0 is\n // reserved for the existing leading-colon variable syntax).\n //\n // The word VALID is load-bearing, and used not to be here. An\n // out-of-range clock time does leave a real COLON token behind,\n // which landed it in this fallback and had it answered with\n // whatever stood to the right of the colon: \"24:00\" answered 0,\n // \"9:60\" answered 60, \"100:5\" answered 5. Those are ordinary\n // things to type (\"24:00\" is a normal way to write the end of a\n // day, \"9:60\" is a normal typo) and every one of them came back\n // as a confident number with no hint that the time had been\n // thrown away, so the numeric case is now refused outright, see\n // the guard in the loop below.\n //\n // Tries every colon position from rightmost to leftmost, not\n // just the last one: a label can itself precede a\n // \":name = value\" definition (\"input value: :x = 5\"), whose\n // OWN leading colon would otherwise be the rightmost colon in\n // the line, slicing right after it strips the colon\n // VariableParselet needs to recognize a definition at all,\n // leaving a bare \"x = 5\" that fails to parse. Falling back to\n // the next colon to the left (\"value:\") keeps \":x = 5\" intact.\n for (let i = allowLabelFallback ? tokens.length - 1 : 0; i >= 1; i--) {\n if (tokens[i].type !== \"COLON\") continue;\n if (i + 1 >= tokens.length) continue;\n\n // Nothing but numbers to the left of the colon means this is\n // not a label at all: it is a time, a lap time or a timecode\n // that the normalizer refused to fuse because one of its\n // fields is out of range. A label is prose (\"pi\n // approximation:\", \"total:\"), and the labelled lines this\n // fallback exists for all have a word in front of the colon.\n // Reading \"24:00\" as the label \"24\" and the expression \"00\"\n // is never what was meant, so it is an error rather than an\n // answer.\n let labelIsAllNumeric = true;\n for (let j = 0; j < i; j++) {\n const type = tokens[j].type;\n if (type !== \"NUMBER\" && type !== \"COLON\") {\n labelIsAllNumeric = false;\n break;\n }\n }\n if (labelIsAllNumeric) {\n // Rebuilt from the tokens rather than sliced out of the\n // source, which this level does not have. Everything up\n // to and including the field after the colon, so\n // \"24:00 + 1\" names \"24:00\" and not the whole line.\n const literal = tokens.slice(0, i + 2).map((t) => t.value).join(\"\");\n throw ErrorFactory.parsing(\n \"INVALID_TIME_LITERAL\",\n `\"${literal}\" is not a valid time`,\n { tokenType: tokens[i].type, tokenValue: literal }\n );\n }\n\n builder.reset();\n try {\n // `false`: the retry gets a plain parse, with no fallback\n // of its own. It used to get the full one, and that made\n // this loop cost exponential time for no extra coverage.\n //\n // A retry on `tokens.slice(i + 1)` that ran its own\n // fallback would try the suffix after each colon j > i,\n // which is `tokens.slice(j + 1)`, which is a slice THIS\n // loop already tried on an earlier iteration, since it\n // walks rightmost-first and j > i. So every level below\n // the first re-attempted parses that had already failed,\n // and each of those levels re-attempted them again: a line\n // with k colons compiled 2^k times. Measured on a\n // 723-character fuzz case with 19 colons: 524,288 parse\n // attempts, 18 seconds, and then the line was REJECTED. A\n // host evaluating per keystroke froze for that long.\n //\n // Nothing is lost by cutting it. The suffixes the deeper\n // levels reached are exactly the ones this loop visits\n // itself, in the same rightmost-first order.\n this.parseExpression(builder, tokens.slice(i + 1), hasParens, false);\n return;\n } catch {\n // This colon's fragment didn't parse cleanly either\n // try the next one to the left before giving up.\n }\n }\n\n throw ErrorFactory.parsing(\n \"UNEXPECTED_TRAILING_TOKEN\",\n `Unexpected token after expression: \"${leftover.value}\"`,\n { tokenType: leftover.type, tokenValue: leftover.value }\n );\n }\n }\n\n //#region Symbolic algebra, `=>` and bare equation-statement grammar\n\n /**\n * Compiles a standalone token list into a fresh, independent\n * `BytecodeProgram`, used for a `=>`-triggered expression and for a\n * bare equation's own right-hand side. Reuses {@link parseExpression}\n * (the SAME \"compile a token list into a builder, then check for\n * leftover trailing tokens\" logic every ordinary line already goes\n * through), just with a throwaway builder instead of the pooled one\n * (this grammar is rare, a per-call allocation here is a non-issue).\n */\n private compileAdHoc(tokens: Token[]): BytecodeProgram {\n const builder = new BytecodeBuilder();\n this.parseExpression(builder, tokens);\n return builder.build();\n }\n\n /**\n * Executes an already-compiled program in symbolic-tolerant mode (an\n * undefined variable becomes a `Symbolic` placeholder instead of\n * throwing `UNDEFINED_VARIABLE`. See `vm/VM.ts`'s `executeBytecode()`\n * doc comment on its own `symbolicTolerant` parameter). Used by both\n * the \"just simplify this\" `=>` mode and bare equation evaluation\n * (a bare assignment's RHS, and an equation's own RHS at solve time)\n *, every one of these needs forward-tolerant reads of not-yet-defined\n * names, which ordinary evaluation deliberately never allows.\n *\n * `lineNumber` is the 1-based document line this program belongs to, so\n * the RHS still receives a {@link makeLineContext}, a bare assignment's\n * right-hand side (`total = prev`, `x = line2`) can therefore read\n * cross-line results exactly as a bare expression line does. Defaults to\n * `-1` (the \"no real document\" sentinel) for the expression-level and\n * `=>`-without-a-document callers, which naturally yields the same\n * `LINE_REF_NO_DOCUMENT` a single-expression eval already returns.\n */\n private executeSymbolicTolerant(program: BytecodeProgram, lineNumber: number = -1): Value {\n const result = executeBytecode(program, this.vm, undefined, undefined, this.makeLineContext(lineNumber), true);\n if (result.type === 'error') throw result.error;\n if (result.type === 'pending') {\n throw ErrorFactory.execution(\n 'THEREFORE_ASYNC_UNSUPPORTED',\n `\"=>\" doesn't support expressions that call an async operation (weather/stocks/currency).`,\n );\n }\n return result.value;\n }\n\n /** Compiles and executes `tokens` in symbolic-tolerant mode, the \"just simplify this\" `=>` fallback when there's no stored equation to solve. `lineNumber` (1-based, `-1` outside a document) is forwarded so a bare assignment's RHS can resolve cross-line references. */\n private simplifySymbolically(tokens: Token[], lineNumber: number = -1): Value {\n return this.executeSymbolicTolerant(this.compileAdHoc(tokens), lineNumber);\n }\n\n /**\n * Parses a bare (colon-less) equation's left-hand side, `factor1 *\n * factor2 * ... * variable`, into an ordered list of bare names, or\n * `null` if `tokens` isn't EXACTLY that shape (an alternating\n * `IDENT/UNIT`, `STAR`, `IDENT/UNIT`, `STAR`, ... sequence with no\n * other token types). Returning `null` means \"don't intercept this\n * line at all\", it falls through to whatever the ordinary expression\n * grammar already does with a bare `=` in it (today: a clear parse\n * error), so this pattern-match can only ever ADD a new capability,\n * never take one away.\n *\n * Requiring `IDENT`/`UNIT` at every name position is what keeps this\n * safe from the reserved-keyword collision risk `VariableParselet.ts`\n * guards against for the colon-prefixed form: a genuinely reserved\n * word (`clamp`, `global`, ...) always lexes as ITS OWN token type,\n * never `IDENT`/`UNIT`, so it can never satisfy this pattern, the\n * same protection, for free, without a duplicated keyword list.\n */\n private parseFactorChain(tokens: Token[]): string[] | null {\n if (tokens.length === 0 || tokens.length % 2 === 0) return null;\n const names: string[] = [];\n for (let i = 0; i < tokens.length; i++) {\n if (i % 2 === 0) {\n if (tokens[i].type !== 'IDENT' && tokens[i].type !== 'UNIT') return null;\n names.push(tokens[i].value);\n } else {\n if (tokens[i].type !== 'STAR') return null;\n }\n }\n return names;\n }\n\n /**\n * Solves a stored equation, `variable = inv(factor1*factor2*...) *\n * rhs`. Every step is symbolic-aware (`vm/MatrixOps.ts`'s\n * `matrixMultiply()`/`inverse()`), so a factor whose OWN cells are\n * still-unassigned free variables (`s = [sx,0,0;...]`) solves\n * correctly, producing a Matrix whose cells are algebraic formulas\n * rather than plain numbers. Errors (a missing factor, a non-Matrix\n * factor/RHS, a singular combined matrix) are returned as `Error`-typed\n * Values, not thrown, matching this engine's established \"matrix\n * errors propagate as values\" convention (DIMENSION_MISMATCH,\n * SINGULAR_MATRIX, ...).\n */\n private solveEquation(equation: EquationDef, lineNumber: number = -1): Value {\n const factorValues: Value[] = [];\n for (const name of equation.factorNames) {\n const v = this.vm.getVar(name);\n if (v === undefined) {\n return errorValue(\n 'EQUATION_FACTOR_UNDEFINED',\n `Cannot solve for \"${equation.variable}\": \"${name}\" is not yet defined.`,\n );\n }\n if (v.type !== ValueType.Matrix) {\n return errorValue(\n 'EQUATION_FACTOR_NOT_MATRIX',\n `Cannot solve for \"${equation.variable}\": \"${name}\" must be a Matrix (got a different value type).`,\n );\n }\n factorValues.push(v);\n }\n\n let combined = factorValues[0].value as MatrixData;\n for (let i = 1; i < factorValues.length; i++) {\n const product = matrixMultiply(combined, factorValues[i].value as MatrixData);\n if (product.type === ValueType.Error) return product;\n combined = product.value as MatrixData;\n }\n\n const inv = inverse(combined);\n if (inv.type === ValueType.Error) return inv;\n\n const rhsValue = this.executeSymbolicTolerant(equation.rhsProgram, lineNumber);\n if (rhsValue.type !== ValueType.Matrix) {\n return errorValue(\n 'EQUATION_RHS_NOT_MATRIX',\n `Cannot solve for \"${equation.variable}\": the right-hand side must be a Matrix.`,\n );\n }\n\n return matrixMultiply(inv.value as MatrixData, rhsValue.value as MatrixData);\n }\n\n /**\n * Detects and handles this session's two new symbolic-algebra grammar\n * shapes on `normalizedTokens`, returning the computed result directly\n * (bypassing ordinary bytecode compilation/caching entirely, since\n * BOTH shapes have effects, a stored equation, a direct variable\n * assignment, that a cached bytecode program can't represent) or\n * `null` if neither shape matches (meaning ordinary processing should\n * proceed exactly as it did before this feature existed):\n *\n * 1. `<bareIdent> =>` or `<expr> =>`, trailing `THEREFORE`. A bare\n * identifier with a STORED equation solves it (see\n * {@link solveEquation}); anything else (including a bare\n * identifier with NO stored equation) runs in symbolic-tolerant\n * mode and simplifies (see {@link simplifySymbolically}), a\n * near-free \"just simplify this\" mode.\n * 2. `factor1*factor2*...*variable = rhs`, a bare (colon-less), NOT\n * already colon/global-prefixed, top-level `EQUALS` whose LHS\n * matches {@link parseFactorChain}'s narrow pattern. A single bare\n * name (`s = [sx,0,0;...]`) is an ORDINARY (colon-less) assignment\n *, its RHS is ALWAYS evaluated symbolic-tolerantly (so a matrix\n * literal with still-unassigned entries assigns successfully,\n * carrying those free variables as real symbolic cells) and stored\n * via `vm.setVar()`. Two or more names (`s*t*v = rhs`) stores a\n * genuine equation keyed by the LAST name (`v`), solved later via\n * shape 1 above.\n *\n * This is a deliberately narrow pattern match, not a general equation\n * solver. See `OpRegistry.ts`'s `EquationDef` doc comment and this\n * session's own Phase H.2 scope decision (full symbolic MATRICES, not\n * a general CAS).\n */\n private trySymbolicGrammar(normalizedTokens: Token[], lineNumber: number = -1): Value | null {\n if (normalizedTokens.length === 0) return null;\n\n const last = normalizedTokens[normalizedTokens.length - 1];\n if (last.type === 'THEREFORE') {\n const beforeTokens = normalizedTokens.slice(0, -1);\n if (beforeTokens.length === 0) {\n throw ErrorFactory.parsing('THEREFORE_REQUIRES_EXPRESSION', `\"=>\" needs an expression or variable name before it.`);\n }\n if (beforeTokens.length === 1 && (beforeTokens[0].type === 'IDENT' || beforeTokens[0].type === 'UNIT')) {\n // The matrix product-chain equation is checked FIRST and its\n // behaviour is unchanged. The scalar kind is only consulted when\n // that finds nothing, so the older path can never be diverted.\n const name = beforeTokens[0].value;\n const equation = this.vm.getEquation(name);\n const scalar = this.vm.getScalarEquation(name);\n if (equation) {\n const solved = this.solveEquation(equation, lineNumber);\n // A product chain of names is stored as a matrix equation\n // on sight, since whether the factors are matrices is only\n // knowable at solve time. When they turn out not to be,\n // `a*n = 10` with a plain numeric `a` is an ordinary scalar\n // equation, so fall through to that rather than leaving the\n // user with \"must be a Matrix\" for a line that has a\n // perfectly good answer. Every other failure (a missing\n // factor, a singular matrix) still surfaces unchanged.\n const isNotMatrix = solved.type === ValueType.Error && solved.value === 'EQUATION_FACTOR_NOT_MATRIX';\n if (!isNotMatrix || !scalar) return solved;\n }\n if (scalar) {\n return this.solveScalarEquation(scalar, lineNumber);\n }\n }\n return this.simplifySymbolically(beforeTokens, lineNumber);\n }\n\n // An algebra verb (`expand(...)`, and the later phases' `factor`/\n // `solve`) is itself a request to work symbolically, so it does not also\n // need a trailing `=>`. Without this, `expand((x+1)*(x+2))` on its own\n // line would hard-throw UNDEFINED_VARIABLE on `x` before ever reaching\n // the builtin. Placed after the THEREFORE branch so an explicit `=>`\n // still wins, and before the COLON/GLOBAL guard so the existing\n // assignment grammars stay untouched.\n if (containsSymbolicCall(normalizedTokens)) {\n return this.simplifySymbolically(normalizedTokens, lineNumber);\n }\n\n // Already the colon-prefixed (`:name = value`) or `global :name`\n // grammar, completely untouched, don't even attempt to match.\n if (normalizedTokens[0].type === 'COLON' || normalizedTokens[0].type === 'GLOBAL') return null;\n\n const eqIdx = normalizedTokens.findIndex(t => t.type === 'EQUALS');\n if (eqIdx === -1) return null;\n\n const names = this.parseFactorChain(normalizedTokens.slice(0, eqIdx));\n if (names === null) {\n // Not a product chain. It may still be a general scalar equation\n // (`x^2-4 = 0`), which is a strictly narrower attempt made only\n // after every existing shape has declined. See\n // {@link tryStoreScalarEquation} for what it refuses to swallow.\n return this.tryStoreScalarEquation(normalizedTokens, eqIdx);\n }\n\n const rhsTokens = normalizedTokens.slice(eqIdx + 1);\n\n if (names.length === 1) {\n const result = this.simplifySymbolically(rhsTokens, lineNumber);\n this.vm.setVar(names[0], result);\n return result;\n }\n\n const freeVar = names[names.length - 1];\n const factorNames = names.slice(0, -1);\n this.vm.defineEquation(freeVar, factorNames, this.compileAdHoc(rhsTokens));\n // Also stored as a scalar equation, so that `a*n = 10` with a numeric\n // `a` still has an answer. Which of the two kinds applies depends on\n // whether the factors are matrices, and that is not known until solve\n // time; storing both costs one extra compile of a line the user is\n // about to ask about anyway. The matrix kind is always tried first, so\n // this cannot change what an existing document does.\n this.vm.defineScalarEquation(freeVar, this.compileAdHoc(normalizedTokens.slice(0, eqIdx)), this.compileAdHoc(rhsTokens));\n return stringValue(`${freeVar} stored as an equation — solve with \"${freeVar} =>\"`);\n }\n\n /**\n * Stores a general scalar equation (`x^2 - 4 = 0`) keyed by its unknown, or\n * returns `null` to let ordinary processing continue.\n *\n * This is the riskiest pattern match in the file, because a bare `=` is\n * already claimed by three shipped grammars, and swallowing any of them\n * would break a working feature silently. Each is excluded deliberately:\n *\n * - **A user-defined function definition** (`f(x) = 2*x`). Its left side is\n * a name followed by `(`, which no equation ever is, so a `LPAREN` in\n * second position declines outright. This is the exclusion that matters\n * most: `parseFactorChain` already returns `null` for it, so without this\n * guard the definition grammar would be intercepted before the parser\n * ever saw it.\n * - **A bare assignment** (`a = [1,2;3,4]`) and **a product-chain matrix\n * equation** (`a*x = [60;70]`). Both are handled by `parseFactorChain`\n * above and never reach here.\n * - **A colon-prefixed or global assignment**. Excluded earlier still.\n *\n * Two further conditions narrow it to genuine equations. There must be\n * exactly one top-level `=` (an `==` comparison lexes as `EQUALITY`, a\n * different token, so it cannot collide), and at least one side must carry\n * an unknown. Without that last check `2+2 = 4` would become an equation\n * with no variable and report an identity, where today it is a parse error;\n * changing an unrelated line's behaviour is not this feature's business.\n *\n * @param normalizedTokens - The whole line's normalized tokens.\n * @param eqIdx - Index of the first `EQUALS` token.\n * @returns A confirmation value when stored, or `null` to decline.\n */\n private tryStoreScalarEquation(normalizedTokens: Token[], eqIdx: number): Value | null {\n if (normalizedTokens[1]?.type === 'LPAREN') return null;\n if (eqIdx === 0 || eqIdx === normalizedTokens.length - 1) return null;\n\n const lhsTokens = normalizedTokens.slice(0, eqIdx);\n const rhsTokens = normalizedTokens.slice(eqIdx + 1);\n if (rhsTokens.some(t => t.type === 'EQUALS')) return null;\n\n const unknowns = this.equationUnknowns(lhsTokens, rhsTokens);\n if (unknowns.length !== 1) return null;\n\n const variable = unknowns[0];\n this.vm.defineScalarEquation(variable, this.compileAdHoc(lhsTokens), this.compileAdHoc(rhsTokens));\n return stringValue(`${variable} stored as an equation — solve with \"${variable} =>\"`);\n }\n\n /**\n * The names in an equation that have no value yet, which is what makes them\n * the thing to solve for.\n *\n * A name that already holds a value is not an unknown: in `y = 2` followed\n * by `x + y = 5`, only `x` is being solved for. A name that is a defined\n * function is likewise excluded, so a call to one never looks like an\n * unknown.\n *\n * @param lhsTokens - Left-hand side tokens.\n * @param rhsTokens - Right-hand side tokens.\n * @returns The distinct unassigned names, in first-seen order.\n */\n private equationUnknowns(lhsTokens: Token[], rhsTokens: Token[]): string[] {\n const unknowns: string[] = [];\n for (const token of [...lhsTokens, ...rhsTokens]) {\n if (token.type !== 'IDENT' && token.type !== 'UNIT') continue;\n if (this.vm.getVar(token.value) !== undefined) continue;\n if (this.vm.hasUserFunction(token.value)) continue;\n if (!unknowns.includes(token.value)) unknowns.push(token.value);\n }\n return unknowns;\n }\n\n /**\n * Solves a stored scalar equation via `symbolic/Solve.ts`.\n *\n * Both sides are evaluated symbolic-tolerantly first, so the unknown\n * survives as a `Symbolic` value rather than throwing, and a side that\n * reduces to a plain number is lifted into the symbolic domain to match.\n *\n * @param equation - The stored equation.\n * @returns The solution, rendered by the same helper `solve()` uses, so the\n * two surfaces cannot disagree about how an outcome reads.\n */\n private solveScalarEquation(equation: ScalarEquationDef, lineNumber: number = -1): Value {\n const lhs = this.executeSymbolicTolerant(equation.lhsProgram, lineNumber);\n const rhs = this.executeSymbolicTolerant(equation.rhsProgram, lineNumber);\n return solveEquationValues(lhs, rhs, equation.variable);\n }\n\n //#endregion\n\n /**\n * Lex an expression via `resetExpression` (skips `classifyLine`\n * callers already know this is an expression), filtering out COMMENT\n * tokens (they have no parselet) and tracking whether any paren was\n * seen. Shared by every lex-then-{@link prepareExpression} call site:\n * {@link compileExpression}, {@link tryCompileExpression}, and\n * {@link evaluateExpressionWithDiagnostic}. `onToken`, when given, is\n * called once per emitted (already-filtered) token, used ONLY by the\n * diagnostic path to fire its per-token `TokenEmitted` events; every\n * other caller omits it.\n */\n private lexToTokens(expression: string, onToken?: (t: Token) => void): { tokens: Token[]; hasParens: boolean } {\n const tokens: Token[] = [];\n let hasParens = false;\n this.lexer.resetExpression(expression);\n for (const t of this.lexer) {\n if (t.type === 'COMMENT') continue;\n if (t.type === \"LPAREN\" || t.type === \"RPAREN\") hasParens = true;\n tokens.push(t);\n onToken?.(t);\n }\n return { tokens, hasParens };\n }\n\n /**\n * Shared pipeline front-half: safety checks → COMMENT filter →\n * normalize → complexity → read/write extraction → bytecode cache\n * lookup or parse+compile.\n *\n * Used by {@link evaluateWithTokens} (which continues into preflight +\n * execution) and {@link compileExpression} (compile-only). Previously\n * both carried their own copy of this sequence, which had already\n * drifted. Returns a discriminated union instead of throwing so each\n * caller decides whether/how to re-throw.\n *\n * The `'error'` variant carries the actual `EngineError` each safety\n * check or `parseExpression()` itself already constructed, not just\n * its flattened `.message` (the previous shape). A parse failure in\n * particular can be any of dozens of specific codes (UNDEFINED_VARIABLE,\n * NO_PREFIX_PARSELET, FUNCTION_ARITY_MISMATCH, ...), each with its own\n * `expected`/`found`/`suggestion` detail, callers used to discard all\n * of that and reconstruct a generic EVALUATION_ERROR/PARSE_ERROR wrapper\n * around just the message, which directly worked against this session's\n * \"errors are verbose and easy to understand\" goal. Callers should\n * generally just `throw prep.error` (see {@link evaluateWithTokens},\n * {@link compileExpression}) rather than wrapping it again.\n *\n * `onFusion`, when given, is passed straight through to the normalizer's\n * own optional per-fusion callback, used ONLY by\n * {@link evaluateExpressionWithDiagnostic} to observe individual token\n * fusions for its `normalizer` diagnostic stage. Omitted by every other\n * caller, with zero behavior change (identical to not passing a 2nd\n * argument to `normalizer.normalize()` at all).\n *\n * The `'error'` variant's `normalizedTokens` is populated whenever\n * normalization already ran before the failure (`'complexity'`/`'parse'`\n * stages), `undefined` when it failed before tokens were even considered\n * (`'length'` stage), lets {@link evaluateExpressionWithDiagnostic}\n * reconstruct its own diagnostic-stage payloads (which need the\n * normalized tokens to recompute a display-only complexity score) without\n * re-deriving them by hand.\n *\n * The `'ready'` (uncached) variant's `parserAlloc` is the\n * `AllocationTracker.track('parser', ...)` result for JUST the actual\n * parse+build call (`null` whenever `AllocationTracker.isEnabled()` is\n * false, or on a cache hit, no parsing happened). This has to be\n * measured HERE, not reconstructed by a caller after the fact: unlike\n * every other diagnostic field, a heap-delta measurement only means\n * anything over the EXACT span it's wrapped around, wrapping the\n * whole `prepareExpression()` call from the outside (as\n * {@link evaluateExpressionWithDiagnostic} briefly did) widens that span\n * to also cover normalize/complexity-check/cache-lookup, which measurably\n * produced negative-allocation readings (a GC sweep landing inside the\n * wider window) in `AllocationTracker.spec.ts` well over half the time.\n */\n private prepareExpression(\n expression: string,\n tokens: Token[],\n hasParens: boolean | undefined,\n onFusion?: (fusion: TokenFusion) => void,\n lineNumber: number = -1,\n ):\n | { kind: 'empty' }\n | { kind: 'error'; stage: 'length' | 'complexity' | 'parse'; error: EngineError; reads?: string[]; writes?: string[]; normalizedTokens?: Token[] }\n | { kind: 'ready'; normalizedTokens: Token[]; reads: string[]; writes: string[]; program: BytecodeProgram; cached: boolean; parserAlloc?: StageAllocation | null }\n | { kind: 'symbolic-solve'; normalizedTokens: Token[]; value: Value } {\n // ══ SAFETY CHECK 1: Expression length limit ══\n const lengthCheck = checkExpressionLength(expression, this.config.validation);\n if (!lengthCheck.passed) {\n return { kind: 'error', stage: 'length', error: lengthCheck.error!.engineError! };\n }\n\n // Filter COMMENT tokens, they have no parselet.\n const exprTokens = tokens.filter(t => t.type !== 'COMMENT');\n if (exprTokens.length === 0) {\n return { kind: 'empty' };\n }\n\n // ══ NORMALIZER ══\n // Phrase fusion, implicit multiply, domain token merging.\n const normalizedTokens = this.normalizer.normalize(exprTokens, onFusion);\n\n // ══ SAFETY CHECK 2: Complexity scoring ══\n const complexityCheck = checkExpressionComplexity(normalizedTokens, this.config.validation);\n if (!complexityCheck.passed) {\n return { kind: 'error', stage: 'complexity', error: complexityCheck.engineError!, normalizedTokens };\n }\n\n // ══ SYMBOLIC ALGEBRA: `=>` / bare equation-statement grammar ══\n // Bypasses bytecode caching entirely, both shapes have effects\n // (a stored equation, a direct vm.setVar()) a cached program can't\n // represent. See trySymbolicGrammar()'s own doc comment.\n // The symbolic grammar parses its own operand sub-ranges (see\n // simplifySymbolically/compileAdHoc), so it can throw the parser's\n // errors from here, ahead of the try/catch guarding the main parse\n // below. Caught into the same 'parse' result every other failure in\n // this method returns, because a throw escaping prepareExpression\n // reaches tryCompileExpression(), which is documented as a\n // non-throwing boolean and is called by LanguageService on every\n // visible line on every keystroke. `total =` is a line half-typed on\n // the way to `total = 5`, and it took the editor down.\n let symbolicResult: Value | null;\n try {\n symbolicResult = this.trySymbolicGrammar(normalizedTokens, lineNumber);\n } catch (e) {\n // reads/writes supplied for the same reason the main parse's catch\n // supplies them: the line names variables even though it does not\n // yet parse, so a caller tracking dependencies can re-evaluate it\n // once the user finishes typing.\n const { reads, writes } = extractReadsAndWrites(normalizedTokens);\n return { kind: 'error', stage: 'parse', error: normalizeUnknownError(e), reads, writes, normalizedTokens };\n }\n if (symbolicResult !== null) {\n return { kind: 'symbolic-solve', normalizedTokens, value: symbolicResult };\n }\n\n const { reads, writes } = extractReadsAndWrites(normalizedTokens);\n\n // ══ BYTECODE CACHE / PARSE+COMPILE ══\n const cachedProgram = this.bytecodeCache.get(expression);\n if (cachedProgram) {\n return { kind: 'ready', normalizedTokens, reads, writes, program: cachedProgram, cached: true };\n }\n\n // Get a pooled builder, avoids 4 heap allocations per expression\n const builder = this.builderPool[this.builderPoolIndex++ % this.builderPool.length];\n builder.reset();\n let program: BytecodeProgram;\n let parserAlloc: StageAllocation | null = null;\n try {\n // build() allocates TypedArrays directly from builder arrays\n // a single copy (builder → TypedArray). Wrapped together with\n // parseExpression() under one 'parser' allocation measurement,\n // matching the exact span this file's diagnostic path has always\n // measured (see this method's own doc comment on `parserAlloc`).\n const parseResult = AllocationTracker.track('parser', () => {\n this.parseExpression(builder, normalizedTokens, hasParens);\n return builder.build();\n });\n program = parseResult.result;\n parserAlloc = parseResult.alloc;\n } catch (e) {\n // reads/writes were already extracted above from the full token\n // list (independent of whether parsing succeeds), returned\n // alongside the error (not merged into its context here, since\n // EngineError.context is readonly) so callers that track\n // dependencies (ThreeTierEvaluator's compile-fallback DAG\n // registration, via compileExpression()'s merge below) still\n // learn what this line references and can re-evaluate it once\n // those variables become defined.\n return { kind: 'error', stage: 'parse', error: normalizeUnknownError(e), reads, writes, normalizedTokens };\n }\n\n this.cacheBytecode(expression, program);\n return { kind: 'ready', normalizedTokens, reads, writes, program, cached: false, parserAlloc };\n }\n\n /**\n * Shared async-resolver preflight check, run before VM execution.\n *\n * O(1) guard: skips the O(n) resolver scan when the bytecode has no\n * async opcodes AND no resolvers are registered. Either condition alone\n * is enough to warrant a preflight scan:\n * - program.hasAsync: bytecode contains CALL_PLUGIN (async VM path)\n * - resolverRegistry.size > 0: resolvers may intercept any expression\n * For purely sync expressions (e.g., `2 + 2`) with no resolvers, this is\n * an O(1) fast-path that bypasses the resolver scan entirely.\n *\n * If any registered resolver says \"data not ready\", registers a DAG\n * data-source dependency, stores a Pending result, and fires async\n * resolution (fire-and-forget, resolves later, re-evaluates on\n * completion), the caller should skip VM execution entirely and return\n * the pending Value as-is. Otherwise the caller should proceed to\n * {@link executeAndStore}.\n *\n * Used by both {@link evaluateWithTokens} and\n * {@link evaluateExpressionWithDiagnostic}, previously each carried its\n * own copy of this exact sequence (differing only in a cosmetic\n * abortLogger label), which is how the `=>` grammar shipped silently\n * dead on the diagnostic path earlier this session: a future top-level\n * grammar addition can no longer be wired into only one of the two.\n */\n private preflightAsync(\n normalizedTokens: Token[],\n program: BytecodeProgram,\n lineNumber: number,\n expression: string,\n reads: string[],\n writes: string[],\n ): { kind: 'pending'; value: Value } | { kind: 'proceed' } {\n if (!(program.hasAsync || this.resolverRegistry.size > 0)) {\n return { kind: 'proceed' };\n }\n\n // Check all registered async resolvers BEFORE VM execution.\n // If any resolver says \"data not ready\", skip VM and return Pending.\n // Link the preflight AbortController to the keystroke signal so\n // that in-flight preflight checks are canceled on new keystrokes.\n const preflightController = new AbortController();\n const abortPreflight = () => preflightController.abort();\n this.keystrokeSignal?.addEventListener('abort', abortPreflight, { once: true });\n\n abortLogger.localControllerCreated(\"preflightAsync\");\n if (this.keystrokeSignal) {\n abortLogger.signalLinked(\"preflightAsync\");\n }\n\n const preflightSignal = preflightController.signal;\n const asyncCheck = this.resolverRegistry.preflightAll(\n normalizedTokens, program, '_engine', preflightSignal, this.queryClient\n );\n if (asyncCheck) {\n // Fire-and-forget, resolves asynchronously, re-evaluates on completion\n void this.resolveAsync({\n type: 'pending',\n queryKey: asyncCheck.queryKey,\n resolver: asyncCheck.resolver,\n packageId: asyncCheck.packageId || '_engine',\n signal: asyncCheck.signal,\n });\n\n // Register data source dependency for DAG re-evaluation tracking\n this.dag.registerLineDataSourceDependency(\n lineNumber,\n asyncCheck.packageId || '_engine',\n [asyncCheck.queryKey]\n );\n\n const pending = pendingValue(asyncCheck.queryKey);\n this.storeLineResult(lineNumber, pending, program, reads, writes, expression);\n return { kind: 'pending', value: pending };\n }\n // Sync path, no async resolution started, so the preflight\n // controller is inert. Unhook its keystroke listener.\n this.keystrokeSignal?.removeEventListener('abort', abortPreflight);\n return { kind: 'proceed' };\n }\n\n /**\n * Evaluate an expression using already-lexed tokens.\n *\n * The lean, non-diagnostic-instrumented path, used by\n * {@link evaluateLineWithPreTokenized} (tokens from `scanDocument()`)\n * and, via {@link compileExpression}/{@link tryCompileExpression},\n * compile-only callers. NOT used by `evaluateLine()`/\n * `evaluateExpression()`, those route through\n * {@link evaluateExpressionWithDiagnostic} instead (evaluateLine ->\n * evaluateLineDetailed -> evaluateLineWithDebug ->\n * evaluateExpressionWithDiagnostic), which does its own lexing and its\n * own diagnostic-instrumented front-half, delegating to the SAME\n * {@link prepareExpression} this method calls. Delegates the front-half\n * to {@link prepareExpression}, then runs async preflight (via\n * {@link preflightAsync}) + VM execution (via {@link executeAndStore}).\n */\n private evaluateWithTokens(\n lineNumber: number,\n expression: string,\n tokens: Token[],\n hasParens?: boolean\n ): Value {\n const prep = this.prepareExpression(expression, tokens, hasParens, undefined, lineNumber);\n\n if (prep.kind === 'empty') {\n const v = numberValue(0);\n this.lineCache.set(lineNumber, new LineCacheEntry(v, { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, [], null), expression);\n return v;\n }\n if (prep.kind === 'error') {\n // Re-throw the original error as-is, its own code/category\n // (EXPRESSION_TOO_LONG/EXPRESSION_TOO_COMPLEX/whatever the\n // parser actually threw) and expected/found/suggestion detail\n // are more specific and useful than the generic EVALUATION_ERROR\n // wrapper this used to construct around just the message.\n throw prep.error;\n }\n if (prep.kind === 'symbolic-solve') {\n // No DAG registration, a stored equation/bare-assignment's\n // effect (vm.equations, vm.setVar) isn't reads/writes-trackable\n // the same way ordinary bytecode is, so this line won't\n // auto-re-evaluate if some unrelated line later changes one of\n // its factor variables. A disclosed limitation of this\n // narrow, bounded grammar (see trySymbolicGrammar()'s own doc\n // comment), not an oversight.\n this.storeLineResult(lineNumber, prep.value, { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, [], [], expression);\n return prep.value;\n }\n\n const { normalizedTokens, reads, writes, program } = prep;\n\n // ══ PRE-FLIGHT ASYNC CHECK ══\n const preflight = this.preflightAsync(normalizedTokens, program, lineNumber, expression, reads, writes);\n if (preflight.kind === 'pending') {\n return preflight.value;\n }\n\n // Execute and handle result, no try/catch needed.\n // executeBytecode now returns EvalResult (discriminated union).\n return this.executeAndStore(program, lineNumber, expression, reads, writes, '_engine');\n }\n\n //#endregion\n\n //#region Public API, Line-level evaluation\n\n\t/**\n\t * Evaluate a single expression line with full DAG and LineCache integration.\n\t *\n\t * @param lineNumber - 1-based line position in the document.\n\t * @param lineText - The raw line text.\n\t * @returns The evaluated Value, wrapped in a single-element array.\n\t * @throws {EngineError} On evaluation failure.\n\t */\n\tevaluateLine(\n lineNumber: number,\n lineText: string\n ): EvalResults {\n const detailed = this.evaluateLineDetailed(lineNumber, lineText);\n return detailed.values.slice() as EvalResults;\n }\n\n /**\n * Evaluate a line and return an explicit `{ values }` object.\n *\n * @throws {EngineError} On evaluation failure.\n */\n evaluateLineDetailed(lineNumber: number, lineText: string): LineEvaluation {\n const result = this.evaluateLineWithDebug(lineNumber, lineText);\n if (result.error) {\n // Re-throw the original error (its own specific code/category/\n // expected/found/suggestion, e.g. CLAMP_EXPECTED_BETWEEN_OR_FROM\n // or UNDEFINED_VARIABLE) rather than the generic EVALUATION_ERROR\n // wrapper this used to always construct around just the message\n //, engineError is only absent if some future failure path in\n // the diagnostic pipeline sets `error` without it, which the\n // fallback below still handles.\n if (result.engineError) {\n throw result.engineError;\n }\n throw ErrorFactory.execution(\n 'EVALUATION_ERROR',\n result.error,\n { lineNumber }\n );\n }\n return { values: [freezeIfDev(result.value)] };\n }\n\n /**\n * Evaluate a line with diagnostic information, supporting both regular expressions and inline solves.\n *\n * This is the primary entry point for the playground's debug/DIagnostic mode.\n * It delegates to {@link evaluateExpressionWithDiagnostic} for all actual evaluation,\n * but first checks for inline solve syntax (`s`expression``) and wraps the result\n * with inline solve position metadata when found.\n *\n * @param lineNumber - 1-based line number in the document.\n * @param lineText - Raw line text, which may be a regular expression or an inline solve.\n * @param inputType - Optional input type hint passed through to the diagnostic pipeline.\n * @returns An object containing the evaluated `value`, the raw `tokens`, the compiled\n * `program`, optional `error` message, optional `debug` report JSON, and optional\n * structured `diagnostic` pipeline result with all 15 pipeline stages.\n */\n evaluateLineWithDebug(\n lineNumber: number,\n lineText: string,\n inputType: string = \"expression\"\n ): { value: Value; tokens: Token[]; program: BytecodeProgram; error?: string; engineError?: EngineError; inlineSolve?: InlineSolvePosition; debug?: DiagnosticReportJSON; diagnostic?: DiagnosticPipelineResult } {\n const inlineSolveMatch = lineText.match(/^s`([^`]*)`$/);\n if (inlineSolveMatch) {\n const expression = inlineSolveMatch[1];\n const result = this.evaluateExpressionWithDiagnostic(expression, lineNumber, inputType);\n return {\n ...result,\n inlineSolve: {\n start: 0,\n end: lineText.length,\n expression,\n lineNumber,\n columnNumber: 1\n }\n };\n }\n return this.evaluateExpressionWithDiagnostic(lineText, lineNumber, inputType);\n }\n\n //#endregion\n\n //#region Diagnostic Pipeline, Structured stage recording\n\n /**\n * Build a single pipeline stage result for the structured diagnostic output.\n *\n * Appends a `PipelineStageResult` to the given `stages` array with the provided\n * metadata. This runs in parallel with the existing event-based diagnostic system\n * (via `DiagnosticPipeline.fire*` methods). Both paths are enabled by the same\n * `hasCollectors` guard so there is no performance impact when `diagnosticMode`\n * is `false`, the stages array stays empty because this method is never called.\n *\n * Each stage captures:\n * - **Identity**: `stage` name (e.g., `\"lexer\"`), display `label`, `icon`, `colorClass`\n * - **Position**: `stepNumber` in the pipeline (0-15)\n * - **Timing**: `elapsedNs` wall-time (overridden by TimelineDiagnosticCollector)\n * - **State**: `skipped` flag for stages bypassed by cache hits or guard conditions\n * - **Payload**: `output`, a discriminated union typed per stage\n *\n * @param stages - Mutable array being accumulated for the final DiagnosticPipelineResult.\n * @param stage - Canonical stage identifier (kebab-case, e.g. `\"async_preflight\"`).\n * @param label - Human-readable stage name for the dashboard.\n * @param icon - Single emoji/character icon for visual identification.\n * @param colorClass - CSS class name for color-coding the stage in the UI.\n * @param stepNumber - Ordinal position in the 15-stage pipeline.\n * @param elapsedNs - Wall-clock time in nanoseconds (0 placeholder; timeline overrides).\n * @param skipped - Whether this stage was bypassed (e.g., cache hit, guard short-circuit).\n * @param output - Stage-specific data payload typed via the StageOutput discriminated union.\n */\n private addDiagnosticStage(\n stages: PipelineStageResult[],\n stage: string,\n label: string,\n icon: string,\n colorClass: string,\n stepNumber: number,\n elapsedNs: number,\n skipped: boolean,\n output: StageOutput,\n ): void {\n stages.push({ stage, label, icon, colorClass, stepNumber, elapsedNs, skipped, output });\n }\n\n /**\n * Core expression evaluation logic with diagnostic pipeline integration.\n *\n * Executes the full 15-stage evaluation pipeline while simultaneously\n * populating two diagnostic data structures:\n *\n * 1. **Event-based**, fires typed events to registered `DiagnosticCollector`\n * instances via `DiagnosticPipeline.fire*()` methods. Supports streaming\n * diagnostics via `TimelineDiagnosticCollector`.\n * 2. **Structured stages**, accumulates a `PipelineStageResult[]` array\n * with per-stage typed payloads (see `DiagnosticPipelineResult.ts`).\n * This is returned as the `diagnostic` field for declarative rendering.\n *\n * The 15 stages, in order:\n * ```\n * 1 pipeline_start, Pipeline initialization + metadata\n * 2 safety_length, Expression length validation\n * 3 lexer, Tokenization via ExpressionLexer\n * 4 normalizer, Token fusion (phrase, implicit multiply)\n * 5 safety_complexity, Token-count & nesting-depth check\n * 6 readwrite, Variable read/write extraction for DAG\n * 7 cache_check, Bytecode cache hit/miss\n * 8 parser, AST construction via PrecedenceParser\n * 9 compiler, Bytecode generation + constant table\n * 10 async_preflight, Async resolver pre-flight check\n * 11 vm_execute, Bytecode execution on the VM\n * 12 dag_registration, DAG node registration for incremental eval\n * 13 linecache, Result stored in LineCache\n * 14 result, Final value + formatting\n * 15 pipeline_end, Completion summary + statistics\n * ```\n *\n * Early-exit paths are taken for safety violations, empty expressions,\n * parse failures, and async pending results. Each early exit still\n * fires relevant pipeline events and records partial stages.\n *\n * When `AllocationTracker.isEnabled()`, each pipeline stage is wrapped\n * with `AllocationTracker.track()` to capture wall-time and heap delta.\n * When disabled (production), `track()` is a zero-overhead passthrough\n * that returns the result directly.\n *\n * The stages above describe OBSERVABLE shape, not a second implementation\n * of the underlying work: normalize/complexity-check/symbolic-grammar/\n * readwrite/cache-lookup/parse/compile are delegated to\n * {@link prepareExpression} (the SAME method the lean\n * {@link evaluateWithTokens} path calls), async preflight to\n * {@link preflightAsync}, and VM execution to {@link executeAndStore}\n * every stage/event below is reconstructed from what those shared\n * methods return, not fired from inside a second hand-duplicated copy\n * of their logic. This matters: a new top-level grammar shape wired\n * into `prepareExpression()` is automatically reachable from BOTH\n * `evaluateLine()`/`evaluateExpression()` (this method) and the lean\n * path, previously they were two independent implementations that had\n * already drifted once (the `=>`/equation-statement grammar shipped\n * dead on this, the real path, until a dedicated test caught it).\n *\n * @param expression - The raw expression string to evaluate.\n * @param lineNumber - 1-based line number for DAG and LineCache entries.\n * @param inputType - Input type hint (default `\"expression\"`), passed to\n * the diagnostic pipeline for metadata.\n * @returns An object with `value`, `tokens`, `program`, optional `error`,\n * optional `debug` report JSON, and optional `diagnostic` containing\n * the full structured pipeline stages array when collectors are active.\n */\n private evaluateExpressionWithDiagnostic(expression: string, lineNumber: number, inputType: string = \"expression\"): { value: Value; tokens: Token[]; program: BytecodeProgram; error?: string; engineError?: EngineError; debug?: DiagnosticReportJSON; diagnostic?: DiagnosticPipelineResult } {\n const pipeline = this.diagnosticPipeline;\n const hasCollectors = pipeline.hasCollectors;\n // Baseline for slicing THIS line's own parselet_matched events out of\n // the timeline collector's cumulative-across-the-document array below\n //. See debug.parselets' construction at the end of this method.\n const parseletsBefore = this.timelineCollector?.parseletMatchCount ?? 0;\n const trackEnabled = AllocationTracker.isEnabled();\n const stageAllocs: StageAllocation[] = [];\n const stages: PipelineStageResult[] = [];\n const zeroElapsed = 0; // Placeholder — timeline collector overrides with real ns\n\n // === SAFETY CHECK 1: Expression length limit ===\n const lengthCheck = checkExpressionLength(expression, this.config.validation);\n if (!lengthCheck.passed) {\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'safety_length', 'Safety: Length', '🛡️', 'validate', 2, zeroElapsed, false, {\n type: 'safety_length',\n passed: false,\n expressionLength: expression.length,\n maxLength: this.config.validation.maxExpressionLength,\n errorMessage: lengthCheck.error!.error,\n });\n }\n return { ...lengthCheck.error!, debug: undefined, diagnostic: undefined };\n }\n\n // Pipeline event: start + structured stage\n if (hasCollectors) {\n pipeline.firePipelineStart({\n type: DiagnosticEventType.PipelineStart,\n elapsedNs: 0,\n expression,\n inputType,\n });\n this.addDiagnosticStage(stages, 'pipeline_start', 'Pipeline Start', '▶', 'pipeline', 1, zeroElapsed, false, {\n type: 'pipeline_start', expression, inputType,\n });\n this.addDiagnosticStage(stages, 'safety_length', 'Safety: Length', '🛡️', 'validate', 2, zeroElapsed, false, {\n type: 'safety_length',\n passed: true,\n expressionLength: expression.length,\n maxLength: this.config.validation.maxExpressionLength,\n });\n }\n\n // ══ LEXER STAGE ══\n // Lexing with token emission events. This file's shared\n // lexToTokens() (also used by compileExpression/\n // tryCompileExpression) skips redundant classifyLine (caller\n // already knows this is an expression) and filters COMMENT tokens\n // (they have no parselet and would cause \"No prefix parselet\n // found\" errors at the parser); `onToken` fires the per-token\n // TokenEmitted diagnostic event, genuinely specific to this path.\n const onToken = hasCollectors ? (t: Token) => {\n pipeline.fireTokenEmitted({\n type: DiagnosticEventType.TokenEmitted,\n elapsedNs: 0, // zero-cost placeholder (timeline collector overrides)\n expression,\n token: {\n type: t.type,\n value: t.value,\n offset: t.offset || 0,\n line: t.line || lineNumber,\n col: t.col || 0,\n },\n });\n } : undefined;\n const lexResult = AllocationTracker.track('lexer', () => this.lexToTokens(expression, onToken));\n const tokens = lexResult.result.tokens;\n const hasParens = lexResult.result.hasParens;\n if (trackEnabled && lexResult.alloc) stageAllocs.push(lexResult.alloc);\n\n // Structured: lexer stage output\n if (hasCollectors) {\n const tokenTypes: Record<string, number> = {};\n for (const t of tokens) {\n tokenTypes[t.type] = (tokenTypes[t.type] || 0) + 1;\n }\n this.addDiagnosticStage(stages, 'lexer', 'Lexer', '🔤', 'lexer', 3, zeroElapsed, false, {\n type: 'lexer',\n tokenCount: tokens.length,\n tokenTypes,\n hasParens,\n locale: this.localeCode,\n tokens: [...tokens],\n });\n\n // Structured: line classification, detect inline solve spans from token stream\n const inlineSolveSpans: InlineSolveSpanInfo[] = [];\n for (let i = 0; i < tokens.length; i++) {\n const t = tokens[i];\n if (t.type === 'INLINE_SOLVE_START') {\n // Find closing backtick\n let endIdx = -1;\n for (let j = i + 1; j < tokens.length; j++) {\n if (tokens[j].type === 'BACKTICK_OPEN') {\n endIdx = j;\n break;\n }\n }\n if (endIdx > i) {\n const exprTokens = tokens.slice(i + 1, endIdx);\n const expression = exprTokens.map(et => et.value).join('');\n inlineSolveSpans.push({\n startTokenIndex: i,\n endTokenIndex: endIdx,\n expression,\n columnNumber: t.col || 1,\n });\n i = endIdx; // skip past this span\n }\n }\n }\n this.addDiagnosticStage(stages, 'line_classification', 'Line Classification', '📋', 'classify', 3.5, zeroElapsed, false, {\n type: 'line_classification',\n classification: 'expression',\n skip: false,\n hasInlineSolve: inlineSolveSpans.length > 0,\n inlineSolveSpans,\n });\n }\n\n if (tokens.length === 0) {\n const v = numberValue(0);\n this.lineCache.set(lineNumber, new LineCacheEntry(v, { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, [], null), expression);\n\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: true,\n totalTokens: 0,\n totalOpcodes: 0,\n });\n }\n\n return { value: v, tokens, program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, debug: undefined, diagnostic: undefined };\n }\n\n // ══ FRONT-HALF DELEGATION ══\n // normalize -> complexity -> symbolic-grammar -> readwrite -> cache\n // lookup/parse/compile, all via the SAME prepareExpression() the\n // lean path (evaluateWithTokens/compileExpression/\n // tryCompileExpression) already calls. This is the actual fix for\n // the bug found earlier this session (a new top-level grammar\n // shape silently dead on THIS, the real evaluateLine()/\n // evaluateExpression() path): a future addition wired into\n // prepareExpression() now automatically covers both paths, since\n // there is only one implementation left of \"what does this line\n // mean.\" Every stage below is reconstructed from\n // prepareExpression()'s return value, plus a couple of cheap\n // pure, side-effect-free recomputations for display-only fields it\n // doesn't itself carry (the complexity score), instead of being\n // fired from inside a second, hand-duplicated copy of its logic.\n let fusionCount = 0;\n const normalizerFusions: TokenFusion[] = [];\n const normalizerRuleCounts = new Map<string, number>();\n const onFusion = hasCollectors ? (fusion: TokenFusion) => {\n fusionCount++;\n normalizerFusions.push(fusion);\n normalizerRuleCounts.set(fusion.rule, (normalizerRuleCounts.get(fusion.rule) || 0) + 1);\n pipeline.fireTokenFused({\n type: DiagnosticEventType.TokenFused,\n elapsedNs: 0,\n expression,\n ruleName: fusion.rule,\n sourceTokenCount: fusion.sourceTokens.length,\n fusedTokenType: fusion.fusedToken.type,\n fusedTokenValue: fusion.fusedToken.value,\n });\n } : undefined;\n\n if (hasCollectors && this.normalizer.ruleCount > 0) {\n pipeline.fireNormalizerStart({\n type: DiagnosticEventType.NormalizerStart,\n elapsedNs: 0,\n expression,\n inputTokenCount: tokens.length,\n });\n }\n\n // Peeked BEFORE calling prepareExpression() so hit/miss is already\n // known for the stage/event construction below, and so the\n // parser's diagnostic-pipeline reference is only linked when a real\n // parse attempt is actually about to happen, a cache hit never\n // reaches parseExpression() at all, matching the original's own\n // cache-miss-only gating of this same call.\n const cachedBefore = this.bytecodeCache.get(expression);\n if (hasCollectors && !cachedBefore) {\n this.parser.setDiagnosticPipeline(pipeline, expression);\n }\n\n // NOT wrapped in AllocationTracker.track('parser', ...) here\n // prepareExpression() already measures its OWN internal parse+build\n // call under that exact label internally (see its own doc comment\n // on `parserAlloc`) and reports the result back on its 'ready'\n // variant below. Wrapping the whole call from out here would widen\n // the measured span to also cover normalize/complexity-check/cache-\n // lookup, which measurably produced negative-allocation readings (a\n // GC sweep landing inside the wider window) well over half the time.\n const prep = this.prepareExpression(expression, tokens, hasParens, onFusion, lineNumber);\n if (trackEnabled && prep.kind === 'ready' && prep.parserAlloc) {\n stageAllocs.push(prep.parserAlloc);\n }\n\n if (hasCollectors && !cachedBefore) {\n this.parser.setDiagnosticPipeline(undefined, \"\");\n }\n\n // From here on, `prep.normalizedTokens` is always defined, the two\n // variants that lack it ('empty', and 'error' at the 'length'\n // stage) are provably unreachable from this call site: the\n // safety-length check and the raw-tokens-empty check above already\n // handled both cases before prepareExpression() was ever invoked.\n const normalizedTokens: Token[] = prep.kind === 'empty' ? tokens : (prep.normalizedTokens ?? tokens);\n\n if (hasCollectors) {\n if (this.normalizer.ruleCount > 0) {\n pipeline.fireNormalizerEnd({\n type: DiagnosticEventType.NormalizerEnd,\n elapsedNs: 0,\n expression,\n outputTokenCount: normalizedTokens.length,\n fusionsCount: fusionCount,\n });\n this.addDiagnosticStage(stages, 'normalizer', 'Normalizer', '🔄', 'normalizer', 4, zeroElapsed, false, {\n type: 'normalizer',\n inputTokenCount: tokens.length,\n outputTokenCount: normalizedTokens.length,\n fusions: normalizerFusions,\n rulesApplied: [...normalizerRuleCounts.entries()].map(([rule, count]) => ({ rule, count })),\n tokens: [...normalizedTokens],\n phrases: this.normalizer.getPhrases(),\n });\n } else {\n this.addDiagnosticStage(stages, 'normalizer', 'Normalizer', '🔄', 'normalizer', 4, zeroElapsed, true, {\n type: 'normalizer',\n inputTokenCount: tokens.length,\n outputTokenCount: tokens.length,\n fusions: [],\n rulesApplied: [],\n tokens: [...tokens],\n phrases: this.normalizer.getPhrases(),\n });\n }\n }\n\n // ══ 'empty' / 'error'-at-'length' outcomes ══\n // Provably unreachable from this call site (see comment above)\n // handled only so the discriminated union stays exhaustively\n // covered.\n if (prep.kind === 'empty' || (prep.kind === 'error' && prep.stage === 'length')) {\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: prep.kind === 'empty',\n totalTokens: tokens.length,\n totalOpcodes: 0,\n });\n }\n if (prep.kind === 'empty') {\n const v = numberValue(0);\n this.lineCache.set(lineNumber, new LineCacheEntry(v, { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, [], null), expression);\n return { value: v, tokens, program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false }, debug: undefined, diagnostic: undefined };\n }\n return {\n value: numberValue(0),\n tokens: [],\n program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n error: prep.error.message,\n engineError: prep.error,\n debug: undefined,\n diagnostic: undefined,\n };\n }\n\n // Recompute the complexity score for display, cheap, pure\n // side-effect-free; prepareExpression() already made the actual\n // pass/fail DECISION, this is purely for the diagnostic stage's own\n // display fields it doesn't itself return.\n const complexityCheck = checkExpressionComplexity(normalizedTokens, this.config.validation);\n\n if (prep.kind === 'error' && prep.stage === 'complexity') {\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'safety_complexity', 'Safety: Complexity', '🛡️', 'validate', 5, zeroElapsed, false, {\n type: 'safety_complexity',\n passed: false,\n complexityScore: complexityCheck.complexityScore ?? 0,\n maxComplexity: this.config.validation.maxComplexity,\n breakdown: {\n tokenCount: normalizedTokens.length,\n functionCalls: 0,\n nestingDepth: 0,\n },\n errorMessage: complexityCheck.errorMessage!,\n });\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: false,\n totalTokens: tokens.length,\n totalOpcodes: 0,\n });\n }\n return {\n value: numberValue(0),\n tokens: [],\n program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n error: complexityCheck.errorMessage!,\n engineError: complexityCheck.engineError,\n debug: undefined,\n diagnostic: undefined,\n };\n }\n\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'safety_complexity', 'Safety: Complexity', '🛡️', 'validate', 5, zeroElapsed, false, {\n type: 'safety_complexity',\n passed: true,\n complexityScore: complexityCheck.complexityScore ?? normalizedTokens.length,\n maxComplexity: this.config.validation.maxComplexity,\n breakdown: {\n tokenCount: normalizedTokens.length,\n functionCalls: 0,\n nestingDepth: 0,\n },\n });\n }\n\n if (prep.kind === 'symbolic-solve') {\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: true,\n totalTokens: tokens.length,\n totalOpcodes: 0,\n });\n }\n const emptyProgram: BytecodeProgram = { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false };\n this.storeLineResult(lineNumber, prep.value, emptyProgram, [], [], expression);\n return {\n value: prep.value,\n tokens: normalizedTokens,\n program: emptyProgram,\n debug: undefined,\n diagnostic: undefined,\n };\n }\n\n // From here, prep.kind is 'ready' or 'error' at the 'parse' stage\n // both carry `reads`/`writes` (extracted before the cache lookup/\n // parse attempt).\n const reads = prep.reads ?? [];\n const writes = prep.writes ?? [];\n\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'readwrite', 'Read/Write', '📋', 'readwrite', 6, zeroElapsed, false, {\n type: 'readwrite',\n reads,\n writes,\n isAssignment: writes.length > 0,\n });\n this.addDiagnosticStage(stages, 'cache_check', 'Cache Check', '💾', 'cache', 7, zeroElapsed, false, {\n type: 'cache_check',\n hit: !!cachedBefore,\n cacheSize: this.bytecodeCache.size,\n cacheKey: expression,\n });\n if (cachedBefore) {\n pipeline.fireCacheHit({ type: DiagnosticEventType.CacheHit, elapsedNs: 0, expression, cache: \"bytecode\", key: expression });\n } else {\n pipeline.fireCacheMiss({ type: DiagnosticEventType.CacheMiss, elapsedNs: 0, expression, cache: \"bytecode\", key: expression });\n }\n }\n\n if (prep.kind === 'error' && prep.stage === 'parse') {\n // No 'parser'/'compiler' stage, the parse attempt itself is\n // where this failed, matching the original's exact shape (it\n // only ever got as far as the cache_check stage above before\n // the parse threw).\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: false,\n totalTokens: tokens.length,\n totalOpcodes: 0,\n });\n }\n return {\n value: numberValue(0),\n tokens: normalizedTokens,\n program: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n error: prep.error.message,\n engineError: prep.error,\n debug: undefined,\n diagnostic: undefined,\n };\n }\n\n if (prep.kind !== 'ready') {\n // Unreachable: every other variant ('empty', 'error' at any\n // stage, 'symbolic-solve') was already returned above. Kept\n // only so TypeScript's discriminated-union narrowing (which\n // doesn't always simplify a chain of `kind === X || (kind ===\n // Y && stage === Z)` guards perfectly) treats `prep.program`\n // below as definitely accessible, without an `as` cast.\n throw ErrorFactory.internal({\n code: \"UNEXPECTED_ERROR\",\n message: \"Internal error: prepareExpression() returned an unexpected variant after all other cases were handled\",\n });\n }\n const program = prep.program;\n\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'parser', 'Parser', '🌳', 'parser', 8, zeroElapsed, !!cachedBefore, {\n type: 'parser',\n parselets: [],\n uniqueParseletTypes: [],\n astDepth: 0,\n });\n this.addDiagnosticStage(stages, 'compiler', 'Compiler', '⚙️', 'compiler', 9, zeroElapsed, !!cachedBefore, {\n type: 'compiler',\n opcodeCount: program.opcodes.length,\n numberConstants: program.numbers.length,\n stringConstants: program.strings.length,\n hasAsync: program.hasAsync,\n cached: !!cachedBefore,\n });\n pipeline.fireBytecodeBuilt({\n type: DiagnosticEventType.BytecodeBuilt,\n elapsedNs: 0,\n expression,\n opcodesLength: program.opcodes.length,\n numbersLength: program.numbers.length,\n stringsLength: program.strings.length,\n isCached: !!cachedBefore,\n });\n }\n\n // ══ PRE-FLIGHT ASYNC CHECK ══\n const hasAsyncGuard = program.hasAsync || this.resolverRegistry.size > 0;\n const preflight = this.preflightAsync(normalizedTokens, program, lineNumber, expression, reads, writes);\n\n if (hasCollectors) {\n if (preflight.kind === 'pending') {\n this.addDiagnosticStage(stages, 'async_preflight', 'Async Preflight', '🔮', 'async', 10, zeroElapsed, false, {\n type: 'async_preflight',\n path: 'pending',\n pendingQueryKey: preflight.value.value as string,\n resolverCount: this.resolverRegistry.size,\n skippedGuard: true,\n });\n } else if (hasAsyncGuard) {\n this.addDiagnosticStage(stages, 'async_preflight', 'Async Preflight', '🔮', 'async', 10, zeroElapsed, false, {\n type: 'async_preflight',\n path: 'sync',\n resolverCount: this.resolverRegistry.size,\n skippedGuard: false,\n });\n } else {\n this.addDiagnosticStage(stages, 'async_preflight', 'Async Preflight', '🔮', 'async', 10, zeroElapsed, true, {\n type: 'async_preflight',\n path: 'sync',\n resolverCount: 0,\n skippedGuard: true,\n });\n }\n }\n\n if (preflight.kind === 'pending') {\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: true,\n totalTokens: tokens.length,\n totalOpcodes: program.opcodes.length,\n });\n }\n return {\n value: preflight.value,\n tokens: normalizedTokens,\n program,\n debug: undefined,\n diagnostic: hasCollectors ? this.buildDiagnosticResult(stages, preflight.value, normalizedTokens, program, null) : undefined,\n };\n }\n\n // ══ VM STAGE ══\n // Delegates to executeAndStore(), the SAME method the lean path\n // calls, which already handles the AbortController/keystroke-\n // signal linking, stack cleanup, and resolveAsync/DAG-registration/\n // storeLineResult side effects internally. executeAndStore()\n // throws on a VM runtime error (matching the lean path's own\n // contract); caught here and converted to a soft `error` return,\n // exactly as this method's own inline VM-execution block used to\n // do directly, so a caller evaluating a whole multi-line document\n // one line at a time still doesn't have one bad line abort every\n // subsequent line.\n const emitVmTrace = hasCollectors && this.config.diagnostic.vmTraceEnabled === true;\n let result: Value;\n try {\n const vmResult = AllocationTracker.track('vm', () => {\n return this.executeAndStore(program, lineNumber, expression, reads, writes, '_engine', emitVmTrace ? pipeline : undefined, expression);\n }, { cacheHit: !!cachedBefore });\n result = vmResult.result;\n if (trackEnabled && vmResult.alloc) stageAllocs.push(vmResult.alloc);\n } catch (e) {\n const engineError = normalizeUnknownError(e);\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: false,\n totalTokens: tokens.length,\n totalOpcodes: program.opcodes.length,\n });\n }\n return {\n value: numberValue(0),\n tokens: normalizedTokens,\n program,\n error: engineError.message,\n engineError,\n debug: undefined,\n diagnostic: undefined,\n };\n }\n\n const isPending = result.type === ValueType.Pending;\n\n if (hasCollectors) {\n const resultValue = isPending ? 'pending' : String(result.value ?? '');\n const resultType = isPending ? 'Pending' : (result.unit ? 'Uom' : 'Number');\n this.addDiagnosticStage(stages, 'vm_execute', 'VM Execute', '⚡', 'vm', 11, zeroElapsed, false, {\n type: 'vm_execute',\n totalInstructions: program.opcodes.length,\n stackDepth: this.vm.getStack().length,\n resultType,\n resultValue,\n isPending,\n });\n }\n\n if (isPending) {\n if (hasCollectors) {\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: true,\n totalTokens: tokens.length,\n totalOpcodes: program.opcodes.length,\n });\n }\n return {\n value: result,\n tokens: normalizedTokens,\n program,\n debug: undefined,\n diagnostic: hasCollectors ? this.buildDiagnosticResult(stages, result, normalizedTokens, program, null) : undefined,\n };\n }\n\n // ══ BUILD TELEMETRY ══\n if (trackEnabled && stageAllocs.length > 0) {\n this.lastTelemetry = AllocationTracker.createTelemetry(\n expression,\n stageAllocs,\n !!cachedBefore\n );\n }\n\n // Structured: DAG Registration + LineCache + Result + PipelineEnd\n if (hasCollectors) {\n this.addDiagnosticStage(stages, 'dag_registration', 'DAG Registration', '🔗', 'dag', 12, zeroElapsed, false, {\n type: 'dag_registration',\n readsRegistered: reads,\n writesRegistered: writes,\n dataSourcesRegistered: [],\n });\n this.addDiagnosticStage(stages, 'linecache', 'Line Cache', '📦', 'cache', 13, zeroElapsed, false, {\n type: 'linecache',\n lineNumber,\n expression,\n stored: true,\n });\n this.addDiagnosticStage(stages, 'result', 'Result', '✓', 'result', 14, zeroElapsed, false, {\n type: 'result',\n rawValue: String(result.value),\n formattedValue: String(result.value),\n valueType: result.type === 0 ? 'Number' : 'Value',\n unit: result.unit,\n });\n\n pipeline.fireVmHalt({\n type: DiagnosticEventType.VmHalt,\n elapsedNs: 0,\n expression,\n result: result ? {\n type: result.type,\n value: result.value,\n unit: result.unit,\n } : undefined,\n });\n\n this.addDiagnosticStage(stages, 'pipeline_end', 'Pipeline End', '⏹', 'pipeline', 15, zeroElapsed, false, {\n type: 'pipeline_end',\n success: true,\n totalTokens: tokens.length,\n totalOpcodes: program.opcodes.length,\n cacheHit: !!cachedBefore,\n });\n\n pipeline.firePipelineEnd({\n type: DiagnosticEventType.PipelineEnd,\n elapsedNs: 0,\n expression,\n success: true,\n totalTokens: tokens.length,\n totalOpcodes: program.opcodes.length,\n });\n }\n\n // Build debug info, structured diagnostic report\n if (hasCollectors) {\n const reports = pipeline.collectReports();\n const rawDebug = reports[0]?.toJSON();\n // `rawDebug.parselets` as returned by TimelineDiagnosticCollector\n // is cumulative across the WHOLE document pass (deliberately\n // see onPipelineStart's doc comment), not scoped to this one\n // line. Without this slice, every line after the first reports\n // whichever parselet fired FIRST in the entire session\n // (typically NumberParselet, from the document's very first\n // token) as if it were this line's own, a real, confusing\n // display bug, not evidence that NumberParselet does all the\n // parsing work. Slicing from the pre-parse baseline gives just\n // the events this line's own parse actually fired.\n let debug = rawDebug;\n if (rawDebug) {\n const lineParselets = rawDebug.parselets.slice(parseletsBefore);\n // summary.totalParselets/parseCategories are recomputed from\n // the SAME per-line slice above, for the same reason\n // TimelineDiagnosticCollector's parseCategories Map is\n // cumulative across the whole document pass, so reusing it\n // as-is would report \"distinct categories seen all session\"\n // instead of \"categories this line's own parse used\" (e.g.\n // a document that touches arithmetic/datetime/finance\n // packages across many lines would show totalParselets: 3\n // on EVERY line once all three had been seen once,\n // regardless of what that specific line actually parsed).\n // summary.totalTokens/totalOpcodes/cacheHit/elapsedNs are\n // deliberately left as the collector's session-cumulative\n // values, none of them currently has a UI consumer to\n // validate a per-line reinterpretation against, and\n // equivalent, already-correct per-line values exist\n // elsewhere for tokens/opcodes/cache-hit (see LineResult's\n // own token/opcodeCount/wasCached fields in\n // packages/playground-bridge/src/engine.ts).\n const lineParseCategories: Record<string, number> = {};\n for (const p of lineParselets) {\n lineParseCategories[p.parseletCategory] = (lineParseCategories[p.parseletCategory] ?? 0) + 1;\n }\n debug = {\n ...rawDebug,\n parselets: lineParselets,\n summary: {\n ...rawDebug.summary,\n totalParselets: Object.keys(lineParseCategories).length,\n parseCategories: lineParseCategories,\n },\n };\n }\n return {\n value: result,\n tokens: normalizedTokens,\n program,\n debug,\n diagnostic: this.buildDiagnosticResult(stages, result, normalizedTokens, program, null),\n };\n }\n\n return {\n value: result,\n tokens: normalizedTokens,\n program,\n };\n }\n\n //#endregion\n\n //#region Diagnostic Result, Snapshot population\n\n /**\n * Build a complete DiagnosticPipelineResult with engine-wide snapshot data.\n *\n * Populates dagSnapshot, cacheSnapshot, batcherMetrics, and checkpoints\n * alongside the per-line pipeline stages, value, tokens, and program.\n * Previously the playground made separate engine method calls for each.\n */\n private buildDiagnosticResult(\n stages: PipelineStageResult[],\n value: Value,\n tokens: Token[],\n program: BytecodeProgram,\n error: string | null,\n ): DiagnosticPipelineResult {\n return {\n stages,\n value,\n tokens,\n program,\n error,\n dagSnapshot: this.dag.getSnapshot(),\n cacheSnapshot: this.getCacheSnapshot(),\n batcherMetrics: this.getBatcherMetrics(),\n checkpoints: this.getCheckpoints(),\n };\n }\n\n //#endregion\n\n //#region Incremental Evaluation, DAG-driven re-execution\n\n /**\n * Re-evaluate a cached line without reparsing.\n *\n * Used when a variable referenced by this line has changed. Skips\n * lexing, parsing, and compilation, performs only a pre-flight async\n * check and VM execution against the cached bytecode.\n *\n * Returns `undefined` if the line is not in cache.\n *\n * @param lineNumber - The line to re-evaluate.\n * @param expression - The original expression string (used for cache lookup).\n * @returns The updated `Value`, or `undefined` if uncached.\n */\n reEvaluateLine(lineNumber: number, expression: string): Value | undefined {\n const entry = this.lineCache.get(lineNumber, expression);\n if (!entry) return undefined;\n\n const program = this.bytecodeCache.get(expression);\n if (!program) return undefined;\n\n // ══ PRE-FLIGHT ASYNC CHECK ══\n // O(1) guard: skip the O(n) resolver scan when the bytecode has no\n // async opcodes AND no resolvers are registered.\n if (entry.bytecode.hasAsync || this.resolverRegistry.size > 0) {\n // Pre-flight async check, run before VM even for cached bytecode\n // ── Link to keystroke signal ──\n const preflightController = new AbortController();\n const abortPreflight = () => preflightController.abort();\n this.keystrokeSignal?.addEventListener('abort', abortPreflight, { once: true });\n\n abortLogger.localControllerCreated(\"reEvaluateLine preflight\");\n if (this.keystrokeSignal) {\n abortLogger.signalLinked(\"reEvaluateLine preflight\");\n }\n\n const preflightSignal = preflightController.signal;\n const asyncCheck = this.resolverRegistry.preflightAll(\n [], entry.bytecode, '_engine', preflightSignal, this.queryClient\n );\n if (asyncCheck) {\n void this.resolveAsync({\n type: 'pending',\n queryKey: asyncCheck.queryKey,\n resolver: asyncCheck.resolver,\n packageId: asyncCheck.packageId || '_engine',\n signal: asyncCheck.signal,\n });\n return pendingValue(asyncCheck.queryKey);\n }\n // Sync path, unhook the inert preflight controller's keystroke listener.\n this.keystrokeSignal?.removeEventListener('abort', abortPreflight);\n } // end hasAsync guard\n\n // No vm.reset() here: reset() clears the variable table, which would\n // wipe variables defined by other lines that this line's bytecode may\n // read. executeRaw() already snapshots and restores the stack depth.\n const evalResult = this.executeRaw(program, lineNumber);\n\n if (evalResult.type === 'pending') {\n void this.resolveAsync(evalResult);\n return pendingValue(evalResult.queryKey);\n }\n if (evalResult.type === 'error') {\n throw evalResult.error;\n }\n\n const result = evalResult.value;\n entry.result = result;\n\n return result;\n }\n\n getDag(): DependencyGraph {\n return this.dag;\n }\n\n getLineCache(): LineCache {\n return this.lineCache;\n }\n\n getBytecodeCache(): Map<string, BytecodeProgram> {\n return this.bytecodeCache;\n }\n\n /**\n * Get the shared VM instance.\n * Used by VMCheckpointer to create/restore checkpoints.\n */\n getVM(): VM {\n return this.vm;\n }\n\n /**\n * This engine's registries.\n *\n * For introspection: checking what a package registered, or asserting that\n * unregistering removed it. These used to be module-level singletons a\n * caller could import directly, which is exactly the coupling\n * {@link EngineContext} removes, so reaching them now goes through the\n * engine that owns them.\n *\n * @returns The context created for this engine. Mutating what it holds\n * affects this engine's behaviour, so treat it as read-only unless you are\n * deliberately registering something.\n */\n getContext(): EngineContext {\n return this.context;\n }\n\n getScopeManager(): ScopeManager {\n return this.scopeManager;\n }\n\n getLexer(): Lexer {\n return this.lexer;\n }\n\n /**\n * This engine's token normalizer, with every phrase and rule its packages\n * registered.\n *\n * Exposed for the highlighting path. `LanguageService` classifies tokens\n * after the lexer but can only see phrase-fused types (a date literal, a\n * timecode, a package's own fused token) by running the same normalizer\n * evaluation runs. Sharing this instance rather than building a second one\n * is what keeps the two from disagreeing.\n */\n getNormalizer(): TokenNormalizer {\n return this.normalizer;\n }\n\n /**\n * Every completion candidate contributed by currently-registered\n * packages (`IEnginePackage.completionItems`), flattened across all of\n * them. Used by `LanguageService.getCompletions()`.\n */\n getPackageCompletionItems(): CompletionItem[] {\n const items: CompletionItem[] = [];\n for (const pkgItems of this.packageCompletionItems.values()) {\n items.push(...pkgItems);\n }\n return items;\n }\n\n getParseletRegistry(): { prefix: Array<{ tokenType: string; bindingPower: number; category?: string }>; infix: Array<{ tokenType: string; leftBindingPower: number; rightBindingPower: number; category?: string }> } {\n return {\n prefix: this.registry.getAllPrefix(),\n infix: this.registry.getAllInfix(),\n };\n }\n\n /**\n * Lex + normalize (phrase fusion, implicit multiply, domain token\n * merging) `text` WITHOUT parsing or executing it, a cheap way for a\n * host to inspect what token stream a line would actually produce,\n * without paying for a full parse/compile/VM pass.\n *\n * Built for line-classification heuristics like \"does this look like a\n * real expression, or is it prose I shouldn't bother evaluating\", a\n * host that only checks for digits/operators/symbols before deciding\n * whether to evaluate a line will incorrectly skip genuine all-word\n * expressions (`weather in Tokyo`, `time in Paris`, `average of X, Y,\n * Z`), since none of those contain a digit or symbol. Checking whether\n * `tokenizeForClassification(text)[0]?.type` is anything OTHER than the\n * generic `IDENT` fallback is a reliable signal that the lexer/normalizer\n * actually recognized a specific keyword or fused multi-word phrase\n * i.e., this is real, registered vocabulary, not an arbitrary word that\n * merely happens to be lexable (every word lexes as IDENT if nothing\n * more specific claims it, so IDENT alone proves nothing about intent).\n *\n * Assumes the caller has already ruled out markdown-structural lines\n * (headings, code fences, etc.) via `getLexer().classifyLine()`. This\n * always tokenizes as a plain expression line, mirroring\n * `Lexer.resetExpression()`'s own \"caller already knows this is\n * evaluable\" contract.\n */\n tokenizeForClassification(text: string): Token[] {\n this.lexer.resetExpression(text);\n const rawTokens = Array.from(this.lexer);\n const exprTokens = rawTokens.filter(t => t.type !== 'COMMENT');\n if (exprTokens.length === 0) return [];\n return this.normalizer.normalize(exprTokens);\n }\n\n getParser(): PrecedenceParser {\n return this.parser;\n }\n\n isDiagnosticMode(): boolean {\n return this.diagnosticPipeline.hasCollectors;\n }\n\n //#endregion\n\n //#region Public API, Keystroke signal\n\n /**\n * Set the keystroke-level AbortSignal for the current evaluation cycle.\n *\n * Called by the UI layer (via ThreeTierEvaluator) before evaluate() or\n * evaluateAll(). All per-evaluation AbortControllers created during this\n * cycle link to this signal so that when the user types a new keystroke,\n * all in-flight async work is canceled atomically.\n *\n * @param signal The keystroke's AbortSignal, or null to clear.\n */\n setKeystrokeSignal(signal: AbortSignal | null): void {\n if (signal) {\n abortLogger.keystrokeSignalSet(signal.aborted);\n } else {\n abortLogger.keystrokeSignalCleared();\n }\n this.keystrokeSignal = signal;\n }\n\n /**\n * Get a serializable cache snapshot for diagnostic rendering.\n *\n * Returns bytecode cache entries, line cache entries, and async cache\n * packages, all as plain objects with no internal references. Previously\n * the playground accessed this via `(engine as any).getCacheSnapshot?.()`.\n */\n getCacheSnapshot(): CacheSnapshot {\n const bytecode: BytecodeCacheEntry[] = [];\n for (const [expression, program] of this.bytecodeCache) {\n bytecode.push({\n expression,\n opcodesLength: program.opcodes.length,\n numbersLength: program.numbers.length,\n stringsLength: program.strings.length,\n hasAsync: program.hasAsync,\n });\n }\n\n const lineCacheEntries: LineCacheEntryInfo[] = [];\n for (const key of this.lineCache.keys()) {\n // Keys are \"lineNumber\" or \"lineNumber:expression\", parse out both parts.\n const colonIdx = key.indexOf(':');\n const lineNumber = colonIdx > 0\n ? (parseInt(key.slice(0, colonIdx), 10) || 0)\n : (parseInt(key, 10) || 0);\n const expressionPart = colonIdx > 0 ? key.slice(colonIdx + 1) : undefined;\n\n const entry = expressionPart !== undefined\n ? this.lineCache.get(lineNumber, expressionPart)\n : this.lineCache.getEntryForLine(lineNumber);\n if (!entry) continue;\n\n lineCacheEntries.push({\n key,\n lineNumber,\n resultType: String(entry.result?.type ?? ''),\n resultValue: String(entry.result?.value ?? ''),\n reads: entry.readVariables ?? [],\n writeVar: entry.writeVariable ?? null,\n });\n }\n\n // Build async cache snapshot from TanStack Query cache\n const queryCache = this.queryClient.getQueryCache();\n const allQueries = queryCache.getAll();\n const asyncCache = allQueries.map(q => {\n const status = q.state.status === 'success' ? 'resolved' as const\n : q.state.status === 'error' ? 'error' as const\n : 'in_flight' as const;\n return {\n packageId: (q.queryKey[0] as string) ?? 'unknown',\n resolvedCount: q.state.status === 'success' ? 1 : 0,\n inFlightCount: q.state.status !== 'success' && q.state.status !== 'error' ? 1 : 0,\n errorCount: q.state.status === 'error' ? 1 : 0,\n entries: [{ key: q.queryKey.join(':'), status }],\n };\n });\n\n return { bytecode, lineCache: lineCacheEntries, asyncCache };\n }\n\n /**\n * Get serializable batcher metrics for the Workers diagnostic tab.\n *\n * Reads the typed read-only accessors on {@link AsyncResolutionBatcher}\n * (`pendingCount`/`dedupCount`/`workerOffloadCount`/`listenerCount`)\n * instead of reaching into its private fields via `(this.batcher as any)`.\n */\n getBatcherMetrics(): BatcherMetrics {\n return {\n pendingCount: this.batcher.pendingCount,\n dedupCount: this.batcher.dedupCount,\n workerOffloadCount: this.batcher.workerOffloadCount,\n listenerCount: this.batcher.listenerCount,\n };\n }\n\n /**\n * Get a serializable snapshot of VM checkpoints for diagnostics.\n *\n * The checkpointer lives on the ThreeTierEvaluator (not the engine),\n * so this returns an empty array when no checkpointer is available.\n * Previously accessed via `(vm as any).checkpointer.getAllCheckpoints?.()`.\n */\n getCheckpoints(): CheckpointSnapshot[] {\n // ThreeTierEvaluator attaches the checkpointer to the VM at runtime, so\n // it is not on the VM's declared surface. Describing the shape being\n // read, rather than reaching through `any`, keeps the expectation\n // checkable: if getAllCheckpoints' signature moves, this stops\n // compiling instead of failing at the call.\n const vmWithCheckpointer = this.vm as {\n checkpointer?: {\n getAllCheckpoints(): readonly { lineNumber: number; variables: Record<string, unknown> }[];\n };\n };\n const checkpointer = vmWithCheckpointer.checkpointer;\n if (!checkpointer) return [];\n\n const raw = checkpointer.getAllCheckpoints();\n return raw.map(cp => ({\n lineNumber: cp.lineNumber,\n variables: Object.keys(cp.variables),\n variableCount: Object.keys(cp.variables).length,\n }));\n }\n\n /**\n * Get the most recent pipeline telemetry from AllocationTracker.\n *\n * Returns null when AllocationTracker.isEnabled() is false (production\n * zero overhead), or when no expression has been evaluated via\n * evaluateExpressionWithDiagnostic() since the last clear().\n *\n * Use this in test/benchmark suites to inspect per-stage wall-time and\n * heap allocation data without enabling the full diagnostic pipeline.\n */\n getLastTelemetry(): PipelineTelemetry | null {\n return this.lastTelemetry;\n }\n\n //#endregion\n\n //#region Public API, Evaluation\n\n /**\n * Evaluate a raw expression string without line-number context.\n * Returns the Value result. Throws on error.\n */\n evaluateExpression(expression: string): EvalResults {\n return this.evaluateLine(-1, expression);\n }\n\n//#endregion\n\n//#region Compilation, Bytecode-only path\n\n /**\n * Compile-only path: lex → parse → bytecode, without execution.\n *\n * Used by Tier 3 (background) evaluation to discover reads/writes\n * for the dependency graph without running display-only expressions.\n *\n * Uses the bytecode cache, repeated compilations of the same expression\n * return the cached program with zero allocation.\n *\n * @param expression - The raw expression string to compile.\n * @returns Object with compiled `program`, lexed `tokens`, and extracted `reads`/`writes`.\n * @throws ErrorFactory on parse failure or safety check failure.\n */\n\tcompileExpression(expression: string): {\n\t\tprogram: BytecodeProgram;\n\t\ttokens: Token[];\n\t\treads: string[];\n\t\twrites: string[];\n\t} {\n\t\tconst { tokens, hasParens } = this.lexToTokens(expression);\n\n\t\t// Shared front-half: safety → normalize → complexity → cache/compile.\n\t\tconst prep = this.prepareExpression(expression, tokens, hasParens);\n\n\t\tif (prep.kind === 'empty') {\n\t\t\treturn {\n\t\t\t\tprogram: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n\t\t\t\ttokens: [],\n\t\t\t\treads: [],\n\t\t\t\twrites: [],\n\t\t\t};\n\t\t}\n\t\tif (prep.kind === 'error') {\n\t\t\tif (prep.stage === 'parse' && (prep.reads?.length || prep.writes?.length)) {\n\t\t\t\t// Preserve the original error's own code/category/expected/\n\t\t\t\t// found/suggestion (whatever the parser actually threw\n\t\t\t\t// UNDEFINED_VARIABLE, FUNCTION_ARITY_MISMATCH, ...) rather\n\t\t\t\t// than the generic PARSE_ERROR wrapper this used to\n\t\t\t\t// construct, but still attach the already-extracted\n\t\t\t\t// reads/writes as context so DAG-registering callers (e.g.\n\t\t\t\t// ThreeTierEvaluator's compile fallback) can track this\n\t\t\t\t// line's dependencies even though it failed to compile.\n\t\t\t\t// EngineError.context is readonly, so this constructs a new\n\t\t\t\t// error carrying every other field through unchanged rather\n\t\t\t\t// than mutating prep.error in place.\n\t\t\t\tthrow new EngineError(prep.error.category, {\n\t\t\t\t\tcode: prep.error.code,\n\t\t\t\t\tmessage: prep.error.message,\n\t\t\t\t\texpected: prep.error.expected,\n\t\t\t\t\tfound: prep.error.found,\n\t\t\t\t\tsuggestion: prep.error.suggestion,\n\t\t\t\t\trecoverable: prep.error.recoverable,\n\t\t\t\t\tspan: prep.error.span,\n\t\t\t\t\tcause: prep.error.cause,\n\t\t\t\t\tcontext: { ...prep.error.context, reads: prep.reads ?? [], writes: prep.writes ?? [] },\n\t\t\t\t});\n\t\t\t}\n\t\t\tthrow prep.error;\n\t\t}\n\t\tif (prep.kind === 'symbolic-solve') {\n\t\t\t// No real bytecode representation for a `=>`/bare-equation line\n\t\t\t// (its effect, a stored equation, a direct vm.setVar(), was\n\t\t\t// already fully computed inside prepareExpression() itself)\n\t\t\t// same \"nothing to compile\" shape as the 'empty' case above.\n\t\t\t// External tooling asking for the compiled program of a `=>`\n\t\t\t// line gets an empty one; a disclosed limitation of this\n\t\t\t// narrow grammar, not an oversight.\n\t\t\treturn {\n\t\t\t\tprogram: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n\t\t\t\ttokens: prep.normalizedTokens,\n\t\t\t\treads: [],\n\t\t\t\twrites: [],\n\t\t\t};\n\t\t}\n\n\t\treturn { program: prep.program, tokens, reads: prep.reads, writes: prep.writes };\n\t}\n\n\t/**\n\t * Non-throwing \"does this compile\" check. Same lex → prepare pipeline as\n\t * {@link compileExpression}, but returns a boolean instead of throwing on\n\t * failure.\n\t *\n\t * compileExpression()'s failure path constructs a EngineError via\n\t * ErrorFactory, which calls Error.captureStackTrace(), one of V8's more\n\t * expensive operations. That's fine for genuine execution/compile errors\n\t * (rare, and the caller needs the message), but LanguageService's\n\t * syntax-highlighting gate calls compileExpression() purely to ask \"does\n\t * this parse\", on every visible line, every keystroke, and the common\n\t * case for a real markdown document is prose lines that DON'T parse, not\n\t * the rare case. Benchmarked: constructing-and-throwing that exception on\n\t * every non-matching line was responsible for highlighting an\n\t * unrecognized-prose line costing roughly an order of magnitude more than\n\t * a recognized expression. This skips that construction entirely, still\n\t * reuses the bytecode cache and prepareExpression()'s normal work, just\n\t * never builds an Error object for the \"no\" answer.\n\t *\n\t * Note: this only avoids the outer exception compileExpression() itself\n\t * would construct. A genuinely deep parse failure (an unmatched token\n\t * mid-expression, not just \"stopped early with leftover tokens\") still\n\t * goes through the parser's own throw/catch inside prepareExpression()\n\t * unavoidable without restructuring the parser's failure signaling, which\n\t * is out of scope here.\n\t *\n\t * The \"non-throwing\" in the first line is a contract callers rely on, not\n\t * a description of the happy path, so it is enforced here rather than left\n\t * to every stage below agreeing to return its errors. It had been left to\n\t * them, and they did not all agree: the lexer throws on an unterminated\n\t * string (`\"`), and the symbolic grammar threw on an assignment whose\n\t * right-hand side is still empty (`total =`). LanguageService calls this\n\t * per visible line per keystroke, so both reached CodeMirror's transaction\n\t * dispatch and broke the editor on input that is merely half-typed.\n\t *\n\t * A catch costs nothing on the path that does not throw, so the \"no\" answer\n\t * this method exists to make cheap stays cheap. Anything that does throw\n\t * was already paying for the Error it constructed.\n\t */\n\ttryCompileExpression(expression: string): boolean {\n\t\ttry {\n\t\t\treturn this.tryCompileExpressionUnguarded(expression);\n\t\t} catch {\n\t\t\t// \"Does this compile\" has a truthful answer for every one of these:\n\t\t\t// no. Swallowing is safe precisely because the answer is a boolean\n\t\t\t// with no detail to lose; callers wanting the reason call\n\t\t\t// compileExpression(), which still throws.\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t/** The body of {@link tryCompileExpression}, which owns the contract. */\n\tprivate tryCompileExpressionUnguarded(expression: string): boolean {\n\t\tconst { tokens, hasParens } = this.lexToTokens(expression);\n\t\tconst prep = this.prepareExpression(expression, tokens, hasParens);\n\t\treturn prep.kind !== 'error';\n\t}\n\n\t/**\n\t * Execute pre-compiled bytecode against the engine's shared VM.\n\t * Used by Tier 2 (scroll into view) to re-execute cached bytecode\n\t * without re-lexing, re-parsing, or re-compiling.\n\t *\n\t * Preserves the VM stack, pops any leftover items after execution.\n\t * Does NOT update DAG or LineCache (caller is responsible for state\n\t * management via DocumentModel).\n\t *\n\t * @returns The execution result, or undefined if bytecode is empty.\n\t * @param lineNumber - 1-based line this bytecode belongs to, for\n\t * cross-line features (see `makeLineContext()`). Defaults to -1.\n\t */\n\texecuteCached(program: BytecodeProgram, lineNumber: number = -1): Value {\n\t\tif (program.opcodes.length === 0) {\n\t\t\treturn numberValue(0);\n\t\t}\n\t\tconst evalResult = this.executeRaw(program, lineNumber);\n\n\t\tif (evalResult.type === 'pending') {\n\t\t\tvoid this.resolveAsync(evalResult);\n\t\t\treturn pendingValue(evalResult.queryKey);\n\t\t}\n\t\tif (evalResult.type === 'error') {\n\t\t\t// This is exactly the Tier-2/LOAD_GLOBAL_VAR bypass path\n\t\t\t// ARCHITECTURE.md's P0 item describes, executeCached() never\n\t\t\t// calls preflightAll(), so a global-variable read that should\n\t\t\t// have been guaranteed-resolved by preflight can now surface\n\t\t\t// here as a controlled GLOBAL_VARIABLE_NOT_RESOLVED error\n\t\t\t// (see VM.ts's LOAD_GLOBAL_VAR case) instead of a raw\n\t\t\t// uncaught TypeError. Re-throw so the caller's existing\n\t\t\t// error handling (ThreeTierEvaluator's own per-tier try/catch)\n\t\t\t// handles it exactly like any other executeCached() failure.\n\t\t\tthrow evalResult.error;\n\t\t}\n\n\t\treturn evalResult.value;\n\t}\n\n /**\n * Fast path: evaluate an expression and return a number directly.\n *\n * Skips Value object allocation when only a numeric result is needed.\n * Returns NaN on error or for bare undefined variable references.\n *\n * Performs a pre-check for bare identifiers (single-token variable\n * references). If the identifier is not a known variable, returns NaN\n * immediately without attempting evaluation, avoids the ambiguity of\n * \"result === 0\" when a variable might legitimately store the value 0.\n *\n * @param expression - The raw expression string to evaluate.\n * @returns The numeric result, or NaN on error/undefined variable.\n */\n evaluateNumber(expression: string): number {\n const trimmed = expression.trim();\n\n // Pre-check: bare identifiers that aren't known variables → NaN.\n // Doing this before evaluation avoids the ambiguity of \"result === 0\"\n // when a variable might legitimately store the value 0.\n if (/^[a-zA-Z_][a-zA-Z0-9_]*$/.test(trimmed)) {\n if (this.vm.getVar(trimmed) === undefined) {\n return NaN;\n }\n }\n\n try {\n const results = this.evaluateLine(-1, expression);\n return results[0].toNumber();\n } catch {\n return NaN;\n }\n }\n\n //#endregion\n\n //#region State management, Clear / reset\n\n clear(): void {\n // Cancel pending batcher flushes and clear listeners to prevent\n // stale re-evaluations from in-flight promises that resolve after clear.\n\t\t// This call is what actually releases per-document state. The batcher is\n\t\t// reachable from the module-level data-query service, so an engine that\n\t\t// goes out of scope without clear() stays retained: measured at 46.9KB\n\t\t// per engine against 8.2KB for one that never parsed. See the class doc.\n\t\tthis.batcher.clearAll();\n\n\t\t// The query cache holds a garbage-collection timer per cached query,\n\t\t// armed for `gcTime` (ten minutes). Those timers keep a Node process\n\t\t// alive on their own, so an engine cleared but not emptied here leaves\n\t\t// the host unable to exit for up to ten minutes after its last live\n\t\t// lookup. That is what it was doing to the test suite: every spec\n\t\t// passed, then Jest sat waiting on timers belonging to engines whose\n\t\t// documents were long gone.\n\t\t//\n\t\t// It also belongs here on its own terms. This method is documented as\n\t\t// the call that releases per-document state, and cached query results\n\t\t// are per-document state.\n\t\tthis.queryClient.clear();\n\n\t\t// The active client is a module-level hand-off for synchronous VM\n\t\t// plugin functions. Leaving ours published after clear() would let a\n\t\t// later execution read a cache this engine no longer owns.\n\t\tif (getActiveQueryClient() === this.queryClient) setActiveQueryClient(null);\n\n this.dag.clear();\n this.lineCache.clear();\n this.scopeManager.clear();\n this.bytecodeCache.clear();\n this.vm.reset();\n this.lastTelemetry = null;\n }\n\n //#endregion\n\n //#region Public API, Incremental evaluation\n\n /**\n * Incrementally re-evaluate lines affected by a variable change.\n * Walks the DAG from the changed variable to find exactly which lines\n * need re-execution, no dirty-set indirection, no sorting guesswork.\n * Uses Kahn's algorithm for topological ordering: producers always\n * execute before consumers, regardless of document line order.\n */\n evaluateIncremental(variable: string, newValue: number): Map<number, Value> {\n // Phase 1.4 DAG-walk: get affected lines in topological order.\n // This replaces the old approach of markDirtyFromVariable() →\n // getDirtyLines() → ascending sort, which (a) double-iterated,\n // (b) picked up unrelated dirty lines, and (c) failed for\n // non-ascending dependency chains.\n const affectedLines = this.dag.getAffectedLinesInOrder(variable);\n\n // Preserve existing VM state while overriding the changed variable.\n this.vm.setVar(variable, numberValue(newValue));\n\n const updated = new Map<number, Value>();\n\n for (const lineNumber of affectedLines) {\n const entry = this.lineCache.getEntryForLine(lineNumber);\n if (!entry || entry.bytecode.opcodes.length === 0) continue;\n const evalResult = this.executeRaw(entry.bytecode, lineNumber);\n\n if (evalResult.type === 'pending') {\n void this.resolveAsync(evalResult);\n // Don't block, continue processing other affected lines.\n // The pending result will trigger re-evaluation when resolved.\n continue;\n }\n if (evalResult.type === 'error') {\n // Same per-line-containment shape as\n // AsyncResolutionBatcher.reExecuteMainThread()'s fatal-bug\n // fix: this loop re-executes potentially many DAG-affected\n // lines in one pass, a throw here would abort every\n // remaining affected line even though nothing was wrong\n // with them. Record this one line's failure as an Error\n // Value and continue, rather than letting one bad line take\n // out the whole incremental-update batch.\n const value = errorValue(evalResult.error.code, evalResult.error.message);\n updated.set(lineNumber, value);\n entry.result = value;\n continue;\n }\n\n const result = evalResult.value;\n updated.set(lineNumber, result);\n entry.result = result;\n }\n return updated;\n }\n\n //#endregion\n}\n\n//#endregion","/**\n * SegmentTree, an order-statistic Treap (randomized BST).\n *\n * Replaces the flat `lineOrder: number[]` array in DocumentModel with a\n * balanced tree that supports O(log N) insert, delete, and get-at-index\n * operations. Each node stores a `lineId` and its subtree size, enabling\n * order-statistic queries (find the k-th element by position).\n *\n * Key operations:\n * getAt(index), O(log N) expected\n * insertAt(index), O(log N) expected\n * deleteAt(index), O(log N) expected\n * spliceAt(index, deleteCount, newIds), O(log N + deleteCount + insertCount)\n * indexOf(lineId), O(N) without reverse map; cached lazily in DocumentModel\n *\n * Implementation: Treap (Tree + Heap) with implicit keys.\n * Nodes are ordered by position (in-order traversal), not by lineId value.\n * The `size` field enables O(log N) order statistics.\n * Random priorities maintain balance with high probability (O(log N) depth).\n *\n * Memory: ~40 bytes per node (lineId + size + priority + left + right).\n * For 100K lines: ~4MB for tree structure (acceptable).\n */\n\n// ── Types ──────────────────────────────────────────────────────────────────\n\ninterface Node {\n\tlineId: number;\n\t/** Total number of nodes in this subtree (including self). */\n\tsize: number;\n\t/** Random priority for heap property (maintains balance). */\n\tpriority: number;\n\tleft: Node | null;\n\tright: Node | null;\n}\n\n// ── SegmentTree ────────────────────────────────────────────────────────────\n\n/**\n * Maps document offsets to line numbers in logarithmic time.\n *\n * A document is edited constantly, and every edit shifts the offsets of every\n * line after it. Recomputing them linearly on each keystroke is what this\n * avoids.\n */\nexport class SegmentTree {\n\tprivate root: Node | null = null;\n\n\t// ── Public API ───────────────────────────────────────────────────────\n\n\t/** Total number of elements in the tree. */\n\tget length(): number {\n\t\treturn this.root ? this.root.size : 0;\n\t}\n\n\t/** Whether the tree is empty. */\n\tget isEmpty(): boolean {\n\t\treturn this.root === null;\n\t}\n\n\t/**\n\t * Get the lineId at the given 0-based index.\n\t * Returns undefined if index is out of bounds.\n\t * O(log N) expected.\n\t */\n\tgetAt(index: number): number | undefined {\n\t\tif (index < 0 || index >= (this.root?.size ?? 0)) return undefined;\n\t\treturn this.nodeAt(this.root, index).lineId;\n\t}\n\n\t/**\n\t * Insert a single lineId at the given 0-based index.\n\t * O(log N) expected.\n\t */\n\tinsertAt(index: number, lineId: number): void {\n\t\tconst [left, right] = split(this.root, index);\n\t\tthis.root = merge(merge(left, createNode(lineId)), right);\n\t}\n\n\t/**\n\t * Delete a single element at the given 0-based index.\n\t * Returns the removed lineId, or undefined if out of bounds.\n\t * O(log N) expected.\n\t */\n\tdeleteAt(index: number): number | undefined {\n\t\tif (index < 0 || index >= (this.root?.size ?? 0)) return undefined;\n\n\t\tconst [left, midRight] = split(this.root, index);\n\t\tconst [mid, right] = split(midRight, 1);\n\n\t\tconst removed = mid ? mid.lineId : undefined;\n\t\tthis.root = merge(left, right);\n\t\treturn removed;\n\t}\n\n\t/**\n\t * Bulk splice: delete `deleteCount` elements at `startIndex` (0-based),\n\t * then insert `newIds` in their place.\n\t *\n\t * Returns the removed lineId array.\n\t * O(log N + deleteCount + insertCount) expected.\n\t */\n\tspliceAt(\n\t\tstartIndex: number,\n\t\tdeleteCount: number,\n\t\tnewIds: number[]\n\t): number[] {\n\t\tconst clampedStart = Math.max(0, startIndex);\n\t\tconst clampedCount = Math.min(\n\t\t\tMath.max(0, deleteCount),\n\t\t\t(this.root?.size ?? 0) - clampedStart\n\t\t);\n\n\t\t// Split into three parts: [0, start) [start, start+count) [start+count, end)\n\t\tconst [left, midRight] = split(this.root, clampedStart);\n\t\tconst [mid, right] = split(midRight, clampedCount);\n\n\t\t// Collect removed IDs\n\t\tconst removed = collectInOrder(mid);\n\n\t\t// Build a treap from the new IDs and merge\n\t\tconst newTree = buildTreap(newIds, 0, newIds.length);\n\t\tthis.root = merge(merge(left, newTree), right);\n\n\t\treturn removed;\n\t}\n\n\t/**\n\t * Replace the entire tree with a new set of lineIds.\n\t * O(N), builds a balanced treap from a flat array.\n\t */\n\treplaceAll(lineIds: number[]): void {\n\t\tthis.root = buildTreap(lineIds, 0, lineIds.length);\n\t}\n\n\t/**\n\t * Get a contiguous range of lineIds by index.\n\t * O(rangeSize + log N), single in-order walk instead of N × O(log N).\n\t *\n\t * This is the hot path for viewport rendering in DocumentModel.getVisibleLines().\n\t */\n\tgetRange(startIndex: number, endIndex: number): number[] {\n\t\tconst clampedStart = Math.max(0, startIndex);\n\t\tconst clampedEnd = Math.min((this.root?.size ?? 0) - 1, endIndex);\n\t\tif (clampedStart > clampedEnd) return [];\n\n\t\tconst result: number[] = [];\n\t\tthis.collectRange(this.root, clampedStart, clampedEnd, 0, result);\n\t\treturn result;\n\t}\n\n\t/**\n\t * Clear the tree.\n\t */\n\tclear(): void {\n\t\tthis.root = null;\n\t}\n\n\t// ── Iteration ─────────────────────────────────────────────────────────\n\n\t/**\n\t * In-order iterator yielding all lineIds.\n\t */\n\t*[Symbol.iterator](): IterableIterator<number> {\n\t\tyield* this.inOrder(this.root);\n\t}\n\n\tprivate *inOrder(node: Node | null): IterableIterator<number> {\n\t\tif (!node) return;\n\t\tyield* this.inOrder(node.left);\n\t\tyield node.lineId;\n\t\tyield* this.inOrder(node.right);\n\t}\n\n\t// ── Private helpers ───────────────────────────────────────────────────\n\n\tprivate nodeAt(node: Node | null, index: number): Node {\n\t\t// This is only called with valid indices, so node is non-null\n\t\tconst leftSize = node!.left ? node!.left.size : 0;\n\n\t\tif (index < leftSize) {\n\t\t\treturn this.nodeAt(node!.left, index);\n\t\t} else if (index === leftSize) {\n\t\t\treturn node!;\n\t\t} else {\n\t\t\treturn this.nodeAt(node!.right, index - leftSize - 1);\n\t\t}\n\t}\n\n\t/**\n\t * Collect all node values in the range [targetStart, targetEnd] into result.\n\t * `offset` is the 0-based start of the current subtree within the full tree.\n\t * O(rangeSize + log N), skips entire subtrees outside the target range.\n\t */\n\tprivate collectRange(\n\t\tnode: Node | null,\n\t\ttargetStart: number,\n\t\ttargetEnd: number,\n\t\toffset: number,\n\t\tresult: number[]\n\t): void {\n\t\tif (!node) return;\n\n\t\tconst leftSize = node.left ? node.left.size : 0;\n\t\tconst nodeIndex = offset + leftSize;\n\n\t\t// Traverse left subtree if it overlaps the target range\n\t\tif (nodeIndex > targetStart && node.left) {\n\t\t\tthis.collectRange(node.left, targetStart, targetEnd, offset, result);\n\t\t}\n\n\t\t// Include this node if within range\n\t\tif (nodeIndex >= targetStart && nodeIndex <= targetEnd) {\n\t\t\tresult.push(node.lineId);\n\t\t}\n\n\t\t// Traverse right subtree if it overlaps the target range\n\t\tif (nodeIndex < targetEnd && node.right) {\n\t\t\tthis.collectRange(node.right, targetStart, targetEnd, nodeIndex + 1, result);\n\t\t}\n\t}\n}\n\n// ── Free functions ──────────────────────────────────────────────────────────\n\n/** Create a new treap node. */\nfunction createNode(lineId: number): Node {\n\treturn {\n\t\tlineId,\n\t\tsize: 1,\n\t\tpriority: Math.random(),\n\t\tleft: null,\n\t\tright: null,\n\t};\n}\n\n/** Update a node's size from its children. */\nfunction updateSize(node: Node): void {\n\tnode.size = 1 + (node.left ? node.left.size : 0) + (node.right ? node.right.size : 0);\n}\n\n/**\n * Merge two treaps. All keys in `left` must be ≤ all keys in `right`.\n * O(log N) expected.\n */\nfunction merge(left: Node | null, right: Node | null): Node | null {\n\tif (!left) return right;\n\tif (!right) return left;\n\n\tif (left.priority > right.priority) {\n\t\tleft.right = merge(left.right, right);\n\t\tupdateSize(left);\n\t\treturn left;\n\t} else {\n\t\tright.left = merge(left, right.left);\n\t\tupdateSize(right);\n\t\treturn right;\n\t}\n}\n\n/**\n * Split a treap at `index` (0-based).\n * Returns [left, right] where `left` contains the first `index` elements\n * and `right` contains the rest.\n * O(log N) expected.\n */\nfunction split(\n\tnode: Node | null,\n\tindex: number\n): [Node | null, Node | null] {\n\tif (!node) return [null, null];\n\n\tconst leftSize = node.left ? node.left.size : 0;\n\n\tif (index <= leftSize) {\n\t\tconst [left, right] = split(node.left, index);\n\t\tnode.left = right;\n\t\tupdateSize(node);\n\t\treturn [left, node];\n\t} else {\n\t\tconst [left, right] = split(node.right, index - leftSize - 1);\n\t\tnode.right = left;\n\t\tupdateSize(node);\n\t\treturn [node, right];\n\t}\n}\n\n/**\n * Collect all lineIds from a treap in-order.\n * O(N).\n */\nfunction collectInOrder(node: Node | null): number[] {\n\tconst result: number[] = [];\n\tcollect(node, result);\n\treturn result;\n}\n\nfunction collect(node: Node | null, result: number[]): void {\n\tif (!node) return;\n\tcollect(node.left, result);\n\tresult.push(node.lineId);\n\tcollect(node.right, result);\n}\n\n/**\n * Build a balanced treap from a flat array of lineIds.\n * Uses divide-and-conquer with pre-sorted priorities to produce\n * a heap-ordered tree in O(N) time.\n * O(N).\n */\nfunction buildTreap(lineIds: number[], start: number, end: number): Node | null {\n\tif (start >= end) return null;\n\n\tconst mid = Math.floor((start + end) / 2);\n\n\t// Generate a deterministic-but-random priority based on position\n\t// This ensures the same array always produces the same tree shape\n\tconst priority = pseudoRandom(mid);\n\n\tconst node: Node = {\n\t\tlineId: lineIds[mid],\n\t\tsize: end - start,\n\t\tpriority,\n\t\tleft: buildTreap(lineIds, start, mid),\n\t\tright: buildTreap(lineIds, mid + 1, end),\n\t};\n\n\treturn node;\n}\n\n/**\n * Simple pseudo-random number generator for deterministic treap building.\n * Uses a multiplicative hash of the input.\n */\nfunction pseudoRandom(seed: number): number {\n\tlet x = seed;\n\tx = ((x >> 16) ^ x) * 0x45d9f3b;\n\tx = ((x >> 16) ^ x) * 0x45d9f3b;\n\tx = (x >> 16) ^ x;\n\treturn x / 0xffffffff; // normalize to [0, 1)\n}\n","import { Value } from \"@solve-js/vm/Value\";\nimport { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport { djb2Hash } from \"@solve-js/utilities/Hash\";\nimport { SegmentTree } from \"@solve-js/engine/SegmentTree\";\nimport { DEFAULT_CONFIG } from \"@solve-js/constants/Configuration\";\nimport { countLines } from \"@solve-js/utilities/Strings\";\nimport { ErrorFactory } from \"@solve-js/errors/UnifiedErrorFramework\";\n\n// ── LineState ──────────────────────────────────────────────────────────────\n\n/**\n * Persistent per-line state tracked by the DocumentModel.\n *\n * Each line receives an immutable `lineId` that survives structural edits\n * (insertions, deletions, line shifts). This allows caches, the dependency\n * graph, and VM checkpoints to reference lines by ID instead of by volatile\n * line numbers.\n *\n * ── Multi-expression support ─────────────────────────────────────────\n * A single document line may contain multiple inline solves (`s\\`...\\``).\n * To support this without breaking the 1:1 line-to-DAG-node contract:\n * - `expressions[]` holds all extracted expression strings (1 entry for\n * full-line expressions, N entries for N inline solves).\n * - `bytecodes[]` holds compiled bytecode in corresponding order.\n * - `results[]` holds evaluation **result groups** in corresponding order.\n * Each element is a `Value[]`, a group of Values produced by that expression.\n * For variable definitions, the group always has exactly 1 element.\n * For multi-output expressions (e.g., currency conversion), the group\n * may have multiple Values (one per target unit).\n * - `reads[]` and `writes[]` are aggregated across ALL expressions on\n * the line, the DAG treats the line as a single dependency node.\n * - `inlineSolveCount` is 0 for full-line expressions, >0 for inline solves.\n */\nexport interface LineState {\n\t/** Immutable unique identifier, survives all structural edits. */\n\treadonly lineId: number;\n\n\t/** djb2 hash of the line text, used for O(1) change detection. */\n\ttextHash: number;\n\n\t/** The full line text (may include markdown). */\n\ttext: string;\n\n\t/**\n\t * Extracted expression texts.\n\t * - Full-line expressions: one entry (the trimmed text).\n\t * - Inline solve lines: one entry per `s\\`...\\`` span, in left-to-right order.\n\t * - Markdown-only lines: empty array.\n\t */\n\texpressions: string[];\n\n\t/**\n\t * Compiled bytecode for each expression, in corresponding order.\n\t * Parallel to {@link expressions}.\n\t */\n\tbytecodes: BytecodeProgram[];\n\n\t/** Variables this line reads (for dependency tracking). Aggregated across all expressions. */\n\treads: string[];\n\n\t/** Variables this line writes (empty if not a variable definition). Aggregated across all expressions. */\n\twrites: string[];\n\n\t/**\n\t * Evaluation result groups for each expression, in corresponding order.\n\t * Each `Value[]` is a group of Values produced by one expression.\n\t * Variable definitions always produce exactly 1 Value per group.\n\t * Multi-output expressions (e.g. currency conversion) may produce N Values.\n\t */\n\tresults: Value[][];\n\n\t/**\n\t * Convenience accessor for the first expression's first result.\n\t * Equals `results[0]?.[0] ?? null`. For single-expression lines,\n\t * this is the primary result. For multi-expression (inline solve) lines,\n\t * prefer accessing `results[i][j]` directly.\n\t */\n\tresult: Value | null;\n\n\t/** True if this line needs re-evaluation. */\n\tdirty: boolean;\n\n\t/** True if any expression on this line defines a variable (never evict bytecode). */\n\tisVariableDef: boolean;\n\n\t/** True if this line contains only markdown (no evaluable expression). */\n\tisEmpty: boolean;\n\n\t/**\n\t * Number of inline solve expressions on this line.\n\t * 0 = full-line expression (or markdown-only).\n\t * >0 = N inline solves embedded in markdown text.\n\t */\n\tinlineSolveCount: number;\n}\n\n// ── ViewportRange ──────────────────────────────────────────────────────────\n\n/** The visible line range, used to decide which lines are evaluated eagerly. */\nexport interface ViewportRange {\n\tstartLine: number; // 1-based, inclusive\n\tendLine: number; // 1-based, inclusive\n}\n\n// ── LineChange ─────────────────────────────────────────────────────────────\n\n/** Describes a structural change to the document's line list. */\nexport interface LineChange {\n\t/** 1-based line number where the change starts. */\n\tstartLine: number;\n\t/** Number of lines deleted (0 for pure insertion). */\n\tdeleteCount: number;\n\t/** New line texts inserted in place of deleted lines. */\n\tinsertLines: string[];\n}\n\n// ── ApplyChangesResult ─────────────────────────────────────────────────────\n\n/** Result of applying changes to the document model. */\nexport interface ApplyChangesResult {\n\t/** Line IDs of newly inserted lines. */\n\tinserted: number[];\n\t/** Line IDs that were removed. */\n\tremoved: number[];\n}\n\n// ── DocumentModel ──────────────────────────────────────────────────────────\n\n/**\n * Persistent document model with O(log N) line lookups and structural edits.\n *\n * Design:\n * - Each line has an immutable `lineId` (monotonically increasing counter).\n * - `LineState` objects are stored in a `Map<lineId, LineState>` for O(1) access.\n * - Line ordering is maintained in a `SegmentTree` (order-statistic Treap) that\n * supports O(log N) insert, delete, and get-at-index operations.\n * - A lazy position cache (`Map<lineId, number>`) provides O(1) position lookups\n * after the first `getLinePosition()` call and is invalidated on structural edits.\n *\n * Key invariant: line IDs never change, only their positions in the order tree.\n * This means cached bytecode, dependency graph entries, and VM checkpoints\n * keyed by lineId remain valid across all structural edits.\n */\nexport class DocumentModel {\n\t/** Persistent line ID → LineState. */\n\tprivate lines: Map<number, LineState> = new Map();\n\n\t/** Order-statistic treap representing the current document line order. */\n\tprivate orderTree: SegmentTree = new SegmentTree();\n\n\t/** Monotonically increasing counter for new line IDs. */\n\tprivate nextLineId: number = 1;\n\n\t/**\n\t * Lazy position cache: lineId → 1-based position.\n\t * Built on first `getLinePosition()` call, invalidated on structural edits.\n\t */\n\tprivate _positionCache: Map<number, number> | null = null;\n\n\t/**\n\t * Line IDs currently marked dirty, maintained alongside every\n\t * `state.dirty` mutation (in this class and in every other module that\n\t * holds a direct `LineState` reference: ThreeTierEvaluator, PageManager).\n\t * Lets {@link hasAnyDirtyLineBefore} answer \"is anything before position\n\t * X dirty\" in O(d log N), d = current dirty count, typically tiny once\n\t * a document has settled after its initial evaluation, instead of\n\t * O(N log N), which used to mean every scroll event re-walked the WHOLE\n\t * document via `getLineAt()` regardless of how little of it was actually\n\t * dirty. Benchmarked: ~10.6ms per setViewport() call scrolled near the\n\t * bottom of a 20k-line document before this fix.\n\t */\n\tprivate dirtyLineIds: Set<number> = new Set();\n\n\t/**\n\t * Most lines this model will hold. See `constants/Configuration.ts`'s\n\t * `performance.maxDocumentLines`, which is where the default comes from and\n\t * which a host raises through its engine config; a host that builds a\n\t * DocumentModel directly passes it here instead.\n\t */\n\tprivate readonly maxLines: number;\n\n\t/**\n\t * @param maxLines - Ceiling on the line count, defaulting to the engine's\n\t * configured one. Every line costs a LineState with six arrays in it\n\t * whatever the line says, so the cost of a document is its line count and\n\t * nothing else bounds it: two hundred thousand lines of `1 + 1` exhausted\n\t * the heap here, before a single expression had been looked at.\n\t */\n\tconstructor(maxLines: number = DEFAULT_CONFIG.performance.maxDocumentLines) {\n\t\tthis.maxLines = maxLines;\n\t}\n\n\t// ── Initialization ──────────────────────────────────────────────────\n\n\t/**\n\t * Initialize or replace the entire document from a text blob.\n\t * Clears all existing state and assigns new persistent line IDs.\n\t *\n\t * @throws `DOCUMENT_TOO_LARGE` for a document past {@link maxLines}, before\n\t * any of it is stored. Recoverable: nothing has been replaced yet, so the\n\t * model still holds whatever it held.\n\t */\n\tsetDocument(text: string): void {\n\t\t// Counted before anything is cleared, so a refused document leaves the\n\t\t// previous one intact rather than half-replaced.\n\t\tconst lineCount = countLines(text, this.maxLines);\n\t\tif (lineCount > this.maxLines) {\n\t\t\tthrow ErrorFactory.execution(\n\t\t\t\t\"DOCUMENT_TOO_LARGE\",\n\t\t\t\t`This document has more than ${this.maxLines.toLocaleString(\"en-US\")} lines, which is the most the engine will hold at once`,\n\t\t\t\t{ maxLines: this.maxLines },\n\t\t\t);\n\t\t}\n\t\tthis.lines.clear();\n\t\tthis.orderTree.clear();\n\t\tthis._positionCache = null;\n\t\tthis.dirtyLineIds.clear();\n\t\tthis.nextLineId = 1;\n\n\t\tconst rawLines = text.split(\"\\n\");\n\t\tconst lineIds = new Array<number>(rawLines.length);\n\n\t\tfor (let i = 0; i < rawLines.length; i++) {\n\t\t\tconst lineId = this.nextLineId++;\n\t\t\tlineIds[i] = lineId;\n\t\t\tthis.lines.set(lineId, {\n\t\t\t\tlineId,\n\t\t\t\ttextHash: djb2Hash(rawLines[i]),\n\t\t\t\ttext: rawLines[i],\n\t\t\t\texpressions: [],\n\t\t\t\tbytecodes: [],\n\t\t\t\treads: [],\n\t\t\t\twrites: [],\n\t\t\t\tresults: [],\n\t\t\t\tresult: null,\n\t\t\t\tdirty: true,\n\t\t\t\tisVariableDef: false,\n\t\t\t\tisEmpty: rawLines[i].trim().length === 0,\n\t\t\t\tinlineSolveCount: 0,\n\t\t\t});\n\t\t}\n\n\t\t// O(N) balanced treap build from flat array\n\t\tthis.orderTree.replaceAll(lineIds);\n\n\t\t// Every line starts dirty (see the object literal above), seed the\n\t\t// tracking set to match. This is the one place the set is legitimately\n\t\t// O(N): a fresh document needs full evaluation anyway.\n\t\tfor (const id of lineIds) this.dirtyLineIds.add(id);\n\t}\n\n\t// ── Structural edits ────────────────────────────────────────────────\n\n\t/**\n\t * Apply one or more line-level changes to the document.\n\t *\n\t * **Precondition:** Changes must be **non-overlapping** in their line ranges.\n\t * If two changes target the same or adjacent lines, the reverse-order\n\t * processing may produce incorrect results because the first-applied\n\t * change shifts the line numbers that the second change references.\n\t *\n\t * Changes are applied in **reverse order** (highest startLine first) so\n\t * that earlier changes in the document don't shift the indices of later\n\t * changes during processing.\n\t *\n\t * Returns both the newly inserted line IDs and the removed line IDs.\n\t * Callers should use `removed` to clean up the dependency graph and\n\t * other data structures keyed by lineId.\n\t */\n\tapplyChanges(changes: LineChange[]): ApplyChangesResult {\n\t\tconst inserted: number[] = [];\n\t\tconst removed: number[] = [];\n\n\t\t// Sort descending by startLine so earlier changes don't shift later indices\n\t\tconst sorted = [...changes].sort((a, b) => b.startLine - a.startLine);\n\n\t\tfor (const change of sorted) {\n\t\t\tconst startIdx = change.startLine - 1; // convert to 0-based\n\n\t\t\t// Create new LineState entries for inserted lines\n\t\t\tconst newIds: number[] = [];\n\t\t\tfor (const text of change.insertLines) {\n\t\t\t\tconst lineId = this.nextLineId++;\n\t\t\t\tnewIds.push(lineId);\n\t\t\t\tinserted.push(lineId);\n\t\t\t\tthis.lines.set(lineId, {\n\t\t\t\t\tlineId,\n\t\t\t\t\ttextHash: djb2Hash(text),\n\t\t\t\t\ttext,\n\t\t\t\t\texpressions: [],\n\t\t\t\t\tbytecodes: [],\n\t\t\t\t\treads: [],\n\t\t\t\t\twrites: [],\n\t\t\t\t\tresults: [],\n\t\t\t\t\tresult: null,\n\t\t\t\t\tdirty: true,\n\t\t\t\t\tisVariableDef: false,\n\t\t\t\t\tisEmpty: text.trim().length === 0,\n\t\t\t\t\tinlineSolveCount: 0,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\t// New lines start dirty (see the object literal above), track them.\n\t\t\tfor (const id of newIds) this.dirtyLineIds.add(id);\n\n\t\t\t// O(log N) splice: delete old IDs, insert new IDs\n\t\t\tconst removedIds = this.orderTree.spliceAt(\n\t\t\t\tstartIdx,\n\t\t\t\tchange.deleteCount,\n\t\t\t\tnewIds\n\t\t\t);\n\t\t\tfor (const id of removedIds) {\n\t\t\t\tremoved.push(id);\n\t\t\t\tthis.lines.delete(id);\n\t\t\t\tthis.dirtyLineIds.delete(id);\n\t\t\t}\n\t\t}\n\n\t\t// Invalidate position cache, positions shifted for all lines\n\t\tthis._positionCache = null;\n\n\t\treturn { inserted, removed };\n\t}\n\n\t/**\n\t * Insert new lines at the given 1-based position.\n\t * Convenience wrapper around applyChanges.\n\t */\n\tinsertLines(atLine: number, texts: string[]): number[] {\n\t\tconst change: LineChange = {\n\t\t\tstartLine: atLine,\n\t\t\tdeleteCount: 0,\n\t\t\tinsertLines: texts,\n\t\t};\n\t\tconst result = this.applyChanges([change]);\n\t\treturn result.inserted;\n\t}\n\n\t/**\n\t * Delete lines in the given 1-based range [startLine, endLine] inclusive.\n\t * Convenience wrapper around applyChanges.\n\t */\n\tdeleteLines(startLine: number, endLine: number): number[] {\n\t\tconst change: LineChange = {\n\t\t\tstartLine,\n\t\t\tdeleteCount: endLine - startLine + 1,\n\t\t\tinsertLines: [],\n\t\t};\n\t\tconst result = this.applyChanges([change]);\n\t\treturn result.removed;\n\t}\n\n\t/**\n\t * Update the text of a single line in place.\n\t * If the text hash differs, marks the line dirty and clears its\n\t * bytecode/result so it gets re-evaluated.\n\t *\n\t * Returns true if the text actually changed (hash mismatch).\n\t */\n\teditLine(lineNumber: number, newText: string): boolean {\n\t\tconst state = this.getLineAt(lineNumber);\n\t\tif (!state) return false;\n\n\t\tconst newHash = djb2Hash(newText);\n\t\tif (newHash === state.textHash) return false;\n\n\t\tstate.text = newText;\n\t\tstate.textHash = newHash;\n\t\tstate.expressions = [];\n\t\tstate.bytecodes = [];\n\t\tstate.results = [];\n\t\tstate.result = null;\n\t\tstate.inlineSolveCount = 0;\n\t\tstate.dirty = true;\n\t\tthis.dirtyLineIds.add(state.lineId);\n\t\tstate.isEmpty = newText.trim().length === 0;\n\t\treturn true;\n\t}\n\n\t// ── Queries ─────────────────────────────────────────────────────────\n\n\t/**\n\t * Get the LineState at the given 1-based line position. O(1).\n\t */\n\tgetLineAt(position: number): LineState | undefined {\n\t\tconst idx = position - 1;\n\t\tconst lineId = this.orderTree.getAt(idx);\n\t\tif (lineId === undefined) return undefined;\n\t\treturn this.lines.get(lineId);\n\t}\n\n\t/**\n\t * Get the 1-based position of a line by its persistent ID.\n\t * Returns -1 if the line ID is not in the document.\n\t *\n\t * Uses a lazy position cache: O(N) on first call after structural edit,\n\t * O(1) on subsequent calls. The cache is invalidated by any structural edit.\n\t */\n\tgetLinePosition(lineId: number): number {\n\t\tif (this._positionCache) {\n\t\t\treturn this._positionCache.get(lineId) ?? -1;\n\t\t}\n\n\t\t// Build position cache on first call after invalidation\n\t\tthis._positionCache = new Map();\n\t\tlet pos = 1;\n\t\tfor (const id of this.orderTree) {\n\t\t\tthis._positionCache.set(id, pos++);\n\t\t}\n\n\t\treturn this._positionCache.get(lineId) ?? -1;\n\t}\n\n\t/**\n\t * Get all LineState entries within the given viewport range (1-based, inclusive).\n\t * Uses SegmentTree.getRange() for O(viewport + log N) collection instead of\n\t * O(viewport × log N) per-line lookups.\n\t */\n\tgetVisibleLines(startLine: number, endLine: number): LineState[] {\n\t\tconst lineIds = this.orderTree.getRange(startLine - 1, endLine - 1);\n\t\tconst result: LineState[] = [];\n\t\tfor (const lineId of lineIds) {\n\t\t\tconst state = this.lines.get(lineId);\n\t\t\tif (state) result.push(state);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Get all LineState entries in order. Useful for batch processing.\n\t */\n\tgetAllLines(): LineState[] {\n\t\treturn this.getVisibleLines(1, this.lineCount);\n\t}\n\n\t/**\n\t * Get a LineState by its persistent line ID. O(1).\n\t */\n\tgetLineById(lineId: number): LineState | undefined {\n\t\treturn this.lines.get(lineId);\n\t}\n\n\t/**\n\t * Get all lines that are marked dirty.\n\t */\n\tgetDirtyLines(): LineState[] {\n\t\tconst result: LineState[] = [];\n\t\tfor (const state of this.lines.values()) {\n\t\t\tif (state.dirty) result.push(state);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Whether any line before `position` (1-based, exclusive) is dirty.\n\t *\n\t * Used by ThreeTierEvaluator.setViewport() to decide whether cached\n\t * checkpoint state might be stale and a full evaluate() (from line 1) is\n\t * needed instead of the cheap viewport-only path.\n\t *\n\t * O(d log N) where d = current dirty line count via {@link dirtyLineIds},\n\t * not O(N log N), a document that's mostly clean (the steady state after\n\t * initial load) answers this in the cost of resolving a handful of\n\t * lineIds to positions, not walking every line up to `position`.\n\t */\n\thasAnyDirtyLineBefore(position: number): boolean {\n\t\tfor (const lineId of this.dirtyLineIds) {\n\t\t\tconst pos = this.getLinePosition(lineId);\n\t\t\tif (pos >= 1 && pos < position) return true;\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * Whether any **variable-definition** line before `position` (1-based,\n\t * exclusive) is dirty.\n\t *\n\t * Narrower than {@link hasAnyDirtyLineBefore}: `VMCheckpointer.snapshot()`\n\t * only ever records state for lines with `writes.length > 0` (see\n\t * VMCheckpoints.ts), so a dirty plain-expression line before the viewport\n\t * cannot have invalidated any checkpoint, there's no checkpoint entry\n\t * for it to invalidate. Only a dirty variable-def line can mean the VM\n\t * state a checkpoint would restore is stale.\n\t *\n\t * This distinction matters because `PageManager.evictPageBytecode()`\n\t * marks evicted non-variable-def lines dirty (so they get Tier 1 if\n\t * scrolled back into view), and Tier 3's compile-only path never clears\n\t * `dirty` for non-variable-def lines by design. Using the broader\n\t * `hasAnyDirtyLineBefore` here meant scrolling far into a large,\n\t * variable-def-free document would trip `setViewport()`'s fallback to\n\t * `evaluate()` on every single call, evaluate() reprocesses the evicted\n\t * lines via Tier 3, which recompiles their bytecode without clearing\n\t * dirty, so the very next `maintainAfterEval()` re-evicts and re-dirties\n\t * the same lines, forever re-triggering the fallback on an otherwise\n\t * unchanged viewport.\n\t */\n\thasAnyDirtyVariableDefLineBefore(position: number): boolean {\n\t\tfor (const lineId of this.dirtyLineIds) {\n\t\t\tconst state = this.lines.get(lineId);\n\t\t\tif (!state || !state.isVariableDef) continue;\n\t\t\tconst pos = this.getLinePosition(lineId);\n\t\t\tif (pos >= 1 && pos < position) return true;\n\t\t}\n\t\treturn false;\n\t}\n\n\t/** Number of lines currently marked dirty. For diagnostics/tests. */\n\tget dirtyCount(): number {\n\t\treturn this.dirtyLineIds.size;\n\t}\n\n\t// ── Thread-safety validation ────────────────────────────────────────\n\n\t/**\n\t * Verify that bytecode compiled by a worker is still valid for this line.\n\t *\n\t * When Phase 5.2h sends compilation to a worker, the worker posts back\n\t * `{lineId, bytecode, reads, writes, compiledAgainstHash}`. Between dispatch\n\t * and response, the user may have edited the line. This method lets the\n\t * main thread check whether the bytecode is still applicable.\n\t *\n\t * @returns true if the line still exists and its text hash matches.\n\t */\n\tisBytecodeValid(lineId: number, compiledAgainstHash: number): boolean {\n\t\tconst state = this.lines.get(lineId);\n\t\treturn state !== undefined && state.textHash === compiledAgainstHash;\n\t}\n\n\t// ── State mutations ─────────────────────────────────────────────────\n\n\t/**\n\t * Mark a line as clean (re-evaluated successfully).\n\t */\n\tmarkClean(lineId: number): void {\n\t\tconst state = this.lines.get(lineId);\n\t\tif (state) {\n\t\t\tstate.dirty = false;\n\t\t\tthis.dirtyLineIds.delete(lineId);\n\t\t}\n\t}\n\n\t/**\n\t * Mark a line as dirty (needs re-evaluation) by its 1-based position.\n\t * Convenience for callers that have line numbers instead of line IDs.\n\t */\n\tmarkDirtyByLineNumber(lineNumber: number): void {\n\t\tconst state = this.getLineAt(lineNumber);\n\t\tif (state) {\n\t\t\tstate.dirty = true;\n\t\t\tthis.dirtyLineIds.add(state.lineId);\n\t\t}\n\t}\n\n\t/**\n\t * Mark a line as dirty (needs re-evaluation).\n\t */\n\tmarkDirty(lineId: number): void {\n\t\tconst state = this.lines.get(lineId);\n\t\tif (state) {\n\t\t\tstate.dirty = true;\n\t\t\tthis.dirtyLineIds.add(lineId);\n\t\t}\n\t}\n\n\t/**\n\t * Mark all lines as dirty (e.g., after plugin register/unregister).\n\t */\n\tinvalidateAll(): void {\n\t\tfor (const state of this.lines.values()) {\n\t\t\tstate.dirty = true;\n\t\t}\n\t\tthis.dirtyLineIds = new Set(this.lines.keys());\n\t}\n\n\t/**\n\t * Update a line's evaluation state after successful execution (Tier 1 / Tier 2).\n\t *\n\t * Sets results, bytecodes, reads, writes, and marks the line clean.\n\t * Supports multi-expression lines (inline solves) via parallel arrays.\n\t *\n\t * @param lineId - Persistent line identifier.\n\t * @param results - Evaluation result groups for each expression (in order). Each element is a Value[].\n\t * @param bytecodes - Compiled bytecode for each expression (in order).\n\t * @param expressions - Extracted expression strings (in order).\n\t * @param reads - Aggregated read variables across all expressions.\n\t * @param writes - Aggregated write variables across all expressions.\n\t * @param isVariableDef - True if any expression defines a variable.\n\t * @param inlineSolveCount - Number of inline solves (0 for full-line).\n\t */\n\tupdateLineResult(\n\t\tlineId: number,\n\t\tresults: Value[][],\n\t\tbytecodes: BytecodeProgram[],\n\t\texpressions: string[],\n\t\treads: string[],\n\t\twrites: string[],\n\t\tisVariableDef: boolean,\n\t\tinlineSolveCount: number = 0,\n\t): void {\n\t\tconst state = this.lines.get(lineId);\n\t\tif (!state) return;\n\t\tstate.results = results;\n\t\tstate.result = results[0]?.[0] ?? null;\n\t\tstate.bytecodes = bytecodes;\n\t\tstate.expressions = expressions;\n\t\tstate.reads = reads;\n\t\tstate.writes = writes;\n\t\tstate.isVariableDef = isVariableDef;\n\t\tstate.inlineSolveCount = inlineSolveCount;\n\t\tstate.dirty = false;\n\t\tthis.dirtyLineIds.delete(lineId);\n\t}\n\n\t/**\n\t * Update a line's compile-only state (Tier 3: background compilation).\n\t *\n\t * Stores expressions, bytecodes, reads, and writes. Does NOT set results\n\t * and does NOT mark the line clean, it still needs execution (Tier 1 or\n\t * Tier 2) to produce results. This distinction allows the three-tier\n\t * evaluation strategy: compile invisible lines in the background without\n\t * executing them, then execute from cached bytecode when scrolled into view.\n\t *\n\t * @param lineId - Persistent line identifier.\n\t * @param expressions - Extracted expression strings (in order).\n\t * @param bytecodes - Compiled bytecode for each expression (in order).\n\t * @param reads - Aggregated read variables across all expressions.\n\t * @param writes - Aggregated write variables across all expressions.\n\t * @param isVariableDef - True if any expression defines a variable.\n\t * @param inlineSolveCount - Number of inline solves (0 for full-line).\n\t */\n\tupdateLineCompiled(\n\t\tlineId: number,\n\t\texpressions: string[],\n\t\tbytecodes: BytecodeProgram[],\n\t\treads: string[],\n\t\twrites: string[],\n\t\tisVariableDef: boolean,\n\t\tinlineSolveCount: number = 0,\n\t): void {\n\t\tconst state = this.lines.get(lineId);\n\t\tif (!state) return;\n\t\tstate.expressions = expressions;\n\t\tstate.bytecodes = bytecodes;\n\t\tstate.reads = reads;\n\t\tstate.writes = writes;\n\t\tstate.isVariableDef = isVariableDef;\n\t\tstate.inlineSolveCount = inlineSolveCount;\n\t\t// NOTE: dirty remains unchanged, line still needs execution\n\t}\n\n\t// ── Properties ──────────────────────────────────────────────────────\n\n\tget lineCount(): number {\n\t\treturn this.orderTree.length;\n\t}\n\n\tget isEmpty(): boolean {\n\t\treturn this.orderTree.isEmpty;\n\t}\n\n\t/**\n\t * Iterator over LineState in document order.\n\t */\n\t*[Symbol.iterator](): IterableIterator<LineState> {\n\t\tfor (const lineId of this.orderTree) {\n\t\t\tconst state = this.lines.get(lineId);\n\t\t\tif (state) yield state;\n\t\t}\n\t}\n\n\t// ── Lifecycle ───────────────────────────────────────────────────────\n\n\tclear(): void {\n\t\tthis.lines.clear();\n\t\tthis.orderTree.clear();\n\t\tthis._positionCache = null;\n\t\tthis.nextLineId = 1;\n\t}\n\n\t/**\n\t * Serialize the document model to a plain object for debugging.\n\t */\n\ttoJSON(): object {\n\t\treturn {\n\t\t\tlineCount: this.lineCount,\n\t\t\tlines: this.getAllLines().map((s) => ({\n\t\t\t\tlineId: s.lineId,\n\t\t\t\ttext: s.text.substring(0, 80), // truncate for readability\n\t\t\t\ttextHash: s.textHash,\n\t\t\t\tdirty: s.dirty,\n\t\t\t\tisVariableDef: s.isVariableDef,\n\t\t\t\tisEmpty: s.isEmpty,\n\t\t\t\thasBytecode: s.bytecodes.length > 0,\n\t\t\t\thasResult: s.results.length > 0,\n\t\t\t\tinlineSolveCount: s.inlineSolveCount,\n\t\t\t\treads: s.reads,\n\t\t\t\twrites: s.writes,\n\t\t\t})),\n\t\t};\n\t}\n}\n","/**\n * CompilationWorkerManager, main-thread bridge to the compilation worker.\n *\n * Manages the worker lifecycle and provides a batch compilation API.\n * Receives transferred ArrayBuffers from the worker and reconstructs\n * BytecodeProgram objects with zero-copy TypedArray views.\n *\n * Usage:\n * const manager = new CompilationWorkerManager();\n * const bytecodeByLineId = await manager.compileBatch(items, docModel);\n *\n * Thread safety:\n * Each result includes `compiledAgainstHash`. Before storing bytecode\n * in the DocumentModel, we validate via `docModel.isBytecodeValid()`.\n * If the line was edited between dispatch and response, the bytecode\n * is discarded, the next evaluate() will recompile it synchronously.\n */\n\nimport { DocumentModel } from \"@solve-js/engine/DocumentModel\";\nimport type { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport createCompilationWorker from \"@solve-js/workers/engine.worker\";\n\n// ── Types ─────────────────────────────────────────────────────────────────\n\n/** One line sent to a worker for compilation. */\nexport interface CompileRequestItem {\n\tlineId: number;\n\texpression: string;\n\ttextHash: number;\n}\n\n/** Compiled bytecode returned from a worker, or the error that stopped it. */\nexport interface CompileResponseItem {\n\tlineId: number;\n\t/** Hash of the expression text when the compile was dispatched (for safety validation). */\n\tcompiledAgainstHash: number;\n\tprogram: BytecodeProgram;\n\treads: string[];\n\twrites: string[];\n\tisVariableDef: boolean;\n\terror: string | null;\n}\n\n// Raw result from worker (before BytecodeProgram reconstruction)\ninterface WorkerCompileResult {\n\tlineId: number;\n\tcompiledAgainstHash: number;\n\topcodesBuffer: ArrayBuffer;\n\tnumbersBuffer: ArrayBuffer;\n\topcodesLength: number;\n\tnumbersLength: number;\n\tstrings: string[];\n\treads: string[];\n\twrites: string[];\n\tisVariableDef: boolean;\n\terror: string | null;\n}\n\n// ── CompilationWorkerManager ──────────────────────────────────────────────\n\n/**\n * Compiles lines on a background worker.\n *\n * A response is discarded when the line changed between dispatch and return,\n * because bytecode compiled against stale text would produce a result for an\n * expression the user has already edited. The next evaluation recompiles it\n * synchronously.\n */\nexport class CompilationWorkerManager {\n\tprivate worker: Worker | null = null;\n\tprivate nextId = 1;\n\tprivate pending = new Map<\n\t\tnumber,\n\t\t{\n\t\t\tresolve: (results: CompileResponseItem[]) => void;\n\t\t\treject: (error: Error) => void;\n\t\t}\n\t>();\n\n\tconstructor() {}\n\n\t/**\n\t * Ensure the worker is started (lazy initialization).\n\t * Uses esbuild-plugin-inline-worker to inline the worker as a blob URL.\n\t */\n\tprivate ensureWorker(): Worker {\n\t\tif (this.worker) return this.worker;\n\n\t\tthis.worker = createCompilationWorker();\n\n\t\tthis.worker.onmessage = (event: MessageEvent) => {\n\t\t\tconst data = event.data;\n\t\t\tif (!data || data.type !== \"COMPILE_RESULT\") return;\n\n\t\t\tconst pending = this.pending.get(data.id);\n\t\t\tif (!pending) return;\n\n\t\t\tthis.pending.delete(data.id);\n\n\t\t\tconst results: CompileResponseItem[] = [];\n\t\t\tfor (const raw of data.results as WorkerCompileResult[]) {\n\t\t\t\tresults.push(this.reconstructResult(raw));\n\t\t\t}\n\t\t\tpending.resolve(results);\n\t\t};\n\n\t\tthis.worker.onerror = (err) => {\n\t\t\t// Reject all pending requests on worker error\n\t\t\tfor (const [id, pending] of this.pending) {\n\t\t\t\tpending.reject(\n\t\t\t\t\tnew Error(`Compilation worker error: ${err.message}`)\n\t\t\t\t);\n\t\t\t\tthis.pending.delete(id);\n\t\t\t}\n\t\t};\n\n\t\treturn this.worker;\n\t}\n\n\t/**\n\t * Batch-compile expressions in the worker.\n\t *\n\t * Sends a batch of { lineId, expression, textHash } to the worker,\n\t * which compiles each and transfers bytecode ArrayBuffers back.\n\t * Bytecode is reconstructed into BytecodeProgram objects.\n\t *\n\t * Results are returned in the same order as the input items.\n\t *\n\t * @param items Expressions to compile.\n\t * @returns Compiled bytecode for each item (or error).\n\t */\n\tasync compileBatch(items: CompileRequestItem[]): Promise<CompileResponseItem[]> {\n\t\tif (items.length === 0) return [];\n\n\t\tconst worker = this.ensureWorker();\n\t\tconst id = this.nextId++;\n\n\t\treturn new Promise<CompileResponseItem[]>((resolve, reject) => {\n\t\t\tthis.pending.set(id, { resolve, reject });\n\n\t\t\tworker.postMessage({\n\t\t\t\ttype: \"COMPILE_BATCH\",\n\t\t\t\tid,\n\t\t\t\titems,\n\t\t\t});\n\t\t});\n\t}\n\n\t/**\n\t * Store worker-compiled bytecode into the DocumentModel, with safety\n\t * validation. Only stores bytecode for lines whose text has not changed\n\t * since the compilation request was dispatched.\n\t *\n\t * Results for the same lineId are batched, all bytecodes from\n\t * successful compilations are passed to updateLineCompiled in a single\n\t * call. This supports multi-expression lines (inline solves).\n\t *\n\t * @param results Compiled results from the worker.\n\t * @param doc The target document model.\n\t * @returns Number of results successfully stored (passed safety check).\n\t */\n\tstoreResults(\n\t\tresults: CompileResponseItem[],\n\t\tdoc: DocumentModel\n\t): number {\n\t\t// Batch results by lineId (multiple inline solves share the same lineId)\n\t\tconst byLineId = new Map<\n\t\t\tnumber,\n\t\t\t{\n\t\t\t\tbytecodes: BytecodeProgram[];\n\t\t\t\treads: Set<string>;\n\t\t\t\twrites: Set<string>;\n\t\t\t\tisVariableDef: boolean;\n\t\t\t\texpressions: string[];\n\t\t\t\ttextHash: number;\n\t\t\t}\n\t\t>();\n\t\tlet validCount = 0;\n\n\t\tfor (const result of results) {\n\t\t\tif (result.error) continue;\n\n\t\t\t// Safety check: has the line been edited since dispatch?\n\t\t\tconst state = doc.getLineById(result.lineId);\n\t\t\tif (!state) continue;\n\n\t\t\t// Validate that the line text hasn't changed since dispatch.\n\t\t\tif (state.textHash !== result.compiledAgainstHash) continue;\n\n\t\t\t// Batch by lineId\n\t\t\tlet batch = byLineId.get(result.lineId);\n\t\t\tif (!batch) {\n\t\t\t\tbatch = {\n\t\t\t\t\tbytecodes: [],\n\t\t\t\t\treads: new Set(),\n\t\t\t\t\twrites: new Set(),\n\t\t\t\t\tisVariableDef: false,\n\t\t\t\t\texpressions: state.expressions.length > 0 ? [...state.expressions] : [],\n\t\t\t\t\ttextHash: result.compiledAgainstHash,\n\t\t\t\t};\n\t\t\t\tbyLineId.set(result.lineId, batch);\n\t\t\t}\n\n\t\t\tbatch.bytecodes.push(result.program);\n\t\t\tfor (const r of result.reads) batch.reads.add(r);\n\t\t\tfor (const w of result.writes) batch.writes.add(w);\n\t\t\tif (result.isVariableDef) batch.isVariableDef = true;\n\t\t\tvalidCount++;\n\t\t}\n\n\t\t// Store batched results\n\t\tlet stored = 0;\n\t\tfor (const [lineId, batch] of byLineId) {\n\t\t\tif (batch.bytecodes.length === 0) continue;\n\t\t\t// Preserve inlineSolveCount from the LineState so the evaluator\n\t\t\t// knows this line has multiple expressions (avoids re-extraction).\n\t\t\tconst state = doc.getLineById(lineId);\n\t\t\tconst inlineSolveCount = state?.inlineSolveCount ?? 0;\n\t\t\tdoc.updateLineCompiled(\n\t\t\t\tlineId,\n\t\t\t\tbatch.expressions,\n\t\t\t\tbatch.bytecodes,\n\t\t\t\t[...batch.reads],\n\t\t\t\t[...batch.writes],\n\t\t\t\tbatch.isVariableDef,\n\t\t\t\tinlineSolveCount,\n\t\t\t);\n\t\t\tstored += batch.bytecodes.length;\n\t\t}\n\n\t\treturn stored;\n\t}\n\n\t/**\n\t * Terminate the worker and clean up.\n\t */\n\tterminate(): void {\n\t\tif (this.worker) {\n\t\t\tthis.worker.terminate();\n\t\t\tthis.worker = null;\n\t\t\tthis.pending.clear();\n\t\t}\n\t}\n\n\t/**\n\t * Whether the worker is currently active.\n\t */\n\tget isActive(): boolean {\n\t\treturn this.worker !== null;\n\t}\n\n\t// ── Private helpers ────────────────────────────────────────────────\n\n\t/**\n\t * Reconstruct a BytecodeProgram from transferred ArrayBuffers.\n\t *\n\t * The transferred ArrayBuffers are zero-copy, we create TypedArray\n\t * views directly over them. No data is copied or serialized.\n\t */\n\tprivate reconstructResult(raw: WorkerCompileResult): CompileResponseItem {\n\t\tif (raw.error) {\n\t\t\treturn {\n\t\t\t\tlineId: raw.lineId,\n\t\t\t\tcompiledAgainstHash: raw.compiledAgainstHash,\n\t\t\t\tprogram: { opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false },\n\t\t\t\treads: [],\n\t\t\t\twrites: [],\n\t\t\t\tisVariableDef: false,\n\t\t\t\terror: raw.error,\n\t\t\t};\n\t\t}\n\n\t\t// Reconstruct TypedArrays from transferred ArrayBuffers.\n\t\t// These are views over the same memory, zero-copy from worker.\n\t\tconst opcodes =\n\t\t\traw.opcodesLength > 0\n\t\t\t\t? new Uint8Array(raw.opcodesBuffer, 0, raw.opcodesLength)\n\t\t\t\t: new Uint8Array(0);\n\t\tconst numbers =\n\t\t\traw.numbersLength > 0\n\t\t\t\t? new Float64Array(raw.numbersBuffer, 0, raw.numbersLength)\n\t\t\t\t: new Float64Array(0);\n\n\t\tconst program: BytecodeProgram = {\n\t\t\topcodes,\n\t\t\tnumbers,\n\t\t\tstrings: raw.strings,\n\t\t\thasAsync: false,\n\t\t};\n\n\t\treturn {\n\t\t\tlineId: raw.lineId,\n\t\t\tcompiledAgainstHash: raw.compiledAgainstHash,\n\t\t\tprogram,\n\t\t\treads: raw.reads,\n\t\t\twrites: raw.writes,\n\t\t\tisVariableDef: raw.isVariableDef,\n\t\t\terror: null,\n\t\t};\n\t}\n}\n","/**\n * PageManager, page-based LRU eviction + directional preloading.\n *\n * Groups document lines into fixed-size pages (128 lines each) and manages\n * three temperature tiers:\n * • Hot (viewport ± 3 pages): Keep bytecode + results\n * • Warm (viewport ± 6 pages): Keep bytecode, evict results\n * • Cold (beyond ± 6 pages): Evict bytecode + results (except variable defs)\n *\n * Variable definition bytecode is **never evicted** because it forms the\n * backbone of the dependency graph and VM checkpoints.\n *\n * Preloading: When the user scrolls in a consistent direction, the next\n * 1–2 pages are pre-compiled via the background worker so bytecode is\n * cache-hot by the time those lines scroll into view.\n *\n * Usage:\n * const pm = new PageManager();\n * // After evaluation:\n * pm.maintainAfterEval(viewport, doc);\n * // After scroll (viewport-only change):\n * pm.maintainAfterEval(viewport, doc);\n * const targets = pm.getPreloadTargets(viewport, doc);\n * // dispatch targets to compilation worker\n */\n\nimport { DocumentModel } from \"@solve-js/engine/DocumentModel\";\n// Deliberately the shared lexer, not an engine's own.\n//\n// `classifyLine` and `findInlineSolves` are character-level scans for headings,\n// comment markers, code fences and backtick spans. Neither consults the\n// keyword, unit or operator tables, so every lexer returns the same answer and\n// there is nothing per-engine to respect. Pinned by\n// __tests__/lexer/LineClassificationIsVocabularyIndependent.spec.ts, which\n// compares a bare lexer against one carrying extra vocabulary.\n//\n// This matters because these are free functions with no engine to ask. Making\n// them engine-aware would mean changing their signatures and every caller for\n// no behavioural difference.\nimport { sharedLexer } from \"@solve-js/lexer/Lexer\";\n\n// ── Constants ────────────────────────────────────────────────────────────\n\n/** Number of lines per page. Tunable, 128 balances granularity with overhead. */\nexport const PAGE_SIZE = 128;\n\n/** Number of pages on each side of the viewport considered \"hot.\" */\nconst HOT_PAGE_RADIUS = 3;\n\n/** Number of pages on each side of the viewport considered \"warm\" (includes hot). */\nconst WARM_PAGE_RADIUS = 6;\n\n/** Number of pages to preload ahead of the scroll direction. */\nconst PRELOAD_PAGE_COUNT = 2;\n\n/**\n * Pages just beyond the warm range that are \"newly cold\", they were warm\n * on the previous scroll and now need bytecode eviction. Once evicted, they\n * stay cold and don't need re-eviction on subsequent frames (the inner\n * `evictPageBytecode` checks for non-null bytecode and short-circuits).\n *\n * This buffer lets us skip iterating the vast majority of cold pages on\n * every scroll, reducing `maintainAfterEval` from O(total pages) to\n * O(hot + warm + buffer) ≈ O(1) for any document size.\n */\nconst COLD_EVICT_BUFFER = HOT_PAGE_RADIUS;\n\n// ── PageManager ──────────────────────────────────────────────────────────\n\n/**\n * Splits a long document into pages so only what is near the viewport is held\n * in full.\n *\n * A document is edited constantly and most of it is off screen. Paging keeps\n * the cost of a keystroke proportional to what is visible rather than to the\n * length of the document.\n */\nexport class PageManager {\n\t/** Previous viewport for scroll direction detection. null = no previous viewport. */\n\tprivate lastViewportStart: number | null = null;\n\n\t/** Saved scroll direction from the most recent maintainAfterEval call. */\n\tprivate savedDirection: \"down\" | \"up\" | null = null;\n\n\t/** Per-page access counter for LRU tracking. */\n\tprivate pageAccess: Map<number, number> = new Map();\n\n\t/** Monotonically increasing access sequence number. */\n\tprivate accessSeq = 0;\n\n\t// ── Static helpers ─────────────────────────────────────────────────\n\n\t/** Get the page number for a 1-based line number (0-based page index). */\n\tstatic pageForLine(lineNumber: number): number {\n\t\treturn Math.floor((lineNumber - 1) / PAGE_SIZE);\n\t}\n\n\t/** Get the 1-based inclusive line range for a page. */\n\tstatic pageRange(\n\t\tpageNum: number,\n\t\tdocLineCount: number\n\t): { startLine: number; endLine: number } {\n\t\treturn {\n\t\t\tstartLine: pageNum * PAGE_SIZE + 1,\n\t\t\tendLine: Math.min((pageNum + 1) * PAGE_SIZE, docLineCount),\n\t\t};\n\t}\n\n\t// ── Public API ─────────────────────────────────────────────────────\n\n\t/**\n\t * Detect scroll direction from viewport movement.\n\t * Returns null on first call (no previous viewport) or no movement.\n\t */\n\tdetectDirection(newViewport: { startLine: number }): \"down\" | \"up\" | null {\n\t\tif (this.lastViewportStart === null) return null;\n\t\tif (newViewport.startLine > this.lastViewportStart) return \"down\";\n\t\tif (newViewport.startLine < this.lastViewportStart) return \"up\";\n\t\treturn null;\n\t}\n\n\t/**\n\t * Maintain page tiers after evaluation.\n\t *\n\t * 1. Records the new viewport position\n\t * 2. Touches hot pages (viewport ± HOT_PAGE_RADIUS) for LRU\n\t * 3. Evicts cold/warm pages based on distance from viewport\n\t *\n\t * Call this after every `evaluate()`, `setViewport()`, or `evaluateAll()`.\n\t */\n\tmaintainAfterEval(\n\t\tviewport: { startLine: number; endLine: number },\n\t\tdoc: DocumentModel\n\t): void {\n\t\t// ── Capture direction BEFORE updating lastViewportStart ───\n\t\tthis.savedDirection = this.detectDirection(viewport);\n\t\tthis.lastViewportStart = viewport.startLine;\n\n\t\tconst docLineCount = doc.lineCount;\n\t\tconst viewportStartPage = PageManager.pageForLine(viewport.startLine);\n\t\tconst viewportEndPage = PageManager.pageForLine(viewport.endLine);\n\t\tconst lastPage = PageManager.pageForLine(docLineCount);\n\n\t\t// Compute hot/warm page ranges in O(1) using range math:\n\t\t// A page is within RADIUS of the viewport span iff it falls in\n\t\t// [viewportStartPage - RADIUS, viewportEndPage + RADIUS].\n\t\tconst hotStart = Math.max(0, viewportStartPage - HOT_PAGE_RADIUS);\n\t\tconst hotEnd = Math.min(lastPage, viewportEndPage + HOT_PAGE_RADIUS);\n\t\tconst warmStart = Math.max(0, viewportStartPage - WARM_PAGE_RADIUS);\n\t\tconst warmEnd = Math.min(lastPage, viewportEndPage + WARM_PAGE_RADIUS);\n\n\t\t// Touch hot pages to keep them fresh in LRU\n\t\tfor (let p = hotStart; p <= hotEnd; p++) {\n\t\t\tthis.touchPage(p);\n\t\t}\n\n\t\t// Evict warm-but-not-hot pages: keep bytecode, evict results only\n\t\tfor (let p = warmStart; p <= warmEnd; p++) {\n\t\t\tif (p >= hotStart && p <= hotEnd) continue;\n\t\t\tthis.evictPageResults(p, doc, docLineCount);\n\t\t}\n\n\t\t// Evict \"newly cold\" pages: a buffer zone just outside the warm\n\t\t// range. Pages beyond this buffer were already evicted on prior\n\t\t// scrolls and don't need re-eviction.\n\t\t// ── Left side (just above page 0, just below warm range) ──\n\t\tconst coldLeftEnd = warmStart - 1;\n\t\tconst coldLeftStart = Math.max(0, coldLeftEnd - COLD_EVICT_BUFFER + 1);\n\t\tfor (let p = coldLeftStart; p <= coldLeftEnd; p++) {\n\t\t\tthis.evictPageBytecode(p, doc, docLineCount);\n\t\t}\n\t\t// ── Right side (just above warm range, just below lastPage) ──\n\t\tconst coldRightStart = warmEnd + 1;\n\t\tconst coldRightEnd = Math.min(lastPage, coldRightStart + COLD_EVICT_BUFFER - 1);\n\t\tfor (let p = coldRightStart; p <= coldRightEnd; p++) {\n\t\t\tthis.evictPageBytecode(p, doc, docLineCount);\n\t\t}\n\t}\n\n\t/**\n\t * Get lines ahead of the viewport that should be pre-compiled.\n\t *\n\t * Looks PRELOAD_PAGE_COUNT pages ahead of the current scroll direction.\n\t * Only returns lines that are dirty, don't already have bytecode,\n\t * and are not empty/markdown-only.\n\t *\n\t * @param viewport The current viewport.\n\t * @param doc The document model.\n\t * @returns Items ready to send to the compilation worker.\n\t */\n\tgetPreloadTargets(\n\t\tviewport: { startLine: number; endLine: number },\n\t\tdoc: DocumentModel\n\t): Array<{ lineId: number; expression: string; textHash: number }> {\n\t\t// Use the direction saved by the last maintainAfterEval call.\n\t\t// We cannot re-detect because maintainAfterEval already updated\n\t\t// lastViewportStart to the current viewport position.\n\t\tconst direction = this.savedDirection;\n\t\tif (!direction) return [];\n\n\t\tconst items: Array<{ lineId: number; expression: string; textHash: number }> = [];\n\t\t// Use viewport end page for downward preload start, start page for upward.\n\t\t// This ensures we preload *beyond* the full viewport span, not just its start.\n\t\tconst viewportEndPage = PageManager.pageForLine(viewport.endLine);\n\t\tconst viewportStartPage = PageManager.pageForLine(viewport.startLine);\n\t\tconst lastPage = PageManager.pageForLine(doc.lineCount);\n\n\t\tconst pages: number[] = [];\n\t\tif (direction === \"down\") {\n\t\t\t// Preload pages immediately after the viewport's hot radius beyond its end\n\t\t\tconst startPage = viewportEndPage + HOT_PAGE_RADIUS + 1;\n\t\t\tconst endPage = Math.min(startPage + PRELOAD_PAGE_COUNT - 1, lastPage);\n\t\t\tfor (let p = startPage; p <= endPage && p <= lastPage; p++) {\n\t\t\t\tpages.push(p);\n\t\t\t}\n\t\t} else {\n\t\t\t// Preload pages immediately before the viewport's hot radius before its start\n\t\t\tconst firstPreloadPage = viewportStartPage - HOT_PAGE_RADIUS - 1;\n\t\t\tfor (let p = firstPreloadPage; p > firstPreloadPage - PRELOAD_PAGE_COUNT && p >= 0; p--) {\n\t\t\t\tpages.push(p);\n\t\t\t}\n\t\t}\n\n\t\tfor (const pageNum of pages) {\n\t\t\tconst range = PageManager.pageRange(pageNum, doc.lineCount);\n\t\t\tfor (let pos = range.startLine; pos <= range.endLine; pos++) {\n\t\t\t\tconst state = doc.getLineAt(pos);\n\t\t\t\tif (!state) continue;\n\t\t\t\tif (!state.dirty) continue;\n\t\t\t\tif (state.bytecodes.length > 0 && !state.isVariableDef) continue;\n\t\t\t\tif (state.isEmpty) continue;\n\n\t\t\t\t// Extract expressions using the shared lexer to handle inline\n\t\t\t\t// solves (s`...`). For full-line expressions, this returns [text].\n\t\t\t\t// For inline solve lines, this returns each extracted expression.\n\t\t\t\tif (state.expressions.length > 0) {\n\t\t\t\t\t// Use pre-extracted expressions (from prior evaluation)\n\t\t\t\t\tfor (const expression of state.expressions) {\n\t\t\t\t\t\tif (!expression.trim()) continue;\n\t\t\t\t\t\titems.push({\n\t\t\t\t\t\t\tlineId: state.lineId,\n\t\t\t\t\t\t\texpression,\n\t\t\t\t\t\t\ttextHash: state.textHash,\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// Expressions not yet extracted, use lexer to find inline solves\n\t\t\t\t\tconst inlineSpans = sharedLexer.findInlineSolves(state.text);\n\t\t\t\t\tif (inlineSpans.length > 0) {\n\t\t\t\t\t\tfor (const span of inlineSpans) {\n\t\t\t\t\t\t\tif (!span.expression.trim()) continue;\n\t\t\t\t\t\t\titems.push({\n\t\t\t\t\t\t\t\tlineId: state.lineId,\n\t\t\t\t\t\t\t\texpression: span.expression,\n\t\t\t\t\t\t\t\ttextHash: state.textHash,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Full-line expression\n\t\t\t\t\t\tconst expression = state.text.trim();\n\t\t\t\t\t\tif (expression) {\n\t\t\t\t\t\t\titems.push({\n\t\t\t\t\t\t\t\tlineId: state.lineId,\n\t\t\t\t\t\t\t\texpression,\n\t\t\t\t\t\t\t\ttextHash: state.textHash,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn items;\n\t}\n\n\t/**\n\t * Reset internal state (e.g., after document switch).\n\t */\n\tclear(): void {\n\t\tthis.pageAccess.clear();\n\t\tthis.accessSeq = 0;\n\t\tthis.lastViewportStart = null;\n\t\tthis.savedDirection = null;\n\t}\n\n\t// ── Private helpers ─────────────────────────────────────────────────\n\n\t/** Record a page access with a monotonic sequence number. */\n\tprivate touchPage(pageNum: number): void {\n\t\tthis.pageAccess.set(pageNum, ++this.accessSeq);\n\t}\n\n\t/**\n\t * Evict results from all non-variable-def lines in a page.\n\t * Bytecode is preserved so Tier 2 execution works on scroll-back.\n\t */\n\tprivate evictPageResults(\n\t\tpageNum: number,\n\t\tdoc: DocumentModel,\n\t\tdocLineCount: number\n\t): void {\n\t\tconst range = PageManager.pageRange(pageNum, docLineCount);\n\t\tfor (let pos = range.startLine; pos <= range.endLine; pos++) {\n\t\t\tconst state = doc.getLineAt(pos);\n\t\t\tif (state && !state.isVariableDef && state.results.length > 0) {\n\t\t\t\tstate.results = [];\n\t\t\t\tstate.result = null;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Evict bytecode + results from all non-variable-def lines in a page.\n\t * Variable definition bytecode is **never** evicted, it forms the\n\t * backbone of the DAG and VM checkpoints.\n\t *\n\t * Evicted lines are marked dirty so they get Tier 1 re-evaluation\n\t * when scrolled back into view.\n\t */\n\tprivate evictPageBytecode(\n\t\tpageNum: number,\n\t\tdoc: DocumentModel,\n\t\tdocLineCount: number\n\t): void {\n\t\tconst range = PageManager.pageRange(pageNum, docLineCount);\n\t\tfor (let pos = range.startLine; pos <= range.endLine; pos++) {\n\t\t\tconst state = doc.getLineAt(pos);\n\t\t\tif (!state || state.isVariableDef) continue;\n\n\t\t\tif (state.bytecodes.length > 0 || state.results.length > 0) {\n\t\t\t\tstate.bytecodes = [];\n\t\t\t\tstate.results = [];\n\t\t\t\tstate.result = null;\n\t\t\t\tdoc.markDirty(state.lineId);\n\t\t\t}\n\t\t}\n\t}\n}\n","import { ExpressionEngine } from \"@solve-js/engine/ExpressionEngine\";\nimport {\n\tDocumentModel,\n\tLineChange,\n\tLineState,\n\tViewportRange,\n} from \"@solve-js/engine/DocumentModel\";\nimport { Value, ValueType, enableValueArena, disableValueArena, errorValue } from \"@solve-js/vm/Value\";\nimport { DependencyGraph } from \"@solve-js/vm/DependencyGraph\";\nimport { VMCheckpointer } from \"@solve-js/vm/VMCheckpoints\";\nimport { isEmptyLine } from \"@solve-js/engine/ExpressionEngineSafety\";\n// Deliberately the shared lexer, not an engine's own.\n//\n// `classifyLine` and `findInlineSolves` are character-level scans for headings,\n// comment markers, code fences and backtick spans. Neither consults the\n// keyword, unit or operator tables, so every lexer returns the same answer and\n// there is nothing per-engine to respect. Pinned by\n// __tests__/lexer/LineClassificationIsVocabularyIndependent.spec.ts, which\n// compares a bare lexer against one carrying extra vocabulary.\n//\n// This matters because these are free functions with no engine to ask. Making\n// them engine-aware would mean changing their signatures and every caller for\n// no behavioural difference.\nimport { sharedLexer } from \"@solve-js/lexer/Lexer\";\nimport { CompilationWorkerManager, type CompileRequestItem } from \"@solve-js/engine/CompilationWorkerManager\";\nimport { PageManager } from \"@solve-js/engine/PageManager\";\nimport type { BytecodeProgram } from \"@solve-js/parser/BytecodeBuilder\";\nimport { EngineError } from \"@solve-js/errors/UnifiedErrorFramework\";\nimport { sharedGlobalVariableStore, globalDagKey } from \"@solve-js/vm/GlobalVariableStore\";\n\n// ── EvalTier (diagnostic enum) ──────────────────────────────────────────\n\n/**\n * How much work a line's evaluation required.\n *\n * The tiers exist because most lines in a document have not changed. A line\n * that is clean and cached costs far less than one being compiled fresh, and\n * knowing which happened is how a slow document gets diagnosed.\n */\nexport enum EvalTier {\n\t/** Full pipeline: Lex → Parse → Compile → Execute (visible + dirty). */\n\tTier1 = 1,\n\t/** Execute-only from cached bytecode (visible + cached). */\n\tTier2 = 2,\n\t/** Compile-only for dependency tracking (invisible). Executes only variable assignments. */\n\tTier3 = 3,\n\t/** Skipped, already clean or non-evaluable. */\n\tSkipped = 0,\n}\n\n// ── EvalLineResult ──────────────────────────────────────────────────────\n\n/** Outcome for one line, including which tier handled it. */\nexport interface EvalLineResult {\n\t/** The line's persistent ID from DocumentModel. */\n\tlineId: number;\n\t/** 1-based line position. */\n\tlineNumber: number;\n\t/** Which tier was used. */\n\ttier: EvalTier;\n\t/** The first evaluation result, or null on error / non-evaluable. */\n\tresult: Value | null;\n\t/** All result groups (one per expression/inline-solve), or undefined if skipped. */\n\tresults?: Value[][];\n\t/** Error message, or null. */\n\terror: string | null;\n}\n\n// ── EvalResult ──────────────────────────────────────────────────────────\n\n/** Outcome for a whole evaluation pass, with per-tier counts. */\nexport interface EvalResult {\n\t/** Per-line evaluation results. */\n\tlines: EvalLineResult[];\n\t/** Map of line numbers → flattened results for quick lookup. */\n\tresultMap: Map<number, Value[]>;\n\t/** Number of lines processed at each tier. */\n\ttierCounts: { tier1: number; tier2: number; tier3: number; skipped: number };\n}\n\n// ── ThreeTierEvaluator ──────────────────────────────────────────────────\n\n/**\n * Orchestrates three-tier evaluation over a persistent DocumentModel.\n *\n * ── Tier assignment ─────────────────────────────────────────────────\n * | Tier | Condition | Action |\n * |───────|────────────────────────────────────|───────────────────────────────|\n * | **1** | Visible + Dirty (new/changed) | Full pipeline: lex→parse→compile→execute |\n * | **2** | Visible + Cached (scroll into view)| Execute from cached bytecode |\n * | **3** | Invisible + Dirty | Compile-only; execute only variable defs |\n * | Skip | Clean, empty, or non-evaluable | No action |\n *\n * ── Evaluation order ─────────────────────────────────────────────────\n * Lines are always processed in ascending document order (line 1 → end)\n * so that variable assignments flow correctly through the shared VM.\n * Tier 2 relies on this: by the time a clean cached line is reached,\n * the VM already contains all variables from preceding Tier-1 lines.\n *\n * ── Thread safety ────────────────────────────────────────────────────\n * Tier 1 (visible+dirty) compilation runs synchronously on the main thread\n * for immediate rendering. Tier 3 (invisible+dirty) compilation can be\n * dispatched to a Web Worker via `dispatchBackgroundCompiles()`. Worker-\n * compiled bytecode is stored in the DocumentModel and validated via\n * `isBytecodeValid()` to ensure the line text hasn't changed between\n * dispatch and response.\n */\nexport class ThreeTierEvaluator {\n\tprivate doc: DocumentModel;\n\tprivate engine: ExpressionEngine;\n\tprivate dag: DependencyGraph;\n\tprivate checkpointer: VMCheckpointer | null;\n\tprivate compilationWorker: CompilationWorkerManager | null = null;\n\tprivate pageManager: PageManager;\n\n\t/**\n\t * Unsubscribe from sharedGlobalVariableStore, set in the constructor\n\t * called from terminateWorker(). See the subscription itself below for\n\t * why this only marks lines dirty and never re-evaluates synchronously.\n\t */\n\tprivate globalUnsubscribe: (() => void) | null = null;\n\n\t/**\n\t * @param doc The persistent document model.\n\t * @param engine The expression engine (shared VM is accessed via engine.getVM()).\n\t * @param checkpointer Optional VM state checkpointer. If provided, the evaluator\n\t * will create checkpoints after variable-definition lines and support fast VM\n\t * restoration via `restoreTo()`. If omitted, checkpointing is disabled.\n\t */\n\tconstructor(\n\t\tdoc: DocumentModel,\n\t\tengine: ExpressionEngine,\n\t\tcheckpointer?: VMCheckpointer\n\t) {\n\t\tthis.doc = doc;\n\t\tthis.engine = engine;\n\t\tthis.dag = engine.getDag();\n\t\tthis.checkpointer = checkpointer ?? null;\n\t\tthis.pageManager = new PageManager();\n\n\t\t// Lets the engine answer \"what's line N's cached result\" for\n\t\t// cross-line features (prev/line<N>/aggregation) without owning\n\t\t// document lifecycle itself. See ExpressionEngine.makeLineContext().\n\t\tthis.engine.setDocumentModel(this.doc);\n\n\t\t// ── Cross-document global-variable propagation ──────────────────\n\t\t// GlobalVariableAsyncResolver (via preflight) handles a line's FIRST\n\t\t// resolution when a global it reads wasn't known yet. This handles\n\t\t// the ONGOING case: a line that already has a real (non-pending)\n\t\t// value for `global :x` needs to go dirty again when some OTHER\n\t\t// document writes a NEW value to x, so this document's next\n\t\t// evaluate() picks up the change, \"dealing with the DAG across\n\t\t// pages\", not just first-resolution.\n\t\tthis.globalUnsubscribe = sharedGlobalVariableStore.subscribe((name) => {\n\t\t\t// Mark-dirty ONLY, never synchronously re-evaluate here.\n\t\t\t// enableValueArena/disableValueArena (Value.ts) is a single\n\t\t\t// non-reentrant module-level flag; evaluate()/setViewport() both\n\t\t\t// wrap their body in it, so a re-entrant evaluate() call from\n\t\t\t// inside this callback (itself possibly firing from INSIDE\n\t\t\t// another evaluate() call, via a STORE_GLOBAL_VAR opcode in some\n\t\t\t// other document being evaluated concurrently) would disable the\n\t\t\t// arena out from under the still-running outer call. This\n\t\t\t// mirrors applyTransaction()'s existing contract exactly: mark\n\t\t\t// dirty, let the caller's own evaluate() cadence pick it up.\n\t\t\tfor (const lineNumber of this.dag.getAffectedLines(globalDagKey(name))) {\n\t\t\t\tthis.doc.markDirtyByLineNumber(lineNumber);\n\t\t\t}\n\t\t});\n\t}\n\n\t/**\n\t * Evaluate all lines needed to render the given viewport.\n\t *\n\t * Processes lines from 1 to `viewport.endLine` in document order.\n\t * Dirty lines in the viewport get Tier-1 full pipeline; clean cached\n\t * lines get Tier-2 bytecode execution. Lines after the viewport\n\t * get Tier-3 compile-only (with variable-def execution).\n\t *\n\t * @returns Results for all processed lines, including tier metadata.\n\t */\n\tevaluate(viewport: ViewportRange, signal?: AbortSignal): EvalResult {\n\t\t// ── One AbortController Per Keystroke ────────────────────────\n\t\t// Link the UI layer's keystroke signal to the engine so that\n\t\t// all per-evaluation AbortControllers created during this call\n\t\t// are canceled when the user types a new keystroke.\n\t\tthis.engine.setKeystrokeSignal(signal ?? null);\n\n\t\t// ── Phase 5.3: Enable arena for zero-allocation Value reuse ──\n\t\tenableValueArena();\n\t\ttry {\n\t\t\tconst lines: EvalLineResult[] = [];\n\t\t\tconst resultMap = new Map<number, Value[]>();\n\t\t\tconst tierCounts = { tier1: 0, tier2: 0, tier3: 0, skipped: 0 };\n\n\t\t\t// Process from line 1 to the end of the viewport for correct VM state.\n\t\t\t// We go to viewport.endLine because Tier 3 for invisible lines can be\n\t\t\t// done separately via backgroundCompile().\n\t\t\tconst docEnd = this.doc.lineCount;\n\t\t\tconst evalEnd = Math.min(viewport.endLine, docEnd);\n\n\t\t\tfor (let pos = 1; pos <= evalEnd; pos++) {\n\t\t\t\tconst state = this.doc.getLineAt(pos);\n\t\t\t\tif (!state) {\n\t\t\t\t\ttierCounts.skipped++;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tconst inViewport = pos >= viewport.startLine && pos <= viewport.endLine;\n\n\t\t\t\tconst lineResult = this.evaluateSingleLine(state, pos, inViewport);\n\t\t\t\tlines.push(lineResult);\n\n\t\t\t\tif (lineResult.tier === EvalTier.Tier1) tierCounts.tier1++;\n\t\t\t\telse if (lineResult.tier === EvalTier.Tier2) tierCounts.tier2++;\n\t\t\t\telse if (lineResult.tier === EvalTier.Tier3) tierCounts.tier3++;\n\t\t\t\telse tierCounts.skipped++;\n\n\t\t\t\tif (lineResult.results && inViewport) {\n\t\t\t\t\tresultMap.set(pos, lineResult.results.flat());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// ── Phase 5.2g: Page-based LRU eviction ──────────────────────\n\t\t\t// Evict bytecode/results from cold/warm pages to bound memory.\n\t\t\tthis.pageManager.maintainAfterEval(viewport, this.doc);\n\n\t\t\treturn { lines, resultMap, tierCounts };\n\t\t} finally {\n\t\t\t// Clear keystroke signal to prevent stale signal references\n\t\t\t// from being used by subsequent evaluations from other code paths.\n\t\t\tthis.engine.setKeystrokeSignal(null);\n\n\t\t\t// Phase 5.3: Always disable arena, even on exception.\n\t\t\t// Prevents arena Values from leaking into subsequent evaluations or tests.\n\t\t\tdisableValueArena();\n\t\t}\n\t}\n\n\t/**\n\t * Background-compile invisible dirty lines beyond the viewport (Tier 3 only).\n\t *\n\t * Compiles expressions to discover reads/writes for the dependency graph\n\t * without executing display-only expressions. Variable definitions are\n\t * executed to maintain VM state for future Tier-2 executions.\n\t *\n\t * This is intended to be called after evaluate() so visible lines are\n\t * rendered first, then background work fills in the dependency graph.\n\t *\n\t * **Phase 5.2h:** This synchronous method is retained for environments\n\t * without Worker support. Prefer `dispatchBackgroundCompiles()` which\n\t * offloads compilation to a Web Worker with Transferable bytecode.\n\t */\n\tbackgroundCompile(viewport: ViewportRange): EvalLineResult[] {\n\t\tconst results: EvalLineResult[] = [];\n\t\tconst docEnd = this.doc.lineCount;\n\t\tconst startPos = viewport.endLine + 1;\n\n\t\tfor (let pos = startPos; pos <= docEnd; pos++) {\n\t\t\tconst state = this.doc.getLineAt(pos);\n\t\t\tif (!state) continue;\n\n\t\t\t// Skip clean lines, already compiled + executed\n\t\t\tif (!state.dirty) continue;\n\n\t\t\t// Skip already-compiled Tier 3 lines, they have bytecode\n\t\t\t// but were compiled without execution (non-variable-def).\n\t\t\t// Recompiling is wasteful since the text hasn't changed\n\t\t\t// (text change clears bytecodes via editLine).\n\t\t\tif (state.bytecodes.length > 0 && !state.isVariableDef) continue;\n\n\t\t\tconst lineResult = this.evaluateSingleLine(state, pos, false);\n\t\t\tresults.push(lineResult);\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/**\n\t * Dispatch background compilation to a Web Worker (Phase 5.2h).\n\t *\n\t * Collects invisible dirty lines beyond the viewport that need compilation,\n\t * sends them to the compilation worker, and asynchronously stores the\n\t * transferred bytecode in the DocumentModel when the worker responds.\n\t *\n\t * This is the non-blocking alternative to `backgroundCompile()`. The worker\n\t * compiles expressions with Transferable ArrayBuffers (zero-copy postMessage),\n\t * so bytecode appears on the main thread without serialization overhead.\n\t *\n\t * Lines that already have cached bytecode (from a previous worker pass or\n\t * synchronous compile) are skipped, only truly uncompiled dirty lines are\n\t * sent to the worker.\n\t *\n\t * **Usage:** Call after `evaluate()` so visible lines render first, then\n\t * this fills the bytecode cache for future Tier-2 scrolls.\n\t *\n\t * @param viewport The current visible range. Lines beyond viewport.endLine\n\t * that are dirty and don't have bytecode are dispatched.\n\t */\n\tdispatchBackgroundCompiles(viewport: ViewportRange): void {\n\t\t// Collect invisible dirty lines that need compilation\n\t\tconst items = this.collectInvisibleCompileTargets(viewport);\n\t\tif (items.length === 0) return;\n\n\t\t// Lazy-init the worker (only if there are items to compile)\n\t\tif (!this.compilationWorker) {\n\t\t\tthis.compilationWorker = new CompilationWorkerManager();\n\t\t}\n\n\t\t// Fire-and-forget: send to worker, store results when they arrive\n\t\tthis.compilationWorker.compileBatch(items).then((results) => {\n\t\t\tthis.compilationWorker!.storeResults(results, this.doc);\n\t\t}).catch((_err) => {\n\t\t\t// Worker failure is non-fatal, next evaluate() will compile\n\t\t\t// these expressions synchronously.\n\t\t});\n\t}\n\n\t/**\n\t * Terminate the compilation worker if active, and unsubscribe from\n\t * sharedGlobalVariableStore. Call this when the evaluator is no longer\n\t * needed to clean up resources, every call site that retires a\n\t * ThreeTierEvaluator (document switch, pane destroy()) already calls\n\t * this unconditionally, so folding the global-store unsubscribe in here\n\t * needs no new call sites anywhere.\n\t */\n\tterminateWorker(): void {\n\t\tif (this.compilationWorker) {\n\t\t\tthis.compilationWorker.terminate();\n\t\t\tthis.compilationWorker = null;\n\t\t}\n\t\tif (this.globalUnsubscribe) {\n\t\t\tthis.globalUnsubscribe();\n\t\t\tthis.globalUnsubscribe = null;\n\t\t}\n\t}\n\n\t/**\n\t * Get the DocumentModel (read-only access for decoration building).\n\t */\n\tgetDoc(): DocumentModel {\n\t\treturn this.doc;\n\t}\n\n\t/**\n\t * Evaluate all dirty lines in the document, regardless of viewport.\n\t * Used for full re-evaluation after plugin register/unregister.\n\t */\n\tevaluateAll(signal?: AbortSignal): EvalResult {\n\t\tconst viewport = { startLine: 1, endLine: this.doc.lineCount };\n\t\tconst result = this.evaluate(viewport, signal);\n\t\t// evaluate() already calls maintainAfterEval internally\n\t\treturn result;\n\t}\n\n\t/**\n\t * Zero-allocation viewport evaluation, the Phase 5.2e \"holy grail.\"\n\t *\n\t * **Key insight:** When the user scrolls (viewport-only change, no edits),\n\t * we don't need to re-evaluate from line 1. Instead:\n\t *\n\t * 1. Restore the VM to just before the viewport via the nearest checkpoint.\n\t * 2. Evaluate ONLY the visible lines (Tier 2 for clean cached, Tier 1 for dirty).\n\t * 3. Lines before the viewport are completely skipped, their state lives in\n\t * the VM checkpointer's prototypal chain.\n\t *\n\t * **Correctness guard:** If any variable-definition line before the viewport\n\t * is dirty (e.g., the user edited a variable def that hasn't been\n\t * re-evaluated yet), we clear stale checkpoints and fall back to `evaluate()`\n\t * which processes from line 1 and rebuilds fresh checkpoints. This\n\t * guarantees that stale checkpoints are never used as restoration targets.\n\t * Only variable-def lines matter here, `VMCheckpointer.snapshot()` only\n\t * records state for lines that write a variable, so a dirty plain-expression\n\t * line before the viewport has no checkpoint to invalidate (see\n\t * `DocumentModel.hasAnyDirtyVariableDefLineBefore()`).\n\t *\n\t * **Performance:** O(visible lines) instead of O(document length). Target:\n\t * < 1ms for a typical ~30-line viewport, independent of document size.\n\t *\n\t * @param viewport The visible line range.\n\t * @returns Results for visible lines only. Lines before the viewport are\n\t * not included in `lines[]` or `resultMap`.\n\t */\n\tsetViewport(viewport: ViewportRange, signal?: AbortSignal): EvalResult {\n\t\t// ── One AbortController Per Keystroke ────────────────────────\n\t\t// Link the UI layer's keystroke signal to the engine.\n\t\tthis.engine.setKeystrokeSignal(signal ?? null);\n\n\t\t// ── Correctness guard: dirty lines before viewport invalidate checkpoints ──\n\t\tif (viewport.startLine > 1 && this.hasDirtyLinesBefore(viewport.startLine)) {\n\t\t\t// Clear stale checkpoints, evaluate() will rebuild them from line 1.\n\t\t\t// evaluate() handles its own arena enable/disable and signal cleanup.\n\t\t\tthis.checkpointer?.clear();\n\t\t\treturn this.evaluate(viewport, signal);\n\t\t}\n\n\t\t// ── Phase 5.2g: Page-based LRU eviction (MUST run before preload) ──\n\t\t// maintainAfterEval captures the scroll direction and updates lastViewportStart\n\t\t// BEFORE preloadNextPages reads the direction for preloading.\n\t\tthis.pageManager.maintainAfterEval(viewport, this.doc);\n\n\t\t// ── Phase 5.2g: Detect scroll direction & preload ───────────\n\t\tthis.preloadNextPages(viewport);\n\n\t\t// ── Restore VM state from nearest checkpoint before the viewport ──\n\t\t// This sets all variables that were defined at or before startLine-1.\n\t\tthis.restoreTo(viewport.startLine - 1);\n\n\t\t// ── Phase 5.3: Enable arena for zero-allocation Tier 2 execution ──\n\t\tenableValueArena();\n\t\ttry {\n\t\t\t// ── Evaluate only visible lines ──\n\t\t\tconst result = this.collectEvalResults(viewport.startLine, viewport.endLine);\n\t\t\treturn result;\n\t\t} finally {\n\t\t\t// Clear keystroke signal to prevent stale signal references.\n\t\t\tthis.engine.setKeystrokeSignal(null);\n\n\t\t\t// Phase 5.3: Always disable arena, even on exception.\n\t\t\t// Prevents cross-test contamination from arena leaks.\n\t\t\tdisableValueArena();\n\t\t}\n\t}\n\n\t/**\n\t * Apply incremental line-level changes to the document model.\n\t *\n\t * **Phase 5.2f:** Replaces the O(N) `setDocument()` + full re-evaluation\n\t * with O(changed) incremental updates. Key benefits:\n\t *\n\t * 1. Unchanged lines retain their persistent lineIds → bytecode survives\n\t * 2. Only changed + DAG-downstream lines are marked dirty → Tier 1 re-evaluation\n\t * 3. Clean lines in viewport use Tier 2 (cached bytecode execution)\n\t * 4. Clean lines outside viewport are skipped entirely\n\t *\n\t * The DAG is fully cleared after propagation: shifted lines would have\n\t * stale entries keyed by old line numbers, so the DAG is rebuilt from\n\t * scratch during the subsequent `evaluate()` call.\n\t *\n\t * **Caller should follow up with `evaluate(viewport)`** to re-evaluate\n\t * dirty lines from line 1 and rebuild the DAG + checkpoints.\n\t *\n\t * @param changes Line-level changes to apply. Must be non-overlapping.\n\t * @returns Metadata about the applied changes.\n\t */\n\tapplyTransaction(changes: LineChange[]): {\n\t\tinserted: number[];\n\t\tremoved: number[];\n\t} {\n\t\t// ── Phase 1: Collect DAG writes + downstream lineIds ───────────\n\t\t// Must happen BEFORE applyChanges() because line numbers are still\n\t\t// valid at this point. We collect writes from deleted lines and\n\t\t// resolve downstream consumers to lineIds (not line numbers) so\n\t\t// they survive the position shifts that applyChanges() causes.\n\t\tconst allWrites = new Set<string>();\n\n\t\tfor (const change of changes) {\n\t\t\tfor (let i = 0; i < change.deleteCount; i++) {\n\t\t\t\tconst lineNum = change.startLine + i;\n\t\t\t\tconst writes = this.dag.getWrites(lineNum);\n\t\t\t\tfor (const w of writes) {\n\t\t\t\t\tallWrites.add(w);\n\t\t\t\t}\n\t\t\t\t// Clean up DAG references for this line\n\t\t\t\tthis.dag.removeLine(lineNum);\n\t\t\t\t// And its cached bytecode. The dependency graph was already\n\t\t\t\t// pruned here; the LineCache was not, so a deleted line kept its\n\t\t\t\t// entry until the whole cache was dropped on a document switch.\n\t\t\t\t// Editing a long document over a session accumulated entries for\n\t\t\t\t// line numbers that no longer existed.\n\t\t\t\tthis.engine.getLineCache().removeAllForLine(lineNum);\n\t\t\t}\n\t\t}\n\n\t\t// Resolve downstream consumers to persistent lineIds BEFORE the\n\t\t// structural change shifts line numbers. After applyChanges(),\n\t\t// we mark these lineIds dirty, their positions don't matter.\n\t\tconst downstreamLineIds = new Set<number>();\n\t\tfor (const writeVar of allWrites) {\n\t\t\tconst affected = this.dag.getAffectedLines(writeVar);\n\t\t\tfor (const lineNum of affected) {\n\t\t\t\tconst state = this.doc.getLineAt(lineNum);\n\t\t\t\tif (state) {\n\t\t\t\t\tdownstreamLineIds.add(state.lineId);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// ── Phase 2: Apply structural changes to DocumentModel ─────────\n\t\tconst result = this.doc.applyChanges(changes);\n\n\t\t// ── Phase 3: Clear checkpointer (line numbers shifted) ─────────\n\t\tthis.checkpointer?.clear();\n\n\t\t// ── Phase 4: Mark DAG-downstream lines dirty by lineId ─────────\n\t\t// Using lineId instead of line number is position-agnostic:\n\t\t// lines that shifted due to insertions/deletions above them are\n\t\t// still correctly targeted. Lines that were deleted (lineId no\n\t\t// longer in the doc) are silently ignored by markDirty().\n\t\tfor (const lineId of downstreamLineIds) {\n\t\t\tthis.doc.markDirty(lineId);\n\t\t}\n\n\t\t// ── Phase 5: Clear DAG to avoid phantom entries ────────────────\n\t\t// Entries keyed by old line numbers are stale after structural\n\t\t// changes. Rather than updating shifted entries, we clear the DAG\n\t\t// and let the subsequent evaluate() call rebuild it from scratch.\n\t\tthis.dag.clear();\n\n\t\treturn {\n\t\t\tinserted: result.inserted,\n\t\t\tremoved: result.removed,\n\t\t};\n\t}\n\n\t// ── Private helpers ─────────────────────────────────────────────────\n\n\t/**\n\t * Collect evaluation results for a contiguous range of lines.\n\t *\n\t * Used by both `evaluate()` (startLine=1) and `setViewport()` (any start).\n\t * All lines in the range are treated as in-viewport (visible), callers that\n\t * need the invisible/dirty → Tier 3 handling should use `evaluate()` instead.\n\t *\n\t * @param startLine First line to evaluate (1-based, inclusive).\n\t * @param endLine Last line to evaluate (1-based, inclusive). Clamped to docEnd.\n\t */\n\tprivate collectEvalResults(startLine: number, endLine: number): EvalResult {\n\t\tconst lines: EvalLineResult[] = [];\n\t\tconst resultMap = new Map<number, Value[]>();\n\t\tconst tierCounts = { tier1: 0, tier2: 0, tier3: 0, skipped: 0 };\n\n\t\tconst docEnd = this.doc.lineCount;\n\t\tconst evalEnd = Math.min(endLine, docEnd);\n\n\t\tfor (let pos = startLine; pos <= evalEnd; pos++) {\n\t\t\tconst state = this.doc.getLineAt(pos);\n\t\t\tif (!state) continue;\n\n\t\t\t// All processed lines are in-viewport for setViewport, or conditionally\n\t\t\t// in-viewport for evaluate (handled by caller). We pass `true` here\n\t\t\t// because evaluateSingleLine's `inViewport` param controls Tier 1 vs\n\t\t\t// Tier 3 dispatch; callers must manage this distinction externally.\n\t\t\t//\n\t\t\t// evaluate() handles this by passing `inViewport` per-line; it loops\n\t\t\t// directly rather than using this helper for that reason.\n\t\t\tconst lineResult = this.evaluateSingleLine(state, pos, true);\n\t\t\tlines.push(lineResult);\n\n\t\t\tif (lineResult.tier === EvalTier.Tier1) tierCounts.tier1++;\n\t\t\telse if (lineResult.tier === EvalTier.Tier2) tierCounts.tier2++;\n\t\t\telse if (lineResult.tier === EvalTier.Tier3) tierCounts.tier3++;\n\t\t\telse tierCounts.skipped++;\n\n\t\t\tif (lineResult.results) {\n\t\t\t\tresultMap.set(pos, lineResult.results.flat());\n\t\t\t}\n\t\t}\n\n\t\treturn { lines, resultMap, tierCounts };\n\t}\n\n\t/**\n\t * Check whether any **variable-definition** line before `position`\n\t * (1-based, exclusive) is dirty.\n\t *\n\t * Used by `setViewport()` to decide whether to fall back to `evaluate()`:\n\t * if a variable-def before the viewport is dirty, the checkpoint state\n\t * `restoreTo()` would use may be stale and we need to reprocess from\n\t * line 1 to rebuild checkpoints correctly.\n\t *\n\t * Deliberately narrower than `DocumentModel.hasAnyDirtyLineBefore()`:\n\t * checkpoints only snapshot variable-def lines (see VMCheckpointer), so a\n\t * dirty plain-expression line before the viewport can't have invalidated\n\t * one, there's nothing checkpointed for it to invalidate. Using the\n\t * broader check here previously caused a real perf bug: `PageManager`'s\n\t * cold-page eviction marks evicted non-variable-def lines dirty, so\n\t * scrolling far into a large, variable-def-free document would trip this\n\t * guard, fall back to `evaluate()`, which recompiles those lines via\n\t * Tier 3 (never clearing their dirty flag by design), causing the very\n\t * next `maintainAfterEval()` to re-evict and re-dirty them, a\n\t * self-sustaining loop that pinned every subsequent `setViewport()` call\n\t * to the cost of a full re-evaluation instead of O(visible lines).\n\t *\n\t * Delegates to DocumentModel.hasAnyDirtyVariableDefLineBefore(), which\n\t * tracks dirty lineIds incrementally instead of scanning every line up to\n\t * `position` on every call. This used to be a real per-scroll cost\n\t * (benchmarked at ~10ms scrolled near the bottom of a 20k-line document)\n\t * since it fired on every viewport change, not just edits.\n\t */\n\tprivate hasDirtyLinesBefore(position: number): boolean {\n\t\treturn this.doc.hasAnyDirtyVariableDefLineBefore(position);\n\t}\n\n\t/**\n\t * Evaluate a single line using the appropriate tier.\n\t *\n\t * Tier assignment logic:\n\t * - Empty/markdown-only lines → skipped\n\t * - Dirty + in-viewport → Tier 1 (full pipeline)\n\t * - Dirty + not in viewport → Tier 3 (compile-only, execute variable defs)\n\t * - Clean + has bytecode + in viewport → Tier 2 (execute from cache)\n\t * - Clean + no bytecode → skipped (non-evaluable)\n\t */\n\tprivate evaluateSingleLine(\n\t\tstate: LineState,\n\t\tlineNumber: number,\n\t\tinViewport: boolean\n\t): EvalLineResult {\n\t\tconst baseResult: Omit<EvalLineResult, \"tier\" | \"result\" | \"error\"> = {\n\t\t\tlineId: state.lineId,\n\t\t\tlineNumber,\n\t\t};\n\n\t\t// Skip empty/markdown-only lines\n\t\tif (state.isEmpty || isEmptyLine(state.text)) {\n\t\t\tstate.isEmpty = true;\n\t\t\tthis.doc.markClean(state.lineId);\n\t\t\treturn { ...baseResult, tier: EvalTier.Skipped, result: null, error: null };\n\t\t}\n\n\t\t// Extract all evaluable expressions (may be multiple inline solves)\n\t\tconst { expressions, inlineSolveCount } = this.extractExpressions(state);\n\t\tif (expressions.length === 0) {\n\t\t\tstate.isEmpty = true;\n\t\t\tthis.doc.markClean(state.lineId);\n\t\t\treturn { ...baseResult, tier: EvalTier.Skipped, result: null, error: null };\n\t\t}\n\n\t\t// Determine the expression to evaluate (only needed for dirty lines)\n\t\tif (state.dirty) {\n\t\t\tif (inViewport) {\n\t\t\t\t// ── Tier 1: Visible + Dirty → Full Pipeline ──────────\n\t\t\t\treturn this.evaluateTier1(state, lineNumber, expressions, inlineSolveCount, baseResult);\n\t\t\t} else {\n\t\t\t\t// ── Tier 3: Invisible + Dirty → Compile-only ─────────\n\t\t\t\t// Skip recompilation if already compiled by a previous Tier 3 pass.\n\t\t\t\t// Non-variable-def lines keep dirty=true after Tier 3 (so they get\n\t\t\t\t// Tier 1 when scrolled into view), but recompiling identical text\n\t\t\t\t// produces the same bytecode and DAG entries. Text changes clear\n\t\t\t\t// bytecodes via DocumentModel.editLine(), so a length check is safe.\n\t\t\t\tif (state.bytecodes.length > 0 && state.bytecodes.length === expressions.length && !state.isVariableDef) {\n\t\t\t\t\treturn { ...baseResult, tier: EvalTier.Skipped, result: null, error: null };\n\t\t\t\t}\n\t\t\t\treturn this.evaluateTier3(state, lineNumber, expressions, inlineSolveCount, baseResult);\n\t\t\t}\n\t\t}\n\n\t\t// Line is clean\n\t\tif (inViewport && state.bytecodes.length > 0) {\n\t\t\t// ── Tier 2: Visible + Cached → Execute from bytecode ────\n\t\t\treturn this.evaluateTier2(state, lineNumber, baseResult);\n\t\t}\n\n\t\t// Clean, not in viewport, or no bytecode → skip\n\t\treturn { ...baseResult, tier: EvalTier.Skipped, result: null, error: null };\n\t}\n\n\t/**\n\t * Tier 1: Full pipeline, lex, parse, compile, execute.\n\t * Uses the engine's existing evaluateLine() which handles all pipeline\n\t * stages including DAG updates and LineCache population.\n\t *\n\t * Supports multiple expressions per line (inline solves). Evaluates each\n\t * expression left-to-right through the engine so variable definitions in\n\t * earlier solves update the VM state before later solves are evaluated.\n\t * Reads/writes are aggregated across all expressions for the DAG.\n\t */\n\tprivate evaluateTier1(\n\t\tstate: LineState,\n\t\tlineNumber: number,\n\t\texpressions: string[],\n\t\tinlineSolveCount: number,\n\t\tbaseResult: Omit<EvalLineResult, \"tier\" | \"result\" | \"error\">\n\t): EvalLineResult {\n\t\tconst allResults: Value[][] = [];\n\t\tconst allBytecodes: BytecodeProgram[] = [];\n\t\tconst allReads = new Set<string>();\n\t\tconst allWrites = new Set<string>();\n\t\tlet hasVariableDef = false;\n\t\tlet lastValue: Value | null = null;\n\t\tlet firstError: string | null = null;\n\t\tlet anyFailed = false;\n\t\t/** Set when any expression returned a value still waiting on a resolver. */\n\t\tlet anyPending = false;\n\n\t\t// Evaluate each expression independently, a failure in one expression\n\t\t// (e.g., parse error in s`bad syntax`) must not prevent other expressions\n\t\t// on the same line from being evaluated and having their results stored.\n\t\t// Without per-expression error handling, same-line cross-reference inline\n\t\t// solves (s`:a = 5` s`:b = a + 3` s`a + b`) would lose ALL results when\n\t\t// the third expression throws because 'b' references cross a VM state\n\t\t// boundary or the engine encounters a transient error.\n\t\tfor (const expression of expressions) {\n\t\t\tif (!expression.trim()) continue;\n\n\t\t\tlet value: Value[] | null = null;\n\t\t\tlet entry: { bytecode: BytecodeProgram; readVariables: string[]; writeVariable: string | null } | undefined;\n\n\t\t\ttry {\n\t\t\t\tconst evaluation = this.engine.evaluateLineDetailed(lineNumber, expression);\n\t\t\t\tvalue = evaluation.values;\n\t\t\t\tlastValue = value[0];\n\t\t\t\t// Sync the DocumentModel from the LineCache.\n\t\t\t\t// Use get(lineNumber, expression) instead of getEntryForLine(lineNumber)\n\t\t\t\t// because multiple expressions on the same line share the same lineNumber\n\t\t\t\t// and getEntryForLine always returns the FIRST entry (Map insertion order).\n\t\t\t\tentry = this.engine.getLineCache().get(lineNumber, expression) as typeof entry;\n\t\t\t} catch (e) {\n\t\t\t\tconst errorMessage = e instanceof Error ? e.message : String(e);\n\t\t\t\tif (!firstError) firstError = errorMessage;\n\t\t\t\tanyFailed = true;\n\t\t\t\tvalue = null;\n\t\t\t}\n\n\t\t\t// An unresolved async value does not throw, so `anyFailed` alone would\n\t\t\t// let this line be marked clean while its data has not arrived. Once\n\t\t\t// clean, nothing re-runs the resolver preflight and the value stays\n\t\t\t// pending for good. Treat it as not-yet-complete instead.\n\t\t\tif (value && value.some((v) => v.type === ValueType.Pending)) {\n\t\t\t\tanyPending = true;\n\t\t\t}\n\n\t\t\tif (value) {\n\t\t\t\tallResults.push(value);\n\t\t\t} else {\n\t\t\t\t// Expression failed, push an ErrorValue sentinel so results[] stays\n\t\t\t\t// aligned with expressions[] and bytecodes[] indices. Downstream code\n\t\t\t\t// checking result.type === Error will find it, vs a raw null that NPEs.\n\t\t\t\tallResults.push([errorValue(\"eval_failed\", firstError ?? \"unknown error\")]);\n\t\t\t}\n\n\t\t\tif (entry) {\n\t\t\t\tallBytecodes.push(entry.bytecode);\n\t\t\t\tfor (const r of entry.readVariables) allReads.add(r);\n\t\t\t\tif (entry.writeVariable) {\n\t\t\t\t\tallWrites.add(entry.writeVariable);\n\t\t\t\t\thasVariableDef = true;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Fallback: LineCache missed, compile expression ourselves\n\t\t\t\ttry {\n\t\t\t\t\tconst { program, reads, writes } = this.engine.compileExpression(expression);\n\t\t\t\t\tallBytecodes.push(program);\n\t\t\t\t\tfor (const r of reads) allReads.add(r);\n\t\t\t\t\tfor (const w of writes) allWrites.add(w);\n\t\t\t\t\tif (writes.length > 0) hasVariableDef = true;\n\t\t\t\t} catch (compileErr) {\n\t\t\t\t\t// Push empty bytecode, expression will recompile on next pass.\n\t\t\t\t\t// The expression still failed to compile, but reads/writes were\n\t\t\t\t\t// already extracted from its tokens before the parse attempt\n\t\t\t\t\t// compileExpression() surfaces them via the thrown error's\n\t\t\t\t\t// context. Register them anyway so the DAG knows this line\n\t\t\t\t\t// depends on those variables and re-evaluates it once they\n\t\t\t\t\t// become defined, instead of losing the dependency entirely.\n\t\t\t\t\tallBytecodes.push({ opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false });\n\t\t\t\t\tif (compileErr instanceof EngineError && compileErr.context) {\n\t\t\t\t\t\tconst errReads = compileErr.context.reads;\n\t\t\t\t\t\tconst errWrites = compileErr.context.writes;\n\t\t\t\t\t\tif (Array.isArray(errReads)) for (const r of errReads) allReads.add(r);\n\t\t\t\t\t\tif (Array.isArray(errWrites)) for (const w of errWrites) allWrites.add(w);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst reads = [...allReads];\n\t\tconst writes = [...allWrites];\n\n\t\t// Always store results, even partial ones. If any expression failed\n\t\t// the line stays dirty so the failed expression(s) get retried on the\n\t\t// next evaluation pass. But successfully-evaluated expressions' results\n\t\t// are preserved so the DAG, UI decorations, and downstream consumers\n\t\t// can use them immediately.\n\t\tif (anyFailed || anyPending) {\n\t\t\t// Store partial results via updateLineCompiled (doesn't clear dirty).\n\t\t\t// The successful expressions' bytecodes are cached so Tier 2 works\n\t\t\t// for them on the next scroll pass.\n\t\t\tthis.doc.updateLineCompiled(\n\t\t\t\tstate.lineId,\n\t\t\t\texpressions,\n\t\t\t\tallBytecodes,\n\t\t\t\treads,\n\t\t\t\twrites,\n\t\t\t\thasVariableDef,\n\t\t\t\tinlineSolveCount,\n\t\t\t);\n\t\t\t// Also set results for the successful expressions\n\t\t\tstate.results = allResults;\n\t\t\tstate.result = allResults[0]?.[0] ?? null;\n\t\t\tstate.inlineSolveCount = inlineSolveCount;\n\t\t\tstate.expressions = expressions;\n\t\t} else {\n\t\t\t// All expressions succeeded, store full results and mark clean\n\t\t\tthis.doc.updateLineResult(\n\t\t\t\tstate.lineId,\n\t\t\t\tallResults,\n\t\t\t\tallBytecodes,\n\t\t\t\texpressions,\n\t\t\t\treads,\n\t\t\t\twrites,\n\t\t\t\thasVariableDef,\n\t\t\t\tinlineSolveCount,\n\t\t\t);\n\t\t}\n\n\t\t// Register reads/writes in DAG (aggregated across all expressions).\n\t\t// Always register, even lines with no reads/writes (pure expressions\n\t\t// like \"2+2\") need DAG entries so downstream queries for line presence work.\n\t\tthis.dag.registerLine(lineNumber, reads, writes);\n\n\t\t// ── Checkpoint after variable definition ──\n\t\t// A pending value is not a value worth checkpointing: restoring it would\n\t\t// reinstate the unresolved placeholder rather than the eventual result.\n\t\tif (this.checkpointer && writes.length > 0 && !anyFailed && !anyPending) {\n\t\t\tthis.checkpointer.snapshot(lineNumber, state.lineId, writes);\n\t\t}\n\n\t\treturn {\n\t\t\t...baseResult,\n\t\t\ttier: EvalTier.Tier1,\n\t\t\tresult: lastValue,\n\t\t\tresults: allResults,\n\t\t\terror: firstError,\n\t\t};\n\t}\n\n\t/**\n\t * Tier 2: Execute from cached bytecode only.\n\t * Skips lexing, parsing, and compiling, runs the pre-compiled bytecode\n\t * against the engine's shared VM. Supports multiple bytecodes per line\n\t * (inline solves), each is executed left-to-right so variable definitions\n\t * in earlier bytecodes update the VM before later ones run.\n\t * Assumes the VM already has correct variable state from preceding\n\t * Tier-1 evaluations.\n\t */\n\tprivate evaluateTier2(\n\t\tstate: LineState,\n\t\tlineNumber: number,\n\t\tbaseResult: Omit<EvalLineResult, \"tier\" | \"result\" | \"error\">\n\t): EvalLineResult {\n\t\tif (state.bytecodes.length === 0) {\n\t\t\treturn { ...baseResult, tier: EvalTier.Skipped, result: null, error: null };\n\t\t}\n\n\t\tconst results: Value[][] = [];\n\t\tlet lastValue: Value | null = null;\n\t\tlet firstError: string | null = null;\n\t\tlet anyFailed = false;\n\n\t\t// Execute each bytecode independently, a failure in one should not\n\t\t// prevent other bytecodes on the same line from executing. Same-line\n\t\t// inline solves with variable definitions (s`:a = 5` s`a + 3`) rely\n\t\t// on earlier bytecodes updating the VM before later ones execute.\n\t\tfor (const bytecode of state.bytecodes) {\n\t\t\tif (bytecode.opcodes.length === 0) continue;\n\t\t\ttry {\n\t\t\t\tconst value = this.engine.executeCached(bytecode, lineNumber);\n\t\t\t\tlastValue = value;\n\t\t\t\tresults.push([value]);\n\t\t\t} catch (e) {\n\t\t\t\tconst errorMessage = e instanceof Error ? e.message : String(e);\n\t\t\t\tif (!firstError) firstError = errorMessage;\n\t\t\t\tanyFailed = true;\n\t\t\t\t// Push error sentinel to maintain results[i] ↔ bytecodes[i] alignment\n\t\t\t\tresults.push([errorValue(\"exec_failed\", errorMessage)]);\n\t\t\t}\n\t\t}\n\n\t\t// Update DAG: re-register reads/writes from the cached metadata.\n\t\t// Always register, even empty reads/writes so DAG line-presence queries work.\n\t\tthis.dag.registerLine(lineNumber, state.reads, state.writes);\n\n\t\tstate.results = results;\n\t\tstate.result = results[0]?.[0] ?? null;\n\t\tif (anyFailed) {\n\t\t\t// Mark dirty so failed bytecodes are re-compiled (Tier 1) next pass\n\t\t\tthis.doc.markDirty(state.lineId);\n\t\t}\n\n\t\treturn { ...baseResult, tier: EvalTier.Tier2, result: lastValue, results, error: firstError };\n\t}\n\n\t/**\n\t * Tier 3: Compile-only for invisible lines.\n\t * Lex → Parse → Compile to discover reads/writes for the dependency graph.\n\t * Executes the bytecode ONLY if the line defines a variable (isVariableDef\n\t * or writes.length > 0), because variable assignments affect VM state\n\t * that other lines depend on. Pure expression lines are compiled but NOT\n\t * executed, saving CPU for large documents.\n\t *\n\t * Supports multiple expressions per line (inline solves). Each is compiled\n\t * separately; variable-def expressions are also executed.\n\t */\n\tprivate evaluateTier3(\n\t\tstate: LineState,\n\t\tlineNumber: number,\n\t\texpressions: string[],\n\t\tinlineSolveCount: number,\n\t\tbaseResult: Omit<EvalLineResult, \"tier\" | \"result\" | \"error\">\n\t): EvalLineResult {\n\t\tconst allBytecodes: BytecodeProgram[] = [];\n\t\tconst allReads = new Set<string>();\n\t\tconst allWrites = new Set<string>();\n\t\tlet hasVariableDef = false;\n\t\tlet lastResult: Value | null = null;\n\t\tlet firstError: string | null = null;\n\t\tlet anyFailed = false;\n\t\t/** Set when a result is still waiting on a resolver. */\n\t\tlet anyPending = false;\n\n\t\t// Compile each expression independently, a parse error in one\n\t\t// should not prevent other expressions from being compiled and\n\t\t// having their reads/writes registered in the DAG.\n\t\tfor (const expression of expressions) {\n\t\t\tif (!expression.trim()) continue;\n\n\t\t\ttry {\n\t\t\t\tconst { program, reads, writes } = this.engine.compileExpression(expression);\n\t\t\t\tallBytecodes.push(program);\n\t\t\t\tfor (const r of reads) allReads.add(r);\n\t\t\t\tfor (const w of writes) allWrites.add(w);\n\t\t\t\tif (writes.length > 0) hasVariableDef = true;\n\n\t\t\t\tif (writes.length > 0 && program.opcodes.length > 0) {\n\t\t\t\t\t// Variable definitions MUST execute to maintain VM state\n\t\t\t\t\tlastResult = this.engine.executeCached(program, lineNumber);\n\t\t\t\t\t// Same reasoning as Tier 1: a pending result does not throw,\n\t\t\t\t\t// and marking the line clean would strand it unresolved.\n\t\t\t\t\tif (lastResult && lastResult.type === ValueType.Pending) {\n\t\t\t\t\t\tanyPending = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\tconst errorMessage = e instanceof Error ? e.message : String(e);\n\t\t\t\tif (!firstError) firstError = errorMessage;\n\t\t\t\tanyFailed = true;\n\t\t\t\t// Push empty bytecode placeholder for alignment\n\t\t\t\tallBytecodes.push({ opcodes: new Uint8Array(0), numbers: new Float64Array(0), strings: [], hasAsync: false });\n\t\t\t}\n\t\t}\n\n\t\tconst reads = [...allReads];\n\t\tconst writes = [...allWrites];\n\n\t\t// Store compile-only state in DocumentModel, even partial results\n\t\t// preserve successful expressions' bytecodes and DAG data.\n\t\tthis.doc.updateLineCompiled(\n\t\t\tstate.lineId,\n\t\t\texpressions,\n\t\t\tallBytecodes,\n\t\t\treads,\n\t\t\twrites,\n\t\t\thasVariableDef,\n\t\t\tinlineSolveCount,\n\t\t);\n\n\t\t// Register reads/writes in DAG regardless, partial data is valid.\n\t\t// Always register, even empty reads/writes for DAG line-presence queries.\n\t\tthis.dag.registerLine(lineNumber, reads, writes);\n\n\t\tif (hasVariableDef && lastResult && !anyFailed && !anyPending) {\n\t\t\tstate.results = [[lastResult]];\n\t\t\tstate.result = lastResult;\n\t\t\tthis.doc.markClean(state.lineId);\n\n\t\t\t// ── Checkpoint after variable definition ────────────\n\t\t\tif (this.checkpointer) {\n\t\t\t\tthis.checkpointer.snapshot(lineNumber, state.lineId, writes);\n\t\t\t}\n\t\t}\n\n\t\treturn { ...baseResult, tier: EvalTier.Tier3, result: lastResult, results: hasVariableDef && lastResult && !anyFailed && !anyPending ? [[lastResult]] : undefined, error: firstError };\n\t}\n\n\t// ── Public checkpoint API (used by Phase 5.2e setViewport) ──────\n\n\t/**\n\t * Restore the VM to the state at or just after the given line number.\n\t *\n\t * Finds the nearest checkpoint at or before `lineNumber` and replays\n\t * all variable definitions from the checkpoint chain into the VM.\n\t * After calling this, the VM is ready to evaluate lines starting at\n\t * `lineNumber + 1` without re-evaluating all preceding lines.\n\t *\n\t * **Usage:** Phase 5.2e's `setViewport()` calls `restoreTo(viewport.startLine - 1)`\n\t * before evaluating only the newly visible lines. This is the key to\n\t * O(visible lines) scrolling.\n\t *\n\t * @param lineNumber The line number to restore to. Variables defined\n\t * at lines ≤ this number will be available in the VM.\n\t */\n\trestoreTo(lineNumber: number): void {\n\t\tif (this.checkpointer) {\n\t\t\tthis.checkpointer.restoreTo(lineNumber);\n\t\t}\n\t}\n\n\t/**\n\t * Get the VM checkpointer, or null if checkpointing is disabled.\n\t */\n\tgetCheckpointer(): VMCheckpointer | null {\n\t\treturn this.checkpointer;\n\t}\n\n\t/**\n\t * Get the PageManager (Phase 5.2g).\n\t * Exposed for testing.\n\t */\n\tgetPageManager(): PageManager {\n\t\treturn this.pageManager;\n\t}\n\n\t// ── Phase 5.2g: Directional preloading ──────────────────────────\n\n\t/**\n\t * Preload the next 1–2 pages in the current scroll direction.\n\t *\n\t * Called during `setViewport()` (scroll-only path). Collects dirty\n\t * uncompiled lines in pages just beyond the viewport and dispatches\n\t * them to the background compilation worker so bytecode is ready\n\t * before the user scrolls those lines into view.\n\t */\n\tprivate preloadNextPages(viewport: ViewportRange): void {\n\t\tconst targets = this.pageManager.getPreloadTargets(viewport, this.doc);\n\t\tif (targets.length === 0) return;\n\n\t\t// Lazy-init worker if needed\n\t\tif (!this.compilationWorker) {\n\t\t\tthis.compilationWorker = new CompilationWorkerManager();\n\t\t}\n\n\t\t// Fire-and-forget: worker compiles, stores bytecode on response\n\t\tthis.compilationWorker.compileBatch(targets).then((results) => {\n\t\t\tthis.compilationWorker!.storeResults(results, this.doc);\n\t\t}).catch((_err) => {\n\t\t\t// Non-fatal, next evaluate() will compile synchronously\n\t\t});\n\t}\n\n\t/**\n\t * Collect invisible dirty lines that need background compilation.\n\t *\n\t * Iterates lines beyond `viewport.endLine`, filtering for:\n\t * - Dirty lines (need re-compilation)\n\t * - Non-empty, non-markdown lines\n\t * - No existing bytecode (skip already-compiled Tier 3 lines)\n\t *\n\t * Returns CompileRequestItem[] suitable for CompilationWorkerManager.\n\t */\n\tprivate collectInvisibleCompileTargets(viewport: ViewportRange): CompileRequestItem[] {\n\t\tconst items: CompileRequestItem[] = [];\n\t\tconst docEnd = this.doc.lineCount;\n\t\tconst startPos = viewport.endLine + 1;\n\n\t\tfor (let pos = startPos; pos <= docEnd; pos++) {\n\t\t\tconst state = this.doc.getLineAt(pos);\n\t\t\tif (!state) continue;\n\n\t\t\t// Skip clean lines\n\t\t\tif (!state.dirty) continue;\n\n\t\t\t// Skip already-compiled lines\n\t\t\tif (state.bytecodes.length > 0 && !state.isVariableDef) continue;\n\n\t\t\t// Skip empty/markdown-only lines\n\t\t\tif (state.isEmpty || isEmptyLine(state.text)) continue;\n\n\t\t\tconst { expressions } = this.extractExpressions(state);\n\t\t\tif (expressions.length === 0) continue;\n\n\t\t\t// Create one CompileRequestItem per expression (inline solves\n\t\t\t// on the same line share the same lineId + textHash). The worker\n\t\t\t// compiles each independently; storeResults batches by lineId.\n\t\t\tfor (const expression of expressions) {\n\t\t\t\tif (!expression.trim()) continue;\n\t\t\t\titems.push({\n\t\t\t\t\tlineId: state.lineId,\n\t\t\t\t\texpression,\n\t\t\t\t\ttextHash: state.textHash,\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn items;\n\t}\n\n\t/**\n\t * Extract all evaluable expressions from a LineState.\n\t *\n\t * For full-line expressions: returns `{ expressions: [trimmedText], inlineSolveCount: 0 }`.\n\t * For inline solve lines: returns `{ expressions: [...allSolves], inlineSolveCount: N }`.\n\t * For pre-extracted (cached) expressions: returns the cached array.\n\t *\n\t * Inline solves are extracted left-to-right via the sharedLexer, so variable\n\t * definitions in earlier solves (e.g., `s\\`x = 5\\` more text s\\`x + 1\\``)\n\t * correctly update the VM state before later solves are evaluated.\n\t */\n\tprivate extractExpressions(state: LineState): { expressions: string[]; inlineSolveCount: number } {\n\t\t// Use pre-extracted expressions if available (from cache / previous evaluation)\n\t\tif (state.expressions.length > 0) {\n\t\t\treturn { expressions: state.expressions, inlineSolveCount: state.inlineSolveCount };\n\t\t}\n\n\t\tconst trimmed = state.text.trim();\n\t\tif (trimmed.length === 0) return { expressions: [], inlineSolveCount: 0 };\n\n\t\t// Check for inline solve syntax: s`expression`\n\t\tconst inlineSpans = sharedLexer.findInlineSolves(state.text);\n\t\tif (inlineSpans.length > 0) {\n\t\t\treturn {\n\t\t\t\texpressions: inlineSpans.map(s => s.expression),\n\t\t\t\tinlineSolveCount: inlineSpans.length,\n\t\t\t};\n\t\t}\n\n\t\t// Full-line expression\n\t\treturn { expressions: [trimmed], inlineSolveCount: 0 };\n\t}\n}\n"]}