@sentio/sdk-bundle 2.62.2-rc.6 → 2.62.2-rc.8

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 (80) hide show
  1. package/lib/aptos/builtin/0x1.js +4 -4
  2. package/lib/aptos/builtin/0x3.js +5 -5
  3. package/lib/aptos/builtin/0x4.js +5 -5
  4. package/lib/aptos/builtin/index.js +6 -6
  5. package/lib/aptos/ext/index.js +4 -4
  6. package/lib/aptos/index.js +4 -4
  7. package/lib/{chunk-HUHBVRRW.js → chunk-27BHA5MU.js} +5 -5
  8. package/lib/{chunk-2UL4ETFF.js → chunk-3K57LJQY.js} +2 -1
  9. package/lib/{chunk-JRY6AOMG.js → chunk-4LEM5NVJ.js} +4 -4
  10. package/lib/chunk-6UVWNOIX.js +4207 -0
  11. package/lib/chunk-6UVWNOIX.js.map +1 -0
  12. package/lib/{chunk-UKPEXWMV.js → chunk-7VEIMKBU.js} +2 -2
  13. package/lib/{chunk-XTUGHD43.js → chunk-EBG4LRR2.js} +3 -3
  14. package/lib/{chunk-XPXW5GTG.js → chunk-F6G32WYQ.js} +2 -2
  15. package/lib/{chunk-GHLY3II6.js → chunk-FSSSNDCE.js} +5 -5
  16. package/lib/{chunk-27EI4HXW.js → chunk-GL4M3LCN.js} +3 -3
  17. package/lib/{chunk-ZXBSO43N.js → chunk-HCL7SALX.js} +2 -2
  18. package/lib/{chunk-NXXIE7YU.js → chunk-HGR43RRH.js} +5 -5
  19. package/lib/{chunk-7EBYOGSS.js → chunk-L4TGDLRU.js} +3 -3
  20. package/lib/{chunk-E23JGSY5.js → chunk-MIRGDLI5.js} +6 -6
  21. package/lib/{chunk-JDK2DEIM.js → chunk-MSFFCQH6.js} +2 -2
  22. package/lib/{chunk-ITEA4P7X.js → chunk-PNTP77H3.js} +296 -4485
  23. package/lib/chunk-PNTP77H3.js.map +1 -0
  24. package/lib/{chunk-GG4LFVYB.js → chunk-QU26CCK5.js} +3 -3
  25. package/lib/{chunk-MJ3Y5EIQ.js → chunk-TPNU45PA.js} +4 -4
  26. package/lib/{chunk-XPAVUR3M.js → chunk-WC72O4WS.js} +2 -2
  27. package/lib/{chunk-VWS6HZK2.js → chunk-WSXGLXUY.js} +4 -4
  28. package/lib/{chunk-ROWRZFAB.js → chunk-YSIAUJXF.js} +6 -6
  29. package/lib/core/index.js +1 -1
  30. package/lib/eth/builtin/eacaggregatorproxy.js +2 -2
  31. package/lib/eth/builtin/erc1155.js +3 -3
  32. package/lib/eth/builtin/erc20.js +2 -2
  33. package/lib/eth/builtin/erc721.js +2 -2
  34. package/lib/eth/builtin/index.js +8 -8
  35. package/lib/eth/builtin/weth9.js +3 -3
  36. package/lib/eth/index.js +2 -2
  37. package/lib/fuel/index.js +2 -2
  38. package/lib/index.js +1 -1
  39. package/lib/iota/builtin/0x1.js +7 -7
  40. package/lib/iota/builtin/0x2.js +8 -8
  41. package/lib/iota/builtin/0x3.js +9 -9
  42. package/lib/iota/builtin/index.js +9 -9
  43. package/lib/iota/ext/index.js +4 -4
  44. package/lib/iota/index.js +6 -6
  45. package/lib/move/index.js +2 -2
  46. package/lib/solana/builtin/index.js +3 -2
  47. package/lib/solana/builtin/index.js.map +1 -1
  48. package/lib/solana/index.js +3 -2
  49. package/lib/stark/index.js +25426 -0
  50. package/lib/stark/index.js.map +1 -0
  51. package/lib/store/index.js +1 -1
  52. package/lib/sui/builtin/0x1.js +7 -7
  53. package/lib/sui/builtin/0x2.js +8 -8
  54. package/lib/sui/builtin/0x3.js +9 -9
  55. package/lib/sui/builtin/index.js +9 -9
  56. package/lib/sui/ext/index.js +4 -4
  57. package/lib/sui/index.js +6 -6
  58. package/lib/testing/index.js +67 -8
  59. package/lib/testing/index.js.map +1 -1
  60. package/lib/utils/index.js +2 -2
  61. package/package.json +3 -3
  62. package/lib/chunk-ITEA4P7X.js.map +0 -1
  63. /package/lib/{chunk-HUHBVRRW.js.map → chunk-27BHA5MU.js.map} +0 -0
  64. /package/lib/{chunk-2UL4ETFF.js.map → chunk-3K57LJQY.js.map} +0 -0
  65. /package/lib/{chunk-JRY6AOMG.js.map → chunk-4LEM5NVJ.js.map} +0 -0
  66. /package/lib/{chunk-UKPEXWMV.js.map → chunk-7VEIMKBU.js.map} +0 -0
  67. /package/lib/{chunk-XTUGHD43.js.map → chunk-EBG4LRR2.js.map} +0 -0
  68. /package/lib/{chunk-XPXW5GTG.js.map → chunk-F6G32WYQ.js.map} +0 -0
  69. /package/lib/{chunk-GHLY3II6.js.map → chunk-FSSSNDCE.js.map} +0 -0
  70. /package/lib/{chunk-27EI4HXW.js.map → chunk-GL4M3LCN.js.map} +0 -0
  71. /package/lib/{chunk-ZXBSO43N.js.map → chunk-HCL7SALX.js.map} +0 -0
  72. /package/lib/{chunk-NXXIE7YU.js.map → chunk-HGR43RRH.js.map} +0 -0
  73. /package/lib/{chunk-7EBYOGSS.js.map → chunk-L4TGDLRU.js.map} +0 -0
  74. /package/lib/{chunk-E23JGSY5.js.map → chunk-MIRGDLI5.js.map} +0 -0
  75. /package/lib/{chunk-JDK2DEIM.js.map → chunk-MSFFCQH6.js.map} +0 -0
  76. /package/lib/{chunk-GG4LFVYB.js.map → chunk-QU26CCK5.js.map} +0 -0
  77. /package/lib/{chunk-MJ3Y5EIQ.js.map → chunk-TPNU45PA.js.map} +0 -0
  78. /package/lib/{chunk-XPAVUR3M.js.map → chunk-WC72O4WS.js.map} +0 -0
  79. /package/lib/{chunk-VWS6HZK2.js.map → chunk-WSXGLXUY.js.map} +0 -0
  80. /package/lib/{chunk-ROWRZFAB.js.map → chunk-YSIAUJXF.js.map} +0 -0
package/lib/stark/index.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../../node_modules/.pnpm/punycode@2.3.1/node_modules/punycode/punycode.es6.js","../../../../node_modules/.pnpm/requires-port@1.0.0/node_modules/requires-port/index.js","../../../../node_modules/.pnpm/querystringify@2.2.0/node_modules/querystringify/index.js","../../../../node_modules/.pnpm/url-parse@1.5.10/node_modules/url-parse/index.js","../../../../node_modules/.pnpm/psl@1.9.0/node_modules/psl/data/rules.json","../../../../node_modules/.pnpm/psl@1.9.0/node_modules/psl/index.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/pubsuffix-psl.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/store.js","../../../../node_modules/.pnpm/universalify@0.2.0/node_modules/universalify/index.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/permuteDomain.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/pathMatch.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/utilHelper.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/memstore.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/validators.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/version.js","../../../../node_modules/.pnpm/tough-cookie@4.1.4/node_modules/tough-cookie/lib/cookie.js","../../../../node_modules/.pnpm/set-cookie-parser@2.6.0/node_modules/set-cookie-parser/lib/set-cookie.js","../../../../node_modules/.pnpm/isomorphic-fetch@3.0.0_encoding@0.1.13/node_modules/isomorphic-fetch/fetch-npm-node.js","../../../../node_modules/.pnpm/url-join@4.0.1/node_modules/url-join/lib/url-join.js","../../src/stark/starknet-plugin.ts","../../src/stark/starknet-processor.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/index.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/api/index.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/dist/esm/api/errors.js","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/api/components.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/api/nonspec.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/wallet-api/index.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/wallet-api/constants.ts","../../../../node_modules/.pnpm/@starknet-io+types-js@0.7.10/node_modules/@starknet-io/types-js/src/wallet-api/typedData.ts","../../../../node_modules/.pnpm/@scure+base@1.1.7/node_modules/@scure/base/index.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/abstract/utils.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/_assert.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/_u64.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/cryptoNode.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/utils.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/sha3.ts","../../../../node_modules/.pnpm/@scure+starknet@1.0.0/node_modules/@scure/starknet/lib/esm/index.js","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/_assert.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/_u64.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/cryptoNode.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/utils.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/sha3.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/_sha2.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/sha256.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/abstract/utils.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/abstract/modular.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/abstract/poseidon.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/abstract/curve.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/abstract/weierstrass.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/hmac.ts","../../../../node_modules/.pnpm/@noble+curves@1.3.0/node_modules/@noble/curves/src/_shortw_utils.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/abstract/poseidon.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/abstract/modular.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/abstract/weierstrass.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/abstract/curve.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/utils.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/LosslessNumber.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/numberParsers.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/revive.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/parse.ts","../../../../node_modules/.pnpm/lossless-json@4.0.1/node_modules/lossless-json/src/stringify.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/_md.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/sha256.ts","../../../../node_modules/.pnpm/@noble+hashes@1.4.0/node_modules/@noble/hashes/src/hmac.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/_shortw_utils.ts","../../../../node_modules/.pnpm/@noble+curves@1.4.0/node_modules/@noble/curves/src/secp256k1.ts","../../../../node_modules/.pnpm/fetch-cookie@3.0.1/node_modules/fetch-cookie/esm/index.js","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/constants.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/jsonrpc/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/rpcspec_0_6/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/rpcspec_0_6/errors.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/rpcspec_0_6/components.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/api/rpcspec_0_6/nonspec.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/encode.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/rpc.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/channel/rpc_0_6.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/errors.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/calldata.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/lib/contract/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/lib/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/types/typedData.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/assert.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/num.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/selector.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/shortString.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/byteArray.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/cairo.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/cairoDataTypes/felt.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/cairoDataTypes/uint256.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/cairoDataTypes/uint512.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/enum/CairoCustomEnum.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/enum/CairoOption.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/enum/CairoResult.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/formatter.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/parser/parser-0-1.1.0.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/parser/parser-2.0.0.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/parser/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/tuple.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/propertyOrder.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/requestParser.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/responseParser.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/validate.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/calldata/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/transactionHash/v2.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/ec.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/transactionHash/v3.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/transactionHash/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/hash/classHash.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/json.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/stark.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/contract.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/eth.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/fetchPonyfill.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/provider.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/transaction.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/channel/rpc_0_7.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/responseParser/rpc.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/transactionReceipt.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/extensions/default.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/starknetId.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/extensions/starknetId.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/interface.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/provider/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/signer/interface.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/typedData.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/merkle.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/signer/default.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/signer/ethSigner.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/uint256.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/events/index.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/account/default.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/account/interface.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/wallet/connect.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/wallet/account.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/contract/default.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/contract/interface.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/contract/contractFactory.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/responseParser/interface.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/address.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/utils/url.ts","../../../../node_modules/.pnpm/starknet@6.11.0_encoding@0.1.13/node_modules/starknet/src/index.ts","../../../../node_modules/.pnpm/ts-mixer@6.0.4/node_modules/ts-mixer/dist/esm/index.js","../../src/stark/contract.ts","../../src/stark/context.ts","../../src/stark/event.ts","../../src/stark/index.ts","../../src/stark/types.ts"],"sourcesContent":["'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = callback(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n\tconst parts = domain.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tdomain = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tdomain = domain.replace(regexSeparators, '\\x2E');\n\tconst labels = domain.split('.');\n\tconst encoded = map(labels, callback).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint >= 0x30 && codePoint < 0x3A) {\n\t\treturn 26 + (codePoint - 0x30);\n\t}\n\tif (codePoint >= 0x41 && codePoint < 0x5B) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint >= 0x61 && codePoint < 0x7B) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t// 0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tconst oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\t\t\tif (digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tconst inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tconst basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue === n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.3.1',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };\nexport default punycode;\n","'use strict';\n\n/**\n * Check if we're required to add a port number.\n *\n * @see https://url.spec.whatwg.org/#default-port\n * @param {Number|String} port Port number we need to check\n * @param {String} protocol Protocol we need to check against.\n * @returns {Boolean} Is it a default port for the given protocol\n * @api private\n */\nmodule.exports = function required(port, protocol) {\n protocol = protocol.split(':')[0];\n port = +port;\n\n if (!port) return false;\n\n switch (protocol) {\n case 'http':\n case 'ws':\n return port !== 80;\n\n case 'https':\n case 'wss':\n return port !== 443;\n\n case 'ftp':\n return port !== 21;\n\n case 'gopher':\n return port !== 70;\n\n case 'file':\n return false;\n }\n\n return port !== 0;\n};\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , undef;\n\n/**\n * Decode a URI encoded string.\n *\n * @param {String} input The URI encoded string.\n * @returns {String|Null} The decoded string.\n * @api private\n */\nfunction decode(input) {\n try {\n return decodeURIComponent(input.replace(/\\+/g, ' '));\n } catch (e) {\n return null;\n }\n}\n\n/**\n * Attempts to encode a given input.\n *\n * @param {String} input The string that needs to be encoded.\n * @returns {String|Null} The encoded string.\n * @api private\n */\nfunction encode(input) {\n try {\n return encodeURIComponent(input);\n } catch (e) {\n return null;\n }\n}\n\n/**\n * Simple query string parser.\n *\n * @param {String} query The query string that needs to be parsed.\n * @returns {Object}\n * @api public\n */\nfunction querystring(query) {\n var parser = /([^=?#&]+)=?([^&]*)/g\n , result = {}\n , part;\n\n while (part = parser.exec(query)) {\n var key = decode(part[1])\n , value = decode(part[2]);\n\n //\n // Prevent overriding of existing properties. This ensures that build-in\n // methods like `toString` or __proto__ are not overriden by malicious\n // querystrings.\n //\n // In the case if failed decoding, we want to omit the key/value pairs\n // from the result.\n //\n if (key === null || value === null || key in result) continue;\n result[key] = value;\n }\n\n return result;\n}\n\n/**\n * Transform a query string to an object.\n *\n * @param {Object} obj Object that should be transformed.\n * @param {String} prefix Optional prefix.\n * @returns {String}\n * @api public\n */\nfunction querystringify(obj, prefix) {\n prefix = prefix || '';\n\n var pairs = []\n , value\n , key;\n\n //\n // Optionally prefix with a '?' if needed\n //\n if ('string' !== typeof prefix) prefix = '?';\n\n for (key in obj) {\n if (has.call(obj, key)) {\n value = obj[key];\n\n //\n // Edge cases where we actually want to encode the value to an empty\n // string instead of the stringified value.\n //\n if (!value && (value === null || value === undef || isNaN(value))) {\n value = '';\n }\n\n key = encode(key);\n value = encode(value);\n\n //\n // If we failed to encode the strings, we should bail out as we don't\n // want to add invalid strings to the query.\n //\n if (key === null || value === null) continue;\n pairs.push(key +'='+ value);\n }\n }\n\n return pairs.length ? prefix + pairs.join('&') : '';\n}\n\n//\n// Expose the module.\n//\nexports.stringify = querystringify;\nexports.parse = querystring;\n","'use strict';\n\nvar required = require('requires-port')\n , qs = require('querystringify')\n , controlOrWhitespace = /^[\\x00-\\x20\\u00a0\\u1680\\u2000-\\u200a\\u2028\\u2029\\u202f\\u205f\\u3000\\ufeff]+/\n , CRHTLF = /[\\n\\r\\t]/g\n , slashes = /^[A-Za-z][A-Za-z0-9+-.]*:\\/\\//\n , port = /:\\d+$/\n , protocolre = /^([a-z][a-z0-9.+-]*:)?(\\/\\/)?([\\\\/]+)?([\\S\\s]*)/i\n , windowsDriveLetter = /^[a-zA-Z]:/;\n\n/**\n * Remove control characters and whitespace from the beginning of a string.\n *\n * @param {Object|String} str String to trim.\n * @returns {String} A new string representing `str` stripped of control\n * characters and whitespace from its beginning.\n * @public\n */\nfunction trimLeft(str) {\n return (str ? str : '').toString().replace(controlOrWhitespace, '');\n}\n\n/**\n * These are the parse rules for the URL parser, it informs the parser\n * about:\n *\n * 0. The char it Needs to parse, if it's a string it should be done using\n * indexOf, RegExp using exec and NaN means set as current value.\n * 1. The property we should set when parsing this value.\n * 2. Indication if it's backwards or forward parsing, when set as number it's\n * the value of extra chars that should be split off.\n * 3. Inherit from location if non existing in the parser.\n * 4. `toLowerCase` the resulting value.\n */\nvar rules = [\n ['#', 'hash'], // Extract from the back.\n ['?', 'query'], // Extract from the back.\n function sanitize(address, url) { // Sanitize what is left of the address\n return isSpecial(url.protocol) ? address.replace(/\\\\/g, '/') : address;\n },\n ['/', 'pathname'], // Extract from the back.\n ['@', 'auth', 1], // Extract from the front.\n [NaN, 'host', undefined, 1, 1], // Set left over value.\n [/:(\\d*)$/, 'port', undefined, 1], // RegExp the back.\n [NaN, 'hostname', undefined, 1, 1] // Set left over.\n];\n\n/**\n * These properties should not be copied or inherited from. This is only needed\n * for all non blob URL's as a blob URL does not include a hash, only the\n * origin.\n *\n * @type {Object}\n * @private\n */\nvar ignore = { hash: 1, query: 1 };\n\n/**\n * The location object differs when your code is loaded through a normal page,\n * Worker or through a worker using a blob. And with the blobble begins the\n * trouble as the location object will contain the URL of the blob, not the\n * location of the page where our code is loaded in. The actual origin is\n * encoded in the `pathname` so we can thankfully generate a good \"default\"\n * location from it so we can generate proper relative URL's again.\n *\n * @param {Object|String} loc Optional default location object.\n * @returns {Object} lolcation object.\n * @public\n */\nfunction lolcation(loc) {\n var globalVar;\n\n if (typeof window !== 'undefined') globalVar = window;\n else if (typeof global !== 'undefined') globalVar = global;\n else if (typeof self !== 'undefined') globalVar = self;\n else globalVar = {};\n\n var location = globalVar.location || {};\n loc = loc || location;\n\n var finaldestination = {}\n , type = typeof loc\n , key;\n\n if ('blob:' === loc.protocol) {\n finaldestination = new Url(unescape(loc.pathname), {});\n } else if ('string' === type) {\n finaldestination = new Url(loc, {});\n for (key in ignore) delete finaldestination[key];\n } else if ('object' === type) {\n for (key in loc) {\n if (key in ignore) continue;\n finaldestination[key] = loc[key];\n }\n\n if (finaldestination.slashes === undefined) {\n finaldestination.slashes = slashes.test(loc.href);\n }\n }\n\n return finaldestination;\n}\n\n/**\n * Check whether a protocol scheme is special.\n *\n * @param {String} The protocol scheme of the URL\n * @return {Boolean} `true` if the protocol scheme is special, else `false`\n * @private\n */\nfunction isSpecial(scheme) {\n return (\n scheme === 'file:' ||\n scheme === 'ftp:' ||\n scheme === 'http:' ||\n scheme === 'https:' ||\n scheme === 'ws:' ||\n scheme === 'wss:'\n );\n}\n\n/**\n * @typedef ProtocolExtract\n * @type Object\n * @property {String} protocol Protocol matched in the URL, in lowercase.\n * @property {Boolean} slashes `true` if protocol is followed by \"//\", else `false`.\n * @property {String} rest Rest of the URL that is not part of the protocol.\n */\n\n/**\n * Extract protocol information from a URL with/without double slash (\"//\").\n *\n * @param {String} address URL we want to extract from.\n * @param {Object} location\n * @return {ProtocolExtract} Extracted information.\n * @private\n */\nfunction extractProtocol(address, location) {\n address = trimLeft(address);\n address = address.replace(CRHTLF, '');\n location = location || {};\n\n var match = protocolre.exec(address);\n var protocol = match[1] ? match[1].toLowerCase() : '';\n var forwardSlashes = !!match[2];\n var otherSlashes = !!match[3];\n var slashesCount = 0;\n var rest;\n\n if (forwardSlashes) {\n if (otherSlashes) {\n rest = match[2] + match[3] + match[4];\n slashesCount = match[2].length + match[3].length;\n } else {\n rest = match[2] + match[4];\n slashesCount = match[2].length;\n }\n } else {\n if (otherSlashes) {\n rest = match[3] + match[4];\n slashesCount = match[3].length;\n } else {\n rest = match[4]\n }\n }\n\n if (protocol === 'file:') {\n if (slashesCount >= 2) {\n rest = rest.slice(2);\n }\n } else if (isSpecial(protocol)) {\n rest = match[4];\n } else if (protocol) {\n if (forwardSlashes) {\n rest = rest.slice(2);\n }\n } else if (slashesCount >= 2 && isSpecial(location.protocol)) {\n rest = match[4];\n }\n\n return {\n protocol: protocol,\n slashes: forwardSlashes || isSpecial(protocol),\n slashesCount: slashesCount,\n rest: rest\n };\n}\n\n/**\n * Resolve a relative URL pathname against a base URL pathname.\n *\n * @param {String} relative Pathname of the relative URL.\n * @param {String} base Pathname of the base URL.\n * @return {String} Resolved pathname.\n * @private\n */\nfunction resolve(relative, base) {\n if (relative === '') return base;\n\n var path = (base || '/').split('/').slice(0, -1).concat(relative.split('/'))\n , i = path.length\n , last = path[i - 1]\n , unshift = false\n , up = 0;\n\n while (i--) {\n if (path[i] === '.') {\n path.splice(i, 1);\n } else if (path[i] === '..') {\n path.splice(i, 1);\n up++;\n } else if (up) {\n if (i === 0) unshift = true;\n path.splice(i, 1);\n up--;\n }\n }\n\n if (unshift) path.unshift('');\n if (last === '.' || last === '..') path.push('');\n\n return path.join('/');\n}\n\n/**\n * The actual URL instance. Instead of returning an object we've opted-in to\n * create an actual constructor as it's much more memory efficient and\n * faster and it pleases my OCD.\n *\n * It is worth noting that we should not use `URL` as class name to prevent\n * clashes with the global URL instance that got introduced in browsers.\n *\n * @constructor\n * @param {String} address URL we want to parse.\n * @param {Object|String} [location] Location defaults for relative paths.\n * @param {Boolean|Function} [parser] Parser for the query string.\n * @private\n */\nfunction Url(address, location, parser) {\n address = trimLeft(address);\n address = address.replace(CRHTLF, '');\n\n if (!(this instanceof Url)) {\n return new Url(address, location, parser);\n }\n\n var relative, extracted, parse, instruction, index, key\n , instructions = rules.slice()\n , type = typeof location\n , url = this\n , i = 0;\n\n //\n // The following if statements allows this module two have compatibility with\n // 2 different API:\n //\n // 1. Node.js's `url.parse` api which accepts a URL, boolean as arguments\n // where the boolean indicates that the query string should also be parsed.\n //\n // 2. The `URL` interface of the browser which accepts a URL, object as\n // arguments. The supplied object will be used as default values / fall-back\n // for relative paths.\n //\n if ('object' !== type && 'string' !== type) {\n parser = location;\n location = null;\n }\n\n if (parser && 'function' !== typeof parser) parser = qs.parse;\n\n location = lolcation(location);\n\n //\n // Extract protocol information before running the instructions.\n //\n extracted = extractProtocol(address || '', location);\n relative = !extracted.protocol && !extracted.slashes;\n url.slashes = extracted.slashes || relative && location.slashes;\n url.protocol = extracted.protocol || location.protocol || '';\n address = extracted.rest;\n\n //\n // When the authority component is absent the URL starts with a path\n // component.\n //\n if (\n extracted.protocol === 'file:' && (\n extracted.slashesCount !== 2 || windowsDriveLetter.test(address)) ||\n (!extracted.slashes &&\n (extracted.protocol ||\n extracted.slashesCount < 2 ||\n !isSpecial(url.protocol)))\n ) {\n instructions[3] = [/(.*)/, 'pathname'];\n }\n\n for (; i < instructions.length; i++) {\n instruction = instructions[i];\n\n if (typeof instruction === 'function') {\n address = instruction(address, url);\n continue;\n }\n\n parse = instruction[0];\n key = instruction[1];\n\n if (parse !== parse) {\n url[key] = address;\n } else if ('string' === typeof parse) {\n index = parse === '@'\n ? address.lastIndexOf(parse)\n : address.indexOf(parse);\n\n if (~index) {\n if ('number' === typeof instruction[2]) {\n url[key] = address.slice(0, index);\n address = address.slice(index + instruction[2]);\n } else {\n url[key] = address.slice(index);\n address = address.slice(0, index);\n }\n }\n } else if ((index = parse.exec(address))) {\n url[key] = index[1];\n address = address.slice(0, index.index);\n }\n\n url[key] = url[key] || (\n relative && instruction[3] ? location[key] || '' : ''\n );\n\n //\n // Hostname, host and protocol should be lowercased so they can be used to\n // create a proper `origin`.\n //\n if (instruction[4]) url[key] = url[key].toLowerCase();\n }\n\n //\n // Also parse the supplied query string in to an object. If we're supplied\n // with a custom parser as function use that instead of the default build-in\n // parser.\n //\n if (parser) url.query = parser(url.query);\n\n //\n // If the URL is relative, resolve the pathname against the base URL.\n //\n if (\n relative\n && location.slashes\n && url.pathname.charAt(0) !== '/'\n && (url.pathname !== '' || location.pathname !== '')\n ) {\n url.pathname = resolve(url.pathname, location.pathname);\n }\n\n //\n // Default to a / for pathname if none exists. This normalizes the URL\n // to always have a /\n //\n if (url.pathname.charAt(0) !== '/' && isSpecial(url.protocol)) {\n url.pathname = '/' + url.pathname;\n }\n\n //\n // We should not add port numbers if they are already the default port number\n // for a given protocol. As the host also contains the port number we're going\n // override it with the hostname which contains no port number.\n //\n if (!required(url.port, url.protocol)) {\n url.host = url.hostname;\n url.port = '';\n }\n\n //\n // Parse down the `auth` for the username and password.\n //\n url.username = url.password = '';\n\n if (url.auth) {\n index = url.auth.indexOf(':');\n\n if (~index) {\n url.username = url.auth.slice(0, index);\n url.username = encodeURIComponent(decodeURIComponent(url.username));\n\n url.password = url.auth.slice(index + 1);\n url.password = encodeURIComponent(decodeURIComponent(url.password))\n } else {\n url.username = encodeURIComponent(decodeURIComponent(url.auth));\n }\n\n url.auth = url.password ? url.username +':'+ url.password : url.username;\n }\n\n url.origin = url.protocol !== 'file:' && isSpecial(url.protocol) && url.host\n ? url.protocol +'//'+ url.host\n : 'null';\n\n //\n // The href is just the compiled result.\n //\n url.href = url.toString();\n}\n\n/**\n * This is convenience method for changing properties in the URL instance to\n * insure that they all propagate correctly.\n *\n * @param {String} part Property we need to adjust.\n * @param {Mixed} value The newly assigned value.\n * @param {Boolean|Function} fn When setting the query, it will be the function\n * used to parse the query.\n * When setting the protocol, double slash will be\n * removed from the final url if it is true.\n * @returns {URL} URL instance for chaining.\n * @public\n */\nfunction set(part, value, fn) {\n var url = this;\n\n switch (part) {\n case 'query':\n if ('string' === typeof value && value.length) {\n value = (fn || qs.parse)(value);\n }\n\n url[part] = value;\n break;\n\n case 'port':\n url[part] = value;\n\n if (!required(value, url.protocol)) {\n url.host = url.hostname;\n url[part] = '';\n } else if (value) {\n url.host = url.hostname +':'+ value;\n }\n\n break;\n\n case 'hostname':\n url[part] = value;\n\n if (url.port) value += ':'+ url.port;\n url.host = value;\n break;\n\n case 'host':\n url[part] = value;\n\n if (port.test(value)) {\n value = value.split(':');\n url.port = value.pop();\n url.hostname = value.join(':');\n } else {\n url.hostname = value;\n url.port = '';\n }\n\n break;\n\n case 'protocol':\n url.protocol = value.toLowerCase();\n url.slashes = !fn;\n break;\n\n case 'pathname':\n case 'hash':\n if (value) {\n var char = part === 'pathname' ? '/' : '#';\n url[part] = value.charAt(0) !== char ? char + value : value;\n } else {\n url[part] = value;\n }\n break;\n\n case 'username':\n case 'password':\n url[part] = encodeURIComponent(value);\n break;\n\n case 'auth':\n var index = value.indexOf(':');\n\n if (~index) {\n url.username = value.slice(0, index);\n url.username = encodeURIComponent(decodeURIComponent(url.username));\n\n url.password = value.slice(index + 1);\n url.password = encodeURIComponent(decodeURIComponent(url.password));\n } else {\n url.username = encodeURIComponent(decodeURIComponent(value));\n }\n }\n\n for (var i = 0; i < rules.length; i++) {\n var ins = rules[i];\n\n if (ins[4]) url[ins[1]] = url[ins[1]].toLowerCase();\n }\n\n url.auth = url.password ? url.username +':'+ url.password : url.username;\n\n url.origin = url.protocol !== 'file:' && isSpecial(url.protocol) && url.host\n ? url.protocol +'//'+ url.host\n : 'null';\n\n url.href = url.toString();\n\n return url;\n}\n\n/**\n * Transform the properties back in to a valid and full URL string.\n *\n * @param {Function} stringify Optional query stringify function.\n * @returns {String} Compiled version of the URL.\n * @public\n */\nfunction toString(stringify) {\n if (!stringify || 'function' !== typeof stringify) stringify = qs.stringify;\n\n var query\n , url = this\n , host = url.host\n , protocol = url.protocol;\n\n if (protocol && protocol.charAt(protocol.length - 1) !== ':') protocol += ':';\n\n var result =\n protocol +\n ((url.protocol && url.slashes) || isSpecial(url.protocol) ? '//' : '');\n\n if (url.username) {\n result += url.username;\n if (url.password) result += ':'+ url.password;\n result += '@';\n } else if (url.password) {\n result += ':'+ url.password;\n result += '@';\n } else if (\n url.protocol !== 'file:' &&\n isSpecial(url.protocol) &&\n !host &&\n url.pathname !== '/'\n ) {\n //\n // Add back the empty userinfo, otherwise the original invalid URL\n // might be transformed into a valid one with `url.pathname` as host.\n //\n result += '@';\n }\n\n //\n // Trailing colon is removed from `url.host` when it is parsed. If it still\n // ends with a colon, then add back the trailing colon that was removed. This\n // prevents an invalid URL from being transformed into a valid one.\n //\n if (host[host.length - 1] === ':' || (port.test(url.hostname) && !url.port)) {\n host += ':';\n }\n\n result += host + url.pathname;\n\n query = 'object' === typeof url.query ? stringify(url.query) : url.query;\n if (query) result += '?' !== query.charAt(0) ? '?'+ query : query;\n\n if (url.hash) result += url.hash;\n\n return result;\n}\n\nUrl.prototype = { set: set, toString: toString };\n\n//\n// Expose the URL parser and some additional properties that might be useful for\n// others or testing.\n//\nUrl.extractProtocol = extractProtocol;\nUrl.location = lolcation;\nUrl.trimLeft = trimLeft;\nUrl.qs = qs;\n\nmodule.exports = Url;\n","[\n\"ac\",\n\"com.ac\",\n\"edu.ac\",\n\"gov.ac\",\n\"net.ac\",\n\"mil.ac\",\n\"org.ac\",\n\"ad\",\n\"nom.ad\",\n\"ae\",\n\"co.ae\",\n\"net.ae\",\n\"org.ae\",\n\"sch.ae\",\n\"ac.ae\",\n\"gov.ae\",\n\"mil.ae\",\n\"aero\",\n\"accident-investigation.aero\",\n\"accident-prevention.aero\",\n\"aerobatic.aero\",\n\"aeroclub.aero\",\n\"aerodrome.aero\",\n\"agents.aero\",\n\"aircraft.aero\",\n\"airline.aero\",\n\"airport.aero\",\n\"air-surveillance.aero\",\n\"airtraffic.aero\",\n\"air-traffic-control.aero\",\n\"ambulance.aero\",\n\"amusement.aero\",\n\"association.aero\",\n\"author.aero\",\n\"ballooning.aero\",\n\"broker.aero\",\n\"caa.aero\",\n\"cargo.aero\",\n\"catering.aero\",\n\"certification.aero\",\n\"championship.aero\",\n\"charter.aero\",\n\"civilaviation.aero\",\n\"club.aero\",\n\"conference.aero\",\n\"consultant.aero\",\n\"consulting.aero\",\n\"control.aero\",\n\"council.aero\",\n\"crew.aero\",\n\"design.aero\",\n\"dgca.aero\",\n\"educator.aero\",\n\"emergency.aero\",\n\"engine.aero\",\n\"engineer.aero\",\n\"entertainment.aero\",\n\"equipment.aero\",\n\"exchange.aero\",\n\"express.aero\",\n\"federation.aero\",\n\"flight.aero\",\n\"fuel.aero\",\n\"gliding.aero\",\n\"government.aero\",\n\"groundhandling.aero\",\n\"group.aero\",\n\"hanggliding.aero\",\n\"homebuilt.aero\",\n\"insurance.aero\",\n\"journal.aero\",\n\"journalist.aero\",\n\"leasing.aero\",\n\"logistics.aero\",\n\"magazine.aero\",\n\"maintenance.aero\",\n\"media.aero\",\n\"microlight.aero\",\n\"modelling.aero\",\n\"navigation.aero\",\n\"parachuting.aero\",\n\"paragliding.aero\",\n\"passenger-association.aero\",\n\"pilot.aero\",\n\"press.aero\",\n\"production.aero\",\n\"recreation.aero\",\n\"repbody.aero\",\n\"res.aero\",\n\"research.aero\",\n\"rotorcraft.aero\",\n\"safety.aero\",\n\"scientist.aero\",\n\"services.aero\",\n\"show.aero\",\n\"skydiving.aero\",\n\"software.aero\",\n\"student.aero\",\n\"trader.aero\",\n\"trading.aero\",\n\"trainer.aero\",\n\"union.aero\",\n\"workinggroup.aero\",\n\"works.aero\",\n\"af\",\n\"gov.af\",\n\"com.af\",\n\"org.af\",\n\"net.af\",\n\"edu.af\",\n\"ag\",\n\"com.ag\",\n\"org.ag\",\n\"net.ag\",\n\"co.ag\",\n\"nom.ag\",\n\"ai\",\n\"off.ai\",\n\"com.ai\",\n\"net.ai\",\n\"org.ai\",\n\"al\",\n\"com.al\",\n\"edu.al\",\n\"gov.al\",\n\"mil.al\",\n\"net.al\",\n\"org.al\",\n\"am\",\n\"co.am\",\n\"com.am\",\n\"commune.am\",\n\"net.am\",\n\"org.am\",\n\"ao\",\n\"ed.ao\",\n\"gv.ao\",\n\"og.ao\",\n\"co.ao\",\n\"pb.ao\",\n\"it.ao\",\n\"aq\",\n\"ar\",\n\"bet.ar\",\n\"com.ar\",\n\"coop.ar\",\n\"edu.ar\",\n\"gob.ar\",\n\"gov.ar\",\n\"int.ar\",\n\"mil.ar\",\n\"musica.ar\",\n\"mutual.ar\",\n\"net.ar\",\n\"org.ar\",\n\"senasa.ar\",\n\"tur.ar\",\n\"arpa\",\n\"e164.arpa\",\n\"in-addr.arpa\",\n\"ip6.arpa\",\n\"iris.arpa\",\n\"uri.arpa\",\n\"urn.arpa\",\n\"as\",\n\"gov.as\",\n\"asia\",\n\"at\",\n\"ac.at\",\n\"co.at\",\n\"gv.at\",\n\"or.at\",\n\"sth.ac.at\",\n\"au\",\n\"com.au\",\n\"net.au\",\n\"org.au\",\n\"edu.au\",\n\"gov.au\",\n\"asn.au\",\n\"id.au\",\n\"info.au\",\n\"conf.au\",\n\"oz.au\",\n\"act.au\",\n\"nsw.au\",\n\"nt.au\",\n\"qld.au\",\n\"sa.au\",\n\"tas.au\",\n\"vic.au\",\n\"wa.au\",\n\"act.edu.au\",\n\"catholic.edu.au\",\n\"nsw.edu.au\",\n\"nt.edu.au\",\n\"qld.edu.au\",\n\"sa.edu.au\",\n\"tas.edu.au\",\n\"vic.edu.au\",\n\"wa.edu.au\",\n\"qld.gov.au\",\n\"sa.gov.au\",\n\"tas.gov.au\",\n\"vic.gov.au\",\n\"wa.gov.au\",\n\"schools.nsw.edu.au\",\n\"aw\",\n\"com.aw\",\n\"ax\",\n\"az\",\n\"com.az\",\n\"net.az\",\n\"int.az\",\n\"gov.az\",\n\"org.az\",\n\"edu.az\",\n\"info.az\",\n\"pp.az\",\n\"mil.az\",\n\"name.az\",\n\"pro.az\",\n\"biz.az\",\n\"ba\",\n\"com.ba\",\n\"edu.ba\",\n\"gov.ba\",\n\"mil.ba\",\n\"net.ba\",\n\"org.ba\",\n\"bb\",\n\"biz.bb\",\n\"co.bb\",\n\"com.bb\",\n\"edu.bb\",\n\"gov.bb\",\n\"info.bb\",\n\"net.bb\",\n\"org.bb\",\n\"store.bb\",\n\"tv.bb\",\n\"*.bd\",\n\"be\",\n\"ac.be\",\n\"bf\",\n\"gov.bf\",\n\"bg\",\n\"a.bg\",\n\"b.bg\",\n\"c.bg\",\n\"d.bg\",\n\"e.bg\",\n\"f.bg\",\n\"g.bg\",\n\"h.bg\",\n\"i.bg\",\n\"j.bg\",\n\"k.bg\",\n\"l.bg\",\n\"m.bg\",\n\"n.bg\",\n\"o.bg\",\n\"p.bg\",\n\"q.bg\",\n\"r.bg\",\n\"s.bg\",\n\"t.bg\",\n\"u.bg\",\n\"v.bg\",\n\"w.bg\",\n\"x.bg\",\n\"y.bg\",\n\"z.bg\",\n\"0.bg\",\n\"1.bg\",\n\"2.bg\",\n\"3.bg\",\n\"4.bg\",\n\"5.bg\",\n\"6.bg\",\n\"7.bg\",\n\"8.bg\",\n\"9.bg\",\n\"bh\",\n\"com.bh\",\n\"edu.bh\",\n\"net.bh\",\n\"org.bh\",\n\"gov.bh\",\n\"bi\",\n\"co.bi\",\n\"com.bi\",\n\"edu.bi\",\n\"or.bi\",\n\"org.bi\",\n\"biz\",\n\"bj\",\n\"asso.bj\",\n\"barreau.bj\",\n\"gouv.bj\",\n\"bm\",\n\"com.bm\",\n\"edu.bm\",\n\"gov.bm\",\n\"net.bm\",\n\"org.bm\",\n\"bn\",\n\"com.bn\",\n\"edu.bn\",\n\"gov.bn\",\n\"net.bn\",\n\"org.bn\",\n\"bo\",\n\"com.bo\",\n\"edu.bo\",\n\"gob.bo\",\n\"int.bo\",\n\"org.bo\",\n\"net.bo\",\n\"mil.bo\",\n\"tv.bo\",\n\"web.bo\",\n\"academia.bo\",\n\"agro.bo\",\n\"arte.bo\",\n\"blog.bo\",\n\"bolivia.bo\",\n\"ciencia.bo\",\n\"cooperativa.bo\",\n\"democracia.bo\",\n\"deporte.bo\",\n\"ecologia.bo\",\n\"economia.bo\",\n\"empresa.bo\",\n\"indigena.bo\",\n\"industria.bo\",\n\"info.bo\",\n\"medicina.bo\",\n\"movimiento.bo\",\n\"musica.bo\",\n\"natural.bo\",\n\"nombre.bo\",\n\"noticias.bo\",\n\"patria.bo\",\n\"politica.bo\",\n\"profesional.bo\",\n\"plurinacional.bo\",\n\"pueblo.bo\",\n\"revista.bo\",\n\"salud.bo\",\n\"tecnologia.bo\",\n\"tksat.bo\",\n\"transporte.bo\",\n\"wiki.bo\",\n\"br\",\n\"9guacu.br\",\n\"abc.br\",\n\"adm.br\",\n\"adv.br\",\n\"agr.br\",\n\"aju.br\",\n\"am.br\",\n\"anani.br\",\n\"aparecida.br\",\n\"app.br\",\n\"arq.br\",\n\"art.br\",\n\"ato.br\",\n\"b.br\",\n\"barueri.br\",\n\"belem.br\",\n\"bhz.br\",\n\"bib.br\",\n\"bio.br\",\n\"blog.br\",\n\"bmd.br\",\n\"boavista.br\",\n\"bsb.br\",\n\"campinagrande.br\",\n\"campinas.br\",\n\"caxias.br\",\n\"cim.br\",\n\"cng.br\",\n\"cnt.br\",\n\"com.br\",\n\"contagem.br\",\n\"coop.br\",\n\"coz.br\",\n\"cri.br\",\n\"cuiaba.br\",\n\"curitiba.br\",\n\"def.br\",\n\"des.br\",\n\"det.br\",\n\"dev.br\",\n\"ecn.br\",\n\"eco.br\",\n\"edu.br\",\n\"emp.br\",\n\"enf.br\",\n\"eng.br\",\n\"esp.br\",\n\"etc.br\",\n\"eti.br\",\n\"far.br\",\n\"feira.br\",\n\"flog.br\",\n\"floripa.br\",\n\"fm.br\",\n\"fnd.br\",\n\"fortal.br\",\n\"fot.br\",\n\"foz.br\",\n\"fst.br\",\n\"g12.br\",\n\"geo.br\",\n\"ggf.br\",\n\"goiania.br\",\n\"gov.br\",\n\"ac.gov.br\",\n\"al.gov.br\",\n\"am.gov.br\",\n\"ap.gov.br\",\n\"ba.gov.br\",\n\"ce.gov.br\",\n\"df.gov.br\",\n\"es.gov.br\",\n\"go.gov.br\",\n\"ma.gov.br\",\n\"mg.gov.br\",\n\"ms.gov.br\",\n\"mt.gov.br\",\n\"pa.gov.br\",\n\"pb.gov.br\",\n\"pe.gov.br\",\n\"pi.gov.br\",\n\"pr.gov.br\",\n\"rj.gov.br\",\n\"rn.gov.br\",\n\"ro.gov.br\",\n\"rr.gov.br\",\n\"rs.gov.br\",\n\"sc.gov.br\",\n\"se.gov.br\",\n\"sp.gov.br\",\n\"to.gov.br\",\n\"gru.br\",\n\"imb.br\",\n\"ind.br\",\n\"inf.br\",\n\"jab.br\",\n\"jampa.br\",\n\"jdf.br\",\n\"joinville.br\",\n\"jor.br\",\n\"jus.br\",\n\"leg.br\",\n\"lel.br\",\n\"log.br\",\n\"londrina.br\",\n\"macapa.br\",\n\"maceio.br\",\n\"manaus.br\",\n\"maringa.br\",\n\"mat.br\",\n\"med.br\",\n\"mil.br\",\n\"morena.br\",\n\"mp.br\",\n\"mus.br\",\n\"natal.br\",\n\"net.br\",\n\"niteroi.br\",\n\"*.nom.br\",\n\"not.br\",\n\"ntr.br\",\n\"odo.br\",\n\"ong.br\",\n\"org.br\",\n\"osasco.br\",\n\"palmas.br\",\n\"poa.br\",\n\"ppg.br\",\n\"pro.br\",\n\"psc.br\",\n\"psi.br\",\n\"pvh.br\",\n\"qsl.br\",\n\"radio.br\",\n\"rec.br\",\n\"recife.br\",\n\"rep.br\",\n\"ribeirao.br\",\n\"rio.br\",\n\"riobranco.br\",\n\"riopreto.br\",\n\"salvador.br\",\n\"sampa.br\",\n\"santamaria.br\",\n\"santoandre.br\",\n\"saobernardo.br\",\n\"saogonca.br\",\n\"seg.br\",\n\"sjc.br\",\n\"slg.br\",\n\"slz.br\",\n\"sorocaba.br\",\n\"srv.br\",\n\"taxi.br\",\n\"tc.br\",\n\"tec.br\",\n\"teo.br\",\n\"the.br\",\n\"tmp.br\",\n\"trd.br\",\n\"tur.br\",\n\"tv.br\",\n\"udi.br\",\n\"vet.br\",\n\"vix.br\",\n\"vlog.br\",\n\"wiki.br\",\n\"zlg.br\",\n\"bs\",\n\"com.bs\",\n\"net.bs\",\n\"org.bs\",\n\"edu.bs\",\n\"gov.bs\",\n\"bt\",\n\"com.bt\",\n\"edu.bt\",\n\"gov.bt\",\n\"net.bt\",\n\"org.bt\",\n\"bv\",\n\"bw\",\n\"co.bw\",\n\"org.bw\",\n\"by\",\n\"gov.by\",\n\"mil.by\",\n\"com.by\",\n\"of.by\",\n\"bz\",\n\"com.bz\",\n\"net.bz\",\n\"org.bz\",\n\"edu.bz\",\n\"gov.bz\",\n\"ca\",\n\"ab.ca\",\n\"bc.ca\",\n\"mb.ca\",\n\"nb.ca\",\n\"nf.ca\",\n\"nl.ca\",\n\"ns.ca\",\n\"nt.ca\",\n\"nu.ca\",\n\"on.ca\",\n\"pe.ca\",\n\"qc.ca\",\n\"sk.ca\",\n\"yk.ca\",\n\"gc.ca\",\n\"cat\",\n\"cc\",\n\"cd\",\n\"gov.cd\",\n\"cf\",\n\"cg\",\n\"ch\",\n\"ci\",\n\"org.ci\",\n\"or.ci\",\n\"com.ci\",\n\"co.ci\",\n\"edu.ci\",\n\"ed.ci\",\n\"ac.ci\",\n\"net.ci\",\n\"go.ci\",\n\"asso.ci\",\n\"aéroport.ci\",\n\"int.ci\",\n\"presse.ci\",\n\"md.ci\",\n\"gouv.ci\",\n\"*.ck\",\n\"!www.ck\",\n\"cl\",\n\"co.cl\",\n\"gob.cl\",\n\"gov.cl\",\n\"mil.cl\",\n\"cm\",\n\"co.cm\",\n\"com.cm\",\n\"gov.cm\",\n\"net.cm\",\n\"cn\",\n\"ac.cn\",\n\"com.cn\",\n\"edu.cn\",\n\"gov.cn\",\n\"net.cn\",\n\"org.cn\",\n\"mil.cn\",\n\"公司.cn\",\n\"网络.cn\",\n\"網絡.cn\",\n\"ah.cn\",\n\"bj.cn\",\n\"cq.cn\",\n\"fj.cn\",\n\"gd.cn\",\n\"gs.cn\",\n\"gz.cn\",\n\"gx.cn\",\n\"ha.cn\",\n\"hb.cn\",\n\"he.cn\",\n\"hi.cn\",\n\"hl.cn\",\n\"hn.cn\",\n\"jl.cn\",\n\"js.cn\",\n\"jx.cn\",\n\"ln.cn\",\n\"nm.cn\",\n\"nx.cn\",\n\"qh.cn\",\n\"sc.cn\",\n\"sd.cn\",\n\"sh.cn\",\n\"sn.cn\",\n\"sx.cn\",\n\"tj.cn\",\n\"xj.cn\",\n\"xz.cn\",\n\"yn.cn\",\n\"zj.cn\",\n\"hk.cn\",\n\"mo.cn\",\n\"tw.cn\",\n\"co\",\n\"arts.co\",\n\"com.co\",\n\"edu.co\",\n\"firm.co\",\n\"gov.co\",\n\"info.co\",\n\"int.co\",\n\"mil.co\",\n\"net.co\",\n\"nom.co\",\n\"org.co\",\n\"rec.co\",\n\"web.co\",\n\"com\",\n\"coop\",\n\"cr\",\n\"ac.cr\",\n\"co.cr\",\n\"ed.cr\",\n\"fi.cr\",\n\"go.cr\",\n\"or.cr\",\n\"sa.cr\",\n\"cu\",\n\"com.cu\",\n\"edu.cu\",\n\"org.cu\",\n\"net.cu\",\n\"gov.cu\",\n\"inf.cu\",\n\"cv\",\n\"com.cv\",\n\"edu.cv\",\n\"int.cv\",\n\"nome.cv\",\n\"org.cv\",\n\"cw\",\n\"com.cw\",\n\"edu.cw\",\n\"net.cw\",\n\"org.cw\",\n\"cx\",\n\"gov.cx\",\n\"cy\",\n\"ac.cy\",\n\"biz.cy\",\n\"com.cy\",\n\"ekloges.cy\",\n\"gov.cy\",\n\"ltd.cy\",\n\"mil.cy\",\n\"net.cy\",\n\"org.cy\",\n\"press.cy\",\n\"pro.cy\",\n\"tm.cy\",\n\"cz\",\n\"de\",\n\"dj\",\n\"dk\",\n\"dm\",\n\"com.dm\",\n\"net.dm\",\n\"org.dm\",\n\"edu.dm\",\n\"gov.dm\",\n\"do\",\n\"art.do\",\n\"com.do\",\n\"edu.do\",\n\"gob.do\",\n\"gov.do\",\n\"mil.do\",\n\"net.do\",\n\"org.do\",\n\"sld.do\",\n\"web.do\",\n\"dz\",\n\"art.dz\",\n\"asso.dz\",\n\"com.dz\",\n\"edu.dz\",\n\"gov.dz\",\n\"org.dz\",\n\"net.dz\",\n\"pol.dz\",\n\"soc.dz\",\n\"tm.dz\",\n\"ec\",\n\"com.ec\",\n\"info.ec\",\n\"net.ec\",\n\"fin.ec\",\n\"k12.ec\",\n\"med.ec\",\n\"pro.ec\",\n\"org.ec\",\n\"edu.ec\",\n\"gov.ec\",\n\"gob.ec\",\n\"mil.ec\",\n\"edu\",\n\"ee\",\n\"edu.ee\",\n\"gov.ee\",\n\"riik.ee\",\n\"lib.ee\",\n\"med.ee\",\n\"com.ee\",\n\"pri.ee\",\n\"aip.ee\",\n\"org.ee\",\n\"fie.ee\",\n\"eg\",\n\"com.eg\",\n\"edu.eg\",\n\"eun.eg\",\n\"gov.eg\",\n\"mil.eg\",\n\"name.eg\",\n\"net.eg\",\n\"org.eg\",\n\"sci.eg\",\n\"*.er\",\n\"es\",\n\"com.es\",\n\"nom.es\",\n\"org.es\",\n\"gob.es\",\n\"edu.es\",\n\"et\",\n\"com.et\",\n\"gov.et\",\n\"org.et\",\n\"edu.et\",\n\"biz.et\",\n\"name.et\",\n\"info.et\",\n\"net.et\",\n\"eu\",\n\"fi\",\n\"aland.fi\",\n\"fj\",\n\"ac.fj\",\n\"biz.fj\",\n\"com.fj\",\n\"gov.fj\",\n\"info.fj\",\n\"mil.fj\",\n\"name.fj\",\n\"net.fj\",\n\"org.fj\",\n\"pro.fj\",\n\"*.fk\",\n\"com.fm\",\n\"edu.fm\",\n\"net.fm\",\n\"org.fm\",\n\"fm\",\n\"fo\",\n\"fr\",\n\"asso.fr\",\n\"com.fr\",\n\"gouv.fr\",\n\"nom.fr\",\n\"prd.fr\",\n\"tm.fr\",\n\"aeroport.fr\",\n\"avocat.fr\",\n\"avoues.fr\",\n\"cci.fr\",\n\"chambagri.fr\",\n\"chirurgiens-dentistes.fr\",\n\"experts-comptables.fr\",\n\"geometre-expert.fr\",\n\"greta.fr\",\n\"huissier-justice.fr\",\n\"medecin.fr\",\n\"notaires.fr\",\n\"pharmacien.fr\",\n\"port.fr\",\n\"veterinaire.fr\",\n\"ga\",\n\"gb\",\n\"edu.gd\",\n\"gov.gd\",\n\"gd\",\n\"ge\",\n\"com.ge\",\n\"edu.ge\",\n\"gov.ge\",\n\"org.ge\",\n\"mil.ge\",\n\"net.ge\",\n\"pvt.ge\",\n\"gf\",\n\"gg\",\n\"co.gg\",\n\"net.gg\",\n\"org.gg\",\n\"gh\",\n\"com.gh\",\n\"edu.gh\",\n\"gov.gh\",\n\"org.gh\",\n\"mil.gh\",\n\"gi\",\n\"com.gi\",\n\"ltd.gi\",\n\"gov.gi\",\n\"mod.gi\",\n\"edu.gi\",\n\"org.gi\",\n\"gl\",\n\"co.gl\",\n\"com.gl\",\n\"edu.gl\",\n\"net.gl\",\n\"org.gl\",\n\"gm\",\n\"gn\",\n\"ac.gn\",\n\"com.gn\",\n\"edu.gn\",\n\"gov.gn\",\n\"org.gn\",\n\"net.gn\",\n\"gov\",\n\"gp\",\n\"com.gp\",\n\"net.gp\",\n\"mobi.gp\",\n\"edu.gp\",\n\"org.gp\",\n\"asso.gp\",\n\"gq\",\n\"gr\",\n\"com.gr\",\n\"edu.gr\",\n\"net.gr\",\n\"org.gr\",\n\"gov.gr\",\n\"gs\",\n\"gt\",\n\"com.gt\",\n\"edu.gt\",\n\"gob.gt\",\n\"ind.gt\",\n\"mil.gt\",\n\"net.gt\",\n\"org.gt\",\n\"gu\",\n\"com.gu\",\n\"edu.gu\",\n\"gov.gu\",\n\"guam.gu\",\n\"info.gu\",\n\"net.gu\",\n\"org.gu\",\n\"web.gu\",\n\"gw\",\n\"gy\",\n\"co.gy\",\n\"com.gy\",\n\"edu.gy\",\n\"gov.gy\",\n\"net.gy\",\n\"org.gy\",\n\"hk\",\n\"com.hk\",\n\"edu.hk\",\n\"gov.hk\",\n\"idv.hk\",\n\"net.hk\",\n\"org.hk\",\n\"公司.hk\",\n\"教育.hk\",\n\"敎育.hk\",\n\"政府.hk\",\n\"個人.hk\",\n\"个��.hk\",\n\"箇人.hk\",\n\"網络.hk\",\n\"网络.hk\",\n\"组織.hk\",\n\"網絡.hk\",\n\"网絡.hk\",\n\"组织.hk\",\n\"組織.hk\",\n\"組织.hk\",\n\"hm\",\n\"hn\",\n\"com.hn\",\n\"edu.hn\",\n\"org.hn\",\n\"net.hn\",\n\"mil.hn\",\n\"gob.hn\",\n\"hr\",\n\"iz.hr\",\n\"from.hr\",\n\"name.hr\",\n\"com.hr\",\n\"ht\",\n\"com.ht\",\n\"shop.ht\",\n\"firm.ht\",\n\"info.ht\",\n\"adult.ht\",\n\"net.ht\",\n\"pro.ht\",\n\"org.ht\",\n\"med.ht\",\n\"art.ht\",\n\"coop.ht\",\n\"pol.ht\",\n\"asso.ht\",\n\"edu.ht\",\n\"rel.ht\",\n\"gouv.ht\",\n\"perso.ht\",\n\"hu\",\n\"co.hu\",\n\"info.hu\",\n\"org.hu\",\n\"priv.hu\",\n\"sport.hu\",\n\"tm.hu\",\n\"2000.hu\",\n\"agrar.hu\",\n\"bolt.hu\",\n\"casino.hu\",\n\"city.hu\",\n\"erotica.hu\",\n\"erotika.hu\",\n\"film.hu\",\n\"forum.hu\",\n\"games.hu\",\n\"hotel.hu\",\n\"ingatlan.hu\",\n\"jogasz.hu\",\n\"konyvelo.hu\",\n\"lakas.hu\",\n\"media.hu\",\n\"news.hu\",\n\"reklam.hu\",\n\"sex.hu\",\n\"shop.hu\",\n\"suli.hu\",\n\"szex.hu\",\n\"tozsde.hu\",\n\"utazas.hu\",\n\"video.hu\",\n\"id\",\n\"ac.id\",\n\"biz.id\",\n\"co.id\",\n\"desa.id\",\n\"go.id\",\n\"mil.id\",\n\"my.id\",\n\"net.id\",\n\"or.id\",\n\"ponpes.id\",\n\"sch.id\",\n\"web.id\",\n\"ie\",\n\"gov.ie\",\n\"il\",\n\"ac.il\",\n\"co.il\",\n\"gov.il\",\n\"idf.il\",\n\"k12.il\",\n\"muni.il\",\n\"net.il\",\n\"org.il\",\n\"im\",\n\"ac.im\",\n\"co.im\",\n\"com.im\",\n\"ltd.co.im\",\n\"net.im\",\n\"org.im\",\n\"plc.co.im\",\n\"tt.im\",\n\"tv.im\",\n\"in\",\n\"co.in\",\n\"firm.in\",\n\"net.in\",\n\"org.in\",\n\"gen.in\",\n\"ind.in\",\n\"nic.in\",\n\"ac.in\",\n\"edu.in\",\n\"res.in\",\n\"gov.in\",\n\"mil.in\",\n\"info\",\n\"int\",\n\"eu.int\",\n\"io\",\n\"com.io\",\n\"iq\",\n\"gov.iq\",\n\"edu.iq\",\n\"mil.iq\",\n\"com.iq\",\n\"org.iq\",\n\"net.iq\",\n\"ir\",\n\"ac.ir\",\n\"co.ir\",\n\"gov.ir\",\n\"id.ir\",\n\"net.ir\",\n\"org.ir\",\n\"sch.ir\",\n\"ایران.ir\",\n\"ايران.ir\",\n\"is\",\n\"net.is\",\n\"com.is\",\n\"edu.is\",\n\"gov.is\",\n\"org.is\",\n\"int.is\",\n\"it\",\n\"gov.it\",\n\"edu.it\",\n\"abr.it\",\n\"abruzzo.it\",\n\"aosta-valley.it\",\n\"aostavalley.it\",\n\"bas.it\",\n\"basilicata.it\",\n\"cal.it\",\n\"calabria.it\",\n\"cam.it\",\n\"campania.it\",\n\"emilia-romagna.it\",\n\"emiliaromagna.it\",\n\"emr.it\",\n\"friuli-v-giulia.it\",\n\"friuli-ve-giulia.it\",\n\"friuli-vegiulia.it\",\n\"friuli-venezia-giulia.it\",\n\"friuli-veneziagiulia.it\",\n\"friuli-vgiulia.it\",\n\"friuliv-giulia.it\",\n\"friulive-giulia.it\",\n\"friulivegiulia.it\",\n\"friulivenezia-giulia.it\",\n\"friuliveneziagiulia.it\",\n\"friulivgiulia.it\",\n\"fvg.it\",\n\"laz.it\",\n\"lazio.it\",\n\"lig.it\",\n\"liguria.it\",\n\"lom.it\",\n\"lombardia.it\",\n\"lombardy.it\",\n\"lucania.it\",\n\"mar.it\",\n\"marche.it\",\n\"mol.it\",\n\"molise.it\",\n\"piedmont.it\",\n\"piemonte.it\",\n\"pmn.it\",\n\"pug.it\",\n\"puglia.it\",\n\"sar.it\",\n\"sardegna.it\",\n\"sardinia.it\",\n\"sic.it\",\n\"sicilia.it\",\n\"sicily.it\",\n\"taa.it\",\n\"tos.it\",\n\"toscana.it\",\n\"trentin-sud-tirol.it\",\n\"trentin-süd-tirol.it\",\n\"trentin-sudtirol.it\",\n\"trentin-südtirol.it\",\n\"trentin-sued-tirol.it\",\n\"trentin-suedtirol.it\",\n\"trentino-a-adige.it\",\n\"trentino-aadige.it\",\n\"trentino-alto-adige.it\",\n\"trentino-altoadige.it\",\n\"trentino-s-tirol.it\",\n\"trentino-stirol.it\",\n\"trentino-sud-tirol.it\",\n\"trentino-süd-tirol.it\",\n\"trentino-sudtirol.it\",\n\"trentino-südtirol.it\",\n\"trentino-sued-tirol.it\",\n\"trentino-suedtirol.it\",\n\"trentino.it\",\n\"trentinoa-adige.it\",\n\"trentinoaadige.it\",\n\"trentinoalto-adige.it\",\n\"trentinoaltoadige.it\",\n\"trentinos-tirol.it\",\n\"trentinostirol.it\",\n\"trentinosud-tirol.it\",\n\"trentinosüd-tirol.it\",\n\"trentinosudtirol.it\",\n\"trentinosüdtirol.it\",\n\"trentinosued-tirol.it\",\n\"trentinosuedtirol.it\",\n\"trentinsud-tirol.it\",\n\"trentinsüd-tirol.it\",\n\"trentinsudtirol.it\",\n\"trentinsüdtirol.it\",\n\"trentinsued-tirol.it\",\n\"trentinsuedtirol.it\",\n\"tuscany.it\",\n\"umb.it\",\n\"umbria.it\",\n\"val-d-aosta.it\",\n\"val-daosta.it\",\n\"vald-aosta.it\",\n\"valdaosta.it\",\n\"valle-aosta.it\",\n\"valle-d-aosta.it\",\n\"valle-daosta.it\",\n\"valleaosta.it\",\n\"valled-aosta.it\",\n\"valledaosta.it\",\n\"vallee-aoste.it\",\n\"vallée-aoste.it\",\n\"vallee-d-aoste.it\",\n\"vallée-d-aoste.it\",\n\"valleeaoste.it\",\n\"valléeaoste.it\",\n\"valleedaoste.it\",\n\"valléedaoste.it\",\n\"vao.it\",\n\"vda.it\",\n\"ven.it\",\n\"veneto.it\",\n\"ag.it\",\n\"agrigento.it\",\n\"al.it\",\n\"alessandria.it\",\n\"alto-adige.it\",\n\"altoadige.it\",\n\"an.it\",\n\"ancona.it\",\n\"andria-barletta-trani.it\",\n\"andria-trani-barletta.it\",\n\"andriabarlettatrani.it\",\n\"andriatranibarletta.it\",\n\"ao.it\",\n\"aosta.it\",\n\"aoste.it\",\n\"ap.it\",\n\"aq.it\",\n\"aquila.it\",\n\"ar.it\",\n\"arezzo.it\",\n\"ascoli-piceno.it\",\n\"ascolipiceno.it\",\n\"asti.it\",\n\"at.it\",\n\"av.it\",\n\"avellino.it\",\n\"ba.it\",\n\"balsan-sudtirol.it\",\n\"balsan-südtirol.it\",\n\"balsan-suedtirol.it\",\n\"balsan.it\",\n\"bari.it\",\n\"barletta-trani-andria.it\",\n\"barlettatraniandria.it\",\n\"belluno.it\",\n\"benevento.it\",\n\"bergamo.it\",\n\"bg.it\",\n\"bi.it\",\n\"biella.it\",\n\"bl.it\",\n\"bn.it\",\n\"bo.it\",\n\"bologna.it\",\n\"bolzano-altoadige.it\",\n\"bolzano.it\",\n\"bozen-sudtirol.it\",\n\"bozen-südtirol.it\",\n\"bozen-suedtirol.it\",\n\"bozen.it\",\n\"br.it\",\n\"brescia.it\",\n\"brindisi.it\",\n\"bs.it\",\n\"bt.it\",\n\"bulsan-sudtirol.it\",\n\"bulsan-südtirol.it\",\n\"bulsan-suedtirol.it\",\n\"bulsan.it\",\n\"bz.it\",\n\"ca.it\",\n\"cagliari.it\",\n\"caltanissetta.it\",\n\"campidano-medio.it\",\n\"campidanomedio.it\",\n\"campobasso.it\",\n\"carbonia-iglesias.it\",\n\"carboniaiglesias.it\",\n\"carrara-massa.it\",\n\"carraramassa.it\",\n\"caserta.it\",\n\"catania.it\",\n\"catanzaro.it\",\n\"cb.it\",\n\"ce.it\",\n\"cesena-forli.it\",\n\"cesena-forlì.it\",\n\"cesenaforli.it\",\n\"cesenaforlì.it\",\n\"ch.it\",\n\"chieti.it\",\n\"ci.it\",\n\"cl.it\",\n\"cn.it\",\n\"co.it\",\n\"como.it\",\n\"cosenza.it\",\n\"cr.it\",\n\"cremona.it\",\n\"crotone.it\",\n\"cs.it\",\n\"ct.it\",\n\"cuneo.it\",\n\"cz.it\",\n\"dell-ogliastra.it\",\n\"dellogliastra.it\",\n\"en.it\",\n\"enna.it\",\n\"fc.it\",\n\"fe.it\",\n\"fermo.it\",\n\"ferrara.it\",\n\"fg.it\",\n\"fi.it\",\n\"firenze.it\",\n\"florence.it\",\n\"fm.it\",\n\"foggia.it\",\n\"forli-cesena.it\",\n\"forlì-cesena.it\",\n\"forlicesena.it\",\n\"forlìcesena.it\",\n\"fr.it\",\n\"frosinone.it\",\n\"ge.it\",\n\"genoa.it\",\n\"genova.it\",\n\"go.it\",\n\"gorizia.it\",\n\"gr.it\",\n\"grosseto.it\",\n\"iglesias-carbonia.it\",\n\"iglesiascarbonia.it\",\n\"im.it\",\n\"imperia.it\",\n\"is.it\",\n\"isernia.it\",\n\"kr.it\",\n\"la-spezia.it\",\n\"laquila.it\",\n\"laspezia.it\",\n\"latina.it\",\n\"lc.it\",\n\"le.it\",\n\"lecce.it\",\n\"lecco.it\",\n\"li.it\",\n\"livorno.it\",\n\"lo.it\",\n\"lodi.it\",\n\"lt.it\",\n\"lu.it\",\n\"lucca.it\",\n\"macerata.it\",\n\"mantova.it\",\n\"massa-carrara.it\",\n\"massacarrara.it\",\n\"matera.it\",\n\"mb.it\",\n\"mc.it\",\n\"me.it\",\n\"medio-campidano.it\",\n\"mediocampidano.it\",\n\"messina.it\",\n\"mi.it\",\n\"milan.it\",\n\"milano.it\",\n\"mn.it\",\n\"mo.it\",\n\"modena.it\",\n\"monza-brianza.it\",\n\"monza-e-della-brianza.it\",\n\"monza.it\",\n\"monzabrianza.it\",\n\"monzaebrianza.it\",\n\"monzaedellabrianza.it\",\n\"ms.it\",\n\"mt.it\",\n\"na.it\",\n\"naples.it\",\n\"napoli.it\",\n\"no.it\",\n\"novara.it\",\n\"nu.it\",\n\"nuoro.it\",\n\"og.it\",\n\"ogliastra.it\",\n\"olbia-tempio.it\",\n\"olbiatempio.it\",\n\"or.it\",\n\"oristano.it\",\n\"ot.it\",\n\"pa.it\",\n\"padova.it\",\n\"padua.it\",\n\"palermo.it\",\n\"parma.it\",\n\"pavia.it\",\n\"pc.it\",\n\"pd.it\",\n\"pe.it\",\n\"perugia.it\",\n\"pesaro-urbino.it\",\n\"pesarourbino.it\",\n\"pescara.it\",\n\"pg.it\",\n\"pi.it\",\n\"piacenza.it\",\n\"pisa.it\",\n\"pistoia.it\",\n\"pn.it\",\n\"po.it\",\n\"pordenone.it\",\n\"potenza.it\",\n\"pr.it\",\n\"prato.it\",\n\"pt.it\",\n\"pu.it\",\n\"pv.it\",\n\"pz.it\",\n\"ra.it\",\n\"ragusa.it\",\n\"ravenna.it\",\n\"rc.it\",\n\"re.it\",\n\"reggio-calabria.it\",\n\"reggio-emilia.it\",\n\"reggiocalabria.it\",\n\"reggioemilia.it\",\n\"rg.it\",\n\"ri.it\",\n\"rieti.it\",\n\"rimini.it\",\n\"rm.it\",\n\"rn.it\",\n\"ro.it\",\n\"roma.it\",\n\"rome.it\",\n\"rovigo.it\",\n\"sa.it\",\n\"salerno.it\",\n\"sassari.it\",\n\"savona.it\",\n\"si.it\",\n\"siena.it\",\n\"siracusa.it\",\n\"so.it\",\n\"sondrio.it\",\n\"sp.it\",\n\"sr.it\",\n\"ss.it\",\n\"suedtirol.it\",\n\"südtirol.it\",\n\"sv.it\",\n\"ta.it\",\n\"taranto.it\",\n\"te.it\",\n\"tempio-olbia.it\",\n\"tempioolbia.it\",\n\"teramo.it\",\n\"terni.it\",\n\"tn.it\",\n\"to.it\",\n\"torino.it\",\n\"tp.it\",\n\"tr.it\",\n\"trani-andria-barletta.it\",\n\"trani-barletta-andria.it\",\n\"traniandriabarletta.it\",\n\"tranibarlettaandria.it\",\n\"trapani.it\",\n\"trento.it\",\n\"treviso.it\",\n\"trieste.it\",\n\"ts.it\",\n\"turin.it\",\n\"tv.it\",\n\"ud.it\",\n\"udine.it\",\n\"urbino-pesaro.it\",\n\"urbinopesaro.it\",\n\"va.it\",\n\"varese.it\",\n\"vb.it\",\n\"vc.it\",\n\"ve.it\",\n\"venezia.it\",\n\"venice.it\",\n\"verbania.it\",\n\"vercelli.it\",\n\"verona.it\",\n\"vi.it\",\n\"vibo-valentia.it\",\n\"vibovalentia.it\",\n\"vicenza.it\",\n\"viterbo.it\",\n\"vr.it\",\n\"vs.it\",\n\"vt.it\",\n\"vv.it\",\n\"je\",\n\"co.je\",\n\"net.je\",\n\"org.je\",\n\"*.jm\",\n\"jo\",\n\"com.jo\",\n\"org.jo\",\n\"net.jo\",\n\"edu.jo\",\n\"sch.jo\",\n\"gov.jo\",\n\"mil.jo\",\n\"name.jo\",\n\"jobs\",\n\"jp\",\n\"ac.jp\",\n\"ad.jp\",\n\"co.jp\",\n\"ed.jp\",\n\"go.jp\",\n\"gr.jp\",\n\"lg.jp\",\n\"ne.jp\",\n\"or.jp\",\n\"aichi.jp\",\n\"akita.jp\",\n\"aomori.jp\",\n\"chiba.jp\",\n\"ehime.jp\",\n\"fukui.jp\",\n\"fukuoka.jp\",\n\"fukushima.jp\",\n\"gifu.jp\",\n\"gunma.jp\",\n\"hiroshima.jp\",\n\"hokkaido.jp\",\n\"hyogo.jp\",\n\"ibaraki.jp\",\n\"ishikawa.jp\",\n\"iwate.jp\",\n\"kagawa.jp\",\n\"kagoshima.jp\",\n\"kanagawa.jp\",\n\"kochi.jp\",\n\"kumamoto.jp\",\n\"kyoto.jp\",\n\"mie.jp\",\n\"miyagi.jp\",\n\"miyazaki.jp\",\n\"nagano.jp\",\n\"nagasaki.jp\",\n\"nara.jp\",\n\"niigata.jp\",\n\"oita.jp\",\n\"okayama.jp\",\n\"okinawa.jp\",\n\"osaka.jp\",\n\"saga.jp\",\n\"saitama.jp\",\n\"shiga.jp\",\n\"shimane.jp\",\n\"shizuoka.jp\",\n\"tochigi.jp\",\n\"tokushima.jp\",\n\"tokyo.jp\",\n\"tottori.jp\",\n\"toyama.jp\",\n\"wakayama.jp\",\n\"yamagata.jp\",\n\"yamaguchi.jp\",\n\"yamanashi.jp\",\n\"栃木.jp\",\n\"愛知.jp\",\n\"愛媛.jp\",\n\"兵庫.jp\",\n\"熊本.jp\",\n\"茨城.jp\",\n\"北海道.jp\",\n\"千葉.jp\",\n\"和歌山.jp\",\n\"長崎.jp\",\n\"長野.jp\",\n\"新潟.jp\",\n\"青森.jp\",\n\"静岡.jp\",\n\"東京.jp\",\n\"石川.jp\",\n\"埼玉.jp\",\n\"三重.jp\",\n\"京都.jp\",\n\"佐賀.jp\",\n\"大分.jp\",\n\"大阪.jp\",\n\"奈良.jp\",\n\"宮城.jp\",\n\"宮崎.jp\",\n\"富山.jp\",\n\"山口.jp\",\n\"山形.jp\",\n\"山梨.jp\",\n\"岩手.jp\",\n\"岐阜.jp\",\n\"岡山.jp\",\n\"島根.jp\",\n\"広島.jp\",\n\"徳島.jp\",\n\"沖縄.jp\",\n\"滋賀.jp\",\n\"神奈川.jp\",\n\"福井.jp\",\n\"福岡.jp\",\n\"福島.jp\",\n\"秋田.jp\",\n\"群馬.jp\",\n\"香川.jp\",\n\"高知.jp\",\n\"鳥取.jp\",\n\"鹿児島.jp\",\n\"*.kawasaki.jp\",\n\"*.kitakyushu.jp\",\n\"*.kobe.jp\",\n\"*.nagoya.jp\",\n\"*.sapporo.jp\",\n\"*.sendai.jp\",\n\"*.yokohama.jp\",\n\"!city.kawasaki.jp\",\n\"!city.kitakyushu.jp\",\n\"!city.kobe.jp\",\n\"!city.nagoya.jp\",\n\"!city.sapporo.jp\",\n\"!city.sendai.jp\",\n\"!city.yokohama.jp\",\n\"aisai.aichi.jp\",\n\"ama.aichi.jp\",\n\"anjo.aichi.jp\",\n\"asuke.aichi.jp\",\n\"chiryu.aichi.jp\",\n\"chita.aichi.jp\",\n\"fuso.aichi.jp\",\n\"gamagori.aichi.jp\",\n\"handa.aichi.jp\",\n\"hazu.aichi.jp\",\n\"hekinan.aichi.jp\",\n\"higashiura.aichi.jp\",\n\"ichinomiya.aichi.jp\",\n\"inazawa.aichi.jp\",\n\"inuyama.aichi.jp\",\n\"isshiki.aichi.jp\",\n\"iwakura.aichi.jp\",\n\"kanie.aichi.jp\",\n\"kariya.aichi.jp\",\n\"kasugai.aichi.jp\",\n\"kira.aichi.jp\",\n\"kiyosu.aichi.jp\",\n\"komaki.aichi.jp\",\n\"konan.aichi.jp\",\n\"kota.aichi.jp\",\n\"mihama.aichi.jp\",\n\"miyoshi.aichi.jp\",\n\"nishio.aichi.jp\",\n\"nisshin.aichi.jp\",\n\"obu.aichi.jp\",\n\"oguchi.aichi.jp\",\n\"oharu.aichi.jp\",\n\"okazaki.aichi.jp\",\n\"owariasahi.aichi.jp\",\n\"seto.aichi.jp\",\n\"shikatsu.aichi.jp\",\n\"shinshiro.aichi.jp\",\n\"shitara.aichi.jp\",\n\"tahara.aichi.jp\",\n\"takahama.aichi.jp\",\n\"tobishima.aichi.jp\",\n\"toei.aichi.jp\",\n\"togo.aichi.jp\",\n\"tokai.aichi.jp\",\n\"tokoname.aichi.jp\",\n\"toyoake.aichi.jp\",\n\"toyohashi.aichi.jp\",\n\"toyokawa.aichi.jp\",\n\"toyone.aichi.jp\",\n\"toyota.aichi.jp\",\n\"tsushima.aichi.jp\",\n\"yatomi.aichi.jp\",\n\"akita.akita.jp\",\n\"daisen.akita.jp\",\n\"fujisato.akita.jp\",\n\"gojome.akita.jp\",\n\"hachirogata.akita.jp\",\n\"happou.akita.jp\",\n\"higashinaruse.akita.jp\",\n\"honjo.akita.jp\",\n\"honjyo.akita.jp\",\n\"ikawa.akita.jp\",\n\"kamikoani.akita.jp\",\n\"kamioka.akita.jp\",\n\"katagami.akita.jp\",\n\"kazuno.akita.jp\",\n\"kitaakita.akita.jp\",\n\"kosaka.akita.jp\",\n\"kyowa.akita.jp\",\n\"misato.akita.jp\",\n\"mitane.akita.jp\",\n\"moriyoshi.akita.jp\",\n\"nikaho.akita.jp\",\n\"noshiro.akita.jp\",\n\"odate.akita.jp\",\n\"oga.akita.jp\",\n\"ogata.akita.jp\",\n\"semboku.akita.jp\",\n\"yokote.akita.jp\",\n\"yurihonjo.akita.jp\",\n\"aomori.aomori.jp\",\n\"gonohe.aomori.jp\",\n\"hachinohe.aomori.jp\",\n\"hashikami.aomori.jp\",\n\"hiranai.aomori.jp\",\n\"hirosaki.aomori.jp\",\n\"itayanagi.aomori.jp\",\n\"kuroishi.aomori.jp\",\n\"misawa.aomori.jp\",\n\"mutsu.aomori.jp\",\n\"nakadomari.aomori.jp\",\n\"noheji.aomori.jp\",\n\"oirase.aomori.jp\",\n\"owani.aomori.jp\",\n\"rokunohe.aomori.jp\",\n\"sannohe.aomori.jp\",\n\"shichinohe.aomori.jp\",\n\"shingo.aomori.jp\",\n\"takko.aomori.jp\",\n\"towada.aomori.jp\",\n\"tsugaru.aomori.jp\",\n\"tsuruta.aomori.jp\",\n\"abiko.chiba.jp\",\n\"asahi.chiba.jp\",\n\"chonan.chiba.jp\",\n\"chosei.chiba.jp\",\n\"choshi.chiba.jp\",\n\"chuo.chiba.jp\",\n\"funabashi.chiba.jp\",\n\"futtsu.chiba.jp\",\n\"hanamigawa.chiba.jp\",\n\"ichihara.chiba.jp\",\n\"ichikawa.chiba.jp\",\n\"ichinomiya.chiba.jp\",\n\"inzai.chiba.jp\",\n\"isumi.chiba.jp\",\n\"kamagaya.chiba.jp\",\n\"kamogawa.chiba.jp\",\n\"kashiwa.chiba.jp\",\n\"katori.chiba.jp\",\n\"katsuura.chiba.jp\",\n\"kimitsu.chiba.jp\",\n\"kisarazu.chiba.jp\",\n\"kozaki.chiba.jp\",\n\"kujukuri.chiba.jp\",\n\"kyonan.chiba.jp\",\n\"matsudo.chiba.jp\",\n\"midori.chiba.jp\",\n\"mihama.chiba.jp\",\n\"minamiboso.chiba.jp\",\n\"mobara.chiba.jp\",\n\"mutsuzawa.chiba.jp\",\n\"nagara.chiba.jp\",\n\"nagareyama.chiba.jp\",\n\"narashino.chiba.jp\",\n\"narita.chiba.jp\",\n\"noda.chiba.jp\",\n\"oamishirasato.chiba.jp\",\n\"omigawa.chiba.jp\",\n\"onjuku.chiba.jp\",\n\"otaki.chiba.jp\",\n\"sakae.chiba.jp\",\n\"sakura.chiba.jp\",\n\"shimofusa.chiba.jp\",\n\"shirako.chiba.jp\",\n\"shiroi.chiba.jp\",\n\"shisui.chiba.jp\",\n\"sodegaura.chiba.jp\",\n\"sosa.chiba.jp\",\n\"tako.chiba.jp\",\n\"tateyama.chiba.jp\",\n\"togane.chiba.jp\",\n\"tohnosho.chiba.jp\",\n\"tomisato.chiba.jp\",\n\"urayasu.chiba.jp\",\n\"yachimata.chiba.jp\",\n\"yachiyo.chiba.jp\",\n\"yokaichiba.chiba.jp\",\n\"yokoshibahikari.chiba.jp\",\n\"yotsukaido.chiba.jp\",\n\"ainan.ehime.jp\",\n\"honai.ehime.jp\",\n\"ikata.ehime.jp\",\n\"imabari.ehime.jp\",\n\"iyo.ehime.jp\",\n\"kamijima.ehime.jp\",\n\"kihoku.ehime.jp\",\n\"kumakogen.ehime.jp\",\n\"masaki.ehime.jp\",\n\"matsuno.ehime.jp\",\n\"matsuyama.ehime.jp\",\n\"namikata.ehime.jp\",\n\"niihama.ehime.jp\",\n\"ozu.ehime.jp\",\n\"saijo.ehime.jp\",\n\"seiyo.ehime.jp\",\n\"shikokuchuo.ehime.jp\",\n\"tobe.ehime.jp\",\n\"toon.ehime.jp\",\n\"uchiko.ehime.jp\",\n\"uwajima.ehime.jp\",\n\"yawatahama.ehime.jp\",\n\"echizen.fukui.jp\",\n\"eiheiji.fukui.jp\",\n\"fukui.fukui.jp\",\n\"ikeda.fukui.jp\",\n\"katsuyama.fukui.jp\",\n\"mihama.fukui.jp\",\n\"minamiechizen.fukui.jp\",\n\"obama.fukui.jp\",\n\"ohi.fukui.jp\",\n\"ono.fukui.jp\",\n\"sabae.fukui.jp\",\n\"sakai.fukui.jp\",\n\"takahama.fukui.jp\",\n\"tsuruga.fukui.jp\",\n\"wakasa.fukui.jp\",\n\"ashiya.fukuoka.jp\",\n\"buzen.fukuoka.jp\",\n\"chikugo.fukuoka.jp\",\n\"chikuho.fukuoka.jp\",\n\"chikujo.fukuoka.jp\",\n\"chikushino.fukuoka.jp\",\n\"chikuzen.fukuoka.jp\",\n\"chuo.fukuoka.jp\",\n\"dazaifu.fukuoka.jp\",\n\"fukuchi.fukuoka.jp\",\n\"hakata.fukuoka.jp\",\n\"higashi.fukuoka.jp\",\n\"hirokawa.fukuoka.jp\",\n\"hisayama.fukuoka.jp\",\n\"iizuka.fukuoka.jp\",\n\"inatsuki.fukuoka.jp\",\n\"kaho.fukuoka.jp\",\n\"kasuga.fukuoka.jp\",\n\"kasuya.fukuoka.jp\",\n\"kawara.fukuoka.jp\",\n\"keisen.fukuoka.jp\",\n\"koga.fukuoka.jp\",\n\"kurate.fukuoka.jp\",\n\"kurogi.fukuoka.jp\",\n\"kurume.fukuoka.jp\",\n\"minami.fukuoka.jp\",\n\"miyako.fukuoka.jp\",\n\"miyama.fukuoka.jp\",\n\"miyawaka.fukuoka.jp\",\n\"mizumaki.fukuoka.jp\",\n\"munakata.fukuoka.jp\",\n\"nakagawa.fukuoka.jp\",\n\"nakama.fukuoka.jp\",\n\"nishi.fukuoka.jp\",\n\"nogata.fukuoka.jp\",\n\"ogori.fukuoka.jp\",\n\"okagaki.fukuoka.jp\",\n\"okawa.fukuoka.jp\",\n\"oki.fukuoka.jp\",\n\"omuta.fukuoka.jp\",\n\"onga.fukuoka.jp\",\n\"onojo.fukuoka.jp\",\n\"oto.fukuoka.jp\",\n\"saigawa.fukuoka.jp\",\n\"sasaguri.fukuoka.jp\",\n\"shingu.fukuoka.jp\",\n\"shinyoshitomi.fukuoka.jp\",\n\"shonai.fukuoka.jp\",\n\"soeda.fukuoka.jp\",\n\"sue.fukuoka.jp\",\n\"tachiarai.fukuoka.jp\",\n\"tagawa.fukuoka.jp\",\n\"takata.fukuoka.jp\",\n\"toho.fukuoka.jp\",\n\"toyotsu.fukuoka.jp\",\n\"tsuiki.fukuoka.jp\",\n\"ukiha.fukuoka.jp\",\n\"umi.fukuoka.jp\",\n\"usui.fukuoka.jp\",\n\"yamada.fukuoka.jp\",\n\"yame.fukuoka.jp\",\n\"yanagawa.fukuoka.jp\",\n\"yukuhashi.fukuoka.jp\",\n\"aizubange.fukushima.jp\",\n\"aizumisato.fukushima.jp\",\n\"aizuwakamatsu.fukushima.jp\",\n\"asakawa.fukushima.jp\",\n\"bandai.fukushima.jp\",\n\"date.fukushima.jp\",\n\"fukushima.fukushima.jp\",\n\"furudono.fukushima.jp\",\n\"futaba.fukushima.jp\",\n\"hanawa.fukushima.jp\",\n\"higashi.fukushima.jp\",\n\"hirata.fukushima.jp\",\n\"hirono.fukushima.jp\",\n\"iitate.fukushima.jp\",\n\"inawashiro.fukushima.jp\",\n\"ishikawa.fukushima.jp\",\n\"iwaki.fukushima.jp\",\n\"izumizaki.fukushima.jp\",\n\"kagamiishi.fukushima.jp\",\n\"kaneyama.fukushima.jp\",\n\"kawamata.fukushima.jp\",\n\"kitakata.fukushima.jp\",\n\"kitashiobara.fukushima.jp\",\n\"koori.fukushima.jp\",\n\"koriyama.fukushima.jp\",\n\"kunimi.fukushima.jp\",\n\"miharu.fukushima.jp\",\n\"mishima.fukushima.jp\",\n\"namie.fukushima.jp\",\n\"nango.fukushima.jp\",\n\"nishiaizu.fukushima.jp\",\n\"nishigo.fukushima.jp\",\n\"okuma.fukushima.jp\",\n\"omotego.fukushima.jp\",\n\"ono.fukushima.jp\",\n\"otama.fukushima.jp\",\n\"samegawa.fukushima.jp\",\n\"shimogo.fukushima.jp\",\n\"shirakawa.fukushima.jp\",\n\"showa.fukushima.jp\",\n\"soma.fukushima.jp\",\n\"sukagawa.fukushima.jp\",\n\"taishin.fukushima.jp\",\n\"tamakawa.fukushima.jp\",\n\"tanagura.fukushima.jp\",\n\"tenei.fukushima.jp\",\n\"yabuki.fukushima.jp\",\n\"yamato.fukushima.jp\",\n\"yamatsuri.fukushima.jp\",\n\"yanaizu.fukushima.jp\",\n\"yugawa.fukushima.jp\",\n\"anpachi.gifu.jp\",\n\"ena.gifu.jp\",\n\"gifu.gifu.jp\",\n\"ginan.gifu.jp\",\n\"godo.gifu.jp\",\n\"gujo.gifu.jp\",\n\"hashima.gifu.jp\",\n\"hichiso.gifu.jp\",\n\"hida.gifu.jp\",\n\"higashishirakawa.gifu.jp\",\n\"ibigawa.gifu.jp\",\n\"ikeda.gifu.jp\",\n\"kakamigahara.gifu.jp\",\n\"kani.gifu.jp\",\n\"kasahara.gifu.jp\",\n\"kasamatsu.gifu.jp\",\n\"kawaue.gifu.jp\",\n\"kitagata.gifu.jp\",\n\"mino.gifu.jp\",\n\"minokamo.gifu.jp\",\n\"mitake.gifu.jp\",\n\"mizunami.gifu.jp\",\n\"motosu.gifu.jp\",\n\"nakatsugawa.gifu.jp\",\n\"ogaki.gifu.jp\",\n\"sakahogi.gifu.jp\",\n\"seki.gifu.jp\",\n\"sekigahara.gifu.jp\",\n\"shirakawa.gifu.jp\",\n\"tajimi.gifu.jp\",\n\"takayama.gifu.jp\",\n\"tarui.gifu.jp\",\n\"toki.gifu.jp\",\n\"tomika.gifu.jp\",\n\"wanouchi.gifu.jp\",\n\"yamagata.gifu.jp\",\n\"yaotsu.gifu.jp\",\n\"yoro.gifu.jp\",\n\"annaka.gunma.jp\",\n\"chiyoda.gunma.jp\",\n\"fujioka.gunma.jp\",\n\"higashiagatsuma.gunma.jp\",\n\"isesaki.gunma.jp\",\n\"itakura.gunma.jp\",\n\"kanna.gunma.jp\",\n\"kanra.gunma.jp\",\n\"katashina.gunma.jp\",\n\"kawaba.gunma.jp\",\n\"kiryu.gunma.jp\",\n\"kusatsu.gunma.jp\",\n\"maebashi.gunma.jp\",\n\"meiwa.gunma.jp\",\n\"midori.gunma.jp\",\n\"minakami.gunma.jp\",\n\"naganohara.gunma.jp\",\n\"nakanojo.gunma.jp\",\n\"nanmoku.gunma.jp\",\n\"numata.gunma.jp\",\n\"oizumi.gunma.jp\",\n\"ora.gunma.jp\",\n\"ota.gunma.jp\",\n\"shibukawa.gunma.jp\",\n\"shimonita.gunma.jp\",\n\"shinto.gunma.jp\",\n\"showa.gunma.jp\",\n\"takasaki.gunma.jp\",\n\"takayama.gunma.jp\",\n\"tamamura.gunma.jp\",\n\"tatebayashi.gunma.jp\",\n\"tomioka.gunma.jp\",\n\"tsukiyono.gunma.jp\",\n\"tsumagoi.gunma.jp\",\n\"ueno.gunma.jp\",\n\"yoshioka.gunma.jp\",\n\"asaminami.hiroshima.jp\",\n\"daiwa.hiroshima.jp\",\n\"etajima.hiroshima.jp\",\n\"fuchu.hiroshima.jp\",\n\"fukuyama.hiroshima.jp\",\n\"hatsukaichi.hiroshima.jp\",\n\"higashihiroshima.hiroshima.jp\",\n\"hongo.hiroshima.jp\",\n\"jinsekikogen.hiroshima.jp\",\n\"kaita.hiroshima.jp\",\n\"kui.hiroshima.jp\",\n\"kumano.hiroshima.jp\",\n\"kure.hiroshima.jp\",\n\"mihara.hiroshima.jp\",\n\"miyoshi.hiroshima.jp\",\n\"naka.hiroshima.jp\",\n\"onomichi.hiroshima.jp\",\n\"osakikamijima.hiroshima.jp\",\n\"otake.hiroshima.jp\",\n\"saka.hiroshima.jp\",\n\"sera.hiroshima.jp\",\n\"seranishi.hiroshima.jp\",\n\"shinichi.hiroshima.jp\",\n\"shobara.hiroshima.jp\",\n\"takehara.hiroshima.jp\",\n\"abashiri.hokkaido.jp\",\n\"abira.hokkaido.jp\",\n\"aibetsu.hokkaido.jp\",\n\"akabira.hokkaido.jp\",\n\"akkeshi.hokkaido.jp\",\n\"asahikawa.hokkaido.jp\",\n\"ashibetsu.hokkaido.jp\",\n\"ashoro.hokkaido.jp\",\n\"assabu.hokkaido.jp\",\n\"atsuma.hokkaido.jp\",\n\"bibai.hokkaido.jp\",\n\"biei.hokkaido.jp\",\n\"bifuka.hokkaido.jp\",\n\"bihoro.hokkaido.jp\",\n\"biratori.hokkaido.jp\",\n\"chippubetsu.hokkaido.jp\",\n\"chitose.hokkaido.jp\",\n\"date.hokkaido.jp\",\n\"ebetsu.hokkaido.jp\",\n\"embetsu.hokkaido.jp\",\n\"eniwa.hokkaido.jp\",\n\"erimo.hokkaido.jp\",\n\"esan.hokkaido.jp\",\n\"esashi.hokkaido.jp\",\n\"fukagawa.hokkaido.jp\",\n\"fukushima.hokkaido.jp\",\n\"furano.hokkaido.jp\",\n\"furubira.hokkaido.jp\",\n\"haboro.hokkaido.jp\",\n\"hakodate.hokkaido.jp\",\n\"hamatonbetsu.hokkaido.jp\",\n\"hidaka.hokkaido.jp\",\n\"higashikagura.hokkaido.jp\",\n\"higashikawa.hokkaido.jp\",\n\"hiroo.hokkaido.jp\",\n\"hokuryu.hokkaido.jp\",\n\"hokuto.hokkaido.jp\",\n\"honbetsu.hokkaido.jp\",\n\"horokanai.hokkaido.jp\",\n\"horonobe.hokkaido.jp\",\n\"ikeda.hokkaido.jp\",\n\"imakane.hokkaido.jp\",\n\"ishikari.hokkaido.jp\",\n\"iwamizawa.hokkaido.jp\",\n\"iwanai.hokkaido.jp\",\n\"kamifurano.hokkaido.jp\",\n\"kamikawa.hokkaido.jp\",\n\"kamishihoro.hokkaido.jp\",\n\"kamisunagawa.hokkaido.jp\",\n\"kamoenai.hokkaido.jp\",\n\"kayabe.hokkaido.jp\",\n\"kembuchi.hokkaido.jp\",\n\"kikonai.hokkaido.jp\",\n\"kimobetsu.hokkaido.jp\",\n\"kitahiroshima.hokkaido.jp\",\n\"kitami.hokkaido.jp\",\n\"kiyosato.hokkaido.jp\",\n\"koshimizu.hokkaido.jp\",\n\"kunneppu.hokkaido.jp\",\n\"kuriyama.hokkaido.jp\",\n\"kuromatsunai.hokkaido.jp\",\n\"kushiro.hokkaido.jp\",\n\"kutchan.hokkaido.jp\",\n\"kyowa.hokkaido.jp\",\n\"mashike.hokkaido.jp\",\n\"matsumae.hokkaido.jp\",\n\"mikasa.hokkaido.jp\",\n\"minamifurano.hokkaido.jp\",\n\"mombetsu.hokkaido.jp\",\n\"moseushi.hokkaido.jp\",\n\"mukawa.hokkaido.jp\",\n\"muroran.hokkaido.jp\",\n\"naie.hokkaido.jp\",\n\"nakagawa.hokkaido.jp\",\n\"nakasatsunai.hokkaido.jp\",\n\"nakatombetsu.hokkaido.jp\",\n\"nanae.hokkaido.jp\",\n\"nanporo.hokkaido.jp\",\n\"nayoro.hokkaido.jp\",\n\"nemuro.hokkaido.jp\",\n\"niikappu.hokkaido.jp\",\n\"niki.hokkaido.jp\",\n\"nishiokoppe.hokkaido.jp\",\n\"noboribetsu.hokkaido.jp\",\n\"numata.hokkaido.jp\",\n\"obihiro.hokkaido.jp\",\n\"obira.hokkaido.jp\",\n\"oketo.hokkaido.jp\",\n\"okoppe.hokkaido.jp\",\n\"otaru.hokkaido.jp\",\n\"otobe.hokkaido.jp\",\n\"otofuke.hokkaido.jp\",\n\"otoineppu.hokkaido.jp\",\n\"oumu.hokkaido.jp\",\n\"ozora.hokkaido.jp\",\n\"pippu.hokkaido.jp\",\n\"rankoshi.hokkaido.jp\",\n\"rebun.hokkaido.jp\",\n\"rikubetsu.hokkaido.jp\",\n\"rishiri.hokkaido.jp\",\n\"rishirifuji.hokkaido.jp\",\n\"saroma.hokkaido.jp\",\n\"sarufutsu.hokkaido.jp\",\n\"shakotan.hokkaido.jp\",\n\"shari.hokkaido.jp\",\n\"shibecha.hokkaido.jp\",\n\"shibetsu.hokkaido.jp\",\n\"shikabe.hokkaido.jp\",\n\"shikaoi.hokkaido.jp\",\n\"shimamaki.hokkaido.jp\",\n\"shimizu.hokkaido.jp\",\n\"shimokawa.hokkaido.jp\",\n\"shinshinotsu.hokkaido.jp\",\n\"shintoku.hokkaido.jp\",\n\"shiranuka.hokkaido.jp\",\n\"shiraoi.hokkaido.jp\",\n\"shiriuchi.hokkaido.jp\",\n\"sobetsu.hokkaido.jp\",\n\"sunagawa.hokkaido.jp\",\n\"taiki.hokkaido.jp\",\n\"takasu.hokkaido.jp\",\n\"takikawa.hokkaido.jp\",\n\"takinoue.hokkaido.jp\",\n\"teshikaga.hokkaido.jp\",\n\"tobetsu.hokkaido.jp\",\n\"tohma.hokkaido.jp\",\n\"tomakomai.hokkaido.jp\",\n\"tomari.hokkaido.jp\",\n\"toya.hokkaido.jp\",\n\"toyako.hokkaido.jp\",\n\"toyotomi.hokkaido.jp\",\n\"toyoura.hokkaido.jp\",\n\"tsubetsu.hokkaido.jp\",\n\"tsukigata.hokkaido.jp\",\n\"urakawa.hokkaido.jp\",\n\"urausu.hokkaido.jp\",\n\"uryu.hokkaido.jp\",\n\"utashinai.hokkaido.jp\",\n\"wakkanai.hokkaido.jp\",\n\"wassamu.hokkaido.jp\",\n\"yakumo.hokkaido.jp\",\n\"yoichi.hokkaido.jp\",\n\"aioi.hyogo.jp\",\n\"akashi.hyogo.jp\",\n\"ako.hyogo.jp\",\n\"amagasaki.hyogo.jp\",\n\"aogaki.hyogo.jp\",\n\"asago.hyogo.jp\",\n\"ashiya.hyogo.jp\",\n\"awaji.hyogo.jp\",\n\"fukusaki.hyogo.jp\",\n\"goshiki.hyogo.jp\",\n\"harima.hyogo.jp\",\n\"himeji.hyogo.jp\",\n\"ichikawa.hyogo.jp\",\n\"inagawa.hyogo.jp\",\n\"itami.hyogo.jp\",\n\"kakogawa.hyogo.jp\",\n\"kamigori.hyogo.jp\",\n\"kamikawa.hyogo.jp\",\n\"kasai.hyogo.jp\",\n\"kasuga.hyogo.jp\",\n\"kawanishi.hyogo.jp\",\n\"miki.hyogo.jp\",\n\"minamiawaji.hyogo.jp\",\n\"nishinomiya.hyogo.jp\",\n\"nishiwaki.hyogo.jp\",\n\"ono.hyogo.jp\",\n\"sanda.hyogo.jp\",\n\"sannan.hyogo.jp\",\n\"sasayama.hyogo.jp\",\n\"sayo.hyogo.jp\",\n\"shingu.hyogo.jp\",\n\"shinonsen.hyogo.jp\",\n\"shiso.hyogo.jp\",\n\"sumoto.hyogo.jp\",\n\"taishi.hyogo.jp\",\n\"taka.hyogo.jp\",\n\"takarazuka.hyogo.jp\",\n\"takasago.hyogo.jp\",\n\"takino.hyogo.jp\",\n\"tamba.hyogo.jp\",\n\"tatsuno.hyogo.jp\",\n\"toyooka.hyogo.jp\",\n\"yabu.hyogo.jp\",\n\"yashiro.hyogo.jp\",\n\"yoka.hyogo.jp\",\n\"yokawa.hyogo.jp\",\n\"ami.ibaraki.jp\",\n\"asahi.ibaraki.jp\",\n\"bando.ibaraki.jp\",\n\"chikusei.ibaraki.jp\",\n\"daigo.ibaraki.jp\",\n\"fujishiro.ibaraki.jp\",\n\"hitachi.ibaraki.jp\",\n\"hitachinaka.ibaraki.jp\",\n\"hitachiomiya.ibaraki.jp\",\n\"hitachiota.ibaraki.jp\",\n\"ibaraki.ibaraki.jp\",\n\"ina.ibaraki.jp\",\n\"inashiki.ibaraki.jp\",\n\"itako.ibaraki.jp\",\n\"iwama.ibaraki.jp\",\n\"joso.ibaraki.jp\",\n\"kamisu.ibaraki.jp\",\n\"kasama.ibaraki.jp\",\n\"kashima.ibaraki.jp\",\n\"kasumigaura.ibaraki.jp\",\n\"koga.ibaraki.jp\",\n\"miho.ibaraki.jp\",\n\"mito.ibaraki.jp\",\n\"moriya.ibaraki.jp\",\n\"naka.ibaraki.jp\",\n\"namegata.ibaraki.jp\",\n\"oarai.ibaraki.jp\",\n\"ogawa.ibaraki.jp\",\n\"omitama.ibaraki.jp\",\n\"ryugasaki.ibaraki.jp\",\n\"sakai.ibaraki.jp\",\n\"sakuragawa.ibaraki.jp\",\n\"shimodate.ibaraki.jp\",\n\"shimotsuma.ibaraki.jp\",\n\"shirosato.ibaraki.jp\",\n\"sowa.ibaraki.jp\",\n\"suifu.ibaraki.jp\",\n\"takahagi.ibaraki.jp\",\n\"tamatsukuri.ibaraki.jp\",\n\"tokai.ibaraki.jp\",\n\"tomobe.ibaraki.jp\",\n\"tone.ibaraki.jp\",\n\"toride.ibaraki.jp\",\n\"tsuchiura.ibaraki.jp\",\n\"tsukuba.ibaraki.jp\",\n\"uchihara.ibaraki.jp\",\n\"ushiku.ibaraki.jp\",\n\"yachiyo.ibaraki.jp\",\n\"yamagata.ibaraki.jp\",\n\"yawara.ibaraki.jp\",\n\"yuki.ibaraki.jp\",\n\"anamizu.ishikawa.jp\",\n\"hakui.ishikawa.jp\",\n\"hakusan.ishikawa.jp\",\n\"kaga.ishikawa.jp\",\n\"kahoku.ishikawa.jp\",\n\"kanazawa.ishikawa.jp\",\n\"kawakita.ishikawa.jp\",\n\"komatsu.ishikawa.jp\",\n\"nakanoto.ishikawa.jp\",\n\"nanao.ishikawa.jp\",\n\"nomi.ishikawa.jp\",\n\"nonoichi.ishikawa.jp\",\n\"noto.ishikawa.jp\",\n\"shika.ishikawa.jp\",\n\"suzu.ishikawa.jp\",\n\"tsubata.ishikawa.jp\",\n\"tsurugi.ishikawa.jp\",\n\"uchinada.ishikawa.jp\",\n\"wajima.ishikawa.jp\",\n\"fudai.iwate.jp\",\n\"fujisawa.iwate.jp\",\n\"hanamaki.iwate.jp\",\n\"hiraizumi.iwate.jp\",\n\"hirono.iwate.jp\",\n\"ichinohe.iwate.jp\",\n\"ichinoseki.iwate.jp\",\n\"iwaizumi.iwate.jp\",\n\"iwate.iwate.jp\",\n\"joboji.iwate.jp\",\n\"kamaishi.iwate.jp\",\n\"kanegasaki.iwate.jp\",\n\"karumai.iwate.jp\",\n\"kawai.iwate.jp\",\n\"kitakami.iwate.jp\",\n\"kuji.iwate.jp\",\n\"kunohe.iwate.jp\",\n\"kuzumaki.iwate.jp\",\n\"miyako.iwate.jp\",\n\"mizusawa.iwate.jp\",\n\"morioka.iwate.jp\",\n\"ninohe.iwate.jp\",\n\"noda.iwate.jp\",\n\"ofunato.iwate.jp\",\n\"oshu.iwate.jp\",\n\"otsuchi.iwate.jp\",\n\"rikuzentakata.iwate.jp\",\n\"shiwa.iwate.jp\",\n\"shizukuishi.iwate.jp\",\n\"sumita.iwate.jp\",\n\"tanohata.iwate.jp\",\n\"tono.iwate.jp\",\n\"yahaba.iwate.jp\",\n\"yamada.iwate.jp\",\n\"ayagawa.kagawa.jp\",\n\"higashikagawa.kagawa.jp\",\n\"kanonji.kagawa.jp\",\n\"kotohira.kagawa.jp\",\n\"manno.kagawa.jp\",\n\"marugame.kagawa.jp\",\n\"mitoyo.kagawa.jp\",\n\"naoshima.kagawa.jp\",\n\"sanuki.kagawa.jp\",\n\"tadotsu.kagawa.jp\",\n\"takamatsu.kagawa.jp\",\n\"tonosho.kagawa.jp\",\n\"uchinomi.kagawa.jp\",\n\"utazu.kagawa.jp\",\n\"zentsuji.kagawa.jp\",\n\"akune.kagoshima.jp\",\n\"amami.kagoshima.jp\",\n\"hioki.kagoshima.jp\",\n\"isa.kagoshima.jp\",\n\"isen.kagoshima.jp\",\n\"izumi.kagoshima.jp\",\n\"kagoshima.kagoshima.jp\",\n\"kanoya.kagoshima.jp\",\n\"kawanabe.kagoshima.jp\",\n\"kinko.kagoshima.jp\",\n\"kouyama.kagoshima.jp\",\n\"makurazaki.kagoshima.jp\",\n\"matsumoto.kagoshima.jp\",\n\"minamitane.kagoshima.jp\",\n\"nakatane.kagoshima.jp\",\n\"nishinoomote.kagoshima.jp\",\n\"satsumasendai.kagoshima.jp\",\n\"soo.kagoshima.jp\",\n\"tarumizu.kagoshima.jp\",\n\"yusui.kagoshima.jp\",\n\"aikawa.kanagawa.jp\",\n\"atsugi.kanagawa.jp\",\n\"ayase.kanagawa.jp\",\n\"chigasaki.kanagawa.jp\",\n\"ebina.kanagawa.jp\",\n\"fujisawa.kanagawa.jp\",\n\"hadano.kanagawa.jp\",\n\"hakone.kanagawa.jp\",\n\"hiratsuka.kanagawa.jp\",\n\"isehara.kanagawa.jp\",\n\"kaisei.kanagawa.jp\",\n\"kamakura.kanagawa.jp\",\n\"kiyokawa.kanagawa.jp\",\n\"matsuda.kanagawa.jp\",\n\"minamiashigara.kanagawa.jp\",\n\"miura.kanagawa.jp\",\n\"nakai.kanagawa.jp\",\n\"ninomiya.kanagawa.jp\",\n\"odawara.kanagawa.jp\",\n\"oi.kanagawa.jp\",\n\"oiso.kanagawa.jp\",\n\"sagamihara.kanagawa.jp\",\n\"samukawa.kanagawa.jp\",\n\"tsukui.kanagawa.jp\",\n\"yamakita.kanagawa.jp\",\n\"yamato.kanagawa.jp\",\n\"yokosuka.kanagawa.jp\",\n\"yugawara.kanagawa.jp\",\n\"zama.kanagawa.jp\",\n\"zushi.kanagawa.jp\",\n\"aki.kochi.jp\",\n\"geisei.kochi.jp\",\n\"hidaka.kochi.jp\",\n\"higashitsuno.kochi.jp\",\n\"ino.kochi.jp\",\n\"kagami.kochi.jp\",\n\"kami.kochi.jp\",\n\"kitagawa.kochi.jp\",\n\"kochi.kochi.jp\",\n\"mihara.kochi.jp\",\n\"motoyama.kochi.jp\",\n\"muroto.kochi.jp\",\n\"nahari.kochi.jp\",\n\"nakamura.kochi.jp\",\n\"nankoku.kochi.jp\",\n\"nishitosa.kochi.jp\",\n\"niyodogawa.kochi.jp\",\n\"ochi.kochi.jp\",\n\"okawa.kochi.jp\",\n\"otoyo.kochi.jp\",\n\"otsuki.kochi.jp\",\n\"sakawa.kochi.jp\",\n\"sukumo.kochi.jp\",\n\"susaki.kochi.jp\",\n\"tosa.kochi.jp\",\n\"tosashimizu.kochi.jp\",\n\"toyo.kochi.jp\",\n\"tsuno.kochi.jp\",\n\"umaji.kochi.jp\",\n\"yasuda.kochi.jp\",\n\"yusuhara.kochi.jp\",\n\"amakusa.kumamoto.jp\",\n\"arao.kumamoto.jp\",\n\"aso.kumamoto.jp\",\n\"choyo.kumamoto.jp\",\n\"gyokuto.kumamoto.jp\",\n\"kamiamakusa.kumamoto.jp\",\n\"kikuchi.kumamoto.jp\",\n\"kumamoto.kumamoto.jp\",\n\"mashiki.kumamoto.jp\",\n\"mifune.kumamoto.jp\",\n\"minamata.kumamoto.jp\",\n\"minamioguni.kumamoto.jp\",\n\"nagasu.kumamoto.jp\",\n\"nishihara.kumamoto.jp\",\n\"oguni.kumamoto.jp\",\n\"ozu.kumamoto.jp\",\n\"sumoto.kumamoto.jp\",\n\"takamori.kumamoto.jp\",\n\"uki.kumamoto.jp\",\n\"uto.kumamoto.jp\",\n\"yamaga.kumamoto.jp\",\n\"yamato.kumamoto.jp\",\n\"yatsushiro.kumamoto.jp\",\n\"ayabe.kyoto.jp\",\n\"fukuchiyama.kyoto.jp\",\n\"higashiyama.kyoto.jp\",\n\"ide.kyoto.jp\",\n\"ine.kyoto.jp\",\n\"joyo.kyoto.jp\",\n\"kameoka.kyoto.jp\",\n\"kamo.kyoto.jp\",\n\"kita.kyoto.jp\",\n\"kizu.kyoto.jp\",\n\"kumiyama.kyoto.jp\",\n\"kyotamba.kyoto.jp\",\n\"kyotanabe.kyoto.jp\",\n\"kyotango.kyoto.jp\",\n\"maizuru.kyoto.jp\",\n\"minami.kyoto.jp\",\n\"minamiyamashiro.kyoto.jp\",\n\"miyazu.kyoto.jp\",\n\"muko.kyoto.jp\",\n\"nagaokakyo.kyoto.jp\",\n\"nakagyo.kyoto.jp\",\n\"nantan.kyoto.jp\",\n\"oyamazaki.kyoto.jp\",\n\"sakyo.kyoto.jp\",\n\"seika.kyoto.jp\",\n\"tanabe.kyoto.jp\",\n\"uji.kyoto.jp\",\n\"ujitawara.kyoto.jp\",\n\"wazuka.kyoto.jp\",\n\"yamashina.kyoto.jp\",\n\"yawata.kyoto.jp\",\n\"asahi.mie.jp\",\n\"inabe.mie.jp\",\n\"ise.mie.jp\",\n\"kameyama.mie.jp\",\n\"kawagoe.mie.jp\",\n\"kiho.mie.jp\",\n\"kisosaki.mie.jp\",\n\"kiwa.mie.jp\",\n\"komono.mie.jp\",\n\"kumano.mie.jp\",\n\"kuwana.mie.jp\",\n\"matsusaka.mie.jp\",\n\"meiwa.mie.jp\",\n\"mihama.mie.jp\",\n\"minamiise.mie.jp\",\n\"misugi.mie.jp\",\n\"miyama.mie.jp\",\n\"nabari.mie.jp\",\n\"shima.mie.jp\",\n\"suzuka.mie.jp\",\n\"tado.mie.jp\",\n\"taiki.mie.jp\",\n\"taki.mie.jp\",\n\"tamaki.mie.jp\",\n\"toba.mie.jp\",\n\"tsu.mie.jp\",\n\"udono.mie.jp\",\n\"ureshino.mie.jp\",\n\"watarai.mie.jp\",\n\"yokkaichi.mie.jp\",\n\"furukawa.miyagi.jp\",\n\"higashimatsushima.miyagi.jp\",\n\"ishinomaki.miyagi.jp\",\n\"iwanuma.miyagi.jp\",\n\"kakuda.miyagi.jp\",\n\"kami.miyagi.jp\",\n\"kawasaki.miyagi.jp\",\n\"marumori.miyagi.jp\",\n\"matsushima.miyagi.jp\",\n\"minamisanriku.miyagi.jp\",\n\"misato.miyagi.jp\",\n\"murata.miyagi.jp\",\n\"natori.miyagi.jp\",\n\"ogawara.miyagi.jp\",\n\"ohira.miyagi.jp\",\n\"onagawa.miyagi.jp\",\n\"osaki.miyagi.jp\",\n\"rifu.miyagi.jp\",\n\"semine.miyagi.jp\",\n\"shibata.miyagi.jp\",\n\"shichikashuku.miyagi.jp\",\n\"shikama.miyagi.jp\",\n\"shiogama.miyagi.jp\",\n\"shiroishi.miyagi.jp\",\n\"tagajo.miyagi.jp\",\n\"taiwa.miyagi.jp\",\n\"tome.miyagi.jp\",\n\"tomiya.miyagi.jp\",\n\"wakuya.miyagi.jp\",\n\"watari.miyagi.jp\",\n\"yamamoto.miyagi.jp\",\n\"zao.miyagi.jp\",\n\"aya.miyazaki.jp\",\n\"ebino.miyazaki.jp\",\n\"gokase.miyazaki.jp\",\n\"hyuga.miyazaki.jp\",\n\"kadogawa.miyazaki.jp\",\n\"kawaminami.miyazaki.jp\",\n\"kijo.miyazaki.jp\",\n\"kitagawa.miyazaki.jp\",\n\"kitakata.miyazaki.jp\",\n\"kitaura.miyazaki.jp\",\n\"kobayashi.miyazaki.jp\",\n\"kunitomi.miyazaki.jp\",\n\"kushima.miyazaki.jp\",\n\"mimata.miyazaki.jp\",\n\"miyakonojo.miyazaki.jp\",\n\"miyazaki.miyazaki.jp\",\n\"morotsuka.miyazaki.jp\",\n\"nichinan.miyazaki.jp\",\n\"nishimera.miyazaki.jp\",\n\"nobeoka.miyazaki.jp\",\n\"saito.miyazaki.jp\",\n\"shiiba.miyazaki.jp\",\n\"shintomi.miyazaki.jp\",\n\"takaharu.miyazaki.jp\",\n\"takanabe.miyazaki.jp\",\n\"takazaki.miyazaki.jp\",\n\"tsuno.miyazaki.jp\",\n\"achi.nagano.jp\",\n\"agematsu.nagano.jp\",\n\"anan.nagano.jp\",\n\"aoki.nagano.jp\",\n\"asahi.nagano.jp\",\n\"azumino.nagano.jp\",\n\"chikuhoku.nagano.jp\",\n\"chikuma.nagano.jp\",\n\"chino.nagano.jp\",\n\"fujimi.nagano.jp\",\n\"hakuba.nagano.jp\",\n\"hara.nagano.jp\",\n\"hiraya.nagano.jp\",\n\"iida.nagano.jp\",\n\"iijima.nagano.jp\",\n\"iiyama.nagano.jp\",\n\"iizuna.nagano.jp\",\n\"ikeda.nagano.jp\",\n\"ikusaka.nagano.jp\",\n\"ina.nagano.jp\",\n\"karuizawa.nagano.jp\",\n\"kawakami.nagano.jp\",\n\"kiso.nagano.jp\",\n\"kisofukushima.nagano.jp\",\n\"kitaaiki.nagano.jp\",\n\"komagane.nagano.jp\",\n\"komoro.nagano.jp\",\n\"matsukawa.nagano.jp\",\n\"matsumoto.nagano.jp\",\n\"miasa.nagano.jp\",\n\"minamiaiki.nagano.jp\",\n\"minamimaki.nagano.jp\",\n\"minamiminowa.nagano.jp\",\n\"minowa.nagano.jp\",\n\"miyada.nagano.jp\",\n\"miyota.nagano.jp\",\n\"mochizuki.nagano.jp\",\n\"nagano.nagano.jp\",\n\"nagawa.nagano.jp\",\n\"nagiso.nagano.jp\",\n\"nakagawa.nagano.jp\",\n\"nakano.nagano.jp\",\n\"nozawaonsen.nagano.jp\",\n\"obuse.nagano.jp\",\n\"ogawa.nagano.jp\",\n\"okaya.nagano.jp\",\n\"omachi.nagano.jp\",\n\"omi.nagano.jp\",\n\"ookuwa.nagano.jp\",\n\"ooshika.nagano.jp\",\n\"otaki.nagano.jp\",\n\"otari.nagano.jp\",\n\"sakae.nagano.jp\",\n\"sakaki.nagano.jp\",\n\"saku.nagano.jp\",\n\"sakuho.nagano.jp\",\n\"shimosuwa.nagano.jp\",\n\"shinanomachi.nagano.jp\",\n\"shiojiri.nagano.jp\",\n\"suwa.nagano.jp\",\n\"suzaka.nagano.jp\",\n\"takagi.nagano.jp\",\n\"takamori.nagano.jp\",\n\"takayama.nagano.jp\",\n\"tateshina.nagano.jp\",\n\"tatsuno.nagano.jp\",\n\"togakushi.nagano.jp\",\n\"togura.nagano.jp\",\n\"tomi.nagano.jp\",\n\"ueda.nagano.jp\",\n\"wada.nagano.jp\",\n\"yamagata.nagano.jp\",\n\"yamanouchi.nagano.jp\",\n\"yasaka.nagano.jp\",\n\"yasuoka.nagano.jp\",\n\"chijiwa.nagasaki.jp\",\n\"futsu.nagasaki.jp\",\n\"goto.nagasaki.jp\",\n\"hasami.nagasaki.jp\",\n\"hirado.nagasaki.jp\",\n\"iki.nagasaki.jp\",\n\"isahaya.nagasaki.jp\",\n\"kawatana.nagasaki.jp\",\n\"kuchinotsu.nagasaki.jp\",\n\"matsuura.nagasaki.jp\",\n\"nagasaki.nagasaki.jp\",\n\"obama.nagasaki.jp\",\n\"omura.nagasaki.jp\",\n\"oseto.nagasaki.jp\",\n\"saikai.nagasaki.jp\",\n\"sasebo.nagasaki.jp\",\n\"seihi.nagasaki.jp\",\n\"shimabara.nagasaki.jp\",\n\"shinkamigoto.nagasaki.jp\",\n\"togitsu.nagasaki.jp\",\n\"tsushima.nagasaki.jp\",\n\"unzen.nagasaki.jp\",\n\"ando.nara.jp\",\n\"gose.nara.jp\",\n\"heguri.nara.jp\",\n\"higashiyoshino.nara.jp\",\n\"ikaruga.nara.jp\",\n\"ikoma.nara.jp\",\n\"kamikitayama.nara.jp\",\n\"kanmaki.nara.jp\",\n\"kashiba.nara.jp\",\n\"kashihara.nara.jp\",\n\"katsuragi.nara.jp\",\n\"kawai.nara.jp\",\n\"kawakami.nara.jp\",\n\"kawanishi.nara.jp\",\n\"koryo.nara.jp\",\n\"kurotaki.nara.jp\",\n\"mitsue.nara.jp\",\n\"miyake.nara.jp\",\n\"nara.nara.jp\",\n\"nosegawa.nara.jp\",\n\"oji.nara.jp\",\n\"ouda.nara.jp\",\n\"oyodo.nara.jp\",\n\"sakurai.nara.jp\",\n\"sango.nara.jp\",\n\"shimoichi.nara.jp\",\n\"shimokitayama.nara.jp\",\n\"shinjo.nara.jp\",\n\"soni.nara.jp\",\n\"takatori.nara.jp\",\n\"tawaramoto.nara.jp\",\n\"tenkawa.nara.jp\",\n\"tenri.nara.jp\",\n\"uda.nara.jp\",\n\"yamatokoriyama.nara.jp\",\n\"yamatotakada.nara.jp\",\n\"yamazoe.nara.jp\",\n\"yoshino.nara.jp\",\n\"aga.niigata.jp\",\n\"agano.niigata.jp\",\n\"gosen.niigata.jp\",\n\"itoigawa.niigata.jp\",\n\"izumozaki.niigata.jp\",\n\"joetsu.niigata.jp\",\n\"kamo.niigata.jp\",\n\"kariwa.niigata.jp\",\n\"kashiwazaki.niigata.jp\",\n\"minamiuonuma.niigata.jp\",\n\"mitsuke.niigata.jp\",\n\"muika.niigata.jp\",\n\"murakami.niigata.jp\",\n\"myoko.niigata.jp\",\n\"nagaoka.niigata.jp\",\n\"niigata.niigata.jp\",\n\"ojiya.niigata.jp\",\n\"omi.niigata.jp\",\n\"sado.niigata.jp\",\n\"sanjo.niigata.jp\",\n\"seiro.niigata.jp\",\n\"seirou.niigata.jp\",\n\"sekikawa.niigata.jp\",\n\"shibata.niigata.jp\",\n\"tagami.niigata.jp\",\n\"tainai.niigata.jp\",\n\"tochio.niigata.jp\",\n\"tokamachi.niigata.jp\",\n\"tsubame.niigata.jp\",\n\"tsunan.niigata.jp\",\n\"uonuma.niigata.jp\",\n\"yahiko.niigata.jp\",\n\"yoita.niigata.jp\",\n\"yuzawa.niigata.jp\",\n\"beppu.oita.jp\",\n\"bungoono.oita.jp\",\n\"bungotakada.oita.jp\",\n\"hasama.oita.jp\",\n\"hiji.oita.jp\",\n\"himeshima.oita.jp\",\n\"hita.oita.jp\",\n\"kamitsue.oita.jp\",\n\"kokonoe.oita.jp\",\n\"kuju.oita.jp\",\n\"kunisaki.oita.jp\",\n\"kusu.oita.jp\",\n\"oita.oita.jp\",\n\"saiki.oita.jp\",\n\"taketa.oita.jp\",\n\"tsukumi.oita.jp\",\n\"usa.oita.jp\",\n\"usuki.oita.jp\",\n\"yufu.oita.jp\",\n\"akaiwa.okayama.jp\",\n\"asakuchi.okayama.jp\",\n\"bizen.okayama.jp\",\n\"hayashima.okayama.jp\",\n\"ibara.okayama.jp\",\n\"kagamino.okayama.jp\",\n\"kasaoka.okayama.jp\",\n\"kibichuo.okayama.jp\",\n\"kumenan.okayama.jp\",\n\"kurashiki.okayama.jp\",\n\"maniwa.okayama.jp\",\n\"misaki.okayama.jp\",\n\"nagi.okayama.jp\",\n\"niimi.okayama.jp\",\n\"nishiawakura.okayama.jp\",\n\"okayama.okayama.jp\",\n\"satosho.okayama.jp\",\n\"setouchi.okayama.jp\",\n\"shinjo.okayama.jp\",\n\"shoo.okayama.jp\",\n\"soja.okayama.jp\",\n\"takahashi.okayama.jp\",\n\"tamano.okayama.jp\",\n\"tsuyama.okayama.jp\",\n\"wake.okayama.jp\",\n\"yakage.okayama.jp\",\n\"aguni.okinawa.jp\",\n\"ginowan.okinawa.jp\",\n\"ginoza.okinawa.jp\",\n\"gushikami.okinawa.jp\",\n\"haebaru.okinawa.jp\",\n\"higashi.okinawa.jp\",\n\"hirara.okinawa.jp\",\n\"iheya.okinawa.jp\",\n\"ishigaki.okinawa.jp\",\n\"ishikawa.okinawa.jp\",\n\"itoman.okinawa.jp\",\n\"izena.okinawa.jp\",\n\"kadena.okinawa.jp\",\n\"kin.okinawa.jp\",\n\"kitadaito.okinawa.jp\",\n\"kitanakagusuku.okinawa.jp\",\n\"kumejima.okinawa.jp\",\n\"kunigami.okinawa.jp\",\n\"minamidaito.okinawa.jp\",\n\"motobu.okinawa.jp\",\n\"nago.okinawa.jp\",\n\"naha.okinawa.jp\",\n\"nakagusuku.okinawa.jp\",\n\"nakijin.okinawa.jp\",\n\"nanjo.okinawa.jp\",\n\"nishihara.okinawa.jp\",\n\"ogimi.okinawa.jp\",\n\"okinawa.okinawa.jp\",\n\"onna.okinawa.jp\",\n\"shimoji.okinawa.jp\",\n\"taketomi.okinawa.jp\",\n\"tarama.okinawa.jp\",\n\"tokashiki.okinawa.jp\",\n\"tomigusuku.okinawa.jp\",\n\"tonaki.okinawa.jp\",\n\"urasoe.okinawa.jp\",\n\"uruma.okinawa.jp\",\n\"yaese.okinawa.jp\",\n\"yomitan.okinawa.jp\",\n\"yonabaru.okinawa.jp\",\n\"yonaguni.okinawa.jp\",\n\"zamami.okinawa.jp\",\n\"abeno.osaka.jp\",\n\"chihayaakasaka.osaka.jp\",\n\"chuo.osaka.jp\",\n\"daito.osaka.jp\",\n\"fujiidera.osaka.jp\",\n\"habikino.osaka.jp\",\n\"hannan.osaka.jp\",\n\"higashiosaka.osaka.jp\",\n\"higashisumiyoshi.osaka.jp\",\n\"higashiyodogawa.osaka.jp\",\n\"hirakata.osaka.jp\",\n\"ibaraki.osaka.jp\",\n\"ikeda.osaka.jp\",\n\"izumi.osaka.jp\",\n\"izumiotsu.osaka.jp\",\n\"izumisano.osaka.jp\",\n\"kadoma.osaka.jp\",\n\"kaizuka.osaka.jp\",\n\"kanan.osaka.jp\",\n\"kashiwara.osaka.jp\",\n\"katano.osaka.jp\",\n\"kawachinagano.osaka.jp\",\n\"kishiwada.osaka.jp\",\n\"kita.osaka.jp\",\n\"kumatori.osaka.jp\",\n\"matsubara.osaka.jp\",\n\"minato.osaka.jp\",\n\"minoh.osaka.jp\",\n\"misaki.osaka.jp\",\n\"moriguchi.osaka.jp\",\n\"neyagawa.osaka.jp\",\n\"nishi.osaka.jp\",\n\"nose.osaka.jp\",\n\"osakasayama.osaka.jp\",\n\"sakai.osaka.jp\",\n\"sayama.osaka.jp\",\n\"sennan.osaka.jp\",\n\"settsu.osaka.jp\",\n\"shijonawate.osaka.jp\",\n\"shimamoto.osaka.jp\",\n\"suita.osaka.jp\",\n\"tadaoka.osaka.jp\",\n\"taishi.osaka.jp\",\n\"tajiri.osaka.jp\",\n\"takaishi.osaka.jp\",\n\"takatsuki.osaka.jp\",\n\"tondabayashi.osaka.jp\",\n\"toyonaka.osaka.jp\",\n\"toyono.osaka.jp\",\n\"yao.osaka.jp\",\n\"ariake.saga.jp\",\n\"arita.saga.jp\",\n\"fukudomi.saga.jp\",\n\"genkai.saga.jp\",\n\"hamatama.saga.jp\",\n\"hizen.saga.jp\",\n\"imari.saga.jp\",\n\"kamimine.saga.jp\",\n\"kanzaki.saga.jp\",\n\"karatsu.saga.jp\",\n\"kashima.saga.jp\",\n\"kitagata.saga.jp\",\n\"kitahata.saga.jp\",\n\"kiyama.saga.jp\",\n\"kouhoku.saga.jp\",\n\"kyuragi.saga.jp\",\n\"nishiarita.saga.jp\",\n\"ogi.saga.jp\",\n\"omachi.saga.jp\",\n\"ouchi.saga.jp\",\n\"saga.saga.jp\",\n\"shiroishi.saga.jp\",\n\"taku.saga.jp\",\n\"tara.saga.jp\",\n\"tosu.saga.jp\",\n\"yoshinogari.saga.jp\",\n\"arakawa.saitama.jp\",\n\"asaka.saitama.jp\",\n\"chichibu.saitama.jp\",\n\"fujimi.saitama.jp\",\n\"fujimino.saitama.jp\",\n\"fukaya.saitama.jp\",\n\"hanno.saitama.jp\",\n\"hanyu.saitama.jp\",\n\"hasuda.saitama.jp\",\n\"hatogaya.saitama.jp\",\n\"hatoyama.saitama.jp\",\n\"hidaka.saitama.jp\",\n\"higashichichibu.saitama.jp\",\n\"higashimatsuyama.saitama.jp\",\n\"honjo.saitama.jp\",\n\"ina.saitama.jp\",\n\"iruma.saitama.jp\",\n\"iwatsuki.saitama.jp\",\n\"kamiizumi.saitama.jp\",\n\"kamikawa.saitama.jp\",\n\"kamisato.saitama.jp\",\n\"kasukabe.saitama.jp\",\n\"kawagoe.saitama.jp\",\n\"kawaguchi.saitama.jp\",\n\"kawajima.saitama.jp\",\n\"kazo.saitama.jp\",\n\"kitamoto.saitama.jp\",\n\"koshigaya.saitama.jp\",\n\"kounosu.saitama.jp\",\n\"kuki.saitama.jp\",\n\"kumagaya.saitama.jp\",\n\"matsubushi.saitama.jp\",\n\"minano.saitama.jp\",\n\"misato.saitama.jp\",\n\"miyashiro.saitama.jp\",\n\"miyoshi.saitama.jp\",\n\"moroyama.saitama.jp\",\n\"nagatoro.saitama.jp\",\n\"namegawa.saitama.jp\",\n\"niiza.saitama.jp\",\n\"ogano.saitama.jp\",\n\"ogawa.saitama.jp\",\n\"ogose.saitama.jp\",\n\"okegawa.saitama.jp\",\n\"omiya.saitama.jp\",\n\"otaki.saitama.jp\",\n\"ranzan.saitama.jp\",\n\"ryokami.saitama.jp\",\n\"saitama.saitama.jp\",\n\"sakado.saitama.jp\",\n\"satte.saitama.jp\",\n\"sayama.saitama.jp\",\n\"shiki.saitama.jp\",\n\"shiraoka.saitama.jp\",\n\"soka.saitama.jp\",\n\"sugito.saitama.jp\",\n\"toda.saitama.jp\",\n\"tokigawa.saitama.jp\",\n\"tokorozawa.saitama.jp\",\n\"tsurugashima.saitama.jp\",\n\"urawa.saitama.jp\",\n\"warabi.saitama.jp\",\n\"yashio.saitama.jp\",\n\"yokoze.saitama.jp\",\n\"yono.saitama.jp\",\n\"yorii.saitama.jp\",\n\"yoshida.saitama.jp\",\n\"yoshikawa.saitama.jp\",\n\"yoshimi.saitama.jp\",\n\"aisho.shiga.jp\",\n\"gamo.shiga.jp\",\n\"higashiomi.shiga.jp\",\n\"hikone.shiga.jp\",\n\"koka.shiga.jp\",\n\"konan.shiga.jp\",\n\"kosei.shiga.jp\",\n\"koto.shiga.jp\",\n\"kusatsu.shiga.jp\",\n\"maibara.shiga.jp\",\n\"moriyama.shiga.jp\",\n\"nagahama.shiga.jp\",\n\"nishiazai.shiga.jp\",\n\"notogawa.shiga.jp\",\n\"omihachiman.shiga.jp\",\n\"otsu.shiga.jp\",\n\"ritto.shiga.jp\",\n\"ryuoh.shiga.jp\",\n\"takashima.shiga.jp\",\n\"takatsuki.shiga.jp\",\n\"torahime.shiga.jp\",\n\"toyosato.shiga.jp\",\n\"yasu.shiga.jp\",\n\"akagi.shimane.jp\",\n\"ama.shimane.jp\",\n\"gotsu.shimane.jp\",\n\"hamada.shimane.jp\",\n\"higashiizumo.shimane.jp\",\n\"hikawa.shimane.jp\",\n\"hikimi.shimane.jp\",\n\"izumo.shimane.jp\",\n\"kakinoki.shimane.jp\",\n\"masuda.shimane.jp\",\n\"matsue.shimane.jp\",\n\"misato.shimane.jp\",\n\"nishinoshima.shimane.jp\",\n\"ohda.shimane.jp\",\n\"okinoshima.shimane.jp\",\n\"okuizumo.shimane.jp\",\n\"shimane.shimane.jp\",\n\"tamayu.shimane.jp\",\n\"tsuwano.shimane.jp\",\n\"unnan.shimane.jp\",\n\"yakumo.shimane.jp\",\n\"yasugi.shimane.jp\",\n\"yatsuka.shimane.jp\",\n\"arai.shizuoka.jp\",\n\"atami.shizuoka.jp\",\n\"fuji.shizuoka.jp\",\n\"fujieda.shizuoka.jp\",\n\"fujikawa.shizuoka.jp\",\n\"fujinomiya.shizuoka.jp\",\n\"fukuroi.shizuoka.jp\",\n\"gotemba.shizuoka.jp\",\n\"haibara.shizuoka.jp\",\n\"hamamatsu.shizuoka.jp\",\n\"higashiizu.shizuoka.jp\",\n\"ito.shizuoka.jp\",\n\"iwata.shizuoka.jp\",\n\"izu.shizuoka.jp\",\n\"izunokuni.shizuoka.jp\",\n\"kakegawa.shizuoka.jp\",\n\"kannami.shizuoka.jp\",\n\"kawanehon.shizuoka.jp\",\n\"kawazu.shizuoka.jp\",\n\"kikugawa.shizuoka.jp\",\n\"kosai.shizuoka.jp\",\n\"makinohara.shizuoka.jp\",\n\"matsuzaki.shizuoka.jp\",\n\"minamiizu.shizuoka.jp\",\n\"mishima.shizuoka.jp\",\n\"morimachi.shizuoka.jp\",\n\"nishiizu.shizuoka.jp\",\n\"numazu.shizuoka.jp\",\n\"omaezaki.shizuoka.jp\",\n\"shimada.shizuoka.jp\",\n\"shimizu.shizuoka.jp\",\n\"shimoda.shizuoka.jp\",\n\"shizuoka.shizuoka.jp\",\n\"susono.shizuoka.jp\",\n\"yaizu.shizuoka.jp\",\n\"yoshida.shizuoka.jp\",\n\"ashikaga.tochigi.jp\",\n\"bato.tochigi.jp\",\n\"haga.tochigi.jp\",\n\"ichikai.tochigi.jp\",\n\"iwafune.tochigi.jp\",\n\"kaminokawa.tochigi.jp\",\n\"kanuma.tochigi.jp\",\n\"karasuyama.tochigi.jp\",\n\"kuroiso.tochigi.jp\",\n\"mashiko.tochigi.jp\",\n\"mibu.tochigi.jp\",\n\"moka.tochigi.jp\",\n\"motegi.tochigi.jp\",\n\"nasu.tochigi.jp\",\n\"nasushiobara.tochigi.jp\",\n\"nikko.tochigi.jp\",\n\"nishikata.tochigi.jp\",\n\"nogi.tochigi.jp\",\n\"ohira.tochigi.jp\",\n\"ohtawara.tochigi.jp\",\n\"oyama.tochigi.jp\",\n\"sakura.tochigi.jp\",\n\"sano.tochigi.jp\",\n\"shimotsuke.tochigi.jp\",\n\"shioya.tochigi.jp\",\n\"takanezawa.tochigi.jp\",\n\"tochigi.tochigi.jp\",\n\"tsuga.tochigi.jp\",\n\"ujiie.tochigi.jp\",\n\"utsunomiya.tochigi.jp\",\n\"yaita.tochigi.jp\",\n\"aizumi.tokushima.jp\",\n\"anan.tokushima.jp\",\n\"ichiba.tokushima.jp\",\n\"itano.tokushima.jp\",\n\"kainan.tokushima.jp\",\n\"komatsushima.tokushima.jp\",\n\"matsushige.tokushima.jp\",\n\"mima.tokushima.jp\",\n\"minami.tokushima.jp\",\n\"miyoshi.tokushima.jp\",\n\"mugi.tokushima.jp\",\n\"nakagawa.tokushima.jp\",\n\"naruto.tokushima.jp\",\n\"sanagochi.tokushima.jp\",\n\"shishikui.tokushima.jp\",\n\"tokushima.tokushima.jp\",\n\"wajiki.tokushima.jp\",\n\"adachi.tokyo.jp\",\n\"akiruno.tokyo.jp\",\n\"akishima.tokyo.jp\",\n\"aogashima.tokyo.jp\",\n\"arakawa.tokyo.jp\",\n\"bunkyo.tokyo.jp\",\n\"chiyoda.tokyo.jp\",\n\"chofu.tokyo.jp\",\n\"chuo.tokyo.jp\",\n\"edogawa.tokyo.jp\",\n\"fuchu.tokyo.jp\",\n\"fussa.tokyo.jp\",\n\"hachijo.tokyo.jp\",\n\"hachioji.tokyo.jp\",\n\"hamura.tokyo.jp\",\n\"higashikurume.tokyo.jp\",\n\"higashimurayama.tokyo.jp\",\n\"higashiyamato.tokyo.jp\",\n\"hino.tokyo.jp\",\n\"hinode.tokyo.jp\",\n\"hinohara.tokyo.jp\",\n\"inagi.tokyo.jp\",\n\"itabashi.tokyo.jp\",\n\"katsushika.tokyo.jp\",\n\"kita.tokyo.jp\",\n\"kiyose.tokyo.jp\",\n\"kodaira.tokyo.jp\",\n\"koganei.tokyo.jp\",\n\"kokubunji.tokyo.jp\",\n\"komae.tokyo.jp\",\n\"koto.tokyo.jp\",\n\"kouzushima.tokyo.jp\",\n\"kunitachi.tokyo.jp\",\n\"machida.tokyo.jp\",\n\"meguro.tokyo.jp\",\n\"minato.tokyo.jp\",\n\"mitaka.tokyo.jp\",\n\"mizuho.tokyo.jp\",\n\"musashimurayama.tokyo.jp\",\n\"musashino.tokyo.jp\",\n\"nakano.tokyo.jp\",\n\"nerima.tokyo.jp\",\n\"ogasawara.tokyo.jp\",\n\"okutama.tokyo.jp\",\n\"ome.tokyo.jp\",\n\"oshima.tokyo.jp\",\n\"ota.tokyo.jp\",\n\"setagaya.tokyo.jp\",\n\"shibuya.tokyo.jp\",\n\"shinagawa.tokyo.jp\",\n\"shinjuku.tokyo.jp\",\n\"suginami.tokyo.jp\",\n\"sumida.tokyo.jp\",\n\"tachikawa.tokyo.jp\",\n\"taito.tokyo.jp\",\n\"tama.tokyo.jp\",\n\"toshima.tokyo.jp\",\n\"chizu.tottori.jp\",\n\"hino.tottori.jp\",\n\"kawahara.tottori.jp\",\n\"koge.tottori.jp\",\n\"kotoura.tottori.jp\",\n\"misasa.tottori.jp\",\n\"nanbu.tottori.jp\",\n\"nichinan.tottori.jp\",\n\"sakaiminato.tottori.jp\",\n\"tottori.tottori.jp\",\n\"wakasa.tottori.jp\",\n\"yazu.tottori.jp\",\n\"yonago.tottori.jp\",\n\"asahi.toyama.jp\",\n\"fuchu.toyama.jp\",\n\"fukumitsu.toyama.jp\",\n\"funahashi.toyama.jp\",\n\"himi.toyama.jp\",\n\"imizu.toyama.jp\",\n\"inami.toyama.jp\",\n\"johana.toyama.jp\",\n\"kamiichi.toyama.jp\",\n\"kurobe.toyama.jp\",\n\"nakaniikawa.toyama.jp\",\n\"namerikawa.toyama.jp\",\n\"nanto.toyama.jp\",\n\"nyuzen.toyama.jp\",\n\"oyabe.toyama.jp\",\n\"taira.toyama.jp\",\n\"takaoka.toyama.jp\",\n\"tateyama.toyama.jp\",\n\"toga.toyama.jp\",\n\"tonami.toyama.jp\",\n\"toyama.toyama.jp\",\n\"unazuki.toyama.jp\",\n\"uozu.toyama.jp\",\n\"yamada.toyama.jp\",\n\"arida.wakayama.jp\",\n\"aridagawa.wakayama.jp\",\n\"gobo.wakayama.jp\",\n\"hashimoto.wakayama.jp\",\n\"hidaka.wakayama.jp\",\n\"hirogawa.wakayama.jp\",\n\"inami.wakayama.jp\",\n\"iwade.wakayama.jp\",\n\"kainan.wakayama.jp\",\n\"kamitonda.wakayama.jp\",\n\"katsuragi.wakayama.jp\",\n\"kimino.wakayama.jp\",\n\"kinokawa.wakayama.jp\",\n\"kitayama.wakayama.jp\",\n\"koya.wakayama.jp\",\n\"koza.wakayama.jp\",\n\"kozagawa.wakayama.jp\",\n\"kudoyama.wakayama.jp\",\n\"kushimoto.wakayama.jp\",\n\"mihama.wakayama.jp\",\n\"misato.wakayama.jp\",\n\"nachikatsuura.wakayama.jp\",\n\"shingu.wakayama.jp\",\n\"shirahama.wakayama.jp\",\n\"taiji.wakayama.jp\",\n\"tanabe.wakayama.jp\",\n\"wakayama.wakayama.jp\",\n\"yuasa.wakayama.jp\",\n\"yura.wakayama.jp\",\n\"asahi.yamagata.jp\",\n\"funagata.yamagata.jp\",\n\"higashine.yamagata.jp\",\n\"iide.yamagata.jp\",\n\"kahoku.yamagata.jp\",\n\"kaminoyama.yamagata.jp\",\n\"kaneyama.yamagata.jp\",\n\"kawanishi.yamagata.jp\",\n\"mamurogawa.yamagata.jp\",\n\"mikawa.yamagata.jp\",\n\"murayama.yamagata.jp\",\n\"nagai.yamagata.jp\",\n\"nakayama.yamagata.jp\",\n\"nanyo.yamagata.jp\",\n\"nishikawa.yamagata.jp\",\n\"obanazawa.yamagata.jp\",\n\"oe.yamagata.jp\",\n\"oguni.yamagata.jp\",\n\"ohkura.yamagata.jp\",\n\"oishida.yamagata.jp\",\n\"sagae.yamagata.jp\",\n\"sakata.yamagata.jp\",\n\"sakegawa.yamagata.jp\",\n\"shinjo.yamagata.jp\",\n\"shirataka.yamagata.jp\",\n\"shonai.yamagata.jp\",\n\"takahata.yamagata.jp\",\n\"tendo.yamagata.jp\",\n\"tozawa.yamagata.jp\",\n\"tsuruoka.yamagata.jp\",\n\"yamagata.yamagata.jp\",\n\"yamanobe.yamagata.jp\",\n\"yonezawa.yamagata.jp\",\n\"yuza.yamagata.jp\",\n\"abu.yamaguchi.jp\",\n\"hagi.yamaguchi.jp\",\n\"hikari.yamaguchi.jp\",\n\"hofu.yamaguchi.jp\",\n\"iwakuni.yamaguchi.jp\",\n\"kudamatsu.yamaguchi.jp\",\n\"mitou.yamaguchi.jp\",\n\"nagato.yamaguchi.jp\",\n\"oshima.yamaguchi.jp\",\n\"shimonoseki.yamaguchi.jp\",\n\"shunan.yamaguchi.jp\",\n\"tabuse.yamaguchi.jp\",\n\"tokuyama.yamaguchi.jp\",\n\"toyota.yamaguchi.jp\",\n\"ube.yamaguchi.jp\",\n\"yuu.yamaguchi.jp\",\n\"chuo.yamanashi.jp\",\n\"doshi.yamanashi.jp\",\n\"fuefuki.yamanashi.jp\",\n\"fujikawa.yamanashi.jp\",\n\"fujikawaguchiko.yamanashi.jp\",\n\"fujiyoshida.yamanashi.jp\",\n\"hayakawa.yamanashi.jp\",\n\"hokuto.yamanashi.jp\",\n\"ichikawamisato.yamanashi.jp\",\n\"kai.yamanashi.jp\",\n\"kofu.yamanashi.jp\",\n\"koshu.yamanashi.jp\",\n\"kosuge.yamanashi.jp\",\n\"minami-alps.yamanashi.jp\",\n\"minobu.yamanashi.jp\",\n\"nakamichi.yamanashi.jp\",\n\"nanbu.yamanashi.jp\",\n\"narusawa.yamanashi.jp\",\n\"nirasaki.yamanashi.jp\",\n\"nishikatsura.yamanashi.jp\",\n\"oshino.yamanashi.jp\",\n\"otsuki.yamanashi.jp\",\n\"showa.yamanashi.jp\",\n\"tabayama.yamanashi.jp\",\n\"tsuru.yamanashi.jp\",\n\"uenohara.yamanashi.jp\",\n\"yamanakako.yamanashi.jp\",\n\"yamanashi.yamanashi.jp\",\n\"ke\",\n\"ac.ke\",\n\"co.ke\",\n\"go.ke\",\n\"info.ke\",\n\"me.ke\",\n\"mobi.ke\",\n\"ne.ke\",\n\"or.ke\",\n\"sc.ke\",\n\"kg\",\n\"org.kg\",\n\"net.kg\",\n\"com.kg\",\n\"edu.kg\",\n\"gov.kg\",\n\"mil.kg\",\n\"*.kh\",\n\"ki\",\n\"edu.ki\",\n\"biz.ki\",\n\"net.ki\",\n\"org.ki\",\n\"gov.ki\",\n\"info.ki\",\n\"com.ki\",\n\"km\",\n\"org.km\",\n\"nom.km\",\n\"gov.km\",\n\"prd.km\",\n\"tm.km\",\n\"edu.km\",\n\"mil.km\",\n\"ass.km\",\n\"com.km\",\n\"coop.km\",\n\"asso.km\",\n\"presse.km\",\n\"medecin.km\",\n\"notaires.km\",\n\"pharmaciens.km\",\n\"veterinaire.km\",\n\"gouv.km\",\n\"kn\",\n\"net.kn\",\n\"org.kn\",\n\"edu.kn\",\n\"gov.kn\",\n\"kp\",\n\"com.kp\",\n\"edu.kp\",\n\"gov.kp\",\n\"org.kp\",\n\"rep.kp\",\n\"tra.kp\",\n\"kr\",\n\"ac.kr\",\n\"co.kr\",\n\"es.kr\",\n\"go.kr\",\n\"hs.kr\",\n\"kg.kr\",\n\"mil.kr\",\n\"ms.kr\",\n\"ne.kr\",\n\"or.kr\",\n\"pe.kr\",\n\"re.kr\",\n\"sc.kr\",\n\"busan.kr\",\n\"chungbuk.kr\",\n\"chungnam.kr\",\n\"daegu.kr\",\n\"daejeon.kr\",\n\"gangwon.kr\",\n\"gwangju.kr\",\n\"gyeongbuk.kr\",\n\"gyeonggi.kr\",\n\"gyeongnam.kr\",\n\"incheon.kr\",\n\"jeju.kr\",\n\"jeonbuk.kr\",\n\"jeonnam.kr\",\n\"seoul.kr\",\n\"ulsan.kr\",\n\"kw\",\n\"com.kw\",\n\"edu.kw\",\n\"emb.kw\",\n\"gov.kw\",\n\"ind.kw\",\n\"net.kw\",\n\"org.kw\",\n\"ky\",\n\"com.ky\",\n\"edu.ky\",\n\"net.ky\",\n\"org.ky\",\n\"kz\",\n\"org.kz\",\n\"edu.kz\",\n\"net.kz\",\n\"gov.kz\",\n\"mil.kz\",\n\"com.kz\",\n\"la\",\n\"int.la\",\n\"net.la\",\n\"info.la\",\n\"edu.la\",\n\"gov.la\",\n\"per.la\",\n\"com.la\",\n\"org.la\",\n\"lb\",\n\"com.lb\",\n\"edu.lb\",\n\"gov.lb\",\n\"net.lb\",\n\"org.lb\",\n\"lc\",\n\"com.lc\",\n\"net.lc\",\n\"co.lc\",\n\"org.lc\",\n\"edu.lc\",\n\"gov.lc\",\n\"li\",\n\"lk\",\n\"gov.lk\",\n\"sch.lk\",\n\"net.lk\",\n\"int.lk\",\n\"com.lk\",\n\"org.lk\",\n\"edu.lk\",\n\"ngo.lk\",\n\"soc.lk\",\n\"web.lk\",\n\"ltd.lk\",\n\"assn.lk\",\n\"grp.lk\",\n\"hotel.lk\",\n\"ac.lk\",\n\"lr\",\n\"com.lr\",\n\"edu.lr\",\n\"gov.lr\",\n\"org.lr\",\n\"net.lr\",\n\"ls\",\n\"ac.ls\",\n\"biz.ls\",\n\"co.ls\",\n\"edu.ls\",\n\"gov.ls\",\n\"info.ls\",\n\"net.ls\",\n\"org.ls\",\n\"sc.ls\",\n\"lt\",\n\"gov.lt\",\n\"lu\",\n\"lv\",\n\"com.lv\",\n\"edu.lv\",\n\"gov.lv\",\n\"org.lv\",\n\"mil.lv\",\n\"id.lv\",\n\"net.lv\",\n\"asn.lv\",\n\"conf.lv\",\n\"ly\",\n\"com.ly\",\n\"net.ly\",\n\"gov.ly\",\n\"plc.ly\",\n\"edu.ly\",\n\"sch.ly\",\n\"med.ly\",\n\"org.ly\",\n\"id.ly\",\n\"ma\",\n\"co.ma\",\n\"net.ma\",\n\"gov.ma\",\n\"org.ma\",\n\"ac.ma\",\n\"press.ma\",\n\"mc\",\n\"tm.mc\",\n\"asso.mc\",\n\"md\",\n\"me\",\n\"co.me\",\n\"net.me\",\n\"org.me\",\n\"edu.me\",\n\"ac.me\",\n\"gov.me\",\n\"its.me\",\n\"priv.me\",\n\"mg\",\n\"org.mg\",\n\"nom.mg\",\n\"gov.mg\",\n\"prd.mg\",\n\"tm.mg\",\n\"edu.mg\",\n\"mil.mg\",\n\"com.mg\",\n\"co.mg\",\n\"mh\",\n\"mil\",\n\"mk\",\n\"com.mk\",\n\"org.mk\",\n\"net.mk\",\n\"edu.mk\",\n\"gov.mk\",\n\"inf.mk\",\n\"name.mk\",\n\"ml\",\n\"com.ml\",\n\"edu.ml\",\n\"gouv.ml\",\n\"gov.ml\",\n\"net.ml\",\n\"org.ml\",\n\"presse.ml\",\n\"*.mm\",\n\"mn\",\n\"gov.mn\",\n\"edu.mn\",\n\"org.mn\",\n\"mo\",\n\"com.mo\",\n\"net.mo\",\n\"org.mo\",\n\"edu.mo\",\n\"gov.mo\",\n\"mobi\",\n\"mp\",\n\"mq\",\n\"mr\",\n\"gov.mr\",\n\"ms\",\n\"com.ms\",\n\"edu.ms\",\n\"gov.ms\",\n\"net.ms\",\n\"org.ms\",\n\"mt\",\n\"com.mt\",\n\"edu.mt\",\n\"net.mt\",\n\"org.mt\",\n\"mu\",\n\"com.mu\",\n\"net.mu\",\n\"org.mu\",\n\"gov.mu\",\n\"ac.mu\",\n\"co.mu\",\n\"or.mu\",\n\"museum\",\n\"academy.museum\",\n\"agriculture.museum\",\n\"air.museum\",\n\"airguard.museum\",\n\"alabama.museum\",\n\"alaska.museum\",\n\"amber.museum\",\n\"ambulance.museum\",\n\"american.museum\",\n\"americana.museum\",\n\"americanantiques.museum\",\n\"americanart.museum\",\n\"amsterdam.museum\",\n\"and.museum\",\n\"annefrank.museum\",\n\"anthro.museum\",\n\"anthropology.museum\",\n\"antiques.museum\",\n\"aquarium.museum\",\n\"arboretum.museum\",\n\"archaeological.museum\",\n\"archaeology.museum\",\n\"architecture.museum\",\n\"art.museum\",\n\"artanddesign.museum\",\n\"artcenter.museum\",\n\"artdeco.museum\",\n\"arteducation.museum\",\n\"artgallery.museum\",\n\"arts.museum\",\n\"artsandcrafts.museum\",\n\"asmatart.museum\",\n\"assassination.museum\",\n\"assisi.museum\",\n\"association.museum\",\n\"astronomy.museum\",\n\"atlanta.museum\",\n\"austin.museum\",\n\"australia.museum\",\n\"automotive.museum\",\n\"aviation.museum\",\n\"axis.museum\",\n\"badajoz.museum\",\n\"baghdad.museum\",\n\"bahn.museum\",\n\"bale.museum\",\n\"baltimore.museum\",\n\"barcelona.museum\",\n\"baseball.museum\",\n\"basel.museum\",\n\"baths.museum\",\n\"bauern.museum\",\n\"beauxarts.museum\",\n\"beeldengeluid.museum\",\n\"bellevue.museum\",\n\"bergbau.museum\",\n\"berkeley.museum\",\n\"berlin.museum\",\n\"bern.museum\",\n\"bible.museum\",\n\"bilbao.museum\",\n\"bill.museum\",\n\"birdart.museum\",\n\"birthplace.museum\",\n\"bonn.museum\",\n\"boston.museum\",\n\"botanical.museum\",\n\"botanicalgarden.museum\",\n\"botanicgarden.museum\",\n\"botany.museum\",\n\"brandywinevalley.museum\",\n\"brasil.museum\",\n\"bristol.museum\",\n\"british.museum\",\n\"britishcolumbia.museum\",\n\"broadcast.museum\",\n\"brunel.museum\",\n\"brussel.museum\",\n\"brussels.museum\",\n\"bruxelles.museum\",\n\"building.museum\",\n\"burghof.museum\",\n\"bus.museum\",\n\"bushey.museum\",\n\"cadaques.museum\",\n\"california.museum\",\n\"cambridge.museum\",\n\"can.museum\",\n\"canada.museum\",\n\"capebreton.museum\",\n\"carrier.museum\",\n\"cartoonart.museum\",\n\"casadelamoneda.museum\",\n\"castle.museum\",\n\"castres.museum\",\n\"celtic.museum\",\n\"center.museum\",\n\"chattanooga.museum\",\n\"cheltenham.museum\",\n\"chesapeakebay.museum\",\n\"chicago.museum\",\n\"children.museum\",\n\"childrens.museum\",\n\"childrensgarden.museum\",\n\"chiropractic.museum\",\n\"chocolate.museum\",\n\"christiansburg.museum\",\n\"cincinnati.museum\",\n\"cinema.museum\",\n\"circus.museum\",\n\"civilisation.museum\",\n\"civilization.museum\",\n\"civilwar.museum\",\n\"clinton.museum\",\n\"clock.museum\",\n\"coal.museum\",\n\"coastaldefence.museum\",\n\"cody.museum\",\n\"coldwar.museum\",\n\"collection.museum\",\n\"colonialwilliamsburg.museum\",\n\"coloradoplateau.museum\",\n\"columbia.museum\",\n\"columbus.museum\",\n\"communication.museum\",\n\"communications.museum\",\n\"community.museum\",\n\"computer.museum\",\n\"computerhistory.museum\",\n\"comunicações.museum\",\n\"contemporary.museum\",\n\"contemporaryart.museum\",\n\"convent.museum\",\n\"copenhagen.museum\",\n\"corporation.museum\",\n\"correios-e-telecomunicações.museum\",\n\"corvette.museum\",\n\"costume.museum\",\n\"countryestate.museum\",\n\"county.museum\",\n\"crafts.museum\",\n\"cranbrook.museum\",\n\"creation.museum\",\n\"cultural.museum\",\n\"culturalcenter.museum\",\n\"culture.museum\",\n\"cyber.museum\",\n\"cymru.museum\",\n\"dali.museum\",\n\"dallas.museum\",\n\"database.museum\",\n\"ddr.museum\",\n\"decorativearts.museum\",\n\"delaware.museum\",\n\"delmenhorst.museum\",\n\"denmark.museum\",\n\"depot.museum\",\n\"design.museum\",\n\"detroit.museum\",\n\"dinosaur.museum\",\n\"discovery.museum\",\n\"dolls.museum\",\n\"donostia.museum\",\n\"durham.museum\",\n\"eastafrica.museum\",\n\"eastcoast.museum\",\n\"education.museum\",\n\"educational.museum\",\n\"egyptian.museum\",\n\"eisenbahn.museum\",\n\"elburg.museum\",\n\"elvendrell.museum\",\n\"embroidery.museum\",\n\"encyclopedic.museum\",\n\"england.museum\",\n\"entomology.museum\",\n\"environment.museum\",\n\"environmentalconservation.museum\",\n\"epilepsy.museum\",\n\"essex.museum\",\n\"estate.museum\",\n\"ethnology.museum\",\n\"exeter.museum\",\n\"exhibition.museum\",\n\"family.museum\",\n\"farm.museum\",\n\"farmequipment.museum\",\n\"farmers.museum\",\n\"farmstead.museum\",\n\"field.museum\",\n\"figueres.museum\",\n\"filatelia.museum\",\n\"film.museum\",\n\"fineart.museum\",\n\"finearts.museum\",\n\"finland.museum\",\n\"flanders.museum\",\n\"florida.museum\",\n\"force.museum\",\n\"fortmissoula.museum\",\n\"fortworth.museum\",\n\"foundation.museum\",\n\"francaise.museum\",\n\"frankfurt.museum\",\n\"franziskaner.museum\",\n\"freemasonry.museum\",\n\"freiburg.museum\",\n\"fribourg.museum\",\n\"frog.museum\",\n\"fundacio.museum\",\n\"furniture.museum\",\n\"gallery.museum\",\n\"garden.museum\",\n\"gateway.museum\",\n\"geelvinck.museum\",\n\"gemological.museum\",\n\"geology.museum\",\n\"georgia.museum\",\n\"giessen.museum\",\n\"glas.museum\",\n\"glass.museum\",\n\"gorge.museum\",\n\"grandrapids.museum\",\n\"graz.museum\",\n\"guernsey.museum\",\n\"halloffame.museum\",\n\"hamburg.museum\",\n\"handson.museum\",\n\"harvestcelebration.museum\",\n\"hawaii.museum\",\n\"health.museum\",\n\"heimatunduhren.museum\",\n\"hellas.museum\",\n\"helsinki.museum\",\n\"hembygdsforbund.museum\",\n\"heritage.museum\",\n\"histoire.museum\",\n\"historical.museum\",\n\"historicalsociety.museum\",\n\"historichouses.museum\",\n\"historisch.museum\",\n\"historisches.museum\",\n\"history.museum\",\n\"historyofscience.museum\",\n\"horology.museum\",\n\"house.museum\",\n\"humanities.museum\",\n\"illustration.museum\",\n\"imageandsound.museum\",\n\"indian.museum\",\n\"indiana.museum\",\n\"indianapolis.museum\",\n\"indianmarket.museum\",\n\"intelligence.museum\",\n\"interactive.museum\",\n\"iraq.museum\",\n\"iron.museum\",\n\"isleofman.museum\",\n\"jamison.museum\",\n\"jefferson.museum\",\n\"jerusalem.museum\",\n\"jewelry.museum\",\n\"jewish.museum\",\n\"jewishart.museum\",\n\"jfk.museum\",\n\"journalism.museum\",\n\"judaica.museum\",\n\"judygarland.museum\",\n\"juedisches.museum\",\n\"juif.museum\",\n\"karate.museum\",\n\"karikatur.museum\",\n\"kids.museum\",\n\"koebenhavn.museum\",\n\"koeln.museum\",\n\"kunst.museum\",\n\"kunstsammlung.museum\",\n\"kunstunddesign.museum\",\n\"labor.museum\",\n\"labour.museum\",\n\"lajolla.museum\",\n\"lancashire.museum\",\n\"landes.museum\",\n\"lans.museum\",\n\"läns.museum\",\n\"larsson.museum\",\n\"lewismiller.museum\",\n\"lincoln.museum\",\n\"linz.museum\",\n\"living.museum\",\n\"livinghistory.museum\",\n\"localhistory.museum\",\n\"london.museum\",\n\"losangeles.museum\",\n\"louvre.museum\",\n\"loyalist.museum\",\n\"lucerne.museum\",\n\"luxembourg.museum\",\n\"luzern.museum\",\n\"mad.museum\",\n\"madrid.museum\",\n\"mallorca.museum\",\n\"manchester.museum\",\n\"mansion.museum\",\n\"mansions.museum\",\n\"manx.museum\",\n\"marburg.museum\",\n\"maritime.museum\",\n\"maritimo.museum\",\n\"maryland.museum\",\n\"marylhurst.museum\",\n\"media.museum\",\n\"medical.museum\",\n\"medizinhistorisches.museum\",\n\"meeres.museum\",\n\"memorial.museum\",\n\"mesaverde.museum\",\n\"michigan.museum\",\n\"midatlantic.museum\",\n\"military.museum\",\n\"mill.museum\",\n\"miners.museum\",\n\"mining.museum\",\n\"minnesota.museum\",\n\"missile.museum\",\n\"missoula.museum\",\n\"modern.museum\",\n\"moma.museum\",\n\"money.museum\",\n\"monmouth.museum\",\n\"monticello.museum\",\n\"montreal.museum\",\n\"moscow.museum\",\n\"motorcycle.museum\",\n\"muenchen.museum\",\n\"muenster.museum\",\n\"mulhouse.museum\",\n\"muncie.museum\",\n\"museet.museum\",\n\"museumcenter.museum\",\n\"museumvereniging.museum\",\n\"music.museum\",\n\"national.museum\",\n\"nationalfirearms.museum\",\n\"nationalheritage.museum\",\n\"nativeamerican.museum\",\n\"naturalhistory.museum\",\n\"naturalhistorymuseum.museum\",\n\"naturalsciences.museum\",\n\"nature.museum\",\n\"naturhistorisches.museum\",\n\"natuurwetenschappen.museum\",\n\"naumburg.museum\",\n\"naval.museum\",\n\"nebraska.museum\",\n\"neues.museum\",\n\"newhampshire.museum\",\n\"newjersey.museum\",\n\"newmexico.museum\",\n\"newport.museum\",\n\"newspaper.museum\",\n\"newyork.museum\",\n\"niepce.museum\",\n\"norfolk.museum\",\n\"north.museum\",\n\"nrw.museum\",\n\"nyc.museum\",\n\"nyny.museum\",\n\"oceanographic.museum\",\n\"oceanographique.museum\",\n\"omaha.museum\",\n\"online.museum\",\n\"ontario.museum\",\n\"openair.museum\",\n\"oregon.museum\",\n\"oregontrail.museum\",\n\"otago.museum\",\n\"oxford.museum\",\n\"pacific.museum\",\n\"paderborn.museum\",\n\"palace.museum\",\n\"paleo.museum\",\n\"palmsprings.museum\",\n\"panama.museum\",\n\"paris.museum\",\n\"pasadena.museum\",\n\"pharmacy.museum\",\n\"philadelphia.museum\",\n\"philadelphiaarea.museum\",\n\"philately.museum\",\n\"phoenix.museum\",\n\"photography.museum\",\n\"pilots.museum\",\n\"pittsburgh.museum\",\n\"planetarium.museum\",\n\"plantation.museum\",\n\"plants.museum\",\n\"plaza.museum\",\n\"portal.museum\",\n\"portland.museum\",\n\"portlligat.museum\",\n\"posts-and-telecommunications.museum\",\n\"preservation.museum\",\n\"presidio.museum\",\n\"press.museum\",\n\"project.museum\",\n\"public.museum\",\n\"pubol.museum\",\n\"quebec.museum\",\n\"railroad.museum\",\n\"railway.museum\",\n\"research.museum\",\n\"resistance.museum\",\n\"riodejaneiro.museum\",\n\"rochester.museum\",\n\"rockart.museum\",\n\"roma.museum\",\n\"russia.museum\",\n\"saintlouis.museum\",\n\"salem.museum\",\n\"salvadordali.museum\",\n\"salzburg.museum\",\n\"sandiego.museum\",\n\"sanfrancisco.museum\",\n\"santabarbara.museum\",\n\"santacruz.museum\",\n\"santafe.museum\",\n\"saskatchewan.museum\",\n\"satx.museum\",\n\"savannahga.museum\",\n\"schlesisches.museum\",\n\"schoenbrunn.museum\",\n\"schokoladen.museum\",\n\"school.museum\",\n\"schweiz.museum\",\n\"science.museum\",\n\"scienceandhistory.museum\",\n\"scienceandindustry.museum\",\n\"sciencecenter.museum\",\n\"sciencecenters.museum\",\n\"science-fiction.museum\",\n\"sciencehistory.museum\",\n\"sciences.museum\",\n\"sciencesnaturelles.museum\",\n\"scotland.museum\",\n\"seaport.museum\",\n\"settlement.museum\",\n\"settlers.museum\",\n\"shell.museum\",\n\"sherbrooke.museum\",\n\"sibenik.museum\",\n\"silk.museum\",\n\"ski.museum\",\n\"skole.museum\",\n\"society.museum\",\n\"sologne.museum\",\n\"soundandvision.museum\",\n\"southcarolina.museum\",\n\"southwest.museum\",\n\"space.museum\",\n\"spy.museum\",\n\"square.museum\",\n\"stadt.museum\",\n\"stalbans.museum\",\n\"starnberg.museum\",\n\"state.museum\",\n\"stateofdelaware.museum\",\n\"station.museum\",\n\"steam.museum\",\n\"steiermark.museum\",\n\"stjohn.museum\",\n\"stockholm.museum\",\n\"stpetersburg.museum\",\n\"stuttgart.museum\",\n\"suisse.museum\",\n\"surgeonshall.museum\",\n\"surrey.museum\",\n\"svizzera.museum\",\n\"sweden.museum\",\n\"sydney.museum\",\n\"tank.museum\",\n\"tcm.museum\",\n\"technology.museum\",\n\"telekommunikation.museum\",\n\"television.museum\",\n\"texas.museum\",\n\"textile.museum\",\n\"theater.museum\",\n\"time.museum\",\n\"timekeeping.museum\",\n\"topology.museum\",\n\"torino.museum\",\n\"touch.museum\",\n\"town.museum\",\n\"transport.museum\",\n\"tree.museum\",\n\"trolley.museum\",\n\"trust.museum\",\n\"trustee.museum\",\n\"uhren.museum\",\n\"ulm.museum\",\n\"undersea.museum\",\n\"university.museum\",\n\"usa.museum\",\n\"usantiques.museum\",\n\"usarts.museum\",\n\"uscountryestate.museum\",\n\"usculture.museum\",\n\"usdecorativearts.museum\",\n\"usgarden.museum\",\n\"ushistory.museum\",\n\"ushuaia.museum\",\n\"uslivinghistory.museum\",\n\"utah.museum\",\n\"uvic.museum\",\n\"valley.museum\",\n\"vantaa.museum\",\n\"versailles.museum\",\n\"viking.museum\",\n\"village.museum\",\n\"virginia.museum\",\n\"virtual.museum\",\n\"virtuel.museum\",\n\"vlaanderen.museum\",\n\"volkenkunde.museum\",\n\"wales.museum\",\n\"wallonie.museum\",\n\"war.museum\",\n\"washingtondc.museum\",\n\"watchandclock.museum\",\n\"watch-and-clock.museum\",\n\"western.museum\",\n\"westfalen.museum\",\n\"whaling.museum\",\n\"wildlife.museum\",\n\"williamsburg.museum\",\n\"windmill.museum\",\n\"workshop.museum\",\n\"york.museum\",\n\"yorkshire.museum\",\n\"yosemite.museum\",\n\"youth.museum\",\n\"zoological.museum\",\n\"zoology.museum\",\n\"ירושלים.museum\",\n\"иком.museum\",\n\"mv\",\n\"aero.mv\",\n\"biz.mv\",\n\"com.mv\",\n\"coop.mv\",\n\"edu.mv\",\n\"gov.mv\",\n\"info.mv\",\n\"int.mv\",\n\"mil.mv\",\n\"museum.mv\",\n\"name.mv\",\n\"net.mv\",\n\"org.mv\",\n\"pro.mv\",\n\"mw\",\n\"ac.mw\",\n\"biz.mw\",\n\"co.mw\",\n\"com.mw\",\n\"coop.mw\",\n\"edu.mw\",\n\"gov.mw\",\n\"int.mw\",\n\"museum.mw\",\n\"net.mw\",\n\"org.mw\",\n\"mx\",\n\"com.mx\",\n\"org.mx\",\n\"gob.mx\",\n\"edu.mx\",\n\"net.mx\",\n\"my\",\n\"biz.my\",\n\"com.my\",\n\"edu.my\",\n\"gov.my\",\n\"mil.my\",\n\"name.my\",\n\"net.my\",\n\"org.my\",\n\"mz\",\n\"ac.mz\",\n\"adv.mz\",\n\"co.mz\",\n\"edu.mz\",\n\"gov.mz\",\n\"mil.mz\",\n\"net.mz\",\n\"org.mz\",\n\"na\",\n\"info.na\",\n\"pro.na\",\n\"name.na\",\n\"school.na\",\n\"or.na\",\n\"dr.na\",\n\"us.na\",\n\"mx.na\",\n\"ca.na\",\n\"in.na\",\n\"cc.na\",\n\"tv.na\",\n\"ws.na\",\n\"mobi.na\",\n\"co.na\",\n\"com.na\",\n\"org.na\",\n\"name\",\n\"nc\",\n\"asso.nc\",\n\"nom.nc\",\n\"ne\",\n\"net\",\n\"nf\",\n\"com.nf\",\n\"net.nf\",\n\"per.nf\",\n\"rec.nf\",\n\"web.nf\",\n\"arts.nf\",\n\"firm.nf\",\n\"info.nf\",\n\"other.nf\",\n\"store.nf\",\n\"ng\",\n\"com.ng\",\n\"edu.ng\",\n\"gov.ng\",\n\"i.ng\",\n\"mil.ng\",\n\"mobi.ng\",\n\"name.ng\",\n\"net.ng\",\n\"org.ng\",\n\"sch.ng\",\n\"ni\",\n\"ac.ni\",\n\"biz.ni\",\n\"co.ni\",\n\"com.ni\",\n\"edu.ni\",\n\"gob.ni\",\n\"in.ni\",\n\"info.ni\",\n\"int.ni\",\n\"mil.ni\",\n\"net.ni\",\n\"nom.ni\",\n\"org.ni\",\n\"web.ni\",\n\"nl\",\n\"no\",\n\"fhs.no\",\n\"vgs.no\",\n\"fylkesbibl.no\",\n\"folkebibl.no\",\n\"museum.no\",\n\"idrett.no\",\n\"priv.no\",\n\"mil.no\",\n\"stat.no\",\n\"dep.no\",\n\"kommune.no\",\n\"herad.no\",\n\"aa.no\",\n\"ah.no\",\n\"bu.no\",\n\"fm.no\",\n\"hl.no\",\n\"hm.no\",\n\"jan-mayen.no\",\n\"mr.no\",\n\"nl.no\",\n\"nt.no\",\n\"of.no\",\n\"ol.no\",\n\"oslo.no\",\n\"rl.no\",\n\"sf.no\",\n\"st.no\",\n\"svalbard.no\",\n\"tm.no\",\n\"tr.no\",\n\"va.no\",\n\"vf.no\",\n\"gs.aa.no\",\n\"gs.ah.no\",\n\"gs.bu.no\",\n\"gs.fm.no\",\n\"gs.hl.no\",\n\"gs.hm.no\",\n\"gs.jan-mayen.no\",\n\"gs.mr.no\",\n\"gs.nl.no\",\n\"gs.nt.no\",\n\"gs.of.no\",\n\"gs.ol.no\",\n\"gs.oslo.no\",\n\"gs.rl.no\",\n\"gs.sf.no\",\n\"gs.st.no\",\n\"gs.svalbard.no\",\n\"gs.tm.no\",\n\"gs.tr.no\",\n\"gs.va.no\",\n\"gs.vf.no\",\n\"akrehamn.no\",\n\"åkrehamn.no\",\n\"algard.no\",\n\"ålgård.no\",\n\"arna.no\",\n\"brumunddal.no\",\n\"bryne.no\",\n\"bronnoysund.no\",\n\"brønnøysund.no\",\n\"drobak.no\",\n\"drøbak.no\",\n\"egersund.no\",\n\"fetsund.no\",\n\"floro.no\",\n\"florø.no\",\n\"fredrikstad.no\",\n\"hokksund.no\",\n\"honefoss.no\",\n\"hønefoss.no\",\n\"jessheim.no\",\n\"jorpeland.no\",\n\"jørpeland.no\",\n\"kirkenes.no\",\n\"kopervik.no\",\n\"krokstadelva.no\",\n\"langevag.no\",\n\"langevåg.no\",\n\"leirvik.no\",\n\"mjondalen.no\",\n\"mjøndalen.no\",\n\"mo-i-rana.no\",\n\"mosjoen.no\",\n\"mosjøen.no\",\n\"nesoddtangen.no\",\n\"orkanger.no\",\n\"osoyro.no\",\n\"osøyro.no\",\n\"raholt.no\",\n\"råholt.no\",\n\"sandnessjoen.no\",\n\"sandnessjøen.no\",\n\"skedsmokorset.no\",\n\"slattum.no\",\n\"spjelkavik.no\",\n\"stathelle.no\",\n\"stavern.no\",\n\"stjordalshalsen.no\",\n\"stjørdalshalsen.no\",\n\"tananger.no\",\n\"tranby.no\",\n\"vossevangen.no\",\n\"afjord.no\",\n\"åfjord.no\",\n\"agdenes.no\",\n\"al.no\",\n\"ål.no\",\n\"alesund.no\",\n\"ålesund.no\",\n\"alstahaug.no\",\n\"alta.no\",\n\"áltá.no\",\n\"alaheadju.no\",\n\"álaheadju.no\",\n\"alvdal.no\",\n\"amli.no\",\n\"åmli.no\",\n\"amot.no\",\n\"åmot.no\",\n\"andebu.no\",\n\"andoy.no\",\n\"andøy.no\",\n\"andasuolo.no\",\n\"ardal.no\",\n\"årdal.no\",\n\"aremark.no\",\n\"arendal.no\",\n\"ås.no\",\n\"aseral.no\",\n\"åseral.no\",\n\"asker.no\",\n\"askim.no\",\n\"askvoll.no\",\n\"askoy.no\",\n\"askøy.no\",\n\"asnes.no\",\n\"åsnes.no\",\n\"audnedaln.no\",\n\"aukra.no\",\n\"aure.no\",\n\"aurland.no\",\n\"aurskog-holand.no\",\n\"aurskog-høland.no\",\n\"austevoll.no\",\n\"austrheim.no\",\n\"averoy.no\",\n\"averøy.no\",\n\"balestrand.no\",\n\"ballangen.no\",\n\"balat.no\",\n\"bálát.no\",\n\"balsfjord.no\",\n\"bahccavuotna.no\",\n\"báhccavuotna.no\",\n\"bamble.no\",\n\"bardu.no\",\n\"beardu.no\",\n\"beiarn.no\",\n\"bajddar.no\",\n\"bájddar.no\",\n\"baidar.no\",\n\"báidár.no\",\n\"berg.no\",\n\"bergen.no\",\n\"berlevag.no\",\n\"berlevåg.no\",\n\"bearalvahki.no\",\n\"bearalváhki.no\",\n\"bindal.no\",\n\"birkenes.no\",\n\"bjarkoy.no\",\n\"bjarkøy.no\",\n\"bjerkreim.no\",\n\"bjugn.no\",\n\"bodo.no\",\n\"bodø.no\",\n\"badaddja.no\",\n\"bådåddjå.no\",\n\"budejju.no\",\n\"bokn.no\",\n\"bremanger.no\",\n\"bronnoy.no\",\n\"brønnøy.no\",\n\"bygland.no\",\n\"bykle.no\",\n\"barum.no\",\n\"bærum.no\",\n\"bo.telemark.no\",\n\"bø.telemark.no\",\n\"bo.nordland.no\",\n\"bø.nordland.no\",\n\"bievat.no\",\n\"bievát.no\",\n\"bomlo.no\",\n\"bømlo.no\",\n\"batsfjord.no\",\n\"båtsfjord.no\",\n\"bahcavuotna.no\",\n\"báhcavuotna.no\",\n\"dovre.no\",\n\"drammen.no\",\n\"drangedal.no\",\n\"dyroy.no\",\n\"dyrøy.no\",\n\"donna.no\",\n\"dønna.no\",\n\"eid.no\",\n\"eidfjord.no\",\n\"eidsberg.no\",\n\"eidskog.no\",\n\"eidsvoll.no\",\n\"eigersund.no\",\n\"elverum.no\",\n\"enebakk.no\",\n\"engerdal.no\",\n\"etne.no\",\n\"etnedal.no\",\n\"evenes.no\",\n\"evenassi.no\",\n\"evenášši.no\",\n\"evje-og-hornnes.no\",\n\"farsund.no\",\n\"fauske.no\",\n\"fuossko.no\",\n\"fuoisku.no\",\n\"fedje.no\",\n\"fet.no\",\n\"finnoy.no\",\n\"finnøy.no\",\n\"fitjar.no\",\n\"fjaler.no\",\n\"fjell.no\",\n\"flakstad.no\",\n\"flatanger.no\",\n\"flekkefjord.no\",\n\"flesberg.no\",\n\"flora.no\",\n\"fla.no\",\n\"flå.no\",\n\"folldal.no\",\n\"forsand.no\",\n\"fosnes.no\",\n\"frei.no\",\n\"frogn.no\",\n\"froland.no\",\n\"frosta.no\",\n\"frana.no\",\n\"fræna.no\",\n\"froya.no\",\n\"frøya.no\",\n\"fusa.no\",\n\"fyresdal.no\",\n\"forde.no\",\n\"førde.no\",\n\"gamvik.no\",\n\"gangaviika.no\",\n\"gáŋgaviika.no\",\n\"gaular.no\",\n\"gausdal.no\",\n\"gildeskal.no\",\n\"gildeskål.no\",\n\"giske.no\",\n\"gjemnes.no\",\n\"gjerdrum.no\",\n\"gjerstad.no\",\n\"gjesdal.no\",\n\"gjovik.no\",\n\"gjøvik.no\",\n\"gloppen.no\",\n\"gol.no\",\n\"gran.no\",\n\"grane.no\",\n\"granvin.no\",\n\"gratangen.no\",\n\"grimstad.no\",\n\"grong.no\",\n\"kraanghke.no\",\n\"kråanghke.no\",\n\"grue.no\",\n\"gulen.no\",\n\"hadsel.no\",\n\"halden.no\",\n\"halsa.no\",\n\"hamar.no\",\n\"hamaroy.no\",\n\"habmer.no\",\n\"hábmer.no\",\n\"hapmir.no\",\n\"hápmir.no\",\n\"hammerfest.no\",\n\"hammarfeasta.no\",\n\"hámmárfeasta.no\",\n\"haram.no\",\n\"hareid.no\",\n\"harstad.no\",\n\"hasvik.no\",\n\"aknoluokta.no\",\n\"ákŋoluokta.no\",\n\"hattfjelldal.no\",\n\"aarborte.no\",\n\"haugesund.no\",\n\"hemne.no\",\n\"hemnes.no\",\n\"hemsedal.no\",\n\"heroy.more-og-romsdal.no\",\n\"herøy.møre-og-romsdal.no\",\n\"heroy.nordland.no\",\n\"herøy.nordland.no\",\n\"hitra.no\",\n\"hjartdal.no\",\n\"hjelmeland.no\",\n\"hobol.no\",\n\"hobøl.no\",\n\"hof.no\",\n\"hol.no\",\n\"hole.no\",\n\"holmestrand.no\",\n\"holtalen.no\",\n\"holtålen.no\",\n\"hornindal.no\",\n\"horten.no\",\n\"hurdal.no\",\n\"hurum.no\",\n\"hvaler.no\",\n\"hyllestad.no\",\n\"hagebostad.no\",\n\"hægebostad.no\",\n\"hoyanger.no\",\n\"høyanger.no\",\n\"hoylandet.no\",\n\"høylandet.no\",\n\"ha.no\",\n\"hå.no\",\n\"ibestad.no\",\n\"inderoy.no\",\n\"inderøy.no\",\n\"iveland.no\",\n\"jevnaker.no\",\n\"jondal.no\",\n\"jolster.no\",\n\"jølster.no\",\n\"karasjok.no\",\n\"karasjohka.no\",\n\"kárášjohka.no\",\n\"karlsoy.no\",\n\"galsa.no\",\n\"gálsá.no\",\n\"karmoy.no\",\n\"karmøy.no\",\n\"kautokeino.no\",\n\"guovdageaidnu.no\",\n\"klepp.no\",\n\"klabu.no\",\n\"klæbu.no\",\n\"kongsberg.no\",\n\"kongsvinger.no\",\n\"kragero.no\",\n\"kragerø.no\",\n\"kristiansand.no\",\n\"kristiansund.no\",\n\"krodsherad.no\",\n\"krødsherad.no\",\n\"kvalsund.no\",\n\"rahkkeravju.no\",\n\"ráhkkerávju.no\",\n\"kvam.no\",\n\"kvinesdal.no\",\n\"kvinnherad.no\",\n\"kviteseid.no\",\n\"kvitsoy.no\",\n\"kvitsøy.no\",\n\"kvafjord.no\",\n\"kvæfjord.no\",\n\"giehtavuoatna.no\",\n\"kvanangen.no\",\n\"kvænangen.no\",\n\"navuotna.no\",\n\"návuotna.no\",\n\"kafjord.no\",\n\"kåfjord.no\",\n\"gaivuotna.no\",\n\"gáivuotna.no\",\n\"larvik.no\",\n\"lavangen.no\",\n\"lavagis.no\",\n\"loabat.no\",\n\"loabát.no\",\n\"lebesby.no\",\n\"davvesiida.no\",\n\"leikanger.no\",\n\"leirfjord.no\",\n\"leka.no\",\n\"leksvik.no\",\n\"lenvik.no\",\n\"leangaviika.no\",\n\"leaŋgaviika.no\",\n\"lesja.no\",\n\"levanger.no\",\n\"lier.no\",\n\"lierne.no\",\n\"lillehammer.no\",\n\"lillesand.no\",\n\"lindesnes.no\",\n\"lindas.no\",\n\"lindås.no\",\n\"lom.no\",\n\"loppa.no\",\n\"lahppi.no\",\n\"láhppi.no\",\n\"lund.no\",\n\"lunner.no\",\n\"luroy.no\",\n\"lurøy.no\",\n\"luster.no\",\n\"lyngdal.no\",\n\"lyngen.no\",\n\"ivgu.no\",\n\"lardal.no\",\n\"lerdal.no\",\n\"lærdal.no\",\n\"lodingen.no\",\n\"lødingen.no\",\n\"lorenskog.no\",\n\"lørenskog.no\",\n\"loten.no\",\n\"løten.no\",\n\"malvik.no\",\n\"masoy.no\",\n\"måsøy.no\",\n\"muosat.no\",\n\"muosát.no\",\n\"mandal.no\",\n\"marker.no\",\n\"marnardal.no\",\n\"masfjorden.no\",\n\"meland.no\",\n\"meldal.no\",\n\"melhus.no\",\n\"meloy.no\",\n\"meløy.no\",\n\"meraker.no\",\n\"meråker.no\",\n\"moareke.no\",\n\"moåreke.no\",\n\"midsund.no\",\n\"midtre-gauldal.no\",\n\"modalen.no\",\n\"modum.no\",\n\"molde.no\",\n\"moskenes.no\",\n\"moss.no\",\n\"mosvik.no\",\n\"malselv.no\",\n\"målselv.no\",\n\"malatvuopmi.no\",\n\"málatvuopmi.no\",\n\"namdalseid.no\",\n\"aejrie.no\",\n\"namsos.no\",\n\"namsskogan.no\",\n\"naamesjevuemie.no\",\n\"nååmesjevuemie.no\",\n\"laakesvuemie.no\",\n\"nannestad.no\",\n\"narvik.no\",\n\"narviika.no\",\n\"naustdal.no\",\n\"nedre-eiker.no\",\n\"nes.akershus.no\",\n\"nes.buskerud.no\",\n\"nesna.no\",\n\"nesodden.no\",\n\"nesseby.no\",\n\"unjarga.no\",\n\"unjárga.no\",\n\"nesset.no\",\n\"nissedal.no\",\n\"nittedal.no\",\n\"nord-aurdal.no\",\n\"nord-fron.no\",\n\"nord-odal.no\",\n\"norddal.no\",\n\"nordkapp.no\",\n\"davvenjarga.no\",\n\"davvenjárga.no\",\n\"nordre-land.no\",\n\"nordreisa.no\",\n\"raisa.no\",\n\"ráisa.no\",\n\"nore-og-uvdal.no\",\n\"notodden.no\",\n\"naroy.no\",\n\"nærøy.no\",\n\"notteroy.no\",\n\"nøtterøy.no\",\n\"odda.no\",\n\"oksnes.no\",\n\"øksnes.no\",\n\"oppdal.no\",\n\"oppegard.no\",\n\"oppegård.no\",\n\"orkdal.no\",\n\"orland.no\",\n\"ørland.no\",\n\"orskog.no\",\n\"ørskog.no\",\n\"orsta.no\",\n\"ørsta.no\",\n\"os.hedmark.no\",\n\"os.hordaland.no\",\n\"osen.no\",\n\"osteroy.no\",\n\"osterøy.no\",\n\"ostre-toten.no\",\n\"østre-toten.no\",\n\"overhalla.no\",\n\"ovre-eiker.no\",\n\"øvre-eiker.no\",\n\"oyer.no\",\n\"øyer.no\",\n\"oygarden.no\",\n\"øygarden.no\",\n\"oystre-slidre.no\",\n\"øystre-slidre.no\",\n\"porsanger.no\",\n\"porsangu.no\",\n\"porsáŋgu.no\",\n\"porsgrunn.no\",\n\"radoy.no\",\n\"radøy.no\",\n\"rakkestad.no\",\n\"rana.no\",\n\"ruovat.no\",\n\"randaberg.no\",\n\"rauma.no\",\n\"rendalen.no\",\n\"rennebu.no\",\n\"rennesoy.no\",\n\"rennesøy.no\",\n\"rindal.no\",\n\"ringebu.no\",\n\"ringerike.no\",\n\"ringsaker.no\",\n\"rissa.no\",\n\"risor.no\",\n\"risør.no\",\n\"roan.no\",\n\"rollag.no\",\n\"rygge.no\",\n\"ralingen.no\",\n\"rælingen.no\",\n\"rodoy.no\",\n\"rødøy.no\",\n\"romskog.no\",\n\"rømskog.no\",\n\"roros.no\",\n\"røros.no\",\n\"rost.no\",\n\"røst.no\",\n\"royken.no\",\n\"røyken.no\",\n\"royrvik.no\",\n\"røyrvik.no\",\n\"rade.no\",\n\"råde.no\",\n\"salangen.no\",\n\"siellak.no\",\n\"saltdal.no\",\n\"salat.no\",\n\"sálát.no\",\n\"sálat.no\",\n\"samnanger.no\",\n\"sande.more-og-romsdal.no\",\n\"sande.møre-og-romsdal.no\",\n\"sande.vestfold.no\",\n\"sandefjord.no\",\n\"sandnes.no\",\n\"sandoy.no\",\n\"sandøy.no\",\n\"sarpsborg.no\",\n\"sauda.no\",\n\"sauherad.no\",\n\"sel.no\",\n\"selbu.no\",\n\"selje.no\",\n\"seljord.no\",\n\"sigdal.no\",\n\"siljan.no\",\n\"sirdal.no\",\n\"skaun.no\",\n\"skedsmo.no\",\n\"ski.no\",\n\"skien.no\",\n\"skiptvet.no\",\n\"skjervoy.no\",\n\"skjervøy.no\",\n\"skierva.no\",\n\"skiervá.no\",\n\"skjak.no\",\n\"skjåk.no\",\n\"skodje.no\",\n\"skanland.no\",\n\"skånland.no\",\n\"skanit.no\",\n\"skánit.no\",\n\"smola.no\",\n\"smøla.no\",\n\"snillfjord.no\",\n\"snasa.no\",\n\"snåsa.no\",\n\"snoasa.no\",\n\"snaase.no\",\n\"snåase.no\",\n\"sogndal.no\",\n\"sokndal.no\",\n\"sola.no\",\n\"solund.no\",\n\"songdalen.no\",\n\"sortland.no\",\n\"spydeberg.no\",\n\"stange.no\",\n\"stavanger.no\",\n\"steigen.no\",\n\"steinkjer.no\",\n\"stjordal.no\",\n\"stjørdal.no\",\n\"stokke.no\",\n\"stor-elvdal.no\",\n\"stord.no\",\n\"stordal.no\",\n\"storfjord.no\",\n\"omasvuotna.no\",\n\"strand.no\",\n\"stranda.no\",\n\"stryn.no\",\n\"sula.no\",\n\"suldal.no\",\n\"sund.no\",\n\"sunndal.no\",\n\"surnadal.no\",\n\"sveio.no\",\n\"svelvik.no\",\n\"sykkylven.no\",\n\"sogne.no\",\n\"søgne.no\",\n\"somna.no\",\n\"sømna.no\",\n\"sondre-land.no\",\n\"søndre-land.no\",\n\"sor-aurdal.no\",\n\"sør-aurdal.no\",\n\"sor-fron.no\",\n\"sør-fron.no\",\n\"sor-odal.no\",\n\"sør-odal.no\",\n\"sor-varanger.no\",\n\"sør-varanger.no\",\n\"matta-varjjat.no\",\n\"mátta-várjjat.no\",\n\"sorfold.no\",\n\"sørfold.no\",\n\"sorreisa.no\",\n\"sørreisa.no\",\n\"sorum.no\",\n\"sørum.no\",\n\"tana.no\",\n\"deatnu.no\",\n\"time.no\",\n\"tingvoll.no\",\n\"tinn.no\",\n\"tjeldsund.no\",\n\"dielddanuorri.no\",\n\"tjome.no\",\n\"tjøme.no\",\n\"tokke.no\",\n\"tolga.no\",\n\"torsken.no\",\n\"tranoy.no\",\n\"tranøy.no\",\n\"tromso.no\",\n\"tromsø.no\",\n\"tromsa.no\",\n\"romsa.no\",\n\"trondheim.no\",\n\"troandin.no\",\n\"trysil.no\",\n\"trana.no\",\n\"træna.no\",\n\"trogstad.no\",\n\"trøgstad.no\",\n\"tvedestrand.no\",\n\"tydal.no\",\n\"tynset.no\",\n\"tysfjord.no\",\n\"divtasvuodna.no\",\n\"divttasvuotna.no\",\n\"tysnes.no\",\n\"tysvar.no\",\n\"tysvær.no\",\n\"tonsberg.no\",\n\"tønsberg.no\",\n\"ullensaker.no\",\n\"ullensvang.no\",\n\"ulvik.no\",\n\"utsira.no\",\n\"vadso.no\",\n\"vadsø.no\",\n\"cahcesuolo.no\",\n\"čáhcesuolo.no\",\n\"vaksdal.no\",\n\"valle.no\",\n\"vang.no\",\n\"vanylven.no\",\n\"vardo.no\",\n\"vardø.no\",\n\"varggat.no\",\n\"várggát.no\",\n\"vefsn.no\",\n\"vaapste.no\",\n\"vega.no\",\n\"vegarshei.no\",\n\"vegårshei.no\",\n\"vennesla.no\",\n\"verdal.no\",\n\"verran.no\",\n\"vestby.no\",\n\"vestnes.no\",\n\"vestre-slidre.no\",\n\"vestre-toten.no\",\n\"vestvagoy.no\",\n\"vestvågøy.no\",\n\"vevelstad.no\",\n\"vik.no\",\n\"vikna.no\",\n\"vindafjord.no\",\n\"volda.no\",\n\"voss.no\",\n\"varoy.no\",\n\"værøy.no\",\n\"vagan.no\",\n\"vågan.no\",\n\"voagat.no\",\n\"vagsoy.no\",\n\"vågsøy.no\",\n\"vaga.no\",\n\"vågå.no\",\n\"valer.ostfold.no\",\n\"våler.østfold.no\",\n\"valer.hedmark.no\",\n\"våler.hedmark.no\",\n\"*.np\",\n\"nr\",\n\"biz.nr\",\n\"info.nr\",\n\"gov.nr\",\n\"edu.nr\",\n\"org.nr\",\n\"net.nr\",\n\"com.nr\",\n\"nu\",\n\"nz\",\n\"ac.nz\",\n\"co.nz\",\n\"cri.nz\",\n\"geek.nz\",\n\"gen.nz\",\n\"govt.nz\",\n\"health.nz\",\n\"iwi.nz\",\n\"kiwi.nz\",\n\"maori.nz\",\n\"mil.nz\",\n\"māori.nz\",\n\"net.nz\",\n\"org.nz\",\n\"parliament.nz\",\n\"school.nz\",\n\"om\",\n\"co.om\",\n\"com.om\",\n\"edu.om\",\n\"gov.om\",\n\"med.om\",\n\"museum.om\",\n\"net.om\",\n\"org.om\",\n\"pro.om\",\n\"onion\",\n\"org\",\n\"pa\",\n\"ac.pa\",\n\"gob.pa\",\n\"com.pa\",\n\"org.pa\",\n\"sld.pa\",\n\"edu.pa\",\n\"net.pa\",\n\"ing.pa\",\n\"abo.pa\",\n\"med.pa\",\n\"nom.pa\",\n\"pe\",\n\"edu.pe\",\n\"gob.pe\",\n\"nom.pe\",\n\"mil.pe\",\n\"org.pe\",\n\"com.pe\",\n\"net.pe\",\n\"pf\",\n\"com.pf\",\n\"org.pf\",\n\"edu.pf\",\n\"*.pg\",\n\"ph\",\n\"com.ph\",\n\"net.ph\",\n\"org.ph\",\n\"gov.ph\",\n\"edu.ph\",\n\"ngo.ph\",\n\"mil.ph\",\n\"i.ph\",\n\"pk\",\n\"com.pk\",\n\"net.pk\",\n\"edu.pk\",\n\"org.pk\",\n\"fam.pk\",\n\"biz.pk\",\n\"web.pk\",\n\"gov.pk\",\n\"gob.pk\",\n\"gok.pk\",\n\"gon.pk\",\n\"gop.pk\",\n\"gos.pk\",\n\"info.pk\",\n\"pl\",\n\"com.pl\",\n\"net.pl\",\n\"org.pl\",\n\"aid.pl\",\n\"agro.pl\",\n\"atm.pl\",\n\"auto.pl\",\n\"biz.pl\",\n\"edu.pl\",\n\"gmina.pl\",\n\"gsm.pl\",\n\"info.pl\",\n\"mail.pl\",\n\"miasta.pl\",\n\"media.pl\",\n\"mil.pl\",\n\"nieruchomosci.pl\",\n\"nom.pl\",\n\"pc.pl\",\n\"powiat.pl\",\n\"priv.pl\",\n\"realestate.pl\",\n\"rel.pl\",\n\"sex.pl\",\n\"shop.pl\",\n\"sklep.pl\",\n\"sos.pl\",\n\"szkola.pl\",\n\"targi.pl\",\n\"tm.pl\",\n\"tourism.pl\",\n\"travel.pl\",\n\"turystyka.pl\",\n\"gov.pl\",\n\"ap.gov.pl\",\n\"ic.gov.pl\",\n\"is.gov.pl\",\n\"us.gov.pl\",\n\"kmpsp.gov.pl\",\n\"kppsp.gov.pl\",\n\"kwpsp.gov.pl\",\n\"psp.gov.pl\",\n\"wskr.gov.pl\",\n\"kwp.gov.pl\",\n\"mw.gov.pl\",\n\"ug.gov.pl\",\n\"um.gov.pl\",\n\"umig.gov.pl\",\n\"ugim.gov.pl\",\n\"upow.gov.pl\",\n\"uw.gov.pl\",\n\"starostwo.gov.pl\",\n\"pa.gov.pl\",\n\"po.gov.pl\",\n\"psse.gov.pl\",\n\"pup.gov.pl\",\n\"rzgw.gov.pl\",\n\"sa.gov.pl\",\n\"so.gov.pl\",\n\"sr.gov.pl\",\n\"wsa.gov.pl\",\n\"sko.gov.pl\",\n\"uzs.gov.pl\",\n\"wiih.gov.pl\",\n\"winb.gov.pl\",\n\"pinb.gov.pl\",\n\"wios.gov.pl\",\n\"witd.gov.pl\",\n\"wzmiuw.gov.pl\",\n\"piw.gov.pl\",\n\"wiw.gov.pl\",\n\"griw.gov.pl\",\n\"wif.gov.pl\",\n\"oum.gov.pl\",\n\"sdn.gov.pl\",\n\"zp.gov.pl\",\n\"uppo.gov.pl\",\n\"mup.gov.pl\",\n\"wuoz.gov.pl\",\n\"konsulat.gov.pl\",\n\"oirm.gov.pl\",\n\"augustow.pl\",\n\"babia-gora.pl\",\n\"bedzin.pl\",\n\"beskidy.pl\",\n\"bialowieza.pl\",\n\"bialystok.pl\",\n\"bielawa.pl\",\n\"bieszczady.pl\",\n\"boleslawiec.pl\",\n\"bydgoszcz.pl\",\n\"bytom.pl\",\n\"cieszyn.pl\",\n\"czeladz.pl\",\n\"czest.pl\",\n\"dlugoleka.pl\",\n\"elblag.pl\",\n\"elk.pl\",\n\"glogow.pl\",\n\"gniezno.pl\",\n\"gorlice.pl\",\n\"grajewo.pl\",\n\"ilawa.pl\",\n\"jaworzno.pl\",\n\"jelenia-gora.pl\",\n\"jgora.pl\",\n\"kalisz.pl\",\n\"kazimierz-dolny.pl\",\n\"karpacz.pl\",\n\"kartuzy.pl\",\n\"kaszuby.pl\",\n\"katowice.pl\",\n\"kepno.pl\",\n\"ketrzyn.pl\",\n\"klodzko.pl\",\n\"kobierzyce.pl\",\n\"kolobrzeg.pl\",\n\"konin.pl\",\n\"konskowola.pl\",\n\"kutno.pl\",\n\"lapy.pl\",\n\"lebork.pl\",\n\"legnica.pl\",\n\"lezajsk.pl\",\n\"limanowa.pl\",\n\"lomza.pl\",\n\"lowicz.pl\",\n\"lubin.pl\",\n\"lukow.pl\",\n\"malbork.pl\",\n\"malopolska.pl\",\n\"mazowsze.pl\",\n\"mazury.pl\",\n\"mielec.pl\",\n\"mielno.pl\",\n\"mragowo.pl\",\n\"naklo.pl\",\n\"nowaruda.pl\",\n\"nysa.pl\",\n\"olawa.pl\",\n\"olecko.pl\",\n\"olkusz.pl\",\n\"olsztyn.pl\",\n\"opoczno.pl\",\n\"opole.pl\",\n\"ostroda.pl\",\n\"ostroleka.pl\",\n\"ostrowiec.pl\",\n\"ostrowwlkp.pl\",\n\"pila.pl\",\n\"pisz.pl\",\n\"podhale.pl\",\n\"podlasie.pl\",\n\"polkowice.pl\",\n\"pomorze.pl\",\n\"pomorskie.pl\",\n\"prochowice.pl\",\n\"pruszkow.pl\",\n\"przeworsk.pl\",\n\"pulawy.pl\",\n\"radom.pl\",\n\"rawa-maz.pl\",\n\"rybnik.pl\",\n\"rzeszow.pl\",\n\"sanok.pl\",\n\"sejny.pl\",\n\"slask.pl\",\n\"slupsk.pl\",\n\"sosnowiec.pl\",\n\"stalowa-wola.pl\",\n\"skoczow.pl\",\n\"starachowice.pl\",\n\"stargard.pl\",\n\"suwalki.pl\",\n\"swidnica.pl\",\n\"swiebodzin.pl\",\n\"swinoujscie.pl\",\n\"szczecin.pl\",\n\"szczytno.pl\",\n\"tarnobrzeg.pl\",\n\"tgory.pl\",\n\"turek.pl\",\n\"tychy.pl\",\n\"ustka.pl\",\n\"walbrzych.pl\",\n\"warmia.pl\",\n\"warszawa.pl\",\n\"waw.pl\",\n\"wegrow.pl\",\n\"wielun.pl\",\n\"wlocl.pl\",\n\"wloclawek.pl\",\n\"wodzislaw.pl\",\n\"wolomin.pl\",\n\"wroclaw.pl\",\n\"zachpomor.pl\",\n\"zagan.pl\",\n\"zarow.pl\",\n\"zgora.pl\",\n\"zgorzelec.pl\",\n\"pm\",\n\"pn\",\n\"gov.pn\",\n\"co.pn\",\n\"org.pn\",\n\"edu.pn\",\n\"net.pn\",\n\"post\",\n\"pr\",\n\"com.pr\",\n\"net.pr\",\n\"org.pr\",\n\"gov.pr\",\n\"edu.pr\",\n\"isla.pr\",\n\"pro.pr\",\n\"biz.pr\",\n\"info.pr\",\n\"name.pr\",\n\"est.pr\",\n\"prof.pr\",\n\"ac.pr\",\n\"pro\",\n\"aaa.pro\",\n\"aca.pro\",\n\"acct.pro\",\n\"avocat.pro\",\n\"bar.pro\",\n\"cpa.pro\",\n\"eng.pro\",\n\"jur.pro\",\n\"law.pro\",\n\"med.pro\",\n\"recht.pro\",\n\"ps\",\n\"edu.ps\",\n\"gov.ps\",\n\"sec.ps\",\n\"plo.ps\",\n\"com.ps\",\n\"org.ps\",\n\"net.ps\",\n\"pt\",\n\"net.pt\",\n\"gov.pt\",\n\"org.pt\",\n\"edu.pt\",\n\"int.pt\",\n\"publ.pt\",\n\"com.pt\",\n\"nome.pt\",\n\"pw\",\n\"co.pw\",\n\"ne.pw\",\n\"or.pw\",\n\"ed.pw\",\n\"go.pw\",\n\"belau.pw\",\n\"py\",\n\"com.py\",\n\"coop.py\",\n\"edu.py\",\n\"gov.py\",\n\"mil.py\",\n\"net.py\",\n\"org.py\",\n\"qa\",\n\"com.qa\",\n\"edu.qa\",\n\"gov.qa\",\n\"mil.qa\",\n\"name.qa\",\n\"net.qa\",\n\"org.qa\",\n\"sch.qa\",\n\"re\",\n\"asso.re\",\n\"com.re\",\n\"nom.re\",\n\"ro\",\n\"arts.ro\",\n\"com.ro\",\n\"firm.ro\",\n\"info.ro\",\n\"nom.ro\",\n\"nt.ro\",\n\"org.ro\",\n\"rec.ro\",\n\"store.ro\",\n\"tm.ro\",\n\"www.ro\",\n\"rs\",\n\"ac.rs\",\n\"co.rs\",\n\"edu.rs\",\n\"gov.rs\",\n\"in.rs\",\n\"org.rs\",\n\"ru\",\n\"rw\",\n\"ac.rw\",\n\"co.rw\",\n\"coop.rw\",\n\"gov.rw\",\n\"mil.rw\",\n\"net.rw\",\n\"org.rw\",\n\"sa\",\n\"com.sa\",\n\"net.sa\",\n\"org.sa\",\n\"gov.sa\",\n\"med.sa\",\n\"pub.sa\",\n\"edu.sa\",\n\"sch.sa\",\n\"sb\",\n\"com.sb\",\n\"edu.sb\",\n\"gov.sb\",\n\"net.sb\",\n\"org.sb\",\n\"sc\",\n\"com.sc\",\n\"gov.sc\",\n\"net.sc\",\n\"org.sc\",\n\"edu.sc\",\n\"sd\",\n\"com.sd\",\n\"net.sd\",\n\"org.sd\",\n\"edu.sd\",\n\"med.sd\",\n\"tv.sd\",\n\"gov.sd\",\n\"info.sd\",\n\"se\",\n\"a.se\",\n\"ac.se\",\n\"b.se\",\n\"bd.se\",\n\"brand.se\",\n\"c.se\",\n\"d.se\",\n\"e.se\",\n\"f.se\",\n\"fh.se\",\n\"fhsk.se\",\n\"fhv.se\",\n\"g.se\",\n\"h.se\",\n\"i.se\",\n\"k.se\",\n\"komforb.se\",\n\"kommunalforbund.se\",\n\"komvux.se\",\n\"l.se\",\n\"lanbib.se\",\n\"m.se\",\n\"n.se\",\n\"naturbruksgymn.se\",\n\"o.se\",\n\"org.se\",\n\"p.se\",\n\"parti.se\",\n\"pp.se\",\n\"press.se\",\n\"r.se\",\n\"s.se\",\n\"t.se\",\n\"tm.se\",\n\"u.se\",\n\"w.se\",\n\"x.se\",\n\"y.se\",\n\"z.se\",\n\"sg\",\n\"com.sg\",\n\"net.sg\",\n\"org.sg\",\n\"gov.sg\",\n\"edu.sg\",\n\"per.sg\",\n\"sh\",\n\"com.sh\",\n\"net.sh\",\n\"gov.sh\",\n\"org.sh\",\n\"mil.sh\",\n\"si\",\n\"sj\",\n\"sk\",\n\"sl\",\n\"com.sl\",\n\"net.sl\",\n\"edu.sl\",\n\"gov.sl\",\n\"org.sl\",\n\"sm\",\n\"sn\",\n\"art.sn\",\n\"com.sn\",\n\"edu.sn\",\n\"gouv.sn\",\n\"org.sn\",\n\"perso.sn\",\n\"univ.sn\",\n\"so\",\n\"com.so\",\n\"edu.so\",\n\"gov.so\",\n\"me.so\",\n\"net.so\",\n\"org.so\",\n\"sr\",\n\"ss\",\n\"biz.ss\",\n\"com.ss\",\n\"edu.ss\",\n\"gov.ss\",\n\"me.ss\",\n\"net.ss\",\n\"org.ss\",\n\"sch.ss\",\n\"st\",\n\"co.st\",\n\"com.st\",\n\"consulado.st\",\n\"edu.st\",\n\"embaixada.st\",\n\"mil.st\",\n\"net.st\",\n\"org.st\",\n\"principe.st\",\n\"saotome.st\",\n\"store.st\",\n\"su\",\n\"sv\",\n\"com.sv\",\n\"edu.sv\",\n\"gob.sv\",\n\"org.sv\",\n\"red.sv\",\n\"sx\",\n\"gov.sx\",\n\"sy\",\n\"edu.sy\",\n\"gov.sy\",\n\"net.sy\",\n\"mil.sy\",\n\"com.sy\",\n\"org.sy\",\n\"sz\",\n\"co.sz\",\n\"ac.sz\",\n\"org.sz\",\n\"tc\",\n\"td\",\n\"tel\",\n\"tf\",\n\"tg\",\n\"th\",\n\"ac.th\",\n\"co.th\",\n\"go.th\",\n\"in.th\",\n\"mi.th\",\n\"net.th\",\n\"or.th\",\n\"tj\",\n\"ac.tj\",\n\"biz.tj\",\n\"co.tj\",\n\"com.tj\",\n\"edu.tj\",\n\"go.tj\",\n\"gov.tj\",\n\"int.tj\",\n\"mil.tj\",\n\"name.tj\",\n\"net.tj\",\n\"nic.tj\",\n\"org.tj\",\n\"test.tj\",\n\"web.tj\",\n\"tk\",\n\"tl\",\n\"gov.tl\",\n\"tm\",\n\"com.tm\",\n\"co.tm\",\n\"org.tm\",\n\"net.tm\",\n\"nom.tm\",\n\"gov.tm\",\n\"mil.tm\",\n\"edu.tm\",\n\"tn\",\n\"com.tn\",\n\"ens.tn\",\n\"fin.tn\",\n\"gov.tn\",\n\"ind.tn\",\n\"info.tn\",\n\"intl.tn\",\n\"mincom.tn\",\n\"nat.tn\",\n\"net.tn\",\n\"org.tn\",\n\"perso.tn\",\n\"tourism.tn\",\n\"to\",\n\"com.to\",\n\"gov.to\",\n\"net.to\",\n\"org.to\",\n\"edu.to\",\n\"mil.to\",\n\"tr\",\n\"av.tr\",\n\"bbs.tr\",\n\"bel.tr\",\n\"biz.tr\",\n\"com.tr\",\n\"dr.tr\",\n\"edu.tr\",\n\"gen.tr\",\n\"gov.tr\",\n\"info.tr\",\n\"mil.tr\",\n\"k12.tr\",\n\"kep.tr\",\n\"name.tr\",\n\"net.tr\",\n\"org.tr\",\n\"pol.tr\",\n\"tel.tr\",\n\"tsk.tr\",\n\"tv.tr\",\n\"web.tr\",\n\"nc.tr\",\n\"gov.nc.tr\",\n\"tt\",\n\"co.tt\",\n\"com.tt\",\n\"org.tt\",\n\"net.tt\",\n\"biz.tt\",\n\"info.tt\",\n\"pro.tt\",\n\"int.tt\",\n\"coop.tt\",\n\"jobs.tt\",\n\"mobi.tt\",\n\"travel.tt\",\n\"museum.tt\",\n\"aero.tt\",\n\"name.tt\",\n\"gov.tt\",\n\"edu.tt\",\n\"tv\",\n\"tw\",\n\"edu.tw\",\n\"gov.tw\",\n\"mil.tw\",\n\"com.tw\",\n\"net.tw\",\n\"org.tw\",\n\"idv.tw\",\n\"game.tw\",\n\"ebiz.tw\",\n\"club.tw\",\n\"網路.tw\",\n\"組織.tw\",\n\"商業.tw\",\n\"tz\",\n\"ac.tz\",\n\"co.tz\",\n\"go.tz\",\n\"hotel.tz\",\n\"info.tz\",\n\"me.tz\",\n\"mil.tz\",\n\"mobi.tz\",\n\"ne.tz\",\n\"or.tz\",\n\"sc.tz\",\n\"tv.tz\",\n\"ua\",\n\"com.ua\",\n\"edu.ua\",\n\"gov.ua\",\n\"in.ua\",\n\"net.ua\",\n\"org.ua\",\n\"cherkassy.ua\",\n\"cherkasy.ua\",\n\"chernigov.ua\",\n\"chernihiv.ua\",\n\"chernivtsi.ua\",\n\"chernovtsy.ua\",\n\"ck.ua\",\n\"cn.ua\",\n\"cr.ua\",\n\"crimea.ua\",\n\"cv.ua\",\n\"dn.ua\",\n\"dnepropetrovsk.ua\",\n\"dnipropetrovsk.ua\",\n\"donetsk.ua\",\n\"dp.ua\",\n\"if.ua\",\n\"ivano-frankivsk.ua\",\n\"kh.ua\",\n\"kharkiv.ua\",\n\"kharkov.ua\",\n\"kherson.ua\",\n\"khmelnitskiy.ua\",\n\"khmelnytskyi.ua\",\n\"kiev.ua\",\n\"kirovograd.ua\",\n\"km.ua\",\n\"kr.ua\",\n\"krym.ua\",\n\"ks.ua\",\n\"kv.ua\",\n\"kyiv.ua\",\n\"lg.ua\",\n\"lt.ua\",\n\"lugansk.ua\",\n\"lutsk.ua\",\n\"lv.ua\",\n\"lviv.ua\",\n\"mk.ua\",\n\"mykolaiv.ua\",\n\"nikolaev.ua\",\n\"od.ua\",\n\"odesa.ua\",\n\"odessa.ua\",\n\"pl.ua\",\n\"poltava.ua\",\n\"rivne.ua\",\n\"rovno.ua\",\n\"rv.ua\",\n\"sb.ua\",\n\"sebastopol.ua\",\n\"sevastopol.ua\",\n\"sm.ua\",\n\"sumy.ua\",\n\"te.ua\",\n\"ternopil.ua\",\n\"uz.ua\",\n\"uzhgorod.ua\",\n\"vinnica.ua\",\n\"vinnytsia.ua\",\n\"vn.ua\",\n\"volyn.ua\",\n\"yalta.ua\",\n\"zaporizhzhe.ua\",\n\"zaporizhzhia.ua\",\n\"zhitomir.ua\",\n\"zhytomyr.ua\",\n\"zp.ua\",\n\"zt.ua\",\n\"ug\",\n\"co.ug\",\n\"or.ug\",\n\"ac.ug\",\n\"sc.ug\",\n\"go.ug\",\n\"ne.ug\",\n\"com.ug\",\n\"org.ug\",\n\"uk\",\n\"ac.uk\",\n\"co.uk\",\n\"gov.uk\",\n\"ltd.uk\",\n\"me.uk\",\n\"net.uk\",\n\"nhs.uk\",\n\"org.uk\",\n\"plc.uk\",\n\"police.uk\",\n\"*.sch.uk\",\n\"us\",\n\"dni.us\",\n\"fed.us\",\n\"isa.us\",\n\"kids.us\",\n\"nsn.us\",\n\"ak.us\",\n\"al.us\",\n\"ar.us\",\n\"as.us\",\n\"az.us\",\n\"ca.us\",\n\"co.us\",\n\"ct.us\",\n\"dc.us\",\n\"de.us\",\n\"fl.us\",\n\"ga.us\",\n\"gu.us\",\n\"hi.us\",\n\"ia.us\",\n\"id.us\",\n\"il.us\",\n\"in.us\",\n\"ks.us\",\n\"ky.us\",\n\"la.us\",\n\"ma.us\",\n\"md.us\",\n\"me.us\",\n\"mi.us\",\n\"mn.us\",\n\"mo.us\",\n\"ms.us\",\n\"mt.us\",\n\"nc.us\",\n\"nd.us\",\n\"ne.us\",\n\"nh.us\",\n\"nj.us\",\n\"nm.us\",\n\"nv.us\",\n\"ny.us\",\n\"oh.us\",\n\"ok.us\",\n\"or.us\",\n\"pa.us\",\n\"pr.us\",\n\"ri.us\",\n\"sc.us\",\n\"sd.us\",\n\"tn.us\",\n\"tx.us\",\n\"ut.us\",\n\"vi.us\",\n\"vt.us\",\n\"va.us\",\n\"wa.us\",\n\"wi.us\",\n\"wv.us\",\n\"wy.us\",\n\"k12.ak.us\",\n\"k12.al.us\",\n\"k12.ar.us\",\n\"k12.as.us\",\n\"k12.az.us\",\n\"k12.ca.us\",\n\"k12.co.us\",\n\"k12.ct.us\",\n\"k12.dc.us\",\n\"k12.de.us\",\n\"k12.fl.us\",\n\"k12.ga.us\",\n\"k12.gu.us\",\n\"k12.ia.us\",\n\"k12.id.us\",\n\"k12.il.us\",\n\"k12.in.us\",\n\"k12.ks.us\",\n\"k12.ky.us\",\n\"k12.la.us\",\n\"k12.ma.us\",\n\"k12.md.us\",\n\"k12.me.us\",\n\"k12.mi.us\",\n\"k12.mn.us\",\n\"k12.mo.us\",\n\"k12.ms.us\",\n\"k12.mt.us\",\n\"k12.nc.us\",\n\"k12.ne.us\",\n\"k12.nh.us\",\n\"k12.nj.us\",\n\"k12.nm.us\",\n\"k12.nv.us\",\n\"k12.ny.us\",\n\"k12.oh.us\",\n\"k12.ok.us\",\n\"k12.or.us\",\n\"k12.pa.us\",\n\"k12.pr.us\",\n\"k12.sc.us\",\n\"k12.tn.us\",\n\"k12.tx.us\",\n\"k12.ut.us\",\n\"k12.vi.us\",\n\"k12.vt.us\",\n\"k12.va.us\",\n\"k12.wa.us\",\n\"k12.wi.us\",\n\"k12.wy.us\",\n\"cc.ak.us\",\n\"cc.al.us\",\n\"cc.ar.us\",\n\"cc.as.us\",\n\"cc.az.us\",\n\"cc.ca.us\",\n\"cc.co.us\",\n\"cc.ct.us\",\n\"cc.dc.us\",\n\"cc.de.us\",\n\"cc.fl.us\",\n\"cc.ga.us\",\n\"cc.gu.us\",\n\"cc.hi.us\",\n\"cc.ia.us\",\n\"cc.id.us\",\n\"cc.il.us\",\n\"cc.in.us\",\n\"cc.ks.us\",\n\"cc.ky.us\",\n\"cc.la.us\",\n\"cc.ma.us\",\n\"cc.md.us\",\n\"cc.me.us\",\n\"cc.mi.us\",\n\"cc.mn.us\",\n\"cc.mo.us\",\n\"cc.ms.us\",\n\"cc.mt.us\",\n\"cc.nc.us\",\n\"cc.nd.us\",\n\"cc.ne.us\",\n\"cc.nh.us\",\n\"cc.nj.us\",\n\"cc.nm.us\",\n\"cc.nv.us\",\n\"cc.ny.us\",\n\"cc.oh.us\",\n\"cc.ok.us\",\n\"cc.or.us\",\n\"cc.pa.us\",\n\"cc.pr.us\",\n\"cc.ri.us\",\n\"cc.sc.us\",\n\"cc.sd.us\",\n\"cc.tn.us\",\n\"cc.tx.us\",\n\"cc.ut.us\",\n\"cc.vi.us\",\n\"cc.vt.us\",\n\"cc.va.us\",\n\"cc.wa.us\",\n\"cc.wi.us\",\n\"cc.wv.us\",\n\"cc.wy.us\",\n\"lib.ak.us\",\n\"lib.al.us\",\n\"lib.ar.us\",\n\"lib.as.us\",\n\"lib.az.us\",\n\"lib.ca.us\",\n\"lib.co.us\",\n\"lib.ct.us\",\n\"lib.dc.us\",\n\"lib.fl.us\",\n\"lib.ga.us\",\n\"lib.gu.us\",\n\"lib.hi.us\",\n\"lib.ia.us\",\n\"lib.id.us\",\n\"lib.il.us\",\n\"lib.in.us\",\n\"lib.ks.us\",\n\"lib.ky.us\",\n\"lib.la.us\",\n\"lib.ma.us\",\n\"lib.md.us\",\n\"lib.me.us\",\n\"lib.mi.us\",\n\"lib.mn.us\",\n\"lib.mo.us\",\n\"lib.ms.us\",\n\"lib.mt.us\",\n\"lib.nc.us\",\n\"lib.nd.us\",\n\"lib.ne.us\",\n\"lib.nh.us\",\n\"lib.nj.us\",\n\"lib.nm.us\",\n\"lib.nv.us\",\n\"lib.ny.us\",\n\"lib.oh.us\",\n\"lib.ok.us\",\n\"lib.or.us\",\n\"lib.pa.us\",\n\"lib.pr.us\",\n\"lib.ri.us\",\n\"lib.sc.us\",\n\"lib.sd.us\",\n\"lib.tn.us\",\n\"lib.tx.us\",\n\"lib.ut.us\",\n\"lib.vi.us\",\n\"lib.vt.us\",\n\"lib.va.us\",\n\"lib.wa.us\",\n\"lib.wi.us\",\n\"lib.wy.us\",\n\"pvt.k12.ma.us\",\n\"chtr.k12.ma.us\",\n\"paroch.k12.ma.us\",\n\"ann-arbor.mi.us\",\n\"cog.mi.us\",\n\"dst.mi.us\",\n\"eaton.mi.us\",\n\"gen.mi.us\",\n\"mus.mi.us\",\n\"tec.mi.us\",\n\"washtenaw.mi.us\",\n\"uy\",\n\"com.uy\",\n\"edu.uy\",\n\"gub.uy\",\n\"mil.uy\",\n\"net.uy\",\n\"org.uy\",\n\"uz\",\n\"co.uz\",\n\"com.uz\",\n\"net.uz\",\n\"org.uz\",\n\"va\",\n\"vc\",\n\"com.vc\",\n\"net.vc\",\n\"org.vc\",\n\"gov.vc\",\n\"mil.vc\",\n\"edu.vc\",\n\"ve\",\n\"arts.ve\",\n\"bib.ve\",\n\"co.ve\",\n\"com.ve\",\n\"e12.ve\",\n\"edu.ve\",\n\"firm.ve\",\n\"gob.ve\",\n\"gov.ve\",\n\"info.ve\",\n\"int.ve\",\n\"mil.ve\",\n\"net.ve\",\n\"nom.ve\",\n\"org.ve\",\n\"rar.ve\",\n\"rec.ve\",\n\"store.ve\",\n\"tec.ve\",\n\"web.ve\",\n\"vg\",\n\"vi\",\n\"co.vi\",\n\"com.vi\",\n\"k12.vi\",\n\"net.vi\",\n\"org.vi\",\n\"vn\",\n\"com.vn\",\n\"net.vn\",\n\"org.vn\",\n\"edu.vn\",\n\"gov.vn\",\n\"int.vn\",\n\"ac.vn\",\n\"biz.vn\",\n\"info.vn\",\n\"name.vn\",\n\"pro.vn\",\n\"health.vn\",\n\"vu\",\n\"com.vu\",\n\"edu.vu\",\n\"net.vu\",\n\"org.vu\",\n\"wf\",\n\"ws\",\n\"com.ws\",\n\"net.ws\",\n\"org.ws\",\n\"gov.ws\",\n\"edu.ws\",\n\"yt\",\n\"امارات\",\n\"հայ\",\n\"বাংলা\",\n\"бг\",\n\"البحرين\",\n\"бел\",\n\"中国\",\n\"中國\",\n\"الجزائر\",\n\"مصر\",\n\"ею\",\n\"ευ\",\n\"موريتانيا\",\n\"გე\",\n\"ελ\",\n\"香港\",\n\"公司.香港\",\n\"教育.香港\",\n\"政府.香港\",\n\"個人.香港\",\n\"網絡.香港\",\n\"組織.香港\",\n\"ಭಾರತ\",\n\"ଭାରତ\",\n\"ভাৰত\",\n\"भारतम्\",\n\"भारोत\",\n\"ڀارت\",\n\"ഭാരതം\",\n\"भारत\",\n\"بارت\",\n\"بھارت\",\n\"భారత్\",\n\"ભારત\",\n\"ਭਾਰਤ\",\n\"ভারত\",\n\"இந்தியா\",\n\"ایران\",\n\"ايران\",\n\"عراق\",\n\"الاردن\",\n\"한국\",\n\"қаз\",\n\"ລາວ\",\n\"ලංකා\",\n\"இலங்கை\",\n\"المغرب\",\n\"мкд\",\n\"мон\",\n\"澳門\",\n\"澳门\",\n\"مليسيا\",\n\"عمان\",\n\"پاکستان\",\n\"پاكستان\",\n\"فلسطين\",\n\"срб\",\n\"пр.срб\",\n\"орг.срб\",\n\"обр.срб\",\n\"од.срб\",\n\"упр.срб\",\n\"ак.срб\",\n\"рф\",\n\"قطر\",\n\"السعودية\",\n\"السعودیة\",\n\"السعودیۃ\",\n\"السعوديه\",\n\"سودان\",\n\"新加坡\",\n\"சிங்கப்பூர்\",\n\"سورية\",\n\"سوريا\",\n\"ไทย\",\n\"ศึกษา.ไทย\",\n\"ธุรกิจ.ไทย\",\n\"รัฐบาล.ไทย\",\n\"ทหาร.ไทย\",\n\"เน็ต.ไทย\",\n\"องค์กร.ไทย\",\n\"تونس\",\n\"台灣\",\n\"台湾\",\n\"臺灣\",\n\"укр\",\n\"اليمن\",\n\"xxx\",\n\"ye\",\n\"com.ye\",\n\"edu.ye\",\n\"gov.ye\",\n\"net.ye\",\n\"mil.ye\",\n\"org.ye\",\n\"ac.za\",\n\"agric.za\",\n\"alt.za\",\n\"co.za\",\n\"edu.za\",\n\"gov.za\",\n\"grondar.za\",\n\"law.za\",\n\"mil.za\",\n\"net.za\",\n\"ngo.za\",\n\"nic.za\",\n\"nis.za\",\n\"nom.za\",\n\"org.za\",\n\"school.za\",\n\"tm.za\",\n\"web.za\",\n\"zm\",\n\"ac.zm\",\n\"biz.zm\",\n\"co.zm\",\n\"com.zm\",\n\"edu.zm\",\n\"gov.zm\",\n\"info.zm\",\n\"mil.zm\",\n\"net.zm\",\n\"org.zm\",\n\"sch.zm\",\n\"zw\",\n\"ac.zw\",\n\"co.zw\",\n\"gov.zw\",\n\"mil.zw\",\n\"org.zw\",\n\"aaa\",\n\"aarp\",\n\"abarth\",\n\"abb\",\n\"abbott\",\n\"abbvie\",\n\"abc\",\n\"able\",\n\"abogado\",\n\"abudhabi\",\n\"academy\",\n\"accenture\",\n\"accountant\",\n\"accountants\",\n\"aco\",\n\"actor\",\n\"adac\",\n\"ads\",\n\"adult\",\n\"aeg\",\n\"aetna\",\n\"afl\",\n\"africa\",\n\"agakhan\",\n\"agency\",\n\"aig\",\n\"airbus\",\n\"airforce\",\n\"airtel\",\n\"akdn\",\n\"alfaromeo\",\n\"alibaba\",\n\"alipay\",\n\"allfinanz\",\n\"allstate\",\n\"ally\",\n\"alsace\",\n\"alstom\",\n\"amazon\",\n\"americanexpress\",\n\"americanfamily\",\n\"amex\",\n\"amfam\",\n\"amica\",\n\"amsterdam\",\n\"analytics\",\n\"android\",\n\"anquan\",\n\"anz\",\n\"aol\",\n\"apartments\",\n\"app\",\n\"apple\",\n\"aquarelle\",\n\"arab\",\n\"aramco\",\n\"archi\",\n\"army\",\n\"art\",\n\"arte\",\n\"asda\",\n\"associates\",\n\"athleta\",\n\"attorney\",\n\"auction\",\n\"audi\",\n\"audible\",\n\"audio\",\n\"auspost\",\n\"author\",\n\"auto\",\n\"autos\",\n\"avianca\",\n\"aws\",\n\"axa\",\n\"azure\",\n\"baby\",\n\"baidu\",\n\"banamex\",\n\"bananarepublic\",\n\"band\",\n\"bank\",\n\"bar\",\n\"barcelona\",\n\"barclaycard\",\n\"barclays\",\n\"barefoot\",\n\"bargains\",\n\"baseball\",\n\"basketball\",\n\"bauhaus\",\n\"bayern\",\n\"bbc\",\n\"bbt\",\n\"bbva\",\n\"bcg\",\n\"bcn\",\n\"beats\",\n\"beauty\",\n\"beer\",\n\"bentley\",\n\"berlin\",\n\"best\",\n\"bestbuy\",\n\"bet\",\n\"bharti\",\n\"bible\",\n\"bid\",\n\"bike\",\n\"bing\",\n\"bingo\",\n\"bio\",\n\"black\",\n\"blackfriday\",\n\"blockbuster\",\n\"blog\",\n\"bloomberg\",\n\"blue\",\n\"bms\",\n\"bmw\",\n\"bnpparibas\",\n\"boats\",\n\"boehringer\",\n\"bofa\",\n\"bom\",\n\"bond\",\n\"boo\",\n\"book\",\n\"booking\",\n\"bosch\",\n\"bostik\",\n\"boston\",\n\"bot\",\n\"boutique\",\n\"box\",\n\"bradesco\",\n\"bridgestone\",\n\"broadway\",\n\"broker\",\n\"brother\",\n\"brussels\",\n\"bugatti\",\n\"build\",\n\"builders\",\n\"business\",\n\"buy\",\n\"buzz\",\n\"bzh\",\n\"cab\",\n\"cafe\",\n\"cal\",\n\"call\",\n\"calvinklein\",\n\"cam\",\n\"camera\",\n\"camp\",\n\"cancerresearch\",\n\"canon\",\n\"capetown\",\n\"capital\",\n\"capitalone\",\n\"car\",\n\"caravan\",\n\"cards\",\n\"care\",\n\"career\",\n\"careers\",\n\"cars\",\n\"casa\",\n\"case\",\n\"cash\",\n\"casino\",\n\"catering\",\n\"catholic\",\n\"cba\",\n\"cbn\",\n\"cbre\",\n\"cbs\",\n\"center\",\n\"ceo\",\n\"cern\",\n\"cfa\",\n\"cfd\",\n\"chanel\",\n\"channel\",\n\"charity\",\n\"chase\",\n\"chat\",\n\"cheap\",\n\"chintai\",\n\"christmas\",\n\"chrome\",\n\"church\",\n\"cipriani\",\n\"circle\",\n\"cisco\",\n\"citadel\",\n\"citi\",\n\"citic\",\n\"city\",\n\"cityeats\",\n\"claims\",\n\"cleaning\",\n\"click\",\n\"clinic\",\n\"clinique\",\n\"clothing\",\n\"cloud\",\n\"club\",\n\"clubmed\",\n\"coach\",\n\"codes\",\n\"coffee\",\n\"college\",\n\"cologne\",\n\"comcast\",\n\"commbank\",\n\"community\",\n\"company\",\n\"compare\",\n\"computer\",\n\"comsec\",\n\"condos\",\n\"construction\",\n\"consulting\",\n\"contact\",\n\"contractors\",\n\"cooking\",\n\"cookingchannel\",\n\"cool\",\n\"corsica\",\n\"country\",\n\"coupon\",\n\"coupons\",\n\"courses\",\n\"cpa\",\n\"credit\",\n\"creditcard\",\n\"creditunion\",\n\"cricket\",\n\"crown\",\n\"crs\",\n\"cruise\",\n\"cruises\",\n\"cuisinella\",\n\"cymru\",\n\"cyou\",\n\"dabur\",\n\"dad\",\n\"dance\",\n\"data\",\n\"date\",\n\"dating\",\n\"datsun\",\n\"day\",\n\"dclk\",\n\"dds\",\n\"deal\",\n\"dealer\",\n\"deals\",\n\"degree\",\n\"delivery\",\n\"dell\",\n\"deloitte\",\n\"delta\",\n\"democrat\",\n\"dental\",\n\"dentist\",\n\"desi\",\n\"design\",\n\"dev\",\n\"dhl\",\n\"diamonds\",\n\"diet\",\n\"digital\",\n\"direct\",\n\"directory\",\n\"discount\",\n\"discover\",\n\"dish\",\n\"diy\",\n\"dnp\",\n\"docs\",\n\"doctor\",\n\"dog\",\n\"domains\",\n\"dot\",\n\"download\",\n\"drive\",\n\"dtv\",\n\"dubai\",\n\"dunlop\",\n\"dupont\",\n\"durban\",\n\"dvag\",\n\"dvr\",\n\"earth\",\n\"eat\",\n\"eco\",\n\"edeka\",\n\"education\",\n\"email\",\n\"emerck\",\n\"energy\",\n\"engineer\",\n\"engineering\",\n\"enterprises\",\n\"epson\",\n\"equipment\",\n\"ericsson\",\n\"erni\",\n\"esq\",\n\"estate\",\n\"etisalat\",\n\"eurovision\",\n\"eus\",\n\"events\",\n\"exchange\",\n\"expert\",\n\"exposed\",\n\"express\",\n\"extraspace\",\n\"fage\",\n\"fail\",\n\"fairwinds\",\n\"faith\",\n\"family\",\n\"fan\",\n\"fans\",\n\"farm\",\n\"farmers\",\n\"fashion\",\n\"fast\",\n\"fedex\",\n\"feedback\",\n\"ferrari\",\n\"ferrero\",\n\"fiat\",\n\"fidelity\",\n\"fido\",\n\"film\",\n\"final\",\n\"finance\",\n\"financial\",\n\"fire\",\n\"firestone\",\n\"firmdale\",\n\"fish\",\n\"fishing\",\n\"fit\",\n\"fitness\",\n\"flickr\",\n\"flights\",\n\"flir\",\n\"florist\",\n\"flowers\",\n\"fly\",\n\"foo\",\n\"food\",\n\"foodnetwork\",\n\"football\",\n\"ford\",\n\"forex\",\n\"forsale\",\n\"forum\",\n\"foundation\",\n\"fox\",\n\"free\",\n\"fresenius\",\n\"frl\",\n\"frogans\",\n\"frontdoor\",\n\"frontier\",\n\"ftr\",\n\"fujitsu\",\n\"fun\",\n\"fund\",\n\"furniture\",\n\"futbol\",\n\"fyi\",\n\"gal\",\n\"gallery\",\n\"gallo\",\n\"gallup\",\n\"game\",\n\"games\",\n\"gap\",\n\"garden\",\n\"gay\",\n\"gbiz\",\n\"gdn\",\n\"gea\",\n\"gent\",\n\"genting\",\n\"george\",\n\"ggee\",\n\"gift\",\n\"gifts\",\n\"gives\",\n\"giving\",\n\"glass\",\n\"gle\",\n\"global\",\n\"globo\",\n\"gmail\",\n\"gmbh\",\n\"gmo\",\n\"gmx\",\n\"godaddy\",\n\"gold\",\n\"goldpoint\",\n\"golf\",\n\"goo\",\n\"goodyear\",\n\"goog\",\n\"google\",\n\"gop\",\n\"got\",\n\"grainger\",\n\"graphics\",\n\"gratis\",\n\"green\",\n\"gripe\",\n\"grocery\",\n\"group\",\n\"guardian\",\n\"gucci\",\n\"guge\",\n\"guide\",\n\"guitars\",\n\"guru\",\n\"hair\",\n\"hamburg\",\n\"hangout\",\n\"haus\",\n\"hbo\",\n\"hdfc\",\n\"hdfcbank\",\n\"health\",\n\"healthcare\",\n\"help\",\n\"helsinki\",\n\"here\",\n\"hermes\",\n\"hgtv\",\n\"hiphop\",\n\"hisamitsu\",\n\"hitachi\",\n\"hiv\",\n\"hkt\",\n\"hockey\",\n\"holdings\",\n\"holiday\",\n\"homedepot\",\n\"homegoods\",\n\"homes\",\n\"homesense\",\n\"honda\",\n\"horse\",\n\"hospital\",\n\"host\",\n\"hosting\",\n\"hot\",\n\"hoteles\",\n\"hotels\",\n\"hotmail\",\n\"house\",\n\"how\",\n\"hsbc\",\n\"hughes\",\n\"hyatt\",\n\"hyundai\",\n\"ibm\",\n\"icbc\",\n\"ice\",\n\"icu\",\n\"ieee\",\n\"ifm\",\n\"ikano\",\n\"imamat\",\n\"imdb\",\n\"immo\",\n\"immobilien\",\n\"inc\",\n\"industries\",\n\"infiniti\",\n\"ing\",\n\"ink\",\n\"institute\",\n\"insurance\",\n\"insure\",\n\"international\",\n\"intuit\",\n\"investments\",\n\"ipiranga\",\n\"irish\",\n\"ismaili\",\n\"ist\",\n\"istanbul\",\n\"itau\",\n\"itv\",\n\"jaguar\",\n\"java\",\n\"jcb\",\n\"jeep\",\n\"jetzt\",\n\"jewelry\",\n\"jio\",\n\"jll\",\n\"jmp\",\n\"jnj\",\n\"joburg\",\n\"jot\",\n\"joy\",\n\"jpmorgan\",\n\"jprs\",\n\"juegos\",\n\"juniper\",\n\"kaufen\",\n\"kddi\",\n\"kerryhotels\",\n\"kerrylogistics\",\n\"kerryproperties\",\n\"kfh\",\n\"kia\",\n\"kids\",\n\"kim\",\n\"kinder\",\n\"kindle\",\n\"kitchen\",\n\"kiwi\",\n\"koeln\",\n\"komatsu\",\n\"kosher\",\n\"kpmg\",\n\"kpn\",\n\"krd\",\n\"kred\",\n\"kuokgroup\",\n\"kyoto\",\n\"lacaixa\",\n\"lamborghini\",\n\"lamer\",\n\"lancaster\",\n\"lancia\",\n\"land\",\n\"landrover\",\n\"lanxess\",\n\"lasalle\",\n\"lat\",\n\"latino\",\n\"latrobe\",\n\"law\",\n\"lawyer\",\n\"lds\",\n\"lease\",\n\"leclerc\",\n\"lefrak\",\n\"legal\",\n\"lego\",\n\"lexus\",\n\"lgbt\",\n\"lidl\",\n\"life\",\n\"lifeinsurance\",\n\"lifestyle\",\n\"lighting\",\n\"like\",\n\"lilly\",\n\"limited\",\n\"limo\",\n\"lincoln\",\n\"linde\",\n\"link\",\n\"lipsy\",\n\"live\",\n\"living\",\n\"llc\",\n\"llp\",\n\"loan\",\n\"loans\",\n\"locker\",\n\"locus\",\n\"loft\",\n\"lol\",\n\"london\",\n\"lotte\",\n\"lotto\",\n\"love\",\n\"lpl\",\n\"lplfinancial\",\n\"ltd\",\n\"ltda\",\n\"lundbeck\",\n\"luxe\",\n\"luxury\",\n\"macys\",\n\"madrid\",\n\"maif\",\n\"maison\",\n\"makeup\",\n\"man\",\n\"management\",\n\"mango\",\n\"map\",\n\"market\",\n\"marketing\",\n\"markets\",\n\"marriott\",\n\"marshalls\",\n\"maserati\",\n\"mattel\",\n\"mba\",\n\"mckinsey\",\n\"med\",\n\"media\",\n\"meet\",\n\"melbourne\",\n\"meme\",\n\"memorial\",\n\"men\",\n\"menu\",\n\"merckmsd\",\n\"miami\",\n\"microsoft\",\n\"mini\",\n\"mint\",\n\"mit\",\n\"mitsubishi\",\n\"mlb\",\n\"mls\",\n\"mma\",\n\"mobile\",\n\"moda\",\n\"moe\",\n\"moi\",\n\"mom\",\n\"monash\",\n\"money\",\n\"monster\",\n\"mormon\",\n\"mortgage\",\n\"moscow\",\n\"moto\",\n\"motorcycles\",\n\"mov\",\n\"movie\",\n\"msd\",\n\"mtn\",\n\"mtr\",\n\"music\",\n\"mutual\",\n\"nab\",\n\"nagoya\",\n\"natura\",\n\"navy\",\n\"nba\",\n\"nec\",\n\"netbank\",\n\"netflix\",\n\"network\",\n\"neustar\",\n\"new\",\n\"news\",\n\"next\",\n\"nextdirect\",\n\"nexus\",\n\"nfl\",\n\"ngo\",\n\"nhk\",\n\"nico\",\n\"nike\",\n\"nikon\",\n\"ninja\",\n\"nissan\",\n\"nissay\",\n\"nokia\",\n\"northwesternmutual\",\n\"norton\",\n\"now\",\n\"nowruz\",\n\"nowtv\",\n\"nra\",\n\"nrw\",\n\"ntt\",\n\"nyc\",\n\"obi\",\n\"observer\",\n\"office\",\n\"okinawa\",\n\"olayan\",\n\"olayangroup\",\n\"oldnavy\",\n\"ollo\",\n\"omega\",\n\"one\",\n\"ong\",\n\"onl\",\n\"online\",\n\"ooo\",\n\"open\",\n\"oracle\",\n\"orange\",\n\"organic\",\n\"origins\",\n\"osaka\",\n\"otsuka\",\n\"ott\",\n\"ovh\",\n\"page\",\n\"panasonic\",\n\"paris\",\n\"pars\",\n\"partners\",\n\"parts\",\n\"party\",\n\"passagens\",\n\"pay\",\n\"pccw\",\n\"pet\",\n\"pfizer\",\n\"pharmacy\",\n\"phd\",\n\"philips\",\n\"phone\",\n\"photo\",\n\"photography\",\n\"photos\",\n\"physio\",\n\"pics\",\n\"pictet\",\n\"pictures\",\n\"pid\",\n\"pin\",\n\"ping\",\n\"pink\",\n\"pioneer\",\n\"pizza\",\n\"place\",\n\"play\",\n\"playstation\",\n\"plumbing\",\n\"plus\",\n\"pnc\",\n\"pohl\",\n\"poker\",\n\"politie\",\n\"porn\",\n\"pramerica\",\n\"praxi\",\n\"press\",\n\"prime\",\n\"prod\",\n\"productions\",\n\"prof\",\n\"progressive\",\n\"promo\",\n\"properties\",\n\"property\",\n\"protection\",\n\"pru\",\n\"prudential\",\n\"pub\",\n\"pwc\",\n\"qpon\",\n\"quebec\",\n\"quest\",\n\"racing\",\n\"radio\",\n\"read\",\n\"realestate\",\n\"realtor\",\n\"realty\",\n\"recipes\",\n\"red\",\n\"redstone\",\n\"redumbrella\",\n\"rehab\",\n\"reise\",\n\"reisen\",\n\"reit\",\n\"reliance\",\n\"ren\",\n\"rent\",\n\"rentals\",\n\"repair\",\n\"report\",\n\"republican\",\n\"rest\",\n\"restaurant\",\n\"review\",\n\"reviews\",\n\"rexroth\",\n\"rich\",\n\"richardli\",\n\"ricoh\",\n\"ril\",\n\"rio\",\n\"rip\",\n\"rocher\",\n\"rocks\",\n\"rodeo\",\n\"rogers\",\n\"room\",\n\"rsvp\",\n\"rugby\",\n\"ruhr\",\n\"run\",\n\"rwe\",\n\"ryukyu\",\n\"saarland\",\n\"safe\",\n\"safety\",\n\"sakura\",\n\"sale\",\n\"salon\",\n\"samsclub\",\n\"samsung\",\n\"sandvik\",\n\"sandvikcoromant\",\n\"sanofi\",\n\"sap\",\n\"sarl\",\n\"sas\",\n\"save\",\n\"saxo\",\n\"sbi\",\n\"sbs\",\n\"sca\",\n\"scb\",\n\"schaeffler\",\n\"schmidt\",\n\"scholarships\",\n\"school\",\n\"schule\",\n\"schwarz\",\n\"science\",\n\"scot\",\n\"search\",\n\"seat\",\n\"secure\",\n\"security\",\n\"seek\",\n\"select\",\n\"sener\",\n\"services\",\n\"ses\",\n\"seven\",\n\"sew\",\n\"sex\",\n\"sexy\",\n\"sfr\",\n\"shangrila\",\n\"sharp\",\n\"shaw\",\n\"shell\",\n\"shia\",\n\"shiksha\",\n\"shoes\",\n\"shop\",\n\"shopping\",\n\"shouji\",\n\"show\",\n\"showtime\",\n\"silk\",\n\"sina\",\n\"singles\",\n\"site\",\n\"ski\",\n\"skin\",\n\"sky\",\n\"skype\",\n\"sling\",\n\"smart\",\n\"smile\",\n\"sncf\",\n\"soccer\",\n\"social\",\n\"softbank\",\n\"software\",\n\"sohu\",\n\"solar\",\n\"solutions\",\n\"song\",\n\"sony\",\n\"soy\",\n\"spa\",\n\"space\",\n\"sport\",\n\"spot\",\n\"srl\",\n\"stada\",\n\"staples\",\n\"star\",\n\"statebank\",\n\"statefarm\",\n\"stc\",\n\"stcgroup\",\n\"stockholm\",\n\"storage\",\n\"store\",\n\"stream\",\n\"studio\",\n\"study\",\n\"style\",\n\"sucks\",\n\"supplies\",\n\"supply\",\n\"support\",\n\"surf\",\n\"surgery\",\n\"suzuki\",\n\"swatch\",\n\"swiss\",\n\"sydney\",\n\"systems\",\n\"tab\",\n\"taipei\",\n\"talk\",\n\"taobao\",\n\"target\",\n\"tatamotors\",\n\"tatar\",\n\"tattoo\",\n\"tax\",\n\"taxi\",\n\"tci\",\n\"tdk\",\n\"team\",\n\"tech\",\n\"technology\",\n\"temasek\",\n\"tennis\",\n\"teva\",\n\"thd\",\n\"theater\",\n\"theatre\",\n\"tiaa\",\n\"tickets\",\n\"tienda\",\n\"tiffany\",\n\"tips\",\n\"tires\",\n\"tirol\",\n\"tjmaxx\",\n\"tjx\",\n\"tkmaxx\",\n\"tmall\",\n\"today\",\n\"tokyo\",\n\"tools\",\n\"top\",\n\"toray\",\n\"toshiba\",\n\"total\",\n\"tours\",\n\"town\",\n\"toyota\",\n\"toys\",\n\"trade\",\n\"trading\",\n\"training\",\n\"travel\",\n\"travelchannel\",\n\"travelers\",\n\"travelersinsurance\",\n\"trust\",\n\"trv\",\n\"tube\",\n\"tui\",\n\"tunes\",\n\"tushu\",\n\"tvs\",\n\"ubank\",\n\"ubs\",\n\"unicom\",\n\"university\",\n\"uno\",\n\"uol\",\n\"ups\",\n\"vacations\",\n\"vana\",\n\"vanguard\",\n\"vegas\",\n\"ventures\",\n\"verisign\",\n\"versicherung\",\n\"vet\",\n\"viajes\",\n\"video\",\n\"vig\",\n\"viking\",\n\"villas\",\n\"vin\",\n\"vip\",\n\"virgin\",\n\"visa\",\n\"vision\",\n\"viva\",\n\"vivo\",\n\"vlaanderen\",\n\"vodka\",\n\"volkswagen\",\n\"volvo\",\n\"vote\",\n\"voting\",\n\"voto\",\n\"voyage\",\n\"vuelos\",\n\"wales\",\n\"walmart\",\n\"walter\",\n\"wang\",\n\"wanggou\",\n\"watch\",\n\"watches\",\n\"weather\",\n\"weatherchannel\",\n\"webcam\",\n\"weber\",\n\"website\",\n\"wedding\",\n\"weibo\",\n\"weir\",\n\"whoswho\",\n\"wien\",\n\"wiki\",\n\"williamhill\",\n\"win\",\n\"windows\",\n\"wine\",\n\"winners\",\n\"wme\",\n\"wolterskluwer\",\n\"woodside\",\n\"work\",\n\"works\",\n\"world\",\n\"wow\",\n\"wtc\",\n\"wtf\",\n\"xbox\",\n\"xerox\",\n\"xfinity\",\n\"xihuan\",\n\"xin\",\n\"कॉम\",\n\"セール\",\n\"佛山\",\n\"慈善\",\n\"集团\",\n\"在线\",\n\"点看\",\n\"คอม\",\n\"八卦\",\n\"موقع\",\n\"公益\",\n\"公司\",\n\"香格里拉\",\n\"网站\",\n\"移动\",\n\"我爱你\",\n\"москва\",\n\"католик\",\n\"онлайн\",\n\"сайт\",\n\"联通\",\n\"קום\",\n\"时尚\",\n\"微博\",\n\"淡马锡\",\n\"ファッション\",\n\"орг\",\n\"नेट\",\n\"ストア\",\n\"アマゾン\",\n\"삼성\",\n\"商标\",\n\"商店\",\n\"商城\",\n\"дети\",\n\"ポイント\",\n\"新闻\",\n\"家電\",\n\"كوم\",\n\"中文网\",\n\"中信\",\n\"娱乐\",\n\"谷歌\",\n\"電訊盈科\",\n\"购物\",\n\"クラウド\",\n\"通販\",\n\"网店\",\n\"संगठन\",\n\"餐厅\",\n\"网络\",\n\"ком\",\n\"亚马逊\",\n\"诺基亚\",\n\"食品\",\n\"飞利浦\",\n\"手机\",\n\"ارامكو\",\n\"العليان\",\n\"اتصالات\",\n\"بازار\",\n\"ابوظبي\",\n\"كاثوليك\",\n\"همراه\",\n\"닷컴\",\n\"政府\",\n\"شبكة\",\n\"بيتك\",\n\"عرب\",\n\"机构\",\n\"组织机构\",\n\"健康\",\n\"招聘\",\n\"рус\",\n\"大拿\",\n\"みんな\",\n\"グーグル\",\n\"世界\",\n\"書籍\",\n\"网址\",\n\"닷넷\",\n\"コム\",\n\"天主教\",\n\"游戏\",\n\"vermögensberater\",\n\"vermögensberatung\",\n\"企业\",\n\"信息\",\n\"嘉里大酒店\",\n\"嘉里\",\n\"广东\",\n\"政务\",\n\"xyz\",\n\"yachts\",\n\"yahoo\",\n\"yamaxun\",\n\"yandex\",\n\"yodobashi\",\n\"yoga\",\n\"yokohama\",\n\"you\",\n\"youtube\",\n\"yun\",\n\"zappos\",\n\"zara\",\n\"zero\",\n\"zip\",\n\"zone\",\n\"zuerich\",\n\"cc.ua\",\n\"inf.ua\",\n\"ltd.ua\",\n\"611.to\",\n\"graphox.us\",\n\"*.devcdnaccesso.com\",\n\"adobeaemcloud.com\",\n\"*.dev.adobeaemcloud.com\",\n\"hlx.live\",\n\"adobeaemcloud.net\",\n\"hlx.page\",\n\"hlx3.page\",\n\"beep.pl\",\n\"airkitapps.com\",\n\"airkitapps-au.com\",\n\"airkitapps.eu\",\n\"aivencloud.com\",\n\"barsy.ca\",\n\"*.compute.estate\",\n\"*.alces.network\",\n\"kasserver.com\",\n\"altervista.org\",\n\"alwaysdata.net\",\n\"cloudfront.net\",\n\"*.compute.amazonaws.com\",\n\"*.compute-1.amazonaws.com\",\n\"*.compute.amazonaws.com.cn\",\n\"us-east-1.amazonaws.com\",\n\"cn-north-1.eb.amazonaws.com.cn\",\n\"cn-northwest-1.eb.amazonaws.com.cn\",\n\"elasticbeanstalk.com\",\n\"ap-northeast-1.elasticbeanstalk.com\",\n\"ap-northeast-2.elasticbeanstalk.com\",\n\"ap-northeast-3.elasticbeanstalk.com\",\n\"ap-south-1.elasticbeanstalk.com\",\n\"ap-southeast-1.elasticbeanstalk.com\",\n\"ap-southeast-2.elasticbeanstalk.com\",\n\"ca-central-1.elasticbeanstalk.com\",\n\"eu-central-1.elasticbeanstalk.com\",\n\"eu-west-1.elasticbeanstalk.com\",\n\"eu-west-2.elasticbeanstalk.com\",\n\"eu-west-3.elasticbeanstalk.com\",\n\"sa-east-1.elasticbeanstalk.com\",\n\"us-east-1.elasticbeanstalk.com\",\n\"us-east-2.elasticbeanstalk.com\",\n\"us-gov-west-1.elasticbeanstalk.com\",\n\"us-west-1.elasticbeanstalk.com\",\n\"us-west-2.elasticbeanstalk.com\",\n\"*.elb.amazonaws.com\",\n\"*.elb.amazonaws.com.cn\",\n\"awsglobalaccelerator.com\",\n\"s3.amazonaws.com\",\n\"s3-ap-northeast-1.amazonaws.com\",\n\"s3-ap-northeast-2.amazonaws.com\",\n\"s3-ap-south-1.amazonaws.com\",\n\"s3-ap-southeast-1.amazonaws.com\",\n\"s3-ap-southeast-2.amazonaws.com\",\n\"s3-ca-central-1.amazonaws.com\",\n\"s3-eu-central-1.amazonaws.com\",\n\"s3-eu-west-1.amazonaws.com\",\n\"s3-eu-west-2.amazonaws.com\",\n\"s3-eu-west-3.amazonaws.com\",\n\"s3-external-1.amazonaws.com\",\n\"s3-fips-us-gov-west-1.amazonaws.com\",\n\"s3-sa-east-1.amazonaws.com\",\n\"s3-us-gov-west-1.amazonaws.com\",\n\"s3-us-east-2.amazonaws.com\",\n\"s3-us-west-1.amazonaws.com\",\n\"s3-us-west-2.amazonaws.com\",\n\"s3.ap-northeast-2.amazonaws.com\",\n\"s3.ap-south-1.amazonaws.com\",\n\"s3.cn-north-1.amazonaws.com.cn\",\n\"s3.ca-central-1.amazonaws.com\",\n\"s3.eu-central-1.amazonaws.com\",\n\"s3.eu-west-2.amazonaws.com\",\n\"s3.eu-west-3.amazonaws.com\",\n\"s3.us-east-2.amazonaws.com\",\n\"s3.dualstack.ap-northeast-1.amazonaws.com\",\n\"s3.dualstack.ap-northeast-2.amazonaws.com\",\n\"s3.dualstack.ap-south-1.amazonaws.com\",\n\"s3.dualstack.ap-southeast-1.amazonaws.com\",\n\"s3.dualstack.ap-southeast-2.amazonaws.com\",\n\"s3.dualstack.ca-central-1.amazonaws.com\",\n\"s3.dualstack.eu-central-1.amazonaws.com\",\n\"s3.dualstack.eu-west-1.amazonaws.com\",\n\"s3.dualstack.eu-west-2.amazonaws.com\",\n\"s3.dualstack.eu-west-3.amazonaws.com\",\n\"s3.dualstack.sa-east-1.amazonaws.com\",\n\"s3.dualstack.us-east-1.amazonaws.com\",\n\"s3.dualstack.us-east-2.amazonaws.com\",\n\"s3-website-us-east-1.amazonaws.com\",\n\"s3-website-us-west-1.amazonaws.com\",\n\"s3-website-us-west-2.amazonaws.com\",\n\"s3-website-ap-northeast-1.amazonaws.com\",\n\"s3-website-ap-southeast-1.amazonaws.com\",\n\"s3-website-ap-southeast-2.amazonaws.com\",\n\"s3-website-eu-west-1.amazonaws.com\",\n\"s3-website-sa-east-1.amazonaws.com\",\n\"s3-website.ap-northeast-2.amazonaws.com\",\n\"s3-website.ap-south-1.amazonaws.com\",\n\"s3-website.ca-central-1.amazonaws.com\",\n\"s3-website.eu-central-1.amazonaws.com\",\n\"s3-website.eu-west-2.amazonaws.com\",\n\"s3-website.eu-west-3.amazonaws.com\",\n\"s3-website.us-east-2.amazonaws.com\",\n\"t3l3p0rt.net\",\n\"tele.amune.org\",\n\"apigee.io\",\n\"siiites.com\",\n\"appspacehosted.com\",\n\"appspaceusercontent.com\",\n\"appudo.net\",\n\"on-aptible.com\",\n\"user.aseinet.ne.jp\",\n\"gv.vc\",\n\"d.gv.vc\",\n\"user.party.eus\",\n\"pimienta.org\",\n\"poivron.org\",\n\"potager.org\",\n\"sweetpepper.org\",\n\"myasustor.com\",\n\"cdn.prod.atlassian-dev.net\",\n\"translated.page\",\n\"myfritz.net\",\n\"onavstack.net\",\n\"*.awdev.ca\",\n\"*.advisor.ws\",\n\"ecommerce-shop.pl\",\n\"b-data.io\",\n\"backplaneapp.io\",\n\"balena-devices.com\",\n\"rs.ba\",\n\"*.banzai.cloud\",\n\"app.banzaicloud.io\",\n\"*.backyards.banzaicloud.io\",\n\"base.ec\",\n\"official.ec\",\n\"buyshop.jp\",\n\"fashionstore.jp\",\n\"handcrafted.jp\",\n\"kawaiishop.jp\",\n\"supersale.jp\",\n\"theshop.jp\",\n\"shopselect.net\",\n\"base.shop\",\n\"*.beget.app\",\n\"betainabox.com\",\n\"bnr.la\",\n\"bitbucket.io\",\n\"blackbaudcdn.net\",\n\"of.je\",\n\"bluebite.io\",\n\"boomla.net\",\n\"boutir.com\",\n\"boxfuse.io\",\n\"square7.ch\",\n\"bplaced.com\",\n\"bplaced.de\",\n\"square7.de\",\n\"bplaced.net\",\n\"square7.net\",\n\"shop.brendly.rs\",\n\"browsersafetymark.io\",\n\"uk0.bigv.io\",\n\"dh.bytemark.co.uk\",\n\"vm.bytemark.co.uk\",\n\"cafjs.com\",\n\"mycd.eu\",\n\"drr.ac\",\n\"uwu.ai\",\n\"carrd.co\",\n\"crd.co\",\n\"ju.mp\",\n\"ae.org\",\n\"br.com\",\n\"cn.com\",\n\"com.de\",\n\"com.se\",\n\"de.com\",\n\"eu.com\",\n\"gb.net\",\n\"hu.net\",\n\"jp.net\",\n\"jpn.com\",\n\"mex.com\",\n\"ru.com\",\n\"sa.com\",\n\"se.net\",\n\"uk.com\",\n\"uk.net\",\n\"us.com\",\n\"za.bz\",\n\"za.com\",\n\"ar.com\",\n\"hu.com\",\n\"kr.com\",\n\"no.com\",\n\"qc.com\",\n\"uy.com\",\n\"africa.com\",\n\"gr.com\",\n\"in.net\",\n\"web.in\",\n\"us.org\",\n\"co.com\",\n\"aus.basketball\",\n\"nz.basketball\",\n\"radio.am\",\n\"radio.fm\",\n\"c.la\",\n\"certmgr.org\",\n\"cx.ua\",\n\"discourse.group\",\n\"discourse.team\",\n\"cleverapps.io\",\n\"clerk.app\",\n\"clerkstage.app\",\n\"*.lcl.dev\",\n\"*.lclstage.dev\",\n\"*.stg.dev\",\n\"*.stgstage.dev\",\n\"clickrising.net\",\n\"c66.me\",\n\"cloud66.ws\",\n\"cloud66.zone\",\n\"jdevcloud.com\",\n\"wpdevcloud.com\",\n\"cloudaccess.host\",\n\"freesite.host\",\n\"cloudaccess.net\",\n\"cloudcontrolled.com\",\n\"cloudcontrolapp.com\",\n\"*.cloudera.site\",\n\"pages.dev\",\n\"trycloudflare.com\",\n\"workers.dev\",\n\"wnext.app\",\n\"co.ca\",\n\"*.otap.co\",\n\"co.cz\",\n\"c.cdn77.org\",\n\"cdn77-ssl.net\",\n\"r.cdn77.net\",\n\"rsc.cdn77.org\",\n\"ssl.origin.cdn77-secure.org\",\n\"cloudns.asia\",\n\"cloudns.biz\",\n\"cloudns.club\",\n\"cloudns.cc\",\n\"cloudns.eu\",\n\"cloudns.in\",\n\"cloudns.info\",\n\"cloudns.org\",\n\"cloudns.pro\",\n\"cloudns.pw\",\n\"cloudns.us\",\n\"cnpy.gdn\",\n\"codeberg.page\",\n\"co.nl\",\n\"co.no\",\n\"webhosting.be\",\n\"hosting-cluster.nl\",\n\"ac.ru\",\n\"edu.ru\",\n\"gov.ru\",\n\"int.ru\",\n\"mil.ru\",\n\"test.ru\",\n\"dyn.cosidns.de\",\n\"dynamisches-dns.de\",\n\"dnsupdater.de\",\n\"internet-dns.de\",\n\"l-o-g-i-n.de\",\n\"dynamic-dns.info\",\n\"feste-ip.net\",\n\"knx-server.net\",\n\"static-access.net\",\n\"realm.cz\",\n\"*.cryptonomic.net\",\n\"cupcake.is\",\n\"curv.dev\",\n\"*.customer-oci.com\",\n\"*.oci.customer-oci.com\",\n\"*.ocp.customer-oci.com\",\n\"*.ocs.customer-oci.com\",\n\"cyon.link\",\n\"cyon.site\",\n\"fnwk.site\",\n\"folionetwork.site\",\n\"platform0.app\",\n\"daplie.me\",\n\"localhost.daplie.me\",\n\"dattolocal.com\",\n\"dattorelay.com\",\n\"dattoweb.com\",\n\"mydatto.com\",\n\"dattolocal.net\",\n\"mydatto.net\",\n\"biz.dk\",\n\"co.dk\",\n\"firm.dk\",\n\"reg.dk\",\n\"store.dk\",\n\"dyndns.dappnode.io\",\n\"*.dapps.earth\",\n\"*.bzz.dapps.earth\",\n\"builtwithdark.com\",\n\"demo.datadetect.com\",\n\"instance.datadetect.com\",\n\"edgestack.me\",\n\"ddns5.com\",\n\"debian.net\",\n\"deno.dev\",\n\"deno-staging.dev\",\n\"dedyn.io\",\n\"deta.app\",\n\"deta.dev\",\n\"*.rss.my.id\",\n\"*.diher.solutions\",\n\"discordsays.com\",\n\"discordsez.com\",\n\"jozi.biz\",\n\"dnshome.de\",\n\"online.th\",\n\"shop.th\",\n\"drayddns.com\",\n\"shoparena.pl\",\n\"dreamhosters.com\",\n\"mydrobo.com\",\n\"drud.io\",\n\"drud.us\",\n\"duckdns.org\",\n\"bip.sh\",\n\"bitbridge.net\",\n\"dy.fi\",\n\"tunk.org\",\n\"dyndns-at-home.com\",\n\"dyndns-at-work.com\",\n\"dyndns-blog.com\",\n\"dyndns-free.com\",\n\"dyndns-home.com\",\n\"dyndns-ip.com\",\n\"dyndns-mail.com\",\n\"dyndns-office.com\",\n\"dyndns-pics.com\",\n\"dyndns-remote.com\",\n\"dyndns-server.com\",\n\"dyndns-web.com\",\n\"dyndns-wiki.com\",\n\"dyndns-work.com\",\n\"dyndns.biz\",\n\"dyndns.info\",\n\"dyndns.org\",\n\"dyndns.tv\",\n\"at-band-camp.net\",\n\"ath.cx\",\n\"barrel-of-knowledge.info\",\n\"barrell-of-knowledge.info\",\n\"better-than.tv\",\n\"blogdns.com\",\n\"blogdns.net\",\n\"blogdns.org\",\n\"blogsite.org\",\n\"boldlygoingnowhere.org\",\n\"broke-it.net\",\n\"buyshouses.net\",\n\"cechire.com\",\n\"dnsalias.com\",\n\"dnsalias.net\",\n\"dnsalias.org\",\n\"dnsdojo.com\",\n\"dnsdojo.net\",\n\"dnsdojo.org\",\n\"does-it.net\",\n\"doesntexist.com\",\n\"doesntexist.org\",\n\"dontexist.com\",\n\"dontexist.net\",\n\"dontexist.org\",\n\"doomdns.com\",\n\"doomdns.org\",\n\"dvrdns.org\",\n\"dyn-o-saur.com\",\n\"dynalias.com\",\n\"dynalias.net\",\n\"dynalias.org\",\n\"dynathome.net\",\n\"dyndns.ws\",\n\"endofinternet.net\",\n\"endofinternet.org\",\n\"endoftheinternet.org\",\n\"est-a-la-maison.com\",\n\"est-a-la-masion.com\",\n\"est-le-patron.com\",\n\"est-mon-blogueur.com\",\n\"for-better.biz\",\n\"for-more.biz\",\n\"for-our.info\",\n\"for-some.biz\",\n\"for-the.biz\",\n\"forgot.her.name\",\n\"forgot.his.name\",\n\"from-ak.com\",\n\"from-al.com\",\n\"from-ar.com\",\n\"from-az.net\",\n\"from-ca.com\",\n\"from-co.net\",\n\"from-ct.com\",\n\"from-dc.com\",\n\"from-de.com\",\n\"from-fl.com\",\n\"from-ga.com\",\n\"from-hi.com\",\n\"from-ia.com\",\n\"from-id.com\",\n\"from-il.com\",\n\"from-in.com\",\n\"from-ks.com\",\n\"from-ky.com\",\n\"from-la.net\",\n\"from-ma.com\",\n\"from-md.com\",\n\"from-me.org\",\n\"from-mi.com\",\n\"from-mn.com\",\n\"from-mo.com\",\n\"from-ms.com\",\n\"from-mt.com\",\n\"from-nc.com\",\n\"from-nd.com\",\n\"from-ne.com\",\n\"from-nh.com\",\n\"from-nj.com\",\n\"from-nm.com\",\n\"from-nv.com\",\n\"from-ny.net\",\n\"from-oh.com\",\n\"from-ok.com\",\n\"from-or.com\",\n\"from-pa.com\",\n\"from-pr.com\",\n\"from-ri.com\",\n\"from-sc.com\",\n\"from-sd.com\",\n\"from-tn.com\",\n\"from-tx.com\",\n\"from-ut.com\",\n\"from-va.com\",\n\"from-vt.com\",\n\"from-wa.com\",\n\"from-wi.com\",\n\"from-wv.com\",\n\"from-wy.com\",\n\"ftpaccess.cc\",\n\"fuettertdasnetz.de\",\n\"game-host.org\",\n\"game-server.cc\",\n\"getmyip.com\",\n\"gets-it.net\",\n\"go.dyndns.org\",\n\"gotdns.com\",\n\"gotdns.org\",\n\"groks-the.info\",\n\"groks-this.info\",\n\"ham-radio-op.net\",\n\"here-for-more.info\",\n\"hobby-site.com\",\n\"hobby-site.org\",\n\"home.dyndns.org\",\n\"homedns.org\",\n\"homeftp.net\",\n\"homeftp.org\",\n\"homeip.net\",\n\"homelinux.com\",\n\"homelinux.net\",\n\"homelinux.org\",\n\"homeunix.com\",\n\"homeunix.net\",\n\"homeunix.org\",\n\"iamallama.com\",\n\"in-the-band.net\",\n\"is-a-anarchist.com\",\n\"is-a-blogger.com\",\n\"is-a-bookkeeper.com\",\n\"is-a-bruinsfan.org\",\n\"is-a-bulls-fan.com\",\n\"is-a-candidate.org\",\n\"is-a-caterer.com\",\n\"is-a-celticsfan.org\",\n\"is-a-chef.com\",\n\"is-a-chef.net\",\n\"is-a-chef.org\",\n\"is-a-conservative.com\",\n\"is-a-cpa.com\",\n\"is-a-cubicle-slave.com\",\n\"is-a-democrat.com\",\n\"is-a-designer.com\",\n\"is-a-doctor.com\",\n\"is-a-financialadvisor.com\",\n\"is-a-geek.com\",\n\"is-a-geek.net\",\n\"is-a-geek.org\",\n\"is-a-green.com\",\n\"is-a-guru.com\",\n\"is-a-hard-worker.com\",\n\"is-a-hunter.com\",\n\"is-a-knight.org\",\n\"is-a-landscaper.com\",\n\"is-a-lawyer.com\",\n\"is-a-liberal.com\",\n\"is-a-libertarian.com\",\n\"is-a-linux-user.org\",\n\"is-a-llama.com\",\n\"is-a-musician.com\",\n\"is-a-nascarfan.com\",\n\"is-a-nurse.com\",\n\"is-a-painter.com\",\n\"is-a-patsfan.org\",\n\"is-a-personaltrainer.com\",\n\"is-a-photographer.com\",\n\"is-a-player.com\",\n\"is-a-republican.com\",\n\"is-a-rockstar.com\",\n\"is-a-socialist.com\",\n\"is-a-soxfan.org\",\n\"is-a-student.com\",\n\"is-a-teacher.com\",\n\"is-a-techie.com\",\n\"is-a-therapist.com\",\n\"is-an-accountant.com\",\n\"is-an-actor.com\",\n\"is-an-actress.com\",\n\"is-an-anarchist.com\",\n\"is-an-artist.com\",\n\"is-an-engineer.com\",\n\"is-an-entertainer.com\",\n\"is-by.us\",\n\"is-certified.com\",\n\"is-found.org\",\n\"is-gone.com\",\n\"is-into-anime.com\",\n\"is-into-cars.com\",\n\"is-into-cartoons.com\",\n\"is-into-games.com\",\n\"is-leet.com\",\n\"is-lost.org\",\n\"is-not-certified.com\",\n\"is-saved.org\",\n\"is-slick.com\",\n\"is-uberleet.com\",\n\"is-very-bad.org\",\n\"is-very-evil.org\",\n\"is-very-good.org\",\n\"is-very-nice.org\",\n\"is-very-sweet.org\",\n\"is-with-theband.com\",\n\"isa-geek.com\",\n\"isa-geek.net\",\n\"isa-geek.org\",\n\"isa-hockeynut.com\",\n\"issmarterthanyou.com\",\n\"isteingeek.de\",\n\"istmein.de\",\n\"kicks-ass.net\",\n\"kicks-ass.org\",\n\"knowsitall.info\",\n\"land-4-sale.us\",\n\"lebtimnetz.de\",\n\"leitungsen.de\",\n\"likes-pie.com\",\n\"likescandy.com\",\n\"merseine.nu\",\n\"mine.nu\",\n\"misconfused.org\",\n\"mypets.ws\",\n\"myphotos.cc\",\n\"neat-url.com\",\n\"office-on-the.net\",\n\"on-the-web.tv\",\n\"podzone.net\",\n\"podzone.org\",\n\"readmyblog.org\",\n\"saves-the-whales.com\",\n\"scrapper-site.net\",\n\"scrapping.cc\",\n\"selfip.biz\",\n\"selfip.com\",\n\"selfip.info\",\n\"selfip.net\",\n\"selfip.org\",\n\"sells-for-less.com\",\n\"sells-for-u.com\",\n\"sells-it.net\",\n\"sellsyourhome.org\",\n\"servebbs.com\",\n\"servebbs.net\",\n\"servebbs.org\",\n\"serveftp.net\",\n\"serveftp.org\",\n\"servegame.org\",\n\"shacknet.nu\",\n\"simple-url.com\",\n\"space-to-rent.com\",\n\"stuff-4-sale.org\",\n\"stuff-4-sale.us\",\n\"teaches-yoga.com\",\n\"thruhere.net\",\n\"traeumtgerade.de\",\n\"webhop.biz\",\n\"webhop.info\",\n\"webhop.net\",\n\"webhop.org\",\n\"worse-than.tv\",\n\"writesthisblog.com\",\n\"ddnss.de\",\n\"dyn.ddnss.de\",\n\"dyndns.ddnss.de\",\n\"dyndns1.de\",\n\"dyn-ip24.de\",\n\"home-webserver.de\",\n\"dyn.home-webserver.de\",\n\"myhome-server.de\",\n\"ddnss.org\",\n\"definima.net\",\n\"definima.io\",\n\"ondigitalocean.app\",\n\"*.digitaloceanspaces.com\",\n\"bci.dnstrace.pro\",\n\"ddnsfree.com\",\n\"ddnsgeek.com\",\n\"giize.com\",\n\"gleeze.com\",\n\"kozow.com\",\n\"loseyourip.com\",\n\"ooguy.com\",\n\"theworkpc.com\",\n\"casacam.net\",\n\"dynu.net\",\n\"accesscam.org\",\n\"camdvr.org\",\n\"freeddns.org\",\n\"mywire.org\",\n\"webredirect.org\",\n\"myddns.rocks\",\n\"blogsite.xyz\",\n\"dynv6.net\",\n\"e4.cz\",\n\"eero.online\",\n\"eero-stage.online\",\n\"elementor.cloud\",\n\"elementor.cool\",\n\"en-root.fr\",\n\"mytuleap.com\",\n\"tuleap-partners.com\",\n\"encr.app\",\n\"encoreapi.com\",\n\"onred.one\",\n\"staging.onred.one\",\n\"eu.encoway.cloud\",\n\"eu.org\",\n\"al.eu.org\",\n\"asso.eu.org\",\n\"at.eu.org\",\n\"au.eu.org\",\n\"be.eu.org\",\n\"bg.eu.org\",\n\"ca.eu.org\",\n\"cd.eu.org\",\n\"ch.eu.org\",\n\"cn.eu.org\",\n\"cy.eu.org\",\n\"cz.eu.org\",\n\"de.eu.org\",\n\"dk.eu.org\",\n\"edu.eu.org\",\n\"ee.eu.org\",\n\"es.eu.org\",\n\"fi.eu.org\",\n\"fr.eu.org\",\n\"gr.eu.org\",\n\"hr.eu.org\",\n\"hu.eu.org\",\n\"ie.eu.org\",\n\"il.eu.org\",\n\"in.eu.org\",\n\"int.eu.org\",\n\"is.eu.org\",\n\"it.eu.org\",\n\"jp.eu.org\",\n\"kr.eu.org\",\n\"lt.eu.org\",\n\"lu.eu.org\",\n\"lv.eu.org\",\n\"mc.eu.org\",\n\"me.eu.org\",\n\"mk.eu.org\",\n\"mt.eu.org\",\n\"my.eu.org\",\n\"net.eu.org\",\n\"ng.eu.org\",\n\"nl.eu.org\",\n\"no.eu.org\",\n\"nz.eu.org\",\n\"paris.eu.org\",\n\"pl.eu.org\",\n\"pt.eu.org\",\n\"q-a.eu.org\",\n\"ro.eu.org\",\n\"ru.eu.org\",\n\"se.eu.org\",\n\"si.eu.org\",\n\"sk.eu.org\",\n\"tr.eu.org\",\n\"uk.eu.org\",\n\"us.eu.org\",\n\"eurodir.ru\",\n\"eu-1.evennode.com\",\n\"eu-2.evennode.com\",\n\"eu-3.evennode.com\",\n\"eu-4.evennode.com\",\n\"us-1.evennode.com\",\n\"us-2.evennode.com\",\n\"us-3.evennode.com\",\n\"us-4.evennode.com\",\n\"twmail.cc\",\n\"twmail.net\",\n\"twmail.org\",\n\"mymailer.com.tw\",\n\"url.tw\",\n\"onfabrica.com\",\n\"apps.fbsbx.com\",\n\"ru.net\",\n\"adygeya.ru\",\n\"bashkiria.ru\",\n\"bir.ru\",\n\"cbg.ru\",\n\"com.ru\",\n\"dagestan.ru\",\n\"grozny.ru\",\n\"kalmykia.ru\",\n\"kustanai.ru\",\n\"marine.ru\",\n\"mordovia.ru\",\n\"msk.ru\",\n\"mytis.ru\",\n\"nalchik.ru\",\n\"nov.ru\",\n\"pyatigorsk.ru\",\n\"spb.ru\",\n\"vladikavkaz.ru\",\n\"vladimir.ru\",\n\"abkhazia.su\",\n\"adygeya.su\",\n\"aktyubinsk.su\",\n\"arkhangelsk.su\",\n\"armenia.su\",\n\"ashgabad.su\",\n\"azerbaijan.su\",\n\"balashov.su\",\n\"bashkiria.su\",\n\"bryansk.su\",\n\"bukhara.su\",\n\"chimkent.su\",\n\"dagestan.su\",\n\"east-kazakhstan.su\",\n\"exnet.su\",\n\"georgia.su\",\n\"grozny.su\",\n\"ivanovo.su\",\n\"jambyl.su\",\n\"kalmykia.su\",\n\"kaluga.su\",\n\"karacol.su\",\n\"karaganda.su\",\n\"karelia.su\",\n\"khakassia.su\",\n\"krasnodar.su\",\n\"kurgan.su\",\n\"kustanai.su\",\n\"lenug.su\",\n\"mangyshlak.su\",\n\"mordovia.su\",\n\"msk.su\",\n\"murmansk.su\",\n\"nalchik.su\",\n\"navoi.su\",\n\"north-kazakhstan.su\",\n\"nov.su\",\n\"obninsk.su\",\n\"penza.su\",\n\"pokrovsk.su\",\n\"sochi.su\",\n\"spb.su\",\n\"tashkent.su\",\n\"termez.su\",\n\"togliatti.su\",\n\"troitsk.su\",\n\"tselinograd.su\",\n\"tula.su\",\n\"tuva.su\",\n\"vladikavkaz.su\",\n\"vladimir.su\",\n\"vologda.su\",\n\"channelsdvr.net\",\n\"u.channelsdvr.net\",\n\"edgecompute.app\",\n\"fastly-terrarium.com\",\n\"fastlylb.net\",\n\"map.fastlylb.net\",\n\"freetls.fastly.net\",\n\"map.fastly.net\",\n\"a.prod.fastly.net\",\n\"global.prod.fastly.net\",\n\"a.ssl.fastly.net\",\n\"b.ssl.fastly.net\",\n\"global.ssl.fastly.net\",\n\"fastvps-server.com\",\n\"fastvps.host\",\n\"myfast.host\",\n\"fastvps.site\",\n\"myfast.space\",\n\"fedorainfracloud.org\",\n\"fedorapeople.org\",\n\"cloud.fedoraproject.org\",\n\"app.os.fedoraproject.org\",\n\"app.os.stg.fedoraproject.org\",\n\"conn.uk\",\n\"copro.uk\",\n\"hosp.uk\",\n\"mydobiss.com\",\n\"fh-muenster.io\",\n\"filegear.me\",\n\"filegear-au.me\",\n\"filegear-de.me\",\n\"filegear-gb.me\",\n\"filegear-ie.me\",\n\"filegear-jp.me\",\n\"filegear-sg.me\",\n\"firebaseapp.com\",\n\"fireweb.app\",\n\"flap.id\",\n\"onflashdrive.app\",\n\"fldrv.com\",\n\"fly.dev\",\n\"edgeapp.net\",\n\"shw.io\",\n\"flynnhosting.net\",\n\"forgeblocks.com\",\n\"id.forgerock.io\",\n\"framer.app\",\n\"framercanvas.com\",\n\"*.frusky.de\",\n\"ravpage.co.il\",\n\"0e.vc\",\n\"freebox-os.com\",\n\"freeboxos.com\",\n\"fbx-os.fr\",\n\"fbxos.fr\",\n\"freebox-os.fr\",\n\"freeboxos.fr\",\n\"freedesktop.org\",\n\"freemyip.com\",\n\"wien.funkfeuer.at\",\n\"*.futurecms.at\",\n\"*.ex.futurecms.at\",\n\"*.in.futurecms.at\",\n\"futurehosting.at\",\n\"futuremailing.at\",\n\"*.ex.ortsinfo.at\",\n\"*.kunden.ortsinfo.at\",\n\"*.statics.cloud\",\n\"independent-commission.uk\",\n\"independent-inquest.uk\",\n\"independent-inquiry.uk\",\n\"independent-panel.uk\",\n\"independent-review.uk\",\n\"public-inquiry.uk\",\n\"royal-commission.uk\",\n\"campaign.gov.uk\",\n\"service.gov.uk\",\n\"api.gov.uk\",\n\"gehirn.ne.jp\",\n\"usercontent.jp\",\n\"gentapps.com\",\n\"gentlentapis.com\",\n\"lab.ms\",\n\"cdn-edges.net\",\n\"ghost.io\",\n\"gsj.bz\",\n\"githubusercontent.com\",\n\"githubpreview.dev\",\n\"github.io\",\n\"gitlab.io\",\n\"gitapp.si\",\n\"gitpage.si\",\n\"glitch.me\",\n\"nog.community\",\n\"co.ro\",\n\"shop.ro\",\n\"lolipop.io\",\n\"angry.jp\",\n\"babyblue.jp\",\n\"babymilk.jp\",\n\"backdrop.jp\",\n\"bambina.jp\",\n\"bitter.jp\",\n\"blush.jp\",\n\"boo.jp\",\n\"boy.jp\",\n\"boyfriend.jp\",\n\"but.jp\",\n\"candypop.jp\",\n\"capoo.jp\",\n\"catfood.jp\",\n\"cheap.jp\",\n\"chicappa.jp\",\n\"chillout.jp\",\n\"chips.jp\",\n\"chowder.jp\",\n\"chu.jp\",\n\"ciao.jp\",\n\"cocotte.jp\",\n\"coolblog.jp\",\n\"cranky.jp\",\n\"cutegirl.jp\",\n\"daa.jp\",\n\"deca.jp\",\n\"deci.jp\",\n\"digick.jp\",\n\"egoism.jp\",\n\"fakefur.jp\",\n\"fem.jp\",\n\"flier.jp\",\n\"floppy.jp\",\n\"fool.jp\",\n\"frenchkiss.jp\",\n\"girlfriend.jp\",\n\"girly.jp\",\n\"gloomy.jp\",\n\"gonna.jp\",\n\"greater.jp\",\n\"hacca.jp\",\n\"heavy.jp\",\n\"her.jp\",\n\"hiho.jp\",\n\"hippy.jp\",\n\"holy.jp\",\n\"hungry.jp\",\n\"icurus.jp\",\n\"itigo.jp\",\n\"jellybean.jp\",\n\"kikirara.jp\",\n\"kill.jp\",\n\"kilo.jp\",\n\"kuron.jp\",\n\"littlestar.jp\",\n\"lolipopmc.jp\",\n\"lolitapunk.jp\",\n\"lomo.jp\",\n\"lovepop.jp\",\n\"lovesick.jp\",\n\"main.jp\",\n\"mods.jp\",\n\"mond.jp\",\n\"mongolian.jp\",\n\"moo.jp\",\n\"namaste.jp\",\n\"nikita.jp\",\n\"nobushi.jp\",\n\"noor.jp\",\n\"oops.jp\",\n\"parallel.jp\",\n\"parasite.jp\",\n\"pecori.jp\",\n\"peewee.jp\",\n\"penne.jp\",\n\"pepper.jp\",\n\"perma.jp\",\n\"pigboat.jp\",\n\"pinoko.jp\",\n\"punyu.jp\",\n\"pupu.jp\",\n\"pussycat.jp\",\n\"pya.jp\",\n\"raindrop.jp\",\n\"readymade.jp\",\n\"sadist.jp\",\n\"schoolbus.jp\",\n\"secret.jp\",\n\"staba.jp\",\n\"stripper.jp\",\n\"sub.jp\",\n\"sunnyday.jp\",\n\"thick.jp\",\n\"tonkotsu.jp\",\n\"under.jp\",\n\"upper.jp\",\n\"velvet.jp\",\n\"verse.jp\",\n\"versus.jp\",\n\"vivian.jp\",\n\"watson.jp\",\n\"weblike.jp\",\n\"whitesnow.jp\",\n\"zombie.jp\",\n\"heteml.net\",\n\"cloudapps.digital\",\n\"london.cloudapps.digital\",\n\"pymnt.uk\",\n\"homeoffice.gov.uk\",\n\"ro.im\",\n\"goip.de\",\n\"run.app\",\n\"a.run.app\",\n\"web.app\",\n\"*.0emm.com\",\n\"appspot.com\",\n\"*.r.appspot.com\",\n\"codespot.com\",\n\"googleapis.com\",\n\"googlecode.com\",\n\"pagespeedmobilizer.com\",\n\"publishproxy.com\",\n\"withgoogle.com\",\n\"withyoutube.com\",\n\"*.gateway.dev\",\n\"cloud.goog\",\n\"translate.goog\",\n\"*.usercontent.goog\",\n\"cloudfunctions.net\",\n\"blogspot.ae\",\n\"blogspot.al\",\n\"blogspot.am\",\n\"blogspot.ba\",\n\"blogspot.be\",\n\"blogspot.bg\",\n\"blogspot.bj\",\n\"blogspot.ca\",\n\"blogspot.cf\",\n\"blogspot.ch\",\n\"blogspot.cl\",\n\"blogspot.co.at\",\n\"blogspot.co.id\",\n\"blogspot.co.il\",\n\"blogspot.co.ke\",\n\"blogspot.co.nz\",\n\"blogspot.co.uk\",\n\"blogspot.co.za\",\n\"blogspot.com\",\n\"blogspot.com.ar\",\n\"blogspot.com.au\",\n\"blogspot.com.br\",\n\"blogspot.com.by\",\n\"blogspot.com.co\",\n\"blogspot.com.cy\",\n\"blogspot.com.ee\",\n\"blogspot.com.eg\",\n\"blogspot.com.es\",\n\"blogspot.com.mt\",\n\"blogspot.com.ng\",\n\"blogspot.com.tr\",\n\"blogspot.com.uy\",\n\"blogspot.cv\",\n\"blogspot.cz\",\n\"blogspot.de\",\n\"blogspot.dk\",\n\"blogspot.fi\",\n\"blogspot.fr\",\n\"blogspot.gr\",\n\"blogspot.hk\",\n\"blogspot.hr\",\n\"blogspot.hu\",\n\"blogspot.ie\",\n\"blogspot.in\",\n\"blogspot.is\",\n\"blogspot.it\",\n\"blogspot.jp\",\n\"blogspot.kr\",\n\"blogspot.li\",\n\"blogspot.lt\",\n\"blogspot.lu\",\n\"blogspot.md\",\n\"blogspot.mk\",\n\"blogspot.mr\",\n\"blogspot.mx\",\n\"blogspot.my\",\n\"blogspot.nl\",\n\"blogspot.no\",\n\"blogspot.pe\",\n\"blogspot.pt\",\n\"blogspot.qa\",\n\"blogspot.re\",\n\"blogspot.ro\",\n\"blogspot.rs\",\n\"blogspot.ru\",\n\"blogspot.se\",\n\"blogspot.sg\",\n\"blogspot.si\",\n\"blogspot.sk\",\n\"blogspot.sn\",\n\"blogspot.td\",\n\"blogspot.tw\",\n\"blogspot.ug\",\n\"blogspot.vn\",\n\"goupile.fr\",\n\"gov.nl\",\n\"awsmppl.com\",\n\"günstigbestellen.de\",\n\"günstigliefern.de\",\n\"fin.ci\",\n\"free.hr\",\n\"caa.li\",\n\"ua.rs\",\n\"conf.se\",\n\"hs.zone\",\n\"hs.run\",\n\"hashbang.sh\",\n\"hasura.app\",\n\"hasura-app.io\",\n\"pages.it.hs-heilbronn.de\",\n\"hepforge.org\",\n\"herokuapp.com\",\n\"herokussl.com\",\n\"ravendb.cloud\",\n\"myravendb.com\",\n\"ravendb.community\",\n\"ravendb.me\",\n\"development.run\",\n\"ravendb.run\",\n\"homesklep.pl\",\n\"secaas.hk\",\n\"hoplix.shop\",\n\"orx.biz\",\n\"biz.gl\",\n\"col.ng\",\n\"firm.ng\",\n\"gen.ng\",\n\"ltd.ng\",\n\"ngo.ng\",\n\"edu.scot\",\n\"sch.so\",\n\"hostyhosting.io\",\n\"häkkinen.fi\",\n\"*.moonscale.io\",\n\"moonscale.net\",\n\"iki.fi\",\n\"ibxos.it\",\n\"iliadboxos.it\",\n\"impertrixcdn.com\",\n\"impertrix.com\",\n\"smushcdn.com\",\n\"wphostedmail.com\",\n\"wpmucdn.com\",\n\"tempurl.host\",\n\"wpmudev.host\",\n\"dyn-berlin.de\",\n\"in-berlin.de\",\n\"in-brb.de\",\n\"in-butter.de\",\n\"in-dsl.de\",\n\"in-dsl.net\",\n\"in-dsl.org\",\n\"in-vpn.de\",\n\"in-vpn.net\",\n\"in-vpn.org\",\n\"biz.at\",\n\"info.at\",\n\"info.cx\",\n\"ac.leg.br\",\n\"al.leg.br\",\n\"am.leg.br\",\n\"ap.leg.br\",\n\"ba.leg.br\",\n\"ce.leg.br\",\n\"df.leg.br\",\n\"es.leg.br\",\n\"go.leg.br\",\n\"ma.leg.br\",\n\"mg.leg.br\",\n\"ms.leg.br\",\n\"mt.leg.br\",\n\"pa.leg.br\",\n\"pb.leg.br\",\n\"pe.leg.br\",\n\"pi.leg.br\",\n\"pr.leg.br\",\n\"rj.leg.br\",\n\"rn.leg.br\",\n\"ro.leg.br\",\n\"rr.leg.br\",\n\"rs.leg.br\",\n\"sc.leg.br\",\n\"se.leg.br\",\n\"sp.leg.br\",\n\"to.leg.br\",\n\"pixolino.com\",\n\"na4u.ru\",\n\"iopsys.se\",\n\"ipifony.net\",\n\"iservschule.de\",\n\"mein-iserv.de\",\n\"schulplattform.de\",\n\"schulserver.de\",\n\"test-iserv.de\",\n\"iserv.dev\",\n\"iobb.net\",\n\"mel.cloudlets.com.au\",\n\"cloud.interhostsolutions.be\",\n\"users.scale.virtualcloud.com.br\",\n\"mycloud.by\",\n\"alp1.ae.flow.ch\",\n\"appengine.flow.ch\",\n\"es-1.axarnet.cloud\",\n\"diadem.cloud\",\n\"vip.jelastic.cloud\",\n\"jele.cloud\",\n\"it1.eur.aruba.jenv-aruba.cloud\",\n\"it1.jenv-aruba.cloud\",\n\"keliweb.cloud\",\n\"cs.keliweb.cloud\",\n\"oxa.cloud\",\n\"tn.oxa.cloud\",\n\"uk.oxa.cloud\",\n\"primetel.cloud\",\n\"uk.primetel.cloud\",\n\"ca.reclaim.cloud\",\n\"uk.reclaim.cloud\",\n\"us.reclaim.cloud\",\n\"ch.trendhosting.cloud\",\n\"de.trendhosting.cloud\",\n\"jele.club\",\n\"amscompute.com\",\n\"clicketcloud.com\",\n\"dopaas.com\",\n\"hidora.com\",\n\"paas.hosted-by-previder.com\",\n\"rag-cloud.hosteur.com\",\n\"rag-cloud-ch.hosteur.com\",\n\"jcloud.ik-server.com\",\n\"jcloud-ver-jpc.ik-server.com\",\n\"demo.jelastic.com\",\n\"kilatiron.com\",\n\"paas.massivegrid.com\",\n\"jed.wafaicloud.com\",\n\"lon.wafaicloud.com\",\n\"ryd.wafaicloud.com\",\n\"j.scaleforce.com.cy\",\n\"jelastic.dogado.eu\",\n\"fi.cloudplatform.fi\",\n\"demo.datacenter.fi\",\n\"paas.datacenter.fi\",\n\"jele.host\",\n\"mircloud.host\",\n\"paas.beebyte.io\",\n\"sekd1.beebyteapp.io\",\n\"jele.io\",\n\"cloud-fr1.unispace.io\",\n\"jc.neen.it\",\n\"cloud.jelastic.open.tim.it\",\n\"jcloud.kz\",\n\"upaas.kazteleport.kz\",\n\"cloudjiffy.net\",\n\"fra1-de.cloudjiffy.net\",\n\"west1-us.cloudjiffy.net\",\n\"jls-sto1.elastx.net\",\n\"jls-sto2.elastx.net\",\n\"jls-sto3.elastx.net\",\n\"faststacks.net\",\n\"fr-1.paas.massivegrid.net\",\n\"lon-1.paas.massivegrid.net\",\n\"lon-2.paas.massivegrid.net\",\n\"ny-1.paas.massivegrid.net\",\n\"ny-2.paas.massivegrid.net\",\n\"sg-1.paas.massivegrid.net\",\n\"jelastic.saveincloud.net\",\n\"nordeste-idc.saveincloud.net\",\n\"j.scaleforce.net\",\n\"jelastic.tsukaeru.net\",\n\"sdscloud.pl\",\n\"unicloud.pl\",\n\"mircloud.ru\",\n\"jelastic.regruhosting.ru\",\n\"enscaled.sg\",\n\"jele.site\",\n\"jelastic.team\",\n\"orangecloud.tn\",\n\"j.layershift.co.uk\",\n\"phx.enscaled.us\",\n\"mircloud.us\",\n\"myjino.ru\",\n\"*.hosting.myjino.ru\",\n\"*.landing.myjino.ru\",\n\"*.spectrum.myjino.ru\",\n\"*.vps.myjino.ru\",\n\"jotelulu.cloud\",\n\"*.triton.zone\",\n\"*.cns.joyent.com\",\n\"js.org\",\n\"kaas.gg\",\n\"khplay.nl\",\n\"ktistory.com\",\n\"kapsi.fi\",\n\"keymachine.de\",\n\"kinghost.net\",\n\"uni5.net\",\n\"knightpoint.systems\",\n\"koobin.events\",\n\"oya.to\",\n\"kuleuven.cloud\",\n\"ezproxy.kuleuven.be\",\n\"co.krd\",\n\"edu.krd\",\n\"krellian.net\",\n\"webthings.io\",\n\"git-repos.de\",\n\"lcube-server.de\",\n\"svn-repos.de\",\n\"leadpages.co\",\n\"lpages.co\",\n\"lpusercontent.com\",\n\"lelux.site\",\n\"co.business\",\n\"co.education\",\n\"co.events\",\n\"co.financial\",\n\"co.network\",\n\"co.place\",\n\"co.technology\",\n\"app.lmpm.com\",\n\"linkyard.cloud\",\n\"linkyard-cloud.ch\",\n\"members.linode.com\",\n\"*.nodebalancer.linode.com\",\n\"*.linodeobjects.com\",\n\"ip.linodeusercontent.com\",\n\"we.bs\",\n\"*.user.localcert.dev\",\n\"localzone.xyz\",\n\"loginline.app\",\n\"loginline.dev\",\n\"loginline.io\",\n\"loginline.services\",\n\"loginline.site\",\n\"servers.run\",\n\"lohmus.me\",\n\"krasnik.pl\",\n\"leczna.pl\",\n\"lubartow.pl\",\n\"lublin.pl\",\n\"poniatowa.pl\",\n\"swidnik.pl\",\n\"glug.org.uk\",\n\"lug.org.uk\",\n\"lugs.org.uk\",\n\"barsy.bg\",\n\"barsy.co.uk\",\n\"barsyonline.co.uk\",\n\"barsycenter.com\",\n\"barsyonline.com\",\n\"barsy.club\",\n\"barsy.de\",\n\"barsy.eu\",\n\"barsy.in\",\n\"barsy.info\",\n\"barsy.io\",\n\"barsy.me\",\n\"barsy.menu\",\n\"barsy.mobi\",\n\"barsy.net\",\n\"barsy.online\",\n\"barsy.org\",\n\"barsy.pro\",\n\"barsy.pub\",\n\"barsy.ro\",\n\"barsy.shop\",\n\"barsy.site\",\n\"barsy.support\",\n\"barsy.uk\",\n\"*.magentosite.cloud\",\n\"mayfirst.info\",\n\"mayfirst.org\",\n\"hb.cldmail.ru\",\n\"cn.vu\",\n\"mazeplay.com\",\n\"mcpe.me\",\n\"mcdir.me\",\n\"mcdir.ru\",\n\"mcpre.ru\",\n\"vps.mcdir.ru\",\n\"mediatech.by\",\n\"mediatech.dev\",\n\"hra.health\",\n\"miniserver.com\",\n\"memset.net\",\n\"messerli.app\",\n\"*.cloud.metacentrum.cz\",\n\"custom.metacentrum.cz\",\n\"flt.cloud.muni.cz\",\n\"usr.cloud.muni.cz\",\n\"meteorapp.com\",\n\"eu.meteorapp.com\",\n\"co.pl\",\n\"*.azurecontainer.io\",\n\"azurewebsites.net\",\n\"azure-mobile.net\",\n\"cloudapp.net\",\n\"azurestaticapps.net\",\n\"1.azurestaticapps.net\",\n\"centralus.azurestaticapps.net\",\n\"eastasia.azurestaticapps.net\",\n\"eastus2.azurestaticapps.net\",\n\"westeurope.azurestaticapps.net\",\n\"westus2.azurestaticapps.net\",\n\"csx.cc\",\n\"mintere.site\",\n\"forte.id\",\n\"mozilla-iot.org\",\n\"bmoattachments.org\",\n\"net.ru\",\n\"org.ru\",\n\"pp.ru\",\n\"hostedpi.com\",\n\"customer.mythic-beasts.com\",\n\"caracal.mythic-beasts.com\",\n\"fentiger.mythic-beasts.com\",\n\"lynx.mythic-beasts.com\",\n\"ocelot.mythic-beasts.com\",\n\"oncilla.mythic-beasts.com\",\n\"onza.mythic-beasts.com\",\n\"sphinx.mythic-beasts.com\",\n\"vs.mythic-beasts.com\",\n\"x.mythic-beasts.com\",\n\"yali.mythic-beasts.com\",\n\"cust.retrosnub.co.uk\",\n\"ui.nabu.casa\",\n\"pony.club\",\n\"of.fashion\",\n\"in.london\",\n\"of.london\",\n\"from.marketing\",\n\"with.marketing\",\n\"for.men\",\n\"repair.men\",\n\"and.mom\",\n\"for.mom\",\n\"for.one\",\n\"under.one\",\n\"for.sale\",\n\"that.win\",\n\"from.work\",\n\"to.work\",\n\"cloud.nospamproxy.com\",\n\"netlify.app\",\n\"4u.com\",\n\"ngrok.io\",\n\"nh-serv.co.uk\",\n\"nfshost.com\",\n\"*.developer.app\",\n\"noop.app\",\n\"*.northflank.app\",\n\"*.build.run\",\n\"*.code.run\",\n\"*.database.run\",\n\"*.migration.run\",\n\"noticeable.news\",\n\"dnsking.ch\",\n\"mypi.co\",\n\"n4t.co\",\n\"001www.com\",\n\"ddnslive.com\",\n\"myiphost.com\",\n\"forumz.info\",\n\"16-b.it\",\n\"32-b.it\",\n\"64-b.it\",\n\"soundcast.me\",\n\"tcp4.me\",\n\"dnsup.net\",\n\"hicam.net\",\n\"now-dns.net\",\n\"ownip.net\",\n\"vpndns.net\",\n\"dynserv.org\",\n\"now-dns.org\",\n\"x443.pw\",\n\"now-dns.top\",\n\"ntdll.top\",\n\"freeddns.us\",\n\"crafting.xyz\",\n\"zapto.xyz\",\n\"nsupdate.info\",\n\"nerdpol.ovh\",\n\"blogsyte.com\",\n\"brasilia.me\",\n\"cable-modem.org\",\n\"ciscofreak.com\",\n\"collegefan.org\",\n\"couchpotatofries.org\",\n\"damnserver.com\",\n\"ddns.me\",\n\"ditchyourip.com\",\n\"dnsfor.me\",\n\"dnsiskinky.com\",\n\"dvrcam.info\",\n\"dynns.com\",\n\"eating-organic.net\",\n\"fantasyleague.cc\",\n\"geekgalaxy.com\",\n\"golffan.us\",\n\"health-carereform.com\",\n\"homesecuritymac.com\",\n\"homesecuritypc.com\",\n\"hopto.me\",\n\"ilovecollege.info\",\n\"loginto.me\",\n\"mlbfan.org\",\n\"mmafan.biz\",\n\"myactivedirectory.com\",\n\"mydissent.net\",\n\"myeffect.net\",\n\"mymediapc.net\",\n\"mypsx.net\",\n\"mysecuritycamera.com\",\n\"mysecuritycamera.net\",\n\"mysecuritycamera.org\",\n\"net-freaks.com\",\n\"nflfan.org\",\n\"nhlfan.net\",\n\"no-ip.ca\",\n\"no-ip.co.uk\",\n\"no-ip.net\",\n\"noip.us\",\n\"onthewifi.com\",\n\"pgafan.net\",\n\"point2this.com\",\n\"pointto.us\",\n\"privatizehealthinsurance.net\",\n\"quicksytes.com\",\n\"read-books.org\",\n\"securitytactics.com\",\n\"serveexchange.com\",\n\"servehumour.com\",\n\"servep2p.com\",\n\"servesarcasm.com\",\n\"stufftoread.com\",\n\"ufcfan.org\",\n\"unusualperson.com\",\n\"workisboring.com\",\n\"3utilities.com\",\n\"bounceme.net\",\n\"ddns.net\",\n\"ddnsking.com\",\n\"gotdns.ch\",\n\"hopto.org\",\n\"myftp.biz\",\n\"myftp.org\",\n\"myvnc.com\",\n\"no-ip.biz\",\n\"no-ip.info\",\n\"no-ip.org\",\n\"noip.me\",\n\"redirectme.net\",\n\"servebeer.com\",\n\"serveblog.net\",\n\"servecounterstrike.com\",\n\"serveftp.com\",\n\"servegame.com\",\n\"servehalflife.com\",\n\"servehttp.com\",\n\"serveirc.com\",\n\"serveminecraft.net\",\n\"servemp3.com\",\n\"servepics.com\",\n\"servequake.com\",\n\"sytes.net\",\n\"webhop.me\",\n\"zapto.org\",\n\"stage.nodeart.io\",\n\"pcloud.host\",\n\"nyc.mn\",\n\"static.observableusercontent.com\",\n\"cya.gg\",\n\"omg.lol\",\n\"cloudycluster.net\",\n\"omniwe.site\",\n\"service.one\",\n\"nid.io\",\n\"opensocial.site\",\n\"opencraft.hosting\",\n\"orsites.com\",\n\"operaunite.com\",\n\"tech.orange\",\n\"authgear-staging.com\",\n\"authgearapps.com\",\n\"skygearapp.com\",\n\"outsystemscloud.com\",\n\"*.webpaas.ovh.net\",\n\"*.hosting.ovh.net\",\n\"ownprovider.com\",\n\"own.pm\",\n\"*.owo.codes\",\n\"ox.rs\",\n\"oy.lc\",\n\"pgfog.com\",\n\"pagefrontapp.com\",\n\"pagexl.com\",\n\"*.paywhirl.com\",\n\"bar0.net\",\n\"bar1.net\",\n\"bar2.net\",\n\"rdv.to\",\n\"art.pl\",\n\"gliwice.pl\",\n\"krakow.pl\",\n\"poznan.pl\",\n\"wroc.pl\",\n\"zakopane.pl\",\n\"pantheonsite.io\",\n\"gotpantheon.com\",\n\"mypep.link\",\n\"perspecta.cloud\",\n\"lk3.ru\",\n\"on-web.fr\",\n\"bc.platform.sh\",\n\"ent.platform.sh\",\n\"eu.platform.sh\",\n\"us.platform.sh\",\n\"*.platformsh.site\",\n\"*.tst.site\",\n\"platter-app.com\",\n\"platter-app.dev\",\n\"platterp.us\",\n\"pdns.page\",\n\"plesk.page\",\n\"pleskns.com\",\n\"dyn53.io\",\n\"onporter.run\",\n\"co.bn\",\n\"postman-echo.com\",\n\"pstmn.io\",\n\"mock.pstmn.io\",\n\"httpbin.org\",\n\"prequalifyme.today\",\n\"xen.prgmr.com\",\n\"priv.at\",\n\"prvcy.page\",\n\"*.dweb.link\",\n\"protonet.io\",\n\"chirurgiens-dentistes-en-france.fr\",\n\"byen.site\",\n\"pubtls.org\",\n\"pythonanywhere.com\",\n\"eu.pythonanywhere.com\",\n\"qoto.io\",\n\"qualifioapp.com\",\n\"qbuser.com\",\n\"cloudsite.builders\",\n\"instances.spawn.cc\",\n\"instantcloud.cn\",\n\"ras.ru\",\n\"qa2.com\",\n\"qcx.io\",\n\"*.sys.qcx.io\",\n\"dev-myqnapcloud.com\",\n\"alpha-myqnapcloud.com\",\n\"myqnapcloud.com\",\n\"*.quipelements.com\",\n\"vapor.cloud\",\n\"vaporcloud.io\",\n\"rackmaze.com\",\n\"rackmaze.net\",\n\"g.vbrplsbx.io\",\n\"*.on-k3s.io\",\n\"*.on-rancher.cloud\",\n\"*.on-rio.io\",\n\"readthedocs.io\",\n\"rhcloud.com\",\n\"app.render.com\",\n\"onrender.com\",\n\"repl.co\",\n\"id.repl.co\",\n\"repl.run\",\n\"resindevice.io\",\n\"devices.resinstaging.io\",\n\"hzc.io\",\n\"wellbeingzone.eu\",\n\"wellbeingzone.co.uk\",\n\"adimo.co.uk\",\n\"itcouldbewor.se\",\n\"git-pages.rit.edu\",\n\"rocky.page\",\n\"биз.рус\",\n\"ком.рус\",\n\"крым.рус\",\n\"мир.рус\",\n\"мск.рус\",\n\"орг.рус\",\n\"самара.рус\",\n\"сочи.рус\",\n\"спб.рус\",\n\"я.рус\",\n\"*.builder.code.com\",\n\"*.dev-builder.code.com\",\n\"*.stg-builder.code.com\",\n\"sandcats.io\",\n\"logoip.de\",\n\"logoip.com\",\n\"fr-par-1.baremetal.scw.cloud\",\n\"fr-par-2.baremetal.scw.cloud\",\n\"nl-ams-1.baremetal.scw.cloud\",\n\"fnc.fr-par.scw.cloud\",\n\"functions.fnc.fr-par.scw.cloud\",\n\"k8s.fr-par.scw.cloud\",\n\"nodes.k8s.fr-par.scw.cloud\",\n\"s3.fr-par.scw.cloud\",\n\"s3-website.fr-par.scw.cloud\",\n\"whm.fr-par.scw.cloud\",\n\"priv.instances.scw.cloud\",\n\"pub.instances.scw.cloud\",\n\"k8s.scw.cloud\",\n\"k8s.nl-ams.scw.cloud\",\n\"nodes.k8s.nl-ams.scw.cloud\",\n\"s3.nl-ams.scw.cloud\",\n\"s3-website.nl-ams.scw.cloud\",\n\"whm.nl-ams.scw.cloud\",\n\"k8s.pl-waw.scw.cloud\",\n\"nodes.k8s.pl-waw.scw.cloud\",\n\"s3.pl-waw.scw.cloud\",\n\"s3-website.pl-waw.scw.cloud\",\n\"scalebook.scw.cloud\",\n\"smartlabeling.scw.cloud\",\n\"dedibox.fr\",\n\"schokokeks.net\",\n\"gov.scot\",\n\"service.gov.scot\",\n\"scrysec.com\",\n\"firewall-gateway.com\",\n\"firewall-gateway.de\",\n\"my-gateway.de\",\n\"my-router.de\",\n\"spdns.de\",\n\"spdns.eu\",\n\"firewall-gateway.net\",\n\"my-firewall.org\",\n\"myfirewall.org\",\n\"spdns.org\",\n\"seidat.net\",\n\"sellfy.store\",\n\"senseering.net\",\n\"minisite.ms\",\n\"magnet.page\",\n\"biz.ua\",\n\"co.ua\",\n\"pp.ua\",\n\"shiftcrypto.dev\",\n\"shiftcrypto.io\",\n\"shiftedit.io\",\n\"myshopblocks.com\",\n\"myshopify.com\",\n\"shopitsite.com\",\n\"shopware.store\",\n\"mo-siemens.io\",\n\"1kapp.com\",\n\"appchizi.com\",\n\"applinzi.com\",\n\"sinaapp.com\",\n\"vipsinaapp.com\",\n\"siteleaf.net\",\n\"bounty-full.com\",\n\"alpha.bounty-full.com\",\n\"beta.bounty-full.com\",\n\"small-web.org\",\n\"vp4.me\",\n\"try-snowplow.com\",\n\"srht.site\",\n\"stackhero-network.com\",\n\"musician.io\",\n\"novecore.site\",\n\"static.land\",\n\"dev.static.land\",\n\"sites.static.land\",\n\"storebase.store\",\n\"vps-host.net\",\n\"atl.jelastic.vps-host.net\",\n\"njs.jelastic.vps-host.net\",\n\"ric.jelastic.vps-host.net\",\n\"playstation-cloud.com\",\n\"apps.lair.io\",\n\"*.stolos.io\",\n\"spacekit.io\",\n\"customer.speedpartner.de\",\n\"myspreadshop.at\",\n\"myspreadshop.com.au\",\n\"myspreadshop.be\",\n\"myspreadshop.ca\",\n\"myspreadshop.ch\",\n\"myspreadshop.com\",\n\"myspreadshop.de\",\n\"myspreadshop.dk\",\n\"myspreadshop.es\",\n\"myspreadshop.fi\",\n\"myspreadshop.fr\",\n\"myspreadshop.ie\",\n\"myspreadshop.it\",\n\"myspreadshop.net\",\n\"myspreadshop.nl\",\n\"myspreadshop.no\",\n\"myspreadshop.pl\",\n\"myspreadshop.se\",\n\"myspreadshop.co.uk\",\n\"api.stdlib.com\",\n\"storj.farm\",\n\"utwente.io\",\n\"soc.srcf.net\",\n\"user.srcf.net\",\n\"temp-dns.com\",\n\"supabase.co\",\n\"supabase.in\",\n\"supabase.net\",\n\"su.paba.se\",\n\"*.s5y.io\",\n\"*.sensiosite.cloud\",\n\"syncloud.it\",\n\"dscloud.biz\",\n\"direct.quickconnect.cn\",\n\"dsmynas.com\",\n\"familyds.com\",\n\"diskstation.me\",\n\"dscloud.me\",\n\"i234.me\",\n\"myds.me\",\n\"synology.me\",\n\"dscloud.mobi\",\n\"dsmynas.net\",\n\"familyds.net\",\n\"dsmynas.org\",\n\"familyds.org\",\n\"vpnplus.to\",\n\"direct.quickconnect.to\",\n\"tabitorder.co.il\",\n\"taifun-dns.de\",\n\"beta.tailscale.net\",\n\"ts.net\",\n\"gda.pl\",\n\"gdansk.pl\",\n\"gdynia.pl\",\n\"med.pl\",\n\"sopot.pl\",\n\"site.tb-hosting.com\",\n\"edugit.io\",\n\"s3.teckids.org\",\n\"telebit.app\",\n\"telebit.io\",\n\"*.telebit.xyz\",\n\"gwiddle.co.uk\",\n\"*.firenet.ch\",\n\"*.svc.firenet.ch\",\n\"reservd.com\",\n\"thingdustdata.com\",\n\"cust.dev.thingdust.io\",\n\"cust.disrec.thingdust.io\",\n\"cust.prod.thingdust.io\",\n\"cust.testing.thingdust.io\",\n\"reservd.dev.thingdust.io\",\n\"reservd.disrec.thingdust.io\",\n\"reservd.testing.thingdust.io\",\n\"tickets.io\",\n\"arvo.network\",\n\"azimuth.network\",\n\"tlon.network\",\n\"torproject.net\",\n\"pages.torproject.net\",\n\"bloxcms.com\",\n\"townnews-staging.com\",\n\"tbits.me\",\n\"12hp.at\",\n\"2ix.at\",\n\"4lima.at\",\n\"lima-city.at\",\n\"12hp.ch\",\n\"2ix.ch\",\n\"4lima.ch\",\n\"lima-city.ch\",\n\"trafficplex.cloud\",\n\"de.cool\",\n\"12hp.de\",\n\"2ix.de\",\n\"4lima.de\",\n\"lima-city.de\",\n\"1337.pictures\",\n\"clan.rip\",\n\"lima-city.rocks\",\n\"webspace.rocks\",\n\"lima.zone\",\n\"*.transurl.be\",\n\"*.transurl.eu\",\n\"*.transurl.nl\",\n\"site.transip.me\",\n\"tuxfamily.org\",\n\"dd-dns.de\",\n\"diskstation.eu\",\n\"diskstation.org\",\n\"dray-dns.de\",\n\"draydns.de\",\n\"dyn-vpn.de\",\n\"dynvpn.de\",\n\"mein-vigor.de\",\n\"my-vigor.de\",\n\"my-wan.de\",\n\"syno-ds.de\",\n\"synology-diskstation.de\",\n\"synology-ds.de\",\n\"typedream.app\",\n\"pro.typeform.com\",\n\"uber.space\",\n\"*.uberspace.de\",\n\"hk.com\",\n\"hk.org\",\n\"ltd.hk\",\n\"inc.hk\",\n\"name.pm\",\n\"sch.tf\",\n\"biz.wf\",\n\"sch.wf\",\n\"org.yt\",\n\"virtualuser.de\",\n\"virtual-user.de\",\n\"upli.io\",\n\"urown.cloud\",\n\"dnsupdate.info\",\n\"lib.de.us\",\n\"2038.io\",\n\"vercel.app\",\n\"vercel.dev\",\n\"now.sh\",\n\"router.management\",\n\"v-info.info\",\n\"voorloper.cloud\",\n\"neko.am\",\n\"nyaa.am\",\n\"be.ax\",\n\"cat.ax\",\n\"es.ax\",\n\"eu.ax\",\n\"gg.ax\",\n\"mc.ax\",\n\"us.ax\",\n\"xy.ax\",\n\"nl.ci\",\n\"xx.gl\",\n\"app.gp\",\n\"blog.gt\",\n\"de.gt\",\n\"to.gt\",\n\"be.gy\",\n\"cc.hn\",\n\"blog.kg\",\n\"io.kg\",\n\"jp.kg\",\n\"tv.kg\",\n\"uk.kg\",\n\"us.kg\",\n\"de.ls\",\n\"at.md\",\n\"de.md\",\n\"jp.md\",\n\"to.md\",\n\"indie.porn\",\n\"vxl.sh\",\n\"ch.tc\",\n\"me.tc\",\n\"we.tc\",\n\"nyan.to\",\n\"at.vg\",\n\"blog.vu\",\n\"dev.vu\",\n\"me.vu\",\n\"v.ua\",\n\"*.vultrobjects.com\",\n\"wafflecell.com\",\n\"*.webhare.dev\",\n\"reserve-online.net\",\n\"reserve-online.com\",\n\"bookonline.app\",\n\"hotelwithflight.com\",\n\"wedeploy.io\",\n\"wedeploy.me\",\n\"wedeploy.sh\",\n\"remotewd.com\",\n\"pages.wiardweb.com\",\n\"wmflabs.org\",\n\"toolforge.org\",\n\"wmcloud.org\",\n\"panel.gg\",\n\"daemon.panel.gg\",\n\"messwithdns.com\",\n\"woltlab-demo.com\",\n\"myforum.community\",\n\"community-pro.de\",\n\"diskussionsbereich.de\",\n\"community-pro.net\",\n\"meinforum.net\",\n\"affinitylottery.org.uk\",\n\"raffleentry.org.uk\",\n\"weeklylottery.org.uk\",\n\"wpenginepowered.com\",\n\"js.wpenginepowered.com\",\n\"wixsite.com\",\n\"editorx.io\",\n\"half.host\",\n\"xnbay.com\",\n\"u2.xnbay.com\",\n\"u2-local.xnbay.com\",\n\"cistron.nl\",\n\"demon.nl\",\n\"xs4all.space\",\n\"yandexcloud.net\",\n\"storage.yandexcloud.net\",\n\"website.yandexcloud.net\",\n\"official.academy\",\n\"yolasite.com\",\n\"ybo.faith\",\n\"yombo.me\",\n\"homelink.one\",\n\"ybo.party\",\n\"ybo.review\",\n\"ybo.science\",\n\"ybo.trade\",\n\"ynh.fr\",\n\"nohost.me\",\n\"noho.st\",\n\"za.net\",\n\"za.org\",\n\"bss.design\",\n\"basicserver.io\",\n\"virtualserver.io\",\n\"enterprisecloud.nu\"\n]","/*eslint no-var:0, prefer-arrow-callback: 0, object-shorthand: 0 */\n'use strict';\n\n\nvar Punycode = require('punycode');\n\n\nvar internals = {};\n\n\n//\n// Read rules from file.\n//\ninternals.rules = require('./data/rules.json').map(function (rule) {\n\n return {\n rule: rule,\n suffix: rule.replace(/^(\\*\\.|\\!)/, ''),\n punySuffix: -1,\n wildcard: rule.charAt(0) === '*',\n exception: rule.charAt(0) === '!'\n };\n});\n\n\n//\n// Check is given string ends with `suffix`.\n//\ninternals.endsWith = function (str, suffix) {\n\n return str.indexOf(suffix, str.length - suffix.length) !== -1;\n};\n\n\n//\n// Find rule for a given domain.\n//\ninternals.findRule = function (domain) {\n\n var punyDomain = Punycode.toASCII(domain);\n return internals.rules.reduce(function (memo, rule) {\n\n if (rule.punySuffix === -1){\n rule.punySuffix = Punycode.toASCII(rule.suffix);\n }\n if (!internals.endsWith(punyDomain, '.' + rule.punySuffix) && punyDomain !== rule.punySuffix) {\n return memo;\n }\n // This has been commented out as it never seems to run. This is because\n // sub tlds always appear after their parents and we never find a shorter\n // match.\n //if (memo) {\n // var memoSuffix = Punycode.toASCII(memo.suffix);\n // if (memoSuffix.length >= punySuffix.length) {\n // return memo;\n // }\n //}\n return rule;\n }, null);\n};\n\n\n//\n// Error codes and messages.\n//\nexports.errorCodes = {\n DOMAIN_TOO_SHORT: 'Domain name too short.',\n DOMAIN_TOO_LONG: 'Domain name too long. It should be no more than 255 chars.',\n LABEL_STARTS_WITH_DASH: 'Domain name label can not start with a dash.',\n LABEL_ENDS_WITH_DASH: 'Domain name label can not end with a dash.',\n LABEL_TOO_LONG: 'Domain name label should be at most 63 chars long.',\n LABEL_TOO_SHORT: 'Domain name label should be at least 1 character long.',\n LABEL_INVALID_CHARS: 'Domain name label can only contain alphanumeric characters or dashes.'\n};\n\n\n//\n// Validate domain name and throw if not valid.\n//\n// From wikipedia:\n//\n// Hostnames are composed of series of labels concatenated with dots, as are all\n// domain names. Each label must be between 1 and 63 characters long, and the\n// entire hostname (including the delimiting dots) has a maximum of 255 chars.\n//\n// Allowed chars:\n//\n// * `a-z`\n// * `0-9`\n// * `-` but not as a starting or ending character\n// * `.` as a separator for the textual portions of a domain name\n//\n// * http://en.wikipedia.org/wiki/Domain_name\n// * http://en.wikipedia.org/wiki/Hostname\n//\ninternals.validate = function (input) {\n\n // Before we can validate we need to take care of IDNs with unicode chars.\n var ascii = Punycode.toASCII(input);\n\n if (ascii.length < 1) {\n return 'DOMAIN_TOO_SHORT';\n }\n if (ascii.length > 255) {\n return 'DOMAIN_TOO_LONG';\n }\n\n // Check each part's length and allowed chars.\n var labels = ascii.split('.');\n var label;\n\n for (var i = 0; i < labels.length; ++i) {\n label = labels[i];\n if (!label.length) {\n return 'LABEL_TOO_SHORT';\n }\n if (label.length > 63) {\n return 'LABEL_TOO_LONG';\n }\n if (label.charAt(0) === '-') {\n return 'LABEL_STARTS_WITH_DASH';\n }\n if (label.charAt(label.length - 1) === '-') {\n return 'LABEL_ENDS_WITH_DASH';\n }\n if (!/^[a-z0-9\\-]+$/.test(label)) {\n return 'LABEL_INVALID_CHARS';\n }\n }\n};\n\n\n//\n// Public API\n//\n\n\n//\n// Parse domain.\n//\nexports.parse = function (input) {\n\n if (typeof input !== 'string') {\n throw new TypeError('Domain name must be a string.');\n }\n\n // Force domain to lowercase.\n var domain = input.slice(0).toLowerCase();\n\n // Handle FQDN.\n // TODO: Simply remove trailing dot?\n if (domain.charAt(domain.length - 1) === '.') {\n domain = domain.slice(0, domain.length - 1);\n }\n\n // Validate and sanitise input.\n var error = internals.validate(domain);\n if (error) {\n return {\n input: input,\n error: {\n message: exports.errorCodes[error],\n code: error\n }\n };\n }\n\n var parsed = {\n input: input,\n tld: null,\n sld: null,\n domain: null,\n subdomain: null,\n listed: false\n };\n\n var domainParts = domain.split('.');\n\n // Non-Internet TLD\n if (domainParts[domainParts.length - 1] === 'local') {\n return parsed;\n }\n\n var handlePunycode = function () {\n\n if (!/xn--/.test(domain)) {\n return parsed;\n }\n if (parsed.domain) {\n parsed.domain = Punycode.toASCII(parsed.domain);\n }\n if (parsed.subdomain) {\n parsed.subdomain = Punycode.toASCII(parsed.subdomain);\n }\n return parsed;\n };\n\n var rule = internals.findRule(domain);\n\n // Unlisted tld.\n if (!rule) {\n if (domainParts.length < 2) {\n return parsed;\n }\n parsed.tld = domainParts.pop();\n parsed.sld = domainParts.pop();\n parsed.domain = [parsed.sld, parsed.tld].join('.');\n if (domainParts.length) {\n parsed.subdomain = domainParts.pop();\n }\n return handlePunycode();\n }\n\n // At this point we know the public suffix is listed.\n parsed.listed = true;\n\n var tldParts = rule.suffix.split('.');\n var privateParts = domainParts.slice(0, domainParts.length - tldParts.length);\n\n if (rule.exception) {\n privateParts.push(tldParts.shift());\n }\n\n parsed.tld = tldParts.join('.');\n\n if (!privateParts.length) {\n return handlePunycode();\n }\n\n if (rule.wildcard) {\n tldParts.unshift(privateParts.pop());\n parsed.tld = tldParts.join('.');\n }\n\n if (!privateParts.length) {\n return handlePunycode();\n }\n\n parsed.sld = privateParts.pop();\n parsed.domain = [parsed.sld, parsed.tld].join('.');\n\n if (privateParts.length) {\n parsed.subdomain = privateParts.join('.');\n }\n\n return handlePunycode();\n};\n\n\n//\n// Get domain.\n//\nexports.get = function (domain) {\n\n if (!domain) {\n return null;\n }\n return exports.parse(domain).domain || null;\n};\n\n\n//\n// Check whether domain belongs to a known public suffix.\n//\nexports.isValid = function (domain) {\n\n var parsed = exports.parse(domain);\n return Boolean(parsed.domain && parsed.listed);\n};\n","/*!\n * Copyright (c) 2018, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\nconst psl = require(\"psl\");\n\n// RFC 6761\nconst SPECIAL_USE_DOMAINS = [\n \"local\",\n \"example\",\n \"invalid\",\n \"localhost\",\n \"test\"\n];\n\nconst SPECIAL_TREATMENT_DOMAINS = [\"localhost\", \"invalid\"];\n\nfunction getPublicSuffix(domain, options = {}) {\n const domainParts = domain.split(\".\");\n const topLevelDomain = domainParts[domainParts.length - 1];\n const allowSpecialUseDomain = !!options.allowSpecialUseDomain;\n const ignoreError = !!options.ignoreError;\n\n if (allowSpecialUseDomain && SPECIAL_USE_DOMAINS.includes(topLevelDomain)) {\n if (domainParts.length > 1) {\n const secondLevelDomain = domainParts[domainParts.length - 2];\n // In aforementioned example, the eTLD/pubSuf will be apple.localhost\n return `${secondLevelDomain}.${topLevelDomain}`;\n } else if (SPECIAL_TREATMENT_DOMAINS.includes(topLevelDomain)) {\n // For a single word special use domain, e.g. 'localhost' or 'invalid', per RFC 6761,\n // \"Application software MAY recognize {localhost/invalid} names as special, or\n // MAY pass them to name resolution APIs as they would for other domain names.\"\n return `${topLevelDomain}`;\n }\n }\n\n if (!ignoreError && SPECIAL_USE_DOMAINS.includes(topLevelDomain)) {\n throw new Error(\n `Cookie has domain set to the public suffix \"${topLevelDomain}\" which is a special use domain. To allow this, configure your CookieJar with {allowSpecialUseDomain:true, rejectPublicSuffixes: false}.`\n );\n }\n\n return psl.get(domain);\n}\n\nexports.getPublicSuffix = getPublicSuffix;\n","/*!\n * Copyright (c) 2015, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\n/*jshint unused:false */\n\nclass Store {\n constructor() {\n this.synchronous = false;\n }\n\n findCookie(domain, path, key, cb) {\n throw new Error(\"findCookie is not implemented\");\n }\n\n findCookies(domain, path, allowSpecialUseDomain, cb) {\n throw new Error(\"findCookies is not implemented\");\n }\n\n putCookie(cookie, cb) {\n throw new Error(\"putCookie is not implemented\");\n }\n\n updateCookie(oldCookie, newCookie, cb) {\n // recommended default implementation:\n // return this.putCookie(newCookie, cb);\n throw new Error(\"updateCookie is not implemented\");\n }\n\n removeCookie(domain, path, key, cb) {\n throw new Error(\"removeCookie is not implemented\");\n }\n\n removeCookies(domain, path, cb) {\n throw new Error(\"removeCookies is not implemented\");\n }\n\n removeAllCookies(cb) {\n throw new Error(\"removeAllCookies is not implemented\");\n }\n\n getAllCookies(cb) {\n throw new Error(\n \"getAllCookies is not implemented (therefore jar cannot be serialized)\"\n );\n }\n}\n\nexports.Store = Store;\n","'use strict'\n\nexports.fromCallback = function (fn) {\n return Object.defineProperty(function () {\n if (typeof arguments[arguments.length - 1] === 'function') fn.apply(this, arguments)\n else {\n return new Promise((resolve, reject) => {\n arguments[arguments.length] = (err, res) => {\n if (err) return reject(err)\n resolve(res)\n }\n arguments.length++\n fn.apply(this, arguments)\n })\n }\n }, 'name', { value: fn.name })\n}\n\nexports.fromPromise = function (fn) {\n return Object.defineProperty(function () {\n const cb = arguments[arguments.length - 1]\n if (typeof cb !== 'function') return fn.apply(this, arguments)\n else {\n delete arguments[arguments.length - 1]\n arguments.length--\n fn.apply(this, arguments).then(r => cb(null, r), cb)\n }\n }, 'name', { value: fn.name })\n}\n","/*!\n * Copyright (c) 2015, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\nconst pubsuffix = require(\"./pubsuffix-psl\");\n\n// Gives the permutation of all possible domainMatch()es of a given domain. The\n// array is in shortest-to-longest order. Handy for indexing.\n\nfunction permuteDomain(domain, allowSpecialUseDomain) {\n const pubSuf = pubsuffix.getPublicSuffix(domain, {\n allowSpecialUseDomain: allowSpecialUseDomain\n });\n\n if (!pubSuf) {\n return null;\n }\n if (pubSuf == domain) {\n return [domain];\n }\n\n // Nuke trailing dot\n if (domain.slice(-1) == \".\") {\n domain = domain.slice(0, -1);\n }\n\n const prefix = domain.slice(0, -(pubSuf.length + 1)); // \".example.com\"\n const parts = prefix.split(\".\").reverse();\n let cur = pubSuf;\n const permutations = [cur];\n while (parts.length) {\n cur = `${parts.shift()}.${cur}`;\n permutations.push(cur);\n }\n return permutations;\n}\n\nexports.permuteDomain = permuteDomain;\n","/*!\n * Copyright (c) 2015, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\n/*\n * \"A request-path path-matches a given cookie-path if at least one of the\n * following conditions holds:\"\n */\nfunction pathMatch(reqPath, cookiePath) {\n // \"o The cookie-path and the request-path are identical.\"\n if (cookiePath === reqPath) {\n return true;\n }\n\n const idx = reqPath.indexOf(cookiePath);\n if (idx === 0) {\n // \"o The cookie-path is a prefix of the request-path, and the last\n // character of the cookie-path is %x2F (\"/\").\"\n if (cookiePath.substr(-1) === \"/\") {\n return true;\n }\n\n // \" o The cookie-path is a prefix of the request-path, and the first\n // character of the request-path that is not included in the cookie- path\n // is a %x2F (\"/\") character.\"\n if (reqPath.substr(cookiePath.length, 1) === \"/\") {\n return true;\n }\n }\n\n return false;\n}\n\nexports.pathMatch = pathMatch;\n","function requireUtil() {\n try {\n // eslint-disable-next-line no-restricted-modules\n return require(\"util\");\n } catch (e) {\n return null;\n }\n}\n\n// for v10.12.0+\nfunction lookupCustomInspectSymbol() {\n return Symbol.for(\"nodejs.util.inspect.custom\");\n}\n\n// for older node environments\nfunction tryReadingCustomSymbolFromUtilInspect(options) {\n const _requireUtil = options.requireUtil || requireUtil;\n const util = _requireUtil();\n return util ? util.inspect.custom : null;\n}\n\nexports.getUtilInspect = function getUtilInspect(fallback, options = {}) {\n const _requireUtil = options.requireUtil || requireUtil;\n const util = _requireUtil();\n return function inspect(value, showHidden, depth) {\n return util ? util.inspect(value, showHidden, depth) : fallback(value);\n };\n};\n\nexports.getCustomInspectSymbol = function getCustomInspectSymbol(options = {}) {\n const _lookupCustomInspectSymbol =\n options.lookupCustomInspectSymbol || lookupCustomInspectSymbol;\n\n // get custom inspect symbol for node environments\n return (\n _lookupCustomInspectSymbol() ||\n tryReadingCustomSymbolFromUtilInspect(options)\n );\n};\n","/*!\n * Copyright (c) 2015, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\nconst { fromCallback } = require(\"universalify\");\nconst Store = require(\"./store\").Store;\nconst permuteDomain = require(\"./permuteDomain\").permuteDomain;\nconst pathMatch = require(\"./pathMatch\").pathMatch;\nconst { getCustomInspectSymbol, getUtilInspect } = require(\"./utilHelper\");\n\nclass MemoryCookieStore extends Store {\n constructor() {\n super();\n this.synchronous = true;\n this.idx = Object.create(null);\n const customInspectSymbol = getCustomInspectSymbol();\n if (customInspectSymbol) {\n this[customInspectSymbol] = this.inspect;\n }\n }\n\n inspect() {\n const util = { inspect: getUtilInspect(inspectFallback) };\n return `{ idx: ${util.inspect(this.idx, false, 2)} }`;\n }\n\n findCookie(domain, path, key, cb) {\n if (!this.idx[domain]) {\n return cb(null, undefined);\n }\n if (!this.idx[domain][path]) {\n return cb(null, undefined);\n }\n return cb(null, this.idx[domain][path][key] || null);\n }\n findCookies(domain, path, allowSpecialUseDomain, cb) {\n const results = [];\n if (typeof allowSpecialUseDomain === \"function\") {\n cb = allowSpecialUseDomain;\n allowSpecialUseDomain = true;\n }\n if (!domain) {\n return cb(null, []);\n }\n\n let pathMatcher;\n if (!path) {\n // null means \"all paths\"\n pathMatcher = function matchAll(domainIndex) {\n for (const curPath in domainIndex) {\n const pathIndex = domainIndex[curPath];\n for (const key in pathIndex) {\n results.push(pathIndex[key]);\n }\n }\n };\n } else {\n pathMatcher = function matchRFC(domainIndex) {\n //NOTE: we should use path-match algorithm from S5.1.4 here\n //(see : https://github.com/ChromiumWebApps/chromium/blob/b3d3b4da8bb94c1b2e061600df106d590fda3620/net/cookies/canonical_cookie.cc#L299)\n Object.keys(domainIndex).forEach(cookiePath => {\n if (pathMatch(path, cookiePath)) {\n const pathIndex = domainIndex[cookiePath];\n for (const key in pathIndex) {\n results.push(pathIndex[key]);\n }\n }\n });\n };\n }\n\n const domains = permuteDomain(domain, allowSpecialUseDomain) || [domain];\n const idx = this.idx;\n domains.forEach(curDomain => {\n const domainIndex = idx[curDomain];\n if (!domainIndex) {\n return;\n }\n pathMatcher(domainIndex);\n });\n\n cb(null, results);\n }\n\n putCookie(cookie, cb) {\n if (!this.idx[cookie.domain]) {\n this.idx[cookie.domain] = Object.create(null);\n }\n if (!this.idx[cookie.domain][cookie.path]) {\n this.idx[cookie.domain][cookie.path] = Object.create(null);\n }\n this.idx[cookie.domain][cookie.path][cookie.key] = cookie;\n cb(null);\n }\n updateCookie(oldCookie, newCookie, cb) {\n // updateCookie() may avoid updating cookies that are identical. For example,\n // lastAccessed may not be important to some stores and an equality\n // comparison could exclude that field.\n this.putCookie(newCookie, cb);\n }\n removeCookie(domain, path, key, cb) {\n if (\n this.idx[domain] &&\n this.idx[domain][path] &&\n this.idx[domain][path][key]\n ) {\n delete this.idx[domain][path][key];\n }\n cb(null);\n }\n removeCookies(domain, path, cb) {\n if (this.idx[domain]) {\n if (path) {\n delete this.idx[domain][path];\n } else {\n delete this.idx[domain];\n }\n }\n return cb(null);\n }\n removeAllCookies(cb) {\n this.idx = Object.create(null);\n return cb(null);\n }\n getAllCookies(cb) {\n const cookies = [];\n const idx = this.idx;\n\n const domains = Object.keys(idx);\n domains.forEach(domain => {\n const paths = Object.keys(idx[domain]);\n paths.forEach(path => {\n const keys = Object.keys(idx[domain][path]);\n keys.forEach(key => {\n if (key !== null) {\n cookies.push(idx[domain][path][key]);\n }\n });\n });\n });\n\n // Sort by creationIndex so deserializing retains the creation order.\n // When implementing your own store, this SHOULD retain the order too\n cookies.sort((a, b) => {\n return (a.creationIndex || 0) - (b.creationIndex || 0);\n });\n\n cb(null, cookies);\n }\n}\n\n[\n \"findCookie\",\n \"findCookies\",\n \"putCookie\",\n \"updateCookie\",\n \"removeCookie\",\n \"removeCookies\",\n \"removeAllCookies\",\n \"getAllCookies\"\n].forEach(name => {\n MemoryCookieStore.prototype[name] = fromCallback(\n MemoryCookieStore.prototype[name]\n );\n});\n\nexports.MemoryCookieStore = MemoryCookieStore;\n\nfunction inspectFallback(val) {\n const domains = Object.keys(val);\n if (domains.length === 0) {\n return \"[Object: null prototype] {}\";\n }\n let result = \"[Object: null prototype] {\\n\";\n Object.keys(val).forEach((domain, i) => {\n result += formatDomain(domain, val[domain]);\n if (i < domains.length - 1) {\n result += \",\";\n }\n result += \"\\n\";\n });\n result += \"}\";\n return result;\n}\n\nfunction formatDomain(domainName, domainValue) {\n const indent = \" \";\n let result = `${indent}'${domainName}': [Object: null prototype] {\\n`;\n Object.keys(domainValue).forEach((path, i, paths) => {\n result += formatPath(path, domainValue[path]);\n if (i < paths.length - 1) {\n result += \",\";\n }\n result += \"\\n\";\n });\n result += `${indent}}`;\n return result;\n}\n\nfunction formatPath(pathName, pathValue) {\n const indent = \" \";\n let result = `${indent}'${pathName}': [Object: null prototype] {\\n`;\n Object.keys(pathValue).forEach((cookieName, i, cookieNames) => {\n const cookie = pathValue[cookieName];\n result += ` ${cookieName}: ${cookie.inspect()}`;\n if (i < cookieNames.length - 1) {\n result += \",\";\n }\n result += \"\\n\";\n });\n result += `${indent}}`;\n return result;\n}\n\nexports.inspectFallback = inspectFallback;\n","/* ************************************************************************************\nExtracted from check-types.js\nhttps://gitlab.com/philbooth/check-types.js\n\nMIT License\n\nCopyright (c) 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019 Phil Booth\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\n************************************************************************************ */\n\"use strict\";\n\n/* Validation functions copied from check-types package - https://www.npmjs.com/package/check-types */\n\nconst toString = Object.prototype.toString;\n\nfunction isFunction(data) {\n return typeof data === \"function\";\n}\n\nfunction isNonEmptyString(data) {\n return isString(data) && data !== \"\";\n}\n\nfunction isDate(data) {\n return isInstanceStrict(data, Date) && isInteger(data.getTime());\n}\n\nfunction isEmptyString(data) {\n return data === \"\" || (data instanceof String && data.toString() === \"\");\n}\n\nfunction isString(data) {\n return typeof data === \"string\" || data instanceof String;\n}\n\nfunction isObject(data) {\n return toString.call(data) === \"[object Object]\";\n}\nfunction isInstanceStrict(data, prototype) {\n try {\n return data instanceof prototype;\n } catch (error) {\n return false;\n }\n}\n\nfunction isUrlStringOrObject(data) {\n return (\n isNonEmptyString(data) ||\n (isObject(data) &&\n \"hostname\" in data &&\n \"pathname\" in data &&\n \"protocol\" in data) ||\n isInstanceStrict(data, URL)\n );\n}\n\nfunction isInteger(data) {\n return typeof data === \"number\" && data % 1 === 0;\n}\n/* End validation functions */\n\nfunction validate(bool, cb, options) {\n if (!isFunction(cb)) {\n options = cb;\n cb = null;\n }\n if (!isObject(options)) options = { Error: \"Failed Check\" };\n if (!bool) {\n if (cb) {\n cb(new ParameterError(options));\n } else {\n throw new ParameterError(options);\n }\n }\n}\n\nclass ParameterError extends Error {\n constructor(...params) {\n super(...params);\n }\n}\n\nexports.ParameterError = ParameterError;\nexports.isFunction = isFunction;\nexports.isNonEmptyString = isNonEmptyString;\nexports.isDate = isDate;\nexports.isEmptyString = isEmptyString;\nexports.isString = isString;\nexports.isObject = isObject;\nexports.isUrlStringOrObject = isUrlStringOrObject;\nexports.validate = validate;\n","// generated by genversion\nmodule.exports = '4.1.4'\n","/*!\n * Copyright (c) 2015-2020, Salesforce.com, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of Salesforce.com nor the names of its contributors may\n * be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\"use strict\";\nconst punycode = require(\"punycode/\");\nconst urlParse = require(\"url-parse\");\nconst pubsuffix = require(\"./pubsuffix-psl\");\nconst Store = require(\"./store\").Store;\nconst MemoryCookieStore = require(\"./memstore\").MemoryCookieStore;\nconst pathMatch = require(\"./pathMatch\").pathMatch;\nconst validators = require(\"./validators.js\");\nconst VERSION = require(\"./version\");\nconst { fromCallback } = require(\"universalify\");\nconst { getCustomInspectSymbol } = require(\"./utilHelper\");\n\n// From RFC6265 S4.1.1\n// note that it excludes \\x3B \";\"\nconst COOKIE_OCTETS = /^[\\x21\\x23-\\x2B\\x2D-\\x3A\\x3C-\\x5B\\x5D-\\x7E]+$/;\n\nconst CONTROL_CHARS = /[\\x00-\\x1F]/;\n\n// From Chromium // '\\r', '\\n' and '\\0' should be treated as a terminator in\n// the \"relaxed\" mode, see:\n// https://github.com/ChromiumWebApps/chromium/blob/b3d3b4da8bb94c1b2e061600df106d590fda3620/net/cookies/parsed_cookie.cc#L60\nconst TERMINATORS = [\"\\n\", \"\\r\", \"\\0\"];\n\n// RFC6265 S4.1.1 defines path value as 'any CHAR except CTLs or \";\"'\n// Note ';' is \\x3B\nconst PATH_VALUE = /[\\x20-\\x3A\\x3C-\\x7E]+/;\n\n// date-time parsing constants (RFC6265 S5.1.1)\n\nconst DATE_DELIM = /[\\x09\\x20-\\x2F\\x3B-\\x40\\x5B-\\x60\\x7B-\\x7E]/;\n\nconst MONTH_TO_NUM = {\n jan: 0,\n feb: 1,\n mar: 2,\n apr: 3,\n may: 4,\n jun: 5,\n jul: 6,\n aug: 7,\n sep: 8,\n oct: 9,\n nov: 10,\n dec: 11\n};\n\nconst MAX_TIME = 2147483647000; // 31-bit max\nconst MIN_TIME = 0; // 31-bit min\nconst SAME_SITE_CONTEXT_VAL_ERR =\n 'Invalid sameSiteContext option for getCookies(); expected one of \"strict\", \"lax\", or \"none\"';\n\nfunction checkSameSiteContext(value) {\n validators.validate(validators.isNonEmptyString(value), value);\n const context = String(value).toLowerCase();\n if (context === \"none\" || context === \"lax\" || context === \"strict\") {\n return context;\n } else {\n return null;\n }\n}\n\nconst PrefixSecurityEnum = Object.freeze({\n SILENT: \"silent\",\n STRICT: \"strict\",\n DISABLED: \"unsafe-disabled\"\n});\n\n// Dumped from ip-regex@4.0.0, with the following changes:\n// * all capturing groups converted to non-capturing -- \"(?:)\"\n// * support for IPv6 Scoped Literal (\"%eth1\") removed\n// * lowercase hexadecimal only\nconst IP_REGEX_LOWERCASE = /(?:^(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}$)|(?:^(?:(?:[a-f\\d]{1,4}:){7}(?:[a-f\\d]{1,4}|:)|(?:[a-f\\d]{1,4}:){6}(?:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|:[a-f\\d]{1,4}|:)|(?:[a-f\\d]{1,4}:){5}(?::(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,2}|:)|(?:[a-f\\d]{1,4}:){4}(?:(?::[a-f\\d]{1,4}){0,1}:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,3}|:)|(?:[a-f\\d]{1,4}:){3}(?:(?::[a-f\\d]{1,4}){0,2}:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,4}|:)|(?:[a-f\\d]{1,4}:){2}(?:(?::[a-f\\d]{1,4}){0,3}:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,5}|:)|(?:[a-f\\d]{1,4}:){1}(?:(?::[a-f\\d]{1,4}){0,4}:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,6}|:)|(?::(?:(?::[a-f\\d]{1,4}){0,5}:(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)(?:\\.(?:25[0-5]|2[0-4]\\d|1\\d\\d|[1-9]\\d|\\d)){3}|(?::[a-f\\d]{1,4}){1,7}|:)))$)/;\nconst IP_V6_REGEX = `\n\\\\[?(?:\n(?:[a-fA-F\\\\d]{1,4}:){7}(?:[a-fA-F\\\\d]{1,4}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){6}(?:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|:[a-fA-F\\\\d]{1,4}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){5}(?::(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,2}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){4}(?:(?::[a-fA-F\\\\d]{1,4}){0,1}:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,3}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){3}(?:(?::[a-fA-F\\\\d]{1,4}){0,2}:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,4}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){2}(?:(?::[a-fA-F\\\\d]{1,4}){0,3}:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,5}|:)|\n(?:[a-fA-F\\\\d]{1,4}:){1}(?:(?::[a-fA-F\\\\d]{1,4}){0,4}:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,6}|:)|\n(?::(?:(?::[a-fA-F\\\\d]{1,4}){0,5}:(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}|(?::[a-fA-F\\\\d]{1,4}){1,7}|:))\n)(?:%[0-9a-zA-Z]{1,})?\\\\]?\n`\n .replace(/\\s*\\/\\/.*$/gm, \"\")\n .replace(/\\n/g, \"\")\n .trim();\nconst IP_V6_REGEX_OBJECT = new RegExp(`^${IP_V6_REGEX}$`);\n\n/*\n * Parses a Natural number (i.e., non-negative integer) with either the\n * <min>*<max>DIGIT ( non-digit *OCTET )\n * or\n * <min>*<max>DIGIT\n * grammar (RFC6265 S5.1.1).\n *\n * The \"trailingOK\" boolean controls if the grammar accepts a\n * \"( non-digit *OCTET )\" trailer.\n */\nfunction parseDigits(token, minDigits, maxDigits, trailingOK) {\n let count = 0;\n while (count < token.length) {\n const c = token.charCodeAt(count);\n // \"non-digit = %x00-2F / %x3A-FF\"\n if (c <= 0x2f || c >= 0x3a) {\n break;\n }\n count++;\n }\n\n // constrain to a minimum and maximum number of digits.\n if (count < minDigits || count > maxDigits) {\n return null;\n }\n\n if (!trailingOK && count != token.length) {\n return null;\n }\n\n return parseInt(token.substr(0, count), 10);\n}\n\nfunction parseTime(token) {\n const parts = token.split(\":\");\n const result = [0, 0, 0];\n\n /* RF6256 S5.1.1:\n * time = hms-time ( non-digit *OCTET )\n * hms-time = time-field \":\" time-field \":\" time-field\n * time-field = 1*2DIGIT\n */\n\n if (parts.length !== 3) {\n return null;\n }\n\n for (let i = 0; i < 3; i++) {\n // \"time-field\" must be strictly \"1*2DIGIT\", HOWEVER, \"hms-time\" can be\n // followed by \"( non-digit *OCTET )\" so therefore the last time-field can\n // have a trailer\n const trailingOK = i == 2;\n const num = parseDigits(parts[i], 1, 2, trailingOK);\n if (num === null) {\n return null;\n }\n result[i] = num;\n }\n\n return result;\n}\n\nfunction parseMonth(token) {\n token = String(token)\n .substr(0, 3)\n .toLowerCase();\n const num = MONTH_TO_NUM[token];\n return num >= 0 ? num : null;\n}\n\n/*\n * RFC6265 S5.1.1 date parser (see RFC for full grammar)\n */\nfunction parseDate(str) {\n if (!str) {\n return;\n }\n\n /* RFC6265 S5.1.1:\n * 2. Process each date-token sequentially in the order the date-tokens\n * appear in the cookie-date\n */\n const tokens = str.split(DATE_DELIM);\n if (!tokens) {\n return;\n }\n\n let hour = null;\n let minute = null;\n let second = null;\n let dayOfMonth = null;\n let month = null;\n let year = null;\n\n for (let i = 0; i < tokens.length; i++) {\n const token = tokens[i].trim();\n if (!token.length) {\n continue;\n }\n\n let result;\n\n /* 2.1. If the found-time flag is not set and the token matches the time\n * production, set the found-time flag and set the hour- value,\n * minute-value, and second-value to the numbers denoted by the digits in\n * the date-token, respectively. Skip the remaining sub-steps and continue\n * to the next date-token.\n */\n if (second === null) {\n result = parseTime(token);\n if (result) {\n hour = result[0];\n minute = result[1];\n second = result[2];\n continue;\n }\n }\n\n /* 2.2. If the found-day-of-month flag is not set and the date-token matches\n * the day-of-month production, set the found-day-of- month flag and set\n * the day-of-month-value to the number denoted by the date-token. Skip\n * the remaining sub-steps and continue to the next date-token.\n */\n if (dayOfMonth === null) {\n // \"day-of-month = 1*2DIGIT ( non-digit *OCTET )\"\n result = parseDigits(token, 1, 2, true);\n if (result !== null) {\n dayOfMonth = result;\n continue;\n }\n }\n\n /* 2.3. If the found-month flag is not set and the date-token matches the\n * month production, set the found-month flag and set the month-value to\n * the month denoted by the date-token. Skip the remaining sub-steps and\n * continue to the next date-token.\n */\n if (month === null) {\n result = parseMonth(token);\n if (result !== null) {\n month = result;\n continue;\n }\n }\n\n /* 2.4. If the found-year flag is not set and the date-token matches the\n * year production, set the found-year flag and set the year-value to the\n * number denoted by the date-token. Skip the remaining sub-steps and\n * continue to the next date-token.\n */\n if (year === null) {\n // \"year = 2*4DIGIT ( non-digit *OCTET )\"\n result = parseDigits(token, 2, 4, true);\n if (result !== null) {\n year = result;\n /* From S5.1.1:\n * 3. If the year-value is greater than or equal to 70 and less\n * than or equal to 99, increment the year-value by 1900.\n * 4. If the year-value is greater than or equal to 0 and less\n * than or equal to 69, increment the year-value by 2000.\n */\n if (year >= 70 && year <= 99) {\n year += 1900;\n } else if (year >= 0 && year <= 69) {\n year += 2000;\n }\n }\n }\n }\n\n /* RFC 6265 S5.1.1\n * \"5. Abort these steps and fail to parse the cookie-date if:\n * * at least one of the found-day-of-month, found-month, found-\n * year, or found-time flags is not set,\n * * the day-of-month-value is less than 1 or greater than 31,\n * * the year-value is less than 1601,\n * * the hour-value is greater than 23,\n * * the minute-value is greater than 59, or\n * * the second-value is greater than 59.\n * (Note that leap seconds cannot be represented in this syntax.)\"\n *\n * So, in order as above:\n */\n if (\n dayOfMonth === null ||\n month === null ||\n year === null ||\n second === null ||\n dayOfMonth < 1 ||\n dayOfMonth > 31 ||\n year < 1601 ||\n hour > 23 ||\n minute > 59 ||\n second > 59\n ) {\n return;\n }\n\n return new Date(Date.UTC(year, month, dayOfMonth, hour, minute, second));\n}\n\nfunction formatDate(date) {\n validators.validate(validators.isDate(date), date);\n return date.toUTCString();\n}\n\n// S5.1.2 Canonicalized Host Names\nfunction canonicalDomain(str) {\n if (str == null) {\n return null;\n }\n str = str.trim().replace(/^\\./, \"\"); // S4.1.2.3 & S5.2.3: ignore leading .\n\n if (IP_V6_REGEX_OBJECT.test(str)) {\n str = str.replace(\"[\", \"\").replace(\"]\", \"\");\n }\n\n // convert to IDN if any non-ASCII characters\n if (punycode && /[^\\u0001-\\u007f]/.test(str)) {\n str = punycode.toASCII(str);\n }\n\n return str.toLowerCase();\n}\n\n// S5.1.3 Domain Matching\nfunction domainMatch(str, domStr, canonicalize) {\n if (str == null || domStr == null) {\n return null;\n }\n if (canonicalize !== false) {\n str = canonicalDomain(str);\n domStr = canonicalDomain(domStr);\n }\n\n /*\n * S5.1.3:\n * \"A string domain-matches a given domain string if at least one of the\n * following conditions hold:\"\n *\n * \" o The domain string and the string are identical. (Note that both the\n * domain string and the string will have been canonicalized to lower case at\n * this point)\"\n */\n if (str == domStr) {\n return true;\n }\n\n /* \" o All of the following [three] conditions hold:\" */\n\n /* \"* The domain string is a suffix of the string\" */\n const idx = str.lastIndexOf(domStr);\n if (idx <= 0) {\n return false; // it's a non-match (-1) or prefix (0)\n }\n\n // next, check it's a proper suffix\n // e.g., \"a.b.c\".indexOf(\"b.c\") === 2\n // 5 === 3+2\n if (str.length !== domStr.length + idx) {\n return false; // it's not a suffix\n }\n\n /* \" * The last character of the string that is not included in the\n * domain string is a %x2E (\".\") character.\" */\n if (str.substr(idx - 1, 1) !== \".\") {\n return false; // doesn't align on \".\"\n }\n\n /* \" * The string is a host name (i.e., not an IP address).\" */\n if (IP_REGEX_LOWERCASE.test(str)) {\n return false; // it's an IP address\n }\n\n return true;\n}\n\n// RFC6265 S5.1.4 Paths and Path-Match\n\n/*\n * \"The user agent MUST use an algorithm equivalent to the following algorithm\n * to compute the default-path of a cookie:\"\n *\n * Assumption: the path (and not query part or absolute uri) is passed in.\n */\nfunction defaultPath(path) {\n // \"2. If the uri-path is empty or if the first character of the uri-path is not\n // a %x2F (\"/\") character, output %x2F (\"/\") and skip the remaining steps.\n if (!path || path.substr(0, 1) !== \"/\") {\n return \"/\";\n }\n\n // \"3. If the uri-path contains no more than one %x2F (\"/\") character, output\n // %x2F (\"/\") and skip the remaining step.\"\n if (path === \"/\") {\n return path;\n }\n\n const rightSlash = path.lastIndexOf(\"/\");\n if (rightSlash === 0) {\n return \"/\";\n }\n\n // \"4. Output the characters of the uri-path from the first character up to,\n // but not including, the right-most %x2F (\"/\").\"\n return path.slice(0, rightSlash);\n}\n\nfunction trimTerminator(str) {\n if (validators.isEmptyString(str)) return str;\n for (let t = 0; t < TERMINATORS.length; t++) {\n const terminatorIdx = str.indexOf(TERMINATORS[t]);\n if (terminatorIdx !== -1) {\n str = str.substr(0, terminatorIdx);\n }\n }\n\n return str;\n}\n\nfunction parseCookiePair(cookiePair, looseMode) {\n cookiePair = trimTerminator(cookiePair);\n validators.validate(validators.isString(cookiePair), cookiePair);\n\n let firstEq = cookiePair.indexOf(\"=\");\n if (looseMode) {\n if (firstEq === 0) {\n // '=' is immediately at start\n cookiePair = cookiePair.substr(1);\n firstEq = cookiePair.indexOf(\"=\"); // might still need to split on '='\n }\n } else {\n // non-loose mode\n if (firstEq <= 0) {\n // no '=' or is at start\n return; // needs to have non-empty \"cookie-name\"\n }\n }\n\n let cookieName, cookieValue;\n if (firstEq <= 0) {\n cookieName = \"\";\n cookieValue = cookiePair.trim();\n } else {\n cookieName = cookiePair.substr(0, firstEq).trim();\n cookieValue = cookiePair.substr(firstEq + 1).trim();\n }\n\n if (CONTROL_CHARS.test(cookieName) || CONTROL_CHARS.test(cookieValue)) {\n return;\n }\n\n const c = new Cookie();\n c.key = cookieName;\n c.value = cookieValue;\n return c;\n}\n\nfunction parse(str, options) {\n if (!options || typeof options !== \"object\") {\n options = {};\n }\n\n if (validators.isEmptyString(str) || !validators.isString(str)) {\n return null;\n }\n\n str = str.trim();\n\n // We use a regex to parse the \"name-value-pair\" part of S5.2\n const firstSemi = str.indexOf(\";\"); // S5.2 step 1\n const cookiePair = firstSemi === -1 ? str : str.substr(0, firstSemi);\n const c = parseCookiePair(cookiePair, !!options.loose);\n if (!c) {\n return;\n }\n\n if (firstSemi === -1) {\n return c;\n }\n\n // S5.2.3 \"unparsed-attributes consist of the remainder of the set-cookie-string\n // (including the %x3B (\";\") in question).\" plus later on in the same section\n // \"discard the first \";\" and trim\".\n const unparsed = str.slice(firstSemi + 1).trim();\n\n // \"If the unparsed-attributes string is empty, skip the rest of these\n // steps.\"\n if (unparsed.length === 0) {\n return c;\n }\n\n /*\n * S5.2 says that when looping over the items \"[p]rocess the attribute-name\n * and attribute-value according to the requirements in the following\n * subsections\" for every item. Plus, for many of the individual attributes\n * in S5.3 it says to use the \"attribute-value of the last attribute in the\n * cookie-attribute-list\". Therefore, in this implementation, we overwrite\n * the previous value.\n */\n const cookie_avs = unparsed.split(\";\");\n while (cookie_avs.length) {\n const av = cookie_avs.shift().trim();\n if (av.length === 0) {\n // happens if \";;\" appears\n continue;\n }\n const av_sep = av.indexOf(\"=\");\n let av_key, av_value;\n\n if (av_sep === -1) {\n av_key = av;\n av_value = null;\n } else {\n av_key = av.substr(0, av_sep);\n av_value = av.substr(av_sep + 1);\n }\n\n av_key = av_key.trim().toLowerCase();\n\n if (av_value) {\n av_value = av_value.trim();\n }\n\n switch (av_key) {\n case \"expires\": // S5.2.1\n if (av_value) {\n const exp = parseDate(av_value);\n // \"If the attribute-value failed to parse as a cookie date, ignore the\n // cookie-av.\"\n if (exp) {\n // over and underflow not realistically a concern: V8's getTime() seems to\n // store something larger than a 32-bit time_t (even with 32-bit node)\n c.expires = exp;\n }\n }\n break;\n\n case \"max-age\": // S5.2.2\n if (av_value) {\n // \"If the first character of the attribute-value is not a DIGIT or a \"-\"\n // character ...[or]... If the remainder of attribute-value contains a\n // non-DIGIT character, ignore the cookie-av.\"\n if (/^-?[0-9]+$/.test(av_value)) {\n const delta = parseInt(av_value, 10);\n // \"If delta-seconds is less than or equal to zero (0), let expiry-time\n // be the earliest representable date and time.\"\n c.setMaxAge(delta);\n }\n }\n break;\n\n case \"domain\": // S5.2.3\n // \"If the attribute-value is empty, the behavior is undefined. However,\n // the user agent SHOULD ignore the cookie-av entirely.\"\n if (av_value) {\n // S5.2.3 \"Let cookie-domain be the attribute-value without the leading %x2E\n // (\".\") character.\"\n const domain = av_value.trim().replace(/^\\./, \"\");\n if (domain) {\n // \"Convert the cookie-domain to lower case.\"\n c.domain = domain.toLowerCase();\n }\n }\n break;\n\n case \"path\": // S5.2.4\n /*\n * \"If the attribute-value is empty or if the first character of the\n * attribute-value is not %x2F (\"/\"):\n * Let cookie-path be the default-path.\n * Otherwise:\n * Let cookie-path be the attribute-value.\"\n *\n * We'll represent the default-path as null since it depends on the\n * context of the parsing.\n */\n c.path = av_value && av_value[0] === \"/\" ? av_value : null;\n break;\n\n case \"secure\": // S5.2.5\n /*\n * \"If the attribute-name case-insensitively matches the string \"Secure\",\n * the user agent MUST append an attribute to the cookie-attribute-list\n * with an attribute-name of Secure and an empty attribute-value.\"\n */\n c.secure = true;\n break;\n\n case \"httponly\": // S5.2.6 -- effectively the same as 'secure'\n c.httpOnly = true;\n break;\n\n case \"samesite\": // RFC6265bis-02 S5.3.7\n const enforcement = av_value ? av_value.toLowerCase() : \"\";\n switch (enforcement) {\n case \"strict\":\n c.sameSite = \"strict\";\n break;\n case \"lax\":\n c.sameSite = \"lax\";\n break;\n case \"none\":\n c.sameSite = \"none\";\n break;\n default:\n c.sameSite = undefined;\n break;\n }\n break;\n\n default:\n c.extensions = c.extensions || [];\n c.extensions.push(av);\n break;\n }\n }\n\n return c;\n}\n\n/**\n * If the cookie-name begins with a case-sensitive match for the\n * string \"__Secure-\", abort these steps and ignore the cookie\n * entirely unless the cookie's secure-only-flag is true.\n * @param cookie\n * @returns boolean\n */\nfunction isSecurePrefixConditionMet(cookie) {\n validators.validate(validators.isObject(cookie), cookie);\n return !cookie.key.startsWith(\"__Secure-\") || cookie.secure;\n}\n\n/**\n * If the cookie-name begins with a case-sensitive match for the\n * string \"__Host-\", abort these steps and ignore the cookie\n * entirely unless the cookie meets all the following criteria:\n * 1. The cookie's secure-only-flag is true.\n * 2. The cookie's host-only-flag is true.\n * 3. The cookie-attribute-list contains an attribute with an\n * attribute-name of \"Path\", and the cookie's path is \"/\".\n * @param cookie\n * @returns boolean\n */\nfunction isHostPrefixConditionMet(cookie) {\n validators.validate(validators.isObject(cookie));\n return (\n !cookie.key.startsWith(\"__Host-\") ||\n (cookie.secure &&\n cookie.hostOnly &&\n cookie.path != null &&\n cookie.path === \"/\")\n );\n}\n\n// avoid the V8 deoptimization monster!\nfunction jsonParse(str) {\n let obj;\n try {\n obj = JSON.parse(str);\n } catch (e) {\n return e;\n }\n return obj;\n}\n\nfunction fromJSON(str) {\n if (!str || validators.isEmptyString(str)) {\n return null;\n }\n\n let obj;\n if (typeof str === \"string\") {\n obj = jsonParse(str);\n if (obj instanceof Error) {\n return null;\n }\n } else {\n // assume it's an Object\n obj = str;\n }\n\n const c = new Cookie();\n for (let i = 0; i < Cookie.serializableProperties.length; i++) {\n const prop = Cookie.serializableProperties[i];\n if (obj[prop] === undefined || obj[prop] === cookieDefaults[prop]) {\n continue; // leave as prototype default\n }\n\n if (prop === \"expires\" || prop === \"creation\" || prop === \"lastAccessed\") {\n if (obj[prop] === null) {\n c[prop] = null;\n } else {\n c[prop] = obj[prop] == \"Infinity\" ? \"Infinity\" : new Date(obj[prop]);\n }\n } else {\n c[prop] = obj[prop];\n }\n }\n\n return c;\n}\n\n/* Section 5.4 part 2:\n * \"* Cookies with longer paths are listed before cookies with\n * shorter paths.\n *\n * * Among cookies that have equal-length path fields, cookies with\n * earlier creation-times are listed before cookies with later\n * creation-times.\"\n */\n\nfunction cookieCompare(a, b) {\n validators.validate(validators.isObject(a), a);\n validators.validate(validators.isObject(b), b);\n let cmp = 0;\n\n // descending for length: b CMP a\n const aPathLen = a.path ? a.path.length : 0;\n const bPathLen = b.path ? b.path.length : 0;\n cmp = bPathLen - aPathLen;\n if (cmp !== 0) {\n return cmp;\n }\n\n // ascending for time: a CMP b\n const aTime = a.creation ? a.creation.getTime() : MAX_TIME;\n const bTime = b.creation ? b.creation.getTime() : MAX_TIME;\n cmp = aTime - bTime;\n if (cmp !== 0) {\n return cmp;\n }\n\n // break ties for the same millisecond (precision of JavaScript's clock)\n cmp = a.creationIndex - b.creationIndex;\n\n return cmp;\n}\n\n// Gives the permutation of all possible pathMatch()es of a given path. The\n// array is in longest-to-shortest order. Handy for indexing.\nfunction permutePath(path) {\n validators.validate(validators.isString(path));\n if (path === \"/\") {\n return [\"/\"];\n }\n const permutations = [path];\n while (path.length > 1) {\n const lindex = path.lastIndexOf(\"/\");\n if (lindex === 0) {\n break;\n }\n path = path.substr(0, lindex);\n permutations.push(path);\n }\n permutations.push(\"/\");\n return permutations;\n}\n\nfunction getCookieContext(url) {\n if (url instanceof Object) {\n return url;\n }\n // NOTE: decodeURI will throw on malformed URIs (see GH-32).\n // Therefore, we will just skip decoding for such URIs.\n try {\n url = decodeURI(url);\n } catch (err) {\n // Silently swallow error\n }\n\n return urlParse(url);\n}\n\nconst cookieDefaults = {\n // the order in which the RFC has them:\n key: \"\",\n value: \"\",\n expires: \"Infinity\",\n maxAge: null,\n domain: null,\n path: null,\n secure: false,\n httpOnly: false,\n extensions: null,\n // set by the CookieJar:\n hostOnly: null,\n pathIsDefault: null,\n creation: null,\n lastAccessed: null,\n sameSite: undefined\n};\n\nclass Cookie {\n constructor(options = {}) {\n const customInspectSymbol = getCustomInspectSymbol();\n if (customInspectSymbol) {\n this[customInspectSymbol] = this.inspect;\n }\n\n Object.assign(this, cookieDefaults, options);\n this.creation = this.creation || new Date();\n\n // used to break creation ties in cookieCompare():\n Object.defineProperty(this, \"creationIndex\", {\n configurable: false,\n enumerable: false, // important for assert.deepEqual checks\n writable: true,\n value: ++Cookie.cookiesCreated\n });\n }\n\n inspect() {\n const now = Date.now();\n const hostOnly = this.hostOnly != null ? this.hostOnly : \"?\";\n const createAge = this.creation\n ? `${now - this.creation.getTime()}ms`\n : \"?\";\n const accessAge = this.lastAccessed\n ? `${now - this.lastAccessed.getTime()}ms`\n : \"?\";\n return `Cookie=\"${this.toString()}; hostOnly=${hostOnly}; aAge=${accessAge}; cAge=${createAge}\"`;\n }\n\n toJSON() {\n const obj = {};\n\n for (const prop of Cookie.serializableProperties) {\n if (this[prop] === cookieDefaults[prop]) {\n continue; // leave as prototype default\n }\n\n if (\n prop === \"expires\" ||\n prop === \"creation\" ||\n prop === \"lastAccessed\"\n ) {\n if (this[prop] === null) {\n obj[prop] = null;\n } else {\n obj[prop] =\n this[prop] == \"Infinity\" // intentionally not ===\n ? \"Infinity\"\n : this[prop].toISOString();\n }\n } else if (prop === \"maxAge\") {\n if (this[prop] !== null) {\n // again, intentionally not ===\n obj[prop] =\n this[prop] == Infinity || this[prop] == -Infinity\n ? this[prop].toString()\n : this[prop];\n }\n } else {\n if (this[prop] !== cookieDefaults[prop]) {\n obj[prop] = this[prop];\n }\n }\n }\n\n return obj;\n }\n\n clone() {\n return fromJSON(this.toJSON());\n }\n\n validate() {\n if (!COOKIE_OCTETS.test(this.value)) {\n return false;\n }\n if (\n this.expires != Infinity &&\n !(this.expires instanceof Date) &&\n !parseDate(this.expires)\n ) {\n return false;\n }\n if (this.maxAge != null && this.maxAge <= 0) {\n return false; // \"Max-Age=\" non-zero-digit *DIGIT\n }\n if (this.path != null && !PATH_VALUE.test(this.path)) {\n return false;\n }\n\n const cdomain = this.cdomain();\n if (cdomain) {\n if (cdomain.match(/\\.$/)) {\n return false; // S4.1.2.3 suggests that this is bad. domainMatch() tests confirm this\n }\n const suffix = pubsuffix.getPublicSuffix(cdomain);\n if (suffix == null) {\n // it's a public suffix\n return false;\n }\n }\n return true;\n }\n\n setExpires(exp) {\n if (exp instanceof Date) {\n this.expires = exp;\n } else {\n this.expires = parseDate(exp) || \"Infinity\";\n }\n }\n\n setMaxAge(age) {\n if (age === Infinity || age === -Infinity) {\n this.maxAge = age.toString(); // so JSON.stringify() works\n } else {\n this.maxAge = age;\n }\n }\n\n cookieString() {\n let val = this.value;\n if (val == null) {\n val = \"\";\n }\n if (this.key === \"\") {\n return val;\n }\n return `${this.key}=${val}`;\n }\n\n // gives Set-Cookie header format\n toString() {\n let str = this.cookieString();\n\n if (this.expires != Infinity) {\n if (this.expires instanceof Date) {\n str += `; Expires=${formatDate(this.expires)}`;\n } else {\n str += `; Expires=${this.expires}`;\n }\n }\n\n if (this.maxAge != null && this.maxAge != Infinity) {\n str += `; Max-Age=${this.maxAge}`;\n }\n\n if (this.domain && !this.hostOnly) {\n str += `; Domain=${this.domain}`;\n }\n if (this.path) {\n str += `; Path=${this.path}`;\n }\n\n if (this.secure) {\n str += \"; Secure\";\n }\n if (this.httpOnly) {\n str += \"; HttpOnly\";\n }\n if (this.sameSite && this.sameSite !== \"none\") {\n const ssCanon = Cookie.sameSiteCanonical[this.sameSite.toLowerCase()];\n str += `; SameSite=${ssCanon ? ssCanon : this.sameSite}`;\n }\n if (this.extensions) {\n this.extensions.forEach(ext => {\n str += `; ${ext}`;\n });\n }\n\n return str;\n }\n\n // TTL() partially replaces the \"expiry-time\" parts of S5.3 step 3 (setCookie()\n // elsewhere)\n // S5.3 says to give the \"latest representable date\" for which we use Infinity\n // For \"expired\" we use 0\n TTL(now) {\n /* RFC6265 S4.1.2.2 If a cookie has both the Max-Age and the Expires\n * attribute, the Max-Age attribute has precedence and controls the\n * expiration date of the cookie.\n * (Concurs with S5.3 step 3)\n */\n if (this.maxAge != null) {\n return this.maxAge <= 0 ? 0 : this.maxAge * 1000;\n }\n\n let expires = this.expires;\n if (expires != Infinity) {\n if (!(expires instanceof Date)) {\n expires = parseDate(expires) || Infinity;\n }\n\n if (expires == Infinity) {\n return Infinity;\n }\n\n return expires.getTime() - (now || Date.now());\n }\n\n return Infinity;\n }\n\n // expiryTime() replaces the \"expiry-time\" parts of S5.3 step 3 (setCookie()\n // elsewhere)\n expiryTime(now) {\n if (this.maxAge != null) {\n const relativeTo = now || this.creation || new Date();\n const age = this.maxAge <= 0 ? -Infinity : this.maxAge * 1000;\n return relativeTo.getTime() + age;\n }\n\n if (this.expires == Infinity) {\n return Infinity;\n }\n return this.expires.getTime();\n }\n\n // expiryDate() replaces the \"expiry-time\" parts of S5.3 step 3 (setCookie()\n // elsewhere), except it returns a Date\n expiryDate(now) {\n const millisec = this.expiryTime(now);\n if (millisec == Infinity) {\n return new Date(MAX_TIME);\n } else if (millisec == -Infinity) {\n return new Date(MIN_TIME);\n } else {\n return new Date(millisec);\n }\n }\n\n // This replaces the \"persistent-flag\" parts of S5.3 step 3\n isPersistent() {\n return this.maxAge != null || this.expires != Infinity;\n }\n\n // Mostly S5.1.2 and S5.2.3:\n canonicalizedDomain() {\n if (this.domain == null) {\n return null;\n }\n return canonicalDomain(this.domain);\n }\n\n cdomain() {\n return this.canonicalizedDomain();\n }\n}\n\nCookie.cookiesCreated = 0;\nCookie.parse = parse;\nCookie.fromJSON = fromJSON;\nCookie.serializableProperties = Object.keys(cookieDefaults);\nCookie.sameSiteLevel = {\n strict: 3,\n lax: 2,\n none: 1\n};\n\nCookie.sameSiteCanonical = {\n strict: \"Strict\",\n lax: \"Lax\"\n};\n\nfunction getNormalizedPrefixSecurity(prefixSecurity) {\n if (prefixSecurity != null) {\n const normalizedPrefixSecurity = prefixSecurity.toLowerCase();\n /* The three supported options */\n switch (normalizedPrefixSecurity) {\n case PrefixSecurityEnum.STRICT:\n case PrefixSecurityEnum.SILENT:\n case PrefixSecurityEnum.DISABLED:\n return normalizedPrefixSecurity;\n }\n }\n /* Default is SILENT */\n return PrefixSecurityEnum.SILENT;\n}\n\nclass CookieJar {\n constructor(store, options = { rejectPublicSuffixes: true }) {\n if (typeof options === \"boolean\") {\n options = { rejectPublicSuffixes: options };\n }\n validators.validate(validators.isObject(options), options);\n this.rejectPublicSuffixes = options.rejectPublicSuffixes;\n this.enableLooseMode = !!options.looseMode;\n this.allowSpecialUseDomain =\n typeof options.allowSpecialUseDomain === \"boolean\"\n ? options.allowSpecialUseDomain\n : true;\n this.store = store || new MemoryCookieStore();\n this.prefixSecurity = getNormalizedPrefixSecurity(options.prefixSecurity);\n this._cloneSync = syncWrap(\"clone\");\n this._importCookiesSync = syncWrap(\"_importCookies\");\n this.getCookiesSync = syncWrap(\"getCookies\");\n this.getCookieStringSync = syncWrap(\"getCookieString\");\n this.getSetCookieStringsSync = syncWrap(\"getSetCookieStrings\");\n this.removeAllCookiesSync = syncWrap(\"removeAllCookies\");\n this.setCookieSync = syncWrap(\"setCookie\");\n this.serializeSync = syncWrap(\"serialize\");\n }\n\n setCookie(cookie, url, options, cb) {\n validators.validate(validators.isUrlStringOrObject(url), cb, options);\n\n let err;\n\n if (validators.isFunction(url)) {\n cb = url;\n return cb(new Error(\"No URL was specified\"));\n }\n\n const context = getCookieContext(url);\n if (validators.isFunction(options)) {\n cb = options;\n options = {};\n }\n\n validators.validate(validators.isFunction(cb), cb);\n\n if (\n !validators.isNonEmptyString(cookie) &&\n !validators.isObject(cookie) &&\n cookie instanceof String &&\n cookie.length == 0\n ) {\n return cb(null);\n }\n\n const host = canonicalDomain(context.hostname);\n const loose = options.loose || this.enableLooseMode;\n\n let sameSiteContext = null;\n if (options.sameSiteContext) {\n sameSiteContext = checkSameSiteContext(options.sameSiteContext);\n if (!sameSiteContext) {\n return cb(new Error(SAME_SITE_CONTEXT_VAL_ERR));\n }\n }\n\n // S5.3 step 1\n if (typeof cookie === \"string\" || cookie instanceof String) {\n cookie = Cookie.parse(cookie, { loose: loose });\n if (!cookie) {\n err = new Error(\"Cookie failed to parse\");\n return cb(options.ignoreError ? null : err);\n }\n } else if (!(cookie instanceof Cookie)) {\n // If you're seeing this error, and are passing in a Cookie object,\n // it *might* be a Cookie object from another loaded version of tough-cookie.\n err = new Error(\n \"First argument to setCookie must be a Cookie object or string\"\n );\n return cb(options.ignoreError ? null : err);\n }\n\n // S5.3 step 2\n const now = options.now || new Date(); // will assign later to save effort in the face of errors\n\n // S5.3 step 3: NOOP; persistent-flag and expiry-time is handled by getCookie()\n\n // S5.3 step 4: NOOP; domain is null by default\n\n // S5.3 step 5: public suffixes\n if (this.rejectPublicSuffixes && cookie.domain) {\n const suffix = pubsuffix.getPublicSuffix(cookie.cdomain(), {\n allowSpecialUseDomain: this.allowSpecialUseDomain,\n ignoreError: options.ignoreError\n });\n if (suffix == null && !IP_V6_REGEX_OBJECT.test(cookie.domain)) {\n // e.g. \"com\"\n err = new Error(\"Cookie has domain set to a public suffix\");\n return cb(options.ignoreError ? null : err);\n }\n }\n\n // S5.3 step 6:\n if (cookie.domain) {\n if (!domainMatch(host, cookie.cdomain(), false)) {\n err = new Error(\n `Cookie not in this host's domain. Cookie:${cookie.cdomain()} Request:${host}`\n );\n return cb(options.ignoreError ? null : err);\n }\n\n if (cookie.hostOnly == null) {\n // don't reset if already set\n cookie.hostOnly = false;\n }\n } else {\n cookie.hostOnly = true;\n cookie.domain = host;\n }\n\n //S5.2.4 If the attribute-value is empty or if the first character of the\n //attribute-value is not %x2F (\"/\"):\n //Let cookie-path be the default-path.\n if (!cookie.path || cookie.path[0] !== \"/\") {\n cookie.path = defaultPath(context.pathname);\n cookie.pathIsDefault = true;\n }\n\n // S5.3 step 8: NOOP; secure attribute\n // S5.3 step 9: NOOP; httpOnly attribute\n\n // S5.3 step 10\n if (options.http === false && cookie.httpOnly) {\n err = new Error(\"Cookie is HttpOnly and this isn't an HTTP API\");\n return cb(options.ignoreError ? null : err);\n }\n\n // 6252bis-02 S5.4 Step 13 & 14:\n if (\n cookie.sameSite !== \"none\" &&\n cookie.sameSite !== undefined &&\n sameSiteContext\n ) {\n // \"If the cookie's \"same-site-flag\" is not \"None\", and the cookie\n // is being set from a context whose \"site for cookies\" is not an\n // exact match for request-uri's host's registered domain, then\n // abort these steps and ignore the newly created cookie entirely.\"\n if (sameSiteContext === \"none\") {\n err = new Error(\n \"Cookie is SameSite but this is a cross-origin request\"\n );\n return cb(options.ignoreError ? null : err);\n }\n }\n\n /* 6265bis-02 S5.4 Steps 15 & 16 */\n const ignoreErrorForPrefixSecurity =\n this.prefixSecurity === PrefixSecurityEnum.SILENT;\n const prefixSecurityDisabled =\n this.prefixSecurity === PrefixSecurityEnum.DISABLED;\n /* If prefix checking is not disabled ...*/\n if (!prefixSecurityDisabled) {\n let errorFound = false;\n let errorMsg;\n /* Check secure prefix condition */\n if (!isSecurePrefixConditionMet(cookie)) {\n errorFound = true;\n errorMsg = \"Cookie has __Secure prefix but Secure attribute is not set\";\n } else if (!isHostPrefixConditionMet(cookie)) {\n /* Check host prefix condition */\n errorFound = true;\n errorMsg =\n \"Cookie has __Host prefix but either Secure or HostOnly attribute is not set or Path is not '/'\";\n }\n if (errorFound) {\n return cb(\n options.ignoreError || ignoreErrorForPrefixSecurity\n ? null\n : new Error(errorMsg)\n );\n }\n }\n\n const store = this.store;\n\n if (!store.updateCookie) {\n store.updateCookie = function(oldCookie, newCookie, cb) {\n this.putCookie(newCookie, cb);\n };\n }\n\n function withCookie(err, oldCookie) {\n if (err) {\n return cb(err);\n }\n\n const next = function(err) {\n if (err) {\n return cb(err);\n } else {\n cb(null, cookie);\n }\n };\n\n if (oldCookie) {\n // S5.3 step 11 - \"If the cookie store contains a cookie with the same name,\n // domain, and path as the newly created cookie:\"\n if (options.http === false && oldCookie.httpOnly) {\n // step 11.2\n err = new Error(\"old Cookie is HttpOnly and this isn't an HTTP API\");\n return cb(options.ignoreError ? null : err);\n }\n cookie.creation = oldCookie.creation; // step 11.3\n cookie.creationIndex = oldCookie.creationIndex; // preserve tie-breaker\n cookie.lastAccessed = now;\n // Step 11.4 (delete cookie) is implied by just setting the new one:\n store.updateCookie(oldCookie, cookie, next); // step 12\n } else {\n cookie.creation = cookie.lastAccessed = now;\n store.putCookie(cookie, next); // step 12\n }\n }\n\n store.findCookie(cookie.domain, cookie.path, cookie.key, withCookie);\n }\n\n // RFC6365 S5.4\n getCookies(url, options, cb) {\n validators.validate(validators.isUrlStringOrObject(url), cb, url);\n\n const context = getCookieContext(url);\n if (validators.isFunction(options)) {\n cb = options;\n options = {};\n }\n validators.validate(validators.isObject(options), cb, options);\n validators.validate(validators.isFunction(cb), cb);\n\n const host = canonicalDomain(context.hostname);\n const path = context.pathname || \"/\";\n\n let secure = options.secure;\n if (\n secure == null &&\n context.protocol &&\n (context.protocol == \"https:\" || context.protocol == \"wss:\")\n ) {\n secure = true;\n }\n\n let sameSiteLevel = 0;\n if (options.sameSiteContext) {\n const sameSiteContext = checkSameSiteContext(options.sameSiteContext);\n sameSiteLevel = Cookie.sameSiteLevel[sameSiteContext];\n if (!sameSiteLevel) {\n return cb(new Error(SAME_SITE_CONTEXT_VAL_ERR));\n }\n }\n\n let http = options.http;\n if (http == null) {\n http = true;\n }\n\n const now = options.now || Date.now();\n const expireCheck = options.expire !== false;\n const allPaths = !!options.allPaths;\n const store = this.store;\n\n function matchingCookie(c) {\n // \"Either:\n // The cookie's host-only-flag is true and the canonicalized\n // request-host is identical to the cookie's domain.\n // Or:\n // The cookie's host-only-flag is false and the canonicalized\n // request-host domain-matches the cookie's domain.\"\n if (c.hostOnly) {\n if (c.domain != host) {\n return false;\n }\n } else {\n if (!domainMatch(host, c.domain, false)) {\n return false;\n }\n }\n\n // \"The request-uri's path path-matches the cookie's path.\"\n if (!allPaths && !pathMatch(path, c.path)) {\n return false;\n }\n\n // \"If the cookie's secure-only-flag is true, then the request-uri's\n // scheme must denote a \"secure\" protocol\"\n if (c.secure && !secure) {\n return false;\n }\n\n // \"If the cookie's http-only-flag is true, then exclude the cookie if the\n // cookie-string is being generated for a \"non-HTTP\" API\"\n if (c.httpOnly && !http) {\n return false;\n }\n\n // RFC6265bis-02 S5.3.7\n if (sameSiteLevel) {\n const cookieLevel = Cookie.sameSiteLevel[c.sameSite || \"none\"];\n if (cookieLevel > sameSiteLevel) {\n // only allow cookies at or below the request level\n return false;\n }\n }\n\n // deferred from S5.3\n // non-RFC: allow retention of expired cookies by choice\n if (expireCheck && c.expiryTime() <= now) {\n store.removeCookie(c.domain, c.path, c.key, () => {}); // result ignored\n return false;\n }\n\n return true;\n }\n\n store.findCookies(\n host,\n allPaths ? null : path,\n this.allowSpecialUseDomain,\n (err, cookies) => {\n if (err) {\n return cb(err);\n }\n\n cookies = cookies.filter(matchingCookie);\n\n // sorting of S5.4 part 2\n if (options.sort !== false) {\n cookies = cookies.sort(cookieCompare);\n }\n\n // S5.4 part 3\n const now = new Date();\n for (const cookie of cookies) {\n cookie.lastAccessed = now;\n }\n // TODO persist lastAccessed\n\n cb(null, cookies);\n }\n );\n }\n\n getCookieString(...args) {\n const cb = args.pop();\n validators.validate(validators.isFunction(cb), cb);\n const next = function(err, cookies) {\n if (err) {\n cb(err);\n } else {\n cb(\n null,\n cookies\n .sort(cookieCompare)\n .map(c => c.cookieString())\n .join(\"; \")\n );\n }\n };\n args.push(next);\n this.getCookies.apply(this, args);\n }\n\n getSetCookieStrings(...args) {\n const cb = args.pop();\n validators.validate(validators.isFunction(cb), cb);\n const next = function(err, cookies) {\n if (err) {\n cb(err);\n } else {\n cb(\n null,\n cookies.map(c => {\n return c.toString();\n })\n );\n }\n };\n args.push(next);\n this.getCookies.apply(this, args);\n }\n\n serialize(cb) {\n validators.validate(validators.isFunction(cb), cb);\n let type = this.store.constructor.name;\n if (validators.isObject(type)) {\n type = null;\n }\n\n // update README.md \"Serialization Format\" if you change this, please!\n const serialized = {\n // The version of tough-cookie that serialized this jar. Generally a good\n // practice since future versions can make data import decisions based on\n // known past behavior. When/if this matters, use `semver`.\n version: `tough-cookie@${VERSION}`,\n\n // add the store type, to make humans happy:\n storeType: type,\n\n // CookieJar configuration:\n rejectPublicSuffixes: !!this.rejectPublicSuffixes,\n enableLooseMode: !!this.enableLooseMode,\n allowSpecialUseDomain: !!this.allowSpecialUseDomain,\n prefixSecurity: getNormalizedPrefixSecurity(this.prefixSecurity),\n\n // this gets filled from getAllCookies:\n cookies: []\n };\n\n if (\n !(\n this.store.getAllCookies &&\n typeof this.store.getAllCookies === \"function\"\n )\n ) {\n return cb(\n new Error(\n \"store does not support getAllCookies and cannot be serialized\"\n )\n );\n }\n\n this.store.getAllCookies((err, cookies) => {\n if (err) {\n return cb(err);\n }\n\n serialized.cookies = cookies.map(cookie => {\n // convert to serialized 'raw' cookies\n cookie = cookie instanceof Cookie ? cookie.toJSON() : cookie;\n\n // Remove the index so new ones get assigned during deserialization\n delete cookie.creationIndex;\n\n return cookie;\n });\n\n return cb(null, serialized);\n });\n }\n\n toJSON() {\n return this.serializeSync();\n }\n\n // use the class method CookieJar.deserialize instead of calling this directly\n _importCookies(serialized, cb) {\n let cookies = serialized.cookies;\n if (!cookies || !Array.isArray(cookies)) {\n return cb(new Error(\"serialized jar has no cookies array\"));\n }\n cookies = cookies.slice(); // do not modify the original\n\n const putNext = err => {\n if (err) {\n return cb(err);\n }\n\n if (!cookies.length) {\n return cb(err, this);\n }\n\n let cookie;\n try {\n cookie = fromJSON(cookies.shift());\n } catch (e) {\n return cb(e);\n }\n\n if (cookie === null) {\n return putNext(null); // skip this cookie\n }\n\n this.store.putCookie(cookie, putNext);\n };\n\n putNext();\n }\n\n clone(newStore, cb) {\n if (arguments.length === 1) {\n cb = newStore;\n newStore = null;\n }\n\n this.serialize((err, serialized) => {\n if (err) {\n return cb(err);\n }\n CookieJar.deserialize(serialized, newStore, cb);\n });\n }\n\n cloneSync(newStore) {\n if (arguments.length === 0) {\n return this._cloneSync();\n }\n if (!newStore.synchronous) {\n throw new Error(\n \"CookieJar clone destination store is not synchronous; use async API instead.\"\n );\n }\n return this._cloneSync(newStore);\n }\n\n removeAllCookies(cb) {\n validators.validate(validators.isFunction(cb), cb);\n const store = this.store;\n\n // Check that the store implements its own removeAllCookies(). The default\n // implementation in Store will immediately call the callback with a \"not\n // implemented\" Error.\n if (\n typeof store.removeAllCookies === \"function\" &&\n store.removeAllCookies !== Store.prototype.removeAllCookies\n ) {\n return store.removeAllCookies(cb);\n }\n\n store.getAllCookies((err, cookies) => {\n if (err) {\n return cb(err);\n }\n\n if (cookies.length === 0) {\n return cb(null);\n }\n\n let completedCount = 0;\n const removeErrors = [];\n\n function removeCookieCb(removeErr) {\n if (removeErr) {\n removeErrors.push(removeErr);\n }\n\n completedCount++;\n\n if (completedCount === cookies.length) {\n return cb(removeErrors.length ? removeErrors[0] : null);\n }\n }\n\n cookies.forEach(cookie => {\n store.removeCookie(\n cookie.domain,\n cookie.path,\n cookie.key,\n removeCookieCb\n );\n });\n });\n }\n\n static deserialize(strOrObj, store, cb) {\n if (arguments.length !== 3) {\n // store is optional\n cb = store;\n store = null;\n }\n validators.validate(validators.isFunction(cb), cb);\n\n let serialized;\n if (typeof strOrObj === \"string\") {\n serialized = jsonParse(strOrObj);\n if (serialized instanceof Error) {\n return cb(serialized);\n }\n } else {\n serialized = strOrObj;\n }\n\n const jar = new CookieJar(store, {\n rejectPublicSuffixes: serialized.rejectPublicSuffixes,\n looseMode: serialized.enableLooseMode,\n allowSpecialUseDomain: serialized.allowSpecialUseDomain,\n prefixSecurity: serialized.prefixSecurity\n });\n jar._importCookies(serialized, err => {\n if (err) {\n return cb(err);\n }\n cb(null, jar);\n });\n }\n\n static deserializeSync(strOrObj, store) {\n const serialized =\n typeof strOrObj === \"string\" ? JSON.parse(strOrObj) : strOrObj;\n const jar = new CookieJar(store, {\n rejectPublicSuffixes: serialized.rejectPublicSuffixes,\n looseMode: serialized.enableLooseMode\n });\n\n // catch this mistake early:\n if (!jar.store.synchronous) {\n throw new Error(\n \"CookieJar store is not synchronous; use async API instead.\"\n );\n }\n\n jar._importCookiesSync(serialized);\n return jar;\n }\n}\nCookieJar.fromJSON = CookieJar.deserializeSync;\n\n[\n \"_importCookies\",\n \"clone\",\n \"getCookies\",\n \"getCookieString\",\n \"getSetCookieStrings\",\n \"removeAllCookies\",\n \"serialize\",\n \"setCookie\"\n].forEach(name => {\n CookieJar.prototype[name] = fromCallback(CookieJar.prototype[name]);\n});\nCookieJar.deserialize = fromCallback(CookieJar.deserialize);\n\n// Use a closure to provide a true imperative API for synchronous stores.\nfunction syncWrap(method) {\n return function(...args) {\n if (!this.store.synchronous) {\n throw new Error(\n \"CookieJar store is not synchronous; use async API instead.\"\n );\n }\n\n let syncErr, syncResult;\n this[method](...args, (err, result) => {\n syncErr = err;\n syncResult = result;\n });\n\n if (syncErr) {\n throw syncErr;\n }\n return syncResult;\n };\n}\n\nexports.version = VERSION;\nexports.CookieJar = CookieJar;\nexports.Cookie = Cookie;\nexports.Store = Store;\nexports.MemoryCookieStore = MemoryCookieStore;\nexports.parseDate = parseDate;\nexports.formatDate = formatDate;\nexports.parse = parse;\nexports.fromJSON = fromJSON;\nexports.domainMatch = domainMatch;\nexports.defaultPath = defaultPath;\nexports.pathMatch = pathMatch;\nexports.getPublicSuffix = pubsuffix.getPublicSuffix;\nexports.cookieCompare = cookieCompare;\nexports.permuteDomain = require(\"./permuteDomain\").permuteDomain;\nexports.permutePath = permutePath;\nexports.canonicalDomain = canonicalDomain;\nexports.PrefixSecurityEnum = PrefixSecurityEnum;\nexports.ParameterError = validators.ParameterError;\n","\"use strict\";\n\nvar defaultParseOptions = {\n decodeValues: true,\n map: false,\n silent: false,\n};\n\nfunction isNonEmptyString(str) {\n return typeof str === \"string\" && !!str.trim();\n}\n\nfunction parseString(setCookieValue, options) {\n var parts = setCookieValue.split(\";\").filter(isNonEmptyString);\n\n var nameValuePairStr = parts.shift();\n var parsed = parseNameValuePair(nameValuePairStr);\n var name = parsed.name;\n var value = parsed.value;\n\n options = options\n ? Object.assign({}, defaultParseOptions, options)\n : defaultParseOptions;\n\n try {\n value = options.decodeValues ? decodeURIComponent(value) : value; // decode cookie value\n } catch (e) {\n console.error(\n \"set-cookie-parser encountered an error while decoding a cookie with value '\" +\n value +\n \"'. Set options.decodeValues to false to disable this feature.\",\n e\n );\n }\n\n var cookie = {\n name: name,\n value: value,\n };\n\n parts.forEach(function (part) {\n var sides = part.split(\"=\");\n var key = sides.shift().trimLeft().toLowerCase();\n var value = sides.join(\"=\");\n if (key === \"expires\") {\n cookie.expires = new Date(value);\n } else if (key === \"max-age\") {\n cookie.maxAge = parseInt(value, 10);\n } else if (key === \"secure\") {\n cookie.secure = true;\n } else if (key === \"httponly\") {\n cookie.httpOnly = true;\n } else if (key === \"samesite\") {\n cookie.sameSite = value;\n } else {\n cookie[key] = value;\n }\n });\n\n return cookie;\n}\n\nfunction parseNameValuePair(nameValuePairStr) {\n // Parses name-value-pair according to rfc6265bis draft\n\n var name = \"\";\n var value = \"\";\n var nameValueArr = nameValuePairStr.split(\"=\");\n if (nameValueArr.length > 1) {\n name = nameValueArr.shift();\n value = nameValueArr.join(\"=\"); // everything after the first =, joined by a \"=\" if there was more than one part\n } else {\n value = nameValuePairStr;\n }\n\n return { name: name, value: value };\n}\n\nfunction parse(input, options) {\n options = options\n ? Object.assign({}, defaultParseOptions, options)\n : defaultParseOptions;\n\n if (!input) {\n if (!options.map) {\n return [];\n } else {\n return {};\n }\n }\n\n if (input.headers) {\n if (typeof input.headers.getSetCookie === \"function\") {\n // for fetch responses - they combine headers of the same type in the headers array,\n // but getSetCookie returns an uncombined array\n input = input.headers.getSetCookie();\n } else if (input.headers[\"set-cookie\"]) {\n // fast-path for node.js (which automatically normalizes header names to lower-case\n input = input.headers[\"set-cookie\"];\n } else {\n // slow-path for other environments - see #25\n var sch =\n input.headers[\n Object.keys(input.headers).find(function (key) {\n return key.toLowerCase() === \"set-cookie\";\n })\n ];\n // warn if called on a request-like object with a cookie header rather than a set-cookie header - see #34, 36\n if (!sch && input.headers.cookie && !options.silent) {\n console.warn(\n \"Warning: set-cookie-parser appears to have been called on a request object. It is designed to parse Set-Cookie headers from responses, not Cookie headers from requests. Set the option {silent: true} to suppress this warning.\"\n );\n }\n input = sch;\n }\n }\n if (!Array.isArray(input)) {\n input = [input];\n }\n\n options = options\n ? Object.assign({}, defaultParseOptions, options)\n : defaultParseOptions;\n\n if (!options.map) {\n return input.filter(isNonEmptyString).map(function (str) {\n return parseString(str, options);\n });\n } else {\n var cookies = {};\n return input.filter(isNonEmptyString).reduce(function (cookies, str) {\n var cookie = parseString(str, options);\n cookies[cookie.name] = cookie;\n return cookies;\n }, cookies);\n }\n}\n\n/*\n Set-Cookie header field-values are sometimes comma joined in one string. This splits them without choking on commas\n that are within a single set-cookie field-value, such as in the Expires portion.\n\n This is uncommon, but explicitly allowed - see https://tools.ietf.org/html/rfc2616#section-4.2\n Node.js does this for every header *except* set-cookie - see https://github.com/nodejs/node/blob/d5e363b77ebaf1caf67cd7528224b651c86815c1/lib/_http_incoming.js#L128\n React Native's fetch does this for *every* header, including set-cookie.\n\n Based on: https://github.com/google/j2objc/commit/16820fdbc8f76ca0c33472810ce0cb03d20efe25\n Credits to: https://github.com/tomball for original and https://github.com/chrusart for JavaScript implementation\n*/\nfunction splitCookiesString(cookiesString) {\n if (Array.isArray(cookiesString)) {\n return cookiesString;\n }\n if (typeof cookiesString !== \"string\") {\n return [];\n }\n\n var cookiesStrings = [];\n var pos = 0;\n var start;\n var ch;\n var lastComma;\n var nextStart;\n var cookiesSeparatorFound;\n\n function skipWhitespace() {\n while (pos < cookiesString.length && /\\s/.test(cookiesString.charAt(pos))) {\n pos += 1;\n }\n return pos < cookiesString.length;\n }\n\n function notSpecialChar() {\n ch = cookiesString.charAt(pos);\n\n return ch !== \"=\" && ch !== \";\" && ch !== \",\";\n }\n\n while (pos < cookiesString.length) {\n start = pos;\n cookiesSeparatorFound = false;\n\n while (skipWhitespace()) {\n ch = cookiesString.charAt(pos);\n if (ch === \",\") {\n // ',' is a cookie separator if we have later first '=', not ';' or ','\n lastComma = pos;\n pos += 1;\n\n skipWhitespace();\n nextStart = pos;\n\n while (pos < cookiesString.length && notSpecialChar()) {\n pos += 1;\n }\n\n // currently special character\n if (pos < cookiesString.length && cookiesString.charAt(pos) === \"=\") {\n // we found cookies separator\n cookiesSeparatorFound = true;\n // pos is inside the next cookie, so back up and return it.\n pos = nextStart;\n cookiesStrings.push(cookiesString.substring(start, lastComma));\n start = pos;\n } else {\n // in param ',' or param separator ';',\n // we continue from that comma\n pos = lastComma + 1;\n }\n } else {\n pos += 1;\n }\n }\n\n if (!cookiesSeparatorFound || pos >= cookiesString.length) {\n cookiesStrings.push(cookiesString.substring(start, cookiesString.length));\n }\n }\n\n return cookiesStrings;\n}\n\nmodule.exports = parse;\nmodule.exports.parse = parse;\nmodule.exports.parseString = parseString;\nmodule.exports.splitCookiesString = splitCookiesString;\n","\"use strict\";\n\nvar realFetch = require('node-fetch');\nmodule.exports = function(url, options) {\n\tif (/^\\/\\//.test(url)) {\n\t\turl = 'https:' + url;\n\t}\n\treturn realFetch.call(this, url, options);\n};\n\nif (!global.fetch) {\n\tglobal.fetch = module.exports;\n\tglobal.Response = realFetch.Response;\n\tglobal.Headers = realFetch.Headers;\n\tglobal.Request = realFetch.Request;\n}\n","(function (name, context, definition) {\n if (typeof module !== 'undefined' && module.exports) module.exports = definition();\n else if (typeof define === 'function' && define.amd) define(definition);\n else context[name] = definition();\n})('urljoin', this, function () {\n\n function normalize (strArray) {\n var resultArray = [];\n if (strArray.length === 0) { return ''; }\n\n if (typeof strArray[0] !== 'string') {\n throw new TypeError('Url must be a string. Received ' + strArray[0]);\n }\n\n // If the first part is a plain protocol, we combine it with the next part.\n if (strArray[0].match(/^[^/:]+:\\/*$/) && strArray.length > 1) {\n var first = strArray.shift();\n strArray[0] = first + strArray[0];\n }\n\n // There must be two or three slashes in the file protocol, two slashes in anything else.\n if (strArray[0].match(/^file:\\/\\/\\//)) {\n strArray[0] = strArray[0].replace(/^([^/:]+):\\/*/, '$1:///');\n } else {\n strArray[0] = strArray[0].replace(/^([^/:]+):\\/*/, '$1://');\n }\n\n for (var i = 0; i < strArray.length; i++) {\n var component = strArray[i];\n\n if (typeof component !== 'string') {\n throw new TypeError('Url must be a string. Received ' + component);\n }\n\n if (component === '') { continue; }\n\n if (i > 0) {\n // Removing the starting slashes for each component but the first.\n component = component.replace(/^[\\/]+/, '');\n }\n if (i < strArray.length - 1) {\n // Removing the ending slashes for each component but the last.\n component = component.replace(/[\\/]+$/, '');\n } else {\n // For the last component we will combine multiple slashes to a single one.\n component = component.replace(/[\\/]+$/, '/');\n }\n\n resultArray.push(component);\n\n }\n\n var str = resultArray.join('/');\n // Each input component is now separated by a single slash except the possible first plain protocol part.\n\n // remove trailing slash before parameters or hash\n str = str.replace(/\\/(\\?|&|#[^!])/g, '$1');\n\n // replace ? in parameters with &\n var parts = str.split('?');\n str = parts.shift() + (parts.length > 0 ? '?': '') + parts.join('&');\n\n return str;\n }\n\n return function () {\n var input;\n\n if (typeof arguments[0] === 'object') {\n input = arguments[0];\n } else {\n input = [].slice.call(arguments);\n }\n\n return normalize(input);\n };\n\n});\n","import { errorString, GLOBAL_CONFIG, mergeProcessResults, Plugin, PluginManager, USER_PROCESSOR } from '@sentio/runtime'\nimport {\n ContractConfig,\n DataBinding,\n HandlerType,\n InitResponse,\n ProcessConfigResponse,\n ProcessResult,\n StartRequest\n} from '@sentio/protos'\n\nimport { ServerError, Status } from 'nice-grpc'\nimport { TemplateInstanceState } from '../core/template.js'\nimport { HandlerRegister } from '../core/handler-register.js'\nimport { StarknetProcessorState } from './starknet-processor.js'\nimport { hash } from 'starknet'\n\nexport class StarknetPlugin extends Plugin {\n name: string = 'StarknetPlugin'\n handlerRegister = new HandlerRegister()\n\n async init(config: InitResponse) {\n for (const solanaProcessor of StarknetProcessorState.INSTANCE.getValues()) {\n const chainId = solanaProcessor.config.chainId\n config.chainIds.push(chainId)\n }\n }\n\n async configure(config: ProcessConfigResponse, forChainId?: string) {\n this.handlerRegister.clear(forChainId as any)\n\n for (const processor of StarknetProcessorState.INSTANCE.getValues()) {\n const chainId = processor.config.chainId\n if (forChainId !== undefined && forChainId !== chainId.toString()) {\n continue\n }\n await processor.configure()\n const contractConfig = ContractConfig.fromPartial({\n processorType: USER_PROCESSOR,\n contract: {\n name: processor.config.name,\n chainId: processor.config.chainId.toString(),\n address: processor.config.address || '*',\n abi: ''\n },\n startBlock: processor.config.startBlock,\n endBlock: processor.config.endBlock\n })\n for (const callHandler of processor.callHandlers) {\n const handlerId = this.handlerRegister.register(callHandler.handler, chainId)\n\n if (callHandler.eventFilter) {\n contractConfig.starknetEventConfigs.push({\n filters: callHandler.eventFilter.map((e) => ({\n address: processor.config.address,\n keys: [hash.getSelectorFromName(e)]\n })),\n handlerId,\n handlerName: callHandler.handlerName\n })\n }\n }\n\n // Finish up a contract\n config.contractConfigs.push(contractConfig)\n }\n }\n\n supportedHandlers = [HandlerType.STARKNET_EVENT]\n\n processBinding(request: DataBinding): Promise<ProcessResult> {\n switch (request.handlerType) {\n case HandlerType.STARKNET_EVENT:\n return this.processEvent(request)\n default:\n throw new ServerError(Status.INVALID_ARGUMENT, 'No handle type registered ' + request.handlerType)\n }\n }\n\n async start(request: StartRequest) {}\n\n stateDiff(config: ProcessConfigResponse): boolean {\n return TemplateInstanceState.INSTANCE.getValues().length !== config.templateInstances.length\n }\n\n async processEvent(binding: DataBinding): Promise<ProcessResult> {\n if (!binding.data?.starknetEvents?.result) {\n throw new ServerError(Status.INVALID_ARGUMENT, \"starknetEvents can't be null\")\n }\n\n const promises: Promise<ProcessResult>[] = []\n\n const result = binding.data?.starknetEvents?.result\n\n for (const handlerId of binding.handlerIds) {\n const promise = this.handlerRegister\n .getHandlerById(\n binding.chainId,\n handlerId\n )(binding.data?.starknetEvents)\n .catch((e: any) => {\n throw new ServerError(\n Status.INTERNAL,\n 'error processing transaction: ' + JSON.stringify(result) + '\\n' + errorString(e)\n )\n })\n if (GLOBAL_CONFIG.execution.sequential) {\n await promise\n }\n promises.push(promise)\n }\n return mergeProcessResults(await Promise.all(promises))\n }\n}\n\nPluginManager.INSTANCE.register(new StarknetPlugin())\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));","import { Data_StarknetEvent, ProcessResult } from '@sentio/protos'\nimport { StarknetChainId } from '@sentio/chain'\nimport { CallData, events, ParsedEvent, RpcProvider } from 'starknet'\nimport { StarknetContext } from './context.js'\nimport { StarknetEvent } from './event.js'\nimport { ListStateStorage, mergeProcessResults } from '@sentio/runtime'\nimport { StarknetProcessorConfig } from './types.js'\nimport { StarknetContractView } from './contract.js'\nimport { getHandlerName, proxyProcessor } from '../utils/metrics.js'\nimport { HandlerOptions } from '../core/handler-options.js'\n\nexport class StarknetProcessor {\n callHandlers: CallHandler<Data_StarknetEvent>[] = []\n\n private provider: RpcProvider\n\n static bind(config: StarknetProcessorConfig): StarknetProcessor {\n const processor = new StarknetProcessor(config)\n StarknetProcessorState.INSTANCE.addValue(processor)\n return processor\n }\n\n classHash: string\n\n constructor(readonly config: StarknetProcessorConfig) {\n return proxyProcessor(this)\n }\n\n async configure() {\n this.provider = new RpcProvider({\n nodeUrl: getRpcEndpoint(this.config.chainId)\n })\n const classHash = await this.provider.getClassHashAt(this.config.address)\n if (!classHash) {\n throw new Error(\"can't find the class hash defined at \" + this.config.address)\n }\n this.classHash = classHash\n if (!this.config.abi) {\n const clazz = await this.provider.getClass(classHash, 'latest')\n this.config.abi = clazz.abi\n }\n }\n\n public onEvent(\n event: string | string[],\n handler: (events: StarknetEvent<ParsedEvent>, ctx: StarknetContext<StarknetContractView>) => void | Promise<void>,\n handlerOptions?: HandlerOptions<object, StarknetEvent<ParsedEvent>>\n ) {\n const eventFilter = Array.isArray(event) ? event : [event]\n if (!this.config.abi) {\n throw new Error('abi not found')\n }\n const abi = this.config.abi\n const callHandler = {\n handlerName: getHandlerName(),\n handler: async (call: Data_StarknetEvent) => {\n try {\n const eventData = [call.result] as any[]\n const abiEvents = events.getAbiEvents(abi)\n\n const abiStructs = CallData.getAbiStruct(abi)\n const abiEnums = CallData.getAbiEnum(abi)\n\n const parsedEvents = events.parseEvents(eventData, abiEvents, abiStructs, abiEnums)\n const results: ProcessResult[] = []\n const { block_hash, block_number, transaction_hash, from_address } = call.result!\n for (let i = 0; i < parsedEvents.length; i++) {\n const ctx = new StarknetContext<StarknetContractView>(\n this.config,\n this.provider,\n block_number,\n block_hash,\n transaction_hash,\n i,\n this.classHash\n )\n const e = new StarknetEvent(from_address, transaction_hash, parsedEvents[i])\n try {\n await handler(e, ctx)\n } catch (e) {\n console.error(e)\n }\n results.push(ctx.stopAndGetResult())\n }\n return mergeProcessResults(results)\n } catch (e) {\n console.error(e)\n return ProcessResult.fromPartial({})\n }\n },\n eventFilter,\n partitionHandler: async (call: Data_StarknetEvent): Promise<string | undefined> => {\n const p = handlerOptions?.partitionKey\n if (!p) return undefined\n if (typeof p === 'function') {\n try {\n const eventData = [call.result] as any[]\n const abiEvents = events.getAbiEvents(abi)\n const abiStructs = CallData.getAbiStruct(abi)\n const abiEnums = CallData.getAbiEnum(abi)\n const parsedEvents = events.parseEvents(eventData, abiEvents, abiStructs, abiEnums)\n if (parsedEvents.length > 0) {\n const { from_address, transaction_hash } = call.result!\n const e = new StarknetEvent(from_address, transaction_hash, parsedEvents[0])\n return p(e)\n }\n return undefined\n } catch (e) {\n console.error(e)\n return undefined\n }\n }\n return p\n }\n }\n this.callHandlers.push(callHandler)\n return this\n }\n}\n\nexport type CallHandler<T> = {\n handlerName: string\n handler: (call: T) => Promise<ProcessResult>\n eventFilter?: string[]\n partitionHandler?: (call: T) => Promise<string | undefined>\n}\n\nfunction getRpcEndpoint(chainId: StarknetChainId | string) {\n switch (chainId) {\n case StarknetChainId.STARKNET_MAINNET:\n return 'https://starknet-mainnet.g.alchemy.com/starknet/version/rpc/v0_8/8sD5yitBslIYCPFzSq_Q1ObJHqPlZxFw'\n default:\n return 'https://starknet-sepolia.g.alchemy.com/starknet/version/rpc/v0_8/8sD5yitBslIYCPFzSq_Q1ObJHqPlZxFw'\n }\n}\n\nexport class StarknetProcessorState extends ListStateStorage<StarknetProcessor> {\n static INSTANCE = new StarknetProcessorState()\n}\n\nexport abstract class AbstractStarknetProcessor {\n private readonly processor: StarknetProcessor\n protected constructor(\n readonly abi: any,\n readonly config: StarknetProcessorConfig\n ) {\n this.processor = new StarknetProcessor(config)\n StarknetProcessorState.INSTANCE.addValue(this.processor)\n return proxyProcessor(this)\n }\n\n onEvent<T, C>(\n eventName: string,\n structName: string,\n handler: (event: StarknetEvent<T>, ctx: StarknetContext<C>) => Promise<void>\n ) {\n this.processor.onEvent(eventName, async (events, ctx) => {\n const eventData = events.data[structName] as T\n const e = new StarknetEvent<T>(events.caller, events.transactionHash, eventData)\n await handler(e, ctx as StarknetContext<C>)\n })\n return this\n }\n}\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));",null,null,"export {};\n//# sourceMappingURL=errors.js.map",null,null,null,null,null,"/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// Utilities\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport function assertNumber(n: number) {\n if (!Number.isSafeInteger(n)) throw new Error(`Wrong integer: ${n}`);\n}\nexport interface Coder<F, T> {\n encode(from: F): T;\n decode(to: T): F;\n}\n\nexport interface BytesCoder extends Coder<Uint8Array, string> {\n encode: (data: Uint8Array) => string;\n decode: (str: string) => Uint8Array;\n}\n\nfunction isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\n// TODO: some recusive type inference so it would check correct order of input/output inside rest?\n// like <string, number>, <number, bytes>, <bytes, float>\ntype Chain = [Coder<any, any>, ...Coder<any, any>[]];\n// Extract info from Coder type\ntype Input<F> = F extends Coder<infer T, any> ? T : never;\ntype Output<F> = F extends Coder<any, infer T> ? T : never;\n// Generic function for arrays\ntype First<T> = T extends [infer U, ...any[]] ? U : never;\ntype Last<T> = T extends [...any[], infer U] ? U : never;\ntype Tail<T> = T extends [any, ...infer U] ? U : never;\n\ntype AsChain<C extends Chain, Rest = Tail<C>> = {\n // C[K] = Coder<Input<C[K]>, Input<Rest[k]>>\n [K in keyof C]: Coder<Input<C[K]>, Input<K extends keyof Rest ? Rest[K] : any>>;\n};\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain<T extends Chain & AsChain<T>>(...args: T): Coder<Input<First<T>>, Output<Last<T>>> {\n const id = (a: any) => a;\n // Wrap call in closure so JIT can inline calls\n const wrap = (a: any, b: any) => (c: any) => a(b(c));\n // Construct chain of args[-1].encode(args[-2].encode([...]))\n const encode = args.map((x) => x.encode).reduceRight(wrap, id);\n // Construct chain of args[0].decode(args[1].decode(...))\n const decode = args.map((x) => x.decode).reduce(wrap, id);\n return { encode, decode };\n}\n\ntype Alphabet = string[] | string;\n\n/**\n * Encodes integer radix representation to array of strings using alphabet and back\n * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(alphabet: Alphabet): Coder<number[], string[]> {\n return {\n encode: (digits: number[]) => {\n if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n throw new Error('alphabet.encode input should be an array of numbers');\n return digits.map((i) => {\n assertNumber(i);\n if (i < 0 || i >= alphabet.length)\n throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n return alphabet[i]!;\n });\n },\n decode: (input: string[]) => {\n if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n throw new Error('alphabet.decode input should be array of strings');\n return input.map((letter) => {\n if (typeof letter !== 'string')\n throw new Error(`alphabet.decode: not string element=${letter}`);\n const index = alphabet.indexOf(letter);\n if (index === -1) throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n return index;\n });\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = ''): Coder<string[], string> {\n if (typeof separator !== 'string') throw new Error('join separator should be string');\n return {\n encode: (from) => {\n if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n throw new Error('join.encode input should be array of strings');\n for (let i of from)\n if (typeof i !== 'string') throw new Error(`join.encode: non-string input=${i}`);\n return from.join(separator);\n },\n decode: (to) => {\n if (typeof to !== 'string') throw new Error('join.decode input should be string');\n return to.split(separator);\n },\n };\n}\n\n/**\n * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\n */\nfunction padding(bits: number, chr = '='): Coder<string[], string[]> {\n assertNumber(bits);\n if (typeof chr !== 'string') throw new Error('padding chr should be string');\n return {\n encode(data: string[]): string[] {\n if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n throw new Error('padding.encode input should be array of strings');\n for (let i of data)\n if (typeof i !== 'string') throw new Error(`padding.encode: non-string input=${i}`);\n while ((data.length * bits) % 8) data.push(chr);\n return data;\n },\n decode(input: string[]): string[] {\n if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n throw new Error('padding.encode input should be array of strings');\n for (let i of input)\n if (typeof i !== 'string') throw new Error(`padding.decode: non-string input=${i}`);\n let end = input.length;\n if ((end * bits) % 8)\n throw new Error('Invalid padding: string should have whole number of bytes');\n for (; end > 0 && input[end - 1] === chr; end--) {\n if (!(((end - 1) * bits) % 8))\n throw new Error('Invalid padding: string has too much padding');\n }\n return input.slice(0, end);\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction normalize<T>(fn: (val: T) => T): Coder<T, T> {\n if (typeof fn !== 'function') throw new Error('normalize fn should be function');\n return { encode: (from: T) => from, decode: (to: T) => fn(to) };\n}\n\n/**\n * Slow: O(n^2) time complexity\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix(data: number[], from: number, to: number) {\n // base 1 is impossible\n if (from < 2) throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n if (to < 2) throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n if (!Array.isArray(data)) throw new Error('convertRadix: data should be array');\n if (!data.length) return [];\n let pos = 0;\n const res = [];\n const digits = Array.from(data);\n digits.forEach((d) => {\n assertNumber(d);\n if (d < 0 || d >= from) throw new Error(`Wrong integer: ${d}`);\n });\n while (true) {\n let carry = 0;\n let done = true;\n for (let i = pos; i < digits.length; i++) {\n const digit = digits[i]!;\n const digitBase = from * carry + digit;\n if (\n !Number.isSafeInteger(digitBase) ||\n (from * carry) / from !== carry ||\n digitBase - digit !== from * carry\n ) {\n throw new Error('convertRadix: carry overflow');\n }\n carry = digitBase % to;\n const rounded = Math.floor(digitBase / to);\n digits[i] = rounded;\n if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase)\n throw new Error('convertRadix: carry overflow');\n if (!done) continue;\n else if (!rounded) pos = i;\n else done = false;\n }\n res.push(carry);\n if (done) break;\n }\n for (let i = 0; i < data.length - 1 && data[i] === 0; i++) res.push(0);\n return res.reverse();\n}\n\nconst gcd = /* @__NO_SIDE_EFFECTS__ */ (a: number, b: number): number => (!b ? a : gcd(b, a % b));\nconst radix2carry = /*@__NO_SIDE_EFFECTS__ */ (from: number, to: number) =>\n from + (to - gcd(from, to));\n/**\n * Implemented with numbers, because BigInt is 5x slower\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix2(data: number[], from: number, to: number, padding: boolean): number[] {\n if (!Array.isArray(data)) throw new Error('convertRadix2: data should be array');\n if (from <= 0 || from > 32) throw new Error(`convertRadix2: wrong from=${from}`);\n if (to <= 0 || to > 32) throw new Error(`convertRadix2: wrong to=${to}`);\n if (radix2carry(from, to) > 32) {\n throw new Error(\n `convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`\n );\n }\n let carry = 0;\n let pos = 0; // bitwise position in current element\n const mask = 2 ** to - 1;\n const res: number[] = [];\n for (const n of data) {\n assertNumber(n);\n if (n >= 2 ** from) throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n carry = (carry << from) | n;\n if (pos + from > 32) throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n pos += from;\n for (; pos >= to; pos -= to) res.push(((carry >> (pos - to)) & mask) >>> 0);\n carry &= 2 ** pos - 1; // clean carry, otherwise it will cause overflow\n }\n carry = (carry << (to - pos)) & mask;\n if (!padding && pos >= from) throw new Error('Excess padding');\n if (!padding && carry) throw new Error(`Non-zero padding: ${carry}`);\n if (padding && pos > 0) res.push(carry >>> 0);\n return res;\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num: number): Coder<Uint8Array, number[]> {\n assertNumber(num);\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix.encode input should be Uint8Array');\n return convertRadix(Array.from(bytes), 2 ** 8, num);\n },\n decode: (digits: number[]) => {\n if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n throw new Error('radix.decode input should be array of numbers');\n return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n },\n };\n}\n\n/**\n * If both bases are power of same number (like `2**8 <-> 2**64`),\n * there is a linear algorithm. For now we have implementation for power-of-two bases only.\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix2(bits: number, revPadding = false): Coder<Uint8Array, number[]> {\n assertNumber(bits);\n if (bits <= 0 || bits > 32) throw new Error('radix2: bits should be in (0..32]');\n if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n throw new Error('radix2: carry overflow');\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix2.encode input should be Uint8Array');\n return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n },\n decode: (digits: number[]) => {\n if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n throw new Error('radix2.decode input should be array of numbers');\n return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n },\n };\n}\n\ntype ArgumentTypes<F extends Function> = F extends (...args: infer A) => any ? A : never;\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction unsafeWrapper<T extends (...args: any) => any>(fn: T) {\n if (typeof fn !== 'function') throw new Error('unsafeWrapper fn should be function');\n return function (...args: ArgumentTypes<T>): ReturnType<T> | void {\n try {\n return fn.apply(null, args);\n } catch (e) {}\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction checksum(\n len: number,\n fn: (data: Uint8Array) => Uint8Array\n): Coder<Uint8Array, Uint8Array> {\n assertNumber(len);\n if (typeof fn !== 'function') throw new Error('checksum fn should be function');\n return {\n encode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.encode: input should be Uint8Array');\n const checksum = fn(data).slice(0, len);\n const res = new Uint8Array(data.length + len);\n res.set(data);\n res.set(checksum, data.length);\n return res;\n },\n decode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.decode: input should be Uint8Array');\n const payload = data.slice(0, -len);\n const newChecksum = fn(payload).slice(0, len);\n const oldChecksum = data.slice(-len);\n for (let i = 0; i < len; i++)\n if (newChecksum[i] !== oldChecksum[i]) throw new Error('Invalid checksum');\n return payload;\n },\n };\n}\n\n// prettier-ignore\nexport const utils = {\n alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n\n// RFC 4648 aka RFC 3548\n// ---------------------\nexport const base16: BytesCoder = /* @__PURE__ */ chain(\n radix2(4),\n alphabet('0123456789ABCDEF'),\n join('')\n);\nexport const base32: BytesCoder = /* @__PURE__ */ chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n padding(5),\n join('')\n);\nexport const base32nopad: BytesCoder = /* @__PURE__ */ chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n join('')\n);\nexport const base32hex: BytesCoder = /* @__PURE__ */ chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n padding(5),\n join('')\n);\nexport const base32hexnopad: BytesCoder = /* @__PURE__ */ chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n join('')\n);\nexport const base32crockford: BytesCoder = /* @__PURE__ */ chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'),\n join(''),\n normalize((s: string) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1'))\n);\nexport const base64: BytesCoder = /* @__PURE__ */ chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n padding(6),\n join('')\n);\nexport const base64nopad: BytesCoder = /* @__PURE__ */ chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n join('')\n);\nexport const base64url: BytesCoder = /* @__PURE__ */ chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n padding(6),\n join('')\n);\nexport const base64urlnopad: BytesCoder = /* @__PURE__ */ chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n join('')\n);\n\n// base58 code\n// -----------\nconst genBase58 = (abc: string) => chain(radix(58), alphabet(abc), join(''));\n\nexport const base58: BytesCoder = /* @__PURE__ */ genBase58(\n '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n);\nexport const base58flickr: BytesCoder = /* @__PURE__ */ genBase58(\n '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n);\nexport const base58xrp: BytesCoder = /* @__PURE__ */ genBase58(\n 'rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz'\n);\n\n// xmr ver is done in 8-byte blocks (which equals 11 chars in decoding). Last (non-full) block padded with '1' to size in XMR_BLOCK_LEN.\n// Block encoding significantly reduces quadratic complexity of base58.\n\n// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\nexport const base58xmr: BytesCoder = {\n encode(data: Uint8Array) {\n let res = '';\n for (let i = 0; i < data.length; i += 8) {\n const block = data.subarray(i, i + 8);\n res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length]!, '1');\n }\n return res;\n },\n decode(str: string) {\n let res: number[] = [];\n for (let i = 0; i < str.length; i += 11) {\n const slice = str.slice(i, i + 11);\n const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n const block = base58.decode(slice);\n for (let j = 0; j < block.length - blockLen; j++) {\n if (block[j] !== 0) throw new Error('base58xmr: wrong padding');\n }\n res = res.concat(Array.from(block.slice(block.length - blockLen)));\n }\n return Uint8Array.from(res);\n },\n};\n\nexport const createBase58check = (sha256: (data: Uint8Array) => Uint8Array): BytesCoder =>\n chain(\n checksum(4, (data) => sha256(sha256(data))),\n base58\n );\n// legacy export, bad name\nexport const base58check = createBase58check;\n\n// Bech32 code\n// -----------\nexport interface Bech32Decoded<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n}\nexport interface Bech32DecodedWithArray<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n bytes: Uint8Array;\n}\n\nconst BECH_ALPHABET: Coder<number[], string> = /* @__PURE__ */ chain(\n alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'),\n join('')\n);\n\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction bech32Polymod(pre: number): number {\n const b = pre >> 25;\n let chk = (pre & 0x1ffffff) << 5;\n for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n if (((b >> i) & 1) === 1) chk ^= POLYMOD_GENERATORS[i]!;\n }\n return chk;\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction bechChecksum(prefix: string, words: number[], encodingConst = 1): string {\n const len = prefix.length;\n let chk = 1;\n for (let i = 0; i < len; i++) {\n const c = prefix.charCodeAt(i);\n if (c < 33 || c > 126) throw new Error(`Invalid prefix (${prefix})`);\n chk = bech32Polymod(chk) ^ (c >> 5);\n }\n chk = bech32Polymod(chk);\n for (let i = 0; i < len; i++) chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n for (let v of words) chk = bech32Polymod(chk) ^ v;\n for (let i = 0; i < 6; i++) chk = bech32Polymod(chk);\n chk ^= encodingConst;\n return BECH_ALPHABET.encode(convertRadix2([chk % 2 ** 30], 30, 5, false));\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction genBech32(encoding: 'bech32' | 'bech32m') {\n const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n const _words = radix2(5);\n const fromWords = _words.decode;\n const toWords = _words.encode;\n const fromWordsUnsafe = unsafeWrapper(fromWords);\n\n function encode<Prefix extends string>(\n prefix: Prefix,\n words: number[] | Uint8Array,\n limit: number | false = 90\n ): `${Lowercase<Prefix>}1${string}` {\n if (typeof prefix !== 'string')\n throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n if (prefix.length === 0) throw new TypeError(`Invalid prefix length ${prefix.length}`);\n const actualLength = prefix.length + 7 + words.length;\n if (limit !== false && actualLength > limit)\n throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n const lowered = prefix.toLowerCase();\n const sum = bechChecksum(lowered, words, ENCODING_CONST);\n return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}` as `${Lowercase<Prefix>}1${string}`;\n }\n\n function decode<Prefix extends string>(\n str: `${Prefix}1${string}`,\n limit?: number | false\n ): Bech32Decoded<Prefix>;\n function decode(str: string, limit?: number | false): Bech32Decoded;\n function decode(str: string, limit: number | false = 90): Bech32Decoded {\n if (typeof str !== 'string')\n throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n if (str.length < 8 || (limit !== false && str.length > limit))\n throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n // don't allow mixed case\n const lowered = str.toLowerCase();\n if (str !== lowered && str !== str.toUpperCase())\n throw new Error(`String must be lowercase or uppercase`);\n const sepIndex = lowered.lastIndexOf('1');\n if (sepIndex === 0 || sepIndex === -1)\n throw new Error(`Letter \"1\" must be present between prefix and data only`);\n const prefix = lowered.slice(0, sepIndex);\n const data = lowered.slice(sepIndex + 1);\n if (data.length < 6) throw new Error('Data must be at least 6 characters long');\n const words = BECH_ALPHABET.decode(data).slice(0, -6);\n const sum = bechChecksum(prefix, words, ENCODING_CONST);\n if (!data.endsWith(sum)) throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n return { prefix, words };\n }\n\n const decodeUnsafe = unsafeWrapper(decode);\n\n function decodeToBytes(str: string): Bech32DecodedWithArray {\n const { prefix, words } = decode(str, false);\n return { prefix, words, bytes: fromWords(words) };\n }\n\n return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\n\nexport const bech32 = /* @__PURE__ */ genBech32('bech32');\nexport const bech32m = /* @__PURE__ */ genBech32('bech32m');\n\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\nexport const utf8: BytesCoder = {\n encode: (data) => new TextDecoder().decode(data),\n decode: (str) => new TextEncoder().encode(str),\n};\n\nexport const hex: BytesCoder = /* @__PURE__ */ chain(\n radix2(4),\n alphabet('0123456789abcdef'),\n join(''),\n normalize((s: string) => {\n if (typeof s !== 'string' || s.length % 2)\n throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n return s.toLowerCase();\n })\n);\n\n// prettier-ignore\nconst CODERS = {\n utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\ntype CoderType = keyof typeof CODERS;\nconst coderTypeError =\n 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\n\nexport const bytesToString = (type: CoderType, bytes: Uint8Array): string => {\n if (typeof type !== 'string' || !CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (!isBytes(bytes)) throw new TypeError('bytesToString() expects Uint8Array');\n return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString; // as in python, but for bytes only\n\nexport const stringToBytes = (type: CoderType, str: string): Uint8Array => {\n if (!CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (typeof str !== 'string') throw new TypeError('stringToBytes() expects string');\n return CODERS[type].decode(str);\n};\nexport const bytes = stringToBytes;\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nexport type Hex = Uint8Array | string; // hex strings are accepted for simplicity\nexport type PrivKey = Hex | bigint; // bigints are accepted to ease learning curve\nexport type CHash = {\n (message: Uint8Array | string): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array | string) => Uint8Array;\n\nexport function isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\nexport function abytes(item: unknown): void {\n if (!isBytes(item)) throw new Error('Uint8Array expected');\n}\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\nexport function numberToHexUnpadded(num: number | bigint): string {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n abytes(bytes);\n return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n return hexToBytes(numberToHexUnpadded(n));\n}\n\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title: string, hex: Hex, expectedLength?: number): Uint8Array {\n let res: Uint8Array;\n if (typeof hex === 'string') {\n try {\n res = hexToBytes(hex);\n } catch (e) {\n throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n }\n } else if (isBytes(hex)) {\n // Uint8Array.from() instead of hash.slice() because node.js Buffer\n // is instance of Uint8Array, and its slice() creates **mutable** copy\n res = Uint8Array.from(hex);\n } else {\n throw new Error(`${title} must be hex string or Uint8Array`);\n }\n const len = res.length;\n if (typeof expectedLength === 'number' && len !== expectedLength)\n throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n return res;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array) {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n: bigint) {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\n\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n: bigint, pos: number) {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean) {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n: number) => (_2n << BigInt(n - 1)) - _1n;\n\n// DRBG\n\nconst u8n = (data?: any) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr: any) => Uint8Array.from(arr); // another shortcut\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG<Key>(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n if (typeof hashLen !== 'number' || hashLen < 2) throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2) throw new Error('qByteLen must be a number');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...b: Uint8Array[]) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n const reseed = (seed = u8n()) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0) return;\n k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= 1000) throw new Error('drbg: tried 1000 values');\n let len = 0;\n const out: Uint8Array[] = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes(...out);\n };\n const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\n// Validating curves and fields\n\nconst validatorFns = {\n bigint: (val: any) => typeof val === 'bigint',\n function: (val: any) => typeof val === 'function',\n boolean: (val: any) => typeof val === 'boolean',\n string: (val: any) => typeof val === 'string',\n stringOrUint8Array: (val: any) => typeof val === 'string' || isBytes(val),\n isSafeInteger: (val: any) => Number.isSafeInteger(val),\n array: (val: any) => Array.isArray(val),\n field: (val: any, object: any) => (object as any).Fp.isValid(val),\n hash: (val: any) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n} as const;\ntype Validator = keyof typeof validatorFns;\ntype ValMap<T extends Record<string, any>> = { [K in keyof T]?: Validator };\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\n\nexport function validateObject<T extends Record<string, any>>(\n object: T,\n validators: ValMap<T>,\n optValidators: ValMap<T> = {}\n) {\n const checkField = (fieldName: keyof T, type: Validator, isOptional: boolean) => {\n const checkVal = validatorFns[type];\n if (typeof checkVal !== 'function')\n throw new Error(`Invalid validator \"${type}\", expected function`);\n\n const val = object[fieldName as keyof typeof object];\n if (isOptional && val === undefined) return;\n if (!checkVal(val, object)) {\n throw new Error(\n `Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`\n );\n }\n };\n for (const [fieldName, type] of Object.entries(validators)) checkField(fieldName, type!, false);\n for (const [fieldName, type] of Object.entries(optValidators)) checkField(fieldName, type!, true);\n return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n","function number(n: number) {\n if (!Number.isSafeInteger(n) || n < 0) throw new Error(`positive integer expected, not ${n}`);\n}\n\nfunction bool(b: boolean) {\n if (typeof b !== 'boolean') throw new Error(`boolean expected, not ${b}`);\n}\n\n// copied from utils\nexport function isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n if (!isBytes(b)) throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n (data: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create: any;\n};\nfunction hash(h: Hash) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(h.outputLen);\n number(h.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nfunction output(out: any, instance: any) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\n\nexport { number, bool, bytes, hash, exists, output };\n\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n: bigint, le = false) {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n\nfunction split(lst: bigint[], le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number) => h >>> s;\nconst shrSL = (h: number, l: number, s: number) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number) => l;\nconst rotr32L = (h: number, _l: number) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number) => (h << (s - 32)) | (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah: number, Al: number, Bh: number, Bl: number) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number) =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number) =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number) =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number) =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// See utils.ts for details.\n// The file will throw on node.js 14 and earlier.\n// @ts-ignore\nimport * as nc from 'node:crypto';\nexport const crypto =\n nc && typeof nc === 'object' && 'webcrypto' in nc ? (nc.webcrypto as any) : undefined;\n","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word: number, shift: number) =>\n (word << shift) | ((word >>> (32 - shift)) >>> 0);\n\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word: number) =>\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n: number) => n : (n: number) => byteSwap(n);\n\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr: Uint32Array) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n}\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n abytes(bytes);\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n abstract blockLen: number; // Bytes per block\n abstract outputLen: number; // Bytes in output\n abstract update(buf: Input): this;\n // Writes digest into buf\n abstract digestInto(buf: Uint8Array): void;\n abstract digest(): Uint8Array;\n /**\n * Resets internal state. Makes Hash instance unusable.\n * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n * by user, they will need to manually call `destroy()` when zeroing is necessary.\n */\n abstract destroy(): void;\n /**\n * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n * when no options are passed.\n * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n * There are no guarantees for clean-up because it's impossible in JS.\n */\n abstract _cloneInto(to?: T): T;\n // Safe version that clones internal state\n clone(): T {\n return this._cloneInto();\n }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\nconst toStr = {}.toString;\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n throw new Error('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n hashCons: (opts?: T) => Hash<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n hashCons: (opts?: T) => HashXOF<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport {\n Hash,\n u32,\n Input,\n toBytes,\n wrapConstructor,\n wrapXOFConstructorWithOpts,\n HashXOF,\n isLE,\n byteSwap32,\n} from './utils.js';\n\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n\n// Various per round constants calculations\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = [];\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nconst _7n = /* @__PURE__ */ BigInt(7);\nconst _256n = /* @__PURE__ */ BigInt(256);\nconst _0x71n = /* @__PURE__ */ BigInt(0x71);\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s: Uint32Array, rounds: number = 24) {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n B.fill(0);\n}\n\nexport class Keccak extends Hash<Keccak> implements HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n public blockLen: number,\n public suffix: number,\n public outputLen: number,\n protected enableXOF = false,\n protected rounds: number = 24\n ) {\n super();\n // Can be passed from user as dkLen\n number(outputLen);\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n if (0 >= this.blockLen || this.blockLen >= 200)\n throw new Error('Sha3 supports only keccak-f1600 function');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n protected keccak() {\n if (!isLE) byteSwap32(this.state32);\n keccakP(this.state32, this.rounds);\n if (!isLE) byteSwap32(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Input) {\n exists(this);\n const { blockLen, state } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish() {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n exists(this, false);\n bytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n number(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array) {\n output(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest() {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy() {\n this.destroyed = true;\n this.state.fill(0);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst gen = (suffix: number, blockLen: number, outputLen: number) =>\n wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\n\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\n\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number) =>\n wrapXOFConstructorWithOpts<HashXOF<Keccak>, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true)\n );\n\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n","import { keccak_256 } from '@noble/hashes/sha3';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { utf8ToBytes } from '@noble/hashes/utils';\nimport { Field, mod, validateField, invert } from '@noble/curves/abstract/modular';\nimport { poseidon } from '@noble/curves/abstract/poseidon';\nimport { weierstrass, DER } from '@noble/curves/abstract/weierstrass';\nimport * as u from '@noble/curves/abstract/utils';\nimport { getHash } from '@noble/curves/_shortw_utils';\nconst CURVE_ORDER = BigInt('3618502788666131213697322783095070105526743751716087489154079457884512865583');\nexport const MAX_VALUE = BigInt('0x800000000000000000000000000000000000000000000000000000000000000');\nconst nBitLength = 252;\nfunction bits2int(bytes) {\n while (bytes[0] === 0)\n bytes = bytes.subarray(1);\n const delta = bytes.length * 8 - nBitLength;\n const num = u.bytesToNumberBE(bytes);\n return delta > 0 ? num >> BigInt(delta) : num;\n}\nfunction hex0xToBytes(hex) {\n if (typeof hex === 'string') {\n hex = strip0x(hex);\n if (hex.length & 1)\n hex = '0' + hex;\n }\n return u.hexToBytes(hex);\n}\nconst curve = weierstrass({\n a: BigInt(1),\n b: BigInt('3141592653589793238462643383279502884197169399375105820974944592307816406665'),\n Fp: Field(BigInt('0x800000000000011000000000000000000000000000000000000000000000001')),\n n: CURVE_ORDER,\n nBitLength,\n Gx: BigInt('874739451078007766457464989774322083649278607533249481151382481072868806602'),\n Gy: BigInt('152666792071518830868575557812948353041420400780739481342941381225525861407'),\n h: BigInt(1),\n lowS: false,\n ...getHash(sha256),\n bits2int,\n bits2int_modN: (bytes) => {\n const hex = u.bytesToNumberBE(bytes).toString(16);\n if (hex.length === 63)\n bytes = hex0xToBytes(hex + '0');\n return mod(bits2int(bytes), CURVE_ORDER);\n },\n});\nexport const _starkCurve = curve;\nfunction ensureBytes(hex) {\n return u.ensureBytes('', typeof hex === 'string' ? hex0xToBytes(hex) : hex);\n}\nfunction normPrivKey(privKey) {\n return u.bytesToHex(ensureBytes(privKey)).padStart(64, '0');\n}\nexport function getPublicKey(privKey, isCompressed = false) {\n return curve.getPublicKey(normPrivKey(privKey), isCompressed);\n}\nexport function getSharedSecret(privKeyA, pubKeyB) {\n return curve.getSharedSecret(normPrivKey(privKeyA), pubKeyB);\n}\nfunction checkSignature(signature) {\n const { r, s } = signature;\n if (r < 0n || r >= MAX_VALUE)\n throw new Error(`Signature.r should be [1, ${MAX_VALUE})`);\n const w = invert(s, CURVE_ORDER);\n if (w < 0n || w >= MAX_VALUE)\n throw new Error(`inv(Signature.s) should be [1, ${MAX_VALUE})`);\n}\nfunction checkMessage(msgHash) {\n const bytes = ensureBytes(msgHash);\n const num = u.bytesToNumberBE(bytes);\n if (num >= MAX_VALUE)\n throw new Error(`msgHash should be [0, ${MAX_VALUE})`);\n return bytes;\n}\nexport function sign(msgHash, privKey, opts) {\n const sig = curve.sign(checkMessage(msgHash), normPrivKey(privKey), opts);\n checkSignature(sig);\n return sig;\n}\nexport function verify(signature, msgHash, pubKey) {\n if (!(signature instanceof Signature)) {\n const bytes = ensureBytes(signature);\n try {\n signature = Signature.fromDER(bytes);\n }\n catch (derError) {\n if (!(derError instanceof DER.Err))\n throw derError;\n signature = Signature.fromCompact(bytes);\n }\n }\n checkSignature(signature);\n return curve.verify(signature, checkMessage(msgHash), ensureBytes(pubKey));\n}\nconst { CURVE, ProjectivePoint, Signature, utils } = curve;\nexport { CURVE, ProjectivePoint, Signature, utils };\nfunction extractX(bytes) {\n const hex = u.bytesToHex(bytes.subarray(1));\n const stripped = hex.replace(/^0+/gm, '');\n return `0x${stripped}`;\n}\nfunction strip0x(hex) {\n return hex.replace(/^0x/i, '');\n}\nexport function grindKey(seed) {\n const _seed = ensureBytes(seed);\n const sha256mask = 2n ** 256n;\n const limit = sha256mask - mod(sha256mask, CURVE_ORDER);\n for (let i = 0;; i++) {\n const key = sha256Num(u.concatBytes(_seed, u.numberToVarBytesBE(BigInt(i))));\n if (key < limit)\n return mod(key, CURVE_ORDER).toString(16);\n if (i === 100000)\n throw new Error('grindKey is broken: tried 100k vals');\n }\n}\nexport function getStarkKey(privateKey) {\n return extractX(getPublicKey(privateKey, true));\n}\nexport function ethSigToPrivate(signature) {\n signature = strip0x(signature);\n if (signature.length !== 130)\n throw new Error('Wrong ethereum signature');\n return grindKey(signature.substring(0, 64));\n}\nconst MASK_31 = 2n ** 31n - 1n;\nconst int31 = (n) => Number(n & MASK_31);\nexport function getAccountPath(layer, application, ethereumAddress, index) {\n const layerNum = int31(sha256Num(layer));\n const applicationNum = int31(sha256Num(application));\n const eth = u.hexToNumber(strip0x(ethereumAddress));\n return `m/2645'/${layerNum}'/${applicationNum}'/${int31(eth)}'/${int31(eth >> 31n)}'/${index}`;\n}\nconst PEDERSEN_POINTS = [\n new ProjectivePoint(2089986280348253421170679821480865132823066470938446095505822317253594081284n, 1713931329540660377023406109199410414810705867260802078187082345529207694986n, 1n),\n new ProjectivePoint(996781205833008774514500082376783249102396023663454813447423147977397232763n, 1668503676786377725805489344771023921079126552019160156920634619255970485781n, 1n),\n new ProjectivePoint(2251563274489750535117886426533222435294046428347329203627021249169616184184n, 1798716007562728905295480679789526322175868328062420237419143593021674992973n, 1n),\n new ProjectivePoint(2138414695194151160943305727036575959195309218611738193261179310511854807447n, 113410276730064486255102093846540133784865286929052426931474106396135072156n, 1n),\n new ProjectivePoint(2379962749567351885752724891227938183011949129833673362440656643086021394946n, 776496453633298175483985398648758586525933812536653089401905292063708816422n, 1n),\n];\nfunction pedersenPrecompute(p1, p2) {\n const out = [];\n let p = p1;\n for (let i = 0; i < 248; i++) {\n out.push(p);\n p = p.double();\n }\n p = p2;\n for (let i = 0; i < 4; i++) {\n out.push(p);\n p = p.double();\n }\n return out;\n}\nconst PEDERSEN_POINTS1 = pedersenPrecompute(PEDERSEN_POINTS[1], PEDERSEN_POINTS[2]);\nconst PEDERSEN_POINTS2 = pedersenPrecompute(PEDERSEN_POINTS[3], PEDERSEN_POINTS[4]);\nfunction pedersenArg(arg) {\n let value;\n if (typeof arg === 'bigint') {\n value = arg;\n }\n else if (typeof arg === 'number') {\n if (!Number.isSafeInteger(arg))\n throw new Error(`Invalid pedersenArg: ${arg}`);\n value = BigInt(arg);\n }\n else {\n value = u.bytesToNumberBE(ensureBytes(arg));\n }\n if (!(0n <= value && value < curve.CURVE.Fp.ORDER))\n throw new Error(`PedersenArg should be 0 <= value < CURVE.P: ${value}`);\n return value;\n}\nfunction pedersenSingle(point, value, constants) {\n let x = pedersenArg(value);\n for (let j = 0; j < 252; j++) {\n const pt = constants[j];\n if (pt.equals(point))\n throw new Error('Same point');\n if ((x & 1n) !== 0n)\n point = point.add(pt);\n x >>= 1n;\n }\n return point;\n}\nexport function pedersen(x, y) {\n let point = PEDERSEN_POINTS[0];\n point = pedersenSingle(point, x, PEDERSEN_POINTS1);\n point = pedersenSingle(point, y, PEDERSEN_POINTS2);\n return extractX(point.toRawBytes(true));\n}\nexport const computeHashOnElements = (data, fn = pedersen) => [0, ...data, data.length].reduce((x, y) => fn(x, y));\nconst MASK_250 = u.bitMask(250);\nexport const keccak = (data) => u.bytesToNumberBE(keccak_256(data)) & MASK_250;\nconst sha256Num = (data) => u.bytesToNumberBE(sha256(data));\nexport const Fp251 = Field(BigInt('3618502788666131213697322783095070105623107215331596699973092056135872020481'));\nfunction poseidonRoundConstant(Fp, name, idx) {\n const val = Fp.fromBytes(sha256(utf8ToBytes(`${name}${idx}`)));\n return Fp.create(val);\n}\nexport function _poseidonMDS(Fp, name, m, attempt = 0) {\n const x_values = [];\n const y_values = [];\n for (let i = 0; i < m; i++) {\n x_values.push(poseidonRoundConstant(Fp, `${name}x`, attempt * m + i));\n y_values.push(poseidonRoundConstant(Fp, `${name}y`, attempt * m + i));\n }\n if (new Set([...x_values, ...y_values]).size !== 2 * m)\n throw new Error('X and Y values are not distinct');\n return x_values.map((x) => y_values.map((y) => Fp.inv(Fp.sub(x, y))));\n}\nconst MDS_SMALL = [\n [3, 1, 1],\n [1, -1, 1],\n [1, 1, -2],\n].map((i) => i.map(BigInt));\nexport function poseidonBasic(opts, mds) {\n validateField(opts.Fp);\n if (!Number.isSafeInteger(opts.rate) || !Number.isSafeInteger(opts.capacity))\n throw new Error(`Wrong poseidon opts: ${opts}`);\n const m = opts.rate + opts.capacity;\n const rounds = opts.roundsFull + opts.roundsPartial;\n const roundConstants = [];\n for (let i = 0; i < rounds; i++) {\n const row = [];\n for (let j = 0; j < m; j++)\n row.push(poseidonRoundConstant(opts.Fp, 'Hades', m * i + j));\n roundConstants.push(row);\n }\n const res = poseidon({\n ...opts,\n t: m,\n sboxPower: 3,\n reversePartialPowIdx: true,\n mds,\n roundConstants,\n });\n res.m = m;\n res.rate = opts.rate;\n res.capacity = opts.capacity;\n return res;\n}\nexport function poseidonCreate(opts, mdsAttempt = 0) {\n const m = opts.rate + opts.capacity;\n if (!Number.isSafeInteger(mdsAttempt))\n throw new Error(`Wrong mdsAttempt=${mdsAttempt}`);\n return poseidonBasic(opts, _poseidonMDS(opts.Fp, 'HadesMDS', m, mdsAttempt));\n}\nexport const poseidonSmall = poseidonBasic({ Fp: Fp251, rate: 2, capacity: 1, roundsFull: 8, roundsPartial: 83 }, MDS_SMALL);\nexport function poseidonHash(x, y, fn = poseidonSmall) {\n return fn([x, y, 2n])[0];\n}\nexport function poseidonHashFunc(x, y, fn = poseidonSmall) {\n return u.numberToVarBytesBE(poseidonHash(u.bytesToNumberBE(x), u.bytesToNumberBE(y), fn));\n}\nexport function poseidonHashSingle(x, fn = poseidonSmall) {\n return fn([x, 0n, 1n])[0];\n}\nexport function poseidonHashMany(values, fn = poseidonSmall) {\n const { m, rate } = fn;\n if (!Array.isArray(values))\n throw new Error('bigint array expected in values');\n const padded = Array.from(values);\n padded.push(1n);\n while (padded.length % rate !== 0)\n padded.push(0n);\n let state = new Array(m).fill(0n);\n for (let i = 0; i < padded.length; i += rate) {\n for (let j = 0; j < rate; j++)\n state[j] += padded[i + j];\n state = fn(state);\n }\n return state[0];\n}\n","function number(n: number) {\n if (!Number.isSafeInteger(n) || n < 0) throw new Error(`Wrong positive integer: ${n}`);\n}\n\nfunction bool(b: boolean) {\n if (typeof b !== 'boolean') throw new Error(`Expected boolean, not ${b}`);\n}\n\n// copied from utils\nfunction isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n if (!isBytes(b)) throw new Error('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n (data: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create: any;\n};\nfunction hash(hash: Hash) {\n if (typeof hash !== 'function' || typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nfunction output(out: any, instance: any) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\n\nexport { number, bool, bytes, hash, exists, output };\n\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n: bigint, le = false) {\n if (le) return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\n\nfunction split(lst: bigint[], le = false) {\n let Ah = new Uint32Array(lst.length);\n let Al = new Uint32Array(lst.length);\n for (let i = 0; i < lst.length; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\n\nconst toBig = (h: number, l: number) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number) => h >>> s;\nconst shrSL = (h: number, l: number, s: number) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number) => l;\nconst rotr32L = (h: number, _l: number) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number) => (h << (s - 32)) | (l >>> (64 - s));\n\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah: number, Al: number, Bh: number, Bl: number) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al: number, Bl: number, Cl: number) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number) =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number) =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number) =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number) =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n","// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// See utils.ts for details.\n// The file will throw on node.js 14 and earlier.\n// @ts-ignore\nimport * as nc from 'node:crypto';\nexport const crypto =\n nc && typeof nc === 'object' && 'webcrypto' in nc ? (nc.webcrypto as any) : undefined;\n","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\nfunction isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\n// Other libraries would silently corrupt the data instead of throwing an error,\n// when they don't support it.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE) throw new Error('Non little-endian hardware is not supported');\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n if (!isBytes(bytes)) throw new Error('Uint8Array expected');\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n if (!isBytes(data)) throw new Error(`expected Uint8Array, got ${typeof data}`);\n return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n if (!isBytes(a)) throw new Error('Uint8Array expected');\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n abstract blockLen: number; // Bytes per block\n abstract outputLen: number; // Bytes in output\n abstract update(buf: Input): this;\n // Writes digest into buf\n abstract digestInto(buf: Uint8Array): void;\n abstract digest(): Uint8Array;\n /**\n * Resets internal state. Makes Hash instance unusable.\n * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n * by user, they will need to manually call `destroy()` when zeroing is necessary.\n */\n abstract destroy(): void;\n /**\n * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n * when no options are passed.\n * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n * There are no guarantees for clean-up because it's impossible in JS.\n */\n abstract _cloneInto(to?: T): T;\n // Safe version that clones internal state\n clone(): T {\n return this._cloneInto();\n }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\nconst toStr = {}.toString;\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n throw new Error('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n hashCons: (opts?: T) => Hash<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n hashCons: (opts?: T) => HashXOF<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport {\n Hash,\n u32,\n Input,\n toBytes,\n wrapConstructor,\n wrapXOFConstructorWithOpts,\n HashXOF,\n} from './utils.js';\n\n// SHA3 (keccak) is based on a new design: basically, the internal state is bigger than output size.\n// It's called a sponge function.\n\n// Various per round constants calculations\nconst [SHA3_PI, SHA3_ROTL, _SHA3_IOTA]: [number[], number[], bigint[]] = [[], [], []];\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nconst _2n = /* @__PURE__ */ BigInt(2);\nconst _7n = /* @__PURE__ */ BigInt(7);\nconst _256n = /* @__PURE__ */ BigInt(256);\nconst _0x71n = /* @__PURE__ */ BigInt(0x71);\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst [SHA3_IOTA_H, SHA3_IOTA_L] = /* @__PURE__ */ split(_SHA3_IOTA, true);\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s: Uint32Array, rounds: number = 24) {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n B.fill(0);\n}\n\nexport class Keccak extends Hash<Keccak> implements HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n public blockLen: number,\n public suffix: number,\n public outputLen: number,\n protected enableXOF = false,\n protected rounds: number = 24\n ) {\n super();\n // Can be passed from user as dkLen\n number(outputLen);\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n if (0 >= this.blockLen || this.blockLen >= 200)\n throw new Error('Sha3 supports only keccak-f1600 function');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n protected keccak() {\n keccakP(this.state32, this.rounds);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Input) {\n exists(this);\n const { blockLen, state } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish() {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n exists(this, false);\n bytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n number(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array) {\n output(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest() {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy() {\n this.destroyed = true;\n this.state.fill(0);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst gen = (suffix: number, blockLen: number, outputLen: number) =>\n wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\n\nexport const sha3_224 = /* @__PURE__ */ gen(0x06, 144, 224 / 8);\n/**\n * SHA3-256 hash function\n * @param message - that would be hashed\n */\nexport const sha3_256 = /* @__PURE__ */ gen(0x06, 136, 256 / 8);\nexport const sha3_384 = /* @__PURE__ */ gen(0x06, 104, 384 / 8);\nexport const sha3_512 = /* @__PURE__ */ gen(0x06, 72, 512 / 8);\nexport const keccak_224 = /* @__PURE__ */ gen(0x01, 144, 224 / 8);\n/**\n * keccak-256 hash function. Different from SHA3-256.\n * @param message - that would be hashed\n */\nexport const keccak_256 = /* @__PURE__ */ gen(0x01, 136, 256 / 8);\nexport const keccak_384 = /* @__PURE__ */ gen(0x01, 104, 384 / 8);\nexport const keccak_512 = /* @__PURE__ */ gen(0x01, 72, 512 / 8);\n\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number) =>\n wrapXOFConstructorWithOpts<HashXOF<Keccak>, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true)\n );\n\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n","import { exists, output } from './_assert.js';\nimport { Hash, createView, Input, toBytes } from './utils.js';\n\n// Polyfill for Safari 14\nfunction setBigUint64(view: DataView, byteOffset: number, value: bigint, isLE: boolean): void {\n if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n\n// Base SHA2 class (RFC 6234)\nexport abstract class SHA2<T extends SHA2<T>> extends Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(\n readonly blockLen: number,\n public outputLen: number,\n readonly padOffset: number,\n readonly isLE: boolean\n ) {\n super();\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data: Input): this {\n exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out: Uint8Array) {\n exists(this);\n output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to?: T): T {\n to ||= new (this.constructor as any)() as T;\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen) to.buffer.set(buffer);\n return to;\n }\n}\n","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n\n// Choice: a ? b : c\nconst Chi = (a: number, b: number, c: number) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a: number, b: number, c: number) => (a & b) ^ (a & c) ^ (b & c);\n\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2<SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = IV[0] | 0;\n B = IV[1] | 0;\n C = IV[2] | 0;\n D = IV[3] | 0;\n E = IV[4] | 0;\n F = IV[5] | 0;\n G = IV[6] | 0;\n H = IV[7] | 0;\n\n constructor() {\n super(64, 32, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n protected process(view: DataView, offset: number): void {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n protected roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n A = 0xc1059ed8 | 0;\n B = 0x367cd507 | 0;\n C = 0x3070dd17 | 0;\n D = 0xf70e5939 | 0;\n E = 0xffc00b31 | 0;\n F = 0x68581511 | 0;\n G = 0x64f98fa7 | 0;\n H = 0xbefa4fa4 | 0;\n constructor() {\n super();\n this.outputLen = 28;\n }\n}\n\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nexport type Hex = Uint8Array | string; // hex strings are accepted for simplicity\nexport type PrivKey = Hex | bigint; // bigints are accepted to ease learning curve\nexport type CHash = {\n (message: Uint8Array | string): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array | string) => Uint8Array;\n\nexport function isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n if (!isBytes(bytes)) throw new Error('Uint8Array expected');\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\nexport function numberToHexUnpadded(num: number | bigint): string {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // Big Endian\n return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n if (!isBytes(bytes)) throw new Error('Uint8Array expected');\n return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n return hexToBytes(numberToHexUnpadded(n));\n}\n\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title: string, hex: Hex, expectedLength?: number): Uint8Array {\n let res: Uint8Array;\n if (typeof hex === 'string') {\n try {\n res = hexToBytes(hex);\n } catch (e) {\n throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n }\n } else if (isBytes(hex)) {\n // Uint8Array.from() instead of hash.slice() because node.js Buffer\n // is instance of Uint8Array, and its slice() creates **mutable** copy\n res = Uint8Array.from(hex);\n } else {\n throw new Error(`${title} must be hex string or Uint8Array`);\n }\n const len = res.length;\n if (typeof expectedLength === 'number' && len !== expectedLength)\n throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n return res;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n if (!isBytes(a)) throw new Error('Uint8Array expected');\n sum += a.length;\n }\n let res = new Uint8Array(sum);\n let pad = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array) {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n: bigint) {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\n\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n: bigint, pos: number) {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n: bigint, pos: number, value: boolean) => {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n};\n\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n: number) => (_2n << BigInt(n - 1)) - _1n;\n\n// DRBG\n\nconst u8n = (data?: any) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr: any) => Uint8Array.from(arr); // another shortcut\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n * const drbg = createHmacDRBG<Key>(32, 32, hmac);\n * drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n if (typeof hashLen !== 'number' || hashLen < 2) throw new Error('hashLen must be a number');\n if (typeof qByteLen !== 'number' || qByteLen < 2) throw new Error('qByteLen must be a number');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n let i = 0; // Iterations counter, will throw when over 1000\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const h = (...b: Uint8Array[]) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n const reseed = (seed = u8n()) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0) return;\n k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n v = h(); // v = hmac(k || v)\n };\n const gen = () => {\n // HMAC-DRBG generate() function\n if (i++ >= 1000) throw new Error('drbg: tried 1000 values');\n let len = 0;\n const out: Uint8Array[] = [];\n while (len < qByteLen) {\n v = h();\n const sl = v.slice();\n out.push(sl);\n len += v.length;\n }\n return concatBytes(...out);\n };\n const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\n// Validating curves and fields\n\nconst validatorFns = {\n bigint: (val: any) => typeof val === 'bigint',\n function: (val: any) => typeof val === 'function',\n boolean: (val: any) => typeof val === 'boolean',\n string: (val: any) => typeof val === 'string',\n stringOrUint8Array: (val: any) => typeof val === 'string' || isBytes(val),\n isSafeInteger: (val: any) => Number.isSafeInteger(val),\n array: (val: any) => Array.isArray(val),\n field: (val: any, object: any) => (object as any).Fp.isValid(val),\n hash: (val: any) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n} as const;\ntype Validator = keyof typeof validatorFns;\ntype ValMap<T extends Record<string, any>> = { [K in keyof T]?: Validator };\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\n\nexport function validateObject<T extends Record<string, any>>(\n object: T,\n validators: ValMap<T>,\n optValidators: ValMap<T> = {}\n) {\n const checkField = (fieldName: keyof T, type: Validator, isOptional: boolean) => {\n const checkVal = validatorFns[type];\n if (typeof checkVal !== 'function')\n throw new Error(`Invalid validator \"${type}\", expected function`);\n\n const val = object[fieldName as keyof typeof object];\n if (isOptional && val === undefined) return;\n if (!checkVal(val, object)) {\n throw new Error(\n `Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`\n );\n }\n };\n for (const [fieldName, type] of Object.entries(validators)) checkField(fieldName, type!, false);\n for (const [fieldName, type] of Object.entries(optValidators)) checkField(fieldName, type!, true);\n return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport {\n bitMask,\n numberToBytesBE,\n numberToBytesLE,\n bytesToNumberBE,\n bytesToNumberLE,\n ensureBytes,\n validateObject,\n} from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n if (modulo <= _0n || power < _0n) throw new Error('Expected power/modulo > 0');\n if (modulo === _1n) return _0n;\n let res = _1n;\n while (power > _0n) {\n if (power & _1n) res = (res * num) % modulo;\n num = (num * num) % modulo;\n power >>= _1n;\n }\n return res;\n}\n\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n\n// Inverses number over modulo\nexport function invert(number: bigint, modulo: bigint): bigint {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n let a = mod(number, modulo);\n let b = modulo;\n // prettier-ignore\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n // JIT applies optimization if those two lines follow each other\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n // prettier-ignore\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n) throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P: bigint) {\n // Legendre constant: used to calculate Legendre symbol (a | p),\n // which denotes the value of a^((p-1)/2) (mod p).\n // (a | p) ≡ 1 if a is a square (mod p)\n // (a | p) ≡ -1 if a is not a square (mod p)\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreC = (P - _1n) / _2n;\n\n let Q: bigint, S: number, Z: bigint;\n // Step 1: By factoring out powers of 2 from p - 1,\n // find q and s such that p - 1 = q*(2^s) with q odd\n for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++);\n\n // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++);\n\n // Fast-path\n if (S === 1) {\n const p1div4 = (P + _1n) / _4n;\n return function tonelliFast<T>(Fp: IField<T>, n: T) {\n const root = Fp.pow(n, p1div4);\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // Slow-path\n const Q1div2 = (Q + _1n) / _2n;\n return function tonelliSlow<T>(Fp: IField<T>, n: T): T {\n // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE)) throw new Error('Cannot find square root');\n let r = S;\n // TODO: will fail at Fp2/etc\n let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n let x = Fp.pow(n, Q1div2); // first guess at the square root\n let b = Fp.pow(n, Q); // first guess at the fudge factor\n\n while (!Fp.eql(b, Fp.ONE)) {\n if (Fp.eql(b, Fp.ZERO)) return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n // Find m such b^(2^m)==1\n let m = 1;\n for (let t2 = Fp.sqr(b); m < r; m++) {\n if (Fp.eql(t2, Fp.ONE)) break;\n t2 = Fp.sqr(t2); // t2 *= t2\n }\n // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n g = Fp.sqr(ge); // g = ge * ge\n x = Fp.mul(x, ge); // x *= ge\n b = Fp.mul(b, g); // b *= g\n r = m;\n }\n return x;\n };\n}\n\nexport function FpSqrt(P: bigint) {\n // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n\n // P ≡ 3 (mod 4)\n // √n = n^((P+1)/4)\n if (P % _4n === _3n) {\n // Not all roots possible!\n // const ORDER =\n // 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n // const NUM = 72057594037927816n;\n const p1div4 = (P + _1n) / _4n;\n return function sqrt3mod4<T>(Fp: IField<T>, n: T) {\n const root = Fp.pow(n, p1div4);\n // Throw if root**2 != n\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n if (P % _8n === _5n) {\n const c1 = (P - _5n) / _8n;\n return function sqrt5mod8<T>(Fp: IField<T>, n: T) {\n const n2 = Fp.mul(n, _2n);\n const v = Fp.pow(n2, c1);\n const nv = Fp.mul(n, v);\n const i = Fp.mul(Fp.mul(nv, _2n), v);\n const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // P ≡ 9 (mod 16)\n if (P % _16n === _9n) {\n // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n // Means we cannot use sqrt for constants at all!\n //\n // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); // 1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n // const c2 = Fp.sqrt(c1); // 2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n // const c3 = Fp.sqrt(Fp.negate(c1)); // 3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n // const c4 = (P + _7n) / _16n; // 4. c4 = (q + 7) / 16 # Integer arithmetic\n // sqrt = (x) => {\n // let tv1 = Fp.pow(x, c4); // 1. tv1 = x^c4\n // let tv2 = Fp.mul(c1, tv1); // 2. tv2 = c1 * tv1\n // const tv3 = Fp.mul(c2, tv1); // 3. tv3 = c2 * tv1\n // let tv4 = Fp.mul(c3, tv1); // 4. tv4 = c3 * tv1\n // const e1 = Fp.equals(Fp.square(tv2), x); // 5. e1 = (tv2^2) == x\n // const e2 = Fp.equals(Fp.square(tv3), x); // 6. e2 = (tv3^2) == x\n // tv1 = Fp.cmov(tv1, tv2, e1); // 7. tv1 = CMOV(tv1, tv2, e1) # Select tv2 if (tv2^2) == x\n // tv2 = Fp.cmov(tv4, tv3, e2); // 8. tv2 = CMOV(tv4, tv3, e2) # Select tv3 if (tv3^2) == x\n // const e3 = Fp.equals(Fp.square(tv2), x); // 9. e3 = (tv2^2) == x\n // return Fp.cmov(tv1, tv2, e3); // 10. z = CMOV(tv1, tv2, e3) # Select the sqrt from tv1 and tv2\n // }\n }\n\n // Other cases: Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint) => (mod(num, modulo) & _1n) === _1n;\n\n// Field is not always over prime: for example, Fp2 has ORDER(q)=p^m\nexport interface IField<T> {\n ORDER: bigint;\n BYTES: number;\n BITS: number;\n MASK: bigint;\n ZERO: T;\n ONE: T;\n // 1-arg\n create: (num: T) => T;\n isValid: (num: T) => boolean;\n is0: (num: T) => boolean;\n neg(num: T): T;\n inv(num: T): T;\n sqrt(num: T): T;\n sqr(num: T): T;\n // 2-args\n eql(lhs: T, rhs: T): boolean;\n add(lhs: T, rhs: T): T;\n sub(lhs: T, rhs: T): T;\n mul(lhs: T, rhs: T | bigint): T;\n pow(lhs: T, power: bigint): T;\n div(lhs: T, rhs: T | bigint): T;\n // N for NonNormalized (for now)\n addN(lhs: T, rhs: T): T;\n subN(lhs: T, rhs: T): T;\n mulN(lhs: T, rhs: T | bigint): T;\n sqrN(num: T): T;\n\n // Optional\n // Should be same as sgn0 function in\n // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n // legendre?(num: T): T;\n pow(lhs: T, power: bigint): T;\n invertBatch: (lst: T[]) => T[];\n toBytes(num: T): Uint8Array;\n fromBytes(bytes: Uint8Array): T;\n // If c is False, CMOV returns a, otherwise it returns b.\n cmov(a: T, b: T, c: boolean): T;\n}\n// prettier-ignore\nconst FIELD_FIELDS = [\n 'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n 'eql', 'add', 'sub', 'mul', 'pow', 'div',\n 'addN', 'subN', 'mulN', 'sqrN'\n] as const;\nexport function validateField<T>(field: IField<T>) {\n const initial = {\n ORDER: 'bigint',\n MASK: 'bigint',\n BYTES: 'isSafeInteger',\n BITS: 'isSafeInteger',\n } as Record<string, string>;\n const opts = FIELD_FIELDS.reduce((map, val: string) => {\n map[val] = 'function';\n return map;\n }, initial);\n return validateObject(field, opts);\n}\n\n// Generic field functions\n\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow<T>(f: IField<T>, num: T, power: bigint): T {\n // Should have same speed as pow for bigints\n // TODO: benchmark!\n if (power < _0n) throw new Error('Expected power > 0');\n if (power === _0n) return f.ONE;\n if (power === _1n) return num;\n let p = f.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n) p = f.mul(p, d);\n d = f.sqr(d);\n power >>= _1n;\n }\n return p;\n}\n\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch<T>(f: IField<T>, nums: T[]): T[] {\n const tmp = new Array(nums.length);\n // Walk from first to last, multiply them by each other MOD p\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (f.is0(num)) return acc;\n tmp[i] = acc;\n return f.mul(acc, num);\n }, f.ONE);\n // Invert last element\n const inverted = f.inv(lastMultiplied);\n // Walk from last to first, multiply them by inverted each other MOD p\n nums.reduceRight((acc, num, i) => {\n if (f.is0(num)) return acc;\n tmp[i] = f.mul(acc, tmp[i]);\n return f.mul(acc, num);\n }, inverted);\n return tmp;\n}\n\nexport function FpDiv<T>(f: IField<T>, lhs: T, rhs: T | bigint): T {\n return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(f: IField<T>) {\n const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n return (x: T): boolean => {\n const p = f.pow(x, legendreConst);\n return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n };\n}\n\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number) {\n // Bit size, byte size of CURVE.n\n const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n const nByteLength = Math.ceil(_nBitLength / 8);\n return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(\n ORDER: bigint,\n bitLen?: number,\n isLE = false,\n redef: Partial<IField<bigint>> = {}\n): Readonly<FpField> {\n if (ORDER <= _0n) throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048) throw new Error('Field lengths over 2048 bytes are not supported');\n const sqrtP = FpSqrt(ORDER);\n const f: Readonly<FpField> = Object.freeze({\n ORDER,\n BITS,\n BYTES,\n MASK: bitMask(BITS),\n ZERO: _0n,\n ONE: _1n,\n create: (num) => mod(num, ORDER),\n isValid: (num) => {\n if (typeof num !== 'bigint')\n throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n },\n is0: (num) => num === _0n,\n isOdd: (num) => (num & _1n) === _1n,\n neg: (num) => mod(-num, ORDER),\n eql: (lhs, rhs) => lhs === rhs,\n\n sqr: (num) => mod(num * num, ORDER),\n add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n pow: (num, power) => FpPow(f, num, power),\n div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n\n // Same as above, but doesn't normalize\n sqrN: (num) => num * num,\n addN: (lhs, rhs) => lhs + rhs,\n subN: (lhs, rhs) => lhs - rhs,\n mulN: (lhs, rhs) => lhs * rhs,\n\n inv: (num) => invert(num, ORDER),\n sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n invertBatch: (lst) => FpInvertBatch(f, lst),\n // TODO: do we really need constant cmov?\n // We don't have const-time bigints anyway, so probably will be not very useful\n cmov: (a, b, c) => (c ? b : a),\n toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n fromBytes: (bytes) => {\n if (bytes.length !== BYTES)\n throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n },\n } as FpField);\n return Object.freeze(f);\n}\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T) {\n if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T) {\n if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(\n hash: string | Uint8Array,\n groupOrder: bigint,\n isLE = false\n): bigint {\n hash = ensureBytes('privateHash', hash);\n const hashLen = hash.length;\n const minLen = nLength(groupOrder).nByteLength + 8;\n if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n return mod(num, groupOrder - _1n) + _1n;\n}\n\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder: bigint): number {\n if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\n\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder: bigint): number {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n const len = key.length;\n const fieldLen = getFieldBytesLength(fieldOrder);\n const minLen = getMinHashLength(fieldOrder);\n // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n if (len < 16 || len < minLen || len > 1024)\n throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n const reduced = mod(num, fieldOrder - _1n) + _1n;\n return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Poseidon Hash: https://eprint.iacr.org/2019/458.pdf, https://www.poseidon-hash.info\nimport { IField, FpPow, validateField } from './modular.js';\n// We don't provide any constants, since different implementations use different constants.\n// For reference constants see './test/poseidon.test.js'.\nexport type PoseidonOpts = {\n Fp: IField<bigint>;\n t: number;\n roundsFull: number;\n roundsPartial: number;\n sboxPower?: number;\n reversePartialPowIdx?: boolean; // Hack for stark\n mds: bigint[][];\n roundConstants: bigint[][];\n};\n\nexport function validateOpts(opts: PoseidonOpts) {\n const { Fp, mds, reversePartialPowIdx: rev, roundConstants: rc } = opts;\n const { roundsFull, roundsPartial, sboxPower, t } = opts;\n\n validateField(Fp);\n for (const i of ['t', 'roundsFull', 'roundsPartial'] as const) {\n if (typeof opts[i] !== 'number' || !Number.isSafeInteger(opts[i]))\n throw new Error(`Poseidon: invalid param ${i}=${opts[i]} (${typeof opts[i]})`);\n }\n\n // MDS is TxT matrix\n if (!Array.isArray(mds) || mds.length !== t) throw new Error('Poseidon: wrong MDS matrix');\n const _mds = mds.map((mdsRow) => {\n if (!Array.isArray(mdsRow) || mdsRow.length !== t)\n throw new Error(`Poseidon MDS matrix row: ${mdsRow}`);\n return mdsRow.map((i) => {\n if (typeof i !== 'bigint') throw new Error(`Poseidon MDS matrix value=${i}`);\n return Fp.create(i);\n });\n });\n\n if (rev !== undefined && typeof rev !== 'boolean')\n throw new Error(`Poseidon: invalid param reversePartialPowIdx=${rev}`);\n\n if (roundsFull % 2 !== 0) throw new Error(`Poseidon roundsFull is not even: ${roundsFull}`);\n const rounds = roundsFull + roundsPartial;\n\n if (!Array.isArray(rc) || rc.length !== rounds)\n throw new Error('Poseidon: wrong round constants');\n const roundConstants = rc.map((rc) => {\n if (!Array.isArray(rc) || rc.length !== t)\n throw new Error(`Poseidon wrong round constants: ${rc}`);\n return rc.map((i) => {\n if (typeof i !== 'bigint' || !Fp.isValid(i))\n throw new Error(`Poseidon wrong round constant=${i}`);\n return Fp.create(i);\n });\n });\n\n if (!sboxPower || ![3, 5, 7].includes(sboxPower))\n throw new Error(`Poseidon wrong sboxPower=${sboxPower}`);\n const _sboxPower = BigInt(sboxPower);\n let sboxFn = (n: bigint) => FpPow(Fp, n, _sboxPower);\n // Unwrapped sbox power for common cases (195->142μs)\n if (sboxPower === 3) sboxFn = (n: bigint) => Fp.mul(Fp.sqrN(n), n);\n else if (sboxPower === 5) sboxFn = (n: bigint) => Fp.mul(Fp.sqrN(Fp.sqrN(n)), n);\n\n return Object.freeze({ ...opts, rounds, sboxFn, roundConstants, mds: _mds });\n}\n\nexport function splitConstants(rc: bigint[], t: number) {\n if (typeof t !== 'number') throw new Error('poseidonSplitConstants: wrong t');\n if (!Array.isArray(rc) || rc.length % t) throw new Error('poseidonSplitConstants: wrong rc');\n const res = [];\n let tmp = [];\n for (let i = 0; i < rc.length; i++) {\n tmp.push(rc[i]);\n if (tmp.length === t) {\n res.push(tmp);\n tmp = [];\n }\n }\n return res;\n}\n\nexport function poseidon(opts: PoseidonOpts) {\n const _opts = validateOpts(opts);\n const { Fp, mds, roundConstants, rounds, roundsPartial, sboxFn, t } = _opts;\n const halfRoundsFull = _opts.roundsFull / 2;\n const partialIdx = _opts.reversePartialPowIdx ? t - 1 : 0;\n const poseidonRound = (values: bigint[], isFull: boolean, idx: number) => {\n values = values.map((i, j) => Fp.add(i, roundConstants[idx][j]));\n\n if (isFull) values = values.map((i) => sboxFn(i));\n else values[partialIdx] = sboxFn(values[partialIdx]);\n // Matrix multiplication\n values = mds.map((i) => i.reduce((acc, i, j) => Fp.add(acc, Fp.mulN(i, values[j])), Fp.ZERO));\n return values;\n };\n const poseidonHash = function poseidonHash(values: bigint[]) {\n if (!Array.isArray(values) || values.length !== t)\n throw new Error(`Poseidon: wrong values (expected array of bigints with length ${t})`);\n values = values.map((i) => {\n if (typeof i !== 'bigint') throw new Error(`Poseidon: wrong value=${i} (${typeof i})`);\n return Fp.create(i);\n });\n let round = 0;\n // Apply r_f/2 full rounds.\n for (let i = 0; i < halfRoundsFull; i++) values = poseidonRound(values, true, round++);\n // Apply r_p partial rounds.\n for (let i = 0; i < roundsPartial; i++) values = poseidonRound(values, false, round++);\n // Apply r_f/2 full rounds.\n for (let i = 0; i < halfRoundsFull; i++) values = poseidonRound(values, true, round++);\n\n if (round !== rounds)\n throw new Error(`Poseidon: wrong number of rounds: last round=${round}, total=${rounds}`);\n return values;\n };\n // For verification in tests\n poseidonHash.roundConstants = roundConstants;\n return poseidonHash;\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { IField, validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n\nexport type AffinePoint<T> = {\n x: T;\n y: T;\n} & { z?: never; t?: never };\n\nexport interface Group<T extends Group<T>> {\n double(): T;\n negate(): T;\n add(other: T): T;\n subtract(other: T): T;\n equals(other: T): boolean;\n multiply(scalar: bigint): T;\n}\n\nexport type GroupConstructor<T> = {\n BASE: T;\n ZERO: T;\n};\nexport type Mapper<T> = (i: T[]) => T[];\n\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF<T extends Group<T>>(c: GroupConstructor<T>, bits: number) {\n const constTimeNegate = (condition: boolean, item: T): T => {\n const neg = item.negate();\n return condition ? neg : item;\n };\n const opts = (W: number) => {\n const windows = Math.ceil(bits / W) + 1; // +1, because\n const windowSize = 2 ** (W - 1); // -1 because we skip zero\n return { windows, windowSize };\n };\n return {\n constTimeNegate,\n // non-const time multiplication ladder\n unsafeLadder(elm: T, n: bigint) {\n let p = c.ZERO;\n let d: T = elm;\n while (n > _0n) {\n if (n & _1n) p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n },\n\n /**\n * Creates a wNAF precomputation window. Used for caching.\n * Default window size is set by `utils.precompute()` and is equal to 8.\n * Number of precomputed points depends on the curve size:\n * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n * - 𝑊 is the window size\n * - 𝑛 is the bitlength of the curve order.\n * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm: T, W: number): Group<T>[] {\n const { windows, windowSize } = opts(W);\n const points: T[] = [];\n let p: T = elm;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n // =1, because we skip zero\n for (let i = 1; i < windowSize; i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n },\n\n /**\n * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n * @param W window size\n * @param precomputes precomputed tables\n * @param n scalar (we don't check here, but should be less than curve order)\n * @returns real and fake (for const-time) points\n */\n wNAF(W: number, precomputes: T[], n: bigint): { p: T; f: T } {\n // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n // But need to carefully remove other checks before wNAF. ORDER == bits here\n const { windows, windowSize } = opts(W);\n\n let p = c.ZERO;\n let f = c.BASE;\n\n const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n // Extract W bits.\n let wbits = Number(n & mask);\n\n // Shift number by W bits.\n n >>= shiftBy;\n\n // If the bits are bigger than max size, we'll split those.\n // +224 => 256 - 32\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n\n // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n // there is negate now: it is possible that negated element from low value\n // would be the same as high element, which will create carry into next window.\n // It's not obvious how this can fail, but still worth investigating later.\n\n // Check if we're onto Zero point.\n // Add random point inside current window to f.\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n // The most important part for const-time getPublicKey\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n } else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n // Even if the variable is still unused, there are some checks which will\n // throw an exception, so compiler needs to prove they won't happen, which is hard.\n // At this point there is a way to F be infinity-point even if p is not,\n // which makes it less const-time: around 1 bigint multiply.\n return { p, f };\n },\n\n wNAFCached(P: T, precomputesMap: Map<T, T[]>, n: bigint, transform: Mapper<T>): { p: T; f: T } {\n // @ts-ignore\n const W: number = P._WINDOW_SIZE || 1;\n // Calculate precomputes on a first run, reuse them after\n let comp = precomputesMap.get(P);\n if (!comp) {\n comp = this.precomputeWindow(P, W) as T[];\n if (W !== 1) {\n precomputesMap.set(P, transform(comp));\n }\n }\n return this.wNAF(W, comp, n);\n },\n };\n}\n\n// Generic BasicCurve interface: works even for polynomial fields (BLS): P, n, h would be ok.\n// Though generator can be different (Fp2 / Fp6 for BLS).\nexport type BasicCurve<T> = {\n Fp: IField<T>; // Field over which we'll do calculations (Fp)\n n: bigint; // Curve order, total count of valid points in the field\n nBitLength?: number; // bit length of curve order\n nByteLength?: number; // byte length of curve order\n h: bigint; // cofactor. we can assign default=1, but users will just ignore it w/o validation\n hEff?: bigint; // Number to multiply to clear cofactor\n Gx: T; // base point X coordinate\n Gy: T; // base point Y coordinate\n allowInfinityPoint?: boolean; // bls12-381 requires it. ZERO point is valid, but invalid pubkey\n};\n\nexport function validateBasic<FP, T>(curve: BasicCurve<FP> & T) {\n validateField(curve.Fp);\n validateObject(\n curve,\n {\n n: 'bigint',\n h: 'bigint',\n Gx: 'field',\n Gy: 'field',\n },\n {\n nBitLength: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n }\n );\n // Set defaults\n return Object.freeze({\n ...nLength(curve.n, curve.nBitLength),\n ...curve,\n ...{ p: curve.Fp.ORDER },\n } as const);\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { CHash, Hex, PrivKey, ensureBytes } from './utils.js';\nimport { Group, GroupConstructor, wNAF, BasicCurve, validateBasic, AffinePoint } from './curve.js';\n\nexport type { AffinePoint };\ntype HmacFnSync = (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array;\ntype EndomorphismOpts = {\n beta: bigint;\n splitScalar: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\nexport type BasicWCurve<T> = BasicCurve<T> & {\n // Params: a, b\n a: T;\n b: T;\n\n // Optional params\n allowedPrivateKeyLengths?: readonly number[]; // for P521\n wrapPrivateKey?: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n endo?: EndomorphismOpts; // Endomorphism options for Koblitz curves\n // When a cofactor != 1, there can be an effective methods to:\n // 1. Determine whether a point is torsion-free\n isTorsionFree?: (c: ProjConstructor<T>, point: ProjPointType<T>) => boolean;\n // 2. Clear torsion component\n clearCofactor?: (c: ProjConstructor<T>, point: ProjPointType<T>) => ProjPointType<T>;\n};\n\ntype Entropy = Hex | true;\nexport type SignOpts = { lowS?: boolean; extraEntropy?: Entropy; prehash?: boolean };\nexport type VerOpts = { lowS?: boolean; prehash?: boolean };\n\n/**\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n * `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n * `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n * it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance of nominative types in TypeScript and interfaces only check for shape, so it's hard to create unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n * 1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n * which is hard to debug.\n * 2. Params can be generic and we can't enforce them to be constant value:\n * if somebody creates curve from non-constant params,\n * it would be allowed to interact with other curves with non-constant params\n *\n * TODO: https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n */\n\n// Instance for 3d XYZ points\nexport interface ProjPointType<T> extends Group<ProjPointType<T>> {\n readonly px: T;\n readonly py: T;\n readonly pz: T;\n get x(): T;\n get y(): T;\n multiply(scalar: bigint): ProjPointType<T>;\n toAffine(iz?: T): AffinePoint<T>;\n isTorsionFree(): boolean;\n clearCofactor(): ProjPointType<T>;\n assertValidity(): void;\n hasEvenY(): boolean;\n toRawBytes(isCompressed?: boolean): Uint8Array;\n toHex(isCompressed?: boolean): string;\n\n multiplyUnsafe(scalar: bigint): ProjPointType<T>;\n multiplyAndAddUnsafe(Q: ProjPointType<T>, a: bigint, b: bigint): ProjPointType<T> | undefined;\n _setWindowSize(windowSize: number): void;\n}\n// Static methods for 3d XYZ points\nexport interface ProjConstructor<T> extends GroupConstructor<ProjPointType<T>> {\n new (x: T, y: T, z: T): ProjPointType<T>;\n fromAffine(p: AffinePoint<T>): ProjPointType<T>;\n fromHex(hex: Hex): ProjPointType<T>;\n fromPrivateKey(privateKey: PrivKey): ProjPointType<T>;\n normalizeZ(points: ProjPointType<T>[]): ProjPointType<T>[];\n}\n\nexport type CurvePointsType<T> = BasicWCurve<T> & {\n // Bytes\n fromBytes?: (bytes: Uint8Array) => AffinePoint<T>;\n toBytes?: (c: ProjConstructor<T>, point: ProjPointType<T>, isCompressed: boolean) => Uint8Array;\n};\n\nfunction validatePointOpts<T>(curve: CurvePointsType<T>) {\n const opts = validateBasic(curve);\n ut.validateObject(\n opts,\n {\n a: 'field',\n b: 'field',\n },\n {\n allowedPrivateKeyLengths: 'array',\n wrapPrivateKey: 'boolean',\n isTorsionFree: 'function',\n clearCofactor: 'function',\n allowInfinityPoint: 'boolean',\n fromBytes: 'function',\n toBytes: 'function',\n }\n );\n const { endo, Fp, a } = opts;\n if (endo) {\n if (!Fp.eql(a, Fp.ZERO)) {\n throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n }\n if (\n typeof endo !== 'object' ||\n typeof endo.beta !== 'bigint' ||\n typeof endo.splitScalar !== 'function'\n ) {\n throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts } as const);\n}\n\nexport type CurvePointsRes<T> = {\n CURVE: ReturnType<typeof validatePointOpts<T>>;\n ProjectivePoint: ProjConstructor<T>;\n normPrivateKeyToScalar: (key: PrivKey) => bigint;\n weierstrassEquation: (x: T) => T;\n isWithinCurveOrder: (num: bigint) => boolean;\n};\n\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n // asn.1 DER encoding utils\n Err: class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n },\n _parseInt(data: Uint8Array): { d: bigint; l: Uint8Array } {\n const { Err: E } = DER;\n if (data.length < 2 || data[0] !== 0x02) throw new E('Invalid signature integer tag');\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len) throw new E('Invalid signature integer: wrong length');\n // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n // since we always use positive integers here. It must always be empty:\n // - add zero byte if exists\n // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n if (res[0] & 0b10000000) throw new E('Invalid signature integer: negative');\n if (res[0] === 0x00 && !(res[1] & 0b10000000))\n throw new E('Invalid signature integer: unnecessary leading zero');\n return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n },\n toSig(hex: string | Uint8Array): { r: bigint; s: bigint } {\n // parse DER signature\n const { Err: E } = DER;\n const data = typeof hex === 'string' ? h2b(hex) : hex;\n if (!ut.isBytes(data)) throw new Error('ui8a expected');\n let l = data.length;\n if (l < 2 || data[0] != 0x30) throw new E('Invalid signature tag');\n if (data[1] !== l - 2) throw new E('Invalid signature: incorrect length');\n const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n if (rBytesLeft.length) throw new E('Invalid signature: left bytes after parsing');\n return { r, s };\n },\n hexFromSig(sig: { r: bigint; s: bigint }): string {\n // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n const slice = (s: string): string => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n const h = (num: number | bigint) => {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n };\n const s = slice(h(sig.s));\n const r = slice(h(sig.r));\n const shl = s.length / 2;\n const rhl = r.length / 2;\n const sl = h(shl);\n const rl = h(rhl);\n return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n },\n};\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\n\nexport function weierstrassPoints<T>(opts: CurvePointsType<T>): CurvePointsRes<T> {\n const CURVE = validatePointOpts(opts);\n const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n\n const toBytes =\n CURVE.toBytes ||\n ((_c: ProjConstructor<T>, point: ProjPointType<T>, _isCompressed: boolean) => {\n const a = point.toAffine();\n return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n });\n const fromBytes =\n CURVE.fromBytes ||\n ((bytes: Uint8Array) => {\n // const head = bytes[0];\n const tail = bytes.subarray(1);\n // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n });\n\n /**\n * y² = x³ + ax + b: Short weierstrass curve formula\n * @returns y²\n */\n function weierstrassEquation(x: T): T {\n const { a, b } = CURVE;\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n }\n // Validate whether the passed curve params are valid.\n // We check if curve equation works for generator point.\n // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n // ProjectivePoint class has not been initialized yet.\n if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n throw new Error('bad generator point: equation left != right');\n\n // Valid group elements reside in range 1..n-1\n function isWithinCurveOrder(num: bigint): boolean {\n return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n }\n function assertGE(num: bigint) {\n if (!isWithinCurveOrder(num)) throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n }\n // Validates if priv key is valid and converts it to bigint.\n // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n function normPrivateKeyToScalar(key: PrivKey): bigint {\n const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n if (lengths && typeof key !== 'bigint') {\n if (ut.isBytes(key)) key = ut.bytesToHex(key);\n // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n if (typeof key !== 'string' || !lengths.includes(key.length)) throw new Error('Invalid key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num: bigint;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n } catch (error) {\n throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n }\n if (wrapPrivateKey) num = mod.mod(num, n); // disabled by default, enabled for BLS\n assertGE(num); // num in range [1..N-1]\n return num;\n }\n\n const pointPrecomputes = new Map<Point, Point[]>();\n function assertPrjPoint(other: unknown) {\n if (!(other instanceof Point)) throw new Error('ProjectivePoint expected');\n }\n /**\n * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n * Default Point works in 2d / affine coordinates: (x, y)\n * We're doing calculations in projective, because its operations don't require costly inversion.\n */\n class Point implements ProjPointType<T> {\n static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n\n constructor(\n readonly px: T,\n readonly py: T,\n readonly pz: T\n ) {\n if (px == null || !Fp.isValid(px)) throw new Error('x required');\n if (py == null || !Fp.isValid(py)) throw new Error('y required');\n if (pz == null || !Fp.isValid(pz)) throw new Error('z required');\n }\n\n // Does not validate if the point is on-curve.\n // Use fromHex instead, or call assertValidity() later.\n static fromAffine(p: AffinePoint<T>): Point {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n if (p instanceof Point) throw new Error('projective point not allowed');\n const is0 = (i: T) => Fp.eql(i, Fp.ZERO);\n // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n if (is0(x) && is0(y)) return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n\n get x(): T {\n return this.toAffine().x;\n }\n get y(): T {\n return this.toAffine().y;\n }\n\n /**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\n static normalizeZ(points: Point[]): Point[] {\n const toInv = Fp.invertBatch(points.map((p) => p.pz));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n\n /**\n * Converts hash string or Uint8Array to Point.\n * @param hex short/long ECDSA hex\n */\n static fromHex(hex: Hex): Point {\n const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n P.assertValidity();\n return P;\n }\n\n // Multiplies generator point by privateKey.\n static fromPrivateKey(privateKey: PrivKey) {\n return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n }\n\n // We calculate precomputes for elliptic curve point multiplication\n // using windowed method. This specifies window size and\n // stores precomputed values. Usually only base point would be precomputed.\n _WINDOW_SIZE?: number;\n\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize: number) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n\n // A point on curve is valid if it conforms to equation.\n assertValidity(): void {\n if (this.is0()) {\n // (0, 1, 0) aka ZERO is invalid in most contexts.\n // In BLS, ZERO can be serialized, so we allow it.\n // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n if (CURVE.allowInfinityPoint && !Fp.is0(this.py)) return;\n throw new Error('bad point: ZERO');\n }\n // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n const { x, y } = this.toAffine();\n // Check if x, y are valid field elements\n if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error('bad point: x or y not FE');\n const left = Fp.sqr(y); // y²\n const right = weierstrassEquation(x); // x³ + ax + b\n if (!Fp.eql(left, right)) throw new Error('bad point: equation left != right');\n if (!this.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n }\n hasEvenY(): boolean {\n const { y } = this.toAffine();\n if (Fp.isOdd) return !Fp.isOdd(y);\n throw new Error(\"Field doesn't support isOdd\");\n }\n\n /**\n * Compare one point to another.\n */\n equals(other: Point): boolean {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n return U1 && U2;\n }\n\n /**\n * Flips point to one corresponding to (x, -y) in Affine coordinates.\n */\n negate(): Point {\n return new Point(this.px, Fp.neg(this.py), this.pz);\n }\n\n // Renes-Costello-Batina exception-free doubling formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 3\n // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n double() {\n const { a, b } = CURVE;\n const b3 = Fp.mul(b, _3n);\n const { px: X1, py: Y1, pz: Z1 } = this;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n let t0 = Fp.mul(X1, X1); // step 1\n let t1 = Fp.mul(Y1, Y1);\n let t2 = Fp.mul(Z1, Z1);\n let t3 = Fp.mul(X1, Y1);\n t3 = Fp.add(t3, t3); // step 5\n Z3 = Fp.mul(X1, Z1);\n Z3 = Fp.add(Z3, Z3);\n X3 = Fp.mul(a, Z3);\n Y3 = Fp.mul(b3, t2);\n Y3 = Fp.add(X3, Y3); // step 10\n X3 = Fp.sub(t1, Y3);\n Y3 = Fp.add(t1, Y3);\n Y3 = Fp.mul(X3, Y3);\n X3 = Fp.mul(t3, X3);\n Z3 = Fp.mul(b3, Z3); // step 15\n t2 = Fp.mul(a, t2);\n t3 = Fp.sub(t0, t2);\n t3 = Fp.mul(a, t3);\n t3 = Fp.add(t3, Z3);\n Z3 = Fp.add(t0, t0); // step 20\n t0 = Fp.add(Z3, t0);\n t0 = Fp.add(t0, t2);\n t0 = Fp.mul(t0, t3);\n Y3 = Fp.add(Y3, t0);\n t2 = Fp.mul(Y1, Z1); // step 25\n t2 = Fp.add(t2, t2);\n t0 = Fp.mul(t2, t3);\n X3 = Fp.sub(X3, t0);\n Z3 = Fp.mul(t2, t1);\n Z3 = Fp.add(Z3, Z3); // step 30\n Z3 = Fp.add(Z3, Z3);\n return new Point(X3, Y3, Z3);\n }\n\n // Renes-Costello-Batina exception-free addition formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 1\n // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n add(other: Point): Point {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n const a = CURVE.a;\n const b3 = Fp.mul(CURVE.b, _3n);\n let t0 = Fp.mul(X1, X2); // step 1\n let t1 = Fp.mul(Y1, Y2);\n let t2 = Fp.mul(Z1, Z2);\n let t3 = Fp.add(X1, Y1);\n let t4 = Fp.add(X2, Y2); // step 5\n t3 = Fp.mul(t3, t4);\n t4 = Fp.add(t0, t1);\n t3 = Fp.sub(t3, t4);\n t4 = Fp.add(X1, Z1);\n let t5 = Fp.add(X2, Z2); // step 10\n t4 = Fp.mul(t4, t5);\n t5 = Fp.add(t0, t2);\n t4 = Fp.sub(t4, t5);\n t5 = Fp.add(Y1, Z1);\n X3 = Fp.add(Y2, Z2); // step 15\n t5 = Fp.mul(t5, X3);\n X3 = Fp.add(t1, t2);\n t5 = Fp.sub(t5, X3);\n Z3 = Fp.mul(a, t4);\n X3 = Fp.mul(b3, t2); // step 20\n Z3 = Fp.add(X3, Z3);\n X3 = Fp.sub(t1, Z3);\n Z3 = Fp.add(t1, Z3);\n Y3 = Fp.mul(X3, Z3);\n t1 = Fp.add(t0, t0); // step 25\n t1 = Fp.add(t1, t0);\n t2 = Fp.mul(a, t2);\n t4 = Fp.mul(b3, t4);\n t1 = Fp.add(t1, t2);\n t2 = Fp.sub(t0, t2); // step 30\n t2 = Fp.mul(a, t2);\n t4 = Fp.add(t4, t2);\n t0 = Fp.mul(t1, t4);\n Y3 = Fp.add(Y3, t0);\n t0 = Fp.mul(t5, t4); // step 35\n X3 = Fp.mul(t3, X3);\n X3 = Fp.sub(X3, t0);\n t0 = Fp.mul(t3, t1);\n Z3 = Fp.mul(t5, Z3);\n Z3 = Fp.add(Z3, t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n\n subtract(other: Point) {\n return this.add(other.negate());\n }\n\n private is0() {\n return this.equals(Point.ZERO);\n }\n private wNAF(n: bigint): { p: Point; f: Point } {\n return wnaf.wNAFCached(this, pointPrecomputes, n, (comp: Point[]) => {\n const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n });\n }\n\n /**\n * Non-constant-time multiplication. Uses double-and-add algorithm.\n * It's faster, but should only be used when you don't care about\n * an exposed private key e.g. sig verification, which works over *public* keys.\n */\n multiplyUnsafe(n: bigint): Point {\n const I = Point.ZERO;\n if (n === _0n) return I;\n assertGE(n); // Will throw on 0\n if (n === _1n) return this;\n const { endo } = CURVE;\n if (!endo) return wnaf.unsafeLadder(this, n);\n\n // Apply endomorphism\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = I;\n let k2p = I;\n let d: Point = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n) k1p = k1p.add(d);\n if (k2 & _1n) k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg) k1p = k1p.negate();\n if (k2neg) k2p = k2p.negate();\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n return k1p.add(k2p);\n }\n\n /**\n * Constant time multiplication.\n * Uses wNAF method. Windowed method may be 10% faster,\n * but takes 2x longer to generate and consumes 2x memory.\n * Uses precomputes when available.\n * Uses endomorphism for Koblitz curves.\n * @param scalar by which the point would be multiplied\n * @returns New point\n */\n multiply(scalar: bigint): Point {\n assertGE(scalar);\n let n = scalar;\n let point: Point, fake: Point; // Fake point is used to const-time mult\n const { endo } = CURVE;\n if (endo) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1);\n let { p: k2p, f: f2p } = this.wNAF(k2);\n k1p = wnaf.constTimeNegate(k1neg, k1p);\n k2p = wnaf.constTimeNegate(k2neg, k2p);\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n } else {\n const { p, f } = this.wNAF(n);\n point = p;\n fake = f;\n }\n // Normalize `z` for both points, but return only real one\n return Point.normalizeZ([point, fake])[0];\n }\n\n /**\n * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n * Not using Strauss-Shamir trick: precomputation tables are faster.\n * The trick could be useful if both P and Q are not G (not in our case).\n * @returns non-zero affine point\n */\n multiplyAndAddUnsafe(Q: Point, a: bigint, b: bigint): Point | undefined {\n const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n const mul = (\n P: Point,\n a: bigint // Select faster multiply() method\n ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n const sum = mul(this, a).add(mul(Q, b));\n return sum.is0() ? undefined : sum;\n }\n\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n toAffine(iz?: T): AffinePoint<T> {\n const { px: x, py: y, pz: z } = this;\n const is0 = this.is0();\n // If invZ was 0, we return zero point. However we still want to execute\n // all operations, so we replace invZ with a random number, 1.\n if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(z);\n const ax = Fp.mul(x, iz);\n const ay = Fp.mul(y, iz);\n const zz = Fp.mul(z, iz);\n if (is0) return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE)) throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n }\n isTorsionFree(): boolean {\n const { h: cofactor, isTorsionFree } = CURVE;\n if (cofactor === _1n) return true; // No subgroups, always torsion-free\n if (isTorsionFree) return isTorsionFree(Point, this);\n throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n }\n clearCofactor(): Point {\n const { h: cofactor, clearCofactor } = CURVE;\n if (cofactor === _1n) return this; // Fast-path\n if (clearCofactor) return clearCofactor(Point, this) as Point;\n return this.multiplyUnsafe(CURVE.h);\n }\n\n toRawBytes(isCompressed = true): Uint8Array {\n this.assertValidity();\n return toBytes(Point, this, isCompressed);\n }\n\n toHex(isCompressed = true): string {\n return ut.bytesToHex(this.toRawBytes(isCompressed));\n }\n }\n const _bits = CURVE.nBitLength;\n const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n // Validate if generator point is on curve\n return {\n CURVE,\n ProjectivePoint: Point as ProjConstructor<T>,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n };\n}\n\n// Instance\nexport interface SignatureType {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n assertValidity(): void;\n addRecoveryBit(recovery: number): RecoveredSignatureType;\n hasHighS(): boolean;\n normalizeS(): SignatureType;\n recoverPublicKey(msgHash: Hex): ProjPointType<bigint>;\n toCompactRawBytes(): Uint8Array;\n toCompactHex(): string;\n // DER-encoded\n toDERRawBytes(isCompressed?: boolean): Uint8Array;\n toDERHex(isCompressed?: boolean): string;\n}\nexport type RecoveredSignatureType = SignatureType & {\n readonly recovery: number;\n};\n// Static methods\nexport type SignatureConstructor = {\n new (r: bigint, s: bigint): SignatureType;\n fromCompact(hex: Hex): SignatureType;\n fromDER(hex: Hex): SignatureType;\n};\ntype SignatureLike = { r: bigint; s: bigint };\n\nexport type PubKey = Hex | ProjPointType<bigint>;\n\nexport type CurveType = BasicWCurve<bigint> & {\n hash: CHash; // CHash not FHash because we need outputLen for DRBG\n hmac: HmacFnSync;\n randomBytes: (bytesLength?: number) => Uint8Array;\n lowS?: boolean;\n bits2int?: (bytes: Uint8Array) => bigint;\n bits2int_modN?: (bytes: Uint8Array) => bigint;\n};\n\nfunction validateOpts(curve: CurveType) {\n const opts = validateBasic(curve);\n ut.validateObject(\n opts,\n {\n hash: 'hash',\n hmac: 'function',\n randomBytes: 'function',\n },\n {\n bits2int: 'function',\n bits2int_modN: 'function',\n lowS: 'boolean',\n }\n );\n return Object.freeze({ lowS: true, ...opts } as const);\n}\n\nexport type CurveFn = {\n CURVE: ReturnType<typeof validateOpts>;\n getPublicKey: (privateKey: PrivKey, isCompressed?: boolean) => Uint8Array;\n getSharedSecret: (privateA: PrivKey, publicB: Hex, isCompressed?: boolean) => Uint8Array;\n sign: (msgHash: Hex, privKey: PrivKey, opts?: SignOpts) => RecoveredSignatureType;\n verify: (signature: Hex | SignatureLike, msgHash: Hex, publicKey: Hex, opts?: VerOpts) => boolean;\n ProjectivePoint: ProjConstructor<bigint>;\n Signature: SignatureConstructor;\n utils: {\n normPrivateKeyToScalar: (key: PrivKey) => bigint;\n isValidPrivateKey(privateKey: PrivKey): boolean;\n randomPrivateKey: () => Uint8Array;\n precompute: (windowSize?: number, point?: ProjPointType<bigint>) => ProjPointType<bigint>;\n };\n};\n\nexport function weierstrass(curveDef: CurveType): CurveFn {\n const CURVE = validateOpts(curveDef) as ReturnType<typeof validateOpts>;\n const { Fp, n: CURVE_ORDER } = CURVE;\n const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n\n function isValidFieldElement(num: bigint): boolean {\n return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n }\n function modN(a: bigint) {\n return mod.mod(a, CURVE_ORDER);\n }\n function invN(a: bigint) {\n return mod.invert(a, CURVE_ORDER);\n }\n\n const {\n ProjectivePoint: Point,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n } = weierstrassPoints({\n ...CURVE,\n toBytes(_c, point, isCompressed: boolean): Uint8Array {\n const a = point.toAffine();\n const x = Fp.toBytes(a.x);\n const cat = ut.concatBytes;\n if (isCompressed) {\n return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n } else {\n return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n }\n },\n fromBytes(bytes: Uint8Array) {\n const len = bytes.length;\n const head = bytes[0];\n const tail = bytes.subarray(1);\n // this.assertValidity() is done inside of fromHex\n if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n const x = ut.bytesToNumberBE(tail);\n if (!isValidFieldElement(x)) throw new Error('Point is not on curve');\n const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n let y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n const isYOdd = (y & _1n) === _1n;\n // ECDSA\n const isHeadOdd = (head & 1) === 1;\n if (isHeadOdd !== isYOdd) y = Fp.neg(y);\n return { x, y };\n } else if (len === uncompressedLen && head === 0x04) {\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n } else {\n throw new Error(\n `Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`\n );\n }\n },\n });\n const numToNByteStr = (num: bigint): string =>\n ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n\n function isBiggerThanHalfOrder(number: bigint) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n\n function normalizeS(s: bigint) {\n return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n }\n // slice bytes num\n const slcNum = (b: Uint8Array, from: number, to: number) => ut.bytesToNumberBE(b.slice(from, to));\n\n /**\n * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n */\n class Signature implements SignatureType {\n constructor(\n readonly r: bigint,\n readonly s: bigint,\n readonly recovery?: number\n ) {\n this.assertValidity();\n }\n\n // pair (bytes of r, bytes of s)\n static fromCompact(hex: Hex) {\n const l = CURVE.nByteLength;\n hex = ensureBytes('compactSignature', hex, l * 2);\n return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n }\n\n // DER encoded ECDSA signature\n // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n static fromDER(hex: Hex) {\n const { r, s } = DER.toSig(ensureBytes('DER', hex));\n return new Signature(r, s);\n }\n\n assertValidity(): void {\n // can use assertGE here\n if (!isWithinCurveOrder(this.r)) throw new Error('r must be 0 < r < CURVE.n');\n if (!isWithinCurveOrder(this.s)) throw new Error('s must be 0 < s < CURVE.n');\n }\n\n addRecoveryBit(recovery: number): RecoveredSignature {\n return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n }\n\n recoverPublicKey(msgHash: Hex): typeof Point.BASE {\n const { r, s, recovery: rec } = this;\n const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n if (rec == null || ![0, 1, 2, 3].includes(rec)) throw new Error('recovery id invalid');\n const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n if (radj >= Fp.ORDER) throw new Error('recovery id 2 or 3 invalid');\n const prefix = (rec & 1) === 0 ? '02' : '03';\n const R = Point.fromHex(prefix + numToNByteStr(radj));\n const ir = invN(radj); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n if (!Q) throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n Q.assertValidity();\n return Q;\n }\n\n // Signatures should be low-s, to prevent malleability.\n hasHighS(): boolean {\n return isBiggerThanHalfOrder(this.s);\n }\n\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n }\n\n // DER-encoded\n toDERRawBytes() {\n return ut.hexToBytes(this.toDERHex());\n }\n toDERHex() {\n return DER.hexFromSig({ r: this.r, s: this.s });\n }\n\n // padded bytes of r, then padded bytes of s\n toCompactRawBytes() {\n return ut.hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteStr(this.r) + numToNByteStr(this.s);\n }\n }\n type RecoveredSignature = Signature & { recovery: number };\n\n const utils = {\n isValidPrivateKey(privateKey: PrivKey) {\n try {\n normPrivateKeyToScalar(privateKey);\n return true;\n } catch (error) {\n return false;\n }\n },\n normPrivateKeyToScalar: normPrivateKeyToScalar,\n\n /**\n * Produces cryptographically secure private key from random of size\n * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n */\n randomPrivateKey: (): Uint8Array => {\n const length = mod.getMinHashLength(CURVE.n);\n return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n },\n\n /**\n * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n * Allows to massively speed-up `point.multiply(scalar)`.\n * @returns cached point\n * @example\n * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n * fast.multiply(privKey); // much faster ECDH now\n */\n precompute(windowSize = 8, point = Point.BASE): typeof Point.BASE {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n return point;\n },\n };\n\n /**\n * Computes public key for a private key. Checks for validity of the private key.\n * @param privateKey private key\n * @param isCompressed whether to return compact (default), or full key\n * @returns Public key, full when isCompressed=false; short when isCompressed=true\n */\n function getPublicKey(privateKey: PrivKey, isCompressed = true): Uint8Array {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n }\n\n /**\n * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n */\n function isProbPub(item: PrivKey | PubKey): boolean {\n const arr = ut.isBytes(item);\n const str = typeof item === 'string';\n const len = (arr || str) && (item as Hex).length;\n if (arr) return len === compressedLen || len === uncompressedLen;\n if (str) return len === 2 * compressedLen || len === 2 * uncompressedLen;\n if (item instanceof Point) return true;\n return false;\n }\n\n /**\n * ECDH (Elliptic Curve Diffie Hellman).\n * Computes shared public key from private key and public key.\n * Checks: 1) private key validity 2) shared key is on-curve.\n * Does NOT hash the result.\n * @param privateA private key\n * @param publicB different public key\n * @param isCompressed whether to return compact (default), or full key\n * @returns shared public key\n */\n function getSharedSecret(privateA: PrivKey, publicB: Hex, isCompressed = true): Uint8Array {\n if (isProbPub(privateA)) throw new Error('first arg must be private key');\n if (!isProbPub(publicB)) throw new Error('second arg must be public key');\n const b = Point.fromHex(publicB); // check for being on-curve\n return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n }\n\n // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n const bits2int =\n CURVE.bits2int ||\n function (bytes: Uint8Array): bigint {\n // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n // for some cases, since bytes.length * 8 is not actual bitLength.\n const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n return delta > 0 ? num >> BigInt(delta) : num;\n };\n const bits2int_modN =\n CURVE.bits2int_modN ||\n function (bytes: Uint8Array): bigint {\n return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n };\n // NOTE: pads output with zero as per spec\n const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n /**\n * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n */\n function int2octets(num: bigint): Uint8Array {\n if (typeof num !== 'bigint') throw new Error('bigint expected');\n if (!(_0n <= num && num < ORDER_MASK))\n throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n // works with order, can have different size than numToField!\n return ut.numberToBytesBE(num, CURVE.nByteLength);\n }\n\n // Steps A, D of RFC6979 3.2\n // Creates RFC6979 seed; converts msg/privKey to numbers.\n // Used only in sign, not in verify.\n // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n // Also it can be bigger for P224 + SHA256\n function prepSig(msgHash: Hex, privateKey: PrivKey, opts = defaultSigOpts) {\n if (['recovered', 'canonical'].some((k) => k in opts))\n throw new Error('sign() legacy options not supported');\n const { hash, randomBytes } = CURVE;\n let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n if (lowS == null) lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n msgHash = ensureBytes('msgHash', msgHash);\n if (prehash) msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n\n // We can't later call bits2octets, since nested bits2int is broken for curves\n // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n const h1int = bits2int_modN(msgHash);\n const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n const seedArgs = [int2octets(d), int2octets(h1int)];\n // extraEntropy. RFC6979 3.6: additional k' (optional).\n if (ent != null) {\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n }\n const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n // Converts signature params into point w r/s, checks result for validity.\n function k2sig(kBytes: Uint8Array): RecoveredSignature | undefined {\n // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n if (!isWithinCurveOrder(k)) return; // Important: all mod() calls here must be done over N\n const ik = invN(k); // k^-1 mod n\n const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n const r = modN(q.x); // r = q.x mod n\n if (r === _0n) return;\n // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n const s = modN(ik * modN(m + r * d)); // Not using blinding here\n if (s === _0n) return;\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n let normS = s;\n if (lowS && isBiggerThanHalfOrder(s)) {\n normS = normalizeS(s); // if lowS was passed, ensure s is always\n recovery ^= 1; // // in the bottom half of N\n }\n return new Signature(r, normS, recovery) as RecoveredSignature; // use normS, not s\n }\n return { seed, k2sig };\n }\n const defaultSigOpts: SignOpts = { lowS: CURVE.lowS, prehash: false };\n const defaultVerOpts: VerOpts = { lowS: CURVE.lowS, prehash: false };\n\n /**\n * Signs message hash with a private key.\n * ```\n * sign(m, d, k) where\n * (x, y) = G × k\n * r = x mod n\n * s = (m + dr)/k mod n\n * ```\n * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n * @param privKey private key\n * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n * @returns signature with recovery param\n */\n function sign(msgHash: Hex, privKey: PrivKey, opts = defaultSigOpts): RecoveredSignature {\n const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n const C = CURVE;\n const drbg = ut.createHmacDrbg<RecoveredSignature>(C.hash.outputLen, C.nByteLength, C.hmac);\n return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n }\n\n // Enable precomputes. Slows down first publicKey computation by 20ms.\n Point.BASE._setWindowSize(8);\n // utils.precompute(8, ProjectivePoint.BASE)\n\n /**\n * Verifies a signature against message hash and public key.\n * Rejects lowS signatures by default: to override,\n * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n *\n * ```\n * verify(r, s, h, P) where\n * U1 = hs^-1 mod n\n * U2 = rs^-1 mod n\n * R = U1⋅G - U2⋅P\n * mod(R.x, n) == r\n * ```\n */\n function verify(\n signature: Hex | SignatureLike,\n msgHash: Hex,\n publicKey: Hex,\n opts = defaultVerOpts\n ): boolean {\n const sg = signature;\n msgHash = ensureBytes('msgHash', msgHash);\n publicKey = ensureBytes('publicKey', publicKey);\n if ('strict' in opts) throw new Error('options.strict was renamed to lowS');\n const { lowS, prehash } = opts;\n\n let _sig: Signature | undefined = undefined;\n let P: ProjPointType<bigint>;\n try {\n if (typeof sg === 'string' || ut.isBytes(sg)) {\n // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n // Since DER can also be 2*nByteLength bytes, we check for it first.\n try {\n _sig = Signature.fromDER(sg);\n } catch (derError) {\n if (!(derError instanceof DER.Err)) throw derError;\n _sig = Signature.fromCompact(sg);\n }\n } else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n const { r, s } = sg;\n _sig = new Signature(r, s);\n } else {\n throw new Error('PARSE');\n }\n P = Point.fromHex(publicKey);\n } catch (error) {\n if ((error as Error).message === 'PARSE')\n throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n return false;\n }\n if (lowS && _sig.hasHighS()) return false;\n if (prehash) msgHash = CURVE.hash(msgHash);\n const { r, s } = _sig;\n const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n const is = invN(s); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n if (!R) return false;\n const v = modN(R.x);\n return v === r;\n }\n return {\n CURVE,\n getPublicKey,\n getSharedSecret,\n sign,\n verify,\n ProjectivePoint: Point,\n Signature,\n utils,\n };\n}\n\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio<T>(Fp: mod.IField<T>, Z: T) {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n) l += _1n;\n const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n // 2n ** c1 == 2n << (c1-1)\n const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1) # Integer arithmetic\n const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2 # Integer arithmetic\n const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1 # Integer arithmetic\n const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1) # Integer arithmetic\n const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n let sqrtRatio = (u: T, v: T): { isValid: boolean; value: T } => {\n let tv1 = c6; // 1. tv1 = c6\n let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n // 17. for i in (c1, c1 - 1, ..., 2):\n for (let i = c1; i > _1n; i--) {\n let tv5 = i - _2n; // 18. tv5 = i - 2\n tv5 = _2n << (tv5 - _1n); // 19. tv5 = 2^tv5\n let tvv5 = Fp.pow(tv4, tv5); // 20. tv5 = tv4^tv5\n const e1 = Fp.eql(tvv5, Fp.ONE); // 21. e1 = tv5 == 1\n tv2 = Fp.mul(tv3, tv1); // 22. tv2 = tv3 * tv1\n tv1 = Fp.mul(tv1, tv1); // 23. tv1 = tv1 * tv1\n tvv5 = Fp.mul(tv4, tv1); // 24. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, e1); // 25. tv3 = CMOV(tv2, tv3, e1)\n tv4 = Fp.cmov(tvv5, tv4, e1); // 26. tv4 = CMOV(tv5, tv4, e1)\n }\n return { isValid: isQR, value: tv3 };\n };\n if (Fp.ORDER % _4n === _3n) {\n // sqrt_ratio_3mod4(u, v)\n const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4 # Integer arithmetic\n const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n sqrtRatio = (u: T, v: T) => {\n let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n };\n }\n // No curves uses that\n // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU<T>(\n Fp: mod.IField<T>,\n opts: {\n A: T;\n B: T;\n Z: T;\n }\n) {\n mod.validateField(Fp);\n if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n throw new Error('mapToCurveSimpleSWU: invalid opts');\n const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n if (!Fp.isOdd) throw new Error('Fp.isOdd is not implemented!');\n // Input: u, an element of F.\n // Output: (x, y), a point on E.\n return (u: T): { x: T; y: T } => {\n // prettier-ignore\n let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, opts.Z); // 2. tv1 = Z * tv1\n tv2 = Fp.sqr(tv1); // 3. tv2 = tv1^2\n tv2 = Fp.add(tv2, tv1); // 4. tv2 = tv2 + tv1\n tv3 = Fp.add(tv2, Fp.ONE); // 5. tv3 = tv2 + 1\n tv3 = Fp.mul(tv3, opts.B); // 6. tv3 = B * tv3\n tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7. tv4 = CMOV(Z, -tv2, tv2 != 0)\n tv4 = Fp.mul(tv4, opts.A); // 8. tv4 = A * tv4\n tv2 = Fp.sqr(tv3); // 9. tv2 = tv3^2\n tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n x = Fp.mul(tv1, tv3); // 17. x = tv1 * tv3\n const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n y = Fp.mul(tv1, u); // 19. y = tv1 * u -> Z * u^3 * y1\n y = Fp.mul(y, value); // 20. y = y * y1\n x = Fp.cmov(x, tv3, isValid); // 21. x = CMOV(x, tv3, is_gx1_square)\n y = Fp.cmov(y, value, isValid); // 22. y = CMOV(y, y1, is_gx1_square)\n const e1 = Fp.isOdd!(u) === Fp.isOdd!(y); // 23. e1 = sgn0(u) == sgn0(y)\n y = Fp.cmov(Fp.neg(y), y, e1); // 24. y = CMOV(-y, y, e1)\n x = Fp.div(x, tv4); // 25. x = x / tv4\n return { x, y };\n };\n}\n","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, CHash, Input, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, _key: Input) {\n super();\n assertHash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create() as T;\n if (typeof this.iHash.update !== 'function')\n throw new Error('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf: Input) {\n assertExists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array) {\n assertExists(this);\n assertBytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: HMAC<T>): HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash: CHash, key: Input, message: Input): Uint8Array =>\n new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass, CurveType } from './abstract/weierstrass.js';\nimport { CHash } from './abstract/utils.js';\n\n// connects noble-curves to noble-hashes\nexport function getHash(hash: CHash) {\n return {\n hash,\n hmac: (key: Uint8Array, ...msgs: Uint8Array[]) => hmac(hash, key, concatBytes(...msgs)),\n randomBytes,\n };\n}\n// Same API as @noble/hashes, with ability to create curve with custom hash\ntype CurveDef = Readonly<Omit<CurveType, 'hash' | 'hmac' | 'randomBytes'>>;\nexport function createCurve(curveDef: CurveDef, defHash: CHash) {\n const create = (hash: CHash) => weierstrass({ ...curveDef, ...getHash(hash) });\n return Object.freeze({ ...create(defHash), create });\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Poseidon Hash: https://eprint.iacr.org/2019/458.pdf, https://www.poseidon-hash.info\nimport { IField, FpPow, validateField } from './modular.js';\n// We don't provide any constants, since different implementations use different constants.\n// For reference constants see './test/poseidon.test.js'.\nexport type PoseidonOpts = {\n Fp: IField<bigint>;\n t: number;\n roundsFull: number;\n roundsPartial: number;\n sboxPower?: number;\n reversePartialPowIdx?: boolean; // Hack for stark\n mds: bigint[][];\n roundConstants: bigint[][];\n};\n\nexport function validateOpts(opts: PoseidonOpts) {\n const { Fp, mds, reversePartialPowIdx: rev, roundConstants: rc } = opts;\n const { roundsFull, roundsPartial, sboxPower, t } = opts;\n\n validateField(Fp);\n for (const i of ['t', 'roundsFull', 'roundsPartial'] as const) {\n if (typeof opts[i] !== 'number' || !Number.isSafeInteger(opts[i]))\n throw new Error(`Poseidon: invalid param ${i}=${opts[i]} (${typeof opts[i]})`);\n }\n\n // MDS is TxT matrix\n if (!Array.isArray(mds) || mds.length !== t) throw new Error('Poseidon: wrong MDS matrix');\n const _mds = mds.map((mdsRow) => {\n if (!Array.isArray(mdsRow) || mdsRow.length !== t)\n throw new Error(`Poseidon MDS matrix row: ${mdsRow}`);\n return mdsRow.map((i) => {\n if (typeof i !== 'bigint') throw new Error(`Poseidon MDS matrix value=${i}`);\n return Fp.create(i);\n });\n });\n\n if (rev !== undefined && typeof rev !== 'boolean')\n throw new Error(`Poseidon: invalid param reversePartialPowIdx=${rev}`);\n\n if (roundsFull % 2 !== 0) throw new Error(`Poseidon roundsFull is not even: ${roundsFull}`);\n const rounds = roundsFull + roundsPartial;\n\n if (!Array.isArray(rc) || rc.length !== rounds)\n throw new Error('Poseidon: wrong round constants');\n const roundConstants = rc.map((rc) => {\n if (!Array.isArray(rc) || rc.length !== t)\n throw new Error(`Poseidon wrong round constants: ${rc}`);\n return rc.map((i) => {\n if (typeof i !== 'bigint' || !Fp.isValid(i))\n throw new Error(`Poseidon wrong round constant=${i}`);\n return Fp.create(i);\n });\n });\n\n if (!sboxPower || ![3, 5, 7].includes(sboxPower))\n throw new Error(`Poseidon wrong sboxPower=${sboxPower}`);\n const _sboxPower = BigInt(sboxPower);\n let sboxFn = (n: bigint) => FpPow(Fp, n, _sboxPower);\n // Unwrapped sbox power for common cases (195->142μs)\n if (sboxPower === 3) sboxFn = (n: bigint) => Fp.mul(Fp.sqrN(n), n);\n else if (sboxPower === 5) sboxFn = (n: bigint) => Fp.mul(Fp.sqrN(Fp.sqrN(n)), n);\n\n return Object.freeze({ ...opts, rounds, sboxFn, roundConstants, mds: _mds });\n}\n\nexport function splitConstants(rc: bigint[], t: number) {\n if (typeof t !== 'number') throw new Error('poseidonSplitConstants: wrong t');\n if (!Array.isArray(rc) || rc.length % t) throw new Error('poseidonSplitConstants: wrong rc');\n const res = [];\n let tmp = [];\n for (let i = 0; i < rc.length; i++) {\n tmp.push(rc[i]);\n if (tmp.length === t) {\n res.push(tmp);\n tmp = [];\n }\n }\n return res;\n}\n\nexport function poseidon(opts: PoseidonOpts) {\n const _opts = validateOpts(opts);\n const { Fp, mds, roundConstants, rounds, roundsPartial, sboxFn, t } = _opts;\n const halfRoundsFull = _opts.roundsFull / 2;\n const partialIdx = _opts.reversePartialPowIdx ? t - 1 : 0;\n const poseidonRound = (values: bigint[], isFull: boolean, idx: number) => {\n values = values.map((i, j) => Fp.add(i, roundConstants[idx][j]));\n\n if (isFull) values = values.map((i) => sboxFn(i));\n else values[partialIdx] = sboxFn(values[partialIdx]);\n // Matrix multiplication\n values = mds.map((i) => i.reduce((acc, i, j) => Fp.add(acc, Fp.mulN(i, values[j])), Fp.ZERO));\n return values;\n };\n const poseidonHash = function poseidonHash(values: bigint[]) {\n if (!Array.isArray(values) || values.length !== t)\n throw new Error(`Poseidon: wrong values (expected array of bigints with length ${t})`);\n values = values.map((i) => {\n if (typeof i !== 'bigint') throw new Error(`Poseidon: wrong value=${i} (${typeof i})`);\n return Fp.create(i);\n });\n let round = 0;\n // Apply r_f/2 full rounds.\n for (let i = 0; i < halfRoundsFull; i++) values = poseidonRound(values, true, round++);\n // Apply r_p partial rounds.\n for (let i = 0; i < roundsPartial; i++) values = poseidonRound(values, false, round++);\n // Apply r_f/2 full rounds.\n for (let i = 0; i < halfRoundsFull; i++) values = poseidonRound(values, true, round++);\n\n if (round !== rounds)\n throw new Error(`Poseidon: wrong number of rounds: last round=${round}, total=${rounds}`);\n return values;\n };\n // For verification in tests\n poseidonHash.roundConstants = roundConstants;\n return poseidonHash;\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport {\n bitMask,\n numberToBytesBE,\n numberToBytesLE,\n bytesToNumberBE,\n bytesToNumberLE,\n ensureBytes,\n validateObject,\n} from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\n const result = a % b;\n return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n if (modulo <= _0n || power < _0n) throw new Error('Expected power/modulo > 0');\n if (modulo === _1n) return _0n;\n let res = _1n;\n while (power > _0n) {\n if (power & _1n) res = (res * num) % modulo;\n num = (num * num) % modulo;\n power >>= _1n;\n }\n return res;\n}\n\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n\n// Inverses number over modulo\nexport function invert(number: bigint, modulo: bigint): bigint {\n if (number === _0n || modulo <= _0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n let a = mod(number, modulo);\n let b = modulo;\n // prettier-ignore\n let x = _0n, y = _1n, u = _1n, v = _0n;\n while (a !== _0n) {\n // JIT applies optimization if those two lines follow each other\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n // prettier-ignore\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n const gcd = b;\n if (gcd !== _1n) throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P: bigint) {\n // Legendre constant: used to calculate Legendre symbol (a | p),\n // which denotes the value of a^((p-1)/2) (mod p).\n // (a | p) ≡ 1 if a is a square (mod p)\n // (a | p) ≡ -1 if a is not a square (mod p)\n // (a | p) ≡ 0 if a ≡ 0 (mod p)\n const legendreC = (P - _1n) / _2n;\n\n let Q: bigint, S: number, Z: bigint;\n // Step 1: By factoring out powers of 2 from p - 1,\n // find q and s such that p - 1 = q*(2^s) with q odd\n for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++);\n\n // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++);\n\n // Fast-path\n if (S === 1) {\n const p1div4 = (P + _1n) / _4n;\n return function tonelliFast<T>(Fp: IField<T>, n: T) {\n const root = Fp.pow(n, p1div4);\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // Slow-path\n const Q1div2 = (Q + _1n) / _2n;\n return function tonelliSlow<T>(Fp: IField<T>, n: T): T {\n // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE)) throw new Error('Cannot find square root');\n let r = S;\n // TODO: will fail at Fp2/etc\n let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n let x = Fp.pow(n, Q1div2); // first guess at the square root\n let b = Fp.pow(n, Q); // first guess at the fudge factor\n\n while (!Fp.eql(b, Fp.ONE)) {\n if (Fp.eql(b, Fp.ZERO)) return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n // Find m such b^(2^m)==1\n let m = 1;\n for (let t2 = Fp.sqr(b); m < r; m++) {\n if (Fp.eql(t2, Fp.ONE)) break;\n t2 = Fp.sqr(t2); // t2 *= t2\n }\n // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n g = Fp.sqr(ge); // g = ge * ge\n x = Fp.mul(x, ge); // x *= ge\n b = Fp.mul(b, g); // b *= g\n r = m;\n }\n return x;\n };\n}\n\nexport function FpSqrt(P: bigint) {\n // NOTE: different algorithms can give different roots, it is up to user to decide which one they want.\n // For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n\n // P ≡ 3 (mod 4)\n // √n = n^((P+1)/4)\n if (P % _4n === _3n) {\n // Not all roots possible!\n // const ORDER =\n // 0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n // const NUM = 72057594037927816n;\n const p1div4 = (P + _1n) / _4n;\n return function sqrt3mod4<T>(Fp: IField<T>, n: T) {\n const root = Fp.pow(n, p1div4);\n // Throw if root**2 != n\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n if (P % _8n === _5n) {\n const c1 = (P - _5n) / _8n;\n return function sqrt5mod8<T>(Fp: IField<T>, n: T) {\n const n2 = Fp.mul(n, _2n);\n const v = Fp.pow(n2, c1);\n const nv = Fp.mul(n, v);\n const i = Fp.mul(Fp.mul(nv, _2n), v);\n const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n return root;\n };\n }\n\n // P ≡ 9 (mod 16)\n if (P % _16n === _9n) {\n // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n // Means we cannot use sqrt for constants at all!\n //\n // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); // 1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n // const c2 = Fp.sqrt(c1); // 2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n // const c3 = Fp.sqrt(Fp.negate(c1)); // 3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n // const c4 = (P + _7n) / _16n; // 4. c4 = (q + 7) / 16 # Integer arithmetic\n // sqrt = (x) => {\n // let tv1 = Fp.pow(x, c4); // 1. tv1 = x^c4\n // let tv2 = Fp.mul(c1, tv1); // 2. tv2 = c1 * tv1\n // const tv3 = Fp.mul(c2, tv1); // 3. tv3 = c2 * tv1\n // let tv4 = Fp.mul(c3, tv1); // 4. tv4 = c3 * tv1\n // const e1 = Fp.equals(Fp.square(tv2), x); // 5. e1 = (tv2^2) == x\n // const e2 = Fp.equals(Fp.square(tv3), x); // 6. e2 = (tv3^2) == x\n // tv1 = Fp.cmov(tv1, tv2, e1); // 7. tv1 = CMOV(tv1, tv2, e1) # Select tv2 if (tv2^2) == x\n // tv2 = Fp.cmov(tv4, tv3, e2); // 8. tv2 = CMOV(tv4, tv3, e2) # Select tv3 if (tv3^2) == x\n // const e3 = Fp.equals(Fp.square(tv2), x); // 9. e3 = (tv2^2) == x\n // return Fp.cmov(tv1, tv2, e3); // 10. z = CMOV(tv1, tv2, e3) # Select the sqrt from tv1 and tv2\n // }\n }\n\n // Other cases: Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint) => (mod(num, modulo) & _1n) === _1n;\n\n// Field is not always over prime: for example, Fp2 has ORDER(q)=p^m\nexport interface IField<T> {\n ORDER: bigint;\n BYTES: number;\n BITS: number;\n MASK: bigint;\n ZERO: T;\n ONE: T;\n // 1-arg\n create: (num: T) => T;\n isValid: (num: T) => boolean;\n is0: (num: T) => boolean;\n neg(num: T): T;\n inv(num: T): T;\n sqrt(num: T): T;\n sqr(num: T): T;\n // 2-args\n eql(lhs: T, rhs: T): boolean;\n add(lhs: T, rhs: T): T;\n sub(lhs: T, rhs: T): T;\n mul(lhs: T, rhs: T | bigint): T;\n pow(lhs: T, power: bigint): T;\n div(lhs: T, rhs: T | bigint): T;\n // N for NonNormalized (for now)\n addN(lhs: T, rhs: T): T;\n subN(lhs: T, rhs: T): T;\n mulN(lhs: T, rhs: T | bigint): T;\n sqrN(num: T): T;\n\n // Optional\n // Should be same as sgn0 function in\n // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n // legendre?(num: T): T;\n pow(lhs: T, power: bigint): T;\n invertBatch: (lst: T[]) => T[];\n toBytes(num: T): Uint8Array;\n fromBytes(bytes: Uint8Array): T;\n // If c is False, CMOV returns a, otherwise it returns b.\n cmov(a: T, b: T, c: boolean): T;\n}\n// prettier-ignore\nconst FIELD_FIELDS = [\n 'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n 'eql', 'add', 'sub', 'mul', 'pow', 'div',\n 'addN', 'subN', 'mulN', 'sqrN'\n] as const;\nexport function validateField<T>(field: IField<T>) {\n const initial = {\n ORDER: 'bigint',\n MASK: 'bigint',\n BYTES: 'isSafeInteger',\n BITS: 'isSafeInteger',\n } as Record<string, string>;\n const opts = FIELD_FIELDS.reduce((map, val: string) => {\n map[val] = 'function';\n return map;\n }, initial);\n return validateObject(field, opts);\n}\n\n// Generic field functions\n\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow<T>(f: IField<T>, num: T, power: bigint): T {\n // Should have same speed as pow for bigints\n // TODO: benchmark!\n if (power < _0n) throw new Error('Expected power > 0');\n if (power === _0n) return f.ONE;\n if (power === _1n) return num;\n let p = f.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n) p = f.mul(p, d);\n d = f.sqr(d);\n power >>= _1n;\n }\n return p;\n}\n\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch<T>(f: IField<T>, nums: T[]): T[] {\n const tmp = new Array(nums.length);\n // Walk from first to last, multiply them by each other MOD p\n const lastMultiplied = nums.reduce((acc, num, i) => {\n if (f.is0(num)) return acc;\n tmp[i] = acc;\n return f.mul(acc, num);\n }, f.ONE);\n // Invert last element\n const inverted = f.inv(lastMultiplied);\n // Walk from last to first, multiply them by inverted each other MOD p\n nums.reduceRight((acc, num, i) => {\n if (f.is0(num)) return acc;\n tmp[i] = f.mul(acc, tmp[i]);\n return f.mul(acc, num);\n }, inverted);\n return tmp;\n}\n\nexport function FpDiv<T>(f: IField<T>, lhs: T, rhs: T | bigint): T {\n return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(f: IField<T>) {\n const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n return (x: T): boolean => {\n const p = f.pow(x, legendreConst);\n return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n };\n}\n\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number) {\n // Bit size, byte size of CURVE.n\n const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n const nByteLength = Math.ceil(_nBitLength / 8);\n return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(\n ORDER: bigint,\n bitLen?: number,\n isLE = false,\n redef: Partial<IField<bigint>> = {}\n): Readonly<FpField> {\n if (ORDER <= _0n) throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048) throw new Error('Field lengths over 2048 bytes are not supported');\n const sqrtP = FpSqrt(ORDER);\n const f: Readonly<FpField> = Object.freeze({\n ORDER,\n BITS,\n BYTES,\n MASK: bitMask(BITS),\n ZERO: _0n,\n ONE: _1n,\n create: (num) => mod(num, ORDER),\n isValid: (num) => {\n if (typeof num !== 'bigint')\n throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n },\n is0: (num) => num === _0n,\n isOdd: (num) => (num & _1n) === _1n,\n neg: (num) => mod(-num, ORDER),\n eql: (lhs, rhs) => lhs === rhs,\n\n sqr: (num) => mod(num * num, ORDER),\n add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n pow: (num, power) => FpPow(f, num, power),\n div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n\n // Same as above, but doesn't normalize\n sqrN: (num) => num * num,\n addN: (lhs, rhs) => lhs + rhs,\n subN: (lhs, rhs) => lhs - rhs,\n mulN: (lhs, rhs) => lhs * rhs,\n\n inv: (num) => invert(num, ORDER),\n sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n invertBatch: (lst) => FpInvertBatch(f, lst),\n // TODO: do we really need constant cmov?\n // We don't have const-time bigints anyway, so probably will be not very useful\n cmov: (a, b, c) => (c ? b : a),\n toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n fromBytes: (bytes) => {\n if (bytes.length !== BYTES)\n throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n },\n } as FpField);\n return Object.freeze(f);\n}\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T) {\n if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T) {\n if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(\n hash: string | Uint8Array,\n groupOrder: bigint,\n isLE = false\n): bigint {\n hash = ensureBytes('privateHash', hash);\n const hashLen = hash.length;\n const minLen = nLength(groupOrder).nByteLength + 8;\n if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n return mod(num, groupOrder - _1n) + _1n;\n}\n\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder: bigint): number {\n if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\n\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder: bigint): number {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n const len = key.length;\n const fieldLen = getFieldBytesLength(fieldOrder);\n const minLen = getMinHashLength(fieldOrder);\n // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n if (len < 16 || len < minLen || len > 1024)\n throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(key);\n // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n const reduced = mod(num, fieldOrder - _1n) + _1n;\n return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { CHash, Hex, PrivKey, ensureBytes } from './utils.js';\nimport { Group, GroupConstructor, wNAF, BasicCurve, validateBasic, AffinePoint } from './curve.js';\n\nexport type { AffinePoint };\ntype HmacFnSync = (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array;\ntype EndomorphismOpts = {\n beta: bigint;\n splitScalar: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\nexport type BasicWCurve<T> = BasicCurve<T> & {\n // Params: a, b\n a: T;\n b: T;\n\n // Optional params\n allowedPrivateKeyLengths?: readonly number[]; // for P521\n wrapPrivateKey?: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n endo?: EndomorphismOpts; // Endomorphism options for Koblitz curves\n // When a cofactor != 1, there can be an effective methods to:\n // 1. Determine whether a point is torsion-free\n isTorsionFree?: (c: ProjConstructor<T>, point: ProjPointType<T>) => boolean;\n // 2. Clear torsion component\n clearCofactor?: (c: ProjConstructor<T>, point: ProjPointType<T>) => ProjPointType<T>;\n};\n\ntype Entropy = Hex | boolean;\nexport type SignOpts = { lowS?: boolean; extraEntropy?: Entropy; prehash?: boolean };\nexport type VerOpts = { lowS?: boolean; prehash?: boolean };\n\n/**\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n * `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n * `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n * it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance of nominative types in TypeScript and interfaces only check for shape, so it's hard to create unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n * 1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n * which is hard to debug.\n * 2. Params can be generic and we can't enforce them to be constant value:\n * if somebody creates curve from non-constant params,\n * it would be allowed to interact with other curves with non-constant params\n *\n * TODO: https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n */\n\n// Instance for 3d XYZ points\nexport interface ProjPointType<T> extends Group<ProjPointType<T>> {\n readonly px: T;\n readonly py: T;\n readonly pz: T;\n get x(): T;\n get y(): T;\n multiply(scalar: bigint): ProjPointType<T>;\n toAffine(iz?: T): AffinePoint<T>;\n isTorsionFree(): boolean;\n clearCofactor(): ProjPointType<T>;\n assertValidity(): void;\n hasEvenY(): boolean;\n toRawBytes(isCompressed?: boolean): Uint8Array;\n toHex(isCompressed?: boolean): string;\n\n multiplyUnsafe(scalar: bigint): ProjPointType<T>;\n multiplyAndAddUnsafe(Q: ProjPointType<T>, a: bigint, b: bigint): ProjPointType<T> | undefined;\n _setWindowSize(windowSize: number): void;\n}\n// Static methods for 3d XYZ points\nexport interface ProjConstructor<T> extends GroupConstructor<ProjPointType<T>> {\n new (x: T, y: T, z: T): ProjPointType<T>;\n fromAffine(p: AffinePoint<T>): ProjPointType<T>;\n fromHex(hex: Hex): ProjPointType<T>;\n fromPrivateKey(privateKey: PrivKey): ProjPointType<T>;\n normalizeZ(points: ProjPointType<T>[]): ProjPointType<T>[];\n}\n\nexport type CurvePointsType<T> = BasicWCurve<T> & {\n // Bytes\n fromBytes?: (bytes: Uint8Array) => AffinePoint<T>;\n toBytes?: (c: ProjConstructor<T>, point: ProjPointType<T>, isCompressed: boolean) => Uint8Array;\n};\n\nfunction validatePointOpts<T>(curve: CurvePointsType<T>) {\n const opts = validateBasic(curve);\n ut.validateObject(\n opts,\n {\n a: 'field',\n b: 'field',\n },\n {\n allowedPrivateKeyLengths: 'array',\n wrapPrivateKey: 'boolean',\n isTorsionFree: 'function',\n clearCofactor: 'function',\n allowInfinityPoint: 'boolean',\n fromBytes: 'function',\n toBytes: 'function',\n }\n );\n const { endo, Fp, a } = opts;\n if (endo) {\n if (!Fp.eql(a, Fp.ZERO)) {\n throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n }\n if (\n typeof endo !== 'object' ||\n typeof endo.beta !== 'bigint' ||\n typeof endo.splitScalar !== 'function'\n ) {\n throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts } as const);\n}\n\nexport type CurvePointsRes<T> = {\n CURVE: ReturnType<typeof validatePointOpts<T>>;\n ProjectivePoint: ProjConstructor<T>;\n normPrivateKeyToScalar: (key: PrivKey) => bigint;\n weierstrassEquation: (x: T) => T;\n isWithinCurveOrder: (num: bigint) => boolean;\n};\n\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n // asn.1 DER encoding utils\n Err: class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n },\n _parseInt(data: Uint8Array): { d: bigint; l: Uint8Array } {\n const { Err: E } = DER;\n if (data.length < 2 || data[0] !== 0x02) throw new E('Invalid signature integer tag');\n const len = data[1];\n const res = data.subarray(2, len + 2);\n if (!len || res.length !== len) throw new E('Invalid signature integer: wrong length');\n // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n // since we always use positive integers here. It must always be empty:\n // - add zero byte if exists\n // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n if (res[0] & 0b10000000) throw new E('Invalid signature integer: negative');\n if (res[0] === 0x00 && !(res[1] & 0b10000000))\n throw new E('Invalid signature integer: unnecessary leading zero');\n return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n },\n toSig(hex: string | Uint8Array): { r: bigint; s: bigint } {\n // parse DER signature\n const { Err: E } = DER;\n const data = typeof hex === 'string' ? h2b(hex) : hex;\n ut.abytes(data);\n let l = data.length;\n if (l < 2 || data[0] != 0x30) throw new E('Invalid signature tag');\n if (data[1] !== l - 2) throw new E('Invalid signature: incorrect length');\n const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n if (rBytesLeft.length) throw new E('Invalid signature: left bytes after parsing');\n return { r, s };\n },\n hexFromSig(sig: { r: bigint; s: bigint }): string {\n // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n const slice = (s: string): string => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n const h = (num: number | bigint) => {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n };\n const s = slice(h(sig.s));\n const r = slice(h(sig.r));\n const shl = s.length / 2;\n const rhl = r.length / 2;\n const sl = h(shl);\n const rl = h(rhl);\n return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n },\n};\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\n\nexport function weierstrassPoints<T>(opts: CurvePointsType<T>): CurvePointsRes<T> {\n const CURVE = validatePointOpts(opts);\n const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n\n const toBytes =\n CURVE.toBytes ||\n ((_c: ProjConstructor<T>, point: ProjPointType<T>, _isCompressed: boolean) => {\n const a = point.toAffine();\n return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n });\n const fromBytes =\n CURVE.fromBytes ||\n ((bytes: Uint8Array) => {\n // const head = bytes[0];\n const tail = bytes.subarray(1);\n // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n });\n\n /**\n * y² = x³ + ax + b: Short weierstrass curve formula\n * @returns y²\n */\n function weierstrassEquation(x: T): T {\n const { a, b } = CURVE;\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n }\n // Validate whether the passed curve params are valid.\n // We check if curve equation works for generator point.\n // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n // ProjectivePoint class has not been initialized yet.\n if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n throw new Error('bad generator point: equation left != right');\n\n // Valid group elements reside in range 1..n-1\n function isWithinCurveOrder(num: bigint): boolean {\n return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n }\n function assertGE(num: bigint) {\n if (!isWithinCurveOrder(num)) throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n }\n // Validates if priv key is valid and converts it to bigint.\n // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n function normPrivateKeyToScalar(key: PrivKey): bigint {\n const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n if (lengths && typeof key !== 'bigint') {\n if (ut.isBytes(key)) key = ut.bytesToHex(key);\n // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n if (typeof key !== 'string' || !lengths.includes(key.length)) throw new Error('Invalid key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num: bigint;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n } catch (error) {\n throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n }\n if (wrapPrivateKey) num = mod.mod(num, n); // disabled by default, enabled for BLS\n assertGE(num); // num in range [1..N-1]\n return num;\n }\n\n const pointPrecomputes = new Map<Point, Point[]>();\n function assertPrjPoint(other: unknown) {\n if (!(other instanceof Point)) throw new Error('ProjectivePoint expected');\n }\n /**\n * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) ∋ (x=x/z, y=y/z)\n * Default Point works in 2d / affine coordinates: (x, y)\n * We're doing calculations in projective, because its operations don't require costly inversion.\n */\n class Point implements ProjPointType<T> {\n static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n\n constructor(\n readonly px: T,\n readonly py: T,\n readonly pz: T\n ) {\n if (px == null || !Fp.isValid(px)) throw new Error('x required');\n if (py == null || !Fp.isValid(py)) throw new Error('y required');\n if (pz == null || !Fp.isValid(pz)) throw new Error('z required');\n }\n\n // Does not validate if the point is on-curve.\n // Use fromHex instead, or call assertValidity() later.\n static fromAffine(p: AffinePoint<T>): Point {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n if (p instanceof Point) throw new Error('projective point not allowed');\n const is0 = (i: T) => Fp.eql(i, Fp.ZERO);\n // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n if (is0(x) && is0(y)) return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n\n get x(): T {\n return this.toAffine().x;\n }\n get y(): T {\n return this.toAffine().y;\n }\n\n /**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\n static normalizeZ(points: Point[]): Point[] {\n const toInv = Fp.invertBatch(points.map((p) => p.pz));\n return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n }\n\n /**\n * Converts hash string or Uint8Array to Point.\n * @param hex short/long ECDSA hex\n */\n static fromHex(hex: Hex): Point {\n const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n P.assertValidity();\n return P;\n }\n\n // Multiplies generator point by privateKey.\n static fromPrivateKey(privateKey: PrivKey) {\n return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n }\n\n // We calculate precomputes for elliptic curve point multiplication\n // using windowed method. This specifies window size and\n // stores precomputed values. Usually only base point would be precomputed.\n _WINDOW_SIZE?: number;\n\n // \"Private method\", don't use it directly\n _setWindowSize(windowSize: number) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n\n // A point on curve is valid if it conforms to equation.\n assertValidity(): void {\n if (this.is0()) {\n // (0, 1, 0) aka ZERO is invalid in most contexts.\n // In BLS, ZERO can be serialized, so we allow it.\n // (0, 0, 0) is wrong representation of ZERO and is always invalid.\n if (CURVE.allowInfinityPoint && !Fp.is0(this.py)) return;\n throw new Error('bad point: ZERO');\n }\n // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n const { x, y } = this.toAffine();\n // Check if x, y are valid field elements\n if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error('bad point: x or y not FE');\n const left = Fp.sqr(y); // y²\n const right = weierstrassEquation(x); // x³ + ax + b\n if (!Fp.eql(left, right)) throw new Error('bad point: equation left != right');\n if (!this.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n }\n hasEvenY(): boolean {\n const { y } = this.toAffine();\n if (Fp.isOdd) return !Fp.isOdd(y);\n throw new Error(\"Field doesn't support isOdd\");\n }\n\n /**\n * Compare one point to another.\n */\n equals(other: Point): boolean {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n return U1 && U2;\n }\n\n /**\n * Flips point to one corresponding to (x, -y) in Affine coordinates.\n */\n negate(): Point {\n return new Point(this.px, Fp.neg(this.py), this.pz);\n }\n\n // Renes-Costello-Batina exception-free doubling formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 3\n // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n double() {\n const { a, b } = CURVE;\n const b3 = Fp.mul(b, _3n);\n const { px: X1, py: Y1, pz: Z1 } = this;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n let t0 = Fp.mul(X1, X1); // step 1\n let t1 = Fp.mul(Y1, Y1);\n let t2 = Fp.mul(Z1, Z1);\n let t3 = Fp.mul(X1, Y1);\n t3 = Fp.add(t3, t3); // step 5\n Z3 = Fp.mul(X1, Z1);\n Z3 = Fp.add(Z3, Z3);\n X3 = Fp.mul(a, Z3);\n Y3 = Fp.mul(b3, t2);\n Y3 = Fp.add(X3, Y3); // step 10\n X3 = Fp.sub(t1, Y3);\n Y3 = Fp.add(t1, Y3);\n Y3 = Fp.mul(X3, Y3);\n X3 = Fp.mul(t3, X3);\n Z3 = Fp.mul(b3, Z3); // step 15\n t2 = Fp.mul(a, t2);\n t3 = Fp.sub(t0, t2);\n t3 = Fp.mul(a, t3);\n t3 = Fp.add(t3, Z3);\n Z3 = Fp.add(t0, t0); // step 20\n t0 = Fp.add(Z3, t0);\n t0 = Fp.add(t0, t2);\n t0 = Fp.mul(t0, t3);\n Y3 = Fp.add(Y3, t0);\n t2 = Fp.mul(Y1, Z1); // step 25\n t2 = Fp.add(t2, t2);\n t0 = Fp.mul(t2, t3);\n X3 = Fp.sub(X3, t0);\n Z3 = Fp.mul(t2, t1);\n Z3 = Fp.add(Z3, Z3); // step 30\n Z3 = Fp.add(Z3, Z3);\n return new Point(X3, Y3, Z3);\n }\n\n // Renes-Costello-Batina exception-free addition formula.\n // There is 30% faster Jacobian formula, but it is not complete.\n // https://eprint.iacr.org/2015/1060, algorithm 1\n // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n add(other: Point): Point {\n assertPrjPoint(other);\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = other;\n let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n const a = CURVE.a;\n const b3 = Fp.mul(CURVE.b, _3n);\n let t0 = Fp.mul(X1, X2); // step 1\n let t1 = Fp.mul(Y1, Y2);\n let t2 = Fp.mul(Z1, Z2);\n let t3 = Fp.add(X1, Y1);\n let t4 = Fp.add(X2, Y2); // step 5\n t3 = Fp.mul(t3, t4);\n t4 = Fp.add(t0, t1);\n t3 = Fp.sub(t3, t4);\n t4 = Fp.add(X1, Z1);\n let t5 = Fp.add(X2, Z2); // step 10\n t4 = Fp.mul(t4, t5);\n t5 = Fp.add(t0, t2);\n t4 = Fp.sub(t4, t5);\n t5 = Fp.add(Y1, Z1);\n X3 = Fp.add(Y2, Z2); // step 15\n t5 = Fp.mul(t5, X3);\n X3 = Fp.add(t1, t2);\n t5 = Fp.sub(t5, X3);\n Z3 = Fp.mul(a, t4);\n X3 = Fp.mul(b3, t2); // step 20\n Z3 = Fp.add(X3, Z3);\n X3 = Fp.sub(t1, Z3);\n Z3 = Fp.add(t1, Z3);\n Y3 = Fp.mul(X3, Z3);\n t1 = Fp.add(t0, t0); // step 25\n t1 = Fp.add(t1, t0);\n t2 = Fp.mul(a, t2);\n t4 = Fp.mul(b3, t4);\n t1 = Fp.add(t1, t2);\n t2 = Fp.sub(t0, t2); // step 30\n t2 = Fp.mul(a, t2);\n t4 = Fp.add(t4, t2);\n t0 = Fp.mul(t1, t4);\n Y3 = Fp.add(Y3, t0);\n t0 = Fp.mul(t5, t4); // step 35\n X3 = Fp.mul(t3, X3);\n X3 = Fp.sub(X3, t0);\n t0 = Fp.mul(t3, t1);\n Z3 = Fp.mul(t5, Z3);\n Z3 = Fp.add(Z3, t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n\n subtract(other: Point) {\n return this.add(other.negate());\n }\n\n private is0() {\n return this.equals(Point.ZERO);\n }\n private wNAF(n: bigint): { p: Point; f: Point } {\n return wnaf.wNAFCached(this, pointPrecomputes, n, (comp: Point[]) => {\n const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n });\n }\n\n /**\n * Non-constant-time multiplication. Uses double-and-add algorithm.\n * It's faster, but should only be used when you don't care about\n * an exposed private key e.g. sig verification, which works over *public* keys.\n */\n multiplyUnsafe(n: bigint): Point {\n const I = Point.ZERO;\n if (n === _0n) return I;\n assertGE(n); // Will throw on 0\n if (n === _1n) return this;\n const { endo } = CURVE;\n if (!endo) return wnaf.unsafeLadder(this, n);\n\n // Apply endomorphism\n let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let k1p = I;\n let k2p = I;\n let d: Point = this;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n) k1p = k1p.add(d);\n if (k2 & _1n) k2p = k2p.add(d);\n d = d.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n if (k1neg) k1p = k1p.negate();\n if (k2neg) k2p = k2p.negate();\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n return k1p.add(k2p);\n }\n\n /**\n * Constant time multiplication.\n * Uses wNAF method. Windowed method may be 10% faster,\n * but takes 2x longer to generate and consumes 2x memory.\n * Uses precomputes when available.\n * Uses endomorphism for Koblitz curves.\n * @param scalar by which the point would be multiplied\n * @returns New point\n */\n multiply(scalar: bigint): Point {\n assertGE(scalar);\n let n = scalar;\n let point: Point, fake: Point; // Fake point is used to const-time mult\n const { endo } = CURVE;\n if (endo) {\n const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n let { p: k1p, f: f1p } = this.wNAF(k1);\n let { p: k2p, f: f2p } = this.wNAF(k2);\n k1p = wnaf.constTimeNegate(k1neg, k1p);\n k2p = wnaf.constTimeNegate(k2neg, k2p);\n k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n point = k1p.add(k2p);\n fake = f1p.add(f2p);\n } else {\n const { p, f } = this.wNAF(n);\n point = p;\n fake = f;\n }\n // Normalize `z` for both points, but return only real one\n return Point.normalizeZ([point, fake])[0];\n }\n\n /**\n * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n * Not using Strauss-Shamir trick: precomputation tables are faster.\n * The trick could be useful if both P and Q are not G (not in our case).\n * @returns non-zero affine point\n */\n multiplyAndAddUnsafe(Q: Point, a: bigint, b: bigint): Point | undefined {\n const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n const mul = (\n P: Point,\n a: bigint // Select faster multiply() method\n ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n const sum = mul(this, a).add(mul(Q, b));\n return sum.is0() ? undefined : sum;\n }\n\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (x, y, z) ∋ (x=x/z, y=y/z)\n toAffine(iz?: T): AffinePoint<T> {\n const { px: x, py: y, pz: z } = this;\n const is0 = this.is0();\n // If invZ was 0, we return zero point. However we still want to execute\n // all operations, so we replace invZ with a random number, 1.\n if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(z);\n const ax = Fp.mul(x, iz);\n const ay = Fp.mul(y, iz);\n const zz = Fp.mul(z, iz);\n if (is0) return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE)) throw new Error('invZ was invalid');\n return { x: ax, y: ay };\n }\n isTorsionFree(): boolean {\n const { h: cofactor, isTorsionFree } = CURVE;\n if (cofactor === _1n) return true; // No subgroups, always torsion-free\n if (isTorsionFree) return isTorsionFree(Point, this);\n throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n }\n clearCofactor(): Point {\n const { h: cofactor, clearCofactor } = CURVE;\n if (cofactor === _1n) return this; // Fast-path\n if (clearCofactor) return clearCofactor(Point, this) as Point;\n return this.multiplyUnsafe(CURVE.h);\n }\n\n toRawBytes(isCompressed = true): Uint8Array {\n this.assertValidity();\n return toBytes(Point, this, isCompressed);\n }\n\n toHex(isCompressed = true): string {\n return ut.bytesToHex(this.toRawBytes(isCompressed));\n }\n }\n const _bits = CURVE.nBitLength;\n const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n // Validate if generator point is on curve\n return {\n CURVE,\n ProjectivePoint: Point as ProjConstructor<T>,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n };\n}\n\n// Instance\nexport interface SignatureType {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n assertValidity(): void;\n addRecoveryBit(recovery: number): RecoveredSignatureType;\n hasHighS(): boolean;\n normalizeS(): SignatureType;\n recoverPublicKey(msgHash: Hex): ProjPointType<bigint>;\n toCompactRawBytes(): Uint8Array;\n toCompactHex(): string;\n // DER-encoded\n toDERRawBytes(isCompressed?: boolean): Uint8Array;\n toDERHex(isCompressed?: boolean): string;\n}\nexport type RecoveredSignatureType = SignatureType & {\n readonly recovery: number;\n};\n// Static methods\nexport type SignatureConstructor = {\n new (r: bigint, s: bigint): SignatureType;\n fromCompact(hex: Hex): SignatureType;\n fromDER(hex: Hex): SignatureType;\n};\ntype SignatureLike = { r: bigint; s: bigint };\n\nexport type PubKey = Hex | ProjPointType<bigint>;\n\nexport type CurveType = BasicWCurve<bigint> & {\n hash: CHash; // CHash not FHash because we need outputLen for DRBG\n hmac: HmacFnSync;\n randomBytes: (bytesLength?: number) => Uint8Array;\n lowS?: boolean;\n bits2int?: (bytes: Uint8Array) => bigint;\n bits2int_modN?: (bytes: Uint8Array) => bigint;\n};\n\nfunction validateOpts(curve: CurveType) {\n const opts = validateBasic(curve);\n ut.validateObject(\n opts,\n {\n hash: 'hash',\n hmac: 'function',\n randomBytes: 'function',\n },\n {\n bits2int: 'function',\n bits2int_modN: 'function',\n lowS: 'boolean',\n }\n );\n return Object.freeze({ lowS: true, ...opts } as const);\n}\n\nexport type CurveFn = {\n CURVE: ReturnType<typeof validateOpts>;\n getPublicKey: (privateKey: PrivKey, isCompressed?: boolean) => Uint8Array;\n getSharedSecret: (privateA: PrivKey, publicB: Hex, isCompressed?: boolean) => Uint8Array;\n sign: (msgHash: Hex, privKey: PrivKey, opts?: SignOpts) => RecoveredSignatureType;\n verify: (signature: Hex | SignatureLike, msgHash: Hex, publicKey: Hex, opts?: VerOpts) => boolean;\n ProjectivePoint: ProjConstructor<bigint>;\n Signature: SignatureConstructor;\n utils: {\n normPrivateKeyToScalar: (key: PrivKey) => bigint;\n isValidPrivateKey(privateKey: PrivKey): boolean;\n randomPrivateKey: () => Uint8Array;\n precompute: (windowSize?: number, point?: ProjPointType<bigint>) => ProjPointType<bigint>;\n };\n};\n\nexport function weierstrass(curveDef: CurveType): CurveFn {\n const CURVE = validateOpts(curveDef) as ReturnType<typeof validateOpts>;\n const { Fp, n: CURVE_ORDER } = CURVE;\n const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n\n function isValidFieldElement(num: bigint): boolean {\n return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n }\n function modN(a: bigint) {\n return mod.mod(a, CURVE_ORDER);\n }\n function invN(a: bigint) {\n return mod.invert(a, CURVE_ORDER);\n }\n\n const {\n ProjectivePoint: Point,\n normPrivateKeyToScalar,\n weierstrassEquation,\n isWithinCurveOrder,\n } = weierstrassPoints({\n ...CURVE,\n toBytes(_c, point, isCompressed: boolean): Uint8Array {\n const a = point.toAffine();\n const x = Fp.toBytes(a.x);\n const cat = ut.concatBytes;\n if (isCompressed) {\n return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n } else {\n return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n }\n },\n fromBytes(bytes: Uint8Array) {\n const len = bytes.length;\n const head = bytes[0];\n const tail = bytes.subarray(1);\n // this.assertValidity() is done inside of fromHex\n if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n const x = ut.bytesToNumberBE(tail);\n if (!isValidFieldElement(x)) throw new Error('Point is not on curve');\n const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n let y: bigint;\n try {\n y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n } catch (sqrtError) {\n const suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n throw new Error('Point is not on curve' + suffix);\n }\n const isYOdd = (y & _1n) === _1n;\n // ECDSA\n const isHeadOdd = (head & 1) === 1;\n if (isHeadOdd !== isYOdd) y = Fp.neg(y);\n return { x, y };\n } else if (len === uncompressedLen && head === 0x04) {\n const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n return { x, y };\n } else {\n throw new Error(\n `Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`\n );\n }\n },\n });\n const numToNByteStr = (num: bigint): string =>\n ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n\n function isBiggerThanHalfOrder(number: bigint) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n\n function normalizeS(s: bigint) {\n return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n }\n // slice bytes num\n const slcNum = (b: Uint8Array, from: number, to: number) => ut.bytesToNumberBE(b.slice(from, to));\n\n /**\n * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n */\n class Signature implements SignatureType {\n constructor(\n readonly r: bigint,\n readonly s: bigint,\n readonly recovery?: number\n ) {\n this.assertValidity();\n }\n\n // pair (bytes of r, bytes of s)\n static fromCompact(hex: Hex) {\n const l = CURVE.nByteLength;\n hex = ensureBytes('compactSignature', hex, l * 2);\n return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n }\n\n // DER encoded ECDSA signature\n // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n static fromDER(hex: Hex) {\n const { r, s } = DER.toSig(ensureBytes('DER', hex));\n return new Signature(r, s);\n }\n\n assertValidity(): void {\n // can use assertGE here\n if (!isWithinCurveOrder(this.r)) throw new Error('r must be 0 < r < CURVE.n');\n if (!isWithinCurveOrder(this.s)) throw new Error('s must be 0 < s < CURVE.n');\n }\n\n addRecoveryBit(recovery: number): RecoveredSignature {\n return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n }\n\n recoverPublicKey(msgHash: Hex): typeof Point.BASE {\n const { r, s, recovery: rec } = this;\n const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n if (rec == null || ![0, 1, 2, 3].includes(rec)) throw new Error('recovery id invalid');\n const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n if (radj >= Fp.ORDER) throw new Error('recovery id 2 or 3 invalid');\n const prefix = (rec & 1) === 0 ? '02' : '03';\n const R = Point.fromHex(prefix + numToNByteStr(radj));\n const ir = invN(radj); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n if (!Q) throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n Q.assertValidity();\n return Q;\n }\n\n // Signatures should be low-s, to prevent malleability.\n hasHighS(): boolean {\n return isBiggerThanHalfOrder(this.s);\n }\n\n normalizeS() {\n return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n }\n\n // DER-encoded\n toDERRawBytes() {\n return ut.hexToBytes(this.toDERHex());\n }\n toDERHex() {\n return DER.hexFromSig({ r: this.r, s: this.s });\n }\n\n // padded bytes of r, then padded bytes of s\n toCompactRawBytes() {\n return ut.hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteStr(this.r) + numToNByteStr(this.s);\n }\n }\n type RecoveredSignature = Signature & { recovery: number };\n\n const utils = {\n isValidPrivateKey(privateKey: PrivKey) {\n try {\n normPrivateKeyToScalar(privateKey);\n return true;\n } catch (error) {\n return false;\n }\n },\n normPrivateKeyToScalar: normPrivateKeyToScalar,\n\n /**\n * Produces cryptographically secure private key from random of size\n * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n */\n randomPrivateKey: (): Uint8Array => {\n const length = mod.getMinHashLength(CURVE.n);\n return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n },\n\n /**\n * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n * Allows to massively speed-up `point.multiply(scalar)`.\n * @returns cached point\n * @example\n * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n * fast.multiply(privKey); // much faster ECDH now\n */\n precompute(windowSize = 8, point = Point.BASE): typeof Point.BASE {\n point._setWindowSize(windowSize);\n point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n return point;\n },\n };\n\n /**\n * Computes public key for a private key. Checks for validity of the private key.\n * @param privateKey private key\n * @param isCompressed whether to return compact (default), or full key\n * @returns Public key, full when isCompressed=false; short when isCompressed=true\n */\n function getPublicKey(privateKey: PrivKey, isCompressed = true): Uint8Array {\n return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n }\n\n /**\n * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n */\n function isProbPub(item: PrivKey | PubKey): boolean {\n const arr = ut.isBytes(item);\n const str = typeof item === 'string';\n const len = (arr || str) && (item as Hex).length;\n if (arr) return len === compressedLen || len === uncompressedLen;\n if (str) return len === 2 * compressedLen || len === 2 * uncompressedLen;\n if (item instanceof Point) return true;\n return false;\n }\n\n /**\n * ECDH (Elliptic Curve Diffie Hellman).\n * Computes shared public key from private key and public key.\n * Checks: 1) private key validity 2) shared key is on-curve.\n * Does NOT hash the result.\n * @param privateA private key\n * @param publicB different public key\n * @param isCompressed whether to return compact (default), or full key\n * @returns shared public key\n */\n function getSharedSecret(privateA: PrivKey, publicB: Hex, isCompressed = true): Uint8Array {\n if (isProbPub(privateA)) throw new Error('first arg must be private key');\n if (!isProbPub(publicB)) throw new Error('second arg must be public key');\n const b = Point.fromHex(publicB); // check for being on-curve\n return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\n }\n\n // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n const bits2int =\n CURVE.bits2int ||\n function (bytes: Uint8Array): bigint {\n // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n // for some cases, since bytes.length * 8 is not actual bitLength.\n const num = ut.bytesToNumberBE(bytes); // check for == u8 done here\n const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n return delta > 0 ? num >> BigInt(delta) : num;\n };\n const bits2int_modN =\n CURVE.bits2int_modN ||\n function (bytes: Uint8Array): bigint {\n return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n };\n // NOTE: pads output with zero as per spec\n const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n /**\n * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n */\n function int2octets(num: bigint): Uint8Array {\n if (typeof num !== 'bigint') throw new Error('bigint expected');\n if (!(_0n <= num && num < ORDER_MASK))\n throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n // works with order, can have different size than numToField!\n return ut.numberToBytesBE(num, CURVE.nByteLength);\n }\n\n // Steps A, D of RFC6979 3.2\n // Creates RFC6979 seed; converts msg/privKey to numbers.\n // Used only in sign, not in verify.\n // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n // Also it can be bigger for P224 + SHA256\n function prepSig(msgHash: Hex, privateKey: PrivKey, opts = defaultSigOpts) {\n if (['recovered', 'canonical'].some((k) => k in opts))\n throw new Error('sign() legacy options not supported');\n const { hash, randomBytes } = CURVE;\n let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n if (lowS == null) lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n msgHash = ensureBytes('msgHash', msgHash);\n if (prehash) msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n\n // We can't later call bits2octets, since nested bits2int is broken for curves\n // with nBitLength % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n const h1int = bits2int_modN(msgHash);\n const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n const seedArgs = [int2octets(d), int2octets(h1int)];\n // extraEntropy. RFC6979 3.6: additional k' (optional).\n if (ent != null && ent !== false) {\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n }\n const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n // Converts signature params into point w r/s, checks result for validity.\n function k2sig(kBytes: Uint8Array): RecoveredSignature | undefined {\n // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n if (!isWithinCurveOrder(k)) return; // Important: all mod() calls here must be done over N\n const ik = invN(k); // k^-1 mod n\n const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n const r = modN(q.x); // r = q.x mod n\n if (r === _0n) return;\n // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n const s = modN(ik * modN(m + r * d)); // Not using blinding here\n if (s === _0n) return;\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n let normS = s;\n if (lowS && isBiggerThanHalfOrder(s)) {\n normS = normalizeS(s); // if lowS was passed, ensure s is always\n recovery ^= 1; // // in the bottom half of N\n }\n return new Signature(r, normS, recovery) as RecoveredSignature; // use normS, not s\n }\n return { seed, k2sig };\n }\n const defaultSigOpts: SignOpts = { lowS: CURVE.lowS, prehash: false };\n const defaultVerOpts: VerOpts = { lowS: CURVE.lowS, prehash: false };\n\n /**\n * Signs message hash with a private key.\n * ```\n * sign(m, d, k) where\n * (x, y) = G × k\n * r = x mod n\n * s = (m + dr)/k mod n\n * ```\n * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n * @param privKey private key\n * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n * @returns signature with recovery param\n */\n function sign(msgHash: Hex, privKey: PrivKey, opts = defaultSigOpts): RecoveredSignature {\n const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n const C = CURVE;\n const drbg = ut.createHmacDrbg<RecoveredSignature>(C.hash.outputLen, C.nByteLength, C.hmac);\n return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n }\n\n // Enable precomputes. Slows down first publicKey computation by 20ms.\n Point.BASE._setWindowSize(8);\n // utils.precompute(8, ProjectivePoint.BASE)\n\n /**\n * Verifies a signature against message hash and public key.\n * Rejects lowS signatures by default: to override,\n * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n *\n * ```\n * verify(r, s, h, P) where\n * U1 = hs^-1 mod n\n * U2 = rs^-1 mod n\n * R = U1⋅G - U2⋅P\n * mod(R.x, n) == r\n * ```\n */\n function verify(\n signature: Hex | SignatureLike,\n msgHash: Hex,\n publicKey: Hex,\n opts = defaultVerOpts\n ): boolean {\n const sg = signature;\n msgHash = ensureBytes('msgHash', msgHash);\n publicKey = ensureBytes('publicKey', publicKey);\n if ('strict' in opts) throw new Error('options.strict was renamed to lowS');\n const { lowS, prehash } = opts;\n\n let _sig: Signature | undefined = undefined;\n let P: ProjPointType<bigint>;\n try {\n if (typeof sg === 'string' || ut.isBytes(sg)) {\n // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n // Since DER can also be 2*nByteLength bytes, we check for it first.\n try {\n _sig = Signature.fromDER(sg);\n } catch (derError) {\n if (!(derError instanceof DER.Err)) throw derError;\n _sig = Signature.fromCompact(sg);\n }\n } else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n const { r, s } = sg;\n _sig = new Signature(r, s);\n } else {\n throw new Error('PARSE');\n }\n P = Point.fromHex(publicKey);\n } catch (error) {\n if ((error as Error).message === 'PARSE')\n throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n return false;\n }\n if (lowS && _sig.hasHighS()) return false;\n if (prehash) msgHash = CURVE.hash(msgHash);\n const { r, s } = _sig;\n const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n const is = invN(s); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n if (!R) return false;\n const v = modN(R.x);\n return v === r;\n }\n return {\n CURVE,\n getPublicKey,\n getSharedSecret,\n sign,\n verify,\n ProjectivePoint: Point,\n Signature,\n utils,\n };\n}\n\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio<T>(Fp: mod.IField<T>, Z: T) {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n) l += _1n;\n const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n // 2n ** c1 == 2n << (c1-1)\n const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1) # Integer arithmetic\n const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2 # Integer arithmetic\n const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1 # Integer arithmetic\n const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1) # Integer arithmetic\n const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n let sqrtRatio = (u: T, v: T): { isValid: boolean; value: T } => {\n let tv1 = c6; // 1. tv1 = c6\n let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n // 17. for i in (c1, c1 - 1, ..., 2):\n for (let i = c1; i > _1n; i--) {\n let tv5 = i - _2n; // 18. tv5 = i - 2\n tv5 = _2n << (tv5 - _1n); // 19. tv5 = 2^tv5\n let tvv5 = Fp.pow(tv4, tv5); // 20. tv5 = tv4^tv5\n const e1 = Fp.eql(tvv5, Fp.ONE); // 21. e1 = tv5 == 1\n tv2 = Fp.mul(tv3, tv1); // 22. tv2 = tv3 * tv1\n tv1 = Fp.mul(tv1, tv1); // 23. tv1 = tv1 * tv1\n tvv5 = Fp.mul(tv4, tv1); // 24. tv5 = tv4 * tv1\n tv3 = Fp.cmov(tv2, tv3, e1); // 25. tv3 = CMOV(tv2, tv3, e1)\n tv4 = Fp.cmov(tvv5, tv4, e1); // 26. tv4 = CMOV(tv5, tv4, e1)\n }\n return { isValid: isQR, value: tv3 };\n };\n if (Fp.ORDER % _4n === _3n) {\n // sqrt_ratio_3mod4(u, v)\n const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4 # Integer arithmetic\n const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n sqrtRatio = (u: T, v: T) => {\n let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n };\n }\n // No curves uses that\n // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU<T>(\n Fp: mod.IField<T>,\n opts: {\n A: T;\n B: T;\n Z: T;\n }\n) {\n mod.validateField(Fp);\n if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n throw new Error('mapToCurveSimpleSWU: invalid opts');\n const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n if (!Fp.isOdd) throw new Error('Fp.isOdd is not implemented!');\n // Input: u, an element of F.\n // Output: (x, y), a point on E.\n return (u: T): { x: T; y: T } => {\n // prettier-ignore\n let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n tv1 = Fp.sqr(u); // 1. tv1 = u^2\n tv1 = Fp.mul(tv1, opts.Z); // 2. tv1 = Z * tv1\n tv2 = Fp.sqr(tv1); // 3. tv2 = tv1^2\n tv2 = Fp.add(tv2, tv1); // 4. tv2 = tv2 + tv1\n tv3 = Fp.add(tv2, Fp.ONE); // 5. tv3 = tv2 + 1\n tv3 = Fp.mul(tv3, opts.B); // 6. tv3 = B * tv3\n tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7. tv4 = CMOV(Z, -tv2, tv2 != 0)\n tv4 = Fp.mul(tv4, opts.A); // 8. tv4 = A * tv4\n tv2 = Fp.sqr(tv3); // 9. tv2 = tv3^2\n tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n tv5 = Fp.mul(tv6, opts.A); // 11. tv5 = A * tv6\n tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n tv5 = Fp.mul(tv6, opts.B); // 15. tv5 = B * tv6\n tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n x = Fp.mul(tv1, tv3); // 17. x = tv1 * tv3\n const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n y = Fp.mul(tv1, u); // 19. y = tv1 * u -> Z * u^3 * y1\n y = Fp.mul(y, value); // 20. y = y * y1\n x = Fp.cmov(x, tv3, isValid); // 21. x = CMOV(x, tv3, is_gx1_square)\n y = Fp.cmov(y, value, isValid); // 22. y = CMOV(y, y1, is_gx1_square)\n const e1 = Fp.isOdd!(u) === Fp.isOdd!(y); // 23. e1 = sgn0(u) == sgn0(y)\n y = Fp.cmov(Fp.neg(y), y, e1); // 24. y = CMOV(-y, y, e1)\n x = Fp.div(x, tv4); // 25. x = x / tv4\n return { x, y };\n };\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { IField, validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n\nexport type AffinePoint<T> = {\n x: T;\n y: T;\n} & { z?: never; t?: never };\n\nexport interface Group<T extends Group<T>> {\n double(): T;\n negate(): T;\n add(other: T): T;\n subtract(other: T): T;\n equals(other: T): boolean;\n multiply(scalar: bigint): T;\n}\n\nexport type GroupConstructor<T> = {\n BASE: T;\n ZERO: T;\n};\nexport type Mapper<T> = (i: T[]) => T[];\n\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF<T extends Group<T>>(c: GroupConstructor<T>, bits: number) {\n const constTimeNegate = (condition: boolean, item: T): T => {\n const neg = item.negate();\n return condition ? neg : item;\n };\n const opts = (W: number) => {\n const windows = Math.ceil(bits / W) + 1; // +1, because\n const windowSize = 2 ** (W - 1); // -1 because we skip zero\n return { windows, windowSize };\n };\n return {\n constTimeNegate,\n // non-const time multiplication ladder\n unsafeLadder(elm: T, n: bigint) {\n let p = c.ZERO;\n let d: T = elm;\n while (n > _0n) {\n if (n & _1n) p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n },\n\n /**\n * Creates a wNAF precomputation window. Used for caching.\n * Default window size is set by `utils.precompute()` and is equal to 8.\n * Number of precomputed points depends on the curve size:\n * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n * - 𝑊 is the window size\n * - 𝑛 is the bitlength of the curve order.\n * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm: T, W: number): Group<T>[] {\n const { windows, windowSize } = opts(W);\n const points: T[] = [];\n let p: T = elm;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n // =1, because we skip zero\n for (let i = 1; i < windowSize; i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n },\n\n /**\n * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n * @param W window size\n * @param precomputes precomputed tables\n * @param n scalar (we don't check here, but should be less than curve order)\n * @returns real and fake (for const-time) points\n */\n wNAF(W: number, precomputes: T[], n: bigint): { p: T; f: T } {\n // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n // But need to carefully remove other checks before wNAF. ORDER == bits here\n const { windows, windowSize } = opts(W);\n\n let p = c.ZERO;\n let f = c.BASE;\n\n const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n // Extract W bits.\n let wbits = Number(n & mask);\n\n // Shift number by W bits.\n n >>= shiftBy;\n\n // If the bits are bigger than max size, we'll split those.\n // +224 => 256 - 32\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += _1n;\n }\n\n // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n // there is negate now: it is possible that negated element from low value\n // would be the same as high element, which will create carry into next window.\n // It's not obvious how this can fail, but still worth investigating later.\n\n // Check if we're onto Zero point.\n // Add random point inside current window to f.\n const offset1 = offset;\n const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n const cond1 = window % 2 !== 0;\n const cond2 = wbits < 0;\n if (wbits === 0) {\n // The most important part for const-time getPublicKey\n f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n } else {\n p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n }\n }\n // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n // Even if the variable is still unused, there are some checks which will\n // throw an exception, so compiler needs to prove they won't happen, which is hard.\n // At this point there is a way to F be infinity-point even if p is not,\n // which makes it less const-time: around 1 bigint multiply.\n return { p, f };\n },\n\n wNAFCached(P: T, precomputesMap: Map<T, T[]>, n: bigint, transform: Mapper<T>): { p: T; f: T } {\n // @ts-ignore\n const W: number = P._WINDOW_SIZE || 1;\n // Calculate precomputes on a first run, reuse them after\n let comp = precomputesMap.get(P);\n if (!comp) {\n comp = this.precomputeWindow(P, W) as T[];\n if (W !== 1) {\n precomputesMap.set(P, transform(comp));\n }\n }\n return this.wNAF(W, comp, n);\n },\n };\n}\n\n// Generic BasicCurve interface: works even for polynomial fields (BLS): P, n, h would be ok.\n// Though generator can be different (Fp2 / Fp6 for BLS).\nexport type BasicCurve<T> = {\n Fp: IField<T>; // Field over which we'll do calculations (Fp)\n n: bigint; // Curve order, total count of valid points in the field\n nBitLength?: number; // bit length of curve order\n nByteLength?: number; // byte length of curve order\n h: bigint; // cofactor. we can assign default=1, but users will just ignore it w/o validation\n hEff?: bigint; // Number to multiply to clear cofactor\n Gx: T; // base point X coordinate\n Gy: T; // base point Y coordinate\n allowInfinityPoint?: boolean; // bls12-381 requires it. ZERO point is valid, but invalid pubkey\n};\n\nexport function validateBasic<FP, T>(curve: BasicCurve<FP> & T) {\n validateField(curve.Fp);\n validateObject(\n curve,\n {\n n: 'bigint',\n h: 'bigint',\n Gx: 'field',\n Gy: 'field',\n },\n {\n nBitLength: 'isSafeInteger',\n nByteLength: 'isSafeInteger',\n }\n );\n // Set defaults\n return Object.freeze({\n ...nLength(curve.n, curve.nBitLength),\n ...curve,\n ...{ p: curve.Fp.ORDER },\n } as const);\n}\n","/**\n * Test whether a string contains an integer number\n */\nexport function isInteger(value: string): boolean {\n return INTEGER_REGEX.test(value)\n}\n\nconst INTEGER_REGEX = /^-?[0-9]+$/\n\n/**\n * Test whether a string contains a number\n * http://stackoverflow.com/questions/13340717/json-numbers-regular-expression\n */\nexport function isNumber(value: string): boolean {\n return NUMBER_REGEX.test(value)\n}\n\nconst NUMBER_REGEX = /^-?(?:0|[1-9]\\d*)(?:\\.\\d+)?(?:[eE][+-]?\\d+)?$/\n\n/**\n * Test whether a string can be safely represented with a number\n * without information loss.\n *\n * When approx is true, floating point numbers that lose a few digits but\n * are still approximately equal in value are considered safe too.\n * Integer numbers must still be exactly equal.\n */\nexport function isSafeNumber(\n value: string,\n config?: {\n approx: boolean\n }\n): boolean {\n const num = parseFloat(value)\n const str = String(num)\n\n const v = extractSignificantDigits(value)\n const s = extractSignificantDigits(str)\n\n if (v === s) {\n return true\n }\n\n if (config?.approx === true) {\n // A value is approximately equal when:\n // 1. it is a floating point number, not an integer\n // 2. it has at least 14 digits\n // 3. the first 14 digits are equal\n const requiredDigits = 14\n if (\n !isInteger(value) &&\n s.length >= requiredDigits &&\n v.startsWith(s.substring(0, requiredDigits))\n ) {\n return true\n }\n }\n\n return false\n}\n\nexport enum UnsafeNumberReason {\n underflow = 'underflow',\n overflow = 'overflow',\n truncate_integer = 'truncate_integer',\n truncate_float = 'truncate_float'\n}\n\n/**\n * When the provided value is an unsafe number, describe what the reason is:\n * overflow, underflow, truncate_integer, or truncate_float.\n * Returns undefined when the value is safe.\n */\nexport function getUnsafeNumberReason(value: string): UnsafeNumberReason | undefined {\n if (isSafeNumber(value, { approx: false })) {\n return undefined\n }\n\n if (isInteger(value)) {\n return UnsafeNumberReason.truncate_integer\n }\n\n const num = parseFloat(value)\n if (!isFinite(num)) {\n return UnsafeNumberReason.overflow\n }\n\n if (num === 0) {\n return UnsafeNumberReason.underflow\n }\n\n return UnsafeNumberReason.truncate_float\n}\n\n/**\n * Convert a string into a number when it is safe to do so.\n * Throws an error otherwise, explaining the reason.\n */\nexport function toSafeNumberOrThrow(\n value: string,\n config?: {\n approx: boolean\n }\n): number {\n const number = parseFloat(value)\n\n const unsafeReason = getUnsafeNumberReason(value)\n if (\n config?.approx === true\n ? unsafeReason && unsafeReason !== UnsafeNumberReason.truncate_float\n : unsafeReason\n ) {\n const unsafeReasonText = unsafeReason?.replace(/_\\w+$/, '')\n throw new Error(\n 'Cannot safely convert to number: ' +\n `the value '${value}' would ${unsafeReasonText} and become ${number}`\n )\n }\n\n return number\n}\n\n/**\n * Get the significant digits of a number.\n *\n * For example:\n * '2.34' returns '234'\n * '-77' returns '77'\n * '0.003400' returns '34'\n * '120.5e+30' returns '1205'\n **/\nexport function extractSignificantDigits(value: string): string {\n return (\n value\n // from \"-0.250e+30\" to \"-0.250\"\n .replace(EXPONENTIAL_PART_REGEX, '')\n\n // from \"-0.250\" to \"-0250\"\n .replace(DOT_REGEX, '')\n\n // from \"-0250\" to \"-025\"\n .replace(TRAILING_ZEROS_REGEX, '')\n\n // from \"-025\" to \"25\"\n .replace(LEADING_MINUS_AND_ZEROS_REGEX, '')\n )\n}\n\nconst EXPONENTIAL_PART_REGEX = /[eE][+-]?\\d+$/\nconst LEADING_MINUS_AND_ZEROS_REGEX = /^-?(0*)?/\nconst DOT_REGEX = /\\./\nconst TRAILING_ZEROS_REGEX = /0+$/\n","import {\n extractSignificantDigits,\n getUnsafeNumberReason,\n isInteger,\n isNumber,\n UnsafeNumberReason\n} from './utils.js'\n\n/**\n * A lossless number. Stores its numeric value as string\n */\nexport class LosslessNumber {\n // numeric value as string\n value: string\n\n // type information\n isLosslessNumber = true\n\n constructor(value: string) {\n if (!isNumber(value)) {\n throw new Error('Invalid number (value: \"' + value + '\")')\n }\n\n this.value = value\n }\n\n /**\n * Get the value of the LosslessNumber as number or bigint.\n *\n * - a number is returned for safe numbers and decimal values that only lose some insignificant digits\n * - a bigint is returned for big integer numbers\n * - an Error is thrown for values that will overflow or underflow\n *\n * Note that you can implement your own strategy for conversion by just getting the value as string\n * via .toString(), and using util functions like isInteger, isSafeNumber, getUnsafeNumberReason,\n * and toSafeNumberOrThrow to convert it to a numeric value.\n */\n valueOf(): number | bigint {\n const unsafeReason = getUnsafeNumberReason(this.value)\n\n // safe or truncate_float\n if (unsafeReason === undefined || unsafeReason === UnsafeNumberReason.truncate_float) {\n return parseFloat(this.value)\n }\n\n // truncate_integer\n if (isInteger(this.value)) {\n return BigInt(this.value)\n }\n\n // overflow or underflow\n throw new Error(\n 'Cannot safely convert to number: ' +\n `the value '${this.value}' would ${unsafeReason} and become ${parseFloat(this.value)}`\n )\n }\n\n /**\n * Get the value of the LosslessNumber as string.\n */\n toString(): string {\n return this.value\n }\n\n // Note: we do NOT implement a .toJSON() method, and you should not implement\n // or use that, it cannot safely turn the numeric value in the string into\n // stringified JSON since it has to be parsed into a number first.\n}\n\n/**\n * Test whether a value is a LosslessNumber\n */\nexport function isLosslessNumber(value: unknown): value is LosslessNumber {\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n return (value && typeof value === 'object' && value.isLosslessNumber === true) || false\n}\n\n/**\n * Convert a number into a LosslessNumber if this is possible in a safe way\n * If the value has too many digits, or is NaN or Infinity, an error will be thrown\n */\nexport function toLosslessNumber(value: number): LosslessNumber {\n if (extractSignificantDigits(value + '').length > 15) {\n throw new Error(\n 'Invalid number: contains more than 15 digits and is most likely truncated and unsafe by itself ' +\n `(value: ${value})`\n )\n }\n\n if (isNaN(value)) {\n throw new Error('Invalid number: NaN')\n }\n\n if (!isFinite(value)) {\n throw new Error('Invalid number: ' + value)\n }\n\n return new LosslessNumber(String(value))\n}\n","import { LosslessNumber } from './LosslessNumber.js'\nimport { isInteger } from './utils.js'\n\nexport function parseLosslessNumber(value: string): LosslessNumber {\n return new LosslessNumber(value)\n}\n\nexport function parseNumberAndBigInt(value: string): number | bigint {\n return isInteger(value) ? BigInt(value) : parseFloat(value)\n}\n","import { isLosslessNumber } from './LosslessNumber.js'\nimport type { GenericObject, Reviver } from './types'\n\n/**\n * Revive a json object.\n * Applies the reviver function recursively on all values in the JSON object.\n * @param json A JSON Object, Array, or value\n * @param reviver\n * A reviver function invoked with arguments `key` and `value`,\n * which must return a replacement value. The function context\n * (`this`) is the Object or Array that contains the currently\n * handled value.\n */\nexport function revive(json: unknown, reviver: Reviver): unknown {\n return reviveValue({ '': json }, '', json, reviver)\n}\n\n/**\n * Revive a value\n */\nfunction reviveValue(\n context: GenericObject<unknown> | Array<unknown>,\n key: string,\n value: unknown,\n reviver: Reviver\n): unknown {\n if (Array.isArray(value)) {\n return reviver.call(context, key, reviveArray(value, reviver))\n } else if (value && typeof value === 'object' && !isLosslessNumber(value)) {\n // note the special case for LosslessNumber,\n // we don't want to iterate over the internals of a LosslessNumber\n return reviver.call(context, key, reviveObject(value as GenericObject<unknown>, reviver))\n } else {\n return reviver.call(context, key, value)\n }\n}\n\n/**\n * Revive the properties of an object\n */\nfunction reviveObject(object: GenericObject<unknown>, reviver: Reviver) {\n Object.keys(object).forEach((key) => {\n const value = reviveValue(object, key, object[key], reviver)\n if (value !== undefined) {\n object[key] = value\n } else {\n delete object[key]\n }\n })\n\n return object\n}\n\n/**\n * Revive the properties of an Array\n */\nfunction reviveArray(array: Array<unknown>, reviver: Reviver): Array<unknown> {\n for (let i = 0; i < array.length; i++) {\n array[i] = reviveValue(array, i + '', array[i], reviver)\n }\n\n return array\n}\n","import { parseLosslessNumber } from './numberParsers.js'\nimport { revive } from './revive.js'\nimport type { NumberParser, Reviver } from './types'\nimport { GenericObject } from './types'\n\n/**\n * The LosslessJSON.parse() method parses a string as JSON, optionally transforming\n * the value produced by parsing.\n *\n * The parser is based on the parser of Tan Li Hou shared in\n * https://lihautan.com/json-parser-with-javascript/\n *\n * @param text\n * The string to parse as JSON. See the JSON object for a description of JSON syntax.\n *\n * @param [reviver]\n * If a function, prescribes how the value originally produced by parsing is\n * transformed, before being returned.\n *\n * @param [parseNumber=parseLosslessNumber]\n * Pass a custom number parser. Input is a string, and the output can be unknown\n * numeric value: number, bigint, LosslessNumber, or a custom BigNumber library.\n *\n * @returns Returns the Object corresponding to the given JSON text.\n *\n * @throws Throws a SyntaxError exception if the string to parse is not valid JSON.\n */\nexport function parse(\n text: string,\n reviver?: Reviver | null,\n parseNumber: NumberParser = parseLosslessNumber\n): unknown {\n let i = 0\n const value = parseValue()\n expectValue(value)\n expectEndOfInput()\n\n return reviver ? revive(value, reviver) : value\n\n function parseObject(): GenericObject<unknown> | undefined {\n if (text.charCodeAt(i) === codeOpeningBrace) {\n i++\n skipWhitespace()\n\n const object: GenericObject<unknown> = {}\n let initial = true\n while (i < text.length && text.charCodeAt(i) !== codeClosingBrace) {\n if (!initial) {\n eatComma()\n skipWhitespace()\n } else {\n initial = false\n }\n\n const start = i\n\n const key = parseString()\n if (key === undefined) {\n throwObjectKeyExpected()\n return // To make TS happy\n }\n\n skipWhitespace()\n eatColon()\n const value = parseValue()\n\n if (value === undefined) {\n throwObjectValueExpected()\n return // To make TS happy\n }\n\n // TODO: test deep equal instead of strict equal\n if (Object.prototype.hasOwnProperty.call(object, key) && !isDeepEqual(value, object[key])) {\n // Note that we could also test `if(key in object) {...}`\n // or `if (object[key] !== 'undefined') {...}`, but that is slower.\n throwDuplicateKey(key, start + 1)\n }\n\n object[key] = value\n }\n\n if (text.charCodeAt(i) !== codeClosingBrace) {\n throwObjectKeyOrEndExpected()\n }\n i++\n\n return object\n }\n }\n\n function parseArray(): Array<unknown> | unknown {\n if (text.charCodeAt(i) === codeOpeningBracket) {\n i++\n skipWhitespace()\n\n const array = []\n let initial = true\n while (i < text.length && text.charCodeAt(i) !== codeClosingBracket) {\n if (!initial) {\n eatComma()\n } else {\n initial = false\n }\n\n const value = parseValue()\n expectArrayItem(value)\n array.push(value)\n }\n\n if (text.charCodeAt(i) !== codeClosingBracket) {\n throwArrayItemOrEndExpected()\n }\n i++\n\n return array\n }\n }\n\n function parseValue(): unknown {\n skipWhitespace()\n\n const value =\n parseString() ??\n parseNumeric() ??\n parseObject() ??\n parseArray() ??\n parseKeyword('true', true) ??\n parseKeyword('false', false) ??\n parseKeyword('null', null)\n\n skipWhitespace()\n\n return value\n }\n\n function parseKeyword(name: string, value: unknown): unknown | undefined {\n if (text.slice(i, i + name.length) === name) {\n i += name.length\n return value\n }\n }\n\n function skipWhitespace() {\n while (isWhitespace(text.charCodeAt(i))) {\n i++\n }\n }\n\n function parseString() {\n if (text.charCodeAt(i) === codeDoubleQuote) {\n i++\n let result = ''\n while (i < text.length && text.charCodeAt(i) !== codeDoubleQuote) {\n if (text.charCodeAt(i) === codeBackslash) {\n const char = text[i + 1]\n const escapeChar = escapeCharacters[char]\n if (escapeChar !== undefined) {\n result += escapeChar\n i++\n } else if (char === 'u') {\n if (\n isHex(text.charCodeAt(i + 2)) &&\n isHex(text.charCodeAt(i + 3)) &&\n isHex(text.charCodeAt(i + 4)) &&\n isHex(text.charCodeAt(i + 5))\n ) {\n result += String.fromCharCode(parseInt(text.slice(i + 2, i + 6), 16))\n i += 5\n } else {\n throwInvalidUnicodeCharacter(i)\n }\n } else {\n throwInvalidEscapeCharacter(i)\n }\n } else {\n if (isValidStringCharacter(text.charCodeAt(i))) {\n result += text[i]\n } else {\n throwInvalidCharacter(text[i])\n }\n }\n i++\n }\n expectEndOfString()\n i++\n return result\n }\n }\n\n function parseNumeric() {\n const start = i\n if (text.charCodeAt(i) === codeMinus) {\n i++\n expectDigit(start)\n }\n\n if (text.charCodeAt(i) === codeZero) {\n i++\n } else if (isNonZeroDigit(text.charCodeAt(i))) {\n i++\n while (isDigit(text.charCodeAt(i))) {\n i++\n }\n }\n\n if (text.charCodeAt(i) === codeDot) {\n i++\n expectDigit(start)\n while (isDigit(text.charCodeAt(i))) {\n i++\n }\n }\n\n if (text.charCodeAt(i) === codeLowercaseE || text.charCodeAt(i) === codeUppercaseE) {\n i++\n if (text.charCodeAt(i) === codeMinus || text.charCodeAt(i) === codePlus) {\n i++\n }\n expectDigit(start)\n while (isDigit(text.charCodeAt(i))) {\n i++\n }\n }\n\n if (i > start) {\n return parseNumber(text.slice(start, i))\n }\n }\n\n function eatComma() {\n if (text.charCodeAt(i) !== codeComma) {\n throw new SyntaxError(`Comma ',' expected after value ${gotAt()}`)\n }\n i++\n }\n\n function eatColon() {\n if (text.charCodeAt(i) !== codeColon) {\n throw new SyntaxError(`Colon ':' expected after property name ${gotAt()}`)\n }\n i++\n }\n\n function expectValue(value: unknown) {\n if (value === undefined) {\n throw new SyntaxError(`JSON value expected ${gotAt()}`)\n }\n }\n\n function expectArrayItem(value: unknown) {\n if (value === undefined) {\n throw new SyntaxError(`Array item expected ${gotAt()}`)\n }\n }\n\n function expectEndOfInput() {\n if (i < text.length) {\n throw new SyntaxError(`Expected end of input ${gotAt()}`)\n }\n }\n\n function expectDigit(start: number) {\n if (!isDigit(text.charCodeAt(i))) {\n const numSoFar = text.slice(start, i)\n throw new SyntaxError(`Invalid number '${numSoFar}', expecting a digit ${gotAt()}`)\n }\n }\n\n function expectEndOfString() {\n if (text.charCodeAt(i) !== codeDoubleQuote) {\n throw new SyntaxError(`End of string '\"' expected ${gotAt()}`)\n }\n }\n\n function throwObjectKeyExpected() {\n throw new SyntaxError(`Quoted object key expected ${gotAt()}`)\n }\n\n function throwDuplicateKey(key: string, pos: number) {\n throw new SyntaxError(`Duplicate key '${key}' encountered at position ${pos}`)\n }\n\n function throwObjectKeyOrEndExpected() {\n throw new SyntaxError(`Quoted object key or end of object '}' expected ${gotAt()}`)\n }\n\n function throwArrayItemOrEndExpected() {\n throw new SyntaxError(`Array item or end of array ']' expected ${gotAt()}`)\n }\n\n function throwInvalidCharacter(char: string) {\n throw new SyntaxError(`Invalid character '${char}' ${pos()}`)\n }\n\n function throwInvalidEscapeCharacter(start: number) {\n const chars = text.slice(start, start + 2)\n throw new SyntaxError(`Invalid escape character '${chars}' ${pos()}`)\n }\n\n function throwObjectValueExpected() {\n throw new SyntaxError(`Object value expected after ':' ${pos()}`)\n }\n\n function throwInvalidUnicodeCharacter(start: number) {\n const chars = text.slice(start, start + 6)\n throw new SyntaxError(`Invalid unicode character '${chars}' ${pos()}`)\n }\n\n // zero based character position\n function pos(): string {\n return `at position ${i}`\n }\n\n function got(): string {\n return i < text.length ? `but got '${text[i]}'` : 'but reached end of input'\n }\n\n function gotAt(): string {\n return got() + ' ' + pos()\n }\n}\n\nfunction isWhitespace(code: number): boolean {\n return code === codeSpace || code === codeNewline || code === codeTab || code === codeReturn\n}\n\nfunction isHex(code: number): boolean {\n return (\n (code >= codeZero && code <= codeNine) ||\n (code >= codeUppercaseA && code <= codeUppercaseF) ||\n (code >= codeLowercaseA && code <= codeLowercaseF)\n )\n}\n\nfunction isDigit(code: number): boolean {\n return code >= codeZero && code <= codeNine\n}\n\nfunction isNonZeroDigit(code: number): boolean {\n return code >= codeOne && code <= codeNine\n}\n\nexport function isValidStringCharacter(code: number): boolean {\n return code >= 0x20 && code <= 0x10ffff\n}\n\nexport function isDeepEqual(a: unknown, b: unknown): boolean {\n if (a === b) {\n return true\n }\n\n if (Array.isArray(a) && Array.isArray(b)) {\n return a.length === b.length && a.every((item, index) => isDeepEqual(item, b[index]))\n }\n\n if (isObject(a) && isObject(b)) {\n const keys = [...new Set([...Object.keys(a), ...Object.keys(b)])]\n return keys.every((key) => isDeepEqual(a[key], b[key]))\n }\n\n return false\n}\n\nfunction isObject(value: unknown): value is Record<string, unknown> {\n return typeof value === 'object' && value !== null\n}\n\n// map with all escape characters\nconst escapeCharacters: GenericObject<string> = {\n '\"': '\"',\n '\\\\': '\\\\',\n '/': '/',\n b: '\\b',\n f: '\\f',\n n: '\\n',\n r: '\\r',\n t: '\\t'\n // note that \\u is handled separately in parseString()\n}\n\nconst codeBackslash = 0x5c // \"\\\"\nconst codeOpeningBrace = 0x7b // \"{\"\nconst codeClosingBrace = 0x7d // \"}\"\nconst codeOpeningBracket = 0x5b // \"[\"\nconst codeClosingBracket = 0x5d // \"]\"\nconst codeSpace = 0x20 // \" \"\nconst codeNewline = 0xa // \"\\n\"\nconst codeTab = 0x9 // \"\\t\"\nconst codeReturn = 0xd // \"\\r\"\nconst codeDoubleQuote = 0x0022 // \"\nconst codePlus = 0x2b // \"+\"\nconst codeMinus = 0x2d // \"-\"\nconst codeZero = 0x30\nconst codeOne = 0x31\nconst codeNine = 0x39\nconst codeComma = 0x2c // \",\"\nconst codeDot = 0x2e // \".\" (dot, period)\nconst codeColon = 0x3a // \":\"\nexport const codeUppercaseA = 0x41 // \"A\"\nexport const codeLowercaseA = 0x61 // \"a\"\nexport const codeUppercaseE = 0x45 // \"E\"\nexport const codeLowercaseE = 0x65 // \"e\"\nexport const codeUppercaseF = 0x46 // \"F\"\nexport const codeLowercaseF = 0x66 // \"f\"\n","import type { GenericObject, NumberStringifier, Replacer } from './types'\nimport { isNumber } from './utils.js'\n\n/**\n * The LosslessJSON.stringify() method converts a JavaScript value to a JSON string,\n * optionally replacing values if a replacer function is specified, or\n * optionally including only the specified properties if a replacer array is specified.\n *\n * @param value\n * The value to convert to a JSON string.\n *\n * @param [replacer]\n * A function that alters the behavior of the stringification process,\n * or an array of String and Number objects that serve as a whitelist for\n * selecting the properties of the value object to be included in the JSON string.\n * If this value is null or not provided, all properties of the object are\n * included in the resulting JSON string.\n *\n * @param [space]\n * A String or Number object that's used to insert white space into the output\n * JSON string for readability purposes. If this is a Number, it indicates the\n * number of space characters to use as white space; this number is capped at 10\n * if it's larger than that. Values less than 1 indicate that no space should be\n * used. If this is a String, the string (or the first 10 characters of the string,\n * if it's longer than that) is used as white space. If this parameter is not\n * provided (or is null), no white space is used.\n *\n * @param [numberStringifiers]\n * An optional list with additional number stringifiers, for example to serialize\n * a BigNumber. The output of the function must be valid stringified JSON.\n * When `undefined` is returned, the property will be deleted from the object.\n * The difference with using a `replacer` is that the output of a `replacer`\n * must be JSON and will be stringified afterwards, whereas the output of the\n * `numberStringifiers` is already stringified JSON.\n *\n * @returns Returns the string representation of the JSON object.\n */\nexport function stringify(\n value: unknown,\n replacer?: Replacer | null,\n space?: number | string,\n numberStringifiers?: NumberStringifier[]\n): string | undefined {\n const resolvedSpace = resolveSpace(space)\n\n const replacedValue =\n typeof replacer === 'function' ? replacer.call({ '': value }, '', value) : value\n\n return stringifyValue(replacedValue, '')\n\n /**\n * Stringify a value\n */\n function stringifyValue(value: unknown, indent: string | undefined): string | undefined {\n if (Array.isArray(numberStringifiers)) {\n const stringifier = numberStringifiers.find((item) => item.test(value))\n if (stringifier) {\n const str: unknown = stringifier.stringify(value)\n if (typeof str !== 'string' || !isNumber(str)) {\n throw new Error(\n 'Invalid JSON number: ' +\n 'output of a number stringifier must be a string containing a JSON number ' +\n `(output: ${str})`\n )\n }\n return str\n }\n }\n\n // boolean, null, number, string, or date\n if (\n typeof value === 'boolean' ||\n typeof value === 'number' ||\n typeof value === 'string' ||\n value === null ||\n value instanceof Date ||\n value instanceof Boolean ||\n value instanceof Number ||\n value instanceof String\n ) {\n return JSON.stringify(value)\n }\n\n // lossless number, the secret ingredient :)\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n if (value && value.isLosslessNumber) {\n return value.toString()\n }\n\n // BigInt\n if (typeof value === 'bigint') {\n return value.toString()\n }\n\n // Array\n if (Array.isArray(value)) {\n return stringifyArray(value, indent)\n }\n\n // Object (test lastly!)\n if (value && typeof value === 'object') {\n return stringifyObject(value as GenericObject<unknown>, indent)\n }\n\n return undefined\n }\n\n /**\n * Stringify an array\n */\n function stringifyArray(array: Array<unknown>, indent: string | undefined): string {\n if (array.length === 0) {\n return '[]'\n }\n\n const childIndent = resolvedSpace ? indent + resolvedSpace : undefined\n let str = resolvedSpace ? '[\\n' : '['\n\n for (let i = 0; i < array.length; i++) {\n const item =\n typeof replacer === 'function' ? replacer.call(array, String(i), array[i]) : array[i]\n\n if (resolvedSpace) {\n str += childIndent\n }\n\n if (typeof item !== 'undefined' && typeof item !== 'function') {\n str += stringifyValue(item, childIndent)\n } else {\n str += 'null'\n }\n\n if (i < array.length - 1) {\n str += resolvedSpace ? ',\\n' : ','\n }\n }\n\n str += resolvedSpace ? '\\n' + indent + ']' : ']'\n return str\n }\n\n /**\n * Stringify an object\n */\n function stringifyObject(\n object: GenericObject<unknown>,\n indent: string | undefined\n ): string | undefined {\n if (typeof object.toJSON === 'function') {\n return stringify(object.toJSON(), replacer, space, undefined)\n }\n\n const keys: string[] = Array.isArray(replacer) ? replacer.map(String) : Object.keys(object)\n\n if (keys.length === 0) {\n return '{}'\n }\n\n const childIndent = resolvedSpace ? indent + resolvedSpace : undefined\n let first = true\n let str = resolvedSpace ? '{\\n' : '{'\n\n keys.forEach((key) => {\n const value =\n typeof replacer === 'function' ? replacer.call(object, key, object[key]) : object[key]\n\n if (includeProperty(key, value)) {\n if (first) {\n first = false\n } else {\n str += resolvedSpace ? ',\\n' : ','\n }\n\n const keyStr = JSON.stringify(key)\n str += resolvedSpace ? childIndent + keyStr + ': ' : keyStr + ':'\n\n str += stringifyValue(value, childIndent)\n }\n })\n\n str += resolvedSpace ? '\\n' + indent + '}' : '}'\n return str\n }\n\n /**\n * Test whether to include a property in a stringified object or not.\n */\n function includeProperty(key: string, value: unknown): boolean {\n return typeof value !== 'undefined' && typeof value !== 'function' && typeof value !== 'symbol'\n }\n}\n\n/**\n * Resolve a JSON stringify space:\n * replace a number with a string containing that number of spaces\n */\nfunction resolveSpace(space: number | string | undefined): string | undefined {\n if (typeof space === 'number') {\n return ' '.repeat(space)\n }\n\n if (typeof space === 'string' && space !== '') {\n return space\n }\n\n return undefined\n}\n","import { exists, output } from './_assert.js';\nimport { Hash, createView, Input, toBytes } from './utils.js';\n\n// Polyfill for Safari 14\nfunction setBigUint64(view: DataView, byteOffset: number, value: bigint, isLE: boolean): void {\n if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n\n// Choice: a ? b : c\nexport const Chi = (a: number, b: number, c: number) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nexport const Maj = (a: number, b: number, c: number) => (a & b) ^ (a & c) ^ (b & c);\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> extends Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(\n readonly blockLen: number,\n public outputLen: number,\n readonly padOffset: number,\n readonly isLE: boolean\n ) {\n super();\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data: Input): this {\n exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out: Uint8Array) {\n exists(this);\n output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in\n // current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to?: T): T {\n to ||= new (this.constructor as any)() as T;\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen) to.buffer.set(buffer);\n return to;\n }\n}\n","import { HashMD, Chi, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends HashMD<SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = SHA256_IV[0] | 0;\n B = SHA256_IV[1] | 0;\n C = SHA256_IV[2] | 0;\n D = SHA256_IV[3] | 0;\n E = SHA256_IV[4] | 0;\n F = SHA256_IV[5] | 0;\n G = SHA256_IV[6] | 0;\n H = SHA256_IV[7] | 0;\n\n constructor() {\n super(64, 32, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n protected process(view: DataView, offset: number): void {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n protected roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n A = 0xc1059ed8 | 0;\n B = 0x367cd507 | 0;\n C = 0x3070dd17 | 0;\n D = 0xf70e5939 | 0;\n E = 0xffc00b31 | 0;\n F = 0x68581511 | 0;\n G = 0x64f98fa7 | 0;\n H = 0xbefa4fa4 | 0;\n constructor() {\n super();\n this.outputLen = 28;\n }\n}\n\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, CHash, Input, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, _key: Input) {\n super();\n assertHash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create() as T;\n if (typeof this.iHash.update !== 'function')\n throw new Error('Expected instance of class which extends utils.Hash');\n this.blockLen = this.iHash.blockLen;\n this.outputLen = this.iHash.outputLen;\n const blockLen = this.blockLen;\n const pad = new Uint8Array(blockLen);\n // blockLen can be bigger than outputLen\n pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36;\n this.iHash.update(pad);\n // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n this.oHash = hash.create() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n pad.fill(0);\n }\n update(buf: Input) {\n assertExists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array) {\n assertExists(this);\n assertBytes(out, this.outputLen);\n this.finished = true;\n this.iHash.digestInto(out);\n this.oHash.update(out);\n this.oHash.digestInto(out);\n this.destroy();\n }\n digest() {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: HMAC<T>): HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\n to.finished = finished;\n to.destroyed = destroyed;\n to.blockLen = blockLen;\n to.outputLen = outputLen;\n to.oHash = oHash._cloneInto(to.oHash);\n to.iHash = iHash._cloneInto(to.iHash);\n return to;\n }\n destroy() {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\n}\n\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash: CHash, key: Input, message: Input): Uint8Array =>\n new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass, CurveType } from './abstract/weierstrass.js';\nimport { CHash } from './abstract/utils.js';\n\n// connects noble-curves to noble-hashes\nexport function getHash(hash: CHash) {\n return {\n hash,\n hmac: (key: Uint8Array, ...msgs: Uint8Array[]) => hmac(hash, key, concatBytes(...msgs)),\n randomBytes,\n };\n}\n// Same API as @noble/hashes, with ability to create curve with custom hash\ntype CurveDef = Readonly<Omit<CurveType, 'hash' | 'hmac' | 'randomBytes'>>;\nexport function createCurve(curveDef: CurveDef, defHash: CHash) {\n const create = (hash: CHash) => weierstrass({ ...curveDef, ...getHash(hash) });\n return Object.freeze({ ...create(defHash), create });\n}\n","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { ProjPointType as PointType, mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nimport type { Hex, PrivKey } from './abstract/utils.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { createCurve } from './_shortw_utils.js';\n\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a: bigint, b: bigint) => (a + b / _2n) / b;\n\n/**\n * √n = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y: bigint): bigint {\n const P = secp256k1P;\n // prettier-ignore\n const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n // prettier-ignore\n const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n const b2 = (y * y * y) % P; // x^3, 11\n const b3 = (b2 * b2 * y) % P; // x^7\n const b6 = (pow2(b3, _3n, P) * b3) % P;\n const b9 = (pow2(b6, _3n, P) * b3) % P;\n const b11 = (pow2(b9, _2n, P) * b2) % P;\n const b22 = (pow2(b11, _11n, P) * b11) % P;\n const b44 = (pow2(b22, _22n, P) * b22) % P;\n const b88 = (pow2(b44, _44n, P) * b44) % P;\n const b176 = (pow2(b88, _88n, P) * b88) % P;\n const b220 = (pow2(b176, _44n, P) * b44) % P;\n const b223 = (pow2(b220, _3n, P) * b3) % P;\n const t1 = (pow2(b223, _23n, P) * b22) % P;\n const t2 = (pow2(t1, _6n, P) * b2) % P;\n const root = pow2(t2, _2n, P);\n if (!Fp.eql(Fp.sqr(root), y)) throw new Error('Cannot find square root');\n return root;\n}\n\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n\nexport const secp256k1 = createCurve(\n {\n a: BigInt(0), // equation params: a, b\n b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n n: secp256k1N, // Curve order, total count of valid points in the field\n // Base point (x, y) aka generator point\n Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n h: BigInt(1), // Cofactor\n lowS: true, // Allow only low-S signatures by default in sign() and verify()\n /**\n * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n */\n endo: {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n splitScalar: (k: bigint) => {\n const n = secp256k1N;\n const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n const b2 = a1;\n const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n\n const c1 = divNearest(b2 * k, n);\n const c2 = divNearest(-b1 * k, n);\n let k1 = mod(k - c1 * a1 - c2 * a2, n);\n let k2 = mod(-c1 * b1 - c2 * b2, n);\n const k1neg = k1 > POW_2_128;\n const k2neg = k2 > POW_2_128;\n if (k1neg) k1 = n - k1;\n if (k2neg) k2 = n - k2;\n if (k1 > POW_2_128 || k2 > POW_2_128) {\n throw new Error('splitScalar: Endomorphism failed, k=' + k);\n }\n return { k1neg, k1, k2neg, k2 };\n },\n },\n },\n sha256\n);\n\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\nconst fe = (x: bigint) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x: bigint) => typeof x === 'bigint' && _0n < x && x < secp256k1N;\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};\nfunction taggedHash(tag: string, ...messages: Uint8Array[]): Uint8Array {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return sha256(concatBytes(tagP, ...messages));\n}\n\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point: PointType<bigint>) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n: bigint) => numberToBytesBE(n, 32);\nconst modP = (x: bigint) => mod(x, secp256k1P);\nconst modN = (x: bigint) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q: PointType<bigint>, a: bigint, b: bigint) =>\n Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv: PrivKey) {\n let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n const scalar = p.hasEvenY() ? d_ : modN(-d_);\n return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x: bigint): PointType<bigint> {\n if (!fe(x)) throw new Error('bad x: need 0 < x < p'); // Fail if x ≥ p.\n const xx = modP(x * x);\n const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n if (y % _2n !== _0n) y = modP(-y); // Return the unique point P such that x(P) = x and\n const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n p.assertValidity();\n return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args: Uint8Array[]): bigint {\n return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey: Hex): Uint8Array {\n return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\n}\n\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(\n message: Hex,\n privateKey: PrivKey,\n auxRand: Hex = randomBytes(32)\n): Uint8Array {\n const m = ensureBytes('message', message);\n const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n const t = numTo32b(d ^ bytesToNumberBE(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n if (k_ === _0n) throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\n const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n sig.set(rx, 0);\n sig.set(numTo32b(modN(k + e * d)), 32);\n // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');\n return sig;\n}\n\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature: Hex, message: Hex, publicKey: Hex): boolean {\n const sig = ensureBytes('signature', signature, 64);\n const m = ensureBytes('message', message);\n const pub = ensureBytes('publicKey', publicKey, 32);\n try {\n const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n if (!fe(r)) return false;\n const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n if (!ge(s)) return false;\n const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n if (!R || !R.hasEvenY() || R.toAffine().x !== r) return false; // -eP == (n-e)P\n return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n } catch (error) {\n return false;\n }\n}\n\nexport const schnorr = /* @__PURE__ */ (() => ({\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n utils: {\n randomPrivateKey: secp256k1.utils.randomPrivateKey,\n lift_x,\n pointToBytes,\n numberToBytesBE,\n bytesToNumberBE,\n taggedHash,\n mod,\n },\n}))();\n\nconst isoMap = /* @__PURE__ */ (() =>\n isogenyMap(\n Fp,\n [\n // xNum\n [\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n ],\n // xDen\n [\n '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n // yNum\n [\n '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n ],\n // yDen\n [\n '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]\n ))();\nconst mapSWU = /* @__PURE__ */ (() =>\n mapToCurveSimpleSWU(Fp, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fp.create(BigInt('-11')),\n }))();\nconst htf = /* @__PURE__ */ (() =>\n createHasher(\n secp256k1.ProjectivePoint,\n (scalars: bigint[]) => {\n const { x, y } = mapSWU(Fp.create(scalars[0]));\n return isoMap(x, y);\n },\n {\n DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n p: Fp.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n }\n ))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n","import * as tough from \"tough-cookie\";\nimport { splitCookiesString } from \"set-cookie-parser\";\nfunction isDomainOrSubdomain(destination, original) {\n const orig = new URL(original).hostname;\n const dest = new URL(destination).hostname;\n return orig === dest || orig.endsWith(`.${dest}`);\n}\nconst referrerPolicy = /* @__PURE__ */ new Set([\n \"\",\n \"no-referrer\",\n \"no-referrer-when-downgrade\",\n \"same-origin\",\n \"origin\",\n \"strict-origin\",\n \"origin-when-cross-origin\",\n \"strict-origin-when-cross-origin\",\n \"unsafe-url\"\n]);\nfunction parseReferrerPolicy(policyHeader) {\n const policyTokens = policyHeader.split(/[,\\s]+/);\n let policy = \"\";\n for (const token of policyTokens) {\n if (token !== \"\" && referrerPolicy.has(token)) {\n policy = token;\n }\n }\n return policy;\n}\nfunction doNothing(init, name) {\n}\nfunction callDeleteMethod(init, name) {\n init.headers.delete(name);\n}\nfunction deleteFromObject(init, name) {\n const headers = init.headers;\n for (const key of Object.keys(headers)) {\n if (key.toLowerCase() === name) {\n delete headers[key];\n }\n }\n}\nfunction identifyDeleteHeader(init) {\n if (init.headers == null) {\n return doNothing;\n }\n if (typeof init.headers.delete === \"function\") {\n return callDeleteMethod;\n }\n return deleteFromObject;\n}\nconst redirectStatus = /* @__PURE__ */ new Set([301, 302, 303, 307, 308]);\nfunction isRedirect(status) {\n return redirectStatus.has(status);\n}\nasync function handleRedirect(fetchImpl, init, response) {\n switch (init.redirect ?? \"follow\") {\n case \"error\":\n throw new TypeError(`URI requested responded with a redirect and redirect mode is set to error: ${response.url}`);\n case \"manual\":\n return response;\n case \"follow\":\n break;\n default:\n throw new TypeError(`Invalid redirect option: ${init.redirect}`);\n }\n const locationUrl = response.headers.get(\"location\");\n if (locationUrl === null) {\n return response;\n }\n const requestUrl = response.url;\n const redirectUrl = new URL(locationUrl, requestUrl).toString();\n const redirectCount = init.redirectCount ?? 0;\n const maxRedirect = init.maxRedirect ?? 20;\n if (redirectCount >= maxRedirect) {\n throw new TypeError(`Reached maximum redirect of ${maxRedirect} for URL: ${requestUrl}`);\n }\n init = {\n ...init,\n redirectCount: redirectCount + 1\n };\n const deleteHeader = identifyDeleteHeader(init);\n if (!isDomainOrSubdomain(requestUrl, redirectUrl)) {\n for (const name of [\"authorization\", \"www-authenticate\", \"cookie\", \"cookie2\"]) {\n deleteHeader(init, name);\n }\n }\n const maybeNodeStreamBody = init.body;\n const maybeStreamBody = init.body;\n if (response.status !== 303 && init.body != null && (typeof maybeNodeStreamBody.pipe === \"function\" || typeof maybeStreamBody.pipeTo === \"function\")) {\n throw new TypeError(\"Cannot follow redirect with body being a readable stream\");\n }\n if (response.status === 303 || (response.status === 301 || response.status === 302) && init.method === \"POST\") {\n init.method = \"GET\";\n init.body = void 0;\n deleteHeader(init, \"content-length\");\n }\n if (response.headers.has(\"referrer-policy\")) {\n init.referrerPolicy = parseReferrerPolicy(response.headers.get(\"referrer-policy\"));\n }\n return await fetchImpl(redirectUrl, init);\n}\nfunction addCookiesToRequest(input, init, cookie) {\n if (cookie === \"\") {\n return init;\n }\n const maybeRequest = input;\n const maybeHeaders = init.headers;\n if (maybeRequest.headers && typeof maybeRequest.headers.append === \"function\") {\n maybeRequest.headers.append(\"cookie\", cookie);\n } else if (maybeHeaders && typeof maybeHeaders.append === \"function\") {\n maybeHeaders.append(\"cookie\", cookie);\n } else {\n init = { ...init, headers: { ...init.headers, cookie } };\n }\n return init;\n}\nfunction getCookiesFromResponse(response) {\n const maybeNodeFetchHeaders = response.headers;\n if (typeof maybeNodeFetchHeaders.getAll === \"function\") {\n return maybeNodeFetchHeaders.getAll(\"set-cookie\");\n }\n if (typeof maybeNodeFetchHeaders.raw === \"function\") {\n const headers = maybeNodeFetchHeaders.raw();\n if (Array.isArray(headers[\"set-cookie\"])) {\n return headers[\"set-cookie\"];\n }\n return [];\n }\n const cookieString = response.headers.get(\"set-cookie\");\n if (cookieString !== null) {\n return splitCookiesString(cookieString);\n }\n return [];\n}\nfunction fetchCookie(fetch, jar, ignoreError = true) {\n const actualFetch = fetch;\n const actualJar = jar ?? new tough.CookieJar();\n async function fetchCookieWrapper(input, init) {\n const originalInit = init ?? {};\n init = { ...init, redirect: \"manual\" };\n const requestUrl = typeof input === \"string\" ? input : input.url ?? input.href;\n const cookie = await actualJar.getCookieString(requestUrl);\n init = addCookiesToRequest(input, init, cookie);\n const response = await actualFetch(input, init);\n const cookies = getCookiesFromResponse(response);\n await Promise.all(cookies.map(async (cookie2) => await actualJar.setCookie(cookie2, response.url, { ignoreError })));\n if ((init.redirectCount ?? 0) > 0) {\n Object.defineProperty(response, \"redirected\", { value: true });\n }\n if (!isRedirect(response.status)) {\n return response;\n }\n return await handleRedirect(fetchCookieWrapper, originalInit, response);\n }\n fetchCookieWrapper.toughCookie = tough;\n return fetchCookieWrapper;\n}\nfetchCookie.toughCookie = tough;\nexport {\n fetchCookie as default\n};\n","import { ETransactionVersion } from './types/api';\n\nexport { IS_BROWSER } from './utils/encode';\n\n/**\n * Cairo Felt support storing max 31 character\n */\nexport const TEXT_TO_FELT_MAX_LEN = 31;\n\n/**\n * Alternatively use directly from api specification\n * types.RPC.ETransactionVersion\n * For BN do BigInt(TRANSACTION_VERSION.*)\n */\nexport { ETransactionVersion as TRANSACTION_VERSION };\n\nexport const ZERO = 0n;\nexport const MASK_250 = 2n ** 250n - 1n; // 2 ** 250 - 1\nexport const API_VERSION = ZERO;\nexport const PRIME = 2n ** 251n + 17n * 2n ** 192n + 1n;\n\n// based on: https://github.com/starkware-libs/cairo-lang/blob/v0.12.3/src/starkware/starknet/common/storage.cairo#L3\nexport const MAX_STORAGE_ITEM_SIZE = 256n;\nexport const ADDR_BOUND = 2n ** 251n - MAX_STORAGE_ITEM_SIZE;\n\nconst range = (min: bigint, max: bigint) => ({ min, max }) as const;\n\nexport const RANGE_FELT = range(ZERO, PRIME - 1n);\nexport const RANGE_I128 = range(-(2n ** 127n), 2n ** 127n - 1n);\nexport const RANGE_U128 = range(ZERO, 2n ** 128n - 1n);\n\nexport enum BaseUrl {\n SN_MAIN = 'https://alpha-mainnet.starknet.io',\n SN_SEPOLIA = 'https://alpha-sepolia.starknet.io',\n}\n\nexport enum NetworkName {\n SN_MAIN = 'SN_MAIN',\n SN_SEPOLIA = 'SN_SEPOLIA',\n}\n\nexport enum StarknetChainId {\n SN_MAIN = '0x534e5f4d41494e', // encodeShortString('SN_MAIN'),\n SN_SEPOLIA = '0x534e5f5345504f4c4941', // encodeShortString('SN_SEPOLIA')\n}\n\nexport enum TransactionHashPrefix {\n DECLARE = '0x6465636c617265', // encodeShortString('declare'),\n DEPLOY = '0x6465706c6f79', // encodeShortString('deploy'),\n DEPLOY_ACCOUNT = '0x6465706c6f795f6163636f756e74', // encodeShortString('deploy_account'),\n INVOKE = '0x696e766f6b65', // encodeShortString('invoke'),\n L1_HANDLER = '0x6c315f68616e646c6572', // encodeShortString('l1_handler'),\n}\n\nexport const enum FeeMarginPercentage {\n L1_BOUND_MAX_AMOUNT = 50,\n L1_BOUND_MAX_PRICE_PER_UNIT = 50,\n MAX_FEE = 50,\n}\n\nexport const UDC = {\n ADDRESS: '0x041a78e741e5af2fec34b695679bc6891742439f7afb8484ecd7766661ad02bf',\n ENTRYPOINT: 'deployContract',\n} as const;\n\nexport const RPC_DEFAULT_VERSION = 'v0_7';\n\nexport const RPC_NODES = {\n SN_MAIN: [\n `https://starknet-mainnet.public.blastapi.io/rpc/${RPC_DEFAULT_VERSION}`,\n `https://free-rpc.nethermind.io/mainnet-juno/${RPC_DEFAULT_VERSION}`,\n ],\n SN_SEPOLIA: [\n `https://starknet-sepolia.public.blastapi.io/rpc/${RPC_DEFAULT_VERSION}`,\n `https://free-rpc.nethermind.io/sepolia-juno/${RPC_DEFAULT_VERSION}`,\n ],\n} as const;\n","export * as JRPC from './jsonrpc';\n\nexport * as RPCSPEC06 from './rpcspec_0_6';\nexport * as RPCSPEC07 from 'starknet-types-07';\nexport * from 'starknet-types-07';\n","export type RequestBody = {\n id: number | string;\n jsonrpc: '2.0';\n method: string;\n params?: {};\n};\n\nexport type ResponseBody = {\n id: number | string;\n jsonrpc: '2.0';\n} & (SuccessResponseBody | ErrorResponseBody);\n\nexport type SuccessResponseBody = {\n result: unknown;\n};\n\nexport type ErrorResponseBody = {\n error: Error;\n};\n\nexport type Error = {\n code: number;\n message: string;\n data?: unknown;\n};\n","/**\n * version 0.6.0\n */\n\nexport { Methods } from './methods';\nexport { ABI } from './contract';\nexport * as Errors from './errors';\nexport * as SPEC from './components';\nexport * from './nonspec';\n","export interface FAILED_TO_RECEIVE_TXN {\n code: 1;\n message: 'Failed to write transaction';\n}\n\nexport interface NO_TRACE_AVAILABLE {\n code: 10;\n message: 'No trace available for transaction';\n data: {\n status: 'RECEIVED' | 'REJECTED';\n };\n}\n\nexport interface CONTRACT_NOT_FOUND {\n code: 20;\n message: 'Contract not found';\n}\n\nexport interface INVALID_MESSAGE_SELECTOR {\n code: 21;\n message: 'Invalid message selector';\n}\n\nexport interface INVALID_CALL_DATA {\n code: 22;\n message: 'Invalid call data';\n}\n\nexport interface BLOCK_NOT_FOUND {\n code: 24;\n message: 'Block not found';\n}\n\nexport interface INVALID_BLOCK_HASH {\n code: 26;\n message: 'Invalid block hash';\n}\n\nexport interface INVALID_TXN_INDEX {\n code: 27;\n message: 'Invalid transaction index in a block';\n}\n\nexport interface CLASS_HASH_NOT_FOUND {\n code: 28;\n message: 'Class hash not found';\n}\n\nexport interface TXN_HASH_NOT_FOUND {\n code: 29;\n message: 'Transaction hash not found';\n}\n\nexport interface PAGE_SIZE_TOO_BIG {\n code: 31;\n message: 'Requested page size is too big';\n}\n\nexport interface NO_BLOCKS {\n code: 32;\n message: 'There are no blocks';\n}\n\nexport interface INVALID_CONTINUATION_TOKEN {\n code: 33;\n message: 'The supplied continuation token is invalid or unknown';\n}\n\nexport interface TOO_MANY_KEYS_IN_FILTER {\n code: 34;\n message: 'Too many keys provided in a filter';\n}\n\nexport interface CONTRACT_ERROR {\n code: 40;\n message: 'Contract error';\n data: {\n revert_error: string;\n };\n}\n\nexport interface TRANSACTION_EXECUTION_ERROR {\n code: 41;\n message: 'Transaction execution error';\n data: {\n transaction_index: number;\n execution_error: string;\n };\n}\n\nexport interface CLASS_ALREADY_DECLARED {\n code: 51;\n message: 'Class already declared';\n}\n\nexport interface INVALID_TRANSACTION_NONCE {\n code: 52;\n message: 'Invalid transaction nonce';\n}\n\nexport interface INSUFFICIENT_MAX_FEE {\n code: 53;\n message: 'Max fee is smaller than the minimal transaction cost (validation plus fee transfer)';\n}\n\nexport interface INSUFFICIENT_ACCOUNT_BALANCE {\n code: 54;\n message: \"Account balance is smaller than the transaction's max_fee\";\n}\n\nexport interface VALIDATION_FAILURE {\n code: 55;\n message: 'Account validation failed';\n data: string;\n}\n\nexport interface COMPILATION_FAILED {\n code: 56;\n message: 'Compilation failed';\n}\n\nexport interface CONTRACT_CLASS_SIZE_IS_TOO_LARGE {\n code: 57;\n message: 'Contract class size it too large';\n}\n\nexport interface NON_ACCOUNT {\n code: 58;\n message: 'Sender address in not an account contract';\n}\n\nexport interface DUPLICATE_TX {\n code: 59;\n message: 'A transaction with the same hash already exists in the mempool';\n}\n\nexport interface COMPILED_CLASS_HASH_MISMATCH {\n code: 60;\n message: 'the compiled class hash did not match the one supplied in the transaction';\n}\n\nexport interface UNSUPPORTED_TX_VERSION {\n code: 61;\n message: 'the transaction version is not supported';\n}\n\nexport interface UNSUPPORTED_CONTRACT_CLASS_VERSION {\n code: 62;\n message: 'the contract class version is not supported';\n}\n\nexport interface UNEXPECTED_ERROR {\n code: 63;\n message: 'An unexpected error occurred';\n data: string;\n}\n","/**\n * PRIMITIVES\n */\n\n/**\n * A field element. represented by at most 63 hex digits\n * @pattern ^0x(0|[a-fA-F1-9]{1}[a-fA-F0-9]{0,62})$\n */\nexport type FELT = string;\n/**\n * an ethereum address represented as 40 hex digits\n * @pattern ^0x[a-fA-F0-9]{40}$\n */\nexport type ETH_ADDRESS = string;\n/**\n * A storage key. Represented as up to 62 hex digits, 3 bits, and 5 leading zeroes.\n * @pattern ^0x0[0-7]{1}[a-fA-F0-9]{0,62}$\n */\nexport type STORAGE_KEY = string;\nexport type ADDRESS = FELT;\nexport type NUM_AS_HEX = string;\n/**\n * 64 bit integers, represented by hex string of length at most 16\n * \"pattern\": \"^0x(0|[a-fA-F1-9]{1}[a-fA-F0-9]{0,15})$\"\n */\nexport type u64 = string;\n/**\n * 64 bit integers, represented by hex string of length at most 32\n * \"pattern\": \"^0x(0|[a-fA-F1-9]{1}[a-fA-F0-9]{0,31})$\"\n */\nexport type u128 = string;\nexport type SIGNATURE = Array<FELT>;\nexport type BLOCK_NUMBER = number;\nexport type BLOCK_HASH = FELT;\nexport type TXN_HASH = FELT;\nexport type CHAIN_ID = NUM_AS_HEX;\nexport type STRUCT_ABI_TYPE = 'struct';\nexport type EVENT_ABI_TYPE = 'event';\nexport type FUNCTION_ABI_TYPE = 'function' | 'l1_handler' | 'constructor';\n// Represents the type of an entry point.\nexport type ENTRY_POINT_TYPE = 'EXTERNAL' | 'L1_HANDLER' | 'CONSTRUCTOR';\n// Represents the type of a function call.\nexport type CALL_TYPE = 'DELEGATE' | 'LIBRARY_CALL' | 'CALL';\n// Represents the status of the transaction\nexport type TXN_STATUS = 'RECEIVED' | 'REJECTED' | 'ACCEPTED_ON_L2' | 'ACCEPTED_ON_L1';\n// Flags that indicate how to simulate a given transaction. By default, the sequencer behavior is replicated locally (enough funds are expected to be in the account, and the fee will be deducted from the balance before the simulation of the next transaction). To skip the fee charge, use the SKIP_FEE_CHARGE flag.\nexport type SIMULATION_FLAG = 'SKIP_VALIDATE' | 'SKIP_FEE_CHARGE';\n// Data availability mode\nexport type DA_MODE = 'L1' | 'L2';\nexport type TXN_TYPE = 'DECLARE' | 'DEPLOY' | 'DEPLOY_ACCOUNT' | 'INVOKE' | 'L1_HANDLER';\nexport type TXN_FINALITY_STATUS = 'ACCEPTED_ON_L2' | 'ACCEPTED_ON_L1';\nexport type TXN_EXECUTION_STATUS = 'SUCCEEDED' | 'REVERTED';\nexport type BLOCK_STATUS = 'PENDING' | 'ACCEPTED_ON_L2' | 'ACCEPTED_ON_L1' | 'REJECTED';\nexport type BLOCK_TAG = 'latest' | 'pending';\n\n/**\n * READ API\n */\n\nexport type EVENTS_CHUNK = {\n // Returns matching events\n events: EMITTED_EVENT[];\n // Use this token in a subsequent query to obtain the next page. Should not appear if there are no more pages.\n continuation_token?: string;\n};\n\nexport type RESULT_PAGE_REQUEST = {\n // The token returned from the previous query. If no token is provided the first page is returned.\n continuation_token?: string;\n // Chunk size\n chunk_size: number;\n};\n\nexport type EMITTED_EVENT = EVENT & {\n block_hash: BLOCK_HASH;\n block_number: BLOCK_NUMBER;\n transaction_hash: TXN_HASH;\n};\n\nexport type EVENT = {\n from_address: ADDRESS;\n} & EVENT_CONTENT;\n\nexport type EVENT_CONTENT = {\n keys: FELT[];\n data: FELT[];\n};\n\nexport type EVENT_FILTER = {\n from_block?: BLOCK_ID;\n to_block?: BLOCK_ID;\n address?: ADDRESS;\n keys?: FELT[][];\n};\n\nexport type BLOCK_ID =\n | {\n block_hash?: BLOCK_HASH;\n block_number?: BLOCK_NUMBER;\n }\n | BLOCK_TAG;\n\nexport type SYNC_STATUS = {\n starting_block_hash: BLOCK_HASH;\n starting_block_num: BLOCK_NUMBER;\n current_block_hash: BLOCK_HASH;\n current_block_num: BLOCK_NUMBER;\n highest_block_hash: BLOCK_HASH;\n highest_block_num: BLOCK_NUMBER;\n};\n\nexport type NEW_CLASSES = {\n class_hash: FELT;\n compiled_class_hash: FELT;\n};\n\nexport type REPLACED_CLASS = {\n class_hash: FELT;\n contract_address: FELT;\n};\n\nexport type NONCE_UPDATE = {\n contract_address: ADDRESS;\n nonce: FELT;\n};\n\nexport type STATE_DIFF = {\n storage_diffs: CONTRACT_STORAGE_DIFF_ITEM[];\n deprecated_declared_classes: FELT[];\n declared_classes: NEW_CLASSES[];\n deployed_contracts: DEPLOYED_CONTRACT_ITEM[];\n replaced_classes: REPLACED_CLASS[];\n nonces: NONCE_UPDATE[];\n};\n\nexport type PENDING_STATE_UPDATE = {\n old_root: FELT;\n state_diff: STATE_DIFF;\n block_hash: never; // diverge: this makes it distinct\n};\n\nexport type STATE_UPDATE = {\n block_hash: BLOCK_HASH;\n old_root: FELT;\n new_root: FELT;\n state_diff: STATE_DIFF;\n};\n\nexport type BLOCK_BODY_WITH_TX_HASHES = {\n transactions: TXN_HASH[];\n};\n\nexport type BLOCK_BODY_WITH_TXS = {\n transactions: (TXN & {\n transaction_hash: TXN_HASH;\n })[];\n};\n\nexport type BLOCK_HEADER = {\n block_hash: BLOCK_HASH;\n parent_hash: BLOCK_HASH;\n block_number: BLOCK_NUMBER;\n new_root: FELT;\n timestamp: number;\n sequencer_address: FELT;\n l1_gas_price: RESOURCE_PRICE;\n starknet_version: string;\n};\n\nexport type PENDING_BLOCK_HEADER = {\n parent_hash: BLOCK_HASH;\n timestamp: number;\n sequencer_address: FELT;\n l1_gas_price: RESOURCE_PRICE;\n starknet_version: string;\n};\n\nexport type BLOCK_WITH_TX_HASHES = { status: BLOCK_STATUS } & BLOCK_HEADER &\n BLOCK_BODY_WITH_TX_HASHES;\n\nexport type BLOCK_WITH_TXS = { status: BLOCK_STATUS } & BLOCK_HEADER & BLOCK_BODY_WITH_TXS;\n\nexport type PENDING_BLOCK_WITH_TX_HASHES = BLOCK_BODY_WITH_TX_HASHES & PENDING_BLOCK_HEADER;\n\nexport type PENDING_BLOCK_WITH_TXS = BLOCK_BODY_WITH_TXS & PENDING_BLOCK_HEADER;\n\nexport type DEPLOYED_CONTRACT_ITEM = {\n address: FELT;\n class_hash: FELT;\n};\n\nexport type CONTRACT_STORAGE_DIFF_ITEM = {\n // The contract address for which the storage changed (in FELT format)\n address: string;\n // The changes in the storage of the contract\n storage_entries: StorageDiffItem[];\n};\n\nexport type StorageDiffItem = {\n // The key of the changed value (in FELT format)\n key: string;\n // The new value applied to the given address (in FELT format)\n value: string;\n};\n\nexport type TXN = INVOKE_TXN | L1_HANDLER_TXN | DECLARE_TXN | DEPLOY_TXN | DEPLOY_ACCOUNT_TXN;\n\nexport type DECLARE_TXN = DECLARE_TXN_V0 | DECLARE_TXN_V1 | DECLARE_TXN_V2 | DECLARE_TXN_V3;\n\nexport type DECLARE_TXN_V0 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n max_fee: FELT;\n version: '0x0' | '0x100000000000000000000000000000000';\n signature: SIGNATURE;\n class_hash: FELT;\n};\n\nexport type DECLARE_TXN_V1 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n max_fee: FELT;\n version: '0x1' | '0x100000000000000000000000000000001';\n signature: SIGNATURE;\n nonce: FELT;\n class_hash: FELT;\n};\n\nexport type DECLARE_TXN_V2 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n compiled_class_hash: FELT;\n max_fee: FELT;\n version: '0x2' | '0x100000000000000000000000000000002';\n signature: SIGNATURE;\n nonce: FELT;\n class_hash: FELT;\n};\n\nexport type DECLARE_TXN_V3 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n compiled_class_hash: FELT;\n version: '0x3' | '0x100000000000000000000000000000003';\n signature: SIGNATURE;\n nonce: FELT;\n class_hash: FELT;\n // new...\n resource_bounds: RESOURCE_BOUNDS_MAPPING;\n tip: u64;\n paymaster_data: FELT[];\n account_deployment_data: FELT[];\n nonce_data_availability_mode: DA_MODE;\n fee_data_availability_mode: DA_MODE;\n};\n\nexport type BROADCASTED_TXN =\n | BROADCASTED_INVOKE_TXN\n | BROADCASTED_DECLARE_TXN\n | BROADCASTED_DEPLOY_ACCOUNT_TXN;\n\nexport type BROADCASTED_INVOKE_TXN = INVOKE_TXN;\n\nexport type BROADCASTED_DEPLOY_ACCOUNT_TXN = DEPLOY_ACCOUNT_TXN;\n\nexport type BROADCASTED_DECLARE_TXN =\n | BROADCASTED_DECLARE_TXN_V1\n | BROADCASTED_DECLARE_TXN_V2\n | BROADCASTED_DECLARE_TXN_V3;\n\nexport type BROADCASTED_DECLARE_TXN_V1 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n max_fee: FELT;\n // todo: check if working, prev i fixed it with NUM_AS_HEX\n version: '0x1' | '0x100000000000000000000000000000001';\n signature: SIGNATURE;\n nonce: FELT;\n contract_class: DEPRECATED_CONTRACT_CLASS;\n};\n\nexport type BROADCASTED_DECLARE_TXN_V2 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n compiled_class_hash: FELT;\n max_fee: FELT;\n version: '0x2' | '0x100000000000000000000000000000002';\n signature: SIGNATURE;\n nonce: FELT;\n contract_class: CONTRACT_CLASS;\n};\n\nexport type BROADCASTED_DECLARE_TXN_V3 = {\n type: 'DECLARE';\n sender_address: ADDRESS;\n compiled_class_hash: FELT;\n version: '0x3' | '0x100000000000000000000000000000003';\n signature: SIGNATURE;\n nonce: FELT;\n contract_class: CONTRACT_CLASS;\n // new...\n resource_bounds: RESOURCE_BOUNDS_MAPPING;\n tip: u64;\n paymaster_data: FELT[];\n account_deployment_data: FELT[];\n nonce_data_availability_mode: DA_MODE;\n fee_data_availability_mode: DA_MODE;\n};\n\nexport type DEPLOY_ACCOUNT_TXN = DEPLOY_ACCOUNT_TXN_V1 | DEPLOY_ACCOUNT_TXN_V3;\n\nexport type DEPLOY_ACCOUNT_TXN_V1 = {\n type: 'DEPLOY_ACCOUNT';\n max_fee: FELT;\n version: '0x1' | '0x100000000000000000000000000000001';\n signature: SIGNATURE;\n nonce: FELT;\n contract_address_salt: FELT;\n constructor_calldata: FELT[];\n class_hash: FELT;\n};\n\nexport type DEPLOY_ACCOUNT_TXN_V3 = {\n type: 'DEPLOY_ACCOUNT';\n version: '0x3' | '0x100000000000000000000000000000003';\n signature: SIGNATURE;\n nonce: FELT;\n contract_address_salt: FELT;\n constructor_calldata: FELT[];\n class_hash: FELT;\n resource_bounds: RESOURCE_BOUNDS_MAPPING;\n tip: u64;\n paymaster_data: FELT[];\n nonce_data_availability_mode: DA_MODE;\n fee_data_availability_mode: DA_MODE;\n};\n\nexport type DEPLOY_TXN = {\n type: 'DEPLOY';\n version: FELT;\n contract_address_salt: FELT;\n constructor_calldata: FELT[];\n class_hash: FELT;\n};\n\nexport type INVOKE_TXN = INVOKE_TXN_V0 | INVOKE_TXN_V1 | INVOKE_TXN_V3;\n\nexport type INVOKE_TXN_V0 = {\n type: 'INVOKE';\n max_fee: FELT;\n version: '0x0' | '0x100000000000000000000000000000000';\n signature: SIGNATURE;\n contract_address: ADDRESS;\n entry_point_selector: FELT;\n calldata: FELT[];\n};\n\nexport type INVOKE_TXN_V1 = {\n type: 'INVOKE';\n sender_address: ADDRESS;\n calldata: FELT[];\n max_fee: FELT;\n version: '0x1' | '0x100000000000000000000000000000001';\n signature: SIGNATURE;\n nonce: FELT;\n};\n\nexport type INVOKE_TXN_V3 = {\n type: 'INVOKE';\n sender_address: ADDRESS;\n calldata: FELT[];\n version: '0x3' | '0x100000000000000000000000000000003';\n signature: SIGNATURE;\n nonce: FELT;\n resource_bounds: RESOURCE_BOUNDS_MAPPING;\n tip: u64;\n paymaster_data: FELT[];\n account_deployment_data: FELT[];\n nonce_data_availability_mode: DA_MODE;\n fee_data_availability_mode: DA_MODE;\n};\n\nexport type L1_HANDLER_TXN = {\n version: FELT;\n type: 'L1_HANDLER';\n nonce: NUM_AS_HEX;\n} & FUNCTION_CALL;\n\nexport type COMMON_RECEIPT_PROPERTIES = {\n transaction_hash: TXN_HASH;\n actual_fee: FEE_PAYMENT;\n execution_status: TXN_EXECUTION_STATUS;\n finality_status: TXN_FINALITY_STATUS;\n block_hash: BLOCK_HASH;\n block_number: BLOCK_NUMBER;\n messages_sent: MSG_TO_L1[];\n revert_reason?: string;\n events: EVENT[];\n execution_resources: EXECUTION_RESOURCES;\n};\n\nexport type PENDING_COMMON_RECEIPT_PROPERTIES = {\n transaction_hash: TXN_HASH;\n actual_fee: FEE_PAYMENT;\n messages_sent: MSG_TO_L1[];\n events: EVENT[];\n revert_reason?: string;\n finality_status: 'ACCEPTED_ON_L2';\n execution_status: TXN_EXECUTION_STATUS;\n execution_resources: EXECUTION_RESOURCES;\n};\n\nexport type INVOKE_TXN_RECEIPT = {\n type: 'INVOKE';\n} & COMMON_RECEIPT_PROPERTIES;\n\nexport type PENDING_INVOKE_TXN_RECEIPT = {\n type: 'INVOKE';\n} & PENDING_COMMON_RECEIPT_PROPERTIES;\n\nexport type DECLARE_TXN_RECEIPT = {\n type: 'DECLARE';\n} & COMMON_RECEIPT_PROPERTIES;\n\nexport type PENDING_DECLARE_TXN_RECEIPT = {\n type: 'DECLARE';\n} & PENDING_COMMON_RECEIPT_PROPERTIES;\n\nexport type DEPLOY_ACCOUNT_TXN_RECEIPT = {\n type: 'DEPLOY_ACCOUNT';\n contract_address: FELT;\n} & COMMON_RECEIPT_PROPERTIES;\n\nexport type PENDING_DEPLOY_ACCOUNT_TXN_RECEIPT = {\n type: 'DEPLOY_ACCOUNT';\n contract_address: FELT;\n} & PENDING_COMMON_RECEIPT_PROPERTIES;\n\nexport type DEPLOY_TXN_RECEIPT = {\n type: 'DEPLOY';\n contract_address: FELT;\n} & COMMON_RECEIPT_PROPERTIES;\n\nexport type L1_HANDLER_TXN_RECEIPT = {\n type: 'L1_HANDLER';\n message_hash: NUM_AS_HEX;\n} & COMMON_RECEIPT_PROPERTIES;\n\nexport type PENDING_L1_HANDLER_TXN_RECEIPT = {\n type: 'L1_HANDLER';\n message_hash: NUM_AS_HEX;\n} & PENDING_COMMON_RECEIPT_PROPERTIES;\n\nexport type TXN_RECEIPT =\n | INVOKE_TXN_RECEIPT\n | L1_HANDLER_TXN_RECEIPT\n | DECLARE_TXN_RECEIPT\n | DEPLOY_TXN_RECEIPT\n | DEPLOY_ACCOUNT_TXN_RECEIPT;\n\nexport type PENDING_TXN_RECEIPT =\n | PENDING_INVOKE_TXN_RECEIPT\n | PENDING_L1_HANDLER_TXN_RECEIPT\n | PENDING_DECLARE_TXN_RECEIPT\n | PENDING_DEPLOY_ACCOUNT_TXN_RECEIPT;\n\nexport type MSG_TO_L1 = {\n from_address: FELT;\n to_address: FELT;\n payload: FELT[];\n};\n\nexport type MSG_FROM_L1 = {\n from_address: ETH_ADDRESS;\n to_address: ADDRESS;\n entry_point_selector: FELT;\n payload: FELT[];\n};\n\nexport type FUNCTION_CALL = {\n contract_address: ADDRESS;\n entry_point_selector: FELT;\n calldata: FELT[];\n};\n\nexport type CONTRACT_CLASS = {\n sierra_program: FELT[];\n contract_class_version: string;\n entry_points_by_type: {\n CONSTRUCTOR: SIERRA_ENTRY_POINT[];\n EXTERNAL: SIERRA_ENTRY_POINT[];\n L1_HANDLER: SIERRA_ENTRY_POINT[];\n };\n abi: string;\n};\n\nexport type DEPRECATED_CONTRACT_CLASS = {\n program: string;\n entry_points_by_type: {\n CONSTRUCTOR: DEPRECATED_CAIRO_ENTRY_POINT[];\n EXTERNAL: DEPRECATED_CAIRO_ENTRY_POINT[];\n L1_HANDLER: DEPRECATED_CAIRO_ENTRY_POINT[];\n };\n abi: CONTRACT_ABI;\n};\n\nexport type DEPRECATED_CAIRO_ENTRY_POINT = {\n offset: NUM_AS_HEX | number;\n selector: FELT;\n};\n\nexport type SIERRA_ENTRY_POINT = {\n selector: FELT;\n function_idx: number;\n};\n\nexport type CONTRACT_ABI = readonly CONTRACT_ABI_ENTRY[];\n\nexport type CONTRACT_ABI_ENTRY = {\n selector: FELT;\n input: string;\n output: string;\n};\n\nexport type STRUCT_ABI_ENTRY = {\n type: STRUCT_ABI_TYPE;\n name: string;\n size: number;\n members: STRUCT_MEMBER[];\n};\n\nexport type STRUCT_MEMBER = TYPED_PARAMETER & {\n offset: number;\n};\n\nexport type EVENT_ABI_ENTRY = {\n type: EVENT_ABI_TYPE;\n name: string;\n keys: TYPED_PARAMETER[];\n data: TYPED_PARAMETER[];\n};\n\nexport type FUNCTION_STATE_MUTABILITY = 'view';\n\nexport type FUNCTION_ABI_ENTRY = {\n type: FUNCTION_ABI_TYPE;\n name: string;\n inputs: TYPED_PARAMETER[];\n outputs: TYPED_PARAMETER[];\n stateMutability: FUNCTION_STATE_MUTABILITY;\n};\n\nexport type TYPED_PARAMETER = {\n name: string;\n type: string;\n};\n\nexport type SIMULATION_FLAG_FOR_ESTIMATE_FEE = 'SKIP_VALIDATE';\nexport type PRICE_UNIT = 'WEI' | 'FRI';\n\nexport type FEE_ESTIMATE = {\n gas_consumed: FELT;\n gas_price: FELT;\n overall_fee: FELT;\n unit: PRICE_UNIT;\n};\n\nexport type FEE_PAYMENT = {\n amount: FELT;\n unit: PRICE_UNIT;\n};\n\nexport type RESOURCE_BOUNDS_MAPPING = {\n l1_gas: RESOURCE_BOUNDS;\n l2_gas: RESOURCE_BOUNDS;\n};\n\nexport type RESOURCE_BOUNDS = {\n max_amount: u64;\n max_price_per_unit: u128;\n};\n\nexport type RESOURCE_PRICE = {\n price_in_fri: FELT;\n price_in_wei: FELT;\n};\n\nexport type EXECUTION_RESOURCES = {\n steps: number;\n memory_holes?: number;\n range_check_builtin_applications?: number;\n pedersen_builtin_applications?: number;\n poseidon_builtin_applications?: number;\n ec_op_builtin_applications?: number;\n ecdsa_builtin_applications?: number;\n bitwise_builtin_applications?: number;\n keccak_builtin_applications?: number;\n segment_arena_builtin?: number;\n};\n\n/**\n * TRACE API\n */\n\n// Represents a transaction trace including the execution details.\nexport type TRANSACTION_TRACE = {\n invoke_tx_trace?: INVOKE_TXN_TRACE;\n declare_tx_trace?: DECLARE_TXN_TRACE;\n deploy_account_tx_trace?: DEPLOY_ACCOUNT_TXN_TRACE;\n l1_handler_tx_trace?: L1_HANDLER_TXN_TRACE;\n};\n\n// Represents a transaction trace for an invoke transaction.\nexport type INVOKE_TXN_TRACE = {\n type: 'INVOKE';\n execute_invocation: FUNCTION_INVOCATION | { revert_reason: string };\n validate_invocation?: FUNCTION_INVOCATION;\n fee_transfer_invocation?: FUNCTION_INVOCATION;\n state_diff?: STATE_DIFF;\n};\n\n// Represents a transaction trace for a declare transaction.\nexport type DECLARE_TXN_TRACE = {\n type: 'DECLARE';\n validate_invocation?: FUNCTION_INVOCATION;\n fee_transfer_invocation?: FUNCTION_INVOCATION;\n state_diff?: STATE_DIFF;\n};\n\n// Represents a transaction trace for a deploy account transaction.\nexport type DEPLOY_ACCOUNT_TXN_TRACE = {\n type: 'DEPLOY_ACCOUNT';\n constructor_invocation: FUNCTION_INVOCATION;\n validate_invocation?: FUNCTION_INVOCATION;\n fee_transfer_invocation?: FUNCTION_INVOCATION;\n state_diff?: STATE_DIFF;\n};\n\n// Represents a transaction trace for an L1 handler transaction.\nexport type L1_HANDLER_TXN_TRACE = {\n type: 'L1_HANDLER';\n function_invocation: FUNCTION_INVOCATION;\n state_diff?: STATE_DIFF;\n};\n\n// Represents a nested function call.\nexport type NESTED_CALL = FUNCTION_INVOCATION;\n\n// Represents a function invocation along with its execution details.\nexport type FUNCTION_INVOCATION = FUNCTION_CALL & {\n caller_address: string;\n class_hash: string;\n entry_point_type: ENTRY_POINT_TYPE;\n call_type: CALL_TYPE;\n result: string[];\n calls: NESTED_CALL[];\n events: ORDERED_EVENT[];\n messages: ORDERED_MESSAGE[];\n execution_resources: EXECUTION_RESOURCES;\n};\n\n// Represents an ordered event alongside its order within the transaction.\nexport type ORDERED_EVENT = {\n order: number;\n event: EVENT;\n};\n\n// Represents an ordered message alongside its order within the transaction.\nexport type ORDERED_MESSAGE = {\n order: number;\n message: MSG_TO_L1;\n};\n","/**\n * Types that are not in spec but required for UX\n */\nimport {\n ADDRESS,\n BLOCK_HASH,\n BLOCK_NUMBER,\n BLOCK_WITH_TXS,\n BLOCK_WITH_TX_HASHES,\n BROADCASTED_TXN,\n CHAIN_ID,\n CONTRACT_CLASS,\n CONTRACT_STORAGE_DIFF_ITEM,\n DEPRECATED_CONTRACT_CLASS,\n EMITTED_EVENT,\n EVENT,\n EVENTS_CHUNK,\n EVENT_FILTER,\n FEE_ESTIMATE,\n FEE_PAYMENT,\n FELT,\n MSG_FROM_L1,\n NONCE_UPDATE,\n PENDING_BLOCK_WITH_TXS,\n PENDING_BLOCK_WITH_TX_HASHES,\n PENDING_STATE_UPDATE,\n PENDING_TXN_RECEIPT,\n PRICE_UNIT,\n REPLACED_CLASS,\n RESOURCE_BOUNDS_MAPPING,\n RESULT_PAGE_REQUEST,\n SIMULATION_FLAG,\n STATE_UPDATE,\n SYNC_STATUS,\n TRANSACTION_TRACE,\n TXN,\n TXN_EXECUTION_STATUS,\n TXN_HASH,\n TXN_RECEIPT,\n TXN_STATUS,\n} from './components';\n\n// METHOD RESPONSES\n// response starknet_getClass\nexport type ContractClass = CONTRACT_CLASS | DEPRECATED_CONTRACT_CLASS;\n// response starknet_simulateTransactions\nexport type SimulateTransaction = {\n transaction_trace: TRANSACTION_TRACE;\n fee_estimation: FEE_ESTIMATE;\n};\nexport type SimulateTransactionResponse = SimulateTransaction[];\n// response starknet_estimateFee\nexport type FeeEstimate = FEE_ESTIMATE;\n// response starknet_getTransactionByHash, starknet_getTransactionByBlockIdAndIndex\nexport type TransactionWithHash = TXN & { transaction_hash: TXN_HASH };\n// response starknet_blockHashAndNumber\nexport type BlockHashAndNumber = { block_hash: BLOCK_HASH; block_number: BLOCK_NUMBER };\n// response starknet_getBlockWithTxs\nexport type BlockWithTxs = BLOCK_WITH_TXS | PENDING_BLOCK_WITH_TXS;\n// response starknet_getBlockWithTxHashes\nexport type BlockWithTxHashes = BLOCK_WITH_TX_HASHES | PENDING_BLOCK_WITH_TX_HASHES;\n// response starknet_getStateUpdate\nexport type StateUpdate = STATE_UPDATE | PENDING_STATE_UPDATE;\n// response starknet_traceBlockTransactions\nexport type BlockTransactionsTraces = { transaction_hash: FELT; trace_root: TRANSACTION_TRACE }[];\n// response starknet_syncing\nexport type Syncing = false | SYNC_STATUS;\n// response starknet_getEvents\nexport type Events = EVENTS_CHUNK;\nexport type EmittedEvent = EMITTED_EVENT;\nexport type Event = EVENT;\n// response starknet_addInvokeTransaction\nexport type InvokedTransaction = { transaction_hash: TXN_HASH };\n// response starknet_addDeclareTransaction\nexport type DeclaredTransaction = { transaction_hash: TXN_HASH; class_hash: FELT };\n// response starknet_addDeployAccountTransaction\nexport type DeployedAccountTransaction = { transaction_hash: TXN_HASH; contract_address: FELT };\n\n// Nice Components names\nexport type ContractAddress = ADDRESS;\nexport type Felt = FELT;\nexport type Nonce = FELT;\nexport type TransactionHash = TXN_HASH;\nexport type TransactionTrace = TRANSACTION_TRACE;\nexport type BlockHash = BLOCK_HASH;\nexport type TransactionReceipt = TXN_RECEIPT | PENDING_TXN_RECEIPT;\nexport type Receipt = TXN_RECEIPT;\nexport type PendingReceipt = PENDING_TXN_RECEIPT;\nexport type EventFilter = EVENT_FILTER & RESULT_PAGE_REQUEST;\nexport type SimulationFlags = Array<SIMULATION_FLAG>;\nexport type L1Message = MSG_FROM_L1;\nexport type BaseTransaction = BROADCASTED_TXN;\nexport type ChainId = CHAIN_ID;\nexport type Transaction = TXN;\nexport type TransactionStatus = {\n finality_status: TXN_STATUS;\n execution_status?: TXN_EXECUTION_STATUS;\n};\nexport type ResourceBounds = RESOURCE_BOUNDS_MAPPING;\nexport type FeePayment = FEE_PAYMENT;\nexport type PriceUnit = PRICE_UNIT;\n\n// Diff Than Seq\nexport type StorageDiffs = Array<CONTRACT_STORAGE_DIFF_ITEM>;\nexport type DeprecatedDeclaredClasses = Array<FELT>;\nexport type NonceUpdates = NONCE_UPDATE[];\nexport type ReplacedClasses = REPLACED_CLASS[];\n\n// Enums Derived From Spec Types (require manual check for changes)\nexport enum ETransactionType {\n DECLARE = 'DECLARE',\n DEPLOY = 'DEPLOY',\n DEPLOY_ACCOUNT = 'DEPLOY_ACCOUNT',\n INVOKE = 'INVOKE',\n L1_HANDLER = 'L1_HANDLER',\n}\n\nexport enum ESimulationFlag {\n SKIP_VALIDATE = 'SKIP_VALIDATE',\n SKIP_FEE_CHARGE = 'SKIP_FEE_CHARGE',\n}\n\nexport enum ETransactionStatus {\n RECEIVED = 'RECEIVED',\n REJECTED = 'REJECTED',\n ACCEPTED_ON_L2 = 'ACCEPTED_ON_L2',\n ACCEPTED_ON_L1 = 'ACCEPTED_ON_L1',\n}\n\nexport enum ETransactionFinalityStatus {\n ACCEPTED_ON_L2 = 'ACCEPTED_ON_L2',\n ACCEPTED_ON_L1 = 'ACCEPTED_ON_L1',\n}\n\nexport enum ETransactionExecutionStatus {\n SUCCEEDED = 'SUCCEEDED',\n REVERTED = 'REVERTED',\n}\n\nexport enum EBlockTag {\n PENDING = 'pending',\n LATEST = 'latest',\n}\n\n// 'L1' | 'L2'\nexport enum EDataAvailabilityMode {\n L1 = 'L1',\n L2 = 'L2',\n}\n\n// 0 | 1\nexport enum EDAMode {\n L1,\n L2,\n}\n\n/**\n * V_ Transaction versions HexString\n * F_ Fee Transaction Versions HexString (2 ** 128 + TRANSACTION_VERSION)\n */\nexport enum ETransactionVersion {\n V0 = '0x0',\n V1 = '0x1',\n V2 = '0x2',\n V3 = '0x3',\n F0 = '0x100000000000000000000000000000000',\n F1 = '0x100000000000000000000000000000001',\n F2 = '0x100000000000000000000000000000002',\n F3 = '0x100000000000000000000000000000003',\n}\n\n/**\n * Old Transaction Versions\n */\nexport enum ETransactionVersion2 {\n V0 = '0x0',\n V1 = '0x1',\n V2 = '0x2',\n F0 = '0x100000000000000000000000000000000',\n F1 = '0x100000000000000000000000000000001',\n F2 = '0x100000000000000000000000000000002',\n}\n\n/**\n * V3 Transaction Versions\n */\nexport enum ETransactionVersion3 {\n V3 = '0x3',\n F3 = '0x100000000000000000000000000000003',\n}\n","import { base64 } from '@scure/base';\n\n/* eslint-disable no-param-reassign */\nexport const IS_BROWSER = typeof window !== 'undefined';\n\nconst STRING_ZERO = '0';\n\n/**\n * Some functions recreated from https://github.com/pedrouid/enc-utils/blob/master/src/index.ts\n * enc-utils is not a dependency to avoid using `Buffer` which only works in node and not browsers\n */\n\n/**\n * Convert array buffer to string\n *\n * *[internal usage]*\n *\n * @param {ArrayBuffer} array The ArrayBuffer to convert to string.\n * @returns {string} The converted string.\n *\n * @example\n * ```typescript\n * const buffer = new ArrayBuffer(5);\n * const view = new Uint8Array(buffer);\n * [72, 101, 108, 108, 111].forEach((x, idx) => view[idx] = x);\n * const result = encode.arrayBufferToString(buffer);\n * // result = \"Hello\"\n * ```\n */\nexport function arrayBufferToString(array: ArrayBuffer): string {\n return new Uint8Array(array).reduce((data, byte) => data + String.fromCharCode(byte), '');\n}\n\n/**\n * Convert utf8-string to Uint8Array\n *\n * *[internal usage]*\n *\n * @param {string} str The UTF-8 string to convert.\n * @returns {Uint8Array} The encoded Uint8Array.\n *\n * @example\n * ```typescript\n * const myString = 'Hi';\n * const result = encode.utf8ToArray(myString);\n * // result = Uint8Array(2) [ 72, 105 ]\n * ```\n */\nexport function utf8ToArray(str: string): Uint8Array {\n return new TextEncoder().encode(str);\n}\n\n/**\n * Convert utf8-string to Uint8Array\n *\n * @deprecated equivalent to 'utf8ToArray', alias will be removed\n */\nexport function stringToArrayBuffer(str: string): Uint8Array {\n return utf8ToArray(str);\n}\n\n/**\n * Convert string to array buffer (browser and node compatible)\n *\n * @param {string} a The Base64 encoded string to convert.\n * @returns {Uint8Array} The decoded Uint8Array.\n *\n * @example\n * ```typescript\n * const base64String = 'SGVsbG8='; // 'Hello' in Base64\n * const result = encode.atobUniversal(base64String);\n * // result = Uint8Array(5) [ 72, 101, 108, 108, 111 ]\n * ```\n */\nexport function atobUniversal(a: string): Uint8Array {\n return base64.decode(a);\n}\n\n/**\n * Convert array buffer to string (browser and node compatible)\n *\n * @param {ArrayBuffer} b The Array buffer.\n * @returns {string} The Base64 encoded string.\n *\n * @example\n * ```typescript\n * const buffer = new Uint8Array([72, 101, 108, 108, 111]); // Array with ASCII values for 'Hello'\n * const result = encode.btoaUniversal(buffer);\n * // result = \"SGVsbG8=\"\n * ```\n */\nexport function btoaUniversal(b: ArrayBuffer): string {\n return base64.encode(new Uint8Array(b));\n}\n\n/**\n * Convert array buffer to hex-string\n *\n * @param {Uint8Array} buffer The encoded Uint8Array.\n * @returns {string} The hex-string\n *\n * @example\n * ```typescript\n * const buffer = new Uint8Array([72, 101, 108, 108, 111]); // Array with ASCII values for 'Hello'\n * const result = encode.buf2hex(buffer);\n * // result = \"48656c6c6f\"\n * ```\n */\nexport function buf2hex(buffer: Uint8Array) {\n return buffer.reduce((r, x) => r + x.toString(16).padStart(2, '0'), '');\n}\n\n/**\n * Remove hex prefix '0x' from hex-string\n * @param hex hex-string\n * @returns {string} The hex-string\n *\n * @example\n * ```typescript\n * const hexStringWithPrefix = '0x48656c6c6f';\n * const result = encode.removeHexPrefix(hexStringWithPrefix);\n * // result: \"48656c6c6f\"\n * ```\n */\nexport function removeHexPrefix(hex: string): string {\n return hex.replace(/^0x/i, '');\n}\n\n/**\n * Add hex prefix '0x' to base16-string\n * @param hex base16-string\n * @returns {string} The hex-string\n *\n * @example\n * ```typescript\n * const plainHexString = '48656c6c6f';\n * const result = encode.addHexPrefix(plainHexString);\n * // result: \"0x48656c6c6f\"\n * ```\n */\nexport function addHexPrefix(hex: string): string {\n return `0x${removeHexPrefix(hex)}`;\n}\n\n/**\n * Prepend or append to string\n *\n * *[internal usage]*\n *\n * Pads a string to a certain length with a specific string.\n * The padding can be applied either to the left or the right of the input string.\n *\n * @param {string} str The string to pad.\n * @param {number} length The target length for the padded string.\n * @param {boolean} left Set to true to add padding to the left, false to add it to the right.\n * @param {string} [padding='0'] The string to use for padding. Defaults to '0'.\n * @returns {string} The padded string.\n *\n * @example\n * ```typescript\n * const myString = 'hello';\n * const result = padString(myString, 10, true);\n * // result = '00000hello'\n * ```\n */\nfunction padString(str: string, length: number, left: boolean, padding = STRING_ZERO): string {\n const diff = length - str.length;\n let result = str;\n if (diff > 0) {\n const pad = padding.repeat(diff);\n result = left ? pad + str : str + pad;\n }\n return result;\n}\n\n/**\n * Prepend string (default with '0')\n *\n * Pads a string to a certain length with a specific string.\n * The padding can be applied only to the left of the input string.\n *\n * @param {string} str The string to pad.\n * @param {number} length The target length for the padded string.\n * @param {string} [padding='0'] The string to use for padding. Defaults to '0'.\n * @returns {string} The padded string.\n *\n * @example\n * ```typescript\n * const myString = '1A3F';\n * const result = encode.padLeft(myString, 10);\n * // result: '0000001A3F'\n * ```\n */\nexport function padLeft(str: string, length: number, padding = STRING_ZERO): string {\n return padString(str, length, true, padding);\n}\n\n/**\n * Calculate byte length of string\n *\n * *[no internal usage]*\n *\n * Calculates the byte length of a string based on a specified byte size.\n * The function rounds up the byte count to the nearest multiple of the specified byte size.\n *\n * @param {string} str The string whose byte length is to be calculated.\n * @param {number} [byteSize='8'] The size of the byte block to round up to. Defaults to 8.\n * @returns {number} The calculated byte length, rounded to the nearest multiple of byteSize.\n *\n * @example\n * ```typescript\n * const myString = 'Hello';\n * const result = encode.calcByteLength(myString, 4);\n * // result = 8 (rounded up to the nearest multiple of 4)\n *\n * ```\n */\nexport function calcByteLength(str: string, byteSize = 8): number {\n const { length } = str;\n const remainder = length % byteSize;\n return remainder ? ((length - remainder) / byteSize) * byteSize + byteSize : length;\n}\n\n/**\n * Prepend '0' to string bytes\n *\n * *[no internal usage]*\n *\n *\n * * Prepends padding to the left of a string to ensure it matches a specific byte length.\n * The function uses a specified padding character and rounds up the string length to the nearest multiple of `byteSize`.\n *\n * @param {string} str The string to be padded.\n * @param {number} [byteSize='8'] The byte block size to which the string length should be rounded up. Defaults to 8.\n * @param {string} [padding='0'] The character to use for padding. Defaults to '0'.\n * @returns {string} The padded string.\n *\n * @example\n * ```typescript\n * const myString = '123';\n * const result = encode.sanitizeBytes(myString);\n * // result: '00000123' (padded to 8 characters)\n * ```\n */\nexport function sanitizeBytes(str: string, byteSize = 8, padding = STRING_ZERO): string {\n return padLeft(str, calcByteLength(str, byteSize), padding);\n}\n\n/**\n * Sanitizes a hex-string by removing any existing '0x' prefix, padding the string with '0' to ensure it has even length,\n * and then re-adding the '0x' prefix.\n *\n * *[no internal usage]*\n * @param hex hex-string\n * @returns format: hex-string\n *\n * @example\n * ```typescript\n * const unevenHex = '0x23abc';\n * const result = encode.sanitizeHex(unevenHex);\n * // result = '0x023abc' (padded to ensure even length)\n * ```\n */\nexport function sanitizeHex(hex: string): string {\n hex = removeHexPrefix(hex);\n hex = sanitizeBytes(hex, 2);\n if (hex) {\n hex = addHexPrefix(hex);\n }\n return hex;\n}\n\n/**\n * String transformation util\n *\n * Pascal case to screaming snake case\n *\n * @param {string} text The PascalCase string to convert.\n * @returns {string} The converted snake_case string in uppercase.\n *\n * @example\n * ```typescript\n * const pascalString = 'PascalCaseExample';\n * const result = encode.pascalToSnake(pascalString);\n * // result: 'PASCAL_CASE_EXAMPLE'\n * ```\n */\nexport const pascalToSnake = (text: string) =>\n /[a-z]/.test(text)\n ? text\n .split(/(?=[A-Z])/)\n .join('_')\n .toUpperCase()\n : text;\n","import { bytesToHex } from '@noble/curves/abstract/utils';\nimport { keccak_256 } from '@noble/hashes/sha3';\nimport type { SPEC } from 'starknet-types-07';\n\nimport { RPC06, RPC07, RpcChannel } from '../channel';\nimport {\n AccountInvocations,\n BigNumberish,\n Block,\n BlockIdentifier,\n BlockTag,\n Call,\n ContractClassResponse,\n ContractVersion,\n DeclareContractTransaction,\n DeployAccountContractTransaction,\n GetBlockResponse,\n GetTxReceiptResponseWithoutHelper,\n Invocation,\n InvocationsDetailsWithNonce,\n PendingBlock,\n PendingStateUpdate,\n RPC,\n RpcProviderOptions,\n StateUpdate,\n StateUpdateResponse,\n TransactionType,\n getContractVersionOptions,\n getEstimateFeeBulkOptions,\n getSimulateTransactionOptions,\n waitForTransactionOptions,\n} from '../types';\nimport type { TransactionWithHash } from '../types/provider/spec';\nimport assert from '../utils/assert';\nimport { getAbiContractVersion } from '../utils/calldata/cairo';\nimport { isSierra } from '../utils/contract';\nimport { addHexPrefix, removeHexPrefix } from '../utils/encode';\nimport { hexToBytes, toHex } from '../utils/num';\nimport { wait } from '../utils/provider';\nimport { RPCResponseParser } from '../utils/responseParser/rpc';\nimport { GetTransactionReceiptResponse, ReceiptTx } from '../utils/transactionReceipt';\nimport { LibraryError } from './errors';\nimport { ProviderInterface } from './interface';\n\nexport class RpcProvider implements ProviderInterface {\n public responseParser: RPCResponseParser;\n\n public channel: RPC07.RpcChannel | RPC06.RpcChannel;\n\n constructor(optionsOrProvider?: RpcProviderOptions | ProviderInterface | RpcProvider) {\n if (optionsOrProvider && 'channel' in optionsOrProvider) {\n this.channel = optionsOrProvider.channel;\n this.responseParser =\n 'responseParser' in optionsOrProvider\n ? optionsOrProvider.responseParser\n : new RPCResponseParser();\n } else {\n this.channel = new RpcChannel({ ...optionsOrProvider, waitMode: false });\n this.responseParser = new RPCResponseParser(optionsOrProvider?.feeMarginPercentage);\n }\n }\n\n public fetch(method: string, params?: object, id: string | number = 0) {\n return this.channel.fetch(method, params, id);\n }\n\n public async getChainId() {\n return this.channel.getChainId();\n }\n\n public async getSpecVersion() {\n return this.channel.getSpecVersion();\n }\n\n public async getNonceForAddress(\n contractAddress: BigNumberish,\n blockIdentifier?: BlockIdentifier\n ) {\n return this.channel.getNonceForAddress(contractAddress, blockIdentifier);\n }\n\n public async getBlock(): Promise<PendingBlock>;\n public async getBlock(blockIdentifier: 'pending'): Promise<PendingBlock>;\n public async getBlock(blockIdentifier: 'latest'): Promise<Block>;\n public async getBlock(blockIdentifier?: BlockIdentifier): Promise<GetBlockResponse>;\n public async getBlock(blockIdentifier?: BlockIdentifier) {\n return this.channel\n .getBlockWithTxHashes(blockIdentifier)\n .then(this.responseParser.parseGetBlockResponse);\n }\n\n /**\n * Get the most recent accepted block hash and number\n */\n public async getBlockLatestAccepted() {\n return this.channel.getBlockLatestAccepted();\n }\n\n /**\n * Get the most recent accepted block number\n * redundant use getBlockLatestAccepted();\n * @returns Number of the latest block\n */\n public async getBlockNumber() {\n return this.channel.getBlockNumber();\n }\n\n public async getBlockWithTxHashes(blockIdentifier?: BlockIdentifier) {\n return this.channel.getBlockWithTxHashes(blockIdentifier);\n }\n\n public async getBlockWithTxs(blockIdentifier?: BlockIdentifier) {\n return this.channel.getBlockWithTxs(blockIdentifier);\n }\n\n /**\n * Pause the execution of the script until a specified block is created.\n * @param {BlockIdentifier} blockIdentifier bloc number (BigNumberisk) or 'pending' or 'latest'.\n * Use of 'latest\" or of a block already created will generate no pause.\n * @param {number} [retryInterval] number of milliseconds between 2 requests to the node\n * @example\n * ```typescript\n * await myProvider.waitForBlock();\n * // wait the creation of the pending block\n * ```\n */\n public async waitForBlock(\n blockIdentifier: BlockIdentifier = 'pending',\n retryInterval: number = 5000\n ) {\n if (blockIdentifier === BlockTag.LATEST) return;\n const currentBlock = await this.getBlockNumber();\n const targetBlock =\n blockIdentifier === BlockTag.PENDING\n ? currentBlock + 1\n : Number(toHex(blockIdentifier as BigNumberish));\n if (targetBlock <= currentBlock) return;\n const { retries } = this.channel;\n let retriesCount = retries;\n let isTargetBlock: boolean = false;\n while (!isTargetBlock) {\n // eslint-disable-next-line no-await-in-loop\n const currBlock = await this.getBlockNumber();\n if (currBlock === targetBlock) {\n isTargetBlock = true;\n } else {\n // eslint-disable-next-line no-await-in-loop\n await wait(retryInterval);\n }\n retriesCount -= 1;\n if (retriesCount <= 0) {\n throw new Error(`waitForBlock() timed-out after ${retries} tries.`);\n }\n }\n }\n\n public async getL1GasPrice(blockIdentifier?: BlockIdentifier) {\n return this.channel\n .getBlockWithTxHashes(blockIdentifier)\n .then(this.responseParser.parseL1GasPriceResponse);\n }\n\n public async getL1MessageHash(l2TxHash: BigNumberish) {\n const transaction = (await this.channel.getTransactionByHash(l2TxHash)) as TransactionWithHash;\n assert(transaction.type === 'L1_HANDLER', 'This L2 transaction is not a L1 message.');\n const { calldata, contract_address, entry_point_selector, nonce } =\n transaction as SPEC.L1_HANDLER_TXN;\n const params = [\n calldata[0],\n contract_address,\n nonce,\n entry_point_selector,\n calldata.length - 1,\n ...calldata.slice(1),\n ];\n const myEncode = addHexPrefix(\n params.reduce(\n (res: string, par: BigNumberish) => res + removeHexPrefix(toHex(par)).padStart(64, '0'),\n ''\n )\n );\n return addHexPrefix(bytesToHex(keccak_256(hexToBytes(myEncode))));\n }\n\n public async getBlockWithReceipts(blockIdentifier?: BlockIdentifier) {\n if (this.channel instanceof RPC06.RpcChannel)\n throw new LibraryError('Unsupported method for RPC version');\n\n return this.channel.getBlockWithReceipts(blockIdentifier);\n }\n\n public getStateUpdate = this.getBlockStateUpdate;\n\n public async getBlockStateUpdate(): Promise<PendingStateUpdate>;\n public async getBlockStateUpdate(blockIdentifier: 'pending'): Promise<PendingStateUpdate>;\n public async getBlockStateUpdate(blockIdentifier: 'latest'): Promise<StateUpdate>;\n public async getBlockStateUpdate(blockIdentifier?: BlockIdentifier): Promise<StateUpdateResponse>;\n public async getBlockStateUpdate(blockIdentifier?: BlockIdentifier) {\n return this.channel.getBlockStateUpdate(blockIdentifier);\n }\n\n public async getBlockTransactionsTraces(blockIdentifier?: BlockIdentifier) {\n return this.channel.getBlockTransactionsTraces(blockIdentifier);\n }\n\n public async getBlockTransactionCount(blockIdentifier?: BlockIdentifier) {\n return this.channel.getBlockTransactionCount(blockIdentifier);\n }\n\n /**\n * Return transactions from pending block\n * @deprecated Instead use getBlock(BlockTag.PENDING); (will be removed in next minor version)\n * Utility method, same result can be achieved using getBlockWithTxHashes(BlockTag.pending);\n */\n public async getPendingTransactions() {\n const { transactions } = await this.getBlockWithTxHashes(BlockTag.PENDING).then(\n this.responseParser.parseGetBlockResponse\n );\n return Promise.all(transactions.map((it: any) => this.getTransactionByHash(it)));\n }\n\n public async getTransaction(txHash: BigNumberish) {\n return this.channel.getTransactionByHash(txHash);\n }\n\n public async getTransactionByHash(txHash: BigNumberish) {\n return this.channel.getTransactionByHash(txHash);\n }\n\n public async getTransactionByBlockIdAndIndex(blockIdentifier: BlockIdentifier, index: number) {\n return this.channel.getTransactionByBlockIdAndIndex(blockIdentifier, index);\n }\n\n public async getTransactionReceipt(txHash: BigNumberish): Promise<GetTransactionReceiptResponse> {\n const txReceiptWoHelper = await this.channel.getTransactionReceipt(txHash);\n const txReceiptWoHelperModified: GetTxReceiptResponseWithoutHelper =\n this.responseParser.parseTransactionReceipt(txReceiptWoHelper);\n return new ReceiptTx(txReceiptWoHelperModified) as GetTransactionReceiptResponse;\n }\n\n public async getTransactionTrace(txHash: BigNumberish) {\n return this.channel.getTransactionTrace(txHash);\n }\n\n /**\n * Get the status of a transaction\n */\n public async getTransactionStatus(transactionHash: BigNumberish) {\n return this.channel.getTransactionStatus(transactionHash);\n }\n\n /**\n * @param invocations AccountInvocations\n * @param options blockIdentifier and flags to skip validation and fee charge<br/>\n * - blockIdentifier<br/>\n * - skipValidate (default false)<br/>\n * - skipFeeCharge (default true)<br/>\n */\n public async getSimulateTransaction(\n invocations: AccountInvocations,\n options?: getSimulateTransactionOptions\n ) {\n // can't be named simulateTransaction because of argument conflict with account\n return this.channel\n .simulateTransaction(invocations, options)\n .then((r) => this.responseParser.parseSimulateTransactionResponse(r));\n }\n\n public async waitForTransaction(\n txHash: BigNumberish,\n options?: waitForTransactionOptions\n ): Promise<GetTransactionReceiptResponse> {\n const receiptWoHelper = (await this.channel.waitForTransaction(\n txHash,\n options\n )) as GetTxReceiptResponseWithoutHelper;\n\n return new ReceiptTx(receiptWoHelper) as GetTransactionReceiptResponse;\n }\n\n public async getStorageAt(\n contractAddress: BigNumberish,\n key: BigNumberish,\n blockIdentifier?: BlockIdentifier\n ) {\n return this.channel.getStorageAt(contractAddress, key, blockIdentifier);\n }\n\n public async getClassHashAt(contractAddress: BigNumberish, blockIdentifier?: BlockIdentifier) {\n return this.channel.getClassHashAt(contractAddress, blockIdentifier);\n }\n\n public async getClassByHash(classHash: BigNumberish) {\n return this.getClass(classHash);\n }\n\n public async getClass(classHash: BigNumberish, blockIdentifier?: BlockIdentifier) {\n return this.channel\n .getClass(classHash, blockIdentifier)\n .then(this.responseParser.parseContractClassResponse);\n }\n\n public async getClassAt(contractAddress: BigNumberish, blockIdentifier?: BlockIdentifier) {\n return this.channel\n .getClassAt(contractAddress, blockIdentifier)\n .then(this.responseParser.parseContractClassResponse);\n }\n\n public async getContractVersion(\n contractAddress: BigNumberish,\n classHash?: undefined,\n options?: getContractVersionOptions\n ): Promise<ContractVersion>;\n public async getContractVersion(\n contractAddress: undefined,\n classHash: BigNumberish,\n options?: getContractVersionOptions\n ): Promise<ContractVersion>;\n\n public async getContractVersion(\n contractAddress?: BigNumberish,\n classHash?: BigNumberish,\n {\n blockIdentifier = this.channel.blockIdentifier,\n compiler = true,\n }: getContractVersionOptions = {}\n ): Promise<ContractVersion> {\n let contractClass: ContractClassResponse;\n if (contractAddress) {\n contractClass = await this.getClassAt(contractAddress, blockIdentifier);\n } else if (classHash) {\n contractClass = await this.getClass(classHash, blockIdentifier);\n } else {\n throw Error('getContractVersion require contractAddress or classHash');\n }\n\n if (isSierra(contractClass)) {\n if (compiler) {\n const abiTest = getAbiContractVersion(contractClass.abi);\n return { cairo: '1', compiler: abiTest.compiler };\n }\n return { cairo: '1', compiler: undefined };\n }\n return { cairo: '0', compiler: '0' };\n }\n\n /**\n * @deprecated use get*type*EstimateFee (will be refactored based on type after sequencer deprecation)\n */\n public async getEstimateFee(\n invocation: Invocation,\n invocationDetails: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ) {\n return this.getInvokeEstimateFee(invocation, invocationDetails, blockIdentifier, skipValidate);\n }\n\n public async getInvokeEstimateFee(\n invocation: Invocation,\n invocationDetails: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ) {\n return this.channel\n .getEstimateFee(\n [\n {\n type: TransactionType.INVOKE,\n ...invocation,\n ...invocationDetails,\n },\n ],\n { blockIdentifier, skipValidate }\n )\n .then((r) => this.responseParser.parseFeeEstimateResponse(r));\n }\n\n public async getDeclareEstimateFee(\n invocation: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ) {\n return this.channel\n .getEstimateFee(\n [\n {\n type: TransactionType.DECLARE,\n ...invocation,\n ...details,\n },\n ],\n { blockIdentifier, skipValidate }\n )\n .then((r) => this.responseParser.parseFeeEstimateResponse(r));\n }\n\n public async getDeployAccountEstimateFee(\n invocation: DeployAccountContractTransaction,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ) {\n return this.channel\n .getEstimateFee(\n [\n {\n type: TransactionType.DEPLOY_ACCOUNT,\n ...invocation,\n ...details,\n },\n ],\n { blockIdentifier, skipValidate }\n )\n .then((r) => this.responseParser.parseFeeEstimateResponse(r));\n }\n\n public async getEstimateFeeBulk(\n invocations: AccountInvocations,\n options: getEstimateFeeBulkOptions\n ) {\n return this.channel\n .getEstimateFee(invocations, options)\n .then((r) => this.responseParser.parseFeeEstimateBulkResponse(r));\n }\n\n public async invokeFunction(\n functionInvocation: Invocation,\n details: InvocationsDetailsWithNonce\n ) {\n return this.channel.invoke(functionInvocation, details) as Promise<RPC.InvokedTransaction>;\n }\n\n public async declareContract(\n transaction: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n return this.channel.declare(transaction, details) as Promise<RPC.DeclaredTransaction>;\n }\n\n public async deployAccountContract(\n transaction: DeployAccountContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n return this.channel.deployAccount(\n transaction,\n details\n ) as Promise<RPC.DeployedAccountTransaction>;\n }\n\n public async callContract(call: Call, blockIdentifier?: BlockIdentifier) {\n return this.channel.callContract(call, blockIdentifier);\n }\n\n /**\n * NEW: Estimate the fee for a message from L1\n * @param message Message From L1\n */\n public async estimateMessageFee(message: RPC.L1Message, blockIdentifier?: BlockIdentifier) {\n return this.channel.estimateMessageFee(message, blockIdentifier);\n }\n\n /**\n * Returns an object about the sync status, or false if the node is not synching\n * @returns Object with the stats data\n */\n public async getSyncingStats() {\n return this.channel.getSyncingStats();\n }\n\n /**\n * Returns all events matching the given filter\n * @returns events and the pagination of the events\n */\n public async getEvents(eventFilter: RPC.EventFilter) {\n return this.channel.getEvents(eventFilter);\n }\n}\n","import { NetworkName, StarknetChainId } from '../constants';\nimport { LibraryError } from '../provider/errors';\nimport {\n AccountInvocationItem,\n AccountInvocations,\n BigNumberish,\n BlockIdentifier,\n BlockTag,\n Call,\n DeclareContractTransaction,\n DeployAccountContractTransaction,\n Invocation,\n InvocationsDetailsWithNonce,\n RpcProviderOptions,\n TransactionType,\n getEstimateFeeBulkOptions,\n getSimulateTransactionOptions,\n waitForTransactionOptions,\n} from '../types';\nimport { JRPC, RPCSPEC06 as RPC } from '../types/api';\nimport { CallData } from '../utils/calldata';\nimport { isSierra } from '../utils/contract';\nimport { validateAndParseEthAddress } from '../utils/eth';\nimport fetch from '../utils/fetchPonyfill';\nimport { getSelector, getSelectorFromName } from '../utils/hash';\nimport { stringify } from '../utils/json';\nimport { getHexStringArray, toHex, toStorageKey } from '../utils/num';\nimport { Block, getDefaultNodeUrl, isV3Tx, isVersion, wait } from '../utils/provider';\nimport { decompressProgram, signatureToHexArray } from '../utils/stark';\nimport { getVersionsByType } from '../utils/transaction';\n\nconst defaultOptions = {\n headers: { 'Content-Type': 'application/json' },\n blockIdentifier: BlockTag.PENDING,\n retries: 200,\n};\n\nexport class RpcChannel {\n public nodeUrl: string;\n\n public headers: object;\n\n readonly retries: number;\n\n public requestId: number;\n\n readonly blockIdentifier: BlockIdentifier;\n\n private chainId?: StarknetChainId;\n\n private specVersion?: string;\n\n readonly waitMode: Boolean; // behave like web2 rpc and return when tx is processed\n\n constructor(optionsOrProvider?: RpcProviderOptions) {\n const { nodeUrl, retries, headers, blockIdentifier, chainId, specVersion, waitMode } =\n optionsOrProvider || {};\n if (Object.values(NetworkName).includes(nodeUrl as NetworkName)) {\n this.nodeUrl = getDefaultNodeUrl(nodeUrl as NetworkName, optionsOrProvider?.default);\n } else if (nodeUrl) {\n this.nodeUrl = nodeUrl;\n } else {\n this.nodeUrl = getDefaultNodeUrl(undefined, optionsOrProvider?.default);\n }\n this.retries = retries || defaultOptions.retries;\n this.headers = { ...defaultOptions.headers, ...headers };\n this.blockIdentifier = blockIdentifier || defaultOptions.blockIdentifier;\n this.chainId = chainId;\n this.specVersion = specVersion;\n this.waitMode = waitMode || false;\n this.requestId = 0;\n }\n\n public setChainId(chainId: StarknetChainId) {\n this.chainId = chainId;\n }\n\n public fetch(method: string, params?: object, id: string | number = 0) {\n const rpcRequestBody: JRPC.RequestBody = {\n id,\n jsonrpc: '2.0',\n method,\n ...(params && { params }),\n };\n return fetch(this.nodeUrl, {\n method: 'POST',\n body: stringify(rpcRequestBody),\n headers: this.headers as Record<string, string>,\n });\n }\n\n protected errorHandler(method: string, params: any, rpcError?: JRPC.Error, otherError?: any) {\n if (rpcError) {\n const { code, message, data } = rpcError;\n throw new LibraryError(\n `RPC: ${method} with params ${stringify(params, null, 2)}\\n\n ${code}: ${message}: ${stringify(data)}`\n );\n }\n if (otherError instanceof LibraryError) {\n throw otherError;\n }\n if (otherError) {\n throw Error(otherError.message);\n }\n }\n\n protected async fetchEndpoint<T extends keyof RPC.Methods>(\n method: T,\n params?: RPC.Methods[T]['params']\n ): Promise<RPC.Methods[T]['result']> {\n try {\n const rawResult = await this.fetch(method, params, (this.requestId += 1));\n const { error, result } = await rawResult.json();\n this.errorHandler(method, params, error);\n return result as RPC.Methods[T]['result'];\n } catch (error: any) {\n this.errorHandler(method, params, error?.response?.data, error);\n throw error;\n }\n }\n\n public async getChainId() {\n this.chainId ??= (await this.fetchEndpoint('starknet_chainId')) as StarknetChainId;\n return this.chainId;\n }\n\n public async getSpecVersion() {\n this.specVersion ??= (await this.fetchEndpoint('starknet_specVersion')) as StarknetChainId;\n return this.specVersion;\n }\n\n public getNonceForAddress(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getNonce', {\n contract_address,\n block_id,\n });\n }\n\n /**\n * Get the most recent accepted block hash and number\n */\n public getBlockLatestAccepted() {\n return this.fetchEndpoint('starknet_blockHashAndNumber');\n }\n\n /**\n * Get the most recent accepted block number\n * redundant use getBlockLatestAccepted();\n * @returns Number of the latest block\n */\n public getBlockNumber() {\n return this.fetchEndpoint('starknet_blockNumber');\n }\n\n public getBlockWithTxHashes(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockWithTxHashes', { block_id });\n }\n\n public getBlockWithTxs(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockWithTxs', { block_id });\n }\n\n public getBlockStateUpdate(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getStateUpdate', { block_id });\n }\n\n public getBlockTransactionsTraces(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_traceBlockTransactions', { block_id });\n }\n\n public getBlockTransactionCount(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockTransactionCount', { block_id });\n }\n\n public getTransactionByHash(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_getTransactionByHash', {\n transaction_hash,\n });\n }\n\n public getTransactionByBlockIdAndIndex(blockIdentifier: BlockIdentifier, index: number) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getTransactionByBlockIdAndIndex', { block_id, index });\n }\n\n public getTransactionReceipt(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_getTransactionReceipt', { transaction_hash });\n }\n\n public getTransactionTrace(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_traceTransaction', { transaction_hash });\n }\n\n /**\n * Get the status of a transaction\n */\n public getTransactionStatus(transactionHash: BigNumberish) {\n const transaction_hash = toHex(transactionHash);\n return this.fetchEndpoint('starknet_getTransactionStatus', { transaction_hash });\n }\n\n /**\n * @param invocations AccountInvocations\n * @param simulateTransactionOptions blockIdentifier and flags to skip validation and fee charge<br/>\n * - blockIdentifier<br/>\n * - skipValidate (default false)<br/>\n * - skipFeeCharge (default true)<br/>\n */\n public simulateTransaction(\n invocations: AccountInvocations,\n simulateTransactionOptions: getSimulateTransactionOptions = {}\n ) {\n const {\n blockIdentifier = this.blockIdentifier,\n skipValidate = true,\n skipFeeCharge = true,\n } = simulateTransactionOptions;\n const block_id = new Block(blockIdentifier).identifier;\n const simulationFlags: RPC.ESimulationFlag[] = [];\n if (skipValidate) simulationFlags.push(RPC.ESimulationFlag.SKIP_VALIDATE);\n if (skipFeeCharge) simulationFlags.push(RPC.ESimulationFlag.SKIP_FEE_CHARGE);\n\n return this.fetchEndpoint('starknet_simulateTransactions', {\n block_id,\n transactions: invocations.map((it) => this.buildTransaction(it)),\n simulation_flags: simulationFlags,\n });\n }\n\n public async waitForTransaction(txHash: BigNumberish, options?: waitForTransactionOptions) {\n const transactionHash = toHex(txHash);\n let { retries } = this;\n let onchain = false;\n let isErrorState = false;\n const retryInterval = options?.retryInterval ?? 5000;\n const errorStates: any = options?.errorStates ?? [\n RPC.ETransactionStatus.REJECTED,\n // TODO: commented out to preserve the long-standing behavior of \"reverted\" not being treated as an error by default\n // should decide which behavior to keep in the future\n // RPC.ETransactionExecutionStatus.REVERTED,\n ];\n const successStates: any = options?.successStates ?? [\n RPC.ETransactionExecutionStatus.SUCCEEDED,\n RPC.ETransactionStatus.ACCEPTED_ON_L2,\n RPC.ETransactionStatus.ACCEPTED_ON_L1,\n ];\n\n let txStatus: RPC.TransactionStatus;\n while (!onchain) {\n // eslint-disable-next-line no-await-in-loop\n await wait(retryInterval);\n try {\n // eslint-disable-next-line no-await-in-loop\n txStatus = await this.getTransactionStatus(transactionHash);\n\n const executionStatus = txStatus.execution_status;\n const finalityStatus = txStatus.finality_status;\n\n if (!finalityStatus) {\n // Transaction is potentially NOT_RECEIVED or RPC not Synced yet\n // so we will retry '{ retries }' times\n const error = new Error('waiting for transaction status');\n throw error;\n }\n\n if (errorStates.includes(executionStatus) || errorStates.includes(finalityStatus)) {\n const message = `${executionStatus}: ${finalityStatus}`;\n const error = new Error(message) as Error & { response: RPC.TransactionStatus };\n error.response = txStatus;\n isErrorState = true;\n throw error;\n } else if (\n successStates.includes(executionStatus) ||\n successStates.includes(finalityStatus)\n ) {\n onchain = true;\n }\n } catch (error) {\n if (error instanceof Error && isErrorState) {\n throw error;\n }\n\n if (retries <= 0) {\n throw new Error(`waitForTransaction timed-out with retries ${this.retries}`);\n }\n }\n\n retries -= 1;\n }\n\n /**\n * For some nodes even though the transaction has executionStatus SUCCEEDED finalityStatus ACCEPTED_ON_L2, getTransactionReceipt returns \"Transaction hash not found\"\n * Retry until rpc is actually ready to work with txHash\n */\n let txReceipt = null;\n while (txReceipt === null) {\n try {\n // eslint-disable-next-line no-await-in-loop\n txReceipt = await this.getTransactionReceipt(transactionHash);\n } catch (error) {\n if (retries <= 0) {\n throw new Error(`waitForTransaction timed-out with retries ${this.retries}`);\n }\n }\n retries -= 1;\n // eslint-disable-next-line no-await-in-loop\n await wait(retryInterval);\n }\n return txReceipt as RPC.SPEC.TXN_RECEIPT;\n }\n\n public getStorageAt(\n contractAddress: BigNumberish,\n key: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const parsedKey = toStorageKey(key);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getStorageAt', {\n contract_address,\n key: parsedKey,\n block_id,\n });\n }\n\n public getClassHashAt(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClassHashAt', {\n block_id,\n contract_address,\n });\n }\n\n public getClass(\n classHash: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const class_hash = toHex(classHash);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClass', {\n class_hash,\n block_id,\n });\n }\n\n public getClassAt(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClassAt', {\n block_id,\n contract_address,\n });\n }\n\n public async getEstimateFee(\n invocations: AccountInvocations,\n { blockIdentifier = this.blockIdentifier, skipValidate = true }: getEstimateFeeBulkOptions\n ) {\n const block_id = new Block(blockIdentifier).identifier;\n let flags = {};\n if (!isVersion('0.5', await this.getSpecVersion())) {\n flags = {\n simulation_flags: skipValidate ? [RPC.ESimulationFlag.SKIP_VALIDATE] : [],\n };\n } // else v(0.5) no flags\n\n return this.fetchEndpoint('starknet_estimateFee', {\n request: invocations.map((it) => this.buildTransaction(it, 'fee')),\n block_id,\n ...flags,\n });\n }\n\n public async invoke(functionInvocation: Invocation, details: InvocationsDetailsWithNonce) {\n let promise;\n if (!isV3Tx(details)) {\n // V1\n promise = this.fetchEndpoint('starknet_addInvokeTransaction', {\n invoke_transaction: {\n sender_address: functionInvocation.contractAddress,\n calldata: CallData.toHex(functionInvocation.calldata),\n type: RPC.ETransactionType.INVOKE,\n max_fee: toHex(details.maxFee || 0),\n version: RPC.ETransactionVersion.V1,\n signature: signatureToHexArray(functionInvocation.signature),\n nonce: toHex(details.nonce),\n },\n });\n } else {\n // V3\n promise = this.fetchEndpoint('starknet_addInvokeTransaction', {\n invoke_transaction: {\n type: RPC.ETransactionType.INVOKE,\n sender_address: functionInvocation.contractAddress,\n calldata: CallData.toHex(functionInvocation.calldata),\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(functionInvocation.signature),\n nonce: toHex(details.nonce),\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n account_deployment_data: details.accountDeploymentData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public async declare(\n { contract, signature, senderAddress, compiledClassHash }: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n let promise;\n if (!isSierra(contract) && !isV3Tx(details)) {\n // V1 Cairo 0\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n contract_class: {\n program: contract.program,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n version: RPC.ETransactionVersion.V1,\n max_fee: toHex(details.maxFee || 0),\n signature: signatureToHexArray(signature),\n sender_address: senderAddress,\n nonce: toHex(details.nonce),\n },\n });\n } else if (isSierra(contract) && !isV3Tx(details)) {\n // V2 Cairo1\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n contract_class: {\n sierra_program: decompressProgram(contract.sierra_program),\n contract_class_version: contract.contract_class_version,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n compiled_class_hash: compiledClassHash || '',\n version: RPC.ETransactionVersion.V2,\n max_fee: toHex(details.maxFee || 0),\n signature: signatureToHexArray(signature),\n sender_address: senderAddress,\n nonce: toHex(details.nonce),\n },\n });\n } else if (isSierra(contract) && isV3Tx(details)) {\n // V3 Cairo1\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n sender_address: senderAddress,\n compiled_class_hash: compiledClassHash || '',\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n contract_class: {\n sierra_program: decompressProgram(contract.sierra_program),\n contract_class_version: contract.contract_class_version,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n account_deployment_data: details.accountDeploymentData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n } else {\n throw Error('declare unspotted parameters');\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public async deployAccount(\n { classHash, constructorCalldata, addressSalt, signature }: DeployAccountContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n let promise;\n if (!isV3Tx(details)) {\n // v1\n promise = this.fetchEndpoint('starknet_addDeployAccountTransaction', {\n deploy_account_transaction: {\n constructor_calldata: CallData.toHex(constructorCalldata || []),\n class_hash: toHex(classHash),\n contract_address_salt: toHex(addressSalt || 0),\n type: RPC.ETransactionType.DEPLOY_ACCOUNT,\n max_fee: toHex(details.maxFee || 0),\n version: RPC.ETransactionVersion.V1,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n },\n });\n } else {\n // v3\n promise = this.fetchEndpoint('starknet_addDeployAccountTransaction', {\n deploy_account_transaction: {\n type: RPC.ETransactionType.DEPLOY_ACCOUNT,\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n contract_address_salt: toHex(addressSalt || 0),\n constructor_calldata: CallData.toHex(constructorCalldata || []),\n class_hash: toHex(classHash),\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public callContract(call: Call, blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_call', {\n request: {\n contract_address: call.contractAddress,\n entry_point_selector: getSelectorFromName(call.entrypoint),\n calldata: CallData.toHex(call.calldata),\n },\n block_id,\n });\n }\n\n /**\n * NEW: Estimate the fee for a message from L1\n * @param message Message From L1\n */\n public estimateMessageFee(\n message: RPC.L1Message,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const { from_address, to_address, entry_point_selector, payload } = message;\n const formattedMessage = {\n from_address: validateAndParseEthAddress(from_address),\n to_address: toHex(to_address),\n entry_point_selector: getSelector(entry_point_selector),\n payload: getHexStringArray(payload),\n };\n\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_estimateMessageFee', {\n message: formattedMessage,\n block_id,\n });\n }\n\n /**\n * Returns an object about the sync status, or false if the node is not synching\n * @returns Object with the stats data\n */\n public getSyncingStats() {\n return this.fetchEndpoint('starknet_syncing');\n }\n\n /**\n * Returns all events matching the given filter\n * @returns events and the pagination of the events\n */\n public getEvents(eventFilter: RPC.EventFilter) {\n return this.fetchEndpoint('starknet_getEvents', { filter: eventFilter });\n }\n\n public buildTransaction(\n invocation: AccountInvocationItem,\n versionType?: 'fee' | 'transaction'\n ): RPC.BaseTransaction {\n const defaultVersions = getVersionsByType(versionType);\n let details;\n\n if (!isV3Tx(invocation)) {\n // V0,V1,V2\n details = {\n signature: signatureToHexArray(invocation.signature),\n nonce: toHex(invocation.nonce),\n max_fee: toHex(invocation.maxFee || 0),\n };\n } else {\n // V3\n details = {\n signature: signatureToHexArray(invocation.signature),\n nonce: toHex(invocation.nonce),\n resource_bounds: invocation.resourceBounds,\n tip: toHex(invocation.tip),\n paymaster_data: invocation.paymasterData.map((it) => toHex(it)),\n nonce_data_availability_mode: invocation.nonceDataAvailabilityMode,\n fee_data_availability_mode: invocation.feeDataAvailabilityMode,\n account_deployment_data: invocation.accountDeploymentData.map((it) => toHex(it)),\n };\n }\n\n if (invocation.type === TransactionType.INVOKE) {\n return {\n // v0 v1 v3\n type: RPC.ETransactionType.INVOKE,\n sender_address: invocation.contractAddress,\n calldata: CallData.toHex(invocation.calldata),\n version: toHex(invocation.version || defaultVersions.v3),\n ...details,\n } as RPC.SPEC.BROADCASTED_INVOKE_TXN;\n }\n if (invocation.type === TransactionType.DECLARE) {\n if (!isSierra(invocation.contract)) {\n // Cairo 0 - v1\n return {\n type: invocation.type,\n contract_class: invocation.contract,\n sender_address: invocation.senderAddress,\n version: toHex(invocation.version || defaultVersions.v1),\n ...details,\n } as RPC.SPEC.BROADCASTED_DECLARE_TXN_V1;\n }\n return {\n // Cairo 1 - v2 v3\n type: invocation.type,\n contract_class: {\n ...invocation.contract,\n sierra_program: decompressProgram(invocation.contract.sierra_program),\n },\n compiled_class_hash: invocation.compiledClassHash || '',\n sender_address: invocation.senderAddress,\n version: toHex(invocation.version || defaultVersions.v3),\n ...details,\n } as RPC.SPEC.BROADCASTED_DECLARE_TXN;\n }\n if (invocation.type === TransactionType.DEPLOY_ACCOUNT) {\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n const { account_deployment_data, ...restDetails } = details;\n // v1 v3\n return {\n type: invocation.type,\n constructor_calldata: CallData.toHex(invocation.constructorCalldata || []),\n class_hash: toHex(invocation.classHash),\n contract_address_salt: toHex(invocation.addressSalt || 0),\n version: toHex(invocation.version || defaultVersions.v3) as RPC.SPEC.INVOKE_TXN['version'],\n ...restDetails,\n } as RPC.SPEC.BROADCASTED_DEPLOY_ACCOUNT_TXN;\n }\n throw Error('RPC buildTransaction received unknown TransactionType');\n }\n}\n","// eslint-disable-next-line max-classes-per-file\nexport function fixStack(target: Error, fn: Function = target.constructor) {\n const { captureStackTrace } = Error as any;\n // eslint-disable-next-line @typescript-eslint/no-unused-expressions\n captureStackTrace && captureStackTrace(target, fn);\n}\n\nexport function fixProto(target: Error, prototype: {}) {\n const { setPrototypeOf } = Object as any;\n // eslint-disable-next-line @typescript-eslint/no-unused-expressions, no-proto, no-param-reassign\n setPrototypeOf ? setPrototypeOf(target, prototype) : ((target as any).__proto__ = prototype);\n}\n\n/* eslint-disable max-classes-per-file */\nexport class CustomError extends Error {\n name!: string;\n\n constructor(message?: string) {\n super(message);\n // set error name as constructor name, make it not enumerable to keep native Error behavior\n // see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/new.target#new.target_in_constructors\n // see https://github.com/adriengibrat/ts-custom-error/issues/30\n Object.defineProperty(this, 'name', {\n value: new.target.name,\n enumerable: false,\n configurable: true,\n });\n // fix the extended error prototype chain\n // because typescript __extends implementation can't\n // see https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n fixProto(this, new.target.prototype);\n // try to remove constructor from stack trace\n fixStack(this);\n }\n}\n\nexport class LibraryError extends CustomError {}\n\nexport class GatewayError extends LibraryError {\n constructor(\n message: string,\n public errorCode: string\n ) {\n super(message);\n }\n}\n\nexport class HttpError extends LibraryError {\n constructor(\n message: string,\n public errorCode: number\n ) {\n super(message);\n }\n}\n","export * from './account';\nexport * from './calldata';\nexport * from './contract';\nexport * from './lib';\nexport * from './provider';\nexport * from './signer';\nexport * from './typedData';\nexport * from './cairoEnum';\nexport * from './transactionReceipt';\n\nexport * as RPC from './api';\n","export enum ValidateType {\n DEPLOY = 'DEPLOY',\n CALL = 'CALL',\n INVOKE = 'INVOKE',\n}\n\nexport enum Uint {\n u8 = 'core::integer::u8',\n u16 = 'core::integer::u16',\n u32 = 'core::integer::u32',\n u64 = 'core::integer::u64',\n u128 = 'core::integer::u128',\n u256 = 'core::integer::u256', // This one is struct\n u512 = 'core::integer::u512', // This one is struct\n}\n\nexport enum Literal {\n ClassHash = 'core::starknet::class_hash::ClassHash',\n ContractAddress = 'core::starknet::contract_address::ContractAddress',\n Secp256k1Point = 'core::starknet::secp256k1::Secp256k1Point',\n}\n","import { LegacyCompiledContract, LegacyContractClass } from './legacy';\nimport { CompiledSierra, SierraContractClass } from './sierra';\n\n// Final types\n/**\n * format produced after compressing compiled contract\n *\n * CompressedCompiledContract\n */\nexport type ContractClass = LegacyContractClass | SierraContractClass;\n\n/**\n * format produced after compile .cairo to .json\n */\nexport type CompiledContract = LegacyCompiledContract | CompiledSierra;\n\n/**\n * Compressed or decompressed Cairo0 or Cairo1 Contract\n */\nexport type CairoContract = ContractClass | CompiledContract;\n\n// Basic elements\nexport enum EntryPointType {\n EXTERNAL = 'EXTERNAL',\n L1_HANDLER = 'L1_HANDLER',\n CONSTRUCTOR = 'CONSTRUCTOR',\n}\n\nexport * from './abi';\nexport * from './legacy';\nexport * from './sierra';\n","import { StarknetChainId } from '../../constants';\nimport { weierstrass } from '../../utils/ec';\nimport { EDataAvailabilityMode, ResourceBounds } from '../api';\nimport { CairoEnum } from '../cairoEnum';\nimport { CompiledContract, CompiledSierraCasm, ContractClass } from './contract';\n\nexport type WeierstrassSignatureType = weierstrass.SignatureType;\nexport type ArraySignatureType = string[];\nexport type Signature = ArraySignatureType | WeierstrassSignatureType;\n\nexport type BigNumberish = string | number | bigint;\n\nexport type ByteArray = {\n data: BigNumberish[];\n pending_word: BigNumberish;\n pending_word_len: BigNumberish;\n};\n\n/**\n * Compiled calldata ready to be sent\n *\n * decimal-string array\n */\nexport type Calldata = string[] & { readonly __compiled__?: true };\n\n/**\n * Represents an integer in the range [0, 2^256)\n */\nexport interface Uint256 {\n // The low 128 bits of the value\n low: BigNumberish;\n // The high 128 bits of the value\n high: BigNumberish;\n}\n\n/**\n * Represents an integer in the range [0, 2^256)\n */\nexport interface Uint512 {\n // The lowest 128 bits of the value\n limb0: BigNumberish;\n limb1: BigNumberish;\n limb2: BigNumberish;\n // The higher 128 bits of the value\n limb3: BigNumberish;\n}\n\n/**\n * BigNumberish array\n *\n * use CallData.compile() to convert to Calldata\n */\nexport type RawCalldata = BigNumberish[];\n\n/**\n * Hexadecimal-string array\n */\nexport type HexCalldata = string[];\n\nexport type AllowArray<T> = T | T[];\n\nexport type OptionalPayload<T> = { payload: T } | T;\n\nexport type RawArgs = RawArgsObject | RawArgsArray;\n\nexport type RawArgsObject = {\n [inputName: string]: MultiType | MultiType[] | RawArgs;\n};\n\nexport type RawArgsArray = Array<MultiType | MultiType[] | RawArgs>;\n\nexport type MultiType = BigNumberish | Uint256 | object | boolean | CairoEnum;\n\nexport type UniversalDeployerContractPayload = {\n classHash: BigNumberish;\n salt?: string;\n unique?: boolean;\n constructorCalldata?: RawArgs;\n};\n\nexport type DeployAccountContractPayload = {\n classHash: string;\n constructorCalldata?: RawArgs;\n addressSalt?: BigNumberish;\n contractAddress?: string;\n};\n\nexport type DeployAccountContractTransaction = Omit<\n DeployAccountContractPayload,\n 'contractAddress'\n> & {\n signature?: Signature;\n};\n\nexport type DeclareContractPayload = {\n contract: CompiledContract | string;\n classHash?: string;\n casm?: CompiledSierraCasm;\n compiledClassHash?: string;\n};\n\nexport type CompleteDeclareContractPayload = {\n contract: CompiledContract | string;\n classHash: string;\n casm?: CompiledSierraCasm;\n compiledClassHash?: string;\n};\n\nexport type DeclareAndDeployContractPayload = Omit<UniversalDeployerContractPayload, 'classHash'> &\n DeclareContractPayload;\n\nexport type DeclareContractTransaction = {\n contract: ContractClass;\n senderAddress: string;\n signature?: Signature;\n compiledClassHash?: string;\n};\n\nexport type CallDetails = {\n contractAddress: string;\n calldata?: RawArgs | Calldata;\n entrypoint?: string;\n};\n\nexport type Invocation = CallDetails & { signature?: Signature };\n\nexport type Call = CallDetails & { entrypoint: string };\n\nexport type CairoVersion = '0' | '1' | undefined;\nexport type CompilerVersion = '0' | '1' | '2' | undefined;\n\nexport type InvocationsDetails = {\n nonce?: BigNumberish;\n maxFee?: BigNumberish;\n version?: BigNumberish;\n} & Partial<V3TransactionDetails>;\n\nexport type V3TransactionDetails = {\n nonce: BigNumberish;\n version: BigNumberish;\n resourceBounds: ResourceBounds;\n tip: BigNumberish;\n paymasterData: BigNumberish[];\n accountDeploymentData: BigNumberish[];\n nonceDataAvailabilityMode: EDataAvailabilityMode;\n feeDataAvailabilityMode: EDataAvailabilityMode;\n};\n\n/**\n * Contain all additional details params\n */\nexport type Details = {\n nonce: BigNumberish;\n maxFee: BigNumberish;\n version: BigNumberish;\n chainId: StarknetChainId;\n};\n\nexport type InvocationsDetailsWithNonce =\n | (InvocationsDetails & { nonce: BigNumberish })\n | V3TransactionDetails;\n\nexport enum TransactionType {\n DECLARE = 'DECLARE',\n DEPLOY = 'DEPLOY',\n DEPLOY_ACCOUNT = 'DEPLOY_ACCOUNT',\n INVOKE = 'INVOKE_FUNCTION',\n}\n\n/**\n * new statuses are defined by props: finality_status and execution_status\n * to be #deprecated\n */\nexport enum TransactionStatus {\n NOT_RECEIVED = 'NOT_RECEIVED',\n RECEIVED = 'RECEIVED',\n ACCEPTED_ON_L2 = 'ACCEPTED_ON_L2',\n ACCEPTED_ON_L1 = 'ACCEPTED_ON_L1',\n REJECTED = 'REJECTED',\n REVERTED = 'REVERTED',\n}\n\nexport enum TransactionFinalityStatus {\n NOT_RECEIVED = 'NOT_RECEIVED',\n RECEIVED = 'RECEIVED',\n ACCEPTED_ON_L2 = 'ACCEPTED_ON_L2',\n ACCEPTED_ON_L1 = 'ACCEPTED_ON_L1',\n}\n\nexport enum TransactionExecutionStatus {\n REJECTED = 'REJECTED',\n REVERTED = 'REVERTED',\n SUCCEEDED = 'SUCCEEDED',\n}\n\nexport enum BlockStatus {\n PENDING = 'PENDING',\n ACCEPTED_ON_L1 = 'ACCEPTED_ON_L1',\n ACCEPTED_ON_L2 = 'ACCEPTED_ON_L2',\n REJECTED = 'REJECTED',\n}\n\nexport enum BlockTag {\n PENDING = 'pending',\n LATEST = 'latest',\n}\n\nexport type BlockNumber = BlockTag | null | number;\n\n/**\n * hex string and BigInt are detected as block hashes\n *\n * decimal string and number are detected as block numbers\n *\n * text string are detected as block tag\n *\n * null return 'pending' block tag\n */\nexport type BlockIdentifier = BlockNumber | BigNumberish;\n\n/**\n * items used by AccountInvocations\n */\nexport type AccountInvocationItem = (\n | ({ type: typeof TransactionType.DECLARE } & DeclareContractTransaction)\n | ({ type: typeof TransactionType.DEPLOY_ACCOUNT } & DeployAccountContractTransaction)\n | ({ type: typeof TransactionType.INVOKE } & Invocation)\n) &\n InvocationsDetailsWithNonce;\n\n/**\n * Complete invocations array with account details (internal type from account -> provider)\n */\nexport type AccountInvocations = AccountInvocationItem[];\n\n/**\n * Invocations array user provide to bulk method (simulate)\n */\nexport type Invocations = Array<\n | ({ type: typeof TransactionType.DECLARE } & OptionalPayload<DeclareContractPayload>)\n | ({ type: typeof TransactionType.DEPLOY } & OptionalPayload<\n AllowArray<UniversalDeployerContractPayload>\n >)\n | ({\n type: typeof TransactionType.DEPLOY_ACCOUNT;\n } & OptionalPayload<DeployAccountContractPayload>)\n | ({ type: typeof TransactionType.INVOKE } & OptionalPayload<AllowArray<Call>>)\n>;\n\nexport type Tupled = { element: any; type: string };\n\nexport type Args = {\n [inputName: string]: BigNumberish | BigNumberish[] | ParsedStruct | ParsedStruct[];\n};\nexport type ParsedStruct = {\n [key: string]: BigNumberish | BigNumberish[] | ParsedStruct | Uint256;\n};\n\nexport type waitForTransactionOptions = {\n retryInterval?: number;\n successStates?: Array<TransactionFinalityStatus | TransactionExecutionStatus>;\n errorStates?: Array<TransactionFinalityStatus | TransactionExecutionStatus>;\n};\n\nexport type getSimulateTransactionOptions = {\n blockIdentifier?: BlockIdentifier;\n skipValidate?: boolean;\n skipExecute?: boolean;\n skipFeeCharge?: boolean;\n};\n\nexport type getContractVersionOptions = {\n blockIdentifier?: BlockIdentifier;\n compiler?: boolean;\n};\n\nexport type getEstimateFeeBulkOptions = {\n blockIdentifier?: BlockIdentifier;\n skipValidate?: boolean;\n};\n\nexport interface CallStruct {\n to: string;\n selector: string;\n calldata: string[];\n}\n\n/**\n * Represent Contract version\n */\nexport type ContractVersion = {\n /** version of the cairo language */\n cairo: CairoVersion;\n /** version of the cairo compiler used to compile the contract */\n compiler: CompilerVersion;\n};\n\nexport * from './contract';\n","// Reexport types from package\nexport {\n TypedDataRevision,\n type StarknetEnumType,\n type StarknetMerkleType,\n type StarknetType,\n type StarknetDomain,\n type TypedData,\n} from 'starknet-types-07';\n","/**\n * Asserts that the given condition is true, otherwise throws an error with an optional message.\n * @param {any} condition - The condition to check.\n * @param {string} [message] - The optional message to include in the error.\n * @throws {Error} Throws an error if the condition is false.\n * @example\n * ```typescript\n * const address = '0xa7ee790591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf';\n * assert(/^(0x)?[0-9a-fA-F]{64}$/.test(address), 'Invalid address format');\n * ```\n */\nexport default function assert(condition: boolean, message?: string): asserts condition {\n if (!condition) {\n throw new Error(message || 'Assertion failure');\n }\n}\n","import { hexToBytes as hexToBytesNoble } from '@noble/curves/abstract/utils';\n\nimport { BigNumberish } from '../types';\nimport assert from './assert';\nimport { addHexPrefix, removeHexPrefix } from './encode';\n\n/** @deprecated prefer importing from 'types' over 'num' */\nexport type { BigNumberish };\n\n/**\n * Test if string is hex-string\n *\n * @param hex hex-string\n * @returns {boolean} true if the input string is a hexadecimal string, false otherwise\n * @example\n * ```typescript\n * const hexString1 = \"0x2fd23d9182193775423497fc0c472e156c57c69e4089a1967fb288a2d84e914\";\n * const result1 = isHex(hexString1);\n * // result1 = true\n *\n * const hexString2 = \"2fd23d9182193775423497fc0c472e156c57c69e4089a1967fb288a2d84e914\";\n * const result2 = isHex(hexString2);\n * // result2 = false\n * ```\n */\nexport function isHex(hex: string): boolean {\n return /^0x[0-9a-f]*$/i.test(hex);\n}\n\n/**\n * Convert BigNumberish to bigint\n *\n * @param {BigNumberish} value value to convert\n * @returns {BigInt} converted value\n * @example\n * ```typescript\n * const str = '123';\n * const result = toBigInt(str);\n * // result = 123n\n * ```\n */\nexport function toBigInt(value: BigNumberish): bigint {\n return BigInt(value);\n}\n\n/**\n * Test if value is bigint\n *\n * @param value value to test\n * @returns {boolean} true if value is bigint, false otherwise\n * @example\n * ```typescript\n * isBigInt(10n); // true\n * isBigInt(BigInt('10')); // true\n * isBigInt(10); // false\n * isBigInt('10'); // false\n * isBigInt(null); // false\n * ```\n */\nexport function isBigInt(value: any): value is bigint {\n return typeof value === 'bigint';\n}\n\n/**\n * Convert BigNumberish to hex-string\n *\n * @param {BigNumberish} value value to convert\n * @returns {string} converted number in hex-string format\n * @example\n * ```typescript\n * toHex(100); // '0x64'\n * toHex('200'); // '0xc8'\n * ```\n */\nexport function toHex(value: BigNumberish): string {\n return addHexPrefix(toBigInt(value).toString(16));\n}\n\n/**\n * Alias of ToHex\n */\nexport const toHexString = toHex;\n\n/**\n * Convert BigNumberish to storage-key-string\n *\n * Same as toHex but conforming to the STORAGE_KEY pattern `^0x0[0-7]{1}[a-fA-F0-9]{0,62}$`.\n *\n * A storage key is represented as up to 62 hex digits, 3 bits, and 5 leading zeroes:\n * `0x0 + [0-7] + 62 hex = 0x + 64 hex`\n * @returns format: storage-key-string\n */\nexport function toStorageKey(number: BigNumberish): string {\n return addHexPrefix(toBigInt(number).toString(16).padStart(64, '0'));\n}\n\n/**\n * Convert hexadecimal string to decimal string\n *\n * @param {string} hex hex-string to convert\n * @returns {string} converted number in decimal string format\n * @example\n * ```typescript\n * hexToDecimalString('64'); // '100'\n * hexToDecimalString('c8'); // '200'\n * ```\n */\nexport function hexToDecimalString(hex: string): string {\n return BigInt(addHexPrefix(hex)).toString(10);\n}\n\n/**\n * Remove hex-string leading zeroes and lowercase it\n *\n * @param {string} hex hex-string\n * @returns {string} updated string in hex-string format\n * @example\n * ```typescript\n * cleanHex('0x00023AB'); // '0x23ab'\n * ```\n */\nexport function cleanHex(hex: string): string {\n return hex.toLowerCase().replace(/^(0x)0+/, '$1');\n}\n\n/**\n * Asserts input is equal to or greater then lowerBound and lower then upperBound.\n *\n * The `inputName` parameter is used in the assertion message.\n * @param input Value to check\n * @param lowerBound Lower bound value\n * @param upperBound Upper bound value\n * @param inputName Name of the input for error message\n * @throws Error if input is out of range\n * @example\n * ```typescript\n * const input1:BigNumberish = 10;\n * assertInRange(input1, 5, 20, 'value')\n *\n * const input2: BigNumberish = 25;\n * assertInRange(input2, 5, 20, 'value');\n * // throws Error: Message not signable, invalid value length.\n * ```\n */\nexport function assertInRange(\n input: BigNumberish,\n lowerBound: BigNumberish,\n upperBound: BigNumberish,\n inputName = ''\n) {\n const messageSuffix = inputName === '' ? 'invalid length' : `invalid ${inputName} length`;\n const inputBigInt = BigInt(input);\n const lowerBoundBigInt = BigInt(lowerBound);\n const upperBoundBigInt = BigInt(upperBound);\n\n assert(\n inputBigInt >= lowerBoundBigInt && inputBigInt <= upperBoundBigInt,\n `Message not signable, ${messageSuffix}.`\n );\n}\n\n/**\n * Convert BigNumberish array to decimal string array\n *\n * @param {BigNumberish[]} data array of big-numberish elements\n * @returns {string[]} array of decimal strings\n * @example\n * ```typescript\n * const data = [100, 200n];\n * const result = bigNumberishArrayToDecimalStringArray(data);\n * // result = ['100', '200']\n * ```\n */\nexport function bigNumberishArrayToDecimalStringArray(data: BigNumberish[]): string[] {\n return data.map((x) => toBigInt(x).toString(10));\n}\n\n/**\n * Convert BigNumberish array to hexadecimal string array\n *\n * @param {BigNumberish[]} data array of big-numberish elements\n * @returns array of hex-strings\n * @example\n * ```typescript\n * const data = [100, 200n];\n * const result = bigNumberishArrayToHexadecimalStringArray(data);\n * // result = ['0x64', '0xc8']\n * ```\n */\nexport function bigNumberishArrayToHexadecimalStringArray(data: BigNumberish[]): string[] {\n return data.map((x) => toHex(x));\n}\n\n/**\n * Test if string is a whole number (0, 1, 2, 3...)\n *\n * @param {string} str string to test\n * @returns {boolean}: true if string is a whole number, false otherwise\n * @example\n * ```typescript\n * isStringWholeNumber('100'); // true\n * isStringWholeNumber('10.0'); // false\n * isStringWholeNumber('test'); // false\n * ```\n */\nexport function isStringWholeNumber(str: string): boolean {\n return /^\\d+$/.test(str);\n}\n\n/**\n * Convert string to decimal string\n *\n * @param {string} str string to convert\n * @returns converted string in decimal format\n * @throws str needs to be a number string in hex or whole number format\n * @example\n * ```typescript\n * const result = getDecimalString(\"0x1a\");\n * // result = \"26\"\n *\n * const result2 = getDecimalString(\"Hello\");\n * // throws Error: \"Hello needs to be a hex-string or whole-number-string\"\n * ```\n */\nexport function getDecimalString(str: string) {\n if (isHex(str)) {\n return hexToDecimalString(str);\n }\n if (isStringWholeNumber(str)) {\n return str;\n }\n throw new Error(`${str} needs to be a hex-string or whole-number-string`);\n}\n\n/**\n * Convert string to hexadecimal string\n *\n * @param {string} str string to convert\n * @returns converted hex-string\n * @throws str needs to be a number string in hex or whole number format\n * @example\n * ```typescript\n * const result = getHexString(\"123\");\n * // result = \"0x7b\"\n *\n * const result2 = getHexString(\"Hello\");\n * // throws Error: Hello needs to be a hex-string or whole-number-string\n * ```\n */\nexport function getHexString(str: string) {\n if (isHex(str)) {\n return str;\n }\n if (isStringWholeNumber(str)) {\n return toHexString(str);\n }\n throw new Error(`${str} needs to be a hex-string or whole-number-string`);\n}\n\n/**\n * Convert string array to hex-string array\n *\n * @param {Array<string>} array array of string elements\n * @returns array of converted elements in hex-string format\n * @example\n * ```typescript\n * const data = ['100', '200', '0xaa'];\n * const result = getHexStringArray(data);\n * // result = ['0x64', '0xc8', '0xaa']\n * ```\n */\nexport function getHexStringArray(array: Array<string>) {\n return array.map(getHexString);\n}\n\n/**\n * Convert boolean to \"0\" or \"1\"\n *\n * @param value The boolean value to be converted.\n * @returns {boolean} Returns true if the value is a number, otherwise returns false.\n * @example\n * ```typescript\n * const result = toCairoBool(true);\n * // result =\"1\"\n *\n * const result2 = toCairoBool(false);\n * // result2 = \"0\"\n * ```\n */\nexport function toCairoBool(value: boolean): string {\n return (+value).toString();\n}\n\n/**\n * Convert hex-string to an array of Bytes (Uint8Array)\n *\n * @param {string} str hex-string\n * @returns {Uint8Array} array containing the converted elements\n * @throws str must be a hex-string\n * @example\n * ```typescript\n * let result;\n *\n * result = hexToBytes('0x64');\n * // result = [100]\n *\n * result = hexToBytes('test');\n * // throws Error: test needs to be a hex-string\n * ```\n */\nexport function hexToBytes(str: string): Uint8Array {\n if (!isHex(str)) throw new Error(`${str} needs to be a hex-string`);\n\n let adaptedValue: string = removeHexPrefix(str);\n if (adaptedValue.length % 2 !== 0) {\n adaptedValue = `0${adaptedValue}`;\n }\n return hexToBytesNoble(adaptedValue);\n}\n\n/**\n * Adds a percentage amount to the value\n *\n * @param number value to be modified\n * @param percent integer as percent ex. 50 for 50%\n * @returns {BigInt} modified value\n * @example\n * ```typescript\n * addPercent(100, 50); // 150n\n * addPercent(100, 100); // 200n\n * addPercent(200, 50); // 300n\n * addPercent(200, -50); // 100n\n * addPercent(200, -100); // 0n\n * addPercent(200, -150); // -100n\n * ```\n */\nexport function addPercent(number: BigNumberish, percent: number) {\n const bigIntNum = BigInt(number);\n return bigIntNum + (bigIntNum * BigInt(percent)) / 100n;\n}\n\n/**\n * Check if a value is a number.\n *\n * @param {unknown} value - The value to check.\n * @returns {boolean} Returns true if the value is a number, otherwise returns false.\n * @example\n * ```typescript\n * const result = isNumber(123);\n * // result = true\n *\n * const result2 = isNumber(\"123\");\n * // result2 = false\n * ```\n * @return {boolean} Returns true if the value is a number, otherwise returns false.\n */\nexport function isNumber(value: unknown): value is number {\n return typeof value === 'number';\n}\n\n/**\n * Checks if a given value is of boolean type.\n *\n * @param {unknown} value - The value to check.\n * @returns {boolean} - True if the value is of boolean type, false otherwise.\n * @example\n * ```typescript\n * const result = isBoolean(true);\n * // result = true\n *\n * const result2 = isBoolean(false);\n * // result2 = false\n * ```\n * @return {boolean} - True if the value is of boolean type, false otherwise.\n */\nexport function isBoolean(value: unknown): value is boolean {\n return typeof value === 'boolean';\n}\n","import { keccak } from '@scure/starknet';\n\nimport { MASK_250 } from '../../constants';\nimport { BigNumberish } from '../../types';\nimport { addHexPrefix, removeHexPrefix, utf8ToArray } from '../encode';\nimport { hexToBytes, isHex, isStringWholeNumber, toHex, toHexString } from '../num';\n\n/**\n * Calculate the hex-string Keccak hash for a given BigNumberish\n *\n * @param value value to hash\n * @returns hex-string Keccak hash\n * @example\n * ```typescript\n * const result = keccakBn('0xabc');\n * // result = '0x11cf08aac85935e32397f410e48217a127b6855d41b1e3877eb4179c0904b77'\n * ```\n */\nexport function keccakBn(value: BigNumberish): string {\n const hexWithoutPrefix = removeHexPrefix(toHex(BigInt(value)));\n const evenHex = hexWithoutPrefix.length % 2 === 0 ? hexWithoutPrefix : `0${hexWithoutPrefix}`;\n return addHexPrefix(keccak(hexToBytes(addHexPrefix(evenHex))).toString(16));\n}\n\n/**\n * [internal]\n * Calculate hex-string Keccak hash for a given string\n *\n * String -> hex-string Keccak hash\n * @returns format: hex-string\n */\nfunction keccakHex(str: string): string {\n return addHexPrefix(keccak(utf8ToArray(str)).toString(16));\n}\n\n/**\n * Calculate the BigInt Starknet Keccak hash for a given string\n * [Reference](https://github.com/starkware-libs/cairo-lang/blob/master/src/starkware/starknet/public/abi.py#L38)\n *\n * @param str value to hash\n * @returns BigInt Keccak hash\n * @example\n * ```typescript\n * const result = starknetKeccak('test').toString();\n * // result = '61835310290161785288773114225739080147441215596947647498723774891619563096'\n * ```\n */\nexport function starknetKeccak(str: string): bigint {\n const hash = BigInt(keccakHex(str));\n // eslint-disable-next-line no-bitwise\n return hash & MASK_250;\n}\n\n/**\n * Calculate the hex-string selector for a given abi function name\n * [Reference](https://github.com/starkware-libs/cairo-lang/blob/master/src/starkware/starknet/public/abi.py#L46)\n *\n * @param funcName abi function name\n * @returns hex-string selector\n * @example\n * ```typescript\n * const result = getSelectorFromName('myFunction');\n * // result = '0xc14cfe23f3fa7ce7b1f8db7d7682305b1692293f71a61cc06637f0d8d8b6c8'\n * ```\n */\nexport function getSelectorFromName(funcName: string) {\n // sometimes BigInteger pads the hex string with zeros, which is not allowed in the starknet api\n return toHex(starknetKeccak(funcName));\n}\n\n/**\n * Calculate the hex-string selector from a given abi function name, decimal string or hex string\n *\n * @param value hex-string | dec-string | ascii-string\n * @returns hex-string selector\n * @example\n * ```typescript\n * const selector1: string = getSelector(\"myFunction\");\n * // selector1 = \"0xc14cfe23f3fa7ce7b1f8db7d7682305b1692293f71a61cc06637f0d8d8b6c8\"\n *\n * const selector2: string = getSelector(\"0x123abc\");\n * // selector2 = \"0x123abc\"\n *\n * const selector3: string = getSelector(\"123456\");\n * // selector3 = \"0x1e240\"\n * ```\n */\nexport function getSelector(value: string) {\n if (isHex(value)) {\n return value;\n }\n if (isStringWholeNumber(value)) {\n return toHexString(value);\n }\n return getSelectorFromName(value);\n}\n","import { TEXT_TO_FELT_MAX_LEN } from '../constants';\nimport { addHexPrefix, removeHexPrefix } from './encode';\nimport { isHex, isStringWholeNumber } from './num';\n\n/**\n * Test if string contains only ASCII characters (string can be ascii text)\n * @param {string} str The string to test\n * @returns {boolean} Returns true if the string contains only ASCII characters, otherwise false\n * @example\n * ```typescript\n * const result = shortString.isASCII(\"Hello, world!\");\n * // result = true\n * const result = shortString.isASCII(\"Hello, 世界!\");\n * // result = false\n * ```\n */\nexport function isASCII(str: string): boolean {\n // eslint-disable-next-line no-control-regex\n return /^[\\x00-\\x7F]*$/.test(str);\n}\n\n/**\n * Test if a string is a Cairo short string (string with less or equal 31 characters)\n * @param {string} str the string to test\n * @returns {boolean} Returns true if the string has less than or equal to 31 characters, otherwise false.\n * @example\n * ```typescript\n * const result = shortString.isShortString(\"Hello, world!\");\n * // result = true\n * ```\n */\nexport function isShortString(str: string): boolean {\n return str.length <= TEXT_TO_FELT_MAX_LEN;\n}\n\n/**\n * Test if string contains only numbers (string can be converted to decimal integer number)\n * @param {string} str the string to test.\n * @returns {boolean} Returns true if the string contains only numbers, otherwise false.\n * @example\n * ```typescript\n * const result = shortString.isDecimalString(\"12345\");\n * // result = true\n * const result = shortString.isDecimalString(\"12a45\");\n * // result = false\n * ```\n */\nexport function isDecimalString(str: string): boolean {\n return /^[0-9]*$/i.test(str);\n}\n\n/**\n * Checks if a given value is a string.\n * @param {unknown} value the value to be checked.\n * @return {boolean} returns true if the value is a string, false otherwise.\n * @example\n * ```typescript\n * const result = shortString.isString(\"12345\");\n * // result = true\n * ```\n */\nexport function isString(value: unknown): value is string {\n return typeof value === 'string';\n}\n\n/**\n * Test if value is a pure string text, and not a hex string or number string\n * @param {any} val the value to test\n * @returns {boolean} returns true if the value is a free-form string text, otherwise false\n * @example\n * ```typescript\n * const result = shortString.isText(\"Hello, world!\");\n * // result = true\n * const result = shortString.isText(\"0x7aec92f706\");\n * // result = false\n * ```\n */\nexport function isText(val: any) {\n return isString(val) && !isHex(val) && !isStringWholeNumber(val);\n}\n\n/**\n * Test if value is short text\n * @param {any} val - The item to test\n * @returns {boolean} Returns true if the value is a short text (string has less or equal 31 characters), otherwise false\n * @example\n * ```typescript\n * const result = shortString.isShortText(\"Hello, world!\");\n * // result = true\n * ```\n */\nexport const isShortText = (val: any) => isText(val) && isShortString(val);\n\n/**\n * Test if value is long text\n * @param {any} val the value to test\n * @returns {boolean} returns true if the value is a long text(string has more than 31 characters), otherwise false.\n * @example\n * ```typescript\n * const result = shortString.isLongText(\"Hello, world! this is some random long string to enable you test isLongText function.\");\n * // result = true\n * ```\n */\nexport const isLongText = (val: any) => isText(val) && !isShortString(val);\n\n/**\n * Split long text (string greater than 31 characters) into short strings (string lesser or equal 31 characters)\n * @param {string} longStr the long text (string greater than 31 characters) to split\n * @returns {string[]} an array of short strings (string lesser or equal 31 characters).\n * @example\n * ```typescript\n * const result = shortString.splitLongString(\"Hello, world! we just testing splitLongString function.\");\n * // result = [ 'Hello, world! we just testing s', 'plitLongString function.' ]\n * ```\n */\nexport function splitLongString(longStr: string): string[] {\n const regex = RegExp(`[^]{1,${TEXT_TO_FELT_MAX_LEN}}`, 'g');\n return longStr.match(regex) || [];\n}\n\n/**\n * Convert an ASCII short string to a hexadecimal string.\n * @param {string} str short string (ASCII string, 31 characters max)\n * @returns {string} hex-string with 248 bits max\n * @example\n * ```typescript\n * const result = shortString.encodeShortString(\"uri/pict/t38.jpg\");\n * // result = \"0x7572692f706963742f7433382e6a7067\"\n * ```\n */\nexport function encodeShortString(str: string): string {\n if (!isASCII(str)) throw new Error(`${str} is not an ASCII string`);\n if (!isShortString(str)) throw new Error(`${str} is too long`);\n return addHexPrefix(str.replace(/./g, (char) => char.charCodeAt(0).toString(16)));\n}\n\n/**\n * Convert a hexadecimal or decimal string to an ASCII string.\n * @param {string} str representing a 248 bit max number (ex. \"0x1A4F64EA56\" or \"236942575435676423\")\n * @returns {string} short string; 31 characters max\n * @example\n * ```typescript\n * const result = shortString.decodeShortString(\"0x7572692f706963742f7433382e6a7067\");\n * // result = \"uri/pict/t38.jpg\"\n * ```\n */\nexport function decodeShortString(str: string): string {\n if (!isASCII(str)) throw new Error(`${str} is not an ASCII string`);\n if (isHex(str)) {\n return removeHexPrefix(str).replace(/.{2}/g, (hex) => String.fromCharCode(parseInt(hex, 16)));\n }\n if (isDecimalString(str)) {\n return decodeShortString('0X'.concat(BigInt(str).toString(16)));\n }\n throw new Error(`${str} is not Hex or decimal`);\n}\n","import { BigNumberish, ByteArray } from '../../types/lib';\nimport { toHex } from '../num';\nimport { decodeShortString, encodeShortString, splitLongString } from '../shortString';\n\n/**\n * convert a Cairo ByteArray to a JS string\n * @param myByteArray Cairo representation of a LongString\n * @returns a JS string\n * @example\n * ```typescript\n * const myByteArray = {\n * data: [],\n * pending_word: '0x414243444546474849',\n * pending_word_len: 9\n * }\n * const result: String = stringFromByteArray(myByteArray); // ABCDEFGHI\n * ```\n */\nexport function stringFromByteArray(myByteArray: ByteArray): string {\n const pending_word: string =\n BigInt(myByteArray.pending_word) === 0n\n ? ''\n : decodeShortString(toHex(myByteArray.pending_word));\n return (\n myByteArray.data.reduce<string>((cumuledString, encodedString: BigNumberish) => {\n const add: string =\n BigInt(encodedString) === 0n ? '' : decodeShortString(toHex(encodedString));\n return cumuledString + add;\n }, '') + pending_word\n );\n}\n\n/**\n * convert a JS string to a Cairo ByteArray\n * @param targetString a JS string\n * @returns Cairo representation of a LongString\n * @example\n * ```typescript\n * const myByteArray: ByteArray = byteArrayFromString(\"ABCDEFGHI\");\n * ```\n * Result is :\n * {\n * data: [],\n * pending_word: '0x414243444546474849',\n * pending_word_len: 9\n * }\n */\nexport function byteArrayFromString(targetString: string): ByteArray {\n const shortStrings: string[] = splitLongString(targetString);\n const remainder: string = shortStrings[shortStrings.length - 1];\n const shortStringsEncoded: BigNumberish[] = shortStrings.map(encodeShortString);\n\n const [pendingWord, pendingWordLength] =\n remainder === undefined || remainder.length === 31\n ? ['0x00', 0]\n : [shortStringsEncoded.pop()!, remainder.length];\n\n return {\n data: shortStringsEncoded.length === 0 ? [] : shortStringsEncoded,\n pending_word: pendingWord,\n pending_word_len: pendingWordLength,\n };\n}\n","import {\n Abi,\n AbiEnums,\n AbiStructs,\n BigNumberish,\n ContractVersion,\n Literal,\n Uint,\n Uint256,\n Uint512,\n} from '../../types';\nimport { CairoFelt } from '../cairoDataTypes/felt';\nimport { CairoUint256 } from '../cairoDataTypes/uint256';\nimport { CairoUint512 } from '../cairoDataTypes/uint512';\n\n// Intended for internal usage, maybe should be exported somewhere else and not exported to utils\n/**\n * Checks if the given name ends with \"_len\".\n *\n * @param {string} name - The name to be checked.\n * @returns - True if the name ends with \"_len\", false otherwise.\n */\nexport const isLen = (name: string) => /_len$/.test(name);\n/**\n * Checks if a given type is felt.\n *\n * @param {string} type - The type to check.\n * @returns - True if the type is felt, false otherwise.\n */\nexport const isTypeFelt = (type: string) => type === 'felt' || type === 'core::felt252';\n/**\n * Checks if the given type is an array type.\n *\n * @param {string} type - The type to check.\n * @returns - `true` if the type is an array type, `false` otherwise.\n */\nexport const isTypeArray = (type: string) =>\n /\\*/.test(type) ||\n type.startsWith('core::array::Array::') ||\n type.startsWith('core::array::Span::');\n/**\n * Checks if the given type is a tuple type.\n *\n * @param {string} type - The type to be checked.\n * @returns - `true` if the type is a tuple type, otherwise `false`.\n */\nexport const isTypeTuple = (type: string) => /^\\(.*\\)$/i.test(type);\n/**\n * Checks whether a given type is a named tuple.\n *\n * @param {string} type - The type to be checked.\n * @returns - True if the type is a named tuple, false otherwise.\n */\nexport const isTypeNamedTuple = (type: string) => /\\(.*\\)/i.test(type) && type.includes(':');\n/**\n * Checks if a given type is a struct.\n *\n * @param {string} type - The type to check for existence.\n * @param {AbiStructs} structs - The collection of structs to search in.\n * @returns - True if the type exists in the structs, false otherwise.\n */\nexport const isTypeStruct = (type: string, structs: AbiStructs) => type in structs;\n/**\n * Checks if a given type is an enum.\n *\n * @param {string} type - The type to check.\n * @param {AbiEnums} enums - The enumeration to search in.\n * @returns - True if the type exists in the enumeration, otherwise false.\n */\nexport const isTypeEnum = (type: string, enums: AbiEnums) => type in enums;\n/**\n * Determines if the given type is an Option type.\n *\n * @param {string} type - The type to check.\n * @returns - True if the type is an Option type, false otherwise.\n */\nexport const isTypeOption = (type: string) => type.startsWith('core::option::Option::');\n/**\n * Checks whether a given type starts with 'core::result::Result::'.\n *\n * @param {string} type - The type to check.\n * @returns - True if the type starts with 'core::result::Result::', false otherwise.\n */\nexport const isTypeResult = (type: string) => type.startsWith('core::result::Result::');\n/**\n * Checks if the given value is a valid Uint type.\n *\n * @param {string} type - The value to check.\n * @returns - Returns true if the value is a valid Uint type, otherwise false.\n */\nexport const isTypeUint = (type: string) => Object.values(Uint).includes(type as Uint);\n// Legacy Export\n/**\n * Checks if the given type is `uint256`.\n *\n * @param {string} type - The type to be checked.\n * @returns - Returns true if the type is `uint256`, otherwise false.\n */\nexport const isTypeUint256 = (type: string) => CairoUint256.isAbiType(type);\n/**\n * Checks if the given type is a literal type.\n *\n * @param {string} type - The type to check.\n * @returns - True if the type is a literal type, false otherwise.\n */\nexport const isTypeLiteral = (type: string) => Object.values(Literal).includes(type as Literal);\n/**\n * Checks if the given type is a boolean type.\n *\n * @param {string} type - The type to be checked.\n * @returns - Returns true if the type is a boolean type, otherwise false.\n */\nexport const isTypeBool = (type: string) => type === 'core::bool';\n/**\n * Checks if the provided type is equal to 'core::starknet::contract_address::ContractAddress'.\n * @param {string} type - The type to be checked.\n * @returns - true if the type matches 'core::starknet::contract_address::ContractAddress', false otherwise.\n */\nexport const isTypeContractAddress = (type: string) =>\n type === 'core::starknet::contract_address::ContractAddress';\n/**\n * Determines if the given type is an Ethereum address type.\n *\n * @param {string} type - The type to check.\n * @returns - Returns true if the given type is 'core::starknet::eth_address::EthAddress', otherwise false.\n */\nexport const isTypeEthAddress = (type: string) =>\n type === 'core::starknet::eth_address::EthAddress';\n/**\n * Checks if the given type is 'core::bytes_31::bytes31'.\n *\n * @param {string} type - The type to check.\n * @returns - True if the type is 'core::bytes_31::bytes31', false otherwise.\n */\nexport const isTypeBytes31 = (type: string) => type === 'core::bytes_31::bytes31';\n/**\n * Checks if the given type is equal to the 'core::byte_array::ByteArray'.\n *\n * @param {string} type - The type to check.\n * @returns - True if the given type is equal to 'core::byte_array::ByteArray', false otherwise.\n */\nexport const isTypeByteArray = (type: string) => type === 'core::byte_array::ByteArray';\nexport const isTypeSecp256k1Point = (type: string) =>\n type === 'core::starknet::secp256k1::Secp256k1Point';\nexport const isCairo1Type = (type: string) => type.includes('::');\n/**\n * Retrieves the array type from the given type string.\n *\n * Works also for core::zeroable::NonZero type.\n * @param {string} type - The type string.\n * @returns - The array type.\n */\nexport const getArrayType = (type: string) => {\n if (isCairo1Type(type)) {\n return type.substring(type.indexOf('<') + 1, type.lastIndexOf('>'));\n }\n return type.replace('*', '');\n};\n\n/**\n * Test if an ABI comes from a Cairo 1 contract\n * @param abi representing the interface of a Cairo contract\n * @returns TRUE if it is an ABI from a Cairo1 contract\n * @example\n * ```typescript\n * const isCairo1: boolean = isCairo1Abi(myAbi: Abi);\n * ```\n */\nexport function isCairo1Abi(abi: Abi): boolean {\n const { cairo } = getAbiContractVersion(abi);\n if (cairo === undefined) {\n throw Error('Unable to determine Cairo version');\n }\n return cairo === '1';\n}\n\n/**\n * Checks if the given type is a NonZero type.\n *\n * @param {string} type The type to check.\n * @returns `true` if the type is NonZero type, `false` otherwise.\n * @example\n * ```typescript\n * const result = cairo.isTypeNonZero(\"core::zeroable::NonZero::<u8>\");\n * //result = true\n * ```\n */\nexport function isTypeNonZero(type: string): boolean {\n return type.startsWith('core::zeroable::NonZero::');\n}\n\n/**\n * Return ContractVersion (Abi version) based on Abi\n * or undefined for unknown version\n * @param abi\n * @returns string\n */\nexport function getAbiContractVersion(abi: Abi): ContractVersion {\n // determine by interface for \"Cairo 1.2\"\n if (abi.find((it) => it.type === 'interface')) {\n return { cairo: '1', compiler: '2' };\n }\n\n // determine by function io types \"Cairo 1.1\" or \"Cairo 0.0\"\n // find first function with inputs or outputs\n const testFunction = abi.find(\n (it) => it.type === 'function' && (it.inputs.length || it.outputs.length)\n );\n if (!testFunction) {\n return { cairo: undefined, compiler: undefined };\n }\n const io = testFunction.inputs.length ? testFunction.inputs : testFunction.outputs;\n if (isCairo1Type(io[0].type)) {\n return { cairo: '1', compiler: '1' };\n }\n return { cairo: '0', compiler: '0' };\n}\n\n/**\n * named tuple cairo type is described as js object {}\n * struct cairo type are described as js object {}\n * array cairo type are described as js array []\n */\n\n/**\n * Create Uint256 Cairo type (helper for common struct type)\n * @example\n * ```typescript\n * uint256('892349863487563453485768723498');\n * ```\n */\nexport const uint256 = (it: BigNumberish): Uint256 => {\n return new CairoUint256(it).toUint256DecimalString();\n};\n\n/**\n * Create Uint512 Cairo type (helper for common struct type)\n * @param it BigNumberish representation of a 512 bits unsigned number\n * @returns Uint512 struct\n * @example\n * ```typescript\n * uint512('345745685892349863487563453485768723498');\n * ```\n */\nexport const uint512 = (it: BigNumberish): Uint512 => {\n return new CairoUint512(it).toUint512DecimalString();\n};\n\n/**\n * Create unnamed tuple Cairo type (helper same as common struct type)\n * @example\n * ```typescript\n * tuple(1, '0x101', 16);\n * ```\n */\nexport const tuple = (\n ...args: (BigNumberish | object | boolean)[]\n): Record<number, BigNumberish | object | boolean> => ({ ...args });\n\n/**\n * Create felt Cairo type (cairo type helper)\n * @returns format: felt-string\n */\nexport function felt(it: BigNumberish): string {\n return CairoFelt(it);\n}\n","// TODO Convert to CairoFelt base on CairoUint256 and implement it in the codebase in the backward compatible manner\n\nimport { BigNumberish, isBigInt, isBoolean, isHex, isStringWholeNumber } from '../num';\nimport { encodeShortString, isShortString, isString, isText } from '../shortString';\n\n/**\n * Create felt Cairo type (cairo type helper)\n * @returns format: felt-string\n */\nexport function CairoFelt(it: BigNumberish): string {\n // BN or number\n if (isBigInt(it) || Number.isInteger(it)) {\n return it.toString();\n }\n\n // Handling strings\n if (isString(it)) {\n // Hex strings\n if (isHex(it)) {\n return BigInt(it).toString();\n }\n // Text strings that must be short\n if (isText(it)) {\n if (!isShortString(it)) {\n throw new Error(\n `${it} is a long string > 31 chars. Please split it into an array of short strings.`\n );\n }\n // Assuming encodeShortString returns a hex representation of the string\n return BigInt(encodeShortString(it)).toString();\n }\n // Whole numeric strings\n if (isStringWholeNumber(it)) {\n return it;\n }\n }\n // bool to felt\n if (isBoolean(it)) {\n return `${+it}`;\n }\n\n throw new Error(`${it} can't be computed by felt()`);\n}\n","/* eslint-disable no-bitwise */\n/**\n * Singular class handling cairo u256 data type\n */\n\nimport { BigNumberish, Uint256 } from '../../types';\nimport { addHexPrefix } from '../encode';\nimport { CairoFelt } from './felt';\n\nexport const UINT_128_MAX = (1n << 128n) - 1n;\nexport const UINT_256_MAX = (1n << 256n) - 1n;\nexport const UINT_256_MIN = 0n;\nexport const UINT_256_LOW_MAX = 340282366920938463463374607431768211455n;\nexport const UINT_256_HIGH_MAX = 340282366920938463463374607431768211455n;\nexport const UINT_256_LOW_MIN = 0n;\nexport const UINT_256_HIGH_MIN = 0n;\n\nexport class CairoUint256 {\n public low: bigint;\n\n public high: bigint;\n\n static abiSelector = 'core::integer::u256';\n\n /**\n * Default constructor (Lib usage)\n * @param bigNumberish BigNumberish value representing uin256\n */\n public constructor(bigNumberish: BigNumberish);\n /**\n * Direct props initialization (Api response)\n */\n public constructor(low: BigNumberish, high: BigNumberish);\n /**\n * Initialization from Uint256 object\n */\n public constructor(uint256: Uint256);\n\n public constructor(...arr: any[]) {\n if (typeof arr[0] === 'object' && arr.length === 1 && 'low' in arr[0] && 'high' in arr[0]) {\n const props = CairoUint256.validateProps(arr[0].low, arr[0].high);\n this.low = props.low;\n this.high = props.high;\n } else if (arr.length === 1) {\n const bigInt = CairoUint256.validate(arr[0]);\n this.low = bigInt & UINT_128_MAX;\n this.high = bigInt >> 128n;\n } else if (arr.length === 2) {\n const props = CairoUint256.validateProps(arr[0], arr[1]);\n this.low = props.low;\n this.high = props.high;\n } else {\n throw Error('Incorrect constructor parameters');\n }\n }\n\n /**\n * Validate if BigNumberish can be represented as Unit256\n */\n static validate(bigNumberish: BigNumberish) {\n const bigInt = BigInt(bigNumberish);\n if (bigInt < UINT_256_MIN) throw Error('bigNumberish is smaller than UINT_256_MIN');\n if (bigInt > UINT_256_MAX) throw new Error('bigNumberish is bigger than UINT_256_MAX');\n return bigInt;\n }\n\n /**\n * Validate if low and high can be represented as Unit256\n */\n static validateProps(low: BigNumberish, high: BigNumberish) {\n const bigIntLow = BigInt(low);\n const bigIntHigh = BigInt(high);\n if (bigIntLow < UINT_256_LOW_MIN || bigIntLow > UINT_256_LOW_MAX) {\n throw new Error('low is out of range UINT_256_LOW_MIN - UINT_256_LOW_MAX');\n }\n if (bigIntHigh < UINT_256_HIGH_MIN || bigIntHigh > UINT_256_HIGH_MAX) {\n throw new Error('high is out of range UINT_256_HIGH_MIN - UINT_256_HIGH_MAX');\n }\n return { low: bigIntLow, high: bigIntHigh };\n }\n\n /**\n * Check if BigNumberish can be represented as Unit256\n */\n static is(bigNumberish: BigNumberish) {\n try {\n CairoUint256.validate(bigNumberish);\n } catch (error) {\n return false;\n }\n return true;\n }\n\n /**\n * Check if provided abi type is this data type\n */\n static isAbiType(abiType: string) {\n return abiType === CairoUint256.abiSelector;\n }\n\n /**\n * Return bigint representation\n */\n toBigInt() {\n return (this.high << 128n) + this.low;\n }\n\n /**\n * Return Uint256 structure with HexString props\n * {low: HexString, high: HexString}\n */\n toUint256HexString() {\n return {\n low: addHexPrefix(this.low.toString(16)),\n high: addHexPrefix(this.high.toString(16)),\n };\n }\n\n /**\n * Return Uint256 structure with DecimalString props\n * {low: DecString, high: DecString}\n */\n toUint256DecimalString() {\n return {\n low: this.low.toString(10),\n high: this.high.toString(10),\n };\n }\n\n /**\n * Return api requests representation witch is felt array\n */\n toApiRequest() {\n return [CairoFelt(this.low), CairoFelt(this.high)];\n }\n}\n","/* eslint-disable no-bitwise */\n/**\n * Singular class handling cairo u512 data type\n */\n\nimport { BigNumberish, type Uint512 } from '../../types';\nimport { addHexPrefix } from '../encode';\nimport { CairoFelt } from './felt';\nimport { UINT_128_MAX } from './uint256';\n\nexport const UINT_512_MAX = (1n << 512n) - 1n;\nexport const UINT_512_MIN = 0n;\nexport const UINT_128_MIN = 0n;\n\nexport class CairoUint512 {\n public limb0: bigint;\n\n public limb1: bigint;\n\n public limb2: bigint;\n\n public limb3: bigint;\n\n static abiSelector = 'core::integer::u512';\n\n /**\n * Default constructor (Lib usage)\n * @param bigNumberish BigNumberish value representing u512\n */\n public constructor(bigNumberish: BigNumberish);\n /**\n * Direct props initialization (Api response)\n */\n public constructor(\n limb0: BigNumberish,\n limb1: BigNumberish,\n limb2: BigNumberish,\n limb3: BigNumberish\n );\n /**\n * Initialization from Uint512 object\n */\n public constructor(uint512: Uint512);\n\n public constructor(...arr: any[]) {\n if (\n typeof arr[0] === 'object' &&\n arr.length === 1 &&\n 'limb0' in arr[0] &&\n 'limb1' in arr[0] &&\n 'limb2' in arr[0] &&\n 'limb3' in arr[0]\n ) {\n const props = CairoUint512.validateProps(\n arr[0].limb0,\n arr[0].limb1,\n arr[0].limb2,\n arr[0].limb3\n );\n this.limb0 = props.limb0;\n this.limb1 = props.limb1;\n this.limb2 = props.limb2;\n this.limb3 = props.limb3;\n } else if (arr.length === 1) {\n const bigInt = CairoUint512.validate(arr[0]);\n this.limb0 = bigInt & UINT_128_MAX;\n this.limb1 = (bigInt & (UINT_128_MAX << 128n)) >> 128n;\n this.limb2 = (bigInt & (UINT_128_MAX << 256n)) >> 256n;\n this.limb3 = bigInt >> 384n;\n } else if (arr.length === 4) {\n const props = CairoUint512.validateProps(arr[0], arr[1], arr[2], arr[3]);\n this.limb0 = props.limb0;\n this.limb1 = props.limb1;\n this.limb2 = props.limb2;\n this.limb3 = props.limb3;\n } else {\n throw Error('Incorrect Uint512 constructor parameters');\n }\n }\n\n /**\n * Validate if BigNumberish can be represented as Uint512\n */\n static validate(bigNumberish: BigNumberish): bigint {\n const bigInt = BigInt(bigNumberish);\n if (bigInt < UINT_512_MIN) throw Error('bigNumberish is smaller than UINT_512_MIN.');\n if (bigInt > UINT_512_MAX) throw Error('bigNumberish is bigger than UINT_512_MAX.');\n return bigInt;\n }\n\n /**\n * Validate if limbs can be represented as Uint512\n */\n static validateProps(\n limb0: BigNumberish,\n limb1: BigNumberish,\n limb2: BigNumberish,\n limb3: BigNumberish\n ): { limb0: bigint; limb1: bigint; limb2: bigint; limb3: bigint } {\n const l0 = BigInt(limb0);\n const l1 = BigInt(limb1);\n const l2 = BigInt(limb2);\n const l3 = BigInt(limb3);\n [l0, l1, l2, l3].forEach((value: bigint, index) => {\n if (value < UINT_128_MIN || value > UINT_128_MAX) {\n throw Error(`limb${index} is not in the range of a u128 number`);\n }\n });\n return { limb0: l0, limb1: l1, limb2: l2, limb3: l3 };\n }\n\n /**\n * Check if BigNumberish can be represented as Uint512\n */\n static is(bigNumberish: BigNumberish): boolean {\n try {\n CairoUint512.validate(bigNumberish);\n } catch (error) {\n return false;\n }\n return true;\n }\n\n /**\n * Check if provided abi type is this data type\n */\n static isAbiType(abiType: string): boolean {\n return abiType === CairoUint512.abiSelector;\n }\n\n /**\n * Return bigint representation\n */\n toBigInt(): bigint {\n return (this.limb3 << 384n) + (this.limb2 << 256n) + (this.limb1 << 128n) + this.limb0;\n }\n\n /**\n * Return Uint512 structure with HexString props\n * limbx: HexString\n */\n toUint512HexString() {\n return {\n limb0: addHexPrefix(this.limb0.toString(16)),\n limb1: addHexPrefix(this.limb1.toString(16)),\n limb2: addHexPrefix(this.limb2.toString(16)),\n limb3: addHexPrefix(this.limb3.toString(16)),\n };\n }\n\n /**\n * Return Uint512 structure with DecimalString props\n * limbx DecString\n */\n toUint512DecimalString() {\n return {\n limb0: this.limb0.toString(10),\n limb1: this.limb1.toString(10),\n limb2: this.limb2.toString(10),\n limb3: this.limb3.toString(10),\n };\n }\n\n /**\n * Return api requests representation witch is felt array\n */\n toApiRequest(): string[] {\n // lower limb first : https://github.com/starkware-libs/cairo/blob/07484c52791b76abcc18fd86265756904557d0d2/corelib/src/test/integer_test.cairo#L767\n return [\n CairoFelt(this.limb0),\n CairoFelt(this.limb1),\n CairoFelt(this.limb2),\n CairoFelt(this.limb3),\n ];\n }\n}\n","export type CairoEnumRaw = {\n [key: string]: any;\n};\n\n/**\n * Class to handle Cairo custom Enum\n * @param enumContent object containing the variants and its content. Example :\n * {Success: 234, Warning: undefined, Error: undefined}.\n * Only one variant with a value, object, array.\n * @returns an instance representing a Cairo custom Enum.\n * @example\n * ```typescript\n * const myCairoEnum = new CairoCustomEnum( {Success: undefined, Warning: \"0x7f32ea\", Error: undefined})\n * ```\n */\nexport class CairoCustomEnum {\n /**\n * direct readonly access to variants of the Cairo Custom Enum.\n * @returns a value of type any\n * @example\n * ```typescript\n * const successValue = myCairoEnum.variant.Success;\n */\n readonly variant: CairoEnumRaw;\n\n /**\n * @param enumContent an object with the variants as keys and the content as value. Only one content shall be defined.\n */\n constructor(enumContent: CairoEnumRaw) {\n const variantsList = Object.values(enumContent);\n if (variantsList.length === 0) {\n throw new Error('This Enum must have at least 1 variant');\n }\n const nbActiveVariants = variantsList.filter(\n (content) => typeof content !== 'undefined'\n ).length;\n if (nbActiveVariants !== 1) {\n throw new Error('This Enum must have exactly one active variant');\n }\n this.variant = enumContent;\n }\n\n /**\n *\n * @returns the content of the valid variant of a Cairo custom Enum.\n */\n public unwrap(): any {\n const variants = Object.entries(this.variant);\n const activeVariant = variants.find((item) => typeof item[1] !== 'undefined');\n if (typeof activeVariant === 'undefined') {\n return undefined;\n }\n return activeVariant[1];\n }\n\n /**\n *\n * @returns the name of the valid variant of a Cairo custom Enum.\n */\n public activeVariant(): string {\n const variants = Object.entries(this.variant);\n const activeVariant = variants.find((item) => typeof item[1] !== 'undefined');\n if (typeof activeVariant === 'undefined') {\n return '';\n }\n return activeVariant[0];\n }\n}\n","export enum CairoOptionVariant {\n Some = 0,\n None = 1,\n}\n\n/**\n * Class to handle Cairo Option\n * @param variant CairoOptionVariant.Some or CairoOptionVariant.None\n * @param someContent value of type T.\n * @returns an instance representing a Cairo Option.\n * @example\n * ```typescript\n * const myOption = new CairoOption<BigNumberish>(CairoOptionVariant.Some, \"0x54dda8\");\n * ```\n */\nexport class CairoOption<T> {\n readonly Some?: T;\n\n readonly None?: boolean;\n\n constructor(variant: CairoOptionVariant, someContent?: T) {\n if (!(variant in CairoOptionVariant)) {\n throw new Error('Wrong variant : should be CairoOptionVariant.Some or .None.');\n }\n if (variant === CairoOptionVariant.Some) {\n if (typeof someContent === 'undefined') {\n throw new Error(\n 'The creation of a Cairo Option with \"Some\" variant needs a content as input.'\n );\n }\n this.Some = someContent;\n this.None = undefined;\n } else {\n this.Some = undefined;\n this.None = true;\n }\n }\n\n /**\n *\n * @returns the content of the valid variant of a Cairo custom Enum.\n * If None, returns 'undefined'.\n */\n public unwrap(): T | undefined {\n if (this.None) {\n return undefined;\n }\n return this.Some;\n }\n\n /**\n *\n * @returns true if the valid variant is 'isSome'.\n */\n public isSome(): boolean {\n return !(typeof this.Some === 'undefined');\n }\n\n /**\n *\n * @returns true if the valid variant is 'isNone'.\n */\n public isNone(): boolean {\n return this.None === true;\n }\n}\n","export enum CairoResultVariant {\n Ok = 0,\n Err = 1,\n}\n\n/**\n * Class to handle Cairo Result\n * @param variant CairoResultVariant.Ok or CairoResultVariant.Err\n * @param resultContent value of type T or U.\n * @returns an instance representing a Cairo Result.\n * @example\n * ```typescript\n * const myOption = new CairoResult<BigNumberish, CustomError>(CairoResultVariant.Ok, \"0x54dda8\");\n * ```\n */\nexport class CairoResult<T, U> {\n readonly Ok?: T;\n\n readonly Err?: U;\n\n constructor(variant: CairoResultVariant, resultContent: T | U) {\n if (!(variant in CairoResultVariant)) {\n throw new Error('Wrong variant : should be CairoResultVariant.Ok or .Err.');\n }\n if (variant === CairoResultVariant.Ok) {\n this.Ok = resultContent as T;\n this.Err = undefined;\n } else {\n this.Ok = undefined;\n this.Err = resultContent as U;\n }\n }\n\n /**\n *\n * @returns the content of the valid variant of a Cairo Result.\n */\n public unwrap(): T | U {\n if (typeof this.Ok !== 'undefined') {\n return this.Ok;\n }\n if (typeof this.Err !== 'undefined') {\n return this.Err;\n }\n throw new Error('Both Result.Ok and .Err are undefined. Not authorized.');\n }\n\n /**\n *\n * @returns true if the valid variant is 'Ok'.\n */\n public isOk(): boolean {\n return !(typeof this.Ok === 'undefined');\n }\n\n /**\n *\n * @returns true if the valid variant is 'isErr'.\n */\n public isErr(): boolean {\n return !(typeof this.Err === 'undefined');\n }\n}\n","import { isBigInt } from '../num';\nimport { decodeShortString } from '../shortString';\n\nconst guard = {\n isBN: (data: Record<string, any>, type: Record<string, any>, key: string) => {\n if (!isBigInt(data[key]))\n throw new Error(\n `Data and formatter mismatch on ${key}:${type[key]}, expected response data ${key}:${\n data[key]\n } to be BN instead it is ${typeof data[key]}`\n );\n },\n unknown: (data: Record<string, any>, type: Record<string, any>, key: string) => {\n throw new Error(`Unhandled formatter type on ${key}:${type[key]} for data ${key}:${data[key]}`);\n },\n};\n\n/**\n * Formats the given data based on the provided type definition.\n *\n * @param {any} data - The data to be formatted.\n * @param {any} type - The type definition for the data.\n * @param {any} [sameType] - The same type definition to be used (optional).\n * @returns - The formatted data.\n */\nexport default function formatter(\n data: Record<string, any>,\n type: Record<string, any>,\n sameType?: any\n) {\n // match data element with type element\n return Object.entries(data).reduce(\n (acc, [key, value]: [any, any]) => {\n const elType = sameType ?? type[key];\n\n if (!(key in type) && !sameType) {\n // no type definition for element return original element\n acc[key] = value;\n return acc;\n }\n\n if (elType === 'string') {\n if (Array.isArray(data[key])) {\n // long string (felt*)\n const arrayStr = formatter(\n data[key],\n data[key].map((_: any) => elType)\n );\n acc[key] = Object.values(arrayStr).join('');\n return acc;\n }\n guard.isBN(data, type, key);\n acc[key] = decodeShortString(value);\n return acc;\n }\n if (elType === 'number') {\n guard.isBN(data, type, key);\n acc[key] = Number(value);\n return acc;\n }\n if (typeof elType === 'function') {\n acc[key] = elType(value);\n return acc;\n }\n if (Array.isArray(elType)) {\n const arrayObj = formatter(data[key], elType, elType[0]);\n acc[key] = Object.values(arrayObj);\n return acc;\n }\n if (typeof elType === 'object') {\n acc[key] = formatter(data[key], elType);\n return acc;\n }\n\n guard.unknown(data, type, key);\n return acc;\n },\n {} as Record<string, any>\n );\n}\n","import { Abi, FunctionAbi } from '../../../types';\nimport { isLen } from '../cairo';\nimport { AbiParserInterface } from './interface';\n\nexport class AbiParser1 implements AbiParserInterface {\n abi: Abi;\n\n constructor(abi: Abi) {\n this.abi = abi;\n }\n\n /**\n * abi method inputs length without '_len' inputs\n * cairo 0 reducer\n * @param abiMethod FunctionAbi\n * @returns number\n */\n public methodInputsLength(abiMethod: FunctionAbi) {\n return abiMethod.inputs.reduce((acc, input) => (!isLen(input.name) ? acc + 1 : acc), 0);\n }\n\n /**\n * get method definition from abi\n * @param name string\n * @returns FunctionAbi | undefined\n */\n public getMethod(name: string): FunctionAbi | undefined {\n return this.abi.find((it) => it.name === name);\n }\n\n /**\n * Get Abi in legacy format\n * @returns Abi\n */\n public getLegacyFormat() {\n return this.abi;\n }\n}\n","import {\n Abi,\n FunctionAbi,\n AbiEvent,\n AbiStruct,\n InterfaceAbi,\n type LegacyEvent,\n} from '../../../types';\nimport { AbiParserInterface } from './interface';\n\nexport class AbiParser2 implements AbiParserInterface {\n abi: Abi;\n\n constructor(abi: Abi) {\n this.abi = abi;\n }\n\n /**\n * abi method inputs length\n * @param abiMethod FunctionAbi\n * @returns number\n */\n public methodInputsLength(abiMethod: FunctionAbi) {\n return abiMethod.inputs.length;\n }\n\n /**\n * get method definition from abi\n * @param name string\n * @returns FunctionAbi | undefined\n */\n public getMethod(name: string): FunctionAbi | undefined {\n const intf = this.abi.find(\n (it: FunctionAbi | AbiEvent | AbiStruct | InterfaceAbi) => it.type === 'interface'\n ) as InterfaceAbi;\n return intf.items.find((it) => it.name === name);\n }\n\n /**\n * Get Abi in legacy format\n * @returns Abi\n */\n public getLegacyFormat(): Abi {\n return this.abi.flatMap((e: FunctionAbi | LegacyEvent | AbiStruct | InterfaceAbi) => {\n if (e.type === 'interface') {\n return e.items;\n }\n return e;\n });\n }\n}\n","import { Abi, FunctionAbi, RawArgs } from '../../../types';\nimport { isCairo1Abi } from '../cairo';\nimport { AbiParserInterface } from './interface';\nimport { AbiParser1 } from './parser-0-1.1.0';\nimport { AbiParser2 } from './parser-2.0.0';\n\nexport function createAbiParser(abi: Abi): AbiParserInterface {\n const version = getAbiVersion(abi);\n if (version === 0 || version === 1) {\n return new AbiParser1(abi);\n }\n if (version === 2) {\n return new AbiParser2(abi);\n }\n throw Error(`Unsupported ABI version ${version}`);\n}\n\nexport function getAbiVersion(abi: Abi) {\n if (abi.find((it) => it.type === 'interface')) return 2;\n if (isCairo1Abi(abi)) return 1;\n return 0;\n}\n\nexport function isNoConstructorValid(\n method: string,\n argsCalldata: RawArgs,\n abiMethod?: FunctionAbi\n) {\n // No constructor in abi and validly empty args\n return method === 'constructor' && !abiMethod && !argsCalldata.length;\n}\n","/* eslint-disable no-plusplus */\nimport { isCairo1Type, isTypeNamedTuple } from './cairo';\n\nfunction parseNamedTuple(namedTuple: string): any {\n const name = namedTuple.substring(0, namedTuple.indexOf(':'));\n const type = namedTuple.substring(name.length + ':'.length);\n return { name, type };\n}\n\nfunction parseSubTuple(s: string) {\n if (!s.includes('(')) return { subTuple: [], result: s };\n const subTuple: string[] = [];\n let result = '';\n let i = 0;\n while (i < s.length) {\n if (s[i] === '(') {\n let counter = 1;\n const lBracket = i;\n i++;\n while (counter) {\n if (s[i] === ')') counter--;\n if (s[i] === '(') counter++;\n i++;\n }\n subTuple.push(s.substring(lBracket, i));\n result += ' ';\n i--;\n } else {\n result += s[i];\n }\n i++;\n }\n\n return {\n subTuple,\n result,\n };\n}\n\nfunction extractCairo0Tuple(type: string) {\n const cleanType = type.replace(/\\s/g, '').slice(1, -1); // remove first lvl () and spaces\n\n // Decompose subTuple\n const { subTuple, result } = parseSubTuple(cleanType);\n\n // Recompose subTuple\n let recomposed = result.split(',').map((it) => {\n return subTuple.length ? it.replace(' ', subTuple.shift() as string) : it;\n });\n\n // Parse named tuple\n if (isTypeNamedTuple(type)) {\n recomposed = recomposed.reduce((acc, it) => {\n return acc.concat(parseNamedTuple(it));\n }, []);\n }\n\n return recomposed;\n}\n\nfunction getClosureOffset(input: string, open: string, close: string): number {\n for (let i = 0, counter = 0; i < input.length; i++) {\n if (input[i] === open) {\n counter++;\n } else if (input[i] === close && --counter === 0) {\n return i;\n }\n }\n return Number.POSITIVE_INFINITY;\n}\n\nfunction extractCairo1Tuple(type: string): string[] {\n // un-named tuples support\n const input = type.slice(1, -1); // remove first lvl ()\n const result: string[] = [];\n\n let currentIndex: number = 0;\n let limitIndex: number;\n\n while (currentIndex < input.length) {\n switch (true) {\n // Tuple\n case input[currentIndex] === '(': {\n limitIndex = currentIndex + getClosureOffset(input.slice(currentIndex), '(', ')') + 1;\n break;\n }\n case input.startsWith('core::result::Result::<', currentIndex) ||\n input.startsWith('core::array::Array::<', currentIndex) ||\n input.startsWith('core::option::Option::<', currentIndex): {\n limitIndex = currentIndex + getClosureOffset(input.slice(currentIndex), '<', '>') + 1;\n break;\n }\n default: {\n const commaIndex = input.indexOf(',', currentIndex);\n limitIndex = commaIndex !== -1 ? commaIndex : Number.POSITIVE_INFINITY;\n }\n }\n\n result.push(input.slice(currentIndex, limitIndex));\n currentIndex = limitIndex + 2; // +2 to skip ', '\n }\n\n return result;\n}\n\n/**\n * Convert tuple string definition into object like definition\n * @param type tuple string definition\n * @returns object like tuple\n */\nexport default function extractTupleMemberTypes(type: string): (string | object)[] {\n if (isCairo1Type(type)) {\n return extractCairo1Tuple(type);\n }\n return extractCairo0Tuple(type);\n}\n","import { AbiEntry, AbiEnums, AbiStructs, CairoEnum, RawArgsObject } from '../../types';\nimport { CairoUint256 } from '../cairoDataTypes/uint256';\nimport { CairoUint512 } from '../cairoDataTypes/uint512';\nimport {\n getArrayType,\n isCairo1Type,\n isLen,\n isTypeArray,\n isTypeByteArray,\n isTypeEnum,\n isTypeEthAddress,\n isTypeNonZero,\n isTypeOption,\n isTypeResult,\n isTypeSecp256k1Point,\n isTypeStruct,\n isTypeTuple,\n} from './cairo';\nimport {\n CairoCustomEnum,\n CairoOption,\n CairoOptionVariant,\n CairoResult,\n CairoResultVariant,\n} from './enum';\nimport extractTupleMemberTypes from './tuple';\n\nimport { isString } from '../shortString';\n\nfunction errorU256(key: string) {\n return Error(\n `Your object includes the property : ${key}, containing an Uint256 object without the 'low' and 'high' keys.`\n );\n}\n\nfunction errorU512(key: string) {\n return Error(\n `Your object includes the property : ${key}, containing an Uint512 object without the 'limb0' to 'limb3' keys.`\n );\n}\n\nexport default function orderPropsByAbi(\n unorderedObject: RawArgsObject,\n abiOfObject: AbiEntry[],\n structs: AbiStructs,\n enums: AbiEnums\n): object {\n const orderInput = (unorderedItem: any, abiType: string): any => {\n if (isTypeArray(abiType)) {\n return orderArray(unorderedItem, abiType);\n }\n if (isTypeEnum(abiType, enums)) {\n const abiObj = enums[abiType];\n // eslint-disable-next-line @typescript-eslint/no-use-before-define\n return orderEnum(unorderedItem, abiObj);\n }\n if (isTypeTuple(abiType)) {\n return orderTuple(unorderedItem, abiType);\n }\n if (isTypeEthAddress(abiType)) {\n return unorderedItem;\n }\n if (isTypeNonZero(abiType)) {\n return unorderedItem;\n }\n if (isTypeByteArray(abiType)) {\n return unorderedItem;\n }\n if (isTypeSecp256k1Point(abiType)) {\n return unorderedItem;\n }\n if (CairoUint256.isAbiType(abiType)) {\n const u256 = unorderedItem;\n if (typeof u256 !== 'object') {\n // BigNumberish --> just copy\n return u256;\n }\n if (!('low' in u256 && 'high' in u256)) {\n throw errorU256(abiType);\n }\n return { low: u256.low, high: u256.high };\n }\n if (CairoUint512.isAbiType(abiType)) {\n const u512 = unorderedItem;\n if (typeof u512 !== 'object') {\n // BigNumberish --> just copy\n return u512;\n }\n if (!['limb0', 'limb1', 'limb2', 'limb3'].every((key) => key in u512)) {\n throw errorU512(abiType);\n }\n return { limb0: u512.limb0, limb1: u512.limb1, limb2: u512.limb2, limb3: u512.limb3 };\n }\n if (isTypeStruct(abiType, structs)) {\n const abiOfStruct = structs[abiType].members;\n // eslint-disable-next-line @typescript-eslint/no-use-before-define\n return orderStruct(unorderedItem, abiOfStruct);\n }\n // literals\n return unorderedItem;\n };\n\n const orderStruct = (unorderedObject2: RawArgsObject, abiObject: AbiEntry[]): object => {\n const orderedObject2 = abiObject.reduce((orderedObject, abiParam) => {\n const setProperty = (value?: any) =>\n Object.defineProperty(orderedObject, abiParam.name, {\n enumerable: true,\n value: value ?? unorderedObject2[abiParam.name],\n });\n\n if (unorderedObject2[abiParam.name] === 'undefined') {\n if (isCairo1Type(abiParam.type) || !isLen(abiParam.name)) {\n throw Error(`Your object needs a property with key : ${abiParam.name} .`);\n }\n }\n setProperty(orderInput(unorderedObject2[abiParam.name], abiParam.type));\n return orderedObject;\n }, {});\n return orderedObject2;\n };\n\n function orderArray(myArray: Array<any> | string, abiParam: string): Array<any> | string {\n const typeInArray = getArrayType(abiParam);\n if (isString(myArray)) {\n return myArray; // longstring\n }\n return myArray.map((myElem) => orderInput(myElem, typeInArray));\n }\n\n function orderTuple(unorderedObject2: RawArgsObject, abiParam: string): object {\n const typeList = extractTupleMemberTypes(abiParam);\n const orderedObject2 = typeList.reduce((orderedObject: object, abiTypeCairoX: any, index) => {\n const myObjKeys: string[] = Object.keys(unorderedObject2);\n const setProperty = (value?: any) =>\n Object.defineProperty(orderedObject, index.toString(), {\n enumerable: true,\n value: value ?? unorderedObject2[myObjKeys[index]],\n });\n const abiType: string = abiTypeCairoX?.type ? abiTypeCairoX.type : abiTypeCairoX; // Named tuple, or tuple\n setProperty(orderInput(unorderedObject2[myObjKeys[index]], abiType));\n return orderedObject;\n }, {});\n return orderedObject2;\n }\n\n const orderEnum = (unorderedObject2: CairoEnum, abiObject: AbiEntry): CairoEnum => {\n if (isTypeResult(abiObject.name)) {\n const unorderedResult = unorderedObject2 as CairoResult<any, any>;\n const resultOkType: string = abiObject.name.substring(\n abiObject.name.indexOf('<') + 1,\n abiObject.name.lastIndexOf(',')\n );\n const resultErrType: string = abiObject.name.substring(\n abiObject.name.indexOf(',') + 1,\n abiObject.name.lastIndexOf('>')\n );\n if (unorderedResult.isOk()) {\n return new CairoResult<any, any>(\n CairoResultVariant.Ok,\n orderInput(unorderedObject2.unwrap(), resultOkType)\n );\n }\n return new CairoResult<any, any>(\n CairoResultVariant.Err,\n orderInput(unorderedObject2.unwrap(), resultErrType)\n );\n }\n if (isTypeOption(abiObject.name)) {\n const unorderedOption = unorderedObject2 as CairoOption<any>;\n const resultSomeType: string = abiObject.name.substring(\n abiObject.name.indexOf('<') + 1,\n abiObject.name.lastIndexOf('>')\n );\n if (unorderedOption.isSome()) {\n return new CairoOption<any>(\n CairoOptionVariant.Some,\n orderInput(unorderedOption.unwrap(), resultSomeType)\n );\n }\n // none(())\n return new CairoOption<any>(CairoOptionVariant.None, {});\n }\n // custom Enum\n const unorderedCustomEnum = unorderedObject2 as CairoCustomEnum;\n const variants = Object.entries(unorderedCustomEnum.variant);\n const newEntries = variants.map((variant) => {\n if (typeof variant[1] === 'undefined') {\n return variant;\n }\n const variantType: string = abiObject.type.substring(\n abiObject.type.lastIndexOf('<') + 1,\n abiObject.type.lastIndexOf('>')\n );\n if (variantType === '()') {\n return variant;\n }\n return [variant[0], orderInput(unorderedCustomEnum.unwrap(), variantType)];\n });\n return new CairoCustomEnum(Object.fromEntries(newEntries));\n };\n\n // Order Call Parameters\n const finalOrderedObject = abiOfObject.reduce((orderedObject, abiParam) => {\n const setProperty = (value: any) =>\n Object.defineProperty(orderedObject, abiParam.name, {\n enumerable: true,\n value,\n });\n if (isLen(abiParam.name) && !isCairo1Type(abiParam.type)) {\n return orderedObject;\n }\n setProperty(orderInput(unorderedObject[abiParam.name], abiParam.type));\n return orderedObject;\n }, {});\n return finalOrderedObject;\n}\n","import {\n AbiEntry,\n AbiEnums,\n AbiStructs,\n AllowArray,\n BigNumberish,\n ByteArray,\n CairoEnum,\n ParsedStruct,\n Tupled,\n} from '../../types';\nimport { CairoUint256 } from '../cairoDataTypes/uint256';\nimport { CairoUint512 } from '../cairoDataTypes/uint512';\nimport { addHexPrefix, removeHexPrefix } from '../encode';\nimport { toHex } from '../num';\nimport { encodeShortString, isString, isText, splitLongString } from '../shortString';\nimport { byteArrayFromString } from './byteArray';\nimport {\n felt,\n getArrayType,\n isTypeArray,\n isTypeBytes31,\n isTypeEnum,\n isTypeNonZero,\n isTypeOption,\n isTypeResult,\n isTypeSecp256k1Point,\n isTypeStruct,\n isTypeTuple,\n uint256,\n} from './cairo';\nimport {\n CairoCustomEnum,\n CairoOption,\n CairoOptionVariant,\n CairoResult,\n CairoResultVariant,\n} from './enum';\nimport extractTupleMemberTypes from './tuple';\n\n/**\n * parse base types\n * @param type type from abi\n * @param val value provided\n * @returns string | string[]\n */\nfunction parseBaseTypes(type: string, val: BigNumberish): AllowArray<string> {\n switch (true) {\n case CairoUint256.isAbiType(type):\n return new CairoUint256(val).toApiRequest();\n case CairoUint512.isAbiType(type):\n return new CairoUint512(val).toApiRequest();\n case isTypeBytes31(type):\n return encodeShortString(val.toString());\n case isTypeSecp256k1Point(type): {\n const pubKeyETH = removeHexPrefix(toHex(val)).padStart(128, '0');\n const pubKeyETHy = uint256(addHexPrefix(pubKeyETH.slice(-64)));\n const pubKeyETHx = uint256(addHexPrefix(pubKeyETH.slice(0, -64)));\n return [\n felt(pubKeyETHx.low),\n felt(pubKeyETHx.high),\n felt(pubKeyETHy.low),\n felt(pubKeyETHy.high),\n ];\n }\n default:\n return felt(val);\n }\n}\n\n/**\n * Parse tuple type string to array of known objects\n * @param element request element\n * @param typeStr tuple type string\n * @returns Tupled[]\n */\nfunction parseTuple(element: object, typeStr: string): Tupled[] {\n const memberTypes = extractTupleMemberTypes(typeStr);\n const elements = Object.values(element);\n\n if (elements.length !== memberTypes.length) {\n throw Error(\n `ParseTuple: provided and expected abi tuple size do not match.\n provided: ${elements} \n expected: ${memberTypes}`\n );\n }\n\n return memberTypes.map((it: any, dx: number) => {\n return {\n element: elements[dx],\n type: it.type ?? it,\n };\n });\n}\n\nfunction parseByteArray(element: string): string[] {\n const myByteArray: ByteArray = byteArrayFromString(element);\n return [\n myByteArray.data.length.toString(),\n ...myByteArray.data.map((bn) => bn.toString()),\n myByteArray.pending_word.toString(),\n myByteArray.pending_word_len.toString(),\n ];\n}\n\n/**\n * Deep parse of the object that has been passed to the method\n *\n * @param element - element that needs to be parsed\n * @param type - name of the method\n * @param structs - structs from abi\n * @param enums - enums from abi\n * @return {string | string[]} - parsed arguments in format that contract is expecting\n */\nfunction parseCalldataValue(\n element:\n | ParsedStruct\n | BigNumberish\n | BigNumberish[]\n | CairoOption<any>\n | CairoResult<any, any>\n | CairoEnum,\n type: string,\n structs: AbiStructs,\n enums: AbiEnums\n): string | string[] {\n if (element === undefined) {\n throw Error(`Missing parameter for type ${type}`);\n }\n\n // value is Array\n if (Array.isArray(element)) {\n const result: string[] = [];\n result.push(felt(element.length)); // Add length to array\n const arrayType = getArrayType(type);\n\n return element.reduce((acc, it) => {\n return acc.concat(parseCalldataValue(it, arrayType, structs, enums));\n }, result);\n }\n\n // checking if the passed element is struct\n if (structs[type] && structs[type].members.length) {\n if (CairoUint256.isAbiType(type)) {\n return new CairoUint256(element as any).toApiRequest();\n }\n if (CairoUint512.isAbiType(type)) {\n return new CairoUint512(element as any).toApiRequest();\n }\n if (type === 'core::starknet::eth_address::EthAddress')\n return parseBaseTypes(type, element as BigNumberish);\n\n if (type === 'core::byte_array::ByteArray') return parseByteArray(element as string);\n\n const { members } = structs[type];\n const subElement = element as any;\n\n return members.reduce((acc, it: AbiEntry) => {\n return acc.concat(parseCalldataValue(subElement[it.name], it.type, structs, enums));\n }, [] as string[]);\n }\n // check if abi element is tuple\n if (isTypeTuple(type)) {\n const tupled = parseTuple(element as object, type);\n\n return tupled.reduce((acc, it: Tupled) => {\n const parsedData = parseCalldataValue(it.element, it.type, structs, enums);\n return acc.concat(parsedData);\n }, [] as string[]);\n }\n // check if u256 C1v0\n if (CairoUint256.isAbiType(type)) {\n return new CairoUint256(element as any).toApiRequest();\n }\n // check if u512\n if (CairoUint512.isAbiType(type)) {\n return new CairoUint512(element as any).toApiRequest();\n }\n // check if Enum\n if (isTypeEnum(type, enums)) {\n const { variants } = enums[type];\n // Option Enum\n if (isTypeOption(type)) {\n const myOption = element as CairoOption<any>;\n if (myOption.isSome()) {\n const listTypeVariant = variants.find((variant) => variant.name === 'Some');\n if (typeof listTypeVariant === 'undefined') {\n throw Error(`Error in abi : Option has no 'Some' variant.`);\n }\n const typeVariantSome = listTypeVariant.type;\n if (typeVariantSome === '()') {\n return CairoOptionVariant.Some.toString();\n }\n const parsedParameter = parseCalldataValue(\n myOption.unwrap(),\n typeVariantSome,\n structs,\n enums\n );\n if (Array.isArray(parsedParameter)) {\n return [CairoOptionVariant.Some.toString(), ...parsedParameter];\n }\n return [CairoOptionVariant.Some.toString(), parsedParameter];\n }\n return CairoOptionVariant.None.toString();\n }\n // Result Enum\n if (isTypeResult(type)) {\n const myResult = element as CairoResult<any, any>;\n if (myResult.isOk()) {\n const listTypeVariant = variants.find((variant) => variant.name === 'Ok');\n if (typeof listTypeVariant === 'undefined') {\n throw Error(`Error in abi : Result has no 'Ok' variant.`);\n }\n const typeVariantOk = listTypeVariant.type;\n if (typeVariantOk === '()') {\n return CairoResultVariant.Ok.toString();\n }\n const parsedParameter = parseCalldataValue(\n myResult.unwrap(),\n typeVariantOk,\n structs,\n enums\n );\n if (Array.isArray(parsedParameter)) {\n return [CairoResultVariant.Ok.toString(), ...parsedParameter];\n }\n return [CairoResultVariant.Ok.toString(), parsedParameter];\n }\n // is Result::Err\n const listTypeVariant = variants.find((variant) => variant.name === 'Err');\n if (typeof listTypeVariant === 'undefined') {\n throw Error(`Error in abi : Result has no 'Err' variant.`);\n }\n const typeVariantErr = listTypeVariant.type;\n if (typeVariantErr === '()') {\n return CairoResultVariant.Err.toString();\n }\n const parsedParameter = parseCalldataValue(myResult.unwrap(), typeVariantErr, structs, enums);\n if (Array.isArray(parsedParameter)) {\n return [CairoResultVariant.Err.toString(), ...parsedParameter];\n }\n return [CairoResultVariant.Err.toString(), parsedParameter];\n }\n // Custom Enum\n const myEnum = element as CairoCustomEnum;\n const activeVariant: string = myEnum.activeVariant();\n const listTypeVariant = variants.find((variant) => variant.name === activeVariant);\n if (typeof listTypeVariant === 'undefined') {\n throw Error(`Not find in abi : Enum has no '${activeVariant}' variant.`);\n }\n const typeActiveVariant = listTypeVariant.type;\n const numActiveVariant = variants.findIndex((variant) => variant.name === activeVariant); // can not fail due to check of listTypeVariant\n if (typeActiveVariant === '()') {\n return numActiveVariant.toString();\n }\n const parsedParameter = parseCalldataValue(myEnum.unwrap(), typeActiveVariant, structs, enums);\n if (Array.isArray(parsedParameter)) {\n return [numActiveVariant.toString(), ...parsedParameter];\n }\n return [numActiveVariant.toString(), parsedParameter];\n }\n\n if (isTypeNonZero(type)) {\n return parseBaseTypes(getArrayType(type), element as BigNumberish);\n }\n\n if (typeof element === 'object') {\n throw Error(`Parameter ${element} do not align with abi parameter ${type}`);\n }\n return parseBaseTypes(type, element);\n}\n\n/**\n * Parse one field of the calldata by using input field from the abi for that method\n *\n * @param argsIterator - Iterator for value of the field\n * @param input - input(field) information from the abi that will be used to parse the data\n * @param structs - structs from abi\n * @param enums - enums from abi\n * @return {string | string[]} - parsed arguments in format that contract is expecting\n */\nexport function parseCalldataField(\n argsIterator: Iterator<any>,\n input: AbiEntry,\n structs: AbiStructs,\n enums: AbiEnums\n): string | string[] {\n const { name, type } = input;\n let { value } = argsIterator.next();\n\n switch (true) {\n // Array\n case isTypeArray(type):\n if (!Array.isArray(value) && !isText(value)) {\n throw Error(`ABI expected parameter ${name} to be array or long string, got ${value}`);\n }\n if (isString(value)) {\n // long string match cairo felt*\n value = splitLongString(value);\n }\n return parseCalldataValue(value, input.type, structs, enums);\n case isTypeNonZero(type):\n return parseBaseTypes(getArrayType(type), value);\n case type === 'core::starknet::eth_address::EthAddress':\n return parseBaseTypes(type, value);\n // Struct or Tuple\n case isTypeStruct(type, structs) ||\n isTypeTuple(type) ||\n CairoUint256.isAbiType(type) ||\n CairoUint256.isAbiType(type):\n return parseCalldataValue(value as ParsedStruct | BigNumberish[], type, structs, enums);\n\n // Enums\n case isTypeEnum(type, enums):\n return parseCalldataValue(\n value as CairoOption<any> | CairoResult<any, any> | CairoEnum,\n type,\n structs,\n enums\n );\n\n // Felt or unhandled\n default:\n return parseBaseTypes(type, value);\n }\n}\n","/* eslint-disable no-case-declarations */\nimport {\n AbiEntry,\n AbiEnums,\n AbiStructs,\n Args,\n BigNumberish,\n ByteArray,\n CairoEnum,\n EventEntry,\n ParsedStruct,\n} from '../../types';\nimport { CairoUint256 } from '../cairoDataTypes/uint256';\nimport { CairoUint512 } from '../cairoDataTypes/uint512';\nimport { addHexPrefix, removeHexPrefix } from '../encode';\nimport { toHex } from '../num';\nimport { decodeShortString } from '../shortString';\nimport { stringFromByteArray } from './byteArray';\nimport {\n getArrayType,\n isCairo1Type,\n isLen,\n isTypeArray,\n isTypeBool,\n isTypeByteArray,\n isTypeEnum,\n isTypeNonZero,\n isTypeSecp256k1Point,\n isTypeTuple,\n} from './cairo';\nimport {\n CairoCustomEnum,\n CairoEnumRaw,\n CairoOption,\n CairoOptionVariant,\n CairoResult,\n CairoResultVariant,\n} from './enum';\nimport extractTupleMemberTypes from './tuple';\n\n/**\n * Parse base types\n * @param type type of element\n * @param it iterator\n * @returns bigint | boolean\n */\nfunction parseBaseTypes(type: string, it: Iterator<string>) {\n let temp;\n switch (true) {\n case isTypeBool(type):\n temp = it.next().value;\n return Boolean(BigInt(temp));\n case CairoUint256.isAbiType(type):\n const low = it.next().value;\n const high = it.next().value;\n return new CairoUint256(low, high).toBigInt();\n case CairoUint512.isAbiType(type):\n const limb0 = it.next().value;\n const limb1 = it.next().value;\n const limb2 = it.next().value;\n const limb3 = it.next().value;\n return new CairoUint512(limb0, limb1, limb2, limb3).toBigInt();\n case type === 'core::starknet::eth_address::EthAddress':\n temp = it.next().value;\n return BigInt(temp);\n case type === 'core::bytes_31::bytes31':\n temp = it.next().value;\n return decodeShortString(temp);\n case isTypeSecp256k1Point(type):\n const xLow = removeHexPrefix(it.next().value).padStart(32, '0');\n const xHigh = removeHexPrefix(it.next().value).padStart(32, '0');\n const yLow = removeHexPrefix(it.next().value).padStart(32, '0');\n const yHigh = removeHexPrefix(it.next().value).padStart(32, '0');\n const pubK = BigInt(addHexPrefix(xHigh + xLow + yHigh + yLow));\n return pubK;\n default:\n temp = it.next().value;\n return BigInt(temp);\n }\n}\n\n/**\n * Parse of the response elements that are converted to Object (Struct) by using the abi\n *\n * @param responseIterator - iterator of the response\n * @param element - element of the field {name: string, type: string}\n * @param structs - structs from abi\n * @param enums\n * @return {any} - parsed arguments in format that contract is expecting\n */\nfunction parseResponseValue(\n responseIterator: Iterator<string>,\n element: { name: string; type: string },\n structs?: AbiStructs,\n enums?: AbiEnums\n): BigNumberish | ParsedStruct | boolean | any[] | CairoEnum {\n if (element.type === '()') {\n return {};\n }\n // type uint256 struct (c1v2)\n if (CairoUint256.isAbiType(element.type)) {\n const low = responseIterator.next().value;\n const high = responseIterator.next().value;\n return new CairoUint256(low, high).toBigInt();\n }\n // type uint512 struct\n if (CairoUint512.isAbiType(element.type)) {\n const limb0 = responseIterator.next().value;\n const limb1 = responseIterator.next().value;\n const limb2 = responseIterator.next().value;\n const limb3 = responseIterator.next().value;\n return new CairoUint512(limb0, limb1, limb2, limb3).toBigInt();\n }\n // type C1 ByteArray struct, representing a LongString\n if (isTypeByteArray(element.type)) {\n const parsedBytes31Arr: BigNumberish[] = [];\n const bytes31ArrLen = BigInt(responseIterator.next().value);\n while (parsedBytes31Arr.length < bytes31ArrLen) {\n parsedBytes31Arr.push(toHex(responseIterator.next().value));\n }\n const pending_word = toHex(responseIterator.next().value);\n const pending_word_len = BigInt(responseIterator.next().value);\n const myByteArray: ByteArray = {\n data: parsedBytes31Arr,\n pending_word,\n pending_word_len,\n };\n return stringFromByteArray(myByteArray);\n }\n\n // type c1 array\n if (isTypeArray(element.type)) {\n // eslint-disable-next-line no-case-declarations\n const parsedDataArr: (BigNumberish | ParsedStruct | boolean | any[] | CairoEnum)[] = [];\n const el: AbiEntry = { name: '', type: getArrayType(element.type) };\n const len = BigInt(responseIterator.next().value); // get length\n while (parsedDataArr.length < len) {\n parsedDataArr.push(parseResponseValue(responseIterator, el, structs, enums));\n }\n return parsedDataArr;\n }\n\n // type NonZero\n if (isTypeNonZero(element.type)) {\n // eslint-disable-next-line no-case-declarations\n // const parsedDataArr: (BigNumberish | ParsedStruct | boolean | any[] | CairoEnum)[] = [];\n const el: AbiEntry = { name: '', type: getArrayType(element.type) };\n // parsedDataArr.push();\n return parseResponseValue(responseIterator, el, structs, enums);\n }\n\n // type struct\n if (structs && element.type in structs && structs[element.type]) {\n if (element.type === 'core::starknet::eth_address::EthAddress') {\n return parseBaseTypes(element.type, responseIterator);\n }\n return structs[element.type].members.reduce((acc, el) => {\n acc[el.name] = parseResponseValue(responseIterator, el, structs, enums);\n return acc;\n }, {} as any);\n }\n\n // type Enum (only CustomEnum)\n if (enums && element.type in enums && enums[element.type]) {\n const variantNum: number = Number(responseIterator.next().value); // get variant number\n const rawEnum = enums[element.type].variants.reduce((acc, variant, num) => {\n if (num === variantNum) {\n acc[variant.name] = parseResponseValue(\n responseIterator,\n { name: '', type: variant.type },\n structs,\n enums\n );\n return acc;\n }\n acc[variant.name] = undefined;\n return acc;\n }, {} as CairoEnumRaw);\n // Option\n if (element.type.startsWith('core::option::Option')) {\n const content = variantNum === CairoOptionVariant.Some ? rawEnum.Some : undefined;\n return new CairoOption<Object>(variantNum, content);\n }\n // Result\n if (element.type.startsWith('core::result::Result')) {\n let content: Object;\n if (variantNum === CairoResultVariant.Ok) {\n content = rawEnum.Ok;\n } else {\n content = rawEnum.Err;\n }\n return new CairoResult<Object, Object>(variantNum, content);\n }\n // Cairo custom Enum\n const customEnum = new CairoCustomEnum(rawEnum);\n return customEnum;\n }\n\n // type tuple\n if (isTypeTuple(element.type)) {\n const memberTypes = extractTupleMemberTypes(element.type);\n return memberTypes.reduce((acc, it: any, idx) => {\n const name = it?.name ? it.name : idx;\n const type = it?.type ? it.type : it;\n const el = { name, type };\n acc[name] = parseResponseValue(responseIterator, el, structs, enums);\n return acc;\n }, {} as any);\n }\n\n // type c1 array\n if (isTypeArray(element.type)) {\n // eslint-disable-next-line no-case-declarations\n const parsedDataArr: (BigNumberish | ParsedStruct | boolean | any[] | CairoEnum)[] = [];\n const el = { name: '', type: getArrayType(element.type) };\n const len = BigInt(responseIterator.next().value); // get length\n while (parsedDataArr.length < len) {\n parsedDataArr.push(parseResponseValue(responseIterator, el, structs, enums));\n }\n return parsedDataArr;\n }\n\n // base type\n return parseBaseTypes(element.type, responseIterator);\n}\n\n/**\n * Parse elements of the response and structuring them into one field by using output property from the abi for that method\n *\n * @param responseIterator - iterator of the response\n * @param output - output(field) information from the abi that will be used to parse the data\n * @param structs - structs from abi\n * @param parsedResult\n * @return - parsed response corresponding to the abi structure of the field\n */\nexport default function responseParser(\n responseIterator: Iterator<string>,\n output: AbiEntry | EventEntry,\n structs?: AbiStructs,\n enums?: AbiEnums,\n parsedResult?: Args | ParsedStruct\n): any {\n const { name, type } = output;\n let temp;\n\n switch (true) {\n case isLen(name):\n temp = responseIterator.next().value;\n return BigInt(temp);\n\n case (structs && type in structs) || isTypeTuple(type):\n return parseResponseValue(responseIterator, output, structs, enums);\n\n case enums && isTypeEnum(type, enums):\n return parseResponseValue(responseIterator, output, structs, enums);\n\n case isTypeArray(type):\n // C1 Array\n if (isCairo1Type(type)) {\n return parseResponseValue(responseIterator, output, structs, enums);\n }\n // C0 Array\n // eslint-disable-next-line no-case-declarations\n const parsedDataArr: (BigNumberish | ParsedStruct | boolean | any[] | CairoEnum)[] = [];\n if (parsedResult && parsedResult[`${name}_len`]) {\n const arrLen = parsedResult[`${name}_len`] as number;\n while (parsedDataArr.length < arrLen) {\n parsedDataArr.push(\n parseResponseValue(\n responseIterator,\n { name, type: output.type.replace('*', '') },\n structs,\n enums\n )\n );\n }\n }\n return parsedDataArr;\n\n case isTypeNonZero(type):\n return parseResponseValue(responseIterator, output, structs, enums);\n\n default:\n return parseBaseTypes(type, responseIterator);\n }\n}\n","/**\n * Validate cairo contract method arguments\n * Flow: Determine type from abi and than validate against parameter\n */\nimport {\n AbiEntry,\n AbiEnums,\n AbiStructs,\n BigNumberish,\n FunctionAbi,\n Literal,\n Uint,\n} from '../../types';\nimport assert from '../assert';\nimport { CairoUint256 } from '../cairoDataTypes/uint256';\nimport { CairoUint512 } from '../cairoDataTypes/uint512';\nimport { isBigInt, isBoolean, isHex, isNumber, toBigInt } from '../num';\nimport { isLongText, isString } from '../shortString';\nimport {\n getArrayType,\n isLen,\n isTypeArray,\n isTypeBool,\n isTypeByteArray,\n isTypeBytes31,\n isTypeEnum,\n isTypeFelt,\n isTypeLiteral,\n isTypeNonZero,\n isTypeOption,\n isTypeResult,\n isTypeStruct,\n isTypeTuple,\n isTypeUint,\n} from './cairo';\n\nconst validateFelt = (parameter: any, input: AbiEntry) => {\n assert(\n isString(parameter) || isNumber(parameter) || isBigInt(parameter),\n `Validate: arg ${input.name} should be a felt typed as (String, Number or BigInt)`\n );\n if (isString(parameter) && !isHex(parameter)) return; // shortstring\n const param = BigInt(parameter.toString(10));\n assert(\n // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1266\n param >= 0n && param <= 2n ** 252n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^252-1]`\n );\n};\n\nconst validateBytes31 = (parameter: any, input: AbiEntry) => {\n assert(isString(parameter), `Validate: arg ${input.name} should be a string.`);\n assert(\n parameter.length < 32,\n `Validate: arg ${input.name} cairo typed ${input.type} should be a string of less than 32 characters.`\n );\n};\n\nconst validateByteArray = (parameter: any, input: AbiEntry) => {\n assert(isString(parameter), `Validate: arg ${input.name} should be a string.`);\n};\n\nconst validateUint = (parameter: any, input: AbiEntry) => {\n if (isNumber(parameter)) {\n assert(\n parameter <= Number.MAX_SAFE_INTEGER,\n `Validation: Parameter is to large to be typed as Number use (BigInt or String)`\n );\n }\n assert(\n isString(parameter) ||\n isNumber(parameter) ||\n isBigInt(parameter) ||\n (typeof parameter === 'object' && 'low' in parameter && 'high' in parameter) ||\n (typeof parameter === 'object' &&\n ['limb0', 'limb1', 'limb2', 'limb3'].every((key) => key in parameter)),\n `Validate: arg ${input.name} of cairo type ${\n input.type\n } should be type (String, Number or BigInt), but is ${typeof parameter} ${parameter}.`\n );\n let param: bigint;\n switch (input.type) {\n case Uint.u256:\n param = new CairoUint256(parameter).toBigInt();\n break;\n case Uint.u512:\n param = new CairoUint512(parameter).toBigInt();\n break;\n default:\n param = toBigInt(parameter);\n }\n switch (input.type) {\n case Uint.u8:\n assert(\n param >= 0n && param <= 255n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0 - 255]`\n );\n break;\n\n case Uint.u16:\n assert(\n param >= 0n && param <= 65535n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 65535]`\n );\n break;\n\n case Uint.u32:\n assert(\n param >= 0n && param <= 4294967295n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 4294967295]`\n );\n break;\n\n case Uint.u64:\n assert(\n param >= 0n && param <= 2n ** 64n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^64-1]`\n );\n break;\n\n case Uint.u128:\n assert(\n param >= 0n && param <= 2n ** 128n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^128-1]`\n );\n break;\n\n case Uint.u256:\n assert(\n param >= 0n && param <= 2n ** 256n - 1n,\n `Validate: arg ${input.name} is ${input.type} 0 - 2^256-1`\n );\n break;\n\n case Uint.u512:\n assert(CairoUint512.is(param), `Validate: arg ${input.name} is ${input.type} 0 - 2^512-1`);\n break;\n\n case Literal.ClassHash:\n assert(\n // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1670\n param >= 0n && param <= 2n ** 252n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^252-1]`\n );\n break;\n\n case Literal.ContractAddress:\n assert(\n // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1245\n param >= 0n && param <= 2n ** 252n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^252-1]`\n );\n break;\n case Literal.Secp256k1Point: {\n assert(\n param >= 0n && param <= 2n ** 512n - 1n,\n `Validate: arg ${input.name} must be ${input.type} : a 512 bits number.`\n );\n break;\n }\n\n default:\n break;\n }\n};\n\nconst validateBool = (parameter: any, input: AbiEntry) => {\n assert(\n isBoolean(parameter),\n `Validate: arg ${input.name} of cairo type ${input.type} should be type (Boolean)`\n );\n};\n\nconst validateStruct = (parameter: any, input: AbiEntry, structs: AbiStructs) => {\n // c1v2 uint256 or u512 in struct\n if (input.type === Uint.u256 || input.type === Uint.u512) {\n validateUint(parameter, input);\n return;\n }\n\n if (input.type === 'core::starknet::eth_address::EthAddress') {\n assert(\n typeof parameter !== 'object',\n `EthAddress type is waiting a BigNumberish. Got ${parameter}`\n );\n const param = BigInt(parameter.toString(10));\n assert(\n // from : https://github.com/starkware-libs/starknet-specs/blob/29bab650be6b1847c92d4461d4c33008b5e50b1a/api/starknet_api_openrpc.json#L1259\n param >= 0n && param <= 2n ** 160n - 1n,\n `Validate: arg ${input.name} cairo typed ${input.type} should be in range [0, 2^160-1]`\n );\n return;\n }\n\n assert(\n typeof parameter === 'object' && !Array.isArray(parameter),\n `Validate: arg ${input.name} is cairo type struct (${input.type}), and should be defined as js object (not array)`\n );\n\n // shallow struct validation, only first depth level\n structs[input.type].members.forEach(({ name }) => {\n assert(\n Object.keys(parameter).includes(name),\n `Validate: arg ${input.name} should have a property ${name}`\n );\n });\n};\n\nconst validateEnum = (parameter: any, input: AbiEntry) => {\n assert(\n typeof parameter === 'object' && !Array.isArray(parameter),\n `Validate: arg ${input.name} is cairo type Enum (${input.type}), and should be defined as js object (not array)`\n );\n const methodsKeys = Object.getOwnPropertyNames(Object.getPrototypeOf(parameter));\n const keys = [...Object.getOwnPropertyNames(parameter), ...methodsKeys];\n if (isTypeOption(input.type) && keys.includes('isSome') && keys.includes('isNone')) {\n return; // Option Enum\n }\n if (isTypeResult(input.type) && keys.includes('isOk') && keys.includes('isErr')) {\n return; // Result Enum\n }\n if (keys.includes('variant') && keys.includes('activeVariant')) {\n return; // Custom Enum\n }\n throw new Error(\n `Validate Enum: argument ${input.name}, type ${input.type}, value received ${parameter}, is not an Enum.`\n );\n};\n\nconst validateTuple = (parameter: any, input: AbiEntry) => {\n assert(\n typeof parameter === 'object' && !Array.isArray(parameter),\n `Validate: arg ${input.name} should be a tuple (defined as object)`\n );\n // todo: skip tuple structural validation for now\n};\n\nconst validateArray = (parameter: any, input: AbiEntry, structs: AbiStructs, enums: AbiEnums) => {\n const baseType = getArrayType(input.type);\n // Long text (special case when parameter is not an array but long text)\n if (isTypeFelt(baseType) && isLongText(parameter)) {\n return;\n }\n\n assert(Array.isArray(parameter), `Validate: arg ${input.name} should be an Array`);\n\n switch (true) {\n case isTypeFelt(baseType):\n parameter.forEach((param: BigNumberish) => validateFelt(param, input));\n break;\n case isTypeTuple(baseType):\n parameter.forEach((it: any) => validateTuple(it, { name: input.name, type: baseType }));\n break;\n\n case isTypeArray(baseType):\n parameter.forEach((param: BigNumberish) =>\n validateArray(param, { name: '', type: baseType }, structs, enums)\n );\n break;\n case isTypeStruct(baseType, structs):\n parameter.forEach((it: any) =>\n validateStruct(it, { name: input.name, type: baseType }, structs)\n );\n break;\n case isTypeEnum(baseType, enums):\n parameter.forEach((it: any) => validateEnum(it, { name: input.name, type: baseType }));\n break;\n case isTypeUint(baseType) || isTypeLiteral(baseType):\n parameter.forEach((param: BigNumberish) => validateUint(param, { name: '', type: baseType }));\n break;\n case isTypeBool(baseType):\n parameter.forEach((param: BigNumberish) => validateBool(param, input));\n break;\n default:\n throw new Error(\n `Validate Unhandled: argument ${input.name}, type ${input.type}, value ${parameter}`\n );\n }\n};\n\nconst validateNonZero = (parameter: any, input: AbiEntry) => {\n // Telegram : https://t.me/sncorestars/11902/45433\n // Author : Ori Ziv (08/apr/2024)\n // \"NonZero is only supported for purely numeric types (u*, i* and felt252) and EcPoint.\"\n //\n // As EcPoint do not includes trait Serde, it can't be seen in an ABI.\n // u512 is not compatible.\n // i* are not currently handled by Starknet.js (and core::zeroable::NonZero::<i*> seems not to work in Cairo 2.6.3).\n // so, are authorized here : u8, u16, u32, u64, u128, u256 and felt252.\n\n const baseType = getArrayType(input.type);\n assert(\n (isTypeUint(baseType) && baseType !== CairoUint512.abiSelector) || isTypeFelt(baseType),\n `Validate: ${input.name} type is not authorized for NonZero type.`\n );\n switch (true) {\n case isTypeFelt(baseType):\n validateFelt(parameter, input);\n assert(\n BigInt(parameter.toString(10)) > 0,\n 'Validate: value 0 is not authorized in NonZero felt252 type.'\n );\n break;\n case isTypeUint(baseType):\n validateUint(parameter, { name: '', type: baseType });\n switch (input.type) {\n case Uint.u256:\n assert(\n new CairoUint256(parameter).toBigInt() > 0,\n 'Validate: value 0 is not authorized in NonZero uint256 type.'\n );\n break;\n default:\n assert(\n toBigInt(parameter) > 0,\n 'Validate: value 0 is not authorized in NonZero uint type.'\n );\n }\n break;\n default:\n throw new Error(\n `Validate Unhandled: argument ${input.name}, type ${input.type}, value ${parameter}`\n );\n }\n};\n\nexport default function validateFields(\n abiMethod: FunctionAbi,\n args: Array<any>,\n structs: AbiStructs,\n enums: AbiEnums\n) {\n abiMethod.inputs.reduce((acc, input) => {\n const parameter = args[acc];\n\n switch (true) {\n case isLen(input.name):\n return acc;\n case isTypeFelt(input.type):\n validateFelt(parameter, input);\n break;\n case isTypeBytes31(input.type):\n validateBytes31(parameter, input);\n break;\n case isTypeUint(input.type) || isTypeLiteral(input.type):\n validateUint(parameter, input);\n break;\n case isTypeBool(input.type):\n validateBool(parameter, input);\n break;\n case isTypeByteArray(input.type):\n validateByteArray(parameter, input);\n break;\n case isTypeArray(input.type):\n validateArray(parameter, input, structs, enums);\n break;\n case isTypeStruct(input.type, structs):\n validateStruct(parameter, input, structs);\n break;\n case isTypeEnum(input.type, enums):\n validateEnum(parameter, input);\n break;\n case isTypeTuple(input.type):\n validateTuple(parameter, input);\n break;\n case isTypeNonZero(input.type):\n validateNonZero(parameter, input);\n break;\n default:\n throw new Error(\n `Validate Unhandled: argument ${input.name}, type ${input.type}, value ${parameter}`\n );\n }\n\n return acc + 1;\n }, 0);\n}\n","/* eslint-disable no-plusplus */\nimport {\n Abi,\n AbiEnums,\n AbiStructs,\n AllowArray,\n Args,\n ArgsOrCalldata,\n Calldata,\n FunctionAbi,\n HexCalldata,\n RawArgs,\n RawArgsArray,\n Result,\n ValidateType,\n} from '../../types';\nimport assert from '../assert';\nimport { isBigInt, toHex } from '../num';\nimport { getSelectorFromName } from '../hash/selector';\nimport { isLongText } from '../shortString';\nimport { byteArrayFromString } from './byteArray';\nimport { felt, isCairo1Type, isLen } from './cairo';\nimport {\n CairoCustomEnum,\n CairoOption,\n CairoOptionVariant,\n CairoResult,\n CairoResultVariant,\n} from './enum';\nimport formatter from './formatter';\nimport { createAbiParser, isNoConstructorValid } from './parser';\nimport { AbiParserInterface } from './parser/interface';\nimport orderPropsByAbi from './propertyOrder';\nimport { parseCalldataField } from './requestParser';\nimport responseParser from './responseParser';\nimport validateFields from './validate';\n\nexport * as cairo from './cairo';\nexport * as byteArray from './byteArray';\nexport { parseCalldataField } from './requestParser';\n\nexport class CallData {\n abi: Abi;\n\n parser: AbiParserInterface;\n\n protected readonly structs: AbiStructs;\n\n protected readonly enums: AbiEnums;\n\n constructor(abi: Abi) {\n this.structs = CallData.getAbiStruct(abi);\n this.enums = CallData.getAbiEnum(abi);\n this.parser = createAbiParser(abi);\n this.abi = this.parser.getLegacyFormat();\n }\n\n /**\n * Validate arguments passed to the method as corresponding to the ones in the abi\n * @param type ValidateType - type of the method\n * @param method string - name of the method\n * @param args ArgsOrCalldata - arguments that are passed to the method\n */\n public validate(type: ValidateType, method: string, args: ArgsOrCalldata = []) {\n // ensure provided method of type exists\n if (type !== ValidateType.DEPLOY) {\n const invocableFunctionNames = this.abi\n .filter((abi) => {\n if (abi.type !== 'function') return false;\n const isView = abi.stateMutability === 'view' || abi.state_mutability === 'view';\n return type === ValidateType.INVOKE ? !isView : isView;\n })\n .map((abi) => abi.name);\n assert(\n invocableFunctionNames.includes(method),\n `${type === ValidateType.INVOKE ? 'invocable' : 'viewable'} method not found in abi`\n );\n }\n\n // get requested method from abi\n const abiMethod = this.abi.find((abi) =>\n type === ValidateType.DEPLOY\n ? abi.name === method && abi.type === 'constructor'\n : abi.name === method && abi.type === 'function'\n ) as FunctionAbi;\n\n if (isNoConstructorValid(method, args, abiMethod)) {\n return;\n }\n\n // validate arguments length\n const inputsLength = this.parser.methodInputsLength(abiMethod);\n if (args.length !== inputsLength) {\n throw Error(\n `Invalid number of arguments, expected ${inputsLength} arguments, but got ${args.length}`\n );\n }\n\n // validate parameters\n validateFields(abiMethod, args, this.structs, this.enums);\n }\n\n /**\n * Compile contract callData with abi\n * Parse the calldata by using input fields from the abi for that method\n * @param method string - method name\n * @param argsCalldata RawArgs - arguments passed to the method. Can be an array of arguments (in the order of abi definition), or an object constructed in conformity with abi (in this case, the parameter can be in a wrong order).\n * @return Calldata - parsed arguments in format that contract is expecting\n * @example\n * ```typescript\n * const calldata = myCallData.compile(\"constructor\", [\"0x34a\", [1, 3n]]);\n * ```\n * ```typescript\n * const calldata2 = myCallData.compile(\"constructor\", {list:[1, 3n], balance:\"0x34\"}); // wrong order is valid\n * ```\n */\n public compile(method: string, argsCalldata: RawArgs): Calldata {\n const abiMethod = this.abi.find((abiFunction) => abiFunction.name === method) as FunctionAbi;\n\n if (isNoConstructorValid(method, argsCalldata, abiMethod)) {\n return [];\n }\n\n let args: RawArgsArray;\n if (Array.isArray(argsCalldata)) {\n args = argsCalldata;\n } else {\n // order the object\n const orderedObject = orderPropsByAbi(\n argsCalldata,\n abiMethod.inputs,\n this.structs,\n this.enums\n );\n args = Object.values(orderedObject);\n // // validate array elements to abi\n validateFields(abiMethod, args, this.structs, this.enums);\n }\n\n const argsIterator = args[Symbol.iterator]();\n\n const callArray = abiMethod.inputs.reduce(\n (acc, input) =>\n isLen(input.name) && !isCairo1Type(input.type)\n ? acc\n : acc.concat(parseCalldataField(argsIterator, input, this.structs, this.enums)),\n [] as Calldata\n );\n\n // add compiled property to array object\n Object.defineProperty(callArray, '__compiled__', {\n enumerable: false,\n writable: false,\n value: true,\n });\n return callArray;\n }\n\n /**\n * Compile contract callData without abi\n * @param rawArgs RawArgs representing cairo method arguments or string array of compiled data\n * @returns Calldata\n */\n static compile(rawArgs: RawArgs): Calldata {\n const createTree = (obj: object) => {\n const getEntries = (o: object, prefix = '.'): any => {\n const oe = Array.isArray(o) ? [o.length.toString(), ...o] : o;\n return Object.entries(oe).flatMap(([k, v]) => {\n let value = v;\n if (k === 'entrypoint') value = getSelectorFromName(value);\n else if (isLongText(value)) value = byteArrayFromString(value);\n const kk = Array.isArray(oe) && k === '0' ? '$$len' : k;\n if (isBigInt(value)) return [[`${prefix}${kk}`, felt(value)]];\n if (Object(value) === value) {\n const methodsKeys = Object.getOwnPropertyNames(Object.getPrototypeOf(value));\n const keys = [...Object.getOwnPropertyNames(value), ...methodsKeys];\n if (keys.includes('isSome') && keys.includes('isNone')) {\n // Option\n const myOption = value as CairoOption<any>;\n const variantNb = myOption.isSome()\n ? CairoOptionVariant.Some\n : CairoOptionVariant.None;\n if (myOption.isSome())\n return getEntries({ 0: variantNb, 1: myOption.unwrap() }, `${prefix}${kk}.`);\n return [[`${prefix}${kk}`, felt(variantNb)]];\n }\n if (keys.includes('isOk') && keys.includes('isErr')) {\n // Result\n const myResult = value as CairoResult<any, any>;\n const variantNb = myResult.isOk() ? CairoResultVariant.Ok : CairoResultVariant.Err;\n return getEntries({ 0: variantNb, 1: myResult.unwrap() }, `${prefix}${kk}.`);\n }\n if (keys.includes('variant') && keys.includes('activeVariant')) {\n // CustomEnum\n const myEnum = value as CairoCustomEnum;\n const activeVariant: string = myEnum.activeVariant();\n const listVariants = Object.keys(myEnum.variant);\n const activeVariantNb = listVariants.findIndex(\n (variant: any) => variant === activeVariant\n );\n if (\n typeof myEnum.unwrap() === 'object' &&\n Object.keys(myEnum.unwrap()).length === 0 // empty object : {}\n ) {\n return [[`${prefix}${kk}`, felt(activeVariantNb)]];\n }\n return getEntries({ 0: activeVariantNb, 1: myEnum.unwrap() }, `${prefix}${kk}.`);\n }\n // normal object\n return getEntries(value, `${prefix}${kk}.`);\n }\n return [[`${prefix}${kk}`, felt(value)]];\n });\n };\n const result = Object.fromEntries(getEntries(obj));\n return result;\n };\n\n let callTreeArray;\n if (!Array.isArray(rawArgs)) {\n // flatten structs, tuples, add array length. Process leafs as Felt\n const callTree = createTree(rawArgs);\n // convert to array\n callTreeArray = Object.values(callTree);\n } else {\n // already compiled data but modified or raw args provided as array, recompile it\n // recreate tree\n const callObj = { ...rawArgs };\n const callTree = createTree(callObj);\n callTreeArray = Object.values(callTree);\n }\n\n // add compiled property to array object\n Object.defineProperty(callTreeArray, '__compiled__', {\n enumerable: false,\n writable: false,\n value: true,\n });\n return callTreeArray;\n }\n\n /**\n * Parse elements of the response array and structuring them into response object\n * @param method string - method name\n * @param response string[] - response from the method\n * @return Result - parsed response corresponding to the abi\n */\n public parse(method: string, response: string[]): Result {\n const { outputs } = this.abi.find((abi) => abi.name === method) as FunctionAbi;\n const responseIterator = response.flat()[Symbol.iterator]();\n\n const parsed = outputs.flat().reduce((acc, output, idx) => {\n const propName = output.name ?? idx;\n acc[propName] = responseParser(responseIterator, output, this.structs, this.enums, acc);\n if (acc[propName] && acc[`${propName}_len`]) {\n delete acc[`${propName}_len`];\n }\n return acc;\n }, {} as Args);\n\n // Cairo1 avoid object.0 structure\n return Object.keys(parsed).length === 1 && 0 in parsed ? (parsed[0] as Result) : parsed;\n }\n\n /**\n * Format cairo method response data to native js values based on provided format schema\n * @param method string - cairo method name\n * @param response string[] - cairo method response\n * @param format object - formatter object schema\n * @returns Result - parsed and formatted response object\n */\n public format(method: string, response: string[], format: object): Result {\n const parsed = this.parse(method, response);\n return formatter(parsed as Record<string, any>, format);\n }\n\n /**\n * Helper to extract structs from abi\n * @param abi Abi\n * @returns AbiStructs - structs from abi\n */\n static getAbiStruct(abi: Abi): AbiStructs {\n return abi\n .filter((abiEntry) => abiEntry.type === 'struct')\n .reduce(\n (acc, abiEntry) => ({\n ...acc,\n [abiEntry.name]: abiEntry,\n }),\n {}\n );\n }\n\n /**\n * Helper to extract enums from abi\n * @param abi Abi\n * @returns AbiEnums - enums from abi\n */\n static getAbiEnum(abi: Abi): AbiEnums {\n const fullEnumList = abi\n .filter((abiEntry) => abiEntry.type === 'enum')\n .reduce(\n (acc, abiEntry) => ({\n ...acc,\n [abiEntry.name]: abiEntry,\n }),\n {}\n );\n delete fullEnumList['core::bool'];\n return fullEnumList;\n }\n\n /**\n * Helper: Compile HexCalldata | RawCalldata | RawArgs\n * @param rawCalldata HexCalldata | RawCalldata | RawArgs\n * @returns Calldata\n */\n static toCalldata(rawCalldata: RawArgs = []): Calldata {\n return CallData.compile(rawCalldata);\n }\n\n /**\n * Helper: Convert raw to HexCalldata\n * @param raw HexCalldata | RawCalldata | RawArgs\n * @returns HexCalldata\n */\n static toHex(raw: RawArgs = []): HexCalldata {\n const calldata = CallData.compile(raw);\n return calldata.map((it) => toHex(it));\n }\n\n /**\n * Parse the elements of a contract response and structure them into one or several Result.\n * In Cairo 0, arrays are not supported.\n * @param typeCairo string or string[] - Cairo type name, ex : \"hello::hello::UserData\"\n * @param response string[] - serialized data corresponding to typeCairo.\n * @return Result or Result[] - parsed response corresponding to typeData.\n * @example\n * const res2=helloCallData.decodeParameters(\"hello::hello::UserData\",[\"0x123456\",\"0x1\"]);\n * result = { address: 1193046n, is_claimed: true }\n */\n public decodeParameters(typeCairo: AllowArray<string>, response: string[]): AllowArray<Result> {\n const typeCairoArray = Array.isArray(typeCairo) ? typeCairo : [typeCairo];\n const responseIterator = response.flat()[Symbol.iterator]();\n const decodedArray = typeCairoArray.map(\n (typeParam) =>\n responseParser(\n responseIterator,\n { name: '', type: typeParam },\n this.structs,\n this.enums\n ) as Result\n );\n return decodedArray.length === 1 ? decodedArray[0] : decodedArray;\n }\n}\n","/**\n * Hashes Exports\n */\nexport * as poseidon from '@noble/curves/abstract/poseidon';\nexport * from './selector'; // Preserve legacy export structure\n\nexport * from './transactionHash';\nexport * from './classHash';\n","/**\n * Calculate Hashes for v0 - v2 transactions\n */\n\n/* eslint-disable no-param-reassign */\n/* eslint-disable import/extensions */\nimport { StarknetChainId, TransactionHashPrefix } from '../../../constants';\nimport { BigNumberish, RawCalldata } from '../../../types';\nimport { starkCurve } from '../../ec';\nimport { toBigInt } from '../../num';\n\n/**\n * Compute pedersen hash from data\n * @returns format: hex-string - pedersen hash\n */\nexport function computeHashOnElements(data: BigNumberish[]): string {\n return [...data, data.length]\n .reduce((x: BigNumberish, y: BigNumberish) => starkCurve.pedersen(toBigInt(x), toBigInt(y)), 0)\n .toString();\n}\n\n/**\n * Calculate transaction pedersen hash for common properties\n *\n * Following implementation is based on this python [implementation #](https://github.com/starkware-libs/cairo-lang/blob/b614d1867c64f3fb2cf4a4879348cfcf87c3a5a7/src/starkware/starknet/core/os/transaction_hash/transaction_hash.py)\n * @returns format: hex-string\n */\nexport function calculateTransactionHashCommon(\n txHashPrefix: TransactionHashPrefix,\n version: BigNumberish,\n contractAddress: BigNumberish,\n entryPointSelector: BigNumberish,\n calldata: RawCalldata,\n maxFee: BigNumberish,\n chainId: StarknetChainId,\n additionalData: BigNumberish[] = []\n): string {\n const calldataHash = computeHashOnElements(calldata);\n const dataToHash = [\n txHashPrefix,\n version,\n contractAddress,\n entryPointSelector,\n calldataHash,\n maxFee,\n chainId,\n ...additionalData,\n ];\n return computeHashOnElements(dataToHash);\n}\n\n/**\n * Calculate declare transaction hash\n * @param classHash hex-string\n * @param compiledClassHash hex-string\n * @returns format: hex-string\n */\nexport function calculateDeclareTransactionHash(\n classHash: string,\n senderAddress: BigNumberish,\n version: BigNumberish,\n maxFee: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish,\n compiledClassHash?: string\n): string {\n return calculateTransactionHashCommon(\n TransactionHashPrefix.DECLARE,\n version,\n senderAddress,\n 0,\n [classHash],\n maxFee,\n chainId,\n [nonce, ...(compiledClassHash ? [compiledClassHash] : [])]\n );\n}\n\n/**\n * Calculate deploy_account transaction hash\n * @returns format: hex-string\n */\nexport function calculateDeployAccountTransactionHash(\n contractAddress: BigNumberish,\n classHash: BigNumberish,\n constructorCalldata: RawCalldata,\n salt: BigNumberish,\n version: BigNumberish,\n maxFee: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish\n) {\n const calldata = [classHash, salt, ...constructorCalldata];\n\n return calculateTransactionHashCommon(\n TransactionHashPrefix.DEPLOY_ACCOUNT,\n version,\n contractAddress,\n 0,\n calldata,\n maxFee,\n chainId,\n [nonce]\n );\n}\n\n/**\n * Calculate invoke transaction hash\n * @returns format: hex-string\n */\nexport function calculateTransactionHash(\n contractAddress: BigNumberish,\n version: BigNumberish,\n calldata: RawCalldata,\n maxFee: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish\n): string {\n return calculateTransactionHashCommon(\n TransactionHashPrefix.INVOKE,\n version,\n contractAddress,\n 0,\n calldata,\n maxFee,\n chainId,\n [nonce]\n );\n}\n","// TODO rename\nexport * as starkCurve from '@scure/starknet';\nexport * as weierstrass from '@noble/curves/abstract/weierstrass';\n","/**\n * Calculate Hashes for v3 transactions\n */\n\nimport { poseidonHashMany } from '@scure/starknet';\n\nimport { StarknetChainId, TransactionHashPrefix } from '../../../constants';\nimport { BigNumberish, Calldata } from '../../../types';\nimport { EDAMode, ResourceBounds } from '../../../types/api';\nimport { toHex } from '../../num';\nimport { encodeShortString } from '../../shortString';\n\nconst AToBI = (array: BigNumberish[]) => array.map((it: BigNumberish) => BigInt(it));\n\n/* eslint-disable no-bitwise */\nconst DATA_AVAILABILITY_MODE_BITS = 32n;\nconst MAX_AMOUNT_BITS = 64n;\nconst MAX_PRICE_PER_UNIT_BITS = 128n;\nconst RESOURCE_VALUE_OFFSET = MAX_AMOUNT_BITS + MAX_PRICE_PER_UNIT_BITS;\nconst L1_GAS_NAME = BigInt(encodeShortString('L1_GAS'));\nconst L2_GAS_NAME = BigInt(encodeShortString('L2_GAS'));\n\nexport function hashDAMode(nonceDAMode: BigNumberish, feeDAMode: BigNumberish) {\n return (BigInt(nonceDAMode) << DATA_AVAILABILITY_MODE_BITS) + BigInt(feeDAMode);\n}\n\nexport function hashFeeField(tip: BigNumberish, bounds: ResourceBounds) {\n const L1Bound =\n (L1_GAS_NAME << RESOURCE_VALUE_OFFSET) +\n (BigInt(bounds.l1_gas.max_amount) << MAX_PRICE_PER_UNIT_BITS) +\n BigInt(bounds.l1_gas.max_price_per_unit);\n\n const L2Bound =\n (L2_GAS_NAME << RESOURCE_VALUE_OFFSET) +\n (BigInt(bounds.l2_gas.max_amount) << MAX_PRICE_PER_UNIT_BITS) +\n BigInt(bounds.l2_gas.max_price_per_unit);\n\n return poseidonHashMany([BigInt(tip), L1Bound, L2Bound]);\n}\n\nexport function calculateTransactionHashCommon(\n txHashPrefix: TransactionHashPrefix,\n version: BigNumberish,\n senderAddress: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish,\n tip: BigNumberish,\n paymasterData: BigNumberish[],\n nonceDataAvailabilityMode: EDAMode,\n feeDataAvailabilityMode: EDAMode,\n resourceBounds: ResourceBounds,\n additionalData: BigNumberish[] = []\n): string {\n const feeFieldHash = hashFeeField(tip, resourceBounds);\n const dAModeHash = hashDAMode(nonceDataAvailabilityMode, feeDataAvailabilityMode);\n const dataToHash = AToBI([\n txHashPrefix,\n version,\n senderAddress,\n feeFieldHash,\n poseidonHashMany(AToBI(paymasterData)),\n chainId,\n nonce,\n dAModeHash,\n ...AToBI(additionalData),\n ]);\n return toHex(poseidonHashMany(dataToHash));\n}\n\n/**\n * Calculate v3 deploy_account transaction hash\n * @returns format: hex-string\n */\nexport function calculateDeployAccountTransactionHash(\n contractAddress: BigNumberish,\n classHash: BigNumberish,\n compiledConstructorCalldata: Calldata,\n salt: BigNumberish,\n version: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish,\n nonceDataAvailabilityMode: EDAMode,\n feeDataAvailabilityMode: EDAMode,\n resourceBounds: ResourceBounds,\n tip: BigNumberish,\n paymasterData: BigNumberish[]\n) {\n return calculateTransactionHashCommon(\n TransactionHashPrefix.DEPLOY_ACCOUNT,\n version,\n contractAddress,\n chainId,\n nonce,\n tip,\n paymasterData,\n nonceDataAvailabilityMode,\n feeDataAvailabilityMode,\n resourceBounds,\n [poseidonHashMany(AToBI(compiledConstructorCalldata)), classHash, salt]\n );\n}\n\n/**\n * Calculate v3 declare transaction hash\n * @returns format: hex-string\n */\nexport function calculateDeclareTransactionHash(\n classHash: string,\n compiledClassHash: string,\n senderAddress: BigNumberish,\n version: BigNumberish,\n chainId: StarknetChainId,\n nonce: BigNumberish,\n accountDeploymentData: BigNumberish[],\n nonceDataAvailabilityMode: EDAMode,\n feeDataAvailabilityMode: EDAMode,\n resourceBounds: ResourceBounds,\n tip: BigNumberish,\n paymasterData: BigNumberish[]\n): string {\n return calculateTransactionHashCommon(\n TransactionHashPrefix.DECLARE,\n version,\n senderAddress,\n chainId,\n nonce,\n tip,\n AToBI(paymasterData),\n nonceDataAvailabilityMode,\n feeDataAvailabilityMode,\n resourceBounds,\n [poseidonHashMany(AToBI(accountDeploymentData)), classHash, compiledClassHash]\n );\n}\n\n/**\n * Calculate v3 invoke transaction hash\n * @returns format: hex-string\n */\nexport function calculateInvokeTransactionHash(\n senderAddress: BigNumberish,\n version: BigNumberish,\n compiledCalldata: Calldata,\n chainId: StarknetChainId,\n nonce: BigNumberish,\n accountDeploymentData: BigNumberish[],\n nonceDataAvailabilityMode: EDAMode,\n feeDataAvailabilityMode: EDAMode,\n resourceBounds: ResourceBounds,\n tip: BigNumberish,\n paymasterData: BigNumberish[]\n): string {\n return calculateTransactionHashCommon(\n TransactionHashPrefix.INVOKE,\n version,\n senderAddress,\n chainId,\n nonce,\n tip,\n paymasterData,\n nonceDataAvailabilityMode,\n feeDataAvailabilityMode,\n resourceBounds,\n [poseidonHashMany(AToBI(accountDeploymentData)), poseidonHashMany(AToBI(compiledCalldata))]\n );\n}\n","/**\n * Transaction Hash based on Transaction Version\n */\n\nimport { StarknetChainId } from '../../../constants';\nimport { BigNumberish, Calldata } from '../../../types';\nimport {\n EDAMode,\n ETransactionVersion,\n ETransactionVersion2,\n ETransactionVersion3,\n ResourceBounds,\n} from '../../../types/api';\nimport {\n calculateDeclareTransactionHash as v2calculateDeclareTransactionHash,\n calculateDeployAccountTransactionHash as v2calculateDeployAccountTransactionHash,\n calculateTransactionHash as v2calculateInvokeTransactionHash,\n} from './v2';\nimport {\n calculateDeclareTransactionHash as v3calculateDeclareTransactionHash,\n calculateDeployAccountTransactionHash as v3calculateDeployAccountTransactionHash,\n calculateInvokeTransactionHash as v3calculateInvokeTransactionHash,\n} from './v3';\n\n/*\n * INVOKE TX HASH\n */\n\ntype Version = typeof ETransactionVersion.V3 | typeof ETransactionVersion.F3;\n\nfunction isV3InvokeTx(args: CalcInvokeTxHashArgs): args is CalcV3InvokeTxHashArgs {\n return [ETransactionVersion.V3, ETransactionVersion.F3].includes(args.version as Version);\n}\n\ntype CalcV2InvokeTxHashArgs = {\n senderAddress: BigNumberish;\n version: `${ETransactionVersion2}`;\n compiledCalldata: Calldata;\n maxFee: BigNumberish;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n};\n\ntype CalcV3InvokeTxHashArgs = {\n senderAddress: BigNumberish;\n version: `${ETransactionVersion3}`;\n compiledCalldata: Calldata;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n accountDeploymentData: BigNumberish[];\n nonceDataAvailabilityMode: EDAMode;\n feeDataAvailabilityMode: EDAMode;\n resourceBounds: ResourceBounds;\n tip: BigNumberish;\n paymasterData: BigNumberish[];\n};\n\ntype CalcInvokeTxHashArgs = CalcV2InvokeTxHashArgs | CalcV3InvokeTxHashArgs;\n\nexport function calculateInvokeTransactionHash(args: CalcInvokeTxHashArgs) {\n if (isV3InvokeTx(args)) {\n return v3calculateInvokeTransactionHash(\n args.senderAddress,\n args.version,\n args.compiledCalldata,\n args.chainId,\n args.nonce,\n args.accountDeploymentData,\n args.nonceDataAvailabilityMode,\n args.feeDataAvailabilityMode,\n args.resourceBounds,\n args.tip,\n args.paymasterData\n );\n }\n return v2calculateInvokeTransactionHash(\n args.senderAddress,\n args.version,\n args.compiledCalldata,\n args.maxFee,\n args.chainId,\n args.nonce\n );\n}\n\n/*\n * DECLARE TX HASH\n */\nfunction isV3DeclareTx(args: CalcDeclareTxHashArgs): args is CalcV3DeclareTxHashArgs {\n return [ETransactionVersion.V3, ETransactionVersion.F3].includes(args.version as Version);\n}\n\ntype CalcV2DeclareTxHashArgs = {\n classHash: string;\n senderAddress: BigNumberish;\n version: `${ETransactionVersion2}`;\n maxFee: BigNumberish;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n compiledClassHash?: string;\n};\n\ntype CalcV3DeclareTxHashArgs = {\n classHash: string;\n compiledClassHash: string;\n senderAddress: BigNumberish;\n version: `${ETransactionVersion3}`;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n accountDeploymentData: BigNumberish[];\n nonceDataAvailabilityMode: EDAMode;\n feeDataAvailabilityMode: EDAMode;\n resourceBounds: ResourceBounds;\n tip: BigNumberish;\n paymasterData: BigNumberish[];\n};\n\ntype CalcDeclareTxHashArgs = CalcV2DeclareTxHashArgs | CalcV3DeclareTxHashArgs;\n\nexport function calculateDeclareTransactionHash(args: CalcDeclareTxHashArgs) {\n if (isV3DeclareTx(args)) {\n return v3calculateDeclareTransactionHash(\n args.classHash,\n args.compiledClassHash,\n args.senderAddress,\n args.version,\n args.chainId,\n args.nonce,\n args.accountDeploymentData,\n args.nonceDataAvailabilityMode,\n args.feeDataAvailabilityMode,\n args.resourceBounds,\n args.tip,\n args.paymasterData\n );\n }\n\n return v2calculateDeclareTransactionHash(\n args.classHash,\n args.senderAddress,\n args.version,\n args.maxFee,\n args.chainId,\n args.nonce,\n args.compiledClassHash\n );\n}\n\n/*\n * DEPLOY ACCOUNT TX HASH\n */\n\nfunction isV3DeployAccountTx(\n args: CalcDeployAccountTxHashArgs\n): args is CalcV3DeployAccountTxHashArgs {\n return [ETransactionVersion.V3, ETransactionVersion.F3].includes(args.version as Version);\n}\n\ntype CalcV2DeployAccountTxHashArgs = {\n contractAddress: BigNumberish;\n classHash: BigNumberish;\n constructorCalldata: Calldata;\n salt: BigNumberish;\n version: `${ETransactionVersion2}`;\n maxFee: BigNumberish;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n};\n\ntype CalcV3DeployAccountTxHashArgs = {\n contractAddress: BigNumberish;\n classHash: BigNumberish;\n compiledConstructorCalldata: Calldata;\n salt: BigNumberish;\n version: `${ETransactionVersion3}`;\n chainId: StarknetChainId;\n nonce: BigNumberish;\n nonceDataAvailabilityMode: EDAMode;\n feeDataAvailabilityMode: EDAMode;\n resourceBounds: ResourceBounds;\n tip: BigNumberish;\n paymasterData: BigNumberish[];\n};\n\ntype CalcDeployAccountTxHashArgs = CalcV2DeployAccountTxHashArgs | CalcV3DeployAccountTxHashArgs;\n\nexport function calculateDeployAccountTransactionHash(args: CalcDeployAccountTxHashArgs) {\n if (isV3DeployAccountTx(args)) {\n return v3calculateDeployAccountTransactionHash(\n args.contractAddress,\n args.classHash,\n args.compiledConstructorCalldata,\n args.salt,\n args.version,\n args.chainId,\n args.nonce,\n args.nonceDataAvailabilityMode,\n args.feeDataAvailabilityMode,\n args.resourceBounds,\n args.tip,\n args.paymasterData\n );\n }\n\n return v2calculateDeployAccountTransactionHash(\n args.contractAddress,\n args.classHash,\n args.constructorCalldata,\n args.salt,\n args.version,\n args.maxFee,\n args.chainId,\n args.nonce\n );\n}\n","/**\n * Class Hash\n */\n\nimport { poseidonHashMany } from '@scure/starknet';\n\nimport { ADDR_BOUND, API_VERSION } from '../../constants';\nimport {\n BigNumberish,\n Builtins,\n CompiledContract,\n CompiledSierra,\n CompiledSierraCasm,\n ContractEntryPointFields,\n LegacyCompiledContract,\n RawArgs,\n SierraContractEntryPointFields,\n} from '../../types';\nimport { CallData } from '../calldata';\nimport { felt } from '../calldata/cairo';\nimport { starkCurve } from '../ec';\nimport { addHexPrefix, utf8ToArray } from '../encode';\nimport { parse, stringify } from '../json';\nimport { toHex } from '../num';\nimport { encodeShortString, isString } from '../shortString';\n\nexport function computePedersenHash(a: BigNumberish, b: BigNumberish): string {\n return starkCurve.pedersen(BigInt(a), BigInt(b));\n}\n\nexport function computePoseidonHash(a: BigNumberish, b: BigNumberish): string {\n return toHex(starkCurve.poseidonHash(BigInt(a), BigInt(b)));\n}\n\n/**\n * Compute Pedersen hash from data\n *\n * @param {BigNumberish[]} data Array of data to compute Pedersen hash on\n * @returns {string} hex-string of Pedersen hash\n *\n * @example\n * ```typescript\n * const result = hash.computeHashOnElements(['0xabc', '0x123', '0xabc123'])\n * // result = 0x148141e8f7db29d005a0187669a56f0790d7e8c2c5b2d780e4d8b9e436a5521\n * ```\n */\nexport function computeHashOnElements(data: BigNumberish[]): string {\n return [...data, data.length]\n .reduce((x: BigNumberish, y: BigNumberish) => starkCurve.pedersen(BigInt(x), BigInt(y)), 0)\n .toString();\n}\n\nexport const computePedersenHashOnElements = computeHashOnElements;\n\nexport function computePoseidonHashOnElements(data: BigNumberish[]) {\n return toHex(poseidonHashMany(data.map((x) => BigInt(x))));\n}\n\n/**\n * Calculate contract address from class hash\n *\n * @param {BigNumberish} salt Salt to be used for hashing\n * @param {BigNumberish} classHash Class hash of contract to generate address for\n * @param {RawArgs} constructorCalldata Call data for contract constructor\n * @param {BigNumberish} deployerAddress Address of contract deployer\n * @returns {string} hex-string\n * @example\n * ```typescript\n * const result = hash.calculateContractAddressFromHash(1234, 0x1cf4fe5d37868d25524cdacb89518d88bf217a9240a1e6fde71cc22c429e0e3, [1234, true, false], 0x052fb1a9ab0db3c4f81d70fea6a2f6e55f57c709a46089b25eeec0e959db3695);\n * // result = 0x5fb03d3a88d8e474976932f927ff6a9e332e06ed36642ea3e8c7e38bf010f76\n * ```\n */\nexport function calculateContractAddressFromHash(\n salt: BigNumberish,\n classHash: BigNumberish,\n constructorCalldata: RawArgs,\n deployerAddress: BigNumberish\n): string {\n const compiledCalldata = CallData.compile(constructorCalldata);\n const constructorCalldataHash = computeHashOnElements(compiledCalldata);\n\n const CONTRACT_ADDRESS_PREFIX = felt('0x535441524b4e45545f434f4e54524143545f41444452455353'); // Equivalent to 'STARKNET_CONTRACT_ADDRESS'\n\n const hash = computeHashOnElements([\n CONTRACT_ADDRESS_PREFIX,\n deployerAddress,\n salt,\n classHash,\n constructorCalldataHash,\n ]);\n return toHex(BigInt(hash) % ADDR_BOUND);\n}\n\nfunction nullSkipReplacer(key: string, value: any) {\n if (key === 'attributes' || key === 'accessible_scopes') {\n return Array.isArray(value) && value.length === 0 ? undefined : value;\n }\n\n if (key === 'debug_info') {\n return null;\n }\n\n return value === null ? undefined : value;\n}\n\n/**\n * Format json-string without spaces to conform starknet json-string\n * @param {string} json json-string without spaces\n * @returns {string} json-string with additional spaces after `:` and `,`\n * @example\n * ```typescript\n * const result = hash.formatSpaces(\"{'onchain':true,'isStarknet':true}\");\n * // result = \"{'onchain': true, 'isStarknet': true}\"\n * ```\n */\nexport function formatSpaces(json: string): string {\n let insideQuotes = false;\n const newString = [];\n // eslint-disable-next-line no-restricted-syntax\n for (const char of json) {\n if (char === '\"' && (newString.length > 0 && newString.slice(-1)[0] === '\\\\') === false) {\n insideQuotes = !insideQuotes;\n }\n if (insideQuotes) {\n newString.push(char);\n } else {\n // eslint-disable-next-line no-nested-ternary\n newString.push(char === ':' ? ': ' : char === ',' ? ', ' : char);\n }\n }\n return newString.join('');\n}\n\n/**\n * Compute hinted class hash for legacy compiled contract (Cairo 0)\n * @param {LegacyCompiledContract} compiledContract\n * @returns {string} hex-string\n * @example\n * ```typescript\n * const compiledCairo0 = json.parse(fs.readFileSync(\"./cairo0contract.json\").toString(\"ascii\"));\n * const result=hash.computeHintedClassHash(compiledCairo0);\n * // result = \"0x293eabb06955c0a1e55557014675aa4e7a1fd69896147382b29b2b6b166a2ac\"\n * ``` */\nexport function computeHintedClassHash(compiledContract: LegacyCompiledContract): string {\n const { abi, program } = compiledContract;\n const contractClass = { abi, program };\n const serializedJson = formatSpaces(stringify(contractClass, nullSkipReplacer));\n return addHexPrefix(starkCurve.keccak(utf8ToArray(serializedJson)).toString(16));\n}\n\n/**\n * Computes the class hash for legacy compiled contract (Cairo 0)\n * @param {LegacyCompiledContract | string} contract legacy compiled contract content\n * @returns {string} hex-string of class hash\n * @example\n * ```typescript\n * const compiledCairo0 = json.parse(fs.readFileSync(\"./cairo0contract.json\").toString(\"ascii\"));\n * const result=hash.computeLegacyContractClassHash(compiledCairo0);\n * // result = \"0x4a5cae61fa8312b0a3d0c44658b403d3e4197be80027fd5020ffcdf0c803331\"\n * ```\n */\nexport function computeLegacyContractClassHash(contract: LegacyCompiledContract | string) {\n const compiledContract = isString(contract)\n ? (parse(contract) as LegacyCompiledContract)\n : contract;\n\n const apiVersion = toHex(API_VERSION);\n\n const externalEntryPointsHash = computeHashOnElements(\n compiledContract.entry_points_by_type.EXTERNAL.flatMap((e) => [e.selector, e.offset])\n );\n\n const l1HandlerEntryPointsHash = computeHashOnElements(\n compiledContract.entry_points_by_type.L1_HANDLER.flatMap((e) => [e.selector, e.offset])\n );\n\n const constructorEntryPointHash = computeHashOnElements(\n compiledContract.entry_points_by_type.CONSTRUCTOR.flatMap((e) => [e.selector, e.offset])\n );\n\n const builtinsHash = computeHashOnElements(\n compiledContract.program.builtins.map((s) => encodeShortString(s))\n );\n\n const hintedClassHash = computeHintedClassHash(compiledContract);\n\n const dataHash = computeHashOnElements(compiledContract.program.data);\n\n return computeHashOnElements([\n apiVersion,\n externalEntryPointsHash,\n l1HandlerEntryPointsHash,\n constructorEntryPointHash,\n builtinsHash,\n hintedClassHash,\n dataHash,\n ]);\n}\n\n// Cairo 1 Contract Hashes\n\nfunction hashBuiltins(builtins: Builtins) {\n return poseidonHashMany(\n builtins.flatMap((it: any) => {\n return BigInt(encodeShortString(it));\n })\n );\n}\n\nfunction hashEntryPoint(data: ContractEntryPointFields[]) {\n const base = data.flatMap((it: any) => {\n return [BigInt(it.selector), BigInt(it.offset), hashBuiltins(it.builtins)];\n });\n return poseidonHashMany(base);\n}\n\n/**\n * Compute hash of the bytecode for Sierra v1.5.0 onwards (Cairo 2.6.0)\n * Each segment is Poseidon hashed.\n * The global hash is : 1 + PoseidonHash(len0, h0, len1, h1, ...)\n * @param {CompiledSierraCasm} casm compiled Sierra CASM file content.\n * @returns {bigint} the bytecode hash as bigint.\n * @example\n * ```typescript\n * const compiledCasm = json.parse(fs.readFileSync(\"./contractC260.casm.json\").toString(\"ascii\"));\n * const result = hash.hashByteCodeSegments(compiledCasm);\n * // result = 80499149343908132326491548897246987792410240503053732367044713070598981699n\n * ```\n */\nexport function hashByteCodeSegments(casm: CompiledSierraCasm): bigint {\n const byteCode: bigint[] = casm.bytecode.map((n) => BigInt(n));\n const bytecodeSegmentLengths: number[] = casm.bytecode_segment_lengths ?? [];\n let segmentStart = 0;\n const hashLeaves = bytecodeSegmentLengths.flatMap((len) => {\n const segment = byteCode.slice(segmentStart, (segmentStart += len));\n return [BigInt(len), poseidonHashMany(segment)];\n });\n return 1n + poseidonHashMany(hashLeaves);\n}\n\n/**\n * Compute compiled class hash for contract (Cairo 1)\n * @param {CompiledSierraCasm} casm Cairo 1 compiled contract content\n * @returns {string} hex-string of class hash\n * @example \n * ```typescript\n * const compiledCasm = json.parse(fs.readFileSync(\"./cairo260.casm.json\").toString(\"ascii\"));\n * const result = hash.computeCompiledClassHash(compiledCasm);\n * // result = \"0x4087905743b4fa2b3affc1fc71333f1390c8c5d1e8ea47d6ba70786de3fc01a\"\n```\n */\nexport function computeCompiledClassHash(casm: CompiledSierraCasm): string {\n const COMPILED_CLASS_VERSION = 'COMPILED_CLASS_V1';\n\n // Hash compiled class version\n const compiledClassVersion = BigInt(encodeShortString(COMPILED_CLASS_VERSION));\n\n // Hash external entry points.\n const externalEntryPointsHash = hashEntryPoint(casm.entry_points_by_type.EXTERNAL);\n\n // Hash L1 handler entry points.\n const l1Handlers = hashEntryPoint(casm.entry_points_by_type.L1_HANDLER);\n\n // Hash constructor entry points.\n const constructor = hashEntryPoint(casm.entry_points_by_type.CONSTRUCTOR);\n\n // Hash bytecode.\n const bytecode = casm.bytecode_segment_lengths\n ? hashByteCodeSegments(casm)\n : poseidonHashMany(casm.bytecode.map((it: string) => BigInt(it)));\n\n return toHex(\n poseidonHashMany([\n compiledClassVersion,\n externalEntryPointsHash,\n l1Handlers,\n constructor,\n bytecode,\n ])\n );\n}\n\nfunction hashEntryPointSierra(data: SierraContractEntryPointFields[]) {\n const base = data.flatMap((it: any) => {\n return [BigInt(it.selector), BigInt(it.function_idx)];\n });\n return poseidonHashMany(base);\n}\n\nfunction hashAbi(sierra: CompiledSierra) {\n const indentString = formatSpaces(stringify(sierra.abi, null));\n return BigInt(addHexPrefix(starkCurve.keccak(utf8ToArray(indentString)).toString(16)));\n}\n\n/**\n * Compute sierra contract class hash (Cairo 1)\n * @param {CompiledSierra} sierra Cairo 1 Sierra contract content\n * @returns {string} hex-string of class hash\n * @example \n * ```typescript\n * const compiledSierra = json.parse(fs.readFileSync(\"./cairo260.sierra.json\").toString(\"ascii\"));\n * const result = hash.computeSierraContractClassHash(compiledSierra);\n * // result = \"0x67b6b4f02baded46f02feeed58c4f78e26c55364e59874d8abfd3532d85f1ba\"\n```\n */\nexport function computeSierraContractClassHash(sierra: CompiledSierra): string {\n const CONTRACT_CLASS_VERSION = 'CONTRACT_CLASS_V0.1.0';\n\n // Hash class version\n const compiledClassVersion = BigInt(encodeShortString(CONTRACT_CLASS_VERSION));\n\n // Hash external entry points.\n const externalEntryPointsHash = hashEntryPointSierra(sierra.entry_points_by_type.EXTERNAL);\n\n // Hash L1 handler entry points.\n const l1Handlers = hashEntryPointSierra(sierra.entry_points_by_type.L1_HANDLER);\n\n // Hash constructor entry points.\n const constructor = hashEntryPointSierra(sierra.entry_points_by_type.CONSTRUCTOR);\n\n // Hash abi_hash.\n const abiHash = hashAbi(sierra);\n\n // Hash Sierra program.\n const sierraProgram = poseidonHashMany(sierra.sierra_program.map((it: string) => BigInt(it)));\n\n return toHex(\n poseidonHashMany([\n compiledClassVersion,\n externalEntryPointsHash,\n l1Handlers,\n constructor,\n abiHash,\n sierraProgram,\n ])\n );\n}\n\n/**\n * Compute ClassHash (sierra or legacy) based on provided contract\n * @param {CompiledContract | string} contract Cairo 1 contract content\n * @returns {string} hex-string of class hash\n * @example \n * ```typescript\n * const compiledSierra = json.parse(fs.readFileSync(\"./cairo260.sierra.json\").toString(\"ascii\"));\n * const result = hash.computeContractClassHash(compiledSierra);\n * // result = \"0x67b6b4f02baded46f02feeed58c4f78e26c55364e59874d8abfd3532d85f1ba\"\n```\n */\nexport function computeContractClassHash(contract: CompiledContract | string): string {\n const compiledContract = isString(contract) ? parse(contract) : contract;\n\n if ('sierra_program' in compiledContract) {\n return computeSierraContractClassHash(compiledContract as CompiledSierra);\n }\n\n return computeLegacyContractClassHash(compiledContract as LegacyCompiledContract);\n}\n","import * as json from 'lossless-json';\n\n/**\n * Helper to convert string to number or bigint based on size\n */\nconst parseIntAsNumberOrBigInt = (str: string) => {\n if (!json.isInteger(str)) return parseFloat(str);\n const num = parseInt(str, 10);\n return Number.isSafeInteger(num) ? num : BigInt(str);\n};\n\n/**\n * Convert JSON string to JSON object\n *\n * NOTE: the String() wrapping is used so the behavior conforms to JSON.parse()\n * which can accept simple data types but is not represented in the default typing\n *\n * @param str JSON string\n * @return {object} Parsed json object\n * @example\n * ```typescript\n * const str = '[123, 12.3, 11223344556677889900]';\n * const result = parse(str);\n * // result = [123, 12.3, 11223344556677890048n]\n * ```\n */\nexport const parse = (str: string): any =>\n json.parse(String(str), undefined, parseIntAsNumberOrBigInt);\n\n/**\n * Convert JSON string to JSON object with all numbers as bigint\n * @param str JSON string\n * @return {object} Parsed json object\n * @example\n * ```typescript\n * const str = '[123, 12.3, 1234567890]';\n * const result = parseAlwaysAsBig(str);\n * // result = [123n, 12.3, 1234567890n]\n * ```\n */\nexport const parseAlwaysAsBig = (str: string): any =>\n json.parse(String(str), undefined, json.parseNumberAndBigInt);\n\n/**\n * Convert JSON object to JSON string\n *\n * NOTE: the not-null assertion is used so the return type conforms to JSON.stringify()\n * which can also return undefined but is not represented in the default typing\n *\n * @param value JSON object\n * @param [replacer] Function that alters the behavior of the stringification process\n * @param [space] Used to insert white space into the output JSON string\n * @param [numberStringifiers] Function used to stringify numbers (returning undefined will delete the property from the object)\n * @return {string} JSON string\n * @example\n * ```typescript\n * const value = [123, 12.3, 1234567890];\n * const result = stringify(value);\n * // result = '[123,12.3,1234567890]'\n * ```\n */\nexport const stringify = (\n value: unknown,\n replacer?: any,\n space?: string | number | undefined,\n numberStringifiers?: json.NumberStringifier[] | undefined\n): string => json.stringify(value, replacer, space, numberStringifiers)!;\n\n/** @deprecated equivalent to 'stringify', alias will be removed */\nexport const stringifyAlwaysAsBig = stringify;\n","// eslint-disable-next-line @typescript-eslint/no-unused-vars\nimport type { SPEC } from 'starknet-types-07';\nimport { getStarkKey, utils } from '@scure/starknet';\nimport { gzip, ungzip } from 'pako';\n\nimport { ZERO, FeeMarginPercentage } from '../constants';\nimport {\n ArraySignatureType,\n BigNumberish,\n CompressedProgram,\n Program,\n Signature,\n UniversalDetails,\n} from '../types';\nimport { EDAMode, EDataAvailabilityMode, ETransactionVersion, ResourceBounds } from '../types/api';\nimport { FeeEstimate } from '../types/provider';\nimport { addHexPrefix, arrayBufferToString, atobUniversal, btoaUniversal } from './encode';\nimport { parse, stringify } from './json';\nimport {\n addPercent,\n bigNumberishArrayToDecimalStringArray,\n bigNumberishArrayToHexadecimalStringArray,\n isBigInt,\n toHex,\n} from './num';\nimport { isString } from './shortString';\n\n/**\n * Compress compiled Cairo 0 program\n *\n * [Reference](https://github.com/starkware-libs/cairo-lang/blob/master/src/starkware/starknet/services/api/gateway/transaction.py#L54-L58)\n * @param {Program | string} jsonProgram Representing the compiled Cairo 0 program\n * @return {CompressedProgram} Compressed Cairo 0 program\n * @example\n * ```typescript\n * const contractCairo0 = json.parse(fs.readFileSync(\"./cairo0contract.json\").toString(\"ascii\"));\n * const result = stark.compressProgram(contractCairo0);\n * // result = \"H4sIAAAAAAAAA+1dC4/bOJL+K4aBu01me7r5EEUyixzQk/TuB...\"\n * ```\n */\nexport function compressProgram(jsonProgram: Program | string): CompressedProgram {\n const stringified = isString(jsonProgram) ? jsonProgram : stringify(jsonProgram);\n const compressedProgram = gzip(stringified);\n return btoaUniversal(compressedProgram);\n}\n\n/**\n * Decompress compressed compiled Cairo 0 program\n * @param {CompressedProgram} base64 Compressed Cairo 0 program\n * @returns {Object | CompressedProgram} Parsed decompressed compiled Cairo 0 program\n * @example\n * ```typescript\n * const contractCairo0 = json.parse(fs.readFileSync(\"./cairo0contract.json\").toString(\"ascii\"));\n * const compressedCairo0 = stark.compressProgram(contractCairo0);\n * const result = stark.decompressProgram(compressedCairo0);\n * // result = {\n * // abi: [\n * // {\n * // inputs: [Array],\n * // name: 'increase_balance',\n * // outputs: [],\n * // type: 'function'\n * // }\n * // ],\n * // entry_points_by_type: { CONSTRUCTOR: [], EXTERNAL: [ [Object], [Object] ], L1_HANDLER: [] },\n * // program: {\n * // attributes: [],\n * // builtins: [ 'pedersen', 'range_check' ],\n * // compiler_version: '0.10.2',\n * // data: [\n * // '0x480680017fff8000',\n * // ...\n * ```\n */\nexport function decompressProgram(base64: CompressedProgram) {\n if (Array.isArray(base64)) return base64;\n const decompressed = arrayBufferToString(ungzip(atobUniversal(base64)));\n return parse(decompressed);\n}\n\n/**\n * Random Address based on random keyPair\n * @returns {string} an hex string of a random Starknet address\n * @example\n * ```typescript\n * const result = stark.randomAddress();\n * // result = \"0x51fc8126a13cd5ddb29a71ca399cb1e814f086f5af1b502d7151c14929554f\"\n * ```\n */\nexport function randomAddress(): string {\n const randomKeyPair = utils.randomPrivateKey();\n return getStarkKey(randomKeyPair);\n}\n\n/**\n * Lowercase and hex prefix string\n *\n * @deprecated Not used internally, naming is confusing based on functionality\n */\nexport function makeAddress(input: string): string {\n return addHexPrefix(input).toLowerCase();\n}\n\n/**\n * Format Signature to standard type (hex array)\n * @param {Signature} [sig]\n * @returns {ArraySignatureType} Custom hex string array\n * @throws {Error} if sig not defined, or wrong format\n * @example\n * ```typescript\n * const signature = ec.starkCurve.sign(\"0x12de34\", \"0x3487123eac\");\n * const result = stark.formatSignature(signature);\n * // result = ['0xba8eecee2d69c417e8c6a20cf331c821f716b58ba9e47166c7476afdb38997',\n * // '0x69ef7438c94104839a6e2aa2385482a77399d2f46e894ae4f50ab6d69239d1c']\n * ```\n */\nexport function formatSignature(sig?: Signature): ArraySignatureType {\n if (!sig) throw Error('formatSignature: provided signature is undefined');\n if (Array.isArray(sig)) {\n return sig.map((it) => toHex(it));\n }\n try {\n const { r, s } = sig;\n return [toHex(r), toHex(s)];\n } catch (e) {\n throw new Error('Signature need to be weierstrass.SignatureType or an array for custom');\n }\n}\n\n/**\n * Format Signature to decimal string array\n * @param {Signature} [sig]\n * @returns {ArraySignatureType} Custom hex string array\n * @throws {Error} if sig not defined, or wrong format\n * @example\n * ```typescript\n * const signature = ec.starkCurve.sign(\"0x12de34\", \"0x3487123eac\");\n * const result = stark.signatureToDecimalArray(signature);\n * // result = ['329619989660444495690615805546674399714973829707166906185976654753023887767',\n * // '2994745480203297689255012826403147585778741462125743754529207781488706428188']\n * ```\n */\nexport function signatureToDecimalArray(sig?: Signature): ArraySignatureType {\n return bigNumberishArrayToDecimalStringArray(formatSignature(sig));\n}\n\n/**\n * Format Signature to hex string array\n * @param {Signature} [sig]\n * @returns {ArraySignatureType} Custom hex string array\n * @throws {Error} if sig not defined, or wrong format\n * @example\n * ```typescript\n * const signature = ec.starkCurve.sign(\"0x12de34\", \"0x3487123eac\");\n * const result = stark.signatureToHexArray(signature);\n * // result = ['0xba8eecee2d69c417e8c6a20cf331c821f716b58ba9e47166c7476afdb38997',\n * // '0x69ef7438c94104839a6e2aa2385482a77399d2f46e894ae4f50ab6d69239d1c']\n * ```\n */\nexport function signatureToHexArray(sig?: Signature): ArraySignatureType {\n return bigNumberishArrayToHexadecimalStringArray(formatSignature(sig));\n}\n\n/**\n * Convert estimated fee to max fee including a margin\n * @param {BigNumberish} estimatedFee - The estimated fee\n * @param {number} [overhead = feeMarginPercentage.MAX_FEE] - The overhead added to the gas\n * @returns {bigint} The maximum fee with the margin\n * @example\n * ```typescript\n * const result = stark.estimatedFeeToMaxFee(\"8982300000000\", 50);\n * // result = \"13473450000000n\"\n * ```\n */\nexport function estimatedFeeToMaxFee(\n estimatedFee: BigNumberish,\n overhead: number = FeeMarginPercentage.MAX_FEE\n): bigint {\n return addPercent(estimatedFee, overhead);\n}\n\n/**\n * Calculates the maximum resource bounds for fee estimation.\n *\n * @param {FeeEstimate | 0n} estimate The estimate for the fee. If a BigInt is provided, the returned bounds will be set to '0x0'.\n * @param {number} [amountOverhead = feeMarginPercentage.L1_BOUND_MAX_AMOUNT] - The percentage overhead added to the gas consumed or overall fee amount.\n * @param {number} [priceOverhead = feeMarginPercentage.L1_BOUND_MAX_PRICE_PER_UNIT] The percentage overhead added to the gas price per unit.\n * @returns {ResourceBounds} The maximum resource bounds for fee estimation.\n * @throws {Error} If the estimate object is undefined or does not have the required properties.\n * @example\n * ```typescript\n * const feeEstimated: FeeEstimate = {\n gas_consumed: \"0x3456a\",\n gas_price: \"0xa45567567567ae4\",\n overall_fee: \"0x2198F463A77A899A5668\",\n unit: \"WEI\"\n};\nconst result = stark.estimateFeeToBounds(feeEstimated, 70, 50);\n * // result = {\n * // l2_gas: { max_amount: '0x0', max_price_per_unit: '0x0' },\n * // l1_gas: { max_amount: '0x58f9a', max_price_per_unit: '0xf6801b01b01b856' }\n * // }\n * ```\n */\nexport function estimateFeeToBounds(\n estimate: FeeEstimate | 0n,\n amountOverhead: number = FeeMarginPercentage.L1_BOUND_MAX_AMOUNT,\n priceOverhead: number = FeeMarginPercentage.L1_BOUND_MAX_PRICE_PER_UNIT\n): ResourceBounds {\n if (isBigInt(estimate)) {\n return {\n l2_gas: { max_amount: '0x0', max_price_per_unit: '0x0' },\n l1_gas: { max_amount: '0x0', max_price_per_unit: '0x0' },\n };\n }\n\n if (typeof estimate.gas_consumed === 'undefined' || typeof estimate.gas_price === 'undefined') {\n throw Error('estimateFeeToBounds: estimate is undefined');\n }\n\n const maxUnits =\n estimate.data_gas_consumed !== undefined && estimate.data_gas_price !== undefined // RPC v0.7\n ? toHex(addPercent(BigInt(estimate.overall_fee) / BigInt(estimate.gas_price), amountOverhead))\n : toHex(addPercent(estimate.gas_consumed, amountOverhead));\n const maxUnitPrice = toHex(addPercent(estimate.gas_price, priceOverhead));\n return {\n l2_gas: { max_amount: '0x0', max_price_per_unit: '0x0' },\n l1_gas: { max_amount: maxUnits, max_price_per_unit: maxUnitPrice },\n };\n}\n\n/**\n * Converts the data availability mode from EDataAvailabilityMode to EDAMode.\n *\n * @param {EDataAvailabilityMode} dam The data availability mode to be converted.\n * @return {EDAMode} The converted data availability mode.\n * @throws {Error} If the data availability mode is not a valid value.\n * @example\n * ```typescript\n * const result = stark.intDAM(RPC.EDataAvailabilityMode.L1);\n * // result = 0\n * ```\n */\nexport function intDAM(dam: EDataAvailabilityMode): EDAMode {\n if (dam === EDataAvailabilityMode.L1) return EDAMode.L1;\n if (dam === EDataAvailabilityMode.L2) return EDAMode.L2;\n throw Error('EDAM conversion');\n}\n\n/**\n * Convert to ETransactionVersion or throw an error.\n * Return providedVersion is specified else return defaultVersion\n * @param {BigNumberish} defaultVersion default estimate transaction version\n * @param {BigNumberish} [providedVersion] estimate transaction version\n * @returns {ETransactionVersion} if providedVersion is not provided, returns the default estimate version, else return the provided version\n * @throws {Error} if estimate transaction version or default estimate transaction version is unknown\n * @example\n * ```typescript\n * const result = stark.toTransactionVersion(\"0x100000000000000000000000000000003\", stark.toFeeVersion(2));\n * // result = \"0x100000000000000000000000000000002\"\n * ```\n */\nexport function toTransactionVersion(\n defaultVersion: BigNumberish,\n providedVersion?: BigNumberish\n): ETransactionVersion {\n const providedVersion0xs = providedVersion ? toHex(providedVersion) : undefined;\n const defaultVersion0xs = toHex(defaultVersion);\n\n if (providedVersion && !Object.values(ETransactionVersion).includes(providedVersion0xs as any)) {\n throw Error(`providedVersion ${providedVersion} is not ETransactionVersion`);\n }\n if (!Object.values(ETransactionVersion).includes(defaultVersion0xs as any)) {\n throw Error(`defaultVersion ${defaultVersion} is not ETransactionVersion`);\n }\n\n return (providedVersion ? providedVersion0xs : defaultVersion0xs) as ETransactionVersion;\n}\n\n/**\n * Convert Transaction version to Fee version or throw an error\n * @param {BigNumberish} [providedVersion] 0..3 number representing the transaction version\n * @returns {ETransactionVersion} the fee estimation version corresponding to the transaction version provided\n * @throws {Error} if the transaction version is unknown\n * @example\n * ```typescript\n * const result = stark.toFeeVersion(2);\n * // result = \"0x100000000000000000000000000000002\"\n * ```\n */\nexport function toFeeVersion(providedVersion?: BigNumberish) {\n if (!providedVersion) return undefined;\n const version = toHex(providedVersion);\n\n if (version === ETransactionVersion.V0) return ETransactionVersion.F0;\n if (version === ETransactionVersion.V1) return ETransactionVersion.F1;\n if (version === ETransactionVersion.V2) return ETransactionVersion.F2;\n if (version === ETransactionVersion.V3) return ETransactionVersion.F3;\n\n throw Error(`toFeeVersion: ${version} is not supported`);\n}\n\n/**\n * Return provided or default v3 tx details\n * @param {UniversalDetails} details details of the transaction\n * @return {} an object including the V3 transaction details.\n * @example\n * ```typescript\n * const detail: UniversalDetails = { tip: 3456n };\n * const result = stark.v3Details(detail);\n * // result = {\n * // tip: 3456n,\n * // paymasterData: [],\n * // accountDeploymentData: [],\n * // nonceDataAvailabilityMode: 'L1',\n * // feeDataAvailabilityMode: 'L1',\n * // resourceBounds: {\n * // l2_gas: { max_amount: '0x0', max_price_per_unit: '0x0' },\n * // l1_gas: { max_amount: '0x0', max_price_per_unit: '0x0' }\n * // }\n * // }\n * ```\n */\nexport function v3Details(details: UniversalDetails) {\n return {\n tip: details.tip || 0,\n paymasterData: details.paymasterData || [],\n accountDeploymentData: details.accountDeploymentData || [],\n nonceDataAvailabilityMode: details.nonceDataAvailabilityMode || EDataAvailabilityMode.L1,\n feeDataAvailabilityMode: details.feeDataAvailabilityMode || EDataAvailabilityMode.L1,\n resourceBounds: details.resourceBounds ?? estimateFeeToBounds(ZERO),\n };\n}\n\n/**\n * It will reduce V2 to V1, else (V3) stay the same\n * F2 -> F1\n * V2 -> V1\n * F3 -> F3\n * V3 -> V3\n * @param {ETransactionVersion} providedVersion\n * @returns {ETransactionVersion} if v2 then returns v1. if v3 then return v3\n * @example\n * ```typescript\n * const result = stark.reduceV2(constants.TRANSACTION_VERSION.V2);\n * // result = \"0x1\"\n * ```\n */\nexport function reduceV2(providedVersion: ETransactionVersion): ETransactionVersion {\n if (providedVersion === ETransactionVersion.F2) return ETransactionVersion.F1;\n if (providedVersion === ETransactionVersion.V2) return ETransactionVersion.V1;\n return providedVersion;\n}\n","import { ContractClassResponse } from '../types';\nimport {\n CairoContract,\n CompiledSierra,\n LegacyCompiledContract,\n LegacyContractClass,\n SierraContractClass,\n} from '../types/lib/contract/index';\nimport { CompleteDeclareContractPayload, DeclareContractPayload } from '../types/lib/index';\nimport { computeCompiledClassHash, computeContractClassHash } from './hash';\nimport { parse } from './json';\nimport { decompressProgram } from './stark';\n\nimport { isString } from './shortString';\n\n/**\n * Checks if a given contract is in Sierra (Safe Intermediate Representation) format.\n *\n * @param {CairoContract | string} contract - The contract to check. Can be either a CairoContract object or a string representation of the contract.\n * @return {boolean} - Returns true if the contract is a Sierra contract, otherwise false.\n * @example\n * ```typescript\n * const result = isSierra(contract);\n * // result = true | false\n * ```\n */\nexport function isSierra(\n contract: CairoContract | string\n): contract is SierraContractClass | CompiledSierra {\n const compiledContract = isString(contract) ? parse(contract) : contract;\n return 'sierra_program' in compiledContract;\n}\n\n/**\n * Extracts contract hashes from `DeclareContractPayload`.\n *\n * @param {DeclareContractPayload} payload - The payload containing contract information.\n * @return {CompleteDeclareContractPayload} - The `CompleteDeclareContractPayload` with extracted contract hashes.\n * @throws {Error} - If extraction of compiledClassHash or classHash fails.\n * @example\n * ```typescript\n * const result = extractContractHashes(contract);\n * // result = {\n * // contract: ...,\n * // classHash: ...,\n * // casm: ...,\n * // compiledClassHash: ...,\n * // }\n * ```\n */\nexport function extractContractHashes(\n payload: DeclareContractPayload\n): CompleteDeclareContractPayload {\n const response = { ...payload } as CompleteDeclareContractPayload;\n\n if (isSierra(payload.contract)) {\n if (!payload.compiledClassHash && payload.casm) {\n response.compiledClassHash = computeCompiledClassHash(payload.casm);\n }\n if (!response.compiledClassHash)\n throw new Error(\n 'Extract compiledClassHash failed, provide (CairoAssembly).casm file or compiledClassHash'\n );\n }\n\n response.classHash = payload.classHash ?? computeContractClassHash(payload.contract);\n if (!response.classHash)\n throw new Error('Extract classHash failed, provide (CompiledContract).json file or classHash');\n\n return response;\n}\n\n/**\n * Helper to redeclare response Cairo0 contract\n */\nexport function contractClassResponseToLegacyCompiledContract(ccr: ContractClassResponse) {\n if (isSierra(ccr)) {\n throw Error('ContractClassResponse need to be LegacyContractClass (cairo0 response class)');\n }\n const contract = ccr as LegacyContractClass;\n return { ...contract, program: decompressProgram(contract.program) } as LegacyCompiledContract;\n}\n","import { secp256k1 } from '@noble/curves/secp256k1';\n\nimport { addHexPrefix, buf2hex, removeHexPrefix, sanitizeHex } from './encode';\nimport type { BigNumberish } from '../types';\nimport { assertInRange, toHex } from './num';\nimport { ZERO } from '../constants';\nimport assert from './assert';\n\n/**\n * Get random Ethereum private Key.\n * @returns an Hex string\n * @example\n * ```typescript\n * const myPK: string = randomAddress()\n * // result = \"0xf04e69ac152fba37c02929c2ae78c9a481461dda42dbc6c6e286be6eb2a8ab83\"\n * ```\n */\nexport function ethRandomPrivateKey(): string {\n return sanitizeHex(buf2hex(secp256k1.utils.randomPrivateKey()));\n}\n\n/**\n * Get a string formatted for an Ethereum address, without uppercase characters.\n * @param {BigNumberish} address Address of an Ethereum account.\n * @returns an Hex string coded on 20 bytes\n * @example\n * ```typescript\n * const myEthAddress: string = validateAndParseEthAddress(\"0x8359E4B0152ed5A731162D3c7B0D8D56edB165\")\n * // result = \"0x008359e4b0152ed5a731162d3c7b0d8d56edb165\"\n * ```\n */\nexport function validateAndParseEthAddress(address: BigNumberish): string {\n assertInRange(address, ZERO, 2n ** 160n - 1n, 'Ethereum Address ');\n const result = addHexPrefix(removeHexPrefix(toHex(address)).padStart(40, '0'));\n assert(Boolean(result.match(/^(0x)?[0-9a-f]{40}$/)), 'Invalid Ethereum Address Format');\n return result;\n}\n","// the ts-ignore suppresses an esm to cjs import error that is resolved with entry point resolution\n// @ts-ignore\nimport makeFetchCookie from 'fetch-cookie';\nimport isomorphicFetch from 'isomorphic-fetch';\n\nexport default (typeof window !== 'undefined' && window.fetch) || // use buildin fetch in browser if available\n (typeof global !== 'undefined' && makeFetchCookie(global.fetch)) || // use buildin fetch in node, react-native and service worker if available\n isomorphicFetch; // ponyfill fetch in node and browsers that don't have it\n","import { NetworkName, RPC_NODES } from '../constants';\nimport {\n BlockIdentifier,\n BlockTag,\n CompiledContract,\n CompiledSierra,\n ContractClass,\n GetBlockResponse,\n InvocationsDetailsWithNonce,\n LegacyContractClass,\n PendingBlock,\n PendingStateUpdate,\n SierraContractClass,\n StateUpdateResponse,\n V3TransactionDetails,\n} from '../types';\nimport { ETransactionVersion } from '../types/api';\nimport { isSierra } from './contract';\nimport { formatSpaces } from './hash';\nimport { parse, stringify } from './json';\nimport { isBigInt, isHex, isNumber, toHex } from './num';\nimport { isDecimalString, isString } from './shortString';\nimport { compressProgram } from './stark';\nimport type { GetTransactionReceiptResponse } from './transactionReceipt';\n\n/**\n * Helper - Async Sleep for 'delay' time\n *\n * @param {number} delay - Number of milliseconds to delay\n * @returns {Promise<unknown>}\n * @example\n * ```typescript\n * await provider.wait(1000) // 1000 milliseconds == 1 second\n * ```\n */\nexport function wait(delay: number): Promise<unknown> {\n return new Promise((res) => {\n setTimeout(res, delay);\n });\n}\n\n/**\n * Create Sierra compressed Contract Class from a given Compiled Sierra\n *\n * CompiledSierra -> SierraContractClass\n * \n * @param {CompiledSierra} contract sierra code from the Cairo compiler\n * @returns {SierraContractClass} compressed Sierra\n * @example\n * ```typescript\n * const result = provider.createSierraContractClass({\n \"sierra_program\": [\n \"0x1\",\n \"0x4\",\n \"0x0\",\n \"0x2\",\n \"0x4\",\n \"0x1\",\n \"0x3b4\",\n \"0x4c\",\n \"0x65\",\n \"0x52616e6765436865636b\",...})\n * // result = {sierra_program: 'H4sIAAAAAAAAA6x9WZbsrI7uVGqd53qgb8ZynwzYY7jDv5JAAmxHZuQ+96yq/L0jIzEINZ8axP/5j/q/+j//+z/wH9f/o/p/zPbh+Iot49+u9v8G3//rTdDhDDF4Z0MKPthQ+m+S2v6n1S//638VvdXW2PQ6RvxuDG+jiybCXKJ7Hef6ZRi9E+Q89WmKLilfqbrsL6PUCf8...}\n * ```\n */\nexport function createSierraContractClass(contract: CompiledSierra): SierraContractClass {\n const result = { ...contract } as any;\n delete result.sierra_program_debug_info;\n result.abi = formatSpaces(stringify(contract.abi));\n result.sierra_program = formatSpaces(stringify(contract.sierra_program));\n result.sierra_program = compressProgram(result.sierra_program);\n return result;\n}\n\n/**\n * Create a compressed contract from a given compiled Cairo 0 & 1 contract or a string.\n * @param {CompiledContract | string} contract - Compiled Cairo 0 or Cairo 1 contract, or string\n * @returns {ContractClass} Cairo 0 or Cairo 1 compressed contract\n * @example\n * ```typescript\n * const result = provider.parseContract({\n \"sierra_program\": [\n \"0x1\",\n \"0x4\",\n \"0x0\",\n \"0x2\",\n \"0x4\",\n \"0x1\",\n \"0x3b4\",\n \"0x4c\",\n \"0x65\",\n \"0x52616e6765436865636b\",...})\n * // result = {sierra_program: 'H4sIAAAAAAAAA6x9WZbsrI7uVGqd53qgb8ZynwzYY7jDv5JAAmxHZuQ+96yq/L0jIzEINZ8axP/5j/q/+j//+z/wH9f/o/p/zPbh+Iot49+u9v8G3//rTdDhDDF4Z0MKPthQ+m+S2v6n1S//638VvdXW2PQ6RvxuDG+jiybCXKJ7Hef6ZRi9E+Q89WmKLilfqbrsL6PUCf8...}\n * ```\n */\nexport function parseContract(contract: CompiledContract | string): ContractClass {\n const parsedContract = isString(contract) ? (parse(contract) as CompiledContract) : contract;\n\n if (!isSierra(contract)) {\n return {\n ...parsedContract,\n ...('program' in parsedContract && { program: compressProgram(parsedContract.program) }),\n } as LegacyContractClass;\n }\n\n return createSierraContractClass(parsedContract as CompiledSierra);\n}\n\n/**\n * Return randomly select available public node\n * @param {NetworkName} networkName NetworkName\n * @param {boolean} mute mute public node warning\n * @returns {string} default node url\n * @example\n * ```typescript\n * const result= provider.getDefaultNodeUrl(constants.NetworkName.SN_MAIN,false);\n * // console : \"Using default public node url, please provide nodeUrl in provider options!\"\n * // result = \"https://starknet-mainnet.public.blastapi.io/rpc/v0_7\"\n * ```\n */\nexport const getDefaultNodeUrl = (networkName?: NetworkName, mute: boolean = false): string => {\n if (!mute) {\n // eslint-disable-next-line no-console\n console.warn('Using default public node url, please provide nodeUrl in provider options!');\n }\n const nodes = RPC_NODES[networkName ?? NetworkName.SN_SEPOLIA];\n const randIdx = Math.floor(Math.random() * nodes.length);\n return nodes[randIdx];\n};\n\nexport const validBlockTags = Object.values(BlockTag);\n\n/**\n * This class is formatting the identifier of a block.\n *\n * hex string and BigInt are detected as block hashes. identifier return { block_hash: hash }\n *\n * decimal string and number are detected as block numbers. identifier return { block_number: number }\n *\n * text string are detected as block tag. identifier return tag\n *\n * null is detected as 'pending' block tag. identifier return 'pending'\n * @example\n * ```typescript\n * const result = new provider.Block(null).identifier;\n * // result = \"pending\"\n * ```\n */\nexport class Block {\n /**\n * @param {BlockIdentifier} hash if not null, contains the block hash\n */\n hash: BlockIdentifier = null;\n\n /**\n * @param {BlockIdentifier} number if not null, contains the block number\n */\n number: BlockIdentifier = null;\n\n /**\n * @param {BlockIdentifier} tag if not null, contains \"pending\" or \"latest\"\n */\n tag: BlockIdentifier = null;\n\n private setIdentifier(__identifier: BlockIdentifier): void {\n if (isString(__identifier)) {\n if (isDecimalString(__identifier)) {\n this.number = parseInt(__identifier, 10);\n } else if (isHex(__identifier)) {\n this.hash = __identifier;\n } else if (validBlockTags.includes(__identifier as BlockTag)) {\n this.tag = __identifier;\n } else {\n throw TypeError(`Block identifier unmanaged: ${__identifier}`);\n }\n } else if (isBigInt(__identifier)) {\n this.hash = toHex(__identifier);\n } else if (isNumber(__identifier)) {\n this.number = __identifier;\n } else {\n this.tag = BlockTag.PENDING;\n }\n\n if (isNumber(this.number) && this.number < 0) {\n throw TypeError(`Block number (${this.number}) can't be negative`);\n }\n }\n\n /**\n * Create a Block instance\n * @param {BlockIdentifier} _identifier hex string and BigInt are detected as block hashes.\n * decimal string and number are detected as block numbers.\n * text string are detected as block tag.\n * null is considered as a 'pending' block tag.\n */\n constructor(_identifier: BlockIdentifier) {\n this.setIdentifier(_identifier);\n }\n\n // TODO: fix any\n /**\n * @returns {any} the identifier as a string\n * @example\n * ```typescript\n * const result = new provider.Block(123456n).queryIdentifier;\n * // result = \"blockHash=0x1e240\"\n * ```\n */\n get queryIdentifier(): any {\n if (this.number !== null) {\n return `blockNumber=${this.number}`;\n }\n\n if (this.hash !== null) {\n return `blockHash=${this.hash}`;\n }\n\n return `blockNumber=${this.tag}`;\n }\n\n // TODO: fix any\n /**\n * @returns {any} the identifier as an object\n * @example\n * ```typescript\n * const result = new provider.Block(56789).identifier;\n * // result = { block_number: 56789 }\n * ```\n */\n get identifier(): any {\n if (this.number !== null) {\n return { block_number: this.number };\n }\n\n if (this.hash !== null) {\n return { block_hash: this.hash };\n }\n\n return this.tag;\n }\n\n /**\n * change the identifier of an existing Block instance\n * @example\n * ```typescript\n * const myBlock = new provider.Block(\"latest\");\n * myBlock.identifier =\"0x3456789abc\";\n * const result = myBlock.identifier;\n * // result = { block_hash: '0x3456789abc' }\n * ```\n */\n set identifier(_identifier: BlockIdentifier) {\n this.setIdentifier(_identifier);\n }\n\n valueOf = () => this.number;\n\n toString = () => this.hash;\n}\n\n/**\n * Check if the given transaction details is a V3 transaction.\n *\n * @param {InvocationsDetailsWithNonce} details The transaction details to be checked.\n * @return {boolean} Returns true if the transaction is a V3 transaction, otherwise false.\n * @example\n * ```typescript\n * const invocation: InvocationsDetailsWithNonce = {\n * nonce: 1,\n * version: 3,\n * maxFee: 10 ** 15,\n * feeDataAvailabilityMode: RPC.EDataAvailabilityMode.L1,\n * tip: 10 ** 13,\n * paymasterData: [],\n * resourceBounds: {\n * l1_gas: { max_amount: num.toHex(10 ** 14), max_price_per_unit: num.toHex(50) },\n * l2_gas: { max_amount: num.toHex(0), max_price_per_unit: num.toHex(0) }}};\n * const result = provider.isV3Tx(invocation);\n * // result = true\n * ```\n */\nexport function isV3Tx(details: InvocationsDetailsWithNonce): details is V3TransactionDetails {\n const version = details.version ? toHex(details.version) : ETransactionVersion.V3;\n return version === ETransactionVersion.V3 || version === ETransactionVersion.F3;\n}\n\n/**\n * Determines if the given response matches the specified version.\n *\n * @param {('0.5' | '0.6' | '0.7')} version The version to compare against the response.\n * @param {string} response The response to check against the version.\n * @returns {boolean} True if the response matches the version, false otherwise.\n * @example\n * ``` typescript\n * const result = provider.isVersion(\"0.7\",\"0_7\");\n * // result = false\n * ```\n */\nexport function isVersion(version: '0.5' | '0.6' | '0.7', response: string): boolean {\n const [majorS, minorS] = version.split('.');\n const [majorR, minorR] = response.split('.');\n\n return majorS === majorR && minorS === minorR;\n}\n\n/**\n * Guard Pending Block\n * @param {GetBlockResponse} response answer of myProvider.getBlock()\n * @return {boolean} true if block is the pending block\n * @example\n * ```typescript\n * const block = await myProvider.getBlock(\"pending\");\n * const result = provider.isPendingBlock(block);\n * // result = true\n * ```\n */\nexport function isPendingBlock(response: GetBlockResponse): response is PendingBlock {\n return response.status === 'PENDING';\n}\n\n/**\n * Guard Pending Transaction\n * @param {GetTransactionReceiptResponse} response transaction Receipt\n * @return {boolean} true if the transaction is part of the pending block\n * @example\n * ```typescript\n * const block = await myProvider.getBlockWithTxs(\"pending\");\n * const txR = await myProvider.getTransactionReceipt(block.transactions[0].transaction_hash);\n * const result = provider.isPendingTransaction(txR);\n * // result = true\n * ```\n */\nexport function isPendingTransaction(response: GetTransactionReceiptResponse): boolean {\n return !('block_hash' in response);\n}\n\n/**\n * Guard Pending State Update\n * @param {StateUpdateResponse} response State of a block\n * @return {boolean} true if the block is pending\n * @example\n * ```typescript\n * const state: StateUpdateResponse = await myProvider.getStateUpdate(\"pending\");\n * const result = provider.isPendingStateUpdate(state);\n * // result = true\n * ```\n */\nexport function isPendingStateUpdate(\n response: StateUpdateResponse\n): response is PendingStateUpdate {\n return !('block_hash' in response);\n}\n","import { UDC } from '../constants';\nimport {\n BigNumberish,\n CairoVersion,\n Call,\n CallStruct,\n Calldata,\n ParsedStruct,\n RawArgs,\n UniversalDeployerContractPayload,\n} from '../types';\nimport { ETransactionVersion } from '../types/api';\nimport { CallData } from './calldata';\nimport { starkCurve } from './ec';\nimport { calculateContractAddressFromHash, getSelectorFromName } from './hash';\nimport { toBigInt, toCairoBool } from './num';\nimport { randomAddress } from './stark';\n\n/**\n * Transforms a list of Calls, each with their own calldata, into\n * two arrays: one with the entry points, and one with the concatenated calldata\n * @param {Call[]} calls the list of calls to transform.\n * @returns {callArray: ParsedStruct[], calldata: BigNumberish[]} An object containing two arrays: callArray and calldata.\n * @example\n * ```typescript\n * const calls: Call[] = [\n * \t{\n * \t\tcontractAddress: \"0x1234567890123456789012345678901234567890\",\n * \t\tentrypoint: \"functionName\",\n * \t\tcalldata: [1,2,3]\n * \t},\n * \t{\n * \t\tcontractAddress: \"0x0987654321098765432109876543210987654321\",\n * \t\tentrypoint: \"anotherFunction\",\n * \t\tcalldata: [4,5,6]\n * \t}\n * ];\n * const result = transaction.transformCallsToMulticallArrays(calls);\n * // result = {\n * // callArray: [\n * // { to: \"0x1234567890123456789012345678901234567890\", selector: \"1234567890\",\n * // data_offset: \"0\", data_len: \"3\" },\n * // { to: \"0x0987654321098765432109876543210987654321\", selector: \"1234567890\",\n * // data_offset: \"0987654321\", data_offset: \"3\", data_len: \"3\"}\n * // ], calldata: [1, 2, 3, 4, 5, 6]\n * // }\n * ```\n */\nexport const transformCallsToMulticallArrays = (calls: Call[]) => {\n const callArray: ParsedStruct[] = [];\n const calldata: BigNumberish[] = [];\n calls.forEach((call) => {\n const data = CallData.compile(call.calldata || []);\n callArray.push({\n to: toBigInt(call.contractAddress).toString(10),\n selector: toBigInt(getSelectorFromName(call.entrypoint)).toString(10),\n data_offset: calldata.length.toString(),\n data_len: data.length.toString(),\n });\n calldata.push(...data);\n });\n return {\n callArray,\n calldata: CallData.compile({ calldata }),\n };\n};\n\n/**\n * Transforms a list of calls into the Cairo 0 `__execute__` calldata.\n * @param {Call[]} calls the list of calls to transform\n * @returns {Calldata} the Cairo 0 `__execute__` calldata\n * @example\n * ```typescript\n * const calls: Call[] = [\n * \t{\n * \t\tcontractAddress: \"0x1234567890123456789012345678901234567890\",\n * \t\tentrypoint: \"functionName\",\n * \t\tcalldata: [1, 2, 3]\n * \t},\n * \t{\n * \t\tcontractAddress: \"0x0987654321098765432109876543210987654321\",\n * \t\tentrypoint: \"anotherFunction\",\n * \t\tcalldata: [4, 5, 6]\n * \t}\n * ];\n * const result = transaction.fromCallsToExecuteCalldata(calls);\n * // result = ['2', '103929005307130220006098923584552504982110632080',\n * // '784552248838722632831848474045274978537388011177294206940059575485454596699', '0',\n * // '3', '54400338722927882010739357306608455014511100705',\n * // '836430224577382061379420368022192503799782058803937958828224424676927281484',\n * // '3', '3', '6', '1', '2', '3', '4', '5', '6']\n * ```\n */\nexport const fromCallsToExecuteCalldata = (calls: Call[]) => {\n const { callArray, calldata } = transformCallsToMulticallArrays(calls);\n const compiledCalls = CallData.compile({ callArray });\n return [...compiledCalls, ...calldata] as Calldata;\n};\n\n/**\n * Transforms a list of calls into the Cairo 0 `__execute__` calldata including nonce.\n * @deprecated\n */\nexport const fromCallsToExecuteCalldataWithNonce = (calls: Call[], nonce: BigNumberish) => {\n return [...fromCallsToExecuteCalldata(calls), toBigInt(nonce).toString()] as Calldata;\n};\n\n/**\n * Format Data inside Calls\n * @deprecated Not required for getting execute Calldata\n */\nexport const transformCallsToMulticallArrays_cairo1 = (calls: Call[]) => {\n const callArray = calls.map<CallStruct>((call) => ({\n to: toBigInt(call.contractAddress).toString(10),\n selector: toBigInt(getSelectorFromName(call.entrypoint)).toString(10),\n calldata: CallData.compile(call.calldata || []),\n }));\n return callArray;\n};\n\n/**\n * Transforms a list of calls into the Cairo 1 `__execute__` calldata.\n * @param {Call[]} calls the list of calls to transform.\n * @returns {Calldata} the Cairo 1 `__execute__` calldata.\n * @example\n * ```typescript\n * const calls: Call[] = [\n * \t{\n * \t\tcontractAddress: \"0x1234567890123456789012345678901234567890\",\n * \t\tentrypoint: \"functionName\",\n * \t\tcalldata: [1, 2, 3]\n * \t},\n * \t{\n * \t\tcontractAddress: \"0x0987654321098765432109876543210987654321\",\n * \t\tentrypoint: \"anotherFunction\",\n * \t\tcalldata: [4, 5, 6]\n * \t}\n * ];\n * const result = transaction.fromCallsToExecuteCalldata_cairo1(calls);\n * // result = ['2', '103929005307130220006098923584552504982110632080',\n * // '784552248838722632831848474045274978537388011177294206940059575485454596699',\n * // '3', '1', '2', '3', '54400338722927882010739357306608455014511100705',\n * // '836430224577382061379420368022192503799782058803937958828224424676927281484',\n * // '3', '4', '5', '6']\n * ```\n */\nexport const fromCallsToExecuteCalldata_cairo1 = (calls: Call[]) => {\n // ensure property order\n const orderCalls = calls.map((call) => ({\n contractAddress: call.contractAddress,\n entrypoint: call.entrypoint,\n calldata:\n Array.isArray(call.calldata) && '__compiled__' in call.calldata\n ? call.calldata // Calldata type\n : CallData.compile(call.calldata as RawArgs), // RawArgsObject | RawArgsArray type\n }));\n\n return CallData.compile({ orderCalls });\n};\n\n/**\n * Create `__execute__` Calldata from Calls based on Cairo versions.\n * @param {Call[]} calls the list of calls to transform\n * @param {CairoVersion} cairoVersion the Cairo version\n * @returns {Calldata} the `__execute__` calldata.\n * @example\n * ```typescript\n * const calls: Call[] = [\n * \t{\n * \t\tcontractAddress: \"0x1234567890123456789012345678901234567890\",\n * \t\tentrypoint: \"functionName\",\n * \t\tcalldata: [1, 2, 3]\n * \t},\n * \t{\n * \t\tcontractAddress: \"0x0987654321098765432109876543210987654321\",\n * \t\tentrypoint: \"anotherFunction\",\n * \t\tcalldata: [4, 5, 6]\n * \t}\n * ];\n * const result = transaction.getExecuteCalldata(calls, '1');\n * // result = ['2', '103929005307130220006098923584552504982110632080',\n * // '784552248838722632831848474045274978537388011177294206940059575485454596699',\n * // '3', '1', '2', '3', '54400338722927882010739357306608455014511100705',\n * // '836430224577382061379420368022192503799782058803937958828224424676927281484',\n * // '3', '4', '5', '6']\n * ```\n */\nexport const getExecuteCalldata = (calls: Call[], cairoVersion: CairoVersion = '0') => {\n if (cairoVersion === '1') {\n return fromCallsToExecuteCalldata_cairo1(calls);\n }\n return fromCallsToExecuteCalldata(calls);\n};\n\n/**\n * Builds a UDCCall object.\n *\n * @param {UniversalDeployerContractPayload | UniversalDeployerContractPayload[]} payload the payload data for the UDCCall. Can be a single payload object or an array of payload objects.\n * @param {string} address the address to be used in the UDCCall\n * @returns { calls: Call[], addresses: string[] } the UDCCall object containing an array of calls and an array of addresses.\n * @example\n * ```typescript\n * const payload: UniversalDeployerContractPayload = {\n * classHash: \"0x1234567890123456789012345678901234567890\",\n * salt: \"0x0987654321098765432109876543210987654321\",\n * unique:true,\n * constructorCalldata: [1, 2, 3]\n * };\n * const address = \"0xABCDEF1234567890ABCDEF1234567890ABCDEF12\";\n * const result = transaction.buildUDCCall(payload, address);\n * // result = {\n * // \tcalls: [\n * //\t\t\t{\n * //\t\t\tcontractAddress: \"0xABCDEF1234567890ABCDEF1234567890ABCDEF12\",\n * //\t\t\tentrypoint: \"functionName\",\n * //\t\t\tcalldata: [classHash, salt, true, 3, 1, 2, 3]\n * //\t\t}],\n * //\taddresses: [\"0x6fD084B56a7EDc5C06B3eB40f97Ae5A0C707A865\"]\n * // }\n * ```\n */\nexport function buildUDCCall(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n address: string\n) {\n const params = [].concat(payload as []).map((it) => {\n const {\n classHash,\n salt,\n unique = true,\n constructorCalldata = [],\n } = it as UniversalDeployerContractPayload;\n\n const compiledConstructorCallData = CallData.compile(constructorCalldata);\n const deploySalt = salt ?? randomAddress();\n\n return {\n call: {\n contractAddress: UDC.ADDRESS,\n entrypoint: UDC.ENTRYPOINT,\n calldata: [\n classHash,\n deploySalt,\n toCairoBool(unique),\n compiledConstructorCallData.length,\n ...compiledConstructorCallData,\n ],\n },\n address: calculateContractAddressFromHash(\n unique ? starkCurve.pedersen(address, deploySalt) : deploySalt,\n classHash,\n compiledConstructorCallData,\n unique ? UDC.ADDRESS : 0\n ),\n };\n });\n\n return {\n calls: params.map((it) => it.call),\n addresses: params.map((it) => it.address),\n };\n}\n\n/**\n * Return transaction versions based on version type, default version type is 'transaction'.\n * @param {'fee' | 'transaction'} [versionType] the type of version (\"fee\" or \"transaction\")\n * @returns {v1: ETransactionVersion, v2: ETransactionVersion, v3: ETransactionVersion} an object containing the transaction versions.\n * @example\n * ```typescript\n * const result = transaction.getVersionsByType('fee');\n * // result = {\n * // v1: '0x100000000000000000000000000000001',\n * // v2: '0x100000000000000000000000000000002',\n * // v3: '0x100000000000000000000000000000003'\n * // }\n * ```\n */\nexport function getVersionsByType(versionType?: 'fee' | 'transaction') {\n return versionType === 'fee'\n ? {\n v1: ETransactionVersion.F1,\n v2: ETransactionVersion.F2,\n v3: ETransactionVersion.F3,\n }\n : { v1: ETransactionVersion.V1, v2: ETransactionVersion.V2, v3: ETransactionVersion.V3 };\n}\n","import { NetworkName, StarknetChainId } from '../constants';\nimport { LibraryError } from '../provider/errors';\nimport {\n AccountInvocationItem,\n AccountInvocations,\n BigNumberish,\n BlockIdentifier,\n BlockTag,\n Call,\n DeclareContractTransaction,\n DeployAccountContractTransaction,\n Invocation,\n InvocationsDetailsWithNonce,\n RpcProviderOptions,\n TransactionType,\n getEstimateFeeBulkOptions,\n getSimulateTransactionOptions,\n waitForTransactionOptions,\n} from '../types';\nimport { JRPC, RPCSPEC07 as RPC } from '../types/api';\nimport { CallData } from '../utils/calldata';\nimport { isSierra } from '../utils/contract';\nimport { validateAndParseEthAddress } from '../utils/eth';\nimport fetch from '../utils/fetchPonyfill';\nimport { getSelector, getSelectorFromName } from '../utils/hash';\nimport { stringify } from '../utils/json';\nimport { getHexStringArray, toHex, toStorageKey } from '../utils/num';\nimport { Block, getDefaultNodeUrl, isV3Tx, isVersion, wait } from '../utils/provider';\nimport { decompressProgram, signatureToHexArray } from '../utils/stark';\nimport { getVersionsByType } from '../utils/transaction';\n\nconst defaultOptions = {\n headers: { 'Content-Type': 'application/json' },\n blockIdentifier: BlockTag.PENDING,\n retries: 200,\n};\n\nexport class RpcChannel {\n public nodeUrl: string;\n\n public headers: object;\n\n readonly retries: number;\n\n public requestId: number;\n\n readonly blockIdentifier: BlockIdentifier;\n\n private chainId?: StarknetChainId;\n\n private specVersion?: string;\n\n private transactionRetryIntervalFallback?: number;\n\n readonly waitMode: Boolean; // behave like web2 rpc and return when tx is processed\n\n constructor(optionsOrProvider?: RpcProviderOptions) {\n const {\n nodeUrl,\n retries,\n headers,\n blockIdentifier,\n chainId,\n specVersion,\n waitMode,\n transactionRetryIntervalFallback,\n } = optionsOrProvider || {};\n if (Object.values(NetworkName).includes(nodeUrl as NetworkName)) {\n this.nodeUrl = getDefaultNodeUrl(nodeUrl as NetworkName, optionsOrProvider?.default);\n } else if (nodeUrl) {\n this.nodeUrl = nodeUrl;\n } else {\n this.nodeUrl = getDefaultNodeUrl(undefined, optionsOrProvider?.default);\n }\n this.retries = retries || defaultOptions.retries;\n this.headers = { ...defaultOptions.headers, ...headers };\n this.blockIdentifier = blockIdentifier || defaultOptions.blockIdentifier;\n this.chainId = chainId;\n this.specVersion = specVersion;\n this.waitMode = waitMode || false;\n this.requestId = 0;\n this.transactionRetryIntervalFallback = transactionRetryIntervalFallback;\n }\n\n private get transactionRetryIntervalDefault() {\n return this.transactionRetryIntervalFallback ?? 5000;\n }\n\n public setChainId(chainId: StarknetChainId) {\n this.chainId = chainId;\n }\n\n public fetch(method: string, params?: object, id: string | number = 0) {\n const rpcRequestBody: JRPC.RequestBody = {\n id,\n jsonrpc: '2.0',\n method,\n ...(params && { params }),\n };\n return fetch(this.nodeUrl, {\n method: 'POST',\n body: stringify(rpcRequestBody),\n headers: this.headers as Record<string, string>,\n });\n }\n\n protected errorHandler(method: string, params: any, rpcError?: JRPC.Error, otherError?: any) {\n if (rpcError) {\n const { code, message, data } = rpcError;\n throw new LibraryError(\n `RPC: ${method} with params ${stringify(params, null, 2)}\\n \n ${code}: ${message}: ${stringify(data)}`\n );\n }\n if (otherError instanceof LibraryError) {\n throw otherError;\n }\n if (otherError) {\n throw Error(otherError.message);\n }\n }\n\n protected async fetchEndpoint<T extends keyof RPC.Methods>(\n method: T,\n params?: RPC.Methods[T]['params']\n ): Promise<RPC.Methods[T]['result']> {\n try {\n const rawResult = await this.fetch(method, params, (this.requestId += 1));\n const { error, result } = await rawResult.json();\n this.errorHandler(method, params, error);\n return result as RPC.Methods[T]['result'];\n } catch (error: any) {\n this.errorHandler(method, params, error?.response?.data, error);\n throw error;\n }\n }\n\n public async getChainId() {\n this.chainId ??= (await this.fetchEndpoint('starknet_chainId')) as StarknetChainId;\n return this.chainId;\n }\n\n public async getSpecVersion() {\n this.specVersion ??= (await this.fetchEndpoint('starknet_specVersion')) as StarknetChainId;\n return this.specVersion;\n }\n\n public getNonceForAddress(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getNonce', {\n contract_address,\n block_id,\n });\n }\n\n /**\n * Get the most recent accepted block hash and number\n */\n public getBlockLatestAccepted() {\n return this.fetchEndpoint('starknet_blockHashAndNumber');\n }\n\n /**\n * Get the most recent accepted block number\n * redundant use getBlockLatestAccepted();\n * @returns Number of the latest block\n */\n public getBlockNumber() {\n return this.fetchEndpoint('starknet_blockNumber');\n }\n\n public getBlockWithTxHashes(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockWithTxHashes', { block_id });\n }\n\n public getBlockWithTxs(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockWithTxs', { block_id });\n }\n\n public getBlockWithReceipts(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockWithReceipts', { block_id });\n }\n\n public getBlockStateUpdate(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getStateUpdate', { block_id });\n }\n\n public getBlockTransactionsTraces(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_traceBlockTransactions', { block_id });\n }\n\n public getBlockTransactionCount(blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getBlockTransactionCount', { block_id });\n }\n\n public getTransactionByHash(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_getTransactionByHash', {\n transaction_hash,\n });\n }\n\n public getTransactionByBlockIdAndIndex(blockIdentifier: BlockIdentifier, index: number) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getTransactionByBlockIdAndIndex', { block_id, index });\n }\n\n public getTransactionReceipt(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_getTransactionReceipt', { transaction_hash });\n }\n\n public getTransactionTrace(txHash: BigNumberish) {\n const transaction_hash = toHex(txHash);\n return this.fetchEndpoint('starknet_traceTransaction', { transaction_hash });\n }\n\n /**\n * Get the status of a transaction\n */\n public getTransactionStatus(transactionHash: BigNumberish) {\n const transaction_hash = toHex(transactionHash);\n return this.fetchEndpoint('starknet_getTransactionStatus', { transaction_hash });\n }\n\n /**\n * @param invocations AccountInvocations\n * @param simulateTransactionOptions blockIdentifier and flags to skip validation and fee charge<br/>\n * - blockIdentifier<br/>\n * - skipValidate (default false)<br/>\n * - skipFeeCharge (default true)<br/>\n */\n public simulateTransaction(\n invocations: AccountInvocations,\n simulateTransactionOptions: getSimulateTransactionOptions = {}\n ) {\n const {\n blockIdentifier = this.blockIdentifier,\n skipValidate = true,\n skipFeeCharge = true,\n } = simulateTransactionOptions;\n const block_id = new Block(blockIdentifier).identifier;\n const simulationFlags: RPC.ESimulationFlag[] = [];\n if (skipValidate) simulationFlags.push(RPC.ESimulationFlag.SKIP_VALIDATE);\n if (skipFeeCharge) simulationFlags.push(RPC.ESimulationFlag.SKIP_FEE_CHARGE);\n\n return this.fetchEndpoint('starknet_simulateTransactions', {\n block_id,\n transactions: invocations.map((it) => this.buildTransaction(it)),\n simulation_flags: simulationFlags,\n });\n }\n\n public async waitForTransaction(txHash: BigNumberish, options?: waitForTransactionOptions) {\n const transactionHash = toHex(txHash);\n let { retries } = this;\n let onchain = false;\n let isErrorState = false;\n const retryInterval = options?.retryInterval ?? this.transactionRetryIntervalDefault;\n const errorStates: any = options?.errorStates ?? [\n RPC.ETransactionStatus.REJECTED,\n // TODO: commented out to preserve the long-standing behavior of \"reverted\" not being treated as an error by default\n // should decide which behavior to keep in the future\n // RPC.ETransactionExecutionStatus.REVERTED,\n ];\n const successStates: any = options?.successStates ?? [\n RPC.ETransactionExecutionStatus.SUCCEEDED,\n RPC.ETransactionStatus.ACCEPTED_ON_L2,\n RPC.ETransactionStatus.ACCEPTED_ON_L1,\n ];\n\n let txStatus: RPC.TransactionStatus;\n while (!onchain) {\n // eslint-disable-next-line no-await-in-loop\n await wait(retryInterval);\n try {\n // eslint-disable-next-line no-await-in-loop\n txStatus = await this.getTransactionStatus(transactionHash);\n\n const executionStatus = txStatus.execution_status;\n const finalityStatus = txStatus.finality_status;\n\n if (!finalityStatus) {\n // Transaction is potentially NOT_RECEIVED or RPC not Synced yet\n // so we will retry '{ retries }' times\n const error = new Error('waiting for transaction status');\n throw error;\n }\n\n if (errorStates.includes(executionStatus) || errorStates.includes(finalityStatus)) {\n const message = `${executionStatus}: ${finalityStatus}`;\n const error = new Error(message) as Error & { response: RPC.TransactionStatus };\n error.response = txStatus;\n isErrorState = true;\n throw error;\n } else if (\n successStates.includes(executionStatus) ||\n successStates.includes(finalityStatus)\n ) {\n onchain = true;\n }\n } catch (error) {\n if (error instanceof Error && isErrorState) {\n throw error;\n }\n\n if (retries <= 0) {\n throw new Error(`waitForTransaction timed-out with retries ${this.retries}`);\n }\n }\n\n retries -= 1;\n }\n\n /**\n * For some nodes even though the transaction has executionStatus SUCCEEDED finalityStatus ACCEPTED_ON_L2, getTransactionReceipt returns \"Transaction hash not found\"\n * Retry until rpc is actually ready to work with txHash\n */\n let txReceipt = null;\n while (txReceipt === null) {\n try {\n // eslint-disable-next-line no-await-in-loop\n txReceipt = await this.getTransactionReceipt(transactionHash);\n } catch (error) {\n if (retries <= 0) {\n throw new Error(`waitForTransaction timed-out with retries ${this.retries}`);\n }\n }\n retries -= 1;\n // eslint-disable-next-line no-await-in-loop\n await wait(retryInterval);\n }\n return txReceipt as RPC.SPEC.TXN_RECEIPT;\n }\n\n public getStorageAt(\n contractAddress: BigNumberish,\n key: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const parsedKey = toStorageKey(key);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getStorageAt', {\n contract_address,\n key: parsedKey,\n block_id,\n });\n }\n\n public getClassHashAt(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClassHashAt', {\n block_id,\n contract_address,\n });\n }\n\n public getClass(\n classHash: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const class_hash = toHex(classHash);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClass', {\n class_hash,\n block_id,\n });\n }\n\n public getClassAt(\n contractAddress: BigNumberish,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const contract_address = toHex(contractAddress);\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_getClassAt', {\n block_id,\n contract_address,\n });\n }\n\n public async getEstimateFee(\n invocations: AccountInvocations,\n { blockIdentifier = this.blockIdentifier, skipValidate = true }: getEstimateFeeBulkOptions\n ) {\n const block_id = new Block(blockIdentifier).identifier;\n let flags = {};\n if (!isVersion('0.5', await this.getSpecVersion())) {\n flags = {\n simulation_flags: skipValidate ? [RPC.ESimulationFlag.SKIP_VALIDATE] : [],\n };\n } // else v(0.5) no flags\n\n return this.fetchEndpoint('starknet_estimateFee', {\n request: invocations.map((it) => this.buildTransaction(it, 'fee')),\n block_id,\n ...flags,\n });\n }\n\n public async invoke(functionInvocation: Invocation, details: InvocationsDetailsWithNonce) {\n let promise;\n if (!isV3Tx(details)) {\n // V1\n promise = this.fetchEndpoint('starknet_addInvokeTransaction', {\n invoke_transaction: {\n sender_address: functionInvocation.contractAddress,\n calldata: CallData.toHex(functionInvocation.calldata),\n type: RPC.ETransactionType.INVOKE,\n max_fee: toHex(details.maxFee || 0),\n version: RPC.ETransactionVersion.V1,\n signature: signatureToHexArray(functionInvocation.signature),\n nonce: toHex(details.nonce),\n },\n });\n } else {\n // V3\n promise = this.fetchEndpoint('starknet_addInvokeTransaction', {\n invoke_transaction: {\n type: RPC.ETransactionType.INVOKE,\n sender_address: functionInvocation.contractAddress,\n calldata: CallData.toHex(functionInvocation.calldata),\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(functionInvocation.signature),\n nonce: toHex(details.nonce),\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n account_deployment_data: details.accountDeploymentData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public async declare(\n { contract, signature, senderAddress, compiledClassHash }: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n let promise;\n if (!isSierra(contract) && !isV3Tx(details)) {\n // V1 Cairo 0\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n contract_class: {\n program: contract.program,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n version: RPC.ETransactionVersion.V1,\n max_fee: toHex(details.maxFee || 0),\n signature: signatureToHexArray(signature),\n sender_address: senderAddress,\n nonce: toHex(details.nonce),\n },\n });\n } else if (isSierra(contract) && !isV3Tx(details)) {\n // V2 Cairo1\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n contract_class: {\n sierra_program: decompressProgram(contract.sierra_program),\n contract_class_version: contract.contract_class_version,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n compiled_class_hash: compiledClassHash || '',\n version: RPC.ETransactionVersion.V2,\n max_fee: toHex(details.maxFee || 0),\n signature: signatureToHexArray(signature),\n sender_address: senderAddress,\n nonce: toHex(details.nonce),\n },\n });\n } else if (isSierra(contract) && isV3Tx(details)) {\n // V3 Cairo1\n promise = this.fetchEndpoint('starknet_addDeclareTransaction', {\n declare_transaction: {\n type: RPC.ETransactionType.DECLARE,\n sender_address: senderAddress,\n compiled_class_hash: compiledClassHash || '',\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n contract_class: {\n sierra_program: decompressProgram(contract.sierra_program),\n contract_class_version: contract.contract_class_version,\n entry_points_by_type: contract.entry_points_by_type,\n abi: contract.abi,\n },\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n account_deployment_data: details.accountDeploymentData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n } else {\n throw Error('declare unspotted parameters');\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public async deployAccount(\n { classHash, constructorCalldata, addressSalt, signature }: DeployAccountContractTransaction,\n details: InvocationsDetailsWithNonce\n ) {\n let promise;\n if (!isV3Tx(details)) {\n // v1\n promise = this.fetchEndpoint('starknet_addDeployAccountTransaction', {\n deploy_account_transaction: {\n constructor_calldata: CallData.toHex(constructorCalldata || []),\n class_hash: toHex(classHash),\n contract_address_salt: toHex(addressSalt || 0),\n type: RPC.ETransactionType.DEPLOY_ACCOUNT,\n max_fee: toHex(details.maxFee || 0),\n version: RPC.ETransactionVersion.V1,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n },\n });\n } else {\n // v3\n promise = this.fetchEndpoint('starknet_addDeployAccountTransaction', {\n deploy_account_transaction: {\n type: RPC.ETransactionType.DEPLOY_ACCOUNT,\n version: RPC.ETransactionVersion.V3,\n signature: signatureToHexArray(signature),\n nonce: toHex(details.nonce),\n contract_address_salt: toHex(addressSalt || 0),\n constructor_calldata: CallData.toHex(constructorCalldata || []),\n class_hash: toHex(classHash),\n resource_bounds: details.resourceBounds,\n tip: toHex(details.tip),\n paymaster_data: details.paymasterData.map((it) => toHex(it)),\n nonce_data_availability_mode: details.nonceDataAvailabilityMode,\n fee_data_availability_mode: details.feeDataAvailabilityMode,\n },\n });\n }\n\n return this.waitMode ? this.waitForTransaction((await promise).transaction_hash) : promise;\n }\n\n public callContract(call: Call, blockIdentifier: BlockIdentifier = this.blockIdentifier) {\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_call', {\n request: {\n contract_address: call.contractAddress,\n entry_point_selector: getSelectorFromName(call.entrypoint),\n calldata: CallData.toHex(call.calldata),\n },\n block_id,\n });\n }\n\n /**\n * NEW: Estimate the fee for a message from L1\n * @param message Message From L1\n */\n public estimateMessageFee(\n message: RPC.L1Message,\n blockIdentifier: BlockIdentifier = this.blockIdentifier\n ) {\n const { from_address, to_address, entry_point_selector, payload } = message;\n const formattedMessage = {\n from_address: validateAndParseEthAddress(from_address),\n to_address: toHex(to_address),\n entry_point_selector: getSelector(entry_point_selector),\n payload: getHexStringArray(payload),\n };\n\n const block_id = new Block(blockIdentifier).identifier;\n return this.fetchEndpoint('starknet_estimateMessageFee', {\n message: formattedMessage,\n block_id,\n });\n }\n\n /**\n * Returns an object about the sync status, or false if the node is not synching\n * @returns Object with the stats data\n */\n public getSyncingStats() {\n return this.fetchEndpoint('starknet_syncing');\n }\n\n /**\n * Returns all events matching the given filter\n * @returns events and the pagination of the events\n */\n public getEvents(eventFilter: RPC.EventFilter) {\n return this.fetchEndpoint('starknet_getEvents', { filter: eventFilter });\n }\n\n public buildTransaction(\n invocation: AccountInvocationItem,\n versionType?: 'fee' | 'transaction'\n ): RPC.BaseTransaction {\n const defaultVersions = getVersionsByType(versionType);\n let details;\n\n if (!isV3Tx(invocation)) {\n // V0,V1,V2\n details = {\n signature: signatureToHexArray(invocation.signature),\n nonce: toHex(invocation.nonce),\n max_fee: toHex(invocation.maxFee || 0),\n };\n } else {\n // V3\n details = {\n signature: signatureToHexArray(invocation.signature),\n nonce: toHex(invocation.nonce),\n resource_bounds: invocation.resourceBounds,\n tip: toHex(invocation.tip),\n paymaster_data: invocation.paymasterData.map((it) => toHex(it)),\n nonce_data_availability_mode: invocation.nonceDataAvailabilityMode,\n fee_data_availability_mode: invocation.feeDataAvailabilityMode,\n account_deployment_data: invocation.accountDeploymentData.map((it) => toHex(it)),\n };\n }\n\n if (invocation.type === TransactionType.INVOKE) {\n return {\n // v0 v1 v3\n type: RPC.ETransactionType.INVOKE,\n sender_address: invocation.contractAddress,\n calldata: CallData.toHex(invocation.calldata),\n version: toHex(invocation.version || defaultVersions.v3),\n ...details,\n } as RPC.SPEC.BROADCASTED_INVOKE_TXN;\n }\n if (invocation.type === TransactionType.DECLARE) {\n if (!isSierra(invocation.contract)) {\n // Cairo 0 - v1\n return {\n type: invocation.type,\n contract_class: invocation.contract,\n sender_address: invocation.senderAddress,\n version: toHex(invocation.version || defaultVersions.v1),\n ...details,\n } as RPC.SPEC.BROADCASTED_DECLARE_TXN_V1;\n }\n return {\n // Cairo 1 - v2 v3\n type: invocation.type,\n contract_class: {\n ...invocation.contract,\n sierra_program: decompressProgram(invocation.contract.sierra_program),\n },\n compiled_class_hash: invocation.compiledClassHash || '',\n sender_address: invocation.senderAddress,\n version: toHex(invocation.version || defaultVersions.v3),\n ...details,\n } as RPC.SPEC.BROADCASTED_DECLARE_TXN;\n }\n if (invocation.type === TransactionType.DEPLOY_ACCOUNT) {\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n const { account_deployment_data, ...restDetails } = details;\n // v1 v3\n return {\n type: invocation.type,\n constructor_calldata: CallData.toHex(invocation.constructorCalldata || []),\n class_hash: toHex(invocation.classHash),\n contract_address_salt: toHex(invocation.addressSalt || 0),\n version: toHex(invocation.version || defaultVersions.v3) as RPC.SPEC.INVOKE_TXN['version'],\n ...restDetails,\n } as RPC.SPEC.BROADCASTED_DEPLOY_ACCOUNT_TXN;\n }\n throw Error('RPC buildTransaction received unknown TransactionType');\n }\n}\n","/**\n * Map RPC Response to common interface response\n * Intersection (sequencer response ∩ (∪ rpc responses))\n */\nimport type {\n BlockWithTxHashes,\n ContractClassPayload,\n ContractClassResponse,\n EstimateFeeResponse,\n EstimateFeeResponseBulk,\n FeeEstimate,\n GetBlockResponse,\n GetTxReceiptResponseWithoutHelper,\n RpcProviderOptions,\n SimulateTransactionResponse,\n SimulatedTransaction,\n TransactionReceipt,\n} from '../../types/provider';\nimport { toBigInt } from '../num';\nimport { isString } from '../shortString';\nimport { estimateFeeToBounds, estimatedFeeToMaxFee } from '../stark';\nimport { ResponseParser } from './interface';\n\nexport class RPCResponseParser\n implements\n Omit<\n ResponseParser,\n | 'parseDeclareContractResponse'\n | 'parseDeployContractResponse'\n | 'parseInvokeFunctionResponse'\n | 'parseGetTransactionReceiptResponse'\n | 'parseGetTransactionResponse'\n | 'parseCallContractResponse'\n >\n{\n private margin: RpcProviderOptions['feeMarginPercentage'];\n\n constructor(margin?: RpcProviderOptions['feeMarginPercentage']) {\n this.margin = margin;\n }\n\n private estimatedFeeToMaxFee(estimatedFee: Parameters<typeof estimatedFeeToMaxFee>[0]) {\n return estimatedFeeToMaxFee(estimatedFee, this.margin?.maxFee);\n }\n\n private estimateFeeToBounds(estimate: Parameters<typeof estimateFeeToBounds>[0]) {\n return estimateFeeToBounds(\n estimate,\n this.margin?.l1BoundMaxAmount,\n this.margin?.l1BoundMaxPricePerUnit\n );\n }\n\n public parseGetBlockResponse(res: BlockWithTxHashes): GetBlockResponse {\n return { status: 'PENDING', ...res } as GetBlockResponse;\n }\n\n public parseTransactionReceipt(res: TransactionReceipt): GetTxReceiptResponseWithoutHelper {\n // HOTFIX RPC 0.5 to align with RPC 0.6\n // This case is RPC 0.5. It can be only v2 thx with FRI units\n if ('actual_fee' in res && isString(res.actual_fee)) {\n return {\n ...(res as GetTxReceiptResponseWithoutHelper),\n actual_fee: {\n amount: res.actual_fee,\n unit: 'FRI',\n },\n } as GetTxReceiptResponseWithoutHelper;\n }\n\n return res as GetTxReceiptResponseWithoutHelper;\n }\n\n public parseFeeEstimateResponse(res: FeeEstimate[]): EstimateFeeResponse {\n const val = res[0];\n return {\n overall_fee: toBigInt(val.overall_fee),\n gas_consumed: toBigInt(val.gas_consumed),\n gas_price: toBigInt(val.gas_price),\n unit: val.unit,\n suggestedMaxFee: this.estimatedFeeToMaxFee(val.overall_fee),\n resourceBounds: this.estimateFeeToBounds(val),\n data_gas_consumed: val.data_gas_consumed ? toBigInt(val.data_gas_consumed) : 0n,\n data_gas_price: val.data_gas_price ? toBigInt(val.data_gas_price) : 0n,\n };\n }\n\n public parseFeeEstimateBulkResponse(res: FeeEstimate[]): EstimateFeeResponseBulk {\n return res.map((val) => ({\n overall_fee: toBigInt(val.overall_fee),\n gas_consumed: toBigInt(val.gas_consumed),\n gas_price: toBigInt(val.gas_price),\n unit: val.unit,\n suggestedMaxFee: this.estimatedFeeToMaxFee(val.overall_fee),\n resourceBounds: this.estimateFeeToBounds(val),\n data_gas_consumed: val.data_gas_consumed ? toBigInt(val.data_gas_consumed) : 0n,\n data_gas_price: val.data_gas_price ? toBigInt(val.data_gas_price) : 0n,\n }));\n }\n\n public parseSimulateTransactionResponse(\n // TODO: revisit\n // set as 'any' to avoid a mapped type circular recursion error stemming from\n // merging src/types/api/rpcspec*/components/FUNCTION_INVOCATION.calls\n //\n // res: SimulateTransactionResponse\n res: any\n ): SimulateTransactionResponse {\n return res.map((it: SimulatedTransaction) => {\n return {\n ...it,\n suggestedMaxFee: this.estimatedFeeToMaxFee(it.fee_estimation.overall_fee),\n resourceBounds: this.estimateFeeToBounds(it.fee_estimation),\n };\n });\n }\n\n public parseContractClassResponse(res: ContractClassPayload): ContractClassResponse {\n return {\n ...(res as ContractClassResponse),\n abi: isString(res.abi) ? JSON.parse(res.abi) : res.abi,\n };\n }\n\n public parseL1GasPriceResponse(res: BlockWithTxHashes): string {\n return res.l1_gas_price.price_in_wei;\n }\n}\n","/* eslint-disable no-nested-ternary */\nimport {\n GetTxReceiptResponseWithoutHelper,\n RejectedTransactionReceiptResponse,\n RevertedTransactionReceiptResponse,\n SuccessfulTransactionReceiptResponse,\n TransactionExecutionStatus,\n} from '../types';\nimport type {\n TransactionReceiptCallbacks,\n TransactionReceiptCallbacksDefault,\n TransactionReceiptStatus,\n TransactionReceiptUtilityInterface,\n TransactionReceiptValue,\n} from '../types/transactionReceipt';\n\n/**\n * Utility that analyses transaction receipt response and provides helpers to process it\n * @example\n * ```typescript\n * const responseTx = new ReceiptTx(receipt);\n * responseTx.match({\n * success: (txR: SuccessfulTransactionReceiptResponse) => { },\n * rejected: (txR: RejectedTransactionReceiptResponse) => { },\n * reverted: (txR: RevertedTransactionReceiptResponse) => { },\n * error: (err: Error) => { },\n * });\n * responseTx.match({\n * success: (txR: SuccessfulTransactionReceiptResponse) => { },\n * _: () => { },\n * }\n * ```\n */\nexport class ReceiptTx implements TransactionReceiptUtilityInterface {\n public readonly statusReceipt: TransactionReceiptStatus;\n\n public readonly value: TransactionReceiptValue;\n\n constructor(receipt: GetTxReceiptResponseWithoutHelper) {\n [this.statusReceipt, this.value] = ReceiptTx.isSuccess(receipt)\n ? ['success', receipt]\n : ReceiptTx.isReverted(receipt)\n ? ['reverted', receipt]\n : ReceiptTx.isRejected(receipt)\n ? ['rejected', receipt]\n : ['error', new Error('Unknown response type')];\n // eslint-disable-next-line no-restricted-syntax\n for (const [key] of Object.entries(this)) {\n Object.defineProperty(this, key, {\n enumerable: false,\n });\n }\n // eslint-disable-next-line no-restricted-syntax\n for (const [key, value] of Object.entries(receipt)) {\n Object.defineProperty(this, key, {\n enumerable: true,\n writable: false,\n value,\n });\n }\n }\n\n match(callbacks: TransactionReceiptCallbacks) {\n if (this.statusReceipt in callbacks) {\n return callbacks[this.statusReceipt]!(this.value as any);\n }\n return (callbacks as TransactionReceiptCallbacksDefault)._();\n }\n\n isSuccess(): this is SuccessfulTransactionReceiptResponse {\n return this.statusReceipt === 'success';\n }\n\n isReverted(): this is RevertedTransactionReceiptResponse {\n return this.statusReceipt === 'reverted';\n }\n\n isRejected(): this is RejectedTransactionReceiptResponse {\n return this.statusReceipt === 'rejected';\n }\n\n isError() {\n return this.statusReceipt === 'error';\n }\n\n static isSuccess(\n transactionReceipt: GetTxReceiptResponseWithoutHelper\n ): transactionReceipt is SuccessfulTransactionReceiptResponse {\n return (\n (transactionReceipt as SuccessfulTransactionReceiptResponse).execution_status ===\n TransactionExecutionStatus.SUCCEEDED\n );\n }\n\n static isReverted(\n transactionReceipt: GetTxReceiptResponseWithoutHelper\n ): transactionReceipt is RevertedTransactionReceiptResponse {\n return (\n (transactionReceipt as RevertedTransactionReceiptResponse).execution_status ===\n TransactionExecutionStatus.REVERTED\n );\n }\n\n static isRejected(\n transactionReceipt: GetTxReceiptResponseWithoutHelper\n ): transactionReceipt is RejectedTransactionReceiptResponse {\n return (\n (transactionReceipt as RejectedTransactionReceiptResponse).status ===\n TransactionExecutionStatus.REJECTED\n );\n }\n}\n\nexport type GetTransactionReceiptResponse = GetTxReceiptResponseWithoutHelper & ReceiptTx;\n","/* eslint-disable max-classes-per-file */\nimport { Mixin } from 'ts-mixer';\n\nimport { RpcProvider as BaseRpcProvider } from '../rpc';\nimport { StarknetId } from './starknetId';\n\nexport class RpcProvider extends Mixin(BaseRpcProvider, StarknetId) {}\n","import { StarknetChainId, ZERO } from '../constants';\nimport { BigNumberish } from '../types';\nimport { tuple } from './calldata/cairo';\nimport { CairoCustomEnum } from './calldata/enum/CairoCustomEnum';\n/* eslint-disable no-param-reassign */\n\nconst basicAlphabet = 'abcdefghijklmnopqrstuvwxyz0123456789-';\nconst basicSizePlusOne = BigInt(basicAlphabet.length + 1);\nconst bigAlphabet = '这来';\nconst basicAlphabetSize = BigInt(basicAlphabet.length);\nconst bigAlphabetSize = BigInt(bigAlphabet.length);\nconst bigAlphabetSizePlusOne = BigInt(bigAlphabet.length + 1);\n\nfunction extractStars(str: string): [string, number] {\n let k = 0;\n while (str.endsWith(bigAlphabet[bigAlphabet.length - 1])) {\n str = str.substring(0, str.length - 1);\n k += 1;\n }\n return [str, k];\n}\n\n/**\n * Decodes an array of BigInts into a string using the given algorithm.\n * @param {bigint[]} encoded The encoded array of BigInts.\n * @return {string} The decoded string.\n * @example\n * ```typescript\n * const result = starknetId.useDecoded([3015206943634620n]);\n * // result = \"starknetjs.stark\"\n * ```\n */\nexport function useDecoded(encoded: bigint[]): string {\n let decoded = '';\n\n encoded.forEach((subdomain) => {\n while (subdomain !== ZERO) {\n const code = subdomain % basicSizePlusOne;\n subdomain /= basicSizePlusOne;\n if (code === BigInt(basicAlphabet.length)) {\n const nextSubdomain = subdomain / bigAlphabetSizePlusOne;\n if (nextSubdomain === ZERO) {\n const code2 = subdomain % bigAlphabetSizePlusOne;\n subdomain = nextSubdomain;\n if (code2 === ZERO) decoded += basicAlphabet[0];\n else decoded += bigAlphabet[Number(code2) - 1];\n } else {\n const code2 = subdomain % bigAlphabetSize;\n decoded += bigAlphabet[Number(code2)];\n subdomain /= bigAlphabetSize;\n }\n } else decoded += basicAlphabet[Number(code)];\n }\n\n const [str, k] = extractStars(decoded);\n if (k)\n decoded =\n str +\n (k % 2 === 0\n ? bigAlphabet[bigAlphabet.length - 1].repeat(k / 2 - 1) +\n bigAlphabet[0] +\n basicAlphabet[1]\n : bigAlphabet[bigAlphabet.length - 1].repeat((k - 1) / 2 + 1));\n decoded += '.';\n });\n\n if (!decoded) {\n return decoded;\n }\n\n return decoded.concat('stark');\n}\n\n/**\n * Encodes a string into a bigint value.\n *\n * @param {string} decoded The string to be encoded.\n * @returns {bigint} The encoded bigint value.\n * @example\n * ```typescript\n * const result = starknetId.useEncoded(\"starknet.js\");\n * // result = 3015206943634620n\n * ```\n */\nexport function useEncoded(decoded: string): bigint {\n let encoded = BigInt(0);\n let multiplier = BigInt(1);\n\n if (decoded.endsWith(bigAlphabet[0] + basicAlphabet[1])) {\n const [str, k] = extractStars(decoded.substring(0, decoded.length - 2));\n decoded = str + bigAlphabet[bigAlphabet.length - 1].repeat(2 * (k + 1));\n } else {\n const [str, k] = extractStars(decoded);\n if (k) decoded = str + bigAlphabet[bigAlphabet.length - 1].repeat(1 + 2 * (k - 1));\n }\n\n for (let i = 0; i < decoded.length; i += 1) {\n const char = decoded[i];\n const index = basicAlphabet.indexOf(char);\n const bnIndex = BigInt(basicAlphabet.indexOf(char));\n\n if (index !== -1) {\n // add encoded + multiplier * index\n if (i === decoded.length - 1 && decoded[i] === basicAlphabet[0]) {\n encoded += multiplier * basicAlphabetSize;\n multiplier *= basicSizePlusOne;\n // add 0\n multiplier *= basicSizePlusOne;\n } else {\n encoded += multiplier * bnIndex;\n multiplier *= basicSizePlusOne;\n }\n } else if (bigAlphabet.indexOf(char) !== -1) {\n // add encoded + multiplier * (basicAlphabetSize)\n encoded += multiplier * basicAlphabetSize;\n multiplier *= basicSizePlusOne;\n // add encoded + multiplier * index\n const newid = (i === decoded.length - 1 ? 1 : 0) + bigAlphabet.indexOf(char);\n encoded += multiplier * BigInt(newid);\n multiplier *= bigAlphabetSize;\n }\n }\n\n return encoded;\n}\n\nexport enum StarknetIdContract {\n MAINNET = '0x6ac597f8116f886fa1c97a23fa4e08299975ecaf6b598873ca6792b9bbfb678',\n TESTNET_SEPOLIA = '0x154bc2e1af9260b9e66af0e9c46fc757ff893b3ff6a85718a810baf1474',\n}\n\n/**\n * Returns the Starknet ID contract address based on the provided chain ID.\n *\n * @param {StarknetChainId} chainId The chain ID of the Starknet network.\n * @return {string} The Starknet ID contract address.\n * @throws {Error} Throws an error if the Starknet ID contract is not deployed on the network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x154bc2e1af9260b9e66af0e9c46fc757ff893b3ff6a85718a810baf1474\"\n * ```\n */\nexport function getStarknetIdContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdContract.MAINNET;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdContract.TESTNET_SEPOLIA;\n\n default:\n throw new Error('Starknet.id is not yet deployed on this network');\n }\n}\n\nexport enum StarknetIdIdentityContract {\n MAINNET = '0x05dbdedc203e92749e2e746e2d40a768d966bd243df04a6b712e222bc040a9af',\n TESTNET_SEPOLIA = '0x3697660a0981d734780731949ecb2b4a38d6a58fc41629ed611e8defda',\n}\n\n/**\n * Returns the Starknet ID identity contract address for the given chain ID.\n *\n * @param {StarknetChainId} chainId The chain ID for the specified network.\n *\n * @return {string} The Starknet ID identity contract address for the specified network.\n *\n * @throws {Error} If the Starknet ID verifier contract is not deployed on the network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdIdentityContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x3697660a0981d734780731949ecb2b4a38d6a58fc41629ed611e8defda\"\n * ```\n */\nexport function getStarknetIdIdentityContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdIdentityContract.MAINNET;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdIdentityContract.TESTNET_SEPOLIA;\n\n default:\n throw new Error('Starknet.id verifier contract is not yet deployed on this network');\n }\n}\n\nexport const StarknetIdMulticallContract =\n '0x034ffb8f4452df7a613a0210824d6414dbadcddce6c6e19bf4ddc9e22ce5f970';\n\n/**\n * Returns the Starknet.id multicall contract address based on the provided chainId.\n *\n * @param {StarknetChainId} chainId - The chainId of the network.\n * @return {string} - The address of the Starknet.id multicall contract.\n * @throws {Error} - If the Starknet.id multicall contract is not deployed on the network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdMulticallContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x034ffb8f4452df7a613a0210824d6414dbadcddce6c6e19bf4ddc9e22ce5f970\"\n * ```\n */\nexport function getStarknetIdMulticallContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdMulticallContract;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdMulticallContract;\n\n default:\n throw new Error('Starknet.id multicall contract is not yet deployed on this network');\n }\n}\n\nexport enum StarknetIdVerifierContract {\n MAINNET = '0x07d14dfd8ee95b41fce179170d88ba1f0d5a512e13aeb232f19cfeec0a88f8bf',\n TESTNET_SEPOLIA = '0x60B94fEDe525f815AE5E8377A463e121C787cCCf3a36358Aa9B18c12c4D566',\n}\n\n/**\n * Returns the address of the Starknet ID Verifier contract based on the specified chain ID.\n *\n * @param {StarknetChainId} chainId - The ID of the Starknet chain.\n * @return {string} - The address of the Starknet ID Verifier contract.\n * @throws {Error} - If the Starknet ID Verifier contract is not deployed on the specified network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdVerifierContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x60B94fEDe525f815AE5E8377A463e121C787cCCf3a36358Aa9B18c12c4D566\"\n * ```\n */\nexport function getStarknetIdVerifierContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdVerifierContract.MAINNET;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdVerifierContract.TESTNET_SEPOLIA;\n\n default:\n throw new Error('Starknet.id verifier contract is not yet deployed on this network');\n }\n}\n\nexport enum StarknetIdPfpContract {\n MAINNET = '0x070aaa20ec4a46da57c932d9fd89ca5e6bb9ca3188d3df361a32306aff7d59c7',\n TESTNET_SEPOLIA = '0x9e7bdb8dabd02ea8cfc23b1d1c5278e46490f193f87516ed5ff2dfec02',\n}\n\n/**\n * Retrieves the contract address of the Starknet.id profile picture verifier contract based on the given chain ID.\n *\n * @param {StarknetChainId} chainId - The chain ID of the network.\n * @returns {string} - The contract address of the Starknet.id profile picture verifier contract.\n * @throws {Error} - Throws an error if the Starknet.id profile picture verifier contract is not yet deployed on the network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdPfpContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x9e7bdb8dabd02ea8cfc23b1d1c5278e46490f193f87516ed5ff2dfec02\"\n * ```\n */\nexport function getStarknetIdPfpContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdPfpContract.MAINNET;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdPfpContract.TESTNET_SEPOLIA;\n\n default:\n throw new Error(\n 'Starknet.id profile picture verifier contract is not yet deployed on this network'\n );\n }\n}\n\nexport enum StarknetIdPopContract {\n MAINNET = '0x0293eb2ba9862f762bd3036586d5755a782bd22e6f5028320f1d0405fd47bff4',\n TESTNET_SEPOLIA = '0x15ae88ae054caa74090b89025c1595683f12edf7a4ed2ad0274de3e1d4a',\n}\n\n/**\n * Retrieves the Starknet ID Proof of Personhood (IdPop) verifier contract address for the given chain ID.\n *\n * @param {StarknetChainId} chainId - The chain ID of the Starknet network.\n * @return {string} - The Starknet ID Pop contract address.\n * @throws {Error} - If the Starknet ID Pop contract is not deployed on the specified network.\n * @example\n * ```typescript\n * const result = starknetId.getStarknetIdPopContract(constants.StarknetChainId.SN_SEPOLIA);\n * // result = \"0x15ae88ae054caa74090b89025c1595683f12edf7a4ed2ad0274de3e1d4a\"\n * ```\n */\nexport function getStarknetIdPopContract(chainId: StarknetChainId): string {\n switch (chainId) {\n case StarknetChainId.SN_MAIN:\n return StarknetIdPopContract.MAINNET;\n\n case StarknetChainId.SN_SEPOLIA:\n return StarknetIdPopContract.TESTNET_SEPOLIA;\n\n default:\n throw new Error(\n 'Starknet.id proof of personhood verifier contract is not yet deployed on this network'\n );\n }\n}\n\n/**\n * Returns a CairoCustomEnum object.\n *\n * Functions to build CairoCustomEnum for multiCall contracts\n * @param {Object} [staticEx] An optional object defining the \"Static\" value of the CairoCustomEnum.\n * @param {number[]} [ifEqual] An optional array defining the \"IfEqual\" value of the CairoCustomEnum.\n * @param {number[]} [ifNotEqual] An optional array defining the \"IfNotEqual\" value of the CairoCustomEnum.\n * @return {CairoCustomEnum} - The created CairoCustomEnum object.\n * @example\n * ```typescript\n * const result: CairoCustomEnum = starknetId.execution(undefined, [1, 2, 3], undefined);\n * // result = CairoCustomEnum {\n * // variant: {\n * // Static: undefined,\n * // IfEqual: { '0': 1, '1': 2, '2': 3 },\n * // IfNotEqual: undefined\n * // }\n * // }\n * ```\n */\nexport function execution(\n staticEx: {} | undefined,\n ifEqual: number[] | undefined = undefined,\n ifNotEqual: number[] | undefined = undefined\n): CairoCustomEnum {\n return new CairoCustomEnum({\n Static: staticEx,\n IfEqual: ifEqual ? tuple(ifEqual[0], ifEqual[1], ifEqual[2]) : undefined,\n IfNotEqual: ifNotEqual ? tuple(ifNotEqual[0], ifNotEqual[1], ifNotEqual[2]) : undefined,\n });\n}\n\n/**\n * Creates a new instance of CairoCustomEnum.\n *\n * @param {BigNumberish} [hardcoded] The hardcoded value for the CairoCustomEnum.\n * @param {number[]} [reference] The reference array for the CairoCustomEnum.\n * @returns {CairoCustomEnum} The new instance of CairoCustomEnum.\n * @example\n * ```typescript\n * const result: CairoCustomEnum = starknetId.dynamicFelt(undefined, [1, 2]);\n * // result = CairoCustomEnum {\n * // variant: { Hardcoded: undefined, Reference: { '0': 1, '1': 2 } }\n * // }\n * ```\n */\nexport function dynamicFelt(\n hardcoded: BigNumberish | undefined,\n reference: number[] | undefined = undefined\n): CairoCustomEnum {\n return new CairoCustomEnum({\n Hardcoded: hardcoded,\n Reference: reference ? tuple(reference[0], reference[1]) : undefined,\n });\n}\n\n/**\n * Creates a new instance of CairoCustomEnum with the given parameters.\n * @param {BigNumberish} [hardcoded] The hardcoded value.\n * @param {BigNumberish[]} [reference] The reference value (optional).\n * @param {BigNumberish[]} [arrayReference] The array reference value (optional).\n * @return {CairoCustomEnum} The new instance of CairoCustomEnum.\n * @example\n * ```typescript\n * const result: CairoCustomEnum = starknetId.dynamicCallData(undefined, [1, 2], undefined);\n * // result = CairoCustomEnum {\n * // variant: {\n * // Hardcoded: undefined,\n * // Reference: { '0': 1, '1': 2 },\n * // ArrayReference: undefined\n * // }\n * // }\n * ```\n */\nexport function dynamicCallData(\n hardcoded: BigNumberish | undefined,\n reference: BigNumberish[] | undefined = undefined,\n arrayReference: BigNumberish[] | undefined = undefined\n): CairoCustomEnum {\n return new CairoCustomEnum({\n Hardcoded: hardcoded,\n Reference: reference ? tuple(reference[0], reference[1]) : undefined,\n ArrayReference: arrayReference ? tuple(arrayReference[0], arrayReference[1]) : undefined,\n });\n}\n","import { BigNumberish, RawArgsArray, StarkProfile } from '../../types';\nimport { CallData } from '../../utils/calldata';\nimport { getSelectorFromName } from '../../utils/hash';\nimport { decodeShortString, encodeShortString } from '../../utils/shortString';\nimport {\n dynamicCallData,\n dynamicFelt,\n execution,\n getStarknetIdContract,\n getStarknetIdIdentityContract,\n getStarknetIdMulticallContract,\n getStarknetIdPfpContract,\n getStarknetIdPopContract,\n getStarknetIdVerifierContract,\n useDecoded,\n useEncoded,\n} from '../../utils/starknetId';\nimport type { ProviderInterface } from '..';\n\nexport class StarknetId {\n async getStarkName(address: BigNumberish, StarknetIdContract?: string) {\n return StarknetId.getStarkName(\n // After Mixin, this is ProviderInterface\n (<unknown>this) as ProviderInterface,\n address,\n StarknetIdContract\n );\n }\n\n public async getAddressFromStarkName(name: string, StarknetIdContract?: string): Promise<string> {\n return StarknetId.getAddressFromStarkName(\n // After Mixin, this is ProviderInterface\n (<unknown>this) as ProviderInterface,\n name,\n StarknetIdContract\n );\n }\n\n async getStarkProfile(\n address: BigNumberish,\n StarknetIdContract?: string,\n StarknetIdIdentityContract?: string,\n StarknetIdVerifierContract?: string,\n StarknetIdPfpContract?: string,\n StarknetIdPopContract?: string,\n StarknetIdMulticallContract?: string\n ) {\n return StarknetId.getStarkProfile(\n // After Mixin, this is ProviderInterface\n (<unknown>this) as ProviderInterface,\n address,\n StarknetIdContract,\n StarknetIdIdentityContract,\n StarknetIdVerifierContract,\n StarknetIdPfpContract,\n StarknetIdPopContract,\n StarknetIdMulticallContract\n );\n }\n\n static async getStarkName(\n provider: ProviderInterface,\n address: BigNumberish,\n StarknetIdContract?: string\n ): Promise<string> {\n const chainId = await provider.getChainId();\n const contract = StarknetIdContract ?? getStarknetIdContract(chainId);\n\n try {\n const hexDomain = await provider.callContract({\n contractAddress: contract,\n entrypoint: 'address_to_domain',\n calldata: CallData.compile({\n address,\n hint: [],\n }),\n });\n const decimalDomain = hexDomain.map((element) => BigInt(element)).slice(1);\n\n const stringDomain = useDecoded(decimalDomain);\n\n if (!stringDomain) {\n throw Error('Starkname not found');\n }\n\n return stringDomain;\n } catch (e) {\n if (e instanceof Error && e.message === 'Starkname not found') {\n throw e;\n }\n throw Error('Could not get stark name');\n }\n }\n\n static async getAddressFromStarkName(\n provider: ProviderInterface,\n name: string,\n StarknetIdContract?: string\n ): Promise<string> {\n const chainId = await provider.getChainId();\n const contract = StarknetIdContract ?? getStarknetIdContract(chainId);\n\n try {\n const encodedDomain = name\n .replace('.stark', '')\n .split('.')\n .map((part) => useEncoded(part).toString(10));\n\n const addressData = await provider.callContract({\n contractAddress: contract,\n entrypoint: 'domain_to_address',\n calldata: CallData.compile({ domain: encodedDomain, hint: [] }),\n });\n\n return addressData[0];\n } catch {\n throw Error('Could not get address from stark name');\n }\n }\n\n static async getStarkProfile(\n provider: ProviderInterface,\n address: BigNumberish,\n StarknetIdContract?: string,\n StarknetIdIdentityContract?: string,\n StarknetIdVerifierContract?: string,\n StarknetIdPfpContract?: string,\n StarknetIdPopContract?: string,\n StarknetIdMulticallContract?: string\n ): Promise<StarkProfile> {\n const chainId = await provider.getChainId();\n const contract = StarknetIdContract ?? getStarknetIdContract(chainId);\n const identityContract = StarknetIdIdentityContract ?? getStarknetIdIdentityContract(chainId);\n const verifierContract = StarknetIdVerifierContract ?? getStarknetIdVerifierContract(chainId);\n const pfpContract = StarknetIdPfpContract ?? getStarknetIdPfpContract(chainId);\n const popContract = StarknetIdPopContract ?? getStarknetIdPopContract(chainId);\n const multicallAddress = StarknetIdMulticallContract ?? getStarknetIdMulticallContract(chainId);\n\n try {\n const calls: RawArgsArray = [\n {\n execution: execution({}),\n to: dynamicCallData(contract),\n selector: dynamicCallData(getSelectorFromName('address_to_domain')),\n calldata: [dynamicCallData(address), dynamicCallData('0')],\n },\n {\n execution: execution({}),\n to: dynamicFelt(contract),\n selector: dynamicFelt(getSelectorFromName('domain_to_id')),\n calldata: [dynamicCallData(undefined, undefined, [0, 0])],\n },\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('twitter')),\n dynamicCallData(verifierContract),\n dynamicCallData('0'),\n ],\n },\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('github')),\n dynamicCallData(verifierContract),\n dynamicCallData('0'),\n ],\n },\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('discord')),\n dynamicCallData(verifierContract),\n dynamicCallData('0'),\n ],\n },\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('proof_of_personhood')),\n dynamicCallData(popContract),\n dynamicCallData('0'),\n ],\n },\n // PFP\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('nft_pp_contract')),\n dynamicCallData(pfpContract),\n dynamicCallData('0'),\n ],\n },\n {\n execution: execution({}),\n to: dynamicFelt(identityContract),\n selector: dynamicFelt(getSelectorFromName('get_extended_verifier_data')),\n calldata: [\n dynamicCallData(undefined, [1, 0]),\n dynamicCallData(encodeShortString('nft_pp_id')),\n dynamicCallData('2'),\n dynamicCallData(pfpContract),\n dynamicCallData('0'),\n ],\n },\n {\n execution: execution(undefined, undefined, [6, 0, 0]),\n to: dynamicFelt(undefined, [6, 0]),\n selector: dynamicFelt(getSelectorFromName('tokenURI')),\n calldata: [dynamicCallData(undefined, [7, 1]), dynamicCallData(undefined, [7, 2])],\n },\n ];\n\n const data = await provider.callContract({\n contractAddress: multicallAddress,\n entrypoint: 'aggregate',\n calldata: CallData.compile({\n calls,\n }),\n });\n\n if (Array.isArray(data)) {\n // Format data\n const size = parseInt(data[0], 16);\n const finalArray: string[][] = [];\n let index = 1;\n for (let i = 0; i < size; i += 1) {\n if (index < data.length) {\n const subArraySize = parseInt(data[index], 16);\n index += 1;\n\n const subArray = data.slice(index, index + subArraySize);\n finalArray.push(subArray);\n\n index += subArraySize;\n } else {\n break;\n }\n }\n\n const name = useDecoded(finalArray[0].slice(1).map((hexString) => BigInt(hexString)));\n\n const twitter =\n finalArray[2][0] !== '0x0' ? BigInt(finalArray[2][0]).toString() : undefined;\n const github = finalArray[3][0] !== '0x0' ? BigInt(finalArray[3][0]).toString() : undefined;\n const discord =\n finalArray[4][0] !== '0x0' ? BigInt(finalArray[4][0]).toString() : undefined;\n const proofOfPersonhood = finalArray[5][0] === '0x1'; // 10\n\n const profilePictureMetadata =\n data[0] === '0x9'\n ? finalArray[8]\n .slice(1)\n .map((val: string) => decodeShortString(val))\n .join('')\n : undefined;\n\n const profilePicture =\n profilePictureMetadata ||\n `https://starknet.id/api/identicons/${BigInt(finalArray[1][0]).toString()}`;\n\n return {\n name,\n twitter,\n github,\n discord,\n proofOfPersonhood,\n profilePicture,\n };\n }\n throw Error('Error while calling aggregate function');\n } catch (e) {\n if (e instanceof Error) {\n throw e;\n }\n throw Error('Could not get user stark profile data from address');\n }\n }\n}\n","import { RPC06, RPC07 } from '../channel';\nimport { StarknetChainId } from '../constants';\nimport type {\n AccountInvocations,\n BigNumberish,\n Block,\n BlockIdentifier,\n Call,\n CallContractResponse,\n ContractClassResponse,\n ContractVersion,\n DeclareContractResponse,\n DeclareContractTransaction,\n DeployAccountContractPayload,\n DeployAccountContractTransaction,\n DeployContractResponse,\n EstimateFeeResponse,\n EstimateFeeResponseBulk,\n GetBlockResponse,\n GetTransactionResponse,\n Invocation,\n InvocationsDetailsWithNonce,\n InvokeFunctionResponse,\n Nonce,\n PendingBlock,\n SimulateTransactionResponse,\n StateUpdateResponse,\n Storage,\n getContractVersionOptions,\n getEstimateFeeBulkOptions,\n getSimulateTransactionOptions,\n waitForTransactionOptions,\n} from '../types';\nimport type { GetTransactionReceiptResponse } from '../utils/transactionReceipt';\n\nexport abstract class ProviderInterface {\n public abstract channel: RPC07.RpcChannel | RPC06.RpcChannel;\n\n /**\n * Gets the Starknet chain Id\n *\n * @returns the chain Id\n */\n public abstract getChainId(): Promise<StarknetChainId>;\n\n /**\n * Calls a function on the Starknet contract.\n *\n * @param call transaction to be called\n * @param blockIdentifier block identifier\n * @returns the result of the function on the smart contract.\n */\n public abstract callContract(\n call: Call,\n blockIdentifier?: BlockIdentifier\n ): Promise<CallContractResponse>;\n\n /**\n * Gets the block information\n *\n * @param blockIdentifier block identifier\n * @returns the block object\n */\n public abstract getBlock(blockIdentifier?: 'pending'): Promise<PendingBlock>;\n public abstract getBlock(blockIdentifier: 'latest'): Promise<Block>;\n public abstract getBlock(blockIdentifier: BlockIdentifier): Promise<GetBlockResponse>;\n\n /**\n * Gets the contract class of the deployed contract.\n *\n * @param contractAddress - contract address\n * @param blockIdentifier - block identifier\n * @returns Contract class of compiled contract\n */\n public abstract getClassAt(\n contractAddress: string,\n blockIdentifier?: BlockIdentifier\n ): Promise<ContractClassResponse>;\n\n /**\n * Gets the price of l1 gas in the block\n *\n * @param blockIdentifier block identifier\n * @returns gas price of the block\n */\n public abstract getL1GasPrice(blockIdentifier: BlockIdentifier): Promise<string>;\n\n /**\n * Get L1 message hash from L2 transaction hash\n * @param {BigNumberish} l2TxHash L2 transaction hash\n * @returns {string} Hex string of L1 message hash\n * @example\n * In Sepolia Testnet :\n * ```typescript\n * const result = provider.getL1MessageHash('0x28dfc05eb4f261b37ddad451ff22f1d08d4e3c24dc646af0ec69fa20e096819');\n * // result = '0x55b3f8b6e607fffd9b4d843dfe8f9b5c05822cd94fcad8797deb01d77805532a'\n * ```\n */\n public abstract getL1MessageHash(l2TxHash: BigNumberish): Promise<string>;\n\n /**\n * Returns the contract class hash in the given block for the contract deployed at the given address\n *\n * @param contractAddress - contract address\n * @param blockIdentifier - block identifier\n * @returns Class hash\n */\n public abstract getClassHashAt(\n contractAddress: string,\n blockIdentifier?: BlockIdentifier\n ): Promise<string>;\n\n /**\n * Returns the contract class deployed under the given class hash.\n *\n * @param classHash - class hash\n * @returns Contract class of compiled contract\n */\n public abstract getClassByHash(classHash: string): Promise<ContractClassResponse>;\n\n /**\n * Returns the nonce associated with the given address in the given block\n *\n * @param contractAddress - contract address\n * @returns the hex nonce\n */\n public abstract getNonceForAddress(\n contractAddress: string,\n blockIdentifier?: BlockIdentifier\n ): Promise<Nonce>;\n\n /**\n * Get the value of the storage (contract's variable) at the given address and key\n *\n * @param contractAddress\n * @param key - from getStorageVarAddress('<STORAGE_VARIABLE_NAME>') (WIP)\n * @param blockIdentifier - block identifier\n * @returns the value of the storage variable\n */\n public abstract getStorageAt(\n contractAddress: string,\n key: BigNumberish,\n blockIdentifier?: BlockIdentifier\n ): Promise<Storage>;\n\n /**\n * Gets the transaction information from a tx id.\n *\n * @param transactionHash\n * @returns the transaction object \\{ transaction_id, status, transaction, block_number?, block_number?, transaction_index?, transaction_failure_reason? \\}\n */\n public abstract getTransaction(transactionHash: BigNumberish): Promise<GetTransactionResponse>;\n\n /**\n * Gets the transaction receipt from a tx hash.\n *\n * @param transactionHash\n * @returns the transaction receipt object\n */\n public abstract getTransactionReceipt(\n transactionHash: BigNumberish\n ): Promise<GetTransactionReceiptResponse>;\n\n /**\n * Deploys a given compiled Account contract (json) to starknet\n *\n * @param payload payload to be deployed containing:\n * - compiled contract code\n * - constructor calldata\n * - address salt\n * @returns a confirmation of sending a transaction on the starknet contract\n */\n public abstract deployAccountContract(\n payload: DeployAccountContractPayload,\n details: InvocationsDetailsWithNonce\n ): Promise<DeployContractResponse>;\n\n /**\n * Invokes a function on starknet\n * @deprecated This method won't be supported as soon as fees are mandatory. Should not be used outside of Account class\n *\n * @param invocation the invocation object containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata - (defaults to []) the calldata\n * - signature - (defaults to []) the signature\n * @param details - optional details containing:\n * - nonce - optional nonce\n * - version - optional version\n * - maxFee - optional maxFee\n * @returns response from addTransaction\n */\n public abstract invokeFunction(\n invocation: Invocation,\n details: InvocationsDetailsWithNonce\n ): Promise<InvokeFunctionResponse>;\n\n /**\n * Declares a given compiled contract (json) to starknet\n * @param transaction transaction payload to be deployed containing:\n * - compiled contract code\n * - sender address\n * - signature\n * @param details Invocation Details containing:\n * - nonce\n * - optional version\n * - optional maxFee\n * @returns a confirmation of sending a transaction on the starknet contract\n */\n public abstract declareContract(\n transaction: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce\n ): Promise<DeclareContractResponse>;\n\n /**\n * Estimates the fee for a given INVOKE transaction\n * @deprecated Please use getInvokeEstimateFee or getDeclareEstimateFee instead. Should not be used outside of Account class\n *\n * @param invocation the invocation object containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata - (defaults to []) the calldata\n * - signature - (defaults to []) the signature\n * @param details - optional details containing:\n * - nonce - optional nonce\n * - version - optional version\n * @param blockIdentifier - (optional) block identifier\n * @param skipValidate - (optional) skip cairo __validate__ method\n * @returns the estimated fee\n */\n public abstract getEstimateFee(\n invocation: Invocation,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimates the fee for a given INVOKE transaction\n *\n * @param invocation the invocation object containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata - (defaults to []) the calldata\n * - signature - (defaults to []) the signature\n * @param details - optional details containing:\n * - nonce - optional nonce\n * - version - optional version\n * @param blockIdentifier - (optional) block identifier\n * @param skipValidate - (optional) skip cairo __validate__ method\n * @returns the estimated fee\n */\n public abstract getInvokeEstimateFee(\n invocation: Invocation,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimates the fee for a given DECLARE transaction\n *\n * @param transaction transaction payload to be declared containing:\n * - compiled contract code\n * - sender address\n * - signature - (defaults to []) the signature\n * @param details - optional details containing:\n * - nonce\n * - version - optional version\n * - optional maxFee\n * @param blockIdentifier - (optional) block identifier\n * @param skipValidate - (optional) skip cairo __validate__ method\n * @returns the estimated fee\n */\n public abstract getDeclareEstimateFee(\n transaction: DeclareContractTransaction,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimates the fee for a given DEPLOY_ACCOUNT transaction\n *\n * @param transaction transaction payload to be deployed containing:\n * - classHash\n * - constructorCalldata\n * - addressSalt\n * - signature - (defaults to []) the signature\n * @param details - optional details containing:\n * - nonce\n * - version - optional version\n * - optional maxFee\n * @param blockIdentifier - (optional) block identifier\n * @param skipValidate - (optional) skip cairo __validate__ method\n * @returns the estimated fee\n */\n public abstract getDeployAccountEstimateFee(\n transaction: DeployAccountContractTransaction,\n details: InvocationsDetailsWithNonce,\n blockIdentifier?: BlockIdentifier,\n skipValidate?: boolean\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimates the fee for a list of INVOKE transaction\n *\n * @param invocations AccountInvocations - Complete invocations array with account details\n * @param options getEstimateFeeBulkOptions\n * - (optional) blockIdentifier - BlockIdentifier\n * @returns the estimated fee\n */\n public abstract getEstimateFeeBulk(\n invocations: AccountInvocations,\n options?: getEstimateFeeBulkOptions\n ): Promise<EstimateFeeResponseBulk>;\n\n /**\n * Wait for the transaction to be accepted\n * @param txHash - transaction hash\n * @param options waitForTransactionOptions\n * - (optional) retryInterval: number | undefined;\n * - (optional) successStates: TransactionStatus[] | undefined;\n * @return GetTransactionReceiptResponse\n */\n public abstract waitForTransaction(\n txHash: BigNumberish,\n options?: waitForTransactionOptions\n ): Promise<GetTransactionReceiptResponse>;\n\n /**\n * Simulates the transaction and returns the transaction trace and estimated fee.\n *\n * @param invocations AccountInvocations - Complete invocations array with account details\n * @param options - getSimulateTransactionOptions\n * - (optional) blockIdentifier - block identifier\n * - (optional) skipValidate - skip cairo __validate__ method\n * - (optional) skipExecute - skip cairo __execute__ method\n * @returns an array of transaction trace and estimated fee\n */\n public abstract getSimulateTransaction(\n invocations: AccountInvocations,\n options?: getSimulateTransactionOptions\n ): Promise<SimulateTransactionResponse>;\n\n /**\n * Gets the state changes in a specific block (result of executing the requested block)\n *\n * @param blockIdentifier - block identifier\n * @returns StateUpdateResponse\n */\n public abstract getStateUpdate(blockIdentifier?: BlockIdentifier): Promise<StateUpdateResponse>;\n\n /**\n * Gets the contract version from the provided address\n * @param contractAddress string\n * @param classHash undefined\n * @param options - getContractVersionOptions\n * - (optional) compiler - (default true) extract compiler version using type tactic from abi\n * - (optional) blockIdentifier - block identifier\n */\n public abstract getContractVersion(\n contractAddress: string,\n classHash?: undefined,\n options?: getContractVersionOptions\n ): Promise<ContractVersion>;\n\n /**\n * Gets the contract version from the provided address\n * @param contractAddress undefined\n * @param classHash\n * @param options - getContractVersionOptions\n * - (optional) compiler - (default true) extract compiler version using type tactic from abi\n * - (optional) blockIdentifier - block identifier\n */\n public abstract getContractVersion(\n contractAddress: undefined,\n classHash: string,\n options?: getContractVersionOptions\n ): Promise<ContractVersion>;\n}\n","import { RpcProvider } from './rpc';\n\nexport { RpcProvider as Provider } from './extensions/default'; // backward-compatibility\nexport * from './errors';\nexport * from './interface';\nexport * from './extensions/default';\n\nexport const defaultProvider = new RpcProvider({ default: true });\n","import {\n Call,\n DeclareSignerDetails,\n DeployAccountSignerDetails,\n InvocationsSignerDetails,\n Signature,\n TypedData,\n} from '../types';\n\nexport abstract class SignerInterface {\n /**\n * Method to get the public key of the signer\n *\n * @returns {string} hex-string\n * @example\n * ```typescript\n * const mySigner = new Signer(\"0x123\");\n * const result = await mySigner.getPubKey();\n * // result = \"0x566d69d8c99f62bc71118399bab25c1f03719463eab8d6a444cd11ece131616\"\n * ```\n */\n public abstract getPubKey(): Promise<string>;\n\n /**\n * Signs a JSON object for off-chain usage with the private key and returns the signature.\n * This adds a message prefix so it can't be interchanged with transactions\n *\n * @param {TypedData} typedData JSON object to be signed\n * @param {string} accountAddress Hex string of the account's address\n * @returns {Promise<Signature>} the signature of the message\n * @example\n * ```typescript\n * const mySigner = new Signer(\"0x123\");\n * const myTypedData: TypedData = {\n * domain: {name: \"Example DApp\",\n * chainId: constants.StarknetChainId.SN_SEPOLIA,\n * version: \"0.0.3\"},\n * types: {StarkNetDomain: [\n * { name: \"name\", type: \"string\" },\n * { name: \"chainId\", type: \"felt\" },\n * { name: \"version\", type: \"string\" }],\n * Message: [{ name: \"message\", type: \"felt\" }]},\n * primaryType: \"Message\", message: {message: \"1234\"}};\n * const result = await mySigner.signMessage(myTypedData,\"0x5d08a4e9188429da4e993c9bf25aafe5cd491ee2b501505d4d059f0c938f82d\");\n * // result = Signature {r: 684915484701699003335398790608214855489903651271362390249153620883122231253n,\n * // s: 1399150959912500412309102776989465580949387575375484933432871778355496929189n, recovery: 1}\n * ```\n\n */\n public abstract signMessage(typedData: TypedData, accountAddress: string): Promise<Signature>;\n\n /**\n * Signs transactions with the private key and returns the signature\n *\n * @param {Call[]} transactions array of Call objects\n * @param {InvocationsSignerDetails} transactionsDetail InvocationsSignerDetails object\n * @returns {Promise<Signature>} the signature of the transaction\n * @example\n * ```typescript\n * const mySigner = new Signer(\"0x123\");\n * const calls: Call[] = [{\n * contractAddress: \"0x1234567890123456789012345678901234567890\",\n * entrypoint: \"functionName\",\n * calldata: [1, 2, 3]\n * }];\n * const transactionsDetail: InvocationsSignerDetails = {\n * walletAddress: '0x742d35Cc6634C0532925a3b844Bc454e4438f44e',\n * chainId: constants.StarknetChainId.SN_MAIN,\n * cairoVersion: \"1\",\n * maxFee: '0x1234567890abcdef',\n * version: \"0x0\", nonce: 1};\n * const result = await mySigner.signTransaction(calls, transactionsDetail);\n * // result = Signature {r: 304910226421970384958146916800275294114105560641204815169249090836676768876n,\n * // s: 1072798866000813654190523783606274062837012608648308896325315895472901074693n, recovery: 0}\n * ```\n */\n public abstract signTransaction(\n transactions: Call[],\n transactionsDetail: InvocationsSignerDetails\n ): Promise<Signature>;\n\n /**\n * Signs a DEPLOY_ACCOUNT transaction with the private key and returns the signature\n *\n * @param {DeployAccountSignerDetails} transaction to deploy an account contract\n * @returns {Promise<Signature>} the signature of the transaction to deploy an account\n * @example\n * ```typescript\n * const mySigner = new Signer(\"0x123\");\n * const myDeployAcc: DeployAccountSignerDetails = {\n * contractAddress: \"0x65a822fbee1ae79e898688b5a4282dc79e0042cbed12f6169937fddb4c26641\",\n * version: \"0x2\", chainId: constants.StarknetChainId.SN_SEPOLIA,\n * classHash: \"0x5f3614e8671257aff9ac38e929c74d65b02d460ae966cd826c9f04a7fa8e0d4\",\n * constructorCalldata: [1, 2],addressSalt: 1234,\n * nonce: 45, maxFee: 10 ** 15, tip: 0, paymasterData: [],accountDeploymentData: [],\n * nonceDataAvailabilityMode: RPC.EDataAvailabilityMode.L1,\n * feeDataAvailabilityMode: RPC.EDataAvailabilityMode.L1,\n * resourceBounds: stark.estimateFeeToBounds(constants.ZERO),\n * }\n * const result = await mySigner.signDeployAccountTransaction(myDeployAcc);\n * // result = Signature {r: 2871311234341436528393212130310036951068553852419934781736214693308640202748n,\n * // s: 1746271646048888422437132495446973163454853863041370993384284773665861377605n, recovery: 1}\n * ```\n */\n public abstract signDeployAccountTransaction(\n transaction: DeployAccountSignerDetails\n ): Promise<Signature>;\n\n /**\n * Signs a DECLARE transaction with the private key and returns the signature\n *\n * @param {DeclareSignerDetails} transaction to declare a class\n * @returns {Promise<Signature>} the signature of the transaction to declare a class\n * @example\n * ```typescript\n * const mySigner = new Signer(\"0x123\");\n * const myDeclare: DeclareSignerDetails = {\n * version: \"0x2\", chainId: constants.StarknetChainId.SN_SEPOLIA,\n * senderAddress: \"0x65a822fbee1ae79e898688b5a4282dc79e0042cbed12f6169937fddb4c26641\",\n * classHash: \"0x5f3614e8671257aff9ac38e929c74d65b02d460ae966cd826c9f04a7fa8e0d4\",\n * nonce: 45, maxFee: 10 ** 15, tip: 0, paymasterData: [], accountDeploymentData: [],\n * nonceDataAvailabilityMode: RPC.EDataAvailabilityMode.L1,\n * feeDataAvailabilityMode: RPC.EDataAvailabilityMode.L1,\n * resourceBounds: stark.estimateFeeToBounds(constants.ZERO),\n}\n * const result = await mySigner.signDeclareTransaction(myDeclare);\n * // result = Signature {r: 2432056944313955951711774394836075930010416436707488863728289188289211995670n,\n * // s: 3407649393310177489888603098175002856596469926897298636282244411990343146307n, recovery: 1}\n * ```\n */\n public abstract signDeclareTransaction(transaction: DeclareSignerDetails): Promise<Signature>;\n}\n","/* eslint-disable no-param-reassign */\nimport { PRIME, RANGE_FELT, RANGE_I128, RANGE_U128 } from '../constants';\nimport {\n BigNumberish,\n TypedDataRevision as Revision,\n StarknetEnumType,\n StarknetMerkleType,\n StarknetType,\n TypedData,\n} from '../types';\nimport assert from './assert';\nimport { byteArrayFromString } from './calldata/byteArray';\nimport {\n computePedersenHash,\n computePedersenHashOnElements,\n computePoseidonHash,\n computePoseidonHashOnElements,\n getSelectorFromName,\n} from './hash';\nimport { MerkleTree } from './merkle';\nimport { isHex, toHex } from './num';\nimport { encodeShortString, isString } from './shortString';\n\n/** @deprecated prefer importing from 'types' over 'typedData' */\nexport * from '../types/typedData';\n\ninterface Context {\n parent?: string;\n key?: string;\n}\n\ninterface Configuration {\n domain: string;\n hashMethod: (data: BigNumberish[]) => string;\n hashMerkleMethod: (a: BigNumberish, b: BigNumberish) => string;\n escapeTypeString: (s: string) => string;\n presetTypes: TypedData['types'];\n}\n\nconst presetTypes: TypedData['types'] = {\n u256: JSON.parse('[{ \"name\": \"low\", \"type\": \"u128\" }, { \"name\": \"high\", \"type\": \"u128\" }]'),\n TokenAmount: JSON.parse(\n '[{ \"name\": \"token_address\", \"type\": \"ContractAddress\" }, { \"name\": \"amount\", \"type\": \"u256\" }]'\n ),\n NftId: JSON.parse(\n '[{ \"name\": \"collection_address\", \"type\": \"ContractAddress\" }, { \"name\": \"token_id\", \"type\": \"u256\" }]'\n ),\n};\n\nconst revisionConfiguration: Record<Revision, Configuration> = {\n [Revision.ACTIVE]: {\n domain: 'StarknetDomain',\n hashMethod: computePoseidonHashOnElements,\n hashMerkleMethod: computePoseidonHash,\n escapeTypeString: (s) => `\"${s}\"`,\n presetTypes,\n },\n [Revision.LEGACY]: {\n domain: 'StarkNetDomain',\n hashMethod: computePedersenHashOnElements,\n hashMerkleMethod: computePedersenHash,\n escapeTypeString: (s) => s,\n presetTypes: {},\n },\n};\n\nfunction assertRange(data: unknown, type: string, { min, max }: { min: bigint; max: bigint }) {\n const value = BigInt(data as string);\n assert(value >= min && value <= max, `${value} (${type}) is out of bounds [${min}, ${max}]`);\n}\n\nfunction identifyRevision({ types, domain }: TypedData) {\n if (revisionConfiguration[Revision.ACTIVE].domain in types && domain.revision === Revision.ACTIVE)\n return Revision.ACTIVE;\n\n if (\n revisionConfiguration[Revision.LEGACY].domain in types &&\n (domain.revision ?? Revision.LEGACY) === Revision.LEGACY\n )\n return Revision.LEGACY;\n\n return undefined;\n}\n\nfunction getHex(value: BigNumberish): string {\n try {\n return toHex(value);\n } catch (e) {\n if (isString(value)) {\n return toHex(encodeShortString(value));\n }\n throw new Error(`Invalid BigNumberish: ${value}`);\n }\n}\n\n/**\n * Validates that `data` matches the EIP-712 JSON schema.\n */\nfunction validateTypedData(data: unknown): data is TypedData {\n const typedData = data as TypedData;\n return Boolean(\n typedData.message && typedData.primaryType && typedData.types && identifyRevision(typedData)\n );\n}\n\n/**\n * Prepares the selector for use.\n *\n * @param {string} selector - The selector to be prepared.\n * @returns {string} The prepared selector.\n */\nexport function prepareSelector(selector: string): string {\n return isHex(selector) ? selector : getSelectorFromName(selector);\n}\n\n/**\n * Checks if the given Starknet type is a Merkle tree type.\n *\n * @param {StarknetType} type - The StarkNet type to check.\n *\n * @returns {boolean} - True if the type is a Merkle tree type, false otherwise.\n */\nexport function isMerkleTreeType(type: StarknetType): type is StarknetMerkleType {\n return type.type === 'merkletree';\n}\n\n/**\n * Get the dependencies of a struct type. If a struct has the same dependency multiple times, it's only included once\n * in the resulting array.\n */\nexport function getDependencies(\n types: TypedData['types'],\n type: string,\n dependencies: string[] = [],\n contains: string = '',\n revision: Revision = Revision.LEGACY\n): string[] {\n // Include pointers (struct arrays)\n if (type[type.length - 1] === '*') {\n type = type.slice(0, -1);\n } else if (revision === Revision.ACTIVE) {\n // enum base\n if (type === 'enum') {\n type = contains;\n }\n // enum element types\n else if (type.match(/^\\(.*\\)$/)) {\n type = type.slice(1, -1);\n }\n }\n\n if (dependencies.includes(type) || !types[type]) {\n return dependencies;\n }\n\n return [\n type,\n ...(types[type] as StarknetEnumType[]).reduce<string[]>(\n (previous, t) => [\n ...previous,\n ...getDependencies(types, t.type, previous, t.contains, revision).filter(\n (dependency) => !previous.includes(dependency)\n ),\n ],\n []\n ),\n ];\n}\n\nfunction getMerkleTreeType(types: TypedData['types'], ctx: Context) {\n if (ctx.parent && ctx.key) {\n const parentType = types[ctx.parent];\n const merkleType = parentType.find((t) => t.name === ctx.key)!;\n const isMerkleTree = isMerkleTreeType(merkleType);\n if (!isMerkleTree) {\n throw new Error(`${ctx.key} is not a merkle tree`);\n }\n if (merkleType.contains.endsWith('*')) {\n throw new Error(`Merkle tree contain property must not be an array but was given ${ctx.key}`);\n }\n return merkleType.contains;\n }\n return 'raw';\n}\n\n/**\n * Encode a type to a string. All dependent types are alphabetically sorted.\n */\nexport function encodeType(\n types: TypedData['types'],\n type: string,\n revision: Revision = Revision.LEGACY\n): string {\n const allTypes =\n revision === Revision.ACTIVE\n ? { ...types, ...revisionConfiguration[revision].presetTypes }\n : types;\n const [primary, ...dependencies] = getDependencies(\n allTypes,\n type,\n undefined,\n undefined,\n revision\n );\n const newTypes = !primary ? [] : [primary, ...dependencies.sort()];\n\n const esc = revisionConfiguration[revision].escapeTypeString;\n\n return newTypes\n .map((dependency) => {\n const dependencyElements = allTypes[dependency].map((t) => {\n const targetType =\n t.type === 'enum' && revision === Revision.ACTIVE\n ? (t as StarknetEnumType).contains\n : t.type;\n // parentheses handling for enum variant types\n const typeString = targetType.match(/^\\(.*\\)$/)\n ? `(${targetType\n .slice(1, -1)\n .split(',')\n .map((e) => (e ? esc(e) : e))\n .join(',')})`\n : esc(targetType);\n return `${esc(t.name)}:${typeString}`;\n });\n return `${esc(dependency)}(${dependencyElements})`;\n })\n .join('');\n}\n\n/**\n * Get a type string as hash.\n */\nexport function getTypeHash(\n types: TypedData['types'],\n type: string,\n revision: Revision = Revision.LEGACY\n): string {\n return getSelectorFromName(encodeType(types, type, revision));\n}\n\n/**\n * Encodes a single value to an ABI serialisable string, number or Buffer. Returns the data as tuple, which consists of\n * an array of ABI compatible types, and an array of corresponding values.\n */\nexport function encodeValue(\n types: TypedData['types'],\n type: string,\n data: unknown,\n ctx: Context = {},\n revision: Revision = Revision.LEGACY\n): [string, string] {\n if (types[type]) {\n return [type, getStructHash(types, type, data as TypedData['message'], revision)];\n }\n\n if (revisionConfiguration[revision].presetTypes[type]) {\n return [\n type,\n getStructHash(\n revisionConfiguration[revision].presetTypes,\n type,\n data as TypedData['message'],\n revision\n ),\n ];\n }\n\n if (type.endsWith('*')) {\n const hashes: string[] = (data as Array<TypedData['message']>).map(\n (entry) => encodeValue(types, type.slice(0, -1), entry, undefined, revision)[1]\n );\n return [type, revisionConfiguration[revision].hashMethod(hashes)];\n }\n\n switch (type) {\n case 'enum': {\n if (revision === Revision.ACTIVE) {\n const [variantKey, variantData] = Object.entries(data as TypedData['message'])[0];\n\n const parentType = types[ctx.parent as string][0] as StarknetEnumType;\n const enumType = types[parentType.contains];\n const variantType = enumType.find((t) => t.name === variantKey) as StarknetType;\n const variantIndex = enumType.indexOf(variantType);\n\n const encodedSubtypes = variantType.type\n .slice(1, -1)\n .split(',')\n .map((subtype, index) => {\n if (!subtype) return subtype;\n const subtypeData = (variantData as unknown[])[index];\n return encodeValue(types, subtype, subtypeData, undefined, revision)[1];\n });\n return [\n type,\n revisionConfiguration[revision].hashMethod([variantIndex, ...encodedSubtypes]),\n ];\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'merkletree': {\n const merkleTreeType = getMerkleTreeType(types, ctx);\n const structHashes: string[] = (data as Array<TypedData['message']>).map((struct) => {\n return encodeValue(types, merkleTreeType, struct, undefined, revision)[1];\n });\n const { root } = new MerkleTree(\n structHashes as string[],\n revisionConfiguration[revision].hashMerkleMethod\n );\n return ['felt', root];\n }\n case 'selector': {\n return ['felt', prepareSelector(data as string)];\n }\n case 'string': {\n if (revision === Revision.ACTIVE) {\n const byteArray = byteArrayFromString(data as string);\n const elements = [\n byteArray.data.length,\n ...byteArray.data,\n byteArray.pending_word,\n byteArray.pending_word_len,\n ];\n return [type, revisionConfiguration[revision].hashMethod(elements)];\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'i128': {\n if (revision === Revision.ACTIVE) {\n const value = BigInt(data as string);\n assertRange(value, type, RANGE_I128);\n return [type, getHex(value < 0n ? PRIME + value : value)];\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'timestamp':\n case 'u128': {\n if (revision === Revision.ACTIVE) {\n assertRange(data, type, RANGE_U128);\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'felt':\n case 'shortstring': {\n // TODO: should 'shortstring' diverge into directly using encodeShortString()?\n if (revision === Revision.ACTIVE) {\n assertRange(getHex(data as string), type, RANGE_FELT);\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'ClassHash':\n case 'ContractAddress': {\n if (revision === Revision.ACTIVE) {\n assertRange(data, type, RANGE_FELT);\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n case 'bool': {\n if (revision === Revision.ACTIVE) {\n assert(typeof data === 'boolean', `Type mismatch for ${type} ${data}`);\n } // else fall through to default\n return [type, getHex(data as string)];\n }\n default: {\n if (revision === Revision.ACTIVE) {\n throw new Error(`Unsupported type: ${type}`);\n }\n return [type, getHex(data as string)];\n }\n }\n}\n\n/**\n * Encode the data to an ABI encoded Buffer. The data should be a key -> value object with all the required values.\n * All dependent types are automatically encoded.\n */\nexport function encodeData<T extends TypedData>(\n types: T['types'],\n type: string,\n data: T['message'],\n revision: Revision = Revision.LEGACY\n) {\n const targetType = types[type] ?? revisionConfiguration[revision].presetTypes[type];\n const [returnTypes, values] = targetType.reduce<[string[], string[]]>(\n ([ts, vs], field) => {\n if (\n data[field.name as keyof T['message']] === undefined ||\n (data[field.name as keyof T['message']] === null && field.type !== 'enum')\n ) {\n throw new Error(`Cannot encode data: missing data for '${field.name}'`);\n }\n\n const value = data[field.name as keyof T['message']];\n const ctx = { parent: type, key: field.name };\n const [t, encodedValue] = encodeValue(types, field.type, value, ctx, revision);\n\n return [\n [...ts, t],\n [...vs, encodedValue],\n ];\n },\n [['felt'], [getTypeHash(types, type, revision)]]\n );\n\n return [returnTypes, values];\n}\n\n/**\n * Get encoded data as a hash. The data should be a key -> value object with all the required values.\n * All dependent types are automatically encoded.\n */\nexport function getStructHash<T extends TypedData>(\n types: T['types'],\n type: string,\n data: T['message'],\n revision: Revision = Revision.LEGACY\n) {\n return revisionConfiguration[revision].hashMethod(encodeData(types, type, data, revision)[1]);\n}\n\n/**\n * Get the SNIP-12 encoded message to sign, from the typedData object.\n */\nexport function getMessageHash(typedData: TypedData, account: BigNumberish): string {\n if (!validateTypedData(typedData)) {\n throw new Error('Typed data does not match JSON schema');\n }\n\n const revision = identifyRevision(typedData) as Revision;\n const { domain, hashMethod } = revisionConfiguration[revision];\n\n const message = [\n encodeShortString('StarkNet Message'),\n getStructHash(typedData.types, domain, typedData.domain, revision),\n account,\n getStructHash(typedData.types, typedData.primaryType, typedData.message, revision),\n ];\n\n return hashMethod(message);\n}\n","import { BigNumberish } from '../types';\nimport { computePedersenHash } from './hash';\n\nexport class MerkleTree {\n public leaves: string[];\n\n public branches: string[][] = [];\n\n public root: string;\n\n public hashMethod: (a: BigNumberish, b: BigNumberish) => string;\n\n /**\n * Create a Merkle tree\n *\n * @param leafHashes hex-string array\n * @param hashMethod hash method to use, default: Pedersen\n * @returns created Merkle tree\n * @example\n * ```typescript\n * const leaves = ['0x1', '0x2', '0x3', '0x4', '0x5', '0x6', '0x7'];\n * const tree = new MerkleTree(leaves);\n * // tree = {\n * // branches: [['0x5bb9440e2...', '0x262697b88...', ...], ['0x38118a340...', ...], ...],\n * // leaves: ['0x1', '0x2', '0x3', '0x4', '0x5', '0x6', '0x7'],\n * // root: '0x7f748c75e5bdb7ae28013f076b8ab650c4e01d3530c6e5ab665f9f1accbe7d4',\n * // hashMethod: [Function computePedersenHash],\n * // }\n * ```\n */\n constructor(\n leafHashes: string[],\n hashMethod: (a: BigNumberish, b: BigNumberish) => string = computePedersenHash\n ) {\n this.hashMethod = hashMethod;\n this.leaves = leafHashes;\n this.root = this.build(leafHashes);\n }\n\n /** @ignore */\n private build(leaves: string[]): string {\n if (leaves.length === 1) {\n return leaves[0];\n }\n if (leaves.length !== this.leaves.length) {\n this.branches.push(leaves);\n }\n const newLeaves: string[] = [];\n for (let i = 0; i < leaves.length; i += 2) {\n if (i + 1 === leaves.length) {\n newLeaves.push(MerkleTree.hash(leaves[i], '0x0', this.hashMethod));\n } else {\n newLeaves.push(MerkleTree.hash(leaves[i], leaves[i + 1], this.hashMethod));\n }\n }\n return this.build(newLeaves);\n }\n\n /**\n * Calculate hash from ordered a and b, Pedersen hash default\n *\n * @param a first value\n * @param b second value\n * @param hashMethod hash method to use, default: Pedersen\n * @returns result of the hash function\n * @example\n * ```typescript\n * const result1 = MerkleTree.hash('0xabc', '0xdef');\n * // result1 = '0x484f029da7914ada038b1adf67fc83632364a3ebc2cd9349b41ab61626d9e82'\n *\n * const customHashMethod = (a, b) => `custom_${a}_${b}`;\n * const result2 = MerkleTree.hash('0xabc', '0xdef', customHashMethod);\n * // result2 = 'custom_2748_3567'\n * ```\n */\n static hash(\n a: BigNumberish,\n b: BigNumberish,\n hashMethod: (a: BigNumberish, b: BigNumberish) => string = computePedersenHash\n ) {\n const [aSorted, bSorted] = [BigInt(a), BigInt(b)].sort((x, y) => (x >= y ? 1 : -1));\n return hashMethod(aSorted, bSorted);\n }\n\n /**\n * Calculates the merkle membership proof path\n *\n * @param leaf hex-string\n * @param branch hex-string array\n * @param hashPath hex-string array\n * @returns collection of merkle proof hex-string hashes\n * @example\n * ```typescript\n * const leaves = ['0x1', '0x2', '0x3', '0x4', '0x5', '0x6', '0x7'];\n * const tree = new MerkleTree(leaves);\n * const result = tree.getProof('0x3');\n * // result = [\n * // '0x4',\n * // '0x5bb9440e27889a364bcb678b1f679ecd1347acdedcbf36e83494f857cc58026',\n * // '0x8c0e46dd2df9aaf3a8ebfbc25408a582ad7fa7171f0698ddbbc5130b4b4e60',\n * // ]\n * ```\n */\n public getProof(leaf: string, branch = this.leaves, hashPath: string[] = []): string[] {\n const index = branch.indexOf(leaf);\n if (index === -1) {\n throw new Error('leaf not found');\n }\n if (branch.length === 1) {\n return hashPath;\n }\n const isLeft = index % 2 === 0;\n const neededBranch = (isLeft ? branch[index + 1] : branch[index - 1]) ?? '0x0';\n const newHashPath = [...hashPath, neededBranch];\n const currentBranchLevelIndex =\n this.leaves.length === branch.length\n ? -1\n : this.branches.findIndex((b) => b.length === branch.length);\n const nextBranch = this.branches[currentBranchLevelIndex + 1] ?? [this.root];\n return this.getProof(\n MerkleTree.hash(isLeft ? leaf : neededBranch, isLeft ? neededBranch : leaf, this.hashMethod),\n nextBranch,\n newHashPath\n );\n }\n}\n\n/**\n * Tests a Merkle tree path\n *\n * @param root hex-string\n * @param leaf hex-string\n * @param path hex-string array\n * @param hashMethod hash method to use, default: Pedersen\n * @returns true if the path is valid, false otherwise\n * @example\n * ```typescript\n * const leaves = ['0x1', '0x2', '0x3', '0x4', '0x5', '0x6', '0x7'];\n * const tree = new MerkleTree(leaves);\n * const result = proofMerklePath(tree.root, '0x3', [\n * '0x4',\n * '0x5bb9440e27889a364bcb678b1f679ecd1347acdedcbf36e83494f857cc58026',\n * '0x8c0e46dd2df9aaf3a8ebfbc25408a582ad7fa7171f0698ddbbc5130b4b4e60',\n * ]);\n * // result = true\n * ```\n */\nexport function proofMerklePath(\n root: string,\n leaf: string,\n path: string[],\n hashMethod: (a: BigNumberish, b: BigNumberish) => string = computePedersenHash\n): boolean {\n if (path.length === 0) {\n return root === leaf;\n }\n const [next, ...rest] = path;\n return proofMerklePath(root, MerkleTree.hash(leaf, next, hashMethod), rest, hashMethod);\n}\n","import {\n Call,\n DeclareSignerDetails,\n DeployAccountSignerDetails,\n InvocationsSignerDetails,\n Signature,\n TypedData,\n V2DeclareSignerDetails,\n V2DeployAccountSignerDetails,\n V2InvocationsSignerDetails,\n V3DeclareSignerDetails,\n V3DeployAccountSignerDetails,\n V3InvocationsSignerDetails,\n} from '../types';\nimport { ETransactionVersion2, ETransactionVersion3 } from '../types/api';\nimport { CallData } from '../utils/calldata';\nimport { starkCurve } from '../utils/ec';\nimport { buf2hex } from '../utils/encode';\nimport {\n calculateDeclareTransactionHash,\n calculateDeployAccountTransactionHash,\n calculateInvokeTransactionHash,\n} from '../utils/hash';\nimport { toHex } from '../utils/num';\nimport { intDAM } from '../utils/stark';\nimport { getExecuteCalldata } from '../utils/transaction';\nimport { getMessageHash } from '../utils/typedData';\nimport { SignerInterface } from './interface';\n\nexport class Signer implements SignerInterface {\n protected pk: Uint8Array | string;\n\n constructor(pk: Uint8Array | string = starkCurve.utils.randomPrivateKey()) {\n this.pk = pk instanceof Uint8Array ? buf2hex(pk) : toHex(pk);\n }\n\n public async getPubKey(): Promise<string> {\n return starkCurve.getStarkKey(this.pk);\n }\n\n public async signMessage(typedData: TypedData, accountAddress: string): Promise<Signature> {\n const msgHash = getMessageHash(typedData, accountAddress);\n return this.signRaw(msgHash);\n }\n\n public async signTransaction(\n transactions: Call[],\n details: InvocationsSignerDetails\n ): Promise<Signature> {\n const compiledCalldata = getExecuteCalldata(transactions, details.cairoVersion);\n let msgHash;\n\n // TODO: How to do generic union discriminator for all like this\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2InvocationsSignerDetails;\n msgHash = calculateInvokeTransactionHash({\n ...det,\n senderAddress: det.walletAddress,\n compiledCalldata,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3InvocationsSignerDetails;\n msgHash = calculateInvokeTransactionHash({\n ...det,\n senderAddress: det.walletAddress,\n compiledCalldata,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signTransaction version');\n }\n\n return this.signRaw(msgHash as string);\n }\n\n public async signDeployAccountTransaction(\n details: DeployAccountSignerDetails\n ): Promise<Signature> {\n const compiledConstructorCalldata = CallData.compile(details.constructorCalldata);\n /* const version = BigInt(details.version).toString(); */\n let msgHash;\n\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2DeployAccountSignerDetails;\n msgHash = calculateDeployAccountTransactionHash({\n ...det,\n salt: det.addressSalt,\n constructorCalldata: compiledConstructorCalldata,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3DeployAccountSignerDetails;\n msgHash = calculateDeployAccountTransactionHash({\n ...det,\n salt: det.addressSalt,\n compiledConstructorCalldata,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signDeployAccountTransaction version');\n }\n\n return this.signRaw(msgHash as string);\n }\n\n public async signDeclareTransaction(\n // contractClass: ContractClass, // Should be used once class hash is present in ContractClass\n details: DeclareSignerDetails\n ): Promise<Signature> {\n let msgHash;\n\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2DeclareSignerDetails;\n msgHash = calculateDeclareTransactionHash({\n ...det,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3DeclareSignerDetails;\n msgHash = calculateDeclareTransactionHash({\n ...det,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signDeclareTransaction version');\n }\n\n return this.signRaw(msgHash as string);\n }\n\n protected async signRaw(msgHash: string): Promise<Signature> {\n return starkCurve.sign(msgHash, this.pk);\n }\n}\n","import type { RecoveredSignatureType } from '@noble/curves/abstract/weierstrass';\nimport { secp256k1 } from '@noble/curves/secp256k1';\n\nimport {\n ArraySignatureType,\n Call,\n DeclareSignerDetails,\n DeployAccountSignerDetails,\n InvocationsSignerDetails,\n Signature,\n TypedData,\n Uint256,\n V2DeclareSignerDetails,\n V2DeployAccountSignerDetails,\n V2InvocationsSignerDetails,\n V3DeclareSignerDetails,\n V3DeployAccountSignerDetails,\n V3InvocationsSignerDetails,\n} from '../types';\nimport { ETransactionVersion2, ETransactionVersion3 } from '../types/api';\nimport { CallData } from '../utils/calldata';\nimport { addHexPrefix, buf2hex, removeHexPrefix, sanitizeHex } from '../utils/encode';\nimport { ethRandomPrivateKey } from '../utils/eth';\nimport {\n calculateDeclareTransactionHash,\n calculateDeployAccountTransactionHash,\n calculateInvokeTransactionHash,\n} from '../utils/hash';\nimport { toHex } from '../utils/num';\nimport { intDAM } from '../utils/stark';\nimport { getExecuteCalldata } from '../utils/transaction';\nimport { getMessageHash } from '../utils/typedData';\nimport { bnToUint256 } from '../utils/uint256';\nimport { SignerInterface } from './interface';\n\n/**\n * Signer for accounts using Ethereum signature\n */\nexport class EthSigner implements SignerInterface {\n protected pk: string; // hex string without 0x and with an odd number of characters\n\n constructor(pk: Uint8Array | string = ethRandomPrivateKey()) {\n this.pk =\n pk instanceof Uint8Array\n ? buf2hex(pk).padStart(64, '0')\n : removeHexPrefix(toHex(pk)).padStart(64, '0');\n }\n\n /**\n * provides the Ethereum full public key (without parity prefix)\n * @returns an hex string : 64 first characters are Point X coordinate. 64 last characters are Point Y coordinate.\n */\n public async getPubKey(): Promise<string> {\n return addHexPrefix(\n buf2hex(secp256k1.getPublicKey(this.pk, false)).padStart(130, '0').slice(2)\n );\n }\n\n public async signMessage(typedData: TypedData, accountAddress: string): Promise<Signature> {\n const msgHash = getMessageHash(typedData, accountAddress);\n const signature: RecoveredSignatureType = secp256k1.sign(\n removeHexPrefix(sanitizeHex(msgHash)),\n this.pk\n );\n return this.formatEthSignature(signature);\n }\n\n public async signTransaction(\n transactions: Call[],\n details: InvocationsSignerDetails\n ): Promise<Signature> {\n const compiledCalldata = getExecuteCalldata(transactions, details.cairoVersion);\n let msgHash;\n\n // TODO: How to do generic union discriminator for all like this\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2InvocationsSignerDetails;\n msgHash = calculateInvokeTransactionHash({\n ...det,\n senderAddress: det.walletAddress,\n compiledCalldata,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3InvocationsSignerDetails;\n msgHash = calculateInvokeTransactionHash({\n ...det,\n senderAddress: det.walletAddress,\n compiledCalldata,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signTransaction version');\n }\n const signature: RecoveredSignatureType = secp256k1.sign(\n removeHexPrefix(sanitizeHex(msgHash)),\n this.pk\n );\n return this.formatEthSignature(signature);\n }\n\n public async signDeployAccountTransaction(\n details: DeployAccountSignerDetails\n ): Promise<Signature> {\n const compiledConstructorCalldata = CallData.compile(details.constructorCalldata);\n /* const version = BigInt(details.version).toString(); */\n let msgHash;\n\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2DeployAccountSignerDetails;\n msgHash = calculateDeployAccountTransactionHash({\n ...det,\n salt: det.addressSalt,\n constructorCalldata: compiledConstructorCalldata,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3DeployAccountSignerDetails;\n msgHash = calculateDeployAccountTransactionHash({\n ...det,\n salt: det.addressSalt,\n compiledConstructorCalldata,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signDeployAccountTransaction version');\n }\n const signature: RecoveredSignatureType = secp256k1.sign(\n removeHexPrefix(sanitizeHex(msgHash)),\n this.pk\n );\n return this.formatEthSignature(signature);\n }\n\n public async signDeclareTransaction(\n // contractClass: ContractClass, // Should be used once class hash is present in ContractClass\n details: DeclareSignerDetails\n ): Promise<Signature> {\n let msgHash;\n\n if (Object.values(ETransactionVersion2).includes(details.version as any)) {\n const det = details as V2DeclareSignerDetails;\n msgHash = calculateDeclareTransactionHash({\n ...det,\n version: det.version,\n });\n } else if (Object.values(ETransactionVersion3).includes(details.version as any)) {\n const det = details as V3DeclareSignerDetails;\n msgHash = calculateDeclareTransactionHash({\n ...det,\n version: det.version,\n nonceDataAvailabilityMode: intDAM(det.nonceDataAvailabilityMode),\n feeDataAvailabilityMode: intDAM(det.feeDataAvailabilityMode),\n });\n } else {\n throw Error('unsupported signDeclareTransaction version');\n }\n\n const signature: RecoveredSignatureType = secp256k1.sign(\n removeHexPrefix(sanitizeHex(msgHash)),\n this.pk\n );\n return this.formatEthSignature(signature);\n }\n\n /**\n * Serialize the signature in conformity with starknet::eth_signature::Signature\n * @param ethSignature secp256k1 signature from Noble curves library\n * @return an array of felts, representing a Cairo Eth Signature.\n */\n protected formatEthSignature(ethSignature: RecoveredSignatureType): ArraySignatureType {\n const r: Uint256 = bnToUint256(ethSignature.r);\n const s: Uint256 = bnToUint256(ethSignature.s);\n return [\n toHex(r.low),\n toHex(r.high),\n toHex(s.low),\n toHex(s.high),\n toHex(ethSignature.recovery),\n ] as ArraySignatureType;\n }\n}\n","/* eslint-disable no-bitwise */\nimport { BigNumberish, Uint256 } from '../types';\nimport { CairoUint256, UINT_128_MAX, UINT_256_MAX } from './cairoDataTypes/uint256';\n\n/**\n * @deprecated Legacy support Export\n */\nexport { UINT_128_MAX, UINT_256_MAX };\n\n/**\n * Convert Uint256 to bigint\n * Legacy support Export\n * @param {Uint256} uint256 Uint256 value to convert to bigint\n * @returns {bigint} BigInt representation of the input Uint256\n * @example\n * ```typescript\n * const uint256Value: Uint256 = {low: 1234567890, high: 1};\n * const result = uint256.uint256ToBN(uint256Value);\n * // result = 340282366920938463463374607433002779346n\n * ```\n */\nexport function uint256ToBN(uint256: Uint256): bigint {\n return new CairoUint256(uint256).toBigInt();\n}\n\n/**\n * Test BigNumberish is in the range[0, 2**256-1]\n * Legacy support Export\n * @param {BigNumberish} bn value to test\n * @returns {boolean} True if the input value is in the range[0, 2**256-1], false otherwise\n * @example\n * ```typescript\n * const result = uint256.isUint256(12345n);\n * // result = true\n * const result1 = uint256.isUint256(-1);\n * // result1 = false\n * ```\n */\nexport function isUint256(bn: BigNumberish): boolean {\n return CairoUint256.is(bn);\n}\n\n/**\n * Convert BigNumberish (string | number | bigint) to Uint256\n * Legacy support Export\n * @param {BigNumberish} bn value to convert to Uint256\n * @returns {Uint256} Uint256 object representing the BigNumberish value\n * @example\n * ```typescript\n * const result = uint256.bnToUint256(1000000000n);\n * // result = {\"low\": \"0x3b9aca00\", \"high\": \"0x0\"}\n * ```\n */\nexport function bnToUint256(bn: BigNumberish): Uint256 {\n return new CairoUint256(bn).toUint256HexString();\n}\n","import { UDC } from '../../constants';\nimport {\n Abi,\n AbiEnums,\n AbiEvents,\n AbiStructs,\n CairoEvent,\n AbiEvent,\n LegacyEvent,\n ParsedEvent,\n ParsedEvents,\n RPC,\n type CairoEventDefinition,\n type CairoEventVariant,\n type InvokeTransactionReceiptResponse,\n type AbiEntry,\n} from '../../types';\nimport assert from '../assert';\nimport { isCairo1Abi } from '../calldata/cairo';\nimport responseParser from '../calldata/responseParser';\nimport { starkCurve } from '../ec';\nimport { addHexPrefix, utf8ToArray } from '../encode';\nimport { cleanHex } from '../num';\n\n/**\n * Check if an ABI entry is related to events.\n * @param {AbiEntry} object an Abi entry\n * @returns {boolean} true if this Abi Entry is related to an event\n * @example\n * ```typescript\n * // use of a transaction receipt\n * ```\n */\nexport function isAbiEvent(object: AbiEntry): boolean {\n return object.type === 'event';\n}\n\n/**\n * Retrieves the events from the given Cairo 0 ABI.\n * @param {Abi} abi - The Cairo 0 ABI to extract events from.\n * @return {AbiEvents} - An object containing the hashes and the definition of the events.\n * @example\n * ```typescript\n * const result = events.getCairo0AbiEvents(abi0);\n * // result = {\n '0x35ea10b06d74221d24a134672e9f776a3088ba6b9829e53b9a10abd8817a211': {\n data: [{ name: 'admin_requester', type: 'felt' }, { name: 'new_requester', type: 'felt' }],\n keys: [],\n name: 'AddAdmin',\n type: 'event'\n }\n * ```\n */\nfunction getCairo0AbiEvents(abi: Abi) {\n return abi\n .filter((abiEntry) => abiEntry.type === 'event')\n .reduce((acc, abiEntry) => {\n const entryName = abiEntry.name;\n const abiEntryMod = { ...abiEntry };\n abiEntryMod.name = entryName;\n return {\n ...acc,\n [addHexPrefix(starkCurve.keccak(utf8ToArray(entryName)).toString(16))]: abiEntryMod,\n };\n }, {});\n}\n\n/**\n * Retrieves the events from the given Cairo 1 ABI.\n *\n * Is able to handle events nested in Cairo components.\n * @param {Abi} abi - The Cairo 1 ABI to extract events from.\n * @return {AbiEvents} - An object containing the hashes and the definition of the events.\n * @example\n * ```typescript\n * const result = events.getCairo1AbiEvents(abi1);\n * // result = {\n * // '0x22ea134d4126804c60797e633195f8c9aa5fd6d1567e299f4961d0e96f373ee': \n * // { '0x34e55c1cd55f1338241b50d352f0e91c7e4ffad0e4271d64eb347589ebdfd16': {\n * // kind: 'struct', type: 'event',\n * // name: 'ka::ExComponent::ex_logic_component::Mint',\n \n * // members: [{\n * // name: 'spender',\n * // type: 'core::starknet::contract_address::ContractAddress',\n * // kind: 'key'},\n * // { name: 'value', type: 'core::integer::u256', kind: 'data' }]},\n * // ...\n * ```\n */\nfunction getCairo1AbiEvents(abi: Abi) {\n const abiEventsStructs = abi.filter((obj) => isAbiEvent(obj) && obj.kind === 'struct');\n const abiEventsEnums = abi.filter((obj) => isAbiEvent(obj) && obj.kind === 'enum');\n const abiEventsData: AbiEvents = abiEventsStructs.reduce((acc: CairoEvent, event: CairoEvent) => {\n let nameList: string[] = [];\n let { name } = event;\n let flat: boolean = false;\n const findName = (variant: CairoEventVariant) => variant.type === name;\n // eslint-disable-next-line no-constant-condition\n while (true) {\n const eventEnum = abiEventsEnums.find((eventE) => eventE.variants.some(findName));\n if (typeof eventEnum === 'undefined') break;\n const variant = eventEnum.variants.find(findName);\n nameList.unshift(variant.name);\n if (variant.kind === 'flat') flat = true;\n name = eventEnum.name;\n }\n if (nameList.length === 0) {\n throw new Error('inconsistency in ABI events definition.');\n }\n if (flat) nameList = [nameList[nameList.length - 1]];\n const final = nameList.pop();\n let result: AbiEvents = {\n [addHexPrefix(starkCurve.keccak(utf8ToArray(final!)).toString(16))]: event,\n };\n while (nameList.length > 0) {\n result = {\n [addHexPrefix(starkCurve.keccak(utf8ToArray(nameList.pop()!)).toString(16))]: result,\n };\n }\n result = { ...result };\n return mergeAbiEvents(acc, result);\n }, {});\n return abiEventsData;\n}\n\n/**\n * Retrieves the events from the given ABI (from Cairo 0 or Cairo 1 contract).\n *\n * Is able to handle Cairo 1 events nested in Cairo components.\n * @param {Abi} abi - The ABI to extract events from.\n * @return {AbiEvents} - An object containing the hashes and the definition of the events.\n * @example\n * ```typescript\n * const result = events.getAbiEvents(abi);\n * // result = {\n * // '0x22ea134d4126804c60797e633195f8c9aa5fd6d1567e299f4961d0e96f373ee': \n * // { '0x34e55c1cd55f1338241b50d352f0e91c7e4ffad0e4271d64eb347589ebdfd16': {\n * // kind: 'struct', type: 'event',\n * // name: 'ka::ExComponent::ex_logic_component::Mint',\n \n * // members: [{\n * // name: 'spender',\n * // type: 'core::starknet::contract_address::ContractAddress',\n * // kind: 'key'},\n * // { name: 'value', type: 'core::integer::u256', kind: 'data' }]},\n * // ...\n * ```\n */\nexport function getAbiEvents(abi: Abi): AbiEvents {\n return isCairo1Abi(abi) ? getCairo1AbiEvents(abi) : getCairo0AbiEvents(abi);\n}\n\n/**\n * Checks if a given value is an object (Object or Array)\n * @param {any} item the tested item\n * @returns {boolean}\n * @example\n * ```typescript\n * const result = events.isObject({event: \"pending\"});\n * // result = true\n * ```\n */\nexport function isObject(item: any): boolean {\n return item && typeof item === 'object' && !Array.isArray(item);\n}\n\n/**\n * internal function to deep merge 2 event description objects\n */\nfunction mergeAbiEvents(target: any, source: any): Object {\n const output = { ...target };\n if (isObject(target) && isObject(source)) {\n Object.keys(source).forEach((key) => {\n if (isObject(source[key])) {\n if (!(key in target)) Object.assign(output, { [key]: source[key] });\n else output[key] = mergeAbiEvents(target[key], source[key]);\n } else {\n Object.assign(output, { [key]: source[key] });\n }\n });\n }\n return output;\n}\n\n/**\n * Parse raw events and structure them into response object based on a contract structs and defined events\n * @param {RPC.Event[]} providerReceivedEvents Array of raw events\n * @param {AbiEvents} abiEvents Events defined in the abi\n * @param {AbiStructs} abiStructs Structs defined in the abi\n * @param {AbiEnums} abiEnums Enums defined in the abi\n * @returns {ParsedEvents} parsed events corresponding to the abi\n * @example\n * ```typescript\n * const abiEvents = events.getAbiEvents(sierra.abi);\n * const abiStructs = CallData.getAbiStruct(sierra.abi);\n * const abiEnums = CallData.getAbiEnum(sierra.abi);\n * const result = events.parseEvents(myEvents, abiEvents, abiStructs, abiEnums);\n * // result = [{test::ExCh::ex_ch::Trade: {\n maker: 7548613724711489396448209137n,\n taker: 6435850562375218974960297344n,\n router_maker: 0n,\n }}]\n * ```\n */\nexport function parseEvents(\n providerReceivedEvents: RPC.Event[],\n abiEvents: AbiEvents,\n abiStructs: AbiStructs,\n abiEnums: AbiEnums\n): ParsedEvents {\n const ret = providerReceivedEvents.flat().reduce((acc, recEvent: RPC.Event) => {\n let abiEvent: AbiEvent | AbiEvents = abiEvents[recEvent.keys.shift() ?? 0];\n if (!abiEvent) {\n return acc;\n }\n while (!abiEvent.name) {\n const hashName = recEvent.keys.shift();\n assert(!!hashName, 'Not enough data in \"key\" property of this event.');\n abiEvent = (abiEvent as AbiEvents)[hashName];\n }\n // Create our final event object\n const parsedEvent: ParsedEvent = {};\n parsedEvent[abiEvent.name as string] = {};\n // Remove the event's name hashed from the keys array\n const keysIter = recEvent.keys[Symbol.iterator]();\n const dataIter = recEvent.data[Symbol.iterator]();\n\n const abiEventKeys =\n (abiEvent as CairoEventDefinition).members?.filter((it) => it.kind === 'key') ||\n (abiEvent as LegacyEvent).keys;\n const abiEventData =\n (abiEvent as CairoEventDefinition).members?.filter((it) => it.kind === 'data') ||\n (abiEvent as LegacyEvent).data;\n\n abiEventKeys.forEach((key) => {\n parsedEvent[abiEvent.name as string][key.name] = responseParser(\n keysIter,\n key,\n abiStructs,\n abiEnums,\n parsedEvent[abiEvent.name as string]\n );\n });\n\n abiEventData.forEach((data) => {\n parsedEvent[abiEvent.name as string][data.name] = responseParser(\n dataIter,\n data,\n abiStructs,\n abiEnums,\n parsedEvent[abiEvent.name as string]\n );\n });\n acc.push(parsedEvent);\n return acc;\n }, [] as ParsedEvents);\n return ret;\n}\n\n/**\n * Parse Transaction Receipt Event from UDC invoke transaction and\n * create DeployContractResponse compatible response with addition of the UDC Event data\n *\n * @returns DeployContractResponse | UDC Event Response data\n */\nexport function parseUDCEvent(txReceipt: InvokeTransactionReceiptResponse) {\n if (!txReceipt.events) {\n throw new Error('UDC emitted event is empty');\n }\n const event = txReceipt.events.find(\n (it: any) => cleanHex(it.from_address) === cleanHex(UDC.ADDRESS)\n ) || {\n data: [],\n };\n return {\n transaction_hash: txReceipt.transaction_hash,\n contract_address: event.data[0],\n address: event.data[0],\n deployer: event.data[1],\n unique: event.data[2],\n classHash: event.data[3],\n calldata_len: event.data[4],\n calldata: event.data.slice(5, 5 + parseInt(event.data[4], 16)),\n salt: event.data[event.data.length - 1],\n };\n}\n","// eslint-disable-next-line @typescript-eslint/no-unused-vars\nimport type { SPEC } from 'starknet-types-07';\nimport { UDC, ZERO } from '../constants';\nimport { Provider, ProviderInterface } from '../provider';\nimport { Signer, SignerInterface } from '../signer';\nimport {\n Abi,\n AccountInvocations,\n AccountInvocationsFactoryDetails,\n AllowArray,\n BigNumberish,\n BlockIdentifier,\n CairoVersion,\n Call,\n DeclareAndDeployContractPayload,\n DeclareContractPayload,\n DeclareContractResponse,\n DeclareContractTransaction,\n DeclareDeployUDCResponse,\n DeployAccountContractPayload,\n DeployAccountContractTransaction,\n DeployContractResponse,\n DeployContractUDCResponse,\n DeployTransactionReceiptResponse,\n EstimateFee,\n EstimateFeeAction,\n EstimateFeeBulk,\n Invocation,\n Invocations,\n InvocationsSignerDetails,\n InvokeFunctionResponse,\n MultiDeployContractResponse,\n Nonce,\n ProviderOptions,\n Signature,\n SimulateTransactionDetails,\n SimulateTransactionResponse,\n TransactionType,\n TypedData,\n UniversalDeployerContractPayload,\n UniversalDetails,\n} from '../types';\nimport { ETransactionVersion, ETransactionVersion3, ResourceBounds } from '../types/api';\nimport { CallData } from '../utils/calldata';\nimport { extractContractHashes, isSierra } from '../utils/contract';\nimport { parseUDCEvent } from '../utils/events';\nimport { calculateContractAddressFromHash } from '../utils/hash';\nimport { toBigInt, toCairoBool } from '../utils/num';\nimport { parseContract } from '../utils/provider';\nimport { isString } from '../utils/shortString';\nimport {\n estimateFeeToBounds,\n formatSignature,\n reduceV2,\n toFeeVersion,\n toTransactionVersion,\n v3Details,\n} from '../utils/stark';\nimport { buildUDCCall, getExecuteCalldata } from '../utils/transaction';\nimport { getMessageHash } from '../utils/typedData';\nimport { AccountInterface } from './interface';\n\nexport class Account extends Provider implements AccountInterface {\n public signer: SignerInterface;\n\n public address: string;\n\n public cairoVersion: CairoVersion;\n\n readonly transactionVersion: typeof ETransactionVersion.V2 | typeof ETransactionVersion.V3;\n\n constructor(\n providerOrOptions: ProviderOptions | ProviderInterface,\n address: string,\n pkOrSigner: Uint8Array | string | SignerInterface,\n cairoVersion?: CairoVersion,\n transactionVersion:\n | typeof ETransactionVersion.V2\n | typeof ETransactionVersion.V3 = ETransactionVersion.V2 // TODO: Discuss this, set to v2 for backward compatibility\n ) {\n super(providerOrOptions);\n this.address = address.toLowerCase();\n this.signer =\n isString(pkOrSigner) || pkOrSigner instanceof Uint8Array\n ? new Signer(pkOrSigner)\n : pkOrSigner;\n\n if (cairoVersion) {\n this.cairoVersion = cairoVersion.toString() as CairoVersion;\n }\n this.transactionVersion = transactionVersion;\n }\n\n // provided version or contract based preferred transactionVersion\n protected getPreferredVersion(type12: ETransactionVersion, type3: ETransactionVersion) {\n if (this.transactionVersion === ETransactionVersion.V3) return type3;\n if (this.transactionVersion === ETransactionVersion.V2) return type12;\n\n return ETransactionVersion.V3;\n }\n\n public async getNonce(blockIdentifier?: BlockIdentifier): Promise<Nonce> {\n return super.getNonceForAddress(this.address, blockIdentifier);\n }\n\n protected async getNonceSafe(nonce?: BigNumberish) {\n // Patch DEPLOY_ACCOUNT: RPC getNonce for non-existing address will result in error\n try {\n return toBigInt(nonce ?? (await this.getNonce()));\n } catch (error) {\n return 0n;\n }\n }\n\n /**\n * Retrieves the Cairo version from the network and sets `cairoVersion` if not already set in the constructor.\n * @param classHash if provided detects Cairo version from classHash, otherwise from the account address\n */\n public async getCairoVersion(classHash?: string) {\n if (!this.cairoVersion) {\n const { cairo } = classHash\n ? await super.getContractVersion(undefined, classHash)\n : await super.getContractVersion(this.address);\n this.cairoVersion = cairo;\n }\n return this.cairoVersion;\n }\n\n public async estimateFee(\n calls: AllowArray<Call>,\n estimateFeeDetails: UniversalDetails = {}\n ): Promise<EstimateFee> {\n return this.estimateInvokeFee(calls, estimateFeeDetails);\n }\n\n public async estimateInvokeFee(\n calls: AllowArray<Call>,\n details: UniversalDetails = {}\n ): Promise<EstimateFee> {\n const {\n nonce: providedNonce,\n blockIdentifier,\n version: providedVersion,\n skipValidate = true,\n } = details;\n\n const transactions = Array.isArray(calls) ? calls : [calls];\n const nonce = toBigInt(providedNonce ?? (await this.getNonce()));\n const version = toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.F1, ETransactionVersion.F3),\n toFeeVersion(providedVersion)\n );\n const chainId = await this.getChainId();\n\n const signerDetails: InvocationsSignerDetails = {\n ...v3Details(details),\n walletAddress: this.address,\n nonce,\n maxFee: ZERO,\n version,\n chainId,\n cairoVersion: await this.getCairoVersion(),\n skipValidate,\n };\n\n const invocation = await this.buildInvocation(transactions, signerDetails);\n return super.getInvokeEstimateFee(\n { ...invocation },\n { ...v3Details(details), version, nonce },\n blockIdentifier,\n details.skipValidate\n );\n }\n\n public async estimateDeclareFee(\n payload: DeclareContractPayload,\n details: UniversalDetails = {}\n ): Promise<EstimateFee> {\n const {\n blockIdentifier,\n nonce: providedNonce,\n version: providedVersion,\n skipValidate = true,\n } = details;\n const nonce = toBigInt(providedNonce ?? (await this.getNonce()));\n const version = toTransactionVersion(\n !isSierra(payload.contract)\n ? ETransactionVersion.F1\n : this.getPreferredVersion(ETransactionVersion.F2, ETransactionVersion.F3),\n toFeeVersion(providedVersion)\n );\n const chainId = await this.getChainId();\n\n const declareContractTransaction = await this.buildDeclarePayload(payload, {\n ...v3Details(details),\n nonce,\n chainId,\n version,\n walletAddress: this.address,\n maxFee: ZERO,\n cairoVersion: undefined, // unused parameter\n skipValidate,\n });\n\n return super.getDeclareEstimateFee(\n declareContractTransaction,\n { ...v3Details(details), version, nonce },\n blockIdentifier,\n details.skipValidate\n );\n }\n\n public async estimateAccountDeployFee(\n {\n classHash,\n addressSalt = 0,\n constructorCalldata = [],\n contractAddress,\n }: DeployAccountContractPayload,\n details: UniversalDetails = {}\n ): Promise<EstimateFee> {\n const { blockIdentifier, version: providedVersion, skipValidate = true } = details;\n const version = toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.F1, ETransactionVersion.F3),\n toFeeVersion(providedVersion)\n ); // TODO: Can Cairo0 be deployed with F3 ?\n const nonce = ZERO; // DEPLOY_ACCOUNT transaction will have a nonce zero as it is the first transaction in the account\n const chainId = await this.getChainId();\n\n const payload = await this.buildAccountDeployPayload(\n { classHash, addressSalt, constructorCalldata, contractAddress },\n {\n ...v3Details(details),\n nonce,\n chainId,\n version,\n walletAddress: this.address, // unused parameter\n maxFee: ZERO,\n cairoVersion: undefined, // unused parameter,\n skipValidate,\n }\n );\n\n return super.getDeployAccountEstimateFee(\n { ...payload },\n { ...v3Details(details), version, nonce },\n blockIdentifier,\n details.skipValidate\n );\n }\n\n public async estimateDeployFee(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n details: UniversalDetails = {}\n ): Promise<EstimateFee> {\n const calls = this.buildUDCContractPayload(payload);\n return this.estimateInvokeFee(calls, details);\n }\n\n public async estimateFeeBulk(\n invocations: Invocations,\n details: UniversalDetails = {}\n ): Promise<EstimateFeeBulk> {\n const { nonce, blockIdentifier, version, skipValidate } = details;\n const accountInvocations = await this.accountInvocationsFactory(invocations, {\n ...v3Details(details),\n versions: [\n ETransactionVersion.F1, // non-sierra\n toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.F2, ETransactionVersion.F3),\n version\n ), // sierra\n ],\n nonce,\n blockIdentifier,\n skipValidate,\n });\n\n return super.getEstimateFeeBulk(accountInvocations, {\n blockIdentifier,\n skipValidate,\n });\n }\n\n public async simulateTransaction(\n invocations: Invocations,\n details: SimulateTransactionDetails = {}\n ): Promise<SimulateTransactionResponse> {\n const { nonce, blockIdentifier, skipValidate = true, skipExecute, version } = details;\n const accountInvocations = await this.accountInvocationsFactory(invocations, {\n ...v3Details(details),\n versions: [\n ETransactionVersion.V1, // non-sierra\n toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.V2, ETransactionVersion.V3),\n version\n ),\n ],\n nonce,\n blockIdentifier,\n skipValidate,\n });\n\n return super.getSimulateTransaction(accountInvocations, {\n blockIdentifier,\n skipValidate,\n skipExecute,\n });\n }\n\n public async execute(\n transactions: AllowArray<Call>,\n transactionsDetail?: UniversalDetails\n ): Promise<InvokeFunctionResponse>;\n public async execute(\n transactions: AllowArray<Call>,\n abis?: Abi[],\n transactionsDetail?: UniversalDetails\n ): Promise<InvokeFunctionResponse>;\n public async execute(\n transactions: AllowArray<Call>,\n arg2?: Abi[] | UniversalDetails,\n transactionsDetail: UniversalDetails = {}\n ): Promise<InvokeFunctionResponse> {\n const details = arg2 === undefined || Array.isArray(arg2) ? transactionsDetail : arg2;\n const calls = Array.isArray(transactions) ? transactions : [transactions];\n const nonce = toBigInt(details.nonce ?? (await this.getNonce()));\n const version = toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.V1, ETransactionVersion.V3), // TODO: does this depend on cairo version ?\n details.version\n );\n\n const estimate = await this.getUniversalSuggestedFee(\n version,\n { type: TransactionType.INVOKE, payload: transactions },\n {\n ...details,\n version,\n }\n );\n\n const chainId = await this.getChainId();\n\n const signerDetails: InvocationsSignerDetails = {\n ...v3Details(details),\n resourceBounds: estimate.resourceBounds,\n walletAddress: this.address,\n nonce,\n maxFee: estimate.maxFee,\n version,\n chainId,\n cairoVersion: await this.getCairoVersion(),\n };\n\n const signature = await this.signer.signTransaction(calls, signerDetails);\n\n const calldata = getExecuteCalldata(calls, await this.getCairoVersion());\n\n return this.invokeFunction(\n { contractAddress: this.address, calldata, signature },\n {\n ...v3Details(details),\n resourceBounds: estimate.resourceBounds,\n nonce,\n maxFee: estimate.maxFee,\n version,\n }\n );\n }\n\n /**\n * First check if contract is already declared, if not declare it\n * If contract already declared returned transaction_hash is ''.\n * Method will pass even if contract is already declared\n * @param transactionsDetail (optional)\n */\n public async declareIfNot(\n payload: DeclareContractPayload,\n transactionsDetail: UniversalDetails = {}\n ): Promise<DeclareContractResponse> {\n const declareContractPayload = extractContractHashes(payload);\n try {\n await this.getClassByHash(declareContractPayload.classHash);\n } catch (error) {\n return this.declare(payload, transactionsDetail);\n }\n return {\n transaction_hash: '',\n class_hash: declareContractPayload.classHash,\n };\n }\n\n public async declare(\n payload: DeclareContractPayload,\n details: UniversalDetails = {}\n ): Promise<DeclareContractResponse> {\n const declareContractPayload = extractContractHashes(payload);\n const { nonce, version: providedVersion } = details;\n const version = toTransactionVersion(\n !isSierra(payload.contract)\n ? ETransactionVersion.V1\n : this.getPreferredVersion(ETransactionVersion.V2, ETransactionVersion.V3),\n providedVersion\n );\n\n const estimate = await this.getUniversalSuggestedFee(\n version,\n {\n type: TransactionType.DECLARE,\n payload: declareContractPayload,\n },\n {\n ...details,\n version,\n }\n );\n\n const declareDetails: InvocationsSignerDetails = {\n ...v3Details(details),\n resourceBounds: estimate.resourceBounds,\n maxFee: estimate.maxFee,\n nonce: toBigInt(nonce ?? (await this.getNonce())),\n version,\n chainId: await this.getChainId(),\n walletAddress: this.address,\n cairoVersion: undefined,\n };\n\n const declareContractTransaction = await this.buildDeclarePayload(\n declareContractPayload,\n declareDetails\n );\n\n return this.declareContract(declareContractTransaction, declareDetails);\n }\n\n public async deploy(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n details: UniversalDetails = {}\n ): Promise<MultiDeployContractResponse> {\n const { calls, addresses } = buildUDCCall(payload, this.address);\n const invokeResponse = await this.execute(calls, undefined, details);\n\n return {\n ...invokeResponse,\n contract_address: addresses,\n };\n }\n\n public async deployContract(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n details: UniversalDetails = {}\n ): Promise<DeployContractUDCResponse> {\n const deployTx = await this.deploy(payload, details);\n const txReceipt = await this.waitForTransaction(deployTx.transaction_hash);\n return parseUDCEvent(txReceipt as unknown as DeployTransactionReceiptResponse);\n }\n\n public async declareAndDeploy(\n payload: DeclareAndDeployContractPayload,\n details: UniversalDetails = {}\n ): Promise<DeclareDeployUDCResponse> {\n const { constructorCalldata, salt, unique } = payload;\n let declare = await this.declareIfNot(payload, details);\n if (declare.transaction_hash !== '') {\n const tx = await this.waitForTransaction(declare.transaction_hash);\n declare = { ...declare, ...tx };\n }\n const deploy = await this.deployContract(\n { classHash: declare.class_hash, salt, unique, constructorCalldata },\n details\n );\n return { declare: { ...declare }, deploy };\n }\n\n public deploySelf = this.deployAccount;\n\n public async deployAccount(\n {\n classHash,\n constructorCalldata = [],\n addressSalt = 0,\n contractAddress: providedContractAddress,\n }: DeployAccountContractPayload,\n details: UniversalDetails = {}\n ): Promise<DeployContractResponse> {\n const version = toTransactionVersion(\n this.getPreferredVersion(ETransactionVersion.V1, ETransactionVersion.V3),\n details.version\n );\n const nonce = ZERO; // DEPLOY_ACCOUNT transaction will have a nonce zero as it is the first transaction in the account\n const chainId = await this.getChainId();\n\n const compiledCalldata = CallData.compile(constructorCalldata);\n const contractAddress =\n providedContractAddress ??\n calculateContractAddressFromHash(addressSalt, classHash, compiledCalldata, 0);\n\n const estimate = await this.getUniversalSuggestedFee(\n version,\n {\n type: TransactionType.DEPLOY_ACCOUNT,\n payload: {\n classHash,\n constructorCalldata: compiledCalldata,\n addressSalt,\n contractAddress,\n },\n },\n details\n );\n\n const signature = await this.signer.signDeployAccountTransaction({\n ...v3Details(details),\n classHash,\n constructorCalldata: compiledCalldata,\n contractAddress,\n addressSalt,\n chainId,\n resourceBounds: estimate.resourceBounds,\n maxFee: estimate.maxFee,\n version,\n nonce,\n });\n\n return this.deployAccountContract(\n { classHash, addressSalt, constructorCalldata, signature },\n {\n ...v3Details(details),\n nonce,\n resourceBounds: estimate.resourceBounds,\n maxFee: estimate.maxFee,\n version,\n }\n );\n }\n\n public async signMessage(typedData: TypedData): Promise<Signature> {\n return this.signer.signMessage(typedData, this.address);\n }\n\n public async hashMessage(typedData: TypedData): Promise<string> {\n return getMessageHash(typedData, this.address);\n }\n\n public async verifyMessageHash(\n hash: BigNumberish,\n signature: Signature,\n signatureVerificationFunctionName?: string,\n signatureVerificationResponse?: { okResponse: string[]; nokResponse: string[]; error: string[] }\n ): Promise<boolean> {\n // HOTFIX: Accounts should conform to SNIP-6\n // (https://github.com/starknet-io/SNIPs/blob/f6998f779ee2157d5e1dea36042b08062093b3c5/SNIPS/snip-6.md?plain=1#L61),\n // but they don't always conform. Also, the SNIP doesn't standardize the response if the signature isn't valid.\n const knownSigVerificationFName = signatureVerificationFunctionName\n ? [signatureVerificationFunctionName]\n : ['isValidSignature', 'is_valid_signature'];\n const knownSignatureResponse = signatureVerificationResponse || {\n okResponse: [\n // any non-nok response is true\n ],\n nokResponse: [\n '0x0', // Devnet\n '0x00', // OpenZeppelin 0.7.0 to 0.9.0 invalid signature\n ],\n error: [\n 'argent/invalid-signature', // ArgentX 0.3.0 to 0.3.1\n 'is invalid, with respect to the public key', // OpenZeppelin until 0.6.1, Braavos 0.0.11\n 'INVALID_SIG', // Braavos 1.0.0\n ],\n };\n let error: any;\n\n // eslint-disable-next-line no-restricted-syntax\n for (const SigVerificationFName of knownSigVerificationFName) {\n try {\n // eslint-disable-next-line no-await-in-loop\n const resp = await this.callContract({\n contractAddress: this.address,\n entrypoint: SigVerificationFName,\n calldata: CallData.compile({\n hash: toBigInt(hash).toString(),\n signature: formatSignature(signature),\n }),\n });\n // Response NOK Signature\n if (knownSignatureResponse.nokResponse.includes(resp[0].toString())) {\n return false;\n }\n // Response OK Signature\n // Empty okResponse assume all non-nok responses are valid signatures\n // OpenZeppelin 0.7.0 to 0.9.0, ArgentX 0.3.0 to 0.3.1 & Braavos Cairo 0.0.11 to 1.0.0 valid signature\n if (\n knownSignatureResponse.okResponse.length === 0 ||\n knownSignatureResponse.okResponse.includes(resp[0].toString())\n ) {\n return true;\n }\n throw Error('signatureVerificationResponse Error: response is not part of known responses');\n } catch (err) {\n // Known NOK Errors\n if (\n knownSignatureResponse.error.some((errMessage) =>\n (err as Error).message.includes(errMessage)\n )\n ) {\n return false;\n }\n // Unknown Error\n error = err;\n }\n }\n\n throw Error(`Signature verification Error: ${error}`);\n }\n\n public async verifyMessage(\n typedData: TypedData,\n signature: Signature,\n signatureVerificationFunctionName?: string,\n signatureVerificationResponse?: { okResponse: string[]; nokResponse: string[]; error: string[] }\n ): Promise<boolean> {\n const hash = await this.hashMessage(typedData);\n return this.verifyMessageHash(\n hash,\n signature,\n signatureVerificationFunctionName,\n signatureVerificationResponse\n );\n }\n\n /*\n * Support methods\n */\n\n protected async getUniversalSuggestedFee(\n version: ETransactionVersion,\n { type, payload }: EstimateFeeAction,\n details: UniversalDetails\n ) {\n let maxFee: BigNumberish = 0;\n let resourceBounds: ResourceBounds = estimateFeeToBounds(ZERO);\n if (version === ETransactionVersion.V3) {\n resourceBounds =\n details.resourceBounds ??\n (await this.getSuggestedFee({ type, payload } as any, details)).resourceBounds;\n } else {\n maxFee =\n details.maxFee ??\n (await this.getSuggestedFee({ type, payload } as any, details)).suggestedMaxFee;\n }\n\n return {\n maxFee,\n resourceBounds,\n };\n }\n\n public async getSuggestedFee({ type, payload }: EstimateFeeAction, details: UniversalDetails) {\n let feeEstimate: EstimateFee;\n\n switch (type) {\n case TransactionType.INVOKE:\n feeEstimate = await this.estimateInvokeFee(payload, details);\n break;\n\n case TransactionType.DECLARE:\n feeEstimate = await this.estimateDeclareFee(payload, details);\n break;\n\n case TransactionType.DEPLOY_ACCOUNT:\n feeEstimate = await this.estimateAccountDeployFee(payload, details);\n break;\n\n case TransactionType.DEPLOY:\n feeEstimate = await this.estimateDeployFee(payload, details);\n break;\n\n default:\n feeEstimate = {\n gas_consumed: 0n,\n gas_price: 0n,\n overall_fee: ZERO,\n unit: 'FRI',\n suggestedMaxFee: ZERO,\n resourceBounds: estimateFeeToBounds(ZERO),\n data_gas_consumed: 0n,\n data_gas_price: 0n,\n };\n break;\n }\n\n return feeEstimate;\n }\n\n public async buildInvocation(\n call: Array<Call>,\n details: InvocationsSignerDetails\n ): Promise<Invocation> {\n const calldata = getExecuteCalldata(call, await this.getCairoVersion());\n const signature = !details.skipValidate ? await this.signer.signTransaction(call, details) : [];\n\n return {\n ...v3Details(details),\n contractAddress: this.address,\n calldata,\n signature,\n };\n }\n\n public async buildDeclarePayload(\n payload: DeclareContractPayload,\n details: InvocationsSignerDetails\n ): Promise<DeclareContractTransaction> {\n const { classHash, contract, compiledClassHash } = extractContractHashes(payload);\n const compressedCompiledContract = parseContract(contract);\n\n if (\n typeof compiledClassHash === 'undefined' &&\n (details.version === ETransactionVersion3.F3 || details.version === ETransactionVersion3.V3)\n ) {\n throw Error('V3 Transaction work with Cairo1 Contracts and require compiledClassHash');\n }\n\n const signature = !details.skipValidate\n ? await this.signer.signDeclareTransaction({\n ...details,\n ...v3Details(details),\n classHash,\n compiledClassHash: compiledClassHash as string, // TODO: TS, cast because optional for v2 and required for v3, thrown if not present\n senderAddress: details.walletAddress,\n })\n : [];\n\n return {\n senderAddress: details.walletAddress,\n signature,\n contract: compressedCompiledContract,\n compiledClassHash,\n };\n }\n\n public async buildAccountDeployPayload(\n {\n classHash,\n addressSalt = 0,\n constructorCalldata = [],\n contractAddress: providedContractAddress,\n }: DeployAccountContractPayload,\n details: InvocationsSignerDetails\n ): Promise<DeployAccountContractTransaction> {\n const compiledCalldata = CallData.compile(constructorCalldata);\n const contractAddress =\n providedContractAddress ??\n calculateContractAddressFromHash(addressSalt, classHash, compiledCalldata, 0);\n\n const signature = !details.skipValidate\n ? await this.signer.signDeployAccountTransaction({\n ...details,\n ...v3Details(details),\n classHash,\n contractAddress,\n addressSalt,\n constructorCalldata: compiledCalldata,\n })\n : [];\n\n return {\n ...v3Details(details),\n classHash,\n addressSalt,\n constructorCalldata: compiledCalldata,\n signature,\n };\n }\n\n public buildUDCContractPayload(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[]\n ): Call[] {\n const calls = [].concat(payload as []).map((it) => {\n const {\n classHash,\n salt = '0',\n unique = true,\n constructorCalldata = [],\n } = it as UniversalDeployerContractPayload;\n const compiledConstructorCallData = CallData.compile(constructorCalldata);\n\n return {\n contractAddress: UDC.ADDRESS,\n entrypoint: UDC.ENTRYPOINT,\n calldata: [\n classHash,\n salt,\n toCairoBool(unique),\n compiledConstructorCallData.length,\n ...compiledConstructorCallData,\n ],\n };\n });\n return calls;\n }\n\n public async accountInvocationsFactory(\n invocations: Invocations,\n details: AccountInvocationsFactoryDetails\n ) {\n const { nonce, blockIdentifier, skipValidate = true } = details;\n const safeNonce = await this.getNonceSafe(nonce);\n const chainId = await this.getChainId();\n const versions = details.versions.map((it) => toTransactionVersion(it));\n\n // BULK ACTION FROM NEW ACCOUNT START WITH DEPLOY_ACCOUNT\n const tx0Payload: any = 'payload' in invocations[0] ? invocations[0].payload : invocations[0];\n const cairoVersion =\n invocations[0].type === TransactionType.DEPLOY_ACCOUNT\n ? await this.getCairoVersion(tx0Payload.classHash)\n : await this.getCairoVersion();\n\n return Promise.all(\n ([] as Invocations).concat(invocations).map(async (transaction, index: number) => {\n const txPayload: any = 'payload' in transaction ? transaction.payload : transaction;\n const signerDetails = {\n ...v3Details(details),\n walletAddress: this.address,\n nonce: toBigInt(Number(safeNonce) + index),\n maxFee: ZERO,\n chainId,\n cairoVersion,\n version: '' as ETransactionVersion,\n skipValidate,\n };\n const common = {\n type: transaction.type,\n nonce: toBigInt(Number(safeNonce) + index),\n blockIdentifier,\n version: '' as ETransactionVersion,\n };\n\n if (transaction.type === TransactionType.INVOKE) {\n // 1 or 3\n const versionX = reduceV2(versions[1]);\n signerDetails.version = versionX;\n common.version = versionX;\n\n const payload = await this.buildInvocation(\n ([] as Call[]).concat(txPayload),\n signerDetails\n );\n return {\n ...common,\n ...payload,\n };\n }\n if (transaction.type === TransactionType.DEPLOY) {\n // 1 or 3\n const versionX = reduceV2(versions[1]);\n signerDetails.version = versionX;\n common.version = versionX;\n\n const calls = this.buildUDCContractPayload(txPayload);\n const payload = await this.buildInvocation(calls, signerDetails);\n return {\n ...common,\n ...payload,\n type: TransactionType.INVOKE,\n };\n }\n if (transaction.type === TransactionType.DECLARE) {\n // 1 (Cairo0) or 2 or 3\n const versionX = !isSierra(txPayload.contract) ? versions[0] : versions[1];\n signerDetails.version = versionX;\n common.version = versionX;\n\n const payload = await this.buildDeclarePayload(txPayload, signerDetails);\n return {\n ...common,\n ...payload,\n };\n }\n if (transaction.type === TransactionType.DEPLOY_ACCOUNT) {\n // 1 or 3\n const versionX = reduceV2(versions[1]);\n signerDetails.version = versionX;\n common.version = versionX;\n\n const payload = await this.buildAccountDeployPayload(txPayload, signerDetails);\n return {\n ...common,\n ...payload,\n };\n }\n throw Error(`accountInvocationsFactory: unsupported transaction type: ${transaction}`);\n })\n ) as Promise<AccountInvocations>;\n }\n\n public async getStarkName(\n address: BigNumberish = this.address, // default to the wallet address\n StarknetIdContract?: string\n ): Promise<string> {\n return super.getStarkName(address, StarknetIdContract);\n }\n}\n","import { ProviderInterface } from '../provider';\nimport { SignerInterface } from '../signer';\nimport {\n Abi,\n AllowArray,\n BigNumberish,\n BlockIdentifier,\n CairoVersion,\n Call,\n DeclareAndDeployContractPayload,\n DeclareContractPayload,\n DeclareContractResponse,\n DeclareDeployUDCResponse,\n DeployAccountContractPayload,\n DeployContractResponse,\n DeployContractUDCResponse,\n EstimateFee,\n EstimateFeeAction,\n EstimateFeeDetails,\n EstimateFeeResponse,\n EstimateFeeResponseBulk,\n Invocations,\n InvocationsDetails,\n InvokeFunctionResponse,\n MultiDeployContractResponse,\n Nonce,\n Signature,\n SimulateTransactionDetails,\n SimulateTransactionResponse,\n TypedData,\n UniversalDeployerContractPayload,\n} from '../types';\n\nexport abstract class AccountInterface extends ProviderInterface {\n public abstract address: string;\n\n public abstract signer: SignerInterface;\n\n public abstract cairoVersion: CairoVersion;\n\n /**\n * Estimate Fee for executing an INVOKE transaction on starknet\n *\n * @param calls the invocation object containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata? - (defaults to []) the calldata\n *\n * @param estimateFeeDetails -\n * - blockIdentifier?\n * - nonce? = 0\n * - skipValidate? - default true\n * - tip? - prioritize order of transactions in the mempool.\n * - accountDeploymentData? - deploy an account contract (substitution for deploy account transaction)\n * - paymasterData? - entity other than the transaction sender to pay the transaction fees(EIP-4337)\n * - nonceDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - feeDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - version? - specify ETransactionVersion - V3 Transactions fee is in fri, oldV transactions fee is in wei\n *\n * @returns response from estimate_fee\n */\n public abstract estimateInvokeFee(\n calls: AllowArray<Call>,\n estimateFeeDetails?: EstimateFeeDetails\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimate Fee for executing a DECLARE transaction on starknet\n *\n * @param contractPayload the payload object containing:\n * - contract - the compiled contract to be declared\n * - casm? - compiled cairo assembly. Cairo1(casm or compiledClassHash are required)\n * - classHash? - the class hash of the compiled contract. Precalculate for faster execution.\n * - compiledClassHash?: class hash of the cairo assembly. Cairo1(casm or compiledClassHash are required)\n *\n * @param estimateFeeDetails -\n * - blockIdentifier?\n * - nonce? = 0\n * - skipValidate? - default true\n * - tip? - prioritize order of transactions in the mempool.\n * - accountDeploymentData? - deploy an account contract (substitution for deploy account transaction)\n * - paymasterData? - entity other than the transaction sender to pay the transaction fees(EIP-4337)\n * - nonceDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - feeDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - version? - specify ETransactionVersion - V3 Transactions fee is in fri, oldV transactions fee is in wei\n *\n * @returns response from estimate_fee\n */\n public abstract estimateDeclareFee(\n contractPayload: DeclareContractPayload,\n estimateFeeDetails?: EstimateFeeDetails\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimate Fee for executing a DEPLOY_ACCOUNT transaction on starknet\n *\n * @param contractPayload -\n * - classHash - the class hash of the compiled contract.\n * - constructorCalldata? - constructor data;\n * - contractAddress? - future account contract address. Precalculate for faster execution.\n * - addressSalt? - salt used for calculation of the contractAddress. Required if contractAddress is provided.\n *\n * @param estimateFeeDetails -\n * - blockIdentifier?\n * - nonce? = 0\n * - skipValidate? - default true\n * - tip? - prioritize order of transactions in the mempool.\n * - paymasterData? - entity other than the transaction sender to pay the transaction fees(EIP-4337)\n * - nonceDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - feeDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - version? - specify ETransactionVersion - V3 Transactions fee is in fri, oldV transactions fee is in wei\n *\n * @returns response from estimate_fee\n */\n public abstract estimateAccountDeployFee(\n contractPayload: DeployAccountContractPayload,\n estimateFeeDetails?: EstimateFeeDetails\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimate Fee for executing a UDC DEPLOY transaction on starknet\n * This is different from the normal DEPLOY transaction as it goes through the Universal Deployer Contract (UDC)\n \n * @param deployContractPayload array or singular\n * - classHash: computed class hash of compiled contract\n * - salt: address salt\n * - unique: bool if true ensure unique salt\n * - constructorCalldata: constructor calldata\n * \n * @param estimateFeeDetails -\n * - blockIdentifier?\n * - nonce?\n * - skipValidate? - default true\n * - tip? - prioritize order of transactions in the mempool.\n * - accountDeploymentData? - deploy an account contract (substitution for deploy account transaction)\n * - paymasterData? - entity other than the transaction sender to pay the transaction fees(EIP-4337)\n * - nonceDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - feeDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - version? - specify ETransactionVersion - V3 Transactions fee is in fri, oldV transactions fee is in wei\n */\n public abstract estimateDeployFee(\n deployContractPayload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n estimateFeeDetails?: EstimateFeeDetails\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Estimate Fee for executing a list of transactions on starknet\n * Contract must be deployed for fee estimation to be possible\n *\n * @param invocations array of transaction object containing :\n * - type - the type of transaction : 'DECLARE' | (multi)'DEPLOY' | (multi)'INVOKE_FUNCTION' | 'DEPLOY_ACCOUNT'\n * - payload - the payload of the transaction\n *\n * @param details -\n * - blockIdentifier?\n * - nonce?\n * - skipValidate? - default true\n * - tip? - prioritize order of transactions in the mempool.\n * - accountDeploymentData? - deploy an account contract (substitution for deploy account transaction)\n * - paymasterData? - entity other than the transaction sender to pay the transaction fees(EIP-4337)\n * - nonceDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - feeDataAvailabilityMode? - allows users to choose their preferred data availability mode (Volition)\n * - version? - specify ETransactionVersion - V3 Transactions fee is in fri, oldV transactions fee is in wei\n *\n * @returns response from estimate_fee\n */\n public abstract estimateFeeBulk(\n invocations: Invocations,\n details?: EstimateFeeDetails\n ): Promise<EstimateFeeResponseBulk>;\n\n /**\n * Gets Suggested Max Fee based on the transaction type\n *\n * @param {EstimateFeeAction} estimateFeeAction\n * @param {EstimateFeeDetails} details\n * @returns EstimateFee (...response, resourceBounds, suggestedMaxFee)\n */\n public abstract getSuggestedFee(\n estimateFeeAction: EstimateFeeAction,\n details: EstimateFeeDetails\n ): Promise<EstimateFee>;\n\n /**\n * Simulates an array of transaction and returns an array of transaction trace and estimated fee.\n *\n * @param invocations Invocations containing:\n * - type - transaction type: DECLARE, (multi)DEPLOY, DEPLOY_ACCOUNT, (multi)INVOKE_FUNCTION\n * @param details SimulateTransactionDetails\n *\n * @returns response from simulate_transaction\n */\n public abstract simulateTransaction(\n invocations: Invocations,\n details?: SimulateTransactionDetails\n ): Promise<SimulateTransactionResponse>;\n\n /**\n * Invoke execute function in account contract\n *\n * @param transactions the invocation object or an array of them, containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata - (defaults to []) the calldata\n * - signature - (defaults to []) the signature\n * @param {InvocationsDetails} transactionsDetail Additional optional parameters for the transaction\n *\n * @returns response from addTransaction\n */\n public abstract execute(\n transactions: AllowArray<Call>,\n transactionsDetail?: InvocationsDetails\n ): Promise<InvokeFunctionResponse>;\n /**\n * @deprecated\n * @param transactions the invocation object or an array of them, containing:\n * - contractAddress - the address of the contract\n * - entrypoint - the entrypoint of the contract\n * - calldata - (defaults to []) the calldata\n * - signature - (defaults to []) the signature\n * @param abis (optional) the abi of the contract for better displaying\n * @param {InvocationsDetails} transactionsDetail Additional optional parameters for the transaction\n * * @returns response from addTransaction\n */\n public abstract execute(\n transactions: AllowArray<Call>,\n abis?: Abi[],\n transactionsDetail?: InvocationsDetails\n ): Promise<InvokeFunctionResponse>;\n\n /**\n * Declares a given compiled contract (json) to starknet\n *\n * @param contractPayload transaction payload to be deployed containing:\n * - contract: compiled contract code\n * - (optional) classHash: computed class hash of compiled contract. Pre-compute it for faster execution.\n * - (required for Cairo1 without compiledClassHash) casm: CompiledContract | string;\n * - (optional for Cairo1 with casm) compiledClassHash: compiled class hash from casm. Pre-compute it for faster execution.\n * @param transactionsDetail - InvocationsDetails\n *\n * @returns a confirmation of sending a transaction on the starknet contract\n */\n public abstract declare(\n contractPayload: DeclareContractPayload,\n transactionsDetail?: InvocationsDetails\n ): Promise<DeclareContractResponse>;\n\n /**\n * Deploys a declared contract to starknet - using Universal Deployer Contract (UDC)\n * support multicall\n *\n * @param payload -\n * - classHash: computed class hash of compiled contract\n * - [constructorCalldata] contract constructor calldata\n * - [salt=pseudorandom] deploy address salt\n * - [unique=true] ensure unique salt\n * @param details - InvocationsDetails\n *\n * @returns\n * - contract_address[]\n * - transaction_hash\n */\n public abstract deploy(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n details?: InvocationsDetails\n ): Promise<MultiDeployContractResponse>;\n\n /**\n * Simplify deploy simulating old DeployContract with same response + UDC specific response\n * Internal wait for L2 transaction, support multicall\n *\n * @param payload -\n * - classHash: computed class hash of compiled contract\n * - [constructorCalldata] contract constructor calldata\n * - [salt=pseudorandom] deploy address salt\n * - [unique=true] ensure unique salt\n * @param details - InvocationsDetails\n *\n * @returns\n * - contract_address\n * - transaction_hash\n * - address\n * - deployer\n * - unique\n * - classHash\n * - calldata_len\n * - calldata\n * - salt\n */\n public abstract deployContract(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[],\n details?: InvocationsDetails\n ): Promise<DeployContractUDCResponse>;\n\n /**\n * Declares and Deploy a given compiled contract (json) to starknet using UDC\n * Internal wait for L2 transaction, do not support multicall\n * Method will pass even if contract is already declared (internal using DeclareIfNot)\n *\n * @param payload\n * - contract: compiled contract code\n * - [casm=cairo1]: CairoAssembly | undefined;\n * - [compiledClassHash]: string | undefined;\n * - [classHash]: computed class hash of compiled contract\n * - [constructorCalldata] contract constructor calldata\n * - [salt=pseudorandom] deploy address salt\n * - [unique=true] ensure unique salt\n * @param details - InvocationsDetails\n *\n * @returns\n * - declare\n * - transaction_hash\n * - deploy\n * - contract_address\n * - transaction_hash\n * - address\n * - deployer\n * - unique\n * - classHash\n * - calldata_len\n * - calldata\n * - salt\n */\n public abstract declareAndDeploy(\n payload: DeclareAndDeployContractPayload,\n details?: InvocationsDetails\n ): Promise<DeclareDeployUDCResponse>;\n\n /**\n * Deploy the account on Starknet\n *\n * @param contractPayload transaction payload to be deployed containing:\n * - classHash: computed class hash of compiled contract\n * - optional constructor calldata\n * - optional address salt\n * - optional contractAddress\n * @param transactionsDetail - InvocationsDetails\n *\n * @returns a confirmation of sending a transaction on the starknet contract\n */\n public abstract deployAccount(\n contractPayload: DeployAccountContractPayload,\n transactionsDetail?: InvocationsDetails\n ): Promise<DeployContractResponse>;\n\n /**\n * Signs a TypedData object for off-chain usage with the Starknet private key and returns the signature\n * This adds a message prefix so it can't be interchanged with transactions\n *\n * @param typedData - TypedData object to be signed\n * @returns the signature of the TypedData object\n * @throws {Error} if typedData is not a valid TypedData\n */\n public abstract signMessage(typedData: TypedData): Promise<Signature>;\n\n /**\n * Hash a TypedData object with Pedersen hash and return the hash\n * This adds a message prefix so it can't be interchanged with transactions\n *\n * @param typedData - TypedData object to be hashed\n * @returns the hash of the TypedData object\n * @throws {Error} if typedData is not a valid TypedData\n */\n public abstract hashMessage(typedData: TypedData): Promise<string>;\n\n /**\n * Verify a signature of a TypedData object\n *\n * @param typedData - TypedData object to be verified\n * @param signature - signature of the TypedData object\n * @returns true if the signature is valid, false otherwise\n * @throws {Error} if typedData is not a valid TypedData or the signature is not a valid signature\n */\n public abstract verifyMessage(typedData: TypedData, signature: Signature): Promise<boolean>;\n\n /**\n * Verify a signature of a given hash\n * @warning This method is not recommended, use verifyMessage instead\n *\n * @param hash - hash to be verified\n * @param signature - signature of the hash\n * @returns true if the signature is valid, false otherwise\n * @throws {Error} if the signature is not a valid signature\n */\n public abstract verifyMessageHash(hash: BigNumberish, signature: Signature): Promise<boolean>;\n\n /**\n * Gets the nonce of the account with respect to a specific block\n *\n * @param {BlockIdentifier} blockIdentifier - optional blockIdentifier. Defaults to 'pending'\n * @returns nonce of the account\n */\n public abstract getNonce(blockIdentifier?: BlockIdentifier): Promise<Nonce>;\n}\n","import {\n type WatchAssetParameters,\n type AccountChangeEventHandler,\n type AddDeclareTransactionParameters,\n type AddInvokeTransactionParameters,\n type AddStarknetChainParameters,\n type NetworkChangeEventHandler,\n type ChainId,\n type StarknetWindowObject,\n type TypedData,\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n type SPEC,\n} from 'starknet-types-07';\n\n/**\n * Request Permission for wallet account, return addresses that are allowed by user\n * @param {boolean} [silent_mode=false] false: request user interaction allowance. true: return only pre-allowed\n * @returns allowed accounts addresses\n */\nexport function requestAccounts(swo: StarknetWindowObject, silent_mode = false) {\n return swo.request({\n type: 'wallet_requestAccounts',\n params: {\n silent_mode,\n },\n });\n}\n\n/**\n * Request Permission for wallet account\n * @returns allowed accounts addresses\n */\nexport function getPermissions(swo: StarknetWindowObject) {\n return swo.request({ type: 'wallet_getPermissions' });\n}\n\n/**\n * Request adding ERC20 Token to Wallet List\n * @param asset WatchAssetParameters\n * @returns boolean\n */\nexport function watchAsset(swo: StarknetWindowObject, asset: WatchAssetParameters) {\n return swo.request({\n type: 'wallet_watchAsset',\n params: asset,\n });\n}\n\n/**\n * Request adding custom Starknet chain\n * @param chain AddStarknetChainParameters\n * @returns boolean\n */\nexport function addStarknetChain(swo: StarknetWindowObject, chain: AddStarknetChainParameters) {\n // TODO: This should set custom RPC endpoint ?\n return swo.request({\n type: 'wallet_addStarknetChain',\n params: chain,\n });\n}\n\n/**\n * Request Wallet Network change\n * @param chainId StarknetChainId\n * @returns boolean\n */\nexport function switchStarknetChain(swo: StarknetWindowObject, chainId: ChainId) {\n return swo.request({\n type: 'wallet_switchStarknetChain',\n params: {\n chainId,\n },\n });\n}\n\n/**\n * Request the current chain ID from the wallet.\n * @returns The current Starknet chain ID.\n */\nexport function requestChainId(swo: StarknetWindowObject) {\n return swo.request({ type: 'wallet_requestChainId' });\n}\n\n/**\n * Get deployment data for a contract.\n * @returns The deployment data result.\n */\nexport function deploymentData(swo: StarknetWindowObject) {\n return swo.request({ type: 'wallet_deploymentData' }); // TODO: test\n}\n\n/**\n * Add an invoke transaction to the wallet.\n * @param params The parameters required for the invoke transaction.\n * @returns The result of adding the invoke transaction.\n */\nexport function addInvokeTransaction(\n swo: StarknetWindowObject,\n params: AddInvokeTransactionParameters\n) {\n return swo.request({\n type: 'wallet_addInvokeTransaction',\n params,\n });\n}\n\n/**\n * Add a declare transaction to the wallet.\n * @param params The parameters required for the declare transaction.\n * @returns The result of adding the declare transaction.\n */\nexport function addDeclareTransaction(\n swo: StarknetWindowObject,\n params: AddDeclareTransactionParameters\n) {\n return swo.request({\n type: 'wallet_addDeclareTransaction',\n params,\n });\n}\n\n/**\n * Sign typed data using the wallet.\n * @param swo the starknet (wallet) window object to request the signature.\n * @param typedData The typed data to sign.\n * @returns An array of signatures as strings.\n */\nexport function signMessage(swo: StarknetWindowObject, typedData: TypedData) {\n return swo.request({\n type: 'wallet_signTypedData',\n params: typedData,\n });\n}\n\n/**\n * Get the list of supported specifications.\n * @returns An array of supported specification strings.\n */\nexport function supportedSpecs(swo: StarknetWindowObject) {\n return swo.request({ type: 'wallet_supportedSpecs' });\n}\n\n/**\n * Attaches an event handler function to the \"accountsChanged\" event of a StarknetWindowObject.\n * When the accounts are changed, the specified callback function will be called.\n *\n * @param {StarknetWindowObject} swo - The StarknetWindowObject to attach the event handler to.\n * @param {AccountChangeEventHandler} callback - The function to be called when the accounts are changed.\n * It will receive the changed accounts as a parameter.\n * @returns {void}\n */\nexport function onAccountChange(\n swo: StarknetWindowObject,\n callback: AccountChangeEventHandler\n): void {\n swo.on('accountsChanged', callback);\n}\n\n/**\n * Register a callback function to be called when the network is changed.\n *\n * @param {StarknetWindowObject} swo - The StarknetWindowObject instance.\n * @param {NetworkChangeEventHandler} callback - The callback function to be called when the network is changed.\n * @return {void}\n */\nexport function onNetworkChanged(\n swo: StarknetWindowObject,\n callback: NetworkChangeEventHandler\n): void {\n swo.on('networkChanged', callback);\n}\n","import {\n type AccountChangeEventHandler,\n type AddStarknetChainParameters,\n type NetworkChangeEventHandler,\n type WatchAssetParameters,\n // eslint-disable-next-line @typescript-eslint/no-unused-vars\n type SPEC,\n} from 'starknet-types-07';\n\nimport { Account, AccountInterface } from '../account';\nimport { ProviderInterface } from '../provider';\nimport {\n AllowArray,\n CairoVersion,\n Call,\n CompiledSierra,\n DeclareContractPayload,\n MultiDeployContractResponse,\n ProviderOptions,\n TypedData,\n UniversalDeployerContractPayload,\n} from '../types';\nimport { extractContractHashes } from '../utils/contract';\nimport { stringify } from '../utils/json';\nimport { buildUDCCall } from '../utils/transaction';\nimport {\n addDeclareTransaction,\n addInvokeTransaction,\n addStarknetChain,\n getPermissions,\n onAccountChange,\n onNetworkChanged,\n requestAccounts,\n signMessage,\n switchStarknetChain,\n watchAsset,\n} from './connect';\nimport { StarknetWalletProvider } from './types';\nimport { StarknetChainId } from '../constants';\n\n// Represent 'Selected Active' Account inside Connected Wallet\nexport class WalletAccount extends Account implements AccountInterface {\n public address: string = '';\n\n public walletProvider: StarknetWalletProvider;\n\n constructor(\n providerOrOptions: ProviderOptions | ProviderInterface,\n walletProvider: StarknetWalletProvider,\n cairoVersion?: CairoVersion\n ) {\n super(providerOrOptions, '', '', cairoVersion); // At this point unknown address\n this.walletProvider = walletProvider;\n\n // Update Address on change\n this.walletProvider.on('accountsChanged', (res) => {\n if (!res) return;\n this.address = res[0].toLowerCase();\n });\n\n // Update Channel chainId on Network change\n this.walletProvider.on('networkChanged', (res) => {\n if (!res) return;\n // Determine is it better to set chainId or replace channel with new one\n // At the moment channel is stateless but it could change\n this.channel.setChainId(res as StarknetChainId);\n });\n\n // Get and Set Address !!! Post constructor initial empty string\n walletProvider\n .request({\n type: 'wallet_requestAccounts',\n params: {\n silent_mode: false,\n },\n })\n .then((res) => {\n this.address = res[0].toLowerCase();\n });\n }\n\n /**\n * WALLET EVENTS\n */\n public onAccountChange(callback: AccountChangeEventHandler) {\n onAccountChange(this.walletProvider, callback);\n }\n\n public onNetworkChanged(callback: NetworkChangeEventHandler) {\n onNetworkChanged(this.walletProvider, callback);\n }\n\n /**\n * WALLET SPECIFIC METHODS\n */\n public requestAccounts(silentMode = false) {\n return requestAccounts(this.walletProvider, silentMode);\n }\n\n public getPermissions() {\n return getPermissions(this.walletProvider);\n }\n\n public switchStarknetChain(chainId: StarknetChainId) {\n return switchStarknetChain(this.walletProvider, chainId);\n }\n\n public watchAsset(asset: WatchAssetParameters) {\n return watchAsset(this.walletProvider, asset);\n }\n\n public addStarknetChain(chain: AddStarknetChainParameters) {\n return addStarknetChain(this.walletProvider, chain);\n }\n\n /**\n * ACCOUNT METHODS\n */\n override execute(calls: AllowArray<Call>) {\n const txCalls = [].concat(calls as any).map((it) => {\n const { contractAddress, entrypoint, calldata } = it;\n return {\n contract_address: contractAddress,\n entry_point: entrypoint,\n calldata,\n };\n });\n\n const params = {\n calls: txCalls,\n };\n\n return addInvokeTransaction(this.walletProvider, params);\n }\n\n override declare(payload: DeclareContractPayload) {\n const declareContractPayload = extractContractHashes(payload);\n\n // DISCUSS: HOTFIX: Adapt Abi format\n const pContract = payload.contract as CompiledSierra;\n const cairo1Contract = {\n ...pContract,\n abi: stringify(pContract.abi),\n };\n\n // Check FIx\n if (!declareContractPayload.compiledClassHash) {\n throw Error('compiledClassHash is required');\n }\n\n const params = {\n compiled_class_hash: declareContractPayload.compiledClassHash,\n contract_class: cairo1Contract,\n };\n\n return addDeclareTransaction(this.walletProvider, params);\n }\n\n override async deploy(\n payload: UniversalDeployerContractPayload | UniversalDeployerContractPayload[]\n ): Promise<MultiDeployContractResponse> {\n const { calls, addresses } = buildUDCCall(payload, this.address);\n const invokeResponse = await this.execute(calls);\n\n return {\n ...invokeResponse,\n contract_address: addresses,\n };\n }\n\n override signMessage(typedData: TypedData) {\n return signMessage(this.walletProvider, typedData);\n }\n\n // TODO: MISSING ESTIMATES\n}\n","import type { Abi as AbiKanabi, TypedContract as AbiWanTypedContract } from 'abi-wan-kanabi';\n\nimport { AccountInterface } from '../account';\nimport { ProviderInterface, defaultProvider } from '../provider';\nimport {\n Abi,\n AbiEvents,\n ArgsOrCalldata,\n ArgsOrCalldataWithOptions,\n AsyncContractFunction,\n Call,\n CallOptions,\n Calldata,\n ContractFunction,\n ContractOptions,\n EstimateFeeResponse,\n FunctionAbi,\n InvokeFunctionResponse,\n InvokeOptions,\n InvokeTransactionReceiptResponse,\n ParsedEvents,\n RawArgs,\n Result,\n AbiStruct,\n ValidateType,\n} from '../types';\nimport assert from '../utils/assert';\nimport { CallData, cairo } from '../utils/calldata';\nimport { createAbiParser } from '../utils/calldata/parser';\nimport { getAbiEvents, parseEvents as parseRawEvents } from '../utils/events/index';\nimport { cleanHex } from '../utils/num';\nimport { ContractInterface } from './interface';\nimport type { GetTransactionReceiptResponse } from '../utils/transactionReceipt';\n\nexport type TypedContractV2<TAbi extends AbiKanabi> = AbiWanTypedContract<TAbi> & Contract;\n\nexport const splitArgsAndOptions = (args: ArgsOrCalldataWithOptions) => {\n const options = [\n 'blockIdentifier',\n 'parseRequest',\n 'parseResponse',\n 'formatResponse',\n 'maxFee',\n 'nonce',\n 'signature',\n 'addressSalt',\n ];\n const lastArg = args[args.length - 1];\n if (typeof lastArg === 'object' && options.some((x) => x in lastArg)) {\n return { args: args as ArgsOrCalldata, options: args.pop() as ContractOptions };\n }\n return { args: args as ArgsOrCalldata };\n};\n\n/**\n * Adds call methods to the contract\n */\nfunction buildCall(contract: Contract, functionAbi: FunctionAbi): AsyncContractFunction {\n return async function (...args: ArgsOrCalldataWithOptions): Promise<any> {\n const params = splitArgsAndOptions(args);\n return contract.call(functionAbi.name, params.args, {\n parseRequest: true,\n parseResponse: true,\n ...params.options,\n });\n };\n}\n\n/**\n * Adds invoke methods to the contract\n */\nfunction buildInvoke(contract: Contract, functionAbi: FunctionAbi): AsyncContractFunction {\n return async function (...args: Array<any>): Promise<any> {\n const params = splitArgsAndOptions(args);\n return contract.invoke(functionAbi.name, params.args, {\n parseRequest: true,\n ...params.options,\n });\n };\n}\n\n/**\n * Adds call/invoke methods to the contract\n */\nfunction buildDefault(contract: Contract, functionAbi: FunctionAbi): AsyncContractFunction {\n if (functionAbi.stateMutability === 'view' || functionAbi.state_mutability === 'view') {\n return buildCall(contract, functionAbi);\n }\n return buildInvoke(contract, functionAbi);\n}\n\n/**\n * Adds populate for methods to the contract\n */\nfunction buildPopulate(contract: Contract, functionAbi: FunctionAbi): ContractFunction {\n return function (...args: Array<any>): any {\n return contract.populate(functionAbi.name, args);\n };\n}\n\n/**\n * Adds estimateFee for methods to the contract\n */\nfunction buildEstimate(contract: Contract, functionAbi: FunctionAbi): ContractFunction {\n return function (...args: Array<any>): any {\n return contract.estimate(functionAbi.name, args);\n };\n}\n\nexport function getCalldata(args: RawArgs, callback: Function): Calldata {\n // Check if Calldata in args or args[0] else compile\n if (Array.isArray(args) && '__compiled__' in args) return args as Calldata;\n if (Array.isArray(args) && Array.isArray(args[0]) && '__compiled__' in args[0])\n return args[0] as Calldata;\n return callback();\n}\n\nexport class Contract implements ContractInterface {\n abi: Abi;\n\n address: string;\n\n providerOrAccount: ProviderInterface | AccountInterface;\n\n deployTransactionHash?: string;\n\n protected readonly structs: { [name: string]: AbiStruct };\n\n protected readonly events: AbiEvents;\n\n readonly functions!: { [name: string]: AsyncContractFunction };\n\n readonly callStatic!: { [name: string]: AsyncContractFunction };\n\n readonly populateTransaction!: { [name: string]: ContractFunction };\n\n readonly estimateFee!: { [name: string]: ContractFunction };\n\n readonly [key: string]: AsyncContractFunction | any;\n\n private callData: CallData;\n\n /**\n * Contract class to handle contract methods\n *\n * @param abi - Abi of the contract object\n * @param address (optional) - address to connect to\n * @param providerOrAccount (optional) - Provider or Account to attach to\n */\n constructor(\n abi: Abi,\n address: string,\n providerOrAccount: ProviderInterface | AccountInterface = defaultProvider\n ) {\n this.address = address && address.toLowerCase();\n this.providerOrAccount = providerOrAccount;\n this.callData = new CallData(abi);\n this.structs = CallData.getAbiStruct(abi);\n this.events = getAbiEvents(abi);\n const parser = createAbiParser(abi);\n this.abi = parser.getLegacyFormat();\n\n const options = { enumerable: true, value: {}, writable: false };\n Object.defineProperties(this, {\n functions: { enumerable: true, value: {}, writable: false },\n callStatic: { enumerable: true, value: {}, writable: false },\n populateTransaction: { enumerable: true, value: {}, writable: false },\n estimateFee: { enumerable: true, value: {}, writable: false },\n });\n this.abi.forEach((abiElement) => {\n if (abiElement.type !== 'function') return;\n const signature = abiElement.name;\n if (!this[signature]) {\n Object.defineProperty(this, signature, {\n ...options,\n value: buildDefault(this, abiElement),\n });\n }\n if (!this.functions[signature]) {\n Object.defineProperty(this.functions, signature, {\n ...options,\n value: buildDefault(this, abiElement),\n });\n }\n if (!this.callStatic[signature]) {\n Object.defineProperty(this.callStatic, signature, {\n ...options,\n value: buildCall(this, abiElement),\n });\n }\n if (!this.populateTransaction[signature]) {\n Object.defineProperty(this.populateTransaction, signature, {\n ...options,\n value: buildPopulate(this, abiElement),\n });\n }\n if (!this.estimateFee[signature]) {\n Object.defineProperty(this.estimateFee, signature, {\n ...options,\n value: buildEstimate(this, abiElement),\n });\n }\n });\n }\n\n public attach(address: string): void {\n this.address = address;\n }\n\n public connect(providerOrAccount: ProviderInterface | AccountInterface) {\n this.providerOrAccount = providerOrAccount;\n }\n\n public async deployed(): Promise<Contract> {\n if (this.deployTransactionHash) {\n await this.providerOrAccount.waitForTransaction(this.deployTransactionHash);\n this.deployTransactionHash = undefined;\n }\n return this;\n }\n\n public async call(\n method: string,\n args: ArgsOrCalldata = [],\n {\n parseRequest = true,\n parseResponse = true,\n formatResponse = undefined,\n blockIdentifier = undefined,\n }: CallOptions = {}\n ): Promise<Result> {\n assert(this.address !== null, 'contract is not connected to an address');\n\n const calldata = getCalldata(args, () => {\n if (parseRequest) {\n this.callData.validate(ValidateType.CALL, method, args);\n return this.callData.compile(method, args);\n }\n // eslint-disable-next-line no-console\n console.warn('Call skipped parsing but provided rawArgs, possible malfunction request');\n return args;\n });\n\n return this.providerOrAccount\n .callContract(\n {\n contractAddress: this.address,\n calldata,\n entrypoint: method,\n },\n blockIdentifier\n )\n .then((it) => {\n if (!parseResponse) {\n return it;\n }\n if (formatResponse) {\n return this.callData.format(method, it, formatResponse);\n }\n return this.callData.parse(method, it);\n });\n }\n\n public invoke(\n method: string,\n args: ArgsOrCalldata = [],\n { parseRequest = true, maxFee, nonce, signature }: InvokeOptions = {}\n ): Promise<InvokeFunctionResponse> {\n assert(this.address !== null, 'contract is not connected to an address');\n\n const calldata = getCalldata(args, () => {\n if (parseRequest) {\n this.callData.validate(ValidateType.INVOKE, method, args);\n return this.callData.compile(method, args);\n }\n // eslint-disable-next-line no-console\n console.warn('Invoke skipped parsing but provided rawArgs, possible malfunction request');\n return args;\n });\n\n const invocation = {\n contractAddress: this.address,\n calldata,\n entrypoint: method,\n };\n if ('execute' in this.providerOrAccount) {\n return this.providerOrAccount.execute(invocation, undefined, {\n maxFee,\n nonce,\n });\n }\n\n if (!nonce) throw new Error(`Nonce is required when invoking a function without an account`);\n // eslint-disable-next-line no-console\n console.warn(`Invoking ${method} without an account. This will not work on a public node.`);\n\n return this.providerOrAccount.invokeFunction(\n {\n ...invocation,\n signature,\n },\n {\n nonce,\n }\n );\n }\n\n public async estimate(method: string, args: ArgsOrCalldata = []): Promise<EstimateFeeResponse> {\n assert(this.address !== null, 'contract is not connected to an address');\n\n if (!getCalldata(args, () => false)) {\n this.callData.validate(ValidateType.INVOKE, method, args);\n }\n\n const invocation = this.populate(method, args);\n if ('estimateInvokeFee' in this.providerOrAccount) {\n return this.providerOrAccount.estimateInvokeFee(invocation);\n }\n throw Error('Contract must be connected to the account contract to estimate');\n }\n\n public populate(method: string, args: RawArgs = []): Call {\n const calldata: Calldata = getCalldata(args, () => this.callData.compile(method, args));\n return {\n contractAddress: this.address,\n entrypoint: method,\n calldata,\n };\n }\n\n public parseEvents(receipt: GetTransactionReceiptResponse): ParsedEvents {\n return parseRawEvents(\n (receipt as InvokeTransactionReceiptResponse).events?.filter(\n (event) => cleanHex(event.from_address) === cleanHex(this.address),\n []\n ) || [],\n this.events,\n this.structs,\n CallData.getAbiEnum(this.abi)\n );\n }\n\n public isCairo1(): boolean {\n return cairo.isCairo1Abi(this.abi);\n }\n\n public async getVersion() {\n return this.providerOrAccount.getContractVersion(this.address);\n }\n\n public typedv2<TAbi extends AbiKanabi>(tAbi: TAbi): TypedContractV2<TAbi> {\n return this as unknown as TypedContractV2<typeof tAbi>;\n }\n}\n","import type { Abi as AbiKanabi, TypedContract as AbiWanTypedContract } from 'abi-wan-kanabi';\n\nimport { AccountInterface } from '../account';\nimport { ProviderInterface } from '../provider';\nimport {\n Abi,\n ArgsOrCalldata,\n AsyncContractFunction,\n BigNumberish,\n BlockIdentifier,\n CallOptions,\n Calldata,\n ContractFunction,\n ContractVersion,\n EstimateFeeResponse,\n Invocation,\n InvokeFunctionResponse,\n InvokeOptions,\n ParsedEvents,\n RawArgs,\n Result,\n Uint256,\n} from '../types';\nimport { CairoCustomEnum } from '../utils/calldata/enum/CairoCustomEnum';\nimport { CairoOption } from '../utils/calldata/enum/CairoOption';\nimport { CairoResult } from '../utils/calldata/enum/CairoResult';\nimport type { GetTransactionReceiptResponse } from '../utils/transactionReceipt';\n\ndeclare module 'abi-wan-kanabi' {\n export interface Config<OptionT = any, ResultT = any, ErrorT = any> {\n FeltType: BigNumberish;\n U256Type: number | bigint | Uint256;\n U512Type: BigNumberish;\n Secp256k1PointType: BigNumberish;\n Option: CairoOption<OptionT>;\n Tuple: Record<number, BigNumberish | object | boolean>;\n Result: CairoResult<ResultT, ErrorT>;\n Enum: CairoCustomEnum;\n Calldata: RawArgs | Calldata;\n CallOptions: CallOptions;\n InvokeOptions: InvokeOptions;\n InvokeFunctionResponse: InvokeFunctionResponse;\n }\n}\n\ntype TypedContractV2<TAbi extends AbiKanabi> = AbiWanTypedContract<TAbi> & ContractInterface;\n\nexport abstract class ContractInterface {\n public abstract abi: Abi;\n\n public abstract address: string;\n\n public abstract providerOrAccount: ProviderInterface | AccountInterface;\n\n public abstract deployTransactionHash?: string;\n\n readonly functions!: { [name: string]: AsyncContractFunction };\n\n readonly callStatic!: { [name: string]: AsyncContractFunction };\n\n readonly populateTransaction!: { [name: string]: ContractFunction };\n\n readonly estimateFee!: { [name: string]: ContractFunction };\n\n readonly [key: string]: AsyncContractFunction | any;\n\n /**\n * Saves the address of the contract deployed on network that will be used for interaction\n *\n * @param address - address of the contract\n */\n public abstract attach(address: string): void;\n\n /**\n * Attaches to new Provider or Account\n *\n * @param providerOrAccount - new Provider or Account to attach to\n */\n public abstract connect(providerOrAccount: ProviderInterface | AccountInterface): void;\n\n /**\n * Resolves when contract is deployed on the network or when no deployment transaction is found\n *\n * @returns Promise that resolves when contract is deployed on the network or when no deployment transaction is found\n * @throws When deployment fails\n */\n public abstract deployed(): Promise<ContractInterface>;\n\n /**\n * Calls a method on a contract\n *\n * @param method name of the method\n * @param args Array of the arguments for the call\n * @param options optional blockIdentifier\n * @returns Result of the call as an array with key value pars\n */\n public abstract call(\n method: string,\n args?: ArgsOrCalldata,\n options?: CallOptions\n ): Promise<Result>;\n\n /**\n * Invokes a method on a contract\n *\n * @param method name of the method\n * @param args Array of the arguments for the invoke or Calldata\n * @param options\n * @returns Add Transaction Response\n */\n public abstract invoke(\n method: string,\n args?: ArgsOrCalldata,\n options?: InvokeOptions\n ): Promise<InvokeFunctionResponse>;\n\n /**\n * Estimates a method on a contract\n *\n * @param method name of the method\n * @param args Array of the arguments for the call or Calldata\n * @param options optional blockIdentifier\n */\n public abstract estimate(\n method: string,\n args?: ArgsOrCalldata,\n options?: {\n blockIdentifier?: BlockIdentifier;\n }\n ): Promise<EstimateFeeResponse>;\n\n /**\n * Calls a method on a contract\n *\n * @param method name of the method\n * @param args Array of the arguments for the call or Calldata\n * @returns Invocation object\n */\n public abstract populate(method: string, args?: ArgsOrCalldata): Invocation;\n\n /**\n * Parse contract events of a GetTransactionReceiptResponse received from waitForTransaction. Based on contract's abi\n *\n * @param receipt transaction receipt\n * @returns Events parsed\n */\n public abstract parseEvents(receipt: GetTransactionReceiptResponse): ParsedEvents;\n\n /**\n * tells if the contract comes from a Cairo 1 contract\n *\n * @returns TRUE if the contract comes from a Cairo1 contract\n * @example\n * ```typescript\n * const isCairo1: boolean = myContract.isCairo1();\n * ```\n */\n public abstract isCairo1(): boolean;\n\n /**\n * Retrieves the version of the contract (cairo version & compiler version)\n */\n public abstract getVersion(): Promise<ContractVersion>;\n\n /**\n * Returns a typed instance of ContractV2 based on the supplied ABI.\n *\n * @param {TAbi} tAbi - The ABI (Abstract Binary Interface) of the ContractV2.\n * @return {TypedContractV2<TAbi>} - A typed instance of ContractV2.\n */\n public abstract typedv2<TAbi extends AbiKanabi>(tAbi: TAbi): TypedContractV2<TAbi>;\n}\n","import { AccountInterface } from '../account';\nimport {\n Abi,\n ArgsOrCalldataWithOptions,\n CairoAssembly,\n CompiledContract,\n ValidateType,\n} from '../types';\nimport assert from '../utils/assert';\nimport { CallData } from '../utils/calldata';\nimport { Contract, getCalldata, splitArgsAndOptions } from './default';\n\nexport type ContractFactoryParams = {\n compiledContract: CompiledContract;\n account: any;\n casm?: CairoAssembly;\n classHash?: string;\n compiledClassHash?: string;\n abi?: Abi;\n};\n\nexport class ContractFactory {\n compiledContract: CompiledContract;\n\n account: AccountInterface;\n\n abi: Abi;\n\n classHash?: string;\n\n casm?: CairoAssembly;\n\n compiledClassHash?: string;\n\n private CallData: CallData;\n\n /**\n * @param params CFParams\n * - compiledContract: CompiledContract;\n * - account: AccountInterface;\n * - casm?: CairoAssembly;\n * - classHash?: string;\n * - compiledClassHash?: string;\n * - abi?: Abi;\n */\n constructor(params: ContractFactoryParams) {\n this.compiledContract = params.compiledContract;\n this.account = params.account;\n this.casm = params.casm;\n this.abi = params.abi ?? params.compiledContract.abi;\n this.classHash = params.classHash;\n this.compiledClassHash = params.compiledClassHash;\n this.CallData = new CallData(this.abi);\n }\n\n /**\n * Deploys contract and returns new instance of the Contract\n *\n * If contract is not declared it will first declare it, and then deploy\n */\n public async deploy(...args: ArgsOrCalldataWithOptions): Promise<Contract> {\n const { args: param, options = { parseRequest: true } } = splitArgsAndOptions(args);\n\n const constructorCalldata = getCalldata(param, () => {\n if (options.parseRequest) {\n this.CallData.validate(ValidateType.DEPLOY, 'constructor', param);\n return this.CallData.compile('constructor', param);\n }\n // eslint-disable-next-line no-console\n console.warn('Call skipped parsing but provided rawArgs, possible malfunction request');\n return param;\n });\n\n const {\n deploy: { contract_address, transaction_hash },\n } = await this.account.declareAndDeploy({\n contract: this.compiledContract,\n casm: this.casm,\n classHash: this.classHash,\n compiledClassHash: this.compiledClassHash,\n constructorCalldata,\n salt: options.addressSalt,\n });\n assert(Boolean(contract_address), 'Deployment of the contract failed');\n\n const contractInstance = new Contract(\n this.compiledContract.abi,\n contract_address!,\n this.account\n );\n contractInstance.deployTransactionHash = transaction_hash;\n\n return contractInstance;\n }\n\n /**\n * Attaches to new Account\n *\n * @param account - new Account to attach to\n */\n connect(account: AccountInterface): ContractFactory {\n this.account = account;\n return this;\n }\n\n /**\n * Attaches current abi and account to the new address\n */\n attach(address: string): Contract {\n return new Contract(this.abi, address, this.account);\n }\n\n // ethers.js' getDeployTransaction can't be supported as it requires the account or signer to return a signed transaction which is not possible with the current implementation\n}\n","import {\n BlockWithTxHashes,\n FeeEstimate,\n CallContractResponse,\n DeclareContractResponse,\n DeployContractResponse,\n EstimateFeeResponse,\n GetBlockResponse,\n GetTransactionResponse,\n InvokeFunctionResponse,\n SimulateTransactionResponse,\n} from '../../types';\nimport type { GetTransactionReceiptResponse } from '../transactionReceipt';\n\nexport abstract class ResponseParser {\n abstract parseGetBlockResponse(res: BlockWithTxHashes): GetBlockResponse;\n\n abstract parseGetTransactionResponse(res: any): GetTransactionResponse;\n\n abstract parseGetTransactionReceiptResponse(res: any): GetTransactionReceiptResponse;\n\n abstract parseFeeEstimateResponse(res: FeeEstimate[]): EstimateFeeResponse;\n\n abstract parseCallContractResponse(res: any): CallContractResponse;\n\n abstract parseInvokeFunctionResponse(res: any): InvokeFunctionResponse;\n\n abstract parseDeployContractResponse(res: any): DeployContractResponse;\n\n abstract parseDeclareContractResponse(res: any): DeclareContractResponse;\n\n abstract parseSimulateTransactionResponse(res: any): SimulateTransactionResponse;\n}\n","/* eslint-disable no-bitwise */\nimport { hexToBytes } from '@noble/curves/abstract/utils';\n\nimport { ADDR_BOUND, ZERO } from '../constants';\nimport { BigNumberish } from '../types';\nimport { addHexPrefix, removeHexPrefix } from './encode';\nimport { keccakBn } from './hash';\nimport { assertInRange, toHex } from './num';\n\n/**\n * Format a hex number to '0x' and 64 characters, adding leading zeros if necessary.\n *\n * @param {BigNumberish} address\n * @returns {string} Hex string : 0x followed by 64 characters. No upper case characters in the response.\n * @example\n * ```typescript\n * const address = \"0x90591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf\";\n * const result = addAddressPadding(address);\n * // result = \"0x0000090591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf\"\n * ```\n */\nexport function addAddressPadding(address: BigNumberish): string {\n const hex = toHex(addHexPrefix(address.toString()));\n const padded = removeHexPrefix(hex).padStart(64, '0');\n return addHexPrefix(padded);\n}\n\n/**\n * Check the validity of a Starknet address, and format it as a hex number : '0x' and 64 characters, adding leading zeros if necessary.\n *\n * @param {BigNumberish} address\n * @returns {string} Hex string : 0x followed by 64 characters. No upper case characters in the response.\n * @throws address argument must be a valid address inside the address range bound\n * @example\n * ```typescript\n * const address = \"0x90591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf\";\n * const result = validateAndParseAddress(address);\n * // result = \"0x0000090591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf\"\n * ```\n */\nexport function validateAndParseAddress(address: BigNumberish): string {\n const result = addAddressPadding(address);\n\n if (!result.match(/^(0x)?[0-9a-fA-F]{64}$/)) {\n throw new Error('Invalid Address Format');\n }\n\n assertInRange(result, ZERO, ADDR_BOUND - 1n, 'Starknet Address');\n\n return result;\n}\n\n/**\n * Convert an address to her checksum representation which uses a specific pattern of uppercase and lowercase letters within\n * a given address to reduce the risk of errors introduced from typing an address or cut and paste issues.\n * @param {BigNumberish} address\n * @returns {string} Hex string : 0x followed by 64 characters. Mix of uppercase and lowercase\n * @example\n * ```typescript\n * const address = \"0x90591d9fa3efc87067d95a643f8455e0b8190eb8cb7bfd39e4fb7571fdf\";\n * const result = getChecksumAddress(address);\n * // result = \"0x0000090591D9fA3EfC87067d95a643f8455E0b8190eb8Cb7bFd39e4fb7571fDF\"\n * ```\n */\n// from https://github.com/ethers-io/ethers.js/blob/fc1e006575d59792fa97b4efb9ea2f8cca1944cf/packages/address/src.ts/index.ts#L12\nexport function getChecksumAddress(address: BigNumberish): string {\n const chars = removeHexPrefix(validateAndParseAddress(address)).toLowerCase().split('');\n const hex = removeHexPrefix(keccakBn(address));\n const hashed = hexToBytes(hex.padStart(64, '0'));\n\n for (let i = 0; i < chars.length; i += 2) {\n if (hashed[i >> 1] >> 4 >= 8) {\n chars[i] = chars[i].toUpperCase();\n }\n if ((hashed[i >> 1] & 0x0f) >= 8) {\n chars[i + 1] = chars[i + 1].toUpperCase();\n }\n }\n\n return addHexPrefix(chars.join(''));\n}\n\n/**\n * If the casing of an address is mixed, it is a Checksum Address, which uses a specific pattern of uppercase and lowercase letters within\n * a given address to reduce the risk of errors introduced from typing an address or cut and paste issues.\n *\n * @param address string\n * @returns true if the ChecksumAddress is valid\n * @example\n * ```typescript\n * const address = \"0x0000090591D9fA3EfC87067d95a643f8455E0b8190eb8Cb7bFd39e4fb7571fDF\";\n * const result = validateChecksumAddress(address);\n * // result = true\n * ```\n */\nexport function validateChecksumAddress(address: string): boolean {\n return getChecksumAddress(address) === address;\n}\n","import urljoin from 'url-join';\n\n/**\n * Inspired from https://github.com/segmentio/is-url\n */\n\n/**\n * RegExps.\n * A URL must match #1 and then at least one of #2/#3.\n * Use two levels of REs to avoid REDOS.\n */\nconst protocolAndDomainRE = /^(?:\\w+:)?\\/\\/(\\S+)$/;\n\nconst localhostDomainRE = /^localhost[:?\\d]*(?:[^:?\\d]\\S*)?$/;\nconst nonLocalhostDomainRE = /^[^\\s.]+\\.\\S{2,}$/;\n\n/**\n * Loosely validate a URL `string`.\n *\n * @param {string} s - The URL to check for\n * @return {boolean} `true` if url is valid, `false` otherwise\n * @example\n * ```typescript\n * const s = \"https://starknetjs.com/docs\";\n * const result = isUrl(s);\n * // result == true\n */\nexport function isUrl(s?: string): boolean {\n if (!s) {\n return false;\n }\n\n if (typeof s !== 'string') {\n return false;\n }\n\n const match = s.match(protocolAndDomainRE);\n if (!match) {\n return false;\n }\n\n const everythingAfterProtocol = match[1];\n if (!everythingAfterProtocol) {\n return false;\n }\n\n if (\n localhostDomainRE.test(everythingAfterProtocol) ||\n nonLocalhostDomainRE.test(everythingAfterProtocol)\n ) {\n return true;\n }\n\n return false;\n}\n\n/**\n * Builds a URL using the provided base URL, default path, and optional URL or path.\n *\n * @param {string} baseUrl - The base URL of the URL being built.\n * @param {string} defaultPath - The default path to use if no URL or path is provided.\n * @param {string} [urlOrPath] - The optional URL or path to append to the base URL.\n * @return {string} The built URL.\n * @example\n * ```typescript\n * const baseUrl = \"https://starknetjs.com\";\n * const defaultPath = \"/\";\n * const urlOrPath = \"/docs\";\n * const result = buildUrl(baseUrl, defaultPath, urlOrPath);\n *\n * result = \"https://starknetjs.com/docs\"\n */\nexport function buildUrl(baseUrl: string, defaultPath: string, urlOrPath?: string) {\n return isUrl(urlOrPath) ? urlOrPath! : urljoin(baseUrl, urlOrPath ?? defaultPath);\n}\n","/**\n * Main\n */\nexport * from './wallet';\nexport * from './account';\nexport * from './contract';\nexport * from './provider';\nexport * from './signer';\nexport * from './channel';\n\n// TODO: decide on final export style\nexport * from './types';\nexport * as types from './types';\n\n/**\n * Utils\n */\nexport * as constants from './constants';\nexport * as encode from './utils/encode';\nexport * as hash from './utils/hash';\nexport * as v3hash from './utils/hash/transactionHash/v3';\nexport * as v2hash from './utils/hash/transactionHash/v2';\nexport * as json from './utils/json';\nexport * as num from './utils/num';\nexport * as transaction from './utils/transaction';\nexport * as stark from './utils/stark';\nexport * as eth from './utils/eth';\nexport * as merkle from './utils/merkle';\nexport * as uint256 from './utils/uint256';\nexport * as shortString from './utils/shortString';\nexport * as typedData from './utils/typedData';\nexport * as ec from './utils/ec';\nexport * as starknetId from './utils/starknetId';\nexport * as provider from './utils/provider';\nexport * as selector from './utils/hash/selector';\nexport * as events from './utils/events';\nexport * from './utils/responseParser';\nexport * from './utils/cairoDataTypes/uint256';\nexport * from './utils/cairoDataTypes/uint512';\nexport * from './utils/address';\nexport * from './utils/url';\nexport * from './utils/calldata';\nexport * from './utils/calldata/enum';\nexport * from './utils/contract';\nexport * from './utils/transactionReceipt';\nexport * as wallet from './wallet/connect';\n\n/**\n * Deprecated\n */\n/* eslint-disable import/first */\nimport * as num from './utils/num';\n\n/** @deprecated prefer the 'num' naming */\nexport const number = num;\n","/**\n * Utility function that works like `Object.apply`, but copies getters and setters properly as well. Additionally gives\n * the option to exclude properties by name.\n */\nconst copyProps = (dest, src, exclude = []) => {\n const props = Object.getOwnPropertyDescriptors(src);\n for (let prop of exclude)\n delete props[prop];\n Object.defineProperties(dest, props);\n};\n/**\n * Returns the full chain of prototypes up until Object.prototype given a starting object. The order of prototypes will\n * be closest to farthest in the chain.\n */\nconst protoChain = (obj, currentChain = [obj]) => {\n const proto = Object.getPrototypeOf(obj);\n if (proto === null)\n return currentChain;\n return protoChain(proto, [...currentChain, proto]);\n};\n/**\n * Identifies the nearest ancestor common to all the given objects in their prototype chains. For most unrelated\n * objects, this function should return Object.prototype.\n */\nconst nearestCommonProto = (...objs) => {\n if (objs.length === 0)\n return undefined;\n let commonProto = undefined;\n const protoChains = objs.map(obj => protoChain(obj));\n while (protoChains.every(protoChain => protoChain.length > 0)) {\n const protos = protoChains.map(protoChain => protoChain.pop());\n const potentialCommonProto = protos[0];\n if (protos.every(proto => proto === potentialCommonProto))\n commonProto = potentialCommonProto;\n else\n break;\n }\n return commonProto;\n};\n/**\n * Creates a new prototype object that is a mixture of the given prototypes. The mixing is achieved by first\n * identifying the nearest common ancestor and using it as the prototype for a new object. Then all properties/methods\n * downstream of this prototype (ONLY downstream) are copied into the new object.\n *\n * The resulting prototype is more performant than softMixProtos(...), as well as ES5 compatible. However, it's not as\n * flexible as updates to the source prototypes aren't captured by the mixed result. See softMixProtos for why you may\n * want to use that instead.\n */\nconst hardMixProtos = (ingredients, constructor, exclude = []) => {\n var _a;\n const base = (_a = nearestCommonProto(...ingredients)) !== null && _a !== void 0 ? _a : Object.prototype;\n const mixedProto = Object.create(base);\n // Keeps track of prototypes we've already visited to avoid copying the same properties multiple times. We init the\n // list with the proto chain below the nearest common ancestor because we don't want any of those methods mixed in\n // when they will already be accessible via prototype access.\n const visitedProtos = protoChain(base);\n for (let prototype of ingredients) {\n let protos = protoChain(prototype);\n // Apply the prototype chain in reverse order so that old methods don't override newer ones.\n for (let i = protos.length - 1; i >= 0; i--) {\n let newProto = protos[i];\n if (visitedProtos.indexOf(newProto) === -1) {\n copyProps(mixedProto, newProto, ['constructor', ...exclude]);\n visitedProtos.push(newProto);\n }\n }\n }\n mixedProto.constructor = constructor;\n return mixedProto;\n};\nconst unique = (arr) => arr.filter((e, i) => arr.indexOf(e) == i);\n\n/**\n * Finds the ingredient with the given prop, searching in reverse order and breadth-first if searching ingredient\n * prototypes is required.\n */\nconst getIngredientWithProp = (prop, ingredients) => {\n const protoChains = ingredients.map(ingredient => protoChain(ingredient));\n // since we search breadth-first, we need to keep track of our depth in the prototype chains\n let protoDepth = 0;\n // not all prototype chains are the same depth, so this remains true as long as at least one of the ingredients'\n // prototype chains has an object at this depth\n let protosAreLeftToSearch = true;\n while (protosAreLeftToSearch) {\n // with the start of each horizontal slice, we assume this is the one that's deeper than any of the proto chains\n protosAreLeftToSearch = false;\n // scan through the ingredients right to left\n for (let i = ingredients.length - 1; i >= 0; i--) {\n const searchTarget = protoChains[i][protoDepth];\n if (searchTarget !== undefined && searchTarget !== null) {\n // if we find something, this is proof that this horizontal slice potentially more objects to search\n protosAreLeftToSearch = true;\n // eureka, we found it\n if (Object.getOwnPropertyDescriptor(searchTarget, prop) != undefined) {\n return protoChains[i][0];\n }\n }\n }\n protoDepth++;\n }\n return undefined;\n};\n/**\n * \"Mixes\" ingredients by wrapping them in a Proxy. The optional prototype argument allows the mixed object to sit\n * downstream of an existing prototype chain. Note that \"properties\" cannot be added, deleted, or modified.\n */\nconst proxyMix = (ingredients, prototype = Object.prototype) => new Proxy({}, {\n getPrototypeOf() {\n return prototype;\n },\n setPrototypeOf() {\n throw Error('Cannot set prototype of Proxies created by ts-mixer');\n },\n getOwnPropertyDescriptor(_, prop) {\n return Object.getOwnPropertyDescriptor(getIngredientWithProp(prop, ingredients) || {}, prop);\n },\n defineProperty() {\n throw new Error('Cannot define new properties on Proxies created by ts-mixer');\n },\n has(_, prop) {\n return getIngredientWithProp(prop, ingredients) !== undefined || prototype[prop] !== undefined;\n },\n get(_, prop) {\n return (getIngredientWithProp(prop, ingredients) || prototype)[prop];\n },\n set(_, prop, val) {\n const ingredientWithProp = getIngredientWithProp(prop, ingredients);\n if (ingredientWithProp === undefined)\n throw new Error('Cannot set new properties on Proxies created by ts-mixer');\n ingredientWithProp[prop] = val;\n return true;\n },\n deleteProperty() {\n throw new Error('Cannot delete properties on Proxies created by ts-mixer');\n },\n ownKeys() {\n return ingredients\n .map(Object.getOwnPropertyNames)\n .reduce((prev, curr) => curr.concat(prev.filter(key => curr.indexOf(key) < 0)));\n },\n});\n/**\n * Creates a new proxy-prototype object that is a \"soft\" mixture of the given prototypes. The mixing is achieved by\n * proxying all property access to the ingredients. This is not ES5 compatible and less performant. However, any\n * changes made to the source prototypes will be reflected in the proxy-prototype, which may be desirable.\n */\nconst softMixProtos = (ingredients, constructor) => proxyMix([...ingredients, { constructor }]);\n\nconst settings = {\n initFunction: null,\n staticsStrategy: 'copy',\n prototypeStrategy: 'copy',\n decoratorInheritance: 'deep',\n};\n\n// Keeps track of constituent classes for every mixin class created by ts-mixer.\nconst mixins = new WeakMap();\nconst getMixinsForClass = (clazz) => mixins.get(clazz);\nconst registerMixins = (mixedClass, constituents) => mixins.set(mixedClass, constituents);\nconst hasMixin = (instance, mixin) => {\n if (instance instanceof mixin)\n return true;\n const constructor = instance.constructor;\n const visited = new Set();\n let frontier = new Set();\n frontier.add(constructor);\n while (frontier.size > 0) {\n // check if the frontier has the mixin we're looking for. if not, we can say we visited every item in the frontier\n if (frontier.has(mixin))\n return true;\n frontier.forEach((item) => visited.add(item));\n // build a new frontier based on the associated mixin classes and prototype chains of each frontier item\n const newFrontier = new Set();\n frontier.forEach((item) => {\n var _a;\n const itemConstituents = (_a = mixins.get(item)) !== null && _a !== void 0 ? _a : protoChain(item.prototype)\n .map((proto) => proto.constructor)\n .filter((item) => item !== null);\n if (itemConstituents)\n itemConstituents.forEach((constituent) => {\n if (!visited.has(constituent) && !frontier.has(constituent))\n newFrontier.add(constituent);\n });\n });\n // we have a new frontier, now search again\n frontier = newFrontier;\n }\n // if we get here, we couldn't find the mixin anywhere in the prototype chain or associated mixin classes\n return false;\n};\n\nconst mergeObjectsOfDecorators = (o1, o2) => {\n var _a, _b;\n const allKeys = unique([...Object.getOwnPropertyNames(o1), ...Object.getOwnPropertyNames(o2)]);\n const mergedObject = {};\n for (let key of allKeys)\n mergedObject[key] = unique([...((_a = o1 === null || o1 === void 0 ? void 0 : o1[key]) !== null && _a !== void 0 ? _a : []), ...((_b = o2 === null || o2 === void 0 ? void 0 : o2[key]) !== null && _b !== void 0 ? _b : [])]);\n return mergedObject;\n};\nconst mergePropertyAndMethodDecorators = (d1, d2) => {\n var _a, _b, _c, _d;\n return ({\n property: mergeObjectsOfDecorators((_a = d1 === null || d1 === void 0 ? void 0 : d1.property) !== null && _a !== void 0 ? _a : {}, (_b = d2 === null || d2 === void 0 ? void 0 : d2.property) !== null && _b !== void 0 ? _b : {}),\n method: mergeObjectsOfDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.method) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.method) !== null && _d !== void 0 ? _d : {}),\n });\n};\nconst mergeDecorators = (d1, d2) => {\n var _a, _b, _c, _d, _e, _f;\n return ({\n class: unique([...(_a = d1 === null || d1 === void 0 ? void 0 : d1.class) !== null && _a !== void 0 ? _a : [], ...(_b = d2 === null || d2 === void 0 ? void 0 : d2.class) !== null && _b !== void 0 ? _b : []]),\n static: mergePropertyAndMethodDecorators((_c = d1 === null || d1 === void 0 ? void 0 : d1.static) !== null && _c !== void 0 ? _c : {}, (_d = d2 === null || d2 === void 0 ? void 0 : d2.static) !== null && _d !== void 0 ? _d : {}),\n instance: mergePropertyAndMethodDecorators((_e = d1 === null || d1 === void 0 ? void 0 : d1.instance) !== null && _e !== void 0 ? _e : {}, (_f = d2 === null || d2 === void 0 ? void 0 : d2.instance) !== null && _f !== void 0 ? _f : {}),\n });\n};\nconst decorators = new Map();\nconst findAllConstituentClasses = (...classes) => {\n var _a;\n const allClasses = new Set();\n const frontier = new Set([...classes]);\n while (frontier.size > 0) {\n for (let clazz of frontier) {\n const protoChainClasses = protoChain(clazz.prototype).map(proto => proto.constructor);\n const mixinClasses = (_a = getMixinsForClass(clazz)) !== null && _a !== void 0 ? _a : [];\n const potentiallyNewClasses = [...protoChainClasses, ...mixinClasses];\n const newClasses = potentiallyNewClasses.filter(c => !allClasses.has(c));\n for (let newClass of newClasses)\n frontier.add(newClass);\n allClasses.add(clazz);\n frontier.delete(clazz);\n }\n }\n return [...allClasses];\n};\nconst deepDecoratorSearch = (...classes) => {\n const decoratorsForClassChain = findAllConstituentClasses(...classes)\n .map(clazz => decorators.get(clazz))\n .filter(decorators => !!decorators);\n if (decoratorsForClassChain.length == 0)\n return {};\n if (decoratorsForClassChain.length == 1)\n return decoratorsForClassChain[0];\n return decoratorsForClassChain.reduce((d1, d2) => mergeDecorators(d1, d2));\n};\nconst directDecoratorSearch = (...classes) => {\n const classDecorators = classes.map(clazz => getDecoratorsForClass(clazz));\n if (classDecorators.length === 0)\n return {};\n if (classDecorators.length === 1)\n return classDecorators[0];\n return classDecorators.reduce((d1, d2) => mergeDecorators(d1, d2));\n};\nconst getDecoratorsForClass = (clazz) => {\n let decoratorsForClass = decorators.get(clazz);\n if (!decoratorsForClass) {\n decoratorsForClass = {};\n decorators.set(clazz, decoratorsForClass);\n }\n return decoratorsForClass;\n};\nconst decorateClass = (decorator) => ((clazz) => {\n const decoratorsForClass = getDecoratorsForClass(clazz);\n let classDecorators = decoratorsForClass.class;\n if (!classDecorators) {\n classDecorators = [];\n decoratorsForClass.class = classDecorators;\n }\n classDecorators.push(decorator);\n return decorator(clazz);\n});\nconst decorateMember = (decorator) => ((object, key, ...otherArgs) => {\n var _a, _b, _c;\n const decoratorTargetType = typeof object === 'function' ? 'static' : 'instance';\n const decoratorType = typeof object[key] === 'function' ? 'method' : 'property';\n const clazz = decoratorTargetType === 'static' ? object : object.constructor;\n const decoratorsForClass = getDecoratorsForClass(clazz);\n const decoratorsForTargetType = (_a = decoratorsForClass === null || decoratorsForClass === void 0 ? void 0 : decoratorsForClass[decoratorTargetType]) !== null && _a !== void 0 ? _a : {};\n decoratorsForClass[decoratorTargetType] = decoratorsForTargetType;\n let decoratorsForType = (_b = decoratorsForTargetType === null || decoratorsForTargetType === void 0 ? void 0 : decoratorsForTargetType[decoratorType]) !== null && _b !== void 0 ? _b : {};\n decoratorsForTargetType[decoratorType] = decoratorsForType;\n let decoratorsForKey = (_c = decoratorsForType === null || decoratorsForType === void 0 ? void 0 : decoratorsForType[key]) !== null && _c !== void 0 ? _c : [];\n decoratorsForType[key] = decoratorsForKey;\n // @ts-ignore: array is type `A[] | B[]` and item is type `A | B`, so technically a type error, but it's fine\n decoratorsForKey.push(decorator);\n // @ts-ignore\n return decorator(object, key, ...otherArgs);\n});\nconst decorate = (decorator) => ((...args) => {\n if (args.length === 1)\n return decorateClass(decorator)(args[0]);\n return decorateMember(decorator)(...args);\n});\n\nfunction Mixin(...constructors) {\n var _a, _b, _c;\n const prototypes = constructors.map(constructor => constructor.prototype);\n // Here we gather up the init functions of the ingredient prototypes, combine them into one init function, and\n // attach it to the mixed class prototype. The reason we do this is because we want the init functions to mix\n // similarly to constructors -- not methods, which simply override each other.\n const initFunctionName = settings.initFunction;\n if (initFunctionName !== null) {\n const initFunctions = prototypes\n .map(proto => proto[initFunctionName])\n .filter(func => typeof func === 'function');\n const combinedInitFunction = function (...args) {\n for (let initFunction of initFunctions)\n initFunction.apply(this, args);\n };\n const extraProto = { [initFunctionName]: combinedInitFunction };\n prototypes.push(extraProto);\n }\n function MixedClass(...args) {\n for (const constructor of constructors)\n // @ts-ignore: potentially abstract class\n copyProps(this, new constructor(...args));\n if (initFunctionName !== null && typeof this[initFunctionName] === 'function')\n this[initFunctionName].apply(this, args);\n }\n MixedClass.prototype = settings.prototypeStrategy === 'copy'\n ? hardMixProtos(prototypes, MixedClass)\n : softMixProtos(prototypes, MixedClass);\n Object.setPrototypeOf(MixedClass, settings.staticsStrategy === 'copy'\n ? hardMixProtos(constructors, null, ['prototype'])\n : proxyMix(constructors, Function.prototype));\n let DecoratedMixedClass = MixedClass;\n if (settings.decoratorInheritance !== 'none') {\n const classDecorators = settings.decoratorInheritance === 'deep'\n ? deepDecoratorSearch(...constructors)\n : directDecoratorSearch(...constructors);\n for (let decorator of (_a = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.class) !== null && _a !== void 0 ? _a : []) {\n const result = decorator(DecoratedMixedClass);\n if (result) {\n DecoratedMixedClass = result;\n }\n }\n applyPropAndMethodDecorators((_b = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.static) !== null && _b !== void 0 ? _b : {}, DecoratedMixedClass);\n applyPropAndMethodDecorators((_c = classDecorators === null || classDecorators === void 0 ? void 0 : classDecorators.instance) !== null && _c !== void 0 ? _c : {}, DecoratedMixedClass.prototype);\n }\n registerMixins(DecoratedMixedClass, constructors);\n return DecoratedMixedClass;\n}\nconst applyPropAndMethodDecorators = (propAndMethodDecorators, target) => {\n const propDecorators = propAndMethodDecorators.property;\n const methodDecorators = propAndMethodDecorators.method;\n if (propDecorators)\n for (let key in propDecorators)\n for (let decorator of propDecorators[key])\n decorator(target, key);\n if (methodDecorators)\n for (let key in methodDecorators)\n for (let decorator of methodDecorators[key])\n decorator(target, key, Object.getOwnPropertyDescriptor(target, key));\n};\n/**\n * A decorator version of the `Mixin` function. You'll want to use this instead of `Mixin` for mixing generic classes.\n */\nconst mix = (...ingredients) => decoratedClass => {\n // @ts-ignore\n const mixedClass = Mixin(...ingredients.concat([decoratedClass]));\n Object.defineProperty(mixedClass, 'name', {\n value: decoratedClass.name,\n writable: false,\n });\n return mixedClass;\n};\n\nexport { Mixin, decorate, hasMixin, mix, settings };\n","import {\n ArgsOrCalldata,\n ArgsOrCalldataWithOptions,\n AsyncContractFunction,\n CallOptions,\n Contract,\n Result,\n RpcProvider,\n CallData,\n splitArgsAndOptions\n} from 'starknet'\nimport { Abi } from '@sentio/abi-wan-kanabi'\n\nexport class StarknetContractView {\n private _contract: Contract\n\n constructor(\n readonly abi: Abi,\n readonly address: string,\n readonly provider: RpcProvider,\n readonly blockNumber: number\n ) {\n this._contract = new Contract(abi, address, provider)\n const callData = new CallData(abi)\n\n for (const fn of callData.abi) {\n if (fn.type == 'function' && fn.state_mutability == 'view') {\n const signature = fn.name\n Object.defineProperty(this, signature, {\n enumerable: true,\n writable: false,\n value: buildCall(this, signature)\n })\n }\n }\n }\n\n call(method: string, args?: ArgsOrCalldata, callOptions?: CallOptions): Promise<Result> {\n return this._contract.call(method, args, {\n ...callOptions,\n blockIdentifier: this.blockNumber\n })\n }\n}\n\nfunction buildCall(contract: StarknetContractView, name: string): AsyncContractFunction {\n return async function (...args: ArgsOrCalldataWithOptions): Promise<any> {\n const params = splitArgsAndOptions(args)\n return contract.call(name, params.args, {\n parseRequest: true,\n parseResponse: true,\n ...params.options\n })\n }\n}\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));","import { ChainId } from '@sentio/chain'\nimport { RecordMetaData } from '@sentio/protos'\nimport { BaseContext, Labels, normalizeLabels } from '../core/index.js'\nimport { Provider, RpcProvider } from 'starknet'\nimport { StarknetProcessorConfig } from './types.js'\nimport { Abi } from '@sentio/abi-wan-kanabi'\nimport { StarknetContractView } from './contract.js'\n\nclass AbstractContext extends BaseContext {\n constructor(\n readonly provider: Provider,\n readonly contractAddress: string,\n readonly chainId: ChainId | string,\n readonly blockNumber: number,\n readonly blockHash: string,\n readonly transactionHash: string,\n readonly logIndex: number = -1,\n readonly contractName: string = '',\n readonly abi?: Abi\n ) {\n super({})\n }\n\n protected getMetaDataInternal(name: string, labels: Labels): RecordMetaData {\n return {\n address: this.contractAddress,\n contractName: '',\n blockNumber: BigInt(this.blockNumber),\n transactionIndex: 0,\n transactionHash: this.transactionHash,\n chainId: this.getChainId(),\n name: name,\n logIndex: this.logIndex,\n labels: normalizeLabels(labels)\n }\n }\n\n getChainId(): ChainId {\n return this.chainId as ChainId\n }\n}\n\nexport class StarknetContext<CT> extends AbstractContext {\n private _contract: any\n\n constructor(\n config: StarknetProcessorConfig,\n provider: RpcProvider,\n blockNumber: number,\n blockHash: string,\n transaction_hash: string,\n logIndex: number,\n readonly classHash: string\n ) {\n super(\n provider,\n config.address,\n config.chainId,\n blockNumber,\n blockHash,\n transaction_hash,\n logIndex,\n config.name ?? classHash.slice(0, 8),\n config.abi\n )\n }\n\n getContract(): CT {\n if (!this.abi) {\n throw new Error('abi not found')\n }\n\n if (!this._contract) {\n this._contract = new StarknetContractView(this.abi, this.contractAddress, this.provider, this.blockNumber)\n }\n return this._contract as CT\n }\n}\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));","export class StarknetEvent<T> {\n constructor(\n readonly caller: string,\n readonly transactionHash: string,\n readonly data: T\n ) {}\n}\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));","export { StarknetPlugin } from './starknet-plugin.js'\n\nexport * from './starknet-processor.js'\n\nexport { StarknetChainId } from '@sentio/chain'\n\nexport * from './context.js'\nexport * from './event.js'\nexport * from './types.js'\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));","import { StarknetChainId } from '@sentio/chain'\nimport { Abi } from 'starknet'\n\nexport type StarknetProcessorConfig = {\n address: string\n name?: string\n chainId: StarknetChainId | string\n startBlock?: bigint\n endBlock?: bigint\n abi?: Abi\n}\n;import(\"node:process\").then((p) => p.stdout.write(\"\"));"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwCA,SAAS,MAAM,MAAM;AACpB,QAAM,IAAI,WAAW,OAAO,IAAI,CAAC;AAClC;AAUA,SAAS,IAAI,OAAO,UAAU;AAC7B,QAAM,SAAS,CAAC;AAChB,MAAI,SAAS,MAAM;AACnB,SAAO,UAAU;AAChB,WAAO,MAAM,IAAI,SAAS,MAAM,MAAM,CAAC;AAAA,EACxC;AACA,SAAO;AACR;AAYA,SAAS,UAAU,QAAQ,UAAU;AACpC,QAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,MAAI,SAAS;AACb,MAAI,MAAM,SAAS,GAAG;AAGrB,aAAS,MAAM,CAAC,IAAI;AACpB,aAAS,MAAM,CAAC;AAAA,EACjB;AAEA,WAAS,OAAO,QAAQ,iBAAiB,GAAM;AAC/C,QAAM,SAAS,OAAO,MAAM,GAAG;AAC/B,QAAM,UAAU,IAAI,QAAQ,QAAQ,EAAE,KAAK,GAAG;AAC9C,SAAO,SAAS;AACjB;AAeA,SAAS,WAAW,QAAQ;AAC3B,QAAMA,UAAS,CAAC;AAChB,MAAI,UAAU;AACd,QAAM,SAAS,OAAO;AACtB,SAAO,UAAU,QAAQ;AACxB,UAAM,QAAQ,OAAO,WAAW,SAAS;AACzC,QAAI,SAAS,SAAU,SAAS,SAAU,UAAU,QAAQ;AAE3D,YAAM,QAAQ,OAAO,WAAW,SAAS;AACzC,WAAK,QAAQ,UAAW,OAAQ;AAC/B,QAAAA,QAAO,OAAO,QAAQ,SAAU,OAAO,QAAQ,QAAS,KAAO;AAAA,MAChE,OAAO;AAGN,QAAAA,QAAO,KAAK,KAAK;AACjB;AAAA,MACD;AAAA,IACD,OAAO;AACN,MAAAA,QAAO,KAAK,KAAK;AAAA,IAClB;AAAA,EACD;AACA,SAAOA;AACR;AA1HA,IAGM,QAGA,MACA,MACA,MACA,MACA,MACA,aACA,UACA,WAGA,eACA,eACA,iBAGA,QAOA,eACA,OACA,oBAsGA,YAWA,cAwBA,cAWA,OAiBA,QA8FA,QAmGA,WAmBA,SAWA,UAyBC;AA3bP;AAAA;AAAA;AAGA,IAAM,SAAS;AAGf,IAAM,OAAO;AACb,IAAM,OAAO;AACb,IAAM,OAAO;AACb,IAAM,OAAO;AACb,IAAM,OAAO;AACb,IAAM,cAAc;AACpB,IAAM,WAAW;AACjB,IAAM,YAAY;AAGlB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AACtB,IAAM,kBAAkB;AAGxB,IAAM,SAAS;AAAA,MACd,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,iBAAiB;AAAA,IAClB;AAGA,IAAM,gBAAgB,OAAO;AAC7B,IAAM,QAAQ,KAAK;AACnB,IAAM,qBAAqB,OAAO;AAUzB;AAYA;AAmBA;AA6BA;AAgCT,IAAM,aAAa,uCAAc,OAAO,cAAc,GAAG,UAAU,GAAhD;AAWnB,IAAM,eAAe,gCAAS,WAAW;AACxC,UAAI,aAAa,MAAQ,YAAY,IAAM;AAC1C,eAAO,MAAM,YAAY;AAAA,MAC1B;AACA,UAAI,aAAa,MAAQ,YAAY,IAAM;AAC1C,eAAO,YAAY;AAAA,MACpB;AACA,UAAI,aAAa,MAAQ,YAAY,KAAM;AAC1C,eAAO,YAAY;AAAA,MACpB;AACA,aAAO;AAAA,IACR,GAXqB;AAwBrB,IAAM,eAAe,gCAAS,OAAO,MAAM;AAG1C,aAAO,QAAQ,KAAK,MAAM,QAAQ,QAAQ,QAAQ,MAAM;AAAA,IACzD,GAJqB;AAWrB,IAAM,QAAQ,gCAAS,OAAO,WAAW,WAAW;AACnD,UAAI,IAAI;AACR,cAAQ,YAAY,MAAM,QAAQ,IAAI,IAAI,SAAS;AACnD,eAAS,MAAM,QAAQ,SAAS;AAChC,aAA8B,QAAQ,gBAAgB,QAAQ,GAAG,KAAK,MAAM;AAC3E,gBAAQ,MAAM,QAAQ,aAAa;AAAA,MACpC;AACA,aAAO,MAAM,KAAK,gBAAgB,KAAK,SAAS,QAAQ,KAAK;AAAA,IAC9D,GARc;AAiBd,IAAM,SAAS,gCAAS,OAAO;AAE9B,YAAMA,UAAS,CAAC;AAChB,YAAM,cAAc,MAAM;AAC1B,UAAI,IAAI;AACR,UAAI,IAAI;AACR,UAAI,OAAO;AAMX,UAAI,QAAQ,MAAM,YAAY,SAAS;AACvC,UAAI,QAAQ,GAAG;AACd,gBAAQ;AAAA,MACT;AAEA,eAAS,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;AAE/B,YAAI,MAAM,WAAW,CAAC,KAAK,KAAM;AAChC,gBAAM,WAAW;AAAA,QAClB;AACA,QAAAA,QAAO,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,MAChC;AAKA,eAAS,QAAQ,QAAQ,IAAI,QAAQ,IAAI,GAAG,QAAQ,eAAwC;AAO3F,cAAM,OAAO;AACb,iBAAS,IAAI,GAAG,IAAI,QAA0B,KAAK,MAAM;AAExD,cAAI,SAAS,aAAa;AACzB,kBAAM,eAAe;AAAA,UACtB;AAEA,gBAAM,QAAQ,aAAa,MAAM,WAAW,OAAO,CAAC;AAEpD,cAAI,SAAS,MAAM;AAClB,kBAAM,eAAe;AAAA,UACtB;AACA,cAAI,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAG;AACpC,kBAAM,UAAU;AAAA,UACjB;AAEA,eAAK,QAAQ;AACb,gBAAM,IAAI,KAAK,OAAO,OAAQ,KAAK,OAAO,OAAO,OAAO,IAAI;AAE5D,cAAI,QAAQ,GAAG;AACd;AAAA,UACD;AAEA,gBAAM,aAAa,OAAO;AAC1B,cAAI,IAAI,MAAM,SAAS,UAAU,GAAG;AACnC,kBAAM,UAAU;AAAA,UACjB;AAEA,eAAK;AAAA,QAEN;AAEA,cAAM,MAAMA,QAAO,SAAS;AAC5B,eAAO,MAAM,IAAI,MAAM,KAAK,QAAQ,CAAC;AAIrC,YAAI,MAAM,IAAI,GAAG,IAAI,SAAS,GAAG;AAChC,gBAAM,UAAU;AAAA,QACjB;AAEA,aAAK,MAAM,IAAI,GAAG;AAClB,aAAK;AAGL,QAAAA,QAAO,OAAO,KAAK,GAAG,CAAC;AAAA,MAExB;AAEA,aAAO,OAAO,cAAc,GAAGA,OAAM;AAAA,IACtC,GArFe;AA8Ff,IAAM,SAAS,gCAAS,OAAO;AAC9B,YAAMA,UAAS,CAAC;AAGhB,cAAQ,WAAW,KAAK;AAGxB,YAAM,cAAc,MAAM;AAG1B,UAAI,IAAI;AACR,UAAI,QAAQ;AACZ,UAAI,OAAO;AAGX,iBAAW,gBAAgB,OAAO;AACjC,YAAI,eAAe,KAAM;AACxB,UAAAA,QAAO,KAAK,mBAAmB,YAAY,CAAC;AAAA,QAC7C;AAAA,MACD;AAEA,YAAM,cAAcA,QAAO;AAC3B,UAAI,iBAAiB;AAMrB,UAAI,aAAa;AAChB,QAAAA,QAAO,KAAK,SAAS;AAAA,MACtB;AAGA,aAAO,iBAAiB,aAAa;AAIpC,YAAI,IAAI;AACR,mBAAW,gBAAgB,OAAO;AACjC,cAAI,gBAAgB,KAAK,eAAe,GAAG;AAC1C,gBAAI;AAAA,UACL;AAAA,QACD;AAIA,cAAM,wBAAwB,iBAAiB;AAC/C,YAAI,IAAI,IAAI,OAAO,SAAS,SAAS,qBAAqB,GAAG;AAC5D,gBAAM,UAAU;AAAA,QACjB;AAEA,kBAAU,IAAI,KAAK;AACnB,YAAI;AAEJ,mBAAW,gBAAgB,OAAO;AACjC,cAAI,eAAe,KAAK,EAAE,QAAQ,QAAQ;AACzC,kBAAM,UAAU;AAAA,UACjB;AACA,cAAI,iBAAiB,GAAG;AAEvB,gBAAI,IAAI;AACR,qBAAS,IAAI,QAA0B,KAAK,MAAM;AACjD,oBAAM,IAAI,KAAK,OAAO,OAAQ,KAAK,OAAO,OAAO,OAAO,IAAI;AAC5D,kBAAI,IAAI,GAAG;AACV;AAAA,cACD;AACA,oBAAM,UAAU,IAAI;AACpB,oBAAM,aAAa,OAAO;AAC1B,cAAAA,QAAO;AAAA,gBACN,mBAAmB,aAAa,IAAI,UAAU,YAAY,CAAC,CAAC;AAAA,cAC7D;AACA,kBAAI,MAAM,UAAU,UAAU;AAAA,YAC/B;AAEA,YAAAA,QAAO,KAAK,mBAAmB,aAAa,GAAG,CAAC,CAAC,CAAC;AAClD,mBAAO,MAAM,OAAO,uBAAuB,mBAAmB,WAAW;AACzE,oBAAQ;AACR,cAAE;AAAA,UACH;AAAA,QACD;AAEA,UAAE;AACF,UAAE;AAAA,MAEH;AACA,aAAOA,QAAO,KAAK,EAAE;AAAA,IACtB,GAtFe;AAmGf,IAAM,YAAY,gCAAS,OAAO;AACjC,aAAO,UAAU,OAAO,SAAS,QAAQ;AACxC,eAAO,cAAc,KAAK,MAAM,IAC7B,OAAO,OAAO,MAAM,CAAC,EAAE,YAAY,CAAC,IACpC;AAAA,MACJ,CAAC;AAAA,IACF,GANkB;AAmBlB,IAAM,UAAU,gCAAS,OAAO;AAC/B,aAAO,UAAU,OAAO,SAAS,QAAQ;AACxC,eAAO,cAAc,KAAK,MAAM,IAC7B,SAAS,OAAO,MAAM,IACtB;AAAA,MACJ,CAAC;AAAA,IACF,GANgB;AAWhB,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMhB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQX,QAAQ;AAAA,QACP,UAAU;AAAA,QACV,UAAU;AAAA,MACX;AAAA,MACA,UAAU;AAAA,MACV,UAAU;AAAA,MACV,WAAW;AAAA,MACX,aAAa;AAAA,IACd;AAGA,IAAO,uBAAQ;AAAA;AAAA;;;AC3bf;AAAA;AAAA;AAWA,WAAO,UAAU,gCAAS,SAAS,MAAM,UAAU;AACjD,iBAAW,SAAS,MAAM,GAAG,EAAE,CAAC;AAChC,aAAO,CAAC;AAER,UAAI,CAAC,KAAM,QAAO;AAElB,cAAQ,UAAU;AAAA,QAChB,KAAK;AAAA,QACL,KAAK;AACL,iBAAO,SAAS;AAAA,QAEhB,KAAK;AAAA,QACL,KAAK;AACL,iBAAO,SAAS;AAAA,QAEhB,KAAK;AACL,iBAAO,SAAS;AAAA,QAEhB,KAAK;AACL,iBAAO,SAAS;AAAA,QAEhB,KAAK;AACL,iBAAO;AAAA,MACT;AAEA,aAAO,SAAS;AAAA,IAClB,GA1BiB;AAAA;AAAA;;;ACXjB;AAAA;AAAA;AAEA,QAAI,MAAM,OAAO,UAAU;AAA3B,QACI;AASJ,aAASC,QAAO,OAAO;AACrB,UAAI;AACF,eAAO,mBAAmB,MAAM,QAAQ,OAAO,GAAG,CAAC;AAAA,MACrD,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AANS,WAAAA,SAAA;AAeT,aAASC,QAAO,OAAO;AACrB,UAAI;AACF,eAAO,mBAAmB,KAAK;AAAA,MACjC,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AANS,WAAAA,SAAA;AAeT,aAAS,YAAY,OAAO;AAC1B,UAAI,SAAS,wBACT,SAAS,CAAC,GACV;AAEJ,aAAO,OAAO,OAAO,KAAK,KAAK,GAAG;AAChC,YAAI,MAAMD,QAAO,KAAK,CAAC,CAAC,GACpB,QAAQA,QAAO,KAAK,CAAC,CAAC;AAU1B,YAAI,QAAQ,QAAQ,UAAU,QAAQ,OAAO,OAAQ;AACrD,eAAO,GAAG,IAAI;AAAA,MAChB;AAEA,aAAO;AAAA,IACT;AAtBS;AAgCT,aAAS,eAAe,KAAK,QAAQ;AACnC,eAAS,UAAU;AAEnB,UAAI,QAAQ,CAAC,GACT,OACA;AAKJ,UAAI,aAAa,OAAO,OAAQ,UAAS;AAEzC,WAAK,OAAO,KAAK;AACf,YAAI,IAAI,KAAK,KAAK,GAAG,GAAG;AACtB,kBAAQ,IAAI,GAAG;AAMf,cAAI,CAAC,UAAU,UAAU,QAAQ,UAAU,SAAS,MAAM,KAAK,IAAI;AACjE,oBAAQ;AAAA,UACV;AAEA,gBAAMC,QAAO,GAAG;AAChB,kBAAQA,QAAO,KAAK;AAMpB,cAAI,QAAQ,QAAQ,UAAU,KAAM;AACpC,gBAAM,KAAK,MAAK,MAAK,KAAK;AAAA,QAC5B;AAAA,MACF;AAEA,aAAO,MAAM,SAAS,SAAS,MAAM,KAAK,GAAG,IAAI;AAAA,IACnD;AArCS;AA0CT,YAAQ,YAAY;AACpB,YAAQ,QAAQ;AAAA;AAAA;;;ACrHhB;AAAA;AAAA;AAEA,QAAI,WAAW;AAAf,QACI,KAAK;AADT,QAEI,sBAAsB;AAF1B,QAGI,SAAS;AAHb,QAII,UAAU;AAJd,QAKI,OAAO;AALX,QAMI,aAAa;AANjB,QAOI,qBAAqB;AAUzB,aAAS,SAAS,KAAK;AACrB,cAAQ,MAAM,MAAM,IAAI,SAAS,EAAE,QAAQ,qBAAqB,EAAE;AAAA,IACpE;AAFS;AAgBT,QAAI,QAAQ;AAAA,MACV,CAAC,KAAK,MAAM;AAAA;AAAA,MACZ,CAAC,KAAK,OAAO;AAAA;AAAA,MACb,gCAAS,SAAS,SAAS,KAAK;AAC9B,eAAO,UAAU,IAAI,QAAQ,IAAI,QAAQ,QAAQ,OAAO,GAAG,IAAI;AAAA,MACjE,GAFA;AAAA,MAGA,CAAC,KAAK,UAAU;AAAA;AAAA,MAChB,CAAC,KAAK,QAAQ,CAAC;AAAA;AAAA,MACf,CAAC,KAAK,QAAQ,QAAW,GAAG,CAAC;AAAA;AAAA,MAC7B,CAAC,WAAW,QAAQ,QAAW,CAAC;AAAA;AAAA,MAChC,CAAC,KAAK,YAAY,QAAW,GAAG,CAAC;AAAA;AAAA,IACnC;AAUA,QAAI,SAAS,EAAE,MAAM,GAAG,OAAO,EAAE;AAcjC,aAAS,UAAU,KAAK;AACtB,UAAI;AAEJ,UAAI,OAAO,WAAW,YAAa,aAAY;AAAA,eACtC,OAAO,WAAW,YAAa,aAAY;AAAA,eAC3C,OAAO,SAAS,YAAa,aAAY;AAAA,UAC7C,aAAY,CAAC;AAElB,UAAI,WAAW,UAAU,YAAY,CAAC;AACtC,YAAM,OAAO;AAEb,UAAI,mBAAmB,CAAC,GACpB,OAAO,OAAO,KACd;AAEJ,UAAI,YAAY,IAAI,UAAU;AAC5B,2BAAmB,IAAI,IAAI,SAAS,IAAI,QAAQ,GAAG,CAAC,CAAC;AAAA,MACvD,WAAW,aAAa,MAAM;AAC5B,2BAAmB,IAAI,IAAI,KAAK,CAAC,CAAC;AAClC,aAAK,OAAO,OAAQ,QAAO,iBAAiB,GAAG;AAAA,MACjD,WAAW,aAAa,MAAM;AAC5B,aAAK,OAAO,KAAK;AACf,cAAI,OAAO,OAAQ;AACnB,2BAAiB,GAAG,IAAI,IAAI,GAAG;AAAA,QACjC;AAEA,YAAI,iBAAiB,YAAY,QAAW;AAC1C,2BAAiB,UAAU,QAAQ,KAAK,IAAI,IAAI;AAAA,QAClD;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAhCS;AAyCT,aAAS,UAAU,QAAQ;AACzB,aACE,WAAW,WACX,WAAW,UACX,WAAW,WACX,WAAW,YACX,WAAW,SACX,WAAW;AAAA,IAEf;AATS;AA2BT,aAAS,gBAAgB,SAAS,UAAU;AAC1C,gBAAU,SAAS,OAAO;AAC1B,gBAAU,QAAQ,QAAQ,QAAQ,EAAE;AACpC,iBAAW,YAAY,CAAC;AAExB,UAAI,QAAQ,WAAW,KAAK,OAAO;AACnC,UAAI,WAAW,MAAM,CAAC,IAAI,MAAM,CAAC,EAAE,YAAY,IAAI;AACnD,UAAI,iBAAiB,CAAC,CAAC,MAAM,CAAC;AAC9B,UAAI,eAAe,CAAC,CAAC,MAAM,CAAC;AAC5B,UAAI,eAAe;AACnB,UAAI;AAEJ,UAAI,gBAAgB;AAClB,YAAI,cAAc;AAChB,iBAAO,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC;AACpC,yBAAe,MAAM,CAAC,EAAE,SAAS,MAAM,CAAC,EAAE;AAAA,QAC5C,OAAO;AACL,iBAAO,MAAM,CAAC,IAAI,MAAM,CAAC;AACzB,yBAAe,MAAM,CAAC,EAAE;AAAA,QAC1B;AAAA,MACF,OAAO;AACL,YAAI,cAAc;AAChB,iBAAO,MAAM,CAAC,IAAI,MAAM,CAAC;AACzB,yBAAe,MAAM,CAAC,EAAE;AAAA,QAC1B,OAAO;AACL,iBAAO,MAAM,CAAC;AAAA,QAChB;AAAA,MACF;AAEA,UAAI,aAAa,SAAS;AACxB,YAAI,gBAAgB,GAAG;AACrB,iBAAO,KAAK,MAAM,CAAC;AAAA,QACrB;AAAA,MACF,WAAW,UAAU,QAAQ,GAAG;AAC9B,eAAO,MAAM,CAAC;AAAA,MAChB,WAAW,UAAU;AACnB,YAAI,gBAAgB;AAClB,iBAAO,KAAK,MAAM,CAAC;AAAA,QACrB;AAAA,MACF,WAAW,gBAAgB,KAAK,UAAU,SAAS,QAAQ,GAAG;AAC5D,eAAO,MAAM,CAAC;AAAA,MAChB;AAEA,aAAO;AAAA,QACL;AAAA,QACA,SAAS,kBAAkB,UAAU,QAAQ;AAAA,QAC7C;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAjDS;AA2DT,aAAS,QAAQ,UAAUC,OAAM;AAC/B,UAAI,aAAa,GAAI,QAAOA;AAE5B,UAAI,QAAQA,SAAQ,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,OAAO,SAAS,MAAM,GAAG,CAAC,GACvE,IAAI,KAAK,QACT,OAAO,KAAK,IAAI,CAAC,GACjB,UAAU,OACV,KAAK;AAET,aAAO,KAAK;AACV,YAAI,KAAK,CAAC,MAAM,KAAK;AACnB,eAAK,OAAO,GAAG,CAAC;AAAA,QAClB,WAAW,KAAK,CAAC,MAAM,MAAM;AAC3B,eAAK,OAAO,GAAG,CAAC;AAChB;AAAA,QACF,WAAW,IAAI;AACb,cAAI,MAAM,EAAG,WAAU;AACvB,eAAK,OAAO,GAAG,CAAC;AAChB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,QAAS,MAAK,QAAQ,EAAE;AAC5B,UAAI,SAAS,OAAO,SAAS,KAAM,MAAK,KAAK,EAAE;AAE/C,aAAO,KAAK,KAAK,GAAG;AAAA,IACtB;AA1BS;AA0CT,aAAS,IAAI,SAAS,UAAU,QAAQ;AACtC,gBAAU,SAAS,OAAO;AAC1B,gBAAU,QAAQ,QAAQ,QAAQ,EAAE;AAEpC,UAAI,EAAE,gBAAgB,MAAM;AAC1B,eAAO,IAAI,IAAI,SAAS,UAAU,MAAM;AAAA,MAC1C;AAEA,UAAI,UAAU,WAAWC,QAAO,aAAa,OAAO,KAChD,eAAe,MAAM,MAAM,GAC3B,OAAO,OAAO,UACd,MAAM,MACN,IAAI;AAaR,UAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,iBAAS;AACT,mBAAW;AAAA,MACb;AAEA,UAAI,UAAU,eAAe,OAAO,OAAQ,UAAS,GAAG;AAExD,iBAAW,UAAU,QAAQ;AAK7B,kBAAY,gBAAgB,WAAW,IAAI,QAAQ;AACnD,iBAAW,CAAC,UAAU,YAAY,CAAC,UAAU;AAC7C,UAAI,UAAU,UAAU,WAAW,YAAY,SAAS;AACxD,UAAI,WAAW,UAAU,YAAY,SAAS,YAAY;AAC1D,gBAAU,UAAU;AAMpB,UACE,UAAU,aAAa,YACrB,UAAU,iBAAiB,KAAK,mBAAmB,KAAK,OAAO,MAChE,CAAC,UAAU,YACT,UAAU,YACT,UAAU,eAAe,KACzB,CAAC,UAAU,IAAI,QAAQ,IAC3B;AACA,qBAAa,CAAC,IAAI,CAAC,QAAQ,UAAU;AAAA,MACvC;AAEA,aAAO,IAAI,aAAa,QAAQ,KAAK;AACnC,sBAAc,aAAa,CAAC;AAE5B,YAAI,OAAO,gBAAgB,YAAY;AACrC,oBAAU,YAAY,SAAS,GAAG;AAClC;AAAA,QACF;AAEA,QAAAA,SAAQ,YAAY,CAAC;AACrB,cAAM,YAAY,CAAC;AAEnB,YAAIA,WAAUA,QAAO;AACnB,cAAI,GAAG,IAAI;AAAA,QACb,WAAW,aAAa,OAAOA,QAAO;AACpC,kBAAQA,WAAU,MACd,QAAQ,YAAYA,MAAK,IACzB,QAAQ,QAAQA,MAAK;AAEzB,cAAI,CAAC,OAAO;AACV,gBAAI,aAAa,OAAO,YAAY,CAAC,GAAG;AACtC,kBAAI,GAAG,IAAI,QAAQ,MAAM,GAAG,KAAK;AACjC,wBAAU,QAAQ,MAAM,QAAQ,YAAY,CAAC,CAAC;AAAA,YAChD,OAAO;AACL,kBAAI,GAAG,IAAI,QAAQ,MAAM,KAAK;AAC9B,wBAAU,QAAQ,MAAM,GAAG,KAAK;AAAA,YAClC;AAAA,UACF;AAAA,QACF,WAAY,QAAQA,OAAM,KAAK,OAAO,GAAI;AACxC,cAAI,GAAG,IAAI,MAAM,CAAC;AAClB,oBAAU,QAAQ,MAAM,GAAG,MAAM,KAAK;AAAA,QACxC;AAEA,YAAI,GAAG,IAAI,IAAI,GAAG,MAChB,YAAY,YAAY,CAAC,IAAI,SAAS,GAAG,KAAK,KAAK;AAOrD,YAAI,YAAY,CAAC,EAAG,KAAI,GAAG,IAAI,IAAI,GAAG,EAAE,YAAY;AAAA,MACtD;AAOA,UAAI,OAAQ,KAAI,QAAQ,OAAO,IAAI,KAAK;AAKxC,UACI,YACC,SAAS,WACT,IAAI,SAAS,OAAO,CAAC,MAAM,QAC1B,IAAI,aAAa,MAAM,SAAS,aAAa,KACjD;AACA,YAAI,WAAW,QAAQ,IAAI,UAAU,SAAS,QAAQ;AAAA,MACxD;AAMA,UAAI,IAAI,SAAS,OAAO,CAAC,MAAM,OAAO,UAAU,IAAI,QAAQ,GAAG;AAC7D,YAAI,WAAW,MAAM,IAAI;AAAA,MAC3B;AAOA,UAAI,CAAC,SAAS,IAAI,MAAM,IAAI,QAAQ,GAAG;AACrC,YAAI,OAAO,IAAI;AACf,YAAI,OAAO;AAAA,MACb;AAKA,UAAI,WAAW,IAAI,WAAW;AAE9B,UAAI,IAAI,MAAM;AACZ,gBAAQ,IAAI,KAAK,QAAQ,GAAG;AAE5B,YAAI,CAAC,OAAO;AACV,cAAI,WAAW,IAAI,KAAK,MAAM,GAAG,KAAK;AACtC,cAAI,WAAW,mBAAmB,mBAAmB,IAAI,QAAQ,CAAC;AAElE,cAAI,WAAW,IAAI,KAAK,MAAM,QAAQ,CAAC;AACvC,cAAI,WAAW,mBAAmB,mBAAmB,IAAI,QAAQ,CAAC;AAAA,QACpE,OAAO;AACL,cAAI,WAAW,mBAAmB,mBAAmB,IAAI,IAAI,CAAC;AAAA,QAChE;AAEA,YAAI,OAAO,IAAI,WAAW,IAAI,WAAU,MAAK,IAAI,WAAW,IAAI;AAAA,MAClE;AAEA,UAAI,SAAS,IAAI,aAAa,WAAW,UAAU,IAAI,QAAQ,KAAK,IAAI,OACpE,IAAI,WAAU,OAAM,IAAI,OACxB;AAKJ,UAAI,OAAO,IAAI,SAAS;AAAA,IAC1B;AAvKS;AAsLT,aAAS,IAAI,MAAM,OAAO,IAAI;AAC5B,UAAI,MAAM;AAEV,cAAQ,MAAM;AAAA,QACZ,KAAK;AACH,cAAI,aAAa,OAAO,SAAS,MAAM,QAAQ;AAC7C,qBAAS,MAAM,GAAG,OAAO,KAAK;AAAA,UAChC;AAEA,cAAI,IAAI,IAAI;AACZ;AAAA,QAEF,KAAK;AACH,cAAI,IAAI,IAAI;AAEZ,cAAI,CAAC,SAAS,OAAO,IAAI,QAAQ,GAAG;AAClC,gBAAI,OAAO,IAAI;AACf,gBAAI,IAAI,IAAI;AAAA,UACd,WAAW,OAAO;AAChB,gBAAI,OAAO,IAAI,WAAU,MAAK;AAAA,UAChC;AAEA;AAAA,QAEF,KAAK;AACH,cAAI,IAAI,IAAI;AAEZ,cAAI,IAAI,KAAM,UAAS,MAAK,IAAI;AAChC,cAAI,OAAO;AACX;AAAA,QAEF,KAAK;AACH,cAAI,IAAI,IAAI;AAEZ,cAAI,KAAK,KAAK,KAAK,GAAG;AACpB,oBAAQ,MAAM,MAAM,GAAG;AACvB,gBAAI,OAAO,MAAM,IAAI;AACrB,gBAAI,WAAW,MAAM,KAAK,GAAG;AAAA,UAC/B,OAAO;AACL,gBAAI,WAAW;AACf,gBAAI,OAAO;AAAA,UACb;AAEA;AAAA,QAEF,KAAK;AACH,cAAI,WAAW,MAAM,YAAY;AACjC,cAAI,UAAU,CAAC;AACf;AAAA,QAEF,KAAK;AAAA,QACL,KAAK;AACH,cAAI,OAAO;AACT,gBAAI,OAAO,SAAS,aAAa,MAAM;AACvC,gBAAI,IAAI,IAAI,MAAM,OAAO,CAAC,MAAM,OAAO,OAAO,QAAQ;AAAA,UACxD,OAAO;AACL,gBAAI,IAAI,IAAI;AAAA,UACd;AACA;AAAA,QAEF,KAAK;AAAA,QACL,KAAK;AACH,cAAI,IAAI,IAAI,mBAAmB,KAAK;AACpC;AAAA,QAEF,KAAK;AACH,cAAI,QAAQ,MAAM,QAAQ,GAAG;AAE7B,cAAI,CAAC,OAAO;AACV,gBAAI,WAAW,MAAM,MAAM,GAAG,KAAK;AACnC,gBAAI,WAAW,mBAAmB,mBAAmB,IAAI,QAAQ,CAAC;AAElE,gBAAI,WAAW,MAAM,MAAM,QAAQ,CAAC;AACpC,gBAAI,WAAW,mBAAmB,mBAAmB,IAAI,QAAQ,CAAC;AAAA,UACpE,OAAO;AACL,gBAAI,WAAW,mBAAmB,mBAAmB,KAAK,CAAC;AAAA,UAC7D;AAAA,MACJ;AAEA,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,YAAI,MAAM,MAAM,CAAC;AAEjB,YAAI,IAAI,CAAC,EAAG,KAAI,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,YAAY;AAAA,MACpD;AAEA,UAAI,OAAO,IAAI,WAAW,IAAI,WAAU,MAAK,IAAI,WAAW,IAAI;AAEhE,UAAI,SAAS,IAAI,aAAa,WAAW,UAAU,IAAI,QAAQ,KAAK,IAAI,OACpE,IAAI,WAAU,OAAM,IAAI,OACxB;AAEJ,UAAI,OAAO,IAAI,SAAS;AAExB,aAAO;AAAA,IACT;AA9FS;AAuGT,aAAS,SAASC,YAAW;AAC3B,UAAI,CAACA,cAAa,eAAe,OAAOA,WAAW,CAAAA,aAAY,GAAG;AAElE,UAAI,OACA,MAAM,MACN,OAAO,IAAI,MACX,WAAW,IAAI;AAEnB,UAAI,YAAY,SAAS,OAAO,SAAS,SAAS,CAAC,MAAM,IAAK,aAAY;AAE1E,UAAI,SACF,YACE,IAAI,YAAY,IAAI,WAAY,UAAU,IAAI,QAAQ,IAAI,OAAO;AAErE,UAAI,IAAI,UAAU;AAChB,kBAAU,IAAI;AACd,YAAI,IAAI,SAAU,WAAU,MAAK,IAAI;AACrC,kBAAU;AAAA,MACZ,WAAW,IAAI,UAAU;AACvB,kBAAU,MAAK,IAAI;AACnB,kBAAU;AAAA,MACZ,WACE,IAAI,aAAa,WACjB,UAAU,IAAI,QAAQ,KACtB,CAAC,QACD,IAAI,aAAa,KACjB;AAKA,kBAAU;AAAA,MACZ;AAOA,UAAI,KAAK,KAAK,SAAS,CAAC,MAAM,OAAQ,KAAK,KAAK,IAAI,QAAQ,KAAK,CAAC,IAAI,MAAO;AAC3E,gBAAQ;AAAA,MACV;AAEA,gBAAU,OAAO,IAAI;AAErB,cAAQ,aAAa,OAAO,IAAI,QAAQA,WAAU,IAAI,KAAK,IAAI,IAAI;AACnE,UAAI,MAAO,WAAU,QAAQ,MAAM,OAAO,CAAC,IAAI,MAAK,QAAQ;AAE5D,UAAI,IAAI,KAAM,WAAU,IAAI;AAE5B,aAAO;AAAA,IACT;AAnDS;AAqDT,QAAI,YAAY,EAAE,KAAU,SAAmB;AAM/C,QAAI,kBAAkB;AACtB,QAAI,WAAW;AACf,QAAI,WAAW;AACf,QAAI,KAAK;AAET,WAAO,UAAU;AAAA;AAAA;;;AC5kBjB;AAAA;AAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACA;AAAA;AAAA;;;AC/pSA;AAAA;AAAA;AAIA,QAAI,WAAW,UAAQ,UAAU;AAGjC,QAAI,YAAY,CAAC;AAMjB,cAAU,QAAQ,gBAA6B,IAAI,SAAU,MAAM;AAEjE,aAAO;AAAA,QACL;AAAA,QACA,QAAQ,KAAK,QAAQ,cAAc,EAAE;AAAA,QACrC,YAAY;AAAA,QACZ,UAAU,KAAK,OAAO,CAAC,MAAM;AAAA,QAC7B,WAAW,KAAK,OAAO,CAAC,MAAM;AAAA,MAChC;AAAA,IACF,CAAC;AAMD,cAAU,WAAW,SAAU,KAAK,QAAQ;AAE1C,aAAO,IAAI,QAAQ,QAAQ,IAAI,SAAS,OAAO,MAAM,MAAM;AAAA,IAC7D;AAMA,cAAU,WAAW,SAAU,QAAQ;AAErC,UAAI,aAAa,SAAS,QAAQ,MAAM;AACxC,aAAO,UAAU,MAAM,OAAO,SAAU,MAAM,MAAM;AAElD,YAAI,KAAK,eAAe,IAAG;AACzB,eAAK,aAAa,SAAS,QAAQ,KAAK,MAAM;AAAA,QAChD;AACA,YAAI,CAAC,UAAU,SAAS,YAAY,MAAM,KAAK,UAAU,KAAK,eAAe,KAAK,YAAY;AAC5F,iBAAO;AAAA,QACT;AAUA,eAAO;AAAA,MACT,GAAG,IAAI;AAAA,IACT;AAMA,YAAQ,aAAa;AAAA,MACnB,kBAAkB;AAAA,MAClB,iBAAiB;AAAA,MACjB,wBAAwB;AAAA,MACxB,sBAAsB;AAAA,MACtB,gBAAgB;AAAA,MAChB,iBAAiB;AAAA,MACjB,qBAAqB;AAAA,IACvB;AAsBA,cAAU,WAAW,SAAU,OAAO;AAGpC,UAAI,QAAQ,SAAS,QAAQ,KAAK;AAElC,UAAI,MAAM,SAAS,GAAG;AACpB,eAAO;AAAA,MACT;AACA,UAAI,MAAM,SAAS,KAAK;AACtB,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,MAAM,MAAM,GAAG;AAC5B,UAAI;AAEJ,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACtC,gBAAQ,OAAO,CAAC;AAChB,YAAI,CAAC,MAAM,QAAQ;AACjB,iBAAO;AAAA,QACT;AACA,YAAI,MAAM,SAAS,IAAI;AACrB,iBAAO;AAAA,QACT;AACA,YAAI,MAAM,OAAO,CAAC,MAAM,KAAK;AAC3B,iBAAO;AAAA,QACT;AACA,YAAI,MAAM,OAAO,MAAM,SAAS,CAAC,MAAM,KAAK;AAC1C,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,gBAAgB,KAAK,KAAK,GAAG;AAChC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAWA,YAAQ,QAAQ,SAAU,OAAO;AAE/B,UAAI,OAAO,UAAU,UAAU;AAC7B,cAAM,IAAI,UAAU,+BAA+B;AAAA,MACrD;AAGA,UAAI,SAAS,MAAM,MAAM,CAAC,EAAE,YAAY;AAIxC,UAAI,OAAO,OAAO,OAAO,SAAS,CAAC,MAAM,KAAK;AAC5C,iBAAS,OAAO,MAAM,GAAG,OAAO,SAAS,CAAC;AAAA,MAC5C;AAGA,UAAIC,SAAQ,UAAU,SAAS,MAAM;AACrC,UAAIA,QAAO;AACT,eAAO;AAAA,UACL;AAAA,UACA,OAAO;AAAA,YACL,SAAS,QAAQ,WAAWA,MAAK;AAAA,YACjC,MAAMA;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AAAA,QACX;AAAA,QACA,KAAK;AAAA,QACL,KAAK;AAAA,QACL,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,QAAQ;AAAA,MACV;AAEA,UAAI,cAAc,OAAO,MAAM,GAAG;AAGlC,UAAI,YAAY,YAAY,SAAS,CAAC,MAAM,SAAS;AACnD,eAAO;AAAA,MACT;AAEA,UAAI,iBAAiB,kCAAY;AAE/B,YAAI,CAAC,OAAO,KAAK,MAAM,GAAG;AACxB,iBAAO;AAAA,QACT;AACA,YAAI,OAAO,QAAQ;AACjB,iBAAO,SAAS,SAAS,QAAQ,OAAO,MAAM;AAAA,QAChD;AACA,YAAI,OAAO,WAAW;AACpB,iBAAO,YAAY,SAAS,QAAQ,OAAO,SAAS;AAAA,QACtD;AACA,eAAO;AAAA,MACT,GAZqB;AAcrB,UAAI,OAAO,UAAU,SAAS,MAAM;AAGpC,UAAI,CAAC,MAAM;AACT,YAAI,YAAY,SAAS,GAAG;AAC1B,iBAAO;AAAA,QACT;AACA,eAAO,MAAM,YAAY,IAAI;AAC7B,eAAO,MAAM,YAAY,IAAI;AAC7B,eAAO,SAAS,CAAC,OAAO,KAAK,OAAO,GAAG,EAAE,KAAK,GAAG;AACjD,YAAI,YAAY,QAAQ;AACtB,iBAAO,YAAY,YAAY,IAAI;AAAA,QACrC;AACA,eAAO,eAAe;AAAA,MACxB;AAGA,aAAO,SAAS;AAEhB,UAAI,WAAW,KAAK,OAAO,MAAM,GAAG;AACpC,UAAI,eAAe,YAAY,MAAM,GAAG,YAAY,SAAS,SAAS,MAAM;AAE5E,UAAI,KAAK,WAAW;AAClB,qBAAa,KAAK,SAAS,MAAM,CAAC;AAAA,MACpC;AAEA,aAAO,MAAM,SAAS,KAAK,GAAG;AAE9B,UAAI,CAAC,aAAa,QAAQ;AACxB,eAAO,eAAe;AAAA,MACxB;AAEA,UAAI,KAAK,UAAU;AACjB,iBAAS,QAAQ,aAAa,IAAI,CAAC;AACnC,eAAO,MAAM,SAAS,KAAK,GAAG;AAAA,MAChC;AAEA,UAAI,CAAC,aAAa,QAAQ;AACxB,eAAO,eAAe;AAAA,MACxB;AAEA,aAAO,MAAM,aAAa,IAAI;AAC9B,aAAO,SAAS,CAAC,OAAO,KAAM,OAAO,GAAG,EAAE,KAAK,GAAG;AAElD,UAAI,aAAa,QAAQ;AACvB,eAAO,YAAY,aAAa,KAAK,GAAG;AAAA,MAC1C;AAEA,aAAO,eAAe;AAAA,IACxB;AAMA,YAAQ,MAAM,SAAU,QAAQ;AAE9B,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AACA,aAAO,QAAQ,MAAM,MAAM,EAAE,UAAU;AAAA,IACzC;AAMA,YAAQ,UAAU,SAAU,QAAQ;AAElC,UAAI,SAAS,QAAQ,MAAM,MAAM;AACjC,aAAO,QAAQ,OAAO,UAAU,OAAO,MAAM;AAAA,IAC/C;AAAA;AAAA;;;AC5QA;AAAA;AAAA;AA+BA,QAAM,MAAM;AAGZ,QAAM,sBAAsB;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAM,4BAA4B,CAAC,aAAa,SAAS;AAEzD,aAAS,gBAAgB,QAAQ,UAAU,CAAC,GAAG;AAC7C,YAAM,cAAc,OAAO,MAAM,GAAG;AACpC,YAAM,iBAAiB,YAAY,YAAY,SAAS,CAAC;AACzD,YAAM,wBAAwB,CAAC,CAAC,QAAQ;AACxC,YAAM,cAAc,CAAC,CAAC,QAAQ;AAE9B,UAAI,yBAAyB,oBAAoB,SAAS,cAAc,GAAG;AACzE,YAAI,YAAY,SAAS,GAAG;AAC1B,gBAAM,oBAAoB,YAAY,YAAY,SAAS,CAAC;AAE5D,iBAAO,GAAG,iBAAiB,IAAI,cAAc;AAAA,QAC/C,WAAW,0BAA0B,SAAS,cAAc,GAAG;AAI7D,iBAAO,GAAG,cAAc;AAAA,QAC1B;AAAA,MACF;AAEA,UAAI,CAAC,eAAe,oBAAoB,SAAS,cAAc,GAAG;AAChE,cAAM,IAAI;AAAA,UACR,+CAA+C,cAAc;AAAA,QAC/D;AAAA,MACF;AAEA,aAAO,IAAI,IAAI,MAAM;AAAA,IACvB;AA1BS;AA4BT,YAAQ,kBAAkB;AAAA;AAAA;;;ACxE1B;AAAA;AAAA;AAiCA,QAAM,QAAN,MAAY;AAAA,MAjCZ,OAiCY;AAAA;AAAA;AAAA,MACV,cAAc;AACZ,aAAK,cAAc;AAAA,MACrB;AAAA,MAEA,WAAW,QAAQ,MAAM,KAAK,IAAI;AAChC,cAAM,IAAI,MAAM,+BAA+B;AAAA,MACjD;AAAA,MAEA,YAAY,QAAQ,MAAM,uBAAuB,IAAI;AACnD,cAAM,IAAI,MAAM,gCAAgC;AAAA,MAClD;AAAA,MAEA,UAAU,QAAQ,IAAI;AACpB,cAAM,IAAI,MAAM,8BAA8B;AAAA,MAChD;AAAA,MAEA,aAAa,WAAW,WAAW,IAAI;AAGrC,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AAAA,MAEA,aAAa,QAAQ,MAAM,KAAK,IAAI;AAClC,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AAAA,MAEA,cAAc,QAAQ,MAAM,IAAI;AAC9B,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACpD;AAAA,MAEA,iBAAiB,IAAI;AACnB,cAAM,IAAI,MAAM,qCAAqC;AAAA,MACvD;AAAA,MAEA,cAAc,IAAI;AAChB,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,YAAQ,QAAQ;AAAA;AAAA;;;AC3EhB;AAAA;AAAA;AAEA,YAAQ,eAAe,SAAU,IAAI;AACnC,aAAO,OAAO,eAAe,WAAY;AACvC,YAAI,OAAO,UAAU,UAAU,SAAS,CAAC,MAAM,WAAY,IAAG,MAAM,MAAM,SAAS;AAAA,aAC9E;AACH,iBAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AACtC,sBAAU,UAAU,MAAM,IAAI,CAAC,KAAK,QAAQ;AAC1C,kBAAI,IAAK,QAAO,OAAO,GAAG;AAC1B,sBAAQ,GAAG;AAAA,YACb;AACA,sBAAU;AACV,eAAG,MAAM,MAAM,SAAS;AAAA,UAC1B,CAAC;AAAA,QACH;AAAA,MACF,GAAG,QAAQ,EAAE,OAAO,GAAG,KAAK,CAAC;AAAA,IAC/B;AAEA,YAAQ,cAAc,SAAU,IAAI;AAClC,aAAO,OAAO,eAAe,WAAY;AACvC,cAAM,KAAK,UAAU,UAAU,SAAS,CAAC;AACzC,YAAI,OAAO,OAAO,WAAY,QAAO,GAAG,MAAM,MAAM,SAAS;AAAA,aACxD;AACH,iBAAO,UAAU,UAAU,SAAS,CAAC;AACrC,oBAAU;AACV,aAAG,MAAM,MAAM,SAAS,EAAE,KAAK,OAAK,GAAG,MAAM,CAAC,GAAG,EAAE;AAAA,QACrD;AAAA,MACF,GAAG,QAAQ,EAAE,OAAO,GAAG,KAAK,CAAC;AAAA,IAC/B;AAAA;AAAA;;;AC5BA;AAAA;AAAA;AA+BA,QAAM,YAAY;AAKlB,aAAS,cAAc,QAAQ,uBAAuB;AACpD,YAAM,SAAS,UAAU,gBAAgB,QAAQ;AAAA,QAC/C;AAAA,MACF,CAAC;AAED,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AACA,UAAI,UAAU,QAAQ;AACpB,eAAO,CAAC,MAAM;AAAA,MAChB;AAGA,UAAI,OAAO,MAAM,EAAE,KAAK,KAAK;AAC3B,iBAAS,OAAO,MAAM,GAAG,EAAE;AAAA,MAC7B;AAEA,YAAM,SAAS,OAAO,MAAM,GAAG,EAAE,OAAO,SAAS,EAAE;AACnD,YAAM,QAAQ,OAAO,MAAM,GAAG,EAAE,QAAQ;AACxC,UAAI,MAAM;AACV,YAAM,eAAe,CAAC,GAAG;AACzB,aAAO,MAAM,QAAQ;AACnB,cAAM,GAAG,MAAM,MAAM,CAAC,IAAI,GAAG;AAC7B,qBAAa,KAAK,GAAG;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AA1BS;AA4BT,YAAQ,gBAAgB;AAAA;AAAA;;;AChExB;AAAA;AAAA;AAmCA,aAAS,UAAU,SAAS,YAAY;AAEtC,UAAI,eAAe,SAAS;AAC1B,eAAO;AAAA,MACT;AAEA,YAAM,MAAM,QAAQ,QAAQ,UAAU;AACtC,UAAI,QAAQ,GAAG;AAGb,YAAI,WAAW,OAAO,EAAE,MAAM,KAAK;AACjC,iBAAO;AAAA,QACT;AAKA,YAAI,QAAQ,OAAO,WAAW,QAAQ,CAAC,MAAM,KAAK;AAChD,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAvBS;AAyBT,YAAQ,YAAY;AAAA;AAAA;;;AC5DpB;AAAA;AAAA;AAAA,aAAS,cAAc;AACrB,UAAI;AAEF,eAAO,UAAQ,MAAM;AAAA,MACvB,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AAPS;AAUT,aAAS,4BAA4B;AACnC,aAAO,OAAO,IAAI,4BAA4B;AAAA,IAChD;AAFS;AAKT,aAAS,sCAAsC,SAAS;AACtD,YAAM,eAAe,QAAQ,eAAe;AAC5C,YAAM,OAAO,aAAa;AAC1B,aAAO,OAAO,KAAK,QAAQ,SAAS;AAAA,IACtC;AAJS;AAMT,YAAQ,iBAAiB,gCAAS,eAAe,UAAU,UAAU,CAAC,GAAG;AACvE,YAAM,eAAe,QAAQ,eAAe;AAC5C,YAAM,OAAO,aAAa;AAC1B,aAAO,gCAAS,QAAQ,OAAO,YAAY,OAAO;AAChD,eAAO,OAAO,KAAK,QAAQ,OAAO,YAAY,KAAK,IAAI,SAAS,KAAK;AAAA,MACvE,GAFO;AAAA,IAGT,GANyB;AAQzB,YAAQ,yBAAyB,gCAAS,uBAAuB,UAAU,CAAC,GAAG;AAC7E,YAAM,6BACJ,QAAQ,6BAA6B;AAGvC,aACE,2BAA2B,KAC3B,sCAAsC,OAAO;AAAA,IAEjD,GATiC;AAAA;AAAA;;;AC7BjC;AAAA;AAAA;AA+BA,QAAM,EAAE,aAAa,IAAI;AACzB,QAAM,QAAQ,gBAAmB;AACjC,QAAM,gBAAgB,wBAA2B;AACjD,QAAM,YAAY,oBAAuB;AACzC,QAAM,EAAE,wBAAwB,eAAe,IAAI;AAEnD,QAAM,oBAAN,cAAgC,MAAM;AAAA,MArCtC,OAqCsC;AAAA;AAAA;AAAA,MACpC,cAAc;AACZ,cAAM;AACN,aAAK,cAAc;AACnB,aAAK,MAAM,uBAAO,OAAO,IAAI;AAC7B,cAAM,sBAAsB,uBAAuB;AACnD,YAAI,qBAAqB;AACvB,eAAK,mBAAmB,IAAI,KAAK;AAAA,QACnC;AAAA,MACF;AAAA,MAEA,UAAU;AACR,cAAM,OAAO,EAAE,SAAS,eAAe,eAAe,EAAE;AACxD,eAAO,UAAU,KAAK,QAAQ,KAAK,KAAK,OAAO,CAAC,CAAC;AAAA,MACnD;AAAA,MAEA,WAAW,QAAQ,MAAM,KAAK,IAAI;AAChC,YAAI,CAAC,KAAK,IAAI,MAAM,GAAG;AACrB,iBAAO,GAAG,MAAM,MAAS;AAAA,QAC3B;AACA,YAAI,CAAC,KAAK,IAAI,MAAM,EAAE,IAAI,GAAG;AAC3B,iBAAO,GAAG,MAAM,MAAS;AAAA,QAC3B;AACA,eAAO,GAAG,MAAM,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,IAAI;AAAA,MACrD;AAAA,MACA,YAAY,QAAQ,MAAM,uBAAuB,IAAI;AACnD,cAAM,UAAU,CAAC;AACjB,YAAI,OAAO,0BAA0B,YAAY;AAC/C,eAAK;AACL,kCAAwB;AAAA,QAC1B;AACA,YAAI,CAAC,QAAQ;AACX,iBAAO,GAAG,MAAM,CAAC,CAAC;AAAA,QACpB;AAEA,YAAI;AACJ,YAAI,CAAC,MAAM;AAET,wBAAc,gCAAS,SAAS,aAAa;AAC3C,uBAAW,WAAW,aAAa;AACjC,oBAAM,YAAY,YAAY,OAAO;AACrC,yBAAW,OAAO,WAAW;AAC3B,wBAAQ,KAAK,UAAU,GAAG,CAAC;AAAA,cAC7B;AAAA,YACF;AAAA,UACF,GAPc;AAAA,QAQhB,OAAO;AACL,wBAAc,gCAAS,SAAS,aAAa;AAG3C,mBAAO,KAAK,WAAW,EAAE,QAAQ,gBAAc;AAC7C,kBAAI,UAAU,MAAM,UAAU,GAAG;AAC/B,sBAAM,YAAY,YAAY,UAAU;AACxC,2BAAW,OAAO,WAAW;AAC3B,0BAAQ,KAAK,UAAU,GAAG,CAAC;AAAA,gBAC7B;AAAA,cACF;AAAA,YACF,CAAC;AAAA,UACH,GAXc;AAAA,QAYhB;AAEA,cAAM,UAAU,cAAc,QAAQ,qBAAqB,KAAK,CAAC,MAAM;AACvE,cAAM,MAAM,KAAK;AACjB,gBAAQ,QAAQ,eAAa;AAC3B,gBAAM,cAAc,IAAI,SAAS;AACjC,cAAI,CAAC,aAAa;AAChB;AAAA,UACF;AACA,sBAAY,WAAW;AAAA,QACzB,CAAC;AAED,WAAG,MAAM,OAAO;AAAA,MAClB;AAAA,MAEA,UAAU,QAAQ,IAAI;AACpB,YAAI,CAAC,KAAK,IAAI,OAAO,MAAM,GAAG;AAC5B,eAAK,IAAI,OAAO,MAAM,IAAI,uBAAO,OAAO,IAAI;AAAA,QAC9C;AACA,YAAI,CAAC,KAAK,IAAI,OAAO,MAAM,EAAE,OAAO,IAAI,GAAG;AACzC,eAAK,IAAI,OAAO,MAAM,EAAE,OAAO,IAAI,IAAI,uBAAO,OAAO,IAAI;AAAA,QAC3D;AACA,aAAK,IAAI,OAAO,MAAM,EAAE,OAAO,IAAI,EAAE,OAAO,GAAG,IAAI;AACnD,WAAG,IAAI;AAAA,MACT;AAAA,MACA,aAAa,WAAW,WAAW,IAAI;AAIrC,aAAK,UAAU,WAAW,EAAE;AAAA,MAC9B;AAAA,MACA,aAAa,QAAQ,MAAM,KAAK,IAAI;AAClC,YACE,KAAK,IAAI,MAAM,KACf,KAAK,IAAI,MAAM,EAAE,IAAI,KACrB,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG,GAC1B;AACA,iBAAO,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG;AAAA,QACnC;AACA,WAAG,IAAI;AAAA,MACT;AAAA,MACA,cAAc,QAAQ,MAAM,IAAI;AAC9B,YAAI,KAAK,IAAI,MAAM,GAAG;AACpB,cAAI,MAAM;AACR,mBAAO,KAAK,IAAI,MAAM,EAAE,IAAI;AAAA,UAC9B,OAAO;AACL,mBAAO,KAAK,IAAI,MAAM;AAAA,UACxB;AAAA,QACF;AACA,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,MACA,iBAAiB,IAAI;AACnB,aAAK,MAAM,uBAAO,OAAO,IAAI;AAC7B,eAAO,GAAG,IAAI;AAAA,MAChB;AAAA,MACA,cAAc,IAAI;AAChB,cAAM,UAAU,CAAC;AACjB,cAAM,MAAM,KAAK;AAEjB,cAAM,UAAU,OAAO,KAAK,GAAG;AAC/B,gBAAQ,QAAQ,YAAU;AACxB,gBAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,CAAC;AACrC,gBAAM,QAAQ,UAAQ;AACpB,kBAAM,OAAO,OAAO,KAAK,IAAI,MAAM,EAAE,IAAI,CAAC;AAC1C,iBAAK,QAAQ,SAAO;AAClB,kBAAI,QAAQ,MAAM;AAChB,wBAAQ,KAAK,IAAI,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC;AAAA,cACrC;AAAA,YACF,CAAC;AAAA,UACH,CAAC;AAAA,QACH,CAAC;AAID,gBAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,kBAAQ,EAAE,iBAAiB,MAAM,EAAE,iBAAiB;AAAA,QACtD,CAAC;AAED,WAAG,MAAM,OAAO;AAAA,MAClB;AAAA,IACF;AAEA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,QAAQ,UAAQ;AAChB,wBAAkB,UAAU,IAAI,IAAI;AAAA,QAClC,kBAAkB,UAAU,IAAI;AAAA,MAClC;AAAA,IACF,CAAC;AAED,YAAQ,oBAAoB;AAE5B,aAAS,gBAAgB,KAAK;AAC5B,YAAM,UAAU,OAAO,KAAK,GAAG;AAC/B,UAAI,QAAQ,WAAW,GAAG;AACxB,eAAO;AAAA,MACT;AACA,UAAI,SAAS;AACb,aAAO,KAAK,GAAG,EAAE,QAAQ,CAAC,QAAQ,MAAM;AACtC,kBAAU,aAAa,QAAQ,IAAI,MAAM,CAAC;AAC1C,YAAI,IAAI,QAAQ,SAAS,GAAG;AAC1B,oBAAU;AAAA,QACZ;AACA,kBAAU;AAAA,MACZ,CAAC;AACD,gBAAU;AACV,aAAO;AAAA,IACT;AAfS;AAiBT,aAAS,aAAa,YAAY,aAAa;AAC7C,YAAM,SAAS;AACf,UAAI,SAAS,GAAG,MAAM,IAAI,UAAU;AAAA;AACpC,aAAO,KAAK,WAAW,EAAE,QAAQ,CAAC,MAAM,GAAG,UAAU;AACnD,kBAAU,WAAW,MAAM,YAAY,IAAI,CAAC;AAC5C,YAAI,IAAI,MAAM,SAAS,GAAG;AACxB,oBAAU;AAAA,QACZ;AACA,kBAAU;AAAA,MACZ,CAAC;AACD,gBAAU,GAAG,MAAM;AACnB,aAAO;AAAA,IACT;AAZS;AAcT,aAAS,WAAW,UAAU,WAAW;AACvC,YAAM,SAAS;AACf,UAAI,SAAS,GAAG,MAAM,IAAI,QAAQ;AAAA;AAClC,aAAO,KAAK,SAAS,EAAE,QAAQ,CAAC,YAAY,GAAG,gBAAgB;AAC7D,cAAM,SAAS,UAAU,UAAU;AACnC,kBAAU,SAAS,UAAU,KAAK,OAAO,QAAQ,CAAC;AAClD,YAAI,IAAI,YAAY,SAAS,GAAG;AAC9B,oBAAU;AAAA,QACZ;AACA,kBAAU;AAAA,MACZ,CAAC;AACD,gBAAU,GAAG,MAAM;AACnB,aAAO;AAAA,IACT;AAbS;AAeT,YAAQ,kBAAkB;AAAA;AAAA;;;ACjP1B;AAAA;AAAA;AA+BA,QAAM,WAAW,OAAO,UAAU;AAElC,aAAS,WAAW,MAAM;AACxB,aAAO,OAAO,SAAS;AAAA,IACzB;AAFS;AAIT,aAAS,iBAAiB,MAAM;AAC9B,aAAOC,UAAS,IAAI,KAAK,SAAS;AAAA,IACpC;AAFS;AAIT,aAAS,OAAO,MAAM;AACpB,aAAO,iBAAiB,MAAM,IAAI,KAAKC,WAAU,KAAK,QAAQ,CAAC;AAAA,IACjE;AAFS;AAIT,aAAS,cAAc,MAAM;AAC3B,aAAO,SAAS,MAAO,gBAAgB,UAAU,KAAK,SAAS,MAAM;AAAA,IACvE;AAFS;AAIT,aAASD,UAAS,MAAM;AACtB,aAAO,OAAO,SAAS,YAAY,gBAAgB;AAAA,IACrD;AAFS,WAAAA,WAAA;AAIT,aAASE,UAAS,MAAM;AACtB,aAAO,SAAS,KAAK,IAAI,MAAM;AAAA,IACjC;AAFS,WAAAA,WAAA;AAGT,aAAS,iBAAiB,MAAM,WAAW;AACzC,UAAI;AACF,eAAO,gBAAgB;AAAA,MACzB,SAASC,QAAO;AACd,eAAO;AAAA,MACT;AAAA,IACF;AANS;AAQT,aAAS,oBAAoB,MAAM;AACjC,aACE,iBAAiB,IAAI,KACpBD,UAAS,IAAI,KACZ,cAAc,QACd,cAAc,QACd,cAAc,QAChB,iBAAiB,MAAM,GAAG;AAAA,IAE9B;AATS;AAWT,aAASD,WAAU,MAAM;AACvB,aAAO,OAAO,SAAS,YAAY,OAAO,MAAM;AAAA,IAClD;AAFS,WAAAA,YAAA;AAKT,aAAS,SAAS,MAAM,IAAI,SAAS;AACnC,UAAI,CAAC,WAAW,EAAE,GAAG;AACnB,kBAAU;AACV,aAAK;AAAA,MACP;AACA,UAAI,CAACC,UAAS,OAAO,EAAG,WAAU,EAAE,OAAO,eAAe;AAC1D,UAAI,CAAC,MAAM;AACT,YAAI,IAAI;AACN,aAAG,IAAI,eAAe,OAAO,CAAC;AAAA,QAChC,OAAO;AACL,gBAAM,IAAI,eAAe,OAAO;AAAA,QAClC;AAAA,MACF;AAAA,IACF;AAbS;AAeT,QAAM,iBAAN,cAA6B,MAAM;AAAA,MA/FnC,OA+FmC;AAAA;AAAA;AAAA,MACjC,eAAe,QAAQ;AACrB,cAAM,GAAG,MAAM;AAAA,MACjB;AAAA,IACF;AAEA,YAAQ,iBAAiB;AACzB,YAAQ,aAAa;AACrB,YAAQ,mBAAmB;AAC3B,YAAQ,SAAS;AACjB,YAAQ,gBAAgB;AACxB,YAAQ,WAAWF;AACnB,YAAQ,WAAWE;AACnB,YAAQ,sBAAsB;AAC9B,YAAQ,WAAW;AAAA;AAAA;;;AC7GnB;AAAA;AAAA;AACA,WAAO,UAAU;AAAA;AAAA;;;ACDjB;AAAA;AAAA;AA+BA,QAAME,YAAW;AACjB,QAAM,WAAW;AACjB,QAAM,YAAY;AAClB,QAAM,QAAQ,gBAAmB;AACjC,QAAM,oBAAoB,mBAAsB;AAChD,QAAM,YAAY,oBAAuB;AACzC,QAAM,aAAa;AACnB,QAAM,UAAU;AAChB,QAAM,EAAE,aAAa,IAAI;AACzB,QAAM,EAAE,uBAAuB,IAAI;AAInC,QAAM,gBAAgB;AAEtB,QAAM,gBAAgB;AAKtB,QAAM,cAAc,CAAC,MAAM,MAAM,IAAI;AAIrC,QAAM,aAAa;AAInB,QAAM,aAAa;AAEnB,QAAM,eAAe;AAAA,MACnB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,IACP;AAEA,QAAM,WAAW;AACjB,QAAM,WAAW;AACjB,QAAM,4BACJ;AAEF,aAAS,qBAAqB,OAAO;AACnC,iBAAW,SAAS,WAAW,iBAAiB,KAAK,GAAG,KAAK;AAC7D,YAAM,UAAU,OAAO,KAAK,EAAE,YAAY;AAC1C,UAAI,YAAY,UAAU,YAAY,SAAS,YAAY,UAAU;AACnE,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AARS;AAUT,QAAM,qBAAqB,OAAO,OAAO;AAAA,MACvC,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,UAAU;AAAA,IACZ,CAAC;AAMD,QAAM,qBAAqB;AAC3B,QAAM,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYjB,QAAQ,gBAAgB,EAAE,EAC1B,QAAQ,OAAO,EAAE,EACjB,KAAK;AACR,QAAM,qBAAqB,IAAI,OAAO,IAAI,WAAW,GAAG;AAYxD,aAAS,YAAY,OAAO,WAAW,WAAW,YAAY;AAC5D,UAAI,QAAQ;AACZ,aAAO,QAAQ,MAAM,QAAQ;AAC3B,cAAM,IAAI,MAAM,WAAW,KAAK;AAEhC,YAAI,KAAK,MAAQ,KAAK,IAAM;AAC1B;AAAA,QACF;AACA;AAAA,MACF;AAGA,UAAI,QAAQ,aAAa,QAAQ,WAAW;AAC1C,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,cAAc,SAAS,MAAM,QAAQ;AACxC,eAAO;AAAA,MACT;AAEA,aAAO,SAAS,MAAM,OAAO,GAAG,KAAK,GAAG,EAAE;AAAA,IAC5C;AArBS;AAuBT,aAAS,UAAU,OAAO;AACxB,YAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,YAAM,SAAS,CAAC,GAAG,GAAG,CAAC;AAQvB,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAI1B,cAAM,aAAa,KAAK;AACxB,cAAM,MAAM,YAAY,MAAM,CAAC,GAAG,GAAG,GAAG,UAAU;AAClD,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACT;AACA,eAAO,CAAC,IAAI;AAAA,MACd;AAEA,aAAO;AAAA,IACT;AA3BS;AA6BT,aAAS,WAAW,OAAO;AACzB,cAAQ,OAAO,KAAK,EACjB,OAAO,GAAG,CAAC,EACX,YAAY;AACf,YAAM,MAAM,aAAa,KAAK;AAC9B,aAAO,OAAO,IAAI,MAAM;AAAA,IAC1B;AANS;AAWT,aAAS,UAAU,KAAK;AACtB,UAAI,CAAC,KAAK;AACR;AAAA,MACF;AAMA,YAAM,SAAS,IAAI,MAAM,UAAU;AACnC,UAAI,CAAC,QAAQ;AACX;AAAA,MACF;AAEA,UAAI,OAAO;AACX,UAAI,SAAS;AACb,UAAI,SAAS;AACb,UAAI,aAAa;AACjB,UAAI,QAAQ;AACZ,UAAI,OAAO;AAEX,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,QAAQ,OAAO,CAAC,EAAE,KAAK;AAC7B,YAAI,CAAC,MAAM,QAAQ;AACjB;AAAA,QACF;AAEA,YAAI;AAQJ,YAAI,WAAW,MAAM;AACnB,mBAAS,UAAU,KAAK;AACxB,cAAI,QAAQ;AACV,mBAAO,OAAO,CAAC;AACf,qBAAS,OAAO,CAAC;AACjB,qBAAS,OAAO,CAAC;AACjB;AAAA,UACF;AAAA,QACF;AAOA,YAAI,eAAe,MAAM;AAEvB,mBAAS,YAAY,OAAO,GAAG,GAAG,IAAI;AACtC,cAAI,WAAW,MAAM;AACnB,yBAAa;AACb;AAAA,UACF;AAAA,QACF;AAOA,YAAI,UAAU,MAAM;AAClB,mBAAS,WAAW,KAAK;AACzB,cAAI,WAAW,MAAM;AACnB,oBAAQ;AACR;AAAA,UACF;AAAA,QACF;AAOA,YAAI,SAAS,MAAM;AAEjB,mBAAS,YAAY,OAAO,GAAG,GAAG,IAAI;AACtC,cAAI,WAAW,MAAM;AACnB,mBAAO;AAOP,gBAAI,QAAQ,MAAM,QAAQ,IAAI;AAC5B,sBAAQ;AAAA,YACV,WAAW,QAAQ,KAAK,QAAQ,IAAI;AAClC,sBAAQ;AAAA,YACV;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAeA,UACE,eAAe,QACf,UAAU,QACV,SAAS,QACT,WAAW,QACX,aAAa,KACb,aAAa,MACb,OAAO,QACP,OAAO,MACP,SAAS,MACT,SAAS,IACT;AACA;AAAA,MACF;AAEA,aAAO,IAAI,KAAK,KAAK,IAAI,MAAM,OAAO,YAAY,MAAM,QAAQ,MAAM,CAAC;AAAA,IACzE;AA9HS;AAgIT,aAAS,WAAW,MAAM;AACxB,iBAAW,SAAS,WAAW,OAAO,IAAI,GAAG,IAAI;AACjD,aAAO,KAAK,YAAY;AAAA,IAC1B;AAHS;AAMT,aAAS,gBAAgB,KAAK;AAC5B,UAAI,OAAO,MAAM;AACf,eAAO;AAAA,MACT;AACA,YAAM,IAAI,KAAK,EAAE,QAAQ,OAAO,EAAE;AAElC,UAAI,mBAAmB,KAAK,GAAG,GAAG;AAChC,cAAM,IAAI,QAAQ,KAAK,EAAE,EAAE,QAAQ,KAAK,EAAE;AAAA,MAC5C;AAGA,UAAIA,aAAY,mBAAmB,KAAK,GAAG,GAAG;AAC5C,cAAMA,UAAS,QAAQ,GAAG;AAAA,MAC5B;AAEA,aAAO,IAAI,YAAY;AAAA,IACzB;AAhBS;AAmBT,aAAS,YAAY,KAAK,QAAQ,cAAc;AAC9C,UAAI,OAAO,QAAQ,UAAU,MAAM;AACjC,eAAO;AAAA,MACT;AACA,UAAI,iBAAiB,OAAO;AAC1B,cAAM,gBAAgB,GAAG;AACzB,iBAAS,gBAAgB,MAAM;AAAA,MACjC;AAWA,UAAI,OAAO,QAAQ;AACjB,eAAO;AAAA,MACT;AAKA,YAAM,MAAM,IAAI,YAAY,MAAM;AAClC,UAAI,OAAO,GAAG;AACZ,eAAO;AAAA,MACT;AAKA,UAAI,IAAI,WAAW,OAAO,SAAS,KAAK;AACtC,eAAO;AAAA,MACT;AAIA,UAAI,IAAI,OAAO,MAAM,GAAG,CAAC,MAAM,KAAK;AAClC,eAAO;AAAA,MACT;AAGA,UAAI,mBAAmB,KAAK,GAAG,GAAG;AAChC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAjDS;AA2DT,aAAS,YAAY,MAAM;AAGzB,UAAI,CAAC,QAAQ,KAAK,OAAO,GAAG,CAAC,MAAM,KAAK;AACtC,eAAO;AAAA,MACT;AAIA,UAAI,SAAS,KAAK;AAChB,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,KAAK,YAAY,GAAG;AACvC,UAAI,eAAe,GAAG;AACpB,eAAO;AAAA,MACT;AAIA,aAAO,KAAK,MAAM,GAAG,UAAU;AAAA,IACjC;AArBS;AAuBT,aAAS,eAAe,KAAK;AAC3B,UAAI,WAAW,cAAc,GAAG,EAAG,QAAO;AAC1C,eAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,cAAM,gBAAgB,IAAI,QAAQ,YAAY,CAAC,CAAC;AAChD,YAAI,kBAAkB,IAAI;AACxB,gBAAM,IAAI,OAAO,GAAG,aAAa;AAAA,QACnC;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAVS;AAYT,aAAS,gBAAgB,YAAY,WAAW;AAC9C,mBAAa,eAAe,UAAU;AACtC,iBAAW,SAAS,WAAW,SAAS,UAAU,GAAG,UAAU;AAE/D,UAAI,UAAU,WAAW,QAAQ,GAAG;AACpC,UAAI,WAAW;AACb,YAAI,YAAY,GAAG;AAEjB,uBAAa,WAAW,OAAO,CAAC;AAChC,oBAAU,WAAW,QAAQ,GAAG;AAAA,QAClC;AAAA,MACF,OAAO;AAEL,YAAI,WAAW,GAAG;AAEhB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,YAAY;AAChB,UAAI,WAAW,GAAG;AAChB,qBAAa;AACb,sBAAc,WAAW,KAAK;AAAA,MAChC,OAAO;AACL,qBAAa,WAAW,OAAO,GAAG,OAAO,EAAE,KAAK;AAChD,sBAAc,WAAW,OAAO,UAAU,CAAC,EAAE,KAAK;AAAA,MACpD;AAEA,UAAI,cAAc,KAAK,UAAU,KAAK,cAAc,KAAK,WAAW,GAAG;AACrE;AAAA,MACF;AAEA,YAAM,IAAI,IAAI,OAAO;AACrB,QAAE,MAAM;AACR,QAAE,QAAQ;AACV,aAAO;AAAA,IACT;AApCS;AAsCT,aAASC,OAAM,KAAK,SAAS;AAC3B,UAAI,CAAC,WAAW,OAAO,YAAY,UAAU;AAC3C,kBAAU,CAAC;AAAA,MACb;AAEA,UAAI,WAAW,cAAc,GAAG,KAAK,CAAC,WAAW,SAAS,GAAG,GAAG;AAC9D,eAAO;AAAA,MACT;AAEA,YAAM,IAAI,KAAK;AAGf,YAAM,YAAY,IAAI,QAAQ,GAAG;AACjC,YAAM,aAAa,cAAc,KAAK,MAAM,IAAI,OAAO,GAAG,SAAS;AACnE,YAAM,IAAI,gBAAgB,YAAY,CAAC,CAAC,QAAQ,KAAK;AACrD,UAAI,CAAC,GAAG;AACN;AAAA,MACF;AAEA,UAAI,cAAc,IAAI;AACpB,eAAO;AAAA,MACT;AAKA,YAAM,WAAW,IAAI,MAAM,YAAY,CAAC,EAAE,KAAK;AAI/C,UAAI,SAAS,WAAW,GAAG;AACzB,eAAO;AAAA,MACT;AAUA,YAAM,aAAa,SAAS,MAAM,GAAG;AACrC,aAAO,WAAW,QAAQ;AACxB,cAAM,KAAK,WAAW,MAAM,EAAE,KAAK;AACnC,YAAI,GAAG,WAAW,GAAG;AAEnB;AAAA,QACF;AACA,cAAM,SAAS,GAAG,QAAQ,GAAG;AAC7B,YAAI,QAAQ;AAEZ,YAAI,WAAW,IAAI;AACjB,mBAAS;AACT,qBAAW;AAAA,QACb,OAAO;AACL,mBAAS,GAAG,OAAO,GAAG,MAAM;AAC5B,qBAAW,GAAG,OAAO,SAAS,CAAC;AAAA,QACjC;AAEA,iBAAS,OAAO,KAAK,EAAE,YAAY;AAEnC,YAAI,UAAU;AACZ,qBAAW,SAAS,KAAK;AAAA,QAC3B;AAEA,gBAAQ,QAAQ;AAAA,UACd,KAAK;AACH,gBAAI,UAAU;AACZ,oBAAM,MAAM,UAAU,QAAQ;AAG9B,kBAAI,KAAK;AAGP,kBAAE,UAAU;AAAA,cACd;AAAA,YACF;AACA;AAAA,UAEF,KAAK;AACH,gBAAI,UAAU;AAIZ,kBAAI,aAAa,KAAK,QAAQ,GAAG;AAC/B,sBAAM,QAAQ,SAAS,UAAU,EAAE;AAGnC,kBAAE,UAAU,KAAK;AAAA,cACnB;AAAA,YACF;AACA;AAAA,UAEF,KAAK;AAGH,gBAAI,UAAU;AAGZ,oBAAM,SAAS,SAAS,KAAK,EAAE,QAAQ,OAAO,EAAE;AAChD,kBAAI,QAAQ;AAEV,kBAAE,SAAS,OAAO,YAAY;AAAA,cAChC;AAAA,YACF;AACA;AAAA,UAEF,KAAK;AAWH,cAAE,OAAO,YAAY,SAAS,CAAC,MAAM,MAAM,WAAW;AACtD;AAAA,UAEF,KAAK;AAMH,cAAE,SAAS;AACX;AAAA,UAEF,KAAK;AACH,cAAE,WAAW;AACb;AAAA,UAEF,KAAK;AACH,kBAAM,cAAc,WAAW,SAAS,YAAY,IAAI;AACxD,oBAAQ,aAAa;AAAA,cACnB,KAAK;AACH,kBAAE,WAAW;AACb;AAAA,cACF,KAAK;AACH,kBAAE,WAAW;AACb;AAAA,cACF,KAAK;AACH,kBAAE,WAAW;AACb;AAAA,cACF;AACE,kBAAE,WAAW;AACb;AAAA,YACJ;AACA;AAAA,UAEF;AACE,cAAE,aAAa,EAAE,cAAc,CAAC;AAChC,cAAE,WAAW,KAAK,EAAE;AACpB;AAAA,QACJ;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAjKS,WAAAA,QAAA;AA0KT,aAAS,2BAA2B,QAAQ;AAC1C,iBAAW,SAAS,WAAW,SAAS,MAAM,GAAG,MAAM;AACvD,aAAO,CAAC,OAAO,IAAI,WAAW,WAAW,KAAK,OAAO;AAAA,IACvD;AAHS;AAgBT,aAAS,yBAAyB,QAAQ;AACxC,iBAAW,SAAS,WAAW,SAAS,MAAM,CAAC;AAC/C,aACE,CAAC,OAAO,IAAI,WAAW,SAAS,KAC/B,OAAO,UACN,OAAO,YACP,OAAO,QAAQ,QACf,OAAO,SAAS;AAAA,IAEtB;AATS;AAYT,aAAS,UAAU,KAAK;AACtB,UAAI;AACJ,UAAI;AACF,cAAM,KAAK,MAAM,GAAG;AAAA,MACtB,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AARS;AAUT,aAAS,SAAS,KAAK;AACrB,UAAI,CAAC,OAAO,WAAW,cAAc,GAAG,GAAG;AACzC,eAAO;AAAA,MACT;AAEA,UAAI;AACJ,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAM,UAAU,GAAG;AACnB,YAAI,eAAe,OAAO;AACxB,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AAEL,cAAM;AAAA,MACR;AAEA,YAAM,IAAI,IAAI,OAAO;AACrB,eAAS,IAAI,GAAG,IAAI,OAAO,uBAAuB,QAAQ,KAAK;AAC7D,cAAM,OAAO,OAAO,uBAAuB,CAAC;AAC5C,YAAI,IAAI,IAAI,MAAM,UAAa,IAAI,IAAI,MAAM,eAAe,IAAI,GAAG;AACjE;AAAA,QACF;AAEA,YAAI,SAAS,aAAa,SAAS,cAAc,SAAS,gBAAgB;AACxE,cAAI,IAAI,IAAI,MAAM,MAAM;AACtB,cAAE,IAAI,IAAI;AAAA,UACZ,OAAO;AACL,cAAE,IAAI,IAAI,IAAI,IAAI,KAAK,aAAa,aAAa,IAAI,KAAK,IAAI,IAAI,CAAC;AAAA,UACrE;AAAA,QACF,OAAO;AACL,YAAE,IAAI,IAAI,IAAI,IAAI;AAAA,QACpB;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAnCS;AA8CT,aAAS,cAAc,GAAG,GAAG;AAC3B,iBAAW,SAAS,WAAW,SAAS,CAAC,GAAG,CAAC;AAC7C,iBAAW,SAAS,WAAW,SAAS,CAAC,GAAG,CAAC;AAC7C,UAAI,MAAM;AAGV,YAAM,WAAW,EAAE,OAAO,EAAE,KAAK,SAAS;AAC1C,YAAM,WAAW,EAAE,OAAO,EAAE,KAAK,SAAS;AAC1C,YAAM,WAAW;AACjB,UAAI,QAAQ,GAAG;AACb,eAAO;AAAA,MACT;AAGA,YAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,QAAQ,IAAI;AAClD,YAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,QAAQ,IAAI;AAClD,YAAM,QAAQ;AACd,UAAI,QAAQ,GAAG;AACb,eAAO;AAAA,MACT;AAGA,YAAM,EAAE,gBAAgB,EAAE;AAE1B,aAAO;AAAA,IACT;AAzBS;AA6BT,aAAS,YAAY,MAAM;AACzB,iBAAW,SAAS,WAAW,SAAS,IAAI,CAAC;AAC7C,UAAI,SAAS,KAAK;AAChB,eAAO,CAAC,GAAG;AAAA,MACb;AACA,YAAM,eAAe,CAAC,IAAI;AAC1B,aAAO,KAAK,SAAS,GAAG;AACtB,cAAM,SAAS,KAAK,YAAY,GAAG;AACnC,YAAI,WAAW,GAAG;AAChB;AAAA,QACF;AACA,eAAO,KAAK,OAAO,GAAG,MAAM;AAC5B,qBAAa,KAAK,IAAI;AAAA,MACxB;AACA,mBAAa,KAAK,GAAG;AACrB,aAAO;AAAA,IACT;AAhBS;AAkBT,aAAS,iBAAiB,KAAK;AAC7B,UAAI,eAAe,QAAQ;AACzB,eAAO;AAAA,MACT;AAGA,UAAI;AACF,cAAM,UAAU,GAAG;AAAA,MACrB,SAAS,KAAK;AAAA,MAEd;AAEA,aAAO,SAAS,GAAG;AAAA,IACrB;AAbS;AAeT,QAAM,iBAAiB;AAAA;AAAA,MAErB,KAAK;AAAA,MACL,OAAO;AAAA,MACP,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,YAAY;AAAA;AAAA,MAEZ,UAAU;AAAA,MACV,eAAe;AAAA,MACf,UAAU;AAAA,MACV,cAAc;AAAA,MACd,UAAU;AAAA,IACZ;AAEA,QAAM,SAAN,MAAM,QAAO;AAAA,MA5yBb,OA4yBa;AAAA;AAAA;AAAA,MACX,YAAY,UAAU,CAAC,GAAG;AACxB,cAAM,sBAAsB,uBAAuB;AACnD,YAAI,qBAAqB;AACvB,eAAK,mBAAmB,IAAI,KAAK;AAAA,QACnC;AAEA,eAAO,OAAO,MAAM,gBAAgB,OAAO;AAC3C,aAAK,WAAW,KAAK,YAAY,oBAAI,KAAK;AAG1C,eAAO,eAAe,MAAM,iBAAiB;AAAA,UAC3C,cAAc;AAAA,UACd,YAAY;AAAA;AAAA,UACZ,UAAU;AAAA,UACV,OAAO,EAAE,QAAO;AAAA,QAClB,CAAC;AAAA,MACH;AAAA,MAEA,UAAU;AACR,cAAM,MAAM,KAAK,IAAI;AACrB,cAAM,WAAW,KAAK,YAAY,OAAO,KAAK,WAAW;AACzD,cAAM,YAAY,KAAK,WACnB,GAAG,MAAM,KAAK,SAAS,QAAQ,CAAC,OAChC;AACJ,cAAM,YAAY,KAAK,eACnB,GAAG,MAAM,KAAK,aAAa,QAAQ,CAAC,OACpC;AACJ,eAAO,WAAW,KAAK,SAAS,CAAC,cAAc,QAAQ,UAAU,SAAS,UAAU,SAAS;AAAA,MAC/F;AAAA,MAEA,SAAS;AACP,cAAM,MAAM,CAAC;AAEb,mBAAW,QAAQ,QAAO,wBAAwB;AAChD,cAAI,KAAK,IAAI,MAAM,eAAe,IAAI,GAAG;AACvC;AAAA,UACF;AAEA,cACE,SAAS,aACT,SAAS,cACT,SAAS,gBACT;AACA,gBAAI,KAAK,IAAI,MAAM,MAAM;AACvB,kBAAI,IAAI,IAAI;AAAA,YACd,OAAO;AACL,kBAAI,IAAI,IACN,KAAK,IAAI,KAAK,aACV,aACA,KAAK,IAAI,EAAE,YAAY;AAAA,YAC/B;AAAA,UACF,WAAW,SAAS,UAAU;AAC5B,gBAAI,KAAK,IAAI,MAAM,MAAM;AAEvB,kBAAI,IAAI,IACN,KAAK,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,YACpC,KAAK,IAAI,EAAE,SAAS,IACpB,KAAK,IAAI;AAAA,YACjB;AAAA,UACF,OAAO;AACL,gBAAI,KAAK,IAAI,MAAM,eAAe,IAAI,GAAG;AACvC,kBAAI,IAAI,IAAI,KAAK,IAAI;AAAA,YACvB;AAAA,UACF;AAAA,QACF;AAEA,eAAO;AAAA,MACT;AAAA,MAEA,QAAQ;AACN,eAAO,SAAS,KAAK,OAAO,CAAC;AAAA,MAC/B;AAAA,MAEA,WAAW;AACT,YAAI,CAAC,cAAc,KAAK,KAAK,KAAK,GAAG;AACnC,iBAAO;AAAA,QACT;AACA,YACE,KAAK,WAAW,YAChB,EAAE,KAAK,mBAAmB,SAC1B,CAAC,UAAU,KAAK,OAAO,GACvB;AACA,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,UAAU,QAAQ,KAAK,UAAU,GAAG;AAC3C,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,QAAQ,QAAQ,CAAC,WAAW,KAAK,KAAK,IAAI,GAAG;AACpD,iBAAO;AAAA,QACT;AAEA,cAAM,UAAU,KAAK,QAAQ;AAC7B,YAAI,SAAS;AACX,cAAI,QAAQ,MAAM,KAAK,GAAG;AACxB,mBAAO;AAAA,UACT;AACA,gBAAM,SAAS,UAAU,gBAAgB,OAAO;AAChD,cAAI,UAAU,MAAM;AAElB,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MAEA,WAAW,KAAK;AACd,YAAI,eAAe,MAAM;AACvB,eAAK,UAAU;AAAA,QACjB,OAAO;AACL,eAAK,UAAU,UAAU,GAAG,KAAK;AAAA,QACnC;AAAA,MACF;AAAA,MAEA,UAAU,KAAK;AACb,YAAI,QAAQ,YAAY,QAAQ,WAAW;AACzC,eAAK,SAAS,IAAI,SAAS;AAAA,QAC7B,OAAO;AACL,eAAK,SAAS;AAAA,QAChB;AAAA,MACF;AAAA,MAEA,eAAe;AACb,YAAI,MAAM,KAAK;AACf,YAAI,OAAO,MAAM;AACf,gBAAM;AAAA,QACR;AACA,YAAI,KAAK,QAAQ,IAAI;AACnB,iBAAO;AAAA,QACT;AACA,eAAO,GAAG,KAAK,GAAG,IAAI,GAAG;AAAA,MAC3B;AAAA;AAAA,MAGA,WAAW;AACT,YAAI,MAAM,KAAK,aAAa;AAE5B,YAAI,KAAK,WAAW,UAAU;AAC5B,cAAI,KAAK,mBAAmB,MAAM;AAChC,mBAAO,aAAa,WAAW,KAAK,OAAO,CAAC;AAAA,UAC9C,OAAO;AACL,mBAAO,aAAa,KAAK,OAAO;AAAA,UAClC;AAAA,QACF;AAEA,YAAI,KAAK,UAAU,QAAQ,KAAK,UAAU,UAAU;AAClD,iBAAO,aAAa,KAAK,MAAM;AAAA,QACjC;AAEA,YAAI,KAAK,UAAU,CAAC,KAAK,UAAU;AACjC,iBAAO,YAAY,KAAK,MAAM;AAAA,QAChC;AACA,YAAI,KAAK,MAAM;AACb,iBAAO,UAAU,KAAK,IAAI;AAAA,QAC5B;AAEA,YAAI,KAAK,QAAQ;AACf,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,UAAU;AACjB,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,YAAY,KAAK,aAAa,QAAQ;AAC7C,gBAAM,UAAU,QAAO,kBAAkB,KAAK,SAAS,YAAY,CAAC;AACpE,iBAAO,cAAc,UAAU,UAAU,KAAK,QAAQ;AAAA,QACxD;AACA,YAAI,KAAK,YAAY;AACnB,eAAK,WAAW,QAAQ,SAAO;AAC7B,mBAAO,KAAK,GAAG;AAAA,UACjB,CAAC;AAAA,QACH;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,IAAI,KAAK;AAMP,YAAI,KAAK,UAAU,MAAM;AACvB,iBAAO,KAAK,UAAU,IAAI,IAAI,KAAK,SAAS;AAAA,QAC9C;AAEA,YAAI,UAAU,KAAK;AACnB,YAAI,WAAW,UAAU;AACvB,cAAI,EAAE,mBAAmB,OAAO;AAC9B,sBAAU,UAAU,OAAO,KAAK;AAAA,UAClC;AAEA,cAAI,WAAW,UAAU;AACvB,mBAAO;AAAA,UACT;AAEA,iBAAO,QAAQ,QAAQ,KAAK,OAAO,KAAK,IAAI;AAAA,QAC9C;AAEA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA,MAIA,WAAW,KAAK;AACd,YAAI,KAAK,UAAU,MAAM;AACvB,gBAAM,aAAa,OAAO,KAAK,YAAY,oBAAI,KAAK;AACpD,gBAAM,MAAM,KAAK,UAAU,IAAI,YAAY,KAAK,SAAS;AACzD,iBAAO,WAAW,QAAQ,IAAI;AAAA,QAChC;AAEA,YAAI,KAAK,WAAW,UAAU;AAC5B,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,QAAQ,QAAQ;AAAA,MAC9B;AAAA;AAAA;AAAA,MAIA,WAAW,KAAK;AACd,cAAM,WAAW,KAAK,WAAW,GAAG;AACpC,YAAI,YAAY,UAAU;AACxB,iBAAO,IAAI,KAAK,QAAQ;AAAA,QAC1B,WAAW,YAAY,WAAW;AAChC,iBAAO,IAAI,KAAK,QAAQ;AAAA,QAC1B,OAAO;AACL,iBAAO,IAAI,KAAK,QAAQ;AAAA,QAC1B;AAAA,MACF;AAAA;AAAA,MAGA,eAAe;AACb,eAAO,KAAK,UAAU,QAAQ,KAAK,WAAW;AAAA,MAChD;AAAA;AAAA,MAGA,sBAAsB;AACpB,YAAI,KAAK,UAAU,MAAM;AACvB,iBAAO;AAAA,QACT;AACA,eAAO,gBAAgB,KAAK,MAAM;AAAA,MACpC;AAAA,MAEA,UAAU;AACR,eAAO,KAAK,oBAAoB;AAAA,MAClC;AAAA,IACF;AAEA,WAAO,iBAAiB;AACxB,WAAO,QAAQA;AACf,WAAO,WAAW;AAClB,WAAO,yBAAyB,OAAO,KAAK,cAAc;AAC1D,WAAO,gBAAgB;AAAA,MACrB,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,MAAM;AAAA,IACR;AAEA,WAAO,oBAAoB;AAAA,MACzB,QAAQ;AAAA,MACR,KAAK;AAAA,IACP;AAEA,aAAS,4BAA4B,gBAAgB;AACnD,UAAI,kBAAkB,MAAM;AAC1B,cAAM,2BAA2B,eAAe,YAAY;AAE5D,gBAAQ,0BAA0B;AAAA,UAChC,KAAK,mBAAmB;AAAA,UACxB,KAAK,mBAAmB;AAAA,UACxB,KAAK,mBAAmB;AACtB,mBAAO;AAAA,QACX;AAAA,MACF;AAEA,aAAO,mBAAmB;AAAA,IAC5B;AAbS;AAeT,QAAMC,aAAN,MAAM,WAAU;AAAA,MArkChB,OAqkCgB;AAAA;AAAA;AAAA,MACd,YAAY,OAAO,UAAU,EAAE,sBAAsB,KAAK,GAAG;AAC3D,YAAI,OAAO,YAAY,WAAW;AAChC,oBAAU,EAAE,sBAAsB,QAAQ;AAAA,QAC5C;AACA,mBAAW,SAAS,WAAW,SAAS,OAAO,GAAG,OAAO;AACzD,aAAK,uBAAuB,QAAQ;AACpC,aAAK,kBAAkB,CAAC,CAAC,QAAQ;AACjC,aAAK,wBACH,OAAO,QAAQ,0BAA0B,YACrC,QAAQ,wBACR;AACN,aAAK,QAAQ,SAAS,IAAI,kBAAkB;AAC5C,aAAK,iBAAiB,4BAA4B,QAAQ,cAAc;AACxE,aAAK,aAAa,SAAS,OAAO;AAClC,aAAK,qBAAqB,SAAS,gBAAgB;AACnD,aAAK,iBAAiB,SAAS,YAAY;AAC3C,aAAK,sBAAsB,SAAS,iBAAiB;AACrD,aAAK,0BAA0B,SAAS,qBAAqB;AAC7D,aAAK,uBAAuB,SAAS,kBAAkB;AACvD,aAAK,gBAAgB,SAAS,WAAW;AACzC,aAAK,gBAAgB,SAAS,WAAW;AAAA,MAC3C;AAAA,MAEA,UAAU,QAAQ,KAAK,SAAS,IAAI;AAClC,mBAAW,SAAS,WAAW,oBAAoB,GAAG,GAAG,IAAI,OAAO;AAEpE,YAAI;AAEJ,YAAI,WAAW,WAAW,GAAG,GAAG;AAC9B,eAAK;AACL,iBAAO,GAAG,IAAI,MAAM,sBAAsB,CAAC;AAAA,QAC7C;AAEA,cAAM,UAAU,iBAAiB,GAAG;AACpC,YAAI,WAAW,WAAW,OAAO,GAAG;AAClC,eAAK;AACL,oBAAU,CAAC;AAAA,QACb;AAEA,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AAEjD,YACE,CAAC,WAAW,iBAAiB,MAAM,KACnC,CAAC,WAAW,SAAS,MAAM,KAC3B,kBAAkB,UAClB,OAAO,UAAU,GACjB;AACA,iBAAO,GAAG,IAAI;AAAA,QAChB;AAEA,cAAM,OAAO,gBAAgB,QAAQ,QAAQ;AAC7C,cAAM,QAAQ,QAAQ,SAAS,KAAK;AAEpC,YAAI,kBAAkB;AACtB,YAAI,QAAQ,iBAAiB;AAC3B,4BAAkB,qBAAqB,QAAQ,eAAe;AAC9D,cAAI,CAAC,iBAAiB;AACpB,mBAAO,GAAG,IAAI,MAAM,yBAAyB,CAAC;AAAA,UAChD;AAAA,QACF;AAGA,YAAI,OAAO,WAAW,YAAY,kBAAkB,QAAQ;AAC1D,mBAAS,OAAO,MAAM,QAAQ,EAAE,MAAa,CAAC;AAC9C,cAAI,CAAC,QAAQ;AACX,kBAAM,IAAI,MAAM,wBAAwB;AACxC,mBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,UAC5C;AAAA,QACF,WAAW,EAAE,kBAAkB,SAAS;AAGtC,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AACA,iBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,QAC5C;AAGA,cAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AAOpC,YAAI,KAAK,wBAAwB,OAAO,QAAQ;AAC9C,gBAAM,SAAS,UAAU,gBAAgB,OAAO,QAAQ,GAAG;AAAA,YACzD,uBAAuB,KAAK;AAAA,YAC5B,aAAa,QAAQ;AAAA,UACvB,CAAC;AACD,cAAI,UAAU,QAAQ,CAAC,mBAAmB,KAAK,OAAO,MAAM,GAAG;AAE7D,kBAAM,IAAI,MAAM,0CAA0C;AAC1D,mBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,UAC5C;AAAA,QACF;AAGA,YAAI,OAAO,QAAQ;AACjB,cAAI,CAAC,YAAY,MAAM,OAAO,QAAQ,GAAG,KAAK,GAAG;AAC/C,kBAAM,IAAI;AAAA,cACR,4CAA4C,OAAO,QAAQ,CAAC,YAAY,IAAI;AAAA,YAC9E;AACA,mBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,UAC5C;AAEA,cAAI,OAAO,YAAY,MAAM;AAE3B,mBAAO,WAAW;AAAA,UACpB;AAAA,QACF,OAAO;AACL,iBAAO,WAAW;AAClB,iBAAO,SAAS;AAAA,QAClB;AAKA,YAAI,CAAC,OAAO,QAAQ,OAAO,KAAK,CAAC,MAAM,KAAK;AAC1C,iBAAO,OAAO,YAAY,QAAQ,QAAQ;AAC1C,iBAAO,gBAAgB;AAAA,QACzB;AAMA,YAAI,QAAQ,SAAS,SAAS,OAAO,UAAU;AAC7C,gBAAM,IAAI,MAAM,+CAA+C;AAC/D,iBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,QAC5C;AAGA,YACE,OAAO,aAAa,UACpB,OAAO,aAAa,UACpB,iBACA;AAKA,cAAI,oBAAoB,QAAQ;AAC9B,kBAAM,IAAI;AAAA,cACR;AAAA,YACF;AACA,mBAAO,GAAG,QAAQ,cAAc,OAAO,GAAG;AAAA,UAC5C;AAAA,QACF;AAGA,cAAM,+BACJ,KAAK,mBAAmB,mBAAmB;AAC7C,cAAM,yBACJ,KAAK,mBAAmB,mBAAmB;AAE7C,YAAI,CAAC,wBAAwB;AAC3B,cAAI,aAAa;AACjB,cAAI;AAEJ,cAAI,CAAC,2BAA2B,MAAM,GAAG;AACvC,yBAAa;AACb,uBAAW;AAAA,UACb,WAAW,CAAC,yBAAyB,MAAM,GAAG;AAE5C,yBAAa;AACb,uBACE;AAAA,UACJ;AACA,cAAI,YAAY;AACd,mBAAO;AAAA,cACL,QAAQ,eAAe,+BACnB,OACA,IAAI,MAAM,QAAQ;AAAA,YACxB;AAAA,UACF;AAAA,QACF;AAEA,cAAM,QAAQ,KAAK;AAEnB,YAAI,CAAC,MAAM,cAAc;AACvB,gBAAM,eAAe,SAAS,WAAW,WAAWC,KAAI;AACtD,iBAAK,UAAU,WAAWA,GAAE;AAAA,UAC9B;AAAA,QACF;AAEA,iBAAS,WAAWC,MAAK,WAAW;AAClC,cAAIA,MAAK;AACP,mBAAO,GAAGA,IAAG;AAAA,UACf;AAEA,gBAAM,OAAO,gCAASA,MAAK;AACzB,gBAAIA,MAAK;AACP,qBAAO,GAAGA,IAAG;AAAA,YACf,OAAO;AACL,iBAAG,MAAM,MAAM;AAAA,YACjB;AAAA,UACF,GANa;AAQb,cAAI,WAAW;AAGb,gBAAI,QAAQ,SAAS,SAAS,UAAU,UAAU;AAEhD,cAAAA,OAAM,IAAI,MAAM,mDAAmD;AACnE,qBAAO,GAAG,QAAQ,cAAc,OAAOA,IAAG;AAAA,YAC5C;AACA,mBAAO,WAAW,UAAU;AAC5B,mBAAO,gBAAgB,UAAU;AACjC,mBAAO,eAAe;AAEtB,kBAAM,aAAa,WAAW,QAAQ,IAAI;AAAA,UAC5C,OAAO;AACL,mBAAO,WAAW,OAAO,eAAe;AACxC,kBAAM,UAAU,QAAQ,IAAI;AAAA,UAC9B;AAAA,QACF;AA9BS;AAgCT,cAAM,WAAW,OAAO,QAAQ,OAAO,MAAM,OAAO,KAAK,UAAU;AAAA,MACrE;AAAA;AAAA,MAGA,WAAW,KAAK,SAAS,IAAI;AAC3B,mBAAW,SAAS,WAAW,oBAAoB,GAAG,GAAG,IAAI,GAAG;AAEhE,cAAM,UAAU,iBAAiB,GAAG;AACpC,YAAI,WAAW,WAAW,OAAO,GAAG;AAClC,eAAK;AACL,oBAAU,CAAC;AAAA,QACb;AACA,mBAAW,SAAS,WAAW,SAAS,OAAO,GAAG,IAAI,OAAO;AAC7D,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AAEjD,cAAM,OAAO,gBAAgB,QAAQ,QAAQ;AAC7C,cAAM,OAAO,QAAQ,YAAY;AAEjC,YAAI,SAAS,QAAQ;AACrB,YACE,UAAU,QACV,QAAQ,aACP,QAAQ,YAAY,YAAY,QAAQ,YAAY,SACrD;AACA,mBAAS;AAAA,QACX;AAEA,YAAI,gBAAgB;AACpB,YAAI,QAAQ,iBAAiB;AAC3B,gBAAM,kBAAkB,qBAAqB,QAAQ,eAAe;AACpE,0BAAgB,OAAO,cAAc,eAAe;AACpD,cAAI,CAAC,eAAe;AAClB,mBAAO,GAAG,IAAI,MAAM,yBAAyB,CAAC;AAAA,UAChD;AAAA,QACF;AAEA,YAAI,OAAO,QAAQ;AACnB,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACT;AAEA,cAAM,MAAM,QAAQ,OAAO,KAAK,IAAI;AACpC,cAAM,cAAc,QAAQ,WAAW;AACvC,cAAM,WAAW,CAAC,CAAC,QAAQ;AAC3B,cAAM,QAAQ,KAAK;AAEnB,iBAAS,eAAe,GAAG;AAOzB,cAAI,EAAE,UAAU;AACd,gBAAI,EAAE,UAAU,MAAM;AACpB,qBAAO;AAAA,YACT;AAAA,UACF,OAAO;AACL,gBAAI,CAAC,YAAY,MAAM,EAAE,QAAQ,KAAK,GAAG;AACvC,qBAAO;AAAA,YACT;AAAA,UACF;AAGA,cAAI,CAAC,YAAY,CAAC,UAAU,MAAM,EAAE,IAAI,GAAG;AACzC,mBAAO;AAAA,UACT;AAIA,cAAI,EAAE,UAAU,CAAC,QAAQ;AACvB,mBAAO;AAAA,UACT;AAIA,cAAI,EAAE,YAAY,CAAC,MAAM;AACvB,mBAAO;AAAA,UACT;AAGA,cAAI,eAAe;AACjB,kBAAM,cAAc,OAAO,cAAc,EAAE,YAAY,MAAM;AAC7D,gBAAI,cAAc,eAAe;AAE/B,qBAAO;AAAA,YACT;AAAA,UACF;AAIA,cAAI,eAAe,EAAE,WAAW,KAAK,KAAK;AACxC,kBAAM,aAAa,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,MAAM;AAAA,YAAC,CAAC;AACpD,mBAAO;AAAA,UACT;AAEA,iBAAO;AAAA,QACT;AAnDS;AAqDT,cAAM;AAAA,UACJ;AAAA,UACA,WAAW,OAAO;AAAA,UAClB,KAAK;AAAA,UACL,CAAC,KAAK,YAAY;AAChB,gBAAI,KAAK;AACP,qBAAO,GAAG,GAAG;AAAA,YACf;AAEA,sBAAU,QAAQ,OAAO,cAAc;AAGvC,gBAAI,QAAQ,SAAS,OAAO;AAC1B,wBAAU,QAAQ,KAAK,aAAa;AAAA,YACtC;AAGA,kBAAMC,OAAM,oBAAI,KAAK;AACrB,uBAAW,UAAU,SAAS;AAC5B,qBAAO,eAAeA;AAAA,YACxB;AAGA,eAAG,MAAM,OAAO;AAAA,UAClB;AAAA,QACF;AAAA,MACF;AAAA,MAEA,mBAAmB,MAAM;AACvB,cAAM,KAAK,KAAK,IAAI;AACpB,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AACjD,cAAM,OAAO,gCAAS,KAAK,SAAS;AAClC,cAAI,KAAK;AACP,eAAG,GAAG;AAAA,UACR,OAAO;AACL;AAAA,cACE;AAAA,cACA,QACG,KAAK,aAAa,EAClB,IAAI,OAAK,EAAE,aAAa,CAAC,EACzB,KAAK,IAAI;AAAA,YACd;AAAA,UACF;AAAA,QACF,GAZa;AAab,aAAK,KAAK,IAAI;AACd,aAAK,WAAW,MAAM,MAAM,IAAI;AAAA,MAClC;AAAA,MAEA,uBAAuB,MAAM;AAC3B,cAAM,KAAK,KAAK,IAAI;AACpB,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AACjD,cAAM,OAAO,gCAAS,KAAK,SAAS;AAClC,cAAI,KAAK;AACP,eAAG,GAAG;AAAA,UACR,OAAO;AACL;AAAA,cACE;AAAA,cACA,QAAQ,IAAI,OAAK;AACf,uBAAO,EAAE,SAAS;AAAA,cACpB,CAAC;AAAA,YACH;AAAA,UACF;AAAA,QACF,GAXa;AAYb,aAAK,KAAK,IAAI;AACd,aAAK,WAAW,MAAM,MAAM,IAAI;AAAA,MAClC;AAAA,MAEA,UAAU,IAAI;AACZ,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AACjD,YAAI,OAAO,KAAK,MAAM,YAAY;AAClC,YAAI,WAAW,SAAS,IAAI,GAAG;AAC7B,iBAAO;AAAA,QACT;AAGA,cAAM,aAAa;AAAA;AAAA;AAAA;AAAA,UAIjB,SAAS,gBAAgB,OAAO;AAAA;AAAA,UAGhC,WAAW;AAAA;AAAA,UAGX,sBAAsB,CAAC,CAAC,KAAK;AAAA,UAC7B,iBAAiB,CAAC,CAAC,KAAK;AAAA,UACxB,uBAAuB,CAAC,CAAC,KAAK;AAAA,UAC9B,gBAAgB,4BAA4B,KAAK,cAAc;AAAA;AAAA,UAG/D,SAAS,CAAC;AAAA,QACZ;AAEA,YACE,EACE,KAAK,MAAM,iBACX,OAAO,KAAK,MAAM,kBAAkB,aAEtC;AACA,iBAAO;AAAA,YACL,IAAI;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,aAAK,MAAM,cAAc,CAAC,KAAK,YAAY;AACzC,cAAI,KAAK;AACP,mBAAO,GAAG,GAAG;AAAA,UACf;AAEA,qBAAW,UAAU,QAAQ,IAAI,YAAU;AAEzC,qBAAS,kBAAkB,SAAS,OAAO,OAAO,IAAI;AAGtD,mBAAO,OAAO;AAEd,mBAAO;AAAA,UACT,CAAC;AAED,iBAAO,GAAG,MAAM,UAAU;AAAA,QAC5B,CAAC;AAAA,MACH;AAAA,MAEA,SAAS;AACP,eAAO,KAAK,cAAc;AAAA,MAC5B;AAAA;AAAA,MAGA,eAAe,YAAY,IAAI;AAC7B,YAAI,UAAU,WAAW;AACzB,YAAI,CAAC,WAAW,CAAC,MAAM,QAAQ,OAAO,GAAG;AACvC,iBAAO,GAAG,IAAI,MAAM,qCAAqC,CAAC;AAAA,QAC5D;AACA,kBAAU,QAAQ,MAAM;AAExB,cAAM,UAAU,gCAAO;AACrB,cAAI,KAAK;AACP,mBAAO,GAAG,GAAG;AAAA,UACf;AAEA,cAAI,CAAC,QAAQ,QAAQ;AACnB,mBAAO,GAAG,KAAK,IAAI;AAAA,UACrB;AAEA,cAAI;AACJ,cAAI;AACF,qBAAS,SAAS,QAAQ,MAAM,CAAC;AAAA,UACnC,SAAS,GAAG;AACV,mBAAO,GAAG,CAAC;AAAA,UACb;AAEA,cAAI,WAAW,MAAM;AACnB,mBAAO,QAAQ,IAAI;AAAA,UACrB;AAEA,eAAK,MAAM,UAAU,QAAQ,OAAO;AAAA,QACtC,GArBgB;AAuBhB,gBAAQ;AAAA,MACV;AAAA,MAEA,MAAM,UAAU,IAAI;AAClB,YAAI,UAAU,WAAW,GAAG;AAC1B,eAAK;AACL,qBAAW;AAAA,QACb;AAEA,aAAK,UAAU,CAAC,KAAK,eAAe;AAClC,cAAI,KAAK;AACP,mBAAO,GAAG,GAAG;AAAA,UACf;AACA,qBAAU,YAAY,YAAY,UAAU,EAAE;AAAA,QAChD,CAAC;AAAA,MACH;AAAA,MAEA,UAAU,UAAU;AAClB,YAAI,UAAU,WAAW,GAAG;AAC1B,iBAAO,KAAK,WAAW;AAAA,QACzB;AACA,YAAI,CAAC,SAAS,aAAa;AACzB,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AACA,eAAO,KAAK,WAAW,QAAQ;AAAA,MACjC;AAAA,MAEA,iBAAiB,IAAI;AACnB,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AACjD,cAAM,QAAQ,KAAK;AAKnB,YACE,OAAO,MAAM,qBAAqB,cAClC,MAAM,qBAAqB,MAAM,UAAU,kBAC3C;AACA,iBAAO,MAAM,iBAAiB,EAAE;AAAA,QAClC;AAEA,cAAM,cAAc,CAAC,KAAK,YAAY;AACpC,cAAI,KAAK;AACP,mBAAO,GAAG,GAAG;AAAA,UACf;AAEA,cAAI,QAAQ,WAAW,GAAG;AACxB,mBAAO,GAAG,IAAI;AAAA,UAChB;AAEA,cAAI,iBAAiB;AACrB,gBAAM,eAAe,CAAC;AAEtB,mBAAS,eAAe,WAAW;AACjC,gBAAI,WAAW;AACb,2BAAa,KAAK,SAAS;AAAA,YAC7B;AAEA;AAEA,gBAAI,mBAAmB,QAAQ,QAAQ;AACrC,qBAAO,GAAG,aAAa,SAAS,aAAa,CAAC,IAAI,IAAI;AAAA,YACxD;AAAA,UACF;AAVS;AAYT,kBAAQ,QAAQ,YAAU;AACxB,kBAAM;AAAA,cACJ,OAAO;AAAA,cACP,OAAO;AAAA,cACP,OAAO;AAAA,cACP;AAAA,YACF;AAAA,UACF,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AAAA,MAEA,OAAO,YAAY,UAAU,OAAO,IAAI;AACtC,YAAI,UAAU,WAAW,GAAG;AAE1B,eAAK;AACL,kBAAQ;AAAA,QACV;AACA,mBAAW,SAAS,WAAW,WAAW,EAAE,GAAG,EAAE;AAEjD,YAAI;AACJ,YAAI,OAAO,aAAa,UAAU;AAChC,uBAAa,UAAU,QAAQ;AAC/B,cAAI,sBAAsB,OAAO;AAC/B,mBAAO,GAAG,UAAU;AAAA,UACtB;AAAA,QACF,OAAO;AACL,uBAAa;AAAA,QACf;AAEA,cAAM,MAAM,IAAI,WAAU,OAAO;AAAA,UAC/B,sBAAsB,WAAW;AAAA,UACjC,WAAW,WAAW;AAAA,UACtB,uBAAuB,WAAW;AAAA,UAClC,gBAAgB,WAAW;AAAA,QAC7B,CAAC;AACD,YAAI,eAAe,YAAY,SAAO;AACpC,cAAI,KAAK;AACP,mBAAO,GAAG,GAAG;AAAA,UACf;AACA,aAAG,MAAM,GAAG;AAAA,QACd,CAAC;AAAA,MACH;AAAA,MAEA,OAAO,gBAAgB,UAAU,OAAO;AACtC,cAAM,aACJ,OAAO,aAAa,WAAW,KAAK,MAAM,QAAQ,IAAI;AACxD,cAAM,MAAM,IAAI,WAAU,OAAO;AAAA,UAC/B,sBAAsB,WAAW;AAAA,UACjC,WAAW,WAAW;AAAA,QACxB,CAAC;AAGD,YAAI,CAAC,IAAI,MAAM,aAAa;AAC1B,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,YAAI,mBAAmB,UAAU;AACjC,eAAO;AAAA,MACT;AAAA,IACF;AACA,IAAAH,WAAU,WAAWA,WAAU;AAE/B;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,QAAQ,UAAQ;AAChB,MAAAA,WAAU,UAAU,IAAI,IAAI,aAAaA,WAAU,UAAU,IAAI,CAAC;AAAA,IACpE,CAAC;AACD,IAAAA,WAAU,cAAc,aAAaA,WAAU,WAAW;AAG1D,aAAS,SAAS,QAAQ;AACxB,aAAO,YAAY,MAAM;AACvB,YAAI,CAAC,KAAK,MAAM,aAAa;AAC3B,gBAAM,IAAI;AAAA,YACR;AAAA,UACF;AAAA,QACF;AAEA,YAAI,SAAS;AACb,aAAK,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,WAAW;AACrC,oBAAU;AACV,uBAAa;AAAA,QACf,CAAC;AAED,YAAI,SAAS;AACX,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAnBS;AAqBT,YAAQ,UAAU;AAClB,YAAQ,YAAYA;AACpB,YAAQ,SAAS;AACjB,YAAQ,QAAQ;AAChB,YAAQ,oBAAoB;AAC5B,YAAQ,YAAY;AACpB,YAAQ,aAAa;AACrB,YAAQ,QAAQD;AAChB,YAAQ,WAAW;AACnB,YAAQ,cAAc;AACtB,YAAQ,cAAc;AACtB,YAAQ,YAAY;AACpB,YAAQ,kBAAkB,UAAU;AACpC,YAAQ,gBAAgB;AACxB,YAAQ,gBAAgB,wBAA2B;AACnD,YAAQ,cAAc;AACtB,YAAQ,kBAAkB;AAC1B,YAAQ,qBAAqB;AAC7B,YAAQ,iBAAiB,WAAW;AAAA;AAAA;;;AC7tDpC;AAAA;AAAA;AAEA,QAAI,sBAAsB;AAAA,MACxB,cAAc;AAAA,MACd,KAAK;AAAA,MACL,QAAQ;AAAA,IACV;AAEA,aAAS,iBAAiB,KAAK;AAC7B,aAAO,OAAO,QAAQ,YAAY,CAAC,CAAC,IAAI,KAAK;AAAA,IAC/C;AAFS;AAIT,aAAS,YAAY,gBAAgB,SAAS;AAC5C,UAAI,QAAQ,eAAe,MAAM,GAAG,EAAE,OAAO,gBAAgB;AAE7D,UAAI,mBAAmB,MAAM,MAAM;AACnC,UAAI,SAAS,mBAAmB,gBAAgB;AAChD,UAAI,OAAO,OAAO;AAClB,UAAI,QAAQ,OAAO;AAEnB,gBAAU,UACN,OAAO,OAAO,CAAC,GAAG,qBAAqB,OAAO,IAC9C;AAEJ,UAAI;AACF,gBAAQ,QAAQ,eAAe,mBAAmB,KAAK,IAAI;AAAA,MAC7D,SAAS,GAAG;AACV,gBAAQ;AAAA,UACN,gFACE,QACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,SAAS;AAAA,QACX;AAAA,QACA;AAAA,MACF;AAEA,YAAM,QAAQ,SAAU,MAAM;AAC5B,YAAI,QAAQ,KAAK,MAAM,GAAG;AAC1B,YAAI,MAAM,MAAM,MAAM,EAAE,SAAS,EAAE,YAAY;AAC/C,YAAIK,SAAQ,MAAM,KAAK,GAAG;AAC1B,YAAI,QAAQ,WAAW;AACrB,iBAAO,UAAU,IAAI,KAAKA,MAAK;AAAA,QACjC,WAAW,QAAQ,WAAW;AAC5B,iBAAO,SAAS,SAASA,QAAO,EAAE;AAAA,QACpC,WAAW,QAAQ,UAAU;AAC3B,iBAAO,SAAS;AAAA,QAClB,WAAW,QAAQ,YAAY;AAC7B,iBAAO,WAAW;AAAA,QACpB,WAAW,QAAQ,YAAY;AAC7B,iBAAO,WAAWA;AAAA,QACpB,OAAO;AACL,iBAAO,GAAG,IAAIA;AAAA,QAChB;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAhDS;AAkDT,aAAS,mBAAmB,kBAAkB;AAG5C,UAAI,OAAO;AACX,UAAI,QAAQ;AACZ,UAAI,eAAe,iBAAiB,MAAM,GAAG;AAC7C,UAAI,aAAa,SAAS,GAAG;AAC3B,eAAO,aAAa,MAAM;AAC1B,gBAAQ,aAAa,KAAK,GAAG;AAAA,MAC/B,OAAO;AACL,gBAAQ;AAAA,MACV;AAEA,aAAO,EAAE,MAAY,MAAa;AAAA,IACpC;AAdS;AAgBT,aAASC,OAAM,OAAO,SAAS;AAC7B,gBAAU,UACN,OAAO,OAAO,CAAC,GAAG,qBAAqB,OAAO,IAC9C;AAEJ,UAAI,CAAC,OAAO;AACV,YAAI,CAAC,QAAQ,KAAK;AAChB,iBAAO,CAAC;AAAA,QACV,OAAO;AACL,iBAAO,CAAC;AAAA,QACV;AAAA,MACF;AAEA,UAAI,MAAM,SAAS;AACjB,YAAI,OAAO,MAAM,QAAQ,iBAAiB,YAAY;AAGpD,kBAAQ,MAAM,QAAQ,aAAa;AAAA,QACrC,WAAW,MAAM,QAAQ,YAAY,GAAG;AAEtC,kBAAQ,MAAM,QAAQ,YAAY;AAAA,QACpC,OAAO;AAEL,cAAI,MACF,MAAM,QACJ,OAAO,KAAK,MAAM,OAAO,EAAE,KAAK,SAAU,KAAK;AAC7C,mBAAO,IAAI,YAAY,MAAM;AAAA,UAC/B,CAAC,CACH;AAEF,cAAI,CAAC,OAAO,MAAM,QAAQ,UAAU,CAAC,QAAQ,QAAQ;AACnD,oBAAQ;AAAA,cACN;AAAA,YACF;AAAA,UACF;AACA,kBAAQ;AAAA,QACV;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,gBAAQ,CAAC,KAAK;AAAA,MAChB;AAEA,gBAAU,UACN,OAAO,OAAO,CAAC,GAAG,qBAAqB,OAAO,IAC9C;AAEJ,UAAI,CAAC,QAAQ,KAAK;AAChB,eAAO,MAAM,OAAO,gBAAgB,EAAE,IAAI,SAAU,KAAK;AACvD,iBAAO,YAAY,KAAK,OAAO;AAAA,QACjC,CAAC;AAAA,MACH,OAAO;AACL,YAAI,UAAU,CAAC;AACf,eAAO,MAAM,OAAO,gBAAgB,EAAE,OAAO,SAAUC,UAAS,KAAK;AACnE,cAAI,SAAS,YAAY,KAAK,OAAO;AACrC,UAAAA,SAAQ,OAAO,IAAI,IAAI;AACvB,iBAAOA;AAAA,QACT,GAAG,OAAO;AAAA,MACZ;AAAA,IACF;AA1DS,WAAAD,QAAA;AAuET,aAASE,oBAAmB,eAAe;AACzC,UAAI,MAAM,QAAQ,aAAa,GAAG;AAChC,eAAO;AAAA,MACT;AACA,UAAI,OAAO,kBAAkB,UAAU;AACrC,eAAO,CAAC;AAAA,MACV;AAEA,UAAI,iBAAiB,CAAC;AACtB,UAAI,MAAM;AACV,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AAEJ,eAAS,iBAAiB;AACxB,eAAO,MAAM,cAAc,UAAU,KAAK,KAAK,cAAc,OAAO,GAAG,CAAC,GAAG;AACzE,iBAAO;AAAA,QACT;AACA,eAAO,MAAM,cAAc;AAAA,MAC7B;AALS;AAOT,eAAS,iBAAiB;AACxB,aAAK,cAAc,OAAO,GAAG;AAE7B,eAAO,OAAO,OAAO,OAAO,OAAO,OAAO;AAAA,MAC5C;AAJS;AAMT,aAAO,MAAM,cAAc,QAAQ;AACjC,gBAAQ;AACR,gCAAwB;AAExB,eAAO,eAAe,GAAG;AACvB,eAAK,cAAc,OAAO,GAAG;AAC7B,cAAI,OAAO,KAAK;AAEd,wBAAY;AACZ,mBAAO;AAEP,2BAAe;AACf,wBAAY;AAEZ,mBAAO,MAAM,cAAc,UAAU,eAAe,GAAG;AACrD,qBAAO;AAAA,YACT;AAGA,gBAAI,MAAM,cAAc,UAAU,cAAc,OAAO,GAAG,MAAM,KAAK;AAEnE,sCAAwB;AAExB,oBAAM;AACN,6BAAe,KAAK,cAAc,UAAU,OAAO,SAAS,CAAC;AAC7D,sBAAQ;AAAA,YACV,OAAO;AAGL,oBAAM,YAAY;AAAA,YACpB;AAAA,UACF,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF;AAEA,YAAI,CAAC,yBAAyB,OAAO,cAAc,QAAQ;AACzD,yBAAe,KAAK,cAAc,UAAU,OAAO,cAAc,MAAM,CAAC;AAAA,QAC1E;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAvES,WAAAA,qBAAA;AAyET,WAAO,UAAUF;AACjB,WAAO,QAAQ,QAAQA;AACvB,WAAO,QAAQ,cAAc;AAC7B,WAAO,QAAQ,qBAAqBE;AAAA;AAAA;;;ACjOpC;AAAA;AAAA;AAEA,QAAI,YAAY;AAChB,WAAO,UAAU,SAAS,KAAK,SAAS;AACvC,UAAI,QAAQ,KAAK,GAAG,GAAG;AACtB,cAAM,WAAW;AAAA,MAClB;AACA,aAAO,UAAU,KAAK,MAAM,KAAK,OAAO;AAAA,IACzC;AAEA,QAAI,CAAC,OAAO,OAAO;AAClB,aAAO,QAAQ,OAAO;AACtB,aAAO,WAAW,UAAU;AAC5B,aAAO,UAAU,UAAU;AAC3B,aAAO,UAAU,UAAU;AAAA,IAC5B;AAAA;AAAA;;;ACfA;AAAA;AAAA;AAAA,KAAC,SAAU,MAAM,SAAS,YAAY;AACpC,UAAI,OAAO,WAAW,eAAe,OAAO,QAAS,QAAO,UAAU,WAAW;AAAA,eACxE,OAAO,WAAW,cAAc,OAAO,IAAK,QAAO,UAAU;AAAA,UACjE,SAAQ,IAAI,IAAI,WAAW;AAAA,IAClC,GAAG,WAAW,SAAM,WAAY;AAE9B,eAAS,UAAW,UAAU;AAC5B,YAAI,cAAc,CAAC;AACnB,YAAI,SAAS,WAAW,GAAG;AAAE,iBAAO;AAAA,QAAI;AAExC,YAAI,OAAO,SAAS,CAAC,MAAM,UAAU;AACnC,gBAAM,IAAI,UAAU,oCAAoC,SAAS,CAAC,CAAC;AAAA,QACrE;AAGA,YAAI,SAAS,CAAC,EAAE,MAAM,cAAc,KAAK,SAAS,SAAS,GAAG;AAC5D,cAAI,QAAQ,SAAS,MAAM;AAC3B,mBAAS,CAAC,IAAI,QAAQ,SAAS,CAAC;AAAA,QAClC;AAGA,YAAI,SAAS,CAAC,EAAE,MAAM,cAAc,GAAG;AACrC,mBAAS,CAAC,IAAI,SAAS,CAAC,EAAE,QAAQ,iBAAiB,QAAQ;AAAA,QAC7D,OAAO;AACL,mBAAS,CAAC,IAAI,SAAS,CAAC,EAAE,QAAQ,iBAAiB,OAAO;AAAA,QAC5D;AAEA,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,cAAI,YAAY,SAAS,CAAC;AAE1B,cAAI,OAAO,cAAc,UAAU;AACjC,kBAAM,IAAI,UAAU,oCAAoC,SAAS;AAAA,UACnE;AAEA,cAAI,cAAc,IAAI;AAAE;AAAA,UAAU;AAElC,cAAI,IAAI,GAAG;AAET,wBAAY,UAAU,QAAQ,UAAU,EAAE;AAAA,UAC5C;AACA,cAAI,IAAI,SAAS,SAAS,GAAG;AAE3B,wBAAY,UAAU,QAAQ,UAAU,EAAE;AAAA,UAC5C,OAAO;AAEL,wBAAY,UAAU,QAAQ,UAAU,GAAG;AAAA,UAC7C;AAEA,sBAAY,KAAK,SAAS;AAAA,QAE5B;AAEA,YAAI,MAAM,YAAY,KAAK,GAAG;AAI9B,cAAM,IAAI,QAAQ,mBAAmB,IAAI;AAGzC,YAAI,QAAQ,IAAI,MAAM,GAAG;AACzB,cAAM,MAAM,MAAM,KAAK,MAAM,SAAS,IAAI,MAAK,MAAM,MAAM,KAAK,GAAG;AAEnE,eAAO;AAAA,MACT;AAzDS;AA2DT,aAAO,WAAY;AACjB,YAAI;AAEJ,YAAI,OAAO,UAAU,CAAC,MAAM,UAAU;AACpC,kBAAQ,UAAU,CAAC;AAAA,QACrB,OAAO;AACL,kBAAQ,CAAC,EAAE,MAAM,KAAK,SAAS;AAAA,QACjC;AAEA,eAAO,UAAU,KAAK;AAAA,MACxB;AAAA,IAEF,CAAC;AAAA;AAAA;;;AC7ED,SAAS,aAAa,eAAe,uBAAAC,sBAAqB,QAAQ,eAAe,sBAAsB;AAWvG,uBAAoC;;;ACVpC,SAAS,mBAAAC,wBAAuB;;;ACDhC;;;;;;;;;;;;;;;;;;;;;;ACCA;;;;;;;;;;;;;;;;;;ACDA;;;ACAA;;;ACiHO,IAAM,mBAAmB;EAC9B,SAAS;EACT,QAAQ;EACR,gBAAgB;EAChB,QAAQ;EACR,YAAY;;AAKP,IAAM,kBAAkB;EAC7B,eAAe;EACf,iBAAiB;;AAKZ,IAAM,qBAAqB;EAChC,UAAU;EACV,UAAU;EACV,gBAAgB;EAChB,gBAAgB;;AAKX,IAAM,6BAA6B;EACxC,gBAAgB;EAChB,gBAAgB;;AAMX,IAAM,8BAA8B;EACzC,WAAW;EACX,UAAU;;AAML,IAAM,YAAY;EACvB,QAAQ;EACR,SAAS;;AAMJ,IAAM,wBAAwB;EACnC,IAAI;EACJ,IAAI;;AAOC,IAAM,UAAU;EACrB,IAAI;EACJ,IAAI;;AASC,IAAM,sBAAsB;EACjC,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;;AAQC,IAAM,uBAAuB;EAClC,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;;AAQC,IAAM,uBAAuB;EAClC,IAAI;EACJ,IAAI;;;;ACvNN;;;;;;;ACAO,IAAM,aAAa;EACxB,UAAU;;;;ACDL,IAAM,oBAAoB;EAC/B,QAAQ;EACR,QAAQ;;;;;ACIJ,SAAU,aAAa,GAAS;AACpC,MAAI,CAAC,OAAO,cAAc,CAAC;AAAG,UAAM,IAAI,MAAM,kBAAkB,CAAC,EAAE;AACrE;AAFgB;AAahB,SAAS,QAAQ,GAAU;AACzB,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALS;;AA0BT,SAAS,SAAuC,MAAO;AACrD,QAAM,KAAK,wBAAC,MAAW,GAAZ;AAEX,QAAM,OAAO,wBAAC,GAAQ,MAAW,CAAC,MAAW,EAAE,EAAE,CAAC,CAAC,GAAtC;AAEb,QAAMC,UAAS,KAAK,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,MAAM,EAAE;AAE7D,QAAMC,UAAS,KAAK,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,MAAM,EAAE;AACxD,SAAO,EAAE,QAAAD,SAAQ,QAAAC,QAAM;AACzB;AATS;;AAiBT,SAAS,SAASC,WAAkB;AAClC,SAAO;IACL,QAAQ,wBAAC,WAAoB;AAC3B,UAAI,CAAC,MAAM,QAAQ,MAAM,KAAM,OAAO,UAAU,OAAO,OAAO,CAAC,MAAM;AACnE,cAAM,IAAI,MAAM,qDAAqD;AACvE,aAAO,OAAO,IAAI,CAAC,MAAK;AACtB,qCAAa,CAAC;AACd,YAAI,IAAI,KAAK,KAAKA,UAAS;AACzB,gBAAM,IAAI,MAAM,iCAAiC,CAAC,eAAeA,UAAS,MAAM,GAAG;AACrF,eAAOA,UAAS,CAAC;MACnB,CAAC;IACH,GATQ;IAUR,QAAQ,wBAAC,UAAmB;AAC1B,UAAI,CAAC,MAAM,QAAQ,KAAK,KAAM,MAAM,UAAU,OAAO,MAAM,CAAC,MAAM;AAChE,cAAM,IAAI,MAAM,kDAAkD;AACpE,aAAO,MAAM,IAAI,CAAC,WAAU;AAC1B,YAAI,OAAO,WAAW;AACpB,gBAAM,IAAI,MAAM,uCAAuC,MAAM,EAAE;AACjE,cAAM,QAAQA,UAAS,QAAQ,MAAM;AACrC,YAAI,UAAU;AAAI,gBAAM,IAAI,MAAM,oBAAoB,MAAM,eAAeA,SAAQ,EAAE;AACrF,eAAO;MACT,CAAC;IACH,GAVQ;;AAYZ;AAxBS;;AA6BT,SAAS,KAAK,YAAY,IAAE;AAC1B,MAAI,OAAO,cAAc;AAAU,UAAM,IAAI,MAAM,iCAAiC;AACpF,SAAO;IACL,QAAQ,wBAAC,SAAQ;AACf,UAAI,CAAC,MAAM,QAAQ,IAAI,KAAM,KAAK,UAAU,OAAO,KAAK,CAAC,MAAM;AAC7D,cAAM,IAAI,MAAM,8CAA8C;AAChE,eAAS,KAAK;AACZ,YAAI,OAAO,MAAM;AAAU,gBAAM,IAAI,MAAM,iCAAiC,CAAC,EAAE;AACjF,aAAO,KAAK,KAAK,SAAS;IAC5B,GANQ;IAOR,QAAQ,wBAAC,OAAM;AACb,UAAI,OAAO,OAAO;AAAU,cAAM,IAAI,MAAM,oCAAoC;AAChF,aAAO,GAAG,MAAM,SAAS;IAC3B,GAHQ;;AAKZ;AAfS;;AAqBT,SAAS,QAAQ,MAAc,MAAM,KAAG;AACtC,+BAAa,IAAI;AACjB,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B;AAC3E,SAAO;IACL,OAAO,MAAc;AACnB,UAAI,CAAC,MAAM,QAAQ,IAAI,KAAM,KAAK,UAAU,OAAO,KAAK,CAAC,MAAM;AAC7D,cAAM,IAAI,MAAM,iDAAiD;AACnE,eAAS,KAAK;AACZ,YAAI,OAAO,MAAM;AAAU,gBAAM,IAAI,MAAM,oCAAoC,CAAC,EAAE;AACpF,aAAQ,KAAK,SAAS,OAAQ;AAAG,aAAK,KAAK,GAAG;AAC9C,aAAO;IACT;IACA,OAAO,OAAe;AACpB,UAAI,CAAC,MAAM,QAAQ,KAAK,KAAM,MAAM,UAAU,OAAO,MAAM,CAAC,MAAM;AAChE,cAAM,IAAI,MAAM,iDAAiD;AACnE,eAAS,KAAK;AACZ,YAAI,OAAO,MAAM;AAAU,gBAAM,IAAI,MAAM,oCAAoC,CAAC,EAAE;AACpF,UAAI,MAAM,MAAM;AAChB,UAAK,MAAM,OAAQ;AACjB,cAAM,IAAI,MAAM,2DAA2D;AAC7E,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,KAAK,OAAO;AAC/C,YAAI,GAAI,MAAM,KAAK,OAAQ;AACzB,gBAAM,IAAI,MAAM,8CAA8C;MAClE;AACA,aAAO,MAAM,MAAM,GAAG,GAAG;IAC3B;;AAEJ;AA3BS;AAmFT,IAAM,MAAiC,mDAAC,GAAW,MAAuB,CAAC,IAAI,IAAI,oBAAI,GAAG,IAAI,CAAC,GAAxD;AACvC,IAAM,cAAwC,mDAAC,MAAc,OAC3D,QAAQ,KAAK,oBAAI,MAAM,EAAE,IADmB;;AAM9C,SAAS,cAAc,MAAgB,MAAc,IAAYC,UAAgB;AAC/E,MAAI,CAAC,MAAM,QAAQ,IAAI;AAAG,UAAM,IAAI,MAAM,qCAAqC;AAC/E,MAAI,QAAQ,KAAK,OAAO;AAAI,UAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAC/E,MAAI,MAAM,KAAK,KAAK;AAAI,UAAM,IAAI,MAAM,2BAA2B,EAAE,EAAE;AACvE,MAAI,4BAAY,MAAM,EAAE,IAAI,IAAI;AAC9B,UAAM,IAAI,MACR,sCAAsC,IAAI,OAAO,EAAE,cAAc,4BAAY,MAAM,EAAE,CAAC,EAAE;EAE5F;AACA,MAAI,QAAQ;AACZ,MAAI,MAAM;AACV,QAAM,OAAO,KAAK,KAAK;AACvB,QAAM,MAAgB,CAAA;AACtB,aAAW,KAAK,MAAM;AACpB,iCAAa,CAAC;AACd,QAAI,KAAK,KAAK;AAAM,YAAM,IAAI,MAAM,oCAAoC,CAAC,SAAS,IAAI,EAAE;AACxF,YAAS,SAAS,OAAQ;AAC1B,QAAI,MAAM,OAAO;AAAI,YAAM,IAAI,MAAM,qCAAqC,GAAG,SAAS,IAAI,EAAE;AAC5F,WAAO;AACP,WAAO,OAAO,IAAI,OAAO;AAAI,UAAI,MAAO,SAAU,MAAM,KAAO,UAAU,CAAC;AAC1E,aAAS,KAAK,MAAM;EACtB;AACA,UAAS,SAAU,KAAK,MAAQ;AAChC,MAAI,CAACA,YAAW,OAAO;AAAM,UAAM,IAAI,MAAM,gBAAgB;AAC7D,MAAI,CAACA,YAAW;AAAO,UAAM,IAAI,MAAM,qBAAqB,KAAK,EAAE;AACnE,MAAIA,YAAW,MAAM;AAAG,QAAI,KAAK,UAAU,CAAC;AAC5C,SAAO;AACT;AA3BS;;AAoDT,SAAS,OAAO,MAAc,aAAa,OAAK;AAC9C,+BAAa,IAAI;AACjB,MAAI,QAAQ,KAAK,OAAO;AAAI,UAAM,IAAI,MAAM,mCAAmC;AAC/E,MAAI,4BAAY,GAAG,IAAI,IAAI,MAAM,4BAAY,MAAM,CAAC,IAAI;AACtD,UAAM,IAAI,MAAM,wBAAwB;AAC1C,SAAO;IACL,QAAQ,wBAACC,WAAqB;AAC5B,UAAI,CAAC,QAAQA,MAAK;AAAG,cAAM,IAAI,MAAM,0CAA0C;AAC/E,aAAO,8BAAc,MAAM,KAAKA,MAAK,GAAG,GAAG,MAAM,CAAC,UAAU;IAC9D,GAHQ;IAIR,QAAQ,wBAAC,WAAoB;AAC3B,UAAI,CAAC,MAAM,QAAQ,MAAM,KAAM,OAAO,UAAU,OAAO,OAAO,CAAC,MAAM;AACnE,cAAM,IAAI,MAAM,gDAAgD;AAClE,aAAO,WAAW,KAAK,8BAAc,QAAQ,MAAM,GAAG,UAAU,CAAC;IACnE,GAJQ;;AAMZ;AAhBS;AAqGF,IAAM,SAAqC,sBAChD,uBAAO,CAAC,GACR,yBAAS,kEAAkE,GAC3E,wBAAQ,CAAC,GACT,qBAAK,EAAE,CAAC;;;ACvWV;;;;;;;;;;;;;;;;iBAAAC;EAAA;;;;;;;AAKA,IAAM,MAAM,OAAO,CAAC;AACpB,IAAM,MAAM,OAAO,CAAC;AACpB,IAAM,MAAM,OAAO,CAAC;AAWd,SAAUC,SAAQ,GAAU;AAChC,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALgB,OAAAA,UAAA;AAOV,SAAU,OAAO,MAAa;AAClC,MAAI,CAACA,SAAQ,IAAI;AAAG,UAAM,IAAI,MAAM,qBAAqB;AAC3D;AAFgB;AAKhB,IAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAG,MAC5D,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAK3B,SAAU,WAAWC,QAAiB;AAC1C,SAAOA,MAAK;AAEZ,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACrC,WAAO,MAAMA,OAAM,CAAC,CAAC;EACvB;AACA,SAAO;AACT;AARgB;AAUV,SAAU,oBAAoB,KAAoB;AACtD,QAAM,MAAM,IAAI,SAAS,EAAE;AAC3B,SAAO,IAAI,SAAS,IAAI,IAAI,GAAG,KAAK;AACtC;AAHgB;AAKV,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,SAAO,OAAO,QAAQ,KAAK,MAAM,KAAK,GAAG,EAAE;AAC7C;AAJgB;AAOhB,IAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAG;AAChE,SAAS,cAAc,MAAY;AACjC,MAAI,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAAI,WAAO,OAAO,OAAO;AACjE,MAAI,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAAI,WAAO,QAAQ,OAAO,KAAK;AACvE,MAAI,QAAQ,OAAO,MAAM,QAAQ,OAAO;AAAI,WAAO,QAAQ,OAAO,KAAK;AACvE;AACF;AALS;AAUH,SAAU,WAAW,KAAW;AACpC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,QAAM,KAAK,IAAI;AACf,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK;AAAG,UAAM,IAAI,MAAM,4DAA4D,EAAE;AAC1F,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,UAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACxC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;IAC5F;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;EACxB;AACA,SAAO;AACT;AAhBgB;AAmBV,SAAU,gBAAgBA,QAAiB;AAC/C,SAAO,YAAY,WAAWA,MAAK,CAAC;AACtC;AAFgB;AAGV,SAAU,gBAAgBA,QAAiB;AAC/C,SAAOA,MAAK;AACZ,SAAO,YAAY,WAAW,WAAW,KAAKA,MAAK,EAAE,QAAO,CAAE,CAAC;AACjE;AAHgB;AAKV,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,WAAW,EAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AACzD;AAFgB;AAGV,SAAU,gBAAgB,GAAoB,KAAW;AAC7D,SAAO,gBAAgB,GAAG,GAAG,EAAE,QAAO;AACxC;AAFgB;AAIV,SAAU,mBAAmB,GAAkB;AACnD,SAAO,WAAW,oBAAoB,CAAC,CAAC;AAC1C;AAFgB;AAaV,SAAU,YAAY,OAAe,KAAU,gBAAuB;AAC1E,MAAI;AACJ,MAAI,OAAO,QAAQ,UAAU;AAC3B,QAAI;AACF,YAAM,WAAW,GAAG;IACtB,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,GAAG,KAAK,mCAAmC,GAAG,aAAa,CAAC,EAAE;IAChF;EACF,WAAWD,SAAQ,GAAG,GAAG;AAGvB,UAAM,WAAW,KAAK,GAAG;EAC3B,OAAO;AACL,UAAM,IAAI,MAAM,GAAG,KAAK,mCAAmC;EAC7D;AACA,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,mBAAmB,YAAY,QAAQ;AAChD,UAAM,IAAI,MAAM,GAAG,KAAK,aAAa,cAAc,eAAe,GAAG,EAAE;AACzE,SAAO;AACT;AAnBgB;AAwBV,SAAU,eAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC;AACR,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAdgB;AAiBV,SAAU,WAAW,GAAe,GAAa;AACrD,MAAI,EAAE,WAAW,EAAE;AAAQ,WAAO;AAClC,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,YAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACrD,SAAO,SAAS;AAClB;AALgB;AAcV,SAAU,YAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,oCAAoC,OAAO,GAAG,EAAE;AAC7F,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAHgB;AAWV,SAAU,OAAO,GAAS;AAC9B,MAAI;AACJ,OAAK,MAAM,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO;AAAE;AAC3C,SAAO;AACT;AAJgB;AAWV,SAAU,OAAO,GAAW,KAAW;AAC3C,SAAQ,KAAK,OAAO,GAAG,IAAK;AAC9B;AAFgB;AAOV,SAAU,OAAO,GAAW,KAAa,OAAc;AAC3D,SAAO,KAAM,QAAQ,MAAM,QAAQ,OAAO,GAAG;AAC/C;AAFgB;AAQT,IAAM,UAAU,wBAAC,OAAe,OAAO,OAAO,IAAI,CAAC,KAAK,KAAxC;AAIvB,IAAM,MAAM,wBAAC,SAAe,IAAI,WAAW,IAAI,GAAnC;AACZ,IAAM,OAAO,wBAAC,QAAa,WAAW,KAAK,GAAG,GAAjC;AASP,SAAU,eACd,SACA,UACA,QAAkE;AAElE,MAAI,OAAO,YAAY,YAAY,UAAU;AAAG,UAAM,IAAI,MAAM,0BAA0B;AAC1F,MAAI,OAAO,aAAa,YAAY,WAAW;AAAG,UAAM,IAAI,MAAM,2BAA2B;AAC7F,MAAI,OAAO,WAAW;AAAY,UAAM,IAAI,MAAM,2BAA2B;AAE7E,MAAI,IAAI,IAAI,OAAO;AACnB,MAAI,IAAI,IAAI,OAAO;AACnB,MAAI,IAAI;AACR,QAAM,QAAQ,6BAAK;AACjB,MAAE,KAAK,CAAC;AACR,MAAE,KAAK,CAAC;AACR,QAAI;EACN,GAJc;AAKd,QAAM,IAAI,2BAAI,MAAoB,OAAO,GAAG,GAAG,GAAG,CAAC,GAAzC;AACV,QAAM,SAAS,wBAAC,OAAO,IAAG,MAAM;AAE9B,QAAI,EAAE,KAAK,CAAC,CAAI,CAAC,GAAG,IAAI;AACxB,QAAI,EAAC;AACL,QAAI,KAAK,WAAW;AAAG;AACvB,QAAI,EAAE,KAAK,CAAC,CAAI,CAAC,GAAG,IAAI;AACxB,QAAI,EAAC;EACP,GAPe;AAQf,QAAME,OAAM,6BAAK;AAEf,QAAI,OAAO;AAAM,YAAM,IAAI,MAAM,yBAAyB;AAC1D,QAAI,MAAM;AACV,UAAM,MAAoB,CAAA;AAC1B,WAAO,MAAM,UAAU;AACrB,UAAI,EAAC;AACL,YAAM,KAAK,EAAE,MAAK;AAClB,UAAI,KAAK,EAAE;AACX,aAAO,EAAE;IACX;AACA,WAAO,YAAY,GAAG,GAAG;EAC3B,GAZY;AAaZ,QAAM,WAAW,wBAAC,MAAkB,SAAoB;AACtD,UAAK;AACL,WAAO,IAAI;AACX,QAAI,MAAqB;AACzB,WAAO,EAAE,MAAM,KAAKA,KAAG,CAAE;AAAI,aAAM;AACnC,UAAK;AACL,WAAO;EACT,GAPiB;AAQjB,SAAO;AACT;AAhDgB;AAoDhB,IAAM,eAAe;EACnB,QAAQ,wBAAC,QAAa,OAAO,QAAQ,UAA7B;EACR,UAAU,wBAAC,QAAa,OAAO,QAAQ,YAA7B;EACV,SAAS,wBAAC,QAAa,OAAO,QAAQ,WAA7B;EACT,QAAQ,wBAAC,QAAa,OAAO,QAAQ,UAA7B;EACR,oBAAoB,wBAAC,QAAa,OAAO,QAAQ,YAAYF,SAAQ,GAAG,GAApD;EACpB,eAAe,wBAAC,QAAa,OAAO,cAAc,GAAG,GAAtC;EACf,OAAO,wBAAC,QAAa,MAAM,QAAQ,GAAG,GAA/B;EACP,OAAO,wBAAC,KAAU,WAAiB,OAAe,GAAG,QAAQ,GAAG,GAAzD;EACP,MAAM,wBAAC,QAAa,OAAO,QAAQ,cAAc,OAAO,cAAc,IAAI,SAAS,GAA7E;;AAMF,SAAU,eACd,QACA,YACA,gBAA2B,CAAA,GAAE;AAE7B,QAAM,aAAa,wBAAC,WAAoB,MAAiB,eAAuB;AAC9E,UAAM,WAAW,aAAa,IAAI;AAClC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI,MAAM,sBAAsB,IAAI,sBAAsB;AAElE,UAAM,MAAM,OAAO,SAAgC;AACnD,QAAI,cAAc,QAAQ;AAAW;AACrC,QAAI,CAAC,SAAS,KAAK,MAAM,GAAG;AAC1B,YAAM,IAAI,MACR,iBAAiB,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,OAAO,GAAG,eAAe,IAAI,EAAE;IAEjF;EACF,GAZmB;AAanB,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,UAAU;AAAG,eAAW,WAAW,MAAO,KAAK;AAC9F,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,aAAa;AAAG,eAAW,WAAW,MAAO,IAAI;AAChG,SAAO;AACT;AArBgB;;;ACjShB,SAAS,OAAO,GAAS;AACvB,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAAG,UAAM,IAAI,MAAM,kCAAkC,CAAC,EAAE;AAC9F;AAFS;AASH,SAAUG,SAAQ,GAAU;AAChC,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALgB,OAAAA,UAAA;AAOhB,SAAS,MAAM,MAA8B,SAAiB;AAC5D,MAAI,CAACA,SAAQ,CAAC;AAAG,UAAM,IAAI,MAAM,qBAAqB;AACtD,MAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAAS,EAAE,MAAM;AAClD,UAAM,IAAI,MAAM,iCAAiC,OAAO,mBAAmB,EAAE,MAAM,EAAE;AACzF;AAJS;AAYT,SAAS,KAAK,GAAO;AACnB,MAAI,OAAO,MAAM,cAAc,OAAO,EAAE,WAAW;AACjD,UAAM,IAAI,MAAM,iDAAiD;AACnE,SAAO,EAAE,SAAS;AAClB,SAAO,EAAE,QAAQ;AACnB;AALS;AAOT,SAAS,OAAO,UAAe,gBAAgB,MAAI;AACjD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AAHS;AAIT,SAAS,OAAO,KAAU,UAAa;AACrC,QAAM,GAAG;AACT,QAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,KAAK;AACpB,UAAM,IAAI,MAAM,yDAAyD,GAAG,EAAE;EAChF;AACF;AANS;;;ACvCT,IAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,IAAM,OAAuB,uBAAO,EAAE;AAGtC,SAAS,QAAQ,GAAW,KAAK,OAAK;AACpC,MAAI;AAAI,WAAO,EAAE,GAAG,OAAO,IAAI,UAAU,GAAG,GAAG,OAAQ,KAAK,OAAQ,UAAU,EAAC;AAC/E,SAAO,EAAE,GAAG,OAAQ,KAAK,OAAQ,UAAU,IAAI,GAAG,GAAG,OAAO,IAAI,UAAU,IAAI,EAAC;AACjF;AAHS;AAKT,SAAS,MAAM,KAAe,KAAK,OAAK;AACtC,MAAI,KAAK,IAAI,YAAY,IAAI,MAAM;AACnC,MAAI,KAAK,IAAI,YAAY,IAAI,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,EAAE,GAAG,EAAC,IAAK,QAAQ,IAAI,CAAC,GAAG,EAAE;AACnC,KAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACxB;AACA,SAAO,CAAC,IAAI,EAAE;AAChB;AARS;AAwBT,IAAM,SAAS,wBAAC,GAAW,GAAW,MAAe,KAAK,IAAM,MAAO,KAAK,GAA7D;AACf,IAAM,SAAS,wBAAC,GAAW,GAAW,MAAe,KAAK,IAAM,MAAO,KAAK,GAA7D;AAEf,IAAM,SAAS,wBAAC,GAAW,GAAW,MAAe,KAAM,IAAI,KAAQ,MAAO,KAAK,GAApE;AACf,IAAM,SAAS,wBAAC,GAAW,GAAW,MAAe,KAAM,IAAI,KAAQ,MAAO,KAAK,GAApE;;;ACjCf,YAAY,QAAQ;AACb,IAAM,SACX,MAAM,OAAO,OAAO,YAAY,eAAe,KAAS,eAAoB;;;ACmBvE,IAAM,MAAM,wBAAC,QAClB,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC,GADzD;AAIZ,IAAM,aAAa,wBAAC,QACzB,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU,GAD/B;AAInB,IAAM,OAAO,wBAAC,MAAc,UAAmB,QAAS,KAAK,QAAW,SAAS,OAApE;AAKb,IAAM,OAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAEzE,IAAM,WAAW,wBAAC,SACrB,QAAQ,KAAM,aACd,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM,KAJK;AASlB,SAAU,WAAW,KAAgB;AACzC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,CAAC,IAAI,SAAS,IAAI,CAAC,CAAC;EAC1B;AACF;AAJgB;AA8EV,SAAUC,aAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,oCAAoC,OAAO,GAAG,EAAE;AAC7F,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAHgB,OAAAA,cAAA;AAWV,SAAU,QAAQ,MAAW;AACjC,MAAI,OAAO,SAAS;AAAU,WAAOA,aAAY,IAAI;AACrD,QAAO,IAAI;AACX,SAAO;AACT;AAJgB;AASV,SAAUC,gBAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,UAAO,CAAC;AACR,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAdgB,OAAAA,cAAA;AAiBV,IAAgB,OAAhB,MAAoB;EApK1B,OAoK0B;;;;EAsBxB,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAcF,IAAM,QAAQ,CAAA,EAAG;AAcX,SAAU,gBAAmC,UAAuB;AACxE,QAAM,QAAQ,wBAAC,QAA2B,SAAQ,EAAG,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM,GAAlE;AACd,QAAM,MAAM,SAAQ;AACpB,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,MAAM,SAAQ;AAC7B,SAAO;AACT;AAPgB;AAoBV,SAAU,2BACd,UAAkC;AAElC,QAAM,QAAQ,wBAAC,KAAY,SAAyB,SAAS,IAAI,EAAE,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM,GAAhF;AACd,QAAM,MAAM,SAAS,CAAA,CAAO;AAC5B,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,CAAC,SAAY,SAAS,IAAI;AACzC,SAAO;AACT;AATgB;AAcV,SAAU,YAAY,cAAc,IAAE;AAC1C,MAAI,UAAU,OAAO,OAAO,oBAAoB,YAAY;AAC1D,WAAO,OAAO,gBAAgB,IAAI,WAAW,WAAW,CAAC;EAC3D;AACA,QAAM,IAAI,MAAM,wCAAwC;AAC1D;AALgB;;;ACxOhB,IAAM,UAAoB,CAAA;AAC1B,IAAM,YAAsB,CAAA;AAC5B,IAAM,aAAuB,CAAA;AAC7B,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAM,MAAsB,uBAAO,CAAC;AACpC,IAAM,QAAwB,uBAAO,GAAG;AACxC,IAAM,SAAyB,uBAAO,GAAI;AAC1C,SAAS,QAAQ,GAAG,IAAID,MAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,SAAS;AAE9D,GAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC;AAChC,UAAQ,KAAK,KAAK,IAAI,IAAI,EAAE;AAE5B,YAAU,MAAQ,QAAQ,MAAM,QAAQ,KAAM,IAAK,EAAE;AAErD,MAAI,IAAID;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAM,KAAKC,QAAS,KAAK,OAAO,UAAW;AAC3C,QAAI,IAAIC;AAAK,WAAKD,SAASA,QAAuB,uBAAO,CAAC,KAAKA;EACjE;AACA,aAAW,KAAK,CAAC;AACnB;AACA,IAAM,CAAC,aAAa,WAAW,IAAoB,sBAAM,YAAY,IAAI;AAGzE,IAAM,QAAQ,wBAAC,GAAW,GAAW,MAAe,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,CAAC,GAA/E;AACd,IAAM,QAAQ,wBAAC,GAAW,GAAW,MAAe,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,CAAC,GAA/E;AAGR,SAAU,QAAQ,GAAgB,SAAiB,IAAE;AACzD,QAAM,IAAI,IAAI,YAAY,IAAI,CAAC;AAE/B,WAAS,QAAQ,KAAK,QAAQ,QAAQ,IAAI,SAAS;AAEjD,aAAS,IAAI,GAAG,IAAI,IAAI;AAAK,QAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AACvF,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9B,YAAM,QAAQ,IAAI,KAAK;AACvB,YAAM,QAAQ,IAAI,KAAK;AACvB,YAAM,KAAK,EAAE,IAAI;AACjB,YAAM,KAAK,EAAE,OAAO,CAAC;AACrB,YAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI;AACpC,YAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;AACxC,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;AAC/B,UAAE,IAAI,CAAC,KAAK;AACZ,UAAE,IAAI,IAAI,CAAC,KAAK;MAClB;IACF;AAEA,QAAI,OAAO,EAAE,CAAC;AACd,QAAI,OAAO,EAAE,CAAC;AACd,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,QAAQ,UAAU,CAAC;AACzB,YAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,YAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,YAAM,KAAK,QAAQ,CAAC;AACpB,aAAO,EAAE,EAAE;AACX,aAAO,EAAE,KAAK,CAAC;AACf,QAAE,EAAE,IAAI;AACR,QAAE,KAAK,CAAC,IAAI;IACd;AAEA,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;AAC/B,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,UAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAC3C,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,UAAE,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,KAAK,EAAE,IAAI,GAAG,IAAI,KAAK,EAAE;IAC5E;AAEA,MAAE,CAAC,KAAK,YAAY,KAAK;AACzB,MAAE,CAAC,KAAK,YAAY,KAAK;EAC3B;AACA,IAAE,KAAK,CAAC;AACV;AAzCgB;AA2CV,IAAO,SAAP,MAAO,gBAAe,KAAY;EA3FxC,OA2FwC;;;;EAQtC,YACS,UACA,QACA,WACG,YAAY,OACZ,SAAiB,IAAE;AAE7B,UAAK;AANE,SAAA,WAAA;AACA,SAAA,SAAA;AACA,SAAA,YAAA;AACG,SAAA,YAAA;AACA,SAAA,SAAA;AAXF,SAAA,MAAM;AACN,SAAA,SAAS;AACT,SAAA,WAAW;AAEX,SAAA,YAAY;AAWpB,WAAO,SAAS;AAEhB,QAAI,KAAK,KAAK,YAAY,KAAK,YAAY;AACzC,YAAM,IAAI,MAAM,0CAA0C;AAC5D,SAAK,QAAQ,IAAI,WAAW,GAAG;AAC/B,SAAK,UAAU,IAAI,KAAK,KAAK;EAC/B;EACU,SAAM;AACd,QAAI,CAAC;AAAM,iBAAW,KAAK,OAAO;AAClC,YAAQ,KAAK,SAAS,KAAK,MAAM;AACjC,QAAI,CAAC;AAAM,iBAAW,KAAK,OAAO;AAClC,SAAK,SAAS;AACd,SAAK,MAAM;EACb;EACA,OAAO,MAAW;AAChB,WAAO,IAAI;AACX,UAAM,EAAE,UAAU,MAAK,IAAK;AAC5B,WAAO,QAAQ,IAAI;AACnB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AACpD,eAAS,IAAI,GAAG,IAAI,MAAM;AAAK,cAAM,KAAK,KAAK,KAAK,KAAK,KAAK;AAC9D,UAAI,KAAK,QAAQ;AAAU,aAAK,OAAM;IACxC;AACA,WAAO;EACT;EACU,SAAM;AACd,QAAI,KAAK;AAAU;AACnB,SAAK,WAAW;AAChB,UAAM,EAAE,OAAO,QAAQ,KAAK,SAAQ,IAAK;AAEzC,UAAM,GAAG,KAAK;AACd,SAAK,SAAS,SAAU,KAAK,QAAQ,WAAW;AAAG,WAAK,OAAM;AAC9D,UAAM,WAAW,CAAC,KAAK;AACvB,SAAK,OAAM;EACb;EACU,UAAU,KAAe;AACjC,WAAO,MAAM,KAAK;AAClB,UAAM,GAAG;AACT,SAAK,OAAM;AACX,UAAM,YAAY,KAAK;AACvB,UAAM,EAAE,SAAQ,IAAK;AACrB,aAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,MAAM,OAAO;AAC/C,UAAI,KAAK,UAAU;AAAU,aAAK,OAAM;AACxC,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,QAAQ,MAAM,GAAG;AACvD,UAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS,IAAI,GAAG,GAAG;AAChE,WAAK,UAAU;AACf,aAAO;IACT;AACA,WAAO;EACT;EACA,QAAQ,KAAe;AAErB,QAAI,CAAC,KAAK;AAAW,YAAM,IAAI,MAAM,uCAAuC;AAC5E,WAAO,KAAK,UAAU,GAAG;EAC3B;EACA,IAAIE,QAAa;AACf,WAAOA,MAAK;AACZ,WAAO,KAAK,QAAQ,IAAI,WAAWA,MAAK,CAAC;EAC3C;EACA,WAAW,KAAe;AACxB,WAAO,KAAK,IAAI;AAChB,QAAI,KAAK;AAAU,YAAM,IAAI,MAAM,6BAA6B;AAChE,SAAK,UAAU,GAAG;AAClB,SAAK,QAAO;AACZ,WAAO;EACT;EACA,SAAM;AACJ,WAAO,KAAK,WAAW,IAAI,WAAW,KAAK,SAAS,CAAC;EACvD;EACA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,MAAM,KAAK,CAAC;EACnB;EACA,WAAW,IAAW;AACpB,UAAM,EAAE,UAAU,QAAQ,WAAW,QAAQ,UAAS,IAAK;AAC3D,WAAA,KAAO,IAAI,QAAO,UAAU,QAAQ,WAAW,WAAW,MAAM;AAChE,OAAG,QAAQ,IAAI,KAAK,OAAO;AAC3B,OAAG,MAAM,KAAK;AACd,OAAG,SAAS,KAAK;AACjB,OAAG,WAAW,KAAK;AACnB,OAAG,SAAS;AAEZ,OAAG,SAAS;AACZ,OAAG,YAAY;AACf,OAAG,YAAY;AACf,OAAG,YAAY,KAAK;AACpB,WAAO;EACT;;AAGF,IAAM,MAAM,wBAAC,QAAgB,UAAkB,cAC7C,gBAAgB,MAAM,IAAI,OAAO,UAAU,QAAQ,SAAS,CAAC,GADnD;AAGL,IAAM,WAA2B,oBAAI,GAAM,KAAK,MAAM,CAAC;AAKvD,IAAM,WAA2B,oBAAI,GAAM,KAAK,MAAM,CAAC;AACvD,IAAM,WAA2B,oBAAI,GAAM,KAAK,MAAM,CAAC;AACvD,IAAM,WAA2B,oBAAI,GAAM,IAAI,MAAM,CAAC;AACtD,IAAM,aAA6B,oBAAI,GAAM,KAAK,MAAM,CAAC;AAKzD,IAAM,aAA6B,oBAAI,GAAM,KAAK,MAAM,CAAC;AACzD,IAAM,aAA6B,oBAAI,GAAM,KAAK,MAAM,CAAC;AACzD,IAAM,aAA6B,oBAAI,GAAM,IAAI,MAAM,CAAC;AAI/D,IAAM,WAAW,wBAAC,QAAgB,UAAkB,cAClD,2BACE,CAAC,OAAkB,CAAA,MACjB,IAAI,OAAO,UAAU,QAAQ,KAAK,UAAU,SAAY,YAAY,KAAK,OAAO,IAAI,CAAC,GAH1E;AAMV,IAAM,WAA2B,yBAAS,IAAM,KAAK,MAAM,CAAC;AAC5D,IAAM,WAA2B,yBAAS,IAAM,KAAK,MAAM,CAAC;;;ACpOnE,IAAAC,eAAA;AAAA,SAAAA,cAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA,SAASC,QAAO,GAAS;AACvB,MAAI,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI;AAAG,UAAM,IAAI,MAAM,2BAA2B,CAAC,EAAE;AACvF;AAFS,OAAAA,SAAA;AAST,SAASC,SAAQ,GAAU;AACzB,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALS,OAAAA,UAAA;AAOT,SAASC,OAAM,MAA8B,SAAiB;AAC5D,MAAI,CAACD,SAAQ,CAAC;AAAG,UAAM,IAAI,MAAM,qBAAqB;AACtD,MAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAAS,EAAE,MAAM;AAClD,UAAM,IAAI,MAAM,iCAAiC,OAAO,mBAAmB,EAAE,MAAM,EAAE;AACzF;AAJS,OAAAC,QAAA;AAYT,SAASC,MAAKA,OAAU;AACtB,MAAI,OAAOA,UAAS,cAAc,OAAOA,MAAK,WAAW;AACvD,UAAM,IAAI,MAAM,iDAAiD;AACnE,EAAAC,QAAOD,MAAK,SAAS;AACrB,EAAAC,QAAOD,MAAK,QAAQ;AACtB;AALS,OAAAA,OAAA;AAOT,SAASE,QAAO,UAAe,gBAAgB,MAAI;AACjD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AAHS,OAAAA,SAAA;AAIT,SAASC,QAAO,KAAU,UAAa;AACrC,EAAAJ,OAAM,GAAG;AACT,QAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,KAAK;AACpB,UAAM,IAAI,MAAM,yDAAyD,GAAG,EAAE;EAChF;AACF;AANS,OAAAI,SAAA;;;ACvCT,IAAMC,cAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,IAAMC,QAAuB,uBAAO,EAAE;AAGtC,SAASC,SAAQ,GAAW,KAAK,OAAK;AACpC,MAAI;AAAI,WAAO,EAAE,GAAG,OAAO,IAAIF,WAAU,GAAG,GAAG,OAAQ,KAAKC,QAAQD,WAAU,EAAC;AAC/E,SAAO,EAAE,GAAG,OAAQ,KAAKC,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAO,IAAIA,WAAU,IAAI,EAAC;AACjF;AAHS,OAAAE,UAAA;AAKT,SAASC,OAAM,KAAe,KAAK,OAAK;AACtC,MAAI,KAAK,IAAI,YAAY,IAAI,MAAM;AACnC,MAAI,KAAK,IAAI,YAAY,IAAI,MAAM;AACnC,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,EAAE,GAAG,EAAC,IAAKD,SAAQ,IAAI,CAAC,GAAG,EAAE;AACnC,KAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACxB;AACA,SAAO,CAAC,IAAI,EAAE;AAChB;AARS,OAAAC,QAAA;AAwBT,IAAMC,UAAS,wBAAC,GAAW,GAAW,MAAe,KAAK,IAAM,MAAO,KAAK,GAA7D;AACf,IAAMC,UAAS,wBAAC,GAAW,GAAW,MAAe,KAAK,IAAM,MAAO,KAAK,GAA7D;AAEf,IAAMC,UAAS,wBAAC,GAAW,GAAW,MAAe,KAAM,IAAI,KAAQ,MAAO,KAAK,GAApE;AACf,IAAMC,UAAS,wBAAC,GAAW,GAAW,MAAe,KAAM,IAAI,KAAQ,MAAO,KAAK,GAApE;;;ACjCf,YAAYC,SAAQ;AACb,IAAMC,UACXD,OAAM,OAAOA,QAAO,YAAY,eAAeA,MAAS,gBAAoB;;;ACUvE,IAAME,OAAM,wBAAC,QAClB,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC,GADzD;AAGnB,SAASC,SAAQ,GAAU;AACzB,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALS,OAAAA,UAAA;AAQF,IAAMC,cAAa,wBAAC,QACzB,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU,GAD/B;AAInB,IAAMC,QAAO,wBAAC,MAAc,UAAmB,QAAS,KAAK,QAAW,SAAS,OAApE;AAMb,IAAMC,QAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAChF,IAAI,CAACA;AAAM,QAAM,IAAI,MAAM,6CAA6C;AA0ElE,SAAUC,aAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,oCAAoC,OAAO,GAAG,EAAE;AAC7F,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAHgB,OAAAA,cAAA;AAWV,SAAUC,SAAQ,MAAW;AACjC,MAAI,OAAO,SAAS;AAAU,WAAOD,aAAY,IAAI;AACrD,MAAI,CAACE,SAAQ,IAAI;AAAG,UAAM,IAAI,MAAM,4BAA4B,OAAO,IAAI,EAAE;AAC7E,SAAO;AACT;AAJgB,OAAAD,UAAA;AASV,SAAUE,gBAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAACD,SAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,qBAAqB;AACtD,WAAO,EAAE;EACX;AACA,QAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,WAAS,IAAI,GAAG,MAAM,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC/C,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAdgB,OAAAC,cAAA;AAiBV,IAAgBC,QAAhB,MAAoB;EArJ1B,OAqJ0B;;;;EAsBxB,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAcF,IAAMC,SAAQ,CAAA,EAAG;AAcX,SAAUC,iBAAmC,UAAuB;AACxE,QAAM,QAAQ,wBAAC,QAA2B,SAAQ,EAAG,OAAOC,SAAQ,GAAG,CAAC,EAAE,OAAM,GAAlE;AACd,QAAM,MAAM,SAAQ;AACpB,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,MAAM,SAAQ;AAC7B,SAAO;AACT;AAPgB,OAAAD,kBAAA;AAoBV,SAAUE,4BACd,UAAkC;AAElC,QAAM,QAAQ,wBAAC,KAAY,SAAyB,SAAS,IAAI,EAAE,OAAOC,SAAQ,GAAG,CAAC,EAAE,OAAM,GAAhF;AACd,QAAM,MAAM,SAAS,CAAA,CAAO;AAC5B,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,CAAC,SAAY,SAAS,IAAI;AACzC,SAAO;AACT;AATgB,OAAAD,6BAAA;AAcV,SAAUE,aAAY,cAAc,IAAE;AAC1C,MAAIC,WAAU,OAAOA,QAAO,oBAAoB,YAAY;AAC1D,WAAOA,QAAO,gBAAgB,IAAI,WAAW,WAAW,CAAC;EAC3D;AACA,QAAM,IAAI,MAAM,wCAAwC;AAC1D;AALgB,OAAAD,cAAA;;;AC3NhB,IAAM,CAACE,UAASC,YAAWC,WAAU,IAAoC,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA,CAAE;AACpF,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,OAAsB,uBAAO,CAAC;AACpC,IAAMC,SAAwB,uBAAO,GAAG;AACxC,IAAMC,UAAyB,uBAAO,GAAI;AAC1C,SAAS,QAAQ,GAAG,IAAIJ,MAAK,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,SAAS;AAE9D,GAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC;AAChC,EAAAJ,SAAQ,KAAK,KAAK,IAAI,IAAI,EAAE;AAE5B,EAAAC,WAAU,MAAQ,QAAQ,MAAM,QAAQ,KAAM,IAAK,EAAE;AAErD,MAAI,IAAIE;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAM,KAAKC,QAAS,KAAKE,QAAOE,WAAWD;AAC3C,QAAI,IAAIF;AAAK,WAAKD,SAASA,QAAuB,uBAAO,CAAC,KAAKA;EACjE;AACA,EAAAF,YAAW,KAAK,CAAC;AACnB;AACA,IAAM,CAACO,cAAaC,YAAW,IAAoB,gBAAAC,OAAMT,aAAY,IAAI;AAGzE,IAAMU,SAAQ,wBAAC,GAAW,GAAW,MAAe,IAAI,KAAKC,QAAO,GAAG,GAAG,CAAC,IAAIC,QAAO,GAAG,GAAG,CAAC,GAA/E;AACd,IAAMC,SAAQ,wBAAC,GAAW,GAAW,MAAe,IAAI,KAAKC,QAAO,GAAG,GAAG,CAAC,IAAIC,QAAO,GAAG,GAAG,CAAC,GAA/E;AAGR,SAAUC,SAAQ,GAAgB,SAAiB,IAAE;AACzD,QAAM,IAAI,IAAI,YAAY,IAAI,CAAC;AAE/B,WAAS,QAAQ,KAAK,QAAQ,QAAQ,IAAI,SAAS;AAEjD,aAAS,IAAI,GAAG,IAAI,IAAI;AAAK,QAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AACvF,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9B,YAAM,QAAQ,IAAI,KAAK;AACvB,YAAM,QAAQ,IAAI,KAAK;AACvB,YAAM,KAAK,EAAE,IAAI;AACjB,YAAM,KAAK,EAAE,OAAO,CAAC;AACrB,YAAM,KAAKN,OAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI;AACpC,YAAM,KAAKG,OAAM,IAAI,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC;AACxC,eAAS,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;AAC/B,UAAE,IAAI,CAAC,KAAK;AACZ,UAAE,IAAI,IAAI,CAAC,KAAK;MAClB;IACF;AAEA,QAAI,OAAO,EAAE,CAAC;AACd,QAAI,OAAO,EAAE,CAAC;AACd,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,QAAQd,WAAU,CAAC;AACzB,YAAM,KAAKW,OAAM,MAAM,MAAM,KAAK;AAClC,YAAM,KAAKG,OAAM,MAAM,MAAM,KAAK;AAClC,YAAM,KAAKf,SAAQ,CAAC;AACpB,aAAO,EAAE,EAAE;AACX,aAAO,EAAE,KAAK,CAAC;AACf,QAAE,EAAE,IAAI;AACR,QAAE,KAAK,CAAC,IAAI;IACd;AAEA,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI;AAC/B,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,UAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAC3C,eAAS,IAAI,GAAG,IAAI,IAAI;AAAK,UAAE,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,KAAK,EAAE,IAAI,GAAG,IAAI,KAAK,EAAE;IAC5E;AAEA,MAAE,CAAC,KAAKS,aAAY,KAAK;AACzB,MAAE,CAAC,KAAKC,aAAY,KAAK;EAC3B;AACA,IAAE,KAAK,CAAC;AACV;AAzCgB,OAAAQ,UAAA;AA2CV,IAAOC,UAAP,MAAO,gBAAeC,MAAY;EAvFxC,OAuFwC;;;;EAQtC,YACS,UACA,QACA,WACG,YAAY,OACZ,SAAiB,IAAE;AAE7B,UAAK;AANE,SAAA,WAAA;AACA,SAAA,SAAA;AACA,SAAA,YAAA;AACG,SAAA,YAAA;AACA,SAAA,SAAA;AAXF,SAAA,MAAM;AACN,SAAA,SAAS;AACT,SAAA,WAAW;AAEX,SAAA,YAAY;AAWpB,IAAAC,QAAO,SAAS;AAEhB,QAAI,KAAK,KAAK,YAAY,KAAK,YAAY;AACzC,YAAM,IAAI,MAAM,0CAA0C;AAC5D,SAAK,QAAQ,IAAI,WAAW,GAAG;AAC/B,SAAK,UAAUC,KAAI,KAAK,KAAK;EAC/B;EACU,SAAM;AACd,IAAAJ,SAAQ,KAAK,SAAS,KAAK,MAAM;AACjC,SAAK,SAAS;AACd,SAAK,MAAM;EACb;EACA,OAAO,MAAW;AAChB,IAAAK,QAAO,IAAI;AACX,UAAM,EAAE,UAAU,MAAK,IAAK;AAC5B,WAAOC,SAAQ,IAAI;AACnB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AACpD,eAAS,IAAI,GAAG,IAAI,MAAM;AAAK,cAAM,KAAK,KAAK,KAAK,KAAK,KAAK;AAC9D,UAAI,KAAK,QAAQ;AAAU,aAAK,OAAM;IACxC;AACA,WAAO;EACT;EACU,SAAM;AACd,QAAI,KAAK;AAAU;AACnB,SAAK,WAAW;AAChB,UAAM,EAAE,OAAO,QAAQ,KAAK,SAAQ,IAAK;AAEzC,UAAM,GAAG,KAAK;AACd,SAAK,SAAS,SAAU,KAAK,QAAQ,WAAW;AAAG,WAAK,OAAM;AAC9D,UAAM,WAAW,CAAC,KAAK;AACvB,SAAK,OAAM;EACb;EACU,UAAU,KAAe;AACjC,IAAAD,QAAO,MAAM,KAAK;AAClB,IAAAE,OAAM,GAAG;AACT,SAAK,OAAM;AACX,UAAM,YAAY,KAAK;AACvB,UAAM,EAAE,SAAQ,IAAK;AACrB,aAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,MAAM,OAAO;AAC/C,UAAI,KAAK,UAAU;AAAU,aAAK,OAAM;AACxC,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,QAAQ,MAAM,GAAG;AACvD,UAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS,IAAI,GAAG,GAAG;AAChE,WAAK,UAAU;AACf,aAAO;IACT;AACA,WAAO;EACT;EACA,QAAQ,KAAe;AAErB,QAAI,CAAC,KAAK;AAAW,YAAM,IAAI,MAAM,uCAAuC;AAC5E,WAAO,KAAK,UAAU,GAAG;EAC3B;EACA,IAAIA,QAAa;AACf,IAAAJ,QAAOI,MAAK;AACZ,WAAO,KAAK,QAAQ,IAAI,WAAWA,MAAK,CAAC;EAC3C;EACA,WAAW,KAAe;AACxB,IAAAC,QAAO,KAAK,IAAI;AAChB,QAAI,KAAK;AAAU,YAAM,IAAI,MAAM,6BAA6B;AAChE,SAAK,UAAU,GAAG;AAClB,SAAK,QAAO;AACZ,WAAO;EACT;EACA,SAAM;AACJ,WAAO,KAAK,WAAW,IAAI,WAAW,KAAK,SAAS,CAAC;EACvD;EACA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,MAAM,KAAK,CAAC;EACnB;EACA,WAAW,IAAW;AACpB,UAAM,EAAE,UAAU,QAAQ,WAAW,QAAQ,UAAS,IAAK;AAC3D,WAAA,KAAO,IAAI,QAAO,UAAU,QAAQ,WAAW,WAAW,MAAM;AAChE,OAAG,QAAQ,IAAI,KAAK,OAAO;AAC3B,OAAG,MAAM,KAAK;AACd,OAAG,SAAS,KAAK;AACjB,OAAG,WAAW,KAAK;AACnB,OAAG,SAAS;AAEZ,OAAG,SAAS;AACZ,OAAG,YAAY;AACf,OAAG,YAAY;AACf,OAAG,YAAY,KAAK;AACpB,WAAO;EACT;;AAGF,IAAMC,OAAM,wBAAC,QAAgB,UAAkB,cAC7CC,iBAAgB,MAAM,IAAIT,QAAO,UAAU,QAAQ,SAAS,CAAC,GADnD;AAGL,IAAMU,YAA2B,gBAAAF,KAAI,GAAM,KAAK,MAAM,CAAC;AAKvD,IAAMG,YAA2B,gBAAAH,KAAI,GAAM,KAAK,MAAM,CAAC;AACvD,IAAMI,YAA2B,gBAAAJ,KAAI,GAAM,KAAK,MAAM,CAAC;AACvD,IAAMK,YAA2B,gBAAAL,KAAI,GAAM,IAAI,MAAM,CAAC;AACtD,IAAMM,cAA6B,gBAAAN,KAAI,GAAM,KAAK,MAAM,CAAC;AAKzD,IAAMO,cAA6B,gBAAAP,KAAI,GAAM,KAAK,MAAM,CAAC;AACzD,IAAMQ,cAA6B,gBAAAR,KAAI,GAAM,KAAK,MAAM,CAAC;AACzD,IAAMS,cAA6B,gBAAAT,KAAI,GAAM,IAAI,MAAM,CAAC;AAI/D,IAAMU,YAAW,wBAAC,QAAgB,UAAkB,cAClDC,4BACE,CAAC,OAAkB,CAAA,MACjB,IAAInB,QAAO,UAAU,QAAQ,KAAK,UAAU,SAAY,YAAY,KAAK,OAAO,IAAI,CAAC,GAH1E;AAMV,IAAMoB,YAA2B,gBAAAF,UAAS,IAAM,KAAK,MAAM,CAAC;AAC5D,IAAMG,YAA2B,gBAAAH,UAAS,IAAM,KAAK,MAAM,CAAC;;;AC1NnE,SAAS,aAAa,MAAgB,YAAoB,OAAeI,OAAa;AACpF,MAAI,OAAO,KAAK,iBAAiB;AAAY,WAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,QAAMC,QAAO,OAAO,EAAE;AACtB,QAAM,WAAW,OAAO,UAAU;AAClC,QAAM,KAAK,OAAQ,SAASA,QAAQ,QAAQ;AAC5C,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,IAAID,QAAO,IAAI;AACrB,QAAM,IAAIA,QAAO,IAAI;AACrB,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACvC,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACzC;AAVS;AAaH,IAAgB,OAAhB,cAAgDE,MAAO;EAjB7D,OAiB6D;;;EAc3D,YACW,UACF,WACE,WACAF,OAAa;AAEtB,UAAK;AALI,SAAA,WAAA;AACF,SAAA,YAAA;AACE,SAAA,YAAA;AACA,SAAA,OAAAA;AATD,SAAA,WAAW;AACX,SAAA,SAAS;AACT,SAAA,MAAM;AACN,SAAA,YAAY;AASpB,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAOG,YAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAW;AAChB,IAAAC,QAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,WAAOC,SAAQ,IAAI;AACnB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACrB,cAAM,WAAWF,YAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQ,UAAU,GAAG;AACzE;MACF;AACA,aAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAe;AACxB,IAAAC,QAAO,IAAI;AACX,IAAAE,QAAO,KAAK,IAAI;AAChB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAQ,MAAM,UAAU,MAAAN,MAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,WAAO,KAAK,IAAI;AAChB,SAAK,OAAO,SAAS,GAAG,EAAE,KAAK,CAAC;AAEhC,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,aAAO,CAAC,IAAI;AAIjD,iBAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGA,KAAI;AAC9D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQG,YAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,6CAA6C;AAC1E,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAG;AACtB,QAAI,SAAS,MAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAGH,KAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,SAAK,WAAW,MAAM;AACtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,WAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,SAAS;AACZ,OAAG,MAAM;AACT,OAAG,WAAW;AACd,OAAG,YAAY;AACf,QAAI,SAAS;AAAU,SAAG,OAAO,IAAI,MAAM;AAC3C,WAAO;EACT;;;;AC7GF,IAAM,MAAM,wBAAC,GAAW,GAAW,MAAe,IAAI,IAAM,CAAC,IAAI,GAArD;AAEZ,IAAM,MAAM,wBAAC,GAAW,GAAW,MAAe,IAAI,IAAM,IAAI,IAAM,IAAI,GAA9D;AAKZ,IAAM,WAA0B,oBAAI,YAAY;EAC9C;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAID,IAAM,KAAoB,oBAAI,YAAY;EACxC;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAID,IAAM,WAA2B,oBAAI,YAAY,EAAE;AACnD,IAAM,SAAN,cAAqB,KAAY;EAlCjC,OAkCiC;;;EAY/B,cAAA;AACE,UAAM,IAAI,IAAI,GAAG,KAAK;AAVxB,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;EAIZ;EACU,MAAG;AACX,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AACnC,WAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EAChC;;EAEU,IACR,GAAW,GAAW,GAAW,GAAW,GAAW,GAAW,GAAW,GAAS;AAEtF,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;EACf;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU;AAAG,eAAS,CAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,MAAM,SAAS,IAAI,EAAE;AAC3B,YAAM,KAAK,SAAS,IAAI,CAAC;AACzB,YAAM,KAAKO,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,YAAM,KAAKA,MAAK,IAAI,EAAE,IAAIA,MAAK,IAAI,EAAE,IAAK,OAAO;AACjD,eAAS,CAAC,IAAK,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAK;IACjE;AAEA,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AACjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,SAASA,MAAK,GAAG,CAAC,IAAIA,MAAK,GAAG,EAAE,IAAIA,MAAK,GAAG,EAAE;AACpD,YAAM,KAAM,IAAI,SAAS,IAAI,GAAG,GAAG,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC,IAAK;AACrE,YAAM,SAASA,MAAK,GAAG,CAAC,IAAIA,MAAK,GAAG,EAAE,IAAIA,MAAK,GAAG,EAAE;AACpD,YAAM,KAAM,SAAS,IAAI,GAAG,GAAG,CAAC,IAAK;AACrC,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,IAAI,KAAM;AACf,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,KAAK,KAAM;IAClB;AAEA,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EACjC;EACU,aAAU;AAClB,aAAS,KAAK,CAAC;EACjB;EACA,UAAO;AACL,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,SAAK,OAAO,KAAK,CAAC;EACpB;;AAsBK,IAAM,SAAyB,gBAAAC,iBAAgB,MAAM,IAAI,OAAM,CAAE;;;ACnIxE,IAAAC,iBAAA;SAAAA,gBAAA;gBAAAC;EAAA,cAAAC;EAAA,eAAAC;EAAA,cAAAC;EAAA,kBAAAC;EAAA,uBAAAC;EAAA,uBAAAC;EAAA,mBAAAC;EAAA,sBAAAC;EAAA,mBAAAC;EAAA,kBAAAC;EAAA,kBAAAC;EAAA,mBAAAC;EAAA,eAAAC;EAAA,uBAAAC;EAAA,uBAAAC;EAAA,2BAAAC;EAAA,0BAAAC;EAAA,mBAAAC;EAAA,sBAAAC;;AAKA,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AAWd,SAAUC,SAAQ,GAAU;AAChC,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AALgB,OAAAA,UAAA;AAQhB,IAAMC,SAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAG,MAC5D,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAK3B,SAAUC,YAAWC,QAAiB;AAC1C,MAAI,CAACH,SAAQG,MAAK;AAAG,UAAM,IAAI,MAAM,qBAAqB;AAE1D,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAIA,OAAM,QAAQ,KAAK;AACrC,WAAOF,OAAME,OAAM,CAAC,CAAC;EACvB;AACA,SAAO;AACT;AARgB,OAAAD,aAAA;AAUV,SAAUE,qBAAoB,KAAoB;AACtD,QAAM,MAAM,IAAI,SAAS,EAAE;AAC3B,SAAO,IAAI,SAAS,IAAI,IAAI,GAAG,KAAK;AACtC;AAHgB,OAAAA,sBAAA;AAKV,SAAUC,aAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,SAAO,OAAO,QAAQ,KAAK,MAAM,KAAK,GAAG,EAAE;AAC7C;AAJgB,OAAAA,cAAA;AAOhB,IAAMC,UAAS,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAG;AAChE,SAASC,eAAc,MAAY;AACjC,MAAI,QAAQD,QAAO,MAAM,QAAQA,QAAO;AAAI,WAAO,OAAOA,QAAO;AACjE,MAAI,QAAQA,QAAO,MAAM,QAAQA,QAAO;AAAI,WAAO,QAAQA,QAAO,KAAK;AACvE,MAAI,QAAQA,QAAO,MAAM,QAAQA,QAAO;AAAI,WAAO,QAAQA,QAAO,KAAK;AACvE;AACF;AALS,OAAAC,gBAAA;AAUH,SAAUC,YAAW,KAAW;AACpC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,QAAM,KAAK,IAAI;AACf,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK;AAAG,UAAM,IAAI,MAAM,4DAA4D,EAAE;AAC1F,QAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,WAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,UAAM,KAAKD,eAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,UAAM,KAAKA,eAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,QAAI,OAAO,UAAa,OAAO,QAAW;AACxC,YAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;IAC5F;AACA,UAAM,EAAE,IAAI,KAAK,KAAK;EACxB;AACA,SAAO;AACT;AAhBgB,OAAAC,aAAA;AAmBV,SAAUC,iBAAgBN,QAAiB;AAC/C,SAAOE,aAAYH,YAAWC,MAAK,CAAC;AACtC;AAFgB,OAAAM,kBAAA;AAGV,SAAUC,iBAAgBP,QAAiB;AAC/C,MAAI,CAACH,SAAQG,MAAK;AAAG,UAAM,IAAI,MAAM,qBAAqB;AAC1D,SAAOE,aAAYH,YAAW,WAAW,KAAKC,MAAK,EAAE,QAAO,CAAE,CAAC;AACjE;AAHgB,OAAAO,kBAAA;AAKV,SAAUC,iBAAgB,GAAoB,KAAW;AAC7D,SAAOH,YAAW,EAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AACzD;AAFgB,OAAAG,kBAAA;AAGV,SAAUC,iBAAgB,GAAoB,KAAW;AAC7D,SAAOD,iBAAgB,GAAG,GAAG,EAAE,QAAO;AACxC;AAFgB,OAAAC,kBAAA;AAIV,SAAUC,oBAAmB,GAAkB;AACnD,SAAOL,YAAWJ,qBAAoB,CAAC,CAAC;AAC1C;AAFgB,OAAAS,qBAAA;AAaV,SAAUC,aAAY,OAAe,KAAU,gBAAuB;AAC1E,MAAI;AACJ,MAAI,OAAO,QAAQ,UAAU;AAC3B,QAAI;AACF,YAAMN,YAAW,GAAG;IACtB,SAAS,GAAG;AACV,YAAM,IAAI,MAAM,GAAG,KAAK,mCAAmC,GAAG,aAAa,CAAC,EAAE;IAChF;EACF,WAAWR,SAAQ,GAAG,GAAG;AAGvB,UAAM,WAAW,KAAK,GAAG;EAC3B,OAAO;AACL,UAAM,IAAI,MAAM,GAAG,KAAK,mCAAmC;EAC7D;AACA,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,mBAAmB,YAAY,QAAQ;AAChD,UAAM,IAAI,MAAM,GAAG,KAAK,aAAa,cAAc,eAAe,GAAG,EAAE;AACzE,SAAO;AACT;AAnBgB,OAAAc,cAAA;AAwBV,SAAUC,gBAAe,QAAoB;AACjD,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,CAACf,SAAQ,CAAC;AAAG,YAAM,IAAI,MAAM,qBAAqB;AACtD,WAAO,EAAE;EACX;AACA,MAAI,MAAM,IAAI,WAAW,GAAG;AAC5B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,IAAI,GAAG,GAAG;AACd,WAAO,EAAE;EACX;AACA,SAAO;AACT;AAfgB,OAAAe,cAAA;AAkBV,SAAUC,YAAW,GAAe,GAAa;AACrD,MAAI,EAAE,WAAW,EAAE;AAAQ,WAAO;AAClC,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,YAAQ,EAAE,CAAC,IAAI,EAAE,CAAC;AACrD,SAAO,SAAS;AAClB;AALgB,OAAAA,aAAA;AAcV,SAAUC,aAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,oCAAoC,OAAO,GAAG,EAAE;AAC7F,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAHgB,OAAAA,cAAA;AAWV,SAAUC,QAAO,GAAS;AAC9B,MAAI;AACJ,OAAK,MAAM,GAAG,IAAIrB,MAAK,MAAMC,MAAK,OAAO;AAAE;AAC3C,SAAO;AACT;AAJgB,OAAAoB,SAAA;AAWV,SAAUC,QAAO,GAAW,KAAW;AAC3C,SAAQ,KAAK,OAAO,GAAG,IAAKrB;AAC9B;AAFgB,OAAAqB,SAAA;AAOT,IAAMC,UAAS,wBAAC,GAAW,KAAa,UAAkB;AAC/D,SAAO,KAAM,QAAQtB,OAAMD,SAAQ,OAAO,GAAG;AAC/C,GAFsB;AAQf,IAAMwB,WAAU,wBAAC,OAAetB,QAAO,OAAO,IAAI,CAAC,KAAKD,MAAxC;AAIvB,IAAMwB,OAAM,wBAAC,SAAe,IAAI,WAAW,IAAI,GAAnC;AACZ,IAAMC,QAAO,wBAAC,QAAa,WAAW,KAAK,GAAG,GAAjC;AASP,SAAUC,gBACd,SACA,UACA,QAAkE;AAElE,MAAI,OAAO,YAAY,YAAY,UAAU;AAAG,UAAM,IAAI,MAAM,0BAA0B;AAC1F,MAAI,OAAO,aAAa,YAAY,WAAW;AAAG,UAAM,IAAI,MAAM,2BAA2B;AAC7F,MAAI,OAAO,WAAW;AAAY,UAAM,IAAI,MAAM,2BAA2B;AAE7E,MAAI,IAAIF,KAAI,OAAO;AACnB,MAAI,IAAIA,KAAI,OAAO;AACnB,MAAI,IAAI;AACR,QAAM,QAAQ,6BAAK;AACjB,MAAE,KAAK,CAAC;AACR,MAAE,KAAK,CAAC;AACR,QAAI;EACN,GAJc;AAKd,QAAM,IAAI,2BAAI,MAAoB,OAAO,GAAG,GAAG,GAAG,CAAC,GAAzC;AACV,QAAM,SAAS,wBAAC,OAAOA,KAAG,MAAM;AAE9B,QAAI,EAAEC,MAAK,CAAC,CAAI,CAAC,GAAG,IAAI;AACxB,QAAI,EAAC;AACL,QAAI,KAAK,WAAW;AAAG;AACvB,QAAI,EAAEA,MAAK,CAAC,CAAI,CAAC,GAAG,IAAI;AACxB,QAAI,EAAC;EACP,GAPe;AAQf,QAAME,OAAM,6BAAK;AAEf,QAAI,OAAO;AAAM,YAAM,IAAI,MAAM,yBAAyB;AAC1D,QAAI,MAAM;AACV,UAAM,MAAoB,CAAA;AAC1B,WAAO,MAAM,UAAU;AACrB,UAAI,EAAC;AACL,YAAM,KAAK,EAAE,MAAK;AAClB,UAAI,KAAK,EAAE;AACX,aAAO,EAAE;IACX;AACA,WAAOV,aAAY,GAAG,GAAG;EAC3B,GAZY;AAaZ,QAAM,WAAW,wBAAC,MAAkB,SAAoB;AACtD,UAAK;AACL,WAAO,IAAI;AACX,QAAI,MAAqB;AACzB,WAAO,EAAE,MAAM,KAAKU,KAAG,CAAE;AAAI,aAAM;AACnC,UAAK;AACL,WAAO;EACT,GAPiB;AAQjB,SAAO;AACT;AAhDgB,OAAAD,iBAAA;AAoDhB,IAAME,gBAAe;EACnB,QAAQ,wBAAC,QAAa,OAAO,QAAQ,UAA7B;EACR,UAAU,wBAAC,QAAa,OAAO,QAAQ,YAA7B;EACV,SAAS,wBAAC,QAAa,OAAO,QAAQ,WAA7B;EACT,QAAQ,wBAAC,QAAa,OAAO,QAAQ,UAA7B;EACR,oBAAoB,wBAAC,QAAa,OAAO,QAAQ,YAAY1B,SAAQ,GAAG,GAApD;EACpB,eAAe,wBAAC,QAAa,OAAO,cAAc,GAAG,GAAtC;EACf,OAAO,wBAAC,QAAa,MAAM,QAAQ,GAAG,GAA/B;EACP,OAAO,wBAAC,KAAU,WAAiB,OAAe,GAAG,QAAQ,GAAG,GAAzD;EACP,MAAM,wBAAC,QAAa,OAAO,QAAQ,cAAc,OAAO,cAAc,IAAI,SAAS,GAA7E;;AAMF,SAAU2B,gBACd,QACA,YACA,gBAA2B,CAAA,GAAE;AAE7B,QAAM,aAAa,wBAAC,WAAoB,MAAiB,eAAuB;AAC9E,UAAM,WAAWD,cAAa,IAAI;AAClC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI,MAAM,sBAAsB,IAAI,sBAAsB;AAElE,UAAM,MAAM,OAAO,SAAgC;AACnD,QAAI,cAAc,QAAQ;AAAW;AACrC,QAAI,CAAC,SAAS,KAAK,MAAM,GAAG;AAC1B,YAAM,IAAI,MACR,iBAAiB,OAAO,SAAS,CAAC,IAAI,GAAG,KAAK,OAAO,GAAG,eAAe,IAAI,EAAE;IAEjF;EACF,GAZmB;AAanB,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,UAAU;AAAG,eAAW,WAAW,MAAO,KAAK;AAC9F,aAAW,CAAC,WAAW,IAAI,KAAK,OAAO,QAAQ,aAAa;AAAG,eAAW,WAAW,MAAO,IAAI;AAChG,SAAO;AACT;AArBgB,OAAAC,iBAAA;;;AClRhB,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyD,MAAM,OAAO,CAAC;AAEvE,IAAM,MAAM,OAAO,CAAC;AAApB,IAAuB,MAAM,OAAO,CAAC;AAArC,IAAwC,MAAM,OAAO,CAAC;AAEtD,IAAM,MAAM,OAAO,CAAC;AAApB,IAAuB,OAAO,OAAO,EAAE;AAGjC,SAAU,IAAI,GAAW,GAAS;AACtC,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUF,OAAM,SAAS,IAAI;AACtC;AAHgB;AAWV,SAAU,IAAI,KAAa,OAAe,QAAc;AAC5D,MAAI,UAAUA,QAAO,QAAQA;AAAK,UAAM,IAAI,MAAM,2BAA2B;AAC7E,MAAI,WAAWC;AAAK,WAAOD;AAC3B,MAAI,MAAMC;AACV,SAAO,QAAQD,MAAK;AAClB,QAAI,QAAQC;AAAK,YAAO,MAAM,MAAO;AACrC,UAAO,MAAM,MAAO;AACpB,cAAUA;EACZ;AACA,SAAO;AACT;AAVgB;AAuBV,SAAU,OAAOE,SAAgB,QAAc;AACnD,MAAIA,YAAWC,QAAO,UAAUA,MAAK;AACnC,UAAM,IAAI,MAAM,6CAA6CD,OAAM,QAAQ,MAAM,EAAE;EACrF;AAGA,MAAI,IAAI,IAAIA,SAAQ,MAAM;AAC1B,MAAI,IAAI;AAER,MAAI,IAAIC,MAAK,IAAIC,MAAK,IAAIA,MAAK,IAAID;AACnC,SAAO,MAAMA,MAAK;AAEhB,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;EACzC;AACA,QAAME,OAAM;AACZ,MAAIA,SAAQD;AAAK,UAAM,IAAI,MAAM,wBAAwB;AACzD,SAAO,IAAI,GAAG,MAAM;AACtB;AAtBgB;AAgCV,SAAU,cAAc,GAAS;AAMrC,QAAM,aAAa,IAAIA,QAAOE;AAE9B,MAAI,GAAW,GAAW;AAG1B,OAAK,IAAI,IAAIF,MAAK,IAAI,GAAG,IAAIE,SAAQH,MAAK,KAAKG,MAAK;AAAI;AAGxD,OAAK,IAAIA,MAAK,IAAI,KAAK,IAAI,GAAG,WAAW,CAAC,MAAM,IAAIF,MAAK;AAAI;AAG7D,MAAI,MAAM,GAAG;AACX,UAAM,UAAU,IAAIA,QAAO;AAC3B,WAAO,gCAAS,YAAeG,KAAe,GAAI;AAChD,YAAM,OAAOA,IAAG,IAAI,GAAG,MAAM;AAC7B,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GAJO;EAKT;AAGA,QAAM,UAAU,IAAIH,QAAOE;AAC3B,SAAO,gCAAS,YAAeC,KAAe,GAAI;AAEhD,QAAIA,IAAG,IAAI,GAAG,SAAS,MAAMA,IAAG,IAAIA,IAAG,GAAG;AAAG,YAAM,IAAI,MAAM,yBAAyB;AACtF,QAAI,IAAI;AAER,QAAI,IAAIA,IAAG,IAAIA,IAAG,IAAIA,IAAG,KAAK,CAAC,GAAG,CAAC;AACnC,QAAI,IAAIA,IAAG,IAAI,GAAG,MAAM;AACxB,QAAI,IAAIA,IAAG,IAAI,GAAG,CAAC;AAEnB,WAAO,CAACA,IAAG,IAAI,GAAGA,IAAG,GAAG,GAAG;AACzB,UAAIA,IAAG,IAAI,GAAGA,IAAG,IAAI;AAAG,eAAOA,IAAG;AAElC,UAAI,IAAI;AACR,eAAS,KAAKA,IAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AACnC,YAAIA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAAG;AACxB,aAAKA,IAAG,IAAI,EAAE;MAChB;AAEA,YAAM,KAAKA,IAAG,IAAI,GAAGH,QAAO,OAAO,IAAI,IAAI,CAAC,CAAC;AAC7C,UAAIG,IAAG,IAAI,EAAE;AACb,UAAIA,IAAG,IAAI,GAAG,EAAE;AAChB,UAAIA,IAAG,IAAI,GAAG,CAAC;AACf,UAAI;IACN;AACA,WAAO;EACT,GAzBO;AA0BT;AAtDgB;AAwDV,SAAU,OAAO,GAAS;AAM9B,MAAI,IAAI,QAAQ,KAAK;AAKnB,UAAM,UAAU,IAAIH,QAAO;AAC3B,WAAO,gCAAS,UAAaG,KAAe,GAAI;AAC9C,YAAM,OAAOA,IAAG,IAAI,GAAG,MAAM;AAE7B,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GALO;EAMT;AAGA,MAAI,IAAI,QAAQ,KAAK;AACnB,UAAM,MAAM,IAAI,OAAO;AACvB,WAAO,gCAAS,UAAaA,KAAe,GAAI;AAC9C,YAAM,KAAKA,IAAG,IAAI,GAAGD,IAAG;AACxB,YAAM,IAAIC,IAAG,IAAI,IAAI,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,IAAIA,IAAG,IAAI,IAAID,IAAG,GAAG,CAAC;AACnC,YAAM,OAAOC,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAGA,IAAG,GAAG,CAAC;AACzC,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GARO;EAST;AAGA,MAAI,IAAI,SAAS,KAAK;EAoBtB;AAGA,SAAO,cAAc,CAAC;AACxB;AA3DgB;AA2GhB,IAAM,eAAe;EACnB;EAAU;EAAW;EAAO;EAAO;EAAO;EAAQ;EAClD;EAAO;EAAO;EAAO;EAAO;EAAO;EACnC;EAAQ;EAAQ;EAAQ;;AAEpB,SAAU,cAAiB,OAAgB;AAC/C,QAAM,UAAU;IACd,OAAO;IACP,MAAM;IACN,OAAO;IACP,MAAM;;AAER,QAAM,OAAO,aAAa,OAAO,CAACC,MAAK,QAAe;AACpD,IAAAA,KAAI,GAAG,IAAI;AACX,WAAOA;EACT,GAAG,OAAO;AACV,SAAOC,gBAAe,OAAO,IAAI;AACnC;AAZgB;AAoBV,SAAU,MAAS,GAAc,KAAQ,OAAa;AAG1D,MAAI,QAAQC;AAAK,UAAM,IAAI,MAAM,oBAAoB;AACrD,MAAI,UAAUA;AAAK,WAAO,EAAE;AAC5B,MAAI,UAAUC;AAAK,WAAO;AAC1B,MAAI,IAAI,EAAE;AACV,MAAI,IAAI;AACR,SAAO,QAAQD,MAAK;AAClB,QAAI,QAAQC;AAAK,UAAI,EAAE,IAAI,GAAG,CAAC;AAC/B,QAAI,EAAE,IAAI,CAAC;AACX,cAAUA;EACZ;AACA,SAAO;AACT;AAdgB;AAoBV,SAAU,cAAiB,GAAc,MAAS;AACtD,QAAM,MAAM,IAAI,MAAM,KAAK,MAAM;AAEjC,QAAM,iBAAiB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAK;AACjD,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,QAAI,CAAC,IAAI;AACT,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,EAAE,GAAG;AAER,QAAM,WAAW,EAAE,IAAI,cAAc;AAErC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAK;AAC/B,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,QAAI,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1B,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,QAAQ;AACX,SAAO;AACT;AAjBgB;AAiCV,SAAU,QAAQ,GAAWC,aAAmB;AAEpD,QAAM,cAAcA,gBAAe,SAAYA,cAAa,EAAE,SAAS,CAAC,EAAE;AAC1E,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAW;AAC/C;AALgB;AAoBV,SAAU,MACd,OACAC,SACAC,QAAO,OACP,QAAiC,CAAA,GAAE;AAEnC,MAAI,SAASC;AAAK,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAC1E,QAAM,EAAE,YAAY,MAAM,aAAa,MAAK,IAAK,QAAQ,OAAOF,OAAM;AACtE,MAAI,QAAQ;AAAM,UAAM,IAAI,MAAM,iDAAiD;AACnF,QAAM,QAAQ,OAAO,KAAK;AAC1B,QAAM,IAAuB,OAAO,OAAO;IACzC;IACA;IACA;IACA,MAAMG,SAAQ,IAAI;IAClB,MAAMD;IACN,KAAKE;IACL,QAAQ,wBAAC,QAAQ,IAAI,KAAK,KAAK,GAAvB;IACR,SAAS,wBAAC,QAAO;AACf,UAAI,OAAO,QAAQ;AACjB,cAAM,IAAI,MAAM,+CAA+C,OAAO,GAAG,EAAE;AAC7E,aAAOF,QAAO,OAAO,MAAM;IAC7B,GAJS;IAKT,KAAK,wBAAC,QAAQ,QAAQA,MAAjB;IACL,OAAO,wBAAC,SAAS,MAAME,UAASA,MAAzB;IACP,KAAK,wBAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,GAAxB;IACL,KAAK,wBAAC,KAAK,QAAQ,QAAQ,KAAtB;IAEL,KAAK,wBAAC,QAAQ,IAAI,MAAM,KAAK,KAAK,GAA7B;IACL,KAAK,wBAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,QAAQ,IAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,UAAU,MAAM,GAAG,KAAK,KAAK,GAAnC;IACL,KAAK,wBAAC,KAAK,QAAQ,IAAI,MAAM,OAAO,KAAK,KAAK,GAAG,KAAK,GAAjD;;IAGL,MAAM,wBAAC,QAAQ,MAAM,KAAf;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IAEN,KAAK,wBAAC,QAAQ,OAAO,KAAK,KAAK,GAA1B;IACL,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM,GAAG,CAAC;IACtC,aAAa,wBAAC,QAAQ,cAAc,GAAG,GAAG,GAA7B;;;IAGb,MAAM,wBAAC,GAAG,GAAG,MAAO,IAAI,IAAI,GAAtB;IACN,SAAS,wBAAC,QAASH,QAAOI,iBAAgB,KAAK,KAAK,IAAIC,iBAAgB,KAAK,KAAK,GAAzE;IACT,WAAW,wBAACC,WAAS;AACnB,UAAIA,OAAM,WAAW;AACnB,cAAM,IAAI,MAAM,0BAA0B,KAAK,SAASA,OAAM,MAAM,EAAE;AACxE,aAAON,QAAOO,iBAAgBD,MAAK,IAAIE,iBAAgBF,MAAK;IAC9D,GAJW;GAKD;AACZ,SAAO,OAAO,OAAO,CAAC;AACxB;AAvDgB;AA+FV,SAAU,oBAAoB,YAAkB;AACpD,MAAI,OAAO,eAAe;AAAU,UAAM,IAAI,MAAM,4BAA4B;AAChF,QAAM,YAAY,WAAW,SAAS,CAAC,EAAE;AACzC,SAAO,KAAK,KAAK,YAAY,CAAC;AAChC;AAJgB;AAaV,SAAU,iBAAiB,YAAkB;AACjD,QAAM,SAAS,oBAAoB,UAAU;AAC7C,SAAO,SAAS,KAAK,KAAK,SAAS,CAAC;AACtC;AAHgB;AAkBV,SAAU,eAAe,KAAiB,YAAoBG,QAAO,OAAK;AAC9E,QAAM,MAAM,IAAI;AAChB,QAAM,WAAW,oBAAoB,UAAU;AAC/C,QAAM,SAAS,iBAAiB,UAAU;AAE1C,MAAI,MAAM,MAAM,MAAM,UAAU,MAAM;AACpC,UAAM,IAAI,MAAM,YAAY,MAAM,6BAA6B,GAAG,EAAE;AACtE,QAAM,MAAMA,QAAOC,iBAAgB,GAAG,IAAIC,iBAAgB,GAAG;AAE7D,QAAM,UAAU,IAAI,KAAK,aAAaC,IAAG,IAAIA;AAC7C,SAAOH,QAAOI,iBAAgB,SAAS,QAAQ,IAAIC,iBAAgB,SAAS,QAAQ;AACtF;AAXgB;;;ACxcV,SAAU,aAAa,MAAkB;AAC7C,QAAM,EAAE,IAAAC,KAAI,KAAK,sBAAsB,KAAK,gBAAgB,GAAE,IAAK;AACnE,QAAM,EAAE,YAAY,eAAe,WAAW,EAAC,IAAK;AAEpD,gBAAcA,GAAE;AAChB,aAAW,KAAK,CAAC,KAAK,cAAc,eAAe,GAAY;AAC7D,QAAI,OAAO,KAAK,CAAC,MAAM,YAAY,CAAC,OAAO,cAAc,KAAK,CAAC,CAAC;AAC9D,YAAM,IAAI,MAAM,2BAA2B,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC,GAAG;EACjF;AAGA,MAAI,CAAC,MAAM,QAAQ,GAAG,KAAK,IAAI,WAAW;AAAG,UAAM,IAAI,MAAM,4BAA4B;AACzF,QAAM,OAAO,IAAI,IAAI,CAAC,WAAU;AAC9B,QAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAC9C,YAAM,IAAI,MAAM,4BAA4B,MAAM,EAAE;AACtD,WAAO,OAAO,IAAI,CAAC,MAAK;AACtB,UAAI,OAAO,MAAM;AAAU,cAAM,IAAI,MAAM,6BAA6B,CAAC,EAAE;AAC3E,aAAOA,IAAG,OAAO,CAAC;IACpB,CAAC;EACH,CAAC;AAED,MAAI,QAAQ,UAAa,OAAO,QAAQ;AACtC,UAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAEvE,MAAI,aAAa,MAAM;AAAG,UAAM,IAAI,MAAM,oCAAoC,UAAU,EAAE;AAC1F,QAAM,SAAS,aAAa;AAE5B,MAAI,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG,WAAW;AACtC,UAAM,IAAI,MAAM,iCAAiC;AACnD,QAAM,iBAAiB,GAAG,IAAI,CAACC,QAAM;AACnC,QAAI,CAAC,MAAM,QAAQA,GAAE,KAAKA,IAAG,WAAW;AACtC,YAAM,IAAI,MAAM,mCAAmCA,GAAE,EAAE;AACzD,WAAOA,IAAG,IAAI,CAAC,MAAK;AAClB,UAAI,OAAO,MAAM,YAAY,CAACD,IAAG,QAAQ,CAAC;AACxC,cAAM,IAAI,MAAM,iCAAiC,CAAC,EAAE;AACtD,aAAOA,IAAG,OAAO,CAAC;IACpB,CAAC;EACH,CAAC;AAED,MAAI,CAAC,aAAa,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,SAAS,SAAS;AAC7C,UAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;AACzD,QAAM,aAAa,OAAO,SAAS;AACnC,MAAI,SAAS,wBAAC,MAAc,MAAMA,KAAI,GAAG,UAAU,GAAtC;AAEb,MAAI,cAAc;AAAG,aAAS,wBAAC,MAAcA,IAAG,IAAIA,IAAG,KAAK,CAAC,GAAG,CAAC,GAAnC;WACrB,cAAc;AAAG,aAAS,wBAAC,MAAcA,IAAG,IAAIA,IAAG,KAAKA,IAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAA5C;AAEnC,SAAO,OAAO,OAAO,EAAE,GAAG,MAAM,QAAQ,QAAQ,gBAAgB,KAAK,KAAI,CAAE;AAC7E;AAhDgB;AAiEV,SAAU,SAAS,MAAkB;AACzC,QAAM,QAAQ,aAAa,IAAI;AAC/B,QAAM,EAAE,IAAAE,KAAI,KAAK,gBAAgB,QAAQ,eAAe,QAAQ,EAAC,IAAK;AACtE,QAAM,iBAAiB,MAAM,aAAa;AAC1C,QAAM,aAAa,MAAM,uBAAuB,IAAI,IAAI;AACxD,QAAM,gBAAgB,wBAAC,QAAkB,QAAiB,QAAe;AACvE,aAAS,OAAO,IAAI,CAAC,GAAG,MAAMA,IAAG,IAAI,GAAG,eAAe,GAAG,EAAE,CAAC,CAAC,CAAC;AAE/D,QAAI;AAAQ,eAAS,OAAO,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC;;AAC3C,aAAO,UAAU,IAAI,OAAO,OAAO,UAAU,CAAC;AAEnD,aAAS,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,KAAKC,IAAG,MAAMD,IAAG,IAAI,KAAKA,IAAG,KAAKC,IAAG,OAAO,CAAC,CAAC,CAAC,GAAGD,IAAG,IAAI,CAAC;AAC5F,WAAO;EACT,GARsB;AAStB,QAAME,gBAAe,gCAASA,cAAa,QAAgB;AACzD,QAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAC9C,YAAM,IAAI,MAAM,iEAAiE,CAAC,GAAG;AACvF,aAAS,OAAO,IAAI,CAAC,MAAK;AACxB,UAAI,OAAO,MAAM;AAAU,cAAM,IAAI,MAAM,yBAAyB,CAAC,KAAK,OAAO,CAAC,GAAG;AACrF,aAAOF,IAAG,OAAO,CAAC;IACpB,CAAC;AACD,QAAI,QAAQ;AAEZ,aAAS,IAAI,GAAG,IAAI,gBAAgB;AAAK,eAAS,cAAc,QAAQ,MAAM,OAAO;AAErF,aAAS,IAAI,GAAG,IAAI,eAAe;AAAK,eAAS,cAAc,QAAQ,OAAO,OAAO;AAErF,aAAS,IAAI,GAAG,IAAI,gBAAgB;AAAK,eAAS,cAAc,QAAQ,MAAM,OAAO;AAErF,QAAI,UAAU;AACZ,YAAM,IAAI,MAAM,gDAAgD,KAAK,WAAW,MAAM,EAAE;AAC1F,WAAO;EACT,GAlBqB;AAoBrB,EAAAE,cAAa,iBAAiB;AAC9B,SAAOA;AACT;AApCgB;;;AC7EhB,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AAiCd,SAAU,KAAyB,GAAwB,MAAY;AAC3E,QAAM,kBAAkB,wBAAC,WAAoB,SAAc;AACzD,UAAM,MAAM,KAAK,OAAM;AACvB,WAAO,YAAY,MAAM;EAC3B,GAHwB;AAIxB,QAAM,OAAO,wBAAC,MAAa;AACzB,UAAM,UAAU,KAAK,KAAK,OAAO,CAAC,IAAI;AACtC,UAAM,aAAa,MAAM,IAAI;AAC7B,WAAO,EAAE,SAAS,WAAU;EAC9B,GAJa;AAKb,SAAO;IACL;;IAEA,aAAa,KAAQ,GAAS;AAC5B,UAAI,IAAI,EAAE;AACV,UAAI,IAAO;AACX,aAAO,IAAID,MAAK;AACd,YAAI,IAAIC;AAAK,cAAI,EAAE,IAAI,CAAC;AACxB,YAAI,EAAE,OAAM;AACZ,cAAMA;MACR;AACA,aAAO;IACT;;;;;;;;;;;IAYA,iBAAiB,KAAQ,GAAS;AAChC,YAAM,EAAE,SAAS,WAAU,IAAK,KAAK,CAAC;AACtC,YAAM,SAAc,CAAA;AACpB,UAAI,IAAO;AACX,UAAIC,QAAO;AACX,eAASC,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,QAAAD,QAAO;AACP,eAAO,KAAKA,KAAI;AAEhB,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,UAAAA,QAAOA,MAAK,IAAI,CAAC;AACjB,iBAAO,KAAKA,KAAI;QAClB;AACA,YAAIA,MAAK,OAAM;MACjB;AACA,aAAO;IACT;;;;;;;;IASA,KAAK,GAAW,aAAkB,GAAS;AAGzC,YAAM,EAAE,SAAS,WAAU,IAAK,KAAK,CAAC;AAEtC,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AAEV,YAAM,OAAO,OAAO,KAAK,IAAI,CAAC;AAC9B,YAAM,YAAY,KAAK;AACvB,YAAM,UAAU,OAAO,CAAC;AAExB,eAASC,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,cAAM,SAASA,UAAS;AAExB,YAAI,QAAQ,OAAO,IAAI,IAAI;AAG3B,cAAM;AAIN,YAAI,QAAQ,YAAY;AACtB,mBAAS;AACT,eAAKF;QACP;AAUA,cAAM,UAAU;AAChB,cAAM,UAAU,SAAS,KAAK,IAAI,KAAK,IAAI;AAC3C,cAAM,QAAQE,UAAS,MAAM;AAC7B,cAAM,QAAQ,QAAQ;AACtB,YAAI,UAAU,GAAG;AAEf,cAAI,EAAE,IAAI,gBAAgB,OAAO,YAAY,OAAO,CAAC,CAAC;QACxD,OAAO;AACL,cAAI,EAAE,IAAI,gBAAgB,OAAO,YAAY,OAAO,CAAC,CAAC;QACxD;MACF;AAMA,aAAO,EAAE,GAAG,EAAC;IACf;IAEA,WAAW,GAAM,gBAA6B,GAAW,WAAoB;AAE3E,YAAM,IAAY,EAAE,gBAAgB;AAEpC,UAAI,OAAO,eAAe,IAAI,CAAC;AAC/B,UAAI,CAAC,MAAM;AACT,eAAO,KAAK,iBAAiB,GAAG,CAAC;AACjC,YAAI,MAAM,GAAG;AACX,yBAAe,IAAI,GAAG,UAAU,IAAI,CAAC;QACvC;MACF;AACA,aAAO,KAAK,KAAK,GAAG,MAAM,CAAC;IAC7B;;AAEJ;AA/HgB;AA+IV,SAAU,cAAqBC,QAAyB;AAC5D,gBAAcA,OAAM,EAAE;AACtB,EAAAC,gBACED,QACA;IACE,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;KAEN;IACE,YAAY;IACZ,aAAa;GACd;AAGH,SAAO,OAAO,OAAO;IACnB,GAAG,QAAQA,OAAM,GAAGA,OAAM,UAAU;IACpC,GAAGA;IACH,GAAG,EAAE,GAAGA,OAAM,GAAG,MAAK;GACd;AACZ;AArBgB;;;AC3FhB,SAAS,kBAAqBE,QAAyB;AACrD,QAAM,OAAO,cAAcA,MAAK;AAChC,EAAGC,gBACD,MACA;IACE,GAAG;IACH,GAAG;KAEL;IACE,0BAA0B;IAC1B,gBAAgB;IAChB,eAAe;IACf,eAAe;IACf,oBAAoB;IACpB,WAAW;IACX,SAAS;GACV;AAEH,QAAM,EAAE,MAAM,IAAAC,KAAI,EAAC,IAAK;AACxB,MAAI,MAAM;AACR,QAAI,CAACA,IAAG,IAAI,GAAGA,IAAG,IAAI,GAAG;AACvB,YAAM,IAAI,MAAM,mEAAmE;IACrF;AACA,QACE,OAAO,SAAS,YAChB,OAAO,KAAK,SAAS,YACrB,OAAO,KAAK,gBAAgB,YAC5B;AACA,YAAM,IAAI,MAAM,mEAAmE;IACrF;EACF;AACA,SAAO,OAAO,OAAO,EAAE,GAAG,KAAI,CAAW;AAC3C;AAhCS;AA2CT,IAAM,EAAE,iBAAiB,KAAK,YAAY,IAAG,IAAKC;AAC3C,IAAM,MAAM;;EAEjB,KAAK,MAAM,eAAe,MAAK;IAxIjC,OAwIiC;;;IAC7B,YAAY,IAAI,IAAE;AAChB,YAAM,CAAC;IACT;;EAEF,UAAU,MAAgB;AACxB,UAAM,EAAE,KAAK,EAAC,IAAK;AACnB,QAAI,KAAK,SAAS,KAAK,KAAK,CAAC,MAAM;AAAM,YAAM,IAAI,EAAE,+BAA+B;AACpF,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,MAAM,KAAK,SAAS,GAAG,MAAM,CAAC;AACpC,QAAI,CAAC,OAAO,IAAI,WAAW;AAAK,YAAM,IAAI,EAAE,yCAAyC;AAKrF,QAAI,IAAI,CAAC,IAAI;AAAY,YAAM,IAAI,EAAE,qCAAqC;AAC1E,QAAI,IAAI,CAAC,MAAM,KAAQ,EAAE,IAAI,CAAC,IAAI;AAChC,YAAM,IAAI,EAAE,qDAAqD;AACnE,WAAO,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,KAAK,SAAS,MAAM,CAAC,EAAC;EACjD;EACA,MAAM,KAAwB;AAE5B,UAAM,EAAE,KAAK,EAAC,IAAK;AACnB,UAAM,OAAO,OAAO,QAAQ,WAAW,IAAI,GAAG,IAAI;AAClD,QAAI,CAAIC,SAAQ,IAAI;AAAG,YAAM,IAAI,MAAM,eAAe;AACtD,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,KAAK,KAAK,CAAC,KAAK;AAAM,YAAM,IAAI,EAAE,uBAAuB;AACjE,QAAI,KAAK,CAAC,MAAM,IAAI;AAAG,YAAM,IAAI,EAAE,qCAAqC;AACxE,UAAM,EAAE,GAAG,GAAG,GAAG,OAAM,IAAK,IAAI,UAAU,KAAK,SAAS,CAAC,CAAC;AAC1D,UAAM,EAAE,GAAG,GAAG,GAAG,WAAU,IAAK,IAAI,UAAU,MAAM;AACpD,QAAI,WAAW;AAAQ,YAAM,IAAI,EAAE,6CAA6C;AAChF,WAAO,EAAE,GAAG,EAAC;EACf;EACA,WAAW,KAA6B;AAEtC,UAAM,QAAQ,wBAACC,OAAuB,OAAO,SAASA,GAAE,CAAC,GAAG,EAAE,IAAI,IAAS,OAAOA,KAAIA,IAAxE;AACd,UAAM,IAAI,wBAAC,QAAwB;AACjC,YAAM,MAAM,IAAI,SAAS,EAAE;AAC3B,aAAO,IAAI,SAAS,IAAI,IAAI,GAAG,KAAK;IACtC,GAHU;AAIV,UAAM,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC;AACxB,UAAM,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC;AACxB,UAAM,MAAM,EAAE,SAAS;AACvB,UAAM,MAAM,EAAE,SAAS;AACvB,UAAM,KAAK,EAAE,GAAG;AAChB,UAAM,KAAK,EAAE,GAAG;AAChB,WAAO,KAAK,EAAE,MAAM,MAAM,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC;EACpD;;AAKF,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyDC,OAAM,OAAO,CAAC;AAAvE,IAA0EC,OAAM,OAAO,CAAC;AAElF,SAAU,kBAAqB,MAAwB;AAC3D,QAAMC,SAAQ,kBAAkB,IAAI;AACpC,QAAM,EAAE,IAAAT,IAAE,IAAKS;AAEf,QAAMC,WACJD,OAAM,YACL,CAAC,IAAwB,OAAyB,kBAA0B;AAC3E,UAAM,IAAI,MAAM,SAAQ;AACxB,WAAUE,aAAY,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGX,IAAG,QAAQ,EAAE,CAAC,GAAGA,IAAG,QAAQ,EAAE,CAAC,CAAC;EACjF;AACF,QAAM,YACJS,OAAM,cACL,CAACG,WAAqB;AAErB,UAAM,OAAOA,OAAM,SAAS,CAAC;AAE7B,UAAM,IAAIZ,IAAG,UAAU,KAAK,SAAS,GAAGA,IAAG,KAAK,CAAC;AACjD,UAAM,IAAIA,IAAG,UAAU,KAAK,SAASA,IAAG,OAAO,IAAIA,IAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAG,EAAC;EACf;AAMF,WAAS,oBAAoB,GAAI;AAC/B,UAAM,EAAE,GAAG,EAAC,IAAKS;AACjB,UAAM,KAAKT,IAAG,IAAI,CAAC;AACnB,UAAM,KAAKA,IAAG,IAAI,IAAI,CAAC;AACvB,WAAOA,IAAG,IAAIA,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;EAC3C;AALS;AAUT,MAAI,CAACA,IAAG,IAAIA,IAAG,IAAIS,OAAM,EAAE,GAAG,oBAAoBA,OAAM,EAAE,CAAC;AACzD,UAAM,IAAI,MAAM,6CAA6C;AAG/D,WAAS,mBAAmB,KAAW;AACrC,WAAO,OAAO,QAAQ,YAAYL,OAAM,OAAO,MAAMK,OAAM;EAC7D;AAFS;AAGT,WAAS,SAAS,KAAW;AAC3B,QAAI,CAAC,mBAAmB,GAAG;AAAG,YAAM,IAAI,MAAM,6CAA6C;EAC7F;AAFS;AAKT,WAAS,uBAAuB,KAAY;AAC1C,UAAM,EAAE,0BAA0B,SAAS,aAAa,gBAAgB,EAAC,IAAKA;AAC9E,QAAI,WAAW,OAAO,QAAQ,UAAU;AACtC,UAAOP,SAAQ,GAAG;AAAG,cAASW,YAAW,GAAG;AAE5C,UAAI,OAAO,QAAQ,YAAY,CAAC,QAAQ,SAAS,IAAI,MAAM;AAAG,cAAM,IAAI,MAAM,aAAa;AAC3F,YAAM,IAAI,SAAS,cAAc,GAAG,GAAG;IACzC;AACA,QAAI;AACJ,QAAI;AACF,YACE,OAAO,QAAQ,WACX,MACGC,iBAAgBC,aAAY,eAAe,KAAK,WAAW,CAAC;IACvE,SAASC,QAAO;AACd,YAAM,IAAI,MAAM,uBAAuB,WAAW,8BAA8B,OAAO,GAAG,EAAE;IAC9F;AACA,QAAI;AAAgB,YAAU,IAAI,KAAK,CAAC;AACxC,aAAS,GAAG;AACZ,WAAO;EACT;AApBS;AAsBT,QAAM,mBAAmB,oBAAI,IAAG;AAChC,WAAS,eAAe,OAAc;AACpC,QAAI,EAAE,iBAAiBC;AAAQ,YAAM,IAAI,MAAM,0BAA0B;EAC3E;AAFS;EAQT,MAAMA,OAAK;IA5Qb,OA4Qa;;;IAIT,YACW,IACA,IACA,IAAK;AAFL,WAAA,KAAA;AACA,WAAA,KAAA;AACA,WAAA,KAAA;AAET,UAAI,MAAM,QAAQ,CAACjB,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;AAC/D,UAAI,MAAM,QAAQ,CAACA,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;AAC/D,UAAI,MAAM,QAAQ,CAACA,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;IACjE;;;IAIA,OAAO,WAAW,GAAiB;AACjC,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,CAAA;AACtB,UAAI,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,sBAAsB;AAClF,UAAI,aAAaiB;AAAO,cAAM,IAAI,MAAM,8BAA8B;AACtE,YAAM,MAAM,wBAAC,MAASjB,IAAG,IAAI,GAAGA,IAAG,IAAI,GAA3B;AAEZ,UAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAAG,eAAOiB,OAAM;AACnC,aAAO,IAAIA,OAAM,GAAG,GAAGjB,IAAG,GAAG;IAC/B;IAEA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IACA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;;;;;;;IAQA,OAAO,WAAW,QAAe;AAC/B,YAAM,QAAQA,IAAG,YAAY,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACpD,aAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,SAAS,MAAM,CAAC,CAAC,CAAC,EAAE,IAAIiB,OAAM,UAAU;IACxE;;;;;IAMA,OAAO,QAAQ,KAAQ;AACrB,YAAM,IAAIA,OAAM,WAAW,UAAUF,aAAY,YAAY,GAAG,CAAC,CAAC;AAClE,QAAE,eAAc;AAChB,aAAO;IACT;;IAGA,OAAO,eAAe,YAAmB;AACvC,aAAOE,OAAM,KAAK,SAAS,uBAAuB,UAAU,CAAC;IAC/D;;IAQA,eAAe,YAAkB;AAC/B,WAAK,eAAe;AACpB,uBAAiB,OAAO,IAAI;IAC9B;;IAGA,iBAAc;AACZ,UAAI,KAAK,IAAG,GAAI;AAId,YAAIR,OAAM,sBAAsB,CAACT,IAAG,IAAI,KAAK,EAAE;AAAG;AAClD,cAAM,IAAI,MAAM,iBAAiB;MACnC;AAEA,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,SAAQ;AAE9B,UAAI,CAACA,IAAG,QAAQ,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,0BAA0B;AAChF,YAAM,OAAOA,IAAG,IAAI,CAAC;AACrB,YAAM,QAAQ,oBAAoB,CAAC;AACnC,UAAI,CAACA,IAAG,IAAI,MAAM,KAAK;AAAG,cAAM,IAAI,MAAM,mCAAmC;AAC7E,UAAI,CAAC,KAAK,cAAa;AAAI,cAAM,IAAI,MAAM,wCAAwC;IACrF;IACA,WAAQ;AACN,YAAM,EAAE,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIA,IAAG;AAAO,eAAO,CAACA,IAAG,MAAM,CAAC;AAChC,YAAM,IAAI,MAAM,6BAA6B;IAC/C;;;;IAKA,OAAO,OAAY;AACjB,qBAAe,KAAK;AACpB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,IAAI,EAAE,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC;AAChD,YAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,IAAI,EAAE,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC;AAChD,aAAO,MAAM;IACf;;;;IAKA,SAAM;AACJ,aAAO,IAAIiB,OAAM,KAAK,IAAIjB,IAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;IACpD;;;;;IAMA,SAAM;AACJ,YAAM,EAAE,GAAG,EAAC,IAAKS;AACjB,YAAM,KAAKT,IAAG,IAAI,GAAGO,IAAG;AACxB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,UAAI,KAAKP,IAAG,MAAM,KAAKA,IAAG,MAAM,KAAKA,IAAG;AACxC,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIiB,OAAM,IAAI,IAAI,EAAE;IAC7B;;;;;IAMA,IAAI,OAAY;AACd,qBAAe,KAAK;AACpB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,UAAI,KAAKjB,IAAG,MAAM,KAAKA,IAAG,MAAM,KAAKA,IAAG;AACxC,YAAM,IAAIS,OAAM;AAChB,YAAM,KAAKT,IAAG,IAAIS,OAAM,GAAGF,IAAG;AAC9B,UAAI,KAAKP,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIiB,OAAM,IAAI,IAAI,EAAE;IAC7B;IAEA,SAAS,OAAY;AACnB,aAAO,KAAK,IAAI,MAAM,OAAM,CAAE;IAChC;IAEQ,MAAG;AACT,aAAO,KAAK,OAAOA,OAAM,IAAI;IAC/B;IACQ,KAAK,GAAS;AACpB,aAAO,KAAK,WAAW,MAAM,kBAAkB,GAAG,CAAC,SAAiB;AAClE,cAAM,QAAQjB,IAAG,YAAY,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAClD,eAAO,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,SAAS,MAAM,CAAC,CAAC,CAAC,EAAE,IAAIiB,OAAM,UAAU;MACtE,CAAC;IACH;;;;;;IAOA,eAAe,GAAS;AACtB,YAAM,IAAIA,OAAM;AAChB,UAAI,MAAMb;AAAK,eAAO;AACtB,eAAS,CAAC;AACV,UAAI,MAAMC;AAAK,eAAO;AACtB,YAAM,EAAE,KAAI,IAAKI;AACjB,UAAI,CAAC;AAAM,eAAO,KAAK,aAAa,MAAM,CAAC;AAG3C,UAAI,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,KAAK,YAAY,CAAC;AACjD,UAAI,MAAM;AACV,UAAI,MAAM;AACV,UAAI,IAAW;AACf,aAAO,KAAKL,QAAO,KAAKA,MAAK;AAC3B,YAAI,KAAKC;AAAK,gBAAM,IAAI,IAAI,CAAC;AAC7B,YAAI,KAAKA;AAAK,gBAAM,IAAI,IAAI,CAAC;AAC7B,YAAI,EAAE,OAAM;AACZ,eAAOA;AACP,eAAOA;MACT;AACA,UAAI;AAAO,cAAM,IAAI,OAAM;AAC3B,UAAI;AAAO,cAAM,IAAI,OAAM;AAC3B,YAAM,IAAIY,OAAMjB,IAAG,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,EAAE;AACzD,aAAO,IAAI,IAAI,GAAG;IACpB;;;;;;;;;;IAWA,SAAS,QAAc;AACrB,eAAS,MAAM;AACf,UAAI,IAAI;AACR,UAAI,OAAc;AAClB,YAAM,EAAE,KAAI,IAAKS;AACjB,UAAI,MAAM;AACR,cAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,KAAK,YAAY,CAAC;AACnD,YAAI,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,KAAK,KAAK,EAAE;AACrC,YAAI,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,KAAK,KAAK,EAAE;AACrC,cAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAM,IAAIQ,OAAMjB,IAAG,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,EAAE;AACzD,gBAAQ,IAAI,IAAI,GAAG;AACnB,eAAO,IAAI,IAAI,GAAG;MACpB,OAAO;AACL,cAAM,EAAE,GAAG,EAAC,IAAK,KAAK,KAAK,CAAC;AAC5B,gBAAQ;AACR,eAAO;MACT;AAEA,aAAOiB,OAAM,WAAW,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;IAC1C;;;;;;;IAQA,qBAAqB,GAAU,GAAW,GAAS;AACjD,YAAM,IAAIA,OAAM;AAChB,YAAM,MAAM,wBACV,GACAC,OACIA,OAAMd,QAAOc,OAAMb,QAAO,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,eAAea,EAAC,IAAI,EAAE,SAASA,EAAC,GAHrE;AAIZ,YAAM,MAAM,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,GAAG,CAAC,CAAC;AACtC,aAAO,IAAI,IAAG,IAAK,SAAY;IACjC;;;;IAKA,SAAS,IAAM;AACb,YAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAC,IAAK;AAChC,YAAM,MAAM,KAAK,IAAG;AAGpB,UAAI,MAAM;AAAM,aAAK,MAAMlB,IAAG,MAAMA,IAAG,IAAI,CAAC;AAC5C,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AAAK,eAAO,EAAE,GAAGA,IAAG,MAAM,GAAGA,IAAG,KAAI;AACxC,UAAI,CAACA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAAG,cAAM,IAAI,MAAM,kBAAkB;AAC3D,aAAO,EAAE,GAAG,IAAI,GAAG,GAAE;IACvB;IACA,gBAAa;AACX,YAAM,EAAE,GAAG,UAAU,cAAa,IAAKS;AACvC,UAAI,aAAaJ;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcY,QAAO,IAAI;AACnD,YAAM,IAAI,MAAM,8DAA8D;IAChF;IACA,gBAAa;AACX,YAAM,EAAE,GAAG,UAAU,cAAa,IAAKR;AACvC,UAAI,aAAaJ;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcY,QAAO,IAAI;AACnD,aAAO,KAAK,eAAeR,OAAM,CAAC;IACpC;IAEA,WAAW,eAAe,MAAI;AAC5B,WAAK,eAAc;AACnB,aAAOC,SAAQO,QAAO,MAAM,YAAY;IAC1C;IAEA,MAAM,eAAe,MAAI;AACvB,aAAUJ,YAAW,KAAK,WAAW,YAAY,CAAC;IACpD;;AAlVgB,EAAAI,OAAA,OAAO,IAAIA,OAAMR,OAAM,IAAIA,OAAM,IAAIT,IAAG,GAAG;AAC3C,EAAAiB,OAAA,OAAO,IAAIA,OAAMjB,IAAG,MAAMA,IAAG,KAAKA,IAAG,IAAI;AAmV3D,QAAM,QAAQS,OAAM;AACpB,QAAM,OAAO,KAAKQ,QAAOR,OAAM,OAAO,KAAK,KAAK,QAAQ,CAAC,IAAI,KAAK;AAElE,SAAO;IACL,OAAAA;IACA,iBAAiBQ;IACjB;IACA;IACA;;AAEJ;AA7agB;AAqdhB,SAASE,cAAarB,QAAgB;AACpC,QAAM,OAAO,cAAcA,MAAK;AAChC,EAAGC,gBACD,MACA;IACE,MAAM;IACN,MAAM;IACN,aAAa;KAEf;IACE,UAAU;IACV,eAAe;IACf,MAAM;GACP;AAEH,SAAO,OAAO,OAAO,EAAE,MAAM,MAAM,GAAG,KAAI,CAAW;AACvD;AAhBS,OAAAoB,eAAA;AAkCH,SAAU,YAAY,UAAmB;AAC7C,QAAMV,SAAQU,cAAa,QAAQ;AACnC,QAAM,EAAE,IAAAnB,KAAI,GAAGoB,aAAW,IAAKX;AAC/B,QAAM,gBAAgBT,IAAG,QAAQ;AACjC,QAAM,kBAAkB,IAAIA,IAAG,QAAQ;AAEvC,WAAS,oBAAoB,KAAW;AACtC,WAAOI,OAAM,OAAO,MAAMJ,IAAG;EAC/B;AAFS;AAGT,WAAS,KAAK,GAAS;AACrB,WAAW,IAAI,GAAGoB,YAAW;EAC/B;AAFS;AAGT,WAAS,KAAK,GAAS;AACrB,WAAW,OAAO,GAAGA,YAAW;EAClC;AAFS;AAIT,QAAM,EACJ,iBAAiBH,QACjB,wBACA,qBACA,mBAAkB,IAChB,kBAAkB;IACpB,GAAGR;IACH,QAAQ,IAAI,OAAO,cAAqB;AACtC,YAAM,IAAI,MAAM,SAAQ;AACxB,YAAM,IAAIT,IAAG,QAAQ,EAAE,CAAC;AACxB,YAAM,MAASW;AACf,UAAI,cAAc;AAChB,eAAO,IAAI,WAAW,KAAK,CAAC,MAAM,SAAQ,IAAK,IAAO,CAAI,CAAC,GAAG,CAAC;MACjE,OAAO;AACL,eAAO,IAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG,GAAGX,IAAG,QAAQ,EAAE,CAAC,CAAC;MACxD;IACF;IACA,UAAUY,QAAiB;AACzB,YAAM,MAAMA,OAAM;AAClB,YAAM,OAAOA,OAAM,CAAC;AACpB,YAAM,OAAOA,OAAM,SAAS,CAAC;AAE7B,UAAI,QAAQ,kBAAkB,SAAS,KAAQ,SAAS,IAAO;AAC7D,cAAM,IAAOE,iBAAgB,IAAI;AACjC,YAAI,CAAC,oBAAoB,CAAC;AAAG,gBAAM,IAAI,MAAM,uBAAuB;AACpE,cAAM,KAAK,oBAAoB,CAAC;AAChC,YAAI,IAAId,IAAG,KAAK,EAAE;AAClB,cAAM,UAAU,IAAIK,UAASA;AAE7B,cAAM,aAAa,OAAO,OAAO;AACjC,YAAI,cAAc;AAAQ,cAAIL,IAAG,IAAI,CAAC;AACtC,eAAO,EAAE,GAAG,EAAC;MACf,WAAW,QAAQ,mBAAmB,SAAS,GAAM;AACnD,cAAM,IAAIA,IAAG,UAAU,KAAK,SAAS,GAAGA,IAAG,KAAK,CAAC;AACjD,cAAM,IAAIA,IAAG,UAAU,KAAK,SAASA,IAAG,OAAO,IAAIA,IAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAG,EAAC;MACf,OAAO;AACL,cAAM,IAAI,MACR,mBAAmB,GAAG,0BAA0B,aAAa,wBAAwB,eAAe,qBAAqB;MAE7H;IACF;GACD;AACD,QAAM,gBAAgB,wBAAC,QAClBa,YAAcQ,iBAAgB,KAAKZ,OAAM,WAAW,CAAC,GADpC;AAGtB,WAAS,sBAAsBa,SAAc;AAC3C,UAAM,OAAOF,gBAAef;AAC5B,WAAOiB,UAAS;EAClB;AAHS;AAKT,WAAS,WAAW,GAAS;AAC3B,WAAO,sBAAsB,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;EAC/C;AAFS;AAIT,QAAM,SAAS,wBAAC,GAAe,MAAc,OAAkBR,iBAAgB,EAAE,MAAM,MAAM,EAAE,CAAC,GAAjF;EAKf,MAAMS,WAAS;IAjwBjB,OAiwBiB;;;IACb,YACW,GACA,GACA,UAAiB;AAFjB,WAAA,IAAA;AACA,WAAA,IAAA;AACA,WAAA,WAAA;AAET,WAAK,eAAc;IACrB;;IAGA,OAAO,YAAY,KAAQ;AACzB,YAAM,IAAId,OAAM;AAChB,YAAMM,aAAY,oBAAoB,KAAK,IAAI,CAAC;AAChD,aAAO,IAAIQ,WAAU,OAAO,KAAK,GAAG,CAAC,GAAG,OAAO,KAAK,GAAG,IAAI,CAAC,CAAC;IAC/D;;;IAIA,OAAO,QAAQ,KAAQ;AACrB,YAAM,EAAE,GAAG,EAAC,IAAK,IAAI,MAAMR,aAAY,OAAO,GAAG,CAAC;AAClD,aAAO,IAAIQ,WAAU,GAAG,CAAC;IAC3B;IAEA,iBAAc;AAEZ,UAAI,CAAC,mBAAmB,KAAK,CAAC;AAAG,cAAM,IAAI,MAAM,2BAA2B;AAC5E,UAAI,CAAC,mBAAmB,KAAK,CAAC;AAAG,cAAM,IAAI,MAAM,2BAA2B;IAC9E;IAEA,eAAe,UAAgB;AAC7B,aAAO,IAAIA,WAAU,KAAK,GAAG,KAAK,GAAG,QAAQ;IAC/C;IAEA,iBAAiB,SAAY;AAC3B,YAAM,EAAE,GAAG,GAAG,UAAU,IAAG,IAAK;AAChC,YAAM,IAAI,cAAcR,aAAY,WAAW,OAAO,CAAC;AACvD,UAAI,OAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,GAAG;AAAG,cAAM,IAAI,MAAM,qBAAqB;AACrF,YAAM,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAIN,OAAM,IAAI;AACpD,UAAI,QAAQT,IAAG;AAAO,cAAM,IAAI,MAAM,4BAA4B;AAClE,YAAM,UAAU,MAAM,OAAO,IAAI,OAAO;AACxC,YAAM,IAAIiB,OAAM,QAAQ,SAAS,cAAc,IAAI,CAAC;AACpD,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,KAAK,KAAK,CAAC,IAAI,EAAE;AACvB,YAAM,KAAK,KAAK,IAAI,EAAE;AACtB,YAAM,IAAIA,OAAM,KAAK,qBAAqB,GAAG,IAAI,EAAE;AACnD,UAAI,CAAC;AAAG,cAAM,IAAI,MAAM,mBAAmB;AAC3C,QAAE,eAAc;AAChB,aAAO;IACT;;IAGA,WAAQ;AACN,aAAO,sBAAsB,KAAK,CAAC;IACrC;IAEA,aAAU;AACR,aAAO,KAAK,SAAQ,IAAK,IAAIM,WAAU,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;IACjF;;IAGA,gBAAa;AACX,aAAUC,YAAW,KAAK,SAAQ,CAAE;IACtC;IACA,WAAQ;AACN,aAAO,IAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;IAChD;;IAGA,oBAAiB;AACf,aAAUA,YAAW,KAAK,aAAY,CAAE;IAC1C;IACA,eAAY;AACV,aAAO,cAAc,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC;IACrD;;AAIF,QAAMC,SAAQ;IACZ,kBAAkB,YAAmB;AACnC,UAAI;AACF,+BAAuB,UAAU;AACjC,eAAO;MACT,SAAST,QAAO;AACd,eAAO;MACT;IACF;IACA;;;;;IAMA,kBAAkB,6BAAiB;AACjC,YAAM,SAAa,iBAAiBP,OAAM,CAAC;AAC3C,aAAW,eAAeA,OAAM,YAAY,MAAM,GAAGA,OAAM,CAAC;IAC9D,GAHkB;;;;;;;;;IAalB,WAAW,aAAa,GAAG,QAAQQ,OAAM,MAAI;AAC3C,YAAM,eAAe,UAAU;AAC/B,YAAM,SAAS,OAAO,CAAC,CAAC;AACxB,aAAO;IACT;;AASF,WAASS,cAAa,YAAqB,eAAe,MAAI;AAC5D,WAAOT,OAAM,eAAe,UAAU,EAAE,WAAW,YAAY;EACjE;AAFS,SAAAS,eAAA;AAOT,WAAS,UAAU,MAAsB;AACvC,UAAM,MAASxB,SAAQ,IAAI;AAC3B,UAAM,MAAM,OAAO,SAAS;AAC5B,UAAM,OAAO,OAAO,QAAS,KAAa;AAC1C,QAAI;AAAK,aAAO,QAAQ,iBAAiB,QAAQ;AACjD,QAAI;AAAK,aAAO,QAAQ,IAAI,iBAAiB,QAAQ,IAAI;AACzD,QAAI,gBAAgBe;AAAO,aAAO;AAClC,WAAO;EACT;AARS;AAoBT,WAASU,iBAAgB,UAAmB,SAAc,eAAe,MAAI;AAC3E,QAAI,UAAU,QAAQ;AAAG,YAAM,IAAI,MAAM,+BAA+B;AACxE,QAAI,CAAC,UAAU,OAAO;AAAG,YAAM,IAAI,MAAM,+BAA+B;AACxE,UAAM,IAAIV,OAAM,QAAQ,OAAO;AAC/B,WAAO,EAAE,SAAS,uBAAuB,QAAQ,CAAC,EAAE,WAAW,YAAY;EAC7E;AALS,SAAAU,kBAAA;AAWT,QAAMC,YACJnB,OAAM,YACN,SAAUG,QAAiB;AAGzB,UAAM,MAASE,iBAAgBF,MAAK;AACpC,UAAM,QAAQA,OAAM,SAAS,IAAIH,OAAM;AACvC,WAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;EAC5C;AACF,QAAM,gBACJA,OAAM,iBACN,SAAUG,QAAiB;AACzB,WAAO,KAAKgB,UAAShB,MAAK,CAAC;EAC7B;AAEF,QAAM,aAAgBiB,SAAQpB,OAAM,UAAU;AAI9C,WAAS,WAAW,KAAW;AAC7B,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,QAAI,EAAEL,QAAO,OAAO,MAAM;AACxB,YAAM,IAAI,MAAM,uBAAuBK,OAAM,UAAU,EAAE;AAE3D,WAAUY,iBAAgB,KAAKZ,OAAM,WAAW;EAClD;AANS;AAaT,WAAS,QAAQ,SAAc,YAAqB,OAAO,gBAAc;AACvE,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAAC,MAAM,KAAK,IAAI;AAClD,YAAM,IAAI,MAAM,qCAAqC;AACvD,UAAM,EAAE,MAAAqB,OAAM,aAAAC,aAAW,IAAKtB;AAC9B,QAAI,EAAE,MAAM,SAAS,cAAc,IAAG,IAAK;AAC3C,QAAI,QAAQ;AAAM,aAAO;AACzB,cAAUM,aAAY,WAAW,OAAO;AACxC,QAAI;AAAS,gBAAUA,aAAY,qBAAqBe,MAAK,OAAO,CAAC;AAKrE,UAAM,QAAQ,cAAc,OAAO;AACnC,UAAM,IAAI,uBAAuB,UAAU;AAC3C,UAAM,WAAW,CAAC,WAAW,CAAC,GAAG,WAAW,KAAK,CAAC;AAElD,QAAI,OAAO,MAAM;AAEf,YAAM,IAAI,QAAQ,OAAOC,aAAY/B,IAAG,KAAK,IAAI;AACjD,eAAS,KAAKe,aAAY,gBAAgB,CAAC,CAAC;IAC9C;AACA,UAAM,OAAUJ,aAAY,GAAG,QAAQ;AACvC,UAAM,IAAI;AAEV,aAAS,MAAM,QAAkB;AAE/B,YAAM,IAAIiB,UAAS,MAAM;AACzB,UAAI,CAAC,mBAAmB,CAAC;AAAG;AAC5B,YAAM,KAAK,KAAK,CAAC;AACjB,YAAM,IAAIX,OAAM,KAAK,SAAS,CAAC,EAAE,SAAQ;AACzC,YAAM,IAAI,KAAK,EAAE,CAAC;AAClB,UAAI,MAAMb;AAAK;AAIf,YAAM,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AACnC,UAAI,MAAMA;AAAK;AACf,UAAI,YAAY,EAAE,MAAM,IAAI,IAAI,KAAK,OAAO,EAAE,IAAIC,IAAG;AACrD,UAAI,QAAQ;AACZ,UAAI,QAAQ,sBAAsB,CAAC,GAAG;AACpC,gBAAQ,WAAW,CAAC;AACpB,oBAAY;MACd;AACA,aAAO,IAAIkB,WAAU,GAAG,OAAO,QAAQ;IACzC;AApBS;AAqBT,WAAO,EAAE,MAAM,MAAK;EACtB;AA9CS;AA+CT,QAAM,iBAA2B,EAAE,MAAMd,OAAM,MAAM,SAAS,MAAK;AACnE,QAAM,iBAA0B,EAAE,MAAMA,OAAM,MAAM,SAAS,MAAK;AAelE,WAASuB,MAAK,SAAc,SAAkB,OAAO,gBAAc;AACjE,UAAM,EAAE,MAAM,MAAK,IAAK,QAAQ,SAAS,SAAS,IAAI;AACtD,UAAM,IAAIvB;AACV,UAAM,OAAUwB,gBAAmC,EAAE,KAAK,WAAW,EAAE,aAAa,EAAE,IAAI;AAC1F,WAAO,KAAK,MAAM,KAAK;EACzB;AALS,SAAAD,OAAA;AAQT,EAAAf,OAAM,KAAK,eAAe,CAAC;AAgB3B,WAASiB,QACP,WACA,SACA,WACA,OAAO,gBAAc;AAErB,UAAM,KAAK;AACX,cAAUnB,aAAY,WAAW,OAAO;AACxC,gBAAYA,aAAY,aAAa,SAAS;AAC9C,QAAI,YAAY;AAAM,YAAM,IAAI,MAAM,oCAAoC;AAC1E,UAAM,EAAE,MAAM,QAAO,IAAK;AAE1B,QAAI,OAA8B;AAClC,QAAI;AACJ,QAAI;AACF,UAAI,OAAO,OAAO,YAAeb,SAAQ,EAAE,GAAG;AAG5C,YAAI;AACF,iBAAOqB,WAAU,QAAQ,EAAE;QAC7B,SAAS,UAAU;AACjB,cAAI,EAAE,oBAAoB,IAAI;AAAM,kBAAM;AAC1C,iBAAOA,WAAU,YAAY,EAAE;QACjC;MACF,WAAW,OAAO,OAAO,YAAY,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,UAAU;AACzF,cAAM,EAAE,GAAAY,IAAG,GAAAhC,GAAC,IAAK;AACjB,eAAO,IAAIoB,WAAUY,IAAGhC,EAAC;MAC3B,OAAO;AACL,cAAM,IAAI,MAAM,OAAO;MACzB;AACA,UAAIc,OAAM,QAAQ,SAAS;IAC7B,SAASD,QAAO;AACd,UAAKA,OAAgB,YAAY;AAC/B,cAAM,IAAI,MAAM,gEAAgE;AAClF,aAAO;IACT;AACA,QAAI,QAAQ,KAAK,SAAQ;AAAI,aAAO;AACpC,QAAI;AAAS,gBAAUP,OAAM,KAAK,OAAO;AACzC,UAAM,EAAE,GAAG,EAAC,IAAK;AACjB,UAAM,IAAI,cAAc,OAAO;AAC/B,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,IAAI,EAAE;AACtB,UAAM,KAAK,KAAK,IAAI,EAAE;AACtB,UAAM,IAAIQ,OAAM,KAAK,qBAAqB,GAAG,IAAI,EAAE,GAAG,SAAQ;AAC9D,QAAI,CAAC;AAAG,aAAO;AACf,UAAM,IAAI,KAAK,EAAE,CAAC;AAClB,WAAO,MAAM;EACf;AA/CS,SAAAiB,SAAA;AAgDT,SAAO;IACL,OAAAzB;IACA,cAAAiB;IACA,iBAAAC;IACA,MAAAK;IACA,QAAAE;IACA,iBAAiBjB;IACjB,WAAAM;IACA,OAAAE;;AAEJ;AAzZgB;;;AClrBV,IAAO,OAAP,cAAuCW,MAAa;EAH1D,OAG0D;;;EAQxD,YAAYC,OAAa,MAAW;AAClC,UAAK;AAJC,SAAA,WAAW;AACX,SAAA,YAAY;AAIlB,IAAAA,MAAWA,KAAI;AACf,UAAM,MAAMC,SAAQ,IAAI;AACxB,SAAK,QAAQD,MAAK,OAAM;AACxB,QAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,YAAM,IAAI,MAAM,qDAAqD;AACvE,SAAK,WAAW,KAAK,MAAM;AAC3B,SAAK,YAAY,KAAK,MAAM;AAC5B,UAAM,WAAW,KAAK;AACtB,UAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,QAAI,IAAI,IAAI,SAAS,WAAWA,MAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAAK,UAAI,CAAC,KAAK;AAC/C,SAAK,MAAM,OAAO,GAAG;AAErB,SAAK,QAAQA,MAAK,OAAM;AAExB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAAK,UAAI,CAAC,KAAK,KAAO;AACtD,SAAK,MAAM,OAAO,GAAG;AACrB,QAAI,KAAK,CAAC;EACZ;EACA,OAAO,KAAU;AACf,IAAAE,QAAa,IAAI;AACjB,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;EACT;EACA,WAAW,KAAe;AACxB,IAAAA,QAAa,IAAI;AACjB,IAAAC,OAAY,KAAK,KAAK,SAAS;AAC/B,SAAK,WAAW;AAChB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,QAAO;EACd;EACA,SAAM;AACJ,UAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,SAAK,WAAW,GAAG;AACnB,WAAO;EACT;EACA,WAAW,IAAY;AAErB,WAAA,KAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,UAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,SAAK;AACL,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,WAAO;EACT;EACA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,MAAM,QAAO;AAClB,SAAK,MAAM,QAAO;EACpB;;AASK,IAAM,OAAO,wBAACH,OAAa,KAAY,YAC5C,IAAI,KAAUA,OAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM,GAD7B;AAEpB,KAAK,SAAS,CAACA,OAAa,QAAe,IAAI,KAAUA,OAAM,GAAG;;;ACzE5D,SAAU,QAAQI,OAAW;AACjC,SAAO;IACL,MAAAA;IACA,MAAM,wBAAC,QAAoB,SAAuB,KAAKA,OAAM,KAAKC,aAAY,GAAG,IAAI,CAAC,GAAhF;IACN,aAAAC;;AAEJ;AANgB;;;AdChB,IAAM,cAAc,OAAO,8EAA8E;AAClG,IAAM,YAAY,OAAO,mEAAmE;AACnG,IAAM,aAAa;AACnB,SAAS,SAASC,QAAO;AACrB,SAAOA,OAAM,CAAC,MAAM;AAChB,IAAAA,SAAQA,OAAM,SAAS,CAAC;AAC5B,QAAM,QAAQA,OAAM,SAAS,IAAI;AACjC,QAAM,MAAQC,iBAAgBD,MAAK;AACnC,SAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;AAC9C;AANS;AAOT,SAAS,aAAa,KAAK;AACvB,MAAI,OAAO,QAAQ,UAAU;AACzB,UAAM,QAAQ,GAAG;AACjB,QAAI,IAAI,SAAS;AACb,YAAM,MAAM;AAAA,EACpB;AACA,SAASE,YAAW,GAAG;AAC3B;AAPS;AAQT,IAAM,QAAQ,YAAY;AAAA,EACtB,GAAG,OAAO,CAAC;AAAA,EACX,GAAG,OAAO,8EAA8E;AAAA,EACxF,IAAI,MAAM,OAAO,mEAAmE,CAAC;AAAA,EACrF,GAAG;AAAA,EACH;AAAA,EACA,IAAI,OAAO,6EAA6E;AAAA,EACxF,IAAI,OAAO,6EAA6E;AAAA,EACxF,GAAG,OAAO,CAAC;AAAA,EACX,MAAM;AAAA,EACN,GAAG,QAAQ,MAAM;AAAA,EACjB;AAAA,EACA,eAAe,wBAACF,WAAU;AACtB,UAAM,MAAQC,iBAAgBD,MAAK,EAAE,SAAS,EAAE;AAChD,QAAI,IAAI,WAAW;AACf,MAAAA,SAAQ,aAAa,MAAM,GAAG;AAClC,WAAO,IAAI,SAASA,MAAK,GAAG,WAAW;AAAA,EAC3C,GALe;AAMnB,CAAC;AACM,IAAM,cAAc;AAC3B,SAASG,aAAY,KAAK;AACtB,SAASA,aAAY,IAAI,OAAO,QAAQ,WAAW,aAAa,GAAG,IAAI,GAAG;AAC9E;AAFS,OAAAA,cAAA;AAGT,SAAS,YAAY,SAAS;AAC1B,SAASC,YAAWD,aAAY,OAAO,CAAC,EAAE,SAAS,IAAI,GAAG;AAC9D;AAFS;AAGF,SAAS,aAAa,SAAS,eAAe,OAAO;AACxD,SAAO,MAAM,aAAa,YAAY,OAAO,GAAG,YAAY;AAChE;AAFgB;AAGT,SAAS,gBAAgB,UAAU,SAAS;AAC/C,SAAO,MAAM,gBAAgB,YAAY,QAAQ,GAAG,OAAO;AAC/D;AAFgB;AAGhB,SAAS,eAAe,WAAW;AAC/B,QAAM,EAAE,GAAG,EAAE,IAAI;AACjB,MAAI,IAAI,MAAM,KAAK;AACf,UAAM,IAAI,MAAM,6BAA6B,SAAS,GAAG;AAC7D,QAAM,IAAI,OAAO,GAAG,WAAW;AAC/B,MAAI,IAAI,MAAM,KAAK;AACf,UAAM,IAAI,MAAM,kCAAkC,SAAS,GAAG;AACtE;AAPS;AAQT,SAAS,aAAa,SAAS;AAC3B,QAAMH,SAAQG,aAAY,OAAO;AACjC,QAAM,MAAQF,iBAAgBD,MAAK;AACnC,MAAI,OAAO;AACP,UAAM,IAAI,MAAM,yBAAyB,SAAS,GAAG;AACzD,SAAOA;AACX;AANS;AAOF,SAAS,KAAK,SAAS,SAAS,MAAM;AACzC,QAAM,MAAM,MAAM,KAAK,aAAa,OAAO,GAAG,YAAY,OAAO,GAAG,IAAI;AACxE,iBAAe,GAAG;AAClB,SAAO;AACX;AAJgB;AAKT,SAAS,OAAO,WAAW,SAAS,QAAQ;AAC/C,MAAI,EAAE,qBAAqB,YAAY;AACnC,UAAMA,SAAQG,aAAY,SAAS;AACnC,QAAI;AACA,kBAAY,UAAU,QAAQH,MAAK;AAAA,IACvC,SACO,UAAU;AACb,UAAI,EAAE,oBAAoB,IAAI;AAC1B,cAAM;AACV,kBAAY,UAAU,YAAYA,MAAK;AAAA,IAC3C;AAAA,EACJ;AACA,iBAAe,SAAS;AACxB,SAAO,MAAM,OAAO,WAAW,aAAa,OAAO,GAAGG,aAAY,MAAM,CAAC;AAC7E;AAdgB;AAehB,IAAM,EAAE,OAAO,iBAAiB,WAAW,MAAM,IAAI;AAErD,SAAS,SAASE,QAAO;AACrB,QAAM,MAAQC,YAAWD,OAAM,SAAS,CAAC,CAAC;AAC1C,QAAM,WAAW,IAAI,QAAQ,SAAS,EAAE;AACxC,SAAO,KAAK,QAAQ;AACxB;AAJS;AAKT,SAAS,QAAQ,KAAK;AAClB,SAAO,IAAI,QAAQ,QAAQ,EAAE;AACjC;AAFS;AAGF,SAAS,SAAS,MAAM;AAC3B,QAAM,QAAQE,aAAY,IAAI;AAC9B,QAAM,aAAa,MAAM;AACzB,QAAM,QAAQ,aAAa,IAAI,YAAY,WAAW;AACtD,WAAS,IAAI,KAAI,KAAK;AAClB,UAAM,MAAM,UAAYC,aAAY,OAASC,oBAAmB,OAAO,CAAC,CAAC,CAAC,CAAC;AAC3E,QAAI,MAAM;AACN,aAAO,IAAI,KAAK,WAAW,EAAE,SAAS,EAAE;AAC5C,QAAI,MAAM;AACN,YAAM,IAAI,MAAM,qCAAqC;AAAA,EAC7D;AACJ;AAXgB;AAYT,SAAS,YAAY,YAAY;AACpC,SAAO,SAAS,aAAa,YAAY,IAAI,CAAC;AAClD;AAFgB;AAGT,SAAS,gBAAgB,WAAW;AACvC,cAAY,QAAQ,SAAS;AAC7B,MAAI,UAAU,WAAW;AACrB,UAAM,IAAI,MAAM,0BAA0B;AAC9C,SAAO,SAAS,UAAU,UAAU,GAAG,EAAE,CAAC;AAC9C;AALgB;AAMhB,IAAM,UAAU,MAAM,MAAM;AAC5B,IAAM,QAAQ,wBAAC,MAAM,OAAO,IAAI,OAAO,GAAzB;AACP,SAAS,eAAe,OAAO,aAAa,iBAAiB,OAAO;AACvE,QAAM,WAAW,MAAM,UAAU,KAAK,CAAC;AACvC,QAAM,iBAAiB,MAAM,UAAU,WAAW,CAAC;AACnD,QAAM,MAAQC,aAAY,QAAQ,eAAe,CAAC;AAClD,SAAO,WAAW,QAAQ,KAAK,cAAc,KAAK,MAAM,GAAG,CAAC,KAAK,MAAM,OAAO,GAAG,CAAC,KAAK,KAAK;AAChG;AALgB;AAMhB,IAAM,kBAAkB;AAAA,EACpB,IAAI,gBAAgB,+EAA+E,+EAA+E,EAAE;AAAA,EACpL,IAAI,gBAAgB,8EAA8E,+EAA+E,EAAE;AAAA,EACnL,IAAI,gBAAgB,+EAA+E,+EAA+E,EAAE;AAAA,EACpL,IAAI,gBAAgB,+EAA+E,8EAA8E,EAAE;AAAA,EACnL,IAAI,gBAAgB,+EAA+E,8EAA8E,EAAE;AACvL;AACA,SAAS,mBAAmB,IAAI,IAAI;AAChC,QAAM,MAAM,CAAC;AACb,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,QAAI,KAAK,CAAC;AACV,QAAI,EAAE,OAAO;AAAA,EACjB;AACA,MAAI;AACJ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,QAAI,KAAK,CAAC;AACV,QAAI,EAAE,OAAO;AAAA,EACjB;AACA,SAAO;AACX;AAbS;AAcT,IAAM,mBAAmB,mBAAmB,gBAAgB,CAAC,GAAG,gBAAgB,CAAC,CAAC;AAClF,IAAM,mBAAmB,mBAAmB,gBAAgB,CAAC,GAAG,gBAAgB,CAAC,CAAC;AAClF,SAAS,YAAY,KAAK;AACtB,MAAI;AACJ,MAAI,OAAO,QAAQ,UAAU;AACzB,YAAQ;AAAA,EACZ,WACS,OAAO,QAAQ,UAAU;AAC9B,QAAI,CAAC,OAAO,cAAc,GAAG;AACzB,YAAM,IAAI,MAAM,wBAAwB,GAAG,EAAE;AACjD,YAAQ,OAAO,GAAG;AAAA,EACtB,OACK;AACD,YAAUC,iBAAgBJ,aAAY,GAAG,CAAC;AAAA,EAC9C;AACA,MAAI,EAAE,MAAM,SAAS,QAAQ,MAAM,MAAM,GAAG;AACxC,UAAM,IAAI,MAAM,+CAA+C,KAAK,EAAE;AAC1E,SAAO;AACX;AAhBS;AAiBT,SAAS,eAAe,OAAO,OAAO,WAAW;AAC7C,MAAI,IAAI,YAAY,KAAK;AACzB,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC1B,UAAM,KAAK,UAAU,CAAC;AACtB,QAAI,GAAG,OAAO,KAAK;AACf,YAAM,IAAI,MAAM,YAAY;AAChC,SAAK,IAAI,QAAQ;AACb,cAAQ,MAAM,IAAI,EAAE;AACxB,UAAM;AAAA,EACV;AACA,SAAO;AACX;AAXS;AAYF,SAAS,SAAS,GAAG,GAAG;AAC3B,MAAI,QAAQ,gBAAgB,CAAC;AAC7B,UAAQ,eAAe,OAAO,GAAG,gBAAgB;AACjD,UAAQ,eAAe,OAAO,GAAG,gBAAgB;AACjD,SAAO,SAAS,MAAM,WAAW,IAAI,CAAC;AAC1C;AALgB;AAMT,IAAM,wBAAwB,wBAAC,MAAM,KAAK,aAAa,CAAC,GAAG,GAAG,MAAM,KAAK,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,GAA5E;AACrC,IAAM,WAAaK,SAAQ,GAAG;AACvB,IAAM,SAAS,wBAAC,SAAWD,iBAAgBE,YAAW,IAAI,CAAC,IAAI,UAAhD;AACtB,IAAM,YAAY,wBAAC,SAAWF,iBAAgB,OAAO,IAAI,CAAC,GAAxC;AACX,IAAM,QAAQ,MAAM,OAAO,8EAA8E,CAAC;AACjH,SAAS,sBAAsBG,KAAI,MAAM,KAAK;AAC1C,QAAM,MAAMA,IAAG,UAAU,OAAOC,aAAY,GAAG,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC;AAC7D,SAAOD,IAAG,OAAO,GAAG;AACxB;AAHS;AAIF,SAAS,aAAaA,KAAI,MAAM,GAAG,UAAU,GAAG;AACnD,QAAM,WAAW,CAAC;AAClB,QAAM,WAAW,CAAC;AAClB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AACxB,aAAS,KAAK,sBAAsBA,KAAI,GAAG,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC;AACpE,aAAS,KAAK,sBAAsBA,KAAI,GAAG,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC;AAAA,EACxE;AACA,OAAI,oBAAI,IAAI,CAAC,GAAG,UAAU,GAAG,QAAQ,CAAC,GAAE,SAAS,IAAI;AACjD,UAAM,IAAI,MAAM,iCAAiC;AACrD,SAAO,SAAS,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAMA,IAAG,IAAIA,IAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AACxE;AAVgB;AAWhB,IAAM,YAAY;AAAA,EACd,CAAC,GAAG,GAAG,CAAC;AAAA,EACR,CAAC,GAAG,IAAI,CAAC;AAAA,EACT,CAAC,GAAG,GAAG,EAAE;AACb,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,MAAM,CAAC;AACnB,SAAS,cAAc,MAAM,KAAK;AACrC,gBAAc,KAAK,EAAE;AACrB,MAAI,CAAC,OAAO,cAAc,KAAK,IAAI,KAAK,CAAC,OAAO,cAAc,KAAK,QAAQ;AACvE,UAAM,IAAI,MAAM,wBAAwB,IAAI,EAAE;AAClD,QAAM,IAAI,KAAK,OAAO,KAAK;AAC3B,QAAM,SAAS,KAAK,aAAa,KAAK;AACtC,QAAM,iBAAiB,CAAC;AACxB,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,UAAM,MAAM,CAAC;AACb,aAAS,IAAI,GAAG,IAAI,GAAG;AACnB,UAAI,KAAK,sBAAsB,KAAK,IAAI,SAAS,IAAI,IAAI,CAAC,CAAC;AAC/D,mBAAe,KAAK,GAAG;AAAA,EAC3B;AACA,QAAM,MAAM,SAAS;AAAA,IACjB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB;AAAA,IACA;AAAA,EACJ,CAAC;AACD,MAAI,IAAI;AACR,MAAI,OAAO,KAAK;AAChB,MAAI,WAAW,KAAK;AACpB,SAAO;AACX;AAzBgB;AA0BT,SAAS,eAAe,MAAM,aAAa,GAAG;AACjD,QAAM,IAAI,KAAK,OAAO,KAAK;AAC3B,MAAI,CAAC,OAAO,cAAc,UAAU;AAChC,UAAM,IAAI,MAAM,oBAAoB,UAAU,EAAE;AACpD,SAAO,cAAc,MAAM,aAAa,KAAK,IAAI,YAAY,GAAG,UAAU,CAAC;AAC/E;AALgB;AAMT,IAAM,gBAAgB,cAAc,EAAE,IAAI,OAAO,MAAM,GAAG,UAAU,GAAG,YAAY,GAAG,eAAe,GAAG,GAAG,SAAS;AACpH,SAAS,aAAa,GAAG,GAAG,KAAK,eAAe;AACnD,SAAO,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC;AAC3B;AAFgB;AAGT,SAAS,iBAAiB,GAAG,GAAG,KAAK,eAAe;AACvD,SAASL,oBAAmB,aAAeE,iBAAgB,CAAC,GAAKA,iBAAgB,CAAC,GAAG,EAAE,CAAC;AAC5F;AAFgB;AAGT,SAAS,mBAAmB,GAAG,KAAK,eAAe;AACtD,SAAO,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,CAAC;AAC5B;AAFgB;AAGT,SAAS,iBAAiB,QAAQ,KAAK,eAAe;AACzD,QAAM,EAAE,GAAG,KAAK,IAAI;AACpB,MAAI,CAAC,MAAM,QAAQ,MAAM;AACrB,UAAM,IAAI,MAAM,iCAAiC;AACrD,QAAM,SAAS,MAAM,KAAK,MAAM;AAChC,SAAO,KAAK,EAAE;AACd,SAAO,OAAO,SAAS,SAAS;AAC5B,WAAO,KAAK,EAAE;AAClB,MAAI,QAAQ,IAAI,MAAM,CAAC,EAAE,KAAK,EAAE;AAChC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,MAAM;AAC1C,aAAS,IAAI,GAAG,IAAI,MAAM;AACtB,YAAM,CAAC,KAAK,OAAO,IAAI,CAAC;AAC5B,YAAQ,GAAG,KAAK;AAAA,EACpB;AACA,SAAO,MAAM,CAAC;AAClB;AAfgB;;;AejQhB;;kBAAAK;EAAA;sBAAAC;;;;ACYA,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyDC,OAAM,OAAO,CAAC;AAEvE,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,OAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAEtD,IAAMC,OAAM,OAAO,CAAC;AAApB,IAAuBC,QAAO,OAAO,EAAE;AAGjC,SAAUC,KAAI,GAAW,GAAS;AACtC,QAAM,SAAS,IAAI;AACnB,SAAO,UAAUT,OAAM,SAAS,IAAI;AACtC;AAHgB,OAAAS,MAAA;AAWV,SAAUC,KAAI,KAAa,OAAe,QAAc;AAC5D,MAAI,UAAUV,QAAO,QAAQA;AAAK,UAAM,IAAI,MAAM,2BAA2B;AAC7E,MAAI,WAAWC;AAAK,WAAOD;AAC3B,MAAI,MAAMC;AACV,SAAO,QAAQD,MAAK;AAClB,QAAI,QAAQC;AAAK,YAAO,MAAM,MAAO;AACrC,UAAO,MAAM,MAAO;AACpB,cAAUA;EACZ;AACA,SAAO;AACT;AAVgB,OAAAS,MAAA;AAaV,SAAUC,MAAK,GAAW,OAAe,QAAc;AAC3D,MAAI,MAAM;AACV,SAAO,UAAUX,MAAK;AACpB,WAAO;AACP,WAAO;EACT;AACA,SAAO;AACT;AAPgB,OAAAW,OAAA;AAUV,SAAUC,QAAOC,SAAgB,QAAc;AACnD,MAAIA,YAAWb,QAAO,UAAUA,MAAK;AACnC,UAAM,IAAI,MAAM,6CAA6Ca,OAAM,QAAQ,MAAM,EAAE;EACrF;AAGA,MAAI,IAAIJ,KAAII,SAAQ,MAAM;AAC1B,MAAI,IAAI;AAER,MAAI,IAAIb,MAAK,IAAIC,MAAK,IAAIA,MAAK,IAAID;AACnC,SAAO,MAAMA,MAAK;AAEhB,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI;AACd,UAAM,IAAI,IAAI,IAAI;AAClB,UAAM,IAAI,IAAI,IAAI;AAElB,QAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;EACzC;AACA,QAAMc,OAAM;AACZ,MAAIA,SAAQb;AAAK,UAAM,IAAI,MAAM,wBAAwB;AACzD,SAAOQ,KAAI,GAAG,MAAM;AACtB;AAtBgB,OAAAG,SAAA;AAgCV,SAAUG,eAAc,GAAS;AAMrC,QAAM,aAAa,IAAId,QAAOC;AAE9B,MAAI,GAAW,GAAW;AAG1B,OAAK,IAAI,IAAID,MAAK,IAAI,GAAG,IAAIC,SAAQF,MAAK,KAAKE,MAAK;AAAI;AAGxD,OAAK,IAAIA,MAAK,IAAI,KAAKQ,KAAI,GAAG,WAAW,CAAC,MAAM,IAAIT,MAAK;AAAI;AAG7D,MAAI,MAAM,GAAG;AACX,UAAM,UAAU,IAAIA,QAAOG;AAC3B,WAAO,gCAAS,YAAeY,KAAe,GAAI;AAChD,YAAM,OAAOA,IAAG,IAAI,GAAG,MAAM;AAC7B,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GAJO;EAKT;AAGA,QAAM,UAAU,IAAIf,QAAOC;AAC3B,SAAO,gCAAS,YAAec,KAAe,GAAI;AAEhD,QAAIA,IAAG,IAAI,GAAG,SAAS,MAAMA,IAAG,IAAIA,IAAG,GAAG;AAAG,YAAM,IAAI,MAAM,yBAAyB;AACtF,QAAI,IAAI;AAER,QAAI,IAAIA,IAAG,IAAIA,IAAG,IAAIA,IAAG,KAAK,CAAC,GAAG,CAAC;AACnC,QAAI,IAAIA,IAAG,IAAI,GAAG,MAAM;AACxB,QAAI,IAAIA,IAAG,IAAI,GAAG,CAAC;AAEnB,WAAO,CAACA,IAAG,IAAI,GAAGA,IAAG,GAAG,GAAG;AACzB,UAAIA,IAAG,IAAI,GAAGA,IAAG,IAAI;AAAG,eAAOA,IAAG;AAElC,UAAI,IAAI;AACR,eAAS,KAAKA,IAAG,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AACnC,YAAIA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAAG;AACxB,aAAKA,IAAG,IAAI,EAAE;MAChB;AAEA,YAAM,KAAKA,IAAG,IAAI,GAAGf,QAAO,OAAO,IAAI,IAAI,CAAC,CAAC;AAC7C,UAAIe,IAAG,IAAI,EAAE;AACb,UAAIA,IAAG,IAAI,GAAG,EAAE;AAChB,UAAIA,IAAG,IAAI,GAAG,CAAC;AACf,UAAI;IACN;AACA,WAAO;EACT,GAzBO;AA0BT;AAtDgB,OAAAD,gBAAA;AAwDV,SAAUE,QAAO,GAAS;AAM9B,MAAI,IAAIb,SAAQD,MAAK;AAKnB,UAAM,UAAU,IAAIF,QAAOG;AAC3B,WAAO,gCAAS,UAAaY,KAAe,GAAI;AAC9C,YAAM,OAAOA,IAAG,IAAI,GAAG,MAAM;AAE7B,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GALO;EAMT;AAGA,MAAI,IAAIV,SAAQD,MAAK;AACnB,UAAM,MAAM,IAAIA,QAAOC;AACvB,WAAO,gCAAS,UAAaU,KAAe,GAAI;AAC9C,YAAM,KAAKA,IAAG,IAAI,GAAGd,IAAG;AACxB,YAAM,IAAIc,IAAG,IAAI,IAAI,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,CAAC;AACtB,YAAM,IAAIA,IAAG,IAAIA,IAAG,IAAI,IAAId,IAAG,GAAG,CAAC;AACnC,YAAM,OAAOc,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAGA,IAAG,GAAG,CAAC;AACzC,UAAI,CAACA,IAAG,IAAIA,IAAG,IAAI,IAAI,GAAG,CAAC;AAAG,cAAM,IAAI,MAAM,yBAAyB;AACvE,aAAO;IACT,GARO;EAST;AAGA,MAAI,IAAIR,UAASD,MAAK;EAoBtB;AAGA,SAAOQ,eAAc,CAAC;AACxB;AA3DgB,OAAAE,SAAA;AA2GhB,IAAMC,gBAAe;EACnB;EAAU;EAAW;EAAO;EAAO;EAAO;EAAQ;EAClD;EAAO;EAAO;EAAO;EAAO;EAAO;EACnC;EAAQ;EAAQ;EAAQ;;AAEpB,SAAUC,eAAiB,OAAgB;AAC/C,QAAM,UAAU;IACd,OAAO;IACP,MAAM;IACN,OAAO;IACP,MAAM;;AAER,QAAM,OAAOD,cAAa,OAAO,CAACE,MAAK,QAAe;AACpD,IAAAA,KAAI,GAAG,IAAI;AACX,WAAOA;EACT,GAAG,OAAO;AACV,SAAO,eAAe,OAAO,IAAI;AACnC;AAZgB,OAAAD,gBAAA;AAoBV,SAAUE,OAAS,GAAc,KAAQ,OAAa;AAG1D,MAAI,QAAQC;AAAK,UAAM,IAAI,MAAM,oBAAoB;AACrD,MAAI,UAAUA;AAAK,WAAO,EAAE;AAC5B,MAAI,UAAUC;AAAK,WAAO;AAC1B,MAAI,IAAI,EAAE;AACV,MAAI,IAAI;AACR,SAAO,QAAQD,MAAK;AAClB,QAAI,QAAQC;AAAK,UAAI,EAAE,IAAI,GAAG,CAAC;AAC/B,QAAI,EAAE,IAAI,CAAC;AACX,cAAUA;EACZ;AACA,SAAO;AACT;AAdgB,OAAAF,QAAA;AAoBV,SAAUG,eAAiB,GAAc,MAAS;AACtD,QAAM,MAAM,IAAI,MAAM,KAAK,MAAM;AAEjC,QAAM,iBAAiB,KAAK,OAAO,CAAC,KAAK,KAAK,MAAK;AACjD,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,QAAI,CAAC,IAAI;AACT,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,EAAE,GAAG;AAER,QAAM,WAAW,EAAE,IAAI,cAAc;AAErC,OAAK,YAAY,CAAC,KAAK,KAAK,MAAK;AAC/B,QAAI,EAAE,IAAI,GAAG;AAAG,aAAO;AACvB,QAAI,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1B,WAAO,EAAE,IAAI,KAAK,GAAG;EACvB,GAAG,QAAQ;AACX,SAAO;AACT;AAjBgB,OAAAA,gBAAA;AAiCV,SAAUC,SAAQ,GAAWC,aAAmB;AAEpD,QAAM,cAAcA,gBAAe,SAAYA,cAAa,EAAE,SAAS,CAAC,EAAE;AAC1E,QAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,SAAO,EAAE,YAAY,aAAa,YAAW;AAC/C;AALgB,OAAAD,UAAA;AAoBV,SAAUE,OACd,OACAC,SACAC,QAAO,OACP,QAAiC,CAAA,GAAE;AAEnC,MAAI,SAASC;AAAK,UAAM,IAAI,MAAM,iCAAiC,KAAK,EAAE;AAC1E,QAAM,EAAE,YAAY,MAAM,aAAa,MAAK,IAAKL,SAAQ,OAAOG,OAAM;AACtE,MAAI,QAAQ;AAAM,UAAM,IAAI,MAAM,iDAAiD;AACnF,QAAM,QAAQG,QAAO,KAAK;AAC1B,QAAM,IAAuB,OAAO,OAAO;IACzC;IACA;IACA;IACA,MAAM,QAAQ,IAAI;IAClB,MAAMD;IACN,KAAKE;IACL,QAAQ,wBAAC,QAAQC,KAAI,KAAK,KAAK,GAAvB;IACR,SAAS,wBAAC,QAAO;AACf,UAAI,OAAO,QAAQ;AACjB,cAAM,IAAI,MAAM,+CAA+C,OAAO,GAAG,EAAE;AAC7E,aAAOH,QAAO,OAAO,MAAM;IAC7B,GAJS;IAKT,KAAK,wBAAC,QAAQ,QAAQA,MAAjB;IACL,OAAO,wBAAC,SAAS,MAAME,UAASA,MAAzB;IACP,KAAK,wBAAC,QAAQC,KAAI,CAAC,KAAK,KAAK,GAAxB;IACL,KAAK,wBAAC,KAAK,QAAQ,QAAQ,KAAtB;IAEL,KAAK,wBAAC,QAAQA,KAAI,MAAM,KAAK,KAAK,GAA7B;IACL,KAAK,wBAAC,KAAK,QAAQA,KAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,QAAQA,KAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,QAAQA,KAAI,MAAM,KAAK,KAAK,GAAlC;IACL,KAAK,wBAAC,KAAK,UAAUC,OAAM,GAAG,KAAK,KAAK,GAAnC;IACL,KAAK,wBAAC,KAAK,QAAQD,KAAI,MAAME,QAAO,KAAK,KAAK,GAAG,KAAK,GAAjD;;IAGL,MAAM,wBAAC,QAAQ,MAAM,KAAf;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IACN,MAAM,wBAAC,KAAK,QAAQ,MAAM,KAApB;IAEN,KAAK,wBAAC,QAAQA,QAAO,KAAK,KAAK,GAA1B;IACL,MAAM,MAAM,SAAS,CAAC,MAAM,MAAM,GAAG,CAAC;IACtC,aAAa,wBAAC,QAAQC,eAAc,GAAG,GAAG,GAA7B;;;IAGb,MAAM,wBAAC,GAAG,GAAG,MAAO,IAAI,IAAI,GAAtB;IACN,SAAS,wBAAC,QAASP,QAAO,gBAAgB,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,GAAzE;IACT,WAAW,wBAACQ,WAAS;AACnB,UAAIA,OAAM,WAAW;AACnB,cAAM,IAAI,MAAM,0BAA0B,KAAK,SAASA,OAAM,MAAM,EAAE;AACxE,aAAOR,QAAO,gBAAgBQ,MAAK,IAAI,gBAAgBA,MAAK;IAC9D,GAJW;GAKD;AACZ,SAAO,OAAO,OAAO,CAAC;AACxB;AAvDgB,OAAAV,QAAA;AA+FV,SAAUW,qBAAoB,YAAkB;AACpD,MAAI,OAAO,eAAe;AAAU,UAAM,IAAI,MAAM,4BAA4B;AAChF,QAAM,YAAY,WAAW,SAAS,CAAC,EAAE;AACzC,SAAO,KAAK,KAAK,YAAY,CAAC;AAChC;AAJgB,OAAAA,sBAAA;AAaV,SAAUC,kBAAiB,YAAkB;AACjD,QAAM,SAASD,qBAAoB,UAAU;AAC7C,SAAO,SAAS,KAAK,KAAK,SAAS,CAAC;AACtC;AAHgB,OAAAC,mBAAA;AAkBV,SAAUC,gBAAe,KAAiB,YAAoBC,QAAO,OAAK;AAC9E,QAAM,MAAM,IAAI;AAChB,QAAM,WAAWH,qBAAoB,UAAU;AAC/C,QAAM,SAASC,kBAAiB,UAAU;AAE1C,MAAI,MAAM,MAAM,MAAM,UAAU,MAAM;AACpC,UAAM,IAAI,MAAM,YAAY,MAAM,6BAA6B,GAAG,EAAE;AACtE,QAAM,MAAME,QAAO,gBAAgB,GAAG,IAAI,gBAAgB,GAAG;AAE7D,QAAM,UAAUC,KAAI,KAAK,aAAaC,IAAG,IAAIA;AAC7C,SAAOF,QAAO,gBAAgB,SAAS,QAAQ,IAAI,gBAAgB,SAAS,QAAQ;AACtF;AAXgB,OAAAD,iBAAA;;;ADxcV,SAAUI,cAAa,MAAkB;AAC7C,QAAM,EAAE,IAAAC,KAAI,KAAK,sBAAsB,KAAK,gBAAgB,GAAE,IAAK;AACnE,QAAM,EAAE,YAAY,eAAe,WAAW,EAAC,IAAK;AAEpD,EAAAC,eAAcD,GAAE;AAChB,aAAW,KAAK,CAAC,KAAK,cAAc,eAAe,GAAY;AAC7D,QAAI,OAAO,KAAK,CAAC,MAAM,YAAY,CAAC,OAAO,cAAc,KAAK,CAAC,CAAC;AAC9D,YAAM,IAAI,MAAM,2BAA2B,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC,GAAG;EACjF;AAGA,MAAI,CAAC,MAAM,QAAQ,GAAG,KAAK,IAAI,WAAW;AAAG,UAAM,IAAI,MAAM,4BAA4B;AACzF,QAAM,OAAO,IAAI,IAAI,CAAC,WAAU;AAC9B,QAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAC9C,YAAM,IAAI,MAAM,4BAA4B,MAAM,EAAE;AACtD,WAAO,OAAO,IAAI,CAAC,MAAK;AACtB,UAAI,OAAO,MAAM;AAAU,cAAM,IAAI,MAAM,6BAA6B,CAAC,EAAE;AAC3E,aAAOA,IAAG,OAAO,CAAC;IACpB,CAAC;EACH,CAAC;AAED,MAAI,QAAQ,UAAa,OAAO,QAAQ;AACtC,UAAM,IAAI,MAAM,gDAAgD,GAAG,EAAE;AAEvE,MAAI,aAAa,MAAM;AAAG,UAAM,IAAI,MAAM,oCAAoC,UAAU,EAAE;AAC1F,QAAM,SAAS,aAAa;AAE5B,MAAI,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG,WAAW;AACtC,UAAM,IAAI,MAAM,iCAAiC;AACnD,QAAM,iBAAiB,GAAG,IAAI,CAACE,QAAM;AACnC,QAAI,CAAC,MAAM,QAAQA,GAAE,KAAKA,IAAG,WAAW;AACtC,YAAM,IAAI,MAAM,mCAAmCA,GAAE,EAAE;AACzD,WAAOA,IAAG,IAAI,CAAC,MAAK;AAClB,UAAI,OAAO,MAAM,YAAY,CAACF,IAAG,QAAQ,CAAC;AACxC,cAAM,IAAI,MAAM,iCAAiC,CAAC,EAAE;AACtD,aAAOA,IAAG,OAAO,CAAC;IACpB,CAAC;EACH,CAAC;AAED,MAAI,CAAC,aAAa,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,SAAS,SAAS;AAC7C,UAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;AACzD,QAAM,aAAa,OAAO,SAAS;AACnC,MAAI,SAAS,wBAAC,MAAcG,OAAMH,KAAI,GAAG,UAAU,GAAtC;AAEb,MAAI,cAAc;AAAG,aAAS,wBAAC,MAAcA,IAAG,IAAIA,IAAG,KAAK,CAAC,GAAG,CAAC,GAAnC;WACrB,cAAc;AAAG,aAAS,wBAAC,MAAcA,IAAG,IAAIA,IAAG,KAAKA,IAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAA5C;AAEnC,SAAO,OAAO,OAAO,EAAE,GAAG,MAAM,QAAQ,QAAQ,gBAAgB,KAAK,KAAI,CAAE;AAC7E;AAhDgB,OAAAD,eAAA;AAkDV,SAAU,eAAe,IAAc,GAAS;AACpD,MAAI,OAAO,MAAM;AAAU,UAAM,IAAI,MAAM,iCAAiC;AAC5E,MAAI,CAAC,MAAM,QAAQ,EAAE,KAAK,GAAG,SAAS;AAAG,UAAM,IAAI,MAAM,kCAAkC;AAC3F,QAAM,MAAM,CAAA;AACZ,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,QAAI,KAAK,GAAG,CAAC,CAAC;AACd,QAAI,IAAI,WAAW,GAAG;AACpB,UAAI,KAAK,GAAG;AACZ,YAAM,CAAA;IACR;EACF;AACA,SAAO;AACT;AAbgB;AAeV,SAAUK,UAAS,MAAkB;AACzC,QAAM,QAAQL,cAAa,IAAI;AAC/B,QAAM,EAAE,IAAAC,KAAI,KAAK,gBAAgB,QAAQ,eAAe,QAAQ,EAAC,IAAK;AACtE,QAAM,iBAAiB,MAAM,aAAa;AAC1C,QAAM,aAAa,MAAM,uBAAuB,IAAI,IAAI;AACxD,QAAM,gBAAgB,wBAAC,QAAkB,QAAiB,QAAe;AACvE,aAAS,OAAO,IAAI,CAAC,GAAG,MAAMA,IAAG,IAAI,GAAG,eAAe,GAAG,EAAE,CAAC,CAAC,CAAC;AAE/D,QAAI;AAAQ,eAAS,OAAO,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC;;AAC3C,aAAO,UAAU,IAAI,OAAO,OAAO,UAAU,CAAC;AAEnD,aAAS,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,KAAKK,IAAG,MAAML,IAAG,IAAI,KAAKA,IAAG,KAAKK,IAAG,OAAO,CAAC,CAAC,CAAC,GAAGL,IAAG,IAAI,CAAC;AAC5F,WAAO;EACT,GARsB;AAStB,QAAMM,gBAAe,gCAASA,cAAa,QAAgB;AACzD,QAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW;AAC9C,YAAM,IAAI,MAAM,iEAAiE,CAAC,GAAG;AACvF,aAAS,OAAO,IAAI,CAAC,MAAK;AACxB,UAAI,OAAO,MAAM;AAAU,cAAM,IAAI,MAAM,yBAAyB,CAAC,KAAK,OAAO,CAAC,GAAG;AACrF,aAAON,IAAG,OAAO,CAAC;IACpB,CAAC;AACD,QAAI,QAAQ;AAEZ,aAAS,IAAI,GAAG,IAAI,gBAAgB;AAAK,eAAS,cAAc,QAAQ,MAAM,OAAO;AAErF,aAAS,IAAI,GAAG,IAAI,eAAe;AAAK,eAAS,cAAc,QAAQ,OAAO,OAAO;AAErF,aAAS,IAAI,GAAG,IAAI,gBAAgB;AAAK,eAAS,cAAc,QAAQ,MAAM,OAAO;AAErF,QAAI,UAAU;AACZ,YAAM,IAAI,MAAM,gDAAgD,KAAK,WAAW,MAAM,EAAE;AAC1F,WAAO;EACT,GAlBqB;AAoBrB,EAAAM,cAAa,iBAAiB;AAC9B,SAAOA;AACT;AApCgB,OAAAF,WAAA;;;AEjFhB;;aAAAG;EAAA;;qBAAAC;EAAA,yBAAAC;;;;ACIA,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AAiCd,SAAUC,MAAyB,GAAwB,MAAY;AAC3E,QAAM,kBAAkB,wBAAC,WAAoB,SAAc;AACzD,UAAM,MAAM,KAAK,OAAM;AACvB,WAAO,YAAY,MAAM;EAC3B,GAHwB;AAIxB,QAAM,OAAO,wBAAC,MAAa;AACzB,UAAM,UAAU,KAAK,KAAK,OAAO,CAAC,IAAI;AACtC,UAAM,aAAa,MAAM,IAAI;AAC7B,WAAO,EAAE,SAAS,WAAU;EAC9B,GAJa;AAKb,SAAO;IACL;;IAEA,aAAa,KAAQ,GAAS;AAC5B,UAAI,IAAI,EAAE;AACV,UAAI,IAAO;AACX,aAAO,IAAIF,MAAK;AACd,YAAI,IAAIC;AAAK,cAAI,EAAE,IAAI,CAAC;AACxB,YAAI,EAAE,OAAM;AACZ,cAAMA;MACR;AACA,aAAO;IACT;;;;;;;;;;;IAYA,iBAAiB,KAAQ,GAAS;AAChC,YAAM,EAAE,SAAS,WAAU,IAAK,KAAK,CAAC;AACtC,YAAM,SAAc,CAAA;AACpB,UAAI,IAAO;AACX,UAAIE,QAAO;AACX,eAASC,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,QAAAD,QAAO;AACP,eAAO,KAAKA,KAAI;AAEhB,iBAAS,IAAI,GAAG,IAAI,YAAY,KAAK;AACnC,UAAAA,QAAOA,MAAK,IAAI,CAAC;AACjB,iBAAO,KAAKA,KAAI;QAClB;AACA,YAAIA,MAAK,OAAM;MACjB;AACA,aAAO;IACT;;;;;;;;IASA,KAAK,GAAW,aAAkB,GAAS;AAGzC,YAAM,EAAE,SAAS,WAAU,IAAK,KAAK,CAAC;AAEtC,UAAI,IAAI,EAAE;AACV,UAAI,IAAI,EAAE;AAEV,YAAM,OAAO,OAAO,KAAK,IAAI,CAAC;AAC9B,YAAM,YAAY,KAAK;AACvB,YAAM,UAAU,OAAO,CAAC;AAExB,eAASC,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,cAAM,SAASA,UAAS;AAExB,YAAI,QAAQ,OAAO,IAAI,IAAI;AAG3B,cAAM;AAIN,YAAI,QAAQ,YAAY;AACtB,mBAAS;AACT,eAAKH;QACP;AAUA,cAAM,UAAU;AAChB,cAAM,UAAU,SAAS,KAAK,IAAI,KAAK,IAAI;AAC3C,cAAM,QAAQG,UAAS,MAAM;AAC7B,cAAM,QAAQ,QAAQ;AACtB,YAAI,UAAU,GAAG;AAEf,cAAI,EAAE,IAAI,gBAAgB,OAAO,YAAY,OAAO,CAAC,CAAC;QACxD,OAAO;AACL,cAAI,EAAE,IAAI,gBAAgB,OAAO,YAAY,OAAO,CAAC,CAAC;QACxD;MACF;AAMA,aAAO,EAAE,GAAG,EAAC;IACf;IAEA,WAAW,GAAM,gBAA6B,GAAW,WAAoB;AAE3E,YAAM,IAAY,EAAE,gBAAgB;AAEpC,UAAI,OAAO,eAAe,IAAI,CAAC;AAC/B,UAAI,CAAC,MAAM;AACT,eAAO,KAAK,iBAAiB,GAAG,CAAC;AACjC,YAAI,MAAM,GAAG;AACX,yBAAe,IAAI,GAAG,UAAU,IAAI,CAAC;QACvC;MACF;AACA,aAAO,KAAK,KAAK,GAAG,MAAM,CAAC;IAC7B;;AAEJ;AA/HgB,OAAAF,OAAA;AA+IV,SAAUG,eAAqBC,QAAyB;AAC5D,EAAAC,eAAcD,OAAM,EAAE;AACtB,iBACEA,QACA;IACE,GAAG;IACH,GAAG;IACH,IAAI;IACJ,IAAI;KAEN;IACE,YAAY;IACZ,aAAa;GACd;AAGH,SAAO,OAAO,OAAO;IACnB,GAAGE,SAAQF,OAAM,GAAGA,OAAM,UAAU;IACpC,GAAGA;IACH,GAAG,EAAE,GAAGA,OAAM,GAAG,MAAK;GACd;AACZ;AArBgB,OAAAD,gBAAA;;;AD3FhB,SAASI,mBAAqBC,QAAyB;AACrD,QAAM,OAAOC,eAAcD,MAAK;AAChC,EAAG,eACD,MACA;IACE,GAAG;IACH,GAAG;KAEL;IACE,0BAA0B;IAC1B,gBAAgB;IAChB,eAAe;IACf,eAAe;IACf,oBAAoB;IACpB,WAAW;IACX,SAAS;GACV;AAEH,QAAM,EAAE,MAAM,IAAAE,KAAI,EAAC,IAAK;AACxB,MAAI,MAAM;AACR,QAAI,CAACA,IAAG,IAAI,GAAGA,IAAG,IAAI,GAAG;AACvB,YAAM,IAAI,MAAM,mEAAmE;IACrF;AACA,QACE,OAAO,SAAS,YAChB,OAAO,KAAK,SAAS,YACrB,OAAO,KAAK,gBAAgB,YAC5B;AACA,YAAM,IAAI,MAAM,mEAAmE;IACrF;EACF;AACA,SAAO,OAAO,OAAO,EAAE,GAAG,KAAI,CAAW;AAC3C;AAhCS,OAAAH,oBAAA;AA2CT,IAAM,EAAE,iBAAiBI,MAAK,YAAYC,KAAG,IAAK;AAC3C,IAAMC,OAAM;;EAEjB,KAAK,MAAMC,gBAAe,MAAK;IAxIjC,OAwIiC;;;IAC7B,YAAY,IAAI,IAAE;AAChB,YAAM,CAAC;IACT;;EAEF,UAAU,MAAgB;AACxB,UAAM,EAAE,KAAK,EAAC,IAAKD;AACnB,QAAI,KAAK,SAAS,KAAK,KAAK,CAAC,MAAM;AAAM,YAAM,IAAI,EAAE,+BAA+B;AACpF,UAAM,MAAM,KAAK,CAAC;AAClB,UAAM,MAAM,KAAK,SAAS,GAAG,MAAM,CAAC;AACpC,QAAI,CAAC,OAAO,IAAI,WAAW;AAAK,YAAM,IAAI,EAAE,yCAAyC;AAKrF,QAAI,IAAI,CAAC,IAAI;AAAY,YAAM,IAAI,EAAE,qCAAqC;AAC1E,QAAI,IAAI,CAAC,MAAM,KAAQ,EAAE,IAAI,CAAC,IAAI;AAChC,YAAM,IAAI,EAAE,qDAAqD;AACnE,WAAO,EAAE,GAAGF,KAAI,GAAG,GAAG,GAAG,KAAK,SAAS,MAAM,CAAC,EAAC;EACjD;EACA,MAAM,KAAwB;AAE5B,UAAM,EAAE,KAAK,EAAC,IAAKE;AACnB,UAAM,OAAO,OAAO,QAAQ,WAAWD,KAAI,GAAG,IAAI;AAClD,IAAG,OAAO,IAAI;AACd,QAAI,IAAI,KAAK;AACb,QAAI,IAAI,KAAK,KAAK,CAAC,KAAK;AAAM,YAAM,IAAI,EAAE,uBAAuB;AACjE,QAAI,KAAK,CAAC,MAAM,IAAI;AAAG,YAAM,IAAI,EAAE,qCAAqC;AACxE,UAAM,EAAE,GAAG,GAAG,GAAG,OAAM,IAAKC,KAAI,UAAU,KAAK,SAAS,CAAC,CAAC;AAC1D,UAAM,EAAE,GAAG,GAAG,GAAG,WAAU,IAAKA,KAAI,UAAU,MAAM;AACpD,QAAI,WAAW;AAAQ,YAAM,IAAI,EAAE,6CAA6C;AAChF,WAAO,EAAE,GAAG,EAAC;EACf;EACA,WAAW,KAA6B;AAEtC,UAAM,QAAQ,wBAACE,OAAuB,OAAO,SAASA,GAAE,CAAC,GAAG,EAAE,IAAI,IAAS,OAAOA,KAAIA,IAAxE;AACd,UAAM,IAAI,wBAAC,QAAwB;AACjC,YAAM,MAAM,IAAI,SAAS,EAAE;AAC3B,aAAO,IAAI,SAAS,IAAI,IAAI,GAAG,KAAK;IACtC,GAHU;AAIV,UAAM,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC;AACxB,UAAM,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC;AACxB,UAAM,MAAM,EAAE,SAAS;AACvB,UAAM,MAAM,EAAE,SAAS;AACvB,UAAM,KAAK,EAAE,GAAG;AAChB,UAAM,KAAK,EAAE,GAAG;AAChB,WAAO,KAAK,EAAE,MAAM,MAAM,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC;EACpD;;AAKF,IAAMC,QAAM,OAAO,CAAC;AAApB,IAAuBC,QAAM,OAAO,CAAC;AAArC,IAAwCC,OAAM,OAAO,CAAC;AAAtD,IAAyDC,OAAM,OAAO,CAAC;AAAvE,IAA0EC,OAAM,OAAO,CAAC;AAElF,SAAUC,mBAAqB,MAAwB;AAC3D,QAAMC,SAAQf,mBAAkB,IAAI;AACpC,QAAM,EAAE,IAAAG,IAAE,IAAKY;AAEf,QAAMC,WACJD,OAAM,YACL,CAAC,IAAwB,OAAyB,kBAA0B;AAC3E,UAAM,IAAI,MAAM,SAAQ;AACxB,WAAU,YAAY,WAAW,KAAK,CAAC,CAAI,CAAC,GAAGZ,IAAG,QAAQ,EAAE,CAAC,GAAGA,IAAG,QAAQ,EAAE,CAAC,CAAC;EACjF;AACF,QAAM,YACJY,OAAM,cACL,CAACE,WAAqB;AAErB,UAAM,OAAOA,OAAM,SAAS,CAAC;AAE7B,UAAM,IAAId,IAAG,UAAU,KAAK,SAAS,GAAGA,IAAG,KAAK,CAAC;AACjD,UAAM,IAAIA,IAAG,UAAU,KAAK,SAASA,IAAG,OAAO,IAAIA,IAAG,KAAK,CAAC;AAC5D,WAAO,EAAE,GAAG,EAAC;EACf;AAMF,WAAS,oBAAoB,GAAI;AAC/B,UAAM,EAAE,GAAG,EAAC,IAAKY;AACjB,UAAM,KAAKZ,IAAG,IAAI,CAAC;AACnB,UAAM,KAAKA,IAAG,IAAI,IAAI,CAAC;AACvB,WAAOA,IAAG,IAAIA,IAAG,IAAI,IAAIA,IAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC;EAC3C;AALS;AAUT,MAAI,CAACA,IAAG,IAAIA,IAAG,IAAIY,OAAM,EAAE,GAAG,oBAAoBA,OAAM,EAAE,CAAC;AACzD,UAAM,IAAI,MAAM,6CAA6C;AAG/D,WAAS,mBAAmB,KAAW;AACrC,WAAO,OAAO,QAAQ,YAAYN,QAAM,OAAO,MAAMM,OAAM;EAC7D;AAFS;AAGT,WAAS,SAAS,KAAW;AAC3B,QAAI,CAAC,mBAAmB,GAAG;AAAG,YAAM,IAAI,MAAM,6CAA6C;EAC7F;AAFS;AAKT,WAAS,uBAAuB,KAAY;AAC1C,UAAM,EAAE,0BAA0B,SAAS,aAAa,gBAAgB,EAAC,IAAKA;AAC9E,QAAI,WAAW,OAAO,QAAQ,UAAU;AACtC,UAAOG,SAAQ,GAAG;AAAG,cAAS,WAAW,GAAG;AAE5C,UAAI,OAAO,QAAQ,YAAY,CAAC,QAAQ,SAAS,IAAI,MAAM;AAAG,cAAM,IAAI,MAAM,aAAa;AAC3F,YAAM,IAAI,SAAS,cAAc,GAAG,GAAG;IACzC;AACA,QAAI;AACJ,QAAI;AACF,YACE,OAAO,QAAQ,WACX,MACG,gBAAgB,YAAY,eAAe,KAAK,WAAW,CAAC;IACvE,SAASC,QAAO;AACd,YAAM,IAAI,MAAM,uBAAuB,WAAW,8BAA8B,OAAO,GAAG,EAAE;IAC9F;AACA,QAAI;AAAgB,YAAUC,KAAI,KAAK,CAAC;AACxC,aAAS,GAAG;AACZ,WAAO;EACT;AApBS;AAsBT,QAAM,mBAAmB,oBAAI,IAAG;AAChC,WAAS,eAAe,OAAc;AACpC,QAAI,EAAE,iBAAiBC;AAAQ,YAAM,IAAI,MAAM,0BAA0B;EAC3E;AAFS;EAQT,MAAMA,OAAK;IA5Qb,OA4Qa;;;IAIT,YACW,IACA,IACA,IAAK;AAFL,WAAA,KAAA;AACA,WAAA,KAAA;AACA,WAAA,KAAA;AAET,UAAI,MAAM,QAAQ,CAAClB,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;AAC/D,UAAI,MAAM,QAAQ,CAACA,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;AAC/D,UAAI,MAAM,QAAQ,CAACA,IAAG,QAAQ,EAAE;AAAG,cAAM,IAAI,MAAM,YAAY;IACjE;;;IAIA,OAAO,WAAW,GAAiB;AACjC,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,CAAA;AACtB,UAAI,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,sBAAsB;AAClF,UAAI,aAAakB;AAAO,cAAM,IAAI,MAAM,8BAA8B;AACtE,YAAM,MAAM,wBAAC,MAASlB,IAAG,IAAI,GAAGA,IAAG,IAAI,GAA3B;AAEZ,UAAI,IAAI,CAAC,KAAK,IAAI,CAAC;AAAG,eAAOkB,OAAM;AACnC,aAAO,IAAIA,OAAM,GAAG,GAAGlB,IAAG,GAAG;IAC/B;IAEA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;IACA,IAAI,IAAC;AACH,aAAO,KAAK,SAAQ,EAAG;IACzB;;;;;;;IAQA,OAAO,WAAW,QAAe;AAC/B,YAAM,QAAQA,IAAG,YAAY,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACpD,aAAO,OAAO,IAAI,CAAC,GAAG,MAAM,EAAE,SAAS,MAAM,CAAC,CAAC,CAAC,EAAE,IAAIkB,OAAM,UAAU;IACxE;;;;;IAMA,OAAO,QAAQ,KAAQ;AACrB,YAAM,IAAIA,OAAM,WAAW,UAAU,YAAY,YAAY,GAAG,CAAC,CAAC;AAClE,QAAE,eAAc;AAChB,aAAO;IACT;;IAGA,OAAO,eAAe,YAAmB;AACvC,aAAOA,OAAM,KAAK,SAAS,uBAAuB,UAAU,CAAC;IAC/D;;IAQA,eAAe,YAAkB;AAC/B,WAAK,eAAe;AACpB,uBAAiB,OAAO,IAAI;IAC9B;;IAGA,iBAAc;AACZ,UAAI,KAAK,IAAG,GAAI;AAId,YAAIN,OAAM,sBAAsB,CAACZ,IAAG,IAAI,KAAK,EAAE;AAAG;AAClD,cAAM,IAAI,MAAM,iBAAiB;MACnC;AAEA,YAAM,EAAE,GAAG,EAAC,IAAK,KAAK,SAAQ;AAE9B,UAAI,CAACA,IAAG,QAAQ,CAAC,KAAK,CAACA,IAAG,QAAQ,CAAC;AAAG,cAAM,IAAI,MAAM,0BAA0B;AAChF,YAAM,OAAOA,IAAG,IAAI,CAAC;AACrB,YAAM,QAAQ,oBAAoB,CAAC;AACnC,UAAI,CAACA,IAAG,IAAI,MAAM,KAAK;AAAG,cAAM,IAAI,MAAM,mCAAmC;AAC7E,UAAI,CAAC,KAAK,cAAa;AAAI,cAAM,IAAI,MAAM,wCAAwC;IACrF;IACA,WAAQ;AACN,YAAM,EAAE,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAIA,IAAG;AAAO,eAAO,CAACA,IAAG,MAAM,CAAC;AAChC,YAAM,IAAI,MAAM,6BAA6B;IAC/C;;;;IAKA,OAAO,OAAY;AACjB,qBAAe,KAAK;AACpB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,IAAI,EAAE,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC;AAChD,YAAM,KAAKA,IAAG,IAAIA,IAAG,IAAI,IAAI,EAAE,GAAGA,IAAG,IAAI,IAAI,EAAE,CAAC;AAChD,aAAO,MAAM;IACf;;;;IAKA,SAAM;AACJ,aAAO,IAAIkB,OAAM,KAAK,IAAIlB,IAAG,IAAI,KAAK,EAAE,GAAG,KAAK,EAAE;IACpD;;;;;IAMA,SAAM;AACJ,YAAM,EAAE,GAAG,EAAC,IAAKY;AACjB,YAAM,KAAKZ,IAAG,IAAI,GAAGS,IAAG;AACxB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,UAAI,KAAKT,IAAG,MAAM,KAAKA,IAAG,MAAM,KAAKA,IAAG;AACxC,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIkB,OAAM,IAAI,IAAI,EAAE;IAC7B;;;;;IAMA,IAAI,OAAY;AACd,qBAAe,KAAK;AACpB,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AACnC,UAAI,KAAKlB,IAAG,MAAM,KAAKA,IAAG,MAAM,KAAKA,IAAG;AACxC,YAAM,IAAIY,OAAM;AAChB,YAAM,KAAKZ,IAAG,IAAIY,OAAM,GAAGH,IAAG;AAC9B,UAAI,KAAKT,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,UAAI,KAAKA,IAAG,IAAI,IAAI,EAAE;AACtB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,GAAG,EAAE;AACjB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,WAAKA,IAAG,IAAI,IAAI,EAAE;AAClB,aAAO,IAAIkB,OAAM,IAAI,IAAI,EAAE;IAC7B;IAEA,SAAS,OAAY;AACnB,aAAO,KAAK,IAAI,MAAM,OAAM,CAAE;IAChC;IAEQ,MAAG;AACT,aAAO,KAAK,OAAOA,OAAM,IAAI;IAC/B;IACQ,KAAK,GAAS;AACpB,aAAO,KAAK,WAAW,MAAM,kBAAkB,GAAG,CAAC,SAAiB;AAClE,cAAM,QAAQlB,IAAG,YAAY,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAClD,eAAO,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,SAAS,MAAM,CAAC,CAAC,CAAC,EAAE,IAAIkB,OAAM,UAAU;MACtE,CAAC;IACH;;;;;;IAOA,eAAe,GAAS;AACtB,YAAM,IAAIA,OAAM;AAChB,UAAI,MAAMZ;AAAK,eAAO;AACtB,eAAS,CAAC;AACV,UAAI,MAAMC;AAAK,eAAO;AACtB,YAAM,EAAE,KAAI,IAAKK;AACjB,UAAI,CAAC;AAAM,eAAO,KAAK,aAAa,MAAM,CAAC;AAG3C,UAAI,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,KAAK,YAAY,CAAC;AACjD,UAAI,MAAM;AACV,UAAI,MAAM;AACV,UAAI,IAAW;AACf,aAAO,KAAKN,SAAO,KAAKA,OAAK;AAC3B,YAAI,KAAKC;AAAK,gBAAM,IAAI,IAAI,CAAC;AAC7B,YAAI,KAAKA;AAAK,gBAAM,IAAI,IAAI,CAAC;AAC7B,YAAI,EAAE,OAAM;AACZ,eAAOA;AACP,eAAOA;MACT;AACA,UAAI;AAAO,cAAM,IAAI,OAAM;AAC3B,UAAI;AAAO,cAAM,IAAI,OAAM;AAC3B,YAAM,IAAIW,OAAMlB,IAAG,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,EAAE;AACzD,aAAO,IAAI,IAAI,GAAG;IACpB;;;;;;;;;;IAWA,SAAS,QAAc;AACrB,eAAS,MAAM;AACf,UAAI,IAAI;AACR,UAAI,OAAc;AAClB,YAAM,EAAE,KAAI,IAAKY;AACjB,UAAI,MAAM;AACR,cAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,KAAK,YAAY,CAAC;AACnD,YAAI,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,KAAK,KAAK,EAAE;AACrC,YAAI,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,KAAK,KAAK,EAAE;AACrC,cAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,cAAM,IAAIM,OAAMlB,IAAG,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,EAAE;AACzD,gBAAQ,IAAI,IAAI,GAAG;AACnB,eAAO,IAAI,IAAI,GAAG;MACpB,OAAO;AACL,cAAM,EAAE,GAAG,EAAC,IAAK,KAAK,KAAK,CAAC;AAC5B,gBAAQ;AACR,eAAO;MACT;AAEA,aAAOkB,OAAM,WAAW,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;IAC1C;;;;;;;IAQA,qBAAqB,GAAU,GAAW,GAAS;AACjD,YAAM,IAAIA,OAAM;AAChB,YAAM,MAAM,wBACV,GACAC,OACIA,OAAMb,SAAOa,OAAMZ,SAAO,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,eAAeY,EAAC,IAAI,EAAE,SAASA,EAAC,GAHrE;AAIZ,YAAM,MAAM,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,GAAG,CAAC,CAAC;AACtC,aAAO,IAAI,IAAG,IAAK,SAAY;IACjC;;;;IAKA,SAAS,IAAM;AACb,YAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAC,IAAK;AAChC,YAAM,MAAM,KAAK,IAAG;AAGpB,UAAI,MAAM;AAAM,aAAK,MAAMnB,IAAG,MAAMA,IAAG,IAAI,CAAC;AAC5C,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,YAAM,KAAKA,IAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AAAK,eAAO,EAAE,GAAGA,IAAG,MAAM,GAAGA,IAAG,KAAI;AACxC,UAAI,CAACA,IAAG,IAAI,IAAIA,IAAG,GAAG;AAAG,cAAM,IAAI,MAAM,kBAAkB;AAC3D,aAAO,EAAE,GAAG,IAAI,GAAG,GAAE;IACvB;IACA,gBAAa;AACX,YAAM,EAAE,GAAG,UAAU,cAAa,IAAKY;AACvC,UAAI,aAAaL;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcW,QAAO,IAAI;AACnD,YAAM,IAAI,MAAM,8DAA8D;IAChF;IACA,gBAAa;AACX,YAAM,EAAE,GAAG,UAAU,cAAa,IAAKN;AACvC,UAAI,aAAaL;AAAK,eAAO;AAC7B,UAAI;AAAe,eAAO,cAAcW,QAAO,IAAI;AACnD,aAAO,KAAK,eAAeN,OAAM,CAAC;IACpC;IAEA,WAAW,eAAe,MAAI;AAC5B,WAAK,eAAc;AACnB,aAAOC,SAAQK,QAAO,MAAM,YAAY;IAC1C;IAEA,MAAM,eAAe,MAAI;AACvB,aAAU,WAAW,KAAK,WAAW,YAAY,CAAC;IACpD;;AAlVgB,EAAAA,OAAA,OAAO,IAAIA,OAAMN,OAAM,IAAIA,OAAM,IAAIZ,IAAG,GAAG;AAC3C,EAAAkB,OAAA,OAAO,IAAIA,OAAMlB,IAAG,MAAMA,IAAG,KAAKA,IAAG,IAAI;AAmV3D,QAAM,QAAQY,OAAM;AACpB,QAAM,OAAOQ,MAAKF,QAAON,OAAM,OAAO,KAAK,KAAK,QAAQ,CAAC,IAAI,KAAK;AAElE,SAAO;IACL,OAAAA;IACA,iBAAiBM;IACjB;IACA;IACA;;AAEJ;AA7agB,OAAAP,oBAAA;AAqdhB,SAASU,cAAavB,QAAgB;AACpC,QAAM,OAAOC,eAAcD,MAAK;AAChC,EAAG,eACD,MACA;IACE,MAAM;IACN,MAAM;IACN,aAAa;KAEf;IACE,UAAU;IACV,eAAe;IACf,MAAM;GACP;AAEH,SAAO,OAAO,OAAO,EAAE,MAAM,MAAM,GAAG,KAAI,CAAW;AACvD;AAhBS,OAAAuB,eAAA;AAkCH,SAAUC,aAAY,UAAmB;AAC7C,QAAMV,SAAQS,cAAa,QAAQ;AACnC,QAAM,EAAE,IAAArB,KAAI,GAAGuB,aAAW,IAAKX;AAC/B,QAAM,gBAAgBZ,IAAG,QAAQ;AACjC,QAAM,kBAAkB,IAAIA,IAAG,QAAQ;AAEvC,WAAS,oBAAoB,KAAW;AACtC,WAAOM,QAAM,OAAO,MAAMN,IAAG;EAC/B;AAFS;AAGT,WAAS,KAAK,GAAS;AACrB,WAAWiB,KAAI,GAAGM,YAAW;EAC/B;AAFS;AAGT,WAAS,KAAK,GAAS;AACrB,WAAWC,QAAO,GAAGD,YAAW;EAClC;AAFS;AAIT,QAAM,EACJ,iBAAiBL,QACjB,wBACA,qBACA,mBAAkB,IAChBP,mBAAkB;IACpB,GAAGC;IACH,QAAQ,IAAI,OAAO,cAAqB;AACtC,YAAM,IAAI,MAAM,SAAQ;AACxB,YAAM,IAAIZ,IAAG,QAAQ,EAAE,CAAC;AACxB,YAAM,MAAS;AACf,UAAI,cAAc;AAChB,eAAO,IAAI,WAAW,KAAK,CAAC,MAAM,SAAQ,IAAK,IAAO,CAAI,CAAC,GAAG,CAAC;MACjE,OAAO;AACL,eAAO,IAAI,WAAW,KAAK,CAAC,CAAI,CAAC,GAAG,GAAGA,IAAG,QAAQ,EAAE,CAAC,CAAC;MACxD;IACF;IACA,UAAUc,QAAiB;AACzB,YAAM,MAAMA,OAAM;AAClB,YAAM,OAAOA,OAAM,CAAC;AACpB,YAAM,OAAOA,OAAM,SAAS,CAAC;AAE7B,UAAI,QAAQ,kBAAkB,SAAS,KAAQ,SAAS,IAAO;AAC7D,cAAM,IAAO,gBAAgB,IAAI;AACjC,YAAI,CAAC,oBAAoB,CAAC;AAAG,gBAAM,IAAI,MAAM,uBAAuB;AACpE,cAAM,KAAK,oBAAoB,CAAC;AAChC,YAAI;AACJ,YAAI;AACF,cAAId,IAAG,KAAK,EAAE;QAChB,SAAS,WAAW;AAClB,gBAAM,SAAS,qBAAqB,QAAQ,OAAO,UAAU,UAAU;AACvE,gBAAM,IAAI,MAAM,0BAA0B,MAAM;QAClD;AACA,cAAM,UAAU,IAAIO,WAASA;AAE7B,cAAM,aAAa,OAAO,OAAO;AACjC,YAAI,cAAc;AAAQ,cAAIP,IAAG,IAAI,CAAC;AACtC,eAAO,EAAE,GAAG,EAAC;MACf,WAAW,QAAQ,mBAAmB,SAAS,GAAM;AACnD,cAAM,IAAIA,IAAG,UAAU,KAAK,SAAS,GAAGA,IAAG,KAAK,CAAC;AACjD,cAAM,IAAIA,IAAG,UAAU,KAAK,SAASA,IAAG,OAAO,IAAIA,IAAG,KAAK,CAAC;AAC5D,eAAO,EAAE,GAAG,EAAC;MACf,OAAO;AACL,cAAM,IAAI,MACR,mBAAmB,GAAG,0BAA0B,aAAa,wBAAwB,eAAe,qBAAqB;MAE7H;IACF;GACD;AACD,QAAM,gBAAgB,wBAAC,QAClB,WAAc,gBAAgB,KAAKY,OAAM,WAAW,CAAC,GADpC;AAGtB,WAAS,sBAAsBa,SAAc;AAC3C,UAAM,OAAOF,gBAAehB;AAC5B,WAAOkB,UAAS;EAClB;AAHS;AAKT,WAAS,WAAW,GAAS;AAC3B,WAAO,sBAAsB,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;EAC/C;AAFS;AAIT,QAAM,SAAS,wBAAC,GAAe,MAAc,OAAkB,gBAAgB,EAAE,MAAM,MAAM,EAAE,CAAC,GAAjF;EAKf,MAAMC,WAAS;IAvwBjB,OAuwBiB;;;IACb,YACW,GACA,GACA,UAAiB;AAFjB,WAAA,IAAA;AACA,WAAA,IAAA;AACA,WAAA,WAAA;AAET,WAAK,eAAc;IACrB;;IAGA,OAAO,YAAY,KAAQ;AACzB,YAAM,IAAId,OAAM;AAChB,YAAM,YAAY,oBAAoB,KAAK,IAAI,CAAC;AAChD,aAAO,IAAIc,WAAU,OAAO,KAAK,GAAG,CAAC,GAAG,OAAO,KAAK,GAAG,IAAI,CAAC,CAAC;IAC/D;;;IAIA,OAAO,QAAQ,KAAQ;AACrB,YAAM,EAAE,GAAG,EAAC,IAAKvB,KAAI,MAAM,YAAY,OAAO,GAAG,CAAC;AAClD,aAAO,IAAIuB,WAAU,GAAG,CAAC;IAC3B;IAEA,iBAAc;AAEZ,UAAI,CAAC,mBAAmB,KAAK,CAAC;AAAG,cAAM,IAAI,MAAM,2BAA2B;AAC5E,UAAI,CAAC,mBAAmB,KAAK,CAAC;AAAG,cAAM,IAAI,MAAM,2BAA2B;IAC9E;IAEA,eAAe,UAAgB;AAC7B,aAAO,IAAIA,WAAU,KAAK,GAAG,KAAK,GAAG,QAAQ;IAC/C;IAEA,iBAAiB,SAAY;AAC3B,YAAM,EAAE,GAAG,GAAG,UAAU,IAAG,IAAK;AAChC,YAAM,IAAI,cAAc,YAAY,WAAW,OAAO,CAAC;AACvD,UAAI,OAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,GAAG;AAAG,cAAM,IAAI,MAAM,qBAAqB;AACrF,YAAM,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAId,OAAM,IAAI;AACpD,UAAI,QAAQZ,IAAG;AAAO,cAAM,IAAI,MAAM,4BAA4B;AAClE,YAAM,UAAU,MAAM,OAAO,IAAI,OAAO;AACxC,YAAM,IAAIkB,OAAM,QAAQ,SAAS,cAAc,IAAI,CAAC;AACpD,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,KAAK,KAAK,CAAC,IAAI,EAAE;AACvB,YAAM,KAAK,KAAK,IAAI,EAAE;AACtB,YAAM,IAAIA,OAAM,KAAK,qBAAqB,GAAG,IAAI,EAAE;AACnD,UAAI,CAAC;AAAG,cAAM,IAAI,MAAM,mBAAmB;AAC3C,QAAE,eAAc;AAChB,aAAO;IACT;;IAGA,WAAQ;AACN,aAAO,sBAAsB,KAAK,CAAC;IACrC;IAEA,aAAU;AACR,aAAO,KAAK,SAAQ,IAAK,IAAIQ,WAAU,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;IACjF;;IAGA,gBAAa;AACX,aAAU,WAAW,KAAK,SAAQ,CAAE;IACtC;IACA,WAAQ;AACN,aAAOvB,KAAI,WAAW,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,EAAC,CAAE;IAChD;;IAGA,oBAAiB;AACf,aAAU,WAAW,KAAK,aAAY,CAAE;IAC1C;IACA,eAAY;AACV,aAAO,cAAc,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC;IACrD;;AAIF,QAAMwB,SAAQ;IACZ,kBAAkB,YAAmB;AACnC,UAAI;AACF,+BAAuB,UAAU;AACjC,eAAO;MACT,SAASX,QAAO;AACd,eAAO;MACT;IACF;IACA;;;;;IAMA,kBAAkB,6BAAiB;AACjC,YAAM,SAAaY,kBAAiBhB,OAAM,CAAC;AAC3C,aAAWiB,gBAAejB,OAAM,YAAY,MAAM,GAAGA,OAAM,CAAC;IAC9D,GAHkB;;;;;;;;;IAalB,WAAW,aAAa,GAAG,QAAQM,OAAM,MAAI;AAC3C,YAAM,eAAe,UAAU;AAC/B,YAAM,SAAS,OAAO,CAAC,CAAC;AACxB,aAAO;IACT;;AASF,WAASY,cAAa,YAAqB,eAAe,MAAI;AAC5D,WAAOZ,OAAM,eAAe,UAAU,EAAE,WAAW,YAAY;EACjE;AAFS,SAAAY,eAAA;AAOT,WAAS,UAAU,MAAsB;AACvC,UAAM,MAASf,SAAQ,IAAI;AAC3B,UAAM,MAAM,OAAO,SAAS;AAC5B,UAAM,OAAO,OAAO,QAAS,KAAa;AAC1C,QAAI;AAAK,aAAO,QAAQ,iBAAiB,QAAQ;AACjD,QAAI;AAAK,aAAO,QAAQ,IAAI,iBAAiB,QAAQ,IAAI;AACzD,QAAI,gBAAgBG;AAAO,aAAO;AAClC,WAAO;EACT;AARS;AAoBT,WAASa,iBAAgB,UAAmB,SAAc,eAAe,MAAI;AAC3E,QAAI,UAAU,QAAQ;AAAG,YAAM,IAAI,MAAM,+BAA+B;AACxE,QAAI,CAAC,UAAU,OAAO;AAAG,YAAM,IAAI,MAAM,+BAA+B;AACxE,UAAM,IAAIb,OAAM,QAAQ,OAAO;AAC/B,WAAO,EAAE,SAAS,uBAAuB,QAAQ,CAAC,EAAE,WAAW,YAAY;EAC7E;AALS,SAAAa,kBAAA;AAWT,QAAMC,YACJpB,OAAM,YACN,SAAUE,QAAiB;AAGzB,UAAM,MAAS,gBAAgBA,MAAK;AACpC,UAAM,QAAQA,OAAM,SAAS,IAAIF,OAAM;AACvC,WAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;EAC5C;AACF,QAAM,gBACJA,OAAM,iBACN,SAAUE,QAAiB;AACzB,WAAO,KAAKkB,UAASlB,MAAK,CAAC;EAC7B;AAEF,QAAM,aAAgB,QAAQF,OAAM,UAAU;AAI9C,WAAS,WAAW,KAAW;AAC7B,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,QAAI,EAAEN,SAAO,OAAO,MAAM;AACxB,YAAM,IAAI,MAAM,uBAAuBM,OAAM,UAAU,EAAE;AAE3D,WAAU,gBAAgB,KAAKA,OAAM,WAAW;EAClD;AANS;AAaT,WAAS,QAAQ,SAAc,YAAqB,OAAO,gBAAc;AACvE,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAAC,MAAM,KAAK,IAAI;AAClD,YAAM,IAAI,MAAM,qCAAqC;AACvD,UAAM,EAAE,MAAAqB,OAAM,aAAAC,aAAW,IAAKtB;AAC9B,QAAI,EAAE,MAAM,SAAS,cAAc,IAAG,IAAK;AAC3C,QAAI,QAAQ;AAAM,aAAO;AACzB,cAAU,YAAY,WAAW,OAAO;AACxC,QAAI;AAAS,gBAAU,YAAY,qBAAqBqB,MAAK,OAAO,CAAC;AAKrE,UAAM,QAAQ,cAAc,OAAO;AACnC,UAAM,IAAI,uBAAuB,UAAU;AAC3C,UAAM,WAAW,CAAC,WAAW,CAAC,GAAG,WAAW,KAAK,CAAC;AAElD,QAAI,OAAO,QAAQ,QAAQ,OAAO;AAEhC,YAAM,IAAI,QAAQ,OAAOC,aAAYlC,IAAG,KAAK,IAAI;AACjD,eAAS,KAAK,YAAY,gBAAgB,CAAC,CAAC;IAC9C;AACA,UAAM,OAAU,YAAY,GAAG,QAAQ;AACvC,UAAM,IAAI;AAEV,aAAS,MAAM,QAAkB;AAE/B,YAAM,IAAIgC,UAAS,MAAM;AACzB,UAAI,CAAC,mBAAmB,CAAC;AAAG;AAC5B,YAAM,KAAK,KAAK,CAAC;AACjB,YAAM,IAAId,OAAM,KAAK,SAAS,CAAC,EAAE,SAAQ;AACzC,YAAM,IAAI,KAAK,EAAE,CAAC;AAClB,UAAI,MAAMZ;AAAK;AAIf,YAAM,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AACnC,UAAI,MAAMA;AAAK;AACf,UAAI,YAAY,EAAE,MAAM,IAAI,IAAI,KAAK,OAAO,EAAE,IAAIC,KAAG;AACrD,UAAI,QAAQ;AACZ,UAAI,QAAQ,sBAAsB,CAAC,GAAG;AACpC,gBAAQ,WAAW,CAAC;AACpB,oBAAY;MACd;AACA,aAAO,IAAImB,WAAU,GAAG,OAAO,QAAQ;IACzC;AApBS;AAqBT,WAAO,EAAE,MAAM,MAAK;EACtB;AA9CS;AA+CT,QAAM,iBAA2B,EAAE,MAAMd,OAAM,MAAM,SAAS,MAAK;AACnE,QAAM,iBAA0B,EAAE,MAAMA,OAAM,MAAM,SAAS,MAAK;AAelE,WAASuB,MAAK,SAAc,SAAkB,OAAO,gBAAc;AACjE,UAAM,EAAE,MAAM,MAAK,IAAK,QAAQ,SAAS,SAAS,IAAI;AACtD,UAAM,IAAIvB;AACV,UAAM,OAAU,eAAmC,EAAE,KAAK,WAAW,EAAE,aAAa,EAAE,IAAI;AAC1F,WAAO,KAAK,MAAM,KAAK;EACzB;AALS,SAAAuB,OAAA;AAQT,EAAAjB,OAAM,KAAK,eAAe,CAAC;AAgB3B,WAASkB,QACP,WACA,SACA,WACA,OAAO,gBAAc;AAErB,UAAM,KAAK;AACX,cAAU,YAAY,WAAW,OAAO;AACxC,gBAAY,YAAY,aAAa,SAAS;AAC9C,QAAI,YAAY;AAAM,YAAM,IAAI,MAAM,oCAAoC;AAC1E,UAAM,EAAE,MAAM,QAAO,IAAK;AAE1B,QAAI,OAA8B;AAClC,QAAI;AACJ,QAAI;AACF,UAAI,OAAO,OAAO,YAAerB,SAAQ,EAAE,GAAG;AAG5C,YAAI;AACF,iBAAOW,WAAU,QAAQ,EAAE;QAC7B,SAAS,UAAU;AACjB,cAAI,EAAE,oBAAoBvB,KAAI;AAAM,kBAAM;AAC1C,iBAAOuB,WAAU,YAAY,EAAE;QACjC;MACF,WAAW,OAAO,OAAO,YAAY,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,UAAU;AACzF,cAAM,EAAE,GAAAW,IAAG,GAAAhC,GAAC,IAAK;AACjB,eAAO,IAAIqB,WAAUW,IAAGhC,EAAC;MAC3B,OAAO;AACL,cAAM,IAAI,MAAM,OAAO;MACzB;AACA,UAAIa,OAAM,QAAQ,SAAS;IAC7B,SAASF,QAAO;AACd,UAAKA,OAAgB,YAAY;AAC/B,cAAM,IAAI,MAAM,gEAAgE;AAClF,aAAO;IACT;AACA,QAAI,QAAQ,KAAK,SAAQ;AAAI,aAAO;AACpC,QAAI;AAAS,gBAAUJ,OAAM,KAAK,OAAO;AACzC,UAAM,EAAE,GAAG,EAAC,IAAK;AACjB,UAAM,IAAI,cAAc,OAAO;AAC/B,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,IAAI,EAAE;AACtB,UAAM,KAAK,KAAK,IAAI,EAAE;AACtB,UAAM,IAAIM,OAAM,KAAK,qBAAqB,GAAG,IAAI,EAAE,GAAG,SAAQ;AAC9D,QAAI,CAAC;AAAG,aAAO;AACf,UAAM,IAAI,KAAK,EAAE,CAAC;AAClB,WAAO,MAAM;EACf;AA/CS,SAAAkB,SAAA;AAgDT,SAAO;IACL,OAAAxB;IACA,cAAAkB;IACA,iBAAAC;IACA,MAAAI;IACA,QAAAC;IACA,iBAAiBlB;IACjB,WAAAQ;IACA,OAAAC;;AAEJ;AA/ZgB,OAAAL,cAAA;AA0aV,SAAU,eAAkBtB,KAAmB,GAAI;AAEvD,QAAM,IAAIA,IAAG;AACb,MAAI,IAAIM;AACR,WAAS,IAAI,IAAIC,OAAK,IAAIC,SAAQF,OAAK,KAAKE;AAAK,SAAKD;AACtD,QAAM,KAAK;AAGX,QAAM,eAAeC,QAAQ,KAAKD,QAAMA;AACxC,QAAM,aAAa,eAAeC;AAClC,QAAM,MAAM,IAAID,SAAO;AACvB,QAAM,MAAM,KAAKA,SAAOC;AACxB,QAAM,KAAK,aAAaD;AACxB,QAAM,KAAK;AACX,QAAM,KAAKP,IAAG,IAAI,GAAG,EAAE;AACvB,QAAM,KAAKA,IAAG,IAAI,IAAI,KAAKO,SAAOC,IAAG;AACrC,MAAI,YAAY,wBAAC,GAAM,MAAwC;AAC7D,QAAI,MAAM;AACV,QAAI,MAAMR,IAAG,IAAI,GAAG,EAAE;AACtB,QAAI,MAAMA,IAAG,IAAI,GAAG;AACpB,UAAMA,IAAG,IAAI,KAAK,CAAC;AACnB,QAAI,MAAMA,IAAG,IAAI,GAAG,GAAG;AACvB,UAAMA,IAAG,IAAI,KAAK,EAAE;AACpB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,IAAI,KAAK,CAAC;AACnB,UAAMA,IAAG,IAAI,KAAK,CAAC;AACnB,QAAI,MAAMA,IAAG,IAAI,KAAK,GAAG;AACzB,UAAMA,IAAG,IAAI,KAAK,EAAE;AACpB,QAAI,OAAOA,IAAG,IAAI,KAAKA,IAAG,GAAG;AAC7B,UAAMA,IAAG,IAAI,KAAK,EAAE;AACpB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,KAAK,KAAK,KAAK,IAAI;AAC5B,UAAMA,IAAG,KAAK,KAAK,KAAK,IAAI;AAE5B,aAAS,IAAI,IAAI,IAAIO,OAAK,KAAK;AAC7B,UAAI+B,OAAM,IAAI9B;AACd,MAAA8B,OAAM9B,QAAQ8B,OAAM/B;AACpB,UAAI,OAAOP,IAAG,IAAI,KAAKsC,IAAG;AAC1B,YAAM,KAAKtC,IAAG,IAAI,MAAMA,IAAG,GAAG;AAC9B,YAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,YAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,aAAOA,IAAG,IAAI,KAAK,GAAG;AACtB,YAAMA,IAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,YAAMA,IAAG,KAAK,MAAM,KAAK,EAAE;IAC7B;AACA,WAAO,EAAE,SAAS,MAAM,OAAO,IAAG;EACpC,GA9BgB;AA+BhB,MAAIA,IAAG,QAAQU,SAAQD,MAAK;AAE1B,UAAM8B,OAAMvC,IAAG,QAAQS,QAAOC;AAC9B,UAAM8B,MAAKxC,IAAG,KAAKA,IAAG,IAAI,CAAC,CAAC;AAC5B,gBAAY,wBAAC,GAAM,MAAQ;AACzB,UAAI,MAAMA,IAAG,IAAI,CAAC;AAClB,YAAM,MAAMA,IAAG,IAAI,GAAG,CAAC;AACvB,YAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAI,KAAKA,IAAG,IAAI,KAAKuC,GAAE;AACvB,WAAKvC,IAAG,IAAI,IAAI,GAAG;AACnB,YAAM,KAAKA,IAAG,IAAI,IAAIwC,GAAE;AACxB,YAAM,MAAMxC,IAAG,IAAIA,IAAG,IAAI,EAAE,GAAG,CAAC;AAChC,YAAM,OAAOA,IAAG,IAAI,KAAK,CAAC;AAC1B,UAAI,IAAIA,IAAG,KAAK,IAAI,IAAI,IAAI;AAC5B,aAAO,EAAE,SAAS,MAAM,OAAO,EAAC;IAClC,GAXY;EAYd;AAGA,SAAO;AACT;AAnEgB;AAwEV,SAAU,oBACdA,KACA,MAIC;AAED,EAAIyC,eAAczC,GAAE;AACpB,MAAI,CAACA,IAAG,QAAQ,KAAK,CAAC,KAAK,CAACA,IAAG,QAAQ,KAAK,CAAC,KAAK,CAACA,IAAG,QAAQ,KAAK,CAAC;AAClE,UAAM,IAAI,MAAM,mCAAmC;AACrD,QAAM,YAAY,eAAeA,KAAI,KAAK,CAAC;AAC3C,MAAI,CAACA,IAAG;AAAO,UAAM,IAAI,MAAM,8BAA8B;AAG7D,SAAO,CAAC,MAAwB;AAE9B,QAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACrC,UAAMA,IAAG,IAAI,CAAC;AACd,UAAMA,IAAG,IAAI,KAAK,KAAK,CAAC;AACxB,UAAMA,IAAG,IAAI,GAAG;AAChB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,IAAI,KAAKA,IAAG,GAAG;AACxB,UAAMA,IAAG,IAAI,KAAK,KAAK,CAAC;AACxB,UAAMA,IAAG,KAAK,KAAK,GAAGA,IAAG,IAAI,GAAG,GAAG,CAACA,IAAG,IAAI,KAAKA,IAAG,IAAI,CAAC;AACxD,UAAMA,IAAG,IAAI,KAAK,KAAK,CAAC;AACxB,UAAMA,IAAG,IAAI,GAAG;AAChB,UAAMA,IAAG,IAAI,GAAG;AAChB,UAAMA,IAAG,IAAI,KAAK,KAAK,CAAC;AACxB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,UAAMA,IAAG,IAAI,KAAK,KAAK,CAAC;AACxB,UAAMA,IAAG,IAAI,KAAK,GAAG;AACrB,QAAIA,IAAG,IAAI,KAAK,GAAG;AACnB,UAAM,EAAE,SAAS,MAAK,IAAK,UAAU,KAAK,GAAG;AAC7C,QAAIA,IAAG,IAAI,KAAK,CAAC;AACjB,QAAIA,IAAG,IAAI,GAAG,KAAK;AACnB,QAAIA,IAAG,KAAK,GAAG,KAAK,OAAO;AAC3B,QAAIA,IAAG,KAAK,GAAG,OAAO,OAAO;AAC7B,UAAM,KAAKA,IAAG,MAAO,CAAC,MAAMA,IAAG,MAAO,CAAC;AACvC,QAAIA,IAAG,KAAKA,IAAG,IAAI,CAAC,GAAG,GAAG,EAAE;AAC5B,QAAIA,IAAG,IAAI,GAAG,GAAG;AACjB,WAAO,EAAE,GAAG,EAAC;EACf;AACF;AA7CgB;;;AEpqCT,SAAS0C,UAAUC,OAAwB;AAChD,SAAOC,cAAcC,KAAKF,KAAK;AACjC;AAFgBD;AAIhB,IAAME,gBAAgB;AAMf,SAASE,SAASH,OAAwB;AAC/C,SAAOI,aAAaF,KAAKF,KAAK;AAChC;AAFgBG;AAIhB,IAAMC,eAAe;AAUd,SAASC,aACdL,OACAM,SAGS;AACT,QAAMC,MAAMC,WAAWR,KAAK;AAC5B,QAAMS,MAAMC,OAAOH,GAAG;AAEtB,QAAMI,IAAIC,yBAAyBZ,KAAK;AACxC,QAAMa,IAAID,yBAAyBH,GAAG;AAEtC,MAAIE,MAAME,GAAG;AACX,WAAO;EACT;AAEA,MAAIP,SAAQQ,WAAW,MAAM;AAK3B,UAAMC,iBAAiB;AACvB,QACE,CAAChB,UAAUC,KAAK,KAChBa,EAAEG,UAAUD,kBACZJ,EAAEM,WAAWJ,EAAEK,UAAU,GAAGH,cAAc,CAAC,GAC3C;AACA,aAAO;IACT;EACF;AAEA,SAAO;AACT;AAhCgBV;AAkChB,IAAYc,qBAAkB,yBAAlBA,qBAAkB;AAAlBA,EAAAA,oBAAkB,WAAA,IAAA;AAAlBA,EAAAA,oBAAkB,UAAA,IAAA;AAAlBA,EAAAA,oBAAkB,kBAAA,IAAA;AAAlBA,EAAAA,oBAAkB,gBAAA,IAAA;AAAA,SAAlBA;AAAkB,EAAA,CAAA,CAAA;AAYvB,SAASC,sBAAsBpB,OAA+C;AACnF,MAAIK,aAAaL,OAAO;IAAEc,QAAQ;EAAM,CAAC,GAAG;AAC1C,WAAOO;EACT;AAEA,MAAItB,UAAUC,KAAK,GAAG;AACpB,WAAOmB,mBAAmBG;EAC5B;AAEA,QAAMf,MAAMC,WAAWR,KAAK;AAC5B,MAAI,CAACuB,SAAShB,GAAG,GAAG;AAClB,WAAOY,mBAAmBK;EAC5B;AAEA,MAAIjB,QAAQ,GAAG;AACb,WAAOY,mBAAmBM;EAC5B;AAEA,SAAON,mBAAmBO;AAC5B;AAnBgBN;AA0DT,SAASO,yBAAyBC,OAAuB;AAC9D,SACEA,MAEGC,QAAQC,wBAAwB,EAAE,EAGlCD,QAAQE,WAAW,EAAE,EAGrBF,QAAQG,sBAAsB,EAAE,EAGhCH,QAAQI,+BAA+B,EAAE;AAEhD;AAfgBN;AAiBhB,IAAMG,yBAAyB;AAC/B,IAAMG,gCAAgC;AACtC,IAAMF,YAAY;AAClB,IAAMC,uBAAuB;;;AC5ItB,IAAME,iBAAN,MAAqB;EAX5B,OAW4B;;;;;EAK1BC,mBAAmB;EAEnBC,YAAYC,OAAe;AACzB,QAAI,CAACC,SAASD,KAAK,GAAG;AACpB,YAAM,IAAIE,MAAM,6BAA6BF,QAAQ,IAAI;IAC3D;AAEA,SAAKA,QAAQA;EACf;;;;;;;;;;;;EAaAG,UAA2B;AACzB,UAAMC,eAAeC,sBAAsB,KAAKL,KAAK;AAGrD,QAAII,iBAAiBE,UAAaF,iBAAiBG,mBAAmBC,gBAAgB;AACpF,aAAOC,WAAW,KAAKT,KAAK;IAC9B;AAGA,QAAIU,UAAU,KAAKV,KAAK,GAAG;AACzB,aAAOW,OAAO,KAAKX,KAAK;IAC1B;AAGA,UAAM,IAAIE,MACR,+CACgB,KAAKF,KAAM,WAAUI,YAAa,eAAcK,WAAW,KAAKT,KAAK,CAAE,EACzF;EACF;;;;EAKAY,WAAmB;AACjB,WAAO,KAAKZ;EACd;;;;AAKF;AAKO,SAASF,iBAAiBE,OAAyC;AAGxE,SAAQA,SAAS,OAAOA,UAAU,YAAYA,MAAMF,qBAAqB,QAAS;AACpF;AAJgBA;;;ACrET,SAASe,oBAAoBC,OAA+B;AACjE,SAAO,IAAIC,eAAeD,KAAK;AACjC;AAFgBD;AAIT,SAASG,qBAAqBF,OAAgC;AACnE,SAAOG,UAAUH,KAAK,IAAII,OAAOJ,KAAK,IAAIK,WAAWL,KAAK;AAC5D;AAFgBE;;;ACMT,SAASI,OAAOC,MAAeC,SAA2B;AAC/D,SAAOC,YAAY;IAAE,IAAIF;EAAK,GAAG,IAAIA,MAAMC,OAAO;AACpD;AAFgBF;AAOhB,SAASG,YACPC,SACAC,KACAC,OACAJ,SACS;AACT,MAAIK,MAAMC,QAAQF,KAAK,GAAG;AACxB,WAAOJ,QAAQO,KAAKL,SAASC,KAAKK,YAAYJ,OAAOJ,OAAO,CAAC;EAC/D,WAAWI,SAAS,OAAOA,UAAU,YAAY,CAACK,iBAAiBL,KAAK,GAAG;AAGzE,WAAOJ,QAAQO,KAAKL,SAASC,KAAKO,aAAaN,OAAiCJ,OAAO,CAAC;EAC1F,OAAO;AACL,WAAOA,QAAQO,KAAKL,SAASC,KAAKC,KAAK;EACzC;AACF;AAfSH;AAoBT,SAASS,aAAaC,QAAgCX,SAAkB;AACtEY,SAAOC,KAAKF,MAAM,EAAEG,QAASX,SAAQ;AACnC,UAAMC,QAAQH,YAAYU,QAAQR,KAAKQ,OAAOR,GAAG,GAAGH,OAAO;AAC3D,QAAII,UAAUW,QAAW;AACvBJ,aAAOR,GAAG,IAAIC;IAChB,OAAO;AACL,aAAOO,OAAOR,GAAG;IACnB;EACF,CAAC;AAED,SAAOQ;AACT;AAXSD;AAgBT,SAASF,YAAYQ,OAAuBhB,SAAkC;AAC5E,WAASiB,IAAI,GAAGA,IAAID,MAAME,QAAQD,KAAK;AACrCD,UAAMC,CAAC,IAAIhB,YAAYe,OAAOC,IAAI,IAAID,MAAMC,CAAC,GAAGjB,OAAO;EACzD;AAEA,SAAOgB;AACT;AANSR;;;AC7BF,SAASW,MACdC,MACAC,SAES;AAAA,MADTC,cAAyBC,UAAAC,SAAA,KAAAD,UAAA,CAAA,MAAAE,SAAAF,UAAA,CAAA,IAAGG;AAE5B,MAAIC,IAAI;AACR,QAAMC,QAAQC,WAAW;AACzBC,cAAYF,KAAK;AACjBG,mBAAiB;AAEjB,SAAOV,UAAUW,OAAOJ,OAAOP,OAAO,IAAIO;AAE1C,WAASK,cAAkD;AACzD,QAAIb,KAAKc,WAAWP,CAAC,MAAMQ,kBAAkB;AAC3CR;AACAS,qBAAe;AAEf,YAAMC,SAAiC,CAAC;AACxC,UAAIC,UAAU;AACd,aAAOX,IAAIP,KAAKI,UAAUJ,KAAKc,WAAWP,CAAC,MAAMY,kBAAkB;AACjE,YAAI,CAACD,SAAS;AACZE,mBAAS;AACTJ,yBAAe;QACjB,OAAO;AACLE,oBAAU;QACZ;AAEA,cAAMG,QAAQd;AAEd,cAAMe,MAAMC,YAAY;AACxB,YAAID,QAAQjB,QAAW;AACrBmB,iCAAuB;AACvB;QACF;AAEAR,uBAAe;AACfS,iBAAS;AACT,cAAMjB,SAAQC,WAAW;AAEzB,YAAID,WAAUH,QAAW;AACvBqB,mCAAyB;AACzB;QACF;AAGA,YAAIC,OAAOC,UAAUC,eAAeC,KAAKb,QAAQK,GAAG,KAAK,CAACS,YAAYvB,QAAOS,OAAOK,GAAG,CAAC,GAAG;AAGzFU,4BAAkBV,KAAKD,QAAQ,CAAC;QAClC;AAEAJ,eAAOK,GAAG,IAAId;MAChB;AAEA,UAAIR,KAAKc,WAAWP,CAAC,MAAMY,kBAAkB;AAC3Cc,oCAA4B;MAC9B;AACA1B;AAEA,aAAOU;IACT;EACF;AAjDSJ;AAmDT,WAASqB,aAAuC;AAC9C,QAAIlC,KAAKc,WAAWP,CAAC,MAAM4B,oBAAoB;AAC7C5B;AACAS,qBAAe;AAEf,YAAMoB,QAAQ,CAAA;AACd,UAAIlB,UAAU;AACd,aAAOX,IAAIP,KAAKI,UAAUJ,KAAKc,WAAWP,CAAC,MAAM8B,oBAAoB;AACnE,YAAI,CAACnB,SAAS;AACZE,mBAAS;QACX,OAAO;AACLF,oBAAU;QACZ;AAEA,cAAMV,SAAQC,WAAW;AACzB6B,wBAAgB9B,MAAK;AACrB4B,cAAMG,KAAK/B,MAAK;MAClB;AAEA,UAAIR,KAAKc,WAAWP,CAAC,MAAM8B,oBAAoB;AAC7CG,oCAA4B;MAC9B;AACAjC;AAEA,aAAO6B;IACT;EACF;AA1BSF;AA4BT,WAASzB,aAAsB;AAC7BO,mBAAe;AAEf,UAAMR,SACJe,YAAY,KACZkB,aAAa,KACb5B,YAAY,KACZqB,WAAW,KACXQ,aAAa,QAAQ,IAAI,KACzBA,aAAa,SAAS,KAAK,KAC3BA,aAAa,QAAQ,IAAI;AAE3B1B,mBAAe;AAEf,WAAOR;EACT;AAfSC;AAiBT,WAASiC,aAAaC,MAAcnC,QAAqC;AACvE,QAAIR,KAAK4C,MAAMrC,GAAGA,IAAIoC,KAAKvC,MAAM,MAAMuC,MAAM;AAC3CpC,WAAKoC,KAAKvC;AACV,aAAOI;IACT;EACF;AALSkC;AAOT,WAAS1B,iBAAiB;AACxB,WAAO6B,aAAa7C,KAAKc,WAAWP,CAAC,CAAC,GAAG;AACvCA;IACF;EACF;AAJSS;AAMT,WAASO,cAAc;AACrB,QAAIvB,KAAKc,WAAWP,CAAC,MAAMuC,iBAAiB;AAC1CvC;AACA,UAAIwC,SAAS;AACb,aAAOxC,IAAIP,KAAKI,UAAUJ,KAAKc,WAAWP,CAAC,MAAMuC,iBAAiB;AAChE,YAAI9C,KAAKc,WAAWP,CAAC,MAAMyC,eAAe;AACxC,gBAAMC,OAAOjD,KAAKO,IAAI,CAAC;AACvB,gBAAM2C,aAAaC,iBAAiBF,IAAI;AACxC,cAAIC,eAAe7C,QAAW;AAC5B0C,sBAAUG;AACV3C;UACF,WAAW0C,SAAS,KAAK;AACvB,gBACEG,MAAMpD,KAAKc,WAAWP,IAAI,CAAC,CAAC,KAC5B6C,MAAMpD,KAAKc,WAAWP,IAAI,CAAC,CAAC,KAC5B6C,MAAMpD,KAAKc,WAAWP,IAAI,CAAC,CAAC,KAC5B6C,MAAMpD,KAAKc,WAAWP,IAAI,CAAC,CAAC,GAC5B;AACAwC,wBAAUM,OAAOC,aAAaC,SAASvD,KAAK4C,MAAMrC,IAAI,GAAGA,IAAI,CAAC,GAAG,EAAE,CAAC;AACpEA,mBAAK;YACP,OAAO;AACLiD,2CAA6BjD,CAAC;YAChC;UACF,OAAO;AACLkD,wCAA4BlD,CAAC;UAC/B;QACF,OAAO;AACL,cAAImD,uBAAuB1D,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAC9CwC,sBAAU/C,KAAKO,CAAC;UAClB,OAAO;AACLoD,kCAAsB3D,KAAKO,CAAC,CAAC;UAC/B;QACF;AACAA;MACF;AACAqD,wBAAkB;AAClBrD;AACA,aAAOwC;IACT;EACF;AAvCSxB;AAyCT,WAASkB,eAAe;AACtB,UAAMpB,QAAQd;AACd,QAAIP,KAAKc,WAAWP,CAAC,MAAMsD,WAAW;AACpCtD;AACAuD,kBAAYzC,KAAK;IACnB;AAEA,QAAIrB,KAAKc,WAAWP,CAAC,MAAMwD,UAAU;AACnCxD;IACF,WAAWyD,eAAehE,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAC7CA;AACA,aAAO0D,QAAQjE,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAClCA;MACF;IACF;AAEA,QAAIP,KAAKc,WAAWP,CAAC,MAAM2D,SAAS;AAClC3D;AACAuD,kBAAYzC,KAAK;AACjB,aAAO4C,QAAQjE,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAClCA;MACF;IACF;AAEA,QAAIP,KAAKc,WAAWP,CAAC,MAAM4D,kBAAkBnE,KAAKc,WAAWP,CAAC,MAAM6D,gBAAgB;AAClF7D;AACA,UAAIP,KAAKc,WAAWP,CAAC,MAAMsD,aAAa7D,KAAKc,WAAWP,CAAC,MAAM8D,UAAU;AACvE9D;MACF;AACAuD,kBAAYzC,KAAK;AACjB,aAAO4C,QAAQjE,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAClCA;MACF;IACF;AAEA,QAAIA,IAAIc,OAAO;AACb,aAAOnB,YAAYF,KAAK4C,MAAMvB,OAAOd,CAAC,CAAC;IACzC;EACF;AAtCSkC;AAwCT,WAASrB,WAAW;AAClB,QAAIpB,KAAKc,WAAWP,CAAC,MAAM+D,WAAW;AACpC,YAAM,IAAIC,YAAa,kCAAiCC,MAAM,CAAE,EAAC;IACnE;AACAjE;EACF;AALSa;AAOT,WAASK,WAAW;AAClB,QAAIzB,KAAKc,WAAWP,CAAC,MAAMkE,WAAW;AACpC,YAAM,IAAIF,YAAa,0CAAyCC,MAAM,CAAE,EAAC;IAC3E;AACAjE;EACF;AALSkB;AAOT,WAASf,YAAYF,QAAgB;AACnC,QAAIA,WAAUH,QAAW;AACvB,YAAM,IAAIkE,YAAa,uBAAsBC,MAAM,CAAE,EAAC;IACxD;EACF;AAJS9D;AAMT,WAAS4B,gBAAgB9B,QAAgB;AACvC,QAAIA,WAAUH,QAAW;AACvB,YAAM,IAAIkE,YAAa,uBAAsBC,MAAM,CAAE,EAAC;IACxD;EACF;AAJSlC;AAMT,WAAS3B,mBAAmB;AAC1B,QAAIJ,IAAIP,KAAKI,QAAQ;AACnB,YAAM,IAAImE,YAAa,yBAAwBC,MAAM,CAAE,EAAC;IAC1D;EACF;AAJS7D;AAMT,WAASmD,YAAYzC,OAAe;AAClC,QAAI,CAAC4C,QAAQjE,KAAKc,WAAWP,CAAC,CAAC,GAAG;AAChC,YAAMmE,WAAW1E,KAAK4C,MAAMvB,OAAOd,CAAC;AACpC,YAAM,IAAIgE,YAAa,mBAAkBG,QAAS,wBAAuBF,MAAM,CAAE,EAAC;IACpF;EACF;AALSV;AAOT,WAASF,oBAAoB;AAC3B,QAAI5D,KAAKc,WAAWP,CAAC,MAAMuC,iBAAiB;AAC1C,YAAM,IAAIyB,YAAa,8BAA6BC,MAAM,CAAE,EAAC;IAC/D;EACF;AAJSZ;AAMT,WAASpC,yBAAyB;AAChC,UAAM,IAAI+C,YAAa,8BAA6BC,MAAM,CAAE,EAAC;EAC/D;AAFShD;AAIT,WAASQ,kBAAkBV,KAAaqD,MAAa;AACnD,UAAM,IAAIJ,YAAa,kBAAiBjD,GAAI,6BAA4BqD,IAAI,EAAC;EAC/E;AAFS3C;AAIT,WAASC,8BAA8B;AACrC,UAAM,IAAIsC,YAAa,mDAAkDC,MAAM,CAAE,EAAC;EACpF;AAFSvC;AAIT,WAASO,8BAA8B;AACrC,UAAM,IAAI+B,YAAa,2CAA0CC,MAAM,CAAE,EAAC;EAC5E;AAFShC;AAIT,WAASmB,sBAAsBV,MAAc;AAC3C,UAAM,IAAIsB,YAAa,sBAAqBtB,IAAK,KAAI0B,IAAI,CAAE,EAAC;EAC9D;AAFShB;AAIT,WAASF,4BAA4BpC,OAAe;AAClD,UAAMuD,QAAQ5E,KAAK4C,MAAMvB,OAAOA,QAAQ,CAAC;AACzC,UAAM,IAAIkD,YAAa,6BAA4BK,KAAM,KAAID,IAAI,CAAE,EAAC;EACtE;AAHSlB;AAKT,WAAS/B,2BAA2B;AAClC,UAAM,IAAI6C,YAAa,mCAAkCI,IAAI,CAAE,EAAC;EAClE;AAFSjD;AAIT,WAAS8B,6BAA6BnC,OAAe;AACnD,UAAMuD,QAAQ5E,KAAK4C,MAAMvB,OAAOA,QAAQ,CAAC;AACzC,UAAM,IAAIkD,YAAa,8BAA6BK,KAAM,KAAID,IAAI,CAAE,EAAC;EACvE;AAHSnB;AAMT,WAASmB,MAAc;AACrB,WAAQ,eAAcpE,CAAE;EAC1B;AAFSoE;AAIT,WAASE,MAAc;AACrB,WAAOtE,IAAIP,KAAKI,SAAU,YAAWJ,KAAKO,CAAC,CAAE,MAAK;EACpD;AAFSsE;AAIT,WAASL,QAAgB;AACvB,WAAOK,IAAI,IAAI,MAAMF,IAAI;EAC3B;AAFSH;AAGX;AArSgBzE;AAuShB,SAAS8C,aAAaiC,MAAuB;AAC3C,SAAOA,SAASC,aAAaD,SAASE,eAAeF,SAASG,WAAWH,SAASI;AACpF;AAFSrC;AAIT,SAASO,MAAM0B,MAAuB;AACpC,SACGA,QAAQf,YAAYe,QAAQK,YAC5BL,QAAQM,kBAAkBN,QAAQO,kBAClCP,QAAQQ,kBAAkBR,QAAQS;AAEvC;AANSnC;AAQT,SAASa,QAAQa,MAAuB;AACtC,SAAOA,QAAQf,YAAYe,QAAQK;AACrC;AAFSlB;AAIT,SAASD,eAAec,MAAuB;AAC7C,SAAOA,QAAQU,WAAWV,QAAQK;AACpC;AAFSnB;AAIF,SAASN,uBAAuBoB,MAAuB;AAC5D,SAAOA,QAAQ,MAAQA,QAAQ;AACjC;AAFgBpB;AAIT,SAAS3B,YAAY0D,GAAYC,GAAqB;AAC3D,MAAID,MAAMC,GAAG;AACX,WAAO;EACT;AAEA,MAAIC,MAAMC,QAAQH,CAAC,KAAKE,MAAMC,QAAQF,CAAC,GAAG;AACxC,WAAOD,EAAErF,WAAWsF,EAAEtF,UAAUqF,EAAEI,MAAM,CAACC,MAAMC,UAAUhE,YAAY+D,MAAMJ,EAAEK,KAAK,CAAC,CAAC;EACtF;AAEA,MAAIC,SAASP,CAAC,KAAKO,SAASN,CAAC,GAAG;AAC9B,UAAMO,OAAO,CAAC,GAAG,oBAAIC,IAAI,CAAC,GAAGvE,OAAOsE,KAAKR,CAAC,GAAG,GAAG9D,OAAOsE,KAAKP,CAAC,CAAC,CAAC,CAAC;AAChE,WAAOO,KAAKJ,MAAOvE,SAAQS,YAAY0D,EAAEnE,GAAG,GAAGoE,EAAEpE,GAAG,CAAC,CAAC;EACxD;AAEA,SAAO;AACT;AAfgBS;AAiBhB,SAASiE,SAASxF,OAAkD;AAClE,SAAO,OAAOA,UAAU,YAAYA,UAAU;AAChD;AAFSwF;AAKT,IAAM7C,mBAA0C;EAC9C,KAAK;EACL,MAAM;EACN,KAAK;EACLuC,GAAG;EACHS,GAAG;EACHC,GAAG;EACHC,GAAG;EACHC,GAAG;;AAEL;AAEA,IAAMtD,gBAAgB;AACtB,IAAMjC,mBAAmB;AACzB,IAAMI,mBAAmB;AACzB,IAAMgB,qBAAqB;AAC3B,IAAME,qBAAqB;AAC3B,IAAM0C,YAAY;AAClB,IAAMC,cAAc;AACpB,IAAMC,UAAU;AAChB,IAAMC,aAAa;AACnB,IAAMpC,kBAAkB;AACxB,IAAMuB,WAAW;AACjB,IAAMR,YAAY;AAClB,IAAME,WAAW;AACjB,IAAMyB,UAAU;AAChB,IAAML,WAAW;AACjB,IAAMb,YAAY;AAClB,IAAMJ,UAAU;AAChB,IAAMO,YAAY;AACX,IAAMW,iBAAiB;AACvB,IAAME,iBAAiB;AACvB,IAAMlB,iBAAiB;AACvB,IAAMD,iBAAiB;AACvB,IAAMkB,iBAAiB;AACvB,IAAME,iBAAiB;;;AC9WvB,SAASgB,UACdC,OACAC,UACAC,OACAC,oBACoB;AACpB,QAAMC,gBAAgBC,aAAaH,KAAK;AAExC,QAAMI,gBACJ,OAAOL,aAAa,aAAaA,SAASM,KAAK;IAAE,IAAIP;EAAM,GAAG,IAAIA,KAAK,IAAIA;AAE7E,SAAOQ,eAAeF,eAAe,EAAE;AAKvC,WAASE,eAAeR,QAAgBS,QAAgD;AACtF,QAAIC,MAAMC,QAAQR,kBAAkB,GAAG;AACrC,YAAMS,cAAcT,mBAAmBU,KAAMC,UAASA,KAAKC,KAAKf,MAAK,CAAC;AACtE,UAAIY,aAAa;AACf,cAAMI,MAAeJ,YAAYb,UAAUC,MAAK;AAChD,YAAI,OAAOgB,QAAQ,YAAY,CAACC,SAASD,GAAG,GAAG;AAC7C,gBAAM,IAAIE,MACR,0GAEcF,GAAI,GACpB;QACF;AACA,eAAOA;MACT;IACF;AAGA,QACE,OAAOhB,WAAU,aACjB,OAAOA,WAAU,YACjB,OAAOA,WAAU,YACjBA,WAAU,QACVA,kBAAiBmB,QACjBnB,kBAAiBoB,WACjBpB,kBAAiBqB,UACjBrB,kBAAiBsB,QACjB;AACA,aAAOC,KAAKxB,UAAUC,MAAK;IAC7B;AAKA,QAAIA,UAASA,OAAMwB,kBAAkB;AACnC,aAAOxB,OAAMyB,SAAS;IACxB;AAGA,QAAI,OAAOzB,WAAU,UAAU;AAC7B,aAAOA,OAAMyB,SAAS;IACxB;AAGA,QAAIf,MAAMC,QAAQX,MAAK,GAAG;AACxB,aAAO0B,eAAe1B,QAAOS,MAAM;IACrC;AAGA,QAAIT,UAAS,OAAOA,WAAU,UAAU;AACtC,aAAO2B,gBAAgB3B,QAAiCS,MAAM;IAChE;AAEA,WAAOmB;EACT;AArDSpB;AA0DT,WAASkB,eAAeG,OAAuBpB,QAAoC;AACjF,QAAIoB,MAAMC,WAAW,GAAG;AACtB,aAAO;IACT;AAEA,UAAMC,cAAc3B,gBAAgBK,SAASL,gBAAgBwB;AAC7D,QAAIZ,MAAMZ,gBAAgB,QAAQ;AAElC,aAAS4B,IAAI,GAAGA,IAAIH,MAAMC,QAAQE,KAAK;AACrC,YAAMlB,OACJ,OAAOb,aAAa,aAAaA,SAASM,KAAKsB,OAAOP,OAAOU,CAAC,GAAGH,MAAMG,CAAC,CAAC,IAAIH,MAAMG,CAAC;AAEtF,UAAI5B,eAAe;AACjBY,eAAOe;MACT;AAEA,UAAI,OAAOjB,SAAS,eAAe,OAAOA,SAAS,YAAY;AAC7DE,eAAOR,eAAeM,MAAMiB,WAAW;MACzC,OAAO;AACLf,eAAO;MACT;AAEA,UAAIgB,IAAIH,MAAMC,SAAS,GAAG;AACxBd,eAAOZ,gBAAgB,QAAQ;MACjC;IACF;AAEAY,WAAOZ,gBAAgB,OAAOK,SAAS,MAAM;AAC7C,WAAOO;EACT;AA7BSU;AAkCT,WAASC,gBACPM,QACAxB,QACoB;AACpB,QAAI,OAAOwB,OAAOC,WAAW,YAAY;AACvC,aAAOnC,UAAUkC,OAAOC,OAAO,GAAGjC,UAAUC,OAAO0B,MAAS;IAC9D;AAEA,UAAMO,OAAiBzB,MAAMC,QAAQV,QAAQ,IAAIA,SAASmC,IAAId,MAAM,IAAIe,OAAOF,KAAKF,MAAM;AAE1F,QAAIE,KAAKL,WAAW,GAAG;AACrB,aAAO;IACT;AAEA,UAAMC,cAAc3B,gBAAgBK,SAASL,gBAAgBwB;AAC7D,QAAIU,QAAQ;AACZ,QAAItB,MAAMZ,gBAAgB,QAAQ;AAElC+B,SAAKI,QAASC,SAAQ;AACpB,YAAMxC,SACJ,OAAOC,aAAa,aAAaA,SAASM,KAAK0B,QAAQO,KAAKP,OAAOO,GAAG,CAAC,IAAIP,OAAOO,GAAG;AAEvF,UAAIC,gBAAgBD,KAAKxC,MAAK,GAAG;AAC/B,YAAIsC,OAAO;AACTA,kBAAQ;QACV,OAAO;AACLtB,iBAAOZ,gBAAgB,QAAQ;QACjC;AAEA,cAAMsC,SAASnB,KAAKxB,UAAUyC,GAAG;AACjCxB,eAAOZ,gBAAgB2B,cAAcW,SAAS,OAAOA,SAAS;AAE9D1B,eAAOR,eAAeR,QAAO+B,WAAW;MAC1C;IACF,CAAC;AAEDf,WAAOZ,gBAAgB,OAAOK,SAAS,MAAM;AAC7C,WAAOO;EACT;AAtCSW;AA2CT,WAASc,gBAAgBD,KAAaxC,QAAyB;AAC7D,WAAO,OAAOA,WAAU,eAAe,OAAOA,WAAU,cAAc,OAAOA,WAAU;EACzF;AAFSyC;AAGX;AA1JgB1C;AAgKhB,SAASM,aAAaH,OAAwD;AAC5E,MAAI,OAAOA,UAAU,UAAU;AAC7B,WAAO,IAAIyC,OAAOzC,KAAK;EACzB;AAEA,MAAI,OAAOA,UAAU,YAAYA,UAAU,IAAI;AAC7C,WAAOA;EACT;AAEA,SAAO0B;AACT;AAVSvB;;;ACjMT,SAASuC,cAAa,MAAgB,YAAoB,OAAeC,OAAa;AACpF,MAAI,OAAO,KAAK,iBAAiB;AAAY,WAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,QAAMC,QAAO,OAAO,EAAE;AACtB,QAAM,WAAW,OAAO,UAAU;AAClC,QAAM,KAAK,OAAQ,SAASA,QAAQ,QAAQ;AAC5C,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,IAAID,QAAO,IAAI;AACrB,QAAM,IAAIA,QAAO,IAAI;AACrB,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACvC,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACzC;AAVS,OAAAD,eAAA;AAaF,IAAMG,OAAM,wBAAC,GAAW,GAAW,MAAe,IAAI,IAAM,CAAC,IAAI,GAArD;AAEZ,IAAMC,OAAM,wBAAC,GAAW,GAAW,MAAe,IAAI,IAAM,IAAI,IAAM,IAAI,GAA9D;AAMb,IAAgB,SAAhB,cAAoD,KAAO;EAzBjE,OAyBiE;;;EAc/D,YACW,UACF,WACE,WACAH,OAAa;AAEtB,UAAK;AALI,SAAA,WAAA;AACF,SAAA,YAAA;AACE,SAAA,YAAA;AACA,SAAA,OAAAA;AATD,SAAA,WAAW;AACX,SAAA,SAAS;AACT,SAAA,MAAM;AACN,SAAA,YAAY;AASpB,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAW;AAChB,WAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,WAAO,QAAQ,IAAI;AACnB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACrB,cAAM,WAAW,WAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQ,UAAU,GAAG;AACzE;MACF;AACA,aAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAe;AACxB,WAAO,IAAI;AACX,WAAO,KAAK,IAAI;AAChB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAQ,MAAM,UAAU,MAAAA,MAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,WAAO,KAAK,IAAI;AAChB,SAAK,OAAO,SAAS,GAAG,EAAE,KAAK,CAAC;AAGhC,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,aAAO,CAAC,IAAI;AAIjD,IAAAD,cAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGC,KAAI;AAC9D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,6CAA6C;AAC1E,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAG;AACtB,QAAI,SAAS,MAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAGA,KAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,SAAK,WAAW,MAAM;AACtB,UAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,WAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,SAAS;AACZ,OAAG,MAAM;AACT,OAAG,WAAW;AACd,OAAG,YAAY;AACf,QAAI,SAAS;AAAU,SAAG,OAAO,IAAI,MAAM;AAC3C,WAAO;EACT;;;;ACpHF,IAAMI,YAA2B,oBAAI,YAAY;EAC/C;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAKD,IAAM,YAA4B,oBAAI,YAAY;EAChD;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAID,IAAMC,YAA2B,oBAAI,YAAY,EAAE;AACnD,IAAMC,UAAN,cAAqB,OAAc;EA9BnC,OA8BmC;;;EAYjC,cAAA;AACE,UAAM,IAAI,IAAI,GAAG,KAAK;AAVxB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;AACnB,SAAA,IAAI,UAAU,CAAC,IAAI;EAInB;EACU,MAAG;AACX,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AACnC,WAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EAChC;;EAEU,IACR,GAAW,GAAW,GAAW,GAAW,GAAW,GAAW,GAAW,GAAS;AAEtF,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;EACf;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU;AAAG,MAAAD,UAAS,CAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,MAAMA,UAAS,IAAI,EAAE;AAC3B,YAAM,KAAKA,UAAS,IAAI,CAAC;AACzB,YAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,YAAM,KAAK,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAK,OAAO;AACjD,MAAAA,UAAS,CAAC,IAAK,KAAKA,UAAS,IAAI,CAAC,IAAI,KAAKA,UAAS,IAAI,EAAE,IAAK;IACjE;AAEA,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,IAAK;AACjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,SAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;AACpD,YAAM,KAAM,IAAI,SAASE,KAAI,GAAG,GAAG,CAAC,IAAIH,UAAS,CAAC,IAAIC,UAAS,CAAC,IAAK;AACrE,YAAM,SAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;AACpD,YAAM,KAAM,SAASG,KAAI,GAAG,GAAG,CAAC,IAAK;AACrC,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,IAAI,KAAM;AACf,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,KAAK,KAAM;IAClB;AAEA,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;EACjC;EACU,aAAU;AAClB,IAAAH,UAAS,KAAK,CAAC;EACjB;EACA,UAAO;AACL,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,SAAK,OAAO,KAAK,CAAC;EACpB;;AAsBK,IAAMI,UAAyB,gCAAgB,MAAM,IAAIC,QAAM,CAAE;;;AC5HlE,IAAOC,QAAP,cAAuC,KAAa;EAH1D,OAG0D;;;EAQxD,YAAYC,OAAa,MAAW;AAClC,UAAK;AAJC,SAAA,WAAW;AACX,SAAA,YAAY;AAIlB,SAAWA,KAAI;AACf,UAAM,MAAM,QAAQ,IAAI;AACxB,SAAK,QAAQA,MAAK,OAAM;AACxB,QAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,YAAM,IAAI,MAAM,qDAAqD;AACvE,SAAK,WAAW,KAAK,MAAM;AAC3B,SAAK,YAAY,KAAK,MAAM;AAC5B,UAAM,WAAW,KAAK;AACtB,UAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,QAAI,IAAI,IAAI,SAAS,WAAWA,MAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAAK,UAAI,CAAC,KAAK;AAC/C,SAAK,MAAM,OAAO,GAAG;AAErB,SAAK,QAAQA,MAAK,OAAM;AAExB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ;AAAK,UAAI,CAAC,KAAK,KAAO;AACtD,SAAK,MAAM,OAAO,GAAG;AACrB,QAAI,KAAK,CAAC;EACZ;EACA,OAAO,KAAU;AACf,WAAa,IAAI;AACjB,SAAK,MAAM,OAAO,GAAG;AACrB,WAAO;EACT;EACA,WAAW,KAAe;AACxB,WAAa,IAAI;AACjB,UAAY,KAAK,KAAK,SAAS;AAC/B,SAAK,WAAW;AAChB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,WAAW,GAAG;AACzB,SAAK,QAAO;EACd;EACA,SAAM;AACJ,UAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,SAAK,WAAW,GAAG;AACnB,WAAO;EACT;EACA,WAAW,IAAY;AAErB,WAAA,KAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,UAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,SAAK;AACL,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,WAAW;AACd,OAAG,YAAY;AACf,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,OAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,WAAO;EACT;EACA,UAAO;AACL,SAAK,YAAY;AACjB,SAAK,MAAM,QAAO;AAClB,SAAK,MAAM,QAAO;EACpB;;AASK,IAAMC,QAAO,wBAACD,OAAa,KAAY,YAC5C,IAAID,MAAUC,OAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM,GAD7B;AAEpBC,MAAK,SAAS,CAACD,OAAa,QAAe,IAAID,MAAUC,OAAM,GAAG;;;ACzE5D,SAAUE,SAAQC,OAAW;AACjC,SAAO;IACL,MAAAA;IACA,MAAM,wBAAC,QAAoB,SAAuBC,MAAKD,OAAM,KAAKE,aAAY,GAAG,IAAI,CAAC,GAAhF;IACN;;AAEJ;AANgB,OAAAH,UAAA;AASV,SAAU,YAAY,UAAoB,SAAc;AAC5D,QAAM,SAAS,wBAACC,UAAgBG,aAAY,EAAE,GAAG,UAAU,GAAGJ,SAAQC,KAAI,EAAC,CAAE,GAA9D;AACf,SAAO,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,GAAG,OAAM,CAAE;AACrD;AAHgB;;;ACNhB,IAAM,aAAa,OAAO,oEAAoE;AAC9F,IAAM,aAAa,OAAO,oEAAoE;AAC9F,IAAMI,QAAM,OAAO,CAAC;AACpB,IAAMC,OAAM,OAAO,CAAC;AACpB,IAAM,aAAa,wBAAC,GAAW,OAAe,IAAI,IAAIA,QAAO,GAA1C;AAMnB,SAAS,QAAQ,GAAS;AACxB,QAAM,IAAI;AAEV,QAAMC,OAAM,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAE3E,QAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC5D,QAAM,KAAM,IAAI,IAAI,IAAK;AACzB,QAAM,KAAM,KAAK,KAAK,IAAK;AAC3B,QAAM,KAAMC,MAAK,IAAID,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,KAAMC,MAAK,IAAID,MAAK,CAAC,IAAI,KAAM;AACrC,QAAM,MAAOC,MAAK,IAAIF,MAAK,CAAC,IAAI,KAAM;AACtC,QAAM,MAAOE,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAOA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,MAAOA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,OAAQA,MAAK,KAAK,MAAM,CAAC,IAAI,MAAO;AAC1C,QAAM,OAAQA,MAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AAC3C,QAAM,OAAQA,MAAK,MAAMD,MAAK,CAAC,IAAI,KAAM;AACzC,QAAM,KAAMC,MAAK,MAAM,MAAM,CAAC,IAAI,MAAO;AACzC,QAAM,KAAMA,MAAK,IAAI,KAAK,CAAC,IAAI,KAAM;AACrC,QAAM,OAAOA,MAAK,IAAIF,MAAK,CAAC;AAC5B,MAAI,CAAC,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,CAAC;AAAG,UAAM,IAAI,MAAM,yBAAyB;AACvE,SAAO;AACT;AAtBS;AAwBT,IAAM,KAAKG,OAAM,YAAY,QAAW,QAAW,EAAE,MAAM,QAAO,CAAE;AAE7D,IAAM,YAAY,YACvB;EACE,GAAG,OAAO,CAAC;;EACX,GAAG,OAAO,CAAC;;EACX;;EACA,GAAG;;;EAEH,IAAI,OAAO,+EAA+E;EAC1F,IAAI,OAAO,+EAA+E;EAC1F,GAAG,OAAO,CAAC;;EACX,MAAM;;;;;;;;EAON,MAAM;IACJ,MAAM,OAAO,oEAAoE;IACjF,aAAa,wBAAC,MAAa;AACzB,YAAM,IAAI;AACV,YAAM,KAAK,OAAO,oCAAoC;AACtD,YAAM,KAAK,CAACJ,QAAM,OAAO,oCAAoC;AAC7D,YAAM,KAAK,OAAO,qCAAqC;AACvD,YAAM,KAAK;AACX,YAAM,YAAY,OAAO,qCAAqC;AAE9D,YAAM,KAAK,WAAW,KAAK,GAAG,CAAC;AAC/B,YAAM,KAAK,WAAW,CAAC,KAAK,GAAG,CAAC;AAChC,UAAI,KAAKK,KAAI,IAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AACrC,UAAI,KAAKA,KAAI,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC;AAClC,YAAM,QAAQ,KAAK;AACnB,YAAM,QAAQ,KAAK;AACnB,UAAI;AAAO,aAAK,IAAI;AACpB,UAAI;AAAO,aAAK,IAAI;AACpB,UAAI,KAAK,aAAa,KAAK,WAAW;AACpC,cAAM,IAAI,MAAM,yCAAyC,CAAC;MAC5D;AACA,aAAO,EAAE,OAAO,IAAI,OAAO,GAAE;IAC/B,GApBa;;GAuBjBC,OAAM;AAKR,IAAMC,QAAM,OAAO,CAAC;AAoBpB,IAAM,QAAQ,UAAU;;;ACjHxB,YAAuB;AACvB,+BAAmC;AACnC,SAAS,oBAAoB,aAAa,UAAU;AAClD,QAAM,OAAO,IAAI,IAAI,QAAQ,EAAE;AAC/B,QAAM,OAAO,IAAI,IAAI,WAAW,EAAE;AAClC,SAAO,SAAS,QAAQ,KAAK,SAAS,IAAI,IAAI,EAAE;AAClD;AAJS;AAKT,IAAM,iBAAiC,oBAAI,IAAI;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,SAAS,oBAAoB,cAAc;AACzC,QAAM,eAAe,aAAa,MAAM,QAAQ;AAChD,MAAI,SAAS;AACb,aAAW,SAAS,cAAc;AAChC,QAAI,UAAU,MAAM,eAAe,IAAI,KAAK,GAAG;AAC7C,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AATS;AAUT,SAAS,UAAU,MAAM,MAAM;AAC/B;AADS;AAET,SAAS,iBAAiB,MAAM,MAAM;AACpC,OAAK,QAAQ,OAAO,IAAI;AAC1B;AAFS;AAGT,SAAS,iBAAiB,MAAM,MAAM;AACpC,QAAM,UAAU,KAAK;AACrB,aAAW,OAAO,OAAO,KAAK,OAAO,GAAG;AACtC,QAAI,IAAI,YAAY,MAAM,MAAM;AAC9B,aAAO,QAAQ,GAAG;AAAA,IACpB;AAAA,EACF;AACF;AAPS;AAQT,SAAS,qBAAqB,MAAM;AAClC,MAAI,KAAK,WAAW,MAAM;AACxB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,KAAK,QAAQ,WAAW,YAAY;AAC7C,WAAO;AAAA,EACT;AACA,SAAO;AACT;AARS;AAST,IAAM,iBAAiC,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AACxE,SAAS,WAAW,QAAQ;AAC1B,SAAO,eAAe,IAAI,MAAM;AAClC;AAFS;AAGT,eAAe,eAAe,WAAW,MAAM,UAAU;AACvD,UAAQ,KAAK,YAAY,UAAU;AAAA,IACjC,KAAK;AACH,YAAM,IAAI,UAAU,8EAA8E,SAAS,GAAG,EAAE;AAAA,IAClH,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH;AAAA,IACF;AACE,YAAM,IAAI,UAAU,4BAA4B,KAAK,QAAQ,EAAE;AAAA,EACnE;AACA,QAAM,cAAc,SAAS,QAAQ,IAAI,UAAU;AACnD,MAAI,gBAAgB,MAAM;AACxB,WAAO;AAAA,EACT;AACA,QAAM,aAAa,SAAS;AAC5B,QAAM,cAAc,IAAI,IAAI,aAAa,UAAU,EAAE,SAAS;AAC9D,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,cAAc,KAAK,eAAe;AACxC,MAAI,iBAAiB,aAAa;AAChC,UAAM,IAAI,UAAU,+BAA+B,WAAW,aAAa,UAAU,EAAE;AAAA,EACzF;AACA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,eAAe,gBAAgB;AAAA,EACjC;AACA,QAAM,eAAe,qBAAqB,IAAI;AAC9C,MAAI,CAAC,oBAAoB,YAAY,WAAW,GAAG;AACjD,eAAW,QAAQ,CAAC,iBAAiB,oBAAoB,UAAU,SAAS,GAAG;AAC7E,mBAAa,MAAM,IAAI;AAAA,IACzB;AAAA,EACF;AACA,QAAM,sBAAsB,KAAK;AACjC,QAAM,kBAAkB,KAAK;AAC7B,MAAI,SAAS,WAAW,OAAO,KAAK,QAAQ,SAAS,OAAO,oBAAoB,SAAS,cAAc,OAAO,gBAAgB,WAAW,aAAa;AACpJ,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAChF;AACA,MAAI,SAAS,WAAW,QAAQ,SAAS,WAAW,OAAO,SAAS,WAAW,QAAQ,KAAK,WAAW,QAAQ;AAC7G,SAAK,SAAS;AACd,SAAK,OAAO;AACZ,iBAAa,MAAM,gBAAgB;AAAA,EACrC;AACA,MAAI,SAAS,QAAQ,IAAI,iBAAiB,GAAG;AAC3C,SAAK,iBAAiB,oBAAoB,SAAS,QAAQ,IAAI,iBAAiB,CAAC;AAAA,EACnF;AACA,SAAO,MAAM,UAAU,aAAa,IAAI;AAC1C;AA9Ce;AA+Cf,SAAS,oBAAoB,OAAO,MAAM,QAAQ;AAChD,MAAI,WAAW,IAAI;AACjB,WAAO;AAAA,EACT;AACA,QAAM,eAAe;AACrB,QAAM,eAAe,KAAK;AAC1B,MAAI,aAAa,WAAW,OAAO,aAAa,QAAQ,WAAW,YAAY;AAC7E,iBAAa,QAAQ,OAAO,UAAU,MAAM;AAAA,EAC9C,WAAW,gBAAgB,OAAO,aAAa,WAAW,YAAY;AACpE,iBAAa,OAAO,UAAU,MAAM;AAAA,EACtC,OAAO;AACL,WAAO,EAAE,GAAG,MAAM,SAAS,EAAE,GAAG,KAAK,SAAS,OAAO,EAAE;AAAA,EACzD;AACA,SAAO;AACT;AAdS;AAeT,SAAS,uBAAuB,UAAU;AACxC,QAAM,wBAAwB,SAAS;AACvC,MAAI,OAAO,sBAAsB,WAAW,YAAY;AACtD,WAAO,sBAAsB,OAAO,YAAY;AAAA,EAClD;AACA,MAAI,OAAO,sBAAsB,QAAQ,YAAY;AACnD,UAAM,UAAU,sBAAsB,IAAI;AAC1C,QAAI,MAAM,QAAQ,QAAQ,YAAY,CAAC,GAAG;AACxC,aAAO,QAAQ,YAAY;AAAA,IAC7B;AACA,WAAO,CAAC;AAAA,EACV;AACA,QAAM,eAAe,SAAS,QAAQ,IAAI,YAAY;AACtD,MAAI,iBAAiB,MAAM;AACzB,eAAO,6CAAmB,YAAY;AAAA,EACxC;AACA,SAAO,CAAC;AACV;AAjBS;AAkBT,SAAS,YAAY,OAAO,KAAK,cAAc,MAAM;AACnD,QAAM,cAAc;AACpB,QAAM,YAAY,OAAO,IAAU,gBAAU;AAC7C,iBAAe,mBAAmB,OAAO,MAAM;AAC7C,UAAM,eAAe,QAAQ,CAAC;AAC9B,WAAO,EAAE,GAAG,MAAM,UAAU,SAAS;AACrC,UAAM,aAAa,OAAO,UAAU,WAAW,QAAQ,MAAM,OAAO,MAAM;AAC1E,UAAM,SAAS,MAAM,UAAU,gBAAgB,UAAU;AACzD,WAAO,oBAAoB,OAAO,MAAM,MAAM;AAC9C,UAAM,WAAW,MAAM,YAAY,OAAO,IAAI;AAC9C,UAAM,UAAU,uBAAuB,QAAQ;AAC/C,UAAM,QAAQ,IAAI,QAAQ,IAAI,OAAO,YAAY,MAAM,UAAU,UAAU,SAAS,SAAS,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC;AACnH,SAAK,KAAK,iBAAiB,KAAK,GAAG;AACjC,aAAO,eAAe,UAAU,cAAc,EAAE,OAAO,KAAK,CAAC;AAAA,IAC/D;AACA,QAAI,CAAC,WAAW,SAAS,MAAM,GAAG;AAChC,aAAO;AAAA,IACT;AACA,WAAO,MAAM,eAAe,oBAAoB,cAAc,QAAQ;AAAA,EACxE;AAhBe;AAiBf,qBAAmB,cAAc;AACjC,SAAO;AACT;AAtBS;AAuBT,YAAY,cAAc;;;AiD1J1B,8BAA4B;;;A6BC5B,IAAM,YAAY,wBAAC,MAAM,KAAK,UAAU,CAAC,MAAM;AAC3C,QAAM,QAAQ,OAAO,0BAA0B,GAAG;AAClD,WAAS,QAAQ;AACb,WAAO,MAAM,IAAI;AACrB,SAAO,iBAAiB,MAAM,KAAK;AACvC,GALkB;AAUlB,IAAM,aAAa,wBAAC,KAAK,eAAe,CAAC,GAAG,MAAM;AAC9C,QAAM,QAAQ,OAAO,eAAe,GAAG;AACvC,MAAI,UAAU;AACV,WAAO;AACX,SAAO,WAAW,OAAO,CAAC,GAAG,cAAc,KAAK,CAAC;AACrD,GALmB;AAUnB,IAAM,qBAAqB,2BAAI,SAAS;AACpC,MAAI,KAAK,WAAW;AAChB,WAAO;AACX,MAAI,cAAc;AAClB,QAAM,cAAc,KAAK,IAAI,SAAO,WAAW,GAAG,CAAC;AACnD,SAAO,YAAY,MAAM,CAAAC,gBAAcA,YAAW,SAAS,CAAC,GAAG;AAC3D,UAAM,SAAS,YAAY,IAAI,CAAAA,gBAAcA,YAAW,IAAI,CAAC;AAC7D,UAAM,uBAAuB,OAAO,CAAC;AACrC,QAAI,OAAO,MAAM,WAAS,UAAU,oBAAoB;AACpD,oBAAc;AAAA;AAEd;AAAA,EACR;AACA,SAAO;AACX,GAd2B;AAwB3B,IAAM,gBAAgB,wBAAC,aAAa,aAAa,UAAU,CAAC,MAAM;AAC9D,MAAI;AACJ,QAAMC,SAAQ,KAAK,mBAAmB,GAAG,WAAW,OAAO,QAAQ,OAAO,SAAS,KAAK,OAAO;AAC/F,QAAM,aAAa,OAAO,OAAOA,KAAI;AAIrC,QAAM,gBAAgB,WAAWA,KAAI;AACrC,WAAS,aAAa,aAAa;AAC/B,QAAI,SAAS,WAAW,SAAS;AAEjC,aAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,KAAK;AACzC,UAAI,WAAW,OAAO,CAAC;AACvB,UAAI,cAAc,QAAQ,QAAQ,MAAM,IAAI;AACxC,kBAAU,YAAY,UAAU,CAAC,eAAe,GAAG,OAAO,CAAC;AAC3D,sBAAc,KAAK,QAAQ;AAAA,MAC/B;AAAA,IACJ;AAAA,EACJ;AACA,aAAW,cAAc;AACzB,SAAO;AACX,GArBsB;AAsBtB,IAAM,SAAS,wBAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAjD;AAMf,IAAM,wBAAwB,wBAAC,MAAM,gBAAgB;AACjD,QAAM,cAAc,YAAY,IAAI,gBAAc,WAAW,UAAU,CAAC;AAExE,MAAI,aAAa;AAGjB,MAAI,wBAAwB;AAC5B,SAAO,uBAAuB;AAE1B,4BAAwB;AAExB,aAAS,IAAI,YAAY,SAAS,GAAG,KAAK,GAAG,KAAK;AAC9C,YAAM,eAAe,YAAY,CAAC,EAAE,UAAU;AAC9C,UAAI,iBAAiB,UAAa,iBAAiB,MAAM;AAErD,gCAAwB;AAExB,YAAI,OAAO,yBAAyB,cAAc,IAAI,KAAK,QAAW;AAClE,iBAAO,YAAY,CAAC,EAAE,CAAC;AAAA,QAC3B;AAAA,MACJ;AAAA,IACJ;AACA;AAAA,EACJ;AACA,SAAO;AACX,GAzB8B;AA8B9B,IAAM,WAAW,wBAAC,aAAa,YAAY,OAAO,cAAc,IAAI,MAAM,CAAC,GAAG;AAAA,EAC1E,iBAAiB;AACb,WAAO;AAAA,EACX;AAAA,EACA,iBAAiB;AACb,UAAM,MAAM,qDAAqD;AAAA,EACrE;AAAA,EACA,yBAAyB,GAAG,MAAM;AAC9B,WAAO,OAAO,yBAAyB,sBAAsB,MAAM,WAAW,KAAK,CAAC,GAAG,IAAI;AAAA,EAC/F;AAAA,EACA,iBAAiB;AACb,UAAM,IAAI,MAAM,6DAA6D;AAAA,EACjF;AAAA,EACA,IAAI,GAAG,MAAM;AACT,WAAO,sBAAsB,MAAM,WAAW,MAAM,UAAa,UAAU,IAAI,MAAM;AAAA,EACzF;AAAA,EACA,IAAI,GAAG,MAAM;AACT,YAAQ,sBAAsB,MAAM,WAAW,KAAK,WAAW,IAAI;AAAA,EACvE;AAAA,EACA,IAAI,GAAG,MAAM,KAAK;AACd,UAAM,qBAAqB,sBAAsB,MAAM,WAAW;AAClE,QAAI,uBAAuB;AACvB,YAAM,IAAI,MAAM,0DAA0D;AAC9E,uBAAmB,IAAI,IAAI;AAC3B,WAAO;AAAA,EACX;AAAA,EACA,iBAAiB;AACb,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC7E;AAAA,EACA,UAAU;AACN,WAAO,YACF,IAAI,OAAO,mBAAmB,EAC9B,OAAO,CAAC,MAAM,SAAS,KAAK,OAAO,KAAK,OAAO,SAAO,KAAK,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC;AAAA,EACtF;AACJ,CAAC,GAlCgB;AAwCjB,IAAM,gBAAgB,wBAAC,aAAa,gBAAgB,SAAS,CAAC,GAAG,aAAa,EAAE,YAAY,CAAC,CAAC,GAAxE;AAEtB,IAAM,WAAW;AAAA,EACb,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,sBAAsB;AAC1B;AAGA,IAAM,SAAS,oBAAI,QAAQ;AAC3B,IAAM,oBAAoB,wBAAC,UAAU,OAAO,IAAI,KAAK,GAA3B;AAC1B,IAAM,iBAAiB,wBAAC,YAAY,iBAAiB,OAAO,IAAI,YAAY,YAAY,GAAjE;AAiCvB,IAAM,2BAA2B,wBAAC,IAAI,OAAO;AACzC,MAAI,IAAI;AACR,QAAM,UAAU,OAAO,CAAC,GAAG,OAAO,oBAAoB,EAAE,GAAG,GAAG,OAAO,oBAAoB,EAAE,CAAC,CAAC;AAC7F,QAAM,eAAe,CAAC;AACtB,WAAS,OAAO;AACZ,iBAAa,GAAG,IAAI,OAAO,CAAC,IAAK,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,GAAG,OAAO,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAI,IAAK,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,GAAG,OAAO,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAE,CAAC;AACjO,SAAO;AACX,GAPiC;AAQjC,IAAM,mCAAmC,wBAAC,IAAI,OAAO;AACjD,MAAI,IAAI,IAAI,IAAI;AAChB,SAAQ;AAAA,IACJ,UAAU,0BAA0B,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc,QAAQ,OAAO,SAAS,KAAK,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAC;AAAA,IACjO,QAAQ,0BAA0B,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAC;AAAA,EAC/N;AACJ,GANyC;AAOzC,IAAM,kBAAkB,wBAAC,IAAI,OAAO;AAChC,MAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACxB,SAAQ;AAAA,IACJ,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,WAAW,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAG,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,WAAW,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAC,CAAC;AAAA,IAC9M,QAAQ,kCAAkC,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAC;AAAA,IACnO,UAAU,kCAAkC,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc,QAAQ,OAAO,SAAS,KAAK,CAAC,IAAI,KAAK,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,cAAc,QAAQ,OAAO,SAAS,KAAK,CAAC,CAAC;AAAA,EAC7O;AACJ,GAPwB;AAQxB,IAAM,aAAa,oBAAI,IAAI;AAC3B,IAAM,4BAA4B,2BAAI,YAAY;AAC9C,MAAI;AACJ,QAAM,aAAa,oBAAI,IAAI;AAC3B,QAAM,WAAW,oBAAI,IAAI,CAAC,GAAG,OAAO,CAAC;AACrC,SAAO,SAAS,OAAO,GAAG;AACtB,aAAS,SAAS,UAAU;AACxB,YAAM,oBAAoB,WAAW,MAAM,SAAS,EAAE,IAAI,WAAS,MAAM,WAAW;AACpF,YAAM,gBAAgB,KAAK,kBAAkB,KAAK,OAAO,QAAQ,OAAO,SAAS,KAAK,CAAC;AACvF,YAAM,wBAAwB,CAAC,GAAG,mBAAmB,GAAG,YAAY;AACpE,YAAM,aAAa,sBAAsB,OAAO,OAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AACvE,eAAS,YAAY;AACjB,iBAAS,IAAI,QAAQ;AACzB,iBAAW,IAAI,KAAK;AACpB,eAAS,OAAO,KAAK;AAAA,IACzB;AAAA,EACJ;AACA,SAAO,CAAC,GAAG,UAAU;AACzB,GAjBkC;AAkBlC,IAAM,sBAAsB,2BAAI,YAAY;AACxC,QAAM,0BAA0B,0BAA0B,GAAG,OAAO,EAC/D,IAAI,WAAS,WAAW,IAAI,KAAK,CAAC,EAClC,OAAO,CAAAC,gBAAc,CAAC,CAACA,WAAU;AACtC,MAAI,wBAAwB,UAAU;AAClC,WAAO,CAAC;AACZ,MAAI,wBAAwB,UAAU;AAClC,WAAO,wBAAwB,CAAC;AACpC,SAAO,wBAAwB,OAAO,CAAC,IAAI,OAAO,gBAAgB,IAAI,EAAE,CAAC;AAC7E,GAT4B;AAU5B,IAAM,wBAAwB,2BAAI,YAAY;AAC1C,QAAM,kBAAkB,QAAQ,IAAI,WAAS,sBAAsB,KAAK,CAAC;AACzE,MAAI,gBAAgB,WAAW;AAC3B,WAAO,CAAC;AACZ,MAAI,gBAAgB,WAAW;AAC3B,WAAO,gBAAgB,CAAC;AAC5B,SAAO,gBAAgB,OAAO,CAAC,IAAI,OAAO,gBAAgB,IAAI,EAAE,CAAC;AACrE,GAP8B;AAQ9B,IAAM,wBAAwB,wBAAC,UAAU;AACrC,MAAI,qBAAqB,WAAW,IAAI,KAAK;AAC7C,MAAI,CAAC,oBAAoB;AACrB,yBAAqB,CAAC;AACtB,eAAW,IAAI,OAAO,kBAAkB;AAAA,EAC5C;AACA,SAAO;AACX,GAP8B;AAyC9B,SAAS,SAAS,cAAc;AAC5B,MAAI,IAAI,IAAI;AACZ,QAAM,aAAa,aAAa,IAAI,iBAAe,YAAY,SAAS;AAIxE,QAAM,mBAAmB,SAAS;AAClC,MAAI,qBAAqB,MAAM;AAC3B,UAAM,gBAAgB,WACjB,IAAI,WAAS,MAAM,gBAAgB,CAAC,EACpC,OAAO,UAAQ,OAAO,SAAS,UAAU;AAC9C,UAAM,uBAAuB,mCAAa,MAAM;AAC5C,eAAS,gBAAgB;AACrB,qBAAa,MAAM,MAAM,IAAI;AAAA,IACrC,GAH6B;AAI7B,UAAM,aAAa,EAAE,CAAC,gBAAgB,GAAG,qBAAqB;AAC9D,eAAW,KAAK,UAAU;AAAA,EAC9B;AACA,WAAS,cAAc,MAAM;AACzB,eAAW,eAAe;AAEtB,gBAAU,MAAM,IAAI,YAAY,GAAG,IAAI,CAAC;AAC5C,QAAI,qBAAqB,QAAQ,OAAO,KAAK,gBAAgB,MAAM;AAC/D,WAAK,gBAAgB,EAAE,MAAM,MAAM,IAAI;AAAA,EAC/C;AANS;AAOT,aAAW,YAAY,SAAS,sBAAsB,SAChD,cAAc,YAAY,UAAU,IACpC,cAAc,YAAY,UAAU;AAC1C,SAAO,eAAe,YAAY,SAAS,oBAAoB,SACzD,cAAc,cAAc,MAAM,CAAC,WAAW,CAAC,IAC/C,SAAS,cAAc,SAAS,SAAS,CAAC;AAChD,MAAI,sBAAsB;AAC1B,MAAI,SAAS,yBAAyB,QAAQ;AAC1C,UAAM,kBAAkB,SAAS,yBAAyB,SACpD,oBAAoB,GAAG,YAAY,IACnC,sBAAsB,GAAG,YAAY;AAC3C,aAAS,cAAc,KAAK,oBAAoB,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,WAAW,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAG;AACtJ,YAAM,SAAS,UAAU,mBAAmB;AAC5C,UAAI,QAAQ;AACR,8BAAsB;AAAA,MAC1B;AAAA,IACJ;AACA,kCAA8B,KAAK,oBAAoB,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,YAAY,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAG,mBAAmB;AACrL,kCAA8B,KAAK,oBAAoB,QAAQ,oBAAoB,SAAS,SAAS,gBAAgB,cAAc,QAAQ,OAAO,SAAS,KAAK,CAAC,GAAG,oBAAoB,SAAS;AAAA,EACrM;AACA,iBAAe,qBAAqB,YAAY;AAChD,SAAO;AACX;AA/CS;AAgDT,IAAM,+BAA+B,wBAAC,yBAAyB,WAAW;AACtE,QAAM,iBAAiB,wBAAwB;AAC/C,QAAM,mBAAmB,wBAAwB;AACjD,MAAI;AACA,aAAS,OAAO;AACZ,eAAS,aAAa,eAAe,GAAG;AACpC,kBAAU,QAAQ,GAAG;AACjC,MAAI;AACA,aAAS,OAAO;AACZ,eAAS,aAAa,iBAAiB,GAAG;AACtC,kBAAU,QAAQ,KAAK,OAAO,yBAAyB,QAAQ,GAAG,CAAC;AACnF,GAXqC;;;AFpVrC,sBAAoB;;;;;;;;;;;;;;;;;;A3EApB,IAAA,oBAAA,CAAA;AAAAC,UAAA,mBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,UAAA,6BAAAC,WAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,OAAA,6BAAA,OAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,WAAA,6BAAA,WAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,qBAAA,6BAAAC,aAAA,qBAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,KAAA,6BAAA,KAAA;EAAA,MAAA,6BAAA,MAAA;AAAA,CAAA;ACAA,IAAAA,eAAA,CAAA;AAAAF,UAAAE,cAAA;EAAA,MAAA,6BAAA,iBAAA;EAAA,WAAA,6BAAA,qBAAA;EAAA,WAAA,6BAAA,aAAA;AAAA,CAAA;ACAA,IAAA,kBAAA,CAAA;ACAA,IAAA,sBAAA,CAAA;AAAAF,UAAA,qBAAA;EAAA,WAAA,6BAAAG,YAAA;EAAA,SAAA,6BAAAC,UAAA;EAAA,uBAAA,6BAAAC,wBAAA;EAAA,iBAAA,6BAAAC,kBAAA;EAAA,6BAAA,6BAAAC,8BAAA;EAAA,4BAAA,6BAAAC,6BAAA;EAAA,oBAAA,6BAAAC,qBAAA;EAAA,kBAAA,6BAAAC,mBAAA;EAAA,qBAAA,6BAAAC,sBAAA;EAAA,sBAAA,6BAAAC,uBAAA;EAAA,sBAAA,6BAAAC,uBAAA;EAAA,QAAA,6BAAAC,iBAAA;EAAA,MAAA,6BAAAC,qBAAA;AAAA,CAAA;ACAA,IAAAD,kBAAA,CAAA;ACAA,IAAAC,sBAAA,CAAA;AC6GO,IAAKL,oBAAL,kBAAKA,uBAAL;AACLA,EAAAA,mBAAA,SAAA,IAAU;AACVA,EAAAA,mBAAA,QAAA,IAAS;AACTA,EAAAA,mBAAA,gBAAA,IAAiB;AACjBA,EAAAA,mBAAA,QAAA,IAAS;AACTA,EAAAA,mBAAA,YAAA,IAAa;AALH,SAAAA;AAAA,GAAAA,qBAAA,CAAA,CAAA;AAQL,IAAKJ,mBAAL,kBAAKA,sBAAL;AACLA,EAAAA,kBAAA,eAAA,IAAgB;AAChBA,EAAAA,kBAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAAA,oBAAA,CAAA,CAAA;AAKL,IAAKG,sBAAL,kBAAKA,yBAAL;AACLA,EAAAA,qBAAA,UAAA,IAAW;AACXA,EAAAA,qBAAA,UAAA,IAAW;AACXA,EAAAA,qBAAA,gBAAA,IAAiB;AACjBA,EAAAA,qBAAA,gBAAA,IAAiB;AAJP,SAAAA;AAAA,GAAAA,uBAAA,CAAA,CAAA;AAOL,IAAKD,8BAAL,kBAAKA,iCAAL;AACLA,EAAAA,6BAAA,gBAAA,IAAiB;AACjBA,EAAAA,6BAAA,gBAAA,IAAiB;AAFP,SAAAA;AAAA,GAAAA,+BAAA,CAAA,CAAA;AAKL,IAAKD,+BAAL,kBAAKA,kCAAL;AACLA,EAAAA,8BAAA,WAAA,IAAY;AACZA,EAAAA,8BAAA,UAAA,IAAW;AAFD,SAAAA;AAAA,GAAAA,gCAAA,CAAA,CAAA;AAKL,IAAKJ,aAAL,kBAAKA,gBAAL;AACLA,EAAAA,YAAA,SAAA,IAAU;AACVA,EAAAA,YAAA,QAAA,IAAS;AAFC,SAAAA;AAAA,GAAAA,cAAA,CAAA,CAAA;AAML,IAAKE,yBAAL,kBAAKA,2BAAL;AACLA,yBAAA,IAAA,IAAK;AACLA,yBAAA,IAAA,IAAK;AAFK,SAAAA;AAAA,GAAAA,0BAAA,CAAA,CAAA;AAML,IAAKD,WAAL,kBAAKA,aAAL;AACLA,WAAAA,SAAA,IAAA,IAAA,CAAA,IAAA;AACAA,WAAAA,SAAA,IAAA,IAAA,CAAA,IAAA;AAFU,SAAAA;AAAA,GAAAA,YAAA,CAAA,CAAA;AASL,IAAKO,uBAAL,kBAAKA,0BAAL;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AARK,SAAAA;AAAA,GAAAA,wBAAA,CAAA,CAAA;AAcL,IAAKC,wBAAL,kBAAKA,0BAAL;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AANK,SAAAA;AAAA,GAAAA,yBAAA,CAAA,CAAA;AAYL,IAAKC,wBAAL,kBAAKA,0BAAL;AACLA,wBAAA,IAAA,IAAK;AACLA,wBAAA,IAAA,IAAK;AAFK,SAAAA;AAAA,GAAAA,yBAAA,CAAA,CAAA;ALtLZ,WAAAX,cAAA,WAAA;AMJA,IAAA,iBAAA,CAAA;AAAAF,UAAA,gBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,aAAA,6BAAA,aAAA;AAAA,CAAA;AAGO,IAAM,aAAa,OAAO,WAAW;AAE5C,IAAM,cAAc;AAwBb,SAAS,oBAAoB,OAA4B;AAC9D,SAAO,IAAI,WAAW,KAAK,EAAE,OAAO,CAAC,MAAM,SAAS,OAAO,OAAO,aAAa,IAAI,GAAG,EAAE;AAC1F;AAFgB;AAmBT,SAAS,YAAY,KAAyB;AACnD,SAAO,IAAI,YAAY,EAAE,OAAO,GAAG;AACrC;AAFgB;AAST,SAAS,oBAAoB,KAAyB;AAC3D,SAAO,YAAY,GAAG;AACxB;AAFgB;AAiBT,SAAS,cAAc,GAAuB;AACnD,SAAO,OAAO,OAAO,CAAC;AACxB;AAFgB;AAiBT,SAAS,cAAc,GAAwB;AACpD,SAAO,OAAO,OAAO,IAAI,WAAW,CAAC,CAAC;AACxC;AAFgB;AAiBT,SAAS,QAAQ,QAAoB;AAC1C,SAAO,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,GAAG,EAAE;AACxE;AAFgB;AAgBT,SAAS,gBAAgB,KAAqB;AACnD,SAAO,IAAI,QAAQ,QAAQ,EAAE;AAC/B;AAFgB;AAgBT,SAAS,aAAa,KAAqB;AAChD,SAAO,KAAK,gBAAgB,GAAG,CAAC;AAClC;AAFgB;AAyBhB,SAAS,UAAU,KAAa,QAAgB,MAAegB,WAAU,aAAqB;AAC5F,QAAM,OAAO,SAAS,IAAI;AAC1B,MAAI,SAAS;AACb,MAAI,OAAO,GAAG;AACZ,UAAM,MAAMA,SAAQ,OAAO,IAAI;AAC/B,aAAS,OAAO,MAAM,MAAM,MAAM;EACpC;AACA,SAAO;AACT;AARS;AA4BF,SAAS,QAAQ,KAAa,QAAgBA,WAAU,aAAqB;AAClF,SAAO,UAAU,KAAK,QAAQ,MAAMA,QAAO;AAC7C;AAFgB;AAwBT,SAAS,eAAe,KAAa,WAAW,GAAW;AAChE,QAAM,EAAE,OAAO,IAAI;AACnB,QAAM,YAAY,SAAS;AAC3B,SAAO,aAAc,SAAS,aAAa,WAAY,WAAW,WAAW;AAC/E;AAJgB;AA2BT,SAAS,cAAc,KAAa,WAAW,GAAGA,WAAU,aAAqB;AACtF,SAAO,QAAQ,KAAK,eAAe,KAAK,QAAQ,GAAGA,QAAO;AAC5D;AAFgB;AAmBT,SAAS,YAAY,KAAqB;AAC/C,QAAM,gBAAgB,GAAG;AACzB,QAAM,cAAc,KAAK,CAAC;AAC1B,MAAI,KAAK;AACP,UAAM,aAAa,GAAG;EACxB;AACA,SAAO;AACT;AAPgB;AAwBT,IAAM,gBAAgB,wBAAC,SAC5B,QAAQ,KAAK,IAAI,IACb,KACG,MAAM,WAAW,EACjB,KAAK,GAAG,EACR,YAAY,IACf,MANuB;APxRtB,IAAM,uBAAuB;AAS7B,IAAM,OAAO;AACb,IAAMf,YAAW,MAAM,OAAO;AAC9B,IAAM,cAAc;AACpB,IAAM,QAAQ,MAAM,OAAO,MAAM,MAAM,OAAO;AAG9C,IAAM,wBAAwB;AAC9B,IAAM,aAAa,MAAM,OAAO;AAEvC,IAAM,QAAQ,wBAAC,KAAa,SAAiB,EAAE,KAAK,IAAI,IAA1C;AAEP,IAAM,aAAa,MAAM,MAAM,QAAQ,EAAE;AACzC,IAAM,aAAa,MAAM,EAAE,MAAM,OAAO,MAAM,OAAO,EAAE;AACvD,IAAM,aAAa,MAAM,MAAM,MAAM,OAAO,EAAE;AAE9C,IAAK,UAAL,kBAAKgB,aAAL;AACLA,WAAA,SAAA,IAAU;AACVA,WAAA,YAAA,IAAa;AAFH,SAAAA;AAAA,GAAA,WAAA,CAAA,CAAA;AAKL,IAAK,cAAL,kBAAKC,iBAAL;AACLA,eAAA,SAAA,IAAU;AACVA,eAAA,YAAA,IAAa;AAFH,SAAAA;AAAA,GAAA,eAAA,CAAA,CAAA;AAKL,IAAK,kBAAL,kBAAKC,qBAAL;AACLA,mBAAA,SAAA,IAAU;AACVA,mBAAA,YAAA,IAAa;AAFH,SAAAA;AAAA,GAAA,mBAAA,CAAA,CAAA;AAKL,IAAK,wBAAL,kBAAKC,2BAAL;AACLA,yBAAA,SAAA,IAAU;AACVA,yBAAA,QAAA,IAAS;AACTA,yBAAA,gBAAA,IAAiB;AACjBA,yBAAA,QAAA,IAAS;AACTA,yBAAA,YAAA,IAAa;AALH,SAAAA;AAAA,GAAA,yBAAA,CAAA,CAAA;AAQL,IAAW,sBAAX,kBAAWC,yBAAX;AACLA,uBAAAA,qBAAA,qBAAA,IAAsB,EAAA,IAAtB;AACAA,uBAAAA,qBAAA,6BAAA,IAA8B,EAAA,IAA9B;AACAA,uBAAAA,qBAAA,SAAA,IAAU,EAAA,IAAV;AAHgB,SAAAA;AAAA,GAAA,uBAAA,CAAA,CAAA;AAMX,IAAM,MAAM;EACjB,SAAS;EACT,YAAY;AACd;AAEO,IAAM,sBAAsB;AAE5B,IAAM,YAAY;EACvB,SAAS;IACP,mDAAmD,mBAAmB;IACtE,+CAA+C,mBAAmB;EACpE;EACA,YAAY;IACV,mDAAmD,mBAAmB;IACtE,+CAA+C,mBAAmB;EACpE;AACF;AS5EA,IAAA,kBAAA,CAAA;AAAArB,UAAA,iBAAA;EAAA,YAAA,6BAAA,YAAA;AAAA,CAAA;ACCO,SAAS,SAAS,QAAe,KAAe,OAAO,aAAa;AACzE,QAAM,EAAE,kBAAkB,IAAI;AAE9B,uBAAqB,kBAAkB,QAAQ,EAAE;AACnD;AAJgB;AAMT,SAAS,SAAS,QAAe,WAAe;AACrD,QAAM,EAAE,eAAe,IAAI;AAE3B,mBAAiB,eAAe,QAAQ,SAAS,IAAM,OAAe,YAAY;AACpF;AAJgB;AAOT,IAAM,cAAN,cAA0B,MAAM;SAAA;;;EACrC;EAEA,YAAY,SAAkB;AAC5B,UAAM,OAAO;AAIb,WAAO,eAAe,MAAM,QAAQ;MAClC,OAAO,WAAW;MAClB,YAAY;MACZ,cAAc;IAChB,CAAC;AAID,aAAS,MAAM,WAAW,SAAS;AAEnC,aAAS,IAAI;EACf;AACF;AAEO,IAAM,eAAN,cAA2B,YAAY;SAAA;;;AAAC;ACpC/C,IAAA,gBAAA,CAAA;AAAAsB,UAAA,eAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,KAAA,6BAAAC,cAAA;EAAA,4BAAA,6BAAA,4BAAA;EAAA,2BAAA,6BAAA,2BAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,MAAA,6BAAA,MAAA;EAAA,cAAA,6BAAA,cAAA;AAAA,CAAA;ACAO,IAAK,eAAL,kBAAKC,kBAAL;AACLA,gBAAA,QAAA,IAAS;AACTA,gBAAA,MAAA,IAAO;AACPA,gBAAA,QAAA,IAAS;AAHC,SAAAA;AAAA,GAAA,gBAAA,CAAA,CAAA;AAML,IAAK,OAAL,kBAAKC,UAAL;AACLA,QAAA,IAAA,IAAK;AACLA,QAAA,KAAA,IAAM;AACNA,QAAA,KAAA,IAAM;AACNA,QAAA,KAAA,IAAM;AACNA,QAAA,MAAA,IAAO;AACPA,QAAA,MAAA,IAAO;AACPA,QAAA,MAAA,IAAO;AAPG,SAAAA;AAAA,GAAA,QAAA,CAAA,CAAA;AAUL,IAAK,UAAL,kBAAKC,aAAL;AACLA,WAAA,WAAA,IAAY;AACZA,WAAA,iBAAA,IAAkB;AAClBA,WAAA,gBAAA,IAAiB;AAHP,SAAAA;AAAA,GAAA,WAAA,CAAA,CAAA;ACML,IAAK,iBAAL,kBAAKC,oBAAL;AACLA,kBAAA,UAAA,IAAW;AACXA,kBAAA,YAAA,IAAa;AACbA,kBAAA,aAAA,IAAc;AAHJ,SAAAA;AAAA,GAAA,kBAAA,CAAA,CAAA;AC4IL,IAAK,kBAAL,kBAAKC,qBAAL;AACLA,mBAAA,SAAA,IAAU;AACVA,mBAAA,QAAA,IAAS;AACTA,mBAAA,gBAAA,IAAiB;AACjBA,mBAAA,QAAA,IAAS;AAJC,SAAAA;AAAA,GAAA,mBAAA,CAAA,CAAA;AAWL,IAAK,oBAAL,kBAAKC,uBAAL;AACLA,qBAAA,cAAA,IAAe;AACfA,qBAAA,UAAA,IAAW;AACXA,qBAAA,gBAAA,IAAiB;AACjBA,qBAAA,gBAAA,IAAiB;AACjBA,qBAAA,UAAA,IAAW;AACXA,qBAAA,UAAA,IAAW;AAND,SAAAA;AAAA,GAAA,qBAAA,CAAA,CAAA;AASL,IAAK,4BAAL,kBAAKC,+BAAL;AACLA,6BAAA,cAAA,IAAe;AACfA,6BAAA,UAAA,IAAW;AACXA,6BAAA,gBAAA,IAAiB;AACjBA,6BAAA,gBAAA,IAAiB;AAJP,SAAAA;AAAA,GAAA,6BAAA,CAAA,CAAA;AAOL,IAAK,6BAAL,kBAAKC,gCAAL;AACLA,8BAAA,UAAA,IAAW;AACXA,8BAAA,UAAA,IAAW;AACXA,8BAAA,WAAA,IAAY;AAHF,SAAAA;AAAA,GAAA,8BAAA,CAAA,CAAA;AAML,IAAK,cAAL,kBAAKC,iBAAL;AACLA,eAAA,SAAA,IAAU;AACVA,eAAA,gBAAA,IAAiB;AACjBA,eAAA,gBAAA,IAAiB;AACjBA,eAAA,UAAA,IAAW;AAJD,SAAAA;AAAA,GAAA,eAAA,CAAA,CAAA;AAOL,IAAK,WAAL,kBAAKC,cAAL;AACLA,YAAA,SAAA,IAAU;AACVA,YAAA,QAAA,IAAS;AAFC,SAAAA;AAAA,GAAA,YAAA,CAAA,CAAA;AE/LG,SAAR,OAAwB,WAAoB,SAAqC;AACtF,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,WAAW,mBAAmB;EAChD;AACF;AAJO;ACXP,IAAA,cAAA,CAAA;AAAAX,UAAA,aAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,uCAAA,6BAAA,uCAAA;EAAA,2CAAA,6BAAA,2CAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,YAAA,6BAAAY,aAAA;EAAA,oBAAA,6BAAA,oBAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,WAAA,6BAAA,WAAA;EAAA,OAAA,6BAAAC,QAAA;EAAA,UAAA,6BAAAC,WAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,OAAA,6BAAA,OAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,cAAA,6BAAA,cAAA;AAAA,CAAA;AAyBO,SAASD,OAAM,KAAsB;AAC1C,SAAO,iBAAiB,KAAK,GAAG;AAClC;AAFgB,OAAAA,QAAA;AAgBT,SAAS,SAAS,OAA6B;AACpD,SAAO,OAAO,KAAK;AACrB;AAFgB;AAkBT,SAAS,SAAS,OAA6B;AACpD,SAAO,OAAO,UAAU;AAC1B;AAFgB;AAeT,SAAS,MAAM,OAA6B;AACjD,SAAO,aAAa,SAAS,KAAK,EAAE,SAAS,EAAE,CAAC;AAClD;AAFgB;AAOT,IAAM,cAAc;AAWpB,SAAS,aAAaE,UAA8B;AACzD,SAAO,aAAa,SAASA,QAAM,EAAE,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG,CAAC;AACrE;AAFgB;AAeT,SAAS,mBAAmB,KAAqB;AACtD,SAAO,OAAO,aAAa,GAAG,CAAC,EAAE,SAAS,EAAE;AAC9C;AAFgB;AAcT,SAAS,SAAS,KAAqB;AAC5C,SAAO,IAAI,YAAY,EAAE,QAAQ,WAAW,IAAI;AAClD;AAFgB;AAuBT,SAAS,cACd,OACA,YACA,YACA,YAAY,IACZ;AACA,QAAM,gBAAgB,cAAc,KAAK,mBAAmB,WAAW,SAAS;AAChF,QAAM,cAAc,OAAO,KAAK;AAChC,QAAM,mBAAmB,OAAO,UAAU;AAC1C,QAAM,mBAAmB,OAAO,UAAU;AAE1C;IACE,eAAe,oBAAoB,eAAe;IAClD,yBAAyB,aAAa;EACxC;AACF;AAfgB;AA6BT,SAAS,sCAAsC,MAAgC;AACpF,SAAO,KAAK,IAAI,CAAC,MAAM,SAAS,CAAC,EAAE,SAAS,EAAE,CAAC;AACjD;AAFgB;AAgBT,SAAS,0CAA0C,MAAgC;AACxF,SAAO,KAAK,IAAI,CAAC,MAAM,MAAM,CAAC,CAAC;AACjC;AAFgB;AAgBT,SAAS,oBAAoB,KAAsB;AACxD,SAAO,QAAQ,KAAK,GAAG;AACzB;AAFgB;AAmBT,SAAS,iBAAiB,KAAa;AAC5C,MAAIF,OAAM,GAAG,GAAG;AACd,WAAO,mBAAmB,GAAG;EAC/B;AACA,MAAI,oBAAoB,GAAG,GAAG;AAC5B,WAAO;EACT;AACA,QAAM,IAAI,MAAM,GAAG,GAAG,kDAAkD;AAC1E;AARgB;AAyBT,SAAS,aAAa,KAAa;AACxC,MAAIA,OAAM,GAAG,GAAG;AACd,WAAO;EACT;AACA,MAAI,oBAAoB,GAAG,GAAG;AAC5B,WAAO,YAAY,GAAG;EACxB;AACA,QAAM,IAAI,MAAM,GAAG,GAAG,kDAAkD;AAC1E;AARgB;AAsBT,SAAS,kBAAkB,OAAsB;AACtD,SAAO,MAAM,IAAI,YAAY;AAC/B;AAFgB;AAkBT,SAAS,YAAY,OAAwB;AAClD,UAAQ,CAAC,OAAO,SAAS;AAC3B;AAFgB;AAqBT,SAASD,YAAW,KAAyB;AAClD,MAAI,CAACC,OAAM,GAAG;AAAG,UAAM,IAAI,MAAM,GAAG,GAAG,2BAA2B;AAElE,MAAI,eAAuB,gBAAgB,GAAG;AAC9C,MAAI,aAAa,SAAS,MAAM,GAAG;AACjC,mBAAe,IAAI,YAAY;EACjC;AACA,SAAO,WAAgB,YAAY;AACrC;AARgB,OAAAD,aAAA;AA0BT,SAAS,WAAWG,UAAsB,SAAiB;AAChE,QAAM,YAAY,OAAOA,QAAM;AAC/B,SAAO,YAAa,YAAY,OAAO,OAAO,IAAK;AACrD;AAHgB;AAoBT,SAASD,UAAS,OAAiC;AACxD,SAAO,OAAO,UAAU;AAC1B;AAFgB,OAAAA,WAAA;AAmBT,SAAS,UAAU,OAAkC;AAC1D,SAAO,OAAO,UAAU;AAC1B;AAFgB;ACvXhB,IAAA,mBAAA,CAAA;AAAAd,UAAA,kBAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,gBAAA,6BAAA,gBAAA;AAAA,CAAA;AAkBO,SAAS,SAAS,OAA6B;AACpD,QAAM,mBAAmB,gBAAgB,MAAM,OAAO,KAAK,CAAC,CAAC;AAC7D,QAAM,UAAU,iBAAiB,SAAS,MAAM,IAAI,mBAAmB,IAAI,gBAAgB;AAC3F,SAAO,aAAa,OAAOY,YAAW,aAAa,OAAO,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC;AAC5E;AAJgB;AAahB,SAAS,UAAU,KAAqB;AACtC,SAAO,aAAa,OAAO,YAAY,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC;AAC3D;AAFS;AAgBF,SAAS,eAAe,KAAqB;AAClD,QAAMI,QAAO,OAAO,UAAU,GAAG,CAAC;AAElC,SAAOA,QAAOC;AAChB;AAJgB;AAkBT,SAAS,oBAAoB,UAAkB;AAEpD,SAAO,MAAM,eAAe,QAAQ,CAAC;AACvC;AAHgB;AAsBT,SAAS,YAAY,OAAe;AACzC,MAAIJ,OAAM,KAAK,GAAG;AAChB,WAAO;EACT;AACA,MAAI,oBAAoB,KAAK,GAAG;AAC9B,WAAO,YAAY,KAAK;EAC1B;AACA,SAAO,oBAAoB,KAAK;AAClC;AARgB;ACvFhB,IAAA,sBAAA,CAAA;AAAAb,UAAA,qBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,QAAA,6BAAA,QAAA;EAAA,iBAAA,6BAAA,iBAAA;AAAA,CAAA;AAgBO,SAAS,QAAQ,KAAsB;AAE5C,SAAO,iBAAiB,KAAK,GAAG;AAClC;AAHgB;AAeT,SAAS,cAAc,KAAsB;AAClD,SAAO,IAAI,UAAU;AACvB;AAFgB;AAgBT,SAAS,gBAAgB,KAAsB;AACpD,SAAO,YAAY,KAAK,GAAG;AAC7B;AAFgB;AAcT,SAAS,SAAS,OAAiC;AACxD,SAAO,OAAO,UAAU;AAC1B;AAFgB;AAgBT,SAAS,OAAO,KAAU;AAC/B,SAAO,SAAS,GAAG,KAAK,CAACa,OAAM,GAAG,KAAK,CAAC,oBAAoB,GAAG;AACjE;AAFgB;AAcT,IAAM,cAAc,wBAAC,QAAa,OAAO,GAAG,KAAK,cAAc,GAAG,GAA9C;AAYpB,IAAM,aAAa,wBAAC,QAAa,OAAO,GAAG,KAAK,CAAC,cAAc,GAAG,GAA/C;AAYnB,SAAS,gBAAgB,SAA2B;AACzD,QAAM,QAAQ,OAAO,SAAS,oBAAoB,KAAK,GAAG;AAC1D,SAAO,QAAQ,MAAM,KAAK,KAAK,CAAC;AAClC;AAHgB;AAeT,SAAS,kBAAkB,KAAqB;AACrD,MAAI,CAAC,QAAQ,GAAG;AAAG,UAAM,IAAI,MAAM,GAAG,GAAG,yBAAyB;AAClE,MAAI,CAAC,cAAc,GAAG;AAAG,UAAM,IAAI,MAAM,GAAG,GAAG,cAAc;AAC7D,SAAO,aAAa,IAAI,QAAQ,MAAM,CAAC,SAAS,KAAK,WAAW,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;AAClF;AAJgB;AAgBT,SAAS,kBAAkB,KAAqB;AACrD,MAAI,CAAC,QAAQ,GAAG;AAAG,UAAM,IAAI,MAAM,GAAG,GAAG,yBAAyB;AAClE,MAAIA,OAAM,GAAG,GAAG;AACd,WAAO,gBAAgB,GAAG,EAAE,QAAQ,SAAS,CAAC,QAAQ,OAAO,aAAa,SAAS,KAAK,EAAE,CAAC,CAAC;EAC9F;AACA,MAAI,gBAAgB,GAAG,GAAG;AACxB,WAAO,kBAAkB,KAAK,OAAO,OAAO,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC;EAChE;AACA,QAAM,IAAI,MAAM,GAAG,GAAG,wBAAwB;AAChD;AATgB;AClJhB,IAAA,oBAAA,CAAA;AAAAb,UAAA,mBAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,qBAAA,6BAAA,qBAAA;AAAA,CAAA;AAkBO,SAAS,oBAAoB,aAAgC;AAClE,QAAM,eACJ,OAAO,YAAY,YAAY,MAAM,KACjC,KACA,kBAAkB,MAAM,YAAY,YAAY,CAAC;AACvD,SACE,YAAY,KAAK,OAAe,CAAC,eAAe,kBAAgC;AAC9E,UAAM,MACJ,OAAO,aAAa,MAAM,KAAK,KAAK,kBAAkB,MAAM,aAAa,CAAC;AAC5E,WAAO,gBAAgB;EACzB,GAAG,EAAE,IAAI;AAEb;AAZgB;AA6BT,SAAS,oBAAoB,cAAiC;AACnE,QAAM,eAAyB,gBAAgB,YAAY;AAC3D,QAAM,YAAoB,aAAa,aAAa,SAAS,CAAC;AAC9D,QAAM,sBAAsC,aAAa,IAAI,iBAAiB;AAE9E,QAAM,CAAC,aAAa,iBAAiB,IACnC,cAAc,UAAa,UAAU,WAAW,KAC5C,CAAC,QAAQ,CAAC,IACV,CAAC,oBAAoB,IAAI,GAAI,UAAU,MAAM;AAEnD,SAAO;IACL,MAAM,oBAAoB,WAAW,IAAI,CAAC,IAAI;IAC9C,cAAc;IACd,kBAAkB;EACpB;AACF;AAfgB;AC/ChB,IAAA,gBAAA,CAAA;AAAAA,UAAA,eAAA;EAAA,MAAA,6BAAA,MAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,OAAA,6BAAA,OAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,OAAA,6BAAA,OAAA;EAAA,SAAA,6BAAA,SAAA;EAAA,SAAA,6BAAA,SAAA;AAAA,CAAA;ACSO,SAAS,UAAU,IAA0B;AAElD,MAAI,SAAS,EAAE,KAAK,OAAO,UAAU,EAAE,GAAG;AACxC,WAAO,GAAG,SAAS;EACrB;AAGA,MAAI,SAAS,EAAE,GAAG;AAEhB,QAAIa,OAAM,EAAE,GAAG;AACb,aAAO,OAAO,EAAE,EAAE,SAAS;IAC7B;AAEA,QAAI,OAAO,EAAE,GAAG;AACd,UAAI,CAAC,cAAc,EAAE,GAAG;AACtB,cAAM,IAAI;UACR,GAAG,EAAE;QACP;MACF;AAEA,aAAO,OAAO,kBAAkB,EAAE,CAAC,EAAE,SAAS;IAChD;AAEA,QAAI,oBAAoB,EAAE,GAAG;AAC3B,aAAO;IACT;EACF;AAEA,MAAI,UAAU,EAAE,GAAG;AACjB,WAAO,GAAG,CAAC,EAAE;EACf;AAEA,QAAM,IAAI,MAAM,GAAG,EAAE,8BAA8B;AACrD;AAjCgB;ACAT,IAAM,gBAAgB,MAAM,QAAQ;AACpC,IAAM,gBAAgB,MAAM,QAAQ;AACpC,IAAM,eAAe;AACrB,IAAM,mBAAmB;AACzB,IAAM,oBAAoB;AAC1B,IAAM,mBAAmB;AACzB,IAAM,oBAAoB;AAE1B,IAAM,eAAN,MAAM,cAAa;SAAA;;;EACjB;EAEA;EAEP,OAAO,cAAc;EAgBd,eAAe,KAAY;AAChC,QAAI,OAAO,IAAI,CAAC,MAAM,YAAY,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,KAAK,UAAU,IAAI,CAAC,GAAG;AACzF,YAAM,QAAQ,cAAa,cAAc,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI;AAChE,WAAK,MAAM,MAAM;AACjB,WAAK,OAAO,MAAM;IACpB,WAAW,IAAI,WAAW,GAAG;AAC3B,YAAM,SAAS,cAAa,SAAS,IAAI,CAAC,CAAC;AAC3C,WAAK,MAAM,SAAS;AACpB,WAAK,OAAO,UAAU;IACxB,WAAW,IAAI,WAAW,GAAG;AAC3B,YAAM,QAAQ,cAAa,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACvD,WAAK,MAAM,MAAM;AACjB,WAAK,OAAO,MAAM;IACpB,OAAO;AACL,YAAM,MAAM,kCAAkC;IAChD;EACF;;;;EAKA,OAAO,SAAS,cAA4B;AAC1C,UAAM,SAAS,OAAO,YAAY;AAClC,QAAI,SAAS;AAAc,YAAM,MAAM,2CAA2C;AAClF,QAAI,SAAS;AAAc,YAAM,IAAI,MAAM,0CAA0C;AACrF,WAAO;EACT;;;;EAKA,OAAO,cAAc,KAAmB,MAAoB;AAC1D,UAAM,YAAY,OAAO,GAAG;AAC5B,UAAM,aAAa,OAAO,IAAI;AAC9B,QAAI,YAAY,oBAAoB,YAAY,kBAAkB;AAChE,YAAM,IAAI,MAAM,yDAAyD;IAC3E;AACA,QAAI,aAAa,qBAAqB,aAAa,mBAAmB;AACpE,YAAM,IAAI,MAAM,4DAA4D;IAC9E;AACA,WAAO,EAAE,KAAK,WAAW,MAAM,WAAW;EAC5C;;;;EAKA,OAAO,GAAG,cAA4B;AACpC,QAAI;AACF,oBAAa,SAAS,YAAY;IACpC,SAASK,QAAO;AACd,aAAO;IACT;AACA,WAAO;EACT;;;;EAKA,OAAO,UAAU,SAAiB;AAChC,WAAO,YAAY,cAAa;EAClC;;;;EAKA,WAAW;AACT,YAAQ,KAAK,QAAQ,QAAQ,KAAK;EACpC;;;;;EAMA,qBAAqB;AACnB,WAAO;MACL,KAAK,aAAa,KAAK,IAAI,SAAS,EAAE,CAAC;MACvC,MAAM,aAAa,KAAK,KAAK,SAAS,EAAE,CAAC;IAC3C;EACF;;;;;EAMA,yBAAyB;AACvB,WAAO;MACL,KAAK,KAAK,IAAI,SAAS,EAAE;MACzB,MAAM,KAAK,KAAK,SAAS,EAAE;IAC7B;EACF;;;;EAKA,eAAe;AACb,WAAO,CAAC,UAAU,KAAK,GAAG,GAAG,UAAU,KAAK,IAAI,CAAC;EACnD;AACF;AC7HO,IAAM,gBAAgB,MAAM,QAAQ;AACpC,IAAM,eAAe;AACrB,IAAM,eAAe;AAErB,IAAM,eAAN,MAAM,cAAa;SAAA;;;EACjB;EAEA;EAEA;EAEA;EAEP,OAAO,cAAc;EAqBd,eAAe,KAAY;AAChC,QACE,OAAO,IAAI,CAAC,MAAM,YAClB,IAAI,WAAW,KACf,WAAW,IAAI,CAAC,KAChB,WAAW,IAAI,CAAC,KAChB,WAAW,IAAI,CAAC,KAChB,WAAW,IAAI,CAAC,GAChB;AACA,YAAM,QAAQ,cAAa;QACzB,IAAI,CAAC,EAAE;QACP,IAAI,CAAC,EAAE;QACP,IAAI,CAAC,EAAE;QACP,IAAI,CAAC,EAAE;MACT;AACA,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;IACrB,WAAW,IAAI,WAAW,GAAG;AAC3B,YAAM,SAAS,cAAa,SAAS,IAAI,CAAC,CAAC;AAC3C,WAAK,QAAQ,SAAS;AACtB,WAAK,SAAS,SAAU,gBAAgB,SAAU;AAClD,WAAK,SAAS,SAAU,gBAAgB,SAAU;AAClD,WAAK,QAAQ,UAAU;IACzB,WAAW,IAAI,WAAW,GAAG;AAC3B,YAAM,QAAQ,cAAa,cAAc,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACvE,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;IACrB,OAAO;AACL,YAAM,MAAM,0CAA0C;IACxD;EACF;;;;EAKA,OAAO,SAAS,cAAoC;AAClD,UAAM,SAAS,OAAO,YAAY;AAClC,QAAI,SAAS;AAAc,YAAM,MAAM,4CAA4C;AACnF,QAAI,SAAS;AAAc,YAAM,MAAM,2CAA2C;AAClF,WAAO;EACT;;;;EAKA,OAAO,cACL,OACA,OACA,OACA,OACgE;AAChE,UAAM,KAAK,OAAO,KAAK;AACvB,UAAM,KAAK,OAAO,KAAK;AACvB,UAAM,KAAK,OAAO,KAAK;AACvB,UAAM,KAAK,OAAO,KAAK;AACvB,KAAC,IAAI,IAAI,IAAI,EAAE,EAAE,QAAQ,CAAC,OAAe,UAAU;AACjD,UAAI,QAAQ,gBAAgB,QAAQ,cAAc;AAChD,cAAM,MAAM,OAAO,KAAK,uCAAuC;MACjE;IACF,CAAC;AACD,WAAO,EAAE,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,GAAG;EACtD;;;;EAKA,OAAO,GAAG,cAAqC;AAC7C,QAAI;AACF,oBAAa,SAAS,YAAY;IACpC,SAASA,QAAO;AACd,aAAO;IACT;AACA,WAAO;EACT;;;;EAKA,OAAO,UAAU,SAA0B;AACzC,WAAO,YAAY,cAAa;EAClC;;;;EAKA,WAAmB;AACjB,YAAQ,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,KAAK,SAAS,QAAQ,KAAK;EACnF;;;;;EAMA,qBAAqB;AACnB,WAAO;MACL,OAAO,aAAa,KAAK,MAAM,SAAS,EAAE,CAAC;MAC3C,OAAO,aAAa,KAAK,MAAM,SAAS,EAAE,CAAC;MAC3C,OAAO,aAAa,KAAK,MAAM,SAAS,EAAE,CAAC;MAC3C,OAAO,aAAa,KAAK,MAAM,SAAS,EAAE,CAAC;IAC7C;EACF;;;;;EAMA,yBAAyB;AACvB,WAAO;MACL,OAAO,KAAK,MAAM,SAAS,EAAE;MAC7B,OAAO,KAAK,MAAM,SAAS,EAAE;MAC7B,OAAO,KAAK,MAAM,SAAS,EAAE;MAC7B,OAAO,KAAK,MAAM,SAAS,EAAE;IAC/B;EACF;;;;EAKA,eAAyB;AAEvB,WAAO;MACL,UAAU,KAAK,KAAK;MACpB,UAAU,KAAK,KAAK;MACpB,UAAU,KAAK,KAAK;MACpB,UAAU,KAAK,KAAK;IACtB;EACF;AACF;AHzJO,IAAM,QAAQ,wBAAC,SAAiB,QAAQ,KAAK,IAAI,GAAnC;AAOd,IAAM,aAAa,wBAAC,SAAiB,SAAS,UAAU,SAAS,iBAA9C;AAOnB,IAAM,cAAc,wBAAC,SAC1B,KAAK,KAAK,IAAI,KACd,KAAK,WAAW,sBAAsB,KACtC,KAAK,WAAW,qBAAqB,GAHZ;AAUpB,IAAM,cAAc,wBAAC,SAAiB,YAAY,KAAK,IAAI,GAAvC;AAOpB,IAAM,mBAAmB,wBAAC,SAAiB,UAAU,KAAK,IAAI,KAAK,KAAK,SAAS,GAAG,GAA3D;AAQzB,IAAM,eAAe,wBAAC,MAAc,YAAwB,QAAQ,SAA/C;AAQrB,IAAM,aAAa,wBAAC,MAAc,UAAoB,QAAQ,OAA3C;AAOnB,IAAM,eAAe,wBAAC,SAAiB,KAAK,WAAW,wBAAwB,GAA1D;AAOrB,IAAM,eAAe,wBAAC,SAAiB,KAAK,WAAW,wBAAwB,GAA1D;AAOrB,IAAM,aAAa,wBAAC,SAAiB,OAAO,OAAO,IAAI,EAAE,SAAS,IAAY,GAA3D;AAQnB,IAAM,gBAAgB,wBAAC,SAAiB,aAAa,UAAU,IAAI,GAA7C;AAOtB,IAAM,gBAAgB,wBAAC,SAAiB,OAAO,OAAO,OAAO,EAAE,SAAS,IAAe,GAAjE;AAOtB,IAAM,aAAa,wBAAC,SAAiB,SAAS,cAA3B;AAMnB,IAAM,wBAAwB,wBAAC,SACpC,SAAS,qDAD0B;AAQ9B,IAAM,mBAAmB,wBAAC,SAC/B,SAAS,2CADqB;AAQzB,IAAM,gBAAgB,wBAAC,SAAiB,SAAS,2BAA3B;AAOtB,IAAM,kBAAkB,wBAAC,SAAiB,SAAS,+BAA3B;AACxB,IAAM,uBAAuB,wBAAC,SACnC,SAAS,6CADyB;AAE7B,IAAM,eAAe,wBAAC,SAAiB,KAAK,SAAS,IAAI,GAApC;AAQrB,IAAM,eAAe,wBAAC,SAAiB;AAC5C,MAAI,aAAa,IAAI,GAAG;AACtB,WAAO,KAAK,UAAU,KAAK,QAAQ,GAAG,IAAI,GAAG,KAAK,YAAY,GAAG,CAAC;EACpE;AACA,SAAO,KAAK,QAAQ,KAAK,EAAE;AAC7B,GAL4B;AAgBrB,SAAS,YAAY,KAAmB;AAC7C,QAAM,EAAE,MAAM,IAAI,sBAAsB,GAAG;AAC3C,MAAI,UAAU,QAAW;AACvB,UAAM,MAAM,mCAAmC;EACjD;AACA,SAAO,UAAU;AACnB;AANgB;AAmBT,SAAS,cAAc,MAAuB;AACnD,SAAO,KAAK,WAAW,2BAA2B;AACpD;AAFgB;AAUT,SAAS,sBAAsB,KAA2B;AAE/D,MAAI,IAAI,KAAK,CAAC,OAAO,GAAG,SAAS,WAAW,GAAG;AAC7C,WAAO,EAAE,OAAO,KAAK,UAAU,IAAI;EACrC;AAIA,QAAM,eAAe,IAAI;IACvB,CAAC,OAAO,GAAG,SAAS,eAAe,GAAG,OAAO,UAAU,GAAG,QAAQ;EACpE;AACA,MAAI,CAAC,cAAc;AACjB,WAAO,EAAE,OAAO,QAAW,UAAU,OAAU;EACjD;AACA,QAAM,KAAK,aAAa,OAAO,SAAS,aAAa,SAAS,aAAa;AAC3E,MAAI,aAAa,GAAG,CAAC,EAAE,IAAI,GAAG;AAC5B,WAAO,EAAE,OAAO,KAAK,UAAU,IAAI;EACrC;AACA,SAAO,EAAE,OAAO,KAAK,UAAU,IAAI;AACrC;AAnBgB;AAkCT,IAAM,UAAU,wBAAC,OAA8B;AACpD,SAAO,IAAI,aAAa,EAAE,EAAE,uBAAuB;AACrD,GAFuB;AAahB,IAAM,UAAU,wBAAC,OAA8B;AACpD,SAAO,IAAI,aAAa,EAAE,EAAE,uBAAuB;AACrD,GAFuB;AAWhB,IAAM,QAAQ,2BAChB,UACkD,EAAE,GAAG,KAAK,IAF5C;AAQd,SAAS,KAAK,IAA0B;AAC7C,SAAO,UAAU,EAAE;AACrB;AAFgB;AIxPT,IAAM,kBAAN,MAAsB;SAAA;;;;;;;;;;EAQlB;;;;EAKT,YAAY,aAA2B;AACrC,UAAM,eAAe,OAAO,OAAO,WAAW;AAC9C,QAAI,aAAa,WAAW,GAAG;AAC7B,YAAM,IAAI,MAAM,wCAAwC;IAC1D;AACA,UAAM,mBAAmB,aAAa;MACpC,CAAC,YAAY,OAAO,YAAY;IAClC,EAAE;AACF,QAAI,qBAAqB,GAAG;AAC1B,YAAM,IAAI,MAAM,gDAAgD;IAClE;AACA,SAAK,UAAU;EACjB;;;;;EAMO,SAAc;AACnB,UAAM,WAAW,OAAO,QAAQ,KAAK,OAAO;AAC5C,UAAM,gBAAgB,SAAS,KAAK,CAAC,SAAS,OAAO,KAAK,CAAC,MAAM,WAAW;AAC5E,QAAI,OAAO,kBAAkB,aAAa;AACxC,aAAO;IACT;AACA,WAAO,cAAc,CAAC;EACxB;;;;;EAMO,gBAAwB;AAC7B,UAAM,WAAW,OAAO,QAAQ,KAAK,OAAO;AAC5C,UAAM,gBAAgB,SAAS,KAAK,CAAC,SAAS,OAAO,KAAK,CAAC,MAAM,WAAW;AAC5E,QAAI,OAAO,kBAAkB,aAAa;AACxC,aAAO;IACT;AACA,WAAO,cAAc,CAAC;EACxB;AACF;ACnEO,IAAK,qBAAL,kBAAKC,wBAAL;AACLA,sBAAAA,oBAAA,MAAA,IAAO,CAAA,IAAP;AACAA,sBAAAA,oBAAA,MAAA,IAAO,CAAA,IAAP;AAFU,SAAAA;AAAA,GAAA,sBAAA,CAAA,CAAA;AAeL,IAAM,cAAN,MAAqB;SAAA;;;EACjB;EAEA;EAET,YAAY,SAA6B,aAAiB;AACxD,QAAI,EAAE,WAAW,qBAAqB;AACpC,YAAM,IAAI,MAAM,6DAA6D;IAC/E;AACA,QAAI,YAAY,GAAyB;AACvC,UAAI,OAAO,gBAAgB,aAAa;AACtC,cAAM,IAAI;UACR;QACF;MACF;AACA,WAAK,OAAO;AACZ,WAAK,OAAO;IACd,OAAO;AACL,WAAK,OAAO;AACZ,WAAK,OAAO;IACd;EACF;;;;;;EAOO,SAAwB;AAC7B,QAAI,KAAK,MAAM;AACb,aAAO;IACT;AACA,WAAO,KAAK;EACd;;;;;EAMO,SAAkB;AACvB,WAAO,EAAE,OAAO,KAAK,SAAS;EAChC;;;;;EAMO,SAAkB;AACvB,WAAO,KAAK,SAAS;EACvB;AACF;ACjEO,IAAK,qBAAL,kBAAKC,wBAAL;AACLA,sBAAAA,oBAAA,IAAA,IAAK,CAAA,IAAL;AACAA,sBAAAA,oBAAA,KAAA,IAAM,CAAA,IAAN;AAFU,SAAAA;AAAA,GAAA,sBAAA,CAAA,CAAA;AAeL,IAAM,cAAN,MAAwB;SAAA;;;EACpB;EAEA;EAET,YAAY,SAA6B,eAAsB;AAC7D,QAAI,EAAE,WAAW,qBAAqB;AACpC,YAAM,IAAI,MAAM,0DAA0D;IAC5E;AACA,QAAI,YAAY,GAAuB;AACrC,WAAK,KAAK;AACV,WAAK,MAAM;IACb,OAAO;AACL,WAAK,KAAK;AACV,WAAK,MAAM;IACb;EACF;;;;;EAMO,SAAgB;AACrB,QAAI,OAAO,KAAK,OAAO,aAAa;AAClC,aAAO,KAAK;IACd;AACA,QAAI,OAAO,KAAK,QAAQ,aAAa;AACnC,aAAO,KAAK;IACd;AACA,UAAM,IAAI,MAAM,wDAAwD;EAC1E;;;;;EAMO,OAAgB;AACrB,WAAO,EAAE,OAAO,KAAK,OAAO;EAC9B;;;;;EAMO,QAAiB;AACtB,WAAO,EAAE,OAAO,KAAK,QAAQ;EAC/B;AACF;AC3DA,IAAM,QAAQ;EACZ,MAAM,wBAAC,MAA2B,MAA2B,QAAgB;AAC3E,QAAI,CAAC,SAAS,KAAK,GAAG,CAAC;AACrB,YAAM,IAAI;QACR,kCAAkC,GAAG,IAAI,KAAK,GAAG,CAAC,4BAA4B,GAAG,IAC/E,KAAK,GAAG,CACV,2BAA2B,OAAO,KAAK,GAAG,CAAC;MAC7C;EACJ,GAPM;EAQN,SAAS,wBAAC,MAA2B,MAA2B,QAAgB;AAC9E,UAAM,IAAI,MAAM,+BAA+B,GAAG,IAAI,KAAK,GAAG,CAAC,aAAa,GAAG,IAAI,KAAK,GAAG,CAAC,EAAE;EAChG,GAFS;AAGX;AAUe,SAAR,UACL,MACA,MACA,UACA;AAEA,SAAO,OAAO,QAAQ,IAAI,EAAE;IAC1B,CAAC,KAAK,CAAC,KAAK,KAAK,MAAkB;AACjC,YAAM,SAAS,YAAY,KAAK,GAAG;AAEnC,UAAI,EAAE,OAAO,SAAS,CAAC,UAAU;AAE/B,YAAI,GAAG,IAAI;AACX,eAAO;MACT;AAEA,UAAI,WAAW,UAAU;AACvB,YAAI,MAAM,QAAQ,KAAK,GAAG,CAAC,GAAG;AAE5B,gBAAM,WAAW;YACf,KAAK,GAAG;YACR,KAAK,GAAG,EAAE,IAAI,CAAC,MAAW,MAAM;UAClC;AACA,cAAI,GAAG,IAAI,OAAO,OAAO,QAAQ,EAAE,KAAK,EAAE;AAC1C,iBAAO;QACT;AACA,cAAM,KAAK,MAAM,MAAM,GAAG;AAC1B,YAAI,GAAG,IAAI,kBAAkB,KAAK;AAClC,eAAO;MACT;AACA,UAAI,WAAW,UAAU;AACvB,cAAM,KAAK,MAAM,MAAM,GAAG;AAC1B,YAAI,GAAG,IAAI,OAAO,KAAK;AACvB,eAAO;MACT;AACA,UAAI,OAAO,WAAW,YAAY;AAChC,YAAI,GAAG,IAAI,OAAO,KAAK;AACvB,eAAO;MACT;AACA,UAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,cAAM,WAAW,UAAU,KAAK,GAAG,GAAG,QAAQ,OAAO,CAAC,CAAC;AACvD,YAAI,GAAG,IAAI,OAAO,OAAO,QAAQ;AACjC,eAAO;MACT;AACA,UAAI,OAAO,WAAW,UAAU;AAC9B,YAAI,GAAG,IAAI,UAAU,KAAK,GAAG,GAAG,MAAM;AACtC,eAAO;MACT;AAEA,YAAM,QAAQ,MAAM,MAAM,GAAG;AAC7B,aAAO;IACT;IACA,CAAC;EACH;AACF;AAtDO;ACrBA,IAAM,aAAN,MAA+C;SAAA;;;EACpD;EAEA,YAAY,KAAU;AACpB,SAAK,MAAM;EACb;;;;;;;EAQO,mBAAmB,WAAwB;AAChD,WAAO,UAAU,OAAO,OAAO,CAAC,KAAK,UAAW,CAAC,MAAM,MAAM,IAAI,IAAI,MAAM,IAAI,KAAM,CAAC;EACxF;;;;;;EAOO,UAAU,MAAuC;AACtD,WAAO,KAAK,IAAI,KAAK,CAAC,OAAO,GAAG,SAAS,IAAI;EAC/C;;;;;EAMO,kBAAkB;AACvB,WAAO,KAAK;EACd;AACF;AC3BO,IAAM,aAAN,MAA+C;SAAA;;;EACpD;EAEA,YAAY,KAAU;AACpB,SAAK,MAAM;EACb;;;;;;EAOO,mBAAmB,WAAwB;AAChD,WAAO,UAAU,OAAO;EAC1B;;;;;;EAOO,UAAU,MAAuC;AACtD,UAAM,OAAO,KAAK,IAAI;MACpB,CAAC,OAA0D,GAAG,SAAS;IACzE;AACA,WAAO,KAAK,MAAM,KAAK,CAAC,OAAO,GAAG,SAAS,IAAI;EACjD;;;;;EAMO,kBAAuB;AAC5B,WAAO,KAAK,IAAI,QAAQ,CAAC,MAA4D;AACnF,UAAI,EAAE,SAAS,aAAa;AAC1B,eAAO,EAAE;MACX;AACA,aAAO;IACT,CAAC;EACH;AACF;AC5CO,SAAS,gBAAgB,KAA8B;AAC5D,QAAM,UAAU,cAAc,GAAG;AACjC,MAAI,YAAY,KAAK,YAAY,GAAG;AAClC,WAAO,IAAI,WAAW,GAAG;EAC3B;AACA,MAAI,YAAY,GAAG;AACjB,WAAO,IAAI,WAAW,GAAG;EAC3B;AACA,QAAM,MAAM,2BAA2B,OAAO,EAAE;AAClD;AATgB;AAWT,SAAS,cAAc,KAAU;AACtC,MAAI,IAAI,KAAK,CAAC,OAAO,GAAG,SAAS,WAAW;AAAG,WAAO;AACtD,MAAI,YAAY,GAAG;AAAG,WAAO;AAC7B,SAAO;AACT;AAJgB;AAMT,SAAS,qBACd,QACA,cACA,WACA;AAEA,SAAO,WAAW,iBAAiB,CAAC,aAAa,CAAC,aAAa;AACjE;AAPgB;ACpBhB,SAAS,gBAAgB,YAAyB;AAChD,QAAM,OAAO,WAAW,UAAU,GAAG,WAAW,QAAQ,GAAG,CAAC;AAC5D,QAAM,OAAO,WAAW,UAAU,KAAK,SAAS,IAAI,MAAM;AAC1D,SAAO,EAAE,MAAM,KAAK;AACtB;AAJS;AAMT,SAAS,cAAc,GAAW;AAChC,MAAI,CAAC,EAAE,SAAS,GAAG;AAAG,WAAO,EAAE,UAAU,CAAC,GAAG,QAAQ,EAAE;AACvD,QAAM,WAAqB,CAAC;AAC5B,MAAI,SAAS;AACb,MAAI,IAAI;AACR,SAAO,IAAI,EAAE,QAAQ;AACnB,QAAI,EAAE,CAAC,MAAM,KAAK;AAChB,UAAI,UAAU;AACd,YAAM,WAAW;AACjB;AACA,aAAO,SAAS;AACd,YAAI,EAAE,CAAC,MAAM;AAAK;AAClB,YAAI,EAAE,CAAC,MAAM;AAAK;AAClB;MACF;AACA,eAAS,KAAK,EAAE,UAAU,UAAU,CAAC,CAAC;AACtC,gBAAU;AACV;IACF,OAAO;AACL,gBAAU,EAAE,CAAC;IACf;AACA;EACF;AAEA,SAAO;IACL;IACA;EACF;AACF;AA5BS;AA8BT,SAAS,mBAAmB,MAAc;AACxC,QAAM,YAAY,KAAK,QAAQ,OAAO,EAAE,EAAE,MAAM,GAAG,EAAE;AAGrD,QAAM,EAAE,UAAU,OAAO,IAAI,cAAc,SAAS;AAGpD,MAAI,aAAa,OAAO,MAAM,GAAG,EAAE,IAAI,CAAC,OAAO;AAC7C,WAAO,SAAS,SAAS,GAAG,QAAQ,KAAK,SAAS,MAAM,CAAW,IAAI;EACzE,CAAC;AAGD,MAAI,iBAAiB,IAAI,GAAG;AAC1B,iBAAa,WAAW,OAAO,CAAC,KAAK,OAAO;AAC1C,aAAO,IAAI,OAAO,gBAAgB,EAAE,CAAC;IACvC,GAAG,CAAC,CAAC;EACP;AAEA,SAAO;AACT;AAnBS;AAqBT,SAAS,iBAAiB,OAAe,MAAc,OAAuB;AAC5E,WAAS,IAAI,GAAG,UAAU,GAAG,IAAI,MAAM,QAAQ,KAAK;AAClD,QAAI,MAAM,CAAC,MAAM,MAAM;AACrB;IACF,WAAW,MAAM,CAAC,MAAM,SAAS,EAAE,YAAY,GAAG;AAChD,aAAO;IACT;EACF;AACA,SAAO,OAAO;AAChB;AATS;AAWT,SAAS,mBAAmB,MAAwB;AAElD,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE;AAC9B,QAAM,SAAmB,CAAC;AAE1B,MAAI,eAAuB;AAC3B,MAAI;AAEJ,SAAO,eAAe,MAAM,QAAQ;AAClC,YAAQ,MAAM;MAEZ,KAAK,MAAM,YAAY,MAAM,KAAK;AAChC,qBAAa,eAAe,iBAAiB,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI;AACpF;MACF;MACA,MAAK,MAAM,WAAW,2BAA2B,YAAY,KAC3D,MAAM,WAAW,yBAAyB,YAAY,KACtD,MAAM,WAAW,2BAA2B,YAAY,IAAG;AAC3D,qBAAa,eAAe,iBAAiB,MAAM,MAAM,YAAY,GAAG,KAAK,GAAG,IAAI;AACpF;MACF;MACA,SAAS;AACP,cAAM,aAAa,MAAM,QAAQ,KAAK,YAAY;AAClD,qBAAa,eAAe,KAAK,aAAa,OAAO;MACvD;IACF;AAEA,WAAO,KAAK,MAAM,MAAM,cAAc,UAAU,CAAC;AACjD,mBAAe,aAAa;EAC9B;AAEA,SAAO;AACT;AAhCS;AAuCM,SAAR,wBAAyC,MAAmC;AACjF,MAAI,aAAa,IAAI,GAAG;AACtB,WAAO,mBAAmB,IAAI;EAChC;AACA,SAAO,mBAAmB,IAAI;AAChC;AALO;ACjFP,SAAS,UAAU,KAAa;AAC9B,SAAO;IACL,uCAAuC,GAAG;EAC5C;AACF;AAJS;AAMT,SAAS,UAAU,KAAa;AAC9B,SAAO;IACL,uCAAuC,GAAG;EAC5C;AACF;AAJS;AAMM,SAAR,gBACL,iBACA,aACA,SACA,OACQ;AACR,QAAM,aAAa,wBAAC,eAAoB,YAAyB;AAC/D,QAAI,YAAY,OAAO,GAAG;AACxB,aAAO,WAAW,eAAe,OAAO;IAC1C;AACA,QAAI,WAAW,SAAS,KAAK,GAAG;AAC9B,YAAM,SAAS,MAAM,OAAO;AAE5B,aAAO,UAAU,eAAe,MAAM;IACxC;AACA,QAAI,YAAY,OAAO,GAAG;AACxB,aAAO,WAAW,eAAe,OAAO;IAC1C;AACA,QAAI,iBAAiB,OAAO,GAAG;AAC7B,aAAO;IACT;AACA,QAAI,cAAc,OAAO,GAAG;AAC1B,aAAO;IACT;AACA,QAAI,gBAAgB,OAAO,GAAG;AAC5B,aAAO;IACT;AACA,QAAI,qBAAqB,OAAO,GAAG;AACjC,aAAO;IACT;AACA,QAAI,aAAa,UAAU,OAAO,GAAG;AACnC,YAAM,OAAO;AACb,UAAI,OAAO,SAAS,UAAU;AAE5B,eAAO;MACT;AACA,UAAI,EAAE,SAAS,QAAQ,UAAU,OAAO;AACtC,cAAM,UAAU,OAAO;MACzB;AACA,aAAO,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK;IAC1C;AACA,QAAI,aAAa,UAAU,OAAO,GAAG;AACnC,YAAM,OAAO;AACb,UAAI,OAAO,SAAS,UAAU;AAE5B,eAAO;MACT;AACA,UAAI,CAAC,CAAC,SAAS,SAAS,SAAS,OAAO,EAAE,MAAM,CAAC,QAAQ,OAAO,IAAI,GAAG;AACrE,cAAM,UAAU,OAAO;MACzB;AACA,aAAO,EAAE,OAAO,KAAK,OAAO,OAAO,KAAK,OAAO,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM;IACtF;AACA,QAAI,aAAa,SAAS,OAAO,GAAG;AAClC,YAAM,cAAc,QAAQ,OAAO,EAAE;AAErC,aAAO,YAAY,eAAe,WAAW;IAC/C;AAEA,WAAO;EACT,GArDmB;AAuDnB,QAAM,cAAc,wBAAC,kBAAiC,cAAkC;AACtF,UAAM,iBAAiB,UAAU,OAAO,CAAC,eAAe,aAAa;AACnE,YAAM,cAAc,wBAAC,UACnB,OAAO,eAAe,eAAe,SAAS,MAAM;QAClD,YAAY;QACZ,OAAO,SAAS,iBAAiB,SAAS,IAAI;MAChD,CAAC,GAJiB;AAMpB,UAAI,iBAAiB,SAAS,IAAI,MAAM,aAAa;AACnD,YAAI,aAAa,SAAS,IAAI,KAAK,CAAC,MAAM,SAAS,IAAI,GAAG;AACxD,gBAAM,MAAM,2CAA2C,SAAS,IAAI,IAAI;QAC1E;MACF;AACA,kBAAY,WAAW,iBAAiB,SAAS,IAAI,GAAG,SAAS,IAAI,CAAC;AACtE,aAAO;IACT,GAAG,CAAC,CAAC;AACL,WAAO;EACT,GAjBoB;AAmBpB,WAAS,WAAW,SAA8B,UAAuC;AACvF,UAAM,cAAc,aAAa,QAAQ;AACzC,QAAI,SAAS,OAAO,GAAG;AACrB,aAAO;IACT;AACA,WAAO,QAAQ,IAAI,CAAC,WAAW,WAAW,QAAQ,WAAW,CAAC;EAChE;AANS;AAQT,WAAS,WAAW,kBAAiC,UAA0B;AAC7E,UAAM,WAAW,wBAAwB,QAAQ;AACjD,UAAM,iBAAiB,SAAS,OAAO,CAAC,eAAuB,eAAoB,UAAU;AAC3F,YAAM,YAAsB,OAAO,KAAK,gBAAgB;AACxD,YAAM,cAAc,wBAAC,UACnB,OAAO,eAAe,eAAe,MAAM,SAAS,GAAG;QACrD,YAAY;QACZ,OAAO,SAAS,iBAAiB,UAAU,KAAK,CAAC;MACnD,CAAC,GAJiB;AAKpB,YAAM,UAAkB,eAAe,OAAO,cAAc,OAAO;AACnE,kBAAY,WAAW,iBAAiB,UAAU,KAAK,CAAC,GAAG,OAAO,CAAC;AACnE,aAAO;IACT,GAAG,CAAC,CAAC;AACL,WAAO;EACT;AAdS;AAgBT,QAAM,YAAY,wBAAC,kBAA6B,cAAmC;AACjF,QAAI,aAAa,UAAU,IAAI,GAAG;AAChC,YAAM,kBAAkB;AACxB,YAAM,eAAuB,UAAU,KAAK;QAC1C,UAAU,KAAK,QAAQ,GAAG,IAAI;QAC9B,UAAU,KAAK,YAAY,GAAG;MAChC;AACA,YAAM,gBAAwB,UAAU,KAAK;QAC3C,UAAU,KAAK,QAAQ,GAAG,IAAI;QAC9B,UAAU,KAAK,YAAY,GAAG;MAChC;AACA,UAAI,gBAAgB,KAAK,GAAG;AAC1B,eAAO,IAAI;UAAA;UAET,WAAW,iBAAiB,OAAO,GAAG,YAAY;QACpD;MACF;AACA,aAAO,IAAI;QAAA;QAET,WAAW,iBAAiB,OAAO,GAAG,aAAa;MACrD;IACF;AACA,QAAI,aAAa,UAAU,IAAI,GAAG;AAChC,YAAM,kBAAkB;AACxB,YAAM,iBAAyB,UAAU,KAAK;QAC5C,UAAU,KAAK,QAAQ,GAAG,IAAI;QAC9B,UAAU,KAAK,YAAY,GAAG;MAChC;AACA,UAAI,gBAAgB,OAAO,GAAG;AAC5B,eAAO,IAAI;UAAA;UAET,WAAW,gBAAgB,OAAO,GAAG,cAAc;QACrD;MACF;AAEA,aAAO,IAAI,YAAA,GAA0C,CAAC,CAAC;IACzD;AAEA,UAAM,sBAAsB;AAC5B,UAAM,WAAW,OAAO,QAAQ,oBAAoB,OAAO;AAC3D,UAAM,aAAa,SAAS,IAAI,CAAC,YAAY;AAC3C,UAAI,OAAO,QAAQ,CAAC,MAAM,aAAa;AACrC,eAAO;MACT;AACA,YAAM,cAAsB,UAAU,KAAK;QACzC,UAAU,KAAK,YAAY,GAAG,IAAI;QAClC,UAAU,KAAK,YAAY,GAAG;MAChC;AACA,UAAI,gBAAgB,MAAM;AACxB,eAAO;MACT;AACA,aAAO,CAAC,QAAQ,CAAC,GAAG,WAAW,oBAAoB,OAAO,GAAG,WAAW,CAAC;IAC3E,CAAC;AACD,WAAO,IAAI,gBAAgB,OAAO,YAAY,UAAU,CAAC;EAC3D,GAtDkB;AAyDlB,QAAM,qBAAqB,YAAY,OAAO,CAAC,eAAe,aAAa;AACzE,UAAM,cAAc,wBAAC,UACnB,OAAO,eAAe,eAAe,SAAS,MAAM;MAClD,YAAY;MACZ;IACF,CAAC,GAJiB;AAKpB,QAAI,MAAM,SAAS,IAAI,KAAK,CAAC,aAAa,SAAS,IAAI,GAAG;AACxD,aAAO;IACT;AACA,gBAAY,WAAW,gBAAgB,SAAS,IAAI,GAAG,SAAS,IAAI,CAAC;AACrE,WAAO;EACT,GAAG,CAAC,CAAC;AACL,SAAO;AACT;AA9KO;ACKP,SAAS,eAAe,MAAc,KAAuC;AAC3E,UAAQ,MAAM;IACZ,KAAK,aAAa,UAAU,IAAI;AAC9B,aAAO,IAAI,aAAa,GAAG,EAAE,aAAa;IAC5C,KAAK,aAAa,UAAU,IAAI;AAC9B,aAAO,IAAI,aAAa,GAAG,EAAE,aAAa;IAC5C,KAAK,cAAc,IAAI;AACrB,aAAO,kBAAkB,IAAI,SAAS,CAAC;IACzC,KAAK,qBAAqB,IAAI,GAAG;AAC/B,YAAM,YAAY,gBAAgB,MAAM,GAAG,CAAC,EAAE,SAAS,KAAK,GAAG;AAC/D,YAAM,aAAa,QAAQ,aAAa,UAAU,MAAM,GAAG,CAAC,CAAC;AAC7D,YAAM,aAAa,QAAQ,aAAa,UAAU,MAAM,GAAG,GAAG,CAAC,CAAC;AAChE,aAAO;QACL,KAAK,WAAW,GAAG;QACnB,KAAK,WAAW,IAAI;QACpB,KAAK,WAAW,GAAG;QACnB,KAAK,WAAW,IAAI;MACtB;IACF;IACA;AACE,aAAO,KAAK,GAAG;EACnB;AACF;AAtBS;AA8BT,SAAS,WAAW,SAAiB,SAA2B;AAC9D,QAAM,cAAc,wBAAwB,OAAO;AACnD,QAAM,WAAW,OAAO,OAAO,OAAO;AAEtC,MAAI,SAAS,WAAW,YAAY,QAAQ;AAC1C,UAAM;MACJ;kBACY,QAAQ;kBACR,WAAW;IACzB;EACF;AAEA,SAAO,YAAY,IAAI,CAAC,IAAS,OAAe;AAC9C,WAAO;MACL,SAAS,SAAS,EAAE;MACpB,MAAM,GAAG,QAAQ;IACnB;EACF,CAAC;AACH;AAlBS;AAoBT,SAAS,eAAe,SAA2B;AACjD,QAAM,cAAyB,oBAAoB,OAAO;AAC1D,SAAO;IACL,YAAY,KAAK,OAAO,SAAS;IACjC,GAAG,YAAY,KAAK,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC7C,YAAY,aAAa,SAAS;IAClC,YAAY,iBAAiB,SAAS;EACxC;AACF;AARS;AAmBT,SAAS,mBACP,SAOA,MACA,SACA,OACmB;AACnB,MAAI,YAAY,QAAW;AACzB,UAAM,MAAM,8BAA8B,IAAI,EAAE;EAClD;AAGA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,UAAM,SAAmB,CAAC;AAC1B,WAAO,KAAK,KAAK,QAAQ,MAAM,CAAC;AAChC,UAAM,YAAY,aAAa,IAAI;AAEnC,WAAO,QAAQ,OAAO,CAAC,KAAK,OAAO;AACjC,aAAO,IAAI,OAAO,mBAAmB,IAAI,WAAW,SAAS,KAAK,CAAC;IACrE,GAAG,MAAM;EACX;AAGA,MAAI,QAAQ,IAAI,KAAK,QAAQ,IAAI,EAAE,QAAQ,QAAQ;AACjD,QAAI,aAAa,UAAU,IAAI,GAAG;AAChC,aAAO,IAAI,aAAa,OAAc,EAAE,aAAa;IACvD;AACA,QAAI,aAAa,UAAU,IAAI,GAAG;AAChC,aAAO,IAAI,aAAa,OAAc,EAAE,aAAa;IACvD;AACA,QAAI,SAAS;AACX,aAAO,eAAe,MAAM,OAAuB;AAErD,QAAI,SAAS;AAA+B,aAAO,eAAe,OAAiB;AAEnF,UAAM,EAAE,QAAQ,IAAI,QAAQ,IAAI;AAChC,UAAM,aAAa;AAEnB,WAAO,QAAQ,OAAO,CAAC,KAAK,OAAiB;AAC3C,aAAO,IAAI,OAAO,mBAAmB,WAAW,GAAG,IAAI,GAAG,GAAG,MAAM,SAAS,KAAK,CAAC;IACpF,GAAG,CAAC,CAAa;EACnB;AAEA,MAAI,YAAY,IAAI,GAAG;AACrB,UAAM,SAAS,WAAW,SAAmB,IAAI;AAEjD,WAAO,OAAO,OAAO,CAAC,KAAK,OAAe;AACxC,YAAM,aAAa,mBAAmB,GAAG,SAAS,GAAG,MAAM,SAAS,KAAK;AACzE,aAAO,IAAI,OAAO,UAAU;IAC9B,GAAG,CAAC,CAAa;EACnB;AAEA,MAAI,aAAa,UAAU,IAAI,GAAG;AAChC,WAAO,IAAI,aAAa,OAAc,EAAE,aAAa;EACvD;AAEA,MAAI,aAAa,UAAU,IAAI,GAAG;AAChC,WAAO,IAAI,aAAa,OAAc,EAAE,aAAa;EACvD;AAEA,MAAI,WAAW,MAAM,KAAK,GAAG;AAC3B,UAAM,EAAE,SAAS,IAAI,MAAM,IAAI;AAE/B,QAAI,aAAa,IAAI,GAAG;AACtB,YAAM,WAAW;AACjB,UAAI,SAAS,OAAO,GAAG;AACrB,cAAMC,mBAAkB,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,MAAM;AAC1E,YAAI,OAAOA,qBAAoB,aAAa;AAC1C,gBAAM,MAAM,8CAA8C;QAC5D;AACA,cAAM,kBAAkBA,iBAAgB;AACxC,YAAI,oBAAoB,MAAM;AAC5B,iBAAA,GAA+B,SAAS;QAC1C;AACA,cAAMC,mBAAkB;UACtB,SAAS,OAAO;UAChB;UACA;UACA;QACF;AACA,YAAI,MAAM,QAAQA,gBAAe,GAAG;AAClC,iBAAO,CAAA,GAAyB,SAAS,GAAG,GAAGA,gBAAe;QAChE;AACA,eAAO,CAAA,GAAyB,SAAS,GAAGA,gBAAe;MAC7D;AACA,aAAA,GAA+B,SAAS;IAC1C;AAEA,QAAI,aAAa,IAAI,GAAG;AACtB,YAAM,WAAW;AACjB,UAAI,SAAS,KAAK,GAAG;AACnB,cAAMD,mBAAkB,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,IAAI;AACxE,YAAI,OAAOA,qBAAoB,aAAa;AAC1C,gBAAM,MAAM,4CAA4C;QAC1D;AACA,cAAM,gBAAgBA,iBAAgB;AACtC,YAAI,kBAAkB,MAAM;AAC1B,iBAAA,GAA6B,SAAS;QACxC;AACA,cAAMC,mBAAkB;UACtB,SAAS,OAAO;UAChB;UACA;UACA;QACF;AACA,YAAI,MAAM,QAAQA,gBAAe,GAAG;AAClC,iBAAO,CAAA,GAAuB,SAAS,GAAG,GAAGA,gBAAe;QAC9D;AACA,eAAO,CAAA,GAAuB,SAAS,GAAGA,gBAAe;MAC3D;AAEA,YAAMD,mBAAkB,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,KAAK;AACzE,UAAI,OAAOA,qBAAoB,aAAa;AAC1C,cAAM,MAAM,6CAA6C;MAC3D;AACA,YAAM,iBAAiBA,iBAAgB;AACvC,UAAI,mBAAmB,MAAM;AAC3B,eAAA,GAA8B,SAAS;MACzC;AACA,YAAMC,mBAAkB,mBAAmB,SAAS,OAAO,GAAG,gBAAgB,SAAS,KAAK;AAC5F,UAAI,MAAM,QAAQA,gBAAe,GAAG;AAClC,eAAO,CAAA,GAAwB,SAAS,GAAG,GAAGA,gBAAe;MAC/D;AACA,aAAO,CAAA,GAAwB,SAAS,GAAGA,gBAAe;IAC5D;AAEA,UAAM,SAAS;AACf,UAAM,gBAAwB,OAAO,cAAc;AACnD,UAAM,kBAAkB,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,aAAa;AACjF,QAAI,OAAO,oBAAoB,aAAa;AAC1C,YAAM,MAAM,kCAAkC,aAAa,YAAY;IACzE;AACA,UAAM,oBAAoB,gBAAgB;AAC1C,UAAM,mBAAmB,SAAS,UAAU,CAAC,YAAY,QAAQ,SAAS,aAAa;AACvF,QAAI,sBAAsB,MAAM;AAC9B,aAAO,iBAAiB,SAAS;IACnC;AACA,UAAM,kBAAkB,mBAAmB,OAAO,OAAO,GAAG,mBAAmB,SAAS,KAAK;AAC7F,QAAI,MAAM,QAAQ,eAAe,GAAG;AAClC,aAAO,CAAC,iBAAiB,SAAS,GAAG,GAAG,eAAe;IACzD;AACA,WAAO,CAAC,iBAAiB,SAAS,GAAG,eAAe;EACtD;AAEA,MAAI,cAAc,IAAI,GAAG;AACvB,WAAO,eAAe,aAAa,IAAI,GAAG,OAAuB;EACnE;AAEA,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,MAAM,aAAa,OAAO,oCAAoC,IAAI,EAAE;EAC5E;AACA,SAAO,eAAe,MAAM,OAAO;AACrC;AA7JS;AAwKF,SAAS,mBACd,cACA,OACA,SACA,OACmB;AACnB,QAAM,EAAE,MAAM,KAAK,IAAI;AACvB,MAAI,EAAE,MAAM,IAAI,aAAa,KAAK;AAElC,UAAQ,MAAM;IAEZ,KAAK,YAAY,IAAI;AACnB,UAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,CAAC,OAAO,KAAK,GAAG;AAC3C,cAAM,MAAM,0BAA0B,IAAI,oCAAoC,KAAK,EAAE;MACvF;AACA,UAAI,SAAS,KAAK,GAAG;AAEnB,gBAAQ,gBAAgB,KAAK;MAC/B;AACA,aAAO,mBAAmB,OAAO,MAAM,MAAM,SAAS,KAAK;IAC7D,KAAK,cAAc,IAAI;AACrB,aAAO,eAAe,aAAa,IAAI,GAAG,KAAK;IACjD,KAAK,SAAS;AACZ,aAAO,eAAe,MAAM,KAAK;IAEnC,MAAK,aAAa,MAAM,OAAO,KAC7B,YAAY,IAAI,KAChB,aAAa,UAAU,IAAI,KAC3B,aAAa,UAAU,IAAI;AAC3B,aAAO,mBAAmB,OAAwC,MAAM,SAAS,KAAK;IAGxF,KAAK,WAAW,MAAM,KAAK;AACzB,aAAO;QACL;QACA;QACA;QACA;MACF;IAGF;AACE,aAAO,eAAe,MAAM,KAAK;EACrC;AACF;AA5CgB;AC7OhB,SAASC,gBAAe,MAAc,IAAsB;AAC1D,MAAI;AACJ,UAAQ,MAAM;IACZ,KAAK,WAAW,IAAI;AAClB,aAAO,GAAG,KAAK,EAAE;AACjB,aAAO,QAAQ,OAAO,IAAI,CAAC;IAC7B,KAAK,aAAa,UAAU,IAAI;AAC9B,YAAM,MAAM,GAAG,KAAK,EAAE;AACtB,YAAM,OAAO,GAAG,KAAK,EAAE;AACvB,aAAO,IAAI,aAAa,KAAK,IAAI,EAAE,SAAS;IAC9C,KAAK,aAAa,UAAU,IAAI;AAC9B,YAAM,QAAQ,GAAG,KAAK,EAAE;AACxB,YAAM,QAAQ,GAAG,KAAK,EAAE;AACxB,YAAM,QAAQ,GAAG,KAAK,EAAE;AACxB,YAAM,QAAQ,GAAG,KAAK,EAAE;AACxB,aAAO,IAAI,aAAa,OAAO,OAAO,OAAO,KAAK,EAAE,SAAS;IAC/D,KAAK,SAAS;AACZ,aAAO,GAAG,KAAK,EAAE;AACjB,aAAO,OAAO,IAAI;IACpB,KAAK,SAAS;AACZ,aAAO,GAAG,KAAK,EAAE;AACjB,aAAO,kBAAkB,IAAI;IAC/B,KAAK,qBAAqB,IAAI;AAC5B,YAAM,OAAO,gBAAgB,GAAG,KAAK,EAAE,KAAK,EAAE,SAAS,IAAI,GAAG;AAC9D,YAAM,QAAQ,gBAAgB,GAAG,KAAK,EAAE,KAAK,EAAE,SAAS,IAAI,GAAG;AAC/D,YAAM,OAAO,gBAAgB,GAAG,KAAK,EAAE,KAAK,EAAE,SAAS,IAAI,GAAG;AAC9D,YAAM,QAAQ,gBAAgB,GAAG,KAAK,EAAE,KAAK,EAAE,SAAS,IAAI,GAAG;AAC/D,YAAM,OAAO,OAAO,aAAa,QAAQ,OAAO,QAAQ,IAAI,CAAC;AAC7D,aAAO;IACT;AACE,aAAO,GAAG,KAAK,EAAE;AACjB,aAAO,OAAO,IAAI;EACtB;AACF;AAjCSA;AA4CT,SAAS,mBACP,kBACA,SACA,SACA,OAC2D;AAC3D,MAAI,QAAQ,SAAS,MAAM;AACzB,WAAO,CAAC;EACV;AAEA,MAAI,aAAa,UAAU,QAAQ,IAAI,GAAG;AACxC,UAAM,MAAM,iBAAiB,KAAK,EAAE;AACpC,UAAM,OAAO,iBAAiB,KAAK,EAAE;AACrC,WAAO,IAAI,aAAa,KAAK,IAAI,EAAE,SAAS;EAC9C;AAEA,MAAI,aAAa,UAAU,QAAQ,IAAI,GAAG;AACxC,UAAM,QAAQ,iBAAiB,KAAK,EAAE;AACtC,UAAM,QAAQ,iBAAiB,KAAK,EAAE;AACtC,UAAM,QAAQ,iBAAiB,KAAK,EAAE;AACtC,UAAM,QAAQ,iBAAiB,KAAK,EAAE;AACtC,WAAO,IAAI,aAAa,OAAO,OAAO,OAAO,KAAK,EAAE,SAAS;EAC/D;AAEA,MAAI,gBAAgB,QAAQ,IAAI,GAAG;AACjC,UAAM,mBAAmC,CAAC;AAC1C,UAAM,gBAAgB,OAAO,iBAAiB,KAAK,EAAE,KAAK;AAC1D,WAAO,iBAAiB,SAAS,eAAe;AAC9C,uBAAiB,KAAK,MAAM,iBAAiB,KAAK,EAAE,KAAK,CAAC;IAC5D;AACA,UAAM,eAAe,MAAM,iBAAiB,KAAK,EAAE,KAAK;AACxD,UAAM,mBAAmB,OAAO,iBAAiB,KAAK,EAAE,KAAK;AAC7D,UAAM,cAAyB;MAC7B,MAAM;MACN;MACA;IACF;AACA,WAAO,oBAAoB,WAAW;EACxC;AAGA,MAAI,YAAY,QAAQ,IAAI,GAAG;AAE7B,UAAM,gBAA+E,CAAC;AACtF,UAAM,KAAe,EAAE,MAAM,IAAI,MAAM,aAAa,QAAQ,IAAI,EAAE;AAClE,UAAM,MAAM,OAAO,iBAAiB,KAAK,EAAE,KAAK;AAChD,WAAO,cAAc,SAAS,KAAK;AACjC,oBAAc,KAAK,mBAAmB,kBAAkB,IAAI,SAAS,KAAK,CAAC;IAC7E;AACA,WAAO;EACT;AAGA,MAAI,cAAc,QAAQ,IAAI,GAAG;AAG/B,UAAM,KAAe,EAAE,MAAM,IAAI,MAAM,aAAa,QAAQ,IAAI,EAAE;AAElE,WAAO,mBAAmB,kBAAkB,IAAI,SAAS,KAAK;EAChE;AAGA,MAAI,WAAW,QAAQ,QAAQ,WAAW,QAAQ,QAAQ,IAAI,GAAG;AAC/D,QAAI,QAAQ,SAAS,2CAA2C;AAC9D,aAAOA,gBAAe,QAAQ,MAAM,gBAAgB;IACtD;AACA,WAAO,QAAQ,QAAQ,IAAI,EAAE,QAAQ,OAAO,CAAC,KAAK,OAAO;AACvD,UAAI,GAAG,IAAI,IAAI,mBAAmB,kBAAkB,IAAI,SAAS,KAAK;AACtE,aAAO;IACT,GAAG,CAAC,CAAQ;EACd;AAGA,MAAI,SAAS,QAAQ,QAAQ,SAAS,MAAM,QAAQ,IAAI,GAAG;AACzD,UAAM,aAAqB,OAAO,iBAAiB,KAAK,EAAE,KAAK;AAC/D,UAAM,UAAU,MAAM,QAAQ,IAAI,EAAE,SAAS,OAAO,CAAC,KAAK,SAAS,QAAQ;AACzE,UAAI,QAAQ,YAAY;AACtB,YAAI,QAAQ,IAAI,IAAI;UAClB;UACA,EAAE,MAAM,IAAI,MAAM,QAAQ,KAAK;UAC/B;UACA;QACF;AACA,eAAO;MACT;AACA,UAAI,QAAQ,IAAI,IAAI;AACpB,aAAO;IACT,GAAG,CAAC,CAAiB;AAErB,QAAI,QAAQ,KAAK,WAAW,sBAAsB,GAAG;AACnD,YAAM,UAAU,eAAA,IAAyC,QAAQ,OAAO;AACxE,aAAO,IAAI,YAAoB,YAAY,OAAO;IACpD;AAEA,QAAI,QAAQ,KAAK,WAAW,sBAAsB,GAAG;AACnD,UAAI;AACJ,UAAI,eAAA,GAAsC;AACxC,kBAAU,QAAQ;MACpB,OAAO;AACL,kBAAU,QAAQ;MACpB;AACA,aAAO,IAAI,YAA4B,YAAY,OAAO;IAC5D;AAEA,UAAM,aAAa,IAAI,gBAAgB,OAAO;AAC9C,WAAO;EACT;AAGA,MAAI,YAAY,QAAQ,IAAI,GAAG;AAC7B,UAAM,cAAc,wBAAwB,QAAQ,IAAI;AACxD,WAAO,YAAY,OAAO,CAAC,KAAK,IAAS,QAAQ;AAC/C,YAAM,OAAO,IAAI,OAAO,GAAG,OAAO;AAClC,YAAM,OAAO,IAAI,OAAO,GAAG,OAAO;AAClC,YAAM,KAAK,EAAE,MAAM,KAAK;AACxB,UAAI,IAAI,IAAI,mBAAmB,kBAAkB,IAAI,SAAS,KAAK;AACnE,aAAO;IACT,GAAG,CAAC,CAAQ;EACd;AAGA,MAAI,YAAY,QAAQ,IAAI,GAAG;AAE7B,UAAM,gBAA+E,CAAC;AACtF,UAAM,KAAK,EAAE,MAAM,IAAI,MAAM,aAAa,QAAQ,IAAI,EAAE;AACxD,UAAM,MAAM,OAAO,iBAAiB,KAAK,EAAE,KAAK;AAChD,WAAO,cAAc,SAAS,KAAK;AACjC,oBAAc,KAAK,mBAAmB,kBAAkB,IAAI,SAAS,KAAK,CAAC;IAC7E;AACA,WAAO;EACT;AAGA,SAAOA,gBAAe,QAAQ,MAAM,gBAAgB;AACtD;AAtIS;AAiJM,SAAR,eACL,kBACAC,SACA,SACA,OACA,cACK;AACL,QAAM,EAAE,MAAM,KAAK,IAAIA;AACvB,MAAI;AAEJ,UAAQ,MAAM;IACZ,KAAK,MAAM,IAAI;AACb,aAAO,iBAAiB,KAAK,EAAE;AAC/B,aAAO,OAAO,IAAI;IAEpB,MAAM,WAAW,QAAQ,WAAY,YAAY,IAAI;AACnD,aAAO,mBAAmB,kBAAkBA,SAAQ,SAAS,KAAK;IAEpE,MAAK,SAAS,WAAW,MAAM,KAAK;AAClC,aAAO,mBAAmB,kBAAkBA,SAAQ,SAAS,KAAK;IAEpE,KAAK,YAAY,IAAI;AAEnB,UAAI,aAAa,IAAI,GAAG;AACtB,eAAO,mBAAmB,kBAAkBA,SAAQ,SAAS,KAAK;MACpE;AAGA,YAAM,gBAA+E,CAAC;AACtF,UAAI,gBAAgB,aAAa,GAAG,IAAI,MAAM,GAAG;AAC/C,cAAM,SAAS,aAAa,GAAG,IAAI,MAAM;AACzC,eAAO,cAAc,SAAS,QAAQ;AACpC,wBAAc;YACZ;cACE;cACA,EAAE,MAAM,MAAMA,QAAO,KAAK,QAAQ,KAAK,EAAE,EAAE;cAC3C;cACA;YACF;UACF;QACF;MACF;AACA,aAAO;IAET,KAAK,cAAc,IAAI;AACrB,aAAO,mBAAmB,kBAAkBA,SAAQ,SAAS,KAAK;IAEpE;AACE,aAAOD,gBAAe,MAAM,gBAAgB;EAChD;AACF;AAlDO;ACvMP,IAAM,eAAe,wBAAC,WAAgB,UAAoB;AACxD;IACE,SAAS,SAAS,KAAKT,UAAS,SAAS,KAAK,SAAS,SAAS;IAChE,iBAAiB,MAAM,IAAI;EAC7B;AACA,MAAI,SAAS,SAAS,KAAK,CAACD,OAAM,SAAS;AAAG;AAC9C,QAAM,QAAQ,OAAO,UAAU,SAAS,EAAE,CAAC;AAC3C;;IAEE,SAAS,MAAM,SAAS,MAAM,OAAO;IACrC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;EACvD;AACF,GAZqB;AAcrB,IAAM,kBAAkB,wBAAC,WAAgB,UAAoB;AAC3D,SAAO,SAAS,SAAS,GAAG,iBAAiB,MAAM,IAAI,sBAAsB;AAC7E;IACE,UAAU,SAAS;IACnB,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;EACvD;AACF,GANwB;AAQxB,IAAM,oBAAoB,wBAAC,WAAgB,UAAoB;AAC7D,SAAO,SAAS,SAAS,GAAG,iBAAiB,MAAM,IAAI,sBAAsB;AAC/E,GAF0B;AAI1B,IAAM,eAAe,wBAAC,WAAgB,UAAoB;AACxD,MAAIC,UAAS,SAAS,GAAG;AACvB;MACE,aAAa,OAAO;MACpB;IACF;EACF;AACA;IACE,SAAS,SAAS,KAChBA,UAAS,SAAS,KAClB,SAAS,SAAS,KACjB,OAAO,cAAc,YAAY,SAAS,aAAa,UAAU,aACjE,OAAO,cAAc,YACpB,CAAC,SAAS,SAAS,SAAS,OAAO,EAAE,MAAM,CAAC,QAAQ,OAAO,SAAS;IACxE,iBAAiB,MAAM,IAAI,kBACzB,MAAM,IACR,sDAAsD,OAAO,SAAS,IAAI,SAAS;EACrF;AACA,MAAI;AACJ,UAAQ,MAAM,MAAM;IAClB,KAAA;AACE,cAAQ,IAAI,aAAa,SAAS,EAAE,SAAS;AAC7C;IACF,KAAA;AACE,cAAQ,IAAI,aAAa,SAAS,EAAE,SAAS;AAC7C;IACF;AACE,cAAQ,SAAS,SAAS;EAC9B;AACA,UAAQ,MAAM,MAAM;IAClB,KAAA;AACE;QACE,SAAS,MAAM,SAAS;QACxB,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;QACE,SAAS,MAAM,SAAS;QACxB,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;QACE,SAAS,MAAM,SAAS;QACxB,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;QACE,SAAS,MAAM,SAAS,MAAM,MAAM;QACpC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;QACE,SAAS,MAAM,SAAS,MAAM,OAAO;QACrC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;QACE,SAAS,MAAM,SAAS,MAAM,OAAO;QACrC,iBAAiB,MAAM,IAAI,OAAO,MAAM,IAAI;MAC9C;AACA;IAEF,KAAA;AACE,aAAO,aAAa,GAAG,KAAK,GAAG,iBAAiB,MAAM,IAAI,OAAO,MAAM,IAAI,cAAc;AACzF;IAEF,KAAA;AACE;;QAEE,SAAS,MAAM,SAAS,MAAM,OAAO;QACrC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IAEF,KAAA;AACE;;QAEE,SAAS,MAAM,SAAS,MAAM,OAAO;QACrC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;MACvD;AACA;IACF,KAAA,6CAA6B;AAC3B;QACE,SAAS,MAAM,SAAS,MAAM,OAAO;QACrC,iBAAiB,MAAM,IAAI,YAAY,MAAM,IAAI;MACnD;AACA;IACF;IAEA;AACE;EACJ;AACF,GAtGqB;AAwGrB,IAAM,eAAe,wBAAC,WAAgB,UAAoB;AACxD;IACE,UAAU,SAAS;IACnB,iBAAiB,MAAM,IAAI,kBAAkB,MAAM,IAAI;EACzD;AACF,GALqB;AAOrB,IAAM,iBAAiB,wBAAC,WAAgB,OAAiB,YAAwB;AAE/E,MAAI,MAAM,SAAA,yBAAsB,MAAM,SAAA,uBAAoB;AACxD,iBAAa,WAAW,KAAK;AAC7B;EACF;AAEA,MAAI,MAAM,SAAS,2CAA2C;AAC5D;MACE,OAAO,cAAc;MACrB,kDAAkD,SAAS;IAC7D;AACA,UAAM,QAAQ,OAAO,UAAU,SAAS,EAAE,CAAC;AAC3C;;MAEE,SAAS,MAAM,SAAS,MAAM,OAAO;MACrC,iBAAiB,MAAM,IAAI,gBAAgB,MAAM,IAAI;IACvD;AACA;EACF;AAEA;IACE,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,SAAS;IACzD,iBAAiB,MAAM,IAAI,0BAA0B,MAAM,IAAI;EACjE;AAGA,UAAQ,MAAM,IAAI,EAAE,QAAQ,QAAQ,CAAC,EAAE,KAAK,MAAM;AAChD;MACE,OAAO,KAAK,SAAS,EAAE,SAAS,IAAI;MACpC,iBAAiB,MAAM,IAAI,2BAA2B,IAAI;IAC5D;EACF,CAAC;AACH,GAjCuB;AAmCvB,IAAM,eAAe,wBAAC,WAAgB,UAAoB;AACxD;IACE,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,SAAS;IACzD,iBAAiB,MAAM,IAAI,wBAAwB,MAAM,IAAI;EAC/D;AACA,QAAM,cAAc,OAAO,oBAAoB,OAAO,eAAe,SAAS,CAAC;AAC/E,QAAM,OAAO,CAAC,GAAG,OAAO,oBAAoB,SAAS,GAAG,GAAG,WAAW;AACtE,MAAI,aAAa,MAAM,IAAI,KAAK,KAAK,SAAS,QAAQ,KAAK,KAAK,SAAS,QAAQ,GAAG;AAClF;EACF;AACA,MAAI,aAAa,MAAM,IAAI,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,OAAO,GAAG;AAC/E;EACF;AACA,MAAI,KAAK,SAAS,SAAS,KAAK,KAAK,SAAS,eAAe,GAAG;AAC9D;EACF;AACA,QAAM,IAAI;IACR,2BAA2B,MAAM,IAAI,UAAU,MAAM,IAAI,oBAAoB,SAAS;EACxF;AACF,GAnBqB;AAqBrB,IAAM,gBAAgB,wBAAC,WAAgB,UAAoB;AACzD;IACE,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,SAAS;IACzD,iBAAiB,MAAM,IAAI;EAC7B;AAEF,GANsB;AAQtB,IAAM,gBAAgB,wBAAC,WAAgB,OAAiB,SAAqB,UAAoB;AAC/F,QAAM,WAAW,aAAa,MAAM,IAAI;AAExC,MAAI,WAAW,QAAQ,KAAK,WAAW,SAAS,GAAG;AACjD;EACF;AAEA,SAAO,MAAM,QAAQ,SAAS,GAAG,iBAAiB,MAAM,IAAI,qBAAqB;AAEjF,UAAQ,MAAM;IACZ,KAAK,WAAW,QAAQ;AACtB,gBAAU,QAAQ,CAAC,UAAwB,aAAa,OAAO,KAAK,CAAC;AACrE;IACF,KAAK,YAAY,QAAQ;AACvB,gBAAU,QAAQ,CAAC,OAAY,cAAc,IAAI,EAAE,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,CAAC;AACtF;IAEF,KAAK,YAAY,QAAQ;AACvB,gBAAU;QAAQ,CAAC,UACjB,cAAc,OAAO,EAAE,MAAM,IAAI,MAAM,SAAS,GAAG,SAAS,KAAK;MACnE;AACA;IACF,KAAK,aAAa,UAAU,OAAO;AACjC,gBAAU;QAAQ,CAAC,OACjB,eAAe,IAAI,EAAE,MAAM,MAAM,MAAM,MAAM,SAAS,GAAG,OAAO;MAClE;AACA;IACF,KAAK,WAAW,UAAU,KAAK;AAC7B,gBAAU,QAAQ,CAAC,OAAY,aAAa,IAAI,EAAE,MAAM,MAAM,MAAM,MAAM,SAAS,CAAC,CAAC;AACrF;IACF,MAAK,WAAW,QAAQ,KAAK,cAAc,QAAQ;AACjD,gBAAU,QAAQ,CAAC,UAAwB,aAAa,OAAO,EAAE,MAAM,IAAI,MAAM,SAAS,CAAC,CAAC;AAC5F;IACF,KAAK,WAAW,QAAQ;AACtB,gBAAU,QAAQ,CAAC,UAAwB,aAAa,OAAO,KAAK,CAAC;AACrE;IACF;AACE,YAAM,IAAI;QACR,gCAAgC,MAAM,IAAI,UAAU,MAAM,IAAI,WAAW,SAAS;MACpF;EACJ;AACF,GAzCsB;AA2CtB,IAAM,kBAAkB,wBAAC,WAAgB,UAAoB;AAU3D,QAAM,WAAW,aAAa,MAAM,IAAI;AACxC;IACG,WAAW,QAAQ,KAAK,aAAa,aAAa,eAAgB,WAAW,QAAQ;IACtF,aAAa,MAAM,IAAI;EACzB;AACA,UAAQ,MAAM;IACZ,KAAK,WAAW,QAAQ;AACtB,mBAAa,WAAW,KAAK;AAC7B;QACE,OAAO,UAAU,SAAS,EAAE,CAAC,IAAI;QACjC;MACF;AACA;IACF,KAAK,WAAW,QAAQ;AACtB,mBAAa,WAAW,EAAE,MAAM,IAAI,MAAM,SAAS,CAAC;AACpD,cAAQ,MAAM,MAAM;QAClB,KAAA;AACE;YACE,IAAI,aAAa,SAAS,EAAE,SAAS,IAAI;YACzC;UACF;AACA;QACF;AACE;YACE,SAAS,SAAS,IAAI;YACtB;UACF;MACJ;AACA;IACF;AACE,YAAM,IAAI;QACR,gCAAgC,MAAM,IAAI,UAAU,MAAM,IAAI,WAAW,SAAS;MACpF;EACJ;AACF,GA5CwB;AA8CT,SAAR,eACL,WACA,MACA,SACA,OACA;AACA,YAAU,OAAO,OAAO,CAAC,KAAK,UAAU;AACtC,UAAM,YAAY,KAAK,GAAG;AAE1B,YAAQ,MAAM;MACZ,KAAK,MAAM,MAAM,IAAI;AACnB,eAAO;MACT,KAAK,WAAW,MAAM,IAAI;AACxB,qBAAa,WAAW,KAAK;AAC7B;MACF,KAAK,cAAc,MAAM,IAAI;AAC3B,wBAAgB,WAAW,KAAK;AAChC;MACF,MAAK,WAAW,MAAM,IAAI,KAAK,cAAc,MAAM,IAAI;AACrD,qBAAa,WAAW,KAAK;AAC7B;MACF,KAAK,WAAW,MAAM,IAAI;AACxB,qBAAa,WAAW,KAAK;AAC7B;MACF,KAAK,gBAAgB,MAAM,IAAI;AAC7B,0BAAkB,WAAW,KAAK;AAClC;MACF,KAAK,YAAY,MAAM,IAAI;AACzB,sBAAc,WAAW,OAAO,SAAS,KAAK;AAC9C;MACF,KAAK,aAAa,MAAM,MAAM,OAAO;AACnC,uBAAe,WAAW,OAAO,OAAO;AACxC;MACF,KAAK,WAAW,MAAM,MAAM,KAAK;AAC/B,qBAAa,WAAW,KAAK;AAC7B;MACF,KAAK,YAAY,MAAM,IAAI;AACzB,sBAAc,WAAW,KAAK;AAC9B;MACF,KAAK,cAAc,MAAM,IAAI;AAC3B,wBAAgB,WAAW,KAAK;AAChC;MACF;AACE,cAAM,IAAI;UACR,gCAAgC,MAAM,IAAI,UAAU,MAAM,IAAI,WAAW,SAAS;QACpF;IACJ;AAEA,WAAO,MAAM;EACf,GAAG,CAAC;AACN;AAlDO;AC7RA,IAAM,WAAN,MAAM,UAAS;SAAA;;;EACpB;EAEA;EAEmB;EAEA;EAEnB,YAAY,KAAU;AACpB,SAAK,UAAU,UAAS,aAAa,GAAG;AACxC,SAAK,QAAQ,UAAS,WAAW,GAAG;AACpC,SAAK,SAAS,gBAAgB,GAAG;AACjC,SAAK,MAAM,KAAK,OAAO,gBAAgB;EACzC;;;;;;;EAQO,SAAS,MAAoB,QAAgB,OAAuB,CAAC,GAAG;AAE7E,QAAI,SAAA,UAA8B;AAChC,YAAM,yBAAyB,KAAK,IACjC,OAAO,CAAC,QAAQ;AACf,YAAI,IAAI,SAAS;AAAY,iBAAO;AACpC,cAAM,SAAS,IAAI,oBAAoB,UAAU,IAAI,qBAAqB;AAC1E,eAAO,SAAA,WAA+B,CAAC,SAAS;MAClD,CAAC,EACA,IAAI,CAAC,QAAQ,IAAI,IAAI;AACxB;QACE,uBAAuB,SAAS,MAAM;QACtC,GAAG,SAAA,WAA+B,cAAc,UAAU;MAC5D;IACF;AAGA,UAAM,YAAY,KAAK,IAAI;MAAK,CAAC,QAC/B,SAAA,WACI,IAAI,SAAS,UAAU,IAAI,SAAS,gBACpC,IAAI,SAAS,UAAU,IAAI,SAAS;IAC1C;AAEA,QAAI,qBAAqB,QAAQ,MAAM,SAAS,GAAG;AACjD;IACF;AAGA,UAAM,eAAe,KAAK,OAAO,mBAAmB,SAAS;AAC7D,QAAI,KAAK,WAAW,cAAc;AAChC,YAAM;QACJ,yCAAyC,YAAY,uBAAuB,KAAK,MAAM;MACzF;IACF;AAGA,mBAAe,WAAW,MAAM,KAAK,SAAS,KAAK,KAAK;EAC1D;;;;;;;;;;;;;;;EAgBO,QAAQ,QAAgB,cAAiC;AAC9D,UAAM,YAAY,KAAK,IAAI,KAAK,CAAC,gBAAgB,YAAY,SAAS,MAAM;AAE5E,QAAI,qBAAqB,QAAQ,cAAc,SAAS,GAAG;AACzD,aAAO,CAAC;IACV;AAEA,QAAI;AACJ,QAAI,MAAM,QAAQ,YAAY,GAAG;AAC/B,aAAO;IACT,OAAO;AAEL,YAAM,gBAAgB;QACpB;QACA,UAAU;QACV,KAAK;QACL,KAAK;MACP;AACA,aAAO,OAAO,OAAO,aAAa;AAElC,qBAAe,WAAW,MAAM,KAAK,SAAS,KAAK,KAAK;IAC1D;AAEA,UAAM,eAAe,KAAK,OAAO,QAAQ,EAAE;AAE3C,UAAM,YAAY,UAAU,OAAO;MACjC,CAAC,KAAK,UACJ,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,MAAM,IAAI,IACzC,MACA,IAAI,OAAO,mBAAmB,cAAc,OAAO,KAAK,SAAS,KAAK,KAAK,CAAC;MAClF,CAAC;IACH;AAGA,WAAO,eAAe,WAAW,gBAAgB;MAC/C,YAAY;MACZ,UAAU;MACV,OAAO;IACT,CAAC;AACD,WAAO;EACT;;;;;;EAOA,OAAO,QAAQ,SAA4B;AACzC,UAAM,aAAa,wBAAC,QAAgB;AAClC,YAAM,aAAa,wBAAC,GAAW,SAAS,QAAa;AACnD,cAAM,KAAK,MAAM,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,SAAS,GAAG,GAAG,CAAC,IAAI;AAC5D,eAAO,OAAO,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM;AAC5C,cAAI,QAAQ;AACZ,cAAI,MAAM;AAAc,oBAAQ,oBAAoB,KAAK;mBAChD,WAAW,KAAK;AAAG,oBAAQ,oBAAoB,KAAK;AAC7D,gBAAM,KAAK,MAAM,QAAQ,EAAE,KAAK,MAAM,MAAM,UAAU;AACtD,cAAI,SAAS,KAAK;AAAG,mBAAO,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC;AAC5D,cAAI,OAAO,KAAK,MAAM,OAAO;AAC3B,kBAAM,cAAc,OAAO,oBAAoB,OAAO,eAAe,KAAK,CAAC;AAC3E,kBAAM,OAAO,CAAC,GAAG,OAAO,oBAAoB,KAAK,GAAG,GAAG,WAAW;AAClE,gBAAI,KAAK,SAAS,QAAQ,KAAK,KAAK,SAAS,QAAQ,GAAG;AAEtD,oBAAM,WAAW;AACjB,oBAAM,YAAY,SAAS,OAAO,IAAA,IAAA;AAGlC,kBAAI,SAAS,OAAO;AAClB,uBAAO,WAAW,EAAE,GAAG,WAAW,GAAG,SAAS,OAAO,EAAE,GAAG,GAAG,MAAM,GAAG,EAAE,GAAG;AAC7E,qBAAO,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC;YAC7C;AACA,gBAAI,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,OAAO,GAAG;AAEnD,oBAAM,WAAW;AACjB,oBAAM,YAAY,SAAS,KAAK,IAAA,IAAA;AAChC,qBAAO,WAAW,EAAE,GAAG,WAAW,GAAG,SAAS,OAAO,EAAE,GAAG,GAAG,MAAM,GAAG,EAAE,GAAG;YAC7E;AACA,gBAAI,KAAK,SAAS,SAAS,KAAK,KAAK,SAAS,eAAe,GAAG;AAE9D,oBAAM,SAAS;AACf,oBAAM,gBAAwB,OAAO,cAAc;AACnD,oBAAM,eAAe,OAAO,KAAK,OAAO,OAAO;AAC/C,oBAAM,kBAAkB,aAAa;gBACnC,CAAC,YAAiB,YAAY;cAChC;AACA,kBACE,OAAO,OAAO,OAAO,MAAM,YAC3B,OAAO,KAAK,OAAO,OAAO,CAAC,EAAE,WAAW,GACxC;AACA,uBAAO,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,IAAI,KAAK,eAAe,CAAC,CAAC;cACnD;AACA,qBAAO,WAAW,EAAE,GAAG,iBAAiB,GAAG,OAAO,OAAO,EAAE,GAAG,GAAG,MAAM,GAAG,EAAE,GAAG;YACjF;AAEA,mBAAO,WAAW,OAAO,GAAG,MAAM,GAAG,EAAE,GAAG;UAC5C;AACA,iBAAO,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC;QACzC,CAAC;MACH,GAhDmB;AAiDnB,YAAM,SAAS,OAAO,YAAY,WAAW,GAAG,CAAC;AACjD,aAAO;IACT,GApDmB;AAsDnB,QAAI;AACJ,QAAI,CAAC,MAAM,QAAQ,OAAO,GAAG;AAE3B,YAAM,WAAW,WAAW,OAAO;AAEnC,sBAAgB,OAAO,OAAO,QAAQ;IACxC,OAAO;AAGL,YAAM,UAAU,EAAE,GAAG,QAAQ;AAC7B,YAAM,WAAW,WAAW,OAAO;AACnC,sBAAgB,OAAO,OAAO,QAAQ;IACxC;AAGA,WAAO,eAAe,eAAe,gBAAgB;MACnD,YAAY;MACZ,UAAU;MACV,OAAO;IACT,CAAC;AACD,WAAO;EACT;;;;;;;EAQO,MAAM,QAAgB,UAA4B;AACvD,UAAM,EAAE,QAAQ,IAAI,KAAK,IAAI,KAAK,CAAC,QAAQ,IAAI,SAAS,MAAM;AAC9D,UAAM,mBAAmB,SAAS,KAAK,EAAE,OAAO,QAAQ,EAAE;AAE1D,UAAM,SAAS,QAAQ,KAAK,EAAE,OAAO,CAAC,KAAKU,SAAQ,QAAQ;AACzD,YAAM,WAAWA,QAAO,QAAQ;AAChC,UAAI,QAAQ,IAAI,eAAe,kBAAkBA,SAAQ,KAAK,SAAS,KAAK,OAAO,GAAG;AACtF,UAAI,IAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,MAAM,GAAG;AAC3C,eAAO,IAAI,GAAG,QAAQ,MAAM;MAC9B;AACA,aAAO;IACT,GAAG,CAAC,CAAS;AAGb,WAAO,OAAO,KAAK,MAAM,EAAE,WAAW,KAAK,KAAK,SAAU,OAAO,CAAC,IAAe;EACnF;;;;;;;;EASO,OAAO,QAAgB,UAAoB,QAAwB;AACxE,UAAM,SAAS,KAAK,MAAM,QAAQ,QAAQ;AAC1C,WAAO,UAAU,QAA+B,MAAM;EACxD;;;;;;EAOA,OAAO,aAAa,KAAsB;AACxC,WAAO,IACJ,OAAO,CAAC,aAAa,SAAS,SAAS,QAAQ,EAC/C;MACC,CAAC,KAAK,cAAc;QAClB,GAAG;QACH,CAAC,SAAS,IAAI,GAAG;MACnB;MACA,CAAC;IACH;EACJ;;;;;;EAOA,OAAO,WAAW,KAAoB;AACpC,UAAM,eAAe,IAClB,OAAO,CAAC,aAAa,SAAS,SAAS,MAAM,EAC7C;MACC,CAAC,KAAK,cAAc;QAClB,GAAG;QACH,CAAC,SAAS,IAAI,GAAG;MACnB;MACA,CAAC;IACH;AACF,WAAO,aAAa,YAAY;AAChC,WAAO;EACT;;;;;;EAOA,OAAO,WAAW,cAAuB,CAAC,GAAa;AACrD,WAAO,UAAS,QAAQ,WAAW;EACrC;;;;;;EAOA,OAAO,MAAM,MAAe,CAAC,GAAgB;AAC3C,UAAM,WAAW,UAAS,QAAQ,GAAG;AACrC,WAAO,SAAS,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;EACvC;;;;;;;;;;;EAYO,iBAAiB,WAA+B,UAAwC;AAC7F,UAAM,iBAAiB,MAAM,QAAQ,SAAS,IAAI,YAAY,CAAC,SAAS;AACxE,UAAM,mBAAmB,SAAS,KAAK,EAAE,OAAO,QAAQ,EAAE;AAC1D,UAAM,eAAe,eAAe;MAClC,CAAC,cACC;QACE;QACA,EAAE,MAAM,IAAI,MAAM,UAAU;QAC5B,KAAK;QACL,KAAK;MACP;IACJ;AACA,WAAO,aAAa,WAAW,IAAI,aAAa,CAAC,IAAI;EACvD;AACF;ACnWA,IAAA,eAAA,CAAA;AAAAxB,UAAA,cAAA;EAAA,kCAAA,6BAAA,kCAAA;EAAA,iCAAA,6BAAAyB,kCAAA;EAAA,uCAAA,6BAAAC,wCAAA;EAAA,gCAAA,6BAAAC,iCAAA;EAAA,0BAAA,6BAAA,0BAAA;EAAA,0BAAA,6BAAA,0BAAA;EAAA,uBAAA,6BAAAC,yBAAA;EAAA,wBAAA,6BAAA,wBAAA;EAAA,gCAAA,6BAAA,gCAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,+BAAA,6BAAA,+BAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,+BAAA,6BAAA,+BAAA;EAAA,gCAAA,6BAAA,gCAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,UAAA,6BAAA,kBAAA;EAAA,gBAAA,6BAAA,gBAAA;AAAA,CAAA;ACAA,IAAA,aAAA,CAAA;AAAA5B,UAAA,YAAA;EAAA,iCAAA,6BAAA,iCAAA;EAAA,uCAAA,6BAAA,uCAAA;EAAA,0BAAA,6BAAA,0BAAA;EAAA,gCAAA,6BAAA,gCAAA;EAAA,uBAAA,6BAAA4B,wBAAA;AAAA,CAAA;ACAA,IAAA,aAAA,CAAA;AAAA5B,UAAA,YAAA;EAAA,YAAA,6BAAA6B,cAAA;EAAA,aAAA,6BAAA,qBAAA;AAAA,CAAA;ADeO,SAASD,uBAAsB,MAA8B;AAClE,SAAO,CAAC,GAAG,MAAM,KAAK,MAAM,EACzB,OAAO,CAAC,GAAiB,MAA+B,SAAS,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,EAC7F,SAAS;AACd;AAJgB,OAAAA,wBAAA;AAYT,SAAS,+BACd,cACA,SACA,iBACA,oBACA,UACA,QACA,SACA,iBAAiC,CAAC,GAC1B;AACR,QAAM,eAAeA,uBAAsB,QAAQ;AACnD,QAAM,aAAa;IACjB;IACA;IACA;IACA;IACA;IACA;IACA;IACA,GAAG;EACL;AACA,SAAOA,uBAAsB,UAAU;AACzC;AAtBgB;AA8BT,SAAS,gCACd,WACA,eACA,SACA,QACA,SACA,OACA,mBACQ;AACR,SAAO;IAAA;IAEL;IACA;IACA;IACA,CAAC,SAAS;IACV;IACA;IACA,CAAC,OAAO,GAAI,oBAAoB,CAAC,iBAAiB,IAAI,CAAC,CAAE;EAC3D;AACF;AAnBgB;AAyBT,SAAS,sCACd,iBACA,WACA,qBACA,MACA,SACA,QACA,SACA,OACA;AACA,QAAM,WAAW,CAAC,WAAW,MAAM,GAAG,mBAAmB;AAEzD,SAAO;IAAA;IAEL;IACA;IACA;IACA;IACA;IACA;IACA,CAAC,KAAK;EACR;AACF;AAtBgB;AA4BT,SAAS,yBACd,iBACA,SACA,UACA,QACA,SACA,OACQ;AACR,SAAO;IAAA;IAEL;IACA;IACA;IACA;IACA;IACA;IACA,CAAC,KAAK;EACR;AACF;AAlBgB;AE9GhB,IAAA,aAAA,CAAA;AAAA5B,UAAA,YAAA;EAAA,iCAAA,6BAAAyB,kCAAA;EAAA,uCAAA,6BAAAC,wCAAA;EAAA,gCAAA,6BAAA,gCAAA;EAAA,gCAAA,6BAAAI,iCAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,cAAA,6BAAA,cAAA;AAAA,CAAA;AAYA,IAAM,QAAQ,wBAAC,UAA0B,MAAM,IAAI,CAAC,OAAqB,OAAO,EAAE,CAAC,GAArE;AAGd,IAAM,8BAA8B;AACpC,IAAM,kBAAkB;AACxB,IAAM,0BAA0B;AAChC,IAAM,wBAAwB,kBAAkB;AAChD,IAAM,cAAc,OAAO,kBAAkB,QAAQ,CAAC;AACtD,IAAM,cAAc,OAAO,kBAAkB,QAAQ,CAAC;AAE/C,SAAS,WAAW,aAA2B,WAAyB;AAC7E,UAAQ,OAAO,WAAW,KAAK,+BAA+B,OAAO,SAAS;AAChF;AAFgB;AAIT,SAAS,aAAa,KAAmB,QAAwB;AACtE,QAAM,WACH,eAAe,0BACf,OAAO,OAAO,OAAO,UAAU,KAAK,2BACrC,OAAO,OAAO,OAAO,kBAAkB;AAEzC,QAAM,WACH,eAAe,0BACf,OAAO,OAAO,OAAO,UAAU,KAAK,2BACrC,OAAO,OAAO,OAAO,kBAAkB;AAEzC,SAAO,iBAAiB,CAAC,OAAO,GAAG,GAAG,SAAS,OAAO,CAAC;AACzD;AAZgB;AAcT,SAASA,gCACd,cACA,SACA,eACA,SACA,OACA,KACA,eACA,2BACA,yBACA,gBACA,iBAAiC,CAAC,GAC1B;AACR,QAAM,eAAe,aAAa,KAAK,cAAc;AACrD,QAAM,aAAa,WAAW,2BAA2B,uBAAuB;AAChF,QAAM,aAAa,MAAM;IACvB;IACA;IACA;IACA;IACA,iBAAiB,MAAM,aAAa,CAAC;IACrC;IACA;IACA;IACA,GAAG,MAAM,cAAc;EACzB,CAAC;AACD,SAAO,MAAM,iBAAiB,UAAU,CAAC;AAC3C;AA3BgBA;AAiCT,SAASJ,uCACd,iBACA,WACA,6BACA,MACA,SACA,SACA,OACA,2BACA,yBACA,gBACA,KACA,eACA;AACA,SAAOI;IAAA;IAEL;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA,CAAC,iBAAiB,MAAM,2BAA2B,CAAC,GAAG,WAAW,IAAI;EACxE;AACF;AA3BgBJ;AAiCT,SAASD,iCACd,WACA,mBACA,eACA,SACA,SACA,OACA,uBACA,2BACA,yBACA,gBACA,KACA,eACQ;AACR,SAAOK;IAAA;IAEL;IACA;IACA;IACA;IACA;IACA,MAAM,aAAa;IACnB;IACA;IACA;IACA,CAAC,iBAAiB,MAAM,qBAAqB,CAAC,GAAG,WAAW,iBAAiB;EAC/E;AACF;AA3BgBL;AAiCT,SAAS,+BACd,eACA,SACA,kBACA,SACA,OACA,uBACA,2BACA,yBACA,gBACA,KACA,eACQ;AACR,SAAOK;IAAA;IAEL;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA,CAAC,iBAAiB,MAAM,qBAAqB,CAAC,GAAG,iBAAiB,MAAM,gBAAgB,CAAC,CAAC;EAC5F;AACF;AA1BgB;AC7GhB,SAAS,aAAa,MAA4D;AAChF,SAAO,CAAC7B,aAAA,oBAAoB,IAAIA,aAAA,oBAAoB,EAAE,EAAE,SAAS,KAAK,OAAkB;AAC1F;AAFS;AA6BF,SAAS0B,gCAA+B,MAA4B;AACzE,MAAI,aAAa,IAAI,GAAG;AACtB,WAAO;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;IACP;EACF;AACA,SAAO;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;EACP;AACF;AAxBgBA;AA6BhB,SAAS,cAAc,MAA8D;AACnF,SAAO,CAAC1B,aAAA,oBAAoB,IAAIA,aAAA,oBAAoB,EAAE,EAAE,SAAS,KAAK,OAAkB;AAC1F;AAFS;AA+BF,SAASwB,iCAAgC,MAA6B;AAC3E,MAAI,cAAc,IAAI,GAAG;AACvB,WAAOA;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;IACP;EACF;AAEA,SAAO;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;EACP;AACF;AA3BgBA;AAiChB,SAAS,oBACP,MACuC;AACvC,SAAO,CAACxB,aAAA,oBAAoB,IAAIA,aAAA,oBAAoB,EAAE,EAAE,SAAS,KAAK,OAAkB;AAC1F;AAJS;AAkCF,SAASyB,uCAAsC,MAAmC;AACvF,MAAI,oBAAoB,IAAI,GAAG;AAC7B,WAAOA;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;MACL,KAAK;IACP;EACF;AAEA,SAAO;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;EACP;AACF;AA5BgBA;AE1LhB,IAAA,eAAA,CAAA;AAAA1B,UAAA,cAAA;EAAA,OAAA,6BAAA+B,QAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,WAAA,6BAAAC,YAAA;EAAA,sBAAA,6BAAA,sBAAA;AAAA,CAAA;AAKA,IAAM,2BAA2B,wBAAC,QAAgB;AAChD,MAAI,CAAM,UAAU,GAAG;AAAG,WAAO,WAAW,GAAG;AAC/C,QAAM,MAAM,SAAS,KAAK,EAAE;AAC5B,SAAO,OAAO,cAAc,GAAG,IAAI,MAAM,OAAO,GAAG;AACrD,GAJiC;AAqB1B,IAAMD,SAAQ,wBAAC,QACf,MAAM,OAAO,GAAG,GAAG,QAAW,wBAAwB,GADxC;AAcd,IAAM,mBAAmB,wBAAC,QAC1B,MAAM,OAAO,GAAG,GAAG,QAAgB,oBAAoB,GAD9B;AAqBzB,IAAMC,aAAY,wBACvB,OACA,UACA,OACA,uBACgB,UAAU,OAAO,UAAU,OAAO,kBAAkB,GAL7C;AAQlB,IAAM,uBAAuBA;AD3C7B,SAAS,oBAAoB,GAAiB,GAAyB;AAC5E,SAAkB,SAAS,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjD;AAFgB;AAIT,SAAS,oBAAoB,GAAiB,GAAyB;AAC5E,SAAO,MAAiB,aAAa,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;AAC5D;AAFgB;AAgBT,SAASJ,wBAAsB,MAA8B;AAClE,SAAO,CAAC,GAAG,MAAM,KAAK,MAAM,EACzB,OAAO,CAAC,GAAiB,MAA+B,SAAS,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,EACzF,SAAS;AACd;AAJgBA,OAAAA,yBAAAA;AAMT,IAAM,gCAAgCA;AAEtC,SAAS,8BAA8B,MAAsB;AAClE,SAAO,MAAMK,iBAAiB,KAAK,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;AAC3D;AAFgB;AAkBT,SAAS,iCACd,MACA,WACA,qBACA,iBACQ;AACR,QAAM,mBAAmB,SAAS,QAAQ,mBAAmB;AAC7D,QAAM,0BAA0BL,wBAAsB,gBAAgB;AAEtE,QAAM,0BAA0B,KAAK,sDAAsD;AAE3F,QAAMZ,QAAOY,wBAAsB;IACjC;IACA;IACA;IACA;IACA;EACF,CAAC;AACD,SAAO,MAAM,OAAOZ,KAAI,IAAI,UAAU;AACxC;AAnBgB;AAqBhB,SAAS,iBAAiB,KAAa,OAAY;AACjD,MAAI,QAAQ,gBAAgB,QAAQ,qBAAqB;AACvD,WAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,IAAI,SAAY;EAClE;AAEA,MAAI,QAAQ,cAAc;AACxB,WAAO;EACT;AAEA,SAAO,UAAU,OAAO,SAAY;AACtC;AAVS;AAsBF,SAAS,aAAakB,OAAsB;AACjD,MAAI,eAAe;AACnB,QAAM,YAAY,CAAC;AAEnB,aAAW,QAAQA,OAAM;AACvB,QAAI,SAAS,QAAQ,UAAU,SAAS,KAAK,UAAU,MAAM,EAAE,EAAE,CAAC,MAAM,UAAU,OAAO;AACvF,qBAAe,CAAC;IAClB;AACA,QAAI,cAAc;AAChB,gBAAU,KAAK,IAAI;IACrB,OAAO;AAEL,gBAAU,KAAK,SAAS,MAAM,OAAO,SAAS,MAAM,OAAO,IAAI;IACjE;EACF;AACA,SAAO,UAAU,KAAK,EAAE;AAC1B;AAhBgB;AA4BT,SAAS,uBAAuB,kBAAkD;AACvF,QAAM,EAAE,KAAK,QAAQ,IAAI;AACzB,QAAM,gBAAgB,EAAE,KAAK,QAAQ;AACrC,QAAM,iBAAiB,aAAaF,WAAU,eAAe,gBAAgB,CAAC;AAC9E,SAAO,aAAwB,OAAO,YAAY,cAAc,CAAC,EAAE,SAAS,EAAE,CAAC;AACjF;AALgB;AAkBT,SAAS,+BAA+B,UAA2C;AACxF,QAAM,mBAAmB,SAAS,QAAQ,IACrCD,OAAM,QAAQ,IACf;AAEJ,QAAM,aAAa,MAAM,WAAW;AAEpC,QAAM,0BAA0BH;IAC9B,iBAAiB,qBAAqB,SAAS,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC;EACtF;AAEA,QAAM,2BAA2BA;IAC/B,iBAAiB,qBAAqB,WAAW,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC;EACxF;AAEA,QAAM,4BAA4BA;IAChC,iBAAiB,qBAAqB,YAAY,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC;EACzF;AAEA,QAAM,eAAeA;IACnB,iBAAiB,QAAQ,SAAS,IAAI,CAAC,MAAM,kBAAkB,CAAC,CAAC;EACnE;AAEA,QAAM,kBAAkB,uBAAuB,gBAAgB;AAE/D,QAAM,WAAWA,wBAAsB,iBAAiB,QAAQ,IAAI;AAEpE,SAAOA,wBAAsB;IAC3B;IACA;IACA;IACA;IACA;IACA;IACA;EACF,CAAC;AACH;AApCgB;AAwChB,SAAS,aAAa,UAAoB;AACxC,SAAOK;IACL,SAAS,QAAQ,CAAC,OAAY;AAC5B,aAAO,OAAO,kBAAkB,EAAE,CAAC;IACrC,CAAC;EACH;AACF;AANS;AAQT,SAAS,eAAe,MAAkC;AACxD,QAAME,QAAO,KAAK,QAAQ,CAAC,OAAY;AACrC,WAAO,CAAC,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,aAAa,GAAG,QAAQ,CAAC;EAC3E,CAAC;AACD,SAAOF,iBAAiBE,KAAI;AAC9B;AALS;AAoBF,SAAS,qBAAqB,MAAkC;AACrE,QAAM,WAAqB,KAAK,SAAS,IAAI,CAAC,MAAM,OAAO,CAAC,CAAC;AAC7D,QAAM,yBAAmC,KAAK,4BAA4B,CAAC;AAC3E,MAAI,eAAe;AACnB,QAAM,aAAa,uBAAuB,QAAQ,CAAC,QAAQ;AACzD,UAAM,UAAU,SAAS,MAAM,cAAe,gBAAgB,GAAI;AAClE,WAAO,CAAC,OAAO,GAAG,GAAGF,iBAAiB,OAAO,CAAC;EAChD,CAAC;AACD,SAAO,KAAKA,iBAAiB,UAAU;AACzC;AATgB;AAsBT,SAAS,yBAAyB,MAAkC;AACzE,QAAM,yBAAyB;AAG/B,QAAM,uBAAuB,OAAO,kBAAkB,sBAAsB,CAAC;AAG7E,QAAM,0BAA0B,eAAe,KAAK,qBAAqB,QAAQ;AAGjF,QAAM,aAAa,eAAe,KAAK,qBAAqB,UAAU;AAGtE,QAAM,cAAc,eAAe,KAAK,qBAAqB,WAAW;AAGxE,QAAM,WAAW,KAAK,2BAClB,qBAAqB,IAAI,IACzBA,iBAAiB,KAAK,SAAS,IAAI,CAAC,OAAe,OAAO,EAAE,CAAC,CAAC;AAElE,SAAO;IACLA,iBAAiB;MACf;MACA;MACA;MACA;MACA;IACF,CAAC;EACH;AACF;AA7BgB;AA+BhB,SAAS,qBAAqB,MAAwC;AACpE,QAAME,QAAO,KAAK,QAAQ,CAAC,OAAY;AACrC,WAAO,CAAC,OAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,YAAY,CAAC;EACtD,CAAC;AACD,SAAOF,iBAAiBE,KAAI;AAC9B;AALS;AAOT,SAAS,QAAQ,QAAwB;AACvC,QAAM,eAAe,aAAaH,WAAU,OAAO,KAAK,IAAI,CAAC;AAC7D,SAAO,OAAO,aAAwB,OAAO,YAAY,YAAY,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;AACvF;AAHS;AAgBF,SAAS,+BAA+B,QAAgC;AAC7E,QAAM,yBAAyB;AAG/B,QAAM,uBAAuB,OAAO,kBAAkB,sBAAsB,CAAC;AAG7E,QAAM,0BAA0B,qBAAqB,OAAO,qBAAqB,QAAQ;AAGzF,QAAM,aAAa,qBAAqB,OAAO,qBAAqB,UAAU;AAG9E,QAAM,cAAc,qBAAqB,OAAO,qBAAqB,WAAW;AAGhF,QAAM,UAAU,QAAQ,MAAM;AAG9B,QAAM,gBAAgBC,iBAAiB,OAAO,eAAe,IAAI,CAAC,OAAe,OAAO,EAAE,CAAC,CAAC;AAE5F,SAAO;IACLA,iBAAiB;MACf;MACA;MACA;MACA;MACA;MACA;IACF,CAAC;EACH;AACF;AA/BgB;AA4CT,SAAS,yBAAyB,UAA6C;AACpF,QAAM,mBAAmB,SAAS,QAAQ,IAAIF,OAAM,QAAQ,IAAI;AAEhE,MAAI,oBAAoB,kBAAkB;AACxC,WAAO,+BAA+B,gBAAkC;EAC1E;AAEA,SAAO,+BAA+B,gBAA0C;AAClF;AARgB;AE7VhB,IAAA,gBAAA,CAAA;AAAA/B,UAAA,eAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,QAAA,6BAAA,QAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,UAAA,6BAAA,UAAA;EAAA,yBAAA,6BAAA,yBAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,WAAA,6BAAA,WAAA;AAAA,CAAA;AAwCO,SAAS,gBAAgB,aAAkD;AAChF,QAAM,cAAc,SAAS,WAAW,IAAI,cAAcgC,WAAU,WAAW;AAC/E,QAAM,oBAAoB,OAAK,WAAW;AAC1C,SAAO,cAAc,iBAAiB;AACxC;AAJgB;AAkCT,SAAS,kBAAkBI,SAA2B;AAC3D,MAAI,MAAM,QAAQA,OAAM;AAAG,WAAOA;AAClC,QAAM,eAAe,oBAAoB,SAAO,cAAcA,OAAM,CAAC,CAAC;AACtE,SAAOL,OAAM,YAAY;AAC3B;AAJgB;AAeT,SAAS,gBAAwB;AACtC,QAAM,gBAAgB,MAAM,iBAAiB;AAC7C,SAAO,YAAY,aAAa;AAClC;AAHgB;AAUT,SAAS,YAAY,OAAuB;AACjD,SAAO,aAAa,KAAK,EAAE,YAAY;AACzC;AAFgB;AAiBT,SAAS,gBAAgB,KAAqC;AACnE,MAAI,CAAC;AAAK,UAAM,MAAM,kDAAkD;AACxE,MAAI,MAAM,QAAQ,GAAG,GAAG;AACtB,WAAO,IAAI,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;EAClC;AACA,MAAI;AACF,UAAM,EAAE,GAAG,EAAE,IAAI;AACjB,WAAO,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;EAC5B,SAAS,GAAG;AACV,UAAM,IAAI,MAAM,uEAAuE;EACzF;AACF;AAXgB;AA0BT,SAAS,wBAAwB,KAAqC;AAC3E,SAAO,sCAAsC,gBAAgB,GAAG,CAAC;AACnE;AAFgB;AAiBT,SAAS,oBAAoB,KAAqC;AACvE,SAAO,0CAA0C,gBAAgB,GAAG,CAAC;AACvE;AAFgB;AAeT,SAAS,qBACd,cACA,WAAA,IACQ;AACR,SAAO,WAAW,cAAc,QAAQ;AAC1C;AALgB;AA8BT,SAAS,oBACd,UACA,iBAAA,IACA,gBAAA,IACgB;AAChB,MAAI,SAAS,QAAQ,GAAG;AACtB,WAAO;MACL,QAAQ,EAAE,YAAY,OAAO,oBAAoB,MAAM;MACvD,QAAQ,EAAE,YAAY,OAAO,oBAAoB,MAAM;IACzD;EACF;AAEA,MAAI,OAAO,SAAS,iBAAiB,eAAe,OAAO,SAAS,cAAc,aAAa;AAC7F,UAAM,MAAM,4CAA4C;EAC1D;AAEA,QAAM,WACJ,SAAS,sBAAsB,UAAa,SAAS,mBAAmB,SACpE,MAAM,WAAW,OAAO,SAAS,WAAW,IAAI,OAAO,SAAS,SAAS,GAAG,cAAc,CAAC,IAC3F,MAAM,WAAW,SAAS,cAAc,cAAc,CAAC;AAC7D,QAAM,eAAe,MAAM,WAAW,SAAS,WAAW,aAAa,CAAC;AACxE,SAAO;IACL,QAAQ,EAAE,YAAY,OAAO,oBAAoB,MAAM;IACvD,QAAQ,EAAE,YAAY,UAAU,oBAAoB,aAAa;EACnE;AACF;AAzBgB;AAuCT,SAAS,OAAO,KAAqC;AAC1D,MAAI,QAAQ9B,aAAA,sBAAsB;AAAI,WAAOA,aAAA,QAAQ;AACrD,MAAI,QAAQA,aAAA,sBAAsB;AAAI,WAAOA,aAAA,QAAQ;AACrD,QAAM,MAAM,iBAAiB;AAC/B;AAJgB;AAmBT,SAAS,qBACd,gBACA,iBACqB;AACrB,QAAM,qBAAqB,kBAAkB,MAAM,eAAe,IAAI;AACtE,QAAM,oBAAoB,MAAM,cAAc;AAE9C,MAAI,mBAAmB,CAAC,OAAO,OAAOA,aAAA,mBAAmB,EAAE,SAAS,kBAAyB,GAAG;AAC9F,UAAM,MAAM,mBAAmB,eAAe,6BAA6B;EAC7E;AACA,MAAI,CAAC,OAAO,OAAOA,aAAA,mBAAmB,EAAE,SAAS,iBAAwB,GAAG;AAC1E,UAAM,MAAM,kBAAkB,cAAc,6BAA6B;EAC3E;AAEA,SAAQ,kBAAkB,qBAAqB;AACjD;AAfgB;AA4BT,SAAS,aAAa,iBAAgC;AAC3D,MAAI,CAAC;AAAiB,WAAO;AAC7B,QAAM,UAAU,MAAM,eAAe;AAErC,MAAI,YAAYA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AACnE,MAAI,YAAYA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AACnE,MAAI,YAAYA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AACnE,MAAI,YAAYA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AAEnE,QAAM,MAAM,iBAAiB,OAAO,mBAAmB;AACzD;AAVgB;AAiCT,SAAS,UAAU,SAA2B;AACnD,SAAO;IACL,KAAK,QAAQ,OAAO;IACpB,eAAe,QAAQ,iBAAiB,CAAC;IACzC,uBAAuB,QAAQ,yBAAyB,CAAC;IACzD,2BAA2B,QAAQ,6BAA6BA,aAAA,sBAAsB;IACtF,yBAAyB,QAAQ,2BAA2BA,aAAA,sBAAsB;IAClF,gBAAgB,QAAQ,kBAAkB,oBAAoB,IAAI;EACpE;AACF;AATgB;AAyBT,SAAS,SAAS,iBAA2D;AAClF,MAAI,oBAAoBA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AAC3E,MAAI,oBAAoBA,aAAA,oBAAoB;AAAI,WAAOA,aAAA,oBAAoB;AAC3E,SAAO;AACT;AAJgB;AClUT,SAAS,SACd,UACkD;AAClD,QAAM,mBAAmB,SAAS,QAAQ,IAAI8B,OAAM,QAAQ,IAAI;AAChE,SAAO,oBAAoB;AAC7B;AALgB;AC1BhB,IAAA,cAAA,CAAA;AAAAM,UAAA,aAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,4BAAA,6BAAA,4BAAA;AAAA,CAAA;AAiBO,SAAS,sBAA8B;AAC5C,SAAO,YAAY,QAAQ,UAAU,MAAM,iBAAiB,CAAC,CAAC;AAChE;AAFgB;AAcT,SAAS,2BAA2B,SAA+B;AACxE,gBAAc,SAAS,MAAM,MAAM,OAAO,IAAI,mBAAmB;AACjE,QAAM,SAAS,aAAa,gBAAgB,MAAM,OAAO,CAAC,EAAE,SAAS,IAAI,GAAG,CAAC;AAC7E,SAAO,QAAQ,OAAO,MAAM,qBAAqB,CAAC,GAAG,iCAAiC;AACtF,SAAO;AACT;AALgB;AC1BhB,IAAO,wBAAS,OAAO,WAAW,eAAe,OAAO;AACrD,OAAO,WAAW,eAAe,YAAgB,OAAO,KAAK;AAC9D,wBAAAC;ACPF,IAAA,mBAAA,CAAA;AAAAD,UAAA,kBAAA;EAAA,OAAA,6BAAA,OAAA;EAAA,2BAAA,6BAAA,2BAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,QAAA,6BAAA,QAAA;EAAA,WAAA,6BAAA,WAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,MAAA,6BAAA,MAAA;AAAA,CAAA;AAmCO,SAAS,KAAK,OAAiC;AACpD,SAAO,IAAI,QAAQ,CAAC,QAAQ;AAC1B,eAAW,KAAK,KAAK;EACvB,CAAC;AACH;AAJgB;AA8BT,SAAS,0BAA0B,UAA+C;AACvF,QAAM,SAAS,EAAE,GAAG,SAAS;AAC7B,SAAO,OAAO;AACd,SAAO,MAAM,aAAaE,WAAU,SAAS,GAAG,CAAC;AACjD,SAAO,iBAAiB,aAAaA,WAAU,SAAS,cAAc,CAAC;AACvE,SAAO,iBAAiB,gBAAgB,OAAO,cAAc;AAC7D,SAAO;AACT;AAPgB;AA8BT,SAAS,cAAc,UAAoD;AAChF,QAAM,iBAAiB,SAAS,QAAQ,IAAKC,OAAM,QAAQ,IAAyB;AAEpF,MAAI,CAAC,SAAS,QAAQ,GAAG;AACvB,WAAO;MACL,GAAG;MACH,GAAI,aAAa,kBAAkB,EAAE,SAAS,gBAAgB,eAAe,OAAO,EAAE;IACxF;EACF;AAEA,SAAO,0BAA0B,cAAgC;AACnE;AAXgB;AAyBT,IAAM,oBAAoB,wBAAC,aAA2B,OAAgB,UAAkB;AAC7F,MAAI,CAAC,MAAM;AAET,YAAQ,KAAK,4EAA4E;EAC3F;AACA,QAAM,QAAQ;IAAU,eAAA;;EAAqC;AAC7D,QAAM,UAAU,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM;AACvD,SAAO,MAAM,OAAO;AACtB,GARiC;AAU1B,IAAM,iBAAiB,OAAO,OAAO,QAAQ;AAkB7C,IAAM,QAAN,MAAY;SAAA;;;;;;EAIjB,OAAwB;;;;EAKxB,SAA0B;;;;EAK1B,MAAuB;EAEf,cAAc,cAAqC;AACzD,QAAI,SAAS,YAAY,GAAG;AAC1B,UAAI,gBAAgB,YAAY,GAAG;AACjC,aAAK,SAAS,SAAS,cAAc,EAAE;MACzC,WAAWC,OAAM,YAAY,GAAG;AAC9B,aAAK,OAAO;MACd,WAAW,eAAe,SAAS,YAAwB,GAAG;AAC5D,aAAK,MAAM;MACb,OAAO;AACL,cAAM,UAAU,+BAA+B,YAAY,EAAE;MAC/D;IACF,WAAW,SAAS,YAAY,GAAG;AACjC,WAAK,OAAO,MAAM,YAAY;IAChC,WAAWC,UAAS,YAAY,GAAG;AACjC,WAAK,SAAS;IAChB,OAAO;AACL,WAAK,MAAA;IACP;AAEA,QAAIA,UAAS,KAAK,MAAM,KAAK,KAAK,SAAS,GAAG;AAC5C,YAAM,UAAU,iBAAiB,KAAK,MAAM,qBAAqB;IACnE;EACF;;;;;;;;EASA,YAAY,aAA8B;AACxC,SAAK,cAAc,WAAW;EAChC;;;;;;;;;;EAWA,IAAI,kBAAuB;AACzB,QAAI,KAAK,WAAW,MAAM;AACxB,aAAO,eAAe,KAAK,MAAM;IACnC;AAEA,QAAI,KAAK,SAAS,MAAM;AACtB,aAAO,aAAa,KAAK,IAAI;IAC/B;AAEA,WAAO,eAAe,KAAK,GAAG;EAChC;;;;;;;;;;EAWA,IAAI,aAAkB;AACpB,QAAI,KAAK,WAAW,MAAM;AACxB,aAAO,EAAE,cAAc,KAAK,OAAO;IACrC;AAEA,QAAI,KAAK,SAAS,MAAM;AACtB,aAAO,EAAE,YAAY,KAAK,KAAK;IACjC;AAEA,WAAO,KAAK;EACd;;;;;;;;;;;EAYA,IAAI,WAAW,aAA8B;AAC3C,SAAK,cAAc,WAAW;EAChC;EAEA,UAAU,6BAAM,KAAK,QAAX;EAEV,WAAW,6BAAM,KAAK,MAAX;AACb;AAuBO,SAAS,OAAO,SAAuE;AAC5F,QAAM,UAAU,QAAQ,UAAU,MAAM,QAAQ,OAAO,IAAIC,aAAA,oBAAoB;AAC/E,SAAO,YAAYA,aAAA,oBAAoB,MAAM,YAAYA,aAAA,oBAAoB;AAC/E;AAHgB;AAiBT,SAAS,UAAU,SAAgC,UAA2B;AACnF,QAAM,CAAC,QAAQ,MAAM,IAAI,QAAQ,MAAM,GAAG;AAC1C,QAAM,CAAC,QAAQ,MAAM,IAAI,SAAS,MAAM,GAAG;AAE3C,SAAO,WAAW,UAAU,WAAW;AACzC;AALgB;AAkBT,SAAS,eAAe,UAAsD;AACnF,SAAO,SAAS,WAAW;AAC7B;AAFgB;AAgBT,SAAS,qBAAqB,UAAkD;AACrF,SAAO,EAAE,gBAAgB;AAC3B;AAFgB;AAeT,SAAS,qBACd,UACgC;AAChC,SAAO,EAAE,gBAAgB;AAC3B;AAJgB;AC3VhB,IAAA,sBAAA,CAAA;AAAAN,UAAA,qBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,4BAAA,6BAAA,4BAAA;EAAA,qCAAA,6BAAA,qCAAA;EAAA,mCAAA,6BAAA,mCAAA;EAAA,oBAAA,6BAAA,oBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,iCAAA,6BAAA,iCAAA;EAAA,wCAAA,6BAAA,wCAAA;AAAA,CAAA;AAgDO,IAAM,kCAAkC,wBAAC,UAAkB;AAChE,QAAM,YAA4B,CAAC;AACnC,QAAM,WAA2B,CAAC;AAClC,QAAM,QAAQ,CAAC,SAAS;AACtB,UAAM,OAAO,SAAS,QAAQ,KAAK,YAAY,CAAC,CAAC;AACjD,cAAU,KAAK;MACb,IAAI,SAAS,KAAK,eAAe,EAAE,SAAS,EAAE;MAC9C,UAAU,SAAS,oBAAoB,KAAK,UAAU,CAAC,EAAE,SAAS,EAAE;MACpE,aAAa,SAAS,OAAO,SAAS;MACtC,UAAU,KAAK,OAAO,SAAS;IACjC,CAAC;AACD,aAAS,KAAK,GAAG,IAAI;EACvB,CAAC;AACD,SAAO;IACL;IACA,UAAU,SAAS,QAAQ,EAAE,SAAS,CAAC;EACzC;AACF,GAjB+C;AA6CxC,IAAM,6BAA6B,wBAAC,UAAkB;AAC3D,QAAM,EAAE,WAAW,SAAS,IAAI,gCAAgC,KAAK;AACrE,QAAM,gBAAgB,SAAS,QAAQ,EAAE,UAAU,CAAC;AACpD,SAAO,CAAC,GAAG,eAAe,GAAG,QAAQ;AACvC,GAJ0C;AAUnC,IAAM,sCAAsC,wBAAC,OAAe,UAAwB;AACzF,SAAO,CAAC,GAAG,2BAA2B,KAAK,GAAG,SAAS,KAAK,EAAE,SAAS,CAAC;AAC1E,GAFmD;AAQ5C,IAAM,yCAAyC,wBAAC,UAAkB;AACvE,QAAM,YAAY,MAAM,IAAgB,CAAC,UAAU;IACjD,IAAI,SAAS,KAAK,eAAe,EAAE,SAAS,EAAE;IAC9C,UAAU,SAAS,oBAAoB,KAAK,UAAU,CAAC,EAAE,SAAS,EAAE;IACpE,UAAU,SAAS,QAAQ,KAAK,YAAY,CAAC,CAAC;EAChD,EAAE;AACF,SAAO;AACT,GAPsD;AAmC/C,IAAM,oCAAoC,wBAAC,UAAkB;AAElE,QAAM,aAAa,MAAM,IAAI,CAAC,UAAU;IACtC,iBAAiB,KAAK;IACtB,YAAY,KAAK;IACjB,UACE,MAAM,QAAQ,KAAK,QAAQ,KAAK,kBAAkB,KAAK,WACnD,KAAK,WACL,SAAS,QAAQ,KAAK,QAAmB;;EACjD,EAAE;AAEF,SAAO,SAAS,QAAQ,EAAE,WAAW,CAAC;AACxC,GAZiD;AAyC1C,IAAM,qBAAqB,wBAAC,OAAe,eAA6B,QAAQ;AACrF,MAAI,iBAAiB,KAAK;AACxB,WAAO,kCAAkC,KAAK;EAChD;AACA,SAAO,2BAA2B,KAAK;AACzC,GALkC;AAkC3B,SAAS,aACd,SACA,SACA;AACA,QAAM,SAAS,CAAC,EAAE,OAAO,OAAa,EAAE,IAAI,CAAC,OAAO;AAClD,UAAM;MACJ;MACA;MACA,QAAAO,UAAS;MACT,sBAAsB,CAAC;IACzB,IAAI;AAEJ,UAAM,8BAA8B,SAAS,QAAQ,mBAAmB;AACxE,UAAM,aAAa,QAAQ,cAAc;AAEzC,WAAO;MACL,MAAM;QACJ,iBAAiB,IAAI;QACrB,YAAY,IAAI;QAChB,UAAU;UACR;UACA;UACA,YAAYA,OAAM;UAClB,4BAA4B;UAC5B,GAAG;QACL;MACF;MACA,SAAS;QACPA,UAAoB,SAAS,SAAS,UAAU,IAAI;QACpD;QACA;QACAA,UAAS,IAAI,UAAU;MACzB;IACF;EACF,CAAC;AAED,SAAO;IACL,OAAO,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI;IACjC,WAAW,OAAO,IAAI,CAAC,OAAO,GAAG,OAAO;EAC1C;AACF;AAxCgB;AAwDT,SAAS,kBAAkB,aAAqC;AACrE,SAAO,gBAAgB,QACnB;IACE,IAAID,aAAA,oBAAoB;IACxB,IAAIA,aAAA,oBAAoB;IACxB,IAAIA,aAAA,oBAAoB;EAC1B,IACA,EAAE,IAAIA,aAAA,oBAAoB,IAAI,IAAIA,aAAA,oBAAoB,IAAI,IAAIA,aAAA,oBAAoB,GAAG;AAC3F;AARgB;AzCtPhB,IAAM,iBAAiB;EACrB,SAAS,EAAE,gBAAgB,mBAAmB;EAC9C,iBAAA;EACA,SAAS;AACX;AAEO,IAAM,aAAN,MAAiB;SAAA;;;EACf;EAEA;EAEE;EAEF;EAEE;EAED;EAEA;EAEC;;EAET,YAAY,mBAAwC;AAClD,UAAM,EAAE,SAAS,SAAS,SAAS,iBAAiB,SAAS,aAAa,SAAS,IACjF,qBAAqB,CAAC;AACxB,QAAI,OAAO,OAAO,WAAW,EAAE,SAAS,OAAsB,GAAG;AAC/D,WAAK,UAAU,kBAAkB,SAAwB,mBAAmB,OAAO;IACrF,WAAW,SAAS;AAClB,WAAK,UAAU;IACjB,OAAO;AACL,WAAK,UAAU,kBAAkB,QAAW,mBAAmB,OAAO;IACxE;AACA,SAAK,UAAU,WAAW,eAAe;AACzC,SAAK,UAAU,EAAE,GAAG,eAAe,SAAS,GAAG,QAAQ;AACvD,SAAK,kBAAkB,mBAAmB,eAAe;AACzD,SAAK,UAAU;AACf,SAAK,cAAc;AACnB,SAAK,WAAW,YAAY;AAC5B,SAAK,YAAY;EACnB;EAEO,WAAW,SAA0B;AAC1C,SAAK,UAAU;EACjB;EAEO,MAAM,QAAgB,QAAiB,KAAsB,GAAG;AACrE,UAAM,iBAAmC;MACvC;MACA,SAAS;MACT;MACA,GAAI,UAAU,EAAE,OAAO;IACzB;AACA,WAAO,sBAAM,KAAK,SAAS;MACzB,QAAQ;MACR,MAAMJ,WAAU,cAAc;MAC9B,SAAS,KAAK;IAChB,CAAC;EACH;EAEU,aAAa,QAAgB,QAAa,UAAuB,YAAkB;AAC3F,QAAI,UAAU;AACZ,YAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,YAAM,IAAI;QACR,QAAQ,MAAM,gBAAgBA,WAAU,QAAQ,MAAM,CAAC,CAAC;;UACtD,IAAI,KAAK,OAAO,KAAKA,WAAU,IAAI,CAAC;MACxC;IACF;AACA,QAAI,sBAAsB,cAAc;AACtC,YAAM;IACR;AACA,QAAI,YAAY;AACd,YAAM,MAAM,WAAW,OAAO;IAChC;EACF;EAEA,MAAgB,cACd,QACA,QACmC;AACnC,QAAI;AACF,YAAM,YAAY,MAAM,KAAK,MAAM,QAAQ,QAAS,KAAK,aAAa,CAAE;AACxE,YAAM,EAAE,OAAAM,QAAO,OAAO,IAAI,MAAM,UAAU,KAAK;AAC/C,WAAK,aAAa,QAAQ,QAAQA,MAAK;AACvC,aAAO;IACT,SAASA,QAAY;AACnB,WAAK,aAAa,QAAQ,QAAQA,QAAO,UAAU,MAAMA,MAAK;AAC9D,YAAMA;IACR;EACF;EAEA,MAAa,aAAa;AACxB,SAAK,YAAa,MAAM,KAAK,cAAc,kBAAkB;AAC7D,WAAO,KAAK;EACd;EAEA,MAAa,iBAAiB;AAC5B,SAAK,gBAAiB,MAAM,KAAK,cAAc,sBAAsB;AACrE,WAAO,KAAK;EACd;EAEO,mBACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qBAAqB;MAC7C;MACA;IACF,CAAC;EACH;;;;EAKO,yBAAyB;AAC9B,WAAO,KAAK,cAAc,6BAA6B;EACzD;;;;;;EAOO,iBAAiB;AACtB,WAAO,KAAK,cAAc,sBAAsB;EAClD;EAEO,qBAAqB,kBAAmC,KAAK,iBAAiB;AACnF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,iCAAiC,EAAE,SAAS,CAAC;EACzE;EAEO,gBAAgB,kBAAmC,KAAK,iBAAiB;AAC9E,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,4BAA4B,EAAE,SAAS,CAAC;EACpE;EAEO,oBAAoB,kBAAmC,KAAK,iBAAiB;AAClF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,2BAA2B,EAAE,SAAS,CAAC;EACnE;EAEO,2BAA2B,kBAAmC,KAAK,iBAAiB;AACzF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,mCAAmC,EAAE,SAAS,CAAC;EAC3E;EAEO,yBAAyB,kBAAmC,KAAK,iBAAiB;AACvF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qCAAqC,EAAE,SAAS,CAAC;EAC7E;EAEO,qBAAqB,QAAsB;AAChD,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,iCAAiC;MACzD;IACF,CAAC;EACH;EAEO,gCAAgC,iBAAkC,OAAe;AACtF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,4CAA4C,EAAE,UAAU,MAAM,CAAC;EAC3F;EAEO,sBAAsB,QAAsB;AACjD,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,kCAAkC,EAAE,iBAAiB,CAAC;EAClF;EAEO,oBAAoB,QAAsB;AAC/C,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,6BAA6B,EAAE,iBAAiB,CAAC;EAC7E;;;;EAKO,qBAAqB,iBAA+B;AACzD,UAAM,mBAAmB,MAAM,eAAe;AAC9C,WAAO,KAAK,cAAc,iCAAiC,EAAE,iBAAiB,CAAC;EACjF;;;;;;;;EASO,oBACL,aACA,6BAA4D,CAAC,GAC7D;AACA,UAAM;MACJ,kBAAkB,KAAK;MACvB,eAAe;MACf,gBAAgB;IAClB,IAAI;AACJ,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,UAAM,kBAAyC,CAAC;AAChD,QAAI;AAAc,sBAAgB,KAAK,oBAAI,gBAAgB,aAAa;AACxE,QAAI;AAAe,sBAAgB,KAAK,oBAAI,gBAAgB,eAAe;AAE3E,WAAO,KAAK,cAAc,iCAAiC;MACzD;MACA,cAAc,YAAY,IAAI,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;MAC/D,kBAAkB;IACpB,CAAC;EACH;EAEA,MAAa,mBAAmB,QAAsB,SAAqC;AACzF,UAAM,kBAAkB,MAAM,MAAM;AACpC,QAAI,EAAE,QAAQ,IAAI;AAClB,QAAI,UAAU;AACd,QAAI,eAAe;AACnB,UAAM,gBAAgB,SAAS,iBAAiB;AAChD,UAAM,cAAmB,SAAS,eAAe;MAC/C,oBAAI,mBAAmB;;;;IAIzB;AACA,UAAM,gBAAqB,SAAS,iBAAiB;MACnD,oBAAI,4BAA4B;MAChC,oBAAI,mBAAmB;MACvB,oBAAI,mBAAmB;IACzB;AAEA,QAAI;AACJ,WAAO,CAAC,SAAS;AAEf,YAAM,KAAK,aAAa;AACxB,UAAI;AAEF,mBAAW,MAAM,KAAK,qBAAqB,eAAe;AAE1D,cAAM,kBAAkB,SAAS;AACjC,cAAM,iBAAiB,SAAS;AAEhC,YAAI,CAAC,gBAAgB;AAGnB,gBAAMA,SAAQ,IAAI,MAAM,gCAAgC;AACxD,gBAAMA;QACR;AAEA,YAAI,YAAY,SAAS,eAAe,KAAK,YAAY,SAAS,cAAc,GAAG;AACjF,gBAAM,UAAU,GAAG,eAAe,KAAK,cAAc;AACrD,gBAAMA,SAAQ,IAAI,MAAM,OAAO;AAC/B,UAAAA,OAAM,WAAW;AACjB,yBAAe;AACf,gBAAMA;QACR,WACE,cAAc,SAAS,eAAe,KACtC,cAAc,SAAS,cAAc,GACrC;AACA,oBAAU;QACZ;MACF,SAASA,QAAO;AACd,YAAIA,kBAAiB,SAAS,cAAc;AAC1C,gBAAMA;QACR;AAEA,YAAI,WAAW,GAAG;AAChB,gBAAM,IAAI,MAAM,6CAA6C,KAAK,OAAO,EAAE;QAC7E;MACF;AAEA,iBAAW;IACb;AAMA,QAAI,YAAY;AAChB,WAAO,cAAc,MAAM;AACzB,UAAI;AAEF,oBAAY,MAAM,KAAK,sBAAsB,eAAe;MAC9D,SAASA,QAAO;AACd,YAAI,WAAW,GAAG;AAChB,gBAAM,IAAI,MAAM,6CAA6C,KAAK,OAAO,EAAE;QAC7E;MACF;AACA,iBAAW;AAEX,YAAM,KAAK,aAAa;IAC1B;AACA,WAAO;EACT;EAEO,aACL,iBACA,KACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,YAAY,aAAa,GAAG;AAClC,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,yBAAyB;MACjD;MACA,KAAK;MACL;IACF,CAAC;EACH;EAEO,eACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,2BAA2B;MACnD;MACA;IACF,CAAC;EACH;EAEO,SACL,WACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,aAAa,MAAM,SAAS;AAClC,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qBAAqB;MAC7C;MACA;IACF,CAAC;EACH;EAEO,WACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,uBAAuB;MAC/C;MACA;IACF,CAAC;EACH;EAEA,MAAa,eACX,aACA,EAAE,kBAAkB,KAAK,iBAAiB,eAAe,KAAK,GAC9D;AACA,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,QAAI,QAAQ,CAAC;AACb,QAAI,CAAC,UAAU,OAAO,MAAM,KAAK,eAAe,CAAC,GAAG;AAClD,cAAQ;QACN,kBAAkB,eAAe,CAAC,oBAAI,gBAAgB,aAAa,IAAI,CAAC;MAC1E;IACF;AAEA,WAAO,KAAK,cAAc,wBAAwB;MAChD,SAAS,YAAY,IAAI,CAAC,OAAO,KAAK,iBAAiB,IAAI,KAAK,CAAC;MACjE;MACA,GAAG;IACL,CAAC;EACH;EAEA,MAAa,OAAO,oBAAgC,SAAsC;AACxF,QAAI;AACJ,QAAI,CAAC,OAAO,OAAO,GAAG;AAEpB,gBAAU,KAAK,cAAc,iCAAiC;QAC5D,oBAAoB;UAClB,gBAAgB,mBAAmB;UACnC,UAAU,SAAS,MAAM,mBAAmB,QAAQ;UACpD,MAAM,oBAAI,iBAAiB;UAC3B,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,SAAS,oBAAI,oBAAoB;UACjC,WAAW,oBAAoB,mBAAmB,SAAS;UAC3D,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,OAAO;AAEL,gBAAU,KAAK,cAAc,iCAAiC;QAC5D,oBAAoB;UAClB,MAAM,oBAAI,iBAAiB;UAC3B,gBAAgB,mBAAmB;UACnC,UAAU,SAAS,MAAM,mBAAmB,QAAQ;UACpD,SAAS,oBAAI,oBAAoB;UACjC,WAAW,oBAAoB,mBAAmB,SAAS;UAC3D,OAAO,MAAM,QAAQ,KAAK;UAC1B,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,yBAAyB,QAAQ,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC5E,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEA,MAAa,QACX,EAAE,UAAU,WAAW,eAAe,kBAAkB,GACxD,SACA;AACA,QAAI;AACJ,QAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,OAAO,OAAO,GAAG;AAE3C,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAM,oBAAI,iBAAiB;UAC3B,gBAAgB;YACd,SAAS,SAAS;YAClB,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,SAAS,oBAAI,oBAAoB;UACjC,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,WAAW,oBAAoB,SAAS;UACxC,gBAAgB;UAChB,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,WAAW,SAAS,QAAQ,KAAK,CAAC,OAAO,OAAO,GAAG;AAEjD,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAM,oBAAI,iBAAiB;UAC3B,gBAAgB;YACd,gBAAgB,kBAAkB,SAAS,cAAc;YACzD,wBAAwB,SAAS;YACjC,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,qBAAqB,qBAAqB;UAC1C,SAAS,oBAAI,oBAAoB;UACjC,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,WAAW,oBAAoB,SAAS;UACxC,gBAAgB;UAChB,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,WAAW,SAAS,QAAQ,KAAK,OAAO,OAAO,GAAG;AAEhD,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAM,oBAAI,iBAAiB;UAC3B,gBAAgB;UAChB,qBAAqB,qBAAqB;UAC1C,SAAS,oBAAI,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;UAC1B,gBAAgB;YACd,gBAAgB,kBAAkB,SAAS,cAAc;YACzD,wBAAwB,SAAS;YACjC,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,yBAAyB,QAAQ,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC5E,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH,OAAO;AACL,YAAM,MAAM,8BAA8B;IAC5C;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEA,MAAa,cACX,EAAE,WAAW,qBAAqB,aAAa,UAAU,GACzD,SACA;AACA,QAAI;AACJ,QAAI,CAAC,OAAO,OAAO,GAAG;AAEpB,gBAAU,KAAK,cAAc,wCAAwC;QACnE,4BAA4B;UAC1B,sBAAsB,SAAS,MAAM,uBAAuB,CAAC,CAAC;UAC9D,YAAY,MAAM,SAAS;UAC3B,uBAAuB,MAAM,eAAe,CAAC;UAC7C,MAAM,oBAAI,iBAAiB;UAC3B,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,SAAS,oBAAI,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,OAAO;AAEL,gBAAU,KAAK,cAAc,wCAAwC;QACnE,4BAA4B;UAC1B,MAAM,oBAAI,iBAAiB;UAC3B,SAAS,oBAAI,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;UAC1B,uBAAuB,MAAM,eAAe,CAAC;UAC7C,sBAAsB,SAAS,MAAM,uBAAuB,CAAC,CAAC;UAC9D,YAAY,MAAM,SAAS;UAC3B,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEO,aAAa,MAAY,kBAAmC,KAAK,iBAAiB;AACvF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,iBAAiB;MACzC,SAAS;QACP,kBAAkB,KAAK;QACvB,sBAAsB,oBAAoB,KAAK,UAAU;QACzD,UAAU,SAAS,MAAM,KAAK,QAAQ;MACxC;MACA;IACF,CAAC;EACH;;;;;EAMO,mBACL,SACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,EAAE,cAAc,YAAY,sBAAsB,QAAQ,IAAI;AACpE,UAAM,mBAAmB;MACvB,cAAc,2BAA2B,YAAY;MACrD,YAAY,MAAM,UAAU;MAC5B,sBAAsB,YAAY,oBAAoB;MACtD,SAAS,kBAAkB,OAAO;IACpC;AAEA,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,+BAA+B;MACvD,SAAS;MACT;IACF,CAAC;EACH;;;;;EAMO,kBAAkB;AACvB,WAAO,KAAK,cAAc,kBAAkB;EAC9C;;;;;EAMO,UAAU,aAA8B;AAC7C,WAAO,KAAK,cAAc,sBAAsB,EAAE,QAAQ,YAAY,CAAC;EACzE;EAEO,iBACL,YACA,aACqB;AACrB,UAAM,kBAAkB,kBAAkB,WAAW;AACrD,QAAI;AAEJ,QAAI,CAAC,OAAO,UAAU,GAAG;AAEvB,gBAAU;QACR,WAAW,oBAAoB,WAAW,SAAS;QACnD,OAAO,MAAM,WAAW,KAAK;QAC7B,SAAS,MAAM,WAAW,UAAU,CAAC;MACvC;IACF,OAAO;AAEL,gBAAU;QACR,WAAW,oBAAoB,WAAW,SAAS;QACnD,OAAO,MAAM,WAAW,KAAK;QAC7B,iBAAiB,WAAW;QAC5B,KAAK,MAAM,WAAW,GAAG;QACzB,gBAAgB,WAAW,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;QAC9D,8BAA8B,WAAW;QACzC,4BAA4B,WAAW;QACvC,yBAAyB,WAAW,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;MACjF;IACF;AAEA,QAAI,WAAW,SAAA,mBAAiC;AAC9C,aAAO;;QAEL,MAAM,oBAAI,iBAAiB;QAC3B,gBAAgB,WAAW;QAC3B,UAAU,SAAS,MAAM,WAAW,QAAQ;QAC5C,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,QAAI,WAAW,SAAA,WAAkC;AAC/C,UAAI,CAAC,SAAS,WAAW,QAAQ,GAAG;AAElC,eAAO;UACL,MAAM,WAAW;UACjB,gBAAgB,WAAW;UAC3B,gBAAgB,WAAW;UAC3B,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;UACvD,GAAG;QACL;MACF;AACA,aAAO;;QAEL,MAAM,WAAW;QACjB,gBAAgB;UACd,GAAG,WAAW;UACd,gBAAgB,kBAAkB,WAAW,SAAS,cAAc;QACtE;QACA,qBAAqB,WAAW,qBAAqB;QACrD,gBAAgB,WAAW;QAC3B,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,QAAI,WAAW,SAAA,kBAAyC;AAEtD,YAAM,EAAE,yBAAyB,GAAG,YAAY,IAAI;AAEpD,aAAO;QACL,MAAM,WAAW;QACjB,sBAAsB,SAAS,MAAM,WAAW,uBAAuB,CAAC,CAAC;QACzE,YAAY,MAAM,WAAW,SAAS;QACtC,uBAAuB,MAAM,WAAW,eAAe,CAAC;QACxD,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,UAAM,MAAM,uDAAuD;EACrE;AACF;A0CnqBA,IAAA,kBAAA,CAAA;AAAAR,UAAA,iBAAA;EAAA,YAAA,6BAAAS,aAAA;AAAA,CAAA;AA+BA,IAAMC,kBAAiB;EACrB,SAAS,EAAE,gBAAgB,mBAAmB;EAC9C,iBAAA;EACA,SAAS;AACX;AAEO,IAAMD,cAAN,MAAiB;SAAA;;;EACf;EAEA;EAEE;EAEF;EAEE;EAED;EAEA;EAEA;EAEC;;EAET,YAAY,mBAAwC;AAClD,UAAM;MACJ;MACA;MACA;MACA;MACA;MACA;MACA;MACA;IACF,IAAI,qBAAqB,CAAC;AAC1B,QAAI,OAAO,OAAO,WAAW,EAAE,SAAS,OAAsB,GAAG;AAC/D,WAAK,UAAU,kBAAkB,SAAwB,mBAAmB,OAAO;IACrF,WAAW,SAAS;AAClB,WAAK,UAAU;IACjB,OAAO;AACL,WAAK,UAAU,kBAAkB,QAAW,mBAAmB,OAAO;IACxE;AACA,SAAK,UAAU,WAAWC,gBAAe;AACzC,SAAK,UAAU,EAAE,GAAGA,gBAAe,SAAS,GAAG,QAAQ;AACvD,SAAK,kBAAkB,mBAAmBA,gBAAe;AACzD,SAAK,UAAU;AACf,SAAK,cAAc;AACnB,SAAK,WAAW,YAAY;AAC5B,SAAK,YAAY;AACjB,SAAK,mCAAmC;EAC1C;EAEA,IAAY,kCAAkC;AAC5C,WAAO,KAAK,oCAAoC;EAClD;EAEO,WAAW,SAA0B;AAC1C,SAAK,UAAU;EACjB;EAEO,MAAM,QAAgB,QAAiB,KAAsB,GAAG;AACrE,UAAM,iBAAmC;MACvC;MACA,SAAS;MACT;MACA,GAAI,UAAU,EAAE,OAAO;IACzB;AACA,WAAO,sBAAM,KAAK,SAAS;MACzB,QAAQ;MACR,MAAMR,WAAU,cAAc;MAC9B,SAAS,KAAK;IAChB,CAAC;EACH;EAEU,aAAa,QAAgB,QAAa,UAAuB,YAAkB;AAC3F,QAAI,UAAU;AACZ,YAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,YAAM,IAAI;QACR,QAAQ,MAAM,gBAAgBA,WAAU,QAAQ,MAAM,CAAC,CAAC;;UACtD,IAAI,KAAK,OAAO,KAAKA,WAAU,IAAI,CAAC;MACxC;IACF;AACA,QAAI,sBAAsB,cAAc;AACtC,YAAM;IACR;AACA,QAAI,YAAY;AACd,YAAM,MAAM,WAAW,OAAO;IAChC;EACF;EAEA,MAAgB,cACd,QACA,QACmC;AACnC,QAAI;AACF,YAAM,YAAY,MAAM,KAAK,MAAM,QAAQ,QAAS,KAAK,aAAa,CAAE;AACxE,YAAM,EAAE,OAAAM,QAAO,OAAO,IAAI,MAAM,UAAU,KAAK;AAC/C,WAAK,aAAa,QAAQ,QAAQA,MAAK;AACvC,aAAO;IACT,SAASA,QAAY;AACnB,WAAK,aAAa,QAAQ,QAAQA,QAAO,UAAU,MAAMA,MAAK;AAC9D,YAAMA;IACR;EACF;EAEA,MAAa,aAAa;AACxB,SAAK,YAAa,MAAM,KAAK,cAAc,kBAAkB;AAC7D,WAAO,KAAK;EACd;EAEA,MAAa,iBAAiB;AAC5B,SAAK,gBAAiB,MAAM,KAAK,cAAc,sBAAsB;AACrE,WAAO,KAAK;EACd;EAEO,mBACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qBAAqB;MAC7C;MACA;IACF,CAAC;EACH;;;;EAKO,yBAAyB;AAC9B,WAAO,KAAK,cAAc,6BAA6B;EACzD;;;;;;EAOO,iBAAiB;AACtB,WAAO,KAAK,cAAc,sBAAsB;EAClD;EAEO,qBAAqB,kBAAmC,KAAK,iBAAiB;AACnF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,iCAAiC,EAAE,SAAS,CAAC;EACzE;EAEO,gBAAgB,kBAAmC,KAAK,iBAAiB;AAC9E,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,4BAA4B,EAAE,SAAS,CAAC;EACpE;EAEO,qBAAqB,kBAAmC,KAAK,iBAAiB;AACnF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,iCAAiC,EAAE,SAAS,CAAC;EACzE;EAEO,oBAAoB,kBAAmC,KAAK,iBAAiB;AAClF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,2BAA2B,EAAE,SAAS,CAAC;EACnE;EAEO,2BAA2B,kBAAmC,KAAK,iBAAiB;AACzF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,mCAAmC,EAAE,SAAS,CAAC;EAC3E;EAEO,yBAAyB,kBAAmC,KAAK,iBAAiB;AACvF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qCAAqC,EAAE,SAAS,CAAC;EAC7E;EAEO,qBAAqB,QAAsB;AAChD,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,iCAAiC;MACzD;IACF,CAAC;EACH;EAEO,gCAAgC,iBAAkC,OAAe;AACtF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,4CAA4C,EAAE,UAAU,MAAM,CAAC;EAC3F;EAEO,sBAAsB,QAAsB;AACjD,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,kCAAkC,EAAE,iBAAiB,CAAC;EAClF;EAEO,oBAAoB,QAAsB;AAC/C,UAAM,mBAAmB,MAAM,MAAM;AACrC,WAAO,KAAK,cAAc,6BAA6B,EAAE,iBAAiB,CAAC;EAC7E;;;;EAKO,qBAAqB,iBAA+B;AACzD,UAAM,mBAAmB,MAAM,eAAe;AAC9C,WAAO,KAAK,cAAc,iCAAiC,EAAE,iBAAiB,CAAC;EACjF;;;;;;;;EASO,oBACL,aACA,6BAA4D,CAAC,GAC7D;AACA,UAAM;MACJ,kBAAkB,KAAK;MACvB,eAAe;MACf,gBAAgB;IAClB,IAAI;AACJ,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,UAAM,kBAAyC,CAAC;AAChD,QAAI;AAAc,sBAAgB,KAAS,gBAAgB,aAAa;AACxE,QAAI;AAAe,sBAAgB,KAAS,gBAAgB,eAAe;AAE3E,WAAO,KAAK,cAAc,iCAAiC;MACzD;MACA,cAAc,YAAY,IAAI,CAAC,OAAO,KAAK,iBAAiB,EAAE,CAAC;MAC/D,kBAAkB;IACpB,CAAC;EACH;EAEA,MAAa,mBAAmB,QAAsB,SAAqC;AACzF,UAAM,kBAAkB,MAAM,MAAM;AACpC,QAAI,EAAE,QAAQ,IAAI;AAClB,QAAI,UAAU;AACd,QAAI,eAAe;AACnB,UAAM,gBAAgB,SAAS,iBAAiB,KAAK;AACrD,UAAM,cAAmB,SAAS,eAAe;MAC3C,mBAAmB;;;;IAIzB;AACA,UAAM,gBAAqB,SAAS,iBAAiB;MAC/C,4BAA4B;MAC5B,mBAAmB;MACnB,mBAAmB;IACzB;AAEA,QAAI;AACJ,WAAO,CAAC,SAAS;AAEf,YAAM,KAAK,aAAa;AACxB,UAAI;AAEF,mBAAW,MAAM,KAAK,qBAAqB,eAAe;AAE1D,cAAM,kBAAkB,SAAS;AACjC,cAAM,iBAAiB,SAAS;AAEhC,YAAI,CAAC,gBAAgB;AAGnB,gBAAMA,SAAQ,IAAI,MAAM,gCAAgC;AACxD,gBAAMA;QACR;AAEA,YAAI,YAAY,SAAS,eAAe,KAAK,YAAY,SAAS,cAAc,GAAG;AACjF,gBAAM,UAAU,GAAG,eAAe,KAAK,cAAc;AACrD,gBAAMA,SAAQ,IAAI,MAAM,OAAO;AAC/B,UAAAA,OAAM,WAAW;AACjB,yBAAe;AACf,gBAAMA;QACR,WACE,cAAc,SAAS,eAAe,KACtC,cAAc,SAAS,cAAc,GACrC;AACA,oBAAU;QACZ;MACF,SAASA,QAAO;AACd,YAAIA,kBAAiB,SAAS,cAAc;AAC1C,gBAAMA;QACR;AAEA,YAAI,WAAW,GAAG;AAChB,gBAAM,IAAI,MAAM,6CAA6C,KAAK,OAAO,EAAE;QAC7E;MACF;AAEA,iBAAW;IACb;AAMA,QAAI,YAAY;AAChB,WAAO,cAAc,MAAM;AACzB,UAAI;AAEF,oBAAY,MAAM,KAAK,sBAAsB,eAAe;MAC9D,SAASA,QAAO;AACd,YAAI,WAAW,GAAG;AAChB,gBAAM,IAAI,MAAM,6CAA6C,KAAK,OAAO,EAAE;QAC7E;MACF;AACA,iBAAW;AAEX,YAAM,KAAK,aAAa;IAC1B;AACA,WAAO;EACT;EAEO,aACL,iBACA,KACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,YAAY,aAAa,GAAG;AAClC,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,yBAAyB;MACjD;MACA,KAAK;MACL;IACF,CAAC;EACH;EAEO,eACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,2BAA2B;MACnD;MACA;IACF,CAAC;EACH;EAEO,SACL,WACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,aAAa,MAAM,SAAS;AAClC,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,qBAAqB;MAC7C;MACA;IACF,CAAC;EACH;EAEO,WACL,iBACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,mBAAmB,MAAM,eAAe;AAC9C,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,uBAAuB;MAC/C;MACA;IACF,CAAC;EACH;EAEA,MAAa,eACX,aACA,EAAE,kBAAkB,KAAK,iBAAiB,eAAe,KAAK,GAC9D;AACA,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,QAAI,QAAQ,CAAC;AACb,QAAI,CAAC,UAAU,OAAO,MAAM,KAAK,eAAe,CAAC,GAAG;AAClD,cAAQ;QACN,kBAAkB,eAAe,CAAK,gBAAgB,aAAa,IAAI,CAAC;MAC1E;IACF;AAEA,WAAO,KAAK,cAAc,wBAAwB;MAChD,SAAS,YAAY,IAAI,CAAC,OAAO,KAAK,iBAAiB,IAAI,KAAK,CAAC;MACjE;MACA,GAAG;IACL,CAAC;EACH;EAEA,MAAa,OAAO,oBAAgC,SAAsC;AACxF,QAAI;AACJ,QAAI,CAAC,OAAO,OAAO,GAAG;AAEpB,gBAAU,KAAK,cAAc,iCAAiC;QAC5D,oBAAoB;UAClB,gBAAgB,mBAAmB;UACnC,UAAU,SAAS,MAAM,mBAAmB,QAAQ;UACpD,MAAU,iBAAiB;UAC3B,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,SAAa,oBAAoB;UACjC,WAAW,oBAAoB,mBAAmB,SAAS;UAC3D,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,OAAO;AAEL,gBAAU,KAAK,cAAc,iCAAiC;QAC5D,oBAAoB;UAClB,MAAU,iBAAiB;UAC3B,gBAAgB,mBAAmB;UACnC,UAAU,SAAS,MAAM,mBAAmB,QAAQ;UACpD,SAAa,oBAAoB;UACjC,WAAW,oBAAoB,mBAAmB,SAAS;UAC3D,OAAO,MAAM,QAAQ,KAAK;UAC1B,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,yBAAyB,QAAQ,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC5E,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEA,MAAa,QACX,EAAE,UAAU,WAAW,eAAe,kBAAkB,GACxD,SACA;AACA,QAAI;AACJ,QAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,OAAO,OAAO,GAAG;AAE3C,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAU,iBAAiB;UAC3B,gBAAgB;YACd,SAAS,SAAS;YAClB,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,SAAa,oBAAoB;UACjC,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,WAAW,oBAAoB,SAAS;UACxC,gBAAgB;UAChB,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,WAAW,SAAS,QAAQ,KAAK,CAAC,OAAO,OAAO,GAAG;AAEjD,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAU,iBAAiB;UAC3B,gBAAgB;YACd,gBAAgB,kBAAkB,SAAS,cAAc;YACzD,wBAAwB,SAAS;YACjC,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,qBAAqB,qBAAqB;UAC1C,SAAa,oBAAoB;UACjC,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,WAAW,oBAAoB,SAAS;UACxC,gBAAgB;UAChB,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,WAAW,SAAS,QAAQ,KAAK,OAAO,OAAO,GAAG;AAEhD,gBAAU,KAAK,cAAc,kCAAkC;QAC7D,qBAAqB;UACnB,MAAU,iBAAiB;UAC3B,gBAAgB;UAChB,qBAAqB,qBAAqB;UAC1C,SAAa,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;UAC1B,gBAAgB;YACd,gBAAgB,kBAAkB,SAAS,cAAc;YACzD,wBAAwB,SAAS;YACjC,sBAAsB,SAAS;YAC/B,KAAK,SAAS;UAChB;UACA,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,yBAAyB,QAAQ,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC5E,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH,OAAO;AACL,YAAM,MAAM,8BAA8B;IAC5C;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEA,MAAa,cACX,EAAE,WAAW,qBAAqB,aAAa,UAAU,GACzD,SACA;AACA,QAAI;AACJ,QAAI,CAAC,OAAO,OAAO,GAAG;AAEpB,gBAAU,KAAK,cAAc,wCAAwC;QACnE,4BAA4B;UAC1B,sBAAsB,SAAS,MAAM,uBAAuB,CAAC,CAAC;UAC9D,YAAY,MAAM,SAAS;UAC3B,uBAAuB,MAAM,eAAe,CAAC;UAC7C,MAAU,iBAAiB;UAC3B,SAAS,MAAM,QAAQ,UAAU,CAAC;UAClC,SAAa,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;QAC5B;MACF,CAAC;IACH,OAAO;AAEL,gBAAU,KAAK,cAAc,wCAAwC;QACnE,4BAA4B;UAC1B,MAAU,iBAAiB;UAC3B,SAAa,oBAAoB;UACjC,WAAW,oBAAoB,SAAS;UACxC,OAAO,MAAM,QAAQ,KAAK;UAC1B,uBAAuB,MAAM,eAAe,CAAC;UAC7C,sBAAsB,SAAS,MAAM,uBAAuB,CAAC,CAAC;UAC9D,YAAY,MAAM,SAAS;UAC3B,iBAAiB,QAAQ;UACzB,KAAK,MAAM,QAAQ,GAAG;UACtB,gBAAgB,QAAQ,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;UAC3D,8BAA8B,QAAQ;UACtC,4BAA4B,QAAQ;QACtC;MACF,CAAC;IACH;AAEA,WAAO,KAAK,WAAW,KAAK,oBAAoB,MAAM,SAAS,gBAAgB,IAAI;EACrF;EAEO,aAAa,MAAY,kBAAmC,KAAK,iBAAiB;AACvF,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,iBAAiB;MACzC,SAAS;QACP,kBAAkB,KAAK;QACvB,sBAAsB,oBAAoB,KAAK,UAAU;QACzD,UAAU,SAAS,MAAM,KAAK,QAAQ;MACxC;MACA;IACF,CAAC;EACH;;;;;EAMO,mBACL,SACA,kBAAmC,KAAK,iBACxC;AACA,UAAM,EAAE,cAAc,YAAY,sBAAsB,QAAQ,IAAI;AACpE,UAAM,mBAAmB;MACvB,cAAc,2BAA2B,YAAY;MACrD,YAAY,MAAM,UAAU;MAC5B,sBAAsB,YAAY,oBAAoB;MACtD,SAAS,kBAAkB,OAAO;IACpC;AAEA,UAAM,WAAW,IAAI,MAAM,eAAe,EAAE;AAC5C,WAAO,KAAK,cAAc,+BAA+B;MACvD,SAAS;MACT;IACF,CAAC;EACH;;;;;EAMO,kBAAkB;AACvB,WAAO,KAAK,cAAc,kBAAkB;EAC9C;;;;;EAMO,UAAU,aAA8B;AAC7C,WAAO,KAAK,cAAc,sBAAsB,EAAE,QAAQ,YAAY,CAAC;EACzE;EAEO,iBACL,YACA,aACqB;AACrB,UAAM,kBAAkB,kBAAkB,WAAW;AACrD,QAAI;AAEJ,QAAI,CAAC,OAAO,UAAU,GAAG;AAEvB,gBAAU;QACR,WAAW,oBAAoB,WAAW,SAAS;QACnD,OAAO,MAAM,WAAW,KAAK;QAC7B,SAAS,MAAM,WAAW,UAAU,CAAC;MACvC;IACF,OAAO;AAEL,gBAAU;QACR,WAAW,oBAAoB,WAAW,SAAS;QACnD,OAAO,MAAM,WAAW,KAAK;QAC7B,iBAAiB,WAAW;QAC5B,KAAK,MAAM,WAAW,GAAG;QACzB,gBAAgB,WAAW,cAAc,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;QAC9D,8BAA8B,WAAW;QACzC,4BAA4B,WAAW;QACvC,yBAAyB,WAAW,sBAAsB,IAAI,CAAC,OAAO,MAAM,EAAE,CAAC;MACjF;IACF;AAEA,QAAI,WAAW,SAAA,mBAAiC;AAC9C,aAAO;;QAEL,MAAU,iBAAiB;QAC3B,gBAAgB,WAAW;QAC3B,UAAU,SAAS,MAAM,WAAW,QAAQ;QAC5C,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,QAAI,WAAW,SAAA,WAAkC;AAC/C,UAAI,CAAC,SAAS,WAAW,QAAQ,GAAG;AAElC,eAAO;UACL,MAAM,WAAW;UACjB,gBAAgB,WAAW;UAC3B,gBAAgB,WAAW;UAC3B,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;UACvD,GAAG;QACL;MACF;AACA,aAAO;;QAEL,MAAM,WAAW;QACjB,gBAAgB;UACd,GAAG,WAAW;UACd,gBAAgB,kBAAkB,WAAW,SAAS,cAAc;QACtE;QACA,qBAAqB,WAAW,qBAAqB;QACrD,gBAAgB,WAAW;QAC3B,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,QAAI,WAAW,SAAA,kBAAyC;AAEtD,YAAM,EAAE,yBAAyB,GAAG,YAAY,IAAI;AAEpD,aAAO;QACL,MAAM,WAAW;QACjB,sBAAsB,SAAS,MAAM,WAAW,uBAAuB,CAAC,CAAC;QACzE,YAAY,MAAM,WAAW,SAAS;QACtC,uBAAuB,MAAM,WAAW,eAAe,CAAC;QACxD,SAAS,MAAM,WAAW,WAAW,gBAAgB,EAAE;QACvD,GAAG;MACL;IACF;AACA,UAAM,MAAM,uDAAuD;EACrE;AACF;AChqBO,IAAM,oBAAN,MAWP;SAAA;;;EACU;EAER,YAAY,QAAoD;AAC9D,SAAK,SAAS;EAChB;EAEQ,qBAAqB,cAA0D;AACrF,WAAO,qBAAqB,cAAc,KAAK,QAAQ,MAAM;EAC/D;EAEQ,oBAAoB,UAAqD;AAC/E,WAAO;MACL;MACA,KAAK,QAAQ;MACb,KAAK,QAAQ;IACf;EACF;EAEO,sBAAsB,KAA0C;AACrE,WAAO,EAAE,QAAQ,WAAW,GAAG,IAAI;EACrC;EAEO,wBAAwB,KAA4D;AAGzF,QAAI,gBAAgB,OAAO,SAAS,IAAI,UAAU,GAAG;AACnD,aAAO;QACL,GAAI;QACJ,YAAY;UACV,QAAQ,IAAI;UACZ,MAAM;QACR;MACF;IACF;AAEA,WAAO;EACT;EAEO,yBAAyB,KAAyC;AACvE,UAAM,MAAM,IAAI,CAAC;AACjB,WAAO;MACL,aAAa,SAAS,IAAI,WAAW;MACrC,cAAc,SAAS,IAAI,YAAY;MACvC,WAAW,SAAS,IAAI,SAAS;MACjC,MAAM,IAAI;MACV,iBAAiB,KAAK,qBAAqB,IAAI,WAAW;MAC1D,gBAAgB,KAAK,oBAAoB,GAAG;MAC5C,mBAAmB,IAAI,oBAAoB,SAAS,IAAI,iBAAiB,IAAI;MAC7E,gBAAgB,IAAI,iBAAiB,SAAS,IAAI,cAAc,IAAI;IACtE;EACF;EAEO,6BAA6B,KAA6C;AAC/E,WAAO,IAAI,IAAI,CAAC,SAAS;MACvB,aAAa,SAAS,IAAI,WAAW;MACrC,cAAc,SAAS,IAAI,YAAY;MACvC,WAAW,SAAS,IAAI,SAAS;MACjC,MAAM,IAAI;MACV,iBAAiB,KAAK,qBAAqB,IAAI,WAAW;MAC1D,gBAAgB,KAAK,oBAAoB,GAAG;MAC5C,mBAAmB,IAAI,oBAAoB,SAAS,IAAI,iBAAiB,IAAI;MAC7E,gBAAgB,IAAI,iBAAiB,SAAS,IAAI,cAAc,IAAI;IACtE,EAAE;EACJ;EAEO,iCAML,KAC6B;AAC7B,WAAO,IAAI,IAAI,CAAC,OAA6B;AAC3C,aAAO;QACL,GAAG;QACH,iBAAiB,KAAK,qBAAqB,GAAG,eAAe,WAAW;QACxE,gBAAgB,KAAK,oBAAoB,GAAG,cAAc;MAC5D;IACF,CAAC;EACH;EAEO,2BAA2B,KAAkD;AAClF,WAAO;MACL,GAAI;MACJ,KAAK,SAAS,IAAI,GAAG,IAAI,KAAK,MAAM,IAAI,GAAG,IAAI,IAAI;IACrD;EACF;EAEO,wBAAwB,KAAgC;AAC7D,WAAO,IAAI,aAAa;EAC1B;AACF;AC9FO,IAAM,YAAN,MAAM,WAAwD;SAAA;;;EACnD;EAEA;EAEhB,YAAY,SAA4C;AACtD,KAAC,KAAK,eAAe,KAAK,KAAK,IAAI,WAAU,UAAU,OAAO,IAC1D,CAAC,WAAW,OAAO,IACnB,WAAU,WAAW,OAAO,IAC1B,CAAC,YAAY,OAAO,IACpB,WAAU,WAAW,OAAO,IAC1B,CAAC,YAAY,OAAO,IACpB,CAAC,SAAS,IAAI,MAAM,uBAAuB,CAAC;AAEpD,eAAW,CAAC,GAAG,KAAK,OAAO,QAAQ,IAAI,GAAG;AACxC,aAAO,eAAe,MAAM,KAAK;QAC/B,YAAY;MACd,CAAC;IACH;AAEA,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AAClD,aAAO,eAAe,MAAM,KAAK;QAC/B,YAAY;QACZ,UAAU;QACV;MACF,CAAC;IACH;EACF;EAEA,MAAM,WAAwC;AAC5C,QAAI,KAAK,iBAAiB,WAAW;AACnC,aAAO,UAAU,KAAK,aAAa,EAAG,KAAK,KAAY;IACzD;AACA,WAAQ,UAAiD,EAAE;EAC7D;EAEA,YAA0D;AACxD,WAAO,KAAK,kBAAkB;EAChC;EAEA,aAAyD;AACvD,WAAO,KAAK,kBAAkB;EAChC;EAEA,aAAyD;AACvD,WAAO,KAAK,kBAAkB;EAChC;EAEA,UAAU;AACR,WAAO,KAAK,kBAAkB;EAChC;EAEA,OAAO,UACL,oBAC4D;AAC5D,WACG,mBAA4D,qBAAA;EAGjE;EAEA,OAAO,WACL,oBAC0D;AAC1D,WACG,mBAA0D,qBAAA;EAG/D;EAEA,OAAO,WACL,oBAC0D;AAC1D,WACG,mBAA0D,WAAA;EAG/D;AACF;A7CnEO,IAAM,cAAN,MAA+C;SAAA;;;EAC7C;EAEA;EAEP,YAAY,mBAA0E;AACpF,QAAI,qBAAqB,aAAa,mBAAmB;AACvD,WAAK,UAAU,kBAAkB;AACjC,WAAK,iBACH,oBAAoB,oBAChB,kBAAkB,iBAClB,IAAI,kBAAkB;IAC9B,OAAO;AACL,WAAK,UAAU,IAAIC,YAAW,EAAE,GAAG,mBAAmB,UAAU,MAAM,CAAC;AACvE,WAAK,iBAAiB,IAAI,kBAAkB,mBAAmB,mBAAmB;IACpF;EACF;EAEO,MAAM,QAAgB,QAAiB,KAAsB,GAAG;AACrE,WAAO,KAAK,QAAQ,MAAM,QAAQ,QAAQ,EAAE;EAC9C;EAEA,MAAa,aAAa;AACxB,WAAO,KAAK,QAAQ,WAAW;EACjC;EAEA,MAAa,iBAAiB;AAC5B,WAAO,KAAK,QAAQ,eAAe;EACrC;EAEA,MAAa,mBACX,iBACA,iBACA;AACA,WAAO,KAAK,QAAQ,mBAAmB,iBAAiB,eAAe;EACzE;EAMA,MAAa,SAAS,iBAAmC;AACvD,WAAO,KAAK,QACT,qBAAqB,eAAe,EACpC,KAAK,KAAK,eAAe,qBAAqB;EACnD;;;;EAKA,MAAa,yBAAyB;AACpC,WAAO,KAAK,QAAQ,uBAAuB;EAC7C;;;;;;EAOA,MAAa,iBAAiB;AAC5B,WAAO,KAAK,QAAQ,eAAe;EACrC;EAEA,MAAa,qBAAqB,iBAAmC;AACnE,WAAO,KAAK,QAAQ,qBAAqB,eAAe;EAC1D;EAEA,MAAa,gBAAgB,iBAAmC;AAC9D,WAAO,KAAK,QAAQ,gBAAgB,eAAe;EACrD;;;;;;;;;;;;EAaA,MAAa,aACX,kBAAmC,WACnC,gBAAwB,KACxB;AACA,QAAI,oBAAA;AAAqC;AACzC,UAAM,eAAe,MAAM,KAAK,eAAe;AAC/C,UAAM,cACJ,oBAAA,YACI,eAAe,IACf,OAAO,MAAM,eAA+B,CAAC;AACnD,QAAI,eAAe;AAAc;AACjC,UAAM,EAAE,QAAQ,IAAI,KAAK;AACzB,QAAI,eAAe;AACnB,QAAI,gBAAyB;AAC7B,WAAO,CAAC,eAAe;AAErB,YAAM,YAAY,MAAM,KAAK,eAAe;AAC5C,UAAI,cAAc,aAAa;AAC7B,wBAAgB;MAClB,OAAO;AAEL,cAAM,KAAK,aAAa;MAC1B;AACA,sBAAgB;AAChB,UAAI,gBAAgB,GAAG;AACrB,cAAM,IAAI,MAAM,kCAAkC,OAAO,SAAS;MACpE;IACF;EACF;EAEA,MAAa,cAAc,iBAAmC;AAC5D,WAAO,KAAK,QACT,qBAAqB,eAAe,EACpC,KAAK,KAAK,eAAe,uBAAuB;EACrD;EAEA,MAAa,iBAAiB,UAAwB;AACpD,UAAM,cAAe,MAAM,KAAK,QAAQ,qBAAqB,QAAQ;AACrE,WAAO,YAAY,SAAS,cAAc,0CAA0C;AACpF,UAAM,EAAE,UAAU,kBAAkB,sBAAsB,MAAM,IAC9D;AACF,UAAM,SAAS;MACb,SAAS,CAAC;MACV;MACA;MACA;MACA,SAAS,SAAS;MAClB,GAAG,SAAS,MAAM,CAAC;IACrB;AACA,UAAM,WAAW;MACf,OAAO;QACL,CAAC,KAAa,QAAsB,MAAM,gBAAgB,MAAM,GAAG,CAAC,EAAE,SAAS,IAAI,GAAG;QACtF;MACF;IACF;AACA,WAAO,aAAa,WAAW,WAAWE,YAAW,QAAQ,CAAC,CAAC,CAAC;EAClE;EAEA,MAAa,qBAAqB,iBAAmC;AACnE,QAAI,KAAK,mBAAmB,gBAAM;AAChC,YAAM,IAAI,aAAa,oCAAoC;AAE7D,WAAO,KAAK,QAAQ,qBAAqB,eAAe;EAC1D;EAEO,iBAAiB,KAAK;EAM7B,MAAa,oBAAoB,iBAAmC;AAClE,WAAO,KAAK,QAAQ,oBAAoB,eAAe;EACzD;EAEA,MAAa,2BAA2B,iBAAmC;AACzE,WAAO,KAAK,QAAQ,2BAA2B,eAAe;EAChE;EAEA,MAAa,yBAAyB,iBAAmC;AACvE,WAAO,KAAK,QAAQ,yBAAyB,eAAe;EAC9D;;;;;;EAOA,MAAa,yBAAyB;AACpC,UAAM,EAAE,aAAa,IAAI,MAAM,KAAK;MAAA;;IAAqC,EAAE;MACzE,KAAK,eAAe;IACtB;AACA,WAAO,QAAQ,IAAI,aAAa,IAAI,CAAC,OAAY,KAAK,qBAAqB,EAAE,CAAC,CAAC;EACjF;EAEA,MAAa,eAAe,QAAsB;AAChD,WAAO,KAAK,QAAQ,qBAAqB,MAAM;EACjD;EAEA,MAAa,qBAAqB,QAAsB;AACtD,WAAO,KAAK,QAAQ,qBAAqB,MAAM;EACjD;EAEA,MAAa,gCAAgC,iBAAkC,OAAe;AAC5F,WAAO,KAAK,QAAQ,gCAAgC,iBAAiB,KAAK;EAC5E;EAEA,MAAa,sBAAsB,QAA8D;AAC/F,UAAM,oBAAoB,MAAM,KAAK,QAAQ,sBAAsB,MAAM;AACzE,UAAM,4BACJ,KAAK,eAAe,wBAAwB,iBAAiB;AAC/D,WAAO,IAAI,UAAU,yBAAyB;EAChD;EAEA,MAAa,oBAAoB,QAAsB;AACrD,WAAO,KAAK,QAAQ,oBAAoB,MAAM;EAChD;;;;EAKA,MAAa,qBAAqB,iBAA+B;AAC/D,WAAO,KAAK,QAAQ,qBAAqB,eAAe;EAC1D;;;;;;;;EASA,MAAa,uBACX,aACA,SACA;AAEA,WAAO,KAAK,QACT,oBAAoB,aAAa,OAAO,EACxC,KAAK,CAAC,MAAM,KAAK,eAAe,iCAAiC,CAAC,CAAC;EACxE;EAEA,MAAa,mBACX,QACA,SACwC;AACxC,UAAM,kBAAmB,MAAM,KAAK,QAAQ;MAC1C;MACA;IACF;AAEA,WAAO,IAAI,UAAU,eAAe;EACtC;EAEA,MAAa,aACX,iBACA,KACA,iBACA;AACA,WAAO,KAAK,QAAQ,aAAa,iBAAiB,KAAK,eAAe;EACxE;EAEA,MAAa,eAAe,iBAA+B,iBAAmC;AAC5F,WAAO,KAAK,QAAQ,eAAe,iBAAiB,eAAe;EACrE;EAEA,MAAa,eAAe,WAAyB;AACnD,WAAO,KAAK,SAAS,SAAS;EAChC;EAEA,MAAa,SAAS,WAAyB,iBAAmC;AAChF,WAAO,KAAK,QACT,SAAS,WAAW,eAAe,EACnC,KAAK,KAAK,eAAe,0BAA0B;EACxD;EAEA,MAAa,WAAW,iBAA+B,iBAAmC;AACxF,WAAO,KAAK,QACT,WAAW,iBAAiB,eAAe,EAC3C,KAAK,KAAK,eAAe,0BAA0B;EACxD;EAaA,MAAa,mBACX,iBACA,WACA;IACE,kBAAkB,KAAK,QAAQ;IAC/B,WAAW;EACb,IAA+B,CAAC,GACN;AAC1B,QAAI;AACJ,QAAI,iBAAiB;AACnB,sBAAgB,MAAM,KAAK,WAAW,iBAAiB,eAAe;IACxE,WAAW,WAAW;AACpB,sBAAgB,MAAM,KAAK,SAAS,WAAW,eAAe;IAChE,OAAO;AACL,YAAM,MAAM,yDAAyD;IACvE;AAEA,QAAI,SAAS,aAAa,GAAG;AAC3B,UAAI,UAAU;AACZ,cAAM,UAAU,sBAAsB,cAAc,GAAG;AACvD,eAAO,EAAE,OAAO,KAAK,UAAU,QAAQ,SAAS;MAClD;AACA,aAAO,EAAE,OAAO,KAAK,UAAU,OAAU;IAC3C;AACA,WAAO,EAAE,OAAO,KAAK,UAAU,IAAI;EACrC;;;;EAKA,MAAa,eACX,YACA,mBACA,iBACA,cACA;AACA,WAAO,KAAK,qBAAqB,YAAY,mBAAmB,iBAAiB,YAAY;EAC/F;EAEA,MAAa,qBACX,YACA,mBACA,iBACA,cACA;AACA,WAAO,KAAK,QACT;MACC;QACE;UACE,MAAA;UACA,GAAG;UACH,GAAG;QACL;MACF;MACA,EAAE,iBAAiB,aAAa;IAClC,EACC,KAAK,CAAC,MAAM,KAAK,eAAe,yBAAyB,CAAC,CAAC;EAChE;EAEA,MAAa,sBACX,YACA,SACA,iBACA,cACA;AACA,WAAO,KAAK,QACT;MACC;QACE;UACE,MAAA;UACA,GAAG;UACH,GAAG;QACL;MACF;MACA,EAAE,iBAAiB,aAAa;IAClC,EACC,KAAK,CAAC,MAAM,KAAK,eAAe,yBAAyB,CAAC,CAAC;EAChE;EAEA,MAAa,4BACX,YACA,SACA,iBACA,cACA;AACA,WAAO,KAAK,QACT;MACC;QACE;UACE,MAAA;UACA,GAAG;UACH,GAAG;QACL;MACF;MACA,EAAE,iBAAiB,aAAa;IAClC,EACC,KAAK,CAAC,MAAM,KAAK,eAAe,yBAAyB,CAAC,CAAC;EAChE;EAEA,MAAa,mBACX,aACA,SACA;AACA,WAAO,KAAK,QACT,eAAe,aAAa,OAAO,EACnC,KAAK,CAAC,MAAM,KAAK,eAAe,6BAA6B,CAAC,CAAC;EACpE;EAEA,MAAa,eACX,oBACA,SACA;AACA,WAAO,KAAK,QAAQ,OAAO,oBAAoB,OAAO;EACxD;EAEA,MAAa,gBACX,aACA,SACA;AACA,WAAO,KAAK,QAAQ,QAAQ,aAAa,OAAO;EAClD;EAEA,MAAa,sBACX,aACA,SACA;AACA,WAAO,KAAK,QAAQ;MAClB;MACA;IACF;EACF;EAEA,MAAa,aAAa,MAAY,iBAAmC;AACvE,WAAO,KAAK,QAAQ,aAAa,MAAM,eAAe;EACxD;;;;;EAMA,MAAa,mBAAmB,SAAwB,iBAAmC;AACzF,WAAO,KAAK,QAAQ,mBAAmB,SAAS,eAAe;EACjE;;;;;EAMA,MAAa,kBAAkB;AAC7B,WAAO,KAAK,QAAQ,gBAAgB;EACtC;;;;;EAMA,MAAa,UAAU,aAA8B;AACnD,WAAO,KAAK,QAAQ,UAAU,WAAW;EAC3C;AACF;A+C9dA,IAAA,qBAAA,CAAA;AAAAX,UAAA,oBAAA;EAAA,oBAAA,6BAAA,oBAAA;EAAA,4BAAA,6BAAA,4BAAA;EAAA,6BAAA,6BAAA,6BAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,4BAAA,6BAAA,4BAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,WAAA,6BAAA,WAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,+BAAA,6BAAA,+BAAA;EAAA,gCAAA,6BAAA,gCAAA;EAAA,0BAAA,6BAAA,0BAAA;EAAA,0BAAA,6BAAA,0BAAA;EAAA,+BAAA,6BAAA,+BAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,YAAA,6BAAA,YAAA;AAAA,CAAA;AAMA,IAAM,gBAAgB;AACtB,IAAM,mBAAmB,OAAO,cAAc,SAAS,CAAC;AACxD,IAAM,cAAc;AACpB,IAAM,oBAAoB,OAAO,cAAc,MAAM;AACrD,IAAM,kBAAkB,OAAO,YAAY,MAAM;AACjD,IAAM,yBAAyB,OAAO,YAAY,SAAS,CAAC;AAE5D,SAAS,aAAa,KAA+B;AACnD,MAAI,IAAI;AACR,SAAO,IAAI,SAAS,YAAY,YAAY,SAAS,CAAC,CAAC,GAAG;AACxD,UAAM,IAAI,UAAU,GAAG,IAAI,SAAS,CAAC;AACrC,SAAK;EACP;AACA,SAAO,CAAC,KAAK,CAAC;AAChB;AAPS;AAmBF,SAAS,WAAW,SAA2B;AACpD,MAAI,UAAU;AAEd,UAAQ,QAAQ,CAAC,cAAc;AAC7B,WAAO,cAAc,MAAM;AACzB,YAAM,OAAO,YAAY;AACzB,mBAAa;AACb,UAAI,SAAS,OAAO,cAAc,MAAM,GAAG;AACzC,cAAM,gBAAgB,YAAY;AAClC,YAAI,kBAAkB,MAAM;AAC1B,gBAAM,QAAQ,YAAY;AAC1B,sBAAY;AACZ,cAAI,UAAU;AAAM,uBAAW,cAAc,CAAC;;AACzC,uBAAW,YAAY,OAAO,KAAK,IAAI,CAAC;QAC/C,OAAO;AACL,gBAAM,QAAQ,YAAY;AAC1B,qBAAW,YAAY,OAAO,KAAK,CAAC;AACpC,uBAAa;QACf;MACF;AAAO,mBAAW,cAAc,OAAO,IAAI,CAAC;IAC9C;AAEA,UAAM,CAAC,KAAK,CAAC,IAAI,aAAa,OAAO;AACrC,QAAI;AACF,gBACE,OACC,IAAI,MAAM,IACP,YAAY,YAAY,SAAS,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC,IACpD,YAAY,CAAC,IACb,cAAc,CAAC,IACf,YAAY,YAAY,SAAS,CAAC,EAAE,QAAQ,IAAI,KAAK,IAAI,CAAC;AAClE,eAAW;EACb,CAAC;AAED,MAAI,CAAC,SAAS;AACZ,WAAO;EACT;AAEA,SAAO,QAAQ,OAAO,OAAO;AAC/B;AAvCgB;AAoDT,SAAS,WAAW,SAAyB;AAClD,MAAI,UAAU,OAAO,CAAC;AACtB,MAAI,aAAa,OAAO,CAAC;AAEzB,MAAI,QAAQ,SAAS,YAAY,CAAC,IAAI,cAAc,CAAC,CAAC,GAAG;AACvD,UAAM,CAAC,KAAK,CAAC,IAAI,aAAa,QAAQ,UAAU,GAAG,QAAQ,SAAS,CAAC,CAAC;AACtE,cAAU,MAAM,YAAY,YAAY,SAAS,CAAC,EAAE,OAAO,KAAK,IAAI,EAAE;EACxE,OAAO;AACL,UAAM,CAAC,KAAK,CAAC,IAAI,aAAa,OAAO;AACrC,QAAI;AAAG,gBAAU,MAAM,YAAY,YAAY,SAAS,CAAC,EAAE,OAAO,IAAI,KAAK,IAAI,EAAE;EACnF;AAEA,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1C,UAAM,OAAO,QAAQ,CAAC;AACtB,UAAM,QAAQ,cAAc,QAAQ,IAAI;AACxC,UAAM,UAAU,OAAO,cAAc,QAAQ,IAAI,CAAC;AAElD,QAAI,UAAU,IAAI;AAEhB,UAAI,MAAM,QAAQ,SAAS,KAAK,QAAQ,CAAC,MAAM,cAAc,CAAC,GAAG;AAC/D,mBAAW,aAAa;AACxB,sBAAc;AAEd,sBAAc;MAChB,OAAO;AACL,mBAAW,aAAa;AACxB,sBAAc;MAChB;IACF,WAAW,YAAY,QAAQ,IAAI,MAAM,IAAI;AAE3C,iBAAW,aAAa;AACxB,oBAAc;AAEd,YAAM,SAAS,MAAM,QAAQ,SAAS,IAAI,IAAI,KAAK,YAAY,QAAQ,IAAI;AAC3E,iBAAW,aAAa,OAAO,KAAK;AACpC,oBAAc;IAChB;EACF;AAEA,SAAO;AACT;AAxCgB;AA0CT,IAAK,qBAAL,kBAAKY,wBAAL;AACLA,sBAAA,SAAA,IAAU;AACVA,sBAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAA,sBAAA,CAAA,CAAA;AAiBL,SAAS,sBAAsB,SAAkC;AACtE,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI,MAAM,iDAAiD;EACrE;AACF;AAXgB;AAaT,IAAK,6BAAL,kBAAKC,gCAAL;AACLA,8BAAA,SAAA,IAAU;AACVA,8BAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAA,8BAAA,CAAA,CAAA;AAmBL,SAAS,8BAA8B,SAAkC;AAC9E,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI,MAAM,mEAAmE;EACvF;AACF;AAXgB;AAaT,IAAM,8BACX;AAcK,SAAS,+BAA+B,SAAkC;AAC/E,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI,MAAM,oEAAoE;EACxF;AACF;AAXgB;AAaT,IAAK,6BAAL,kBAAKC,gCAAL;AACLA,8BAAA,SAAA,IAAU;AACVA,8BAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAA,8BAAA,CAAA,CAAA;AAiBL,SAAS,8BAA8B,SAAkC;AAC9E,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI,MAAM,mEAAmE;EACvF;AACF;AAXgB;AAaT,IAAK,wBAAL,kBAAKC,2BAAL;AACLA,yBAAA,SAAA,IAAU;AACVA,yBAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAA,yBAAA,CAAA,CAAA;AAiBL,SAAS,yBAAyB,SAAkC;AACzE,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI;QACR;MACF;EACJ;AACF;AAbgB;AAeT,IAAK,wBAAL,kBAAKC,2BAAL;AACLA,yBAAA,SAAA,IAAU;AACVA,yBAAA,iBAAA,IAAkB;AAFR,SAAAA;AAAA,GAAA,yBAAA,CAAA,CAAA;AAiBL,SAAS,yBAAyB,SAAkC;AACzE,UAAQ,SAAS;IACf,KAAA;AACE,aAAO;IAET,KAAA;AACE,aAAO;IAET;AACE,YAAM,IAAI;QACR;MACF;EACJ;AACF;AAbgB;AAmCT,SAAS,UACd,UACA,UAAgC,QAChC,aAAmC,QAClB;AACjB,SAAO,IAAI,gBAAgB;IACzB,QAAQ;IACR,SAAS,UAAU,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI;IAC/D,YAAY,aAAa,MAAM,WAAW,CAAC,GAAG,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI;EAChF,CAAC;AACH;AAVgB;AA0BT,SAAS,YACd,WACA,YAAkC,QACjB;AACjB,SAAO,IAAI,gBAAgB;IACzB,WAAW;IACX,WAAW,YAAY,MAAM,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI;EAC7D,CAAC;AACH;AARgB;AA4BT,SAAS,gBACd,WACA,YAAwC,QACxC,iBAA6C,QAC5B;AACjB,SAAO,IAAI,gBAAgB;IACzB,WAAW;IACX,WAAW,YAAY,MAAM,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI;IAC3D,gBAAgB,iBAAiB,MAAM,eAAe,CAAC,GAAG,eAAe,CAAC,CAAC,IAAI;EACjF,CAAC;AACH;AAVgB;AC7WT,IAAM,aAAN,MAAM,YAAW;SAAA;;;EACtB,MAAM,aAAa,SAAuBJ,qBAA6B;AACrE,WAAO,YAAW;;MAEN;MACV;MACAA;IACF;EACF;EAEA,MAAa,wBAAwB,MAAcA,qBAA8C;AAC/F,WAAO,YAAW;;MAEN;MACV;MACAA;IACF;EACF;EAEA,MAAM,gBACJ,SACAA,qBACAC,6BACAC,6BACAC,wBACAC,wBACAC,8BACA;AACA,WAAO,YAAW;;MAEN;MACV;MACAL;MACAC;MACAC;MACAC;MACAC;MACAC;IACF;EACF;EAEA,aAAa,aACX,UACA,SACAL,qBACiB;AACjB,UAAM,UAAU,MAAM,SAAS,WAAW;AAC1C,UAAM,WAAWA,uBAAsB,sBAAsB,OAAO;AAEpE,QAAI;AACF,YAAM,YAAY,MAAM,SAAS,aAAa;QAC5C,iBAAiB;QACjB,YAAY;QACZ,UAAU,SAAS,QAAQ;UACzB;UACA,MAAM,CAAC;QACT,CAAC;MACH,CAAC;AACD,YAAM,gBAAgB,UAAU,IAAI,CAAC,YAAY,OAAO,OAAO,CAAC,EAAE,MAAM,CAAC;AAEzE,YAAM,eAAe,WAAW,aAAa;AAE7C,UAAI,CAAC,cAAc;AACjB,cAAM,MAAM,qBAAqB;MACnC;AAEA,aAAO;IACT,SAAS,GAAG;AACV,UAAI,aAAa,SAAS,EAAE,YAAY,uBAAuB;AAC7D,cAAM;MACR;AACA,YAAM,MAAM,0BAA0B;IACxC;EACF;EAEA,aAAa,wBACX,UACA,MACAA,qBACiB;AACjB,UAAM,UAAU,MAAM,SAAS,WAAW;AAC1C,UAAM,WAAWA,uBAAsB,sBAAsB,OAAO;AAEpE,QAAI;AACF,YAAM,gBAAgB,KACnB,QAAQ,UAAU,EAAE,EACpB,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,WAAW,IAAI,EAAE,SAAS,EAAE,CAAC;AAE9C,YAAM,cAAc,MAAM,SAAS,aAAa;QAC9C,iBAAiB;QACjB,YAAY;QACZ,UAAU,SAAS,QAAQ,EAAE,QAAQ,eAAe,MAAM,CAAC,EAAE,CAAC;MAChE,CAAC;AAED,aAAO,YAAY,CAAC;IACtB,QAAQ;AACN,YAAM,MAAM,uCAAuC;IACrD;EACF;EAEA,aAAa,gBACX,UACA,SACAA,qBACAC,6BACAC,6BACAC,wBACAC,wBACAC,8BACuB;AACvB,UAAM,UAAU,MAAM,SAAS,WAAW;AAC1C,UAAM,WAAWL,uBAAsB,sBAAsB,OAAO;AACpE,UAAM,mBAAmBC,+BAA8B,8BAA8B,OAAO;AAC5F,UAAM,mBAAmBC,+BAA8B,8BAA8B,OAAO;AAC5F,UAAM,cAAcC,0BAAyB,yBAAyB,OAAO;AAC7E,UAAM,cAAcC,0BAAyB,yBAAyB,OAAO;AAC7E,UAAM,mBAAmBC,gCAA+B,+BAA+B,OAAO;AAE9F,QAAI;AACF,YAAM,QAAsB;QAC1B;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,gBAAgB,QAAQ;UAC5B,UAAU,gBAAgB,oBAAoB,mBAAmB,CAAC;UAClE,UAAU,CAAC,gBAAgB,OAAO,GAAG,gBAAgB,GAAG,CAAC;QAC3D;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,QAAQ;UACxB,UAAU,YAAY,oBAAoB,cAAc,CAAC;UACzD,UAAU,CAAC,gBAAgB,QAAW,QAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,mBAAmB,CAAC;UAC9D,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,SAAS,CAAC;YAC5C,gBAAgB,gBAAgB;YAChC,gBAAgB,GAAG;UACrB;QACF;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,mBAAmB,CAAC;UAC9D,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,QAAQ,CAAC;YAC3C,gBAAgB,gBAAgB;YAChC,gBAAgB,GAAG;UACrB;QACF;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,mBAAmB,CAAC;UAC9D,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,SAAS,CAAC;YAC5C,gBAAgB,gBAAgB;YAChC,gBAAgB,GAAG;UACrB;QACF;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,mBAAmB,CAAC;UAC9D,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,qBAAqB,CAAC;YACxD,gBAAgB,WAAW;YAC3B,gBAAgB,GAAG;UACrB;QACF;;QAEA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,mBAAmB,CAAC;UAC9D,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,iBAAiB,CAAC;YACpD,gBAAgB,WAAW;YAC3B,gBAAgB,GAAG;UACrB;QACF;QACA;UACE,WAAW,UAAU,CAAC,CAAC;UACvB,IAAI,YAAY,gBAAgB;UAChC,UAAU,YAAY,oBAAoB,4BAA4B,CAAC;UACvE,UAAU;YACR,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC;YACjC,gBAAgB,kBAAkB,WAAW,CAAC;YAC9C,gBAAgB,GAAG;YACnB,gBAAgB,WAAW;YAC3B,gBAAgB,GAAG;UACrB;QACF;QACA;UACE,WAAW,UAAU,QAAW,QAAW,CAAC,GAAG,GAAG,CAAC,CAAC;UACpD,IAAI,YAAY,QAAW,CAAC,GAAG,CAAC,CAAC;UACjC,UAAU,YAAY,oBAAoB,UAAU,CAAC;UACrD,UAAU,CAAC,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC,GAAG,gBAAgB,QAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QACnF;MACF;AAEA,YAAM,OAAO,MAAM,SAAS,aAAa;QACvC,iBAAiB;QACjB,YAAY;QACZ,UAAU,SAAS,QAAQ;UACzB;QACF,CAAC;MACH,CAAC;AAED,UAAI,MAAM,QAAQ,IAAI,GAAG;AAEvB,cAAM,OAAO,SAAS,KAAK,CAAC,GAAG,EAAE;AACjC,cAAM,aAAyB,CAAC;AAChC,YAAI,QAAQ;AACZ,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK,GAAG;AAChC,cAAI,QAAQ,KAAK,QAAQ;AACvB,kBAAM,eAAe,SAAS,KAAK,KAAK,GAAG,EAAE;AAC7C,qBAAS;AAET,kBAAM,WAAW,KAAK,MAAM,OAAO,QAAQ,YAAY;AACvD,uBAAW,KAAK,QAAQ;AAExB,qBAAS;UACX,OAAO;AACL;UACF;QACF;AAEA,cAAM,OAAO,WAAW,WAAW,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,cAAc,OAAO,SAAS,CAAC,CAAC;AAEpF,cAAM,UACJ,WAAW,CAAC,EAAE,CAAC,MAAM,QAAQ,OAAO,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,IAAI;AACrE,cAAM,SAAS,WAAW,CAAC,EAAE,CAAC,MAAM,QAAQ,OAAO,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,IAAI;AAClF,cAAM,UACJ,WAAW,CAAC,EAAE,CAAC,MAAM,QAAQ,OAAO,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,IAAI;AACrE,cAAM,oBAAoB,WAAW,CAAC,EAAE,CAAC,MAAM;AAE/C,cAAM,yBACJ,KAAK,CAAC,MAAM,QACR,WAAW,CAAC,EACT,MAAM,CAAC,EACP,IAAI,CAAC,QAAgB,kBAAkB,GAAG,CAAC,EAC3C,KAAK,EAAE,IACV;AAEN,cAAM,iBACJ,0BACA,sCAAsC,OAAO,WAAW,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC;AAE3E,eAAO;UACL;UACA;UACA;UACA;UACA;UACA;QACF;MACF;AACA,YAAM,MAAM,wCAAwC;IACtD,SAAS,GAAG;AACV,UAAI,aAAa,OAAO;AACtB,cAAM;MACR;AACA,YAAM,MAAM,oDAAoD;IAClE;EACF;AACF;AF/RO,IAAMC,eAAN,cAA0B,MAAM,aAAiB,UAAU,EAAE;SAAA;;;AAAC;AIC9D,IAAM,kBAAkB,IAAI,YAAY,EAAE,SAAS,KAAK,CAAC;AEPhE,IAAA,oBAAA,CAAA;AAAAC,UAAA,mBAAA;EAAA,mBAAA,6BAAA,mBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,eAAA,6BAAA,eAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,iBAAA,6BAAA,iBAAA;AAAA,CAAA;ACAA,IAAA,iBAAA,CAAA;AAAAA,UAAA,gBAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,iBAAA,6BAAA,iBAAA;AAAA,CAAA;AAGO,IAAM,aAAN,MAAM,YAAW;SAAA;;;EACf;EAEA,WAAuB,CAAC;EAExB;EAEA;;;;;;;;;;;;;;;;;;;EAoBP,YACE,YACA,aAA2D,qBAC3D;AACA,SAAK,aAAa;AAClB,SAAK,SAAS;AACd,SAAK,OAAO,KAAK,MAAM,UAAU;EACnC;;EAGQ,MAAM,QAA0B;AACtC,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,OAAO,CAAC;IACjB;AACA,QAAI,OAAO,WAAW,KAAK,OAAO,QAAQ;AACxC,WAAK,SAAS,KAAK,MAAM;IAC3B;AACA,UAAM,YAAsB,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AACzC,UAAI,IAAI,MAAM,OAAO,QAAQ;AAC3B,kBAAU,KAAK,YAAW,KAAK,OAAO,CAAC,GAAG,OAAO,KAAK,UAAU,CAAC;MACnE,OAAO;AACL,kBAAU,KAAK,YAAW,KAAK,OAAO,CAAC,GAAG,OAAO,IAAI,CAAC,GAAG,KAAK,UAAU,CAAC;MAC3E;IACF;AACA,WAAO,KAAK,MAAM,SAAS;EAC7B;;;;;;;;;;;;;;;;;;EAmBA,OAAO,KACL,GACA,GACA,aAA2D,qBAC3D;AACA,UAAM,CAAC,SAAS,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAO,KAAK,IAAI,IAAI,EAAG;AAClF,WAAO,WAAW,SAAS,OAAO;EACpC;;;;;;;;;;;;;;;;;;;;EAqBO,SAAS,MAAc,SAAS,KAAK,QAAQ,WAAqB,CAAC,GAAa;AACrF,UAAM,QAAQ,OAAO,QAAQ,IAAI;AACjC,QAAI,UAAU,IAAI;AAChB,YAAM,IAAI,MAAM,gBAAgB;IAClC;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;IACT;AACA,UAAM,SAAS,QAAQ,MAAM;AAC7B,UAAM,gBAAgB,SAAS,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,CAAC,MAAM;AACzE,UAAM,cAAc,CAAC,GAAG,UAAU,YAAY;AAC9C,UAAM,0BACJ,KAAK,OAAO,WAAW,OAAO,SAC1B,KACA,KAAK,SAAS,UAAU,CAAC,MAAM,EAAE,WAAW,OAAO,MAAM;AAC/D,UAAM,aAAa,KAAK,SAAS,0BAA0B,CAAC,KAAK,CAAC,KAAK,IAAI;AAC3E,WAAO,KAAK;MACV,YAAW,KAAK,SAAS,OAAO,cAAc,SAAS,eAAe,MAAM,KAAK,UAAU;MAC3F;MACA;IACF;EACF;AACF;AAsBO,SAAS,gBACd,MACA,MACA,MACA,aAA2D,qBAClD;AACT,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO,SAAS;EAClB;AACA,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,SAAO,gBAAgB,MAAM,WAAW,KAAK,MAAM,MAAM,UAAU,GAAG,MAAM,UAAU;AACxF;AAXgB;AD5GhB,IAAM,cAAkC;EACtC,MAAM,KAAK,MAAM,yEAAyE;EAC1F,aAAa,KAAK;IAChB;EACF;EACA,OAAO,KAAK;IACV;EACF;AACF;AAEA,IAAM,wBAAyD;EAC7D,CAAC,kBAAS,MAAM,GAAG;IACjB,QAAQ;IACR,YAAY;IACZ,kBAAkB;IAClB,kBAAkB,wBAAC,MAAM,IAAI,CAAC,KAAZ;IAClB;EACF;EACA,CAAC,kBAAS,MAAM,GAAG;IACjB,QAAQ;IACR,YAAY;IACZ,kBAAkB;IAClB,kBAAkB,wBAAC,MAAM,GAAP;IAClB,aAAa,CAAC;EAChB;AACF;AAEA,SAAS,YAAY,MAAe,MAAc,EAAE,KAAK,IAAI,GAAiC;AAC5F,QAAM,QAAQ,OAAO,IAAc;AACnC,SAAO,SAAS,OAAO,SAAS,KAAK,GAAG,KAAK,KAAK,IAAI,uBAAuB,GAAG,KAAK,GAAG,GAAG;AAC7F;AAHS;AAKT,SAAS,iBAAiB,EAAE,OAAO,OAAO,GAAc;AACtD,MAAI,sBAAsB,kBAAS,MAAM,EAAE,UAAU,SAAS,OAAO,aAAa,kBAAS;AACzF,WAAO,kBAAS;AAElB,MACE,sBAAsB,kBAAS,MAAM,EAAE,UAAU,UAChD,OAAO,YAAY,kBAAS,YAAY,kBAAS;AAElD,WAAO,kBAAS;AAElB,SAAO;AACT;AAXS;AAaT,SAAS,OAAO,OAA6B;AAC3C,MAAI;AACF,WAAO,MAAM,KAAK;EACpB,SAAS,GAAG;AACV,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,MAAM,kBAAkB,KAAK,CAAC;IACvC;AACA,UAAM,IAAI,MAAM,yBAAyB,KAAK,EAAE;EAClD;AACF;AATS;AAcT,SAAS,kBAAkB,MAAkC;AAC3D,QAAM,YAAY;AAClB,SAAO;IACL,UAAU,WAAW,UAAU,eAAe,UAAU,SAAS,iBAAiB,SAAS;EAC7F;AACF;AALS;AAaF,SAAS,gBAAgB,UAA0B;AACxD,SAAOC,OAAM,QAAQ,IAAI,WAAW,oBAAoB,QAAQ;AAClE;AAFgB;AAWT,SAAS,iBAAiB,MAAgD;AAC/E,SAAO,KAAK,SAAS;AACvB;AAFgB;AAQT,SAAS,gBACd,OACA,MACA,eAAyB,CAAC,GAC1B,WAAmB,IACnB,WAAqB,kBAAS,QACpB;AAEV,MAAI,KAAK,KAAK,SAAS,CAAC,MAAM,KAAK;AACjC,WAAO,KAAK,MAAM,GAAG,EAAE;EACzB,WAAW,aAAa,kBAAS,QAAQ;AAEvC,QAAI,SAAS,QAAQ;AACnB,aAAO;IACT,WAES,KAAK,MAAM,UAAU,GAAG;AAC/B,aAAO,KAAK,MAAM,GAAG,EAAE;IACzB;EACF;AAEA,MAAI,aAAa,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,GAAG;AAC/C,WAAO;EACT;AAEA,SAAO;IACL;IACA,GAAI,MAAM,IAAI,EAAyB;MACrC,CAAC,UAAU,MAAM;QACf,GAAG;QACH,GAAG,gBAAgB,OAAO,EAAE,MAAM,UAAU,EAAE,UAAU,QAAQ,EAAE;UAChE,CAAC,eAAe,CAAC,SAAS,SAAS,UAAU;QAC/C;MACF;MACA,CAAC;IACH;EACF;AACF;AArCgB;AAuChB,SAAS,kBAAkB,OAA2B,KAAc;AAClE,MAAI,IAAI,UAAU,IAAI,KAAK;AACzB,UAAM,aAAa,MAAM,IAAI,MAAM;AACnC,UAAM,aAAa,WAAW,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AAC5D,UAAM,eAAe,iBAAiB,UAAU;AAChD,QAAI,CAAC,cAAc;AACjB,YAAM,IAAI,MAAM,GAAG,IAAI,GAAG,uBAAuB;IACnD;AACA,QAAI,WAAW,SAAS,SAAS,GAAG,GAAG;AACrC,YAAM,IAAI,MAAM,mEAAmE,IAAI,GAAG,EAAE;IAC9F;AACA,WAAO,WAAW;EACpB;AACA,SAAO;AACT;AAdS;AAmBF,SAAS,WACd,OACA,MACA,WAAqB,kBAAS,QACtB;AACR,QAAM,WACJ,aAAa,kBAAS,SAClB,EAAE,GAAG,OAAO,GAAG,sBAAsB,QAAQ,EAAE,YAAY,IAC3D;AACN,QAAM,CAAC,SAAS,GAAG,YAAY,IAAI;IACjC;IACA;IACA;IACA;IACA;EACF;AACA,QAAM,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,GAAG,aAAa,KAAK,CAAC;AAEjE,QAAM,MAAM,sBAAsB,QAAQ,EAAE;AAE5C,SAAO,SACJ,IAAI,CAAC,eAAe;AACnB,UAAM,qBAAqB,SAAS,UAAU,EAAE,IAAI,CAAC,MAAM;AACzD,YAAM,aACJ,EAAE,SAAS,UAAU,aAAa,kBAAS,SACtC,EAAuB,WACxB,EAAE;AAER,YAAM,aAAa,WAAW,MAAM,UAAU,IAC1C,IAAI,WACD,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,EACT,IAAI,CAAC,MAAO,IAAI,IAAI,CAAC,IAAI,CAAE,EAC3B,KAAK,GAAG,CAAC,MACZ,IAAI,UAAU;AAClB,aAAO,GAAG,IAAI,EAAE,IAAI,CAAC,IAAI,UAAU;IACrC,CAAC;AACD,WAAO,GAAG,IAAI,UAAU,CAAC,IAAI,kBAAkB;EACjD,CAAC,EACA,KAAK,EAAE;AACZ;AAxCgB;AA6CT,SAAS,YACd,OACA,MACA,WAAqB,kBAAS,QACtB;AACR,SAAO,oBAAoB,WAAW,OAAO,MAAM,QAAQ,CAAC;AAC9D;AANgB;AAYT,SAAS,YACd,OACA,MACA,MACA,MAAe,CAAC,GAChB,WAAqB,kBAAS,QACZ;AAClB,MAAI,MAAM,IAAI,GAAG;AACf,WAAO,CAAC,MAAM,cAAc,OAAO,MAAM,MAA8B,QAAQ,CAAC;EAClF;AAEA,MAAI,sBAAsB,QAAQ,EAAE,YAAY,IAAI,GAAG;AACrD,WAAO;MACL;MACA;QACE,sBAAsB,QAAQ,EAAE;QAChC;QACA;QACA;MACF;IACF;EACF;AAEA,MAAI,KAAK,SAAS,GAAG,GAAG;AACtB,UAAM,SAAoB,KAAqC;MAC7D,CAAC,UAAU,YAAY,OAAO,KAAK,MAAM,GAAG,EAAE,GAAG,OAAO,QAAW,QAAQ,EAAE,CAAC;IAChF;AACA,WAAO,CAAC,MAAM,sBAAsB,QAAQ,EAAE,WAAW,MAAM,CAAC;EAClE;AAEA,UAAQ,MAAM;IACZ,KAAK,QAAQ;AACX,UAAI,aAAa,kBAAS,QAAQ;AAChC,cAAM,CAAC,YAAY,WAAW,IAAI,OAAO,QAAQ,IAA4B,EAAE,CAAC;AAEhF,cAAM,aAAa,MAAM,IAAI,MAAgB,EAAE,CAAC;AAChD,cAAM,WAAW,MAAM,WAAW,QAAQ;AAC1C,cAAM,cAAc,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,UAAU;AAC9D,cAAM,eAAe,SAAS,QAAQ,WAAW;AAEjD,cAAM,kBAAkB,YAAY,KACjC,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,UAAU;AACvB,cAAI,CAAC;AAAS,mBAAO;AACrB,gBAAM,cAAe,YAA0B,KAAK;AACpD,iBAAO,YAAY,OAAO,SAAS,aAAa,QAAW,QAAQ,EAAE,CAAC;QACxE,CAAC;AACH,eAAO;UACL;UACA,sBAAsB,QAAQ,EAAE,WAAW,CAAC,cAAc,GAAG,eAAe,CAAC;QAC/E;MACF;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK,cAAc;AACjB,YAAM,iBAAiB,kBAAkB,OAAO,GAAG;AACnD,YAAM,eAA0B,KAAqC,IAAI,CAAC,WAAW;AACnF,eAAO,YAAY,OAAO,gBAAgB,QAAQ,QAAW,QAAQ,EAAE,CAAC;MAC1E,CAAC;AACD,YAAM,EAAE,KAAK,IAAI,IAAI;QACnB;QACA,sBAAsB,QAAQ,EAAE;MAClC;AACA,aAAO,CAAC,QAAQ,IAAI;IACtB;IACA,KAAK,YAAY;AACf,aAAO,CAAC,QAAQ,gBAAgB,IAAc,CAAC;IACjD;IACA,KAAK,UAAU;AACb,UAAI,aAAa,kBAAS,QAAQ;AAChC,cAAM,YAAY,oBAAoB,IAAc;AACpD,cAAM,WAAW;UACf,UAAU,KAAK;UACf,GAAG,UAAU;UACb,UAAU;UACV,UAAU;QACZ;AACA,eAAO,CAAC,MAAM,sBAAsB,QAAQ,EAAE,WAAW,QAAQ,CAAC;MACpE;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK,QAAQ;AACX,UAAI,aAAa,kBAAS,QAAQ;AAChC,cAAM,QAAQ,OAAO,IAAc;AACnC,oBAAY,OAAO,MAAM,UAAU;AACnC,eAAO,CAAC,MAAM,OAAO,QAAQ,KAAK,QAAQ,QAAQ,KAAK,CAAC;MAC1D;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK;IACL,KAAK,QAAQ;AACX,UAAI,aAAa,kBAAS,QAAQ;AAChC,oBAAY,MAAM,MAAM,UAAU;MACpC;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK;IACL,KAAK,eAAe;AAElB,UAAI,aAAa,kBAAS,QAAQ;AAChC,oBAAY,OAAO,IAAc,GAAG,MAAM,UAAU;MACtD;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK;IACL,KAAK,mBAAmB;AACtB,UAAI,aAAa,kBAAS,QAAQ;AAChC,oBAAY,MAAM,MAAM,UAAU;MACpC;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,KAAK,QAAQ;AACX,UAAI,aAAa,kBAAS,QAAQ;AAChC,eAAO,OAAO,SAAS,WAAW,qBAAqB,IAAI,IAAI,IAAI,EAAE;MACvE;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;IACA,SAAS;AACP,UAAI,aAAa,kBAAS,QAAQ;AAChC,cAAM,IAAI,MAAM,qBAAqB,IAAI,EAAE;MAC7C;AACA,aAAO,CAAC,MAAM,OAAO,IAAc,CAAC;IACtC;EACF;AACF;AA7HgB;AAmIT,SAAS,WACd,OACA,MACA,MACA,WAAqB,kBAAS,QAC9B;AACA,QAAM,aAAa,MAAM,IAAI,KAAK,sBAAsB,QAAQ,EAAE,YAAY,IAAI;AAClF,QAAM,CAAC,aAAa,MAAM,IAAI,WAAW;IACvC,CAAC,CAAC,IAAI,EAAE,GAAG,UAAU;AACnB,UACE,KAAK,MAAM,IAA0B,MAAM,UAC1C,KAAK,MAAM,IAA0B,MAAM,QAAQ,MAAM,SAAS,QACnE;AACA,cAAM,IAAI,MAAM,yCAAyC,MAAM,IAAI,GAAG;MACxE;AAEA,YAAM,QAAQ,KAAK,MAAM,IAA0B;AACnD,YAAM,MAAM,EAAE,QAAQ,MAAM,KAAK,MAAM,KAAK;AAC5C,YAAM,CAAC,GAAG,YAAY,IAAI,YAAY,OAAO,MAAM,MAAM,OAAO,KAAK,QAAQ;AAE7E,aAAO;QACL,CAAC,GAAG,IAAI,CAAC;QACT,CAAC,GAAG,IAAI,YAAY;MACtB;IACF;IACA,CAAC,CAAC,MAAM,GAAG,CAAC,YAAY,OAAO,MAAM,QAAQ,CAAC,CAAC;EACjD;AAEA,SAAO,CAAC,aAAa,MAAM;AAC7B;AA7BgB;AAmCT,SAAS,cACd,OACA,MACA,MACA,WAAqB,kBAAS,QAC9B;AACA,SAAO,sBAAsB,QAAQ,EAAE,WAAW,WAAW,OAAO,MAAM,MAAM,QAAQ,EAAE,CAAC,CAAC;AAC9F;AAPgB;AAYT,SAAS,eAAe,WAAsB,SAA+B;AAClF,MAAI,CAAC,kBAAkB,SAAS,GAAG;AACjC,UAAM,IAAI,MAAM,uCAAuC;EACzD;AAEA,QAAM,WAAW,iBAAiB,SAAS;AAC3C,QAAM,EAAE,QAAQ,WAAW,IAAI,sBAAsB,QAAQ;AAE7D,QAAM,UAAU;IACd,kBAAkB,kBAAkB;IACpC,cAAc,UAAU,OAAO,QAAQ,UAAU,QAAQ,QAAQ;IACjE;IACA,cAAc,UAAU,OAAO,UAAU,aAAa,UAAU,SAAS,QAAQ;EACnF;AAEA,SAAO,WAAW,OAAO;AAC3B;AAhBgB;AIvahB,IAAA,kBAAA,CAAA;AAAAC,UAAA,iBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,WAAA,6BAAA,WAAA;EAAA,aAAA,6BAAA,aAAA;AAAA,CAAA;AAqBO,SAAS,YAAYC,UAA0B;AACpD,SAAO,IAAI,aAAaA,QAAO,EAAE,SAAS;AAC5C;AAFgB;AAiBT,SAAS,UAAU,IAA2B;AACnD,SAAO,aAAa,GAAG,EAAE;AAC3B;AAFgB;AAeT,SAAS,YAAY,IAA2B;AACrD,SAAO,IAAI,aAAa,EAAE,EAAE,mBAAmB;AACjD;AAFgB;ACrDhB,IAAA,iBAAA,CAAA;AAAAC,UAAA,gBAAA;EAAA,cAAA,6BAAA,cAAA;EAAA,YAAA,6BAAA,YAAA;EAAA,UAAA,6BAAAC,WAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,eAAA,6BAAA,eAAA;AAAA,CAAA;AAiCO,SAAS,WAAW,QAA2B;AACpD,SAAO,OAAO,SAAS;AACzB;AAFgB;AAoBhB,SAAS,mBAAmB,KAAU;AACpC,SAAO,IACJ,OAAO,CAAC,aAAa,SAAS,SAAS,OAAO,EAC9C,OAAO,CAAC,KAAK,aAAa;AACzB,UAAM,YAAY,SAAS;AAC3B,UAAM,cAAc,EAAE,GAAG,SAAS;AAClC,gBAAY,OAAO;AACnB,WAAO;MACL,GAAG;MACH,CAAC,aAAwB,OAAO,YAAY,SAAS,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,GAAG;IAC1E;EACF,GAAG,CAAC,CAAC;AACT;AAZS;AAqCT,SAAS,mBAAmB,KAAU;AACpC,QAAM,mBAAmB,IAAI,OAAO,CAAC,QAAQ,WAAW,GAAG,KAAK,IAAI,SAAS,QAAQ;AACrF,QAAM,iBAAiB,IAAI,OAAO,CAAC,QAAQ,WAAW,GAAG,KAAK,IAAI,SAAS,MAAM;AACjF,QAAM,gBAA2B,iBAAiB,OAAO,CAAC,KAAiB,UAAsB;AAC/F,QAAI,WAAqB,CAAC;AAC1B,QAAI,EAAE,KAAK,IAAI;AACf,QAAI,OAAgB;AACpB,UAAM,WAAW,wBAAC,YAA+B,QAAQ,SAAS,MAAjD;AAEjB,WAAO,MAAM;AACX,YAAM,YAAY,eAAe,KAAK,CAAC,WAAW,OAAO,SAAS,KAAK,QAAQ,CAAC;AAChF,UAAI,OAAO,cAAc;AAAa;AACtC,YAAM,UAAU,UAAU,SAAS,KAAK,QAAQ;AAChD,eAAS,QAAQ,QAAQ,IAAI;AAC7B,UAAI,QAAQ,SAAS;AAAQ,eAAO;AACpC,aAAO,UAAU;IACnB;AACA,QAAI,SAAS,WAAW,GAAG;AACzB,YAAM,IAAI,MAAM,yCAAyC;IAC3D;AACA,QAAI;AAAM,iBAAW,CAAC,SAAS,SAAS,SAAS,CAAC,CAAC;AACnD,UAAM,QAAQ,SAAS,IAAI;AAC3B,QAAI,SAAoB;MACtB,CAAC,aAAwB,OAAO,YAAY,KAAM,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,GAAG;IACvE;AACA,WAAO,SAAS,SAAS,GAAG;AAC1B,eAAS;QACP,CAAC,aAAwB,OAAO,YAAY,SAAS,IAAI,CAAE,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,GAAG;MAChF;IACF;AACA,aAAS,EAAE,GAAG,OAAO;AACrB,WAAO,eAAe,KAAK,MAAM;EACnC,GAAG,CAAC,CAAC;AACL,SAAO;AACT;AAlCS;AA2DF,SAAS,aAAa,KAAqB;AAChD,SAAO,YAAY,GAAG,IAAI,mBAAmB,GAAG,IAAI,mBAAmB,GAAG;AAC5E;AAFgB;AAcT,SAASA,UAAS,MAAoB;AAC3C,SAAO,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI;AAChE;AAFgB,OAAAA,WAAA;AAOhB,SAAS,eAAe,QAAa,QAAqB;AACxD,QAAMC,UAAS,EAAE,GAAG,OAAO;AAC3B,MAAID,UAAS,MAAM,KAAKA,UAAS,MAAM,GAAG;AACxC,WAAO,KAAK,MAAM,EAAE,QAAQ,CAAC,QAAQ;AACnC,UAAIA,UAAS,OAAO,GAAG,CAAC,GAAG;AACzB,YAAI,EAAE,OAAO;AAAS,iBAAO,OAAOC,SAAQ,EAAE,CAAC,GAAG,GAAG,OAAO,GAAG,EAAE,CAAC;;AAC7D,UAAAA,QAAO,GAAG,IAAI,eAAe,OAAO,GAAG,GAAG,OAAO,GAAG,CAAC;MAC5D,OAAO;AACL,eAAO,OAAOA,SAAQ,EAAE,CAAC,GAAG,GAAG,OAAO,GAAG,EAAE,CAAC;MAC9C;IACF,CAAC;EACH;AACA,SAAOA;AACT;AAbS;AAmCF,SAAS,YACd,wBACA,WACA,YACA,UACc;AACd,QAAM,MAAM,uBAAuB,KAAK,EAAE,OAAO,CAAC,KAAK,aAAwB;AAC7E,QAAI,WAAiC,UAAU,SAAS,KAAK,MAAM,KAAK,CAAC;AACzE,QAAI,CAAC,UAAU;AACb,aAAO;IACT;AACA,WAAO,CAAC,SAAS,MAAM;AACrB,YAAM,WAAW,SAAS,KAAK,MAAM;AACrC,aAAO,CAAC,CAAC,UAAU,kDAAkD;AACrE,iBAAY,SAAuB,QAAQ;IAC7C;AAEA,UAAM,cAA2B,CAAC;AAClC,gBAAY,SAAS,IAAc,IAAI,CAAC;AAExC,UAAM,WAAW,SAAS,KAAK,OAAO,QAAQ,EAAE;AAChD,UAAM,WAAW,SAAS,KAAK,OAAO,QAAQ,EAAE;AAEhD,UAAM,eACH,SAAkC,SAAS,OAAO,CAAC,OAAO,GAAG,SAAS,KAAK,KAC3E,SAAyB;AAC5B,UAAM,eACH,SAAkC,SAAS,OAAO,CAAC,OAAO,GAAG,SAAS,MAAM,KAC5E,SAAyB;AAE5B,iBAAa,QAAQ,CAAC,QAAQ;AAC5B,kBAAY,SAAS,IAAc,EAAE,IAAI,IAAI,IAAI;QAC/C;QACA;QACA;QACA;QACA,YAAY,SAAS,IAAc;MACrC;IACF,CAAC;AAED,iBAAa,QAAQ,CAAC,SAAS;AAC7B,kBAAY,SAAS,IAAc,EAAE,KAAK,IAAI,IAAI;QAChD;QACA;QACA;QACA;QACA,YAAY,SAAS,IAAc;MACrC;IACF,CAAC;AACD,QAAI,KAAK,WAAW;AACpB,WAAO;EACT,GAAG,CAAC,CAAiB;AACrB,SAAO;AACT;AArDgB;AA6DT,SAAS,cAAc,WAA6C;AACzE,MAAI,CAAC,UAAU,QAAQ;AACrB,UAAM,IAAI,MAAM,4BAA4B;EAC9C;AACA,QAAM,QAAQ,UAAU,OAAO;IAC7B,CAAC,OAAY,SAAS,GAAG,YAAY,MAAM,SAAS,IAAI,OAAO;EACjE,KAAK;IACH,MAAM,CAAC;EACT;AACA,SAAO;IACL,kBAAkB,UAAU;IAC5B,kBAAkB,MAAM,KAAK,CAAC;IAC9B,SAAS,MAAM,KAAK,CAAC;IACrB,UAAU,MAAM,KAAK,CAAC;IACtB,QAAQ,MAAM,KAAK,CAAC;IACpB,WAAW,MAAM,KAAK,CAAC;IACvB,cAAc,MAAM,KAAK,CAAC;IAC1B,UAAU,MAAM,KAAK,MAAM,GAAG,IAAI,SAAS,MAAM,KAAK,CAAC,GAAG,EAAE,CAAC;IAC7D,MAAM,MAAM,KAAK,MAAM,KAAK,SAAS,CAAC;EACxC;AACF;AApBgB;AG1QhB,IAAA,kBAAA,CAAA;AAAAC,UAAA,iBAAA;EAAA,uBAAA,6BAAA,uBAAA;EAAA,sBAAA,6BAAA,sBAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,kBAAA,6BAAA,kBAAA;EAAA,iBAAA,6BAAA,iBAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,aAAA,6BAAA,aAAA;EAAA,gBAAA,6BAAA,gBAAA;EAAA,qBAAA,6BAAA,qBAAA;EAAA,YAAA,6BAAA,YAAA;AAAA,CAAA;AAmBO,SAAS,gBAAgB,KAA2B,cAAc,OAAO;AAC9E,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN,QAAQ;MACN;IACF;EACF,CAAC;AACH;AAPgB;AAaT,SAAS,eAAe,KAA2B;AACxD,SAAO,IAAI,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACtD;AAFgB;AAST,SAAS,WAAW,KAA2B,OAA6B;AACjF,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN,QAAQ;EACV,CAAC;AACH;AALgB;AAYT,SAAS,iBAAiB,KAA2BC,QAAmC;AAE7F,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN,QAAQA;EACV,CAAC;AACH;AANgB;AAaT,SAAS,oBAAoB,KAA2B,SAAkB;AAC/E,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN,QAAQ;MACN;IACF;EACF,CAAC;AACH;AAPgB;AAaT,SAAS,eAAe,KAA2B;AACxD,SAAO,IAAI,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACtD;AAFgB;AAQT,SAAS,eAAe,KAA2B;AACxD,SAAO,IAAI,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACtD;AAFgB;AAST,SAAS,qBACd,KACA,QACA;AACA,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN;EACF,CAAC;AACH;AARgB;AAeT,SAAS,sBACd,KACA,QACA;AACA,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN;EACF,CAAC;AACH;AARgB;AAgBT,SAAS,YAAY,KAA2B,WAAsB;AAC3E,SAAO,IAAI,QAAQ;IACjB,MAAM;IACN,QAAQ;EACV,CAAC;AACH;AALgB;AAWT,SAAS,eAAe,KAA2B;AACxD,SAAO,IAAI,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACtD;AAFgB;AAaT,SAAS,gBACd,KACA,UACM;AACN,MAAI,GAAG,mBAAmB,QAAQ;AACpC;AALgB;AAcT,SAAS,iBACd,KACA,UACM;AACN,MAAI,GAAG,kBAAkB,QAAQ;AACnC;AALgB;AEjIT,IAAM,sBAAsB,wBAAC,SAAoC;AACtE,QAAM,UAAU;IACd;IACA;IACA;IACA;IACA;IACA;IACA;IACA;EACF;AACA,QAAM,UAAU,KAAK,KAAK,SAAS,CAAC;AACpC,MAAI,OAAO,YAAY,YAAY,QAAQ,KAAK,CAAC,MAAM,KAAK,OAAO,GAAG;AACpE,WAAO,EAAE,MAA8B,SAAS,KAAK,IAAI,EAAqB;EAChF;AACA,SAAO,EAAE,KAA6B;AACxC,GAhBmC;AAqBnC,SAAS,UAAU,UAAoB,aAAiD;AACtF,SAAO,kBAAmB,MAA+C;AACvE,UAAM,SAAS,oBAAoB,IAAI;AACvC,WAAO,SAAS,KAAK,YAAY,MAAM,OAAO,MAAM;MAClD,cAAc;MACd,eAAe;MACf,GAAG,OAAO;IACZ,CAAC;EACH;AACF;AATS;AAcT,SAAS,YAAY,UAAoB,aAAiD;AACxF,SAAO,kBAAmB,MAAgC;AACxD,UAAM,SAAS,oBAAoB,IAAI;AACvC,WAAO,SAAS,OAAO,YAAY,MAAM,OAAO,MAAM;MACpD,cAAc;MACd,GAAG,OAAO;IACZ,CAAC;EACH;AACF;AARS;AAaT,SAAS,aAAa,UAAoB,aAAiD;AACzF,MAAI,YAAY,oBAAoB,UAAU,YAAY,qBAAqB,QAAQ;AACrF,WAAO,UAAU,UAAU,WAAW;EACxC;AACA,SAAO,YAAY,UAAU,WAAW;AAC1C;AALS;AAUT,SAAS,cAAc,UAAoB,aAA4C;AACrF,SAAO,YAAa,MAAuB;AACzC,WAAO,SAAS,SAAS,YAAY,MAAM,IAAI;EACjD;AACF;AAJS;AAST,SAAS,cAAc,UAAoB,aAA4C;AACrF,SAAO,YAAa,MAAuB;AACzC,WAAO,SAAS,SAAS,YAAY,MAAM,IAAI;EACjD;AACF;AAJS;AAMF,SAAS,YAAY,MAAe,UAA8B;AAEvE,MAAI,MAAM,QAAQ,IAAI,KAAK,kBAAkB;AAAM,WAAO;AAC1D,MAAI,MAAM,QAAQ,IAAI,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,KAAK,kBAAkB,KAAK,CAAC;AAC3E,WAAO,KAAK,CAAC;AACf,SAAO,SAAS;AAClB;AANgB;AAQT,IAAM,WAAN,MAA4C;SAAA;;;EACjD;EAEA;EAEA;EAEA;EAEmB;EAEA;EAEV;EAEA;EAEA;EAEA;EAID;;;;;;;;EASR,YACE,KACA,SACA,oBAA0D,iBAC1D;AACA,SAAK,UAAU,WAAW,QAAQ,YAAY;AAC9C,SAAK,oBAAoB;AACzB,SAAK,WAAW,IAAI,SAAS,GAAG;AAChC,SAAK,UAAU,SAAS,aAAa,GAAG;AACxC,SAAK,SAAS,aAAa,GAAG;AAC9B,UAAM,SAAS,gBAAgB,GAAG;AAClC,SAAK,MAAM,OAAO,gBAAgB;AAElC,UAAM,UAAU,EAAE,YAAY,MAAM,OAAO,CAAC,GAAG,UAAU,MAAM;AAC/D,WAAO,iBAAiB,MAAM;MAC5B,WAAW,EAAE,YAAY,MAAM,OAAO,CAAC,GAAG,UAAU,MAAM;MAC1D,YAAY,EAAE,YAAY,MAAM,OAAO,CAAC,GAAG,UAAU,MAAM;MAC3D,qBAAqB,EAAE,YAAY,MAAM,OAAO,CAAC,GAAG,UAAU,MAAM;MACpE,aAAa,EAAE,YAAY,MAAM,OAAO,CAAC,GAAG,UAAU,MAAM;IAC9D,CAAC;AACD,SAAK,IAAI,QAAQ,CAAC,eAAe;AAC/B,UAAI,WAAW,SAAS;AAAY;AACpC,YAAM,YAAY,WAAW;AAC7B,UAAI,CAAC,KAAK,SAAS,GAAG;AACpB,eAAO,eAAe,MAAM,WAAW;UACrC,GAAG;UACH,OAAO,aAAa,MAAM,UAAU;QACtC,CAAC;MACH;AACA,UAAI,CAAC,KAAK,UAAU,SAAS,GAAG;AAC9B,eAAO,eAAe,KAAK,WAAW,WAAW;UAC/C,GAAG;UACH,OAAO,aAAa,MAAM,UAAU;QACtC,CAAC;MACH;AACA,UAAI,CAAC,KAAK,WAAW,SAAS,GAAG;AAC/B,eAAO,eAAe,KAAK,YAAY,WAAW;UAChD,GAAG;UACH,OAAO,UAAU,MAAM,UAAU;QACnC,CAAC;MACH;AACA,UAAI,CAAC,KAAK,oBAAoB,SAAS,GAAG;AACxC,eAAO,eAAe,KAAK,qBAAqB,WAAW;UACzD,GAAG;UACH,OAAO,cAAc,MAAM,UAAU;QACvC,CAAC;MACH;AACA,UAAI,CAAC,KAAK,YAAY,SAAS,GAAG;AAChC,eAAO,eAAe,KAAK,aAAa,WAAW;UACjD,GAAG;UACH,OAAO,cAAc,MAAM,UAAU;QACvC,CAAC;MACH;IACF,CAAC;EACH;EAEO,OAAO,SAAuB;AACnC,SAAK,UAAU;EACjB;EAEO,QAAQ,mBAAyD;AACtE,SAAK,oBAAoB;EAC3B;EAEA,MAAa,WAA8B;AACzC,QAAI,KAAK,uBAAuB;AAC9B,YAAM,KAAK,kBAAkB,mBAAmB,KAAK,qBAAqB;AAC1E,WAAK,wBAAwB;IAC/B;AACA,WAAO;EACT;EAEA,MAAa,KACX,QACA,OAAuB,CAAC,GACxB;IACE,eAAe;IACf,gBAAgB;IAChB,iBAAiB;IACjB,kBAAkB;EACpB,IAAiB,CAAC,GACD;AACjB,WAAO,KAAK,YAAY,MAAM,yCAAyC;AAEvE,UAAM,WAAW,YAAY,MAAM,MAAM;AACvC,UAAI,cAAc;AAChB,aAAK,SAAS,SAAA,QAA4B,QAAQ,IAAI;AACtD,eAAO,KAAK,SAAS,QAAQ,QAAQ,IAAI;MAC3C;AAEA,cAAQ,KAAK,yEAAyE;AACtF,aAAO;IACT,CAAC;AAED,WAAO,KAAK,kBACT;MACC;QACE,iBAAiB,KAAK;QACtB;QACA,YAAY;MACd;MACA;IACF,EACC,KAAK,CAAC,OAAO;AACZ,UAAI,CAAC,eAAe;AAClB,eAAO;MACT;AACA,UAAI,gBAAgB;AAClB,eAAO,KAAK,SAAS,OAAO,QAAQ,IAAI,cAAc;MACxD;AACA,aAAO,KAAK,SAAS,MAAM,QAAQ,EAAE;IACvC,CAAC;EACL;EAEO,OACL,QACA,OAAuB,CAAC,GACxB,EAAE,eAAe,MAAM,QAAQ,OAAO,UAAU,IAAmB,CAAC,GACnC;AACjC,WAAO,KAAK,YAAY,MAAM,yCAAyC;AAEvE,UAAM,WAAW,YAAY,MAAM,MAAM;AACvC,UAAI,cAAc;AAChB,aAAK,SAAS,SAAA,UAA8B,QAAQ,IAAI;AACxD,eAAO,KAAK,SAAS,QAAQ,QAAQ,IAAI;MAC3C;AAEA,cAAQ,KAAK,2EAA2E;AACxF,aAAO;IACT,CAAC;AAED,UAAM,aAAa;MACjB,iBAAiB,KAAK;MACtB;MACA,YAAY;IACd;AACA,QAAI,aAAa,KAAK,mBAAmB;AACvC,aAAO,KAAK,kBAAkB,QAAQ,YAAY,QAAW;QAC3D;QACA;MACF,CAAC;IACH;AAEA,QAAI,CAAC;AAAO,YAAM,IAAI,MAAM,+DAA+D;AAE3F,YAAQ,KAAK,YAAY,MAAM,2DAA2D;AAE1F,WAAO,KAAK,kBAAkB;MAC5B;QACE,GAAG;QACH;MACF;MACA;QACE;MACF;IACF;EACF;EAEA,MAAa,SAAS,QAAgB,OAAuB,CAAC,GAAiC;AAC7F,WAAO,KAAK,YAAY,MAAM,yCAAyC;AAEvE,QAAI,CAAC,YAAY,MAAM,MAAM,KAAK,GAAG;AACnC,WAAK,SAAS,SAAA,UAA8B,QAAQ,IAAI;IAC1D;AAEA,UAAM,aAAa,KAAK,SAAS,QAAQ,IAAI;AAC7C,QAAI,uBAAuB,KAAK,mBAAmB;AACjD,aAAO,KAAK,kBAAkB,kBAAkB,UAAU;IAC5D;AACA,UAAM,MAAM,gEAAgE;EAC9E;EAEO,SAAS,QAAgB,OAAgB,CAAC,GAAS;AACxD,UAAM,WAAqB,YAAY,MAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ,IAAI,CAAC;AACtF,WAAO;MACL,iBAAiB,KAAK;MACtB,YAAY;MACZ;IACF;EACF;EAEO,YAAY,SAAsD;AACvE,WAAO;MACJ,QAA6C,QAAQ;QACpD,CAAC,UAAU,SAAS,MAAM,YAAY,MAAM,SAAS,KAAK,OAAO;QACjE,CAAC;MACH,KAAK,CAAC;MACN,KAAK;MACL,KAAK;MACL,SAAS,WAAW,KAAK,GAAG;IAC9B;EACF;EAEO,WAAoB;AACzB,WAAO,cAAM,YAAY,KAAK,GAAG;EACnC;EAEA,MAAa,aAAa;AACxB,WAAO,KAAK,kBAAkB,mBAAmB,KAAK,OAAO;EAC/D;EAEO,QAAgC,MAAmC;AACxE,WAAO;EACT;AACF;;;AQpVO,IAAM,uBAAN,MAA2B;AAAA,EAGhC,YACW,KACA,SACA,UACA,aACT;AAJS;AACA;AACA;AACA;AAET,SAAK,YAAY,IAAI,SAAS,KAAK,SAAS,QAAQ;AACpD,UAAM,WAAW,IAAI,SAAS,GAAG;AAEjC,eAAW,MAAM,SAAS,KAAK;AAC7B,UAAI,GAAG,QAAQ,cAAc,GAAG,oBAAoB,QAAQ;AAC1D,cAAM,YAAY,GAAG;AACrB,eAAO,eAAe,MAAM,WAAW;AAAA,UACrC,YAAY;AAAA,UACZ,UAAU;AAAA,UACV,OAAOC,WAAU,MAAM,SAAS;AAAA,QAClC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA,EAnCF,OAakC;AAAA;AAAA;AAAA,EACxB;AAAA,EAuBR,KAAK,QAAgB,MAAuB,aAA4C;AACtF,WAAO,KAAK,UAAU,KAAK,QAAQ,MAAM;AAAA,MACvC,GAAG;AAAA,MACH,iBAAiB,KAAK;AAAA,IACxB,CAAC;AAAA,EACH;AACF;AAEA,SAASA,WAAU,UAAgC,MAAqC;AACtF,SAAO,kBAAmB,MAA+C;AACvE,UAAM,SAAS,oBAAoB,IAAI;AACvC,WAAO,SAAS,KAAK,MAAM,OAAO,MAAM;AAAA,MACtC,cAAc;AAAA,MACd,eAAe;AAAA,MACf,GAAG,OAAO;AAAA,IACZ,CAAC;AAAA,EACH;AACF;AATS,OAAAA,YAAA;AAUR,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;AC/CtD,IAAM,kBAAN,cAA8B,YAAY;AAAA,EACxC,YACW,UACA,iBACA,SACA,aACA,WACA,iBACA,WAAmB,IACnB,eAAuB,IACvB,KACT;AACA,UAAM,CAAC,CAAC;AAVC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA,EAGX;AAAA,EArBF,OAQ0C;AAAA;AAAA;AAAA,EAe9B,oBAAoB,MAAc,QAAgC;AAC1E,WAAO;AAAA,MACL,SAAS,KAAK;AAAA,MACd,cAAc;AAAA,MACd,aAAa,OAAO,KAAK,WAAW;AAAA,MACpC,kBAAkB;AAAA,MAClB,iBAAiB,KAAK;AAAA,MACtB,SAAS,KAAK,WAAW;AAAA,MACzB;AAAA,MACA,UAAU,KAAK;AAAA,MACf,QAAQ,gBAAgB,MAAM;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,aAAsB;AACpB,WAAO,KAAK;AAAA,EACd;AACF;AAEO,IAAM,kBAAN,cAAkC,gBAAgB;AAAA,EAGvD,YACEC,SACA,UACA,aACA,WACA,kBACA,UACS,WACT;AACA;AAAA,MACE;AAAA,MACAA,QAAO;AAAA,MACPA,QAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACAA,QAAO,QAAQ,UAAU,MAAM,GAAG,CAAC;AAAA,MACnCA,QAAO;AAAA,IACT;AAZS;AAAA,EAaX;AAAA,EAjEF,OA0CyD;AAAA;AAAA;AAAA,EAC/C;AAAA,EAwBR,cAAkB;AAChB,QAAI,CAAC,KAAK,KAAK;AACb,YAAM,IAAI,MAAM,eAAe;AAAA,IACjC;AAEA,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY,IAAI,qBAAqB,KAAK,KAAK,KAAK,iBAAiB,KAAK,UAAU,KAAK,WAAW;AAAA,IAC3G;AACA,WAAO,KAAK;AAAA,EACd;AACF;AACC,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;AC9E/C,IAAM,gBAAN,MAAuB;AAAA,EAC5B,YACW,QACA,iBACA,MACT;AAHS;AACA;AACA;AAAA,EACR;AAAA,EALL,OAA8B;AAAA;AAAA;AAM9B;AACC,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;A/HFtD,SAAS,kBAAkB,2BAA2B;AAM/C,IAAM,oBAAN,MAAM,mBAAkB;AAAA,EAa7B,YAAqBC,SAAiC;AAAjC,kBAAAA;AACnB,WAAO,eAAe,IAAI;AAAA,EAC5B;AAAA,EA1BF,OAW+B;AAAA;AAAA;AAAA,EAC7B,eAAkD,CAAC;AAAA,EAE3C;AAAA,EAER,OAAO,KAAKA,SAAoD;AAC9D,UAAM,YAAY,IAAI,mBAAkBA,OAAM;AAC9C,2BAAuB,SAAS,SAAS,SAAS;AAClD,WAAO;AAAA,EACT;AAAA,EAEA;AAAA,EAMA,MAAM,YAAY;AAChB,SAAK,WAAW,IAAI,aAAY;AAAA,MAC9B,SAAS,eAAe,KAAK,OAAO,OAAO;AAAA,IAC7C,CAAC;AACD,UAAM,YAAY,MAAM,KAAK,SAAS,eAAe,KAAK,OAAO,OAAO;AACxE,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,0CAA0C,KAAK,OAAO,OAAO;AAAA,IAC/E;AACA,SAAK,YAAY;AACjB,QAAI,CAAC,KAAK,OAAO,KAAK;AACpB,YAAM,QAAQ,MAAM,KAAK,SAAS,SAAS,WAAW,QAAQ;AAC9D,WAAK,OAAO,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AAAA,EAEO,QACL,OACA,SACA,gBACA;AACA,UAAM,cAAc,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;AACzD,QAAI,CAAC,KAAK,OAAO,KAAK;AACpB,YAAM,IAAI,MAAM,eAAe;AAAA,IACjC;AACA,UAAM,MAAM,KAAK,OAAO;AACxB,UAAM,cAAc;AAAA,MAClB,aAAa,eAAe;AAAA,MAC5B,SAAS,8BAAO,SAA6B;AAC3C,YAAI;AACF,gBAAM,YAAY,CAAC,KAAK,MAAM;AAC9B,gBAAM,YAAY,eAAO,aAAa,GAAG;AAEzC,gBAAM,aAAa,SAAS,aAAa,GAAG;AAC5C,gBAAM,WAAW,SAAS,WAAW,GAAG;AAExC,gBAAM,eAAe,eAAO,YAAY,WAAW,WAAW,YAAY,QAAQ;AAClF,gBAAM,UAA2B,CAAC;AAClC,gBAAM,EAAE,YAAY,cAAc,kBAAkB,aAAa,IAAI,KAAK;AAC1E,mBAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,kBAAM,MAAM,IAAI;AAAA,cACd,KAAK;AAAA,cACL,KAAK;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA,KAAK;AAAA,YACP;AACA,kBAAM,IAAI,IAAI,cAAc,cAAc,kBAAkB,aAAa,CAAC,CAAC;AAC3E,gBAAI;AACF,oBAAM,QAAQ,GAAG,GAAG;AAAA,YACtB,SAASC,IAAG;AACV,sBAAQ,MAAMA,EAAC;AAAA,YACjB;AACA,oBAAQ,KAAK,IAAI,iBAAiB,CAAC;AAAA,UACrC;AACA,iBAAO,oBAAoB,OAAO;AAAA,QACpC,SAAS,GAAG;AACV,kBAAQ,MAAM,CAAC;AACf,iBAAO,cAAc,YAAY,CAAC,CAAC;AAAA,QACrC;AAAA,MACF,GAlCS;AAAA,MAmCT;AAAA,MACA,kBAAkB,8BAAO,SAA0D;AACjF,cAAM,IAAI,gBAAgB;AAC1B,YAAI,CAAC,EAAG,QAAO;AACf,YAAI,OAAO,MAAM,YAAY;AAC3B,cAAI;AACF,kBAAM,YAAY,CAAC,KAAK,MAAM;AAC9B,kBAAM,YAAY,eAAO,aAAa,GAAG;AACzC,kBAAM,aAAa,SAAS,aAAa,GAAG;AAC5C,kBAAM,WAAW,SAAS,WAAW,GAAG;AACxC,kBAAM,eAAe,eAAO,YAAY,WAAW,WAAW,YAAY,QAAQ;AAClF,gBAAI,aAAa,SAAS,GAAG;AAC3B,oBAAM,EAAE,cAAc,iBAAiB,IAAI,KAAK;AAChD,oBAAM,IAAI,IAAI,cAAc,cAAc,kBAAkB,aAAa,CAAC,CAAC;AAC3E,qBAAO,EAAE,CAAC;AAAA,YACZ;AACA,mBAAO;AAAA,UACT,SAAS,GAAG;AACV,oBAAQ,MAAM,CAAC;AACf,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT,GAtBkB;AAAA,IAuBpB;AACA,SAAK,aAAa,KAAK,WAAW;AAClC,WAAO;AAAA,EACT;AACF;AASA,SAAS,eAAe,SAAmC;AACzD,UAAQ,SAAS;AAAA,IACf,KAAKC,iBAAgB;AACnB,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAPS;AASF,IAAM,yBAAN,MAAM,gCAA+B,iBAAoC;AAAA,EAxIhF,OAwIgF;AAAA;AAAA;AAAA,EAC9E,OAAO,WAAW,IAAI,wBAAuB;AAC/C;AAEO,IAAe,4BAAf,MAAyC;AAAA,EAEpC,YACC,KACAF,SACT;AAFS;AACA,kBAAAA;AAET,SAAK,YAAY,IAAI,kBAAkBA,OAAM;AAC7C,2BAAuB,SAAS,SAAS,KAAK,SAAS;AACvD,WAAO,eAAe,IAAI;AAAA,EAC5B;AAAA,EArJF,OA4IgD;AAAA;AAAA;AAAA,EAC7B;AAAA,EAUjB,QACE,WACA,YACA,SACA;AACA,SAAK,UAAU,QAAQ,WAAW,OAAO,QAAQ,QAAQ;AACvD,YAAM,YAAY,OAAO,KAAK,UAAU;AACxC,YAAM,IAAI,IAAI,cAAiB,OAAO,QAAQ,OAAO,iBAAiB,SAAS;AAC/E,YAAM,QAAQ,GAAG,GAAyB;AAAA,IAC5C,CAAC;AACD,WAAO;AAAA,EACT;AACF;AACC,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;ADnJ/C,IAAM,iBAAN,cAA6B,OAAO;AAAA,EAjB3C,OAiB2C;AAAA;AAAA;AAAA,EACzC,OAAe;AAAA,EACf,kBAAkB,IAAI,gBAAgB;AAAA,EAEtC,MAAM,KAAKG,SAAsB;AAC/B,eAAW,mBAAmB,uBAAuB,SAAS,UAAU,GAAG;AACzE,YAAM,UAAU,gBAAgB,OAAO;AACvC,MAAAA,QAAO,SAAS,KAAK,OAAO;AAAA,IAC9B;AAAA,EACF;AAAA,EAEA,MAAM,UAAUA,SAA+B,YAAqB;AAClE,SAAK,gBAAgB,MAAM,UAAiB;AAE5C,eAAW,aAAa,uBAAuB,SAAS,UAAU,GAAG;AACnE,YAAM,UAAU,UAAU,OAAO;AACjC,UAAI,eAAe,UAAa,eAAe,QAAQ,SAAS,GAAG;AACjE;AAAA,MACF;AACA,YAAM,UAAU,UAAU;AAC1B,YAAM,iBAAiB,eAAe,YAAY;AAAA,QAChD,eAAe;AAAA,QACf,UAAU;AAAA,UACR,MAAM,UAAU,OAAO;AAAA,UACvB,SAAS,UAAU,OAAO,QAAQ,SAAS;AAAA,UAC3C,SAAS,UAAU,OAAO,WAAW;AAAA,UACrC,KAAK;AAAA,QACP;AAAA,QACA,YAAY,UAAU,OAAO;AAAA,QAC7B,UAAU,UAAU,OAAO;AAAA,MAC7B,CAAC;AACD,iBAAW,eAAe,UAAU,cAAc;AAChD,cAAM,YAAY,KAAK,gBAAgB,SAAS,YAAY,SAAS,OAAO;AAE5E,YAAI,YAAY,aAAa;AAC3B,yBAAe,qBAAqB,KAAK;AAAA,YACvC,SAAS,YAAY,YAAY,IAAI,CAAC,OAAO;AAAA,cAC3C,SAAS,UAAU,OAAO;AAAA,cAC1B,MAAM,CAAC,aAAK,oBAAoB,CAAC,CAAC;AAAA,YACpC,EAAE;AAAA,YACF;AAAA,YACA,aAAa,YAAY;AAAA,UAC3B,CAAC;AAAA,QACH;AAAA,MACF;AAGA,MAAAA,QAAO,gBAAgB,KAAK,cAAc;AAAA,IAC5C;AAAA,EACF;AAAA,EAEA,oBAAoB,CAAC,YAAY,cAAc;AAAA,EAE/C,eAAe,SAA8C;AAC3D,YAAQ,QAAQ,aAAa;AAAA,MAC3B,KAAK,YAAY;AACf,eAAO,KAAK,aAAa,OAAO;AAAA,MAClC;AACE,cAAM,IAAI,6BAAY,wBAAO,kBAAkB,+BAA+B,QAAQ,WAAW;AAAA,IACrG;AAAA,EACF;AAAA,EAEA,MAAM,MAAM,SAAuB;AAAA,EAAC;AAAA,EAEpC,UAAUA,SAAwC;AAChD,WAAO,sBAAsB,SAAS,UAAU,EAAE,WAAWA,QAAO,kBAAkB;AAAA,EACxF;AAAA,EAEA,MAAM,aAAa,SAA8C;AAC/D,QAAI,CAAC,QAAQ,MAAM,gBAAgB,QAAQ;AACzC,YAAM,IAAI,6BAAY,wBAAO,kBAAkB,8BAA8B;AAAA,IAC/E;AAEA,UAAM,WAAqC,CAAC;AAE5C,UAAM,SAAS,QAAQ,MAAM,gBAAgB;AAE7C,eAAW,aAAa,QAAQ,YAAY;AAC1C,YAAM,UAAU,KAAK,gBAClB;AAAA,QACC,QAAQ;AAAA,QACR;AAAA,MACF,EAAE,QAAQ,MAAM,cAAc,EAC7B,MAAM,CAAC,MAAW;AACjB,cAAM,IAAI;AAAA,UACR,wBAAO;AAAA,UACP,mCAAmC,KAAK,UAAU,MAAM,IAAI,OAAO,YAAY,CAAC;AAAA,QAClF;AAAA,MACF,CAAC;AACH,UAAI,cAAc,UAAU,YAAY;AACtC,cAAM;AAAA,MACR;AACA,eAAS,KAAK,OAAO;AAAA,IACvB;AACA,WAAOC,qBAAoB,MAAM,QAAQ,IAAI,QAAQ,CAAC;AAAA,EACxD;AACF;AAEA,cAAc,SAAS,SAAS,IAAI,eAAe,CAAC;AACnD,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;AiIhHtD,SAAS,mBAAAC,wBAAuB;;;ACO/B,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;;;ADFrD,OAAO,cAAc,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,CAAC;","names":["output","decode","encode","base","parse","stringify","error","isString","isInteger","isObject","error","punycode","parse","CookieJar","cb","err","now","value","parse","cookies","splitCookiesString","mergeProcessResults","StarknetChainId","encode","decode","alphabet","padding","bytes","isBytes","isBytes","bytes","gen","isBytes","utf8ToBytes","concatBytes","_0n","_1n","_2n","bytes","esm_exports","number","isBytes","bytes","hash","number","exists","output","U32_MASK64","_32n","fromBig","split","rotlSH","rotlSL","rotlBH","rotlBL","nc","crypto","u32","isBytes","createView","rotr","isLE","utf8ToBytes","toBytes","isBytes","concatBytes","Hash","toStr","wrapConstructor","toBytes","wrapXOFConstructorWithOpts","toBytes","randomBytes","crypto","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","SHA3_IOTA_H","SHA3_IOTA_L","split","rotlH","rotlBH","rotlSH","rotlL","rotlBL","rotlSL","keccakP","Keccak","Hash","number","u32","exists","toBytes","bytes","output","gen","wrapConstructor","sha3_224","sha3_256","sha3_384","sha3_512","keccak_224","keccak_256","keccak_384","keccak_512","genShake","wrapXOFConstructorWithOpts","shake128","shake256","isLE","_32n","Hash","createView","exists","toBytes","output","rotr","wrapConstructor","utils_exports","bitGet","bitLen","bitMask","bitSet","bytesToHex","bytesToNumberBE","bytesToNumberLE","concatBytes","createHmacDrbg","ensureBytes","equalBytes","hexToBytes","hexToNumber","isBytes","numberToBytesBE","numberToBytesLE","numberToHexUnpadded","numberToVarBytesBE","utf8ToBytes","validateObject","_0n","_1n","_2n","isBytes","hexes","bytesToHex","bytes","numberToHexUnpadded","hexToNumber","asciis","asciiToBase16","hexToBytes","bytesToNumberBE","bytesToNumberLE","numberToBytesBE","numberToBytesLE","numberToVarBytesBE","ensureBytes","concatBytes","equalBytes","utf8ToBytes","bitLen","bitGet","bitSet","bitMask","u8n","u8fr","createHmacDrbg","gen","validatorFns","validateObject","_0n","_1n","_2n","number","_0n","_1n","gcd","_2n","Fp","map","validateObject","_0n","_1n","nBitLength","bitLen","isLE","_0n","bitMask","_1n","numberToBytesLE","numberToBytesBE","bytes","bytesToNumberLE","bytesToNumberBE","isLE","bytesToNumberBE","bytesToNumberLE","_1n","numberToBytesLE","numberToBytesBE","Fp","rc","Fp","i","poseidonHash","_0n","_1n","base","window","curve","validateObject","curve","validateObject","Fp","utils_exports","isBytes","s","_0n","_1n","_2n","_3n","_4n","CURVE","toBytes","concatBytes","bytes","bytesToHex","bytesToNumberBE","ensureBytes","error","Point","a","validateOpts","CURVE_ORDER","numberToBytesBE","number","Signature","hexToBytes","utils","getPublicKey","getSharedSecret","bits2int","bitMask","hash","randomBytes","sign","createHmacDrbg","verify","r","Hash","hash","toBytes","exists","bytes","hash","concatBytes","randomBytes","bytes","bytesToNumberBE","hexToBytes","ensureBytes","bytesToHex","bytes","bytesToHex","ensureBytes","concatBytes","numberToVarBytesBE","hexToNumber","bytesToNumberBE","bitMask","keccak_256","Fp","utf8ToBytes","poseidon","validateOpts","_0n","_1n","_2n","_3n","_4n","_5n","_8n","_9n","_16n","mod","pow","pow2","invert","number","gcd","tonelliShanks","Fp","FpSqrt","FIELD_FIELDS","validateField","map","FpPow","_0n","_1n","FpInvertBatch","nLength","nBitLength","Field","bitLen","isLE","_0n","FpSqrt","_1n","mod","FpPow","invert","FpInvertBatch","bytes","getFieldBytesLength","getMinHashLength","mapHashToField","isLE","mod","_1n","validateOpts","Fp","validateField","rc","FpPow","poseidon","i","poseidonHash","DER","weierstrass","weierstrassPoints","_0n","_1n","wNAF","base","window","validateBasic","curve","validateField","nLength","validatePointOpts","curve","validateBasic","Fp","b2n","h2b","DER","DERErr","s","_0n","_1n","_2n","_3n","_4n","weierstrassPoints","CURVE","toBytes","bytes","isBytes","error","mod","Point","a","wNAF","validateOpts","weierstrass","CURVE_ORDER","invert","number","Signature","utils","getMinHashLength","mapHashToField","getPublicKey","getSharedSecret","bits2int","hash","randomBytes","sign","verify","r","tv5","c1","c2","validateField","isInteger","value","INTEGER_REGEX","test","isNumber","NUMBER_REGEX","isSafeNumber","config","num","parseFloat","str","String","v","extractSignificantDigits","s","approx","requiredDigits","length","startsWith","substring","UnsafeNumberReason","getUnsafeNumberReason","undefined","truncate_integer","isFinite","overflow","underflow","truncate_float","extractSignificantDigits","value","replace","EXPONENTIAL_PART_REGEX","DOT_REGEX","TRAILING_ZEROS_REGEX","LEADING_MINUS_AND_ZEROS_REGEX","LosslessNumber","isLosslessNumber","constructor","value","isNumber","Error","valueOf","unsafeReason","getUnsafeNumberReason","undefined","UnsafeNumberReason","truncate_float","parseFloat","isInteger","BigInt","toString","parseLosslessNumber","value","LosslessNumber","parseNumberAndBigInt","isInteger","BigInt","parseFloat","revive","json","reviver","reviveValue","context","key","value","Array","isArray","call","reviveArray","isLosslessNumber","reviveObject","object","Object","keys","forEach","undefined","array","i","length","parse","text","reviver","parseNumber","arguments","length","undefined","parseLosslessNumber","i","value","parseValue","expectValue","expectEndOfInput","revive","parseObject","charCodeAt","codeOpeningBrace","skipWhitespace","object","initial","codeClosingBrace","eatComma","start","key","parseString","throwObjectKeyExpected","eatColon","throwObjectValueExpected","Object","prototype","hasOwnProperty","call","isDeepEqual","throwDuplicateKey","throwObjectKeyOrEndExpected","parseArray","codeOpeningBracket","array","codeClosingBracket","expectArrayItem","push","throwArrayItemOrEndExpected","parseNumeric","parseKeyword","name","slice","isWhitespace","codeDoubleQuote","result","codeBackslash","char","escapeChar","escapeCharacters","isHex","String","fromCharCode","parseInt","throwInvalidUnicodeCharacter","throwInvalidEscapeCharacter","isValidStringCharacter","throwInvalidCharacter","expectEndOfString","codeMinus","expectDigit","codeZero","isNonZeroDigit","isDigit","codeDot","codeLowercaseE","codeUppercaseE","codePlus","codeComma","SyntaxError","gotAt","codeColon","numSoFar","pos","chars","got","code","codeSpace","codeNewline","codeTab","codeReturn","codeNine","codeUppercaseA","codeUppercaseF","codeLowercaseA","codeLowercaseF","codeOne","a","b","Array","isArray","every","item","index","isObject","keys","Set","f","n","r","t","stringify","value","replacer","space","numberStringifiers","resolvedSpace","resolveSpace","replacedValue","call","stringifyValue","indent","Array","isArray","stringifier","find","item","test","str","isNumber","Error","Date","Boolean","Number","String","JSON","isLosslessNumber","toString","stringifyArray","stringifyObject","undefined","array","length","childIndent","i","object","toJSON","keys","map","Object","first","forEach","key","includeProperty","keyStr","repeat","setBigUint64","isLE","_32n","Chi","Maj","SHA256_K","SHA256_W","SHA256","Chi","Maj","sha256","SHA256","HMAC","hash","hmac","getHash","hash","hmac","concatBytes","weierstrass","_1n","_2n","_3n","pow2","Field","mod","sha256","_0n","protoChain","base","decorators","__export","MASK_250","api_exports","EBlockTag","EDAMode","EDataAvailabilityMode","ESimulationFlag","ETransactionExecutionStatus","ETransactionFinalityStatus","ETransactionStatus","ETransactionType","ETransactionVersion","ETransactionVersion2","ETransactionVersion3","errors_exports","components_exports","padding","BaseUrl","NetworkName","StarknetChainId","TransactionHashPrefix","FeeMarginPercentage","__export","api_exports","ValidateType","Uint","Literal","EntryPointType","TransactionType","TransactionStatus","TransactionFinalityStatus","TransactionExecutionStatus","BlockStatus","BlockTag","hexToBytes","isHex","isNumber","number","hash","MASK_250","error","CairoOptionVariant","CairoResultVariant","listTypeVariant","parsedParameter","parseBaseTypes","output","calculateDeclareTransactionHash","calculateDeployAccountTransactionHash","calculateInvokeTransactionHash","computeHashOnElements","esm_exports","calculateTransactionHashCommon","parse","stringify","poseidonHashMany","json","base","base64","__export","isomorphicFetch","stringify","parse","isHex","isNumber","api_exports","unique","error","RpcChannel","defaultOptions","hexToBytes","StarknetIdContract","StarknetIdIdentityContract","StarknetIdVerifierContract","StarknetIdPfpContract","StarknetIdPopContract","StarknetIdMulticallContract","RpcProvider","__export","isHex","__export","uint256","__export","isObject","output","__export","chain","buildCall","config","config","e","StarknetChainId","config","mergeProcessResults","StarknetChainId"]}