@optimystic/quereus-plugin-optimystic 0.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (45) hide show
  1. package/README.md +358 -0
  2. package/dist/index.d.ts +96 -0
  3. package/dist/index.js +2973 -0
  4. package/dist/index.js.map +1 -0
  5. package/dist/plugin-B1lVAVv0.d.ts +596 -0
  6. package/dist/plugin.d.ts +4 -0
  7. package/dist/plugin.js +2873 -0
  8. package/dist/plugin.js.map +1 -0
  9. package/examples/README.md +232 -0
  10. package/examples/quoomb.config.absolute.json +22 -0
  11. package/examples/quoomb.config.dev.json +16 -0
  12. package/examples/quoomb.config.linked.json +25 -0
  13. package/examples/quoomb.config.local.json +22 -0
  14. package/examples/quoomb.config.node1.json +23 -0
  15. package/examples/quoomb.config.node2.env.json +28 -0
  16. package/examples/quoomb.config.node2.json +29 -0
  17. package/examples/quoomb.config.single-node.json +25 -0
  18. package/examples/quoomb.config.web.json +30 -0
  19. package/examples/start-mesh.ps1 +48 -0
  20. package/examples/start-mesh.sh +44 -0
  21. package/examples/test-comprehensive.sql +25 -0
  22. package/examples/test-manual-plugin.txt +23 -0
  23. package/examples/test-multi-insert.sql +11 -0
  24. package/examples/test-network.sql +20 -0
  25. package/examples/test-plugin.sql +20 -0
  26. package/examples/test-single-insert.sql +20 -0
  27. package/examples/test-single-node.sql +20 -0
  28. package/package.json +131 -0
  29. package/src/functions/transaction-id.ts +29 -0
  30. package/src/index.ts +42 -0
  31. package/src/optimystic-adapter/collection-factory.ts +337 -0
  32. package/src/optimystic-adapter/key-network.ts +106 -0
  33. package/src/optimystic-adapter/txn-bridge.ts +272 -0
  34. package/src/optimystic-adapter/vtab-connection.ts +76 -0
  35. package/src/optimystic-module.ts +1064 -0
  36. package/src/plugin.ts +64 -0
  37. package/src/schema/index-manager.ts +266 -0
  38. package/src/schema/row-codec.ts +312 -0
  39. package/src/schema/schema-manager.ts +217 -0
  40. package/src/schema/statistics-collector.ts +173 -0
  41. package/src/transaction/index.ts +16 -0
  42. package/src/transaction/quereus-engine.ts +174 -0
  43. package/src/types.ts +91 -0
  44. package/src/util/generate-transaction-id.ts +41 -0
  45. package/test/README.md +313 -0
package/dist/plugin.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/optimystic-adapter/key-network.ts","../src/optimystic-adapter/collection-factory.ts","../node_modules/multiformats/src/bases/base58.ts","../node_modules/multiformats/src/bytes.ts","../node_modules/multiformats/src/vendor/base-x.js","../node_modules/multiformats/src/bases/base.ts","../node_modules/multiformats/src/bases/base32.ts","../node_modules/multiformats/src/bases/base36.ts","../node_modules/multiformats/src/vendor/varint.js","../node_modules/multiformats/src/varint.ts","../node_modules/multiformats/src/hashes/digest.ts","../node_modules/multiformats/src/hashes/identity.ts","../node_modules/uint8arrays/src/util/as-uint8array.node.ts","../node_modules/uint8arrays/src/alloc.node.ts","../node_modules/multiformats/src/bases/base10.ts","../node_modules/multiformats/src/bases/base16.ts","../node_modules/multiformats/src/bases/base2.ts","../node_modules/multiformats/src/bases/base256emoji.ts","../node_modules/multiformats/src/bases/base64.ts","../node_modules/multiformats/src/bases/base8.ts","../node_modules/multiformats/src/bases/identity.ts","../node_modules/multiformats/src/codecs/json.ts","../node_modules/multiformats/src/hashes/sha2.ts","../node_modules/multiformats/src/hashes/hasher.ts","../node_modules/multiformats/src/basics.ts","../node_modules/uint8arrays/src/util/bases.ts","../node_modules/uint8arrays/src/to-string.node.ts","../node_modules/@libp2p/crypto/src/random-bytes.ts","../src/util/generate-transaction-id.ts","../src/optimystic-adapter/txn-bridge.ts","../src/optimystic-adapter/vtab-connection.ts","../src/schema/schema-manager.ts","../src/schema/row-codec.ts","../src/schema/index-manager.ts","../src/schema/statistics-collector.ts","../src/optimystic-module.ts","../src/functions/transaction-id.ts","../src/plugin.ts"],"names":["name","createLibp2pNode","node","coordinatedRepo","Libp2pKeyPeerNetwork","getCustomRegistry","encode","length","i","j","decode","string","alphabet","code","digest","Buffer","identity_exports","identity","from","toString","base","randB","sha256","cache","TEXT_TYPE"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAA,mBAAA,GAAA,EAAA;AAAA,QAAA,CAAA,mBAAA,EAAA;AAAA,EAAA,gBAAA,EAAA,MAAA,gBAAA;AAAA,EAAA,iBAAA,EAAA,MAAA,iBAAA;AAAA,EAAA,kBAAA,EAAA,MAAA,kBAAA;AAAA,EAAA,kBAAA,EAAA,MAAA;AAAA,CAAA,CAAA;AAiBO,SAAS,kBAAA,CAAmBA,OAAc,cAAA,EAA2D;AAC1G,EAAA,cAAA,CAAe,WAAA,CAAY,GAAA,CAAIA,KAAAA,EAAM,cAAc,CAAA;AACrD;AAKO,SAAS,kBAAA,CAAmBA,OAAc,cAAA,EAAmD;AAClG,EAAA,cAAA,CAAe,WAAA,CAAY,GAAA,CAAIA,KAAAA,EAAM,cAAc,CAAA;AACrD;AAKA,eAAsB,gBAAA,CACpB,IAAA,EACA,MAAA,EACA,aAAA,EACsB;AACtB,EAAA,QAAQ,IAAA;AAAM,IACZ,KAAK,QAAA;AACH,MAAA,OAAO,MAAM,sBAAA,CAAuB,MAAA,EAAQ,aAAa,CAAA;AAAA,IAE3D,KAAK,MAAA;AACH,MAAA,OAAO,MAAM,oBAAA,EAAqB;AAAA,IAEpC;AACE,MAAA,OAAO,MAAM,uBAAuB,IAAI,CAAA;AAAA;AAE9C;AAKA,eAAe,sBAAA,CACb,gBACA,OAAA,EACsB;AACtB,EAAA,IAAI,MAAA;AAEJ,EAAA,IAAI,cAAA,EAAgB;AAClB,IAAA,MAAA,GAAS,cAAA;AAAA,EACX,CAAA,MAAO;AAEL,IAAA,MAAM,WAAA,GAAc;AAAA,MAClB,IAAA,EAAA,CAAM,mCAAS,IAAA,KAAQ,CAAA;AAAA;AAAA,MACvB,WAAA,EAAA,CAAa,mCAAS,WAAA,KAAe,YAAA;AAAA,MACrC,cAAA,EAAA,CAAgB,OAAA,IAAA,IAAA,GAAA,MAAA,GAAA,OAAA,CAAS,cAAA,KAAkB;AAAC,KAC9C;AAEA,IAAA,MAAA,GAAS,MAAM,iBAAiB,WAAW,CAAA;AAAA,EAC7C;AAEA,EAAA,OAAO,IAAI,qBAAqB,MAAM,CAAA;AACxC;AAKA,eAAe,oBAAA,GAA6C;AAE1D,EAAA,OAAO;AAAA,IACL,MAAM,eAAA,GAAkB;AACtB,MAAA,MAAM,IAAI,MAAM,kDAAkD,CAAA;AAAA,IACpE,CAAA;AAAA,IACA,MAAM,WAAA,GAAc;AAClB,MAAA,MAAM,IAAI,MAAM,kDAAkD,CAAA;AAAA,IACpE;AAAA,GACF;AACF;AAKA,eAAe,uBAAuBA,KAAAA,EAAoC;AACxE,EAAA,MAAM,gBAAA,GAAmB,cAAA,CAAe,WAAA,CAAY,GAAA,CAAIA,KAAI,CAAA;AAC5D,EAAA,IAAI,CAAC,gBAAA,EAAkB;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,oBAAA,EAAuBA,KAAI,CAAA,0DAAA,CAA4D,CAAA;AAAA,EACzG;AAEA,EAAA,OAAO,IAAI,gBAAA,EAAiB;AAC9B;AAKO,SAAS,iBAAA,GAAkD;AAChE,EAAA,OAAO,cAAA;AACT;AAzGA,IASM,cAAA;AATN,IAAA,gBAAA,GAAA,KAAA,CAAA;AAAA,EAAA,uCAAA,GAAA;AASA,IAAM,cAAA,GAA+C;AAAA,MACnD,WAAA,sBAAiB,GAAA,EAAI;AAAA,MACrB,WAAA,sBAAiB,GAAA;AAAI,KACvB;AAAA,EAAA;AAAA,CAAA,CAAA;ACDO,IAAM,oBAAN,MAAwB;AAAA,EACrB,WAAA,uBAAkB,GAAA,EAAyB;AAAA,EAC3C,WAAA,uBAAkB,GAAA,EAAsD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMhF,MAAM,qBAAA,CACJ,OAAA,EACA,QAAA,EACgC;AAChC,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,gBAAA,CAAiB,OAAO,CAAA;AAGnD,IAAA,IAAA,CAAI,qCAAU,QAAA,KAAY,QAAA,CAAS,WAAA,CAAY,GAAA,CAAI,aAAa,CAAA,EAAG;AACjE,MAAA,OAAO,QAAA,CAAS,WAAA,CAAY,GAAA,CAAI,aAAa,CAAA;AAAA,IAC/C;AAGA,IAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,qBAAA,CAAsB,OAAO,CAAA;AAC3D,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,iBAAA,CAAkB,OAAA,CAAQ,aAAa,CAAA;AAEjE,IAAA,MAAM,OAAA,GAAU,CAAC,CAAA,EAAW,CAAA,KAA2B,IAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAA;AAGhF,IAAA,MAAM,YAAA,GAAe,QAAQ,aAAA,KAAkB,0BAAA;AAC/C,IAAA,MAAM,YAAA,GAAe,YAAA,GACjB,CAAC,KAAA,KAAe,KAAA,CAAM,CAAC,CAAA,GACvB,CAAC,KAAA,KAAmB,IAAA,CAAK,mBAAA,CAAoB,KAAK,CAAA;AAEtD,IAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,YAAA;AAAA,MAC5B,UAAA;AAAA,MACA,YAAA;AAAA,MACA,YAAA;AAAA,MACA;AAAA;AAAA,KACF;AAGA,IAAA,IAAI,qCAAU,QAAA,EAAU;AACtB,MAAA,QAAA,CAAS,WAAA,CAAY,GAAA,CAAI,aAAA,EAAe,UAAU,CAAA;AAAA,IACpD;AAEA,IAAA,OAAO,UAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,iBAAiB,OAAA,EAAwD;AAC7E,IAAA,QAAQ,QAAQ,UAAA;AAAY,MAC1B,KAAK,SAAA;AACH,QAAA,OAAO,MAAM,IAAA,CAAK,uBAAA,CAAwB,OAAO,CAAA;AAAA,MAEnD,KAAK,OAAA;AACH,QAAA,OAAO,MAAM,KAAK,qBAAA,EAAsB;AAAA,MAE1C,KAAK,MAAA;AACH,QAAA,OAAO,MAAM,KAAK,oBAAA,EAAqB;AAAA,MAEzC;AACE,QAAA,OAAO,MAAM,IAAA,CAAK,sBAAA,CAAuB,OAAA,CAAQ,UAAU,CAAA;AAAA;AAC/D,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,sBAAsB,OAAA,EAAwD;AAClF,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,gBAAA,CAAiB,OAAO,CAAA;AAEnD,IAAA,IAAI,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,aAAa,CAAA,EAAG;AACvC,MAAA,OAAO,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,aAAa,CAAA;AAAA,IAC3C;AAEA,IAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,gBAAA,CAAiB,OAAO,CAAA;AACtD,IAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,aAAA,EAAe,UAAU,CAAA;AAC9C,IAAA,OAAO,UAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,wBAAwB,OAAA,EAAwD;AA9FhG,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA;AAgGI,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AACvC,IAAA,IAAI,QAAA,GAAW,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,OAAO,CAAA;AAE3C,IAAA,IAAI,CAAC,QAAA,EAAU;AAEb,MAAA,MAAM,EAAE,gBAAA,EAAAC,iBAAAA,EAAiB,GAAI,MAAM,OAAO,oBAAoB,CAAA;AAE9D,MAAA,MAAMC,KAAAA,GAAO,MAAMD,iBAAAA,CAAiB;AAAA,QAClC,IAAA,EAAA,CAAA,CAAM,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,IAAA,KAAQ,CAAA;AAAA,QACrC,WAAA,EAAA,CAAA,CAAa,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,WAAA,KAAe,YAAA;AAAA,QACnD,cAAA,EAAA,CAAA,CAAgB,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,mBAAkB,EAAC;AAAA,QAC1D,WAAA,EAAa,QAAA;AAAA,QACb,WAAA,EAAa,MAAA;AAAA,QACb,WAAA,EAAa,CAAA;AAAA,QACb,aAAA,EAAe;AAAA,UACb,aAAA,EAAe,IAAA;AAAA,UACf,aAAA,EAAe;AAAA,SACjB;AAAA,QACA,SAAA,EAAW;AAAA,UACT,cAAA,EAAgB;AAAA;AAClB,OACD,CAAA;AAGD,MAAA,MAAME,mBAAmBD,KAAAA,CAAa,eAAA;AACtC,MAAA,IAAI,CAACC,gBAAAA,EAAiB;AACpB,QAAA,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAAA,MAClE;AAEA,MAAA,QAAA,GAAW,EAAE,IAAA,EAAAD,KAAAA,EAAM,eAAA,EAAAC,gBAAAA,EAAgB;AACnC,MAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,OAAA,EAAS,QAAQ,CAAA;AAAA,IACxC;AAEA,IAAA,MAAM,EAAE,IAAA,EAAM,eAAA,EAAgB,GAAI,QAAA;AAGlC,IAAA,MAAM,EAAE,oBAAA,EAAAC,qBAAAA,EAAsB,YAAW,GAAI,MAAM,OAAO,oBAAoB,CAAA;AAC9E,IAAA,MAAM,UAAA,GAAa,IAAIA,qBAAAA,CAAqB,IAAI,CAAA;AAChD,IAAA,MAAM,iBAAiB,CAAA,YAAA,EAAA,CAAA,CAAe,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,gBAAe,YAAY,CAAA,CAAA;AAExF,IAAA,MAAM,OAAA,GAAU,CAAC,MAAA,KAA0B;AAEzC,MAAA,IAAI,OAAO,QAAA,EAAS,KAAM,IAAA,CAAK,MAAA,CAAO,UAAS,EAAG;AAChD,QAAA,OAAO,eAAA;AAAA,MACT;AAEA,MAAA,OAAO,UAAA,CAAW,MAAA,CAAO,MAAA,EAAQ,UAAA,EAAY,cAAc,CAAA;AAAA,IAC7D,CAAA;AAEA,IAAA,OAAO,IAAI,iBAAA,CAAkB;AAAA,MAC3B,SAAA,EAAW,GAAA;AAAA,MACX,sBAAA,EAAwB,GAAA;AAAA,MACxB,UAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,qBAAA,GAA8C;AAC1D,IAAA,MAAM,EAAE,WAAA,EAAa,YAAA,EAAc,kBAAiB,GAAI,MAAM,OAAO,oBAAoB,CAAA;AAGzF,IAAA,MAAM,aAAA,GAAgB,IAAI,gBAAA,EAAiB;AAC3C,IAAA,MAAM,WAAA,GAAc,IAAI,WAAA,CAAY,CAAC,YAAoB,IAAI,YAAA,CAAa,OAAA,EAAS,aAAa,CAAC,CAAA;AAGjG,IAAA,OAAO;AAAA,MACL,MAAM,IAAI,SAAA,EAAW;AACnB,QAAA,OAAO,MAAM,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AAAA,MACxC,CAAA;AAAA,MACA,MAAM,UAAU,QAAA,EAAU;AACxB,QAAA,MAAM,IAAI,MAAM,+CAA+C,CAAA;AAAA,MACjE,CAAA;AAAA,MACA,MAAM,KAAK,OAAA,EAAS;AAClB,QAAA,OAAO,MAAM,WAAA,CAAY,IAAA,CAAK,OAAO,CAAA;AAAA,MACvC,CAAA;AAAA,MACA,MAAM,OAAO,OAAA,EAAS;AACpB,QAAA,OAAO,MAAM,WAAA,CAAY,MAAA,CAAO,OAAO,CAAA;AAAA,MACzC,CAAA;AAAA,MACA,MAAM,OAAO,MAAA,EAAQ;AACnB,QAAA,OAAO,MAAM,WAAA,CAAY,MAAA,CAAO,MAAM,CAAA;AAAA,MACxC;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,oBAAA,GAA6C;AACzD,IAAA,MAAM,EAAE,WAAA,EAAa,YAAA,EAAc,kBAAiB,GAAI,MAAM,OAAO,oBAAoB,CAAA;AAGzF,IAAA,MAAM,aAAA,GAAgB,IAAI,gBAAA,EAAiB;AAE3C,IAAA,MAAM,WAAA,GAAc,IAAI,WAAA,CAAY,CAAC,YAAY,IAAI,YAAA,CAAa,OAAA,EAAS,aAAa,CAAC,CAAA;AAGzF,IAAA,OAAO;AAAA,MACL,MAAM,IAAI,SAAA,EAAW;AACnB,QAAA,OAAO,MAAM,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AAAA,MACxC,CAAA;AAAA,MACA,MAAM,UAAU,QAAA,EAAU;AACxB,QAAA,MAAM,IAAI,MAAM,8CAA8C,CAAA;AAAA,MAChE,CAAA;AAAA,MACA,MAAM,KAAK,OAAA,EAAS;AAClB,QAAA,OAAO,MAAM,WAAA,CAAY,IAAA,CAAK,OAAO,CAAA;AAAA,MACvC,CAAA;AAAA,MACA,MAAM,OAAO,OAAA,EAAS;AACpB,QAAA,OAAO,MAAM,WAAA,CAAY,MAAA,CAAO,OAAO,CAAA;AAAA,MACzC,CAAA;AAAA,MACA,MAAM,OAAO,MAAA,EAAQ;AACnB,QAAA,OAAO,MAAM,WAAA,CAAY,MAAA,CAAO,MAAM,CAAA;AAAA,MACxC;AAAA,KACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBAAuBJ,KAAAA,EAAoC;AAEvE,IAAA,MAAM,EAAE,iBAAA,EAAAK,kBAAAA,EAAkB,GAAI,MAAM,OAAA,CAAA,OAAA,EAAA,CAAA,IAAA,CAAA,OAAA,gBAAA,EAAA,EAAA,mBAAA,CAAA,CAAA;AACpC,IAAA,MAAM,WAAWA,kBAAAA,EAAkB;AAEnC,IAAA,MAAM,gBAAA,GAAmB,QAAA,CAAS,WAAA,CAAY,GAAA,CAAIL,KAAI,CAAA;AACtD,IAAA,IAAI,CAAC,gBAAA,EAAkB;AACrB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,mBAAA,EAAsBA,KAAI,CAAA,0DAAA,CAA4D,CAAA;AAAA,IACxG;AAEA,IAAA,OAAO,IAAI,gBAAA,EAAiB;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,GAAA,EAA2B;AACnD,IAAA,IAAI,CAAC,GAAA,EAAK;AACR,MAAA,MAAM,IAAI,MAAM,4BAA4B,CAAA;AAAA,IAC9C;AAEA,IAAA,IAAI,GAAA,CAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AAC7B,MAAA,MAAM,IAAA,GAAO,GAAA,CAAI,SAAA,CAAU,CAAC,CAAA;AAC5B,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,MAAA,IAAI,KAAA,CAAM,UAAU,CAAA,EAAG;AACrB,QAAA,OAAO,MAAM,CAAC,CAAA;AAAA,MAChB;AACA,MAAA,OAAO,IAAA;AAAA,IACT;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,oBAAoB,KAAA,EAAwB;AAClD,IAAA,OAAO,MAAM,CAAC,CAAA;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,OAAA,EAA0C;AACjE,IAAA,OAAO,CAAA,EAAG,QAAQ,aAAa,CAAA,CAAA,EAAI,QAAQ,UAAU,CAAA,CAAA,EAAI,QAAQ,UAAU,CAAA,CAAA;AAAA,EAC7E;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,OAAA,EAA0C;AACjE,IAAA,OAAO,CAAA,EAAG,OAAA,CAAQ,UAAU,CAAA,CAAA,EAAI,QAAQ,UAAU,CAAA,CAAA;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,OAAA,EAAsD;AAC9D,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,UAAA,CAAW,OAAO,CAAA;AACvC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,OAAO,CAAA;AAC7C,IAAA,OAAO,QAAA,IAAA,IAAA,GAAA,MAAA,GAAA,QAAA,CAAU,KAAK,MAAA,CAAO,QAAA,EAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAA,CAAmB,WAAA,EAAqB,IAAA,EAAc,eAAA,EAA8B;AAClF,IAAA,MAAM,OAAA,GAAU,GAAG,WAAW,CAAA,EAAA,CAAA;AAC9B,IAAA,IAAA,CAAK,YAAY,GAAA,CAAI,OAAA,EAAS,EAAE,IAAA,EAAM,iBAAiB,CAAA;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,kBAAA,CAAmB,KAAa,UAAA,EAA+B;AAC7D,IAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,GAAA,EAAK,UAAU,CAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,OAAA,EAA0C;AA5S/D,IAAA,IAAA,EAAA,EAAA,EAAA;AA6SI,IAAA,MAAM,WAAA,GAAA,CAAA,CAAc,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,WAAA,KAAe,YAAA;AAC1D,IAAA,MAAM,IAAA,GAAA,CAAA,CAAO,EAAA,GAAA,OAAA,CAAQ,aAAA,KAAR,IAAA,GAAA,MAAA,GAAA,EAAA,CAAuB,IAAA,KAAQ,CAAA;AAC5C,IAAA,OAAO,CAAA,EAAG,WAAW,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAA,GAAmB;AACjB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAA,GAA0B;AAC9B,IAAA,KAAA,MAAW,CAAC,KAAK,EAAE,IAAA,EAAM,CAAA,IAAK,IAAA,CAAK,WAAA,CAAY,OAAA,EAAQ,EAAG;AACxD,MAAA,OAAA,CAAQ,GAAA,CAAI,CAAA,sBAAA,EAAyB,GAAG,CAAA,CAAE,CAAA;AAC1C,MAAA,MAAM,KAAK,IAAA,EAAK;AAAA,IAClB;AACA,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,eAAe,UAAA,EAAkD;AAAA,EAOvE;AACF,CAAA;;;AChVA,IAAA,cAAA,GAAA,EAAA;;;;;AC0BM,SAAU,OAAQ,CAAA,EAA6C;AACnE,EAAA,IAAI,CAAA,YAAa,UAAA,IAAc,CAAA,CAAE,WAAA,CAAY,SAAS,YAAA,EAAc;AAAE,IAAA,OAAO,CAAA;AAAE,EAAA;AAC/E,EAAA,IAAI,aAAa,WAAA,EAAa;AAAE,IAAA,OAAO,IAAI,WAAW,CAAC,CAAA;AAAE,EAAA;AACzD,EAAA,IAAI,WAAA,CAAY,MAAA,CAAO,CAAC,CAAA,EAAG;AACzB,IAAA,OAAO,IAAI,UAAA,CAAW,CAAA,CAAE,QAAQ,CAAA,CAAE,UAAA,EAAY,EAAE,UAAU,CAAA;AAC5D,EAAA;AACA,EAAA,MAAM,IAAI,MAAM,mCAAmC,CAAA;AACrD;AAMM,SAAU,WAAY,GAAA,EAAW;AACrC,EAAA,OAAO,IAAI,WAAA,EAAW,CAAG,MAAA,CAAO,GAAG,CAAA;AACrC;AAEM,SAAU,SAAU,CAAA,EAAa;AACrC,EAAA,OAAO,IAAI,WAAA,EAAW,CAAG,MAAA,CAAO,CAAC,CAAA;AACnC;;;ACnCA,SAAS,IAAA,CAAM,UAAUA,KAAAA,EAAI;AAC3B,EAAA,IAAI,QAAA,CAAS,UAAU,GAAA,EAAK;AAAE,IAAA,MAAM,IAAI,UAAU,mBAAmB,CAAA;AAAE,EAAA;AACvE,EAAA,IAAI,QAAA,GAAW,IAAI,UAAA,CAAW,GAAG,CAAA;AACjC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,QAAA,CAAS,CAAC,CAAA,GAAI,GAAA;AAChB,EAAA;AACA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACxC,IAAA,IAAI,CAAA,GAAI,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA;AACzB,IAAA,IAAI,EAAA,GAAK,CAAA,CAAE,UAAA,CAAW,CAAC,CAAA;AACvB,IAAA,IAAI,QAAA,CAAS,EAAE,CAAA,KAAM,GAAA,EAAK;AAAE,MAAA,MAAM,IAAI,SAAA,CAAU,CAAA,GAAI,eAAe,CAAA;AAAE,IAAA;AACrE,IAAA,QAAA,CAAS,EAAE,CAAA,GAAI,CAAA;AACjB,EAAA;AACA,EAAA,IAAI,OAAO,QAAA,CAAS,MAAA;AACpB,EAAA,IAAI,MAAA,GAAS,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA;AAC9B,EAAA,IAAI,SAAS,IAAA,CAAK,GAAA,CAAI,IAAI,CAAA,GAAI,IAAA,CAAK,IAAI,GAAG,CAAA;AAC1C,EAAA,IAAI,UAAU,IAAA,CAAK,GAAA,CAAI,GAAG,CAAA,GAAI,IAAA,CAAK,IAAI,IAAI,CAAA;AAI3C,EAAA,SAASM,QAAQ,MAAA,EAAM;AAErB,IAAA,IAAI,MAAA,YAAkB,UAAA;AAAY,MAAA;aAAW,WAAA,CAAY,MAAA,CAAO,MAAM,CAAA,EAAG;AACvE,MAAA,MAAA,GAAS,IAAI,UAAA,CAAW,MAAA,CAAO,QAAQ,MAAA,CAAO,UAAA,EAAY,OAAO,UAAU,CAAA;IAC7E,CAAA,MAAA,IAAW,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AAChC,MAAA,MAAA,GAAS,UAAA,CAAW,KAAK,MAAM,CAAA;AACjC,IAAA;AACA,IAAA,IAAI,EAAE,kBAAkB,UAAA,CAAA,EAAa;AAAE,MAAA,MAAM,IAAI,UAAU,qBAAqB,CAAA;AAAE,IAAA;AAClF,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAAE,MAAA,OAAO,EAAA;AAAG,IAAA;AAErC,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,IAAIC,OAAAA,GAAS,CAAA;AACb,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,IAAI,OAAO,MAAA,CAAO,MAAA;AAClB,IAAA,OAAO,MAAA,KAAW,IAAA,IAAQ,MAAA,CAAO,MAAM,MAAM,CAAA,EAAG;AAC9C,MAAA,MAAA,EAAA;AACA,MAAA,MAAA,EAAA;AACF,IAAA;AAEA,IAAA,IAAI,IAAA,GAAA,CAAS,IAAA,GAAO,MAAA,IAAU,OAAA,GAAU,CAAA,KAAO,CAAA;AAC/C,IAAA,IAAI,GAAA,GAAM,IAAI,UAAA,CAAW,IAAI,CAAA;AAE7B,IAAA,OAAO,WAAW,IAAA,EAAM;AACtB,MAAA,IAAI,KAAA,GAAQ,OAAO,MAAM,CAAA;AAEzB,MAAA,IAAIC,EAAAA,GAAI,CAAA;AACR,MAAA,KAAA,IAAS,GAAA,GAAM,IAAA,GAAO,CAAA,EAAA,CAAI,KAAA,KAAU,CAAA,IAAKA,KAAID,OAAAA,KAAY,GAAA,KAAQ,EAAA,EAAK,GAAA,EAAA,EAAOC,EAAAA,EAAAA,EAAK;AAChF,QAAA,KAAA,IAAU,GAAA,GAAM,GAAA,CAAI,GAAG,CAAA,KAAO,CAAA;AAC9B,QAAA,GAAA,CAAI,GAAG,CAAA,GAAK,KAAA,GAAQ,IAAA,KAAU,CAAA;AAC9B,QAAA,KAAA,GAAS,QAAQ,IAAA,KAAU,CAAA;AAC7B,MAAA;AACA,MAAA,IAAI,UAAU,CAAA,EAAG;AAAE,QAAA,MAAM,IAAI,MAAM,gBAAgB,CAAA;AAAE,MAAA;AACrD,MAAAD,OAAAA,GAASC,EAAAA;AACT,MAAA,MAAA,EAAA;AACF,IAAA;AAEA,IAAA,IAAI,MAAM,IAAA,GAAOD,OAAAA;AACjB,IAAA,OAAO,GAAA,KAAQ,IAAA,IAAQ,GAAA,CAAI,GAAG,MAAM,CAAA,EAAG;AACrC,MAAA,GAAA,EAAA;AACF,IAAA;AAEA,IAAA,IAAI,GAAA,GAAM,MAAA,CAAO,MAAA,CAAO,MAAM,CAAA;AAC9B,IAAA,OAAO,GAAA,GAAM,IAAA,EAAM,EAAE,GAAA,EAAK;AAAE,MAAA,GAAA,IAAO,QAAA,CAAS,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAA;AAAG,IAAA;AAC9D,IAAA,OAAO,GAAA;AACT,EAAA;AAIA,EAAA,SAAS,aAAc,MAAA,EAAM;AAC3B,IAAA,IAAI,OAAO,WAAW,QAAA,EAAU;AAAE,MAAA,MAAM,IAAI,UAAU,iBAAiB,CAAA;AAAE,IAAA;AACzE,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,EAAG;AAAE,MAAA,OAAO,IAAI,UAAA,EAAU;AAAG,IAAA;AACnD,IAAA,IAAI,GAAA,GAAM,CAAA;AAEV,IAAA,IAAI,MAAA,CAAO,GAAG,CAAA,KAAM,GAAA,EAAK;AAAE,MAAA;AAAO,IAAA;AAElC,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,IAAIA,OAAAA,GAAS,CAAA;AACb,IAAA,OAAO,MAAA,CAAO,GAAG,CAAA,KAAM,MAAA,EAAQ;AAC7B,MAAA,MAAA,EAAA;AACA,MAAA,GAAA,EAAA;AACF,IAAA;AAEA,IAAA,IAAI,IAAA,GAAA,CAAU,MAAA,CAAO,MAAA,GAAS,GAAA,IAAO,SAAU,CAAA,KAAO,CAAA;AACtD,IAAA,IAAI,IAAA,GAAO,IAAI,UAAA,CAAW,IAAI,CAAA;AAE9B,IAAA,OAAO,MAAA,CAAO,GAAG,CAAA,EAAG;AAElB,MAAA,IAAI,KAAA,GAAQ,QAAA,CAAS,MAAA,CAAO,UAAA,CAAW,GAAG,CAAC,CAAA;AAE3C,MAAA,IAAI,UAAU,GAAA,EAAK;AAAE,QAAA;AAAO,MAAA;AAC5B,MAAA,IAAIC,EAAAA,GAAI,CAAA;AACR,MAAA,KAAA,IAAS,GAAA,GAAM,IAAA,GAAO,CAAA,EAAA,CAAI,KAAA,KAAU,CAAA,IAAKA,KAAID,OAAAA,KAAY,GAAA,KAAQ,EAAA,EAAK,GAAA,EAAA,EAAOC,EAAAA,EAAAA,EAAK;AAChF,QAAA,KAAA,IAAU,IAAA,GAAO,IAAA,CAAK,GAAG,CAAA,KAAO,CAAA;AAChC,QAAA,IAAA,CAAK,GAAG,CAAA,GAAK,KAAA,GAAQ,GAAA,KAAS,CAAA;AAC9B,QAAA,KAAA,GAAS,QAAQ,GAAA,KAAS,CAAA;AAC5B,MAAA;AACA,MAAA,IAAI,UAAU,CAAA,EAAG;AAAE,QAAA,MAAM,IAAI,MAAM,gBAAgB,CAAA;AAAE,MAAA;AACrD,MAAAD,OAAAA,GAASC,EAAAA;AACT,MAAA,GAAA,EAAA;AACF,IAAA;AAEA,IAAA,IAAI,MAAA,CAAO,GAAG,CAAA,KAAM,GAAA,EAAK;AAAE,MAAA;AAAO,IAAA;AAElC,IAAA,IAAI,MAAM,IAAA,GAAOD,OAAAA;AACjB,IAAA,OAAO,GAAA,KAAQ,IAAA,IAAQ,IAAA,CAAK,GAAG,MAAM,CAAA,EAAG;AACtC,MAAA,GAAA,EAAA;AACF,IAAA;AACA,IAAA,IAAI,GAAA,GAAM,IAAI,UAAA,CAAW,MAAA,IAAU,OAAO,GAAA,CAAI,CAAA;AAC9C,IAAA,IAAIE,EAAAA,GAAI,MAAA;AACR,IAAA,OAAO,QAAQ,IAAA,EAAM;AACnB,MAAA,GAAA,CAAIA,EAAAA,EAAG,CAAA,GAAI,IAAA,CAAK,GAAA,EAAK,CAAA;AACvB,IAAA;AACA,IAAA,OAAO,GAAA;AACT,EAAA;AAIA,EAAA,SAASC,QAAQC,OAAAA,EAAM;AACrB,IAAA,IAAI,MAAA,GAAS,aAAaA,OAAM,CAAA;AAChC,IAAA,IAAI,MAAA,EAAQ;AAAE,MAAA,OAAO,MAAA;AAAO,IAAA;AAC5B,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,IAAA,EAAOX,KAAI,CAAA,UAAA,CAAY,CAAA;AACzC,EAAA;AACA,EAAA,OAAO;IACL,MAAA,EAAQM,OAAAA;AACR,IAAA,YAAA;IACA,MAAA,EAAQI;;AAEZ;AACA,IAAI,GAAA,GAAM,IAAA;AAEV,IAAI,+BAAA,GAAkC,GAAA;AAEtC,IAAA,cAAA,GAAe,+BAAA;;;ACjIf,IAAM,UAAN,MAAa;AACF,EAAA,IAAA;AACA,EAAA,MAAA;AACA,EAAA,UAAA;EAET,WAAA,CAAaV,KAAAA,EAAY,QAAgB,UAAA,EAAoB;AAC3D,IAAA,IAAA,CAAK,IAAA,GAAOA,KAAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AACpB,EAAA;AAEA,EAAA,MAAA,CAAQ,KAAA,EAAiB;AACvB,IAAA,IAAI,iBAAiB,UAAA,EAAY;AAC/B,MAAA,OAAO,GAAG,IAAA,CAAK,MAAM,GAAG,IAAA,CAAK,UAAA,CAAW,KAAK,CAAC,CAAA,CAAA;IAChD,CAAA,MAAO;AACL,MAAA,MAAM,MAAM,mCAAmC,CAAA;AACjD,IAAA;AACF,EAAA;;AAQF,IAAM,UAAN,MAAa;AACF,EAAA,IAAA;AACA,EAAA,MAAA;AACA,EAAA,UAAA;AACQ,EAAA,eAAA;EAEjB,WAAA,CAAaA,KAAAA,EAAY,QAAgB,UAAA,EAAoB;AAC3D,IAAA,IAAA,CAAK,IAAA,GAAOA,KAAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,MAAM,eAAA,GAAkB,MAAA,CAAO,WAAA,CAAY,CAAC,CAAA;AAE5C,IAAA,IAAI,oBAAoB,MAAA,EAAW;AACjC,MAAA,MAAM,IAAI,MAAM,0BAA0B,CAAA;AAC5C,IAAA;AACA,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AACvB,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AACpB,EAAA;AAEA,EAAA,MAAA,CAAQ,IAAA,EAAY;AAClB,IAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAC5B,MAAA,IAAI,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA,KAAM,KAAK,eAAA,EAAiB;AAChD,QAAA,MAAM,KAAA,CAAM,CAAA,kCAAA,EAAqC,IAAA,CAAK,SAAA,CAAU,IAAI,CAAC,CAAA,EAAA,EAAK,IAAA,CAAK,IAAI,CAAA,4CAAA,EAA+C,IAAA,CAAK,MAAM,CAAA,CAAE,CAAA;AACjJ,MAAA;AACA,MAAA,OAAO,KAAK,UAAA,CAAW,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,CAAO,MAAM,CAAC,CAAA;IACvD,CAAA,MAAO;AACL,MAAA,MAAM,MAAM,mCAAmC,CAAA;AACjD,IAAA;AACF,EAAA;AAEA,EAAA,EAAA,CAAgC,OAAA,EAAmE;AACjG,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AACzB,EAAA;;AAKF,IAAM,kBAAN,MAAqB;AACV,EAAA,QAAA;AAET,EAAA,WAAA,CAAa,QAAA,EAA0B;AACrC,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAClB,EAAA;AAEA,EAAA,EAAA,CAAiC,OAAA,EAAmE;AAClG,IAAA,OAAO,EAAA,CAAG,MAAM,OAAO,CAAA;AACzB,EAAA;AAEA,EAAA,MAAA,CAAQ,KAAA,EAAa;AACnB,IAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA;AACpC,IAAA,IAAI,WAAW,IAAA,EAAM;AACnB,MAAA,OAAO,OAAA,CAAQ,OAAO,KAAK,CAAA;IAC7B,CAAA,MAAO;AACL,MAAA,MAAM,UAAA,CAAW,CAAA,kCAAA,EAAqC,IAAA,CAAK,SAAA,CAAU,KAAK,CAAC,CAAA,4BAAA,EAA+B,MAAA,CAAO,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAC,CAAA,cAAA,CAAgB,CAAA;AACtJ,IAAA;AACF,EAAA;;AAGI,SAAU,EAAA,CAAyC,MAA+C,KAAA,EAA8C;AACpJ,EAAA,OAAO,IAAI,eAAA,CAAgB;AACzB,IAAA,GAAI,KAAK,QAAA,IAAY,EAAE,CAAE,IAAA,CAA2B,MAAM,GAAG,IAAA,EAAI;AACjE,IAAA,GAAI,MAAM,QAAA,IAAY,EAAE,CAAE,KAAA,CAA4B,MAAM,GAAG,KAAA;AAC7C,GAAA,CAAA;AACtB;AAEM,IAAO,QAAP,MAAY;AACP,EAAA,IAAA;AACA,EAAA,MAAA;AACA,EAAA,UAAA;AACA,EAAA,UAAA;AACA,EAAA,OAAA;AACA,EAAA,OAAA;EAET,WAAA,CAAaA,KAAAA,EAAY,MAAA,EAAgB,UAAA,EAAsB,UAAA,EAAoB;AACjF,IAAA,IAAA,CAAK,IAAA,GAAOA,KAAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAClB,IAAA,IAAA,CAAK,UAAA,GAAa,UAAA;AAClB,IAAA,IAAA,CAAK,OAAA,GAAU,IAAI,OAAA,CAAQA,KAAAA,EAAM,QAAQ,UAAU,CAAA;AACnD,IAAA,IAAA,CAAK,OAAA,GAAU,IAAI,OAAA,CAAQA,KAAAA,EAAM,QAAQ,UAAU,CAAA;AACrD,EAAA;AAEA,EAAA,MAAA,CAAQ,KAAA,EAAiB;AACvB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA;AAClC,EAAA;AAEA,EAAA,MAAA,CAAQ,KAAA,EAAa;AACnB,IAAA,OAAO,IAAA,CAAK,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA;AAClC,EAAA;;AAGI,SAAU,IAAA,CAAmD,EAAE,IAAA,EAAAA,KAAAA,EAAM,QAAQ,MAAA,EAAAM,OAAAA,EAAQ,MAAA,EAAAI,OAAAA,EAAM,EAAsE;AACrK,EAAA,OAAO,IAAI,KAAA,CAAMV,KAAAA,EAAM,MAAA,EAAQM,SAAQI,OAAM,CAAA;AAC/C;AAEM,SAAU,MAAoD,EAAE,IAAA,EAAAV,OAAM,MAAA,EAAQ,QAAA,EAAAY,WAAQ,EAAoD;AAC9I,EAAA,MAAM,EAAE,QAAAN,OAAAA,EAAQ,MAAA,EAAAI,SAAM,GAAK,cAAA,CAAME,WAAUZ,KAAI,CAAA;AAC/C,EAAA,OAAO,IAAA,CAAK;AACV,IAAA,MAAA;IACA,IAAA,EAAAA,KAAAA;IACA,MAAA,EAAAM,OAAAA;AACA,IAAA,MAAA,EAAQ,CAAC,IAAA,KAA6B,MAAA,CAAOI,OAAAA,CAAO,IAAI,CAAC;AAC1D,GAAA,CAAA;AACH;AAEA,SAAS,MAAA,CAAQC,OAAAA,EAAgB,WAAA,EAAqC,WAAA,EAAqBX,KAAAA,EAAY;AAErG,EAAA,IAAI,MAAMW,OAAAA,CAAO,MAAA;AACjB,EAAA,OAAOA,OAAAA,CAAO,GAAA,GAAM,CAAC,CAAA,KAAM,GAAA,EAAK;AAC9B,IAAA,EAAE,GAAA;AACJ,EAAA;AAGA,EAAA,MAAM,MAAM,IAAI,UAAA,CAAY,GAAA,GAAM,WAAA,GAAc,IAAK,CAAC,CAAA;AAGtD,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,EAAK,EAAE,CAAA,EAAG;AAE5B,IAAA,MAAM,KAAA,GAAQ,WAAA,CAAYA,OAAAA,CAAO,CAAC,CAAC,CAAA;AACnC,IAAA,IAAI,UAAU,MAAA,EAAW;AACvB,MAAA,MAAM,IAAI,WAAA,CAAY,CAAA,IAAA,EAAOX,KAAI,CAAA,UAAA,CAAY,CAAA;AAC/C,IAAA;AAGA,IAAA,MAAA,GAAU,UAAU,WAAA,GAAe,KAAA;AACnC,IAAA,IAAA,IAAQ,WAAA;AAGR,IAAA,IAAI,QAAQ,CAAA,EAAG;AACb,MAAA,IAAA,IAAQ,CAAA;AACR,MAAA,GAAA,CAAI,OAAA,EAAS,CAAA,GAAI,GAAA,GAAQ,MAAA,IAAU,IAAA;AACrC,IAAA;AACF,EAAA;AAGA,EAAA,IAAI,QAAQ,WAAA,IAAA,CAAgB,GAAA,GAAQ,MAAA,IAAW,CAAA,GAAI,UAAY,CAAA,EAAG;AAChE,IAAA,MAAM,IAAI,YAAY,wBAAwB,CAAA;AAChD,EAAA;AAEA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,MAAA,CAAQ,IAAA,EAAkBY,SAAAA,EAAkB,WAAA,EAAmB;AACtE,EAAA,MAAM,GAAA,GAAMA,SAAAA,CAASA,SAAAA,CAAS,MAAA,GAAS,CAAC,CAAA,KAAM,GAAA;AAC9C,EAAA,MAAM,IAAA,GAAA,CAAQ,KAAK,WAAA,IAAe,CAAA;AAClC,EAAA,IAAI,GAAA,GAAM,EAAA;AAEV,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,MAAA,EAAQ,EAAE,CAAA,EAAG;AAEpC,IAAA,MAAA,GAAU,MAAA,IAAU,CAAA,GAAK,IAAA,CAAK,CAAC,CAAA;AAC/B,IAAA,IAAA,IAAQ,CAAA;AAGR,IAAA,OAAO,OAAO,WAAA,EAAa;AACzB,MAAA,IAAA,IAAQ,WAAA;AACR,MAAA,GAAA,IAAOA,SAAAA,CAAS,IAAA,GAAQ,MAAA,IAAU,IAAK,CAAA;AACzC,IAAA;AACF,EAAA;AAGA,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,GAAA,IAAOA,SAAAA,CAAS,IAAA,GAAQ,MAAA,IAAW,WAAA,GAAc,IAAM,CAAA;AACzD,EAAA;AAGA,EAAA,IAAI,GAAA,EAAK;AACP,IAAA,OAAA,CAAS,GAAA,CAAI,MAAA,GAAS,WAAA,GAAe,CAAA,MAAO,CAAA,EAAG;AAC7C,MAAA,GAAA,IAAO,GAAA;AACT,IAAA;AACF,EAAA;AAEA,EAAA,OAAO,GAAA;AACT;AAEA,SAAS,kBAAmBA,SAAAA,EAAgB;AAE1C,EAAA,MAAM,cAAsC,EAAA;AAC5C,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAIA,SAAAA,CAAS,MAAA,EAAQ,EAAE,CAAA,EAAG;AACxC,IAAA,WAAA,CAAYA,SAAAA,CAAS,CAAC,CAAC,CAAA,GAAI,CAAA;AAC7B,EAAA;AACA,EAAA,OAAO,WAAA;AACT;AAKM,SAAU,OAAA,CAAsD,EAAE,IAAA,EAAAZ,KAAAA,EAAM,QAAQ,WAAA,EAAa,QAAA,EAAAY,WAAQ,EAAyE;AAClL,EAAA,MAAM,WAAA,GAAc,kBAAkBA,SAAQ,CAAA;AAC9C,EAAA,OAAO,IAAA,CAAK;AACV,IAAA,MAAA;IACA,IAAA,EAAAZ,KAAAA;AACA,IAAA,MAAA,CAAQ,KAAA,EAAiB;AACvB,MAAA,OAAO,MAAA,CAAO,KAAA,EAAOY,SAAAA,EAAU,WAAW,CAAA;AAC5C,IAAA,CAAA;AACA,IAAA,MAAA,CAAQ,KAAA,EAAa;AACnB,MAAA,OAAO,MAAA,CAAO,KAAA,EAAO,WAAA,EAAa,WAAA,EAAaZ,KAAI,CAAA;AACrD,IAAA;AACD,GAAA,CAAA;AACH;;;AH9OO,IAAM,YAAY,KAAA,CAAM;EAC7B,IAAA,EAAM,WAAA;EACN,MAAA,EAAQ,GAAA;EACR,QAAA,EAAU;AACX,CAAA,CAAA;AAEM,IAAM,eAAe,KAAA,CAAM;EAChC,IAAA,EAAM,cAAA;EACN,MAAA,EAAQ,GAAA;EACR,QAAA,EAAU;AACX,CAAA,CAAA;;;AIZD,IAAA,cAAA,GAAA,EAAA;;;;;;;;;;;;AAEO,IAAM,SAAS,OAAA,CAAQ;EAC5B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,QAAA;EACN,QAAA,EAAU,kCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,cAAc,OAAA,CAAQ;EACjC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,aAAA;EACN,QAAA,EAAU,kCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,YAAY,OAAA,CAAQ;EAC/B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,WAAA;EACN,QAAA,EAAU,mCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,iBAAiB,OAAA,CAAQ;EACpC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,gBAAA;EACN,QAAA,EAAU,mCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,YAAY,OAAA,CAAQ;EAC/B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,WAAA;EACN,QAAA,EAAU,kCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,iBAAiB,OAAA,CAAQ;EACpC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,gBAAA;EACN,QAAA,EAAU,kCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,eAAe,OAAA,CAAQ;EAClC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,cAAA;EACN,QAAA,EAAU,mCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,oBAAoB,OAAA,CAAQ;EACvC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,mBAAA;EACN,QAAA,EAAU,mCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,UAAU,OAAA,CAAQ;EAC7B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,SAAA;EACN,QAAA,EAAU,kCAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;;;AC/DD,IAAA,cAAA,GAAA,EAAA;;;;;AAEO,IAAM,SAAS,KAAA,CAAM;EAC1B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,QAAA;EACN,QAAA,EAAU;AACX,CAAA,CAAA;AAEM,IAAM,cAAc,KAAA,CAAM;EAC/B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,aAAA;EACN,QAAA,EAAU;AACX,CAAA,CAAA;;;ACXD,IAAI,QAAA,GAAWM,OAAAA;AAEf,IAAI,GAAA,GAAM,GAAA;AAAV,IAEI,SAAS,IAAC;AAFd,IAGI,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AAOxB,SAASA,OAAAA,CAAO,GAAA,EAAK,GAAA,EAAK,MAAA,EAAM;AAC9B,EAAA,GAAA,GAAM,OAAO,EAAA;AACb,EAAA,MAAA,GAAS,MAAA,IAAU,CAAA;AACnB,EAAA,IAAI,SAAA,GAAY,MAAA;AAEhB,EAAA,OAAM,OAAO,GAAA,EAAK;AAChB,IAAA,GAAA,CAAI,MAAA,EAAQ,CAAA,GAAK,GAAA,GAAM,GAAA,GAAQ,GAAA;AAC/B,IAAA,GAAA,IAAO,GAAA;AACT,EAAA;AACA,EAAA,OAAM,MAAM,MAAA,EAAQ;AAClB,IAAA,GAAA,CAAI,MAAA,EAAQ,CAAA,GAAK,GAAA,GAAM,GAAA,GAAQ,GAAA;AAC/B,IAAA,GAAA,MAAS,CAAA;AACX,EAAA;AACA,EAAA,GAAA,CAAI,MAAM,IAAI,GAAA,GAAM,CAAA;AAGpB,EAAAA,OAAAA,CAAO,KAAA,GAAQ,MAAA,GAAS,SAAA,GAAY,CAAA;AAEpC,EAAA,OAAO,GAAA;AACT;AAEA,IAAII,OAAAA,GAAS,IAAA;AAEb,IAAI,KAAA,GAAQ,GAAA;AAAZ,IACI,MAAA,GAAS,GAAA;AAMb,SAAS,IAAA,CAAK,KAAK,MAAA,EAAM;AACvB,EAAA,IAAI,GAAA,GAAS,CAAA,EACT,MAAA,GAAS,MAAA,IAAU,CAAA,EACnB,KAAA,GAAS,CAAA,EACT,OAAA,GAAU,MAAA,EACV,CAAA,EACA,CAAA,GAAI,GAAA,CAAI,MAAA;AAEZ,EAAA,GAAG;AACD,IAAA,IAAI,WAAW,CAAA,EAAG;AAEhB,MAAA,IAAA,CAAK,KAAA,GAAQ,CAAA;AACb,MAAA,MAAM,IAAI,WAAW,yBAAyB,CAAA;AAChD,IAAA;AACA,IAAA,CAAA,GAAI,IAAI,OAAA,EAAS,CAAA;AACjB,IAAA,GAAA,IAAO,KAAA,GAAQ,EAAA,GAAA,CACV,CAAA,GAAI,MAAA,KAAW,KAAA,GAAA,CACf,IAAI,MAAA,IAAU,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,KAAK,CAAA;AACpC,IAAA,KAAA,IAAS,CAAA;AACX,EAAA,CAAA,QAAS,CAAA,IAAK,KAAA;AAGd,EAAA,IAAA,CAAK,QAAQ,OAAA,GAAU,MAAA;AAEvB,EAAA,OAAO,GAAA;AACT;AAEA,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAI,CAAC,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AACvB,IAAI,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,EAAE,CAAA;AAEvB,IAAI,MAAA,GAAS,SAAgC,KAAA,EAAK;AAChD,EAAA,OACE,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,KAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACb,KAAA,GAAQ,EAAA,GAAK,CAAA,GACA,EAAA;AAEjB,CAAA;AAEA,IAAI,MAAA,GAAS;EACT,MAAA,EAAQ,QAAA;EACR,MAAA,EAAQA,OAAAA;EACR,cAAA,EAAgB;;AAGpB,IAAI,YAAA,GAAe,MAAA;AAEnB,IAAA,cAAA,GAAe,YAAA;AChGT,SAAU,QAAA,CAAU,GAAA,EAAa,MAAA,EAAoB,MAAA,GAAS,CAAA,EAAC;AACnE,EAAA,cAAA,CAAO,MAAA,CAAO,GAAA,EAAK,MAAA,EAAQ,MAAM,CAAA;AACjC,EAAA,OAAO,MAAA;AACT;AAEM,SAAU,eAAgB,GAAA,EAAW;AACzC,EAAA,OAAO,cAAA,CAAO,eAAe,GAAG,CAAA;AAClC;;;ACPM,SAAU,MAAA,CAA8BG,OAAYC,OAAAA,EAAkB;AAC1E,EAAA,MAAM,OAAOA,OAAAA,CAAO,UAAA;AACpB,EAAA,MAAM,UAAA,GAAoB,eAAeD,KAAI,CAAA;AAC7C,EAAA,MAAM,YAAA,GAAe,UAAA,GAAoB,cAAA,CAAe,IAAI,CAAA;AAE5D,EAAA,MAAM,KAAA,GAAQ,IAAI,UAAA,CAAW,YAAA,GAAe,IAAI,CAAA;AAChD,EAAO,QAAA,CAASA,KAAAA,EAAM,KAAA,EAAO,CAAC,CAAA;AAC9B,EAAO,QAAA,CAAS,IAAA,EAAM,KAAA,EAAO,UAAU,CAAA;AACvC,EAAA,KAAA,CAAM,GAAA,CAAIC,SAAQ,YAAY,CAAA;AAE9B,EAAA,OAAO,IAAI,MAAA,CAAOD,KAAAA,EAAM,IAAA,EAAMC,SAAQ,KAAK,CAAA;AAC7C;AAqCM,IAAO,SAAP,MAAa;AACR,EAAA,IAAA;AACA,EAAA,IAAA;AACA,EAAA,MAAA;AACA,EAAA,KAAA;;;;EAKT,WAAA,CAAaD,KAAAA,EAAY,IAAA,EAAYC,OAAAA,EAAoB,KAAA,EAAiB;AACxE,IAAA,IAAA,CAAK,IAAA,GAAOD,KAAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAASC,OAAAA;AACd,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AACf,EAAA;;;;ACrEF,IAAA,gBAAA,GAAA,EAAA;;;;AAIA,IAAM,IAAA,GAAY,CAAA;AAClB,IAAM,IAAA,GAAO,UAAA;AAEb,IAAMR,OAAAA,GAA4C,MAAA;AAElD,SAAS,MAAA,CAAQ,OAAmB,OAAA,EAAuB;AACzD,EAAA,IAAA,CAAI,mCAAS,QAAA,KAAY,IAAA,IAAQ,OAAA,CAAQ,QAAA,KAAa,MAAM,UAAA,EAAY;AACtE,IAAA,IAAI,QAAQ,QAAA,GAAW,CAAA,IAAK,OAAA,CAAQ,QAAA,GAAW,MAAM,UAAA,EAAY;AAC/D,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,uDAAA,EAA0D,KAAA,CAAM,UAAU,CAAA,CAAE,CAAA;AAC9F,IAAA;AAEA,IAAA,KAAA,GAAQ,KAAA,CAAM,QAAA,CAAS,CAAA,EAAG,OAAA,CAAQ,QAAQ,CAAA;AAC5C,EAAA;AAEA,EAAA,OAAc,MAAA,CAAO,IAAA,EAAMA,OAAAA,CAAO,KAAK,CAAC,CAAA;AAC1C;AAEO,IAAM,WAAW,EAAE,IAAA,EAAM,IAAA,EAAM,MAAA,EAAAA,SAAQ,MAAA,EAAM;;;ACjB9C,SAAU,aAAc,GAAA,EAAe;AAC3C,EAAA,OAAO,IAAI,UAAA,CAAW,GAAA,CAAI,QAAQ,GAAA,CAAI,UAAA,EAAY,IAAI,UAAU,CAAA;AAClE;;;ACUM,SAAU,WAAA,CAAa,OAAe,CAAA,EAAC;AAC3C,EAAA,OAAO,YAAA,CAAaS,QAAAA,CAAO,WAAA,CAAY,IAAI,CAAC,CAAA;AAC9C;;;AClBA,IAAA,cAAA,GAAA,EAAA;;;;AAEO,IAAM,SAAS,KAAA,CAAM;EAC1B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,QAAA;EACN,QAAA,EAAU;AACX,CAAA,CAAA;;;ACND,IAAA,cAAA,GAAA,EAAA;;;;;AAEO,IAAM,SAAS,OAAA,CAAQ;EAC5B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,QAAA;EACN,QAAA,EAAU,kBAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,cAAc,OAAA,CAAQ;EACjC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,aAAA;EACN,QAAA,EAAU,kBAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;;;ACdD,IAAA,aAAA,GAAA,EAAA;;;;AAEO,IAAM,QAAQ,OAAA,CAAQ;EAC3B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,OAAA;EACN,QAAA,EAAU,IAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;;;ACPD,IAAA,oBAAA,GAAA,EAAA;;;;AAEA,IAAM,QAAA,GAAW,KAAA,CAAM,IAAA,CAAK,orEAAwe,CAAA;AACpgB,IAAM,uBAAkC,QAAA,CAAS,MAAA,CAAiB,CAAC,CAAA,EAAG,GAAG,CAAA,KAAK;AAAG,EAAA,CAAA,CAAE,CAAC,CAAA,GAAI,CAAA;AAAG,EAAA,OAAO,CAAA;AAAE,CAAA,EAAI,EAAG,CAAA;AAC3G,IAAM,uBAAkC,QAAA,CAAS,MAAA,CAAiB,CAAC,CAAA,EAAG,GAAG,CAAA,KAAK;AAC5E,EAAA,MAAM,SAAA,GAAY,CAAA,CAAE,WAAA,CAAY,CAAC,CAAA;AACjC,EAAA,IAAI,aAAa,IAAA,EAAM;AACrB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,mBAAA,EAAsB,CAAC,CAAA,CAAE,CAAA;AAC3C,EAAA;AACA,EAAA,CAAA,CAAE,SAAS,CAAA,GAAI,CAAA;AACf,EAAA,OAAO,CAAA;AACT,CAAA,EAAI,EAAG,CAAA;AAEP,SAAST,QAAQ,IAAA,EAAgB;AAC/B,EAAA,OAAO,IAAA,CAAK,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAK;AAC1B,IAAA,CAAA,IAAK,qBAAqB,CAAC,CAAA;AAC3B,IAAA,OAAO,CAAA;AACT,EAAA,CAAA,EAAG,EAAE,CAAA;AACP;AAEA,SAASI,QAAQ,GAAA,EAAW;AAC1B,EAAA,MAAM,OAAO,EAAA;AACb,EAAA,KAAA,MAAW,QAAQ,GAAA,EAAK;AACtB,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,WAAA,CAAY,CAAC,CAAA;AACpC,IAAA,IAAI,aAAa,IAAA,EAAM;AACrB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,mBAAA,EAAsB,IAAI,CAAA,CAAE,CAAA;AAC9C,IAAA;AACA,IAAA,MAAM,GAAA,GAAM,qBAAqB,SAAS,CAAA;AAC1C,IAAA,IAAI,OAAO,IAAA,EAAM;AACf,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,4BAAA,EAA+B,IAAI,CAAA,CAAE,CAAA;AACvD,IAAA;AACA,IAAA,IAAA,CAAK,KAAK,GAAG,CAAA;AACf,EAAA;AACA,EAAA,OAAO,IAAI,WAAW,IAAI,CAAA;AAC5B;AAEO,IAAM,eAAe,IAAA,CAAK;EAC/B,MAAA,EAAQ,WAAA;EACR,IAAA,EAAM,cAAA;EACN,MAAA,EAAAJ,OAAAA;EACA,MAAA,EAAAI;AACD,CAAA,CAAA;;;ACzCD,IAAA,cAAA,GAAA,EAAA;;;;;;;AAEO,IAAM,SAAS,OAAA,CAAQ;EAC5B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,QAAA;EACN,QAAA,EAAU,kEAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,YAAY,OAAA,CAAQ;EAC/B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,WAAA;EACN,QAAA,EAAU,mEAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,YAAY,OAAA,CAAQ;EAC/B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,WAAA;EACN,QAAA,EAAU,kEAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;AAEM,IAAM,eAAe,OAAA,CAAQ;EAClC,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,cAAA;EACN,QAAA,EAAU,mEAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;;;AC5BD,IAAA,aAAA,GAAA,EAAA;;;;AAEO,IAAM,QAAQ,OAAA,CAAQ;EAC3B,MAAA,EAAQ,GAAA;EACR,IAAA,EAAM,OAAA;EACN,QAAA,EAAU,UAAA;EACV,WAAA,EAAa;AACd,CAAA,CAAA;;;ACPD,IAAAM,iBAAAA,GAAA,EAAA;SAAAA,iBAAAA,EAAA;AAAAC,EAAAA,QAAAA,EAAAA,MAAAA;;AAGO,IAAMA,YAAW,IAAA,CAAK;EAC3B,MAAA,EAAQ,IAAA;EACR,IAAA,EAAM,UAAA;EACN,MAAA,EAAQ,CAAC,GAAA,KAAQ,QAAA,CAAS,GAAG,CAAA;EAC7B,MAAA,EAAQ,CAAC,GAAA,KAAQ,UAAA,CAAW,GAAG;AAChC,CAAA,CAAA;;;ACNmB,IAAI,WAAA;AACJ,IAAI,WAAA;;;ACHxB,IAAA,YAAA,GAAA,EAAA;;;;;;;ACKA,IAAM,yBAAA,GAA4B,EAAA;AAqB5B,SAAUC,KAAAA,CAAiD,EAAE,IAAA,EAAAlB,KAAAA,EAAM,IAAA,EAAAa,OAAM,MAAA,EAAAP,OAAAA,EAAQ,eAAA,EAAiB,eAAA,EAAe,EAA0B;AAC/I,EAAA,OAAO,IAAI,MAAA,CAAON,KAAAA,EAAMa,KAAAA,EAAMP,OAAAA,EAAQ,iBAAiB,eAAe,CAAA;AACxE;AAoBM,IAAO,SAAP,MAAa;AACR,EAAA,IAAA;AACA,EAAA,IAAA;AACA,EAAA,MAAA;AACA,EAAA,eAAA;AACA,EAAA,eAAA;AAET,EAAA,WAAA,CAAaN,KAAAA,EAAYa,KAAAA,EAAYP,OAAAA,EAAkD,eAAA,EAA0B,eAAA,EAAwB;AACvI,IAAA,IAAA,CAAK,IAAA,GAAON,KAAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAOa,KAAAA;AACZ,IAAA,IAAA,CAAK,MAAA,GAASP,OAAAA;AACd,IAAA,IAAA,CAAK,kBAAkB,eAAA,IAAmB,yBAAA;AAC1C,IAAA,IAAA,CAAK,eAAA,GAAkB,eAAA;AACzB,EAAA;AAEA,EAAA,MAAA,CAAQ,OAAmB,OAAA,EAAuB;AAChD,IAAA,IAAA,CAAI,OAAA,IAAA,IAAA,GAAA,MAAA,GAAA,OAAA,CAAS,aAAY,IAAA,EAAM;AAC7B,MAAA,IAAI,OAAA,CAAQ,QAAA,GAAW,IAAA,CAAK,eAAA,EAAiB;AAC3C,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,0DAAA,EAA6D,IAAA,CAAK,eAAe,CAAA,CAAE,CAAA;AACrG,MAAA;AAEA,MAAA,IAAI,KAAK,eAAA,IAAmB,IAAA,IAAQ,OAAA,CAAQ,QAAA,GAAW,KAAK,eAAA,EAAiB;AAC3E,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,uDAAA,EAA0D,IAAA,CAAK,eAAe,CAAA,CAAE,CAAA;AAClG,MAAA;AACF,IAAA;AAEA,IAAA,IAAI,iBAAiB,UAAA,EAAY;AAC/B,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,KAAK,CAAA;AAEhC,MAAA,IAAI,kBAAkB,UAAA,EAAY;AAChC,QAAA,OAAO,YAAA,CAAa,MAAA,EAAQ,IAAA,CAAK,IAAA,EAAM,mCAAS,QAAQ,CAAA;AAC1D,MAAA;AAEA,MAAA,OAAO,MAAA,CAAO,IAAA,CAAK,CAAAQ,OAAAA,KAAU,YAAA,CAAaA,SAAQ,IAAA,CAAK,IAAA,EAAM,OAAA,IAAA,IAAA,GAAA,MAAA,GAAA,OAAA,CAAS,QAAQ,CAAC,CAAA;IACjF,CAAA,MAAO;AACL,MAAA,MAAM,MAAM,mCAAmC,CAAA;AAEjD,IAAA;AACF,EAAA;;AAOF,SAAS,YAAA,CAAoCA,OAAAA,EAAoBD,KAAAA,EAAY,QAAA,EAAiB;AAC5F,EAAA,IAAI,QAAA,IAAY,IAAA,IAAQ,QAAA,KAAaC,OAAAA,CAAO,UAAA,EAAY;AACtD,IAAA,IAAI,QAAA,GAAWA,QAAO,UAAA,EAAY;AAChC,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,uDAAA,EAA0DA,OAAAA,CAAO,UAAU,CAAA,CAAE,CAAA;AAC/F,IAAA;AAEA,IAAAA,OAAAA,GAASA,OAAAA,CAAO,QAAA,CAAS,CAAA,EAAG,QAAQ,CAAA;AACtC,EAAA;AAEA,EAAA,OAAc,MAAA,CAAOD,OAAMC,OAAM,CAAA;AACnC;;;ADnGO,IAAM,SAASI,KAAAA,CAAK;EACzB,IAAA,EAAM,UAAA;EACN,IAAA,EAAM,EAAA;EACN,MAAA,EAAQ,CAAC,KAAA,KAAU,MAAA,CAAO,MAAA,CAAO,UAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA,CAAE,MAAA,EAAQ;AAC7E,CAAA,CAAA;AAEM,IAAM,SAASA,KAAAA,CAAK;EACzB,IAAA,EAAM,UAAA;EACN,IAAA,EAAM,EAAA;EACN,MAAA,EAAQ,CAAA,KAAA,KAAS,MAAA,CAAO,MAAA,CAAO,UAAA,CAAW,QAAQ,EAAE,MAAA,CAAO,KAAK,CAAA,CAAE,MAAA,EAAQ;AAC3E,CAAA,CAAA;;;AEEM,IAAM,KAAA,GAAQ,EAAE,GAAGF,iBAAAA,EAAc,GAAG,aAAA,EAAO,GAAG,eAAO,GAAG,cAAA,EAAQ,GAAG,cAAA,EAAQ,GAAG,gBAAQ,GAAG,cAAA,EAAQ,GAAG,cAAA,EAAQ,GAAG,cAAA,EAAQ,GAAG,oBAAA,EAAY;CACvH,EAAE,GAAG,YAAA,EAAM,GAAG,gBAAA;;;ACbpC,SAAS,WAAA,CAAahB,KAAAA,EAAc,MAAA,EAAgBM,OAAAA,EAAqCI,OAAAA,EAAmC;AAC1H,EAAA,OAAO;IACL,IAAA,EAAAV,KAAAA;AACA,IAAA,MAAA;IACA,OAAA,EAAS;MACP,IAAA,EAAAA,KAAAA;AACA,MAAA,MAAA;MACA,MAAA,EAAAM;;IAEF,OAAA,EAAS;MACP,MAAA,EAAAI;;;AAGN;AAEA,IAAM,MAAA,GAAS,WAAA,CAAY,MAAA,EAAQ,GAAA,EAAK,CAAC,GAAA,KAAO;AAC9C,EAAA,MAAM,OAAA,GAAU,IAAI,WAAA,CAAY,MAAM,CAAA;AACtC,EAAA,OAAO,GAAA,GAAM,OAAA,CAAQ,MAAA,CAAO,GAAG,CAAA;AACjC,CAAA,EAAG,CAAC,GAAA,KAAO;AACT,EAAA,MAAM,OAAA,GAAU,IAAI,WAAA,EAAW;AAC/B,EAAA,OAAO,OAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,SAAA,CAAU,CAAC,CAAC,CAAA;AACxC,CAAC,CAAA;AAED,IAAM,KAAA,GAAQ,WAAA,CAAY,OAAA,EAAS,GAAA,EAAK,CAAC,GAAA,KAAO;AAC9C,EAAA,IAAIC,OAAAA,GAAS,GAAA;AAEb,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAAA,OAAAA,IAAU,MAAA,CAAO,YAAA,CAAa,GAAA,CAAI,CAAC,CAAC,CAAA;AACtC,EAAA;AACA,EAAA,OAAOA,OAAAA;AACT,CAAA,EAAG,CAAC,GAAA,KAAO;AACT,EAAA,GAAA,GAAM,GAAA,CAAI,UAAU,CAAC,CAAA;AACrB,EAAA,MAAM,GAAA,GAAM,WAAA,CAAY,GAAA,CAAI,MAAM,CAAA;AAElC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA,EAAA,EAAK;AACnC,IAAA,GAAA,CAAI,CAAC,CAAA,GAAI,GAAA,CAAI,UAAA,CAAW,CAAC,CAAA;AAC3B,EAAA;AAEA,EAAA,OAAO,GAAA;AACT,CAAC,CAAA;AAID,IAAM,KAAA,GAAyD;EAC7D,IAAA,EAAM,MAAA;EACN,OAAA,EAAS,MAAA;AACT,EAAA,GAAA,EAAK,KAAA,CAAM,MAAA;EACX,MAAA,EAAQ,KAAA;AACR,EAAA,KAAA;EACA,MAAA,EAAQ,KAAA;EAER,GAAG;;AAGL,IAAA,aAAA,GAAe,KAAA;AC9CT,SAAUQ,SAAAA,CAAU,KAAA,EAAmB,QAAA,GAA+B,MAAA,EAAM;AAChF,EAAA,MAAMC,KAAAA,GAAO,cAAM,QAAQ,CAAA;AAE3B,EAAA,IAAIA,SAAQ,IAAA,EAAM;AAChB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,QAAQ,CAAA,CAAA,CAAG,CAAA;AACtD,EAAA;AAEA,EAAA,IAAI,QAAA,KAAa,MAAA,IAAU,QAAA,KAAa,OAAA,EAAS;AAC/C,IAAA,OAAOL,QAAAA,CAAO,IAAA,CAAK,KAAA,CAAM,MAAA,EAAQ,KAAA,CAAM,YAAY,KAAA,CAAM,UAAU,CAAA,CAAE,QAAA,CAAS,MAAM,CAAA;AACtF,EAAA;AAGA,EAAA,OAAOK,MAAK,OAAA,CAAQ,MAAA,CAAO,KAAK,CAAA,CAAE,UAAU,CAAC,CAAA;AAC/C;ACnBc,SAAP,YAA8Bb,OAAAA,EAAc;AACjD,EAAA,IAAI,KAAA,CAAMA,OAAM,CAAA,IAAKA,OAAAA,IAAU,CAAA,EAAG;AAChC,IAAA,MAAM,IAAI,uBAAuB,oDAAoD,CAAA;AACvF,EAAA;AACA,EAAA,OAAOc,cAAMd,OAAM,CAAA;AACrB;ACKO,SAAS,sBAAsB,MAAA,EAAyB;AAC9D,EAAA,MAAM,UAAA,GAAa,YAAY,EAAE,CAAA;AAEjC,EAAA,IAAI,MAAA,EAAQ;AAEX,IAAA,MAAM,WAAA,GAAc,IAAI,WAAA,EAAY,CAAE,OAAO,MAAM,CAAA;AACnD,IAAA,MAAM,UAAA,GAAae,SAAO,WAAW,CAAA;AACrC,IAAA,MAAM,cAAA,GAAiB,UAAA,CAAW,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAG7C,IAAA,MAAM,QAAA,GAAW,IAAI,UAAA,CAAW,EAAE,CAAA;AAClC,IAAA,QAAA,CAAS,GAAA,CAAI,gBAAgB,CAAC,CAAA;AAC9B,IAAA,QAAA,CAAS,GAAA,CAAI,YAAY,EAAE,CAAA;AAE3B,IAAA,OAAOH,SAAAA,CAAmB,UAAU,WAAW,CAAA;AAAA,EAChD;AAGA,EAAA,MAAM,QAAA,GAAW,IAAI,UAAA,CAAW,EAAE,CAAA;AAClC,EAAA,QAAA,CAAS,GAAA,CAAI,YAAY,CAAC,CAAA;AAC1B,EAAA,QAAA,CAAS,GAAA,CAAI,WAAA,CAAY,EAAE,CAAA,EAAG,EAAE,CAAA;AAEhC,EAAA,OAAOA,SAAAA,CAAmB,UAAU,WAAW,CAAA;AAChD;;;ACzBO,IAAM,oBAAN,MAAwB;AAAA,EACrB,kBAAA,GAA8C,IAAA;AAAA,EAC9C,iBAAA;AAAA;AAAA,EAEA,wBAAkC,EAAC;AAAA;AAAA,EAEnC,OAAA,GAAqC,IAAA;AAAA;AAAA,EAErC,WAAA,GAA6C,IAAA;AAAA;AAAA,EAE7C,MAAA,GAAoC,IAAA;AAAA;AAAA,EAEpC,kBAAA,GAAqD,IAAA;AAAA,EAE7D,YAAY,iBAAA,EAAsC;AAChD,IAAA,IAAA,CAAK,iBAAA,GAAoB,iBAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,wBAAA,CACE,WAAA,EACA,MAAA,EACA,kBAAA,EACM;AACN,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AACnB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,kBAAA,GAAqB,kBAAA;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,wBAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,WAAA,KAAgB,IAAA,IAAQ,IAAA,CAAK,MAAA,KAAW,IAAA;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,iBAAiB,OAAA,EAA6D;AApEtF,IAAA,IAAA,EAAA;AAqEI,IAAA,IAAA,CAAI,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,EAAU;AAErC,MAAA,OAAO,IAAA,CAAK,kBAAA;AAAA,IACd;AAEA,IAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,iBAAA,CAAkB,sBAAsB,OAAO,CAAA;AAC7E,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,iBAAA,CAAkB,SAAA,CAAU,OAAO,CAAA;AAGvD,IAAA,IAAA,CAAK,wBAAwB,EAAC;AAG9B,IAAA,IAAI,IAAA,CAAK,WAAA,IAAe,IAAA,CAAK,MAAA,IAAU,KAAK,kBAAA,EAAoB;AAC9D,MAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,kBAAA,EAAmB;AACjD,MAAA,IAAA,CAAK,UAAU,IAAI,kBAAA;AAAA,QACjB,IAAA,CAAK,WAAA;AAAA,QACL,IAAA,CAAK,MAAA;AAAA,QACL,MAAA;AAAA,QACA;AAAA,OACF;AAAA,IACF,CAAA,MAAO;AACL,MAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,IACjB;AAGA,IAAA,MAAM,aAAA,GAAgB,KAAK,OAAA,GACvB,IAAA,CAAK,QAAQ,UAAA,EAAW,GACxB,sBAA4B,MAAM,CAAA;AAEtC,IAAA,IAAA,CAAK,kBAAA,GAAqB;AAAA,MACxB,UAAA;AAAA,MACA,QAAA,EAAU,IAAA;AAAA,MACV,WAAA,sBAAiB,GAAA,EAAI;AAAA,MACrB;AAAA,KACF;AAEA,IAAA,OAAO,IAAA,CAAK,kBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,iBAAA,GAAmC;AAlH3C,IAAA,IAAA,EAAA;AAmHI,IAAA,IAAI,EAAA,CAAC,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,CAAA,EAAU;AACtC,MAAA,MAAM,IAAI,MAAM,iCAAiC,CAAA;AAAA,IACnD;AAEA,IAAA,IAAI;AACF,MAAA,IAAI,KAAK,OAAA,EAAS;AAEhB,QAAA,MAAM,MAAA,GAAS,MAAM,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAO;AACzC,QAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,UAAA,MAAM,IAAI,KAAA,CAAM,MAAA,CAAO,KAAA,IAAS,2BAA2B,CAAA;AAAA,QAC7D;AAAA,MACF,CAAA,MAAO;AAEL,QAAA,KAAA,MAAW,GAAG,UAAU,CAAA,IAAK,IAAA,CAAK,mBAAmB,WAAA,EAAa;AAChE,UAAA,MAAM,IAAA,CAAK,iBAAA,CAAkB,cAAA,CAAe,UAAU,CAAA;AAAA,QACxD;AAAA,MACF;AAEA,MAAA,IAAA,CAAK,mBAAmB,QAAA,GAAW,KAAA;AACnC,MAAA,IAAA,CAAK,wBAAwB,EAAC;AAC9B,MAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,IAEjB,SAAS,KAAA,EAAO;AAEd,MAAA,MAAM,KAAK,mBAAA,EAAoB;AAC/B,MAAA,MAAM,KAAA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,mBAAA,GAAqC;AArJ7C,IAAA,IAAA,EAAA;AAsJI,IAAA,IAAI,EAAA,CAAC,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,CAAA,EAAU;AACtC,MAAA,MAAM,IAAI,MAAM,mCAAmC,CAAA;AAAA,IACrD;AAGA,IAAA,IAAI,KAAK,OAAA,IAAW,CAAC,IAAA,CAAK,OAAA,CAAQ,cAAa,EAAG;AAChD,MAAA,IAAI;AACF,QAAA,MAAM,IAAA,CAAK,QAAQ,QAAA,EAAS;AAAA,MAC9B,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAGA,IAAA,IAAA,CAAK,kBAAA,CAAmB,YAAY,KAAA,EAAM;AAC1C,IAAA,IAAA,CAAK,mBAAmB,QAAA,GAAW,KAAA;AAEnC,IAAA,IAAA,CAAK,wBAAwB,EAAC;AAC9B,IAAA,IAAA,CAAK,OAAA,GAAU,IAAA;AAAA,EAMjB;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAA,GAAiD;AAC/C,IAAA,OAAO,IAAA,CAAK,kBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,UAAA,GAAwC;AACtC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,mBAAA,GAA+B;AAjMjC,IAAA,IAAA,EAAA;AAkMI,IAAA,OAAA,CAAA,CAAO,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,KAAY,KAAA;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,aAAa,SAAA,EAAyB;AA9MxC,IAAA,IAAA,EAAA;AA+MI,IAAA,IAAI,EAAA,CAAC,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,CAAA,EAAU;AACtC,MAAA;AAAA,IACF;AAEA,IAAA,IAAA,CAAK,qBAAA,CAAsB,KAAK,SAAS,CAAA;AAKzC,IAAA,IAAI,KAAK,OAAA,EAAS;AAIhB,MAAA,KAAK,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,SAAA,EAAW,EAAE,CAAA;AAAA,IACzC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAA,GAAmC;AACjC,IAAA,OAAO,IAAA,CAAK,qBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAA,GAA4B;AAC1B,IAAA,OAAO,KAAK,qBAAA,CAAsB,MAAA;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UAAUnB,KAAAA,EAA6B;AAG3C,IAAA,MAAM,IAAI,MAAM,gCAAgC,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,iBAAiBA,KAAAA,EAA6B;AAClD,IAAA,MAAM,IAAI,MAAM,gCAAgC,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,oBAAoBA,KAAAA,EAA6B;AACrD,IAAA,MAAM,IAAI,MAAM,gCAAgC,CAAA;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAA,GAAyB;AAzQjC,IAAA,IAAA,EAAA;AA0QI,IAAA,IAAA,CAAI,EAAA,GAAA,IAAA,CAAK,kBAAA,KAAL,IAAA,GAAA,MAAA,GAAA,EAAA,CAAyB,QAAA,EAAU;AACrC,MAAA,MAAM,KAAK,mBAAA,EAAoB;AAAA,IACjC;AACA,IAAA,IAAA,CAAK,kBAAA,GAAqB,IAAA;AAAA,EAC5B;AACF,CAAA;;;ACtQA,IAAI,iBAAA,GAAoB,CAAA;AAKjB,IAAM,mCAAN,MAAyE;AAAA,EAC/D,YAAA;AAAA,EACA,SAAA;AAAA,EACR,SAAA;AAAA,EACA,OAAA;AAAA,EAER,WAAA,CAAY,SAAA,EAAmB,SAAA,EAA8B,OAAA,EAAkC;AAC9F,IAAA,IAAA,CAAK,YAAA,GAAe,CAAA,WAAA,EAAc,SAAS,CAAA,CAAA,EAAI,EAAE,iBAAiB,CAAA,CAAA;AAClE,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;AACjB,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;AACjB,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EAChB;AAAA;AAAA,EAGA,MAAM,KAAA,GAAuB;AAC5B,IAAA,MAAM,IAAA,CAAK,SAAA,CAAU,gBAAA,CAAiB,IAAA,CAAK,OAAO,CAAA;AAAA,EACnD;AAAA;AAAA,EAGA,MAAM,MAAA,GAAwB;AAG7B,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,qBAAA,EAAsB;AACxD,IAAA,IAAI,EAAC,yCAAY,QAAA,CAAA,EAAU;AAC1B,MAAA,MAAM,IAAA,CAAK,SAAA,CAAU,gBAAA,CAAiB,IAAA,CAAK,OAAO,CAAA;AAAA,IACnD;AACA,IAAA,MAAM,IAAA,CAAK,UAAU,iBAAA,EAAkB;AAAA,EACxC;AAAA;AAAA,EAGA,MAAM,QAAA,GAA0B;AAC/B,IAAA,MAAM,IAAA,CAAK,UAAU,mBAAA,EAAoB;AAAA,EAC1C;AAAA;AAAA,EAGA,gBAAgB,MAAA,EAAsB;AAAA,EAGtC;AAAA;AAAA,EAGA,iBAAiB,MAAA,EAAsB;AAAA,EAGvC;AAAA;AAAA,EAGA,oBAAoB,MAAA,EAAsB;AAAA,EAG1C;AAAA;AAAA,EAGA,MAAM,UAAA,GAA4B;AAEjC,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,qBAAA,EAAsB;AACxD,IAAA,IAAI,yCAAY,QAAA,EAAU;AACzB,MAAA,MAAM,IAAA,CAAK,UAAU,mBAAA,EAAoB;AAAA,IAC1C;AAAA,EACD;AACD,CAAA;;;ACXO,IAAM,gBAAN,MAAoB;AAAA,EAG1B,YACkB,aAAA,EAChB;AADgB,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AAAA,EACf;AAAA,EAJK,WAAA,uBAAkB,GAAA,EAA+B;AAAA;AAAA;AAAA;AAAA,EASzD,MAAM,WAAA,CAAY,MAAA,EAAqB,UAAA,EAAyC;AAC/E,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,mBAAA,CAAoB,MAAM,CAAA;AAC9C,IAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,MAAA,CAAO,IAAA,EAAM,MAAM,CAAA;AAExC,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,CAAA;AAChD,IAAA,MAAM,IAAA,CAAK,QAAQ,CAAC,CAAC,OAAO,IAAA,EAAM,MAAM,CAAC,CAAC,CAAA;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAA,CAAU,SAAA,EAAmB,UAAA,EAAkE;AAEpG,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AAC7C,IAAA,IAAI,MAAA,EAAQ;AACX,MAAA,OAAO,MAAA;AAAA,IACR;AAGA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,CAAA;AAChD,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,IAAA,CAAK,SAAS,CAAA;AACtC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AACxB,MAAA,OAAO,MAAA;AAAA,IACR;AAEA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA;AAC1B,IAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC/B,MAAA,MAAM,MAAA,GAAS,MAAM,CAAC,CAAA;AACtB,MAAA,IAAA,CAAK,WAAA,CAAY,GAAA,CAAI,SAAA,EAAW,MAAM,CAAA;AACtC,MAAA,OAAO,MAAA;AAAA,IACR;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,YAAA,CAAa,SAAA,EAAmB,UAAA,EAAyC;AAC9E,IAAA,IAAA,CAAK,WAAA,CAAY,OAAO,SAAS,CAAA;AAEjC,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,CAAA;AAChD,IAAA,MAAM,KAAK,OAAA,CAAQ,CAAC,CAAC,SAAA,EAAW,MAAS,CAAC,CAAC,CAAA;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,UAAA,EAA6C;AAC7D,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,CAAA;AAChD,IAAA,MAAM,SAAmB,EAAC;AAE1B,IAAA,WAAA,MAAiB,QAAQ,IAAA,CAAK,KAAA,CAAM,EAAE,WAAA,EAAa,IAAA,EAAa,CAAA,EAAG;AAClE,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AACxB,QAAA;AAAA,MACD;AAEA,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA;AAC1B,MAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC/B,QAAA,MAAA,CAAO,IAAA,CAAK,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,MACrB;AAAA,IACD;AAEA,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,UAAA,GAAmB;AAClB,IAAA,IAAA,CAAK,YAAY,KAAA,EAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,MAAA,EAAwC;AACnE,IAAA,OAAO;AAAA,MACN,MAAM,MAAA,CAAO,IAAA;AAAA,MACb,YAAY,MAAA,CAAO,UAAA;AAAA,MACnB,OAAA,EAAS,OAAO,OAAA,CAAQ,GAAA,CAAI,SAAO,IAAA,CAAK,oBAAA,CAAqB,GAAG,CAAC,CAAA;AAAA,MACjE,oBAAA,EAAsB,MAAA,CAAO,oBAAA,CAAqB,GAAA,CAAI,CAAA,EAAA,MAAO;AAAA,QAC5D,OAAO,EAAA,CAAG,KAAA;AAAA,QACV,MAAM,EAAA,CAAG,IAAA;AAAA,QACT,eAAe,EAAA,CAAG,aAAA;AAAA,QAClB,WAAW,EAAA,CAAG;AAAA,OACf,CAAE,CAAA;AAAA,MACF,OAAA,EAAA,CAAU,MAAA,CAAO,OAAA,IAAW,EAAC,EAAG,IAAI,CAAA,GAAA,KAAO,IAAA,CAAK,mBAAA,CAAoB,GAAG,CAAC,CAAA;AAAA,MACxE,gBAAgB,MAAA,CAAO,cAAA;AAAA,MACvB,UAAU,MAAA,CAAO,QAAA;AAAA,MACjB,aAAa,MAAA,CAAO,WAAA;AAAA,MACpB,eAAe,MAAA,CAAO;AAAA,KACvB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAAqB,GAAA,EAAuC;AACnE,IAAA,OAAO;AAAA,MACN,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,QAAA,EAAU,IAAI,WAAA,CAAY,IAAA;AAAA;AAAA,MAC1B,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,YAAY,GAAA,CAAI,UAAA;AAAA,MAChB,SAAS,GAAA,CAAI,OAAA;AAAA,MACb,cAAc,GAAA,CAAI,YAAA,GAAe,KAAK,mBAAA,CAAoB,GAAA,CAAI,YAAY,CAAA,GAAI,MAAA;AAAA,MAC9E,WAAW,GAAA,CAAI,SAAA;AAAA,MACf,WAAW,GAAA,CAAI,SAAA;AAAA,MACf,aAAa,GAAA,CAAI;AAAA,KAClB;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,GAAA,EAAqC;AAChE,IAAA,OAAO;AAAA,MACN,MAAM,GAAA,CAAI,IAAA;AAAA,MACV,OAAA,EAAS,GAAA,CAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,MAAgE;AAAA,QACzF,OAAO,GAAA,CAAI,KAAA;AAAA,QACX,MAAM,GAAA,CAAI,IAAA;AAAA,QACV,WAAW,GAAA,CAAI;AAAA,OAChB,CAAE;AAAA,KACH;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,oBAAoB,IAAA,EAAgB;AAG3C,IAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,IAAA,KAAS,IAAA,EAAM;AAC9C,MAAA,IAAI,MAAA,IAAU,IAAA,IAAQ,IAAA,CAAK,IAAA,KAAS,SAAA,EAAW;AAC9C,QAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,KAAK,KAAA,EAAM;AAAA,MAC7C;AAEA,MAAA,OAAO,EAAE,IAAA,EAAM,SAAA,EAAW,KAAK,IAAA,CAAK,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,IACrD;AACA,IAAA,OAAO,IAAA;AAAA,EACR;AACD,CAAA;AC1LO,IAAM,WAAN,MAAe;AAAA,EACrB,WAAA,CACkB,MAAA,EACA,QAAA,GAA2B,MAAA,EAC3C;AAFgB,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AAAA,EACf;AAAA;AAAA;AAAA;AAAA,EAKH,UAAU,GAAA,EAAsB;AAE/B,IAAA,MAAM,SAAmC,EAAC;AAE1C,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACpD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA;AACjC,MAAA,IAAI,CAAC,GAAA,EAAK;AACV,MAAA,MAAM,KAAA,GAAQ,IAAI,CAAC,CAAA;AACnB,MAAA,MAAA,CAAO,IAAI,IAAI,CAAA,GAAI,IAAA,CAAK,cAAA,CAAe,SAAS,IAAI,CAAA;AAAA,IACrD;AAEA,IAAA,IAAI,IAAA,CAAK,aAAa,SAAA,EAAW;AAEhC,MAAA,MAAM,IAAI,MAAM,sCAAsC,CAAA;AAAA,IACvD;AAEA,IAAA,OAAO,IAAA,CAAK,UAAU,MAAM,CAAA;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,OAAA,EAA0B;AACnC,IAAA,IAAI,MAAA;AAEJ,IAAA,IAAI,IAAA,CAAK,aAAa,SAAA,EAAW;AAEhC,MAAA,MAAM,IAAI,MAAM,sCAAsC,CAAA;AAAA,IACvD,CAAA,MAAO;AACN,MAAA,MAAA,GAAS,IAAA,CAAK,MAAM,OAAiB,CAAA;AAAA,IACtC;AAGA,IAAA,MAAM,MAAW,EAAC;AAClB,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACpD,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA;AACjC,MAAA,IAAI,CAAC,GAAA,EAAK;AACV,MAAA,GAAA,CAAI,CAAC,CAAA,GAAI,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,IAAK,IAAA;AAAA,IAC9B;AAEA,IAAA,OAAO,GAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAkB,GAAA,EAA2B;AAC5C,IAAA,MAAM,UAAoB,EAAC;AAE3B,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,MAAA,CAAO,oBAAA,EAAsB;AACrD,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA;AAC7B,MAAA,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,gBAAA,CAAiB,KAAA,IAAS,IAAI,CAAC,CAAA;AAAA,IAClD;AAGA,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,CAAC,CAAA,EAAG;AACvC,MAAA,OAAO,QAAQ,CAAC,CAAA;AAAA,IACjB;AAIA,IAAA,OAAO,OAAA,CAAQ,KAAK,IAAM,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,MAAA,EAAqC;AACrD,IAAA,IAAI,MAAA,CAAO,MAAA,KAAW,IAAA,CAAK,MAAA,CAAO,qBAAqB,MAAA,EAAQ;AAC9D,MAAA,MAAM,IAAI,KAAA;AAAA,QACT,wBAAwB,IAAA,CAAK,MAAA,CAAO,qBAAqB,MAAM,CAAA,aAAA,EAAgB,OAAO,MAAM,CAAA;AAAA,OAC7F;AAAA,IACD;AAEA,IAAA,MAAM,OAAA,GAAU,OAAO,GAAA,CAAI,CAAA,CAAA,KAAK,KAAK,gBAAA,CAAiB,CAAA,IAAK,IAAI,CAAC,CAAA;AAEhE,IAAA,IAAI,OAAA,CAAQ,MAAA,KAAW,CAAA,IAAK,OAAA,CAAQ,CAAC,CAAA,EAAG;AACvC,MAAA,OAAO,QAAQ,CAAC,CAAA;AAAA,IACjB;AAEA,IAAA,OAAO,OAAA,CAAQ,KAAK,IAAM,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAA,GAAiC;AAChC,IAAA,OAAO,KAAK,MAAA,CAAO,oBAAA,CAAqB,GAAA,CAAI,CAAA,EAAA,KAAM,GAAG,KAAK,CAAA;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA,EAKA,cAAA,GAAyB;AACxB,IAAA,OAAO,IAAA,CAAK,OAAO,OAAA,CAAQ,MAAA;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,KAAA,EAAuB;AA1ItC,IAAA,IAAA,EAAA;AA2IE,IAAA,OAAA,CAAA,CAAO,UAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,KAAzB,mBAA4B,IAAA,KAAQ,EAAA;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAKA,eAAeA,KAAAA,EAAsB;AACpC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,OAAA,CAAQ,SAAA,CAAU,CAAA,GAAA,KAAO,GAAA,CAAI,IAAA,CAAK,WAAA,EAAY,KAAMA,KAAAA,CAAK,WAAA,EAAa,CAAA;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,KAAA,EAAyB;AACjD,IAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AAC1C,MAAA,OAAO,QAAA;AAAA,IACR;AAEA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,KAAA;AAAA,IACR;AAEA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAG9B,MAAA,OAAO,MAAM,QAAA,EAAS;AAAA,IACvB;AAEA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,MAAM,QAAA,EAAS;AAAA,IACvB;AAEA,IAAA,IAAI,OAAO,UAAU,SAAA,EAAW;AAC/B,MAAA,OAAO,QAAQ,GAAA,GAAM,GAAA;AAAA,IACtB;AAEA,IAAA,IAAI,iBAAiB,UAAA,EAAY;AAEhC,MAAA,OAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,SAAS,QAAQ,CAAA;AAAA,IAC5C;AAGA,IAAA,OAAO,OAAO,KAAK,CAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,KAAA,EAA2B;AAEjD,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,OAAO,KAAK,CAAA;AAAA,IACpB;AAGA,IAAA,IAAI,KAAA,YAAiB,UAAA,IAAc,IAAA,CAAK,QAAA,KAAa,MAAA,EAAQ;AAC5D,MAAA,OAAO,MAAA,CAAO,IAAA,CAAK,KAAK,CAAA,CAAE,SAAS,QAAQ,CAAA;AAAA,IAC5C;AAEA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB,WAAA,EAA8B;AAClD,IAAA,OAAO,KAAK,MAAA,CAAO,oBAAA,CAAqB,KAAK,CAAA,EAAA,KAAM,EAAA,CAAG,UAAU,WAAW,CAAA;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA,EAKA,SAAA,GAA+B;AAC9B,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAAA,GAAmE;AA3NpE,IAAA,IAAA,EAAA,EAAA,EAAA;AA4NE,IAAA,MAAM,KAAA,GAAQ,KAAK,MAAA,CAAO,oBAAA;AAG1B,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACvB,MAAA,OAAO,MAAM,CAAA;AAAA,IACd;AAGA,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACvB,MAAA,MAAM,aAAA,GAAA,CAAA,CAAgB,EAAA,GAAA,KAAA,CAAM,CAAC,CAAA,KAAP,mBAAU,SAAA,KAAa,QAAA;AAC7C,MAAA,MAAM,aAAA,GAAgB,iBAAiB,aAAa,CAAA;AACpD,MAAA,MAAM,IAAA,GAAA,CAAA,CAAO,EAAA,GAAA,KAAA,CAAM,CAAC,CAAA,KAAP,mBAAU,IAAA,KAAQ,KAAA;AAC/B,MAAA,MAAM,UAAA,GAAa,OAAO,EAAA,GAAK,CAAA;AAE/B,MAAA,OAAO,CAAC,GAAW,CAAA,KAA0B;AAE5C,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,CAAC,CAAA;AACxC,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,kBAAA,CAAmB,CAAC,CAAA;AAGxC,QAAA,MAAM,MAAA,GAAS,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,QAAQ,aAAa,CAAA;AAC/D,QAAA,OAAQ,MAAA,GAAS,UAAA;AAAA,MAClB,CAAA;AAAA,IACD;AAGA,IAAA,MAAM,cAAA,GAAiB,MAAM,GAAA,CAAI,CAAA,GAAA,KAAO,iBAAiB,GAAA,CAAI,SAAA,IAAa,QAAQ,CAAC,CAAA;AACnF,IAAA,MAAM,YAAY,KAAA,CAAM,GAAA,CAAI,CAAA,GAAA,KAAO,GAAA,CAAI,QAAQ,KAAK,CAAA;AAEpD,IAAA,OAAO,CAAC,GAAW,CAAA,KAA0B;AAE5C,MAAA,MAAM,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,IAAM,CAAA;AAC7B,MAAA,MAAM,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,IAAM,CAAA;AAG7B,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACtC,QAAA,MAAM,SAAS,IAAA,CAAK,kBAAA,CAAmB,MAAA,CAAO,CAAC,KAAK,EAAE,CAAA;AACtD,QAAA,MAAM,SAAS,IAAA,CAAK,kBAAA,CAAmB,MAAA,CAAO,CAAC,KAAK,EAAE,CAAA;AAEtD,QAAA,MAAM,SAAS,IAAA,CAAK,aAAA,CAAc,QAAQ,MAAA,EAAQ,cAAA,CAAe,CAAC,CAAE,CAAA;AACpE,QAAA,IAAI,WAAW,CAAA,EAAG;AACjB,UAAA,MAAM,UAAA,GAAa,SAAA,CAAU,CAAC,CAAA,GAAI,EAAA,GAAK,CAAA;AACvC,UAAA,OAAQ,MAAA,GAAS,UAAA;AAAA,QAClB;AAAA,MACD;AAEA,MAAA,OAAO,CAAA;AAAA,IACR,CAAA;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,UAAA,EAA8B;AACxD,IAAA,IAAI,eAAe,QAAA,EAAgB;AAClC,MAAA,OAAO,IAAA;AAAA,IACR;AAGA,IAAA,MAAM,GAAA,GAAM,OAAO,UAAU,CAAA;AAC7B,IAAA,IAAI,CAAC,KAAA,CAAM,GAAG,CAAA,IAAK,eAAe,EAAA,EAAI;AACrC,MAAA,OAAO,GAAA;AAAA,IACR;AAGA,IAAA,OAAO,UAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAA,CAAc,CAAA,EAAa,CAAA,EAAa,aAAA,EAA0C;AAEzF,IAAA,IAAI,CAAA,KAAM,IAAA,IAAQ,CAAA,KAAM,IAAA,EAAM,OAAO,CAAA;AACrC,IAAA,IAAI,CAAA,KAAM,MAAM,OAAO,EAAA;AACvB,IAAA,IAAI,CAAA,KAAM,MAAM,OAAO,CAAA;AAGvB,IAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AACnD,MAAA,OAAO,aAAA,CAAc,GAAG,CAAC,CAAA;AAAA,IAC1B;AAGA,IAAA,IAAI,OAAO,CAAA,KAAM,QAAA,IAAY,OAAO,MAAM,QAAA,EAAU;AACnD,MAAA,OAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,IAAI,CAAA,GAAI,CAAA;AAAA,IACjC;AAGA,IAAA,OAAO,gBAAA,CAAiB,CAAA,EAAG,CAAA,EAAG,QAAQ,CAAA;AAAA,EACvC;AACD,CAAA;;;AC/QO,IAAM,eAAN,MAAmB;AAAA,EAGzB,WAAA,CACS,QACA,gBAAA,EACP;AAFO,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACA,IAAA,IAAA,CAAA,gBAAA,GAAA,gBAAA;AAAA,EACN;AAAA,EALK,UAAA,uBAAiB,GAAA,EAAwC;AAAA;AAAA;AAAA;AAAA,EAUjE,MAAM,WAAW,UAAA,EAAyC;AACzD,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACxC,MAAA,MAAM,OAAO,MAAM,IAAA,CAAK,gBAAA,CAAiB,KAAA,CAAM,MAAM,UAAU,CAAA;AAC/D,MAAA,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,KAAA,CAAM,IAAA,EAAM,IAAI,CAAA;AAAA,IACrC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,SAAA,EAA2D;AACvE,IAAA,OAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,cAAA,CAAe,aAAgC,GAAA,EAAoB;AAClE,IAAA,MAAM,WAAqB,EAAC;AAE5B,IAAA,KAAA,MAAW,QAAA,IAAY,YAAY,OAAA,EAAS;AAC3C,MAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,QAAA,CAAS,KAAK,CAAA;AAChC,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,cAAA,CAAe,KAAA,IAAS,IAAI,CAAA;AACrD,MAAA,QAAA,CAAS,KAAK,WAAW,CAAA;AAAA,IAC1B;AAGA,IAAA,OAAO,QAAA,CAAS,KAAK,IAAM,CAAA;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,kBAAA,CACL,GAAA,EACA,UAAA,EACA,UAAA,EACgB;AAChB,IAAA,MAAM,UAAyC,EAAC;AAEhD,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACxC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,cAAA,CAAe,KAAA,EAAO,GAAG,CAAA;AAC/C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,MAAA,IAAI,CAAC,IAAA,EAAM;AACV,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,KAAA,CAAM,IAAI,CAAA,CAAE,CAAA;AAAA,MACtD;AAEA,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,KAAA,CAAM,IAAA,EAAM,CAAC,CAAC,QAAA,EAAU,UAAU,CAAC,CAAC,CAAC,CAAA;AAAA,IACpD;AAGA,IAAA,KAAA,MAAW,CAAC,SAAA,EAAW,OAAO,CAAA,IAAK,OAAA,EAAS;AAC3C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA;AAC1C,MAAA,IAAI,IAAA,EAAM;AACT,QAAA,MAAM,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,kBAAA,CACL,GAAA,EACA,UAAA,EACA,UAAA,EACgB;AAChB,IAAA,MAAM,UAAyD,EAAC;AAEhE,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACxC,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,cAAA,CAAe,KAAA,EAAO,GAAG,CAAA;AAC/C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,MAAA,IAAI,CAAC,IAAA,EAAM;AACV,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,KAAA,CAAM,IAAI,CAAA,CAAE,CAAA;AAAA,MACtD;AAEA,MAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,KAAA,CAAM,IAAA,EAAM,CAAC,CAAC,QAAA,EAAU,MAAS,CAAC,CAAC,CAAC,CAAA;AAAA,IACnD;AAGA,IAAA,KAAA,MAAW,CAAC,SAAA,EAAW,OAAO,CAAA,IAAK,OAAA,EAAS;AAC3C,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA;AAC1C,MAAA,IAAI,IAAA,EAAM;AACT,QAAA,MAAM,IAAA,CAAK,QAAQ,OAAO,CAAA;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,kBAAA,CACL,MAAA,EACA,MAAA,EACA,aAAA,EACA,eACA,UAAA,EACgB;AAEhB,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,MAAA,CAAO,OAAA,EAAS;AACxC,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,cAAA,CAAe,KAAA,EAAO,MAAM,CAAA;AACrD,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,cAAA,CAAe,KAAA,EAAO,MAAM,CAAA;AAErD,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,MAAM,IAAI,CAAA;AAC3C,MAAA,IAAI,CAAC,IAAA,EAAM;AACV,QAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,KAAA,CAAM,IAAI,CAAA,CAAE,CAAA;AAAA,MACtD;AAEA,MAAA,IAAI,WAAA,KAAgB,WAAA,IAAe,aAAA,KAAkB,aAAA,EAAe;AAEnE,QAAA,MAAM,KAAK,OAAA,CAAQ;AAAA,UAClB,CAAC,aAAa,MAAS,CAAA;AAAA,UACvB,CAAC,aAAa,aAAa;AAAA,SAC3B,CAAA;AAAA,MACF;AAAA,IAED;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAA,CACN,SAAA,EACA,QAAA,EAC4B;AAC5B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA;AAC1C,IAAA,IAAI,CAAC,IAAA,EAAM;AACV,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,SAAS,CAAA,CAAE,CAAA;AAAA,IACrD;AAEA,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,IAAA,CAAK,QAAQ,CAAA;AACrC,IAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AACxB,MAAA;AAAA,IACD;AAEA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA;AAC1B,IAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC/B,MAAA,MAAM,MAAM,CAAC,CAAA;AAAA,IACd;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cAAA,CACN,SAAA,EACA,QAAA,EACA,MAAA,EACA,YAAY,IAAA,EACgB;AAC5B,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,UAAA,CAAW,GAAA,CAAI,SAAS,CAAA;AAC1C,IAAA,IAAI,CAAC,IAAA,EAAM;AACV,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,sBAAA,EAAyB,SAAS,CAAA,CAAE,CAAA;AAAA,IACrD;AAIA,IAAA,MAAM,WAAW,IAAA,CAAK,KAAA,CAAM,EAAE,WAAA,EAAa,WAAkB,CAAA;AAE7D,IAAA,WAAA,MAAiB,QAAQ,QAAA,EAAU;AAClC,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,CAAQ,IAAI,CAAA,EAAG;AACxB,QAAA;AAAA,MACD;AAEA,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,IAAI,CAAA;AAC1B,MAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC/B,QAAA,MAAM,CAAC,GAAA,EAAK,UAAU,CAAA,GAAI,KAAA;AAG1B,QAAA,IAAI,QAAA,KAAa,MAAA,IAAa,GAAA,GAAM,QAAA,EAAU;AAC7C,UAAA;AAAA,QACD;AACA,QAAA,IAAI,MAAA,KAAW,MAAA,IAAa,GAAA,GAAM,MAAA,EAAQ;AACzC,UAAA;AAAA,QACD;AAEA,QAAA,MAAM,UAAA;AAAA,MACP;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe,SAAA,EAAkD;AAChE,IAAA,OAAO,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,GAAA,KAAO,GAAA,CAAI,SAAS,SAAS,CAAA;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,KAAA,EAAyB;AAC/C,IAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AAC1C,MAAA,OAAO,GAAA;AAAA,IACR;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,KAAA;AAAA,IACR;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAG9B,MAAA,OAAO,KAAA,CAAM,cAAc,EAAE,CAAA;AAAA,IAC9B;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC9B,MAAA,OAAO,MAAM,QAAA,EAAS;AAAA,IACvB;AACA,IAAA,IAAI,iBAAiB,UAAA,EAAY;AAEhC,MAAA,OAAO,IAAA,CAAK,MAAA,CAAO,YAAA,CAAa,GAAG,KAAK,CAAC,CAAA;AAAA,IAC1C;AAEA,IAAA,OAAO,OAAO,KAAK,CAAA;AAAA,EACpB;AACD,CAAA;;;ACrOO,IAAM,sBAAN,MAA0B;AAAA,EAGhC,YAAoB,MAAA,EAA2B;AAA3B,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AACnB,IAAA,IAAA,CAAK,KAAA,GAAQ;AAAA,MACZ,QAAA,EAAU,CAAA;AAAA,MACV,WAAA,sBAAiB,GAAA,EAAI;AAAA,MACrB,WAAA,EAAa,KAAK,GAAA;AAAI,KACvB;AAGA,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AAC/C,MAAA,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,CAAI,CAAA,EAAG;AAAA,QAC7B,aAAA,EAAe,CAAA;AAAA,QACf,SAAA,EAAW;AAAA,OACX,CAAA;AAAA,IACF;AAAA,EACD;AAAA,EAhBQ,KAAA;AAAA;AAAA;AAAA;AAAA,EAqBR,aAAA,GAAiC;AAChC,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACb;AAAA;AAAA;AAAA;AAAA,EAKA,WAAA,GAAsB;AACrB,IAAA,OAAO,KAAK,KAAA,CAAM,QAAA;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,WAAA,EAA6B;AAC7C,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,IAAI,WAAW,CAAA;AACvD,IAAA,OAAA,CAAO,qCAAU,aAAA,KAAiB,CAAA;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAA,GAA0B;AACzB,IAAA,IAAA,CAAK,KAAA,CAAM,QAAA,EAAA;AACX,IAAA,IAAA,CAAK,KAAA,CAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAA,GAA0B;AACzB,IAAA,IAAA,CAAK,KAAA,CAAM,WAAW,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,WAAW,CAAC,CAAA;AACzD,IAAA,IAAA,CAAK,KAAA,CAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,4BAA4B,WAAA,EAA6B;AACxD,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,gBAAA,CAAiB,WAAW,CAAA;AACvD,IAAA,IAAI,kBAAkB,CAAA,EAAG;AACxB,MAAA,OAAO,GAAA;AAAA,IACR;AACA,IAAA,OAAO,CAAA,GAAM,aAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAAyB,YAAA,EAA8B;AAEtD,IAAA,OAAO,IAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAA,GAAgC;AAG/B,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,EAAM,IAAA,CAAK,MAAM,QAAQ,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAsB,WAAA,EAA6B;AAIlD,IAAA,MAAM,eAAA,GAAkB,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,QAAQ,CAAC,CAAA,GAAI,CAAA;AACtE,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,KAAA,CAAM,QAAA,GAAW,WAAA;AAC3C,IAAA,OAAO,eAAA,GAAkB,YAAA;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAA,CAA0B,aAAqB,UAAA,EAA6B;AAC3E,IAAA,IAAI,UAAA,EAAY;AACf,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,2BAAA,CAA4B,WAAW,CAAA;AAChE,MAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA,CAAM,QAAA,GAAW,WAAW,CAAC,CAAA;AAAA,IACjE,CAAA,MAAO;AACN,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,wBAAA,CAAyB,WAAW,CAAA;AAC7D,MAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,KAAA,CAAM,QAAA,GAAW,WAAW,CAAC,CAAA;AAAA,IACjE;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,gBAAA,CAAiB,UAAA,GAAa,GAAA,EAAqB;AAGxD,IAAA,IAAA,CAAK,KAAA,CAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,KAAA,GAAc;AACb,IAAA,IAAA,CAAK,MAAM,QAAA,GAAW,CAAA;AACtB,IAAA,IAAA,CAAK,KAAA,CAAM,YAAY,KAAA,EAAM;AAC7B,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACpD,MAAA,IAAA,CAAK,KAAA,CAAM,WAAA,CAAY,GAAA,CAAI,CAAA,EAAG;AAAA,QAC7B,aAAA,EAAe,CAAA;AAAA,QACf,SAAA,EAAW;AAAA,OACX,CAAA;AAAA,IACF;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,WAAA,GAAc,IAAA,CAAK,GAAA,EAAI;AAAA,EACnC;AACD,CAAA;;;ACzHA,IAAI,eAAA,GAAkB,CAAA;AAKtB,SAAS,sBAAsB,QAAA,EAAoC;AAClE,EAAA,QAAQ,QAAA;AAAU,IACjB,KAAK,WAAA,CAAY,IAAA;AAChB,MAAA,OAAO,SAAA;AAAA,IACR,KAAK,WAAA,CAAY,OAAA;AAChB,MAAA,OAAO,YAAA;AAAA,IACR,KAAK,WAAA,CAAY,IAAA;AAChB,MAAA,OAAO,SAAA;AAAA,IACR,KAAK,WAAA,CAAY,IAAA;AAChB,MAAA,OAAO,SAAA;AAAA,IACR,KAAK,WAAA,CAAY,IAAA;AAChB,MAAA,OAAO,SAAA;AAAA,IACR,KAAK,WAAA,CAAY,OAAA;AAChB,MAAA,OAAO,YAAA;AAAA,IACR,KAAK,WAAA,CAAY,OAAA;AAChB,MAAA,OAAO,YAAA;AAAA,IACR;AACC,MAAA,OAAO,SAAA;AAAA;AAEV;AAKO,IAAM,sBAAA,GAAN,cAAqC,YAAA,CAAa;AAAA,EAC/C,aAAa,EAAE,eAAA;AAAA,EACf,UAAA;AAAA,EACA,aAAA,GAAgB,KAAA;AAAA,EAChB,qBAAA;AAAA,EACA,SAAA;AAAA,EACA,iBAAA;AAAA,EACA,OAAA;AAAA,EACA,aAAA;AAAA,EACA,QAAA;AAAA,EACA,YAAA;AAAA,EACA,mBAAA;AAAA,EACA,UAAA;AAAA,EACD,WAAA;AAAA;AAAA,EAEP,WAAA,CACE,IACA,MAAA,EACA,UAAA,EACA,WACA,WAAA,EACA,OAAA,EACA,iBAAA,EACA,SAAA,EACA,aAAA,EACA;AACA,IAAA,KAAA,CAAM,EAAA,EAAI,MAAA,EAAQ,UAAA,EAAY,SAAS,CAAA;AACvC,IAAA,IAAA,CAAK,WAAA,GAAc,WAAA;AACnB,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AACf,IAAA,IAAA,CAAK,iBAAA,GAAoB,iBAAA;AACzB,IAAA,IAAA,CAAK,SAAA,GAAY,SAAA;AACjB,IAAA,IAAA,CAAK,aAAA,GAAgB,aAAA;AAGrB,IAAA,IAAA,CAAK,cAAA,GAAiB,IAAA;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,UAAA,GAA4B;AAChC,IAAA,IAAI,KAAK,aAAA,EAAe;AACtB,MAAA;AAAA,IACF;AAGA,IAAA,IAAI,KAAK,qBAAA,EAAuB;AAC9B,MAAA,OAAO,IAAA,CAAK,qBAAA;AAAA,IACd;AAGA,IAAA,IAAA,CAAK,qBAAA,GAAwB,KAAK,YAAA,EAAa;AAC/C,IAAA,OAAO,IAAA,CAAK,qBAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,YAAA,GAA8B;AAC1C,IAAA,IAAI;AACF,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,qBAAA,EAAsB;AACtD,MAAA,IAAA,CAAK,UAAA,GAAa,MAAM,IAAA,CAAK,iBAAA,CAAkB,qBAAA;AAAA,QAC7C,IAAA,CAAK,OAAA;AAAA,QACL,QAAA,IAAY,KAAA;AAAA,OACd;AAIA,MAAA,IAAI,YAAA,GAAe,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,IAAA,CAAK,SAAA,EAAW,qCAAU,UAAU,CAAA;AAE1F,MAAA,IAAI,CAAC,YAAA,EAAc;AAEjB,QAAA,IAAI,IAAA,CAAK,WAAA,CAAY,OAAA,CAAQ,MAAA,KAAW,CAAA,EAAG;AACzC,UAAA,MAAM,IAAI,MAAM,gDAAgD,CAAA;AAAA,QAClE;AACA,QAAA,MAAM,KAAK,aAAA,CAAc,WAAA,CAAY,IAAA,CAAK,WAAA,EAAa,qCAAU,UAAU,CAAA;AAC3E,QAAA,YAAA,GAAe,MAAM,IAAA,CAAK,aAAA,CAAc,UAAU,IAAA,CAAK,SAAA,EAAW,qCAAU,UAAU,CAAA;AACtF,QAAA,IAAI,CAAC,YAAA,EAAc;AACjB,UAAA,MAAM,IAAI,MAAM,qCAAqC,CAAA;AAAA,QACvD;AAAA,MACF,CAAA,MAAO;AAGL,QAAA,IAAA,CAAK,YAAY,OAAA,GAAU,YAAA,CAAa,QAAQ,GAAA,CAAI,CAAC,KAAK,KAAA,MAAW;AAAA,UACnE,MAAM,GAAA,CAAI,IAAA;AAAA,UACV,UAAU,GAAA,CAAI,QAAA;AAAA,UACd,WAAA,EAAa,qBAAA,CAAsB,GAAA,CAAI,QAAe,CAAA;AAAA,UACtD,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,YAAY,GAAA,CAAI,UAAA;AAAA,UAChB,SAAS,GAAA,CAAI,OAAA;AAAA,UACb,cAAc,GAAA,CAAI,YAAA;AAAA,UAClB,WAAW,GAAA,CAAI,SAAA;AAAA,UACf,WAAW,GAAA,CAAI,SAAA;AAAA,UACf,aAAa,GAAA,CAAI,WAAA;AAAA,UACjB;AAAA,SACF,CAAE,CAAA;AACF,QAAA,IAAA,CAAK,WAAA,CAAY,iBAAiB,IAAI,GAAA;AAAA,UACpC,YAAA,CAAa,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,EAAK,KAAA,KAAU,CAAC,GAAA,CAAI,IAAA,CAAK,WAAA,EAAY,EAAG,KAAK,CAAC;AAAA,SAC1E;AACA,QAAA,IAAA,CAAK,WAAA,CAAY,oBAAA,GAAuB,YAAA,CAAa,oBAAA,CAAqB,IAAI,CAAA,EAAA,MAAO;AAAA,UACnF,OAAO,EAAA,CAAG,KAAA;AAAA,UACV,MAAM,EAAA,CAAG,IAAA;AAAA,UACT,eAAe,EAAA,CAAG,aAAA;AAAA,UAClB,WAAW,EAAA,CAAG;AAAA,SAChB,CAAE,CAAA;AAAA,MACJ;AAEA,MAAA,IAAA,CAAK,WAAW,IAAI,QAAA,CAAS,YAAA,EAAc,IAAA,CAAK,QAAQ,QAAQ,CAAA;AAGhE,MAAA,IAAA,CAAK,eAAe,IAAI,YAAA,CAAa,YAAA,EAAc,OAAO,WAAW,UAAA,KAAe;AAClF,QAAA,MAAM,YAAA,GAAwC;AAAA,UAC5C,GAAG,IAAA,CAAK,OAAA;AAAA,UACR,eAAe,CAAA,EAAG,IAAA,CAAK,OAAA,CAAQ,aAAa,UAAU,SAAS,CAAA;AAAA,SACjE;AACA,QAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,iBAAA,CAAkB,qBAAA;AAAA,UACxC,YAAA;AAAA,UACA,UAAA,GAAa,EAAE,UAAA,EAAY,QAAA,EAAU,IAAA,EAAM,WAAA,kBAAa,IAAI,GAAA,EAAI,EAAG,aAAA,EAAe,EAAA,EAAG,GAAI,KAAA;AAAA,SAC3F;AAEA,QAAA,OAAO,IAAA;AAAA,MACT,CAAC,CAAA;AAED,MAAA,MAAM,IAAA,CAAK,YAAA,CAAa,UAAA,CAAW,QAAA,IAAA,IAAA,GAAA,KAAA,CAAA,GAAA,QAAA,CAAU,UAAU,CAAA;AAGvD,MAAA,IAAA,CAAK,mBAAA,GAAsB,IAAI,mBAAA,CAAoB,YAAY,CAAA;AAE/D,MAAA,IAAA,CAAK,aAAA,GAAgB,IAAA;AAAA,IACvB,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,0CAA0C,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AAChH,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,UAAA,GAA4B;AAAA,EAElC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,0BAAA,GAAwE;AAC5E,IAAA,IAAI,CAAC,KAAK,UAAA,EAAY;AAGpB,MAAA,MAAM,KAAK,IAAA,CAAK,EAAA;AAChB,MAAA,MAAM,mBAAA,GAAsB,EAAA,CAAG,sBAAA,CAAuB,IAAA,CAAK,SAAS,CAAA;AACpE,MAAA,IAAI,oBAAoB,MAAA,GAAS,CAAA,IAAK,mBAAA,CAAoB,CAAC,aAAa,gCAAA,EAAkC;AACxG,QAAA,IAAA,CAAK,UAAA,GAAa,oBAAoB,CAAC,CAAA;AAAA,MACzC,CAAA,MAAO;AAEL,QAAA,IAAA,CAAK,UAAA,GAAa,IAAI,gCAAA,CAAiC,IAAA,CAAK,WAAW,IAAA,CAAK,SAAA,EAAW,KAAK,OAAO,CAAA;AACnG,QAAA,MAAM,EAAA,CAAG,kBAAA,CAAmB,IAAA,CAAK,UAAU,CAAA;AAAA,MAC7C;AAAA,IACF;AACA,IAAA,OAAO,IAAA,CAAK,UAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAA,GAA2C;AACzC,IAAA,OAAO,IAAI,gCAAA,CAAiC,IAAA,CAAK,WAAW,IAAA,CAAK,SAAA,EAAW,KAAK,OAAO,CAAA;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA,EAKA,aAAA,GAAoD;AAClD,IAAA,OAAO,IAAA,CAAK,UAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,MAAM,UAAA,EAA4C;AAEvD,IAAA,MAAM,KAAK,0BAAA,EAA2B;AAGtC,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACvB,MAAA,MAAM,KAAK,UAAA,EAAW;AAAA,IACxB;AAEA,IAAA,IAAI,CAAC,KAAK,UAAA,IAAc,CAAC,KAAK,QAAA,IAAY,CAAC,KAAK,YAAA,EAAc;AAC5D,MAAA,MAAM,IAAI,MAAM,uBAAuB,CAAA;AAAA,IACzC;AAEA,IAAA,IAAI;AAGF,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,aAAA,CAAc,UAAA,CAAW,MAAM,CAAA;AAErD,MAAA,IAAI,QAAA,KAAa,CAAA,IAAK,UAAA,CAAW,IAAA,CAAK,SAAS,CAAA,EAAG;AAEhD,QAAA,OAAO,KAAK,kBAAA,CAAmB,MAAA,CAAO,WAAW,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA;AAAA,MAC3D,CAAA,MAAA,IAAW,aAAa,CAAA,EAAG;AAEzB,QAAA,OAAO,IAAA,CAAK,kBAAkB,UAAU,CAAA;AAAA,MAC1C,CAAA,MAAA,IAAW,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAElC,QAAA,OAAO,IAAA,CAAK,kBAAA,CAAmB,UAAA,CAAW,IAAA,CAAK,CAAC,CAAA,GAAI,MAAA,CAAO,UAAA,CAAW,IAAA,CAAK,CAAC,CAAC,CAAA,GAAI,EAAE,CAAA;AAAA,MACrF,CAAA,MAAA,IAAW,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG;AAElC,QAAA,OAAO,IAAA,CAAK,kBAAkB,UAAU,CAAA;AAAA,MAC1C,CAAA,MAAA,IAAW,UAAA,CAAW,MAAA,IAAU,EAAA,EAAI;AAElC,QAAA,MAAM,YAAY,UAAA,CAAW,MAAA;AAC7B,QAAA,IAAI,CAAC,SAAA,IAAa,OAAO,SAAA,KAAc,QAAA,EAAU;AAC/C,UAAA,MAAM,IAAI,MAAM,wCAAwC,CAAA;AAAA,QAC1D;AACA,QAAA,OAAO,IAAA,CAAK,gBAAA,CAAiB,SAAA,EAAW,UAAA,CAAW,IAAI,CAAA;AAAA,MACzD,CAAA,MAAO;AAEL,QAAA,OAAO,KAAK,gBAAA,EAAiB;AAAA,MAC/B;AAAA,IACF,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,iBAAiB,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AACvF,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAc,MAAA,EAA2C;AAC/D,IAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AACpB,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,KAAA,CAAM,YAAY,CAAA;AACvC,IAAA,OAAA,CAAO,+BAAQ,CAAA,CAAA,IAAK,QAAA,CAAS,MAAM,CAAC,CAAA,EAAG,EAAE,CAAA,GAAI,MAAA;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,mBAAmB,GAAA,EAAiC;AACjE,IAAA,IAAI,CAAC,IAAA,CAAK,UAAA,IAAc,CAAC,KAAK,QAAA,EAAU;AAGxC,IAAA,MAAM,IAAA,CAAK,WAAW,MAAA,EAAO;AAE7B,IAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,UAAA,CAAW,KAAK,GAAG,CAAA;AAC3C,IAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA,EAAG;AAClC,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,EAAA,CAAG,IAAI,CAAA;AACrC,IAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC9B,MAAA,MAAM,UAAA,GAAa,MAAM,CAAC,CAAA;AAC1B,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,UAAU,CAAA;AAC9C,MAAA,MAAM,GAAA;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,kBAAkB,WAAA,EAA6C;AAC5E,IAAA,IAAI,CAAC,KAAK,UAAA,EAAY;AAItB,IAAA,OAAO,KAAK,gBAAA,EAAiB;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAe,gBAAA,CAAiB,SAAA,EAAmB,IAAA,EAA8C;AAC/F,IAAA,IAAI,CAAC,KAAK,UAAA,IAAc,CAAC,KAAK,QAAA,IAAY,CAAC,KAAK,YAAA,EAAc;AAE9D,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,YAAA,CAAa,cAAA,CAAe,SAAS,CAAA;AAC9D,IAAA,IAAI,CAAC,WAAA,EAAa;AAChB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,iBAAA,EAAoB,SAAS,CAAA,CAAE,CAAA;AAAA,IACjD;AAIA,IAAA,MAAM,gBAA0B,EAAC;AACjC,IAAA,KAAA,IAAS,CAAA,GAAI,GAAG,CAAA,GAAI,IAAA,CAAK,UAAU,CAAA,GAAI,WAAA,CAAY,OAAA,CAAQ,MAAA,EAAQ,CAAA,EAAA,EAAK;AACtE,MAAA,MAAM,KAAA,GAAQ,KAAK,CAAC,CAAA;AACpB,MAAA,aAAA,CAAc,IAAA,CAAK,IAAA,CAAK,sBAAA,CAAuB,KAAK,CAAC,CAAA;AAAA,IACvD;AAEA,IAAA,MAAM,QAAA,GAAW,aAAA,CAAc,IAAA,CAAK,IAAM,CAAA;AAG1C,IAAA,WAAA,MAAiB,cAAc,IAAA,CAAK,YAAA,CAAa,WAAA,CAAY,SAAA,EAAW,QAAQ,CAAA,EAAG;AAEjF,MAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,UAAA,CAAW,KAAK,UAAU,CAAA;AAClD,MAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA,EAAG;AAClC,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,EAAA,CAAG,IAAI,CAAA;AACrC,MAAA,IAAI,KAAA,IAAS,KAAA,CAAM,MAAA,IAAU,CAAA,EAAG;AAC9B,QAAA,MAAM,UAAA,GAAa,MAAM,CAAC,CAAA;AAC1B,QAAA,MAAM,GAAA,GAAM,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,UAAU,CAAA;AAC9C,QAAA,MAAM,GAAA;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,uBAAuB,KAAA,EAAwB;AACrD,IAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,KAAA,KAAU,MAAA,EAAW;AACzC,MAAA,OAAO,GAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAO,KAAA;AAAA,IACT;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAO,KAAA,CAAM,cAAc,EAAE,CAAA;AAAA,IAC/B;AACA,IAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,MAAA,OAAO,MAAM,QAAA,EAAS;AAAA,IACxB;AACA,IAAA,IAAI,iBAAiB,UAAA,EAAY;AAC/B,MAAA,OAAO,IAAA,CAAK,MAAA,CAAO,YAAA,CAAa,GAAG,KAAK,CAAC,CAAA;AAAA,IAC3C;AACA,IAAA,OAAO,OAAO,KAAK,CAAA;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAe,gBAAA,GAAuC;AACpD,IAAA,IAAI,CAAC,IAAA,CAAK,UAAA,IAAc,CAAC,KAAK,QAAA,EAAU;AAGxC,IAAA,MAAM,IAAA,CAAK,WAAW,MAAA,EAAO;AAE7B,IAAA,MAAM,UAAA,GAAa,CAAA;AACnB,IAAA,IAAI,UAAA,GAAa,CAAA;AACjB,IAAA,IAAI,OAAA;AACJ,IAAA,MAAM,WAAA,uBAAkB,GAAA,EAAY;AAEpC,IAAA,OAAO,aAAa,UAAA,EAAY;AAC9B,MAAA,IAAI;AAEF,QAAA,MAAM,QAAQ,OAAA,GACV,IAAI,QAAA,CAAiB,EAAE,KAAK,OAAA,EAAS,SAAA,EAAW,KAAA,EAAM,EAAG,QAAW,IAAI,CAAA,GACxE,IAAI,QAAA,CAAiB,KAAA,CAAA,EAAW,QAAW,IAAI,CAAA;AAEnD,QAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,CAAW,KAAA,CAAM,KAAK,CAAA;AAE5C,QAAA,WAAA,MAAiB,QAAQ,QAAA,EAAU;AACjC,UAAA,IAAI,CAAC,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA,EAAG;AAClC,YAAA;AAAA,UACF;AAEA,UAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,EAAA,CAAG,IAAI,CAAA;AACrC,UAAA,IAAI,SAAS,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,IAAK,KAAA,CAAM,UAAU,CAAA,EAAG;AACtD,YAAA,MAAM,GAAA,GAAM,MAAM,CAAC,CAAA;AAEnB,YAAA,IAAI,WAAA,CAAY,GAAA,CAAI,GAAG,CAAA,EAAG;AACxB,cAAA,OAAA,GAAU,GAAA;AACV,cAAA;AAAA,YACF;AAEA,YAAA,MAAM,UAAA,GAAa,MAAM,CAAC,CAAA;AAC1B,YAAA,MAAM,GAAA,GAAM,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,UAAU,CAAA;AAC9C,YAAA,WAAA,CAAY,IAAI,GAAG,CAAA;AACnB,YAAA,OAAA,GAAU,GAAA;AACV,YAAA,MAAM,GAAA;AAAA,UACR;AAAA,QACF;AAEA,QAAA;AAAA,MACF,SAAS,KAAA,EAAO;AACd,QAAA,MAAM,eAAe,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AAC1E,QAAA,IAAI,YAAA,CAAa,QAAA,CAAS,iCAAiC,CAAA,EAAG;AAE5D,UAAA,UAAA,EAAA;AACA,UAAA,IAAI,cAAc,UAAA,EAAY;AAC5B,YAAA,MAAM,IAAI,KAAA,CAAM,CAAA,wBAAA,EAA2B,UAAU,CAAA,oCAAA,CAAsC,CAAA;AAAA,UAC7F;AAEA,UAAA,MAAM,IAAI,OAAA,CAAQ,CAAA,OAAA,KAAW,UAAA,CAAW,OAAA,EAAS,EAAE,CAAC,CAAA;AACpD,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,KAAA;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO,IAAA,EAA4C;AAne3D,IAAA,IAAA,EAAA,EAAA,EAAA;AAoeI,IAAA,MAAM,EAAE,SAAA,EAAW,MAAA,EAAQ,YAAA,EAAc,mBAAkB,GAAI,IAAA;AAG/D,IAAA,MAAM,KAAK,0BAAA,EAA2B;AAGtC,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACvB,MAAA,MAAM,KAAK,UAAA,EAAW;AAAA,IACxB;AAEA,IAAA,IAAI,CAAC,KAAK,UAAA,IAAc,CAAC,KAAK,QAAA,IAAY,CAAC,KAAK,YAAA,EAAc;AAC5D,MAAA,MAAM,IAAI,MAAM,uBAAuB,CAAA;AAAA,IACzC;AAGA,IAAA,IAAI,iBAAA,EAAmB;AACrB,MAAA,IAAA,CAAK,SAAA,CAAU,aAAa,iBAAiB,CAAA;AAAA,IAC/C;AAEA,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,qBAAA,EAAsB;AAEtD,IAAA,IAAI;AACF,MAAA,QAAQ,SAAA;AAAW,QACjB,KAAK,QAAA;AACH,UAAA,IAAI,CAAC,MAAA,EAAQ;AACX,YAAA,MAAM,IAAI,MAAM,wBAAwB,CAAA;AAAA,UAC1C;AACA,UAAA;AACE,YAAA,MAAM,SAAA,GAAY,IAAA,CAAK,QAAA,CAAS,iBAAA,CAAkB,MAAM,CAAA;AACxD,YAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,MAAM,CAAA;AAIjD,YAAA,MAAM,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,CAAC,SAAA,EAAW,CAAC,SAAA,EAAW,UAAU,CAAC,CAAC,CAAC,CAAA;AAGpE,YAAA,MAAM,KAAK,YAAA,CAAa,kBAAA,CAAmB,MAAA,EAAQ,SAAA,EAAW,qCAAU,UAAU,CAAA;AAGlF,YAAA,CAAA,EAAA,GAAA,IAAA,CAAK,wBAAL,IAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAA0B,iBAAA,EAAA;AAE1B,YAAA,OAAO,MAAA;AAAA,UACT;AAAA,QAEF,KAAK,QAAA;AACH,UAAA,IAAI,CAAC,MAAA,EAAQ;AACX,YAAA,MAAM,IAAI,MAAM,wBAAwB,CAAA;AAAA,UAC1C;AACA,UAAA,IAAI,CAAC,YAAA,EAAc;AACjB,YAAA,MAAM,IAAI,MAAM,gCAAgC,CAAA;AAAA,UAClD;AACA,UAAA;AACE,YAAA,MAAM,MAAA,GAAS,IAAA,CAAK,QAAA,CAAS,iBAAA,CAAkB,YAAY,CAAA;AAC3D,YAAA,MAAM,MAAA,GAAS,IAAA,CAAK,QAAA,CAAS,iBAAA,CAAkB,MAAM,CAAA;AACrD,YAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,MAAM,CAAA;AAGjD,YAAA,IAAI,WAAW,MAAA,EAAQ;AAErB,cAAA,MAAM,IAAA,CAAK,WAAW,OAAA,CAAQ;AAAA,gBAC5B,CAAC,QAAQ,KAAA,CAAS,CAAA;AAAA,gBAClB,CAAC,MAAA,EAAQ,CAAC,MAAA,EAAQ,UAAU,CAAC;AAAA,eAC9B,CAAA;AAAA,YACH,CAAA,MAAO;AAEL,cAAA,MAAM,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,CAAC,MAAA,EAAQ,CAAC,MAAA,EAAQ,UAAU,CAAC,CAAC,CAAC,CAAA;AAAA,YAChE;AAGA,YAAA,MAAM,KAAK,YAAA,CAAa,kBAAA;AAAA,cACtB,YAAA;AAAA,cACA,MAAA;AAAA,cACA,MAAA;AAAA,cACA,MAAA;AAAA,cACA,QAAA,IAAA,IAAA,GAAA,KAAA,CAAA,GAAA,QAAA,CAAU;AAAA,aACZ;AAEA,YAAA,OAAO,MAAA;AAAA,UACT;AAAA,QAEF,KAAK,QAAA;AACH,UAAA,IAAI,CAAC,YAAA,EAAc;AACjB,YAAA,MAAM,IAAI,MAAM,gCAAgC,CAAA;AAAA,UAClD;AACA,UAAA;AACE,YAAA,MAAM,SAAA,GAAY,IAAA,CAAK,QAAA,CAAS,iBAAA,CAAkB,YAAY,CAAA;AAG9D,YAAA,MAAM,IAAA,CAAK,WAAW,OAAA,CAAQ,CAAC,CAAC,SAAA,EAAW,KAAA,CAAS,CAAC,CAAC,CAAA;AAGtD,YAAA,MAAM,KAAK,YAAA,CAAa,kBAAA,CAAmB,YAAA,EAAc,SAAA,EAAW,qCAAU,UAAU,CAAA;AAGxF,YAAA,CAAA,EAAA,GAAA,IAAA,CAAK,wBAAL,IAAA,GAAA,KAAA,CAAA,GAAA,EAAA,CAA0B,iBAAA,EAAA;AAE1B,YAAA,OAAO,KAAA,CAAA;AAAA,UACT;AAAA,QAEF;AACE,UAAA,MAAM,IAAI,KAAA,CAAM,CAAA,uBAAA,EAA0B,SAAS,CAAA,CAAE,CAAA;AAAA;AACzD,IACF,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,CAAA,EAAG,SAAS,CAAA,SAAA,EAAY,KAAA,YAAiB,QAAQ,KAAA,CAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AAC9F,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,WAAA,EAAyC;AAEtD,IAAA,IAAI,CAAC,KAAK,aAAA,EAAe;AACvB,MAAA,MAAM,KAAK,UAAA,EAAW;AAAA,IACxB;AAEA,IAAA,IAAI,CAAC,IAAA,CAAK,aAAA,IAAiB,CAAC,KAAK,YAAA,EAAc;AAC7C,MAAA,MAAM,IAAI,MAAM,uBAAuB,CAAA;AAAA,IACzC;AAGA,IAAA,MAAM,eAAe,MAAM,IAAA,CAAK,aAAA,CAAc,SAAA,CAAU,KAAK,SAAS,CAAA;AACtE,IAAA,IAAI,CAAC,YAAA,EAAc;AACjB,MAAA,MAAM,IAAI,MAAM,kBAAkB,CAAA;AAAA,IACpC;AAGA,IAAA,MAAM,aAAA,GAAgB;AAAA,MACpB,GAAG,YAAA;AAAA,MACH,OAAA,EAAS,CAAC,GAAG,YAAA,CAAa,OAAA,EAAS;AAAA,QACjC,MAAM,WAAA,CAAY,IAAA;AAAA,QAClB,OAAA,EAAS,WAAA,CAAY,OAAA,CAAQ,GAAA,CAAI,CAAC,GAAA,MAAgE;AAAA,UAChG,OAAO,GAAA,CAAI,KAAA;AAAA,UACX,MAAM,GAAA,CAAI,IAAA;AAAA,UACV,WAAW,GAAA,CAAI;AAAA,SACjB,CAAE;AAAA,OACH;AAAA,KACH;AAGA,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,qBAAA,EAAsB;AACtD,IAAA,MAAM,IAAA,CAAK,cAAc,WAAA,CAAY;AAAA,MACnC,GAAG,IAAA,CAAK,WAAA;AAAA,MACR,OAAA,EAAS,aAAA,CAAc,OAAA,CAAQ,GAAA,CAAI,CAAA,GAAA,MAAQ;AAAA,QACzC,MAAM,GAAA,CAAI,IAAA;AAAA,QACV,SAAS,GAAA,CAAI;AAAA,OACf,CAAE;AAAA,KACJ,EAAG,qCAAU,UAAU,CAAA;AAGvB,IAAA,MAAM,gBAAA,GAAmB,OAAO,SAAA,EAAmB,UAAA,KAAqB;AACtE,MAAA,MAAM,YAAA,GAAwC;AAAA,QAC5C,GAAG,IAAA,CAAK,OAAA;AAAA,QACR,eAAe,CAAA,EAAG,IAAA,CAAK,OAAA,CAAQ,aAAa,UAAU,SAAS,CAAA;AAAA,OACjE;AACA,MAAA,MAAM,IAAA,GAAO,MAAM,IAAA,CAAK,iBAAA,CAAkB,qBAAA;AAAA,QACxC,YAAA;AAAA,QACA,UAAA,GAAa,EAAE,UAAA,EAAY,QAAA,EAAU,IAAA,EAAM,WAAA,kBAAa,IAAI,GAAA,EAAI,EAAG,aAAA,EAAe,EAAA,EAAG,GAAI;AAAA,OAC3F;AACA,MAAA,OAAO,IAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAM,YAAY,MAAM,gBAAA,CAAiB,WAAA,CAAY,IAAA,EAAM,qCAAU,UAAU,CAAA;AAG/E,IAAA,IAAI,KAAK,YAAA,EAAc;AACrB,MAAC,KAAK,YAAA,CAAqB,UAAA,CAAW,GAAA,CAAI,WAAA,CAAY,MAAM,SAAS,CAAA;AACrE,MAAC,IAAA,CAAK,aAAqB,MAAA,GAAS,aAAA;AAAA,IACtC;AAGA,IAAA,IAAI,IAAA,CAAK,UAAA,IAAc,IAAA,CAAK,QAAA,EAAU;AACpC,MAAA,MAAM,SAAA,GAAY,MAAM,IAAA,CAAK,UAAA,CAAW,KAAA,EAAM;AAC9C,MAAA,WAAA,MAAiB,IAAA,IAAQ,IAAA,CAAK,UAAA,CAAW,SAAA,CAAU,SAAS,CAAA,EAAG;AAC7D,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,UAAA,CAAW,EAAA,CAAG,IAAI,CAAA;AAC1C,QAAA,IAAI,UAAA,EAAY;AACd,UAAA,MAAM,GAAA,GAAM,IAAA,CAAK,QAAA,CAAS,SAAA,CAAU,UAAU,CAAA;AAC9C,UAAA,MAAM,UAAA,GAAa,IAAA,CAAK,QAAA,CAAS,iBAAA,CAAkB,GAAG,CAAA;AACtD,UAAA,MAAM,KAAK,YAAA,CAAa,kBAAA,CAAmB,GAAA,EAAK,UAAA,EAAY,qCAAU,UAAU,CAAA;AAAA,QAClF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,KAAA,GAAuB;AAC3B,IAAA,IAAI;AACF,MAAA,MAAM,KAAK,0BAAA,EAA2B;AACtC,MAAA,MAAM,IAAA,CAAK,SAAA,CAAU,gBAAA,CAAiB,IAAA,CAAK,OAAO,CAAA;AAAA,IACpD,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,6BAA6B,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AACnG,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,MAAA,GAAwB;AAC5B,IAAA,IAAI;AACF,MAAA,MAAM,IAAA,CAAK,UAAU,iBAAA,EAAkB;AAAA,IACzC,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,8BAA8B,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AACpG,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,QAAA,GAA0B;AAC9B,IAAA,IAAI;AACF,MAAA,MAAM,IAAA,CAAK,UAAU,mBAAA,EAAoB;AAAA,IAC3C,SAAS,KAAA,EAAO;AACd,MAAA,MAAM,OAAA,GAAU,gCAAgC,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA;AACtG,MAAA,IAAA,CAAK,gBAAgB,OAAO,CAAA;AAC5B,MAAA,MAAM,IAAI,MAAM,OAAO,CAAA;AAAA,IACzB;AAAA,EACF;AACF,CAAA;AAKO,IAAM,mBAAN,MAAqG;AAAA,EAI1G,WAAA,CACU,mBACA,SAAA,EACR;AAFQ,IAAA,IAAA,CAAA,iBAAA,GAAA,iBAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAGR,IAAA,IAAA,CAAK,aAAA,GAAgB,IAAI,aAAA,CAAc,OAAO,WAAA,KAAgB;AAC5D,MAAA,MAAM,IAAI,MAAM,4DAA4D,CAAA;AAAA,IAC9E,CAAC,CAAA;AAAA,EACH;AAAA,EAXQ,aAAA;AAAA,EACA,MAAA,uBAAa,GAAA,EAAoC;AAAA;AAAA;AAAA;AAAA,EAejD,oBAAoB,YAAA,EAAsD;AAChF,IAAA,OAAO,IAAI,aAAA,CAAc,OAAO,UAAA,KAAe;AAC7C,MAAA,MAAM,aAAA,GAAyC;AAAA,QAC7C,aAAA,EAAe,0BAAA;AAAA,QACf,YAAY,YAAA,CAAa,UAAA;AAAA,QACzB,YAAY,YAAA,CAAa,UAAA;AAAA,QACzB,QAAQ,YAAA,CAAa,MAAA;AAAA,QACrB,eAAe,YAAA,CAAa,aAAA;AAAA,QAC5B,KAAA,EAAO,IAAA;AAAA,QACP,QAAA,EAAU;AAAA,OACZ;AACA,MAAA,OAAO,MAAM,KAAK,iBAAA,CAAkB,qBAAA;AAAA,QAClC,aAAA;AAAA,QACA,UAAA,GAAa,EAAE,UAAA,EAAY,QAAA,EAAU,IAAA,EAAM,WAAA,kBAAa,IAAI,GAAA,EAAI,EAAG,aAAA,EAAe,EAAA,EAAG,GAAI;AAAA,OAC3F;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,WAAA,EAAmD;AAC1E,IAAA,MAAM,IAAA,GAAO,WAAA,CAAY,QAAA,IAAY,EAAC;AAGtC,IAAA,MAAM,gBAAiB,IAAA,CAAK,GAAG,CAAA,IAAgB,CAAA,eAAA,EAAkB,YAAY,IAAI,CAAA,CAAA;AAGjF,IAAA,MAAM,UAAA,GAAc,IAAA,CAAK,YAAY,CAAA,IAAgB,SAAA;AACrD,IAAA,MAAM,UAAA,GAAc,IAAA,CAAK,YAAY,CAAA,IAAgB,QAAA;AACrD,IAAA,MAAM,IAAA,GAAO,OAAO,IAAA,CAAK,MAAM,MAAM,QAAA,GAAW,IAAA,CAAK,MAAM,CAAA,GAAI,CAAA;AAC/D,IAAA,MAAM,WAAA,GAAe,IAAA,CAAK,aAAa,CAAA,IAAgB,YAAA;AACvD,IAAA,MAAMuB,MAAAA,GAAQ,IAAA,CAAK,OAAO,CAAA,KAAM,KAAA;AAChC,IAAA,MAAM,QAAA,GAAY,IAAA,CAAK,UAAU,CAAA,IAA4B,MAAA;AAE7D,IAAA,MAAM,OAAA,GAAmC;AAAA,MACvC,aAAA;AAAA,MACA,UAAA;AAAA,MACA,UAAA;AAAA,MACA,aAAA,EAAe;AAAA,QACb,IAAA;AAAA,QACA,WAAA;AAAA,QACA,gBAAgB;AAAC,OACnB;AAAA,MACA,KAAA,EAAAA,MAAAA;AAAA,MACA;AAAA,KACF;AAEA,IAAA,OAAO,OAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,MAAA,CACJ,EAAA,EACA,WAAA,EACiC;AACjC,IAAA,MAAM,QAAA,GAAW,GAAG,WAAA,CAAY,UAAU,IAAI,WAAA,CAAY,IAAI,GAAG,WAAA,EAAY;AAG7E,IAAA,IAAI,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA,EAAG;AAC7B,MAAA,MAAM,IAAI,MAAM,CAAA,kBAAA,EAAqB,WAAA,CAAY,IAAI,CAAA,4BAAA,EAA+B,WAAA,CAAY,UAAU,CAAA,EAAA,CAAI,CAAA;AAAA,IAChH;AAEA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,gBAAA,CAAiB,WAAW,CAAA;AACjD,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,mBAAA,CAAoB,OAAO,CAAA;AACtD,IAAA,MAAM,QAAQ,IAAI,sBAAA;AAAA,MAChB,EAAA;AAAA,MACA,IAAA;AAAA,MACA,YAAY,UAAA,IAAc,MAAA;AAAA,MAC1B,WAAA,CAAY,IAAA;AAAA,MACZ,WAAA;AAAA,MACA,OAAA;AAAA,MACA,IAAA,CAAK,iBAAA;AAAA,MACL,IAAA,CAAK,SAAA;AAAA,MACL;AAAA,KACF;AAGA,IAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,QAAA,EAAU,KAAK,CAAA;AAI/B,IAAA,MAAM,MAAM,UAAA,EAAW;AACvB,IAAA,MAAM,MAAM,0BAAA,EAA2B;AAEvC,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAA,CACJ,EAAA,EACA,OACA,WAAA,EACA,UAAA,EACA,WACA,QAAA,EACiC;AACjC,IAAA,MAAM,WAAW,CAAA,EAAG,UAAU,CAAA,CAAA,EAAI,SAAS,GAAG,WAAA,EAAY;AAC1D,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAE9C,IAAA,IAAI,CAAC,aAAA,EAAe;AAClB,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,iCAAA,EAAoC,SAAS,CAAA,4BAAA,CAA8B,CAAA;AAAA,IAC7F;AAIA,IAAA,MAAM,cAAc,UAAA,EAAW;AAE/B,IAAA,OAAO,aAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAA,CACJ,GAAA,EACA,UAAA,EACA,WACA,WAAA,EACe;AACf,IAAA,MAAM,WAAW,CAAA,EAAG,UAAU,CAAA,CAAA,EAAI,SAAS,GAAG,WAAA,EAAY;AAC1D,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAEtC,IAAA,IAAI,CAAC,KAAA,EAAO;AACV,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,kBAAA,EAAqB,SAAS,CAAA,uBAAA,EAA0B,UAAU,CAAA,uBAAA,CAAyB,CAAA;AAAA,IAC7G;AAGA,IAAA,MAAM,KAAA,CAAM,SAAS,WAAW,CAAA;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAA,CACE,GAAA,EACA,SAAA,EACA,OAAA,EACsB;AAGtB,IAAA,MAAM,aAAA,GAAgB,UAAU,aAAA,IAAiB,GAAA;AACjD,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,GAAA,CAAI,GAAA,EAAM,aAAa,CAAA;AAGlD,IAAA,IAAI,QAAA,GAAW,aAAA;AACf,IAAA,IAAI,QAAA,GAAW,aAAA;AACf,IAAA,IAAI,kBAAA,GAAgC,OAAA,CAAQ,OAAA,CAAQ,GAAA,CAAI,MAAM,KAAK,CAAA;AACnE,IAAA,IAAI,YAAA,GAA2C,MAAA;AAC/C,IAAA,IAAI,SAAA,GAAY,KAAA;AAChB,IAAA,IAAI,YAAA,GAAe,oBAAoB,aAAa,CAAA,MAAA,CAAA;AAGpD,IAAA,MAAM,YAAY,SAAA,CAAU,oBAAA,CAAqB,GAAA,CAAI,CAAA,EAAA,KAAM,GAAG,KAAK,CAAA;AACnE,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AAC/C,MAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,OAAA,CAAQ,CAAC,CAAA;AAChC,MAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,MAAA,EAAQ;AAG/B,MAAA,MAAM,UAAA,GAAa,SAAA,CAAU,QAAA,CAAS,MAAA,CAAO,WAAW,CAAA;AAExD,MAAA,IAAI,UAAA,IAAc,MAAA,CAAO,EAAA,KAAO,GAAA,EAAK;AAEnC,QAAA,MAAM,MAAA,GAAS,KAAK,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,EAAG,aAAa,CAAC,CAAA,GAAI,CAAA;AACvD,QAAA,QAAA,GAAW,MAAA;AACX,QAAA,QAAA,GAAW,CAAA;AACX,QAAA,kBAAA,GAAqB,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,EAAG,GAAA,KAAQ,QAAQ,CAAC,CAAA;AAC9D,QAAA,SAAA,GAAY,IAAA;AACZ,QAAA,YAAA,GAAe,CAAA,iCAAA,EAAoC,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA,CAAA;AAGpE,QAAA,IAAI,OAAA,CAAQ,gBAAA,IAAoB,OAAA,CAAQ,gBAAA,CAAiB,SAAS,CAAA,EAAG;AACnE,UAAA,YAAA,GAAe,CAAC,GAAG,OAAA,CAAQ,gBAAgB,CAAA;AAAA,QAC7C;AACA,QAAA;AAAA,MACF,CAAA,MAAA,IAAW,UAAA,IAAc,CAAC,GAAA,EAAK,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA,CAAE,QAAA,CAAS,MAAA,CAAO,EAAE,CAAA,EAAG;AAEnE,QAAA,MAAM,WAAA,GAAc,IAAA;AACpB,QAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,aAAa,CAAC,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AAC9E,QAAA,MAAM,SAAA,GAAY,IAAA,CAAK,KAAA,CAAM,aAAA,GAAgB,WAAW,CAAA;AAExD,QAAA,IAAI,YAAY,QAAA,EAAU;AACxB,UAAA,QAAA,GAAW,SAAA;AACX,UAAA,QAAA,GAAW,SAAA;AACX,UAAA,kBAAA,GAAqB,QAAQ,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,EAAG,GAAA,KAAQ,QAAQ,CAAC,CAAA;AAC9D,UAAA,SAAA,GAAY,KAAA;AACZ,UAAA,YAAA,GAAe,CAAA,qCAAA,EAAwC,YAAY,OAAA,CAAQ,CAAC,CAAC,CAAA,QAAA,EAAW,SAAA,CAAU,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA,CAAA;AAG5G,UAAA,IAAI,QAAQ,gBAAA,IAAoB,IAAA,CAAK,0BAA0B,OAAA,CAAQ,gBAAA,EAAkB,SAAS,CAAA,EAAG;AACnG,YAAA,YAAA,GAAe,CAAC,GAAG,OAAA,CAAQ,gBAAgB,CAAA;AAAA,UAC7C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,IAAA,IAAI,WAAW,EAAA,IAAM,SAAA,CAAU,WAAW,SAAA,CAAU,OAAA,CAAQ,SAAS,CAAA,EAAG;AACtE,MAAA,KAAA,MAAW,KAAA,IAAS,UAAU,OAAA,EAAS;AAErC,QAAA,MAAM,eAAe,KAAA,CAAM,OAAA,CAAQ,GAAA,CAAI,CAAA,GAAA,KAAO,IAAI,KAAK,CAAA;AACvD,QAAA,IAAI,WAAA,GAAc,CAAA;AAClB,QAAA,IAAI,uBAAiC,EAAC;AAGtC,QAAA,KAAA,IAAS,MAAA,GAAS,CAAA,EAAG,MAAA,GAAS,YAAA,CAAa,QAAQ,MAAA,EAAA,EAAU;AAC3D,UAAA,MAAM,QAAA,GAAW,aAAa,MAAM,CAAA;AACpC,UAAA,IAAI,OAAA,GAAU,KAAA;AAEd,UAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AAC/C,YAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,OAAA,CAAQ,CAAC,CAAA;AAChC,YAAA,IAAI,CAAC,MAAA,IAAU,CAAC,MAAA,CAAO,MAAA,EAAQ;AAE/B,YAAA,IAAI,MAAA,CAAO,WAAA,KAAgB,QAAA,IAAY,MAAA,CAAO,OAAO,GAAA,EAAK;AACxD,cAAA,oBAAA,CAAqB,KAAK,CAAC,CAAA;AAC3B,cAAA,OAAA,GAAU,IAAA;AAEV,cAAA,MAAM,cAAA,GAAiB,GAAA;AACvB,cAAA,WAAA,IAAe,cAAA;AACf,cAAA;AAAA,YACF;AAAA,UACF;AAGA,UAAA,IAAI,CAAC,OAAA,EAAS;AACZ,YAAA;AAAA,UACF;AAAA,QACF;AAGA,QAAA,IAAI,oBAAA,CAAqB,SAAS,CAAA,EAAG;AACnC,UAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,GAAA,CAAI,GAAG,aAAa,CAAC,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AAC9E,UAAA,MAAM,SAAA,GAAY,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,KAAA,CAAM,aAAA,GAAgB,WAAW,CAAC,CAAA;AAGrE,UAAA,IAAI,YAAY,QAAA,EAAU;AACxB,YAAA,QAAA,GAAW,SAAA;AACX,YAAA,QAAA,GAAW,SAAA;AACX,YAAA,kBAAA,GAAqB,OAAA,CAAQ,QAAQ,GAAA,CAAI,CAAC,GAAG,GAAA,KAAQ,oBAAA,CAAqB,QAAA,CAAS,GAAG,CAAC,CAAA;AAEvF,YAAA,SAAA,GAAY,KAAA;AACZ,YAAA,YAAA,GAAe,CAAA,cAAA,EAAiB,KAAA,CAAM,IAAI,CAAA,eAAA,EACvB,WAAA,CAAY,OAAA,CAAQ,CAAC,CAAC,CAAA,QAAA,EAAW,SAAA,CAAU,OAAA,CAAQ,CAAC,CAAC,CAAA,CAAA,CAAA;AAGxE,YAAA,IAAI,QAAQ,gBAAA,IAAoB,IAAA,CAAK,qBAAqB,OAAA,CAAQ,gBAAA,EAAkB,KAAK,CAAA,EAAG;AAC1F,cAAA,YAAA,GAAe,CAAC,GAAG,OAAA,CAAQ,gBAAgB,CAAA;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,IAAA,OAAO;AAAA,MACL,cAAA,EAAgB,kBAAA;AAAA,MAChB,IAAA,EAAM,QAAA;AAAA,MACN,IAAA,EAAM,QAAA;AAAA,MACN,gBAAA,EAAkB,YAAA;AAAA,MAClB,KAAA,EAAO,SAAA;AAAA,MACP,QAAA,EAAU;AAAA,KACZ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,yBAAA,CACN,kBACA,SAAA,EACS;AACT,IAAA,MAAM,YAAY,SAAA,CAAU,oBAAA;AAC5B,IAAA,IAAI,gBAAA,CAAiB,MAAA,GAAS,SAAA,CAAU,MAAA,EAAQ,OAAO,KAAA;AAEvD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,gBAAA,CAAiB,QAAQ,CAAA,EAAA,EAAK;AAChD,MAAA,MAAM,SAAA,GAAY,iBAAiB,CAAC,CAAA;AACpC,MAAA,MAAM,KAAA,GAAQ,UAAU,CAAC,CAAA;AAEzB,MAAA,IAAI,CAAC,SAAA,IAAa,CAAC,KAAA,EAAO,OAAO,KAAA;AACjC,MAAA,IAAI,SAAA,CAAU,WAAA,KAAgB,KAAA,CAAM,KAAA,EAAO,OAAO,KAAA;AAGlD,MAAA,MAAM,MAAA,GAAS,MAAM,IAAA,IAAQ,KAAA;AAC7B,MAAA,IAAI,SAAA,CAAU,IAAA,KAAS,MAAA,EAAQ,OAAO,KAAA;AAAA,IACxC;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAA,CACN,kBACA,KAAA,EACS;AACT,IAAA,IAAI,gBAAA,CAAiB,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,QAAQ,OAAO,KAAA;AAE3D,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,gBAAA,CAAiB,QAAQ,CAAA,EAAA,EAAK;AAChD,MAAA,MAAM,SAAA,GAAY,iBAAiB,CAAC,CAAA;AACpC,MAAA,MAAM,QAAA,GAAW,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAA;AAEhC,MAAA,IAAI,CAAC,SAAA,IAAa,CAAC,QAAA,EAAU,OAAO,KAAA;AACpC,MAAA,IAAI,SAAA,CAAU,WAAA,KAAgB,QAAA,CAAS,KAAA,EAAO,OAAO,KAAA;AAGrD,MAAA,MAAM,SAAA,GAAY,SAAS,IAAA,IAAQ,KAAA;AACnC,MAAA,IAAI,SAAA,CAAU,IAAA,KAAS,SAAA,EAAW,OAAO,KAAA;AAAA,IAC3C;AAEA,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAA,CACJ,GAAA,EACA,KAAA,EACA,WAAA,EACA,YACA,SAAA,EACe;AAIV,EACP;AACF,CAAA;;;ACthCO,SAAS,sBAAsB,SAAA,EAA8B;AACnE,EAAA,OAAO,SAAS,OAAA,GAAoB;AACnC,IAAA,MAAM,UAAA,GAAa,UAAU,qBAAA,EAAsB;AAEnD,IAAA,IAAI,CAAC,UAAA,IAAc,CAAC,UAAA,CAAW,QAAA,EAAU;AACxC,MAAA,OAAO,IAAA;AAAA,IACR;AAEA,IAAA,OAAO,UAAA,CAAW,aAAA;AAAA,EACnB,CAAA;AACD;;;ACTe,SAAR,QAAA,CAA0B,EAAA,EAAc,MAAA,GAAmC,EAAC,EAAG;AACrF,EAAA,IAAI,OAAO,KAAA,EAAO;AACjB,IAAA,OAAA,CAAQ,GAAA,CAAI,0CAA0C,MAAM,CAAA;AAAA,EAC7D;AAGA,EAAA,MAAM,iBAAA,GAAoB,IAAI,iBAAA,EAAkB;AAChD,EAAA,MAAM,SAAA,GAAY,IAAI,iBAAA,CAAkB,iBAAiB,CAAA;AACzD,EAAA,MAAM,gBAAA,GAAmB,IAAI,gBAAA,CAAiB,iBAAA,EAAmB,SAAS,CAAA;AAG1E,EAAA,MAAM,WAAA,GAAc,sBAAsB,SAAS,CAAA;AAInD,EAAA,OAAO;AAAA,IACN,OAAA,EAAS;AAAA,MACR;AAAA,QACC,IAAA,EAAM,YAAA;AAAA,QACN,MAAA,EAAQ,gBAAA;AAAA,QACR,OAAA,EAAS;AAAA;AACV,KACD;AAAA,IACA,SAAA,EAAW;AAAA,MACV;AAAA,QACC,MAAA,EAAQ;AAAA,UACP,IAAA,EAAM,SAAA;AAAA,UACN,OAAA,EAAS,CAAA;AAAA,UACT,KAAA,EAAO,CAAA;AAAA;AAAA,UACP,UAAA,EAAY;AAAA,YACX,SAAA,EAAW,QAAA;AAAA,YACX,WAAA,EAAaC,SAAAA;AAAA,YACb,QAAA,EAAU,IAAA;AAAA,YACV,UAAA,EAAY;AAAA,WACb;AAAA,UACA,cAAA,EAAgB;AAAA;AACjB;AACD,KACD;AAAA,IACA,YAAY,EAAC;AAAA;AAAA,IAEb,iBAAA;AAAA,IACA;AAAA,GACD;AACD","file":"plugin.js","sourcesContent":["import type { Libp2p } from '@libp2p/interface';\r\nimport type { IKeyNetwork } from '@optimystic/db-core';\r\nimport { Libp2pKeyPeerNetwork } from '@optimystic/db-p2p';\r\nimport { createLibp2pNode } from '@optimystic/db-p2p';\r\nimport type { LibP2PNodeOptions, CustomImplementationRegistry } from '../types.js';\r\n\r\n/**\r\n * Global registry for custom implementations\r\n */\r\nconst customRegistry: CustomImplementationRegistry = {\r\n transactors: new Map(),\r\n keyNetworks: new Map(),\r\n};\r\n\r\n/**\r\n * Register a custom key network implementation\r\n */\r\nexport function registerKeyNetwork(name: string, implementation: new (...args: any[]) => IKeyNetwork): void {\r\n customRegistry.keyNetworks.set(name, implementation);\r\n}\r\n\r\n/**\r\n * Register a custom transactor implementation\r\n */\r\nexport function registerTransactor(name: string, implementation: new (...args: any[]) => any): void {\r\n customRegistry.transactors.set(name, implementation);\r\n}\r\n\r\n/**\r\n * Create a key network instance based on configuration\r\n */\r\nexport async function createKeyNetwork(\r\n type: 'libp2p' | 'test' | string,\r\n libp2p?: Libp2p,\r\n libp2pOptions?: LibP2PNodeOptions\r\n): Promise<IKeyNetwork> {\r\n switch (type) {\r\n case 'libp2p':\r\n return await createLibp2pKeyNetwork(libp2p, libp2pOptions);\r\n\r\n case 'test':\r\n return await createTestKeyNetwork();\r\n\r\n default:\r\n return await createCustomKeyNetwork(type);\r\n }\r\n}\r\n\r\n/**\r\n * Create a libp2p-based key network\r\n */\r\nasync function createLibp2pKeyNetwork(\r\n existingLibp2p?: Libp2p,\r\n options?: LibP2PNodeOptions\r\n): Promise<IKeyNetwork> {\r\n let libp2p: Libp2p;\r\n\r\n if (existingLibp2p) {\r\n libp2p = existingLibp2p;\r\n } else {\r\n // Create a new libp2p node with default options\r\n const nodeOptions = {\r\n port: options?.port ?? 0, // Use random port if not specified\r\n networkName: options?.networkName ?? 'optimystic',\r\n bootstrapNodes: options?.bootstrapNodes ?? [],\r\n };\r\n\r\n libp2p = await createLibp2pNode(nodeOptions);\r\n }\r\n\r\n return new Libp2pKeyPeerNetwork(libp2p);\r\n}\r\n\r\n/**\r\n * Create a test key network (for testing purposes)\r\n */\r\nasync function createTestKeyNetwork(): Promise<IKeyNetwork> {\r\n // Provide a local stub to avoid build-time dependency on non-existent test utilities\r\n return {\r\n async findCoordinator() {\r\n throw new Error('Test key network is not available in this build.');\r\n },\r\n async findCluster() {\r\n throw new Error('Test key network is not available in this build.');\r\n },\r\n };\r\n}\r\n\r\n/**\r\n * Create a custom key network implementation\r\n */\r\nasync function createCustomKeyNetwork(name: string): Promise<IKeyNetwork> {\r\n const CustomKeyNetwork = customRegistry.keyNetworks.get(name);\r\n if (!CustomKeyNetwork) {\r\n throw new Error(`Custom key network '${name}' not found. Register it first using registerKeyNetwork().`);\r\n }\r\n\r\n return new CustomKeyNetwork();\r\n}\r\n\r\n/**\r\n * Get the custom implementation registry (for testing/debugging)\r\n */\r\nexport function getCustomRegistry(): CustomImplementationRegistry {\r\n return customRegistry;\r\n}\r\n","import type { ITransactor, CollectionId } from '@optimystic/db-core';\r\nimport { Tree } from '@optimystic/db-core';\r\nimport { NetworkTransactor } from '@optimystic/db-core';\r\nimport type { RowData, ParsedOptimysticOptions, TransactionState } from '../types.js';\r\nimport { createKeyNetwork } from './key-network.js';\r\nimport type { IRepo } from '@optimystic/db-core';\r\nimport type { PeerId, Libp2p } from '@libp2p/interface';\r\n\r\n/**\r\n * Factory for creating and managing tree collections\r\n */\r\nexport class CollectionFactory {\r\n private transactors = new Map<string, ITransactor>();\r\n private libp2pNodes = new Map<string, { node: Libp2p; coordinatedRepo: IRepo }>();\r\n\r\n /**\r\n * Create or get a tree collection\r\n * Collections are only cached within a transaction to ensure proper isolation\r\n */\r\n async createOrGetCollection(\r\n options: ParsedOptimysticOptions,\r\n txnState?: TransactionState\r\n ): Promise<Tree<string, RowData>> {\r\n const collectionKey = this.getCollectionKey(options);\r\n\r\n // Check transaction-specific cache (only cache within transaction scope)\r\n if (txnState?.isActive && txnState.collections.has(collectionKey)) {\r\n return txnState.collections.get(collectionKey)!;\r\n }\r\n\r\n // Create new collection\r\n const transactor = await this.getOrCreateTransactor(options);\r\n const collectionId = this.parseCollectionId(options.collectionUri);\r\n\r\n const compare = (a: string, b: string): -1 | 0 | 1 => (a < b ? -1 : a > b ? 1 : 0);\r\n\r\n // Schema tree uses simple [key, value] tuples, not RowData arrays\r\n const isSchemaTree = options.collectionUri === 'tree://optimystic/schema';\r\n const keyExtractor = isSchemaTree\r\n ? (entry: any) => entry[0] as string // For schema tree: [tableName, schema]\r\n : (entry: RowData) => this.extractKeyFromEntry(entry); // For data trees: extract from RowData\r\n\r\n const collection = await Tree.createOrOpen<string, RowData>(\r\n transactor,\r\n collectionId,\r\n keyExtractor,\r\n compare // Total order\r\n );\r\n\r\n // Store in transaction-specific cache (if we have an active transaction)\r\n if (txnState?.isActive) {\r\n txnState.collections.set(collectionKey, collection);\r\n }\r\n\r\n return collection;\r\n }\r\n\r\n /**\r\n * Create a transactor for the given configuration\r\n */\r\n async createTransactor(options: ParsedOptimysticOptions): Promise<ITransactor> {\r\n switch (options.transactor) {\r\n case 'network':\r\n return await this.createNetworkTransactor(options);\r\n\r\n case 'local':\r\n return await this.createLocalTransactor();\r\n\r\n case 'test':\r\n return await this.createTestTransactor();\r\n\r\n default:\r\n return await this.createCustomTransactor(options.transactor);\r\n }\r\n }\r\n\r\n /**\r\n * Get or create a transactor (with caching)\r\n */\r\n async getOrCreateTransactor(options: ParsedOptimysticOptions): Promise<ITransactor> {\r\n const transactorKey = this.getTransactorKey(options);\r\n\r\n if (this.transactors.has(transactorKey)) {\r\n return this.transactors.get(transactorKey)!;\r\n }\r\n\r\n const transactor = await this.createTransactor(options);\r\n this.transactors.set(transactorKey, transactor);\r\n return transactor;\r\n }\r\n\r\n /**\r\n * Create a network transactor\r\n */\r\n private async createNetworkTransactor(options: ParsedOptimysticOptions): Promise<ITransactor> {\r\n // Create or get libp2p node\r\n const nodeKey = this.getNodeKey(options);\r\n let nodeInfo = this.libp2pNodes.get(nodeKey);\r\n\r\n if (!nodeInfo) {\r\n // Create a new libp2p node with all necessary services\r\n const { createLibp2pNode } = await import('@optimystic/db-p2p');\r\n\r\n const node = await createLibp2pNode({\r\n port: options.libp2pOptions?.port ?? 0,\r\n networkName: options.libp2pOptions?.networkName ?? 'optimystic',\r\n bootstrapNodes: options.libp2pOptions?.bootstrapNodes ?? [],\r\n storageType: 'memory',\r\n fretProfile: 'edge',\r\n clusterSize: 1,\r\n clusterPolicy: {\r\n allowDownsize: true,\r\n sizeTolerance: 1.0\r\n },\r\n arachnode: {\r\n enableRingZulu: true\r\n }\r\n });\r\n\r\n // Get the coordinatedRepo that was created by createLibp2pNode\r\n const coordinatedRepo = (node as any).coordinatedRepo as IRepo;\r\n if (!coordinatedRepo) {\r\n throw new Error('Failed to get coordinatedRepo from libp2p node');\r\n }\r\n\r\n nodeInfo = { node, coordinatedRepo };\r\n this.libp2pNodes.set(nodeKey, nodeInfo);\r\n }\r\n\r\n const { node, coordinatedRepo } = nodeInfo;\r\n\r\n // Create Libp2pKeyPeerNetwork which implements both IKeyNetwork and IPeerNetwork\r\n const { Libp2pKeyPeerNetwork, RepoClient } = await import('@optimystic/db-p2p');\r\n const keyNetwork = new Libp2pKeyPeerNetwork(node);\r\n const protocolPrefix = `/optimystic/${options.libp2pOptions?.networkName ?? 'optimystic'}`;\r\n\r\n const getRepo = (peerId: PeerId): IRepo => {\r\n // If it's the local peer, return the coordinated repo\r\n if (peerId.toString() === node.peerId.toString()) {\r\n return coordinatedRepo;\r\n }\r\n // For remote peers, create a RepoClient\r\n return RepoClient.create(peerId, keyNetwork, protocolPrefix);\r\n };\r\n\r\n return new NetworkTransactor({\r\n timeoutMs: 30_000,\r\n abortOrCancelTimeoutMs: 5_000,\r\n keyNetwork,\r\n getRepo,\r\n });\r\n }\r\n\r\n /**\r\n * Create a local transactor (in-memory, single-node, no network)\r\n */\r\n private async createLocalTransactor(): Promise<ITransactor> {\r\n const { StorageRepo, BlockStorage, MemoryRawStorage } = await import('@optimystic/db-p2p');\r\n\r\n // Create a shared memory storage for all blocks\r\n const memoryStorage = new MemoryRawStorage();\r\n const storageRepo = new StorageRepo((blockId: string) => new BlockStorage(blockId, memoryStorage));\r\n\r\n // LocalTransactor implementation (simple wrapper around StorageRepo)\r\n return {\r\n async get(blockGets) {\r\n return await storageRepo.get(blockGets);\r\n },\r\n async getStatus(_trxRefs) {\r\n throw new Error('getStatus not implemented in local transactor');\r\n },\r\n async pend(request) {\r\n return await storageRepo.pend(request);\r\n },\r\n async commit(request) {\r\n return await storageRepo.commit(request);\r\n },\r\n async cancel(trxRef) {\r\n return await storageRepo.cancel(trxRef);\r\n },\r\n } as ITransactor;\r\n }\r\n\r\n /**\r\n * Create a test transactor (in-memory, single-node)\r\n */\r\n private async createTestTransactor(): Promise<ITransactor> {\r\n const { StorageRepo, BlockStorage, MemoryRawStorage } = await import('@optimystic/db-p2p');\r\n\r\n // Create a shared memory storage for all blocks\r\n const memoryStorage = new MemoryRawStorage();\r\n\r\n const storageRepo = new StorageRepo((blockId) => new BlockStorage(blockId, memoryStorage));\r\n\r\n // Simple local transactor that wraps StorageRepo\r\n return {\r\n async get(blockGets) {\r\n return await storageRepo.get(blockGets);\r\n },\r\n async getStatus(_trxRefs) {\r\n throw new Error('getStatus not implemented in test transactor');\r\n },\r\n async pend(request) {\r\n return await storageRepo.pend(request);\r\n },\r\n async commit(request) {\r\n return await storageRepo.commit(request);\r\n },\r\n async cancel(trxRef) {\r\n return await storageRepo.cancel(trxRef);\r\n },\r\n } as ITransactor;\r\n }\r\n\r\n /**\r\n * Create a custom transactor\r\n */\r\n private async createCustomTransactor(name: string): Promise<ITransactor> {\r\n // This would use the custom registry from key-network.ts\r\n const { getCustomRegistry } = await import('./key-network.js');\r\n const registry = getCustomRegistry();\r\n\r\n const CustomTransactor = registry.transactors.get(name);\r\n if (!CustomTransactor) {\r\n throw new Error(`Custom transactor '${name}' not found. Register it first using registerTransactor().`);\r\n }\r\n\r\n return new CustomTransactor();\r\n }\r\n\r\n /**\r\n * Parse collection URI to extract collection ID\r\n */\r\n private parseCollectionId(uri: string): CollectionId {\r\n if (!uri) {\r\n throw new Error('Collection URI is required');\r\n }\r\n // Parse URIs like 'tree://mydb/users' or just 'users'\r\n if (uri.startsWith('tree://')) {\r\n const path = uri.substring(7); // Remove 'tree://'\r\n const parts = path.split('/');\r\n if (parts.length >= 2) {\r\n return parts[1]! as unknown as CollectionId; // collection name part\r\n }\r\n return path as unknown as CollectionId;\r\n }\r\n return uri as unknown as CollectionId;\r\n }\r\n\r\n /**\r\n * Extract key from entry\r\n * Entry format: [primaryKey, encodedRow]\r\n */\r\n private extractKeyFromEntry(entry: RowData): string {\r\n return entry[0];\r\n }\r\n\r\n /**\r\n * Generate a unique key for collection caching\r\n */\r\n private getCollectionKey(options: ParsedOptimysticOptions): string {\r\n return `${options.collectionUri}:${options.transactor}:${options.keyNetwork}`;\r\n }\r\n\r\n /**\r\n * Generate a unique key for transactor caching\r\n */\r\n private getTransactorKey(options: ParsedOptimysticOptions): string {\r\n return `${options.transactor}:${options.keyNetwork}`;\r\n }\r\n\r\n /**\r\n * Get the peer ID from the current libp2p node (if available)\r\n */\r\n getPeerId(options: ParsedOptimysticOptions): string | undefined {\r\n const nodeKey = this.getNodeKey(options);\r\n const nodeInfo = this.libp2pNodes.get(nodeKey);\r\n return nodeInfo?.node.peerId.toString();\r\n }\r\n\r\n /**\r\n * Register an existing libp2p node for use by the factory.\r\n * This allows tests to inject pre-created nodes instead of having the factory create new ones.\r\n */\r\n registerLibp2pNode(networkName: string, node: Libp2p, coordinatedRepo: IRepo): void {\r\n const nodeKey = `${networkName}:0`; // Use port 0 as default for registered nodes\r\n this.libp2pNodes.set(nodeKey, { node, coordinatedRepo });\r\n }\r\n\r\n /**\r\n * Register an existing transactor for use by the factory.\r\n * This allows tests to inject pre-created transactors.\r\n */\r\n registerTransactor(key: string, transactor: ITransactor): void {\r\n this.transactors.set(key, transactor);\r\n }\r\n\r\n /**\r\n * Generate a unique key for libp2p node caching\r\n */\r\n private getNodeKey(options: ParsedOptimysticOptions): string {\r\n const networkName = options.libp2pOptions?.networkName ?? 'optimystic';\r\n const port = options.libp2pOptions?.port ?? 0;\r\n return `${networkName}:${port}`;\r\n }\r\n\r\n /**\r\n * Clear all cached transactors (useful for testing or cleanup)\r\n * Note: Collections are only cached within transactions, not globally\r\n */\r\n clearCache(): void {\r\n this.transactors.clear();\r\n }\r\n\r\n /**\r\n * Shutdown all libp2p nodes\r\n */\r\n async shutdown(): Promise<void> {\r\n for (const [key, { node }] of this.libp2pNodes.entries()) {\r\n console.log(`Stopping libp2p node: ${key}`);\r\n await node.stop();\r\n }\r\n this.libp2pNodes.clear();\r\n }\r\n\r\n /**\r\n * Sync a collection (call collection.sync())\r\n */\r\n async syncCollection(collection: Tree<string, RowData>): Promise<void> {\r\n // The Tree class doesn't expose sync directly, but we can call updateAndSync\r\n // This is a placeholder - we'd need to check the actual Tree API\r\n // await collection.updateAndSync();\r\n\r\n // For now, we'll assume the sync happens as part of the replace operation\r\n // which calls updateAndSync internally\r\n }\r\n}\r\n","import { baseX } from './base.js'\n\nexport const base58btc = baseX({\n name: 'base58btc',\n prefix: 'z',\n alphabet: '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n})\n\nexport const base58flickr = baseX({\n name: 'base58flickr',\n prefix: 'Z',\n alphabet: '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n})\n","export const empty = new Uint8Array(0)\n\nexport function toHex (d: Uint8Array): string {\n return d.reduce((hex, byte) => hex + byte.toString(16).padStart(2, '0'), '')\n}\n\nexport function fromHex (hex: string): Uint8Array {\n const hexes = hex.match(/../g)\n return hexes != null ? new Uint8Array(hexes.map(b => parseInt(b, 16))) : empty\n}\n\nexport function equals (aa: Uint8Array, bb: Uint8Array): boolean {\n if (aa === bb) { return true }\n if (aa.byteLength !== bb.byteLength) {\n return false\n }\n\n for (let ii = 0; ii < aa.byteLength; ii++) {\n if (aa[ii] !== bb[ii]) {\n return false\n }\n }\n\n return true\n}\n\nexport function coerce (o: ArrayBufferView | ArrayBuffer | Uint8Array): Uint8Array {\n if (o instanceof Uint8Array && o.constructor.name === 'Uint8Array') { return o }\n if (o instanceof ArrayBuffer) { return new Uint8Array(o) }\n if (ArrayBuffer.isView(o)) {\n return new Uint8Array(o.buffer, o.byteOffset, o.byteLength)\n }\n throw new Error('Unknown type, must be binary type')\n}\n\nexport function isBinary (o: unknown): o is ArrayBuffer | ArrayBufferView {\n return o instanceof ArrayBuffer || ArrayBuffer.isView(o)\n}\n\nexport function fromString (str: string): Uint8Array {\n return new TextEncoder().encode(str)\n}\n\nexport function toString (b: Uint8Array): string {\n return new TextDecoder().decode(b)\n}\n","/* eslint-disable */\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n/**\n * @param {string} ALPHABET\n * @param {any} name\n */\nfunction base (ALPHABET, name) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256);\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255;\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i);\n var xc = x.charCodeAt(0);\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i;\n }\n var BASE = ALPHABET.length;\n var LEADER = ALPHABET.charAt(0);\n var FACTOR = Math.log(BASE) / Math.log(256); // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE); // log(256) / log(BASE), rounded up\n /**\n * @param {any[] | Iterable<number>} source\n */\n function encode (source) {\n // @ts-ignore\n if (source instanceof Uint8Array) ; else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength);\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source);\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0;\n var length = 0;\n var pbegin = 0;\n var pend = source.length;\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++;\n zeroes++;\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0;\n var b58 = new Uint8Array(size);\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin];\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0;\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0;\n b58[it1] = (carry % BASE) >>> 0;\n carry = (carry / BASE) >>> 0;\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i;\n pbegin++;\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length;\n while (it2 !== size && b58[it2] === 0) {\n it2++;\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes);\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]); }\n return str\n }\n /**\n * @param {string | string[]} source\n */\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0;\n // Skip leading spaces.\n if (source[psz] === ' ') { return }\n // Skip and count leading '1's.\n var zeroes = 0;\n var length = 0;\n while (source[psz] === LEADER) {\n zeroes++;\n psz++;\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0; // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size);\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)];\n // Invalid character\n if (carry === 255) { return }\n var i = 0;\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0;\n b256[it3] = (carry % 256) >>> 0;\n carry = (carry / 256) >>> 0;\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i;\n psz++;\n }\n // Skip trailing spaces.\n if (source[psz] === ' ') { return }\n // Skip leading zeroes in b256.\n var it4 = size - length;\n while (it4 !== size && b256[it4] === 0) {\n it4++;\n }\n var vch = new Uint8Array(zeroes + (size - it4));\n var j = zeroes;\n while (it4 !== size) {\n vch[j++] = b256[it4++];\n }\n return vch\n }\n /**\n * @param {string | string[]} string\n */\n function decode (string) {\n var buffer = decodeUnsafe(string);\n if (buffer) { return buffer }\n throw new Error(`Non-${name} character`)\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nvar src = base;\n\nvar _brrp__multiformats_scope_baseX = src;\n\nexport default _brrp__multiformats_scope_baseX;\n","import { coerce } from '../bytes.js'\nimport basex from '../vendor/base-x.js'\nimport type { BaseCodec, BaseDecoder, BaseEncoder, CombobaseDecoder, Multibase, MultibaseCodec, MultibaseDecoder, MultibaseEncoder, UnibaseDecoder } from './interface.js'\n\ninterface EncodeFn { (bytes: Uint8Array): string }\ninterface DecodeFn { (text: string): Uint8Array }\n\n/**\n * Class represents both BaseEncoder and MultibaseEncoder meaning it\n * can be used to encode to multibase or base encode without multibase\n * prefix.\n */\nclass Encoder<Base extends string, Prefix extends string> implements MultibaseEncoder<Prefix>, BaseEncoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n }\n\n encode (bytes: Uint8Array): Multibase<Prefix> {\n if (bytes instanceof Uint8Array) {\n return `${this.prefix}${this.baseEncode(bytes)}`\n } else {\n throw Error('Unknown type, must be binary type')\n }\n }\n}\n\n/**\n * Class represents both BaseDecoder and MultibaseDecoder so it could be used\n * to decode multibases (with matching prefix) or just base decode strings\n * with corresponding base encoding.\n */\nclass Decoder<Base extends string, Prefix extends string> implements MultibaseDecoder<Prefix>, UnibaseDecoder<Prefix>, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseDecode: DecodeFn\n private readonly prefixCodePoint: number\n\n constructor (name: Base, prefix: Prefix, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n const prefixCodePoint = prefix.codePointAt(0)\n /* c8 ignore next 3 */\n if (prefixCodePoint === undefined) {\n throw new Error('Invalid prefix character')\n }\n this.prefixCodePoint = prefixCodePoint\n this.baseDecode = baseDecode\n }\n\n decode (text: string): Uint8Array {\n if (typeof text === 'string') {\n if (text.codePointAt(0) !== this.prefixCodePoint) {\n throw Error(`Unable to decode multibase string ${JSON.stringify(text)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`)\n }\n return this.baseDecode(text.slice(this.prefix.length))\n } else {\n throw Error('Can only multibase decode strings')\n }\n }\n\n or<OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n}\n\ntype Decoders<Prefix extends string> = Record<Prefix, UnibaseDecoder<Prefix>>\n\nclass ComposedDecoder<Prefix extends string> implements MultibaseDecoder<Prefix>, CombobaseDecoder<Prefix> {\n readonly decoders: Decoders<Prefix>\n\n constructor (decoders: Decoders<Prefix>) {\n this.decoders = decoders\n }\n\n or <OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n\n decode (input: string): Uint8Array {\n const prefix = input[0] as Prefix\n const decoder = this.decoders[prefix]\n if (decoder != null) {\n return decoder.decode(input)\n } else {\n throw RangeError(`Unable to decode multibase string ${JSON.stringify(input)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`)\n }\n }\n}\n\nexport function or <L extends string, R extends string> (left: UnibaseDecoder<L> | CombobaseDecoder<L>, right: UnibaseDecoder<R> | CombobaseDecoder<R>): ComposedDecoder<L | R> {\n return new ComposedDecoder({\n ...(left.decoders ?? { [(left as UnibaseDecoder<L>).prefix]: left }),\n ...(right.decoders ?? { [(right as UnibaseDecoder<R>).prefix]: right })\n } as Decoders<L | R>)\n}\n\nexport class Codec<Base extends string, Prefix extends string> implements MultibaseCodec<Prefix>, MultibaseEncoder<Prefix>, MultibaseDecoder<Prefix>, BaseCodec, BaseEncoder, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n readonly baseDecode: DecodeFn\n readonly encoder: Encoder<Base, Prefix>\n readonly decoder: Decoder<Base, Prefix>\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n this.baseDecode = baseDecode\n this.encoder = new Encoder(name, prefix, baseEncode)\n this.decoder = new Decoder(name, prefix, baseDecode)\n }\n\n encode (input: Uint8Array): string {\n return this.encoder.encode(input)\n }\n\n decode (input: string): Uint8Array {\n return this.decoder.decode(input)\n }\n}\n\nexport function from <Base extends string, Prefix extends string> ({ name, prefix, encode, decode }: { name: Base, prefix: Prefix, encode: EncodeFn, decode: DecodeFn }): Codec<Base, Prefix> {\n return new Codec(name, prefix, encode, decode)\n}\n\nexport function baseX <Base extends string, Prefix extends string> ({ name, prefix, alphabet }: { name: Base, prefix: Prefix, alphabet: string }): Codec<Base, Prefix> {\n const { encode, decode } = basex(alphabet, name)\n return from({\n prefix,\n name,\n encode,\n decode: (text: string): Uint8Array => coerce(decode(text))\n })\n}\n\nfunction decode (string: string, alphabetIdx: Record<string, number>, bitsPerChar: number, name: string): Uint8Array {\n // Count the padding bytes:\n let end = string.length\n while (string[end - 1] === '=') {\n --end\n }\n\n // Allocate the output:\n const out = new Uint8Array((end * bitsPerChar / 8) | 0)\n\n // Parse the data:\n let bits = 0 // Number of bits currently in the buffer\n let buffer = 0 // Bits waiting to be written out, MSB first\n let written = 0 // Next byte to write\n for (let i = 0; i < end; ++i) {\n // Read one character from the string:\n const value = alphabetIdx[string[i]]\n if (value === undefined) {\n throw new SyntaxError(`Non-${name} character`)\n }\n\n // Append the bits to the buffer:\n buffer = (buffer << bitsPerChar) | value\n bits += bitsPerChar\n\n // Write out some bits if the buffer has a byte's worth:\n if (bits >= 8) {\n bits -= 8\n out[written++] = 0xff & (buffer >> bits)\n }\n }\n\n // Verify that we have received just enough bits:\n if (bits >= bitsPerChar || (0xff & (buffer << (8 - bits))) !== 0) {\n throw new SyntaxError('Unexpected end of data')\n }\n\n return out\n}\n\nfunction encode (data: Uint8Array, alphabet: string, bitsPerChar: number): string {\n const pad = alphabet[alphabet.length - 1] === '='\n const mask = (1 << bitsPerChar) - 1\n let out = ''\n\n let bits = 0 // Number of bits currently in the buffer\n let buffer = 0 // Bits waiting to be written out, MSB first\n for (let i = 0; i < data.length; ++i) {\n // Slurp data into the buffer:\n buffer = (buffer << 8) | data[i]\n bits += 8\n\n // Write out as much as we can:\n while (bits > bitsPerChar) {\n bits -= bitsPerChar\n out += alphabet[mask & (buffer >> bits)]\n }\n }\n\n // Partial character:\n if (bits !== 0) {\n out += alphabet[mask & (buffer << (bitsPerChar - bits))]\n }\n\n // Add padding characters until we hit a byte boundary:\n if (pad) {\n while (((out.length * bitsPerChar) & 7) !== 0) {\n out += '='\n }\n }\n\n return out\n}\n\nfunction createAlphabetIdx (alphabet: string): Record<string, number> {\n // Build the character lookup table:\n const alphabetIdx: Record<string, number> = {}\n for (let i = 0; i < alphabet.length; ++i) {\n alphabetIdx[alphabet[i]] = i\n }\n return alphabetIdx\n}\n\n/**\n * RFC4648 Factory\n */\nexport function rfc4648 <Base extends string, Prefix extends string> ({ name, prefix, bitsPerChar, alphabet }: { name: Base, prefix: Prefix, bitsPerChar: number, alphabet: string }): Codec<Base, Prefix> {\n const alphabetIdx = createAlphabetIdx(alphabet)\n return from({\n prefix,\n name,\n encode (input: Uint8Array): string {\n return encode(input, alphabet, bitsPerChar)\n },\n decode (input: string): Uint8Array {\n return decode(input, alphabetIdx, bitsPerChar, name)\n }\n })\n}\n","import { rfc4648 } from './base.js'\n\nexport const base32 = rfc4648({\n prefix: 'b',\n name: 'base32',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567',\n bitsPerChar: 5\n})\n\nexport const base32upper = rfc4648({\n prefix: 'B',\n name: 'base32upper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567',\n bitsPerChar: 5\n})\n\nexport const base32pad = rfc4648({\n prefix: 'c',\n name: 'base32pad',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567=',\n bitsPerChar: 5\n})\n\nexport const base32padupper = rfc4648({\n prefix: 'C',\n name: 'base32padupper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=',\n bitsPerChar: 5\n})\n\nexport const base32hex = rfc4648({\n prefix: 'v',\n name: 'base32hex',\n alphabet: '0123456789abcdefghijklmnopqrstuv',\n bitsPerChar: 5\n})\n\nexport const base32hexupper = rfc4648({\n prefix: 'V',\n name: 'base32hexupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV',\n bitsPerChar: 5\n})\n\nexport const base32hexpad = rfc4648({\n prefix: 't',\n name: 'base32hexpad',\n alphabet: '0123456789abcdefghijklmnopqrstuv=',\n bitsPerChar: 5\n})\n\nexport const base32hexpadupper = rfc4648({\n prefix: 'T',\n name: 'base32hexpadupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV=',\n bitsPerChar: 5\n})\n\nexport const base32z = rfc4648({\n prefix: 'h',\n name: 'base32z',\n alphabet: 'ybndrfg8ejkmcpqxot1uwisza345h769',\n bitsPerChar: 5\n})\n","import { baseX } from './base.js'\n\nexport const base36 = baseX({\n prefix: 'k',\n name: 'base36',\n alphabet: '0123456789abcdefghijklmnopqrstuvwxyz'\n})\n\nexport const base36upper = baseX({\n prefix: 'K',\n name: 'base36upper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n})\n","/* eslint-disable */\nvar encode_1 = encode;\n\nvar MSB = 0x80\n , REST = 0x7F\n , MSBALL = ~REST\n , INT = Math.pow(2, 31);\n\n/**\n * @param {number} num\n * @param {number[]} out\n * @param {number} offset\n */\nfunction encode(num, out, offset) {\n out = out || [];\n offset = offset || 0;\n var oldOffset = offset;\n\n while(num >= INT) {\n out[offset++] = (num & 0xFF) | MSB;\n num /= 128;\n }\n while(num & MSBALL) {\n out[offset++] = (num & 0xFF) | MSB;\n num >>>= 7;\n }\n out[offset] = num | 0;\n \n // @ts-ignore\n encode.bytes = offset - oldOffset + 1;\n \n return out\n}\n\nvar decode = read;\n\nvar MSB$1 = 0x80\n , REST$1 = 0x7F;\n\n/**\n * @param {string | any[]} buf\n * @param {number} offset\n */\nfunction read(buf, offset) {\n var res = 0\n , offset = offset || 0\n , shift = 0\n , counter = offset\n , b\n , l = buf.length;\n\n do {\n if (counter >= l) {\n // @ts-ignore\n read.bytes = 0;\n throw new RangeError('Could not decode varint')\n }\n b = buf[counter++];\n res += shift < 28\n ? (b & REST$1) << shift\n : (b & REST$1) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB$1)\n\n // @ts-ignore\n read.bytes = counter - offset;\n\n return res\n}\n\nvar N1 = Math.pow(2, 7);\nvar N2 = Math.pow(2, 14);\nvar N3 = Math.pow(2, 21);\nvar N4 = Math.pow(2, 28);\nvar N5 = Math.pow(2, 35);\nvar N6 = Math.pow(2, 42);\nvar N7 = Math.pow(2, 49);\nvar N8 = Math.pow(2, 56);\nvar N9 = Math.pow(2, 63);\n\nvar length = function (/** @type {number} */ value) {\n return (\n value < N1 ? 1\n : value < N2 ? 2\n : value < N3 ? 3\n : value < N4 ? 4\n : value < N5 ? 5\n : value < N6 ? 6\n : value < N7 ? 7\n : value < N8 ? 8\n : value < N9 ? 9\n : 10\n )\n};\n\nvar varint = {\n encode: encode_1\n , decode: decode\n , encodingLength: length\n};\n\nvar _brrp_varint = varint;\n\nexport default _brrp_varint;\n","import varint from './vendor/varint.js'\n\nexport function decode (data: Uint8Array, offset = 0): [number, number] {\n const code = varint.decode(data, offset)\n return [code, varint.decode.bytes]\n}\n\nexport function encodeTo (int: number, target: Uint8Array, offset = 0): Uint8Array {\n varint.encode(int, target, offset)\n return target\n}\n\nexport function encodingLength (int: number): number {\n return varint.encodingLength(int)\n}\n","import { coerce, equals as equalBytes } from '../bytes.js'\nimport * as varint from '../varint.js'\nimport type { MultihashDigest } from './interface.js'\n\n/**\n * Creates a multihash digest.\n */\nexport function create <Code extends number> (code: Code, digest: Uint8Array): Digest<Code, number> {\n const size = digest.byteLength\n const sizeOffset = varint.encodingLength(code)\n const digestOffset = sizeOffset + varint.encodingLength(size)\n\n const bytes = new Uint8Array(digestOffset + size)\n varint.encodeTo(code, bytes, 0)\n varint.encodeTo(size, bytes, sizeOffset)\n bytes.set(digest, digestOffset)\n\n return new Digest(code, size, digest, bytes)\n}\n\n/**\n * Turns bytes representation of multihash digest into an instance.\n */\nexport function decode (multihash: Uint8Array): MultihashDigest {\n const bytes = coerce(multihash)\n const [code, sizeOffset] = varint.decode(bytes)\n const [size, digestOffset] = varint.decode(bytes.subarray(sizeOffset))\n const digest = bytes.subarray(sizeOffset + digestOffset)\n\n if (digest.byteLength !== size) {\n throw new Error('Incorrect length')\n }\n\n return new Digest(code, size, digest, bytes)\n}\n\nexport function equals (a: MultihashDigest, b: unknown): b is MultihashDigest {\n if (a === b) {\n return true\n } else {\n const data = b as { code?: unknown, size?: unknown, bytes?: unknown }\n\n return (\n a.code === data.code &&\n a.size === data.size &&\n data.bytes instanceof Uint8Array &&\n equalBytes(a.bytes, data.bytes)\n )\n }\n}\n\n/**\n * Represents a multihash digest which carries information about the\n * hashing algorithm and an actual hash digest.\n */\nexport class Digest<Code extends number, Size extends number> implements MultihashDigest {\n readonly code: Code\n readonly size: Size\n readonly digest: Uint8Array\n readonly bytes: Uint8Array\n\n /**\n * Creates a multihash digest.\n */\n constructor (code: Code, size: Size, digest: Uint8Array, bytes: Uint8Array) {\n this.code = code\n this.size = size\n this.digest = digest\n this.bytes = bytes\n }\n}\n\n/**\n * Used to check that the passed multihash has the passed code\n */\nexport function hasCode <T extends number> (digest: MultihashDigest, code: T): digest is MultihashDigest<T> {\n return digest.code === code\n}\n","import { coerce } from '../bytes.js'\nimport * as Digest from './digest.js'\nimport type { DigestOptions } from './hasher.js'\n\nconst code: 0x0 = 0x0\nconst name = 'identity'\n\nconst encode: (input: Uint8Array) => Uint8Array = coerce\n\nfunction digest (input: Uint8Array, options?: DigestOptions): Digest.Digest<typeof code, number> {\n if (options?.truncate != null && options.truncate !== input.byteLength) {\n if (options.truncate < 0 || options.truncate > input.byteLength) {\n throw new Error(`Invalid truncate option, must be less than or equal to ${input.byteLength}`)\n }\n\n input = input.subarray(0, options.truncate)\n }\n\n return Digest.create(code, encode(input))\n}\n\nexport const identity = { code, name, encode, digest }\n","/**\n * To guarantee Uint8Array semantics, convert nodejs Buffers\n * into vanilla Uint8Arrays\n */\nexport function asUint8Array (buf: Uint8Array): Uint8Array {\n return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength)\n}\n","import { Buffer } from 'node:buffer'\nimport { asUint8Array } from '#util/as-uint8array'\n\n/**\n * Returns a `Uint8Array` of the requested size. Referenced memory will\n * be initialized to 0.\n */\nexport function alloc (size: number = 0): Uint8Array {\n return asUint8Array(Buffer.alloc(size))\n}\n\n/**\n * Where possible returns a Uint8Array of the requested size that references\n * uninitialized memory. Only use if you are certain you will immediately\n * overwrite every value in the returned `Uint8Array`.\n */\nexport function allocUnsafe (size: number = 0): Uint8Array {\n return asUint8Array(Buffer.allocUnsafe(size))\n}\n","import { baseX } from './base.js'\n\nexport const base10 = baseX({\n prefix: '9',\n name: 'base10',\n alphabet: '0123456789'\n})\n","import { rfc4648 } from './base.js'\n\nexport const base16 = rfc4648({\n prefix: 'f',\n name: 'base16',\n alphabet: '0123456789abcdef',\n bitsPerChar: 4\n})\n\nexport const base16upper = rfc4648({\n prefix: 'F',\n name: 'base16upper',\n alphabet: '0123456789ABCDEF',\n bitsPerChar: 4\n})\n","import { rfc4648 } from './base.js'\n\nexport const base2 = rfc4648({\n prefix: '0',\n name: 'base2',\n alphabet: '01',\n bitsPerChar: 1\n})\n","import { from } from './base.js'\n\nconst alphabet = Array.from('🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂')\nconst alphabetBytesToChars: string[] = (alphabet.reduce<string[]>((p, c, i) => { p[i] = c; return p }, ([])))\nconst alphabetCharsToBytes: number[] = (alphabet.reduce<number[]>((p, c, i) => {\n const codePoint = c.codePointAt(0)\n if (codePoint == null) {\n throw new Error(`Invalid character: ${c}`)\n }\n p[codePoint] = i\n return p\n}, ([])))\n\nfunction encode (data: Uint8Array): string {\n return data.reduce((p, c) => {\n p += alphabetBytesToChars[c]\n return p\n }, '')\n}\n\nfunction decode (str: string): Uint8Array {\n const byts = []\n for (const char of str) {\n const codePoint = char.codePointAt(0)\n if (codePoint == null) {\n throw new Error(`Invalid character: ${char}`)\n }\n const byt = alphabetCharsToBytes[codePoint]\n if (byt == null) {\n throw new Error(`Non-base256emoji character: ${char}`)\n }\n byts.push(byt)\n }\n return new Uint8Array(byts)\n}\n\nexport const base256emoji = from({\n prefix: '🚀',\n name: 'base256emoji',\n encode,\n decode\n})\n","import { rfc4648 } from './base.js'\n\nexport const base64 = rfc4648({\n prefix: 'm',\n name: 'base64',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/',\n bitsPerChar: 6\n})\n\nexport const base64pad = rfc4648({\n prefix: 'M',\n name: 'base64pad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=',\n bitsPerChar: 6\n})\n\nexport const base64url = rfc4648({\n prefix: 'u',\n name: 'base64url',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_',\n bitsPerChar: 6\n})\n\nexport const base64urlpad = rfc4648({\n prefix: 'U',\n name: 'base64urlpad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=',\n bitsPerChar: 6\n})\n","import { rfc4648 } from './base.js'\n\nexport const base8 = rfc4648({\n prefix: '7',\n name: 'base8',\n alphabet: '01234567',\n bitsPerChar: 3\n})\n","import { fromString, toString } from '../bytes.js'\nimport { from } from './base.js'\n\nexport const identity = from({\n prefix: '\\x00',\n name: 'identity',\n encode: (buf) => toString(buf),\n decode: (str) => fromString(str)\n})\n","import type { ArrayBufferView, ByteView } from './interface.js'\n\nconst textEncoder = new TextEncoder()\nconst textDecoder = new TextDecoder()\n\nexport const name = 'json'\nexport const code = 0x0200\n\nexport function encode <T> (node: T): ByteView<T> {\n return textEncoder.encode(JSON.stringify(node))\n}\n\nexport function decode <T> (data: ByteView<T> | ArrayBufferView<T>): T {\n return JSON.parse(textDecoder.decode(data))\n}\n","import crypto from 'crypto'\nimport { coerce } from '../bytes.js'\nimport { from } from './hasher.js'\n\nexport const sha256 = from({\n name: 'sha2-256',\n code: 0x12,\n encode: (input) => coerce(crypto.createHash('sha256').update(input).digest())\n})\n\nexport const sha512 = from({\n name: 'sha2-512',\n code: 0x13,\n encode: input => coerce(crypto.createHash('sha512').update(input).digest())\n})\n","import * as Digest from './digest.js'\nimport type { MultihashHasher } from './interface.js'\n\ntype Await<T> = Promise<T> | T\n\nconst DEFAULT_MIN_DIGEST_LENGTH = 20\n\nexport interface HasherInit <Name extends string, Code extends number> {\n name: Name\n code: Code\n encode(input: Uint8Array): Await<Uint8Array>\n\n /**\n * The minimum length a hash is allowed to be truncated to in bytes\n *\n * @default 20\n */\n minDigestLength?: number\n\n /**\n * The maximum length a hash is allowed to be truncated to in bytes. If not\n * specified it will be inferred from the length of the digest.\n */\n maxDigestLength?: number\n}\n\nexport function from <Name extends string, Code extends number> ({ name, code, encode, minDigestLength, maxDigestLength }: HasherInit<Name, Code>): Hasher<Name, Code> {\n return new Hasher(name, code, encode, minDigestLength, maxDigestLength)\n}\n\nexport interface DigestOptions {\n /**\n * Truncate the returned digest to this number of bytes.\n *\n * This may cause the digest method to throw/reject if the passed value is\n * greater than the digest length or below a threshold under which the risk of\n * hash collisions is significant.\n *\n * The actual value of this threshold can depend on the hashing algorithm in\n * use.\n */\n truncate?: number\n}\n\n/**\n * Hasher represents a hashing algorithm implementation that produces as\n * `MultihashDigest`.\n */\nexport class Hasher<Name extends string, Code extends number> implements MultihashHasher<Code> {\n readonly name: Name\n readonly code: Code\n readonly encode: (input: Uint8Array) => Await<Uint8Array>\n readonly minDigestLength: number\n readonly maxDigestLength?: number\n\n constructor (name: Name, code: Code, encode: (input: Uint8Array) => Await<Uint8Array>, minDigestLength?: number, maxDigestLength?: number) {\n this.name = name\n this.code = code\n this.encode = encode\n this.minDigestLength = minDigestLength ?? DEFAULT_MIN_DIGEST_LENGTH\n this.maxDigestLength = maxDigestLength\n }\n\n digest (input: Uint8Array, options?: DigestOptions): Await<Digest.Digest<Code, number>> {\n if (options?.truncate != null) {\n if (options.truncate < this.minDigestLength) {\n throw new Error(`Invalid truncate option, must be greater than or equal to ${this.minDigestLength}`)\n }\n\n if (this.maxDigestLength != null && options.truncate > this.maxDigestLength) {\n throw new Error(`Invalid truncate option, must be less than or equal to ${this.maxDigestLength}`)\n }\n }\n\n if (input instanceof Uint8Array) {\n const result = this.encode(input)\n\n if (result instanceof Uint8Array) {\n return createDigest(result, this.code, options?.truncate)\n }\n\n return result.then(digest => createDigest(digest, this.code, options?.truncate))\n } else {\n throw Error('Unknown type, must be binary type')\n /* c8 ignore next 1 */\n }\n }\n}\n\n/**\n * Create a Digest from the passed uint8array and code, optionally truncating it\n * first.\n */\nfunction createDigest <Code extends number> (digest: Uint8Array, code: Code, truncate?: number): Digest.Digest<Code, number> {\n if (truncate != null && truncate !== digest.byteLength) {\n if (truncate > digest.byteLength) {\n throw new Error(`Invalid truncate option, must be less than or equal to ${digest.byteLength}`)\n }\n\n digest = digest.subarray(0, truncate)\n }\n\n return Digest.create(code, digest)\n}\n","import * as base10 from './bases/base10.js'\nimport * as base16 from './bases/base16.js'\nimport * as base2 from './bases/base2.js'\nimport * as base256emoji from './bases/base256emoji.js'\nimport * as base32 from './bases/base32.js'\nimport * as base36 from './bases/base36.js'\nimport * as base58 from './bases/base58.js'\nimport * as base64 from './bases/base64.js'\nimport * as base8 from './bases/base8.js'\nimport * as identityBase from './bases/identity.js'\nimport * as json from './codecs/json.js'\nimport * as raw from './codecs/raw.js'\nimport * as identity from './hashes/identity.js'\nimport * as sha2 from './hashes/sha2.js'\nimport { CID, hasher, digest, varint, bytes } from './index.js'\n\nexport const bases = { ...identityBase, ...base2, ...base8, ...base10, ...base16, ...base32, ...base36, ...base58, ...base64, ...base256emoji }\nexport const hashes = { ...sha2, ...identity }\nexport const codecs = { raw, json }\n\nexport { CID, hasher, digest, varint, bytes }\n","import { bases } from 'multiformats/basics'\nimport type { MultibaseCodec } from 'multiformats'\nimport { allocUnsafe } from '#alloc'\n\nfunction createCodec (name: string, prefix: string, encode: (buf: Uint8Array) => string, decode: (str: string) => Uint8Array): MultibaseCodec<any> {\n return {\n name,\n prefix,\n encoder: {\n name,\n prefix,\n encode\n },\n decoder: {\n decode\n }\n }\n}\n\nconst string = createCodec('utf8', 'u', (buf) => {\n const decoder = new TextDecoder('utf8')\n return 'u' + decoder.decode(buf)\n}, (str) => {\n const encoder = new TextEncoder()\n return encoder.encode(str.substring(1))\n})\n\nconst ascii = createCodec('ascii', 'a', (buf) => {\n let string = 'a'\n\n for (let i = 0; i < buf.length; i++) {\n string += String.fromCharCode(buf[i])\n }\n return string\n}, (str) => {\n str = str.substring(1)\n const buf = allocUnsafe(str.length)\n\n for (let i = 0; i < str.length; i++) {\n buf[i] = str.charCodeAt(i)\n }\n\n return buf\n})\n\nexport type SupportedEncodings = 'utf8' | 'utf-8' | 'hex' | 'latin1' | 'ascii' | 'binary' | keyof typeof bases\n\nconst BASES: Record<SupportedEncodings, MultibaseCodec<any>> = {\n utf8: string,\n 'utf-8': string,\n hex: bases.base16,\n latin1: ascii,\n ascii,\n binary: ascii,\n\n ...bases\n}\n\nexport default BASES\n","import { Buffer } from 'node:buffer'\nimport bases, { type SupportedEncodings } from './util/bases.js'\n\nexport type { SupportedEncodings }\n\n/**\n * Turns a `Uint8Array` into a string.\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n */\nexport function toString (array: Uint8Array, encoding: SupportedEncodings = 'utf8'): string {\n const base = bases[encoding]\n\n if (base == null) {\n throw new Error(`Unsupported encoding \"${encoding}\"`)\n }\n\n if (encoding === 'utf8' || encoding === 'utf-8') {\n return Buffer.from(array.buffer, array.byteOffset, array.byteLength).toString('utf8')\n }\n\n // strip multibase prefix\n return base.encoder.encode(array).substring(1)\n}\n","import { InvalidParametersError } from '@libp2p/interface'\nimport { randomBytes as randB } from '@noble/hashes/utils.js'\n\n/**\n * Generates a Uint8Array with length `number` populated by random bytes\n */\nexport default function randomBytes (length: number): Uint8Array {\n if (isNaN(length) || length <= 0) {\n throw new InvalidParametersError('random bytes length must be a Number bigger than 0')\n }\n return randB(length)\n}\n","import { randomBytes } from '@libp2p/crypto';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { sha256 } from '@noble/hashes/sha256';\n\n/**\n * Generates a unique transaction ID that includes a hash of the peer ID\n * to reduce collision probability across distributed nodes.\n * \n * Format: {peerIdHash}-{randomBytes}\n * - peerIdHash: First 16 bytes of SHA-256 hash of peer ID (base64url)\n * - randomBytes: 16 random bytes (base64url)\n * - Total: 32 bytes, base64url encoded\n * \n * @param peerId Optional peer ID to include in the hash. If not provided, only random bytes are used.\n * @returns A unique transaction ID string\n */\nexport function generateTransactionId(peerId?: string): string {\n\tconst randomPart = randomBytes(16);\n\t\n\tif (peerId) {\n\t\t// Hash the peer ID and take first 16 bytes\n\t\tconst peerIdBytes = new TextEncoder().encode(peerId);\n\t\tconst peerIdHash = sha256(peerIdBytes);\n\t\tconst peerIdHashPart = peerIdHash.slice(0, 16);\n\t\t\n\t\t// Combine peer ID hash and random bytes\n\t\tconst combined = new Uint8Array(32);\n\t\tcombined.set(peerIdHashPart, 0);\n\t\tcombined.set(randomPart, 16);\n\t\t\n\t\treturn uint8ArrayToString(combined, 'base64url');\n\t}\n\t\n\t// Fallback: just use random bytes (padded to 32 bytes for consistency)\n\tconst fallback = new Uint8Array(32);\n\tfallback.set(randomPart, 0);\n\tfallback.set(randomBytes(16), 16);\n\t\n\treturn uint8ArrayToString(fallback, 'base64url');\n}\n\n","import type { ITransactor, TransactionCoordinator, ITransactionEngine } from '@optimystic/db-core';\r\nimport { TransactionSession, createTransactionStamp, createTransactionId } from '@optimystic/db-core';\r\nimport type { TransactionState, ParsedOptimysticOptions } from '../types.js';\r\nimport { CollectionFactory } from './collection-factory.js';\r\nimport { generateTransactionId as generateLegacyTransactionId } from '../util/generate-transaction-id.js';\r\nimport { QUEREUS_ENGINE_ID } from '../transaction/quereus-engine.js';\r\n\r\n/**\r\n * Transaction bridge between Quereus and Optimystic.\r\n *\r\n * This bridge handles both:\r\n * 1. Legacy mode: Direct collection sync (when no coordinator/engine is set)\r\n * 2. Transaction mode: Using TransactionSession for distributed consensus\r\n */\r\nexport class TransactionBridge {\r\n private currentTransaction: TransactionState | null = null;\r\n private collectionFactory: CollectionFactory;\r\n /** Accumulated SQL statements for the current transaction */\r\n private accumulatedStatements: string[] = [];\r\n /** Optional transaction session for distributed consensus */\r\n private session: TransactionSession | null = null;\r\n /** Optional coordinator for transaction mode */\r\n private coordinator: TransactionCoordinator | null = null;\r\n /** Optional engine for transaction mode */\r\n private engine: ITransactionEngine | null = null;\r\n /** Schema hash provider function */\r\n private schemaHashProvider: (() => Promise<string>) | null = null;\r\n\r\n constructor(collectionFactory: CollectionFactory) {\r\n this.collectionFactory = collectionFactory;\r\n }\r\n\r\n /**\r\n * Configure the transaction bridge for distributed consensus mode.\r\n *\r\n * When configured, transactions will use TransactionSession for\r\n * coordinated commit with validation.\r\n *\r\n * @param coordinator - The transaction coordinator\r\n * @param engine - The transaction engine (e.g., QuereusEngine)\r\n * @param schemaHashProvider - Function to get the current schema hash\r\n */\r\n configureTransactionMode(\r\n coordinator: TransactionCoordinator,\r\n engine: ITransactionEngine,\r\n schemaHashProvider: () => Promise<string>\r\n ): void {\r\n this.coordinator = coordinator;\r\n this.engine = engine;\r\n this.schemaHashProvider = schemaHashProvider;\r\n }\r\n\r\n /**\r\n * Check if transaction mode is enabled.\r\n */\r\n isTransactionModeEnabled(): boolean {\r\n return this.coordinator !== null && this.engine !== null;\r\n }\r\n\r\n /**\r\n * Begin a new transaction.\r\n *\r\n * If transaction mode is enabled, creates a TransactionSession for\r\n * distributed consensus. Otherwise, uses legacy direct sync mode.\r\n *\r\n * Following SQLite semantics: if a transaction is already active,\r\n * this is a no-op and returns the existing transaction.\r\n */\r\n async beginTransaction(options: ParsedOptimysticOptions): Promise<TransactionState> {\r\n if (this.currentTransaction?.isActive) {\r\n // Already in transaction - SQLite semantics: BEGIN is a no-op\r\n return this.currentTransaction;\r\n }\r\n\r\n const transactor = await this.collectionFactory.getOrCreateTransactor(options);\r\n const peerId = this.collectionFactory.getPeerId(options);\r\n\r\n // Clear any previously accumulated statements\r\n this.accumulatedStatements = [];\r\n\r\n // Create TransactionSession if transaction mode is enabled\r\n if (this.coordinator && this.engine && this.schemaHashProvider) {\r\n const schemaHash = await this.schemaHashProvider();\r\n this.session = new TransactionSession(\r\n this.coordinator,\r\n this.engine,\r\n peerId,\r\n schemaHash\r\n );\r\n } else {\r\n this.session = null;\r\n }\r\n\r\n // Generate transaction ID from session or legacy method\r\n const transactionId = this.session\r\n ? this.session.getStampId()\r\n : generateLegacyTransactionId(peerId);\r\n\r\n this.currentTransaction = {\r\n transactor,\r\n isActive: true,\r\n collections: new Map(),\r\n transactionId,\r\n };\r\n\r\n return this.currentTransaction;\r\n }\r\n\r\n /**\r\n * Commit the current transaction.\r\n *\r\n * If transaction mode is enabled, commits through TransactionSession\r\n * for distributed consensus. Otherwise, uses legacy direct sync.\r\n */\r\n async commitTransaction(): Promise<void> {\r\n if (!this.currentTransaction?.isActive) {\r\n throw new Error('No active transaction to commit');\r\n }\r\n\r\n try {\r\n if (this.session) {\r\n // Transaction mode: commit through session for distributed consensus\r\n const result = await this.session.commit();\r\n if (!result.success) {\r\n throw new Error(result.error || 'Transaction commit failed');\r\n }\r\n } else {\r\n // Legacy mode: sync all collections directly\r\n for (const [, collection] of this.currentTransaction.collections) {\r\n await this.collectionFactory.syncCollection(collection);\r\n }\r\n }\r\n\r\n this.currentTransaction.isActive = false;\r\n this.accumulatedStatements = [];\r\n this.session = null;\r\n\r\n } catch (error) {\r\n // If commit fails, rollback\r\n await this.rollbackTransaction();\r\n throw error;\r\n }\r\n }\r\n\r\n /**\r\n * Rollback the current transaction.\r\n *\r\n * Discards local changes and clears session state.\r\n */\r\n async rollbackTransaction(): Promise<void> {\r\n if (!this.currentTransaction?.isActive) {\r\n throw new Error('No active transaction to rollback');\r\n }\r\n\r\n // Rollback session if in transaction mode\r\n if (this.session && !this.session.isRolledBack()) {\r\n try {\r\n await this.session.rollback();\r\n } catch {\r\n // Ignore rollback errors - we're already cleaning up\r\n }\r\n }\r\n\r\n // Clean up local state\r\n this.currentTransaction.collections.clear();\r\n this.currentTransaction.isActive = false;\r\n\r\n this.accumulatedStatements = [];\r\n this.session = null;\r\n\r\n // Note: We intentionally do NOT clear the collection factory cache here.\r\n // The transactor cache contains pre-registered transactors that should persist\r\n // across transactions. Clearing them would cause the factory to create new\r\n // disconnected transactors instead of using the registered ones.\r\n }\r\n\r\n /**\r\n * Get the current transaction state.\r\n */\r\n getCurrentTransaction(): TransactionState | null {\r\n return this.currentTransaction;\r\n }\r\n\r\n /**\r\n * Get the current transaction session (if in transaction mode).\r\n */\r\n getSession(): TransactionSession | null {\r\n return this.session;\r\n }\r\n\r\n /**\r\n * Check if a transaction is currently active.\r\n */\r\n isTransactionActive(): boolean {\r\n return this.currentTransaction?.isActive ?? false;\r\n }\r\n\r\n /**\r\n * Add a SQL statement to the accumulated statements for the current transaction.\r\n * Statements are only accumulated when a transaction is active.\r\n *\r\n * In transaction mode, this also forwards the statement to the TransactionSession\r\n * for distributed consensus tracking.\r\n *\r\n * @param statement The deterministic SQL statement to accumulate\r\n */\r\n addStatement(statement: string): void {\r\n if (!this.currentTransaction?.isActive) {\r\n return;\r\n }\r\n\r\n this.accumulatedStatements.push(statement);\r\n\r\n // In transaction mode, also track in session\r\n // Note: We pass empty actions since the virtual table already applied changes\r\n // The session just needs to track the statement for the Transaction record\r\n if (this.session) {\r\n // We don't await here - statement tracking is synchronous\r\n // The session's execute() will just accumulate the statement\r\n // Actions are already applied by the virtual table\r\n void this.session.execute(statement, []);\r\n }\r\n }\r\n\r\n /**\r\n * Get all accumulated SQL statements for the current transaction.\r\n * @returns Array of SQL statements in execution order\r\n */\r\n getStatements(): readonly string[] {\r\n return this.accumulatedStatements;\r\n }\r\n\r\n /**\r\n * Get the count of accumulated statements\r\n */\r\n getStatementCount(): number {\r\n return this.accumulatedStatements.length;\r\n }\r\n\r\n /**\r\n * Savepoint support (if needed by Quereus)\r\n */\r\n async savepoint(name: string): Promise<void> {\r\n // Optimystic doesn't have explicit savepoint support\r\n // This would need to be implemented using collection snapshots\r\n throw new Error('Savepoints not yet implemented');\r\n }\r\n\r\n /**\r\n * Release savepoint\r\n */\r\n async releaseSavepoint(name: string): Promise<void> {\r\n throw new Error('Savepoints not yet implemented');\r\n }\r\n\r\n /**\r\n * Rollback to savepoint\r\n */\r\n async rollbackToSavepoint(name: string): Promise<void> {\r\n throw new Error('Savepoints not yet implemented');\r\n }\r\n\r\n /**\r\n * Cleanup resources\r\n */\r\n async cleanup(): Promise<void> {\r\n if (this.currentTransaction?.isActive) {\r\n await this.rollbackTransaction();\r\n }\r\n this.currentTransaction = null;\r\n }\r\n}\r\n","/**\n * VirtualTableConnection implementation for Optimystic tables.\n * Wraps the TransactionBridge to provide the generic VirtualTableConnection interface.\n */\n\nimport type { VirtualTableConnection } from '@quereus/quereus';\nimport type { TransactionBridge } from './txn-bridge.js';\nimport type { ParsedOptimysticOptions } from '../types.js';\n\nlet connectionCounter = 0;\n\n/**\n * Connection wrapper that bridges Quereus transaction lifecycle to Optimystic TransactionBridge\n */\nexport class OptimysticVirtualTableConnection implements VirtualTableConnection {\n\tpublic readonly connectionId: string;\n\tpublic readonly tableName: string;\n\tprivate txnBridge: TransactionBridge;\n\tprivate options: ParsedOptimysticOptions;\n\n\tconstructor(tableName: string, txnBridge: TransactionBridge, options: ParsedOptimysticOptions) {\n\t\tthis.connectionId = `optimystic-${tableName}-${++connectionCounter}`;\n\t\tthis.tableName = tableName;\n\t\tthis.txnBridge = txnBridge;\n\t\tthis.options = options;\n\t}\n\n\t/** Begins a transaction on this connection */\n\tasync begin(): Promise<void> {\n\t\tawait this.txnBridge.beginTransaction(this.options);\n\t}\n\n\t/** Commits the current transaction */\n\tasync commit(): Promise<void> {\n\t\t// For implicit transactions, Quereus may call commit() without calling begin() first\n\t\t// In this case, we need to start a transaction before committing\n\t\tconst currentTxn = this.txnBridge.getCurrentTransaction();\n\t\tif (!currentTxn?.isActive) {\n\t\t\tawait this.txnBridge.beginTransaction(this.options);\n\t\t}\n\t\tawait this.txnBridge.commitTransaction();\n\t}\n\n\t/** Rolls back the current transaction */\n\tasync rollback(): Promise<void> {\n\t\tawait this.txnBridge.rollbackTransaction();\n\t}\n\n\t/** Creates a savepoint with the given index */\n\tcreateSavepoint(_index: number): void {\n\t\t// Optimystic doesn't currently support savepoints\n\t\t// This is a no-op for now\n\t}\n\n\t/** Releases a savepoint with the given index */\n\treleaseSavepoint(_index: number): void {\n\t\t// Optimystic doesn't currently support savepoints\n\t\t// This is a no-op for now\n\t}\n\n\t/** Rolls back to a savepoint with the given index */\n\trollbackToSavepoint(_index: number): void {\n\t\t// Optimystic doesn't currently support savepoints\n\t\t// This is a no-op for now\n\t}\n\n\t/** Disconnects and cleans up this connection */\n\tasync disconnect(): Promise<void> {\n\t\t// If there's an active transaction, roll it back\n\t\tconst currentTxn = this.txnBridge.getCurrentTransaction();\n\t\tif (currentTxn?.isActive) {\n\t\t\tawait this.txnBridge.rollbackTransaction();\n\t\t}\n\t}\n}\n\n","/**\n * SchemaManager - Manages table schemas in Optimystic trees\n *\n * Stores and retrieves table schema definitions from distributed Optimystic trees.\n * Schema is stored in a dedicated tree at `tree://schema/{tableName}`.\n */\n\nimport type { Tree } from '@optimystic/db-core';\nimport type { TableSchema, ColumnSchema } from '@quereus/quereus';\nimport type { ITransactor } from '@optimystic/db-core';\n\n// IndexSchema type from TableSchema.indexes\ntype IndexSchema = NonNullable<TableSchema['indexes']>[number];\n\n/**\n * Serializable schema storage format\n */\nexport interface StoredTableSchema {\n\tname: string;\n\tschemaName: string;\n\tcolumns: StoredColumnSchema[];\n\tprimaryKeyDefinition: StoredPrimaryKeyColumn[];\n\tindexes: StoredIndexSchema[];\n\tvtabModuleName: string;\n\tvtabArgs?: Record<string, any>;\n\tisTemporary?: boolean;\n\testimatedRows?: number;\n}\n\nexport interface StoredColumnSchema {\n\tname: string;\n\taffinity: string;\n\tnotNull: boolean;\n\tprimaryKey: boolean;\n\tpkOrder: number;\n\tdefaultValue?: any;\n\tcollation: string;\n\tgenerated: boolean;\n\tpkDirection?: 'asc' | 'desc';\n}\n\nexport interface StoredPrimaryKeyColumn {\n\tindex: number;\n\tdesc?: boolean;\n\tautoIncrement?: boolean;\n\tcollation?: string;\n}\n\nexport interface StoredIndexSchema {\n\tname: string;\n\tcolumns: StoredIndexColumn[];\n\tunique?: boolean;\n}\n\nexport interface StoredIndexColumn {\n\tindex: number;\n\tdesc?: boolean;\n\tcollation?: string;\n}\n\n/**\n * Manages schema storage and retrieval in Optimystic trees\n */\nexport class SchemaManager {\n\tprivate schemaCache = new Map<string, StoredTableSchema>();\n\n\tconstructor(\n\t\tprivate readonly getSchemaTree: (transactor?: ITransactor) => Promise<Tree<string, any>>\n\t) {}\n\n\t/**\n\t * Store a table schema\n\t */\n\tasync storeSchema(schema: TableSchema, transactor?: ITransactor): Promise<void> {\n\t\tconst stored = this.tableSchemaToStored(schema);\n\t\tthis.schemaCache.set(schema.name, stored);\n\n\t\tconst tree = await this.getSchemaTree(transactor);\n\t\tawait tree.replace([[schema.name, stored]]);\n\t}\n\n\t/**\n\t * Retrieve a table schema\n\t */\n\tasync getSchema(tableName: string, transactor?: ITransactor): Promise<StoredTableSchema | undefined> {\n\t\t// Check cache first\n\t\tconst cached = this.schemaCache.get(tableName);\n\t\tif (cached) {\n\t\t\treturn cached;\n\t\t}\n\n\t\t// Load from tree\n\t\tconst tree = await this.getSchemaTree(transactor);\n\t\tconst path = await tree.find(tableName);\n\t\tif (!tree.isValid(path)) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst entry = tree.at(path) as [string, StoredTableSchema];\n\t\tif (entry && entry.length >= 2) {\n\t\t\tconst stored = entry[1];\n\t\t\tthis.schemaCache.set(tableName, stored);\n\t\t\treturn stored;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * Delete a table schema\n\t */\n\tasync deleteSchema(tableName: string, transactor?: ITransactor): Promise<void> {\n\t\tthis.schemaCache.delete(tableName);\n\n\t\tconst tree = await this.getSchemaTree(transactor);\n\t\tawait tree.replace([[tableName, undefined]]);\n\t}\n\n\t/**\n\t * List all table names\n\t */\n\tasync listTables(transactor?: ITransactor): Promise<string[]> {\n\t\tconst tree = await this.getSchemaTree(transactor);\n\t\tconst tables: string[] = [];\n\n\t\tfor await (const path of tree.range({ isAscending: true } as any)) {\n\t\t\tif (!tree.isValid(path)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst entry = tree.at(path) as [string, any];\n\t\t\tif (entry && entry.length >= 1) {\n\t\t\t\ttables.push(entry[0]);\n\t\t\t}\n\t\t}\n\n\t\treturn tables;\n\t}\n\n\t/**\n\t * Clear the schema cache\n\t */\n\tclearCache(): void {\n\t\tthis.schemaCache.clear();\n\t}\n\n\t/**\n\t * Convert TableSchema to storable format\n\t */\n\tprivate tableSchemaToStored(schema: TableSchema): StoredTableSchema {\n\t\treturn {\n\t\t\tname: schema.name,\n\t\t\tschemaName: schema.schemaName,\n\t\t\tcolumns: schema.columns.map(col => this.columnSchemaToStored(col)),\n\t\t\tprimaryKeyDefinition: schema.primaryKeyDefinition.map(pk => ({\n\t\t\t\tindex: pk.index,\n\t\t\t\tdesc: pk.desc,\n\t\t\t\tautoIncrement: pk.autoIncrement,\n\t\t\t\tcollation: pk.collation,\n\t\t\t})),\n\t\t\tindexes: (schema.indexes || []).map(idx => this.indexSchemaToStored(idx)),\n\t\t\tvtabModuleName: schema.vtabModuleName,\n\t\t\tvtabArgs: schema.vtabArgs as Record<string, any>,\n\t\t\tisTemporary: schema.isTemporary,\n\t\t\testimatedRows: schema.estimatedRows,\n\t\t};\n\t}\n\n\t/**\n\t * Convert ColumnSchema to storable format\n\t */\n\tprivate columnSchemaToStored(col: ColumnSchema): StoredColumnSchema {\n\t\treturn {\n\t\t\tname: col.name,\n\t\t\taffinity: col.logicalType.name, // Use logicalType.name for storage\n\t\t\tnotNull: col.notNull,\n\t\t\tprimaryKey: col.primaryKey,\n\t\t\tpkOrder: col.pkOrder,\n\t\t\tdefaultValue: col.defaultValue ? this.serializeExpression(col.defaultValue) : undefined,\n\t\t\tcollation: col.collation,\n\t\t\tgenerated: col.generated,\n\t\t\tpkDirection: col.pkDirection,\n\t\t};\n\t}\n\n\t/**\n\t * Convert IndexSchema to storable format\n\t */\n\tprivate indexSchemaToStored(idx: IndexSchema): StoredIndexSchema {\n\t\treturn {\n\t\t\tname: idx.name,\n\t\t\tcolumns: idx.columns.map((col: { index: number; desc?: boolean; collation?: string }) => ({\n\t\t\t\tindex: col.index,\n\t\t\t\tdesc: col.desc,\n\t\t\t\tcollation: col.collation,\n\t\t\t})),\n\t\t};\n\t}\n\n\t/**\n\t * Serialize an expression for storage\n\t * For now, we'll store a simplified representation\n\t */\n\tprivate serializeExpression(expr: any): any {\n\t\t// TODO: Implement proper expression serialization\n\t\t// For now, just store the expression as-is if it's a simple value\n\t\tif (typeof expr === 'object' && expr !== null) {\n\t\t\tif ('type' in expr && expr.type === 'literal') {\n\t\t\t\treturn { type: 'literal', value: expr.value };\n\t\t\t}\n\t\t\t// For complex expressions, we'll need to implement full serialization\n\t\t\treturn { type: 'complex', raw: JSON.stringify(expr) };\n\t\t}\n\t\treturn expr;\n\t}\n}\n\n","/**\n * RowCodec - Encodes and decodes rows with schema awareness\n *\n * Handles serialization/deserialization of multi-column rows to/from\n * the format stored in Optimystic trees.\n */\n\nimport type { Row, SqlValue } from '@quereus/quereus';\nimport { resolveCollation, compareSqlValues, type CollationFunction } from '@quereus/quereus';\nimport type { StoredTableSchema } from './schema-manager.js';\n\n/**\n * Encoding format for row data\n */\nexport type EncodingFormat = 'json' | 'msgpack';\n\n/**\n * Encoded row data stored in the tree\n */\nexport type EncodedRow = Uint8Array | string;\n\n/**\n * Primary key value (can be composite)\n */\nexport type PrimaryKeyValue = string;\n\n/**\n * Handles encoding/decoding of rows based on table schema\n */\nexport class RowCodec {\n\tconstructor(\n\t\tprivate readonly schema: StoredTableSchema,\n\t\tprivate readonly encoding: EncodingFormat = 'json'\n\t) {}\n\n\t/**\n\t * Encode a row for storage in the tree\n\t */\n\tencodeRow(row: Row): EncodedRow {\n\t\t// Convert Row (array) to object format for storage\n\t\tconst rowObj: Record<string, SqlValue> = {};\n\n\t\tfor (let i = 0; i < this.schema.columns.length; i++) {\n\t\t\tconst col = this.schema.columns[i];\n\t\t\tif (!col) continue;\n\t\t\tconst value = row[i];\n\t\t\trowObj[col.name] = this.normalizeValue(value ?? null);\n\t\t}\n\n\t\tif (this.encoding === 'msgpack') {\n\t\t\t// TODO: Add msgpack support when dependency is added\n\t\t\tthrow new Error('msgpack encoding not yet implemented');\n\t\t}\n\n\t\treturn JSON.stringify(rowObj);\n\t}\n\n\t/**\n\t * Decode a row from storage format\n\t */\n\tdecodeRow(encoded: EncodedRow): Row {\n\t\tlet rowObj: Record<string, SqlValue>;\n\n\t\tif (this.encoding === 'msgpack') {\n\t\t\t// TODO: Add msgpack support when dependency is added\n\t\t\tthrow new Error('msgpack decoding not yet implemented');\n\t\t} else {\n\t\t\trowObj = JSON.parse(encoded as string);\n\t\t}\n\n\t\t// Convert object back to Row (array) format\n\t\tconst row: Row = [];\n\t\tfor (let i = 0; i < this.schema.columns.length; i++) {\n\t\t\tconst col = this.schema.columns[i];\n\t\t\tif (!col) continue;\n\t\t\trow[i] = rowObj[col.name] ?? null;\n\t\t}\n\n\t\treturn row;\n\t}\n\n\t/**\n\t * Extract primary key value from a row\n\t */\n\textractPrimaryKey(row: Row): PrimaryKeyValue {\n\t\tconst pkParts: string[] = [];\n\n\t\tfor (const pkCol of this.schema.primaryKeyDefinition) {\n\t\t\tconst value = row[pkCol.index];\n\t\t\tpkParts.push(this.serializeKeyPart(value ?? null));\n\t\t}\n\n\t\t// For single-column keys, return the value directly\n\t\tif (pkParts.length === 1 && pkParts[0]) {\n\t\t\treturn pkParts[0];\n\t\t}\n\n\t\t// For composite keys, join with a separator\n\t\t// Use a separator that's unlikely to appear in data\n\t\treturn pkParts.join('\\x00');\n\t}\n\n\t/**\n\t * Create a primary key from individual column values\n\t */\n\tcreatePrimaryKey(values: SqlValue[]): PrimaryKeyValue {\n\t\tif (values.length !== this.schema.primaryKeyDefinition.length) {\n\t\t\tthrow new Error(\n\t\t\t\t`Primary key requires ${this.schema.primaryKeyDefinition.length} values, got ${values.length}`\n\t\t\t);\n\t\t}\n\n\t\tconst pkParts = values.map(v => this.serializeKeyPart(v ?? null));\n\n\t\tif (pkParts.length === 1 && pkParts[0]) {\n\t\t\treturn pkParts[0];\n\t\t}\n\n\t\treturn pkParts.join('\\x00');\n\t}\n\n\t/**\n\t * Get the indices of primary key columns\n\t */\n\tgetPrimaryKeyIndices(): number[] {\n\t\treturn this.schema.primaryKeyDefinition.map(pk => pk.index);\n\t}\n\n\t/**\n\t * Get the number of columns in the schema\n\t */\n\tgetColumnCount(): number {\n\t\treturn this.schema.columns.length;\n\t}\n\n\t/**\n\t * Get column name by index\n\t */\n\tgetColumnName(index: number): string {\n\t\treturn this.schema.columns[index]?.name || '';\n\t}\n\n\t/**\n\t * Get column index by name\n\t */\n\tgetColumnIndex(name: string): number {\n\t\treturn this.schema.columns.findIndex(col => col.name.toLowerCase() === name.toLowerCase());\n\t}\n\n\t/**\n\t * Serialize a single key part to string\n\t */\n\tprivate serializeKeyPart(value: SqlValue): string {\n\t\tif (value === null || value === undefined) {\n\t\t\treturn '\\x01NULL\\x01';\n\t\t}\n\n\t\tif (typeof value === 'string') {\n\t\t\treturn value;\n\t\t}\n\n\t\tif (typeof value === 'number') {\n\t\t\t// Pad numbers for lexicographic sorting\n\t\t\t// This is a simplified approach; a production system would need more sophisticated encoding\n\t\t\treturn value.toString();\n\t\t}\n\n\t\tif (typeof value === 'bigint') {\n\t\t\treturn value.toString();\n\t\t}\n\n\t\tif (typeof value === 'boolean') {\n\t\t\treturn value ? '1' : '0';\n\t\t}\n\n\t\tif (value instanceof Uint8Array) {\n\t\t\t// Convert to base64 for string representation\n\t\t\treturn Buffer.from(value).toString('base64');\n\t\t}\n\n\t\t// Fallback\n\t\treturn String(value);\n\t}\n\n\t/**\n\t * Normalize a value for storage\n\t */\n\tprivate normalizeValue(value: SqlValue): SqlValue {\n\t\t// Convert bigint to number for JSON compatibility\n\t\tif (typeof value === 'bigint') {\n\t\t\treturn Number(value);\n\t\t}\n\n\t\t// Uint8Array needs special handling for JSON\n\t\tif (value instanceof Uint8Array && this.encoding === 'json') {\n\t\t\treturn Buffer.from(value).toString('base64');\n\t\t}\n\n\t\treturn value;\n\t}\n\n\t/**\n\t * Check if a column is part of the primary key\n\t */\n\tisColumnInPrimaryKey(columnIndex: number): boolean {\n\t\treturn this.schema.primaryKeyDefinition.some(pk => pk.index === columnIndex);\n\t}\n\n\t/**\n\t * Get the schema\n\t */\n\tgetSchema(): StoredTableSchema {\n\t\treturn this.schema;\n\t}\n\n\t/**\n\t * Create a comparison function for primary keys that respects collations\n\t * This is used by the Tree to maintain proper sort order\n\t */\n\tcreatePrimaryKeyComparator(): (a: string, b: string) => -1 | 0 | 1 {\n\t\tconst pkDef = this.schema.primaryKeyDefinition;\n\n\t\t// For empty primary key (singleton table), all keys are equal\n\t\tif (pkDef.length === 0) {\n\t\t\treturn () => 0;\n\t\t}\n\n\t\t// For single-column primary key\n\t\tif (pkDef.length === 1) {\n\t\t\tconst collationName = pkDef[0]?.collation || 'BINARY';\n\t\t\tconst collationFunc = resolveCollation(collationName);\n\t\t\tconst desc = pkDef[0]?.desc || false;\n\t\t\tconst multiplier = desc ? -1 : 1;\n\n\t\t\treturn (a: string, b: string): -1 | 0 | 1 => {\n\t\t\t\t// Deserialize the key parts\n\t\t\t\tconst valueA = this.deserializeKeyPart(a);\n\t\t\t\tconst valueB = this.deserializeKeyPart(b);\n\n\t\t\t\t// Compare using the appropriate collation\n\t\t\t\tconst result = this.compareValues(valueA, valueB, collationFunc);\n\t\t\t\treturn (result * multiplier) as -1 | 0 | 1;\n\t\t\t};\n\t\t}\n\n\t\t// For composite primary key\n\t\tconst collationFuncs = pkDef.map(def => resolveCollation(def.collation || 'BINARY'));\n\t\tconst descFlags = pkDef.map(def => def.desc || false);\n\n\t\treturn (a: string, b: string): -1 | 0 | 1 => {\n\t\t\t// Split composite keys\n\t\t\tconst partsA = a.split('\\x00');\n\t\t\tconst partsB = b.split('\\x00');\n\n\t\t\t// Compare each part in order\n\t\t\tfor (let i = 0; i < pkDef.length; i++) {\n\t\t\t\tconst valueA = this.deserializeKeyPart(partsA[i] || '');\n\t\t\t\tconst valueB = this.deserializeKeyPart(partsB[i] || '');\n\n\t\t\t\tconst result = this.compareValues(valueA, valueB, collationFuncs[i]!);\n\t\t\t\tif (result !== 0) {\n\t\t\t\t\tconst multiplier = descFlags[i] ? -1 : 1;\n\t\t\t\t\treturn (result * multiplier) as -1 | 0 | 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn 0;\n\t\t};\n\t}\n\n\t/**\n\t * Deserialize a key part back to its original value\n\t */\n\tprivate deserializeKeyPart(serialized: string): SqlValue {\n\t\tif (serialized === '\\x01NULL\\x01') {\n\t\t\treturn null;\n\t\t}\n\n\t\t// Try to parse as number\n\t\tconst num = Number(serialized);\n\t\tif (!isNaN(num) && serialized !== '') {\n\t\t\treturn num;\n\t\t}\n\n\t\t// Otherwise treat as string\n\t\treturn serialized;\n\t}\n\n\t/**\n\t * Compare two values using the specified collation\n\t */\n\tprivate compareValues(a: SqlValue, b: SqlValue, collationFunc: CollationFunction): number {\n\t\t// Handle nulls first\n\t\tif (a === null && b === null) return 0;\n\t\tif (a === null) return -1;\n\t\tif (b === null) return 1;\n\n\t\t// For strings, use the collation function\n\t\tif (typeof a === 'string' && typeof b === 'string') {\n\t\t\treturn collationFunc(a, b);\n\t\t}\n\n\t\t// For numbers, use numeric comparison\n\t\tif (typeof a === 'number' && typeof b === 'number') {\n\t\t\treturn a < b ? -1 : a > b ? 1 : 0;\n\t\t}\n\n\t\t// For mixed types, use SQL comparison rules\n\t\treturn compareSqlValues(a, b, 'BINARY');\n\t}\n}\n\n","/**\n * IndexManager - Manages secondary indexes for Optimystic tables\n *\n * Creates and maintains secondary indexes stored in separate Optimystic trees.\n * Each index is stored as Tree<IndexKey, PrimaryKey> where IndexKey is a composite\n * of indexed column values.\n */\n\nimport type { Tree } from '@optimystic/db-core';\nimport type { ITransactor } from '@optimystic/db-core';\nimport type { Row, SqlValue } from '@quereus/quereus';\nimport type { StoredTableSchema, StoredIndexSchema } from './schema-manager.js';\n\n/**\n * Index key format: composite of indexed column values joined with separator\n */\nexport type IndexKey = string;\n\n/**\n * Primary key format: composite of primary key column values joined with separator\n */\nexport type PrimaryKey = string;\n\n/**\n * Index entry: maps index key to primary key\n */\nexport type IndexEntry = [IndexKey, PrimaryKey];\n\n/**\n * Factory function to create/get index trees\n */\nexport type IndexTreeFactory = (\n\tindexName: string,\n\ttransactor?: ITransactor\n) => Promise<Tree<IndexKey, PrimaryKey>>;\n\n/**\n * Manages secondary indexes for a table\n */\nexport class IndexManager {\n\tprivate indexTrees = new Map<string, Tree<IndexKey, PrimaryKey>>();\n\n\tconstructor(\n\t\tprivate schema: StoredTableSchema,\n\t\tprivate indexTreeFactory: IndexTreeFactory\n\t) {}\n\n\t/**\n\t * Initialize all indexes for the table\n\t */\n\tasync initialize(transactor?: ITransactor): Promise<void> {\n\t\tfor (const index of this.schema.indexes) {\n\t\t\tconst tree = await this.indexTreeFactory(index.name, transactor);\n\t\t\tthis.indexTrees.set(index.name, tree);\n\t\t}\n\t}\n\n\t/**\n\t * Get an index tree by name\n\t */\n\tgetIndexTree(indexName: string): Tree<IndexKey, PrimaryKey> | undefined {\n\t\treturn this.indexTrees.get(indexName);\n\t}\n\n\t/**\n\t * Create index key from row values\n\t */\n\tcreateIndexKey(indexSchema: StoredIndexSchema, row: Row): IndexKey {\n\t\tconst keyParts: string[] = [];\n\n\t\tfor (const indexCol of indexSchema.columns) {\n\t\t\tconst value = row[indexCol.index];\n\t\t\tconst stringValue = this.serializeValue(value ?? null);\n\t\t\tkeyParts.push(stringValue);\n\t\t}\n\n\t\t// Join with null separator (same as primary key encoding)\n\t\treturn keyParts.join('\\x00');\n\t}\n\n\t/**\n\t * Insert index entries for a new row\n\t */\n\tasync insertIndexEntries(\n\t\trow: Row,\n\t\tprimaryKey: PrimaryKey,\n\t\ttransactor?: ITransactor\n\t): Promise<void> {\n\t\tconst updates: Array<[string, IndexEntry[]]> = [];\n\n\t\tfor (const index of this.schema.indexes) {\n\t\t\tconst indexKey = this.createIndexKey(index, row);\n\t\t\tconst tree = this.indexTrees.get(index.name);\n\t\t\tif (!tree) {\n\t\t\t\tthrow new Error(`Index tree not found: ${index.name}`);\n\t\t\t}\n\n\t\t\tupdates.push([index.name, [[indexKey, primaryKey]]]);\n\t\t}\n\n\t\t// Apply all index updates\n\t\tfor (const [indexName, entries] of updates) {\n\t\t\tconst tree = this.indexTrees.get(indexName);\n\t\t\tif (tree) {\n\t\t\t\tawait tree.replace(entries);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Delete index entries for a row\n\t */\n\tasync deleteIndexEntries(\n\t\trow: Row,\n\t\tprimaryKey: PrimaryKey,\n\t\ttransactor?: ITransactor\n\t): Promise<void> {\n\t\tconst updates: Array<[string, Array<[IndexKey, undefined]>]> = [];\n\n\t\tfor (const index of this.schema.indexes) {\n\t\t\tconst indexKey = this.createIndexKey(index, row);\n\t\t\tconst tree = this.indexTrees.get(index.name);\n\t\t\tif (!tree) {\n\t\t\t\tthrow new Error(`Index tree not found: ${index.name}`);\n\t\t\t}\n\n\t\t\tupdates.push([index.name, [[indexKey, undefined]]]);\n\t\t}\n\n\t\t// Apply all index deletions\n\t\tfor (const [indexName, entries] of updates) {\n\t\t\tconst tree = this.indexTrees.get(indexName);\n\t\t\tif (tree) {\n\t\t\t\tawait tree.replace(entries);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Update index entries when a row changes\n\t */\n\tasync updateIndexEntries(\n\t\toldRow: Row,\n\t\tnewRow: Row,\n\t\toldPrimaryKey: PrimaryKey,\n\t\tnewPrimaryKey: PrimaryKey,\n\t\ttransactor?: ITransactor\n\t): Promise<void> {\n\t\t// For each index, check if the indexed columns changed\n\t\tfor (const index of this.schema.indexes) {\n\t\t\tconst oldIndexKey = this.createIndexKey(index, oldRow);\n\t\t\tconst newIndexKey = this.createIndexKey(index, newRow);\n\n\t\t\tconst tree = this.indexTrees.get(index.name);\n\t\t\tif (!tree) {\n\t\t\t\tthrow new Error(`Index tree not found: ${index.name}`);\n\t\t\t}\n\n\t\t\tif (oldIndexKey !== newIndexKey || oldPrimaryKey !== newPrimaryKey) {\n\t\t\t\t// Index key or primary key changed - delete old, insert new\n\t\t\t\tawait tree.replace([\n\t\t\t\t\t[oldIndexKey, undefined],\n\t\t\t\t\t[newIndexKey, newPrimaryKey]\n\t\t\t\t]);\n\t\t\t}\n\t\t\t// If both keys are the same, no update needed\n\t\t}\n\t}\n\n\t/**\n\t * Find rows using an index\n\t */\n\tasync* findByIndex(\n\t\tindexName: string,\n\t\tindexKey: IndexKey\n\t): AsyncIterable<PrimaryKey> {\n\t\tconst tree = this.indexTrees.get(indexName);\n\t\tif (!tree) {\n\t\t\tthrow new Error(`Index tree not found: ${indexName}`);\n\t\t}\n\n\t\tconst path = await tree.find(indexKey);\n\t\tif (!tree.isValid(path)) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst entry = tree.at(path) as unknown as [IndexKey, PrimaryKey];\n\t\tif (entry && entry.length >= 2) {\n\t\t\tyield entry[1];\n\t\t}\n\t}\n\n\t/**\n\t * Scan index range\n\t */\n\tasync* scanIndexRange(\n\t\tindexName: string,\n\t\tstartKey?: IndexKey,\n\t\tendKey?: IndexKey,\n\t\tascending = true\n\t): AsyncIterable<PrimaryKey> {\n\t\tconst tree = this.indexTrees.get(indexName);\n\t\tif (!tree) {\n\t\t\tthrow new Error(`Index tree not found: ${indexName}`);\n\t\t}\n\n\t\t// TODO: Implement proper range scanning with KeyRange\n\t\t// For now, do a full scan and filter\n\t\tconst iterator = tree.range({ isAscending: ascending } as any);\n\n\t\tfor await (const path of iterator) {\n\t\t\tif (!tree.isValid(path)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst entry = tree.at(path) as unknown as [IndexKey, PrimaryKey];\n\t\t\tif (entry && entry.length >= 2) {\n\t\t\t\tconst [key, primaryKey] = entry;\n\n\t\t\t\t// Apply range filters\n\t\t\t\tif (startKey !== undefined && key < startKey) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (endKey !== undefined && key > endKey) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tyield primaryKey;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Get index schema by name\n\t */\n\tgetIndexSchema(indexName: string): StoredIndexSchema | undefined {\n\t\treturn this.schema.indexes.find(idx => idx.name === indexName);\n\t}\n\n\t/**\n\t * Serialize a value for use in index key\n\t */\n\tprivate serializeValue(value: SqlValue): string {\n\t\tif (value === null || value === undefined) {\n\t\t\treturn '\\x01'; // Special marker for NULL\n\t\t}\n\t\tif (typeof value === 'string') {\n\t\t\treturn value;\n\t\t}\n\t\tif (typeof value === 'number') {\n\t\t\t// Pad numbers for lexicographic sorting\n\t\t\t// Use scientific notation with fixed precision\n\t\t\treturn value.toExponential(15);\n\t\t}\n\t\tif (typeof value === 'bigint') {\n\t\t\treturn value.toString();\n\t\t}\n\t\tif (value instanceof Uint8Array) {\n\t\t\t// Convert to base64 for string representation\n\t\t\treturn btoa(String.fromCharCode(...value));\n\t\t}\n\t\t// Fallback\n\t\treturn String(value);\n\t}\n}\n\n","/**\n * StatisticsCollector - Collects and maintains table statistics for query optimization\n *\n * Tracks row counts, distinct values, and provides cost estimates for query planning.\n */\n\nimport type { StoredTableSchema } from './schema-manager.js';\n\n/**\n * Statistics for a single column\n */\nexport interface ColumnStatistics {\n\t/** Approximate number of distinct values */\n\tdistinctCount: number;\n\t/** Approximate number of NULL values */\n\tnullCount: number;\n\t/** Sample of values for histogram (optional) */\n\tsampleValues?: unknown[];\n}\n\n/**\n * Statistics for a table\n */\nexport interface TableStatistics {\n\t/** Total number of rows (approximate) */\n\trowCount: number;\n\t/** Statistics per column */\n\tcolumnStats: Map<number, ColumnStatistics>;\n\t/** Last update timestamp */\n\tlastUpdated: number;\n}\n\n/**\n * Collects and maintains statistics for query optimization\n */\nexport class StatisticsCollector {\n\tprivate stats: TableStatistics;\n\n\tconstructor(private schema: StoredTableSchema) {\n\t\tthis.stats = {\n\t\t\trowCount: 0,\n\t\t\tcolumnStats: new Map(),\n\t\t\tlastUpdated: Date.now(),\n\t\t};\n\n\t\t// Initialize column stats\n\t\tfor (let i = 0; i < schema.columns.length; i++) {\n\t\t\tthis.stats.columnStats.set(i, {\n\t\t\t\tdistinctCount: 0,\n\t\t\t\tnullCount: 0,\n\t\t\t});\n\t\t}\n\t}\n\n\t/**\n\t * Get current table statistics\n\t */\n\tgetStatistics(): TableStatistics {\n\t\treturn this.stats;\n\t}\n\n\t/**\n\t * Get estimated row count\n\t */\n\tgetRowCount(): number {\n\t\treturn this.stats.rowCount;\n\t}\n\n\t/**\n\t * Get estimated distinct count for a column\n\t */\n\tgetDistinctCount(columnIndex: number): number {\n\t\tconst colStats = this.stats.columnStats.get(columnIndex);\n\t\treturn colStats?.distinctCount || 0;\n\t}\n\n\t/**\n\t * Increment row count (called on INSERT)\n\t */\n\tincrementRowCount(): void {\n\t\tthis.stats.rowCount++;\n\t\tthis.stats.lastUpdated = Date.now();\n\t}\n\n\t/**\n\t * Decrement row count (called on DELETE)\n\t */\n\tdecrementRowCount(): void {\n\t\tthis.stats.rowCount = Math.max(0, this.stats.rowCount - 1);\n\t\tthis.stats.lastUpdated = Date.now();\n\t}\n\n\t/**\n\t * Estimate selectivity of an equality constraint\n\t * Returns a value between 0 and 1 representing the fraction of rows that match\n\t */\n\testimateEqualitySelectivity(columnIndex: number): number {\n\t\tconst distinctCount = this.getDistinctCount(columnIndex);\n\t\tif (distinctCount === 0) {\n\t\t\treturn 0.1; // Default estimate\n\t\t}\n\t\treturn 1.0 / distinctCount;\n\t}\n\n\t/**\n\t * Estimate selectivity of a range constraint\n\t * Returns a value between 0 and 1 representing the fraction of rows that match\n\t */\n\testimateRangeSelectivity(_columnIndex: number): number {\n\t\t// Simple heuristic: assume range matches 25% of rows\n\t\treturn 0.25;\n\t}\n\n\t/**\n\t * Estimate cost of a full table scan\n\t */\n\testimateTableScanCost(): number {\n\t\t// Cost is proportional to row count\n\t\t// Base cost of 1.0 per row\n\t\treturn Math.max(1000, this.stats.rowCount);\n\t}\n\n\t/**\n\t * Estimate cost of an index scan\n\t */\n\testimateIndexScanCost(selectivity: number): number {\n\t\t// Cost includes:\n\t\t// 1. Index lookup cost (logarithmic)\n\t\t// 2. Row fetch cost (proportional to selected rows)\n\t\tconst indexLookupCost = Math.log2(Math.max(1, this.stats.rowCount)) * 2;\n\t\tconst rowFetchCost = this.stats.rowCount * selectivity;\n\t\treturn indexLookupCost + rowFetchCost;\n\t}\n\n\t/**\n\t * Estimate number of rows returned by a constraint\n\t */\n\testimateRowsForConstraint(columnIndex: number, isEquality: boolean): number {\n\t\tif (isEquality) {\n\t\t\tconst selectivity = this.estimateEqualitySelectivity(columnIndex);\n\t\t\treturn Math.max(1, Math.floor(this.stats.rowCount * selectivity));\n\t\t} else {\n\t\t\tconst selectivity = this.estimateRangeSelectivity(columnIndex);\n\t\t\treturn Math.max(1, Math.floor(this.stats.rowCount * selectivity));\n\t\t}\n\t}\n\n\t/**\n\t * Update statistics based on actual data (called periodically)\n\t * This is a simplified version - a real implementation would sample the data\n\t */\n\tasync updateStatistics(sampleSize = 1000): Promise<void> {\n\t\t// TODO: Implement actual statistics collection by sampling the table\n\t\t// For now, we just update the timestamp\n\t\tthis.stats.lastUpdated = Date.now();\n\t}\n\n\t/**\n\t * Reset statistics\n\t */\n\treset(): void {\n\t\tthis.stats.rowCount = 0;\n\t\tthis.stats.columnStats.clear();\n\t\tfor (let i = 0; i < this.schema.columns.length; i++) {\n\t\t\tthis.stats.columnStats.set(i, {\n\t\t\t\tdistinctCount: 0,\n\t\t\t\tnullCount: 0,\n\t\t\t});\n\t\t}\n\t\tthis.stats.lastUpdated = Date.now();\n\t}\n}\n\n","/**\n * Optimystic Virtual Table Module for Quereus\n *\n * This module implements the VirtualTableModule interface to create\n * virtual tables backed by Optimystic distributed tree collections.\n */\n\nimport { CollectionFactory } from './optimystic-adapter/collection-factory.js';\nimport { TransactionBridge } from './optimystic-adapter/txn-bridge.js';\nimport { OptimysticVirtualTableConnection } from './optimystic-adapter/vtab-connection.js';\nimport type { ParsedOptimysticOptions } from './types.js';\nimport { VirtualTable } from '@quereus/quereus';\nimport type { VirtualTableModule, BaseModuleConfig, Database, TableSchema, Row, FilterInfo, BestAccessPlanRequest, BestAccessPlanResult, OrderingSpec, VirtualTableConnection, TableIndexSchema as IndexSchema, RowOp } from '@quereus/quereus';\nimport { ConflictResolution } from '@quereus/quereus';\n\n/**\n * Arguments passed to VirtualTable.update() method.\n * Mirrors the interface from @quereus/quereus vtab/table.ts\n */\ninterface UpdateArgs {\n\toperation: RowOp;\n\tvalues: Row | undefined;\n\toldKeyValues?: Row;\n\tonConflict?: ConflictResolution;\n\tmutationStatement?: string;\n}\nimport { Tree } from '@optimystic/db-core';\nimport { KeyRange } from '@optimystic/db-core';\nimport { SchemaManager } from './schema/schema-manager.js';\nimport { RowCodec, type EncodedRow } from './schema/row-codec.js';\nimport { SqlDataType } from '@quereus/quereus';\nimport { INTEGER_TYPE, REAL_TYPE, TEXT_TYPE, BLOB_TYPE, NUMERIC_TYPE, NULL_TYPE, BOOLEAN_TYPE, type LogicalType } from '@quereus/quereus';\nimport { IndexManager } from './schema/index-manager.js';\nimport { StatisticsCollector } from './schema/statistics-collector.js';\n\n\n\n/**\n * Configuration interface for Optimystic module\n */\nexport interface OptimysticModuleConfig extends BaseModuleConfig {\n collectionUri: string;\n transactor?: string;\n keyNetwork?: string;\n port?: number;\n networkName?: string;\n cache?: boolean;\n encoding?: 'json' | 'msgpack';\n}\n\nlet instanceCounter = 0;\n\n/**\n * Helper function to convert SqlDataType affinity to LogicalType\n */\nfunction affinityToLogicalType(affinity: SqlDataType): LogicalType {\n\tswitch (affinity) {\n\t\tcase SqlDataType.NULL:\n\t\t\treturn NULL_TYPE;\n\t\tcase SqlDataType.INTEGER:\n\t\t\treturn INTEGER_TYPE;\n\t\tcase SqlDataType.REAL:\n\t\t\treturn REAL_TYPE;\n\t\tcase SqlDataType.TEXT:\n\t\t\treturn TEXT_TYPE;\n\t\tcase SqlDataType.BLOB:\n\t\t\treturn BLOB_TYPE;\n\t\tcase SqlDataType.NUMERIC:\n\t\t\treturn NUMERIC_TYPE;\n\t\tcase SqlDataType.BOOLEAN:\n\t\t\treturn BOOLEAN_TYPE;\n\t\tdefault:\n\t\t\treturn BLOB_TYPE; // Default fallback\n\t}\n}\n\n/**\n * Production-grade virtual table for Optimystic tree collections\n */\nexport class OptimysticVirtualTable extends VirtualTable {\n private instanceId = ++instanceCounter;\n private collection?: Tree<string, any>;\n private isInitialized = false;\n private initializationPromise?: Promise<void>;\n private txnBridge: TransactionBridge;\n private collectionFactory: CollectionFactory;\n private options: ParsedOptimysticOptions;\n private schemaManager: SchemaManager;\n private rowCodec?: RowCodec;\n private indexManager?: IndexManager;\n private statisticsCollector?: StatisticsCollector;\n private connection?: OptimysticVirtualTableConnection;\n public tableSchema: TableSchema; // Changed from private to public to match base class\n\n constructor(\n db: Database,\n module: VirtualTableModule<any, any>,\n schemaName: string,\n tableName: string,\n tableSchema: TableSchema,\n options: ParsedOptimysticOptions,\n collectionFactory: CollectionFactory,\n txnBridge: TransactionBridge,\n schemaManager: SchemaManager\n ) {\n super(db, module, schemaName, tableName);\n this.tableSchema = tableSchema;\n this.options = options;\n this.collectionFactory = collectionFactory;\n this.txnBridge = txnBridge;\n this.schemaManager = schemaManager;\n\n // Enable statement capture for replication/transaction logging\n this.wantStatements = true;\n }\n\n /**\n * Initialize the table and its collection\n */\n async initialize(): Promise<void> {\n if (this.isInitialized) {\n return;\n }\n\n // If initialization is already in progress, wait for it\n if (this.initializationPromise) {\n return this.initializationPromise;\n }\n\n // Start initialization\n this.initializationPromise = this.doInitialize();\n return this.initializationPromise;\n }\n\n /**\n * Internal initialization logic\n */\n private async doInitialize(): Promise<void> {\n try {\n const txnState = this.txnBridge.getCurrentTransaction();\n this.collection = await this.collectionFactory.createOrGetCollection(\n this.options,\n txnState || undefined\n );\n\n // If this is a new table (xCreate), store the schema\n // If connecting to existing table (xConnect), load the schema\n let storedSchema = await this.schemaManager.getSchema(this.tableName, txnState?.transactor);\n\n if (!storedSchema) {\n // New table - store the schema\n if (this.tableSchema.columns.length === 0) {\n throw new Error('Cannot create table without column definitions');\n }\n await this.schemaManager.storeSchema(this.tableSchema, txnState?.transactor);\n storedSchema = await this.schemaManager.getSchema(this.tableName, txnState?.transactor);\n if (!storedSchema) {\n throw new Error('Failed to store and retrieve schema');\n }\n } else {\n // Existing table - update our tableSchema with the loaded schema\n // This is important for connect() which creates a minimal schema\n this.tableSchema.columns = storedSchema.columns.map((col, index) => ({\n name: col.name,\n affinity: col.affinity as any,\n logicalType: affinityToLogicalType(col.affinity as any),\n notNull: col.notNull,\n primaryKey: col.primaryKey,\n pkOrder: col.pkOrder,\n defaultValue: col.defaultValue,\n collation: col.collation,\n generated: col.generated,\n pkDirection: col.pkDirection,\n index,\n }));\n this.tableSchema.columnIndexMap = new Map(\n storedSchema.columns.map((col, index) => [col.name.toLowerCase(), index])\n );\n this.tableSchema.primaryKeyDefinition = storedSchema.primaryKeyDefinition.map(pk => ({\n index: pk.index,\n desc: pk.desc,\n autoIncrement: pk.autoIncrement,\n collation: pk.collation,\n }));\n }\n\n this.rowCodec = new RowCodec(storedSchema, this.options.encoding);\n\n // Create and initialize index manager\n this.indexManager = new IndexManager(storedSchema, async (indexName, transactor) => {\n const indexOptions: ParsedOptimysticOptions = {\n ...this.options,\n collectionUri: `${this.options.collectionUri}/index/${indexName}`,\n };\n const tree = await this.collectionFactory.createOrGetCollection(\n indexOptions,\n transactor ? { transactor, isActive: true, collections: new Map(), transactionId: '' } : undefined\n );\n // Index trees store string->string mappings (IndexKey->PrimaryKey)\n return tree as unknown as Tree<string, string>;\n });\n\n await this.indexManager.initialize(txnState?.transactor);\n\n // Create statistics collector\n this.statisticsCollector = new StatisticsCollector(storedSchema);\n\n this.isInitialized = true;\n } catch (error) {\n const message = `Failed to initialize Optimystic table: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n\n /**\n * Disconnects from this virtual table connection instance\n * Note: We don't reset isInitialized or collection here because the table\n * should remain initialized across multiple statements/connections\n */\n async disconnect(): Promise<void> {\n // Don't reset state - the table should remain initialized\n }\n\n /**\n * Ensures a connection is established and registered with the database\n * This is called automatically on first table access, but can also be called\n * explicitly to register the connection early (e.g., for transaction support)\n */\n async ensureConnectionRegistered(): Promise<OptimysticVirtualTableConnection> {\n if (!this.connection) {\n // Check if there's already an active connection for this table in the database\n // Using type assertion to access internal methods\n const db = this.db as any;\n const existingConnections = db.getConnectionsForTable(this.tableName);\n if (existingConnections.length > 0 && existingConnections[0] instanceof OptimysticVirtualTableConnection) {\n this.connection = existingConnections[0] as OptimysticVirtualTableConnection;\n } else {\n // Create a new connection and register it with the database\n this.connection = new OptimysticVirtualTableConnection(this.tableName, this.txnBridge, this.options);\n await db.registerConnection(this.connection);\n }\n }\n return this.connection;\n }\n\n /**\n * Creates a new VirtualTableConnection for transaction support\n */\n createConnection(): VirtualTableConnection {\n return new OptimysticVirtualTableConnection(this.tableName, this.txnBridge, this.options);\n }\n\n /**\n * Gets the current connection if this table maintains one internally\n */\n getConnection(): VirtualTableConnection | undefined {\n return this.connection;\n }\n\n /**\n * Opens a direct data stream for this virtual table based on filter criteria\n */\n async* query(filterInfo: FilterInfo): AsyncIterable<Row> {\n // Ensure connection is registered\n await this.ensureConnectionRegistered();\n\n // Wait for initialization if needed\n if (!this.isInitialized) {\n await this.initialize();\n }\n\n if (!this.collection || !this.rowCodec || !this.indexManager) {\n throw new Error('Table not initialized');\n }\n\n try {\n // Parse idxStr to determine access strategy\n // Quereus uses idxStr like 'idx=_primary_(0);plan=2' for equality seeks\n const planType = this.parsePlanType(filterInfo.idxStr);\n\n if (planType === 2 && filterInfo.args.length > 0) {\n // Primary key equality seek (plan=2)\n yield* this.executePointLookup(String(filterInfo.args[0]));\n } else if (planType === 3) {\n // Range query on primary key (plan=3)\n yield* this.executeRangeQuery(filterInfo);\n } else if (filterInfo.idxNum === 1) {\n // Legacy: Point lookup on primary key\n yield* this.executePointLookup(filterInfo.args[0] ? String(filterInfo.args[0]) : '');\n } else if (filterInfo.idxNum === 2) {\n // Legacy: Range query on primary key\n yield* this.executeRangeQuery(filterInfo);\n } else if (filterInfo.idxNum >= 10) {\n // Index-based scan\n const indexName = filterInfo.idxStr;\n if (!indexName || typeof indexName !== 'string') {\n throw new Error('Index name not provided for index scan');\n }\n yield* this.executeIndexScan(indexName, filterInfo.args);\n } else {\n // Full table scan\n yield* this.executeTableScan();\n }\n } catch (error) {\n const message = `Query failed: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n\n /**\n * Parse the plan type from idxStr\n * Quereus uses format like 'idx=_primary_(0);plan=2'\n */\n private parsePlanType(idxStr: string | null): number | undefined {\n if (!idxStr) return undefined;\n const match = idxStr.match(/plan=(\\d+)/);\n return match?.[1] ? parseInt(match[1], 10) : undefined;\n }\n\n /**\n * Execute a point lookup query\n */\n private async* executePointLookup(key: string): AsyncIterable<Row> {\n if (!this.collection || !this.rowCodec) return;\n\n // Update from network to get latest data\n await this.collection.update();\n\n const path = await this.collection.find(key);\n if (!this.collection.isValid(path)) {\n return;\n }\n\n const entry = this.collection.at(path) as [string, EncodedRow] | undefined;\n if (entry && entry.length >= 2) {\n const encodedRow = entry[1];\n const row = this.rowCodec.decodeRow(encodedRow);\n yield row;\n }\n }\n\n /**\n * Execute a range query\n */\n private async* executeRangeQuery(_filterInfo: FilterInfo): AsyncIterable<Row> {\n if (!this.collection) return;\n\n // For now, fall back to full scan\n // TODO: Implement proper range queries based on filter args\n yield* this.executeTableScan();\n }\n\n /**\n * Execute an index-based scan\n */\n private async* executeIndexScan(indexName: string, args: readonly unknown[]): AsyncIterable<Row> {\n if (!this.collection || !this.rowCodec || !this.indexManager) return;\n\n const indexSchema = this.indexManager.getIndexSchema(indexName);\n if (!indexSchema) {\n throw new Error(`Index not found: ${indexName}`);\n }\n\n // Build index key from constraint values\n // args contains the values for the matched constraints in order\n const indexKeyParts: string[] = [];\n for (let i = 0; i < args.length && i < indexSchema.columns.length; i++) {\n const value = args[i];\n indexKeyParts.push(this.serializeValueForIndex(value));\n }\n\n const indexKey = indexKeyParts.join('\\x00');\n\n // Look up primary keys using the index\n for await (const primaryKey of this.indexManager.findByIndex(indexName, indexKey)) {\n // Fetch the row from the main table using the primary key\n const path = await this.collection.find(primaryKey);\n if (!this.collection.isValid(path)) {\n continue;\n }\n\n const entry = this.collection.at(path) as [string, any];\n if (entry && entry.length >= 2) {\n const encodedRow = entry[1];\n const row = this.rowCodec.decodeRow(encodedRow);\n yield row;\n }\n }\n }\n\n /**\n * Serialize a value for use in index key (helper for executeIndexScan)\n */\n private serializeValueForIndex(value: unknown): string {\n if (value === null || value === undefined) {\n return '\\x01'; // Special marker for NULL\n }\n if (typeof value === 'string') {\n return value;\n }\n if (typeof value === 'number') {\n return value.toExponential(15);\n }\n if (typeof value === 'bigint') {\n return value.toString();\n }\n if (value instanceof Uint8Array) {\n return btoa(String.fromCharCode(...value));\n }\n return String(value);\n }\n\n /**\n * Execute a full table scan with retry on path invalidation\n * In a distributed system, incoming replicated changes can mutate the tree during iteration.\n * This method handles path invalidation by restarting from the last known key.\n */\n private async* executeTableScan(): AsyncIterable<Row> {\n if (!this.collection || !this.rowCodec) return;\n\n // Update from network to get latest data\n await this.collection.update();\n\n const maxRetries = 5;\n let retryCount = 0;\n let lastKey: string | undefined;\n const yieldedKeys = new Set<string>();\n\n while (retryCount < maxRetries) {\n try {\n // Create range starting from lastKey (exclusive) if we're retrying\n const range = lastKey\n ? new KeyRange<string>({ key: lastKey, inclusive: false }, undefined, true)\n : new KeyRange<string>(undefined, undefined, true);\n\n const iterator = this.collection.range(range);\n\n for await (const path of iterator) {\n if (!this.collection.isValid(path)) {\n continue;\n }\n\n const entry = this.collection.at(path);\n if (entry && Array.isArray(entry) && entry.length >= 2) {\n const key = entry[0] as string;\n // Skip if we've already yielded this key (shouldn't happen but safety check)\n if (yieldedKeys.has(key)) {\n lastKey = key;\n continue;\n }\n\n const encodedRow = entry[1];\n const row = this.rowCodec.decodeRow(encodedRow);\n yieldedKeys.add(key);\n lastKey = key;\n yield row;\n }\n }\n // Successfully completed iteration\n return;\n } catch (error) {\n const errorMessage = error instanceof Error ? error.message : String(error);\n if (errorMessage.includes('Path is invalid due to mutation')) {\n // Tree was mutated during iteration, retry from last known position\n retryCount++;\n if (retryCount >= maxRetries) {\n throw new Error(`Table scan failed after ${maxRetries} retries due to concurrent mutations`);\n }\n // Small delay before retry to let mutations settle\n await new Promise(resolve => setTimeout(resolve, 50));\n continue;\n }\n // Re-throw non-mutation errors\n throw error;\n }\n }\n }\n\n /**\n * Performs an INSERT, UPDATE, or DELETE operation\n */\n async update(args: UpdateArgs): Promise<Row | undefined> {\n const { operation, values, oldKeyValues, mutationStatement } = args;\n\n // Ensure connection is registered\n await this.ensureConnectionRegistered();\n\n // Wait for initialization if needed\n if (!this.isInitialized) {\n await this.initialize();\n }\n\n if (!this.collection || !this.rowCodec || !this.indexManager) {\n throw new Error('Table not initialized');\n }\n\n // Capture the mutation statement if provided (for transaction replication)\n if (mutationStatement) {\n this.txnBridge.addStatement(mutationStatement);\n }\n\n const txnState = this.txnBridge.getCurrentTransaction();\n\n try {\n switch (operation) {\n case 'insert':\n if (!values) {\n throw new Error('INSERT requires values');\n }\n {\n const insertKey = this.rowCodec.extractPrimaryKey(values);\n const encodedRow = this.rowCodec.encodeRow(values);\n\n // Insert into main table\n // Entry format: [primaryKey, encodedRow]\n await this.collection.replace([[insertKey, [insertKey, encodedRow]]]);\n\n // Insert into all indexes\n await this.indexManager.insertIndexEntries(values, insertKey, txnState?.transactor);\n\n // Update statistics\n this.statisticsCollector?.incrementRowCount();\n\n return values;\n }\n\n case 'update':\n if (!values) {\n throw new Error('UPDATE requires values');\n }\n if (!oldKeyValues) {\n throw new Error('UPDATE requires old key values');\n }\n {\n const oldKey = this.rowCodec.extractPrimaryKey(oldKeyValues);\n const newKey = this.rowCodec.extractPrimaryKey(values);\n const encodedRow = this.rowCodec.encodeRow(values);\n\n // Update main table\n if (oldKey !== newKey) {\n // Key changed - delete old, insert new\n await this.collection.replace([\n [oldKey, undefined],\n [newKey, [newKey, encodedRow]]\n ]);\n } else {\n // Simple update\n await this.collection.replace([[newKey, [newKey, encodedRow]]]);\n }\n\n // Update all indexes\n await this.indexManager.updateIndexEntries(\n oldKeyValues,\n values,\n oldKey,\n newKey,\n txnState?.transactor\n );\n\n return values;\n }\n\n case 'delete':\n if (!oldKeyValues) {\n throw new Error('DELETE requires old key values');\n }\n {\n const deleteKey = this.rowCodec.extractPrimaryKey(oldKeyValues);\n\n // Delete from main table\n await this.collection.replace([[deleteKey, undefined]]);\n\n // Delete from all indexes\n await this.indexManager.deleteIndexEntries(oldKeyValues, deleteKey, txnState?.transactor);\n\n // Update statistics\n this.statisticsCollector?.decrementRowCount();\n\n return undefined;\n }\n\n default:\n throw new Error(`Unsupported operation: ${operation}`);\n }\n } catch (error) {\n const message = `${operation} failed: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n\n /**\n * Add an index to the table schema\n */\n async addIndex(indexSchema: IndexSchema): Promise<void> {\n // Wait for initialization if needed\n if (!this.isInitialized) {\n await this.initialize();\n }\n\n if (!this.schemaManager || !this.indexManager) {\n throw new Error('Table not initialized');\n }\n\n // Update the stored schema with the new index\n const storedSchema = await this.schemaManager.getSchema(this.tableName);\n if (!storedSchema) {\n throw new Error('Schema not found');\n }\n\n // Add the index to the stored schema\n const updatedSchema = {\n ...storedSchema,\n indexes: [...storedSchema.indexes, {\n name: indexSchema.name,\n columns: indexSchema.columns.map((col: { index: number; desc?: boolean; collation?: string }) => ({\n index: col.index,\n desc: col.desc,\n collation: col.collation,\n })),\n }],\n };\n\n // Save the updated schema\n const txnState = this.txnBridge.getCurrentTransaction();\n await this.schemaManager.storeSchema({\n ...this.tableSchema,\n indexes: updatedSchema.indexes.map(idx => ({\n name: idx.name,\n columns: idx.columns,\n })),\n }, txnState?.transactor);\n\n // Initialize the new index tree\n const indexTreeFactory = async (indexName: string, transactor?: any) => {\n const indexOptions: ParsedOptimysticOptions = {\n ...this.options,\n collectionUri: `${this.options.collectionUri}/index/${indexName}`,\n };\n const tree = await this.collectionFactory.createOrGetCollection(\n indexOptions,\n transactor ? { transactor, isActive: true, collections: new Map(), transactionId: '' } : undefined\n );\n return tree as unknown as Tree<string, string>;\n };\n\n const indexTree = await indexTreeFactory(indexSchema.name, txnState?.transactor);\n\n // Add the index to the index manager\n if (this.indexManager) {\n (this.indexManager as any).indexTrees.set(indexSchema.name, indexTree);\n (this.indexManager as any).schema = updatedSchema;\n }\n\n // Populate the index with existing data\n if (this.collection && this.rowCodec) {\n const firstPath = await this.collection.first();\n for await (const path of this.collection.ascending(firstPath)) {\n const encodedRow = this.collection.at(path);\n if (encodedRow) {\n const row = this.rowCodec.decodeRow(encodedRow);\n const primaryKey = this.rowCodec.extractPrimaryKey(row);\n await this.indexManager.insertIndexEntries(row, primaryKey, txnState?.transactor);\n }\n }\n }\n }\n\n /**\n * Begin a transaction on this virtual table\n */\n async begin(): Promise<void> {\n try {\n await this.ensureConnectionRegistered();\n await this.txnBridge.beginTransaction(this.options);\n } catch (error) {\n const message = `Begin transaction failed: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n\n /**\n * Commit the virtual table transaction\n */\n async commit(): Promise<void> {\n try {\n await this.txnBridge.commitTransaction();\n } catch (error) {\n const message = `Commit transaction failed: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n\n /**\n * Rollback the virtual table transaction\n */\n async rollback(): Promise<void> {\n try {\n await this.txnBridge.rollbackTransaction();\n } catch (error) {\n const message = `Rollback transaction failed: ${error instanceof Error ? error.message : String(error)}`;\n this.setErrorMessage(message);\n throw new Error(message);\n }\n }\n}\n\n/**\n * Optimystic Virtual Table Module\n */\nexport class OptimysticModule implements VirtualTableModule<OptimysticVirtualTable, OptimysticModuleConfig> {\n private schemaManager: SchemaManager;\n private tables = new Map<string, OptimysticVirtualTable>();\n\n constructor(\n private collectionFactory: CollectionFactory,\n private txnBridge: TransactionBridge\n ) {\n // Schema manager will be created per-table with appropriate transactor settings\n this.schemaManager = new SchemaManager(async (_transactor) => {\n throw new Error('Schema manager not initialized - this should not be called');\n });\n }\n\n /**\n * Create a schema manager for a specific table's transactor configuration\n */\n private createSchemaManager(tableOptions: ParsedOptimysticOptions): SchemaManager {\n return new SchemaManager(async (transactor) => {\n const schemaOptions: ParsedOptimysticOptions = {\n collectionUri: 'tree://optimystic/schema',\n transactor: tableOptions.transactor,\n keyNetwork: tableOptions.keyNetwork,\n libp2p: tableOptions.libp2p,\n libp2pOptions: tableOptions.libp2pOptions,\n cache: true,\n encoding: 'json',\n };\n return await this.collectionFactory.createOrGetCollection(\n schemaOptions,\n transactor ? { transactor, isActive: true, collections: new Map(), transactionId: '' } : undefined\n );\n });\n }\n\n /**\n * Parse table schema options into configuration\n */\n private parseTableSchema(tableSchema: TableSchema): ParsedOptimysticOptions {\n const args = tableSchema.vtabArgs || {};\n\n // Extract collection URI from first positional argument or use default\n const collectionUri = (args['0'] as string) || `tree://default/${tableSchema.name}`;\n\n // Extract named arguments\n const transactor = (args['transactor'] as string) || 'network';\n const keyNetwork = (args['keyNetwork'] as string) || 'libp2p';\n const port = typeof args['port'] === 'number' ? args['port'] : 0;\n const networkName = (args['networkName'] as string) || 'optimystic';\n const cache = args['cache'] !== false;\n const encoding = (args['encoding'] as 'json' | 'msgpack') || 'json';\n\n const options: ParsedOptimysticOptions = {\n collectionUri,\n transactor,\n keyNetwork,\n libp2pOptions: {\n port,\n networkName,\n bootstrapNodes: [],\n },\n cache,\n encoding,\n };\n\n return options;\n }\n\n /**\n * Creates the persistent definition of a virtual table\n */\n async create(\n db: Database,\n tableSchema: TableSchema\n ): Promise<OptimysticVirtualTable> {\n const tableKey = `${tableSchema.schemaName}.${tableSchema.name}`.toLowerCase();\n\n // Check if table already exists\n if (this.tables.has(tableKey)) {\n throw new Error(`Optimystic table '${tableSchema.name}' already exists in schema '${tableSchema.schemaName}'.`);\n }\n\n const options = this.parseTableSchema(tableSchema);\n const schemaManager = this.createSchemaManager(options);\n const table = new OptimysticVirtualTable(\n db,\n this,\n tableSchema.schemaName || 'main',\n tableSchema.name,\n tableSchema,\n options,\n this.collectionFactory,\n this.txnBridge,\n schemaManager\n );\n\n // Cache the table\n this.tables.set(tableKey, table);\n\n // Initialize table and register connection before returning\n // This ensures the table is fully ready for queries and transactions\n await table.initialize();\n await table.ensureConnectionRegistered();\n\n return table;\n }\n\n /**\n * Connects to an existing virtual table definition\n */\n async connect(\n db: Database,\n _pAux: unknown,\n _moduleName: string,\n schemaName: string,\n tableName: string,\n _options: OptimysticModuleConfig\n ): Promise<OptimysticVirtualTable> {\n const tableKey = `${schemaName}.${tableName}`.toLowerCase();\n const existingTable = this.tables.get(tableKey);\n\n if (!existingTable) {\n throw new Error(`Optimystic table definition for '${tableName}' not found. Cannot connect.`);\n }\n\n // Ensure the table is initialized before returning\n // (should already be initialized from create(), but this handles edge cases)\n await existingTable.initialize();\n\n return existingTable;\n }\n\n /**\n * Creates an index on an Optimystic virtual table\n */\n async createIndex(\n _db: Database,\n schemaName: string,\n tableName: string,\n indexSchema: IndexSchema\n ): Promise<void> {\n const tableKey = `${schemaName}.${tableName}`.toLowerCase();\n const table = this.tables.get(tableKey);\n\n if (!table) {\n throw new Error(`Optimystic table '${tableName}' not found in schema '${schemaName}'. Cannot create index.`);\n }\n\n // Update the stored schema with the new index\n await table.addIndex(indexSchema);\n }\n\n /**\n * Modern access planning interface using BestAccessPlanRequest/Result\n */\n getBestAccessPlan(\n _db: Database,\n tableInfo: TableSchema,\n request: BestAccessPlanRequest\n ): BestAccessPlanResult {\n // Get statistics for cost estimation - note: statisticsCollector is per-table, not per-module\n // For now, use default estimates\n const tableRowCount = tableInfo.estimatedRows || 1000000;\n const tableScanCost = Math.max(1000, tableRowCount);\n\n // Track best plan found\n let bestCost = tableScanCost;\n let bestRows = tableRowCount;\n let bestHandledFilters: boolean[] = request.filters.map(() => false);\n let bestOrdering: OrderingSpec[] | undefined = undefined;\n let bestIsSet = false;\n let bestExplains = `Full table scan (${tableRowCount} rows)`;\n\n // Check primary key constraints first\n const pkColumns = tableInfo.primaryKeyDefinition.map(pk => pk.index);\n for (let i = 0; i < request.filters.length; i++) {\n const filter = request.filters[i];\n if (!filter || !filter.usable) continue;\n\n // Check if this is a primary key column\n const isPkColumn = pkColumns.includes(filter.columnIndex);\n\n if (isPkColumn && filter.op === '=') {\n // Primary key equality - best case: O(log n)\n const pkCost = Math.log2(Math.max(2, tableRowCount)) * 2;\n bestCost = pkCost;\n bestRows = 1;\n bestHandledFilters = request.filters.map((_, idx) => idx === i);\n bestIsSet = true; // PK lookup guarantees unique row\n bestExplains = `Primary key equality seek (cost: ${pkCost.toFixed(2)})`;\n\n // Point lookup always satisfies any ORDER BY (single row)\n if (request.requiredOrdering && request.requiredOrdering.length > 0) {\n bestOrdering = [...request.requiredOrdering];\n }\n break; // Can't get better than this\n } else if (isPkColumn && ['>', '>=', '<', '<='].includes(filter.op)) {\n // Primary key range scan: O(log n + k)\n const selectivity = 0.25; // Heuristic for range queries\n const rangeCost = Math.log2(Math.max(2, tableRowCount)) * 2 + tableRowCount * selectivity;\n const rangeRows = Math.floor(tableRowCount * selectivity);\n\n if (rangeCost < bestCost) {\n bestCost = rangeCost;\n bestRows = rangeRows;\n bestHandledFilters = request.filters.map((_, idx) => idx === i);\n bestIsSet = false;\n bestExplains = `Primary key range scan (selectivity: ${selectivity.toFixed(2)}, cost: ${rangeCost.toFixed(2)})`;\n\n // Check if ORDER BY matches primary key order\n if (request.requiredOrdering && this.orderingMatchesPrimaryKey(request.requiredOrdering, tableInfo)) {\n bestOrdering = [...request.requiredOrdering];\n }\n }\n }\n }\n\n // Check secondary indexes if we haven't found a PK equality match\n if (bestCost > 10 && tableInfo.indexes && tableInfo.indexes.length > 0) {\n for (const index of tableInfo.indexes) {\n // Try to match constraints to this index\n const indexColumns = index.columns.map(col => col.index);\n let selectivity = 1.0;\n let matchedFilterIndices: number[] = [];\n\n // Check if we have equality constraints on the index columns\n for (let colIdx = 0; colIdx < indexColumns.length; colIdx++) {\n const indexCol = indexColumns[colIdx];\n let foundEq = false;\n\n for (let i = 0; i < request.filters.length; i++) {\n const filter = request.filters[i];\n if (!filter || !filter.usable) continue;\n\n if (filter.columnIndex === indexCol && filter.op === '=') {\n matchedFilterIndices.push(i);\n foundEq = true;\n // Each equality constraint reduces selectivity\n const colSelectivity = 0.1; // Heuristic selectivity estimate\n selectivity *= colSelectivity;\n break;\n }\n }\n\n // If we didn't find an equality constraint for this column, stop matching\n if (!foundEq) {\n break;\n }\n }\n\n // Calculate cost and rows for this index\n if (matchedFilterIndices.length > 0) {\n const indexCost = Math.log2(Math.max(2, tableRowCount)) * 2 + tableRowCount * selectivity;\n const indexRows = Math.max(1, Math.floor(tableRowCount * selectivity));\n\n // If this index is better than what we have, use it\n if (indexCost < bestCost) {\n bestCost = indexCost;\n bestRows = indexRows;\n bestHandledFilters = request.filters.map((_, idx) => matchedFilterIndices.includes(idx));\n // Note: IndexSchema doesn't have unique property in quereus 0.4.8, so we can't determine uniqueness\n bestIsSet = false;\n bestExplains = `Index seek on ${index.name} ` +\n `(selectivity: ${selectivity.toFixed(4)}, cost: ${indexCost.toFixed(2)})`;\n\n // Check if ORDER BY matches index order\n if (request.requiredOrdering && this.orderingMatchesIndex(request.requiredOrdering, index)) {\n bestOrdering = [...request.requiredOrdering];\n }\n }\n }\n }\n }\n\n // Return the best access plan found\n return {\n handledFilters: bestHandledFilters,\n cost: bestCost,\n rows: bestRows,\n providesOrdering: bestOrdering,\n isSet: bestIsSet,\n explains: bestExplains,\n };\n }\n\n /**\n * Helper: Check if required ordering matches primary key order\n */\n private orderingMatchesPrimaryKey(\n requiredOrdering: readonly OrderingSpec[],\n tableInfo: TableSchema\n ): boolean {\n const pkColumns = tableInfo.primaryKeyDefinition;\n if (requiredOrdering.length > pkColumns.length) return false;\n\n for (let i = 0; i < requiredOrdering.length; i++) {\n const orderSpec = requiredOrdering[i];\n const pkCol = pkColumns[i];\n\n if (!orderSpec || !pkCol) return false;\n if (orderSpec.columnIndex !== pkCol.index) return false;\n\n // Check if sort direction matches\n const pkDesc = pkCol.desc || false;\n if (orderSpec.desc !== pkDesc) return false;\n }\n\n return true;\n }\n\n /**\n * Helper: Check if required ordering matches index order\n */\n private orderingMatchesIndex(\n requiredOrdering: readonly OrderingSpec[],\n index: { columns: readonly { index: number; desc?: boolean }[] }\n ): boolean {\n if (requiredOrdering.length > index.columns.length) return false;\n\n for (let i = 0; i < requiredOrdering.length; i++) {\n const orderSpec = requiredOrdering[i];\n const indexCol = index.columns[i];\n\n if (!orderSpec || !indexCol) return false;\n if (orderSpec.columnIndex !== indexCol.index) return false;\n\n // Check if sort direction matches\n const indexDesc = indexCol.desc || false;\n if (orderSpec.desc !== indexDesc) return false;\n }\n\n return true;\n }\n\n /**\n * Destroys the underlying persistent representation of the virtual table\n */\n async destroy(\n _db: Database,\n _pAux: unknown,\n _moduleName: string,\n schemaName: string,\n tableName: string\n ): Promise<void> {\n // For now, this is a no-op since we don't have persistent schema storage\n // In a full implementation, this would clean up any metadata or resources\n void schemaName;\n void tableName;\n }\n}\n","import type { SqlValue } from '@quereus/quereus';\nimport type { TransactionBridge } from '../optimystic-adapter/txn-bridge.js';\n\n/**\n * StampId() SQL function\n *\n * Returns the current transaction (stamp) ID if a transaction is active, NULL otherwise.\n * The stamp ID is unique across the distributed system and stable within\n * a transaction, cycling between transactions. It is primarily used for passing\n * to `WITH CONTEXT` clauses to track transaction provenance.\n *\n * Format: 32 bytes base64url encoded\n * - First 16 bytes: SHA-256 hash of peer ID (for distributed uniqueness)\n * - Last 16 bytes: Random bytes (for collision resistance)\n *\n * @returns The current stamp ID string, or NULL if no transaction is active\n */\nexport function createStampIdFunction(txnBridge: TransactionBridge) {\n\treturn function stampId(): SqlValue {\n\t\tconst currentTxn = txnBridge.getCurrentTransaction();\n\n\t\tif (!currentTxn || !currentTxn.isActive) {\n\t\t\treturn null;\n\t\t}\n\n\t\treturn currentTxn.transactionId;\n\t};\n}\n\n","/**\r\n * Quereus Plugin Entry Point for Optimystic\r\n *\r\n * This module provides the plugin registration following Quereus 0.4.5 format.\r\n * All metadata is in package.json - no manifest export needed.\r\n */\r\n\r\nimport type { Database, SqlValue, FunctionFlags } from '@quereus/quereus';\r\nimport { TEXT_TYPE } from '@quereus/quereus';\r\nimport { CollectionFactory } from './optimystic-adapter/collection-factory.js';\r\nimport { TransactionBridge } from './optimystic-adapter/txn-bridge.js';\r\nimport { OptimysticModule } from './optimystic-module.js';\r\nimport { createStampIdFunction } from './functions/transaction-id.js';\r\n\r\n/**\r\n * Plugin registration function\r\n * This is called by Quereus when the plugin is loaded\r\n */\r\nexport default function register(db: Database, config: Record<string, SqlValue> = {}) {\r\n\tif (config.debug) {\r\n\t\tconsole.log('Optimystic plugin loading with config:', config);\r\n\t}\r\n\r\n\t// Global factory instances\r\n\tconst collectionFactory = new CollectionFactory();\r\n\tconst txnBridge = new TransactionBridge(collectionFactory);\r\n\tconst optimysticModule = new OptimysticModule(collectionFactory, txnBridge);\r\n\r\n\t// Create the StampId function\r\n\tconst stampIdFunc = createStampIdFunction(txnBridge);\r\n\r\n\t// Note: Transaction hooks are handled by the virtual table's begin, commit, rollback methods\r\n\r\n\treturn {\r\n\t\tvtables: [\r\n\t\t\t{\r\n\t\t\t\tname: 'optimystic',\r\n\t\t\t\tmodule: optimysticModule,\r\n\t\t\t\tauxData: config,\r\n\t\t\t},\r\n\t\t],\r\n\t\tfunctions: [\r\n\t\t\t{\r\n\t\t\t\tschema: {\r\n\t\t\t\t\tname: 'StampId',\r\n\t\t\t\t\tnumArgs: 0,\r\n\t\t\t\t\tflags: 1 as FunctionFlags, // UTF8\r\n\t\t\t\t\treturnType: {\r\n\t\t\t\t\t\ttypeClass: 'scalar' as const,\r\n\t\t\t\t\t\tlogicalType: TEXT_TYPE,\r\n\t\t\t\t\t\tnullable: true,\r\n\t\t\t\t\t\tisReadOnly: true,\r\n\t\t\t\t\t},\r\n\t\t\t\t\timplementation: stampIdFunc,\r\n\t\t\t\t},\r\n\t\t\t},\r\n\t\t],\r\n\t\tcollations: [],\r\n\t\t// Expose internal components for testing and advanced usage\r\n\t\tcollectionFactory,\r\n\t\ttxnBridge,\r\n\t};\r\n}\r\n\r\n"]}